@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}}, } @inbook{20961, abstract = {{Self-healing promises to improve the dependability of systems. In particular safety-critical systems like automotive systems are well suited application, since safe operation is required in these systems even in case of failures. Prerequisite for the improved dependability is the correct realization of the self-healing techniques. Consequently, self-healing activities should be rigorously specified and appropriately integrated with the rest of the system. In this paper, we present an approach for designing self-healing mechanisms in automotive systems. The approach contains a construction model which consist of a structural description as well as an extensive set of constraints. The constraints specify a correct system structure and are also used in the self-healing activities. We exemplify the self-healing approach using the adaptive cruise control system of modern cars. }}, author = {{Seebach, Hella and Nafz, Florian and Holtmann, Jörg and Meyer, Jan and Tichy, Matthias and Reif, Wolfgang and Schäfer, Wilhelm}}, booktitle = {{Lecture Notes in Computer Science}}, isbn = {{9783642165757}}, issn = {{0302-9743}}, title = {{{Designing Self-healing in Automotive Systems}}}, doi = {{10.1007/978-3-642-16576-4_4}}, year = {{2010}}, } @inproceedings{19029, author = {{Briest, Patrick and Chalermsook, Parinya and Khanna, Sanjeev and Laekhanukit, Bundit and Nanongkai, Danupon}}, booktitle = {{Workshop on Internet and Network Economics (WINE)}}, isbn = {{9783642175718}}, issn = {{0302-9743}}, title = {{{Improved Hardness of Approximation for Stackelberg Shortest-Path Pricing}}}, doi = {{10.1007/978-3-642-17572-5_37}}, year = {{2010}}, } @inbook{16505, abstract = {{We present an approach for real-time rendering of complex 3D scenes consisting of millions of polygons on limited graphics hardware. In a preprocessing step, powerful hardware is used to gain fine granular global visibility information of a scene using an adaptive sampling algorithm. Additively the visual influence of each object on the eventual rendered image is estimated. This influence is used to select the most important objects to display in our approximative culling algorithm. After the visibility data is compressed to meet the storage capabilities of small devices, we achieve an interactive walkthrough of the Power Plant scene on a standard netbook with an integrated graphics chipset.}}, author = {{Eikel, Benjamin and Jähn, Claudius and Fischer, Matthias}}, booktitle = {{Advances in Visual Computing}}, isbn = {{9783642172885}}, issn = {{0302-9743}}, title = {{{Preprocessed Global Visibility for Real-Time Rendering on Low-End Hardware}}}, doi = {{10.1007/978-3-642-17289-2_60}}, year = {{2010}}, } @inproceedings{15137, author = {{Böttcher, Stefan and Hartel, Rita and Messinger, Christian}}, booktitle = {{Database and XML Technologies - 7th International XML Database Symposium, XSym 2010}}, isbn = {{9783642156830}}, issn = {{0302-9743}}, pages = {{103--112}}, publisher = {{Springer}}, title = {{{Searchable Compression of Office Documents by XML Schema Subtraction}}}, doi = {{10.1007/978-3-642-15684-7_9}}, year = {{2010}}, } @inbook{16365, author = {{Degener, Bastian and Kempkes, Barbara and Kling, Peter and Meyer auf der Heide, Friedhelm}}, booktitle = {{Structural Information and Communication Complexity}}, isbn = {{9783642132834}}, issn = {{0302-9743}}, pages = {{168--182}}, title = {{{A Continuous, Local Strategy for Constructing a Short Chain of Mobile Robots}}}, doi = {{10.1007/978-3-642-13284-1_14}}, 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}}, } @book{16404, 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 I.}}}, doi = {{10.1007/978-3-642-14165-2}}, year = {{2010}}, } @inbook{13301, author = {{Trier, Matthias and Müller, Claudia}}, booktitle = {{Practical Aspects of Knowledge Management}}, isbn = {{9783540240884}}, issn = {{0302-9743}}, title = {{{Towards a Systematic Approach for Capturing Knowledge-Intensive Business Processes}}}, doi = {{10.1007/978-3-540-30545-3_23}}, year = {{2010}}, } @inbook{19724, abstract = {{We introduce a geometric multi-robot assignment problem. Robots positioned in a Euclidean space have to be assigned to treasures in such a way that their joint strength is sufficient to unearth a treasure with a given weight. The robots have a limited range and thus can only be assigned to treasures in their proximity. The objective is to unearth as many treasures as possible. We investigate the complexity of several variants of this problem and show whether they are in $\classP$ or are $\classNP$-complete. Furthermore, we provide a distributed and local constant-factor approximation algorithm using constant-factor resource augmentation for the two-dimensional setting with $\bigO(\log^*n)$ communication rounds.}}, author = {{Bonorden, Olaf and Degener, Bastian and Kempkes, Barbara and Pietrzyk, Peter}}, booktitle = {{Algorithmic Aspects of Wireless Sensor Networks}}, isbn = {{9783642054334}}, issn = {{0302-9743}}, pages = {{252--262}}, publisher = {{Springer}}, title = {{{Complexity and Approximation of a Geometric Local Robot Assignment Problem}}}, doi = {{10.1007/978-3-642-05434-1_25}}, year = {{2009}}, }