@article{17080,
  author       = {{Wiebeler, Christian and Rao, Aditya G. and Gärtner, Wolfgang and Schapiro, Igor}},
  issn         = {{1433-7851}},
  journal      = {{Angewandte Chemie International Edition}},
  keywords     = {{pc2-ressources}},
  pages        = {{1934--1938}},
  title        = {{{The Effective Conjugation Length Is Responsible for the Red/Green Spectral Tuning in the Cyanobacteriochrome Slr1393g3}}},
  doi          = {{10.1002/anie.201810266}},
  year         = {{2018}},
}

@misc{17152,
  author       = {{Oevel, Gudrun and Graf-Schlattmann, Marcel and Meister, Dorothee M. and Wilde, Melanie}},
  title        = {{{Hochschulstrategie als Prozess. Zum allgemeinen und hochschulspezifischen Begriff der Strategie}}},
  doi          = {{10.5281/ZENODO.1293797}},
  year         = {{2018}},
}

@inproceedings{1041,
  abstract     = {{Recent studies show the increasing popularity of distributed cloud applications, which are composed of multiple microservices. Besides their known benefits, microservice architecture also enables to mix and match cloud applications and Network Function Virtualization (NFV) services (service chains), which are composed of Virtual Network Functions (VNFs). Provisioning complex services containing VNFs and microservices in a combined NFV/cloud platform can enhance service quality and optimise cost. Such a platform can be based on the multi-cloud concept. However, current multi-cloud solutions do not support NFV requirements, making them inadequate to support complex services. In this paper, we investigate these challenges and propose a solution for jointly managing and orchestrating microservices and virtual network functions.}},
  author       = {{Razzaghi Kouchaksaraei, Hadi and Karl, Holger}},
  booktitle    = {{The Ninth International Conference on Cloud Computing, GRIDs, and Virtualization CLOUD COMPUTING}},
  isbn         = {{978-1-61208-607-1}},
  location     = {{Barcelona, Spain}},
  pages        = {{153--154}},
  title        = {{{Joint Orchestration of Cloud-Based Microservices and Virtual Network Functions}}},
  year         = {{2018}},
}

@article{1043,
  abstract     = {{Approximate computing (AC) is an emerging paradigm for energy-efficient computation. The basic idea of AC is to sacrifice high precision for low energy by allowing hardware to carry out “approximately correct” calculations. This provides a major challenge for software quality assurance: programs successfully verified to be correct might be erroneous on approximate hardware. In this letter, we present a novel approach for determining under what conditions a software verification result is valid for approximate hardware. To this end, we compute the allowed tolerances for AC hardware from successful verification runs. More precisely, we derive a set of constraints which—when met by the AC hardware—guarantees the verification result to carry over to AC. On the practical side, we furthermore: 1) show how to extract tolerances from verification runs employing predicate abstraction as verification technology and 2) show how to check such constraints on hardware designs. We have implemented all techniques, and exemplify them on example C programs and a number of recently proposed approximate adders.}},
  author       = {{Isenberg, Tobias and Jakobs, Marie-Christine and Pauck, Felix and Wehrheim, Heike}},
  issn         = {{1943-0663}},
  journal      = {{IEEE Embedded Systems Letters}},
  pages        = {{22--25}},
  publisher    = {{Institute of Electrical and Electronics Engineers (IEEE)}},
  title        = {{{Validity of Software Verification Results on Approximate Hardware}}},
  doi          = {{10.1109/LES.2017.2758200}},
  year         = {{2018}},
}

@misc{1044,
  author       = {{Leer, Richard}},
  publisher    = {{Universität Paderborn}},
  title        = {{{Measuring Performance of a Static Analysis Framework with an application to Immutability Analysis}}},
  year         = {{2018}},
}

@misc{1045,
  author       = {{Strüwer, Jan Niclas}},
  publisher    = {{Universität Paderborn}},
  title        = {{{Interactive Data Visualization for Exploded Supergraphs}}},
  year         = {{2018}},
}

@inproceedings{1046,
  author       = {{John, Thomas and Szopinski, Daniel}},
  booktitle    = {{Proceedings of the Multikonferenz Wirtschaftsinformatik 2018 (MKWI), Lüneburg, Germany}},
  title        = {{{Towards explaining the popularity of the Business Model Canvas: A dual coding approach}}},
  year         = {{2018}},
}

@article{1047,
  author       = {{Stummer, Christian and Kundisch, Dennis and Decker, Reinhold}},
  journal      = {{Business & Information Systems Engineering}},
  publisher    = {{Springer}},
  title        = {{{Platform Launch Strategies}}},
  year         = {{2018}},
}

@proceedings{10591,
  editor       = {{Abiteboul, S. and Arenas, M. and Barceló, P. and Bienvenu, M. and Calvanese, D. and David, C. and Hull, R. and Hüllermeier, Eyke and Kimelfeld, B. and Libkin, L. and Martens, W. and Milo, T. and Murlak, F. and Neven, F. and Ortiz, M. and Schwentick, T. and Stoyanovich, J. and Su, J. and Suciu, D. and Vianu, V. and Yi, K.}},
  number       = {{1}},
  pages        = {{1--29}},
  title        = {{{Research Directions for Principles of Data Management}}},
  volume       = {{7}},
  year         = {{2018}},
}

@inproceedings{10598,
  abstract     = {{Approximate computing has become a very popular design
strategy that exploits error resilient computations to achieve higher
performance and energy efficiency. Automated synthesis of approximate
circuits is performed via functional approximation, in which various
parts of the target circuit are extensively examined with a library
of approximate components/transformations to trade off the functional
accuracy and computational budget (i.e., power). However, as the number
of possible approximate transformations increases, traditional search
techniques suffer from a combinatorial explosion due to the large
branching factor. In this work, we present a comprehensive framework
for automated synthesis of approximate circuits from either structural
or behavioral descriptions. We adapt the Monte Carlo Tree Search
(MCTS), as a stochastic search technique, to deal with the large design
space exploration, which enables a broader range of potential possible
approximations through lightweight random simulations. The proposed
framework is able to recognize the design Pareto set even with low
computational budgets. Experimental results highlight the capabilities of
the proposed synthesis framework by resulting in up to 61.69% energy
saving while maintaining the predefined quality constraints.}},
  author       = {{Awais, Muhammad and Ghasemzadeh Mohammadi, Hassan and Platzner, Marco}},
  booktitle    = {{26th IFIP/IEEE International Conference on Very Large Scale Integration (VLSI-SoC)}},
  keywords     = {{Approximate computing, High-level synthesis, Accuracy, Monte-Carlo tree search, Circuit simulation}},
  pages        = {{219--224}},
  title        = {{{An MCTS-based Framework for Synthesis of Approximate Circuits}}},
  doi          = {{10.1109/VLSI-SoC.2018.8645026}},
  year         = {{2018}},
}

@inproceedings{1060,
  abstract     = {{With a growing number of online reviews, it becomes increasingly important for customers and online review platforms to find groups of reviewers who write useful reviews. Customers who review local offline businesses such as restaurants can identify themselves as locals or travelers and thus implicitly assign themselves to a specific reviewer group. This study investigates the relationship between identifying as a local and the perceived usefulness of their online reviews. Using data from Yelp.com, we empirically test hypotheses derived from attribution theory. Our results suggest that neutral and negative reviews by locals tend to be perceived as more useful than reviews by travelers. Positive reviews by locals, however, are not perceived as more useful. These findings provide significant practical implications for online review platforms and local offline businesses.}},
  author       = {{Neumann, Jürgen and Gutt, Dominik and Kundisch, Dennis and van Straaten, Dirk}},
  booktitle    = {{Proceedings of the Multikonferenz Wirtschaftsinformatik 2018 (MKWI), Lüneburg, Germany}},
  title        = {{{When Local Praise Becomes Cheap Talk - Analyzing the Relationship between Reviewer Location and Usefulness of Online Reviews}}},
  year         = {{2018}},
}

@inproceedings{1061,
  abstract     = {{It is well-established that both average online ratings and the number of ratings positively impact product sales. Yet, the economic implications of the information contained in the online review texts is not that well understood. In this study, we contribute to the understanding of online review texts and its economic implications by conducting and validating an unsupervised machine learning algorithm, the latent dirichlet allocation, to identify online reviews that mention product failures. Furthermore, we show that the textual information on product failures are associated with lower product sales. Our results help online review system designers, e.g., amazon, to identify these reviews and to make them easily accessible to potential customers to support the customer’s purchasing decision. Academics can build on our results by applying our validated topic identification strategy and by linking reviews mentioning product failure to a range of different outcomes.}},
  author       = {{Gutt, Dominik}},
  booktitle    = {{Proceedings of the Multikonferenz Wirtschaftsinformatik 2018 (MKWI), Lüneburg, Germany}},
  title        = {{{Sorting Out the Lemons - Identifying Product Failures in Online Reviews and their Relationship with Sales}}},
  year         = {{2018}},
}

@article{1063,
  author       = {{Stroh-Maraun, Nadja and Kaimann, Daniel and Cox, Joe}},
  journal      = {{Entertainment Computing}},
  pages        = {{26--36}},
  publisher    = {{Elsevier}},
  title        = {{{More than skills: A novel matching proposal for multiplayer video games}}},
  doi          = {{10.1016/j.entcom.2017.12.002}},
  volume       = {{25}},
  year         = {{2018}},
}

@misc{1064,
  author       = {{Rumert, Luis}},
  publisher    = {{Universität Paderborn}},
  title        = {{{Zu den Anreizwirkungen der Kronzeugenregelung - eine wettbewerbspolitische Analyse des Bierkartells}}},
  year         = {{2018}},
}

@misc{1066,
  author       = {{Arfeen, Muhammad Fahad}},
  publisher    = {{Universität Paderborn}},
  title        = {{{How effective are leniency programs in cartel deterrence - An overview of the empirical and experimental literature}}},
  year         = {{2018}},
}

@misc{1067,
  author       = {{Kersting, Florian}},
  publisher    = {{Universität Paderborn}},
  title        = {{{Die Deutsche Fußball Liga GmbH - ein Syndikat? Die Zentralvermarktung der Live-TV-Übertragungsrechte aus wettbewerbspolitischer Sicht}}},
  year         = {{2018}},
}

@misc{1068,
  author       = {{Beichl, Philipp}},
  publisher    = {{Universität Paderborn}},
  title        = {{{Das Zusammenschlussvorhaben der REWE Markt GmbH und Coop eG - eine wettbewerbspolitische Analyse}}},
  year         = {{2018}},
}

@article{107,
  abstract     = {{Consumer ratings play a decisive role in purchases by online shoppers. Although the effect of the average and the number of consumer ratings on future product pricing and demand have been studied with some conclusive results, the effects of the variance of these ratings are less well understood. We develop a model which considers durable goods that are characterized by three types of attributes: search attributes, experience attributes, and transformed attributes the latter are conventional experience attributes that are transformed by consumer ratings into attributes that can be searched. Using informed search attributes to refer to the combination of search attributes and transformed attributes, we consider two sources of variance of consumer ratings: taste differences about informed search attributes and quality differences in the form of product failure representing experience attributes. We find that (i) optimal price increases and demand decreases in variance caused by informed search attributes, (ii) optimal price and demand decrease in variance caused by experience attributes, and (iii) by holding the average rating as well as the total variance constant, for products with low total variance price and demand increase in the relative share of variance caused by informed search attributes. Counter to intuition, we demonstrate that risk averse consumers may prefer a higher priced product with a higher variance in ratings when deciding between two similar products with the same average rating. Finally, our model provides a theoretical explanation for the empirically observed j-shaped distribution of consumer ratings in e-commerce that differs from established explanations.}},
  author       = {{Zimmermann , Steffen and Herrmann, Philipp and Kundisch, Dennis and Nault, Barry}},
  journal      = {{Information Systems Research}},
  number       = {{4}},
  pages        = {{984--1002}},
  publisher    = {{INFORMS}},
  title        = {{{Decomposing the Variance of Consumer Ratings and the Impact on Price and Demand}}},
  doi          = {{10.1287/isre.2017.0764}},
  volume       = {{29}},
  year         = {{2018}},
}

@misc{10782,
  author       = {{Clausing, Lennart}},
  publisher    = {{Ruhr-University Bochum}},
  title        = {{{Development of a Hardware / Software Codesign for sonification of LIDAR-based sensor data}}},
  year         = {{2018}},
}

@inbook{10783,
  author       = {{Couso, Ines and Hüllermeier, Eyke}},
  booktitle    = {{Frontiers in Computational Intelligence}},
  editor       = {{Mostaghim, Sanaz and Nürnberger, Andreas and Borgelt, Christian}},
  pages        = {{31--46}},
  publisher    = {{Springer}},
  title        = {{{Statistical Inference for Incomplete Ranking Data: A Comparison of two likelihood-based estimators}}},
  year         = {{2018}},
}