@inproceedings{20223,
abstract = {The semi-automatic or automatic synthesis of robot controller software is
both desirable and challenging. Synthesis of rather simple behaviors such as
collision avoidance by applying artificial evolution has been shown multiple
times. However, the difficulty of this synthesis increases heavily with
increasing complexity of the task that should be performed by the robot. We try
to tackle this problem of complexity with Artificial Homeostatic Hormone
Systems (AHHS), which provide both intrinsic, homeostatic processes and
(transient) intrinsic, variant behavior. By using AHHS the need for pre-defined
controller topologies or information about the field of application is
minimized. We investigate how the principle design of the controller and the
hormone network size affects the overall performance of the artificial
evolution (i.e., evolvability). This is done by comparing two variants of AHHS
that show different effects when mutated. We evolve a controller for a robot
built from five autonomous, cooperating modules. The desired behavior is a form
of gait resulting in fast locomotion by using the modules' main hinges.},
author = {Hamann, Heiko and Stradner, Jürgen and Schmickl, Thomas and Crailsheim, Karl},
booktitle = {Artificial Life XII (ALife XII), Odense, Denmark},
pages = {773--780},
publisher = {MIT Press},
title = {{Artificial Hormone Reaction Networks: Towards Higher Evolvability in Evolutionary Multi-Modular Robotics}},
year = {2010},
}
@inproceedings{16401,
author = {Degener, Bastian and Kempkes, Barbara and Meyer auf der Heide, Friedhelm},
booktitle = {Proceedings of the 22nd ACM symposium on Parallelism in algorithms and architectures - SPAA '10},
isbn = {9781450300797},
title = {{A local O(n2) gathering algorithm}},
doi = {10.1145/1810479.1810523},
year = {2010},
}
@unpublished{17586,
abstract = {We are given a winding chain of $n$ mobile robots between two stations in the plane, each of them having a limited viewing range. It is only guaranteed that each robot can see its two neighbors in the chain. We analyze a simple and natural parallel strategy to shorten the chain in a time model where each relay is allowed to move up to a distance of $\delta$ in each time step. This model fills the gap between the previously used discrete time model and the continuous time model which was introduced recently in \cite{sirocco}. We analyze the strategy with respect to two quality measures: the number of time steps and the maximum distance to be traveled by the robots, which are the major energy consumers in this scenario. We provide asymptotically tight or almost tight bounds in this time model for both quality measures and it turns out that the best choice for $\delta$ is $\delta \in \Theta(\frac{1}{n})$, since this minimizes the number of time steps as well as the maximum traveled distance.},
author = {Brandes, Philipp and Degener, Bastian and Kempkes, Barbara and Meyer auf der Heide, Friedhelm},
title = {{Building short chains of mobile robots locally with a bounded stepwidth}},
year = {2010},
}
@inproceedings{19013,
author = {Gehweiler, Joachim and Meyerhenke, Henning},
booktitle = {Proceeedings of 24th International Parallel and Distributed Processing Symposium (IPDPS, HPGC)},
isbn = {9781424465330},
title = {{A distributed diffusive heuristic for clustering a virtual P2P supercomputer}},
doi = {10.1109/ipdpsw.2010.5470922},
year = {2010},
}
@techreport{19018,
author = {Thies, Michael and Gehweiler, Joachim},
title = {{Thread Migration and Checkpointing in Java}},
year = {2010},
}
@inproceedings{19796,
abstract = {We introduce the Read-Write-Coding-System (RWC) a very flexible class of linear block codes that generate efficient and flexible erasure codes for storage networks. In particular, given a message x of k symbols and a codeword y of n symbols, an RW code defines additional parameters k \leq r,w \leq n that offer enhanced possibilities to adjust the fault-tolerance capability of the code. More precisely, an RWC provides linear $\left(n,k,d\right)$-codes that have (a) minimum distance d=n-r+1 for any two codewords, and (b) for each codeword there exists a codeword for each other message with distance of at most w. Furthermore, depending on the values r,w and the code alphabet, different block codes such as parity codes (e.g. RAID 4/5) or Reed-Solomon (RS) codes (if r=k and thus, w=n) can be generated. In storage networks in which I/O accesses are very costly and redundancy is crucial, this flexibility has considerable advantages as r and w can optimally be adapted to read or write intensive applications; only w symbols must be updated if the message x changes completely, what is different from other codes which always need to rewrite y completely as x changes. In this paper, we first state a tight lower bound and basic conditions for all RW codes. Furthermore, we introduce special RW codes in which all mentioned parameters are adjustable even online, that is, those RW codes are adaptive to changing demands. At last, we point out some useful properties regarding safety and security of the stored data.},
author = {Mense, Mario and Schindelhauer, Christian},
booktitle = {Proceedings of 11th International Symposium on Stabilization, Safety, and Security of Distributed Systems},
isbn = {9783642051173},
issn = {0302-9743},
pages = {624----639},
title = {{Read-Write-Codes: An Erasure Resilient Encoding System for Flexible Reading and Writing in Storage Networks}},
doi = {10.1007/978-3-642-05118-0_43},
volume = {5873},
year = {2010},
}
@inproceedings{16414,
author = {Meyer auf der Heide, Friedhelm and Phillips, Cynthia A.},
isbn = {9781450300797},
title = {{Proceedings of the 22nd ACM symposium on Parallelism in algorithms and architectures - SPAA '10}},
doi = {10.1145/1810479},
year = {2010},
}
@techreport{17462,
author = {Gehweiler, Joachim and Meyer auf der Heide, Friedhelm and Schroeder, Ulf-Peter},
publisher = {Heinz Nixdorf Institut},
title = {{A Large-Scale Distributed Environment for Peer-to-Peer Services}},
year = {2010},
}
@inproceedings{19033,
author = {Briest, Patrick and Chawla, Shuchi and Kleinberg, Robert and Weinberg, S. Matthew},
booktitle = {Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms},
isbn = {9780898717013},
title = {{Pricing Randomized Allocations}},
doi = {10.1137/1.9781611973075.49},
year = {2010},
}
@inproceedings{19711,
author = {Degener, Bastian and Pietrzyk, Peter and Kempkes, Barbara},
booktitle = {International Parallel & Distributed Processing Symposium (IPDPS)},
title = {{A local, distributed constant-factor approximation algorithm for the dynamic facility location problem }},
doi = {10.1109/IPDPS.2010.5470349},
year = {2010},
}
@inproceedings{19824,
abstract = {We present 3nuts, a self-stabilizing peer-to-peer (p2p) network supporting range queries and adapting the overlay structure to the underlying physical network. 3nuts combines concepts of structured and unstructured p2p networks to overcome their individual shortcomings while keeping their strengths. This is achieved by combining self maintaining random networks for robustness, a search tree to allow range queries, and DHTs for load balancing. Simple handshake operations with provable guarantees are used for maintenance and self-stabilization. Efficiency of load balancing, fast data access, and robustness are proven by rigorous analysis.},
author = {Janson, Thomas and Mahlmann, Peter and Schindelhauer, Christian},
booktitle = {Proceedings of the 16th International Conference on Parallel and Distributed Systems},
isbn = {9781424497270},
title = {{A Self-Stabilizing Locality-Aware Peer-to-Peer Network Combining Random Networks, Search Trees, and DHTs}},
doi = {10.1109/icpads.2010.42},
year = {2010},
}
@inproceedings{19829,
author = {Miao, Huawei and Ooi, Chia Ching and Wu, Xiaowen and Schindelhauer, Christian},
booktitle = {Proceedings of the 2010 ACM Symposium on Applied Computing - SAC '10},
isbn = {9781605586397},
pages = {1299--1304},
title = {{Coverage-hole trap model in target tracking using distributed relay-robot network}},
doi = {10.1145/1774088.1774365},
year = {2010},
}
@inproceedings{18136,
abstract = {We present a parallel algorithm for the rendering of complex three-dimensional scenes. The algorithm runs across heterogeneous architectures of PC-clusters consisting of a visualization-node, equipped with a powerful graphics adapter, and cluster nodes requiring weaker graphics capabilities only. The visualization-node renders a mixture of scene objects and simplified meshes (Reliefboards). The cluster nodes assist the visualization-node by asynchronous computing of Reliefboards, which are used to replace and render distant parts of the scene. Our algorithm is capable of gaining significant speedups if the cluster's nodes provide weak graphics adapters only. We trade the number of cluster nodes off the scene objects' image quality.},
author = {Fischer, Matthias and Jähn, Claudius and Süß, Tim},
booktitle = {Eurographics Symposium on Parallel Graphics and Visualization (EGPGV)},
pages = {43--51},
publisher = {The Eurographics Association},
title = {{Asynchronous Parallel Reliefboard Computation for Scene Object Approximation}},
doi = {10.2312/EGPGV/EGPGV10/043-051},
year = {2010},
}
@inproceedings{20220,
author = {Hamann, Heiko and Schmickl, Thomas and Stradner, Jürgen and Crailsheim, Karl},
booktitle = {Proceedings of the IEEE Congress on Evolutionary Computation (CEC'10)},
pages = {244----251},
title = {{A Hormone-Based Controller for Evolutionary Multi-Modular Robotics: From Single Modules to Gait Learning}},
doi = {10.1109/CEC.2010.5585994},
year = {2010},
}
@book{16403,
editor = {Abramsky, Samson and Gavoille, Cyril and Kirchner, Claude and Meyer auf der Heide, Friedhelm and Spirakis, Paul G.},
isbn = {9783642141614},
issn = {0302-9743},
title = {{Automata, Languages and Programming, 37th International Colloquium, ICALP 2010, Bordeaux, France, July 6-10, 2010, Proceedings, Part II.}},
doi = {10.1007/978-3-642-14162-1},
year = {2010},
}
@phdthesis{19041,
author = {Mahlmann, Peter},
isbn = {978-3-942647-02-1},
title = {{Peer-to-peer networks based on random graphs}},
year = {2010},
}
@inproceedings{19678,
author = {Briest, Patrick and Röglin, Heiko},
booktitle = {Workshop on Approximation and Online Algorithms (WAOA)},
publisher = {Springer},
title = {{The Power of Uncertainty: Bundle-Pricing for Unit-Demand Customers}},
doi = {10.1007/978-3-642-18318-8_5},
volume = {6534},
year = {2010},
}
@inbook{18290,
abstract = {Typischerweise sind die Knoten eines PC-Clusters nicht mit leistungsfähigen Grafikkarten ausgestattet. Dennoch bieten Cluster-Betreiber einige wenige Rechenknoten an, die mit Highend-Grafikkarten ausgestattet sind, um beispielsweise eine PowerWall zu betreiben. Wenn zwischen diesen unterschiedlichen Knotentypen ein schnelles Netzwerk existiert, kann die Bilderzeugung durch die Knoten mit schwacher Grafikkarte beschleunigt werden. Dabei können die unterschiedlichen Knotentypen unterschiedliche Aufgabe bearbeiten. In einem solchen heterogenen System, müssen die unterschiedlichen entstehenden Lasten auf andere Weise verteilt werden, als in einem System, bei dem alle Knoten gleich ausgestattet sind. Wir präsentieren in dieser Arbeit Lastbalancierungsmechanismen, die in einem parallelen Out-of-Core-Renderingsystem für heterogene PC-Cluster eingesetzt werden.
},
author = {Süß, Tim and Wiesemann, Timo and Fischer, Matthias},
booktitle = {Augmented & Virtual Reality in der Produktentstehung},
pages = {39--52},
title = {{Gewichtetes c-Collision-Protokoll zur Balancierung eines parallelen Out-of-Core-Renderingsystems}},
year = {2010},
}
@inproceedings{19933,
author = {Schomaker, Gunnar and Oberthur, Simon and Kortenjan, Michael},
booktitle = {8th IEEE International Conference on Industrial Informatics (INDIN'2010)},
isbn = {9781424472987},
title = {{Distributed and dynamic resource management for self-optimizing mechatronic systems}},
doi = {10.1109/indin.2010.5549647},
year = {2010},
}
@inproceedings{17665,
author = {Bar-Yehuda, Reuven and Polevoy, Gleb and Rawitz, Dror},
booktitle = {DIALM-PODC},
pages = {33--42},
title = {{Bandwidth allocation in cellular networks with multiple interferences}},
year = {2010},
}
@book{20182,
author = {Hamann, Heiko},
publisher = {Springer},
title = {{Space-Time Continuous Models of Swarm Robotics Systems: Supporting Global-to-Local Programming}},
doi = {10.1007/978-3-642-13377-0},
year = {2010},
}
@inproceedings{20226,
author = {Hamann, Heiko and Meyer, Bernd and Schmickl, Thomas and Crailsheim, Karl},
booktitle = {From Animals to Animats 11},
isbn = {9783642151927},
issn = {0302-9743},
pages = {639--648},
publisher = {Springer},
title = {{A Model of Symmetry Breaking in Collective Decision-Making}},
doi = {10.1007/978-3-642-15193-4_60},
volume = {6226},
year = {2010},
}
@inproceedings{16430,
author = {Mehler, Jan and Meyer auf der Heide, Friedhelm},
booktitle = {Proceedings of the twenty-first annual symposium on Parallelism in algorithms and architectures - SPAA '09},
isbn = {9781605586069},
title = {{Power-aware online file allocation in mobile ad hoc networks}},
doi = {10.1145/1583991.1584072},
year = {2009},
}
@inproceedings{18138,
abstract = {Modern companies are nowadays confronted with an increasing demand of multiple products, where they need to perform more flexible every day. Cost-intensive decisions are to be confirmed in short times, in order to minimize risks and secure efficient production programs as well as material flows. Tools for this digital planning via simulation methods are one well established possibility to receive decision support. Nevertheless, the creation of the necessary simulation models is a complicated and error-prone process, where complexity of modeling, validation and verification depends on the used tool and its functionalities. This paper presents implemented concepts for an innovative user support in his tasks of verification and validation of simulation models during the execution of a simulation run. Time-intensive procedures like stopping simulation, parameterization and restarting within the problem analysis are simplified. So the user is able to focus on the real problem solving task.},
author = {Laroque, Christoph and Fischer, Matthias and Dangelmaier, Wilhelm},
booktitle = {European Simulation and Modelling Conference (ESM 2009)},
publisher = {EUROSIS-ETI},
title = {{Concepts for Model Verification and Validation during Simulation Runtime}},
year = {2009},
}
@inbook{18291,
author = {Süß, Tim and Fischer, Matthias and Huber, Daniel and Laroque, Christoph and Dangelmaier, Wilhelm},
booktitle = {Augmented & Virtual Reality in der Produktentstehung},
pages = {111----126},
publisher = {Heinz Nixdorf Institut, Universität Paderborn},
title = {{Ein System zur aggregierten Visualisierung verteilter Materialflusssimulationen}},
volume = {252},
year = {2009},
}
@phdthesis{19617,
author = {Kortenjan, Michael},
isbn = {978-3-939350-77-4},
title = {{Size Equivalent Cluster Trees - Rendering CAD Models in Industrial Scenes}},
year = {2009},
}
@inproceedings{19934,
author = {Deveci, Deniz and Kortenjan, Michael and Schomaker, Gunnar},
booktitle = { Parallel and Distributed Computing and Systems, Nr. 21},
title = {{Distributed Heterogeneous Hashing and Deterministic Dynamical Decompositions}},
year = {2009},
}
@proceedings{16431,
editor = {Meyer auf der Heide, Friedhelm and Bender, Michael A.},
isbn = {9781605586069},
title = {{Proceedings of the twenty-first annual symposium on Parallelism in algorithms and architectures - SPAA '09}},
doi = {10.1145/1583991},
year = {2009},
}
@article{16429,
author = {Kutyłowski, Jarosław and Meyer auf der Heide, Friedhelm},
issn = {0304-3975},
journal = {Theoretical Computer Science},
pages = {3391--3405},
title = {{Optimal strategies for maintaining a chain of relays between an explorer and a base camp}},
doi = {10.1016/j.tcs.2008.04.010},
year = {2009},
}
@article{17453,
author = {Meyer auf der Heide, Friedhelm and Rammig, Franz-Josef},
journal = {Public Service Review: Science and Technology},
title = {{Self-Organisation and Self-Optimization}},
volume = {04},
year = {2009},
}
@article{19031,
author = {Briest, Patrick},
issn = {1611-2776},
journal = {it - Information Technology},
number = {1},
pages = {62--65},
title = {{Algorithmische und komplexitätstheoretische Aspekte kombinatorischer Preisoptimierung (Computational Aspects of Combinatorial Pricing Problems)}},
doi = {10.1524/itit.2009.0524},
volume = {51},
year = {2009},
}
@inproceedings{19904,
author = {Nikoletseas, Sotiris E. and Raptopoulos, Christoforos L. and Spirakis, Paul G.},
booktitle = { Proceedings of IPDPS - IEEE International Parallel & Distributed Processing Symposium},
pages = {1----11},
title = {{Combinatorial Properties for Efficient Communication in Distributed Networks with Local Interactions}},
doi = {10.1109/IPDPS.2009.5161002},
year = {2009},
}
@inproceedings{20254,
abstract = {One of the prominent challenges in mobile robotics is to develop control methodologies that allow the adaptation to dynamic and unforeseen environments. The classic approach of hand-coded controllers is very efficient for well-defined tasks and specific environments but poor in adapting to changing environmental conditions. One alternative approach is the application of evolutionary algorithms which need, in turn, easily evolvable representations of controllers. In this paper, we investigate one promising approach of an artificial hormone system as a control paradigm which is believed to be easily optimized by evolutionary processes. In a first step of this research, we focus on the simple task of collision avoidance. We present a brief mathematical analysis of this controller approach and an implementation of the controller on a mobile robot to check the feasibility in principle of our approach. The task is successfully accomplished and we conclude with a discussion of the hormone dynamics in the robot.},
author = {Stradner, Jürgen and Hamann, Heiko and Schmickl, Thomas and Crailsheim, Karl},
booktitle = {2009 IEEE/RSJ International Conference on Intelligent Robots and Systems},
isbn = {9781424438037},
title = {{Analysis and implementation of an Artificial Homeostatic Hormone System: A first case study in robotic hardware}},
doi = {10.1109/iros.2009.5354056},
year = {2009},
}
@inproceedings{20259,
author = {Hamann, Heiko and Troch, Inge and Breitenecker, F.},
booktitle = {MATHMOD 2009 - 6th Vienna International Conference on Mathematical Modelling},
title = {{Pattern Formation as a Transient Phenomenon in the Nonlinear Dynamics of a Multi-Agent System}},
year = {2009},
}
@article{16398,
author = {Bienkowski, Marcin and Byrka, Jaroslaw and Korzeniowski, Miroslaw and Meyer auf der Heide, Friedhelm},
issn = {1570-8667},
journal = {Journal of Discrete Algorithms},
pages = {545--569},
title = {{Optimal algorithms for page migration in dynamic networks}},
doi = {10.1016/j.jda.2008.07.006},
year = {2009},
}
@techreport{19722,
author = {Bonorden, Olaf and Degener, Bastian and Pietrzyk, Peter and Kempkes, Barbara},
title = {{Complexity and approximation of a geometric local robot assignment problem}},
year = {2009},
}
@article{19830,
author = {Ooi, Chia Ching and Schindelhauer, Christian},
issn = {1383-469X},
journal = {Mobile Networks and Applications (MONET)},
pages = {309--321},
title = {{Minimal Energy Path Planning for Wireless Robots}},
doi = {10.1007/s11036-008-0150-5},
year = {2009},
}
@phdthesis{19614,
author = {Mense, Mario},
isbn = {978-3-939350-79-8},
title = {{On Fault-Tolerant Data Placement in Storage Networks}},
year = {2009},
}
@article{20255,
abstract = {By compiling macroscopic models we analyze the adaptive behavior in a swarm of autonomous robots generated by a bio-inspired, distributed control algorithm. We developed two macroscopic models by taking two different perspectives: A Stock & Flow model, which is simple to implement and fast to simulate, and a spatially resolved model based on diffusion processes. These two models were compared concerning their prediction quality and their analytical power: One model allowed easy identification of the major feedback loops governing the swarm behavior. The other model allowed analysis of the expected shapes and positions of observable robot clusters. We found a high correlation in the challenges posed by both modeling techniques and we highlighted the inherent problems of inferring emergent macroscopic rules from a microscopic description of swarm behavior.},
author = {Schmickl, Thomas and Hamann, Heiko and Wörn, Heinz and Crailsheim, Karl},
issn = {0921-8890},
journal = {Robotics and Autonomous Systems},
number = {9},
pages = {913--921},
title = {{Two different approaches to a macroscopic model of a bio-inspired robotic swarm}},
doi = {10.1016/j.robot.2009.06.002},
volume = {6},
year = {2009},
}
@article{19831,
author = {Ooi, Chia Ching and Schindelhauer, Christian},
issn = {1018-4864},
journal = {Telecommunication Systems},
pages = {25--37},
title = {{Utilizing detours for energy conservation in mobile wireless networks}},
doi = {10.1007/s11235-009-9188-3},
volume = {43},
year = {2009},
}
@inproceedings{19901,
author = {Raptopoulos, Christoforos L. and Nikoletseas, Sotiris E. and Spirakis, Paul G.},
booktitle = {34st International Symposium on Mathematical Foundations of Computer Science},
isbn = {9781493928637},
pages = {600----611},
title = {{Colouring Non-sparse Random Intersection Graphs}},
doi = {10.1007/978-1-4939-2864-4_597},
year = {2009},
}
@inproceedings{18346,
abstract = {For a fixed virtual scene (=collection of simplices) S and given observer
position p, how many elements of S are weakly visible (i.e. not fully occluded
by others) from p? The present work explores the trade-off between query time
and preprocessing space for these quantities in 2D: exactly, in the approximate
deterministic, and in the probabilistic sense. We deduce the EXISTENCE of an
O(m^2/n^2) space data structure for S that, given p and time O(log n), allows
to approximate the ratio of occluded segments up to arbitrary constant absolute
error; here m denotes the size of the Visibility Graph--which may be quadratic,
but typically is just linear in the size n of the scene S. On the other hand,
we present a data structure CONSTRUCTIBLE in O(n*log(n)+m^2*polylog(n)/k)
preprocessing time and space with similar approximation properties and query
time O(k*polylog n), where k