@article{3491, author = {{Becker, Jörg and Beverungen, Daniel and Knackstedt, Ralf and Peter Rauer, Hans and Sigge, Daniel}}, journal = {{Information Systems and e-Business Management}}, number = {{3}}, pages = {{337----365}}, title = {{{On the Ontological Expressiveness of Conceptual Modeling Grammars for Service Productivity Management}}}, doi = {{10.1007/s10257-013-0219-y}}, year = {{2014}}, } @article{3492, author = {{Beverungen, Daniel}}, journal = {{Business and Information Systems Engineering}}, number = {{4}}, pages = {{191----202}}, title = {{{Exploring the Interplay of the Design and Emergence of Business Processes as Organizational Routines}}}, doi = {{10.1007/s12599-014-0335-3}}, year = {{2014}}, } @article{3493, author = {{Beverungen, Daniel}}, journal = {{WIRTSCHAFTSINFORMATIK}}, number = {{4}}, pages = {{209----222}}, title = {{{Über das Zusammenwirken der Gestaltung und Emergenz von Geschäftsprozessen als Organisationsroutinen}}}, doi = {{10.1007/s11576-014-0425-3}}, year = {{2014}}, } @techreport{350, abstract = {{Customers continuously evaluate the credibility and reliability of a range of signals both separately and jointly. However, existing econometric studies pay insufficient attention to the interactions and complex combinations of these signals, and are typically limited as a result of difficulties controlling for multicollinearity and endogeneity in their data. We develop a novel theoretical approach to address these issues and study different signaling effects (i.e., word-of-mouth, brand reputation, and distribution strategy) on customer perceptions. Using data on the US video games market, we apply a fuzzy set qualitative comparative analysis (fsQCA) to account for cause-effect relationships. The results of our study address a number of key issues in the economics and management literature. First, our results support the contention that reviews from professional critics act as a signal of product quality and therefore positively influence unit sales, as do the discriminatory effects of prices and restricted age ratings. Second, we find evidence to support the use of brand extension strategies as marketing tools that create spillover effects and support the launch of new products.}}, author = {{Kaimann, Daniel and Cox, Joe}}, publisher = {{Universität Paderborn}}, title = {{{The Interaction of Signals: A Fuzzy set Analysis of the Video Game Industry}}}, year = {{2014}}, } @misc{351, author = {{Holzweißig, Lena}}, publisher = {{Universität Paderborn}}, title = {{{The Impact of Customer Reviews and Reputation on Hotel Prices}}}, year = {{2014}}, } @phdthesis{352, author = {{Scheel, Friedrich}}, publisher = {{Universität Paderborn}}, title = {{{The Economics of Individual Behavior in Competitive Environments: Empirical Evidence from Real-Life Tournaments}}}, year = {{2014}}, } @inproceedings{353, abstract = {{There are many technologies for the automation of processesthat deal with services; examples are service discovery and composition.Automation of these processes requires that the services are described semantically. However, semantically described services are currently not oronly rarely available, which limits the applicability of discovery and composition approaches. The systematic support for creating new semanticservices usable by automated technologies is an open problem.We tackle this problem with a template based approach: Domain independent templates are instantiated with domain specific services andboolean expressions. The obtained services have semantic descriptionswhose correctness directly follows from the correctness of the template.Besides the theory, we present experimental results for a service repository in which 85% of the services were generated automatically.}}, author = {{Mohr, Felix and Walther, Sven}}, booktitle = {{Proceedings of the 14th International Conference on Software Reuse (ICSR)}}, pages = {{188--203}}, title = {{{Template-based Generation of Semantic Services}}}, doi = {{10.1007/978-3-319-14130-5_14}}, year = {{2014}}, } @inproceedings{3538, author = {{Rötzmeier-Keuper, Julia and Wünderlich, Nancy}}, booktitle = {{ Proceedings of the 39th Annual Macromarketing Conference}}, location = {{London, GB}}, title = {{{Customer collectives in healthcare: The transformative potential of service to overcome consumer vulnerability}}}, year = {{2014}}, } @inproceedings{354, abstract = {{In distributed cloud computing, application deployment across multiple sites can improve quality of service. Recent research developed algorithms to find optimal locations for virtual machines. However, those algorithms assume to have either single-tier applications or a fixed number of virtual machines – a strong simplification of reality. This paper investigates the placement and scaling of complex application architectures. An application is dynamically scaled to fit both the current demand situation and the currently available infrastructure resources. We compare two approaches: The first one is based on virtual network embedding. The second approach is a novel method called Template Embedding. It is based on a hierarchical 1-allocation hub flow problem and combines applica- tion scaling and embedding in one step. Extensive experiments on 43200 network configurations showed that Template Embedding outperforms virtual network embedding in all cases in three metrics: success rate, solution quality, and runtime. This positive result shows that template embedding is a promising approach for distributed cloud resource allocation.}}, author = {{Keller, Matthias and Robbert, Christoph and Karl, Holger}}, booktitle = {{Proceedings of 7th International Conference on Utility and Cloud Computing (UCC)}}, pages = {{387----395}}, title = {{{Template Embedding: Using Application Architecture to Allocate Resources in Distributed Clouds}}}, doi = {{10.1109/UCC.2014.49}}, year = {{2014}}, } @inproceedings{3541, author = {{Rötzmeier-Keuper, Julia and Wünderlich, Nancy}}, booktitle = {{Proceedings of the AMA SERVSIG International Service Research Conference}}, location = {{Thessaloniki, GR}}, title = {{{ Interdependent Relationships Between and among Service Providers and Customer Collectives.}}}, year = {{2014}}, } @inproceedings{355, abstract = {{In the last decade pairings have become an important, and often indispensable, ingredient in the construction of identity-based and attribute-based cryptosystems, as well as group signatures and credential systems. Consequently, the applicability of timing, power, or fault attacks to implementations of pairings is an important research topic. We will review some of the known results in this area.}}, author = {{Blömer, Johannes and Günther, Peter and Liske, Gennadij}}, booktitle = {{Proceedings of Fault Tolerance and Diagnosis in Cryptography(FDTC)}}, pages = {{1----7}}, title = {{{Tampering attacks in pairing-based cryptography}}}, doi = {{10.1109/FDTC.2014.10}}, year = {{2014}}, } @article{356, abstract = {{Decentralized algorithms are often used in the cooperative robotics field, especially by large swarm systems. We present a distributed algorithm for a problem in which a group of autonomous mobile robots must surround a given target. These robots are oblivious, i.e., they have no memory of the past. They use only local sensing and need no dedicated communication among themselves. We introduce, then solve the problem in which the group of autonomous mobile robots must surround a given target – we call it the “discrete multiorbit target surrounding problem” (DMTSP). We evaluate our solution using simulation and prove that our solution invariably ensures that robots enclose the target in finite time. }}, author = {{Blazovics, Laszlo and Lukovszki, Tamas and Forstner, Bertalan }}, journal = {{Journal of Advanced Computational Intelligence and Intelligent Informatics}}, number = {{3}}, pages = {{315----319}}, publisher = {{Fuji Technology Press Ltd.}}, title = {{{Surrounding robots -- A discrete localized solution for the intruder problem}}}, doi = {{10.20965/jaciii.2014.p0315}}, year = {{2014}}, } @misc{357, author = {{Ebel, Olga}}, publisher = {{Universität Paderborn}}, title = {{{Struktur und algorithmische Bestimmung stabiler Matchings in one-to-one Matching Märkten}}}, year = {{2014}}, } @phdthesis{358, author = {{Röhl, Nils}}, publisher = {{Universität Paderborn}}, title = {{{Strategic and Cooperative Games in Network Economics}}}, year = {{2014}}, } @misc{359, author = {{Töws, Manuel}}, publisher = {{Universität Paderborn}}, title = {{{Statistisches Testen von unbeweisbaren Anforderungen an Programmspezifikationen in SMT-LIB}}}, year = {{2014}}, } @inbook{3591, author = {{Fischer, Christoph and O’Connor, Bridget N.}}, booktitle = {{Professional and Practice-based Learning}}, isbn = {{9789400770119}}, issn = {{2210-5549}}, pages = {{11--24}}, publisher = {{Springer Netherlands}}, title = {{{Informal Learning in Workplaces: Understanding Learning Culture as a Challenge for Organizational and Individual Development}}}, doi = {{10.1007/978-94-007-7012-6_2}}, year = {{2014}}, } @inproceedings{360, abstract = {{Network appliances perform different functions on network flows and constitute an important part of an operator’s network. Normally, a set of chained network functions process network flows. Following the trend of virtualization of networks, virtualization of the network functions has also become a topic of interest. We define a model for formalizing the chaining of network functions using a context-free language. We process deployment requests and construct virtual network function graphs that can be mapped to the network. We describe the mapping as a Mixed Integer Quadratically Constrained Program (MIQCP) for finding the placement of the network functions and chaining them together considering the limited network resources and requirements of the functions. We have performed a Pareto set analysis to investigate the possible trade-offs between different optimization objectives. }}, author = {{Dräxler, Sevil and Keller, Matthias and Karl, Holger}}, booktitle = {{Proceedings of the 3rd International Conference on Cloud Networking (CloudNet)}}, pages = {{7--13}}, title = {{{Specifying and Placing Chains of Virtual Network Functions}}}, doi = {{10.1109/CloudNet.2014.6968961}}, year = {{2014}}, } @misc{361, author = {{Roeske, Daniel}}, publisher = {{Universität Paderborn}}, title = {{{Simulating load-dependent operation of picocells}}}, year = {{2014}}, } @misc{362, author = {{Kaiser, Sarah}}, publisher = {{Universität Paderborn}}, title = {{{Signalisieren und Screening in Arbeitsmärkten - die Experimente von Brandts & Holt und Kübler et. al}}}, year = {{2014}}, } @inproceedings{364, abstract = {{Today, software components are traded on markets in form of services. These services can also be service compositions consisting of several services. If a software architect wants to provide such a service composition in the market for trade, she needs to perform several tasks: she needs to model the composition, to discover existing services to be part of that composition, and to analyze the composition's functional correctness as well as its quality, e.g., performance. Up to now, the architect needed to find and use different tools for these tasks. Typically, these tools are not interoperable with each other. We provide the tool SeSAME that supports a software architect in all of these tasks. SeSAME is an integrated Eclipse-based tool-suite providing a comprehensive service specification language to model service compositions and existing services. Furthermore, it includes modules for service matching, functional analysis, and non-functional analysis. SeSAME is the first tool that integrates all these tasks into one tool-suite and, thereby, provides holistic support for trading software services. Thus, it contributes to a software provider's market success.}}, author = {{Arifulina, Svetlana and Becker, Matthias and Platenius, Marie Christin and Walther, Sven}}, booktitle = {{Proceedings of the 29th IEEE/ACM International Conference on Automated Software Engineering (ASE 2014)}}, pages = {{839--842}}, title = {{{SeSAME: Modeling and Analyzing High-Quality Service Compositions}}}, doi = {{10.1145/2642937.2648621}}, year = {{2014}}, }