@techreport{4915,
author = {Mir Djawadi, Behnud and Fahr, Rene},
title = {{The impact of risk perception and risk attitudes on corrupt behavior: Evidence from a petty corruption experiment}},
year = {2013},
}
@misc{493,
author = {Terentjew, Artjom},
publisher = {Universität Paderborn},
title = {{Reputationssysteme und Gerichtsverfahren als Wekzeuge zur Sicherstellung von Qualitätsstandards in Transaktionen}},
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{6271,
author = {Weber, H and Wehner, M and Kabst, Rüdiger},
title = {{Institutional Determinants of Work-Family Practices: An International Comparative Examination. }},
year = {2013},
}
@inbook{6276,
author = {Klompmaker, Florian and Paelke, Volker and Fischer, Holger Gerhard},
booktitle = {Distributed, Ambient, and Pervasive Interactions},
isbn = {9783642393501},
issn = {0302-9743},
location = {Las Vegas, USA},
pages = {32--41},
publisher = {Springer Berlin Heidelberg},
title = {{A Taxonomy-Based Approach towards NUI Interaction Design}},
doi = {10.1007/978-3-642-39351-8_4},
volume = {8028},
year = {2013},
}
@misc{537,
author = {Heindorf, Stefan},
publisher = {Universität Paderborn},
title = {{Dispersion of Multi-Robot Teams}},
year = {2013},
}
@inproceedings{544,
abstract = {Comparative evaluations of peer-to-peer protocols through simulations are a viable approach to judge the performance and costs of the individual protocols in large-scale networks. In order to support this work, we enhanced the peer-to-peer systems simulator PeerfactSim.KOM with a fine-grained analyzer concept, with exhaustive automated measurements and gnuplot generators as well as a coordination control to evaluate a set of experiment setups in parallel. Thus, by configuring all experiments and protocols only once and starting the simulator, all desired measurements are performed, analyzed, evaluated and combined, resulting in a holistic environment for the comparative evaluation of peer-to-peer systems.},
author = {Feldotto, Matthias and Graffi, Kalman},
booktitle = {Proceedings of the International Conference on High Performance Computing and Simulation (HPCS'13)},
pages = {99--106},
title = {{Comparative Evaluation of Peer-to-Peer Systems Using PeerfactSim.KOM}},
doi = {10.1109/HPCSim.2013.6641399},
year = {2013},
}
@misc{549,
author = {Bick, Christian},
publisher = {Universität Paderborn},
title = {{Beschleunigung von Tiefenberechung aus Stereobildern durch FPGA-basierte Datenflussrechner}},
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{556,
author = {Nickel, Tobias},
publisher = {Universität Paderborn},
title = {{Analyse von Benutzeranforderungen von Service-Kompositionen mittels Modelchecking}},
year = {2013},
}