@misc{182,
author = {Kesmen, Belma},
publisher = {Universität Paderborn},
title = {{Marktmissbrauch in der Internetökonomie - Eine wettbewerbspolitische Analyse}},
year = {2016},
}
@inbook{1845,
author = {W. Richa, Andrea and Scheideler, Christian},
booktitle = {Encyclopedia of Algorithms},
pages = {999----1002},
title = {{Jamming-Resistant MAC Protocols for Wireless Networks}},
doi = {10.1007/978-1-4939-2864-4_593},
year = {2016},
}
@misc{187,
booktitle = {Transactions on Parallel Computing (TOPC)},
editor = {Meyer auf der Heide, Friedhelm},
number = {1},
pages = {1},
title = {{Introduction to the Special Issue on SPAA 2014}},
doi = {10.1145/2936716},
year = {2016},
}
@article{175,
abstract = {Today, service compositions often need to be assembled or changed on-the-fly, which leaves only little time for quality assurance. Moreover, quality assurance is complicated by service providers only giving information on their services in terms of domain specific concepts with only limited semantic meaning.In this paper, we propose a method for constructing service compositions based on pre-verified templates. Templates, given as workflow descriptions, are typed over a (domain-independent) template ontology defining concepts and predicates. Their meaning is defined by an abstract semantics, leaving the specific meaning of ontology concepts open, however, only up to given ontology rules. Templates are proven correct using a Hoare-style proof calculus, extended by a specific rule for service calls. Construction of service compositions amounts to instantiation of templates with domain-specific services. Correctness of an instantiation can then simply be checked by verifying that the domain ontology (a) adheres to the rules of the template ontology, and (b) fulfills the constraints of the employed template.},
author = {Walther, Sven and Wehrheim, Heike},
journal = {Science of Computer Programming},
pages = {2----23},
publisher = {Elsevier},
title = {{On-The-Fly Construction of Provably Correct Service Compositions - Templates and Proofs}},
doi = {10.1016/j.scico.2016.04.002},
year = {2016},
}
@article{1922,
abstract = {We construct two-player two-strategy game-theoretic models of by-product mutualism, where our focus lies on the way in which the probability of cooperation among players is affected by the degree of adversity facing the players. In our first model, cooperation consists of the production of a public good, and adversity is linked to the degree of complementarity of the players׳ efforts in producing the public good. In our second model, cooperation consists of the defense of a public, and/or a private good with by-product benefits, and adversity is measured by the number of random attacks (e.g., by a predator) facing the players. In both of these models, our analysis confirms the existence of the so-called boomerang effect, which states that in a harsh environment, the individual player has few incentives to unilaterally defect in a situation of joint cooperation. Focusing on such an effect in isolation leads to the "common-enemy" hypothesis that a larger degree of adversity increases the probability of cooperation. Yet, we also find that a sucker effect may simultaneously exist, which says that in a harsh environment, the individual player has few incentives to unilaterally cooperate in a situation of joint defection. Looked at in isolation, the sucker effect leads to the competing hypothesis that a larger degree of adversity decreases the probability of cooperation. Our analysis predicts circumstances in which the "common enemy" hypothesis prevails, and circumstances in which the competing hypothesis prevails.},
author = {De Jaegher, Kris and Hoyer, Britta},
issn = {0022-5193},
journal = {Journal of Theoretical Biology},
pages = {82--97},
publisher = {Elsevier BV},
title = {{By-product mutualism and the ambiguous effects of harsher environments – A game-theoretic model}},
doi = {10.1016/j.jtbi.2015.12.034},
volume = {393},
year = {2016},
}
@misc{194,
author = {Sassenberg, Tristan},
publisher = {Universität Paderborn},
title = {{Gefälschte Online Bewertungen - Literaturüberblick}},
year = {2016},
}
@misc{214,
author = {Bemmann, Kai Sören},
publisher = {Universität Paderborn},
title = {{Commitment Schemes - Definitions, Variants, and Security}},
year = {2016},
}
@inproceedings{2367,
abstract = {One of the most popular fuzzy clustering techniques is the fuzzy K-means algorithm (also known as fuzzy-c-means or FCM algorithm). In contrast to the K-means and K-median problem, the underlying fuzzy K-means problem has not been studied from a theoretical point of view. In particular, there are no algorithms with approximation guarantees similar to the famous K-means++ algorithm known for the fuzzy K-means problem. This work initiates the study of the fuzzy K-means problem from an algorithmic and complexity theoretic perspective. We show that optimal solutions for the fuzzy K-means problem cannot, in general, be expressed by radicals over the input points. Surprisingly, this already holds for simple inputs in one-dimensional space. Hence, one cannot expect to compute optimal solutions exactly. We give the first (1+eps)-approximation algorithms for the fuzzy K-means problem. First, we present a deterministic approximation algorithm whose runtime is polynomial in N and linear in the dimension D of the input set, given that K is constant, i.e. a polynomial time approximation scheme (PTAS) for fixed K. We achieve this result by showing that for each soft clustering there exists a hard clustering with similar properties. Second, by using techniques known from coreset constructions for the K-means problem, we develop a deterministic approximation algorithm that runs in time almost linear in N but exponential in the dimension D. We complement these results with a randomized algorithm which imposes some natural restrictions on the sought solution and whose runtime is comparable to some of the most efficient approximation algorithms for K-means, i.e. linear in the number of points and the dimension, but exponential in the number of clusters.},
author = {Blömer, Johannes and Brauer, Sascha and Bujna, Kathrin},
booktitle = {2016 IEEE 16th International Conference on Data Mining (ICDM)},
isbn = {9781509054732},
keyword = {unsolvability by radicals, clustering, fuzzy k-means, probabilistic method, approximation algorithms, randomized algorithms},
location = {Barcelona, Spain},
pages = {805--810},
publisher = {IEEE},
title = {{A Theoretical Analysis of the Fuzzy K-Means Problem}},
doi = {10.1109/icdm.2016.0094},
year = {2016},
}
@inproceedings{24,
author = {Kenter, Tobias and Plessl, Christian},
booktitle = {Proc. Workshop on Heterogeneous High-performance Reconfigurable Computing (H2RC)},
title = {{Microdisk Cavity FDTD Simulation on FPGA using OpenCL}},
year = {2016},
}
@inproceedings{219,
abstract = {Existing software markets like Google Play allow users to search among available Apps and select one based on the description provided for the App or based on its rating. Future software markets facilitate on-the-fly composition of such Apps based on users’ individual wishes. Realizing such On-The-Fly Computing (OTF) markets requires support of sophisticated software features. In addition, suitable orchestration among such features needs to ensure well-alignment of business and IT aspects in case of run-time changes like market dynamics. However, all these introduce new architectural and management complexities, which are specific to such markets. An architecture framework for OTF markets will include design solutions to overcome these complexities. In my PhD, I aim at identifying an architecture framework for OTF markets including main architectural building blocks and a systematic development process. Such an architecture framework enables the development of OTF markets in the future. Furthermore, this knowledge can be used as a basis to improve existing software markets by integrating missing functionalities.},
author = {Jazayeri, Bahar},
booktitle = {Proceedings of the 10th European Conference on Software Architecture (ECSA Workshops)},
pages = {42},
publisher = {ACM},
title = {{Architectural Management of On-The-Fly Computing Markets}},
doi = {10.1145/2993412.3010821},
year = {2016},
}