@inproceedings{483, abstract = {{Modern software systems adapt themselves to changing environments, to meet quality-of-service requirements, such as response time limits. The engineering of the system’s self-adaptation logic does not only require new modeling methods, but also new analyzes of transient phases. Model-driven software performance engineering methods already allow design-time analysis of steady states of non-adaptive system models. In order to validate requirements for transient phases, new modeling and analysis methods are needed. In this paper, we present SimuLizar, our initial model-driven approach to model self-adaptive systems and analyze the performance of their transient phases. Our evaluation of a load balancer toy example shows the applicability of our modeling approach. Additionally, a comparison of our performance analysis with a prototypical implementation of our example system shows that the prediction accuracy is sufficient to identify unsatisfactory self-adaptations.}}, author = {{Becker, Matthias and Becker, Steffen and Meyer, Joachim}}, booktitle = {{Proceedings of the Software Engineering Conference (SE)}}, pages = {{71--84}}, title = {{{SimuLizar: Design-Time modeling and Performance Analysis of Self-Adaptive Systems}}}, year = {{2013}}, } @inproceedings{484, abstract = {{One of the main ideas of Service-Oriented Computing (SOC) is the delivery of flexibly composable services provided on world-wide markets. For a successful service discovery,service requests have to be matched with the available service offers. However, in a situation in which no service that completely matches the request can be discovered, the customer may tolerate slight discrepancies between request and offer. Some existing fuzzy matching approaches are able to detectsuch service variants, but they do not allow to explicitly specify which parts of a request are not mandatory. In this paper, we improve an existing service matching approach based onVisual Contracts leveraging our preliminary work of design pattern detection. Thereby, we support explicit specifications of service variants and realize gradual matching results that can be ranked in order to discover the service offer that matches a customer’s request best.}}, author = {{Platenius, Marie Christin and von Detten, Markus and Gerth, Christian and Schäfer, Wilhelm and Engels, Gregor}}, booktitle = {{IEEE 20th International Conference on Web Services (ICWS 2013)}}, pages = {{613--614}}, title = {{{Service Matching under Consideration of Explicitly Specified Service Variants}}}, doi = {{10.1109/ICWS.2013.98}}, year = {{2013}}, } @inproceedings{485, abstract = {{Software composition has been studied as a subject of state based planning for decades. Existing composition approaches that are efficient enough to be used in practice are limited to sequential arrangements of software components. This restriction dramatically reduces the number of composition problems that can be solved. However, there are many composition problems that could be solved by existing approaches if they had a possibility to combine components in very simple non-sequential ways. To this end, we present an approach that arranges not only basic components but also composite components. Composite components enhance the structure of the composition by conditional control flows. Through algorithms that are written by experts, composite components are automatically generated before the composition process starts. Therefore, our approach is not a substitute for existing composition algorithms but complements them with a preprocessing step. We verified the validity of our approach through implementation of the presented algorithms.}}, author = {{Mohr, Felix and Kleine Büning, Hans}}, booktitle = {{Proceedings of the 15th International Conference on Information Integration and Web-based Applications & Services (iiWAS)}}, pages = {{676--680}}, title = {{{Semi-Automated Software Composition Through Generated Components}}}, doi = {{10.1145/2539150.2539235}}, year = {{2013}}, } @article{4851, author = {{Garnefeld, Ina and Eggert, Andreas and Helm, Sabrina V and Tax, Stephen S}}, journal = {{Journal of Marketing}}, number = {{4}}, pages = {{17----32}}, title = {{{Growing existing customers' revenue streams through customer referral programs}}}, year = {{2013}}, } @article{4852, author = {{Haas, Alexander and Eggert, Andreas and Terho, Harri and Ulaga, Wolfgang}}, journal = {{Marketing Review St. Gallen}}, number = {{4}}, pages = {{64----73}}, title = {{{Erfolgsfaktor Value-Based Selling—Verkaufen, wenn Kundenorientierung nicht zum Erfolg führt}}}, year = {{2013}}, } @misc{486, author = {{Otte, Oliver}}, publisher = {{Universität Paderborn}}, title = {{{Seitenkanalresistenz paarungsbasierter Kryptographie}}}, year = {{2013}}, } @misc{487, author = {{Bobolz, Jan}}, publisher = {{Universität Paderborn}}, title = {{{Security Proofs for Pairing-Based Cryptography in the Generic Group Model}}}, year = {{2013}}, } @inproceedings{488, abstract = {{Unattended systems are key ingredients of various critical infrastruc-tures like networks of self service terminals or automated teller machines.For cost and efficiency reasons they should mostly run autonomously.Unattended systems are attractive and lucrative targets for various kindsof attacks, including attacks on the integrity of their components and thecommunication between components. In this paper, we propose a gen-eral cryptographic framework to protect unattended systems. We alsodemonstrate that instantiating the framework with techniques from iden-tity based cryptography is particularly well-suited to efficiently secureunattended systems.}}, author = {{Blömer, Johannes and Günther, Peter and Krummel, Volker}}, booktitle = {{Proceedings of the 5th International Conference on Mathematical Aspects of Computer and Information Sciences (MACIS)}}, pages = {{98--105}}, title = {{{Securing Critical Unattended Systems with Identity Based Cryptography - A Case Study}}}, year = {{2013}}, } @article{4880, author = {{St{\, Susi and Fahr, Rene}}, journal = {{Applied Economics}}, number = {{19}}, pages = {{2863----2875}}, title = {{{Individual determinants of work attendance: Evidence on the role of personality}}}, year = {{2013}}, } @misc{489, author = {{Knopf, Michael}}, publisher = {{Universität Paderborn}}, title = {{{Scheduling Variants with Speed-Scaling via the Primal-Dual Approach}}}, year = {{2013}}, } @misc{490, author = {{Wallaschek, Felix}}, publisher = {{Universität Paderborn}}, title = {{{Routing in heterogenen OpenFlow Netzwerken}}}, year = {{2013}}, } @book{4911, author = {{Zimmermann, Klaus F and Bauer, Thomas K and Bonin, Holger and Fahr, Rene and Hinte, Holger}}, title = {{{Arbeitskräftebedarf bei hoher Arbeitslosigkeit: ein ökonomisches Zuwanderungskonzept für Deutschland}}}, year = {{2013}}, } @techreport{4915, author = {{Mir Djawadi, Behnud and Fahr, Rene}}, title = {{{The impact of risk perception and risk attitudes on corrupt behavior: Evidence from a petty corruption experiment}}}, year = {{2013}}, } @techreport{4917, author = {{Djawadi, Behnud Mir and Fahr, Rene}}, title = {{{The impact of tax knowledge and budget spending influence on tax compliance}}}, year = {{2013}}, } @misc{492, author = {{Robbert, Christoph}}, publisher = {{Universität Paderborn}}, title = {{{Ressource-Optimized Deployment of Multi-Tier Applications - The Data Rate-Constrained Case}}}, year = {{2013}}, } @misc{493, author = {{Terentjew, Artjom}}, publisher = {{Universität Paderborn}}, title = {{{Reputationssysteme und Gerichtsverfahren als Wekzeuge zur Sicherstellung von Qualitätsstandards in Transaktionen}}}, year = {{2013}}, } @phdthesis{494, abstract = {{The maintenance of component-based software systems requires up-to-date models of their concrete architecture, i.e. the architecture that is realised in the source code. These models help in systematically planning, analysing and executing typical reengineering activities. Often no or only outdated architectural models of such systems exist. Therefore, various reverse engineering methods have been developed which try to recover a system's components, subsystems and connectors. However, these reverse engineering methods are severely impacted by design deciencies in the system's code base, especially violations of the component encapsulation. As long as design deciencies are not considered in the reverse engineering process, they reduce the quality of the recovered component structures. Despite this impact of design deciencies, no existing architecture reconstruction approach explicitly integrates a systematic deciency detection and removal into the recovery process. Therefore, I have developed Archimetrix. Archimetrix is a tool-supported architecture reconstruction process. It enhances a clustering-based architecture recovery approach with an extensible, pattern-based deciency detection. After the detection of deciencies, Archimetrix supports the software architect in removing the de ciencies and provides the means to preview the architectural consequences of such a removal. I also provide a process to identify and formalise additional deciencies. I validated the approach on three case studies which show that Archimetrix is able to identify relevant deciencies and that the removal of these deciencies leads to an increased quality of the recovered architectures, i.e. they are closer to the corresponding conceptual architectures.}}, author = {{von Detten, Markus}}, publisher = {{Universität Paderborn}}, title = {{{Reengineering of Component-Based Software Systems in the Presence of Design Deficiencies}}}, year = {{2013}}, } @inproceedings{495, abstract = {{Automated service composition has been studied as a subject of state based planning for a decade. A great deal of service composition tasks can only be solved if concrete output values of the services are considered in the composition process. However, the fact that those values are not known before runtime leads to nondeterministic planning problems, which have proven to be notoriously difficult in practical automated service composition applications. Even though this problem is frequently recognized, it has still received remarkably few attention and remains unsolved.This paper shows how nondeterminism in automated service composition can be reduced. We introduce context rules as a means to derive semantic knowledge from output values of services. These rules enable us to replace nondeterministic composition operations by less nondeterministic or even completely deterministic ones. We show the validity of our solutions not only theoretically but also have evaluated them practically through implementation.}}, author = {{Mohr, Felix and Lettmann, Theodor and Kleine Büning, Hans}}, booktitle = {{Proceedings of the 6th International Conference on Service Oriented Computing and Applications (SOCA)}}, pages = {{154--161}}, title = {{{Reducing Nondeterminism in Automated Service Composition}}}, doi = {{10.1109/SOCA.2013.25}}, year = {{2013}}, } @inproceedings{496, abstract = {{Within reactive topology control, a node determines its adjacent edges of a network subgraph without prior knowledge of its neighborhood. The goal is to construct a local view on a topology which provides certain desired properties such as planarity. During algorithm execution, a node, in general, is not allowed to determine all its neighbors of the network graph. There are well-known reactive algorithms for computing planar subgraphs. However, the subgraphs obtained do not have constant Euclidean spanning ratio. This means that routing along these subgraphs may result in potentially long detours. So far, it has been unknown if planar spanners can be constructed reactively. In this work, we show that at least under the unit disk network model, this is indeed possible, by proposing an algorithm for reactive construction of the partial Delaunay triangulation, which recently turned out to be a spanner. Furthermore, we show that our algorithm is message-optimal as a node will only exchange messages with nodes that are also neighbors in the spanner. The algorithm’s presentation is complemented by a rigorous proof of correctness.}}, author = {{Benter, Markus and Neumann, Florentin and Frey, Hannes}}, booktitle = {{Proceedings of the 32nd IEEE International Conference on Computer Communications (INFOCOM)}}, pages = {{2193--2201}}, title = {{{Reactive Planar Spanner Construction in Wireless Ad Hoc and Sensor Networks}}}, doi = {{10.1109/INFCOM.2013.6567022}}, year = {{2013}}, } @inproceedings{498, abstract = {{Proof-carrying code approaches aim at safe execution of untrusted code by having the code producer attach a safety proof to the code which the code consumer only has to validate. Depending on the type of safety property, proofs can however become quite large and their validation - though faster than their construction - still time consuming. In this paper we introduce a new concept for safe execution of untrusted code. It keeps the idea of putting the time consuming part of proving on the side of the code producer, however, attaches no proofs to code anymore but instead uses the proof to transform the program into an equivalent but more efficiently verifiable program. Code consumers thus still do proving themselves, however, on a computationally inexpensive level only. Experimental results show that the proof effort can be reduced by several orders of magnitude, both with respect to time and space.}}, author = {{Wonisch, Daniel and Schremmer, Alexander and Wehrheim, Heike}}, booktitle = {{Proceedings of the 25th International Conference on Computer Aided Verification (CAV)}}, pages = {{912--927}}, title = {{{Programs from Proofs – A PCC Alternative}}}, doi = {{10.1007/978-3-642-39799-8_65}}, year = {{2013}}, }