@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}}, } @article{4682, author = {{Schmiedel, T. and Müller, Oliver and vom Brocke, J.}}, journal = {{Organizational Research Methods}}, keywords = {{online reviews, organizational culture, structural topic model, topic modeling, tutorial}}, pages = {{941----968 }}, title = {{{Topic Modeling as a Strategy of Inquiry in Organizational Research: A Tutorial With an Application Example on Organizational Culture}}}, doi = {{https://doi.org/10.1177/1094428118773858}}, year = {{2019}}, } @article{4684, author = {{Beverungen, Daniel and Müller, Oliver and Matzner, Martin and Mendling, Jan and vom Brocke, Jan}}, issn = {{14228890}}, journal = {{Electronic Markets}}, keywords = {{Boundary object, Internet of things, Service science, Smart products, Smart service}}, pages = {{1----12}}, title = {{{Conceptualizing smart service systems}}}, doi = {{10.1007/s12525-017-0270-5}}, year = {{2019}}, } @inbook{4798, author = {{Harteis, Christian}}, booktitle = {{Work-based learning as a pathway to competence-based education}}, editor = {{Bahl, Anke and Dietzen, Anke}}, pages = {{85--97}}, publisher = {{Barbara Budrich}}, title = {{{Supporting learning at work in an era of digitalization of work}}}, year = {{2019}}, } @article{7413, author = {{Gutt, Dominik and Neumann, Jürgen and Zimmermann, Steffen and Kundisch, Dennis and Chen, J.}}, journal = {{Journal of Strategic Information Systems}}, number = {{2}}, pages = {{104--117}}, title = {{{Design of Review Systems – A Strategic Instrument to shape Online Reviewing Behavior and Economic Outcomes}}}, volume = {{28}}, year = {{2019}}, } @inbook{7430, author = {{Rittmeier, Florian and Engels, Gregor and Teetz, Alexander}}, booktitle = {{Business Process Management Workshops}}, editor = {{Daniel, Florian and Sheng, Quan Z. and Motahari, Hamid}}, isbn = {{9783030116408}}, issn = {{1865-1348}}, pages = {{531--542}}, publisher = {{Springer International Publishing}}, title = {{{Process Weakness Patterns for the Identification of Digitalization Potentials in Business Processes}}}, doi = {{10.1007/978-3-030-11641-5_42}}, volume = {{342}}, year = {{2019}}, } @inbook{7465, author = {{Kremer, H.-Hugo}}, booktitle = {{Berufsbildung zwischen Tradition und Moderne}}, editor = {{Pilz, M. and Breuing, K. and Schumann, S.}}, title = {{{Praxissemester und Professionalisierung - Überlegungen zur Gestaltung einer universitären Begleitkonzeption}}}, year = {{2019}}, } @techreport{7622, author = {{Kundisch, Dennis and Beverungen, Daniel}}, pages = {{22--26}}, title = {{{Als Wirtschaftsinformatiker die digitale Transformation in Organisationen gestalten}}}, year = {{2019}}, } @misc{7623, author = {{Zhang, Shikun}}, pages = {{64}}, publisher = {{Universität Paderborn}}, title = {{{Combining Android Apps for Analysis Purposes}}}, year = {{2019}}, } @misc{7628, author = {{Selbach, Nils}}, publisher = {{Universität Paderborn}}, title = {{{Modeling Crypto API usages in OpenSSL's EVP library}}}, year = {{2019}}, } @techreport{7630, abstract = {{In this paper, we analyze a credence goods model adjusted to the health care market with regulated prices and heterogeneous experts. Experts are physicians and are assumed to differ in their cost of treating a small problem. We investigate the effects of this heterogeneity on the physicians’ level of fraud and on the patients’ search for second opinions. We find that introducing a fraction of more efficient low-cost physicians always increases social welfare, but in some cases only because of the raised physicians’ surplus. When the low-cost physicians’ cost advantage is small, imposing a share of low-cost physicians does not change the equilibrium fraud level. When the cost advantage is large, however, different changes in the fraud level occur depending on the share of generated low-cost physicians, the search rate and the initial level of fraud.}}, author = {{Heinzel, Joachim Maria Josef}}, keywords = {{credence goods, treatment efficiency, heterogeneous experts, overcharging}}, publisher = {{CIE Working Paper Series}}, title = {{{Credence Goods Markets with Heterogeneous Experts}}}, volume = {{118}}, year = {{2019}}, } @inproceedings{7635, author = {{Sharma, Arnab and Wehrheim, Heike}}, booktitle = {{IEEE International Conference on Software Testing, Verification and Validation (ICST)}}, location = {{Xi'an, China, April, 2019}}, pages = {{125----135}}, publisher = {{IEEE}}, title = {{{Testing Machine Learning Algorithms for Balanced Data Usage}}}, year = {{2019}}, } @inproceedings{7636, abstract = {{Self-stabilizing overlay networks have the advantage of being able to recover from illegal states and faults. However, the majority of these networks cannot give any guarantees on their functionality while the recovery process is going on. We are especially interested in searchability, i.e., the functionality that search messages for a specific node are answered successfully if a node exists in the network. In this paper we investigate overlay networks that ensure the maintenance of monotonic searchability while the self-stabilization is going on. More precisely, once a search message from node u to another node v is successfully delivered, all future search messages from u to v succeed as well. We extend the existing research by focusing on skip graphs and present a solution for two scenarios: (i) the goal topology is a super graph of the perfect skip graph and (ii) the goal topology is exactly the perfect skip graph. }}, author = {{Luo, Linghui and Scheideler, Christian and Strothmann, Thim Frederik}}, booktitle = {{Proceedings of the 2019 IEEE 33rd International Parallel and Distributed Processing Symposium (IPDPS '19)}}, location = {{Rio de Janeiro, Brazil}}, title = {{{MultiSkipGraph: A Self-stabilizing Overlay Network that Maintains Monotonic Searchability}}}, year = {{2019}}, } @inproceedings{7668, author = {{Heindorf, Stefan and Scholten, Yan and Engels, Gregor and Potthast, Martin}}, booktitle = {{WWW}}, location = {{San Francisco, USA}}, pages = {{670--680}}, publisher = {{ACM}}, title = {{{Debiasing Vandalism Detection Models at Wikidata}}}, doi = {{10.1145/3308558.3313507}}, year = {{2019}}, } @inproceedings{7669, author = {{Josifovska, Klementina and Yigitbas, Enes and Engels, Gregor}}, booktitle = {{Proceedings of the 21st International Conference on Human-Computer Interaction (HCII 2019)}}, location = {{Orlando, Florida}}, pages = {{398--409}}, publisher = {{Springer, LNCS}}, title = {{{A Digital Twin-Based Multi-Modal UI Adaptation Framework for Assistance Systems in Industry 4.0 }}}, volume = {{11568}}, year = {{2019}}, } @article{7689, author = {{Riebler, Heinrich and Vaz, Gavin Francis and Kenter, Tobias and Plessl, Christian}}, journal = {{ACM Trans. Archit. Code Optim. (TACO)}}, keywords = {{htrop}}, number = {{2}}, pages = {{14:1–14:26}}, publisher = {{ACM}}, title = {{{Transparent Acceleration for Heterogeneous Platforms with Compilation to OpenCL}}}, doi = {{10.1145/3319423}}, volume = {{16}}, year = {{2019}}, } @misc{8351, author = {{Nutt, Florian}}, title = {{{Vertrauensbildung und Reputationssysteme auf digitalen B2B-Märkten - Ein klassifizierender Überblick}}}, year = {{2019}}, } @article{8424, abstract = {{The vision of On-the-Fly (OTF) Computing is to compose and provide software services ad hoc, based on requirement descriptions in natural language. Since non-technical users write their software requirements themselves and in unrestricted natural language, deficits occur such as inaccuracy and incompleteness. These deficits are usually met by natural language processing methods, which have to face special challenges in OTF Computing because maximum automation is the goal. In this paper, we present current automatic approaches for solving inaccuracies and incompletenesses in natural language requirement descriptions and elaborate open challenges. In particular, we will discuss the necessity of domain-specific resources and show why, despite far-reaching automation, an intelligent and guided integration of end users into the compensation process is required. In this context, we present our idea of a chat bot that integrates users into the compensation process depending on the given circumstances. }}, author = {{Bäumer, Frederik Simon and Kersting, Joschka and Geierhos, Michaela}}, issn = {{2073-431X}}, journal = {{Computers}}, keywords = {{Inaccuracy Detection, Natural Language Software Requirements, Chat Bot}}, location = {{Vilnius, Lithuania}}, number = {{1}}, publisher = {{MDPI AG, Basel, Switzerland}}, title = {{{Natural Language Processing in OTF Computing: Challenges and the Need for Interactive Approaches}}}, doi = {{10.3390/computers8010022}}, volume = {{8}}, year = {{2019}}, } @inproceedings{8495, author = {{Josifovska, Klementina and Yigitbas, Enes and Engels, Gregor}}, booktitle = {{Proceedings of 5th International Workshop on Software Engineering for Smart Cyber-Physical Systems (SEsCPS'19)}}, location = {{Montreal, Canada}}, pages = {{25--31}}, publisher = {{IEEE Press}}, title = {{{ Reference Framework for Digital Twins within Cyber-Physical Systems }}}, year = {{2019}}, } @inproceedings{8520, author = {{Jenert, Tobias}}, location = {{Gießen }}, title = {{{Wie unterrichten wir Wirtschaft? Förderung fachbezogener Reflexion angehender Wirtschaftslehrender}}}, year = {{2019}}, } @inproceedings{8529, author = {{Seemann, Nina and Merten, Marie-Luis}}, booktitle = {{DHd 2019 Digital Humanities: multimedial & multimodal. Konferenzabstracts}}, editor = {{Sahle, Patrick}}, isbn = {{978-3-00-062166-6}}, location = {{Mainz and Frankfurt am Main, Germany}}, pages = {{352--353}}, publisher = {{Zenodo}}, title = {{{UPB-Annotate: Ein maßgeschneidertes Toolkit für historische Texte}}}, doi = {{10.5281/ZENODO.2596094}}, year = {{2019}}, } @misc{8530, author = {{Beckhoff, Yvonne Maria}}, title = {{{There's an App for that - Ein Literaturüberblick über Erfolgsfaktoren für App-Downloads}}}, year = {{2019}}, } @inproceedings{8532, author = {{Bäumer, Frederik Simon and Buff, Bianca and Geierhos, Michaela}}, booktitle = {{DHd 2019 Digital Humanities: multimedial & multimodal. Konferenzabstracts}}, editor = {{Sahle, Patrick}}, isbn = {{978-3-00-062166-6}}, location = {{Mainz and Frankfurt am Main, Germany}}, pages = {{192--193}}, publisher = {{Zenodo}}, title = {{{Potentielle Privatsphäreverletzungen aufdecken und automatisiert sichtbar machen}}}, doi = {{10.5281/zenodo.2596095}}, year = {{2019}}, } @inproceedings{8534, abstract = {{We propose two protocols for distributed priority queues (denoted by 'heap' for simplicity in this paper) called SKEAP and SEAP. SKEAP realizes a distributed heap for a constant amount of priorities and SEAP one for an arbitrary amount. Both protocols build on an overlay, which induces an aggregation tree on which heap operations are aggregated in batches, ensuring that our protocols scale even for a high rate of incoming requests. As part of SEAP we provide a novel distributed protocol for the k-selection problem that runs in time O(log n) w.h.p. SKEAP guarantees sequential consistency for its heap operations, while SEAP guarantees serializability. SKEAP and SEAP provide logarithmic runtimes w.h.p. on all their operations. SKEAP and SEAP provide logarithmic runtimes w.h.p. on all their operations with SEAP having to use only O(log n) bit messages.}}, author = {{Feldmann, Michael and Scheideler, Christian}}, booktitle = {{Proceedings of the 31st ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)}}, pages = {{287----296}}, publisher = {{ACM}}, title = {{{Skeap & Seap: Scalable Distributed Priority Queues for Constant and Arbitrary Priorities}}}, doi = {{10.1145/3323165.3323193}}, year = {{2019}}, } @article{8543, abstract = {{Dieser Artikel erörtert, ob in studentischen Kleingruppenprojekten in der Informatik Kreativität und die Erarbeitung kreativer Ideen explizit gefördert werden kann. Dazu wird ein Seminarkonzept detailliert vorgestellt, welches auf zwei Grundkonzepten der Informatikpraxis beruht: agiles Projektvorgehen und Prototyping. Die Teilnehmenden des Seminars wurden gezielt in einen Kreativitätsprozess geleitet, indem sie für gegebene moderne Technologien (Virtual Reality, Augmented Reality, Drohnen, etc.) neuartige Nutzungsszenarien entwickeln sollten. Um zu evaluieren, ob das Lehrkonzept erfolgreich ist, wird sowohl die produktbezogene als auch die prozessbezogene Kreativität betrachtet. Für die produktbezogene Kreativität werden die von den Teilnehmenden erstellten Projektideen inklusive der benutzten Prototypingtechnik vorgestellt und bewertet. Die Teilnehmenden haben nicht nur eine enorme Breite an Ideen entwickelt (in der Summe ca. 40 bei 16 Teilnehmenden), sondern insbesondere auch acht Ideen im Verlaufe des Seminars sehr konkret weiterentwickelt. Hinsichtlich der prozessbezogenen Kreativität wird das Lehrkonzept durch mehrere Fragebögen eruiert. Die Studierenden sind mit dem Seminar, der Herangehensweise und den Ergebnissen sehr zufrieden, was unter anderem durch die äußerst positive studentische Veranstaltungskritik (u.a. 1,0 für den Gesamteindruck sowie Atmosphäre in der Veranstaltung) und die Auswertung der Evaluationsfragebögen unterstrichen wird. Auch von externen Beobachtern werden die erarbeiteten Ergebnisse und der Einsatz von Prototyping als sehr positiv bewertet.}}, author = {{Strothmann, Thim Frederik}}, journal = {{die hochschullehre}}, title = {{{Förderung von Kreativität in studentischen Kleingruppenprojekten in der Informatik – Ein Prototyping-basierter Ansatz}}}, year = {{2019}}, } @inbook{8577, author = {{Kuklinski, Christiane and Leis, Elena and Liebendörfer, Michael and Hochmuth, Reinhard}}, booktitle = {{Beiträge zum Mathematikunterricht 2019}}, title = {{{Erklärung von Mathematikleistung im Ingenieursstudium}}}, year = {{2019}}, } @article{8638, author = {{Yigitbas, Enes and Schomaker, Gunnar}}, journal = {{International Tube Association (ITAtube) Journal}}, title = {{{WindCORES - Digital Transformation with Renewable Energy }}}, year = {{2019}}, } @article{8646, author = {{Deppe, M. and Gerlach, J. W. and Shvarkov, S. and Rogalla, D. and Becker, H.-W. and Reuter, Dirk and As, Donat Josef}}, issn = {{0021-8979}}, journal = {{Journal of Applied Physics}}, title = {{{Germanium doping of cubic GaN grown by molecular beam epitaxy}}}, doi = {{10.1063/1.5066095}}, year = {{2019}}, } @article{8667, author = {{Sprenger, Alexander and Hellebrand, Sybille}}, issn = {{0218-1266}}, journal = {{Journal of Circuits, Systems and Computers}}, number = {{1}}, pages = {{1--23}}, publisher = {{World Scientific Publishing Company}}, title = {{{Divide and Compact - Stochastic Space Compaction for Faster-than-At-Speed Test}}}, doi = {{10.1142/s0218126619400012}}, volume = {{28}}, year = {{2019}}, } @inproceedings{8792, abstract = {{5G together with software defined networking (SDN) and network function virtualisation (NFV) will enable a wide variety of vertical use cases. One of them is the smart man- ufacturing case which utilises 5G networks to interconnect production machines, machine parks, and factory sites to enable new possibilities in terms of flexibility, automation, and novel applications (industry 4.0). However, the availability of realistic and practical proof-of-concepts for those smart manufacturing scenarios is still limited. This demo fills this gap by not only showing a real-world smart manufacturing application entirely implemented using NFV concepts, but also a lightweight prototyping framework that simplifies the realisation of vertical NFV proof-of-concepts. Dur- ing the demo, we show how an NFV-based smart manufacturing scenario can be specified, on-boarded, and instantiated before we demonstrate how the presented NFV services simplify machine data collection, aggregation, and analysis.}}, author = {{Peuster, Manuel and Schneider, Stefan Balthasar and Behnke, Daniel and Müller, Marcel and Bök, Patrick-Benjamin and Karl, Holger}}, booktitle = {{5th IEEE International Conference on Network Softwarization (NetSoft 2019)}}, location = {{Paris}}, title = {{{Prototyping and Demonstrating 5G Verticals: The Smart Manufacturing Case}}}, doi = {{10.1109/NETSOFT.2019.8806685}}, year = {{2019}}, } @article{8795, abstract = {{Softwarized networks are the key enabler for elastic, on-demand service deployments of virtualized network functions. They allow to dynamically steer traffic through the network when new network functions are instantiated, or old ones are terminated. These scenarios become in particular challenging when stateful functions are involved, necessitating state management solutions to migrate state between the functions. The problem with existing solutions is that they typically embrace state migration and flow rerouting jointly, imposing a huge set of requirements on the on-boarded virtualized network functions (VNFs), eg, solution-specific state management interfaces. To change this, we introduce the seamless handover protocol (SHarP). An easy-to-use, loss-less, and order-preserving flow rerouting mechanism that is not fixed to a single state management approach. Using SHarP, VNF vendors are empowered to implement or use the state management solution of their choice. SHarP supports these solutions with additional information when flows are migrated. In this paper, we present SHarP's design, its open source prototype implementation, and show how SHarP significantly reduces the buffer usage at a central (SDN) controller, which is a typical bottleneck in state-of-the-art solutions. Our experiments show that SHarP uses a constant amount of controller buffer, irrespective of the time taken to migrate the VNF state.}}, author = {{Peuster, Manuel and Küttner, Hannes and Karl, Holger}}, issn = {{1055-7148}}, journal = {{International Journal of Network Management}}, title = {{{A flow handover protocol to support state migration in softwarized networks}}}, doi = {{10.1002/nem.2067}}, year = {{2019}}, } @article{8797, abstract = {{Free from phase-matching constraints, plasmonic metasurfaces have contributed significantly to the control of optical nonlinearity and enhancement of nonlinear generation efficiency by engineering subwavelength meta-atoms. However, high dissipative losses and inevitable thermal heating limit their applicability in nonlinear nanophotonics. All-dielectric metasurfaces, supporting both electric and magnetic Mie-type resonances in their nanostructures, have appeared as a promising alternative to nonlinear plasmonics. High-index dielectric nanostructures, allowing additional magnetic resonances, can induce magnetic nonlinear effects, which, along with electric nonlinearities, increase the nonlinear conversion efficiency. In addition, low dissipative losses and high damage thresholds provide an extra degree of freedom for operating at high pump intensities, resulting in a considerable enhancement of the nonlinear processes. We discuss the current state of the art in the intensely developing area of all-dielectric nonlinear nanostructures and metasurfaces, including the role of Mie modes, Fano resonances, and anapole moments for harmonic generation, wave mixing, and ultrafast optical switching. Furthermore, we review the recent progress in the nonlinear phase and wavefront control using all-dielectric metasurfaces. We discuss techniques to realize all-dielectric metasurfaces for multifunctional applications and generation of second-order nonlinear processes from complementary metal–oxide–semiconductor-compatible materials.}}, author = {{Sain, Basudeb and Meier, Cedrik and Zentgraf, Thomas}}, issn = {{2577-5421}}, journal = {{Advanced Photonics}}, number = {{2}}, pages = {{024002}}, title = {{{Nonlinear optics in all-dielectric nanoantennas and metasurfaces: a review}}}, doi = {{10.1117/1.ap.1.2.024002}}, volume = {{1}}, year = {{2019}}, } @misc{8799, author = {{Groh, Andreas}}, title = {{{Ideenbewertung durch die Crowd - Ein klassifizierender Literaturüberblick}}}, year = {{2019}}, } @inproceedings{8833, author = {{Jovanovikj, Ivan and Yigitbas, Enes and Gerth, Christian and Sauer, Stefan and Engels, Gregor}}, booktitle = {{Information Systems Engineering in Responsible Information Systems - CAiSE Forum 2019, Rome, Italy, June 3-7, 2019, Proceedings}}, editor = {{ Cappiello, Cinzia and Ruiz, Marcela}}, location = {{Rome}}, pages = {{145--157}}, title = {{{Detection and Resolution of Data-Flow Differences in Business Process Models}}}, volume = {{350}}, year = {{2019}}, } @inproceedings{8835, author = {{Jovanovikj, Ivan and Yigitbas, Enes and Grieger, Marvin and Sauer, Stefan and Engels, Gregor}}, booktitle = {{Proceedings of the 7th International Conference on Model-Driven Engineering and Software Development - Volume 1: MODELSWARD,}}, isbn = {{978-989-758-358-2}}, location = {{Prague}}, pages = {{536--543}}, publisher = {{SciTePress}}, title = {{{Modular Construction of Context-Specific Test Case Migration Methods}}}, doi = {{10.5220/0007690205360543}}, year = {{2019}}, } @misc{8840, author = {{Fath, Jerome Louis}}, title = {{{# Fail - Ein Literaturüberblick über Online-Bewertungen zu Produkt- und Dienstleistungsfehlern}}}, year = {{2019}}, } @inproceedings{8854, author = {{Szopinski, Daniel}}, booktitle = {{3rd Business Model Conference}}, location = {{New York, USA}}, title = {{{Activate software-based business model development tools: An exploratory study}}}, year = {{2019}}, } @inproceedings{8856, author = {{Szopinski, Daniel and Schoormann, T. and Kundisch, Dennis}}, booktitle = {{Proceedings of the 14th International Conference on Design Science Research in Information Systems and Technology (DESRIST)}}, location = {{Worcester, USA}}, title = {{{The long tail of taxonomy evaluation criteria: A structured overview}}}, year = {{2019}}, } @inproceedings{8861, author = {{Anjorin, Anthony and Yigitbas, Enes and Kaindl, Hermann}}, booktitle = {{Proceedings of the 8th International Workshop on Bidirectional Transformations (Bx 2019)}}, location = {{Philadelphia, PA, USA}}, pages = {{61--65}}, publisher = {{CEUR-WS.org}}, title = {{{Consistent Runtime Adaptation of User Interfaces }}}, volume = {{2355}}, year = {{2019}}, } @inproceedings{8866, author = {{Jansen, Klaus and Maack, Marten and Mäcker, Alexander}}, booktitle = {{Proceedings of the 33rd IEEE International Parallel and Distributed Processing Symposium (IPDPS)}}, pages = {{145 -- 154}}, publisher = {{IEEE}}, title = {{{Scheduling on (Un-)Related Machines with Setup Times}}}, year = {{2019}}, } @inproceedings{8868, author = {{Wever, Marcel Dominik and Mohr, Felix and Hüllermeier, Eyke and Hetzer, Alexander}}, location = {{Bayreuth, Germany}}, title = {{{Towards Automated Machine Learning for Multi-Label Classification}}}, year = {{2019}}, } @inproceedings{8871, author = {{Augustine, John and Ghaffari, Mohsen and Gmyr, Robert and Hinnenthal, Kristian and Kuhn, Fabian and Li, Jason and Scheideler, Christian}}, booktitle = {{Proceedings of the 31st ACM Symposium on Parallelism in Algorithms and Architectures}}, pages = {{69----79}}, publisher = {{ACM}}, title = {{{Distributed Computation in Node-Capacitated Networks}}}, doi = {{10.1145/3323165.3323195}}, year = {{2019}}, } @article{8872, abstract = {{We consider light scattering from a new type of model particle whose shape is represented in the form of a generalized ellipsoid having N foci, where N is greater than two. Such particles can be convex as well as concave. We use the geometrical optics approximation to study the light scattering from 3-foci particles. Non-zero elements of the scattering matrix are calculated for ensembles of randomly oriented independent transparent particles, m = n + i0. Several internal reflection orders are considered separately. It was found that the transmission-transmission (TT) and transmission-reflectance-transmission (TRT) components dominate in the formation of intensity of scattered light at large and small phase angles, respectively. We found a significant role of the total internal reflections of the TRT in the middle portion of the phase angle range. The main factors in the formation of positive linear polarization are the R and TRT component. The TT component is responsible for the formation of negative polarization branch at large phase angles.}}, author = {{Stankevich, Dmitriy and Hradyska, Larissa and Shkuratov, Yuriy and Grynko, Yevgen and Videen, Gorden and Förstner, Jens}}, issn = {{0022-4073}}, journal = {{Journal of Quantitative Spectroscopy and Radiative Transfer}}, keywords = {{tet_topic_scattering}}, pages = {{49}}, title = {{{Light scattering by 3-Foci convex and concave particles in the geometrical optics approximation}}}, doi = {{10.1016/j.jqsrt.2019.04.016}}, volume = {{231}}, year = {{2019}}, } @techreport{8873, abstract = {{We analyze a credence goods market adapted to a health care market with regulated prices, where physicians are heterogeneous regarding their fairness concerns. The opportunistic physicians only consider monetary incentives while the fair physicians, in addition to a monetary payoff, gain an non-monetary utility from being honest towards patients. We investigate how this heterogeneity affects the physicians’ equilibrium level of overcharging and the patients’ search for second opinions (which determines overall welfare). The impact of the heterogeneity on the fraud level is ambiguous and depends on several factors such as the size of the fairness utility, the share of fair physicians, the search level and the initial fraud level. Introducing heterogeneity does not affect the fraud or the search level when the share of fair physicians is small. However, when social welfare is not at its maximum, social welfare always increases if we introduce a sufficiently large share of fair physicians.}}, author = {{Heinzel, Joachim Maria Josef}}, keywords = {{credence goods, heterogeneous experts, fairness, overcharging}}, publisher = {{CIE Working Paper Series}}, title = {{{Credence Goods Markets with Fair and Opportunistic Experts}}}, volume = {{119}}, year = {{2019}}, }