@inproceedings{3126, author = {{Bader, Christoph and Hofheinz, Dennis and Jager, Tibor and Kiltz, Eike and Li, Yong}}, booktitle = {{Theory of Cryptography - 12th Theory of Cryptography Conference, TCC 2015, Warsaw, Poland, March 23-25, 2015, Proceedings, Part I}}, pages = {{629----658}}, title = {{{Tightly-Secure Authenticated Key Exchange}}}, doi = {{10.1007/978-3-662-46494-6_26}}, year = {{2015}}, } @inproceedings{313, abstract = {{Nowadays, many service providers offer software components in the form of Software as a Service. Requesters that want to discover those services in order to use or to integrate them, need to find out which service satisfies their requirements best. For this purpose, service matching approaches determine how well the specifications of provided services satisfy their requirements (including structural, behavioral, and non-functional requirements). In this paper, we describe the tool-suite MatchBox that allows the integration of existing service matchers and their combination as part of flexibly configurable matching processes. Taking requirements and service specifications as an input, MatchBox is able to execute such matching processes and deliver rich matching results. In contrast to related tools, MatchBox allows users to take into account many different kinds of requirements, while it also provides the flexibility to control the matching process in many different ways. }}, author = {{Börding, Paul and Bruns, Melanie and Platenius, Marie Christin}}, booktitle = {{10th Joint Meeting of the European Software Engineering Conference and the ACM SIGSOFT Symposium on the Foundations of Software Engineering (ESEC/FSE'15)}}, pages = {{974----977}}, title = {{{Comprehensive Service Matching with MatchBox}}}, doi = {{10.1145/2786805.2803181}}, year = {{2015}}, } @misc{316, author = {{Pautz, Jannis}}, publisher = {{Universität Paderborn}}, title = {{{Budget Games with priced strategies}}}, year = {{2015}}, } @article{3162, author = {{Ziegert, Steffen and Wehrheim, Heike}}, journal = {{Computer Science - R & D}}, number = {{3-4}}, pages = {{303----320}}, title = {{{Temporal plans for software architecture reconfiguration}}}, doi = {{10.1007/s00450-014-0259-7}}, year = {{2015}}, } @inproceedings{3163, author = {{Meyer, Roland and Wehrheim, Heike}}, booktitle = {{Correct System Design - Symposium in Honor of Ernst-R{\"{u}}diger Olderog on the Occasion of His 60th Birthday, Oldenburg, Germany, September 8-9, 2015. Proceedings}}, editor = {{Meyer, Roland and Platzer, Andr{\'{e}} and Wehrheim, Heike}}, pages = {{3----4}}, title = {{{From Program Verification to Time and Space: The Scientific Life of Ernst-R{\"{u}}diger Olderog}}}, doi = {{10.1007/978-3-319-23506-6_1}}, year = {{2015}}, } @inproceedings{3164, author = {{Derrick, John and Dongol, Brijesh and Schellhorn, Gerhard and Travkin, Oleg and Wehrheim, Heike}}, booktitle = {{{FM} 2015: Formal Methods - 20th International Symposium, Oslo, Norway, June 24-26, 2015, Proceedings}}, editor = {{Bj{\o}rner, Nikolaj and S. de Boer, Frank}}, pages = {{161----177}}, title = {{{Verifying Opacity of a Transactional Mutex Lock}}}, doi = {{10.1007/978-3-319-19249-9_11}}, year = {{2015}}, } @inproceedings{3165, author = {{Wehrheim, Heike and Travkin, Oleg}}, booktitle = {{Hardware and Software: Verification and Testing - 11th International Haifa Verification Conference, {HVC} 2015, Haifa, Israel, November 17-19, 2015, Proceedings}}, editor = {{Piterman, Nir}}, pages = {{104----119}}, title = {{{{TSO} to {SC} via Symbolic Execution}}}, doi = {{10.1007/978-3-319-26287-1_7}}, year = {{2015}}, } @proceedings{3166, editor = {{Meyer, Roland and Platzer, Andr{\'{e}} and Wehrheim, Heike}}, isbn = {{978-3-319-23505-9}}, title = {{{Correct System Design - Symposium in Honor of Ernst-R{\"{u}}diger Olderog on the Occasion of His 60th Birthday, Oldenburg, Germany, September 8-9, 2015. Proceedings}}}, doi = {{10.1007/978-3-319-23506-6}}, year = {{2015}}, } @phdthesis{317, author = {{Jähn, Claudius}}, publisher = {{Universität Paderborn}}, title = {{{Bewertung von Renderingalgorithmen für komplexe 3-D-Szenen}}}, year = {{2015}}, } @phdthesis{318, author = {{Huma, Zille}}, publisher = {{Universität Paderborn}}, title = {{{Automatic Service Discovery and Composition for heterogeneous service partners}}}, year = {{2015}}, } @inproceedings{319, abstract = {{Services are self-contained and platform independent software components that aim at maximizing software reuse. The automated composition of services to a target software artifact has been tackled with many AI techniques, but existing approaches make unreasonably strong assumptions such as a predefined data flow, are limited to tiny problem sizes, ignore non-functional properties, or assume offline service repositories. This paper presents an algorithm that automatically composes services without making such assumptions. We employ a backward search algorithm that starts from an empty composition and prepends service calls to already discovered candidates until a solution is found. Available services are determined during the search process. We implemented our algorithm, performed an experimental evaluation, and compared it to other approaches.}}, author = {{Mohr, Felix and Jungmann, Alexander and Kleine Büning, Hans}}, booktitle = {{Proceedings of the 12th IEEE International Conference on Services Computing (SCC)}}, pages = {{57----64}}, title = {{{Automated Online Service Composition}}}, doi = {{10.1109/SCC.2015.18}}, year = {{2015}}, } @phdthesis{270, author = {{Abshoff, Sebastian}}, publisher = {{Universität Paderborn}}, title = {{{On the Complexity of Fundamental Problems in Dynamic Ad-hoc Networks}}}, year = {{2015}}, } @inproceedings{271, abstract = {{In \emph{bandwidth allocation games} (BAGs), the strategy of a player consists of various demands on different resources. The player's utility is at most the sum of these demands, provided they are fully satisfied. Every resource has a limited capacity and if it is exceeded by the total demand, it has to be split between the players. Since these games generally do not have pure Nash equilibria, we consider approximate pure Nash equilibria, in which no player can improve her utility by more than some fixed factor $\alpha$ through unilateral strategy changes. There is a threshold $\alpha_\delta$ (where $\delta$ is a parameter that limits the demand of each player on a specific resource) such that $\alpha$-approximate pure Nash equilibria always exist for $\alpha \geq \alpha_\delta$, but not for $\alpha < \alpha_\delta$. We give both upper and lower bounds on this threshold $\alpha_\delta$ and show that the corresponding decision problem is ${\sf NP}$-hard. We also show that the $\alpha$-approximate price of anarchy for BAGs is $\alpha+1$. For a restricted version of the game, where demands of players only differ slightly from each other (e.g. symmetric games), we show that approximate Nash equilibria can be reached (and thus also be computed) in polynomial time using the best-response dynamic. Finally, we show that a broader class of utility-maximization games (which includes BAGs) converges quickly towards states whose social welfare is close to the optimum.}}, author = {{Drees, Maximilian and Feldotto, Matthias and Riechers, Sören and Skopalik, Alexander}}, booktitle = {{Proceedings of the 8th International Symposium on Algorithmic Game Theory (SAGT)}}, pages = {{178--189}}, title = {{{On Existence and Properties of Approximate Pure Nash Equilibria in Bandwidth Allocation Games}}}, doi = {{10.1007/978-3-662-48433-3_14}}, year = {{2015}}, } @inproceedings{27163, author = {{Keil, Reinhard and Selke, Harald}}, editor = {{Keil, Reinhard and Selke, Harald}}, pages = {{39--53}}, publisher = {{publishing series of the Heinz Nixdorf Institute, Paderborn}}, title = {{{Virtual knowledge {\ "a} ume - From the presentation of content to virtual learning {\" a} tten}}}, volume = {{330}}, year = {{2015}}, } @phdthesis{27164, author = {{Klompmaker, Florian}}, publisher = {{Universitaetsbibliothek Paderborn}}, title = {{{Development of a structured process of interaction design for {\ "u} r nat {\" u} local user interfaces}}}, year = {{2015}}, } @inproceedings{27165, abstract = {{Patterns serve to codify design knowledge. By embedding them in a hypothesis-driven design, it is possible to develop them further into sample languages. For this it is necessary to resolve the underlying conflicts in the form of design hypotheses and to validate them empirically in order to enable further use and generalization. In this article, an experiment is presented that describes this procedure and demonstrates the interplay between theory formation and codification of design knowledge using two examples.}}, author = {{Schild, Christian and Petrausch, Vanessa}}, pages = {{173--182}}, publisher = {{De Gruyter Oldenbourg}}, title = {{{Empirical validation of design patterns }}}, year = {{2015}}, } @misc{273, author = {{Kohn, Kathlén}}, publisher = {{Universität Paderborn}}, title = {{{Number of Voronoi-relevant vectors in lattices with respect to arbitrary norms}}}, year = {{2015}}, } @inproceedings{274, abstract = {{Consider the problem in which n jobs that are classified into k types are to be scheduled on m identical machines without preemption. A machine requires a proper setup taking s time units before processing jobs of a given type. The objective is to minimize the makespan of the resulting schedule. We design and analyze an approximation algorithm that runs in time polynomial in n,m and k and computes a solution with an approximation factor that can be made arbitrarily close to 3/2.}}, author = {{Mäcker, Alexander and Malatyali, Manuel and Meyer auf der Heide, Friedhelm and Riechers, Sören}}, booktitle = {{Algorithms and Data Structures: 14th International Symposium, WADS 2015, Victoria, BC, Canada, August 5-7, 2015. Proceedings}}, editor = {{Dehne, Frank and Sack, Jörg Rüdiger and Stege, Ulrike}}, pages = {{542----553}}, title = {{{Non-preemptive Scheduling on Machines with Setup Times}}}, doi = {{10.1007/978-3-319-21840-3_45}}, year = {{2015}}, } @inproceedings{275, abstract = {{We investigate a non-cooperative game-theoretic model for the formation of communication networks by selfish agents. Each agent aims for a central position at minimum cost for creating edges. In particular, the general model (Fabrikant et al., PODC'03) became popular for studying the structure of the Internet or social networks. Despite its significance, locality in this game was first studied only recently (Bilò et al., SPAA'14), where a worst case locality model was presented, which came with a high efficiency loss in terms of quality of equilibria. Our main contribution is a new and more optimistic view on locality: agents are limited in their knowledge and actions to their local view ranges, but can probe different strategies and finally choose the best. We study the influence of our locality notion on the hardness of computing best responses, convergence to equilibria, and quality of equilibria. Moreover, we compare the strength of local versus non-local strategy changes. Our results address the gap between the original model and the worst case locality variant. On the bright side, our efficiency results are in line with observations from the original model, yet we have a non-constant lower bound on the Price of Anarchy.}}, author = {{Cord-Landwehr, Andreas and Lenzner, Pascal}}, booktitle = {{Proceedings of the 40th Conference on Mathematical Foundations of Computer Science (MFCS)}}, pages = {{248----260}}, title = {{{Network Creation Games: Think Global - Act Local}}}, doi = {{10.1007/978-3-662-48054-0_21}}, year = {{2015}}, } @misc{277, author = {{Kothe, Nils}}, publisher = {{Universität Paderborn}}, title = {{{Multilevel Netzwerk Spiele mit konstanten Entfernungen im Highspeed-Netzwerk}}}, year = {{2015}}, }