@inproceedings{9850, abstract = {{A business model describes the mechanisms whereby a firm creates, delivers, and captures value. Following the steadily growing interest in business model innovation, software tools have shown great potential in supporting business model development and innovation. Yet, understanding the cognitive processes involved in the generation of business model ideas is an aspect of software design-knowledge that has so far been neglected. To investigate whether providing stimuli – in this case, brainstorming questions – can enhance individual creativity in this context, we conduct an exploratory experiment with over 100 participants. Our study is the first to systematically investigate the process of idea generation using a software-based business model development tool with stimuli. Our preliminary findings have the potential to support the future development of business model development tools and to refine the research design used to evaluate such tools.}}, author = {{Szopinski, Daniel}}, booktitle = {{Proceedings of the ACM Creativity & Cognition}}, keywords = {{Business model innovation, idea generation, cognitive stimuli, business model development tools, experiment, creativity support system}}, location = {{San Diego, USA}}, title = {{{Can stimuli improve business model idea generation? Developing software-based tools for business model innovation}}}, year = {{2019}}, } @article{9853, abstract = {{Business model innovation is typically taught in small seminars at universities. Teaching this intrinsically task-oriented subject to a large number of students is a challenge. In this paper we address this challenge by proposing an experiential and interactive approach to teaching business models in a large classroom setting.}}, author = {{Szopinski, Daniel}}, journal = {{Journal of Business Models}}, keywords = {{Business model teaching, peer assessment, experiential learning}}, number = {{3}}, pages = {{90--100}}, title = {{{Squaring the circle: Business model teaching in large classroom settings}}}, volume = {{7}}, year = {{2019}}, } @article{9897, author = {{Protte, Maximilian and Weber, Nils and Golla, Christian and Zentgraf, Thomas and Meier, Cedrik}}, issn = {{0021-8979}}, journal = {{Journal of Applied Physics}}, title = {{{Strong nonlinear optical response from ZnO by coupled and lattice-matched nanoantennas}}}, doi = {{10.1063/1.5093257}}, volume = {{125}}, year = {{2019}}, } @article{9920, author = {{Fritz, Marlon and Gries, Thomas and Feng, Yuanhua}}, issn = {{0165-1765}}, journal = {{Economics Letters}}, pages = {{47--50}}, title = {{{Secular stagnation? Is there statistical evidence of an unprecedented, systematic decline in growth?}}}, doi = {{10.1016/j.econlet.2019.04.021}}, volume = {{181}}, year = {{2019}}, } @inproceedings{9939, author = {{Yigitbas, Enes and Jovanovikj, Ivan and Josifovska, Klementina and Sauer, Stefan and Engels, Gregor}}, booktitle = {{Proceedings of the 17th IFIP TC.13 International Conference on Human-Computer Interaction (INTERACT 2019)}}, pages = {{563--567}}, publisher = {{Springer, LNCS}}, title = {{{On-the-fly Usability Evaluation of Mobile Adaptive UIs through Instant User Feedback }}}, year = {{2019}}, } @article{3936, author = {{Gutt, Dominik and Herrmann, Philipp and Rahman, Mohammad}}, journal = {{Information Systems Research}}, number = {{3}}, pages = {{980--994}}, title = {{{Crowd-Driven Competitive Intelligence: Understanding the Relationship between Local Market Competition and Online Rating Distributions}}}, volume = {{30}}, year = {{2019}}, } @inproceedings{4400, author = {{Görzen, Thomas}}, booktitle = {{Proceedings of the 52nd Hawaii International Conference on System Sciences (HICSS)}}, location = {{Maui, Hawaii, USA}}, title = {{{Can Experience be Trusted? Investigating the Effect of Experience on Decision Biases in Crowdworking Platforms}}}, year = {{2019}}, } @techreport{5411, abstract = {{Öffentlich gelistete Firmen, die die Mehrheit an anderen börsennotierten Unternehmen er-werben und den Kapitalmarkt an den Synergieerwartungen teilhaben lassen, werden mit höheren kumulativen abnormalen Renditen im Ankündigungszeitpunkt belohnt verglichen mit solchen Unternehmen, die diese geheim halten. Des Weiteren ist die empirische Evi-denz konsistent mit der Idee, dass diese Käuferunternehmen ihre Transaktionen besser in-tegrieren, weil auch die industrieadjustierten Ein- und Zweijahresrenditen der ankündigen-den Unternehmen ökonomisch und statistisch signifikant höher sind als die der zurückhal-tenden Käuferfirmen. }}, author = {{Mehring, Oliver and Sievers, Sönke and Keienburg, Georg and Kengelbach, Jens}}, pages = {{76--84}}, publisher = {{Corporate Finance}}, title = {{{Wertgenerierung bei M&A Transaktionen durch Bekanntgabe von Synergien?}}}, volume = {{3-4}}, year = {{2019}}, } @inproceedings{5471, abstract = {{We characterise the set of dominant strategy incentive compatible (DSIC), strongly budget balanced (SBB), and ex-post individually rational (IR) mechanisms for the multi-unit bilateral trade setting. In such a setting there is a single buyer and a single seller who holds a finite number k of identical items. The mechanism has to decide how many units of the item are transferred from the seller to the buyer and how much money is transferred from the buyer to the seller. We consider two classes of valuation functions for the buyer and seller: Valuations that are increasing in the number of units in possession, and the more specific class of valuations that are increasing and submodular. Furthermore, we present some approximation results about the performance of certain such mechanisms, in terms of social welfare: For increasing submodular valuation functions, we show the existence of a deterministic 2-approximation mechanism and a randomised e/(1-e) approximation mechanism, matching the best known bounds for the single-item setting.}}, author = {{Lazos, Philip and Goldberg, Paul and Skopalik, Alexander and Gerstgrasser, Matthias and de Keijzer, Bart}}, booktitle = {{Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence (AAAI)}}, location = {{Honolulu, Hawaii, USA}}, title = {{{ Multi-unit Bilateral Trade}}}, doi = {{10.1609/aaai.v33i01.33011973}}, year = {{2019}}, } @article{6512, abstract = {{Scheduling problems are essential for decision making in many academic disciplines, including operations management, computer science, and information systems. Since many scheduling problems are NP-hard in the strong sense, there is only limited research on exact algorithms and how their efficiency scales when implemented on parallel computing architectures. We address this gap by (1) adapting an exact branch-and-price algorithm to a parallel machine scheduling problem on unrelated machines with sequence- and machine-dependent setup times, (2) parallelizing the adapted algorithm by implementing a distributed-memory parallelization with a master/worker approach, and (3) conducting extensive computational experiments using up to 960 MPI processes on a modern high performance computing cluster. With our experiments, we show that the efficiency of our parallelization approach can lead to superlinear speedup but can vary substantially between instances. We further show that the wall time of serial execution can be substantially reduced through our parallelization, in some cases from 94 hours to less than six minutes when our algorithm is executed on 960 processes.}}, author = {{Rauchecker, Gerhard and Schryen, Guido}}, journal = {{Computers & Operations Research}}, keywords = {{parallel machine scheduling with setup times, parallel branch-and-price algorithm, high performance computing, master/worker parallelization}}, number = {{104}}, pages = {{338--357}}, publisher = {{Elsevier}}, title = {{{Using High Performance Computing for Unrelated Parallel Machine Scheduling with Sequence-Dependent Setup Times: Development and Computational Evaluation of a Parallel Branch-and-Price Algorithm}}}, year = {{2019}}, } @inproceedings{6514, abstract = {{Recommender Agents (RAs) facilitate consumers’ online purchase decisions for complex, multi-attribute products. As not all combinations of attribute levels can be obtained, users are forced into trade-offs. The exposure of trade-offs in a RA has been found to affect consumers’ perceptions. However, little is known about how different preference elicitation methods in RAs affect consumers by varying degrees of trade-off exposure. We propose a research model that investigates how different levels of trade-off exposure cognitively and affectively influence consumers’ satisfaction with RAs. We operationalize these levels in three different RA types and test our hypotheses in a laboratory experiment with 116 participants. Our results indicate that with increasing tradeoff exposure, perceived enjoyment and perceived control follow an inverted Ushaped relationship. Hence, RAs using preference elicitation methods with medium trade-off exposure yield highest consumer satisfaction. This contributes to the understanding of trade-offs in RAs and provides valuable implications to e-commerce practitioners.}}, author = {{Schuhbeck, Veronika and Siegfried, Nils and Dorner, Verena and Benlian, Alexander and Scholz, Michael and Schryen, Guido}}, booktitle = {{Proceedings of the 14. Internationale Tagung Wirtschaftsinformatik}}, keywords = {{Recommender Agents, Preference Elicitation Method, Trade-off Exposure, Customer Satisfaction}}, location = {{Siegen, Germany}}, pages = {{55--64}}, title = {{{Walking the Middle Path: How Medium Trade-off Exposure Leads to Higher Consumer Satisfaction in Recommender Agents}}}, year = {{2019}}, } @misc{6628, author = {{Seutter, Janina}}, title = {{{Bewertung von Maschinen-generierten Geschäftsmodell-Ideen: Eine experimentelle Untersuchung}}}, year = {{2019}}, } @article{6734, author = {{Gries, Thomas and Fritz, Marlon and Yuanhua, Feng}}, journal = {{Oxford Bulletin of Economics and Statistics}}, number = {{1}}, pages = {{62--78}}, title = {{{Growth Trends and Systematic Patterns of Boom and Busts –Testing 200 Years of Business Cycle Dynamics}}}, doi = {{10.1111/obes.12267}}, volume = {{81}}, year = {{2019}}, } @inproceedings{6856, author = {{Müller, Michelle and Gutt, Dominik}}, booktitle = {{Wirtschaftsinformatik Proceedings 2019}}, location = {{Siegen, Germany}}, title = {{{Heart over Heels? An Empirical Analysis of the Relationship between Emotions and Review Helpfulness for Experience and Credence Goods}}}, year = {{2019}}, } @inproceedings{6857, author = {{Poniatowski, Martin and Neumann, Jürgen and Görzen, Thomas and Kundisch, Dennis}}, booktitle = {{Wirtschaftsinformatik Proceedings 2019}}, location = {{Siegen, Germany}}, title = {{{A Semi-Automated Approach for Generating Online Review Templates, }}}, year = {{2019}}, } @inproceedings{6860, author = {{Afifi, Haitham and Karl, Holger}}, booktitle = {{2019 16th IEEE Annual Consumer Communications & Networking Conference (CCNC2019)}}, publisher = {{IEEE}}, title = {{{Power Allocation with a Wireless Multi-cast Aware Routing for Virtual Network Embedding}}}, year = {{2019}}, } @inproceedings{6976, abstract = {{We investigate the maintenance of overlay networks under massive churn, i.e. nodes joining and leaving the network. We assume an adversary that may churn a constant fraction $\alpha n$ of nodes over the course of $\mathcal{O}(\log n)$ rounds. In particular, the adversary has an almost up-to-date information of the network topology as it can observe an only slightly outdated topology that is at least $2$ rounds old. Other than that, we only have the provably minimal restriction that new nodes can only join the network via nodes that have taken part in the network for at least one round. Our contributions are as follows: First, we show that it is impossible to maintain a connected topology if adversary has up-to-date information about the nodes' connections. Further, we show that our restriction concerning the join is also necessary. As our main result present an algorithm that constructs a new overlay- completely independent of all previous overlays - every $2$ rounds. Furthermore, each node sends and receives only $\mathcal{O}(\log^3 n)$ messages each round. As part of our solution we propose the Linearized DeBruijn Swarm (LDS), a highly churn resistant overlay, which will be maintained by the algorithm. However, our approaches can be transferred to a variety of classical P2P Topologies where nodes are mapped into the $[0,1)$-interval.}}, author = {{Götte, Thorsten and Vijayalakshmi, Vipin Ravindran and Scheideler, Christian}}, booktitle = {{Proceedings of the 2019 IEEE 33rd International Parallel and Distributed Processing Symposium (IPDPS '19)}}, location = {{Rio de Janeiro, Brazil}}, publisher = {{IEEE}}, title = {{{Always be Two Steps Ahead of Your Enemy - Maintaining a Routable Overlay under Massive Churn with an Almost Up-to-date Adversary}}}, year = {{2019}}, } @inproceedings{16411, abstract = {{FPGA devices have been proving to be good candidates to accelerate applications from different research topics. For instance, machine learning applications such as K-Means clustering usually relies on large amount of data to be processed, and, despite the performance offered by other architectures, FPGAs can offer better energy efficiency. With that in mind, Intel has launched a platform that integrates a multicore and an FPGA in the same package, enabling low latency and coherent fine-grained data offload. In this paper, we present a parallel implementation of the K-Means clustering algorithm, for this novel platform, using OpenCL language, and compared it against other platforms. We found that the CPU+FPGA platform was more energy efficient than the CPU-only approach from 70.71% to 85.92%, with Standard and Tiny input sizes respectively, and up to 68.21% of performance improvement was obtained with Tiny input size. Furthermore, it was up to 7.2×more energy efficient than an Intel® Xeon Phi ™, 21.5×than a cluster of Raspberry Pi boards, and 3.8×than the low-power MPPA-256 architecture, when the Standard input size was used.}}, author = {{Souza, Matheus A. and Maciel, Lucas A. and Penna, Pedro Henrique and Freitas, Henrique C.}}, booktitle = {{2018 30th International Symposium on Computer Architecture and High Performance Computing (SBAC-PAD)}}, isbn = {{9781538677698}}, keywords = {{pc2-harp-ressources}}, title = {{{Energy Efficient Parallel K-Means Clustering for an Intel® Hybrid Multi-Chip Package}}}, doi = {{10.1109/cahpc.2018.8645850}}, year = {{2019}}, } @inproceedings{16413, abstract = {{In recent years, FPGAs have been successfully employed for the implementation of efficient, application-specific accelerators for a wide range of machine learning tasks. In this work, we consider probabilistic models, namely, (Mixed) Sum-Product Networks (SPN), a deep architecture that can provide tractable inference for multivariate distributions over mixed data-sources. We develop a fully pipelined FPGA accelerator architecture, including a pipelined interface to external memory, for the inference in (mixed) SPNs. To meet the precision constraints of SPNs, all computations are conducted using double-precision floating point arithmetic. Starting from an input description, the custom FPGA-accelerator is synthesized fully automatically by our tool flow. To the best of our knowledge, this work is the first approach to offload the SPN inference problem to FPGA-based accelerators. Our evaluation shows that the SPN inference problem benefits from offloading to our pipelined FPGA accelerator architecture.}}, author = {{Sommer, Lukas and Oppermann, Julian and Molina, Alejandro and Binnig, Carsten and Kersting, Kristian and Koch, Andreas}}, booktitle = {{2018 IEEE 36th International Conference on Computer Design (ICCD)}}, isbn = {{9781538684771}}, keywords = {{pc2-harp-ressources}}, title = {{{Automatic Mapping of the Sum-Product Network Inference Problem to FPGA-Based Accelerators}}}, doi = {{10.1109/iccd.2018.00060}}, year = {{2019}}, } @misc{16415, author = {{Lienen, Julian}}, title = {{{Automated Feature Engineering on Time Series Data}}}, year = {{2019}}, }