@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}}, } @article{27012, author = {{Augustin, L.S.A. and Kendall, C.W.C. and Jenkins, D.J.A. and Willett, W.C. and Astrup, A. and Barclay, A.W. and Björck, I. and Brand-Miller, J.C. and Brighenti, F. and Buyken, Anette and Ceriello, A. and La Vecchia, C. and Livesey, G. and Liu, S. and Riccardi, G. and Rizkalla, S.W. and Sievenpiper, J.L. and Trichopoulou, A. and Wolever, T.M.S. and Baer-Sinnott, S. and Poli, A.}}, issn = {{0939-4753}}, journal = {{Nutrition, Metabolism and Cardiovascular Diseases}}, pages = {{795--815}}, title = {{{Glycemic index, glycemic load and glycemic response: An International Scientific Consensus Summit from the International Carbohydrate Quality Consortium (ICQC)}}}, doi = {{10.1016/j.numecd.2015.05.005}}, year = {{2015}}, } @inproceedings{2702, author = {{Beutner, Marc and Kundisch, Dennis and Magenheim, J. and Rechuel, R.}}, booktitle = {{Proceedings of E-LEARN 2015 - World Conference on E-Learning}}, location = {{Kona, USA}}, title = {{{DUC - Fostering Diversity Aspects in Higher Education by eLearning and User generated Content}}}, year = {{2015}}, } @inproceedings{2703, author = {{Mutter, Tobias and Kundisch, Dennis}}, booktitle = {{Proceedings of the 23rd European Conference on Information Systems (ECIS)}}, location = {{Münster, Germany}}, title = {{{Behavioral Mechanisms Prompted by Virtual Rewards: The Small-Area Hypothesis}}}, year = {{2015}}, } @article{27039, author = {{Libuda, Lars and Mesch, Christina M. and Stimming, Madlen and Demmelmair, Hans and Koletzko, Berthold and Warschburger, Petra and Blanke, Katharina and Reischl, Eva and Kalhoff, Hermann and Kersting, Mathilde}}, issn = {{1436-6207}}, journal = {{European Journal of Nutrition}}, pages = {{1633--1644}}, title = {{{Fatty acid supply with complementary foods and LC-PUFA status in healthy infants: results of a randomised controlled trial}}}, doi = {{10.1007/s00394-015-0982-2}}, year = {{2015}}, } @article{27040, author = {{Schröder, Maike and Müller, Katrin and Falkenstein, Michael and Stehle, Peter and Kersting, Mathilde and Libuda, Lars}}, issn = {{0031-9384}}, journal = {{Physiology & Behavior}}, pages = {{307--314}}, title = {{{Short-term effects of lunch on children's executive cognitive functioning: The randomized crossover Cognition Intervention Study Dortmund PLUS (CogniDo PLUS)}}}, doi = {{10.1016/j.physbeh.2015.09.025}}, year = {{2015}}, } @inproceedings{2705, author = {{Müller, M. and Meier, Christian and Kundisch, Dennis and Zimmermann, Steffen}}, booktitle = {{Wirtschaftsinformatik Proceedings}}, location = {{Osnabrück}}, title = {{{Interactions in IS Project Portfolio Selection: Status Quo and Perspective}}}, year = {{2015}}, } @inproceedings{2706, author = {{John, Thomas and Kundisch, Dennis}}, booktitle = {{Wirtschaftsinformatik Proceedings}}, location = {{Osnabrück}}, title = {{{Creativity Through Cognitive Fit: Theory and Preliminary Evidence in a Business Model Idea Generation Context}}}, 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}}, } @book{27120, author = {{Steinhardt, Isabel}}, isbn = {{978-3-658-08858-3}}, title = {{{Lehre stärkt Forschung: Studiengangentwicklung durch ProfessorInnen im Handlungssystem Universität}}}, 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}}, }