@inproceedings{22002, abstract = {{In diesem Beitrag wird ein Ansatz vorgestellt, welcher die Bewertung des Risikos von Anforderungsänderungen in der Entwicklung mechatronischer Systeme ermöglicht. Ausgehend von einer Anforderungsliste werden die Wechselwirkungen in einer Requirements Structure Matrix (RSM) teilautomatisch erfasst. Parallel werden Anforderungen in Bezug auf ihren Ursprung („Einflussbereich“) kategorisiert und darauf aufbauend priorisiert. Diese Priorisierung basiert auf dem Veränderungsrisiko und wird durch die drei Kriterien „Dynamik“, „Unsicherheit der Wissensbasis“ und „Relevanz für den Entwicklungsprozess“ charakterisiert. Das Vorgehen wird anhand strukturierter Interviews mit Projektleitern und Entwicklern und der Fallstudie eines Pedelecs als mechatronischem System validiert. Durch die Anwendung der Methode können disziplinübergreifende Abhängigkeiten von Anforderungen zur Reduktion von Iterationen in der Entwicklung mechatronischer Systeme – wie dem Pedelec – berücksichtigt werden.}}, author = {{Gräßler, I. and Thiele, H. and Oleff, C. and Scholle, P. and Schulze, V.}}, booktitle = {{International Conference on Engineering Design (ICED19)}}, pages = {{1265--1274}}, title = {{{Priorisierung von Anforderungen für die Entwicklung mechatronischer Systeme}}}, doi = {{10.17619/UNIPB/1-791}}, year = {{2019}}, } @inproceedings{22022, abstract = {{Due to the great popularity of the Fused Deposition Modeling (FDM) process, the material market is growing. In particular, processing of high-temperature materials such as PEEK is demanding. The aim of the investigations is to test different PEEK materials regarding their processability in the FDM process. An unreinforced PEEK, a thermally conductive PEEK as well as a carbon fiber reinforced PEEK are investigated. The processability is assessed with the help of the weld seam strength. The assessment of the weld seam strength is carried out by building tests. For this purpose, a special method developed at the DMRC is used. In addition, a welding width factor between the strands deposited on each other is calculated and compared. Finally, a welding factor is determined to enable the comparison between the different materials. With this procedure, the influence of varying nozzle and build chamber temperatures on the achievable weld seam strengths is evaluated.}}, author = {{Moritzer, Elmar and Wächter, Julian and Elsner, M.}}, booktitle = {{30th Annual International Solid Freeform Fabrication Symposium}}, pages = {{856--863}}, title = {{{Investigation of the Processability of Different PEEK Materials in the FDM Process with Regard to the Weld Seam Strength}}}, doi = {{http://utw10945.utweb.utexas.edu/sites/default/files/2019/074%20Investigation%20of%20The%20Processability%20of%20Different%20P.pdf}}, volume = {{30}}, year = {{2019}}, } @inproceedings{8954, author = {{Kliensieck, Katrin and John, Thomas and Kundisch, Dennis}}, booktitle = {{11th Biennial Procrastination Research Conference}}, location = {{Sheffield, United Kingdom}}, title = {{{Applied procrastination research: Tackling procrastination by gamification}}}, year = {{2019}}, } @inproceedings{9261, author = {{Szopinski, Daniel}}, booktitle = {{Proceedings of the 32nd Bled eConference}}, location = {{Bled, Slovenia}}, title = {{{Jumping, dumping, and pumping: Three mental principles for idea generation to activate software-based tools in business model innovation}}}, year = {{2019}}, } @inproceedings{9263, author = {{Szopinski, Daniel and Schoormann, T. and Kundisch, Dennis}}, booktitle = {{Proceedings of the 27th European Conference on Information Systems (ECIS)}}, location = {{Stockholm, Sweden}}, title = {{{Because your taxonomy is worth it: Towards a framework for taxonomy evaluation}}}, year = {{2019}}, } @article{9267, author = {{Kremer, H.-Hugo and Rüsing, Peter}}, journal = {{berufsbildung Zeitschrift für Theorie-Praxis-Dialog}}, pages = {{17 -- 19}}, publisher = {{Eusl}}, title = {{{Digitale Transformation – Rezeption aus Sicht der Akteure in der Fachschule am Berufskolleg}}}, year = {{2019}}, } @inproceedings{9270, abstract = {{As 5G and network function virtualization (NFV) are maturing, it becomes crucial to demonstrate their feasibility and benefits by means of vertical scenarios. While 5GPPP has identified smart manufacturing as one of the most important vertical industries, there is still a lack of specific, practical use cases. Using the experience from a large-scale manufacturing company, Weidm{\"u}ller Group, we present a detailed use case that reflects the needs of real-world manufacturers. We also propose an architecture with specific network services and virtual network functions (VNFs) that realize the use case in practice. As a proof of concept, we implement the required services and deploy them on an emulation-based prototyping platform. Our experimental results indicate that a fully virtualized smart manufacturing use case is not only feasible but also reduces machine interconnection and configuration time and thus improves productivity by orders of magnitude.}}, author = {{Schneider, Stefan Balthasar and Peuster, Manuel and Behnke, Daniel and Marcel, Müller and Bök, Patrick-Benjamin and Karl, Holger}}, booktitle = {{European Conference on Networks and Communications (EuCNC)}}, keywords = {{5g, vertical, smart manufacturing, nfv}}, publisher = {{IEEE}}, title = {{{Putting 5G into Production: Realizing a Smart Manufacturing Vertical Scenario}}}, doi = {{10.1109/eucnc.2019.8802016}}, year = {{2019}}, } @inproceedings{9275, abstract = {{In the last years, store-oriented software ecosystems are gaining more and more attention from a business perspective. In these ecosystems, third-party developers upload extensions to a store which can be downloaded by end users. While the functional scope of such ecosystems is relatively similar, the underlying business models differ greatly in and between their different product domains (e.g. Mobile Phone, Smart TV). This variability, in turn, makes it challenging for store providers to find a business model that fits their own needs. To handle this variability, we introduce the Business Variability Model (BVM) for modeling business model decisions. The basis of these decisions is the analysis of 60 store-oriented software ecosystems in eight different product domains. We map their business model decisions to the Business Model Canvas, condense them to a variability model and discuss particular variants and their dependencies. Our work provides store providers a new approach for modeling business model decisions together with insights of existing business models. This, in turn, supports them in creating new and improving existing business models.}}, author = {{Gottschalk, Sebastian and Rittmeier, Florian and Engels, Gregor}}, booktitle = {{Business Modeling and Software Design}}, editor = {{Shishkov, Boris}}, keywords = {{Software Ecosystems, Business Models, Variabilities}}, location = {{Lisbon}}, pages = {{153--169}}, publisher = {{Springer International Publishing}}, title = {{{Business Models of Store-Oriented Software Ecosystems: A Variability Modeling Approach}}}, doi = {{10.1007/978-3-030-24854-3_10}}, year = {{2019}}, } @inproceedings{9276, author = {{Yigitbas, Enes and Josifovska, Klementina and Jovanovikj, Ivan and Kalinci, Ferhat and Anjorin, Anthony and Engels, Gregor}}, booktitle = {{Proceedings of the 11th ACM SIGCHI Symposium on Engineering Interactive Computing Systems (EICS 2019)}}, location = {{Valencia}}, pages = {{13:1----13:7}}, title = {{{Component-Based Development of Adaptive User Interfaces }}}, year = {{2019}}, } @inproceedings{7752, author = {{Sharma, Arnab and Wehrheim, Heike}}, booktitle = {{Proceedings of the Software Engineering Conference (SE)}}, isbn = {{978-3-88579-686-2}}, location = {{Stuttgart}}, pages = {{157 -- 158}}, publisher = {{Gesellschaft für Informatik e.V. (GI)}}, title = {{{Testing Balancedness of ML Algorithms}}}, volume = {{P-292}}, year = {{2019}}, } @article{7800, author = {{Henksmeier, Tobias and Shvarkov, Stepan and Trapp, Alexander and Reuter, Dirk}}, issn = {{0022-0248}}, journal = {{Journal of Crystal Growth}}, pages = {{164--168}}, publisher = {{Elsevier BV}}, title = {{{Molecular beam epitaxy growth and temperature-dependent electrical characterization of carbon-doped GaAs on GaAs(1 1 1)B}}}, doi = {{10.1016/j.jcrysgro.2019.02.006}}, volume = {{512}}, year = {{2019}}, } @article{80, abstract = {{Models on network formation have often been extended to include the potential of network disruption in recent years. Whereas the theoretical research on network formation under the threat of disruption has thus gained prominence, hardly any experimental research exists so far. In this paper, we therefore experimentally study the emergence of networks including the aspect of a known external threat by relating theoretical predictions by Dzuibiński and Goyal (2013) to actual observed behaviour. We deal with the question if subjects in the role of a strategic Designer are able to form safe networks for least costs while facing a strategic Adversary who is going to attack their networks. Varying the costs for protecting nodes, we designed and tested two treatments with different predictions for the equilibrium network and investigated whether one of the least cost equilibrium networks was more likely to be reached. Furthermore, the influence of the subjects’ farsightedness on their decision-making process was elicited and analysed. We find that while subjects are able to build safe networks in both treatments, equilibrium networks are only built in one of the two treatments. In the other treatment, predominantly safe networks are built but they are not for least costs. Additionally, we find that farsightedness –as measured in our experiment– has no influence on whether subjects are able to build safe or least cost equilibrium networks. Two robustness settings with a reduced external threat or more liberties to modify the initial networks qualitatively confirm our results. Overall, in this experiment observed behaviour is only partially in line with the theoretical predictions by Dzuibiński and Goyal (2013).}}, author = {{Endres, Angelika Elfriede and Recker, Sonja and Mir Djawadi, Behnud and Hoyer, Britta}}, journal = {{Journal of Economic Behavior and Organization }}, pages = {{708--734}}, title = {{{Network Formation and Disruption - An Experiment: Are equilibrium networks too complex?}}}, doi = {{10.1016/j.jebo.2018.11.004}}, volume = {{157}}, year = {{2019}}, } @phdthesis{8080, abstract = {{This thesis investigates approximate pure Nash equilibria in different game-theoretic models. In such an outcome, no player can improve her objective by more than a given factor through a deviation to another strategy. In the first part, we investigate two variants of Congestion Games in which the existence of pure Nash equilibria is guaranteed through a potential function argument. However, the computation of such equilibria might be hard. We construct and analyze approximation algorithms that enable the computation of states with low approximation factors in polynomial time. To show their guarantees we use sub games among players, bound the potential function values of arbitrary states and exploit a connection between Shapley and proportional cost shares. Furthermore, we apply and analyze sampling techniques for the computation of approximate Shapley values in different settings. In the second part, we concentrate on the existence of approximate pure Nash equilibria in games in which no pure Nash equilibria exist in general. In the model of Coevolving Opinion Formation Games, we bound the approximation guarantees for natural states nearly independent of the specific definition of the players' neighborhoods by applying a concept of virtual costs. For the special case of only one influential neighbor, we even show lower approximation factors for a natural strategy. Then, we investigate a two-sided Facility Location Game among facilities and clients on a line with an objective function consisting of distance and load. We show tight bounds on the approximation factor for settings with three facilities and infinitely many clients. For the general scenario with an arbitrary number of facilities, we bound the approximation factor for two promising candidates, namely facilities that are uniformly distributed and which are paired.}}, author = {{Feldotto, Matthias}}, title = {{{Approximate Pure Nash Equilibria in Congestion, Opinion Formation and Facility Location Games}}}, doi = {{10.17619/UNIPB/1-588}}, year = {{2019}}, } @misc{8112, author = {{Maaz, Mohammad Urf and Sprenger, Alexander and Hellebrand, Sybille}}, keywords = {{WORKSHOP}}, publisher = {{31. Workshop "Testmethoden und Zuverlässigkeit von Schaltungen und Systemen" (TuZ'19)}}, title = {{{A Hybrid Space Compactor for Varying X-Rates}}}, year = {{2019}}, } @article{8113, abstract = {{The ongoing softwarization of networks creates a big need for automated testing solutions to ensure service quality. This becomes even more important if agile environments with short time to market and high demands, in terms of service performance and availability, are considered. In this paper, we introduce a novel testing solution for virtualized, microservice-based network functions and services, which we base on TTCN-3, a well known testing language defined by the European standards institute (ETSI). We use TTCN-3 not only for functional testing but also answer the question whether TTCN-3 can be used for performance profiling tasks as well. Finally, we demonstrate the proposed concepts and solutions in a case study using our open-source prototype to test and profile a chained network service.}}, author = {{Peuster, Manuel and Dröge, Christian and Boos, Clemens and Karl, Holger}}, issn = {{2405-9595}}, journal = {{ICT Express}}, publisher = {{Elsevier BV}}, title = {{{Joint testing and profiling of microservice-based network services using TTCN-3}}}, doi = {{10.1016/j.icte.2019.02.001}}, year = {{2019}}, } @inproceedings{8240, author = {{Dräxler, Sevil and Karl, Holger}}, booktitle = {{5th IEEE International Conference on Network Softwarization (NetSoft) 2019}}, location = {{Paris}}, title = {{{SPRING: Scaling, Placement, and Routing of Heterogeneous Services with Flexible Structures}}}, year = {{2019}}, } @misc{8312, author = {{Bäumer, Frederik Simon and Geierhos, Michaela}}, booktitle = {{encyclopedia.pub}}, keywords = {{OTF Computing, Natural Language Processing, Requirements Engineering}}, publisher = {{MDPI}}, title = {{{Requirements Engineering in OTF-Computing}}}, year = {{2019}}, } @article{5674, abstract = {{In disaster operations management, a challenging task for rescue organizations occurs when they have to assign and schedule their rescue units to emerging incidents under time pressure in order to reduce the overall resulting harm. Of particular importance in practical scenarios is the need to consider collaboration of rescue units. This task has hardly been addressed in the literature. We contribute to both modeling and solving this problem by (1) conceptualizing the situation as a type of scheduling problem, (2) modeling it as a binary linear minimization problem, (3) suggesting a branch-and-price algorithm, which can serve as both an exact and heuristic solution procedure, and (4) conducting computational experiments - including a sensitivity analysis of the effects of exogenous model parameters on execution times and objective value improvements over a heuristic suggested in the literature - for different practical disaster scenarios. The results of our computational experiments show that most problem instances of practically feasible size can be solved to optimality within ten minutes. Furthermore, even when our algorithm is terminated once the first feasible solution has been found, this solution is in almost all cases competitive to the optimal solution and substantially better than the solution obtained by the best known algorithm from the literature. This performance of our branch-and-price algorithm enables rescue organizations to apply our procedure in practice, even when the time for decision making is limited to a few minutes. By addressing a very general type of scheduling problem, our approach applies to various scheduling situations.}}, author = {{Rauchecker, Gerhard and Schryen, Guido}}, journal = {{European Journal of Operational Research}}, keywords = {{OR in disaster relief, disaster operations management, scheduling, branch-and-price}}, number = {{1}}, pages = {{352 -- 363}}, publisher = {{Elsevier}}, title = {{{An Exact Branch-and-Price Algorithm for Scheduling Rescue Units during Disaster Response}}}, volume = {{272}}, year = {{2019}}, } @inproceedings{4517, author = {{Wolf, Verena and Bartelheimer, Christian and Beverungen, Daniel}}, booktitle = {{Proceedings of the 52nd Hawaii International Conference on System Sciences (HICSS-52)}}, location = {{Maui, Hawaii}}, title = {{{Digitalization of Work Systems—An Organizational Routines’ Perspective}}}, year = {{2019}}, } @article{4561, abstract = {{We exploit a unique sample of structured financial products (SFPs) to analyze pricing and issuance dependencies among different types of such market‐linked investment vehicles. Our study provides evidence of cross‐pricing between products with complementary payoff profiles. Such dependencies may be explained by issuers’ efforts to generate order flow for products that supplement their current SFP risk exposure. Additionally, we observe issuance patterns in line with the argument that issuers exploit the complementarity payout profiles when bringing SFPs to market. Our study emphasizes cross‐pricing from a perspective not previously considered in the literature.}}, author = {{Pelster, Matthias and Schertler, Andrea}}, journal = {{Journal of Futures Markets}}, keywords = {{cross‐pricing, discount certificate, hedging, issuance decisions, put warrants, structured financial products}}, number = {{3}}, pages = {{342--365}}, title = {{{Pricing and issuance dependencies in SFP portfolios}}}, doi = {{10.1002/fut.21978}}, volume = {{39}}, year = {{2019}}, }