@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},
}
@techreport{221,
author = {Platenius, Marie Christin and Josifovska, Klementina and van Rooijen, Lorijn and Arifulina, Svetlana and Becker, Matthias and Engels, Gregor and Schäfer, Wilhelm},
publisher = {Universität Paderborn},
title = {{An Overview of Service Specification Language and Matching in On-The-Fly Computing (v0.3)}},
year = {2016},
}
@inproceedings{226,
abstract = {Error detection, localization and correction are time-intensive tasks in software development, but crucial to deliver functionally correct products. Thus, automated approaches to these tasks have been intensively studied for standard software systems. For model-based software systems, the situation is different. While error detection is still well-studied, error localization and correction is a less-studied domain. In this paper, we examine error localization and correction for models of service compositions. Based on formal definitions of error and correction in this context, we show that the classical approach of error localization and correction, i.e. first determining a set of suspicious statements and then proposing changes to these statements, is ineffective in our context. In fact, it lessens the chance to succeed in finding a correction at all.In this paper, we introduce correction proposal as a novel approach on error correction in service compositions integrating error localization and correction in one combined step. In addition, we provide an algorithm to compute such correction proposals automatically.},
author = {Krämer, Julia and Wehrheim, Heike},
booktitle = {Proceedings of the 1st International Workshop on Formal to Practical Software Verification and Composition (VeryComp 2016)},
pages = {445----457},
title = {{A Formal Approach to Error Localization and Correction in Service Compositions}},
doi = {10.1007/978-3-319-50230-4_35},
year = {2016},
}
@misc{2898,
author = {Weis, Eduard},
title = {{Searchable Encryption}},
year = {2016},
}
@inbook{29,
abstract = {In this chapter, we present an introduction to the ReconOS operating system for reconfigurable computing. ReconOS offers a unified multi-threaded programming model and operating system services for threads executing in software and threads mapped to reconfigurable hardware. By supporting standard POSIX operating system functions for both software and hardware threads, ReconOS particularly caters to developers with a software background, because developers can use well-known mechanisms such as semaphores, mutexes, condition variables, and message queues for developing hybrid applications with threads running on the CPU and FPGA concurrently. Through the semantic integration of hardware accelerators into a standard operating system environment, ReconOS allows for rapid design space exploration, supports a structured application development process and improves the portability of applications between different reconfigurable computing systems.},
author = {Agne, Andreas and Platzner, Marco and Plessl, Christian and Happe, Markus and Lübbers, Enno},
booktitle = {FPGAs for Software Programmers},
editor = {Koch, Dirk and Hannig, Frank and Ziener, Daniel},
isbn = {978-3-319-26406-6},
pages = {227--244},
publisher = {Springer International Publishing},
title = {{ReconOS}},
doi = {10.1007/978-3-319-26408-0_13},
year = {2016},
}
@article{2956,
author = {Göpffarth, Dirk and Kopetsch, Thomas and Schmitz, Hendrik},
journal = {Health economics},
number = {7},
pages = {801----815},
title = {{Determinants of regional variation in health expenditures in Germany}},
volume = {25},
year = {2016},
}