@misc{332, author = {{Lange, Maximilian}}, publisher = {{Universität Paderborn}}, title = {{{Was tun um Kunden von der Qualität seiner Produkte zu überzeugen - Möglichkeiten der Zertifizierung und von Reputationssystemen auf Onlinemärkten}}}, year = {{2014}}, } @misc{333, author = {{Osterbrink, Sebastian}}, publisher = {{Universität Paderborn}}, title = {{{Visualisierung von SMT-Solver-Ausgaben}}}, year = {{2014}}, } @misc{334, author = {{Wagener, Peter}}, publisher = {{Universität Paderborn}}, title = {{{Vertical Thread Migration in FPGA based Sound Localization}}}, year = {{2014}}, } @inproceedings{336, abstract = {{Today, service compositions often need to be assembled or changed on-the-fly, which leaves only little time for quality assurance. Moreover, quality assurance is complicated by service providers only giving information on their services in terms of domain specific concepts with only limited semantic meaning. In this paper, we propose a method to construct service compositions based on pre-verifiedtemplates. Templates, given as workflow descriptions, are typed over a (domain-independent) template ontology defining concepts and predicates. Templates are proven correct using an abstract semantics, leaving the specific meaning of ontology concepts open, however, only up to given ontology rules. Construction of service compositions amounts to instantiation of templates with domain-specific services.Correctness of an instantiation can then simply be checked by verifying that the domain ontology(a) adheres to the rules of the template ontology, and (b) fulfills the constraints of the employed template.}}, author = {{Walther, Sven and Wehrheim, Heike}}, booktitle = {{Proceedings of the 11th International Symposium on Formal Aspects of Component Software (FACS)}}, editor = {{Lanese, Ivan and Madelaine, Eric}}, pages = {{31--48}}, title = {{{Verified Service Compositions by Template-Based Construction}}}, doi = {{10.1007/978-3-319-15317-9_3}}, year = {{2014}}, } @misc{337, author = {{Berkemeier, Christopher}}, publisher = {{Universität Paderborn}}, title = {{{Verhandlungen vs Auktionen im Beschäftigungsmanagement}}}, year = {{2014}}, } @misc{338, author = {{Beck, Henri}}, publisher = {{Universität Paderborn}}, title = {{{Verhandlungen bei variablem status quo: Eine Modifikation des Adjustet Winner Verfahrens}}}, year = {{2014}}, } @book{3389, abstract = {{Dieses Lehr- und Arbeitsbuch präsentiert Ihnen die wichtigsten Grundlagen der Unternehmensfinanzierung auf dem neuesten fachlichen Stand. Der perfekte Einstieg in ein zentrales finanzwirtschaftliches Fach- und Praxisgebiet – mit vielen Beispielen und Übungen. }}, author = {{Gräfer, Horst and Schiller, Bettina and Rösner, Sabrina}}, isbn = {{978-3-503-15666-5}}, keywords = {{Management, Wirtschaft}}, pages = {{405}}, publisher = {{Erich Schmidt Verlag}}, title = {{{Finanzierung - Grundlagen, Institutionen, Instrumente und Kapitalmarkttheorie}}}, volume = {{8}}, year = {{2014}}, } @inproceedings{339, abstract = {{Preemptive Routing and Wavelength Assignment (RWA) algorithms preempt established lightpaths in case notenough resources are available to set up a new lightpath in aWavelength Division Multiplexing (WDM) network. The selectionof lightpaths to be preempted relies on internal decisions of theRWA algorithm. Thus, if dedicated properties of the networktopology are required by the applications running on the network,these requirements have to be known to the RWA algorithm.We present a family of preemptive RWA algorithms for WDMnetworks. These algorithms have two distinguishing features: a)they can handle dynamic traffic by on-the-fly reconfiguration,and b) users can give feedback for reconfiguration decisions andthus influence the preemption decision of the RWA algorithm,leading to networks which adapt directly to application needs.This is different from traffic engineering where the network is(slowly) adapted to observed traffic patterns.Our algorithms handle various WDM network configurationsincluding networks consisting of heterogeneous WDM hardware.To this end, we are using the layered graph approach togetherwith a newly developed graph model that is used to determineconflicting lightpaths.}}, author = {{Wette, Philip and Karl, Holger}}, booktitle = {{Proceedings of the IEEE International Conference on Communications 2014}}, pages = {{3270--3276}}, title = {{{Using Application Layer Knowledge in Routing and Wavelength Assignment Algorithms}}}, doi = {{10.1109/ICC.2014.6883825}}, year = {{2014}}, } @misc{340, author = {{Korth, Philipp}}, publisher = {{Universität Paderborn}}, title = {{{Untersuchung transitiver Eigenschaften der Technik "Programs from Proofs"}}}, year = {{2014}}, } @misc{341, author = {{Fang Cheng, Terry}}, publisher = {{Universität Paderborn}}, title = {{{Two-Sided Market and Game Console Vendors}}}, year = {{2014}}, } @misc{342, author = {{Klauke, Christoph}}, publisher = {{Universität Paderborn}}, title = {{{Transformation graphischer Protokollspezifikationen in Model-Checker-Anfragen}}}, year = {{2014}}, } @phdthesis{343, author = {{Künsemöller, Jörn}}, publisher = {{Universität Paderborn}}, title = {{{Tragedy of the Common Cloud - Game Theory on the Infrastructure-as-a-Service Market}}}, year = {{2014}}, } @inproceedings{3439, author = {{Klör, Benjamin and Bräuer, Sebastian and Beverungen, Daniel and Matzner, Martin}}, booktitle = {{Proceedings of the Multikonferenz Wirtschaftsinformatik 2014 (MKWI 2014)}}, location = {{Paderborn}}, pages = {{2047----2066}}, title = {{{IT-basierte Dienstleistungen für die Elektromobilität --- Konzeptioneller Rahmen und Literaturanalyse}}}, year = {{2014}}, } @inproceedings{344, author = {{Becker, Matthias and Becker, Steffen and Besova, Galina and Walther, Sven and Wehrheim, Heike}}, booktitle = {{Proceedings of the 40th Euromicro Conference on Software Engineering and Advanced Applications (Work in Progress Session)}}, title = {{{Towards Systematic Configuration for Architecture Validation}}}, year = {{2014}}, } @inproceedings{345, abstract = {{Automatically composing service-based software solutions is a challenging task. Considering context information during this service composition process is even more challenging. In domains such as image processing, however, context-sensitivity is inherent and cannot be ignored when developing techniques for automatic service composition. Formal approaches tend to create ambiguous solutions, whenever the expressive power of the applied formalism is limited. For example, services may have the same formal specification, although their actual functionality depends on the concrete context. In order to satisfy individual user requests while providing data-dependent functionality, formal approaches have to be extended. We propose to incorporate Reinforcement Learning techniques and combine them with planning based composition approaches. While planning ensures formally correct solutions, learning enables the composition process to resolve ambiguity by implicitly considering context information. Preliminary results show that our combined approach adapts to a static context while still satisfying formally specified requirements.}}, author = {{Jungmann, Alexander and Kleinjohann, Bernd}}, booktitle = {{Proceedings of the 6th International Conference on Cloud Computing Technology and Science (CloudCom)}}, pages = {{755--758}}, title = {{{Towards Context-Sensitive Service Composition for Service-Oriented Image Processing}}}, doi = {{10.1109/CloudCom.2014.154}}, year = {{2014}}, } @inproceedings{346, abstract = {{One future goal of service-oriented computing is to realize global markets of composed services. On such markets, service providers offer services that can be flexibly combined with each other. However, most often, market participants are not able to individually estimate the quality of traded services in advance. As a consequence, even potentially profitable transactions between customers and providers might not take place. In the worst case, this can induce a market failure. To overcome this problem, we propose the incorporation of reputation information as an indicator for expected service quality. We address On-The-Fly Computing as a representative environment of markets of composed services. In this environment, customers provide feedback on transactions. We present a conceptual design of a reputation system which collects and processes user feedback, and provides it to participants in the market. Our contribution includes the identification of requirements for such a reputation system from a technical and an economic perspective. Based on these requirements, we propose a flexible solution that facilitates the incorporation of reputation information into markets of composed services while simultaneously preserving privacy of customers who provide feedback. The requirements we formulate in this paper have just been partially met in literature. An integrated approach, however, has not been addressed yet.}}, author = {{Brangewitz, Sonja and Jungmann, Alexander and Petrlic, Ronald and Platenius, Marie Christin}}, booktitle = {{Proceedings of the 6th International Conferences on Advanced Service Computing (SERVICE COMPUTATION)}}, pages = {{49--57}}, title = {{{Towards a Flexible and Privacy-Preserving Reputation System for Markets of Composed Services}}}, year = {{2014}}, } @inproceedings{347, abstract = {{Dynamic thread duplication is a known redundancy technique for multi-cores. The approach duplicates a thread under observation for some time period and compares the signatures of the two threads to detect errors. Hybrid multi-cores, typically implemented on platform FPGAs, enable the unique option of running the thread under observation and its copy in different modalities, i.e., software and hardware. We denote our dynamic redundancy technique on hybrid multi-cores as thread shadowing. In this paper we present the concept of thread shadowing and an implementation on a multi-threaded hybrid multi-core architecture. We report on experiments with a block-processing application and demonstrate the overheads, detection latencies and coverage for a range of thread shadowing modes. The results show that trans-modal thread shadowing, although bearing long detection latencies, offers attractive coverage at a low overhead.}}, author = {{Meisner, Sebastian and Platzner, Marco}}, booktitle = {{Proceedings of the 10th International Symposium on Applied Reconfigurable Computing (ARC)}}, editor = {{Goehringer, Diana and Santambrogio, MarcoDomenico and Cardoso, JoãoM.P. and Bertels, Koen}}, pages = {{283--290}}, publisher = {{Springer}}, title = {{{Thread Shadowing: Using Dynamic Redundancy on Hybrid Multi-cores for Error Detection}}}, doi = {{10.1007/978-3-319-05960-0_30}}, year = {{2014}}, } @misc{348, author = {{Rüthing, Christoph}}, publisher = {{Universität Paderborn}}, title = {{{The Xilinx Zynq Architecture as a Platform for Reconfigurable Heterogeneous Multi-Cores}}}, year = {{2014}}, } @techreport{349, abstract = {{Identity-based cryptography has attracted attention in the cryptographic research communityin recent years. Despite the importance of cryptographic schemes for applicationsin business and law, the legal implications of identity-based cryptography have not yetbeen discussed. We investigate how identity-based signatures fit into the legal framework.We focus on the European Signature Directive, but also take the UNCITRAL Model Law onElectronic Signatures into account. In contrast to previous assumptions, identity-basedsignature schemes can, in principle, be used even for qualified electronic signatures,which can replace handwritten signatures in the member states of the European Union.We derive requirements to be taken into account in the development of future identitybasedsignature schemes.}}, author = {{Sorge, Christoph}}, title = {{{The Legal Classification of Identity-Based Signatures}}}, year = {{2014}}, } @article{3491, author = {{Becker, Jörg and Beverungen, Daniel and Knackstedt, Ralf and Peter Rauer, Hans and Sigge, Daniel}}, journal = {{Information Systems and e-Business Management}}, number = {{3}}, pages = {{337----365}}, title = {{{On the Ontological Expressiveness of Conceptual Modeling Grammars for Service Productivity Management}}}, doi = {{10.1007/s10257-013-0219-y}}, year = {{2014}}, }