@inproceedings{20971, abstract = {{The growing complexity of today's software intensive systems results in an increased size of requirements specifications, which are typically documented by means of natural language (NL). Large NL requirements specifications are prone to contain defects (e.g., contradictions), and the inherent ambiguity of NL impedes automatic techniques to support the requirements engineer. In order to cope with this problem, we conceived a requirements documentation approach implemented in the tool ReqPat. Using a controlled NL, it supports an efficient requirements documentation, an automatic requirements validation, and an automatic transition to models--while still keeping the requirements understandable for all stakeholders. }}, author = {{Fockel, Markus and Holtmann, Jörg}}, booktitle = {{Proc. of the 23rd International Requirements Engineering Conference 2015 (RE15)}}, publisher = {{IEEE}}, title = {{{ReqPat: Efficient Documentation of High-quality Requirements using Controlled Natural Language}}}, year = {{2015}}, } @inproceedings{20976, abstract = {{Cyber-physical systems (CPSs) provide sophisticated functionality and are controlled by networked electronic control units (ECUs). Nowadays, software engineers use component-based development approaches to develop their software. Moreover, software components have to be allocated to an ECU to be executed. Engineers have to cope with topology-, software-, and timing-dependencies and memory-, scheduling-, and routing-constraints. Currently, engineers use linear programs to specify allocation constraints and to derive a feasible allocation automatically. However, encoding the allocation problem as a linear program is a complex and error-prone task. This paper contributes a model-driven, OCL-based allocation engineering approach for reducing the engineering effort and to avoid failures. We validate our approach with an automotive case study modeled with MechatronicUML. Our validation shows that we can specify allocation constraints with less engineering effort and are able to derive feasible allocations automatically.}}, author = {{Pohlmann, Uwe and Hüwe, Marcus}}, booktitle = {{Conference: 30th IEEE/ACM International Conference on Automated Software Engineering (ASE 2015)}}, publisher = {{IEEE}}, title = {{{Model-Driven Allocation Engineering}}}, year = {{2015}}, } @techreport{20977, author = {{Schäfer, Wilhelm and Dziwok, Stefan and Pohlmann, Uwe and Bobolz, Jan and Czech, Mike and Dann, Andreas Peter and Geismann, Johannes and Hüwe, Marcus and Krieger, Arthur and Piskachev, Goran and Schubert, David and Wohlrab, Rebekka}}, title = {{{Seminar Theses of the Project Group Cybertron}}}, year = {{2015}}, } @inproceedings{20979, author = {{Stockmann, Lars}}, booktitle = {{Proceedings of the Doctoral Symposium of the ACM/IEEE 18th International Conference on Model Driven Engineering Languages and Systems}}, editor = {{Chechik, Marsha and Kolovos, Dimitris}}, title = {{{Debugging Models in the Context of Automotive Software Development}}}, year = {{2015}}, } @article{21036, author = {{Brecht, Benjamin and Reddy, Dileep V. and Silberhorn, Christine and Raymer, M. G.}}, issn = {{2160-3308}}, journal = {{Physical Review X}}, title = {{{Photon Temporal Modes: A Complete Framework for Quantum Information Science}}}, doi = {{10.1103/physrevx.5.041017}}, volume = {{5}}, year = {{2015}}, } @article{21037, author = {{Luo, Kai-Hong and Herrmann, Harald and Krapick, Stephan and Brecht, Benjamin and Ricken, Raimund and Quiring, Viktor and Suche, Hubertus and Sohler, Wolfgang and Silberhorn, Christine}}, issn = {{1367-2630}}, journal = {{New Journal of Physics}}, title = {{{Direct generation of genuine single-longitudinal-mode narrowband photon pairs}}}, doi = {{10.1088/1367-2630/17/7/073039}}, volume = {{17}}, year = {{2015}}, } @inproceedings{21072, author = {{Lehrig, Sebastian and Eikerling, Hendrik and Becker, Steffen}}, booktitle = {{Proceedings of the 11th International ACM SIGSOFT Conference on Quality of Software Architectures}}, isbn = {{9781450334709}}, title = {{{Scalability, Elasticity, and Efficiency in Cloud Computing}}}, doi = {{10.1145/2737182.2737185}}, year = {{2015}}, } @inproceedings{21075, author = {{Lehrig, Sebastian and Eikerling, Hendrik}}, location = {{Munich}}, title = {{{Analyzing Cost-Efficiency of Cloud Computing Applications with SimuLizar}}}, doi = {{10.13140/RG.2.1.4036.9041}}, year = {{2015}}, } @techreport{21131, abstract = {{The intention of "doing good for society" is regarded to be a crucial motivator for employees in the public sector in order for them to perform well. Recent research in the public sector literature calls for a deeper understanding of how this specific public service motivation (PSM) is shaped. In our paper, we analyze how different degrees of inclusion in the public sector impact PSM. We also investigate how prospects of employment relations (fixed-term versus permanent contracts), temporal differences (part-time versus full-time employment), and actual jobs (core versus subsidiary jobs) moderate PSM in public service. Our findings show that aspects of PSM are affected by these employment characteristics in various ways, suggesting that the factors influencing PSM are multifaceted and that actual employment conditions have to be taken into consideration when assessing PSM. }}, author = {{Grund, Christian and Thommes, Kirsten}}, pages = {{42}}, title = {{{Disentangling the Role of Contract Types and Sector Disparities for Public Service Motivation}}}, year = {{2015}}, } @techreport{21132, abstract = {{In organizations, some team members are assigned to a team for a predefined short period of time, e.g., as they have a temporary contract, while others are permanent members of the same team. In a laboratory experiment we analyze the cooperation levels resulting from diverse teams, where some team members remain with a team and others are switching teams. Our results reveal that teams consisting partly of members with temporary membership display a lower productivity compared to teams of permanent team members only. First, temporary team members cooperate less than permanent team members. Second, individual effort decisions increase with the number of team mates who are of the same type. This second effect holds for both temps and permanents. We argue that social identity is affected by team composition and the individuals' role in a team.}}, author = {{Grund, Christian and Harbring, Christine and Thommes, Kirsten}}, pages = {{32}}, title = {{{Cooperation in Diverse Teams: The Role of Temporary Group Membership}}}, year = {{2015}}, } @inproceedings{21498, author = {{Hein, David and Meschut, Gerson and Hahn, Ortwin}}, booktitle = {{METEC and 2nd ESTAD}}, location = {{Düsseldorf}}, title = {{{Investigation of parameters for the numerical simulation of self-pierce-riveted joints under crash load}}}, year = {{2015}}, } @inproceedings{21505, author = {{Hein, David and Giese, Patrick and Meschut, Gerson and Gumbsch, Peter and Sommer, Silke and Bier, Matthias}}, location = {{Paderborn}}, title = {{{Charakterisierung und Modellierung von mechanischen Fügeverbindungen mit einseitiger Zugänglichkeit für den profilintensiven Leichtbau unter Crashbelastung}}}, year = {{2015}}, } @inproceedings{21506, author = {{Hein, David and Giese, Patrick and Meschut, Gerson and Gumbsch, Peter and Sommer, Silke and Bier, Matthias and Iwainsky, Alfred and Herfert, Daniel and Günther, Matthias}}, booktitle = {{5. Fügetechnisches Gemeinschaftskolloquium}}, location = {{Paderborn}}, title = {{{Daten- und prognosebasierte Generierung von Modellparametern für die Crashsimulation mechanisch gefügter Verbindungen}}}, year = {{2015}}, } @inproceedings{17425, author = {{Berssenbrügge, Jan and Wiederkehr, Olga and Jähn, Claudius and Fischer, Matthias}}, booktitle = {{12. Paderborner Workshop Augmented & Virtual Reality in der Produktentstehung}}, pages = {{65--78}}, publisher = {{Verlagsschriftenreihe des Heinz Nixdorf Instituts}}, title = {{{Anbindung des Virtuellen Prototypen an die Partialmodelle intelligenter technischer Systeme}}}, volume = {{343}}, year = {{2015}}, } @inproceedings{17427, author = {{Jähn, Claudius and Fischer, Matthias and Gerges, Maria and Berssenbrügge, Jan}}, booktitle = {{12. Paderborner Workshop Augmented & Virtual Reality in der Produktentstehung}}, pages = {{107--120}}, publisher = {{Verlagsschriftenreihe des Heinz Nixdorf Instituts}}, title = {{{Automatische Ableitung geometrischer Eigenschaften von Bauteilen aus dem 3-D-Polygonmodell}}}, volume = {{342}}, year = {{2015}}, } @book{17431, editor = {{Gausemeier, Jürgen and Grafe, Michael and Meyer auf der Heide, Friedhelm}}, publisher = {{Verlagsschriftenreihe des Heinz Nixdorf Instituts}}, title = {{{Augmented & Virtual Reality in der Produktentstehung: Grundlagen, Methoden und Werkzeuge; Interaktions- und Visualisierungstechniken, Virtual Prototyping intelligenter technischer Systeme mit AR/VR}}}, volume = {{342}}, year = {{2015}}, } @article{17657, abstract = {{Inter-datacenter transfers of non-interactive but timely large flows over a private (managed) network is an important problem faced by many cloud service providers. The considered flows are non-interactive because they do not explicitly target the end users. However, most of them must be performed on a timely basis and are associated with a deadline. We propose to schedule these flows by a centralized controller, which determines when to transmit each flow and which path to use. Two scheduling models are presented in this paper. In the first, the controller also determines the rate of each flow, while in the second bandwidth is assigned by the network according to the TCP rules. We develop scheduling algorithms for both models and compare their complexity and performance.}}, author = {{Cohen, R. and Polevoy, Gleb}}, issn = {{2168-7161}}, journal = {{Cloud Computing, IEEE Transactions on}}, keywords = {{Approximation algorithms, Approximation methods, Bandwidth, Cloud computing, Routing, Schedules, Scheduling}}, number = {{99}}, pages = {{1--1}}, title = {{{Inter-Datacenter Scheduling of Large Data Flows}}}, doi = {{10.1109/TCC.2015.2487964}}, volume = {{PP}}, year = {{2015}}, } @article{17658, abstract = {{Abstract We study the problem of bandwidth allocation with multiple interferences. In this problem the input consists of a set of users and a set of base stations. Each user has a list of requests, each consisting of a base station, a frequency demand, and a profit that may be gained by scheduling this request. The goal is to find a maximum profit set of user requests S that satisfies the following conditions: (i) S contains at most one request per user, (ii) the frequency sets allotted to requests in S that correspond to the same base station are pairwise non-intersecting, and (iii) the QoS received by any user at any frequency is reasonable according to an interference model. In this paper we consider two variants of bandwidth allocation with multiple interferences. In the first each request specifies a demand that can be satisfied by any subset of frequencies that is large enough. In the second each request specifies a specific frequency interval. Furthermore, we consider two interference models, multiplicative and additive. We show that these problems are extremely hard to approximate if the interferences depend on both the interfered and the interfering base stations. On the other hand, we provide constant factor approximation algorithms for both variants of bandwidth allocation with multiple interferences for the case where the interferences depend only on the interfering base stations. We also consider a restrictive special case that is closely related to the Knapsack problem. We show that this special case is NP-hard and that it admits an FPTAS. }}, author = {{Bar-Yehuda, Reuven and Polevoy, Gleb and Rawitz, Dror}}, issn = {{0166-218X}}, journal = {{Discrete Applied Mathematics }}, keywords = {{Local ratio}}, pages = {{23 -- 36}}, publisher = {{Elsevier}}, title = {{{Bandwidth allocation in cellular networks with multiple interferences}}}, doi = {{http://dx.doi.org/10.1016/j.dam.2015.05.013}}, volume = {{194}}, year = {{2015}}, } @article{1769, abstract = {{Große zylindrische Stahlprüflinge werden mittels der Methode der finiten Differenzen im Zeitbereich (engl. finite differences in time domain, FDTD) simulativ untersucht. Dabei werden Pitch-Catch-Messanordnungen verwendet. Es werden zwei Bildgebungsansätze vorgestellt: ersterer basiert auf dem Imaging Principle nach Claerbout, letzterer basiert auf gradientenbasierter Optimierung eines Zielfunktionals.}}, author = {{Hegler, Sebastian and Statz, Christoph and Mütze, Marco and Mooshofer, Hubert and Goldammer, Matthias and Fendt, Karl and Schwarzer, Stefan and Feldhoff, Kim and Flehmig, Martin and Markwardt, Ulf and E. Nagel, Wolfgang and Schütte, Maria and Walther, Andrea and Meinel, Michael and Basermann, Achim and Plettemeier, Dirk}}, journal = {{tm - Technisches Messen}}, number = {{9}}, pages = {{440--450}}, publisher = {{Walter de Gruyter}}, title = {{{Simulative Ultraschall-Untersuchung von Pitch-Catch-Messanordnungen für große zylindrische Stahl-Prüflinge und gradientenbasierte Bildgebung}}}, doi = {{doi:10.1515/teme-2015-0031}}, volume = {{82}}, year = {{2015}}, } @article{1772, author = {{Torresen, Jim and Plessl, Christian and Yao, Xin}}, journal = {{IEEE Computer}}, keywords = {{self-awareness, self-expression}}, number = {{7}}, pages = {{18--20}}, publisher = {{IEEE Computer Society}}, title = {{{Self-Aware and Self-Expressive Systems – Guest Editor's Introduction}}}, doi = {{10.1109/MC.2015.205}}, volume = {{48}}, year = {{2015}}, }