@inbook{16448, author = {{Kempkes, Barbara and Meyer auf der Heide, Friedhelm}}, booktitle = {{Algorithms for Sensor Systems}}, isbn = {{9783642282089}}, issn = {{0302-9743}}, title = {{{Local, Self-organizing Strategies for Robotic Formation Problems}}}, doi = {{10.1007/978-3-642-28209-6_2}}, year = {{2012}}, } @inbook{16516, author = {{Baier, Robert and Molo, Mirko Hessel-von}}, booktitle = {{Large-Scale Scientific Computing}}, isbn = {{9783642298424}}, issn = {{0302-9743}}, title = {{{Newton’s Method and Secant Method for Set-Valued Mappings}}}, doi = {{10.1007/978-3-642-29843-1_9}}, year = {{2012}}, } @inbook{15891, author = {{Jager, Tibor and Schinzel, Sebastian and Somorovsky, Juraj}}, booktitle = {{Computer Security – ESORICS 2012}}, isbn = {{9783642331664}}, issn = {{0302-9743}}, title = {{{Bleichenbacher’s Attack Strikes again: Breaking PKCS#1 v1.5 in XML Encryption}}}, doi = {{10.1007/978-3-642-33167-1_43}}, year = {{2012}}, } @inproceedings{16408, abstract = {{We present a parallel rendering system for heterogeneous PC clusters to visualize massive models. One single, powerful visualization node is supported by a group of backend nodes with weak graphics performance. While the visualization node renders the visible objects, the backend nodes asynchronously perform visibility tests and supply the front end with visible scene objects. The visualization node stores only currently visible objects in its memory, while the scene is distributed among the backend nodes’ memory without redundancy. To efficiently compute the occlusion tests in spite of that each backend node stores only a fraction of the original geometry, we complete the scene by adding highly simplified versions of the objects stored on other nodes. We test our system with 15 backend nodes. It is able to render a ≈ 350,M polygons (≈ 8.5,GiB) large aircraft model with 20, to 30,fps and thus allows a walk-through in real-time. }}, author = {{Suess, Tim and Koch, Clemens and Jähn, Claudius and Fischer, Matthias and Meyer auf der Heide, Friedhelm}}, booktitle = {{Advances in Visual Computing}}, isbn = {{9783642331787}}, issn = {{0302-9743}}, pages = {{502--512}}, title = {{{Asynchronous Occlusion Culling on Heterogeneous PC Clusters for Distributed 3D Scenes}}}, doi = {{10.1007/978-3-642-33179-4_48}}, volume = {{7431}}, year = {{2012}}, } @inproceedings{20183, author = {{Hamann, Heiko and Schmickl, Thomas and Crailsheim, Karl}}, booktitle = {{10th European Conference on Artificial Life (ECAL'09)}}, isbn = {{9783642212826}}, issn = {{0302-9743}}, pages = {{442----449}}, title = {{{Evolving for Creativity: Maximizing Complexity in a Self-organized Multi-particle System}}}, doi = {{10.1007/978-3-642-21283-3_55}}, volume = {{5777}}, year = {{2011}}, } @article{3332, author = {{Lettmann, Theodor and Baumann, Michael and Eberling, Markus and Kemmerich, Thomas}}, isbn = {{9783642240157}}, issn = {{0302-9743}}, journal = {{Transactions on Computational Collective Intelligence V}}, pages = {{157--181}}, publisher = {{Springer Berlin Heidelberg}}, title = {{{Modeling Agents and Agent Systems}}}, doi = {{10.1007/978-3-642-24016-4_9}}, year = {{2011}}, } @inbook{20709, author = {{Cord-Landwehr, Andreas and Degener, Bastian and Fischer, Matthias and Hüllmann, Martina and Kempkes, Barbara and Klaas, Alexander and Kling, Peter and Kurras, Sven and Märtens, Marcus and auf der Heide, Friedhelm Meyer and Raupach, Christoph and Swierkot, Kamil and Warner, Daniel and Weddemann, Christoph and Wonisch, Daniel}}, booktitle = {{SOFSEM 2011: Theory and Practice of Computer Science}}, isbn = {{9783642183805}}, issn = {{0302-9743}}, title = {{{Collisionless Gathering of Robots with an Extent}}}, doi = {{10.1007/978-3-642-18381-2_15}}, year = {{2011}}, } @inbook{20710, author = {{Cord-Landwehr, Andreas and Degener, Bastian and Fischer, Matthias and Hüllmann, Martina and Kempkes, Barbara and Klaas, Alexander and Kling, Peter and Kurras, Sven and Märtens, Marcus and Meyer auf der Heide, Friedhelm and Raupach, Christoph and Swierkot, Kamil and Warner, Daniel and Weddemann, Christoph and Wonisch, Daniel}}, booktitle = {{Automata, Languages and Programming}}, isbn = {{9783642220111}}, issn = {{0302-9743}}, title = {{{A New Approach for Analyzing Convergence Algorithms for Mobile Robots}}}, doi = {{10.1007/978-3-642-22012-8_52}}, year = {{2011}}, } @inbook{6293, author = {{Nebe, Karsten and Klompmaker, Florian and Jung, Helge and Fischer, Holger Gerhard}}, booktitle = {{Human-Computer Interaction. Interaction Techniques and Environments.}}, editor = {{Jacko, Julie Anne}}, isbn = {{9783642216046}}, issn = {{0302-9743}}, location = {{Orlando, USA}}, pages = {{100--109}}, publisher = {{Springer Berlin Heidelberg}}, title = {{{Exploiting New Interaction Techniques for Disaster Control Management Using Multitouch-, Tangible- and Pen-Based-Interaction}}}, doi = {{10.1007/978-3-642-21605-3_11}}, volume = {{6762}}, year = {{2011}}, } @inbook{6300, author = {{Fischer, Holger Gerhard and Nebe, Karsten and Klompmaker, Florian}}, booktitle = {{Human Centered Design}}, editor = {{Kurosu, Masaaki}}, isbn = {{9783642217524}}, issn = {{0302-9743}}, location = {{Orlando, USA}}, pages = {{28--37}}, publisher = {{Springer Berlin Heidelberg}}, title = {{{A Holistic Model for Integrating Usability Engineering and Software Engineering Enriched with Marketing Activities}}}, doi = {{10.1007/978-3-642-21753-1_4}}, volume = {{6776}}, year = {{2011}}, } @inproceedings{16410, abstract = {{Gathering n mobile robots in one single point in the Euclidean plane is a widely studied problem from the area of robot formation problems. Classically, the robots are assumed to have no physical extent, and they are able to share a position with other robots. We drop these assumptions and investigate a similar problem for robots with (a spherical) extent: the goal is to gather the robots as close together as possible. More exactly, we want the robots to form a sphere with minimum radius around a predefined point. We propose an algorithm for this problem which synchronously moves the robots towards the center of the sphere unless they block each other. In this case, if possible, the robots spin around the center of the sphere. We analyze this algorithm experimentally in the plane. If R is the distance of the farthest robot to the center of the sphere, the simulations indicate a runtime which is linear in n and R. Additionally, we prove a theoretic upper bound for the runtime of O(nR) for a discrete version of the problem. Simulations also suggest a runtime of O(n + R) for the discrete version.}}, author = {{Cord-Landwehr, Andreas and Degener, Bastian and Fischer, Matthias and Hüllmann, Martina and Kempkes, Barbara and Klaas, Alexander and Kling, Peter and Kurras, Sven and Märtens, Marcus and Meyer auf der Heide, Friedhelm and Raupach, Christoph and Swierkot, Kamil and Warner, Daniel and Weddemann, Christoph and Wonisch, Daniel}}, booktitle = {{37th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM 2011)}}, isbn = {{9783642183805}}, issn = {{0302-9743}}, number = {{6543}}, pages = {{178--189}}, publisher = {{Springer}}, title = {{{Collisionless Gathering of Robots with an Extent}}}, doi = {{10.1007/978-3-642-18381-2_15}}, year = {{2011}}, } @inbook{16459, author = {{Brandes, Philipp and Degener, Bastian and Kempkes, Barbara and Meyer auf der Heide, Friedhelm}}, booktitle = {{Structural Information and Communication Complexity}}, isbn = {{9783642222115}}, issn = {{0302-9743}}, title = {{{Energy-Efficient Strategies for Building Short Chains of Mobile Robots Locally}}}, doi = {{10.1007/978-3-642-22212-2_13}}, year = {{2011}}, } @inproceedings{15097, author = {{Benter, Markus and Böttcher, Stefan and Hartel, Rita}}, booktitle = {{East European Conference on Advances in Databases and Information Systems}}, isbn = {{9783642237362}}, issn = {{0302-9743}}, pages = {{27--41}}, publisher = {{Springer}}, title = {{{Mixing Bottom-Up and Top-Down XPath Query Evaluation}}}, doi = {{10.1007/978-3-642-23737-9_3}}, year = {{2011}}, } @inproceedings{15099, author = {{Bätz, Alexander and Böttcher, Stefan and Hartel, Rita}}, booktitle = {{Advances in Databases - 28th British National Conference on Databases, BNCOD 28, Revised Selected Papers}}, isbn = {{9783642245763}}, issn = {{0302-9743}}, pages = {{154--166}}, publisher = {{Springer}}, title = {{{Updates on Grammar-Compressed XML Data}}}, doi = {{10.1007/978-3-642-24577-0_17}}, year = {{2011}}, } @inproceedings{15100, author = {{Böttcher, Stefan and Hartel, Rita and Stey, Sebastian}}, booktitle = {{Advances in Databases - 28th British National Conference on Databases, BNCOD 28, Revised Selected Papers}}, isbn = {{9783642245763}}, issn = {{0302-9743}}, pages = {{182--193}}, publisher = {{Springer}}, title = {{{TraCX: Transformation of Compressed XML}}}, doi = {{10.1007/978-3-642-24577-0_19}}, year = {{2011}}, } @inbook{16409, abstract = {{Given a set of n mobile robots in the d-dimensional Euclidean space, the goal is to let them converge to a single not predefined point. The challenge is that the robots are limited in their capabilities. Robots can, upon activation, compute the positions of all other robots using an individual affine coordinate system. The robots are indistinguishable, oblivious and may have different affine coordinate systems. A very general discrete time model assumes that robots are activated in arbitrary order. Further, the computation of a new target point may happen much earlier than the movement, so that the movement is based on outdated information about other robot's positions. Time is measured as the number of rounds, where a round ends as soon as each robot has moved at least once. In [Cohen, Peleg: Convergence properties of gravitational algorithms in asynchronous robot systems], the Center of Gravity is considered as target function, convergence was proven, and the number of rounds needed for halving the diameter of the convex hull of the robot's positions was shown to be O(n^2) and Omega(n). We present an easy-to-check property of target functions that guarantee convergence and yields upper time bounds. This property intuitively says that when a robot computes a new target point, this point is significantly within the current axes aligned minimal box containing all robots. This property holds, e.g., for the above-mentioned target function, and improves the above O(n^2) to an asymptotically optimal O(n) upper bound. Our technique also yields a constant time bound for a target function that requires all robots having identical coordinate axes. }}, author = {{Cord-Landwehr, Andreas and Degener, Bastian and Fischer, Matthias and Hüllmann, Martina and Kempkes, Barbara and Klaas, Alexander and Kling, Peter and Kurras, Sven and Märtens, Marcus and Meyer auf der Heide, Friedhelm and Raupach, Christoph and Swierkot, Kamil and Warner, Daniel and Weddemann, Christoph and Wonisch, Daniel}}, booktitle = {{Automata, Languages and Programming}}, isbn = {{9783642220111}}, issn = {{0302-9743}}, title = {{{A New Approach for Analyzing Convergence Algorithms for Mobile Robots}}}, doi = {{10.1007/978-3-642-22012-8_52}}, year = {{2011}}, } @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{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}}, } @article{24282, author = {{Grza̧ślewicz, Ryszard and Kutyłowski, Jarosław and Kutyłowski, Mirosław and Pietkiewicz, Wojciech}}, issn = {{0302-9743}}, journal = {{ICCSA'05: Proceedings of the 2005 international conference on Computational Science and Its Applications}}, title = {{{Robust Undetectable Interference Watermarks}}}, doi = {{10.1007/11424826_55}}, year = {{2010}}, } @inbook{2988, author = {{Ackermann, Marcel R. and Blömer, Johannes}}, booktitle = {{SWAT 2010}}, isbn = {{9783642137303}}, issn = {{0302-9743}}, pages = {{212--223}}, publisher = {{Springer Berlin Heidelberg}}, title = {{{Bregman Clustering for Separable Instances}}}, doi = {{10.1007/978-3-642-13731-0_21}}, year = {{2010}}, }