@misc{614, author = {{Lehrig, Sebastian}}, publisher = {{Universität Paderborn}}, title = {{{Empirischer, quantitativer Vergleich von Modelltransformationssprachen}}}, year = {{2012}}, } @inbook{6148, author = {{Baum, M and Schwens, C and Kabst, R}}, booktitle = {{Handbook of Research on Born Globals}}, editor = {{Gabrielsson, M and Kirpalani, M}}, pages = {{36--45}}, publisher = {{Edward Elgar Publishing Ltd.}}, title = {{{Determinants of Different Types of Born Globals.}}}, year = {{2012}}, } @inbook{6149, author = {{Isidor, R and Schwens, C and Kabst, R}}, booktitle = {{Markteintrittsstrategien - Dynamik und Komplexität}}, editor = {{Zentes, J}}, isbn = {{978-3-8349-3503-8}}, pages = {{193--205}}, title = {{{Die Messung von Joint-Venture Erfolg}}}, year = {{2012}}, } @misc{616, author = {{Kluczniok, Sven}}, publisher = {{Universität Paderborn}}, title = {{{Effiziente Paketbildung in mehrdimensionalen Verhandlungsproblemen}}}, year = {{2012}}, } @inproceedings{617, abstract = {{In this paper, a color based feature extraction and classification approach for image processing in embedded systems in presented. The algorithms and data structures developed for this approach pay particular attention to reduce memory consumption and computation power of the entire image processing, since embedded systems usually impose strong restrictions regarding those resources. The feature extraction is realized in terms of an image segmentation algorithm. The criteria of homogeneity for merging pixels and regions is provided by the color classification mechanism, which incorporates appropriate methods for defining, representing and accessing subspaces in the working color space. By doing so, pixels and regions with color values that belong to the same color class can be merged. Furthermore, pixels with redundant color values that do not belong to any pre-defined color class can be completely discarded in order to minimize computational effort. Subsequently, the extracted regions are converted to a more convenient feature representation in terms of statistical moments up to and including second order. For evaluation, the whole image processing approach is applied to a mobile representative of embedded systems within the scope of a simple real-world scenario.}}, author = {{Jungmann, Alexander and Kleinjohann, Bernd and Kleinjohann, Elisabeth and Bieshaar, Maarten}}, booktitle = {{Proceedings of the Fourth International Conference on Resource Intensive Applications and Services (INTENSIVE)}}, pages = {{22--29}}, title = {{{Efficient Color-Based Image Segmentation and Feature Classification for Image Processing in Embedded Systems}}}, year = {{2012}}, } @misc{618, author = {{Kurras, Sven}}, publisher = {{Universität Paderborn}}, title = {{{Distributed Sampling of Regular Graphs}}}, year = {{2012}}, } @inproceedings{619, abstract = {{Dynamics in networks is caused by a variety of reasons, like nodes moving in 2D (or 3D) in multihop cellphone networks, joins and leaves in peer-to-peer networks, evolution in social networks, and many others. In order to understand such kinds of dynamics, and to design distributed algorithms that behave well under dynamics, many ways to model dynamics are introduced and analyzed w.r.t. correctness and eciency of distributed algorithms. In [16], Kuhn, Lynch, and Oshman have introduced a very general, worst case type model of dynamics: The edge set of the network may change arbitrarily from step to step, the only restriction is that it is connected at all times and the set of nodes does not change. An extended model demands that a xed connected subnetwork is maintained over each time interval of length T (T-interval dynamics). They have presented, among others, algorithms for counting the number of nodes under such general models of dynamics.In this paper, we generalize their models and algorithms by adding random edge faults, i.e., we consider fault-prone dynamic networks: We assume that an edge currently existing may fail to transmit data with some probability p. We rst observe that strong counting, i.e., each node knows the correct count and stops, is not possible in a model with random edge faults. Our main two positive results are feasibility and runtime bounds for weak counting, i.e., stopping is no longer required (but still a correct count in each node), and for strong counting with an upper bound, i.e., an upper bound N on n is known to all nodes.}}, author = {{Brandes, Philipp and Meyer auf der Heide, Friedhelm}}, booktitle = {{Proceedings of the 4th Workshop on Theoretical Aspects of Dynamic Distributed Systems (TADDS)}}, pages = {{9--14}}, title = {{{Distributed Computing in Fault-Prone Dynamic Networks}}}, doi = {{10.1145/2414815.2414818}}, year = {{2012}}, } @misc{620, author = {{Mittendorf, Robert}}, publisher = {{Universität Paderborn}}, title = {{{Datenschutzgerechtes DRM im Cloud Computing}}}, year = {{2012}}, } @misc{621, author = {{Sekula, Stephan}}, publisher = {{Universität Paderborn}}, title = {{{Datenschutzgerechte E-Payment-Schemata im On-The-Fly Computing}}}, year = {{2012}}, } @inproceedings{622, abstract = {{Behavioral modeling languages are most useful if their behavior is specified formally such that it can e.g. be analyzed and executed automatically. Obviously, the quality of such behavior specifications is crucial. The rule-based semantics specification technique Dynamic Meta Modeling (DMM) honors this by using the approach of Test-driven Semantics Specification (TDSS), which makes sure that the specification at hand at least describes the correct behavior for a suite of test models. However, in its current state TDSS does not provide any means to measure the quality of such a test suite. In this paper, we describe how we have applied the idea of test coverage to TDSS. Similar to common approaches of defining test coverage criteria, we describe a data structure called invocation graph containing possible orders of applications ofDMM rules. Then we define different coverage criteria based on that data structure, taking the rule applications caused by the test suite’s models into account. Our implementation of the described approach gives the language engineer using DMM a means to reason about the quality of the language’s test suite, and also provides hints on how to improve that quality by adding dedicated test models to the test suite.}}, author = {{Arifulina, Svetlana and Engels, Gregor and Soltenborn, Christian}}, booktitle = {{Proceedings of the 11th International Workshop on Graph Transformation and Visual Modeling Techniques (GT-VMT)}}, title = {{{Coverage Criteria for Testing DMM Specifications}}}, doi = {{10.14279/tuj.eceasst.47.718}}, year = {{2012}}, } @inproceedings{623, abstract = {{This paper initiates the formal study of a fundamental problem: How to efficiently allocate a shared communication medium among a set of K co-existing networks in the presence of arbitrary external interference? While most literature on medium access focuses on how to share a medium among nodes, these approaches are often either not directly applicable to co-existing networks as they would violate the independence requirement, or they yield a low throughput if applied to multiple networks. We present the randomized medium access (MAC) protocol COMAC which guarantees that a given communication channel is shared fairly among competing and independent networks, and that the available bandwidth is used efficiently. These performance guarantees hold in the presence of arbitrary external interference or even under adversarial jamming. Concretely, we show that the co-existing networks can use a Ω(ε2 min{ε, 1/poly(K)})-fraction of the non-jammed time steps for successful message transmissions, where ε is the (arbitrarily distributed) fraction of time which is not jammed.}}, author = {{Richa, Andrea W. and Scheideler, Christian and Schmid, Stefan and Zhang, Jin }}, booktitle = {{Proceedings of the 31st Annual ACM SIGACT-SIGOPS Symposium on Principles and Distributed Computing (PODC)}}, pages = {{291--300}}, title = {{{Competitive and fair throughput for co-existing networks under adversarial interference}}}, doi = {{10.1145/2332432.2332488}}, year = {{2012}}, } @misc{624, author = {{Jakobs, Marie-Christine}}, publisher = {{Universität Paderborn}}, title = {{{Change and Validity Analysis in Deductive Program Verification}}}, year = {{2012}}, } @inproceedings{625, abstract = {{This paper initiates the study of self-adjusting distributed data structures for networks. In particular, we present SplayNets: a binary search tree based network that is self-adjusting to routing request.We derive entropy bounds on the amortized routing cost and show that our splaying algorithm has some interesting properties.}}, author = {{Schmid, Stefan and Avin, Chen and Scheideler, Christian and Häupler, Bernhard and Lotker, Zvi}}, booktitle = {{Proceedings of the 26th International Symposium on Distributed Computing (DISC)}}, pages = {{439--440}}, title = {{{Brief Announcement: SplayNets - Towards Self-Adjusting Distributed Data Structures}}}, doi = {{10.1007/978-3-642-33651-5_47}}, year = {{2012}}, } @article{6250, author = {{Paelke, Volker and Nebe, Karsten and Geiger, Christian and Klompmaker, Florian and Fischer, Holger Gerhard}}, issn = {{1682-1777}}, journal = {{ISPRS - International Archives of the Photogrammetry, Remote Sensing and Spatial Information Sciences}}, pages = {{55--60}}, publisher = {{Copernicus GmbH}}, title = {{{Multi-Modal, Multi-Touch Interaction with Maps in Disaster Management Applications}}}, doi = {{10.5194/isprsarchives-xxxix-b8-55-2012}}, volume = {{XXXIX-B8}}, year = {{2012}}, } @inproceedings{626, abstract = {{The design of ecient search structures for peer-to-peer systems has attracted a lot of attention in recent years. In this announcement we address the problem of nding the predecessor in a key set and present an ecient data structure called hashed Predecessor Patricia trie. Our hashed Predecessor Patricia trie supports PredecessorSearch(x) and Insert(x) and Delete(x) in O(log log u) hash table accesses when u is the size of the universe of the keys. That is the costs only depend on u and not the size of the data structure. One feature of our approach is that it only uses the lookup interface of the hash table and therefore hash table accesses may be realized by any distributed hash table (DHT).}}, author = {{Kniesburges, Sebastian and Scheideler, Christian}}, booktitle = {{Proceedings of the 26th International Symposium on Distributed Computing (DISC)}}, pages = {{435--436}}, title = {{{Brief Announcement: Hashed Predecessor Patricia Trie - A Data Structure for Efficient Predecessor Queries in Peer-to-Peer Systems}}}, doi = {{10.1007/978-3-642-33651-5_45}}, year = {{2012}}, } @inproceedings{627, abstract = {{Block Abstraction Memoization (ABM) is a technique in software model checking that exploits the modularity of programs during verification by caching. To this end, ABM records the results of block analyses and reuses them if possible when revisiting the same block again. In this paper we present an implementation of ABM into the predicate-analysis component of the software-verification framework CPAchecker. With our participation at the Competition on Software Verification we aim at providing evidence that ABM can not only substantially increase the efficiency of predicate analysis but also enables verification of a wider range of programs.}}, author = {{Wonisch, Daniel}}, booktitle = {{Proceedings of the 18th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS)}}, pages = {{531--533}}, title = {{{Block Abstraction Memoization for CPAchecker}}}, doi = {{10.1007/978-3-642-28756-5_41}}, year = {{2012}}, } @inproceedings{6275, author = {{Schneid, M and Steinmetz, Holger and Isidor, R and Kabst, Rüdiger}}, title = {{{Diversität, Konflikte und Leistung in Teams: Ein meta-analytisches Strukturgleichungsmodell}}}, year = {{2012}}, } @inproceedings{6277, author = {{Kabst, Rüdiger}}, title = {{{Endogeneity in the behavioral sciences: An illustration with real data}}}, year = {{2012}}, } @inproceedings{628, abstract = {{Network creation games model the creation and usage costs of networks formed by a set of selfish peers.Each peer has the ability to change the network in a limited way, e.g., by creating or deleting incident links.In doing so, a peer can reduce its individual communication cost.Typically, these costs are modeled by the maximum or average distance in the network.We introduce a generalized version of the basic network creation game (BNCG).In the BNCG (by Alon et al., SPAA 2010), each peer may replace one of its incident links by a link to an arbitrary peer.This is done in a selfish way in order to minimize either the maximum or average distance to all other peers.That is, each peer works towards a network structure that allows himself to communicate efficiently with all other peers.However, participants of large networks are seldom interested in all peers.Rather, they want to communicate efficiently with a small subset only.Our model incorporates these (communication) interests explicitly.Given peers with interests and a communication network forming a tree, we prove several results on the structure and quality of equilibria in our model.We focus on the MAX-version, i.e., each node tries to minimize the maximum distance to nodes it is interested in, and give an upper bound of O(\sqrt(n)) for the private costs in an equilibrium of n peers.Moreover, we give an equilibrium for a circular interest graph where a node has private cost Omega(\sqrt(n)), showing that our bound is tight.This example can be extended such that we get a tight bound of Theta(\sqrt(n)) for the price of anarchy.For the case of general networks we show the price of anarchy to be Theta(n).Additionally, we prove an interesting connection between a maximum independent set in the interest graph and the private costs of the peers.}}, author = {{Cord-Landwehr, Andreas and Huellmann (married name: Eikel), Martina and Kling, Peter and Setzer, Alexander}}, booktitle = {{Proceedings of the 5th International Symposium on Algorithmic Game Theory (SAGT)}}, pages = {{72----83}}, title = {{{Basic Network Creation Games with Communication Interests}}}, doi = {{10.1007/978-3-642-33996-7_7}}, year = {{2012}}, } @inproceedings{6281, author = {{Wehner, M C and Giardini, A and Kabst, Rüdiger}}, title = {{{Recruitment Process Outsourcing and Applicant Reactions: Does Image Make a Difference?}}}, year = {{2012}}, }