@misc{42301, author = {{N., N.}}, publisher = {{Universität Paderborn}}, title = {{{Kronzeugenprogramme zur Aufdeckung von Kartellen - Eine spieltheoretische Analyse}}}, year = {{2020}}, } @misc{42299, author = {{N., N.}}, publisher = {{Universität Paderborn}}, title = {{{Eine ökonomische Analyse der Piraterie in zweiseitigen Softwaremärkten}}}, year = {{2020}}, } @misc{42304, author = {{N., N.}}, publisher = {{Universität Paderborn}}, title = {{{Kulturelle Unterschiede beim Lösen von Verhandlungsproblemen}}}, year = {{2020}}, } @misc{42298, author = {{N., N.}}, publisher = {{Universität Paderborn}}, title = {{{Productivity optimization through project matching}}}, year = {{2020}}, } @misc{42306, author = {{N., N.}}, publisher = {{Universität Paderborn}}, title = {{{Matching Mechanisms and Organ Exchange}}}, year = {{2020}}, } @misc{42300, author = {{N., N.}}, publisher = {{Universität Paderborn}}, title = {{{Cartel Fines in the European Union}}}, year = {{2020}}, } @misc{42302, author = {{N., N.}}, publisher = {{Universität Paderborn}}, title = {{{Anspruchsregeln in Verhandlungen}}}, year = {{2020}}, } @misc{42292, author = {{N., N.}}, publisher = {{Universität Paderborn}}, title = {{{Die Zusammenstellung eines Sortiments als Beispiel interdependenter Verhandlungen}}}, year = {{2020}}, } @misc{42294, author = {{N., N.}}, publisher = {{Universität Paderborn}}, title = {{{Matching in Netzwerken}}}, year = {{2020}}, } @misc{45232, author = {{N., N.}}, title = {{{A Framework for Measurable Value Propositions of Mobile Applications}}}, year = {{2020}}, } @misc{45234, author = {{N., N.}}, title = {{{Model-Based Product Configuration in Augmented Reality Applications}}}, year = {{2020}}, } @misc{45235, author = {{N., N.}}, title = {{{Design and Implementation of a Crowd-based Prototype Validation Platform}}}, year = {{2020}}, } @inproceedings{20808, author = {{Ghasemzadeh Mohammadi, Hassan and Arshad, Rahil and Rautmare, Sneha and Manjunatha, Suraj and Kuschel, Maurice and Jentzsch, Felix Paul and Platzner, Marco and Boschmann, Alexander and Schollbach, Dirk}}, booktitle = {{2020 25th IEEE International Conference on Emerging Technologies and Factory Automation (ETFA)}}, isbn = {{9781728189567}}, title = {{{DeepWind: An Accurate Wind Turbine Condition Monitoring Framework via Deep Learning on Embedded Platforms}}}, doi = {{10.1109/etfa46521.2020.9211880}}, year = {{2020}}, } @misc{21433, abstract = {{Modern machine learning (ML) techniques continue to move into the embedded system space because traditional centralized compute resources do not suit certain application domains, for example in mobile or real-time environments. Google’s TensorFlow Lite (TFLite) framework supports this shift from cloud to edge computing and makes ML inference accessible on resource-constrained devices. While it offers the possibility to partially delegate computation to hardware accelerators, there is no such “delegate” available to utilize the promising characteristics of reconfigurable hardware. This thesis incorporates modern platform FPGAs into TFLite by implementing a modular delegate framework, which allows accelerators within the programmable logic to take over the execution of neural network layers. To facilitate the necessary hardware/software codesign, the FPGA delegate is based on the operating system for reconfigurable computing (ReconOS), whose partial reconfiguration support enables the instantiation of model-tailored accelerator architectures. In the hardware back-end, a streaming-based prototype accelerator for the MobileNet model family showcases the working order of the platform, but falls short of the desired performance. Thus, it indicates the need for further exploration of alternative accelerator designs, which the delegate could automatically synthesize to meet a model’s demands.}}, author = {{Jentzsch, Felix P.}}, title = {{{Design and Implementation of a ReconOS-based TensorFlow Lite Delegate Architecture}}}, year = {{2020}}, } @inproceedings{3287, abstract = {{For optimal placement and orchestration of network services, it is crucial that their structure and semantics are specified clearly and comprehensively and are available to an orchestrator. Existing specification approaches are either ambiguous or miss important aspects regarding the behavior of virtual network functions (VNFs) forming a service. We propose to formally and unambiguously specify the behavior of these functions and services using Queuing Petri Nets (QPNs). QPNs are an established method that allows to express queuing, synchronization, stochastically distributed processing delays, and changing traffic volume and characteristics at each VNF. With QPNs, multiple VNFs can be connected to complete network services in any structure, even specifying bidirectional network services containing loops. We discuss how management and orchestration systems can benefit from our clear and comprehensive specification approach, leading to better placement of VNFs and improved Quality of Service. Another benefit of formally specifying network services with QPNs are diverse analysis options, which allow valuable insights such as the distribution of end-to-end delay. We propose a tool-based workflow that supports the specification of network services and the automatic generation of corresponding simulation code to enable an in-depth analysis of their behavior and performance.}}, author = {{Schneider, Stefan Balthasar and Sharma, Arnab and Karl, Holger and Wehrheim, Heike}}, booktitle = {{2019 IFIP/IEEE International Symposium on Integrated Network Management (IM)}}, location = {{Washington, DC, USA}}, pages = {{116----124}}, publisher = {{IFIP}}, title = {{{Specifying and Analyzing Virtual Network Services Using Queuing Petri Nets}}}, year = {{2019}}, } @article{3585, abstract = {{Existing approaches and tools for the generation of approximate circuits often lack generality and are restricted to certain circuit types, approximation techniques, and quality assurance methods. Moreover, only few tools are publicly available. This hinders the development and evaluation of new techniques for approximating circuits and their comparison to previous approaches. In this paper, we first analyze and classify related approaches and then present CIRCA, our flexible framework for search-based approximate circuit generation. CIRCA is developed with a focus on modularity and extensibility. We present the architecture of CIRCA with its clear separation into stages and functional blocks, report on the current prototype, and show initial experiments.}}, author = {{Witschen, Linus Matthias and Wiersema, Tobias and Ghasemzadeh Mohammadi, Hassan and Awais, Muhammad and Platzner, Marco}}, issn = {{0026-2714}}, journal = {{Microelectronics Reliability}}, keywords = {{Approximate Computing, Framework, Pareto Front, Accuracy}}, pages = {{277--290}}, publisher = {{Elsevier}}, title = {{{CIRCA: Towards a Modular and Extensible Framework for Approximate Circuit Generation}}}, doi = {{10.1016/j.microrel.2019.04.003}}, volume = {{99}}, year = {{2019}}, } @article{1139, abstract = {{We investigate the degree of price competition among telecommunication firms. Underlying a Bertrand model of price competition, we empirically model pricing behaviour in an oligopoly. We analyse panel data of individual pricing information of mobile phone contracts offered between 2011 and 2017. We provide empirical evidence that price differences as well as reputational effects serve as a signal to buyers and significantly affect market demand. Additionally, we find that brands lead to an increase in demand and thus are able to generate spillover effects even after price increase.}}, author = {{Kaimann, Daniel and Hoyer, Britta}}, journal = {{Applied Economics Letters}}, number = {{1}}, pages = {{54--57}}, publisher = {{Taylor and Francis Online}}, title = {{{Price competition and the Bertrand model: The paradox of the German mobile discount market}}}, doi = {{10.1080/13504851.2018.1436141}}, volume = {{26}}, year = {{2019}}, } @article{2256, abstract = {{Social psychology studies the "common enemy effect", the phenomenon that members of a group work together when they face an opponent, although they otherwise have little in common. An interesting scenario is the formation of an information network where group members individually sponsor costly links. Suppose that ceteris paribus, an outsider appears who aims to disrupt the information flow within the network by deleting some of the links. The question is how the group responds to this common enemy. We address this question for the homogeneous connections model of strategic network formation, with two-way flow of information and without information decay. For sufficiently low linkage costs, the external threat can lead to a more connected network, a positive common enemy effect. For very high but not prohibitively high linkage costs, the equilibrium network can be minimally connected and efficient in the absence of the external threat whereas it is always empty and ineffi cient in the presence of the external threat, a negative common enemy effect. For intermediate linkage costs, both connected networks and the empty network are Nash for certain cost ranges.}}, author = {{Hoyer, Britta and Haller, Hans}}, journal = {{Journal of Economic Behavior & Organization}}, pages = {{146--163}}, title = {{{The Common Enemy Effect under Strategic Network Formation and Disruption}}}, doi = {{10.1016/j.jebo.2019.03.011}}, volume = {{162}}, 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}}, }