@misc{2273, author = {{Moselage, Laura}}, publisher = {{Universität Paderborn}}, title = {{{Das Reputationssystem als bedeutendes Instrument digitaler Märkte}}}, year = {{2017}}, } @misc{2274, author = {{Hennawi, Mohammad Ziad}}, publisher = {{Universität Paderborn}}, title = {{{Der Preis als Qualitätssignal}}}, year = {{2017}}, } @article{90, abstract = {{We propose and extend an approach for the verification of safety properties for parameterized timed systems modeled as networks of timed automata. For this task, we introduce an incremental workflow that is based on our algorithm IC3 with Zones. It proceeds in a cycle in which single models of the system are verified, and the verification results are employed for the reasoning about the entire system. Starting with the smallest instances, the verification of the safety property is carried out fast and efficient. On successful verification, the algorithm produces an inductive strengthening of the safety property. We reuse this result and try to reason about the entire parameterized timed system. To this end, we extrapolate the inductive strengthening into a candidate for the next-larger model. In case this candidate is a valid inductive strengthening for the next larger model, our main theorem reasons about all models of the parameterized timed system, stating that the safety property holds true for all models. Otherwise, the main cycle starts over with the verification of the next larger model. This workflow is iterated indefinitely, until able to reason about the entire parameterized timed system, until a counterexample trace is found, or until the single models become too large to be handled in the verification. We reuse the intermediate results in a Feedback-loop in order to accelerate the verification runs for the single models. Furthermore, we consider an extended formalism in comparison to our previous publications.}}, author = {{Isenberg, Tobias}}, journal = {{ACM Transactions on Embedded Computing Systems}}, number = {{2}}, pages = {{47:1--47:24}}, publisher = {{ACM}}, title = {{{Incremental Inductive Verification of Parameterized Timed Systems}}}, doi = {{10.1145/2984640}}, year = {{2017}}, } @inproceedings{91, abstract = {{The interest in business model innovation has risen rapidly in recent years, and software tools for business model development hold great promise for supporting business model innovation. Nonetheless, virtually no design-relevant knowledge exists concerning the functions that such tools should possess. Therefore, we develop a comprehensive taxonomy that identifies characteristic functions of software-based business model development tools. For developing the taxonomy, we draw on prior research on business model innovation, process modeling, and creativity support systems, and we analyze software tools for business model development that have been proposed in practice. The resulting taxonomy can support practitioners in their tool (re-)design and investment decisions, and for researchers can serve as a preliminary step towards more advanced theories for software tools for business model development.}}, author = {{Szopinski, Daniel and Schoormann, Thorsten and John, Thomas and Knackstedt, Ralf and Kundisch, Dennis}}, booktitle = {{Proceedings of the 23rd Americas Conference on Information Systems (AMCIS)}}, location = {{Boston, USA}}, title = {{{How Software Can Support Innovating Business Models: A Taxonomy of Functions of Business Model Development Tools}}}, year = {{2017}}, } @inproceedings{92, author = {{Szopinski, Daniel and Schoormann, Thorsten and John, Thomas and Knackstedt, Ralf and Kundisch, Dennis}}, booktitle = {{Bosch Business Model Innovation Summit 2017}}, location = {{Renningen, Germany}}, title = {{{How Software Can Support Innovating Business Models: A Taxonomy of Functions of Business Model Development Tools}}}, year = {{2017}}, } @inbook{93, abstract = {{In recent years, there has been a proliferation of technological developments that incorporate processing of human language. Hardware and software can be specialized for designated subject areas, and computational devices are designed for a widening variety of applications. At the same time, new areas and applications are emerging by demanding intelligent technology enhanced by the processing of human language. These new applications often perform tasks which handle information, and they have a capacity to reason, using both formal and human language. Many sub-areas of Artificial Intelligence demand integration of Natural Language Processing, at least to some degree. Furthermore, technologies require coverage of known as well as unknown agents, and tasks with potential variations. All of this takes place in environments with unknown factors. The book covers theoretical work, advanced applications, approaches, and techniques for computational models of information, reasoning systems, and presentation in language. The book promotes work on intelligent natural language processing and related models of information, thought, reasoning, and other cognitive processes. The topics covered by the chapters prompt further research and developments of advanced systems in the areas of logic, computability, computational linguistics, cognitive science, neuroscience of language, robotics, and artificial intelligence, among others.}}, author = {{Geierhos, Michaela and Bäumer, Frederik Simon}}, booktitle = {{Partiality and Underspecification in Information, Languages, and Knowledge}}, editor = {{Christiansen, Henning and Jiménez-López, M. Dolores and Loukanova, Roussanka and Moss, Lawrence S.}}, isbn = {{978-1- 4438-7947-7}}, pages = {{65--108}}, publisher = {{Cambridge Scholars Publishing}}, title = {{{Guesswork? Resolving Vagueness in User-Generated Software Requirements}}}, year = {{2017}}, } @misc{94, author = {{Martens, Martin}}, publisher = {{Universität Paderborn}}, title = {{{Geschäftsmodelle elektronischer Handelsplattformen}}}, year = {{2017}}, } @misc{95, author = {{Kundisch, Dennis and John, Thomas}}, booktitle = {{Enzyklopädie der Wirtschaftsinformatik, GITO}}, title = {{{Geschäftsmodell-Modellierungssprache/Business Model Modeling Language}}}, year = {{2017}}, } @inproceedings{77, abstract = {{Das Enterprise Architecture Management stellt umfangreiche Methoden, Modelle und Frameworks f{\"u}r die Modellierung von Unternehmensarchitekturen zur Verf{\"u}gung. Die Entwicklung von Software und deren Integration in IT-Landschaften ist heutzutage zunehmend von Komplexit{\"a}t und Unsicherheit gepr{\"a}gt. Dieser Beitrag (Research-in-progress) m{\"o}chte ein neues Paradigma – das „On-The-Fly Computing“ – vorschlagen, um diesen Herausforderungen zu begegnen, m{\"o}gliche L{\"o}sungsans{\"a}tze zu diskutieren sowie erste Ergebnisse eines Referenzmodells f{\"u}r individualisierte IT-Dienstleistungen in dynamischen Software-M{\"a}rkten dokumentieren.}}, author = {{Szopinski, Daniel and Jazayeri, Bahar and Engels, Gregor and Kundisch, Dennis}}, booktitle = {{Proceedings of the Workshop Enterprise Architecture Management in Forschung und Praxis, INFORMATIK 2017, Chemnitz, Germany}}, pages = {{2059--2066}}, publisher = {{GI}}, title = {{{On-The-Fly Computing: Ein Referenzmodell für individualisierte IT-Dienstleistungen in dynamischen Märkten}}}, year = {{2017}}, } @inproceedings{78, abstract = {{The Internet of Things (IoT) connects the things of our everyday life and supports usin our common activities.Several markets for IoT services have been created. These markets enable IoT users to search and compose services in order to support an IoT activity.However, existing IoT markets like IFTTT (If This Then That) are not convenient for users with respect to service discovery and composition.The objective of On-the-fly (OTF) computing is to configure and provide software markets that fulfill individual users' wishes by the automatic on-the-fly composition of single services.The architecture framework of On-the-fly computing markets helps architects to systematically develop these systems in different domains.In this paper, we use our OTF architectural framework to examine the requirements of a reference architecture for IoT markets.Furthermore, we perform a comparison between the architecture of IFTTT as an existing IoT market with this reference architecture. The results show how existing IoT markets can be improved. In return, the practical knowledge of IFTTT is taken to the reference architecture.This knowledge helps to overcome the limitations of today's IoT markets or creating new markets in the future.}}, author = {{Jazayeri, Bahar and Schwichtenberg, Simon}}, booktitle = {{Proceedings of the International Conference on Software Architecture (ICSA) IoT-ASAP Workshop}}, pages = {{120----127}}, publisher = {{IEEE}}, title = {{{On-The-Fly Computing Meets IoT Markets - Towards a Reference Architecture}}}, doi = {{10.1109/ICSAW.2017.59}}, year = {{2017}}, } @inproceedings{79, abstract = {{Consider a problem in which $n$ jobs that are classified into $k$ types arrive over time at their release times and are to be scheduled on a single machine so as to minimize the maximum flow time.The machine requires a setup taking $s$ time units whenever it switches from processing jobs of one type to jobs of a different type.We consider the problem as an online problem where each job is only known to the scheduler as soon as it arrives and where the processing time of a job only becomes known upon its completion (non-clairvoyance).We are interested in the potential of simple ``greedy-like'' algorithms.We analyze a modification of the FIFO strategy and show its competitiveness to be $\Theta(\sqrt{n})$, which is optimal for the considered class of algorithms.For $k=2$ types it achieves a constant competitiveness.Our main insight is obtained by an analysis of the smoothed competitiveness.If processing times $p_j$ are independently perturbed to $\hat p_j = (1+X_j)p_j$, we obtain a competitiveness of $O(\sigma^{-2} \log^2 n)$ when $X_j$ is drawn from a uniform or a (truncated) normal distribution with standard deviation $\sigma$.The result proves that bad instances are fragile and ``practically'' one might expect a much better performance than given by the $\Omega(\sqrt{n})$-bound.}}, author = {{Mäcker, Alexander and Malatyali, Manuel and Meyer auf der Heide, Friedhelm and Riechers, Sören}}, booktitle = {{Proceedings of the 15th Workshop on Approximation and Online Algorithms (WAOA)}}, pages = {{207--222}}, publisher = {{Springer}}, title = {{{Non-Clairvoyant Scheduling to Minimize Max Flow Time on a Machine with Setup Times}}}, doi = {{10.1007/978-3-319-89441-6}}, volume = {{10787}}, year = {{2017}}, } @misc{81, author = {{Luo, Linghui}}, publisher = {{Universität Paderborn}}, title = {{{MultiSkipList: A Self-stabilizing Overlay Network with Monotonic Searchability maintained}}}, year = {{2017}}, } @inproceedings{82, abstract = {{Many graph problems such as maximum cut, chromatic number, hamiltonian cycle, and edge dominating set are known to be fixed-parameter tractable (FPT) when parameterized by the treewidth of the input graphs, but become W-hard with respect to the clique-width parameter. Recently, Gajarský et al. proposed a new parameter called modular-width using the notion of modular decomposition of graphs. They showed that the chromatic number problem and the partitioning into paths problem, and hence hamiltonian path and hamiltonian cycle, are FPT when parameterized by this parameter. In this paper, we study modular-width in parameterized parallel complexity and show that the weighted maximum clique problem and the maximum matching problem are fixed-parameter parallel-tractable (FPPT) when parameterized by this parameter.}}, author = {{Abu-Khzam, Faisal N. and Li, Shouwei and Markarian, Christine and Meyer auf der Heide, Friedhelm and Podlipyan, Pavel}}, booktitle = {{Proceedings of the 11th International Workshop on Frontiers in Algorithmics (FAW)}}, pages = {{139--150}}, title = {{{Modular-Width: An Auxiliary Parameter for Parameterized Parallel Complexity}}}, doi = {{10.1007/978-3-319-59605-1_13}}, year = {{2017}}, } @misc{83, author = {{Uden, Dennis}}, publisher = {{Universität Paderborn}}, title = {{{Microsoft vs. the EU Commission - An analysis on product bundeling}}}, year = {{2017}}, } @misc{5694, author = {{Schnitker, Nino Noel}}, publisher = {{Universität Paderborn}}, title = {{{Genetischer Algorithmus zur Erstellung von Ensembles von Nested Dichotomies}}}, year = {{2017}}, } @inproceedings{5695, author = {{Jazayeri, Bahar and Schwichtenberg, Simon}}, booktitle = {{Proceedings of Softwaretechnik-Trends Workshops}}, publisher = {{Gesellschaft für Informatik eV, Fachgruppe PARS}}, title = {{{On the Necessity of an Architecture Framework for On-The-Fly Computing}}}, volume = {{37}}, year = {{2017}}, } @inproceedings{57, abstract = {{Users prefer natural language software requirements because of their usability and accessibility. Many approaches exist to elaborate these requirements and to support the users during the elicitation process. But there is a lack of adequate resources, which are needed to train and evaluate approaches for requirement refinement. We are trying to close this gap by using online available software descriptions from SourceForge and app stores. Thus, we present two real-life requirements collections based on online-available software descriptions. Our goal is to show the domain-specific characteristics of content words describing functional requirements. On the one hand, we created a semantic role-labeled requirements set, which we use for requirements classification. On the other hand, we enriched software descriptions with linguistic features and dependencies to provide evidence for the context-awareness of software functionalities. }}, author = {{Bäumer, Frederik Simon and Dollmann, Markus and Geierhos, Michaela}}, booktitle = {{Proceedings of the 2nd ACM SIGSOFT International Workshop on App Market Analytics}}, editor = {{Sarro, Federica and Shihab, Emad and Nagappan, Meiyappan and Platenius, Marie Christin and Kaimann, Daniel}}, isbn = {{978-1-4503-5158-4}}, location = {{Paderborn, Germany}}, pages = {{19--25}}, publisher = {{ACM}}, title = {{{Studying Software Descriptions in SourceForge and App Stores for a better Understanding of real-life Requirements}}}, doi = {{10.1145/3121264.3121269}}, year = {{2017}}, } @misc{5724, author = {{Hetzer, Alexander and Tornede, Tanja}}, publisher = {{Universität Paderborn}}, title = {{{Solving the Container Pre-Marshalling Problem using Reinforcement Learning and Structured Output Prediction}}}, year = {{2017}}, } @inproceedings{5769, abstract = {{Information Flow Analysis (IFA) aims at detecting illegal flows of information between program entities. “Legality” is therein specified in terms of various security policies. For the analysis, this opens up two possibilities: building generic, policy independent and building specific, policy dependent IFAs. While the former needs to track all dependencies between program entities, the latter allows for a reduced and thus more efficient analysis. In this paper, we start out by formally defining a policy independent information flow analysis. Next, we show how to specialize this IFA via policy specific variable tracking, and prove soundness of the specialization. We furthermore investigate refinement relationships between policies, allowing an IFA for one policy to be employed for its refinements. As policy refinement depends on concrete program entities, we additionally propose a precomputation of policy refinement conditions, enabling an efficient refinement check for concrete programs.}}, author = {{Töws, Manuel and Wehrheim, Heike}}, booktitle = {{Formal Methods and Software Engineering - 19th International Conference on Formal Engineering Methods (ICFEM 2017)}}, isbn = {{9783319686899}}, issn = {{0302-9743}}, pages = {{362--378}}, publisher = {{Springer International Publishing}}, title = {{{Policy Dependent and Independent Information Flow Analyses}}}, doi = {{10.1007/978-3-319-68690-5_22}}, year = {{2017}}, } @article{58, abstract = {{Network function virtualization and software-defined networking allow services consisting of virtual network functions to be designed and implemented with great flexibility by facilitating automatic deployments, migrations, and reconfigurations for services and their components. For extended flexibility, we go beyond seeing services as a fixed chain of functions. We define the service structure in a flexible way that enables changing the order of functions in case the functionality of the service is not influenced by this, and propose a YANG data model for expressing this flexibility. Flexible structures allow the network orchestration system to choose the optimal composition of service components that for example gives the best results for placement of services in the network. When number of flexible services and number of components in each service increase, combinatorial explosion limits the practical use of this flexibility. In this paper, we describe a selection heuristic that gives a Pareto set of the possible compositions of a service as well as possible combinations of different services, with respect to different optimization objectives. Moreover, we present a heuristic algorithm for placement of a combination of services, which aims at placing service components along shortest paths that have enough capacity for accommodating the services. By applying these solutions, we show that allowing flexibility in the service structure is feasible.}}, author = {{Dräxler, Sevil and Karl, Holger}}, journal = {{International Journal of Network Management}}, number = {{2}}, pages = {{1----16}}, publisher = {{Wiley Online Library}}, title = {{{Specification, Composition, and Placement of Network Services with Flexible Structures}}}, doi = {{10.1002/nem.1963}}, year = {{2017}}, }