@phdthesis{547, abstract = {{In recent years, the role of process models in the development of enterprise software systems has increased continuously. Today, process models are used at different levels in the development process. For instance, in Service-Oriented Architectures (SOA), high-level business process models become input for the development of IT systems, and in running IT systems executable process models describe choreographies of Web Services. A key driver behind this development is the necessity for a closer alignment of business and IT requirements, to reduce the reaction times in software development to frequent changes in competitive markets.Typically in these scenarios, process models are developed, maintained, and transformed in a team environment by several stakeholders that are often from different business units, resulting in different versions. To obtain integrated process models comprising the changes applied to different versions, the versions need to be consolidated by means of model change management. Change management for process models can be compared to widely used concurrent versioning systems (CVS) and consists of the following major activities: matching of process models, detection of differences, computation of dependencies and conflicts between differences, and merging of process models.Although in general model-driven development (MDD) is accepted as a well-established development approach, there are still some shortcomings that let developers decide against MDD and for more traditional development paradigms. These shortcomings comprise a lack of fully integrated and fully featured development environments for MDD, such as a comprehensive support for model change management.In this thesis, we present a framework for process model change management. The framework is based on an intermediate representation for process models that serves as an abstraction of specific process modeling languages and focuses on common syntactic and semantic core concepts for the modeling of workflow in process models. Based on the intermediate representation, we match process models in versioning scenarios and compute differences between process models generically. Further, we consider the analysis of dependencies between differences and show how conflicts between differences can be computed by taking into account the semantics of the modeling language.As proof-of concept, we have implemented major parts of this framework in terms of a prototype. The detection of differences and dependencies contributed also to the Compare & Merge framework for the IBM WebSphere Business Modeler V 7.0 [1] (WBM), which was released as a product in fall 2009.}}, author = {{Gerth, Christian}}, publisher = {{Universität Paderborn}}, title = {{{Business Process Models - Change Management}}}, doi = {{10.1007/978-3-642-38604-6}}, year = {{2013}}, } @inproceedings{548, abstract = {{Peer-to-peer systems scale to millions of nodes and provide routing and storage functions with best effort quality. In order to provide a guaranteed quality of the overlay functions, even under strong dynamics in the network with regard to peer capacities, online participation and usage patterns, we propose to calibrate the peer-to-peer overlay and to autonomously learn which qualities can be reached. For that, we simulate the peer-to-peer overlay systematically under a wide range of parameter configurations and use neural networks to learn the effects of the configurations on the quality metrics. Thus, by choosing a specific quality setting by the overlay operator, the network can tune itself to the learned parameter configurations that lead to the desired quality. Evaluation shows that the presented self-calibration succeeds in learning the configuration-quality interdependencies and that peer-to-peer systems can learn and adapt their behavior according to desired quality goals.}}, author = {{Graffi, Kalman and Klerx, Timo}}, booktitle = {{Proceedings of the International Conference on Peer-to-Peer Computing (P2P'13)}}, pages = {{1--5}}, title = {{{Bootstrapping Skynet: Calibration and Autonomic Self-Control of Structured Peer-to-Peer Networks}}}, doi = {{10.1109/P2P.2013.6688720}}, year = {{2013}}, } @inproceedings{551, abstract = {{In the service-oriented computing domain, the number of available software services steadily increased in recent years, favored by the rise of cloud computing with its attached delivery models like Software-as-a-Service (SaaS). To fully leverage the opportunities provided by these services for developing highly flexible and aligned SOA, integration of new services as well as the substitution of existing services must be simplified. As a consequence, approaches for automated and accurate service discovery and composition are needed. In this paper, we propose an automatic service composition approach as an extension to our earlier work on automatic service discovery. To ensure accurate results, it matches service requests and available offers based on their structural as well as behavioral aspects. Afterwards, possible service compositions are determined by composing service protocols through a composition strategy based on labeled transition systems.}}, author = {{Huma, Zille and Gerth, Christian and Engels, Gregor and Juwig, Oliver}}, booktitle = {{Proceedings of the 11th International Conference on Service Oriented Computing (ICSOC'13)}}, pages = {{524----532}}, title = {{{Automated Service Composition for On-the-Fly SOAs}}}, doi = {{10.1007/978-3-642-45005-1_42}}, year = {{2013}}, } @misc{553, author = {{Kohn, Kathlén}}, publisher = {{Universität Paderborn}}, title = {{{Attributbasierte Verschlüsselung mittels Gittermethoden - Mathematische Grundlagen, Verfahren und Sicherheitsbeweise}}}, year = {{2013}}, } @misc{555, author = {{Setzer, Alexander}}, publisher = {{Universität Paderborn}}, title = {{{Approximation Algorithms for the Linear Arrangement of Special Classes of Graphs}}}, year = {{2013}}, } @proceedings{558, editor = {{Flocchini, Paola and Gao, Jie and Kranakis, Evangelos and Meyer auf der Heide, Friedhelm}}, location = {{Sophia Antipolis, France}}, publisher = {{Springer}}, title = {{{Algorithms for Sensor Systems - 9th International Symposium on Algorithms and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics}}}, doi = {{10.1007/978-3-642-45346-5}}, volume = {{8243}}, year = {{2013}}, } @inproceedings{559, abstract = {{Distributed hash tables are very versatile to use, as distributed storage is a desirable feature for various applications. Typical structured overlays like Chord, Pastry or Kademlia consider only homogeneous nodes with equal capacities, which does not resemble reality. In a practical use case, nodes might get overloaded by storing popular data. In this paper, we present a general approach to enable capacity awareness and load-balancing capability of homogeneous structured overlays. We introduce a hierarchical second structured overlay aside, which allows efficient capacity-based access on the nodes in the system as hosting mirrors. Simulation results show that the structured overlay is able to store various contents, such as of a social network, with only a negligible number of overloaded peers. Content, even if very popular, is hosted by easily findable capable peers. Thus, long-existing and well-evaluated overlays like Chord or Pastry can be used to create attractive DHT-based applications.}}, author = {{Wette, Philip and Graffi, Kalman}}, booktitle = {{Proceedings of the Conference on Networked Systems (NetSys)}}, pages = {{35--42}}, title = {{{Adding Capacity-Aware Storage Indirection to Homogeneous Distributed Hash Tables}}}, doi = {{10.1109/NetSys.2013.9}}, year = {{2013}}, } @inproceedings{560, abstract = {{In the last decades, development turned from monolithic software products towards more flexible software components that can be provided on world-wide markets in form of services. Customers request such services or compositions of several services. However, in many cases, discovering the best services to address a given request is a tough challenge and requires expressive, gradual matching results, considering different aspects of a service description, e.g., inputs/ouputs, protocols, or quality properties. Furthermore,in situations in which no service exactly satifies the request, approximate matching which can deal with a certain amount of fuzziness becomes necessary. There is a wealth of service matching approaches, but it is not clear whether there is a comprehensive, fuzzy matching approach which addresses all these challenges. Although there are a few service matchingsurveys, none of them is able to answer this question. In this paper, we perform a systematic literature survey of 35 (outof 504) service matching approaches which consider fuzzy matching. Based on this survey, we propose a classication,discuss how different matching approaches can be combined into a comprehensive matching method, and identify future research challenges.}}, author = {{Platenius, Marie and von Detten, Markus and Becker, Steffen and Schäfer, Wilhelm and Engels, Gregor}}, booktitle = {{Proceedings of the 16th International ACM Sigsoft Symposium on Component-Based Software Engineering}}, pages = {{143--152}}, title = {{{A Survey of Fuzzy Service Matching Approaches in the Context of On-The-Fly Computing}}}, doi = {{10.1145/2465449.2465454}}, year = {{2013}}, } @inproceedings{562, abstract = {{In Distributed Cloud Computing, applications are deployed across many data centres at topologically diverse locations to improved network-related quality of service (QoS). As we focus on interactive applications, we minimize the latency between users and an application by allocating Cloud resources nearby the customers. Allocating resources at all locations will result in the best latency but also in the highest expenses. So we need to find an optimal subset of locations which reduces the latency but also the expenses – the facility location problem (FLP). In addition, we consider resource capacity restrictions, as a resource can only serve a limited amount of users. An FLP can be globally solved. Additionally, we propose a local, distributed heuristic. This heuristic is running within the network and does not depend on a global component. No distributed, local approximations for the capacitated FLP have been proposed so far due to the complexity of the problem. We compared the heuristic with an optimal solution obtained from a mixed integer program for different network topologies. We investigated the influence of different parameters like overall resource utilization or different latency weights.}}, author = {{Keller, Matthias and Pawlik, Stefan and Pietrzyk, Peter and Karl, Holger}}, booktitle = {{Proceedings of the 6th International Conference on Utility and Cloud Computing (UCC) workshop on Distributed cloud computing}}, pages = {{429--434}}, title = {{{A Local Heuristic for Latency-Optimized Distributed Cloud Deployment}}}, doi = {{10.1109/UCC.2013.85}}, year = {{2013}}, } @inproceedings{563, abstract = {{Dominating set based virtual backbones are used for rou-ting in wireless ad-hoc networks. Such backbones receive and transmit messages from/to every node in the network. Existing distributed algorithms only consider undirected graphs, which model symmetric networks with uniform transmission ranges. We are particularly interested in the well-established disk graphs, which model asymmetric networks with non-uniform transmission ranges. The corresponding graph theoretic problem seeks a strongly connected dominating-absorbent set of minimum cardinality in a digraph. A subset of nodes in a digraph is a strongly connected dominating-absorbent set if the subgraph induced by these nodes is strongly connected and each node in the graph is either in the set or has both an in-neighbor and an out-neighbor in it. We introduce the first distributed algorithm for this problem in disk graphs. The algorithm gives an O(k^4) -approximation ratio and has a runtime bound of O(Diam) where Diam is the diameter of the graph and k denotes the transmission ratio r_{max}/r_{min} with r_{max} and r_{min} being the maximum and minimum transmission range, respectively. Moreover, we apply our algorithm on the subgraph of disk graphs consisting of only bidirectional edges. Our algorithm gives an O(ln k) -approximation and a runtime bound of O(k^8 log^∗ n) , which, for bounded k , is an optimal approximation for the problem, following Lenzen and Wattenhofer’s Ω(log^∗ n) runtime lower bound for distributed constant approximation in disk graphs.}}, author = {{Markarian, Christine and Meyer auf der Heide, Friedhelm and Schubert, Michael}}, booktitle = {{Proceedings of the 9th International Symposium on Algorithms and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics (ALGOSENSORS)}}, pages = {{217--227}}, title = {{{A Distributed Approximation Algorithm for Strongly Connected Dominating-Absorbent Sets in Asymmetric Wireless Ad-Hoc Networks}}}, doi = {{10.1007/978-3-642-45346-5_16}}, year = {{2013}}, } @inproceedings{564, abstract = {{We consider the problem of resource discovery in distributed systems. In particular we give an algorithm, such that each node in a network discovers the add ress of any other node in the network. We model the knowledge of the nodes as a virtual overlay network given by a directed graph such that complete knowledge of all nodes corresponds to a complete graph in the overlay network. Although there are several solutions for resource discovery, our solution is the first that achieves worst-case optimal work for each node, i.e. the number of addresses (O(n)) or bits (O(nlogn)) a node receives or sendscoincides with the lower bound, while ensuring only a linearruntime (O(n)) on the number of rounds.}}, author = {{Kniesburges, Sebastian and Koutsopoulos, Andreas and Scheideler, Christian}}, booktitle = {{Proceedings of 20th International Colloqium on Structural Information and Communication Complexity (SIROCCO)}}, pages = {{165--176}}, title = {{{A Deterministic Worst-Case Message Complexity Optimal Solution for Resource Discovery}}}, doi = {{10.1007/978-3-319-03578-9_14}}, year = {{2013}}, } @article{6729, author = {{Coumans, Dion and Gehrke, Mai and van Rooijen, Lorijn}}, issn = {{1570-8683}}, journal = {{Journal of Applied Logic}}, number = {{1}}, pages = {{50--66}}, publisher = {{Elsevier BV}}, title = {{{Relational semantics for full linear logic}}}, doi = {{10.1016/j.jal.2013.07.005}}, volume = {{12}}, year = {{2013}}, } @inproceedings{6730, author = {{Place, Thomas and van Rooijen, Lorijn and Zeitoun, Marc}}, booktitle = {{Annual Conference on Foundations of Software Technology and Theoretical Computer Science, (FSTTCS) 2013, December 12-14, 2013, Guwahati, India}}, pages = {{363----375}}, publisher = {{Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik}}, title = {{{Separating Regular Languages by Locally Testable and Locally Threshold Testable Languages}}}, doi = {{10.4230/LIPICS.FSTTCS.2013.363}}, volume = {{24}}, year = {{2013}}, } @inproceedings{6732, author = {{Place, Thomas and van Rooijen, Lorijn and Zeitoun, Marc}}, booktitle = {{Mathematical Foundations of Computer Science 2013 - 38th International Symposium, (MFCS) 2013, Klosterneuburg, Austria, August 26-30, 2013}}, isbn = {{9783642403125}}, issn = {{0302-9743}}, pages = {{729--740}}, publisher = {{Springer Berlin Heidelberg}}, title = {{{Separating Regular Languages by Piecewise Testable and Unambiguous Languages}}}, doi = {{10.1007/978-3-642-40313-2_64}}, year = {{2013}}, } @article{10604, author = {{Happe, Markus and Lübbers, Enno and Platzner, Marco}}, journal = {{International Journal of Real-time Image Processing}}, number = {{1}}, pages = {{95 -- 110}}, publisher = {{Springer}}, title = {{{A Self-adaptive Heterogeneous Multi-core Architecture for Embedded Real-time Video Object Tracking}}}, doi = {{doi:10.1007/s11554-011-0212-y}}, volume = {{8}}, year = {{2013}}, } @inproceedings{10620, author = {{Anwer, Jahanzeb and Meisner, Sebastian and Platzner, Marco}}, booktitle = {{Reconfigurable Computing and FPGAs (ReConFig), 2013 International Conference on}}, keywords = {{fault tolerant computing, field programmable gate arrays, logic design, reliability, BYU-LANL tool, DRM tool flow, FPGA based hardware designs, avionic application, device technologies, dynamic reliability management, fault-tolerant operation, hardware designs, reconfiguring reliability levels, space applications, Field programmable gate arrays, Hardware, Redundancy, Reliability engineering, Runtime, Tunneling magnetoresistance}}, pages = {{1--6}}, title = {{{Dynamic reliability management: Reconfiguring reliability-levels of hardware designs at runtime}}}, doi = {{10.1109/ReConFig.2013.6732280}}, year = {{2013}}, } @misc{10626, author = {{Bick, Christian}}, publisher = {{Paderborn University}}, title = {{{Beschleunigung von Tiefenberechnung aus Stereobildern durch FPGA-basierte Datenflussrechner}}}, year = {{2013}}, } @inproceedings{10634, author = {{Boschmann, Alexander and Nofen, Barbara and Platzner, Marco}}, booktitle = {{Proc. IEEE Int. Conf. Eng. Med. Biolog. (EMBC)}}, title = {{{Improving transient state myoelectric signal recognition in hand movement classification using gyroscopes}}}, year = {{2013}}, } @inproceedings{10635, author = {{Boschmann, Alexander and Platzner, Marco}}, booktitle = {{Proc. IEEE ISSNIP Biosignals and Biorobotics Conference (BRC)}}, title = {{{Reducing the limb position effect in pattern recognition based myoelectric control using a high density electrode array}}}, year = {{2013}}, } @inproceedings{10655, author = {{Glette, Kyrre and Kaufmann, Paul and Assad, Christopher and Wolf, Michael}}, booktitle = {{IEEE Intl. Conf. on Evolvable Systems (ICES)}}, pages = {{1--1}}, publisher = {{Springer}}, title = {{{Investigating Evolvable Hardware Classification for the BioSleeve Electromyographic Interface}}}, volume = {{1}}, year = {{2013}}, }