[{"publication":"Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2008, San Francisco, California, USA, January 20-22, 2008","type":"conference","status":"public","file":[{"content_type":"application/pdf","relation":"main_file","date_updated":"2018-04-13T10:03:13Z","creator":"florida","date_created":"2018-04-13T10:03:13Z","file_size":211264,"file_name":"SODA08.pdf","file_id":"2341","access_level":"open_access"}],"urn":"19408","department":[{"_id":"79"},{"_id":"63"}],"user_id":"14955","_id":"1940","file_date_updated":"2018-04-13T10:03:13Z","language":[{"iso":"eng"}],"ddc":["040"],"has_accepted_license":"1","page":"1135--1144","citation":{"ama":"Mense M, Scheideler C. SPREAD: an adaptive scheme for redundant and fair storage in dynamic heterogeneous storage systems. In: <i>Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2008, San Francisco, California, USA, January 20-22, 2008</i>. SIAM; 2008:1135--1144.","chicago":"Mense, Mario, and Christian Scheideler. “SPREAD: An Adaptive Scheme for Redundant and Fair Storage in Dynamic Heterogeneous Storage Systems.” In <i>Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2008, San Francisco, California, USA, January 20-22, 2008</i>, 1135--1144. SIAM, 2008.","ieee":"M. Mense and C. Scheideler, “SPREAD: an adaptive scheme for redundant and fair storage in dynamic heterogeneous storage systems,” in <i>Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2008, San Francisco, California, USA, January 20-22, 2008</i>, 2008, pp. 1135--1144.","apa":"Mense, M., &#38; Scheideler, C. (2008). SPREAD: an adaptive scheme for redundant and fair storage in dynamic heterogeneous storage systems. In <i>Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2008, San Francisco, California, USA, January 20-22, 2008</i> (pp. 1135--1144). SIAM.","mla":"Mense, Mario, and Christian Scheideler. “SPREAD: An Adaptive Scheme for Redundant and Fair Storage in Dynamic Heterogeneous Storage Systems.” <i>Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2008, San Francisco, California, USA, January 20-22, 2008</i>, SIAM, 2008, pp. 1135--1144.","bibtex":"@inproceedings{Mense_Scheideler_2008, title={SPREAD: an adaptive scheme for redundant and fair storage in dynamic heterogeneous storage systems}, booktitle={Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2008, San Francisco, California, USA, January 20-22, 2008}, publisher={SIAM}, author={Mense, Mario and Scheideler, Christian}, year={2008}, pages={1135--1144} }","short":"M. Mense, C. Scheideler, in: Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2008, San Francisco, California, USA, January 20-22, 2008, SIAM, 2008, pp. 1135--1144."},"year":"2008","author":[{"first_name":"Mario","last_name":"Mense","full_name":"Mense, Mario"},{"first_name":"Christian","full_name":"Scheideler, Christian","id":"20792","last_name":"Scheideler"}],"date_created":"2018-03-29T09:30:18Z","publisher":"SIAM","date_updated":"2022-01-06T06:54:03Z","oa":"1","title":"SPREAD: an adaptive scheme for redundant and fair storage in dynamic heterogeneous storage systems"},{"publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783540691334","9783540691341"]},"publication_status":"published","year":"2008","page":"447--456","intvolume":"      5040","citation":{"apa":"Hamann, H., &#38; Wörn, H. (2008). Aggregating Robots Compute: An Adaptive Heuristic for the Euclidean Steiner Tree Problem. In <i>The tenth International Conference on Simulation of Adaptive Behavior (SAB’08)</i> (Vol. 5040, pp. 447--456). <a href=\"https://doi.org/10.1007/978-3-540-69134-1_44\">https://doi.org/10.1007/978-3-540-69134-1_44</a>","bibtex":"@inproceedings{Hamann_Wörn_2008, title={Aggregating Robots Compute: An Adaptive Heuristic for the Euclidean Steiner Tree Problem}, volume={5040}, DOI={<a href=\"https://doi.org/10.1007/978-3-540-69134-1_44\">10.1007/978-3-540-69134-1_44</a>}, booktitle={The tenth International Conference on Simulation of Adaptive Behavior (SAB’08)}, author={Hamann, Heiko and Wörn, Heinz}, year={2008}, pages={447--456} }","short":"H. Hamann, H. Wörn, in: The Tenth International Conference on Simulation of Adaptive Behavior (SAB’08), 2008, pp. 447--456.","mla":"Hamann, Heiko, and Heinz Wörn. “Aggregating Robots Compute: An Adaptive Heuristic for the Euclidean Steiner Tree Problem.” <i>The Tenth International Conference on Simulation of Adaptive Behavior (SAB’08)</i>, vol. 5040, 2008, pp. 447--456, doi:<a href=\"https://doi.org/10.1007/978-3-540-69134-1_44\">10.1007/978-3-540-69134-1_44</a>.","ama":"Hamann H, Wörn H. Aggregating Robots Compute: An Adaptive Heuristic for the Euclidean Steiner Tree Problem. In: <i>The Tenth International Conference on Simulation of Adaptive Behavior (SAB’08)</i>. Vol 5040. ; 2008:447--456. doi:<a href=\"https://doi.org/10.1007/978-3-540-69134-1_44\">10.1007/978-3-540-69134-1_44</a>","chicago":"Hamann, Heiko, and Heinz Wörn. “Aggregating Robots Compute: An Adaptive Heuristic for the Euclidean Steiner Tree Problem.” In <i>The Tenth International Conference on Simulation of Adaptive Behavior (SAB’08)</i>, 5040:447--456, 2008. <a href=\"https://doi.org/10.1007/978-3-540-69134-1_44\">https://doi.org/10.1007/978-3-540-69134-1_44</a>.","ieee":"H. Hamann and H. Wörn, “Aggregating Robots Compute: An Adaptive Heuristic for the Euclidean Steiner Tree Problem,” in <i>The tenth International Conference on Simulation of Adaptive Behavior (SAB’08)</i>, 2008, vol. 5040, pp. 447--456."},"date_updated":"2022-01-06T06:54:26Z","volume":5040,"author":[{"full_name":"Hamann, Heiko","last_name":"Hamann","first_name":"Heiko"},{"last_name":"Wörn","full_name":"Wörn, Heinz","first_name":"Heinz"}],"date_created":"2020-11-16T13:55:39Z","title":"Aggregating Robots Compute: An Adaptive Heuristic for the Euclidean Steiner Tree Problem","doi":"10.1007/978-3-540-69134-1_44","publication":"The tenth International Conference on Simulation of Adaptive Behavior (SAB'08)","type":"conference","status":"public","_id":"20367","department":[{"_id":"63"},{"_id":"238"}],"user_id":"15415","language":[{"iso":"eng"}]},{"doi":"10.1109/IROS.2008.4651038","title":"Spatial Macroscopic Models of a Bio-Inspired Robotic Swarm Algorithm","author":[{"first_name":"Heiko","full_name":"Hamann, Heiko","last_name":"Hamann"},{"first_name":"Thomas","full_name":"Schmickl, Thomas","last_name":"Schmickl"},{"first_name":"Heinz","last_name":"Wörn","full_name":"Wörn, Heinz"},{"first_name":"Karl","full_name":"Crailsheim, Karl","last_name":"Crailsheim"}],"date_created":"2020-11-16T14:03:10Z","date_updated":"2022-01-06T06:54:26Z","publisher":"IEEE Press","citation":{"apa":"Hamann, H., Schmickl, T., Wörn, H., &#38; Crailsheim, K. (2008). Spatial Macroscopic Models of a Bio-Inspired Robotic Swarm Algorithm. In <i>IEEE/RSJ 2008 International Conference on Intelligent Robots and Systems (IROS’08)</i> (pp. 1415--1420). IEEE Press. <a href=\"https://doi.org/10.1109/IROS.2008.4651038\">https://doi.org/10.1109/IROS.2008.4651038</a>","short":"H. Hamann, T. Schmickl, H. Wörn, K. Crailsheim, in: IEEE/RSJ 2008 International Conference on Intelligent Robots and Systems (IROS’08), IEEE Press, 2008, pp. 1415--1420.","bibtex":"@inproceedings{Hamann_Schmickl_Wörn_Crailsheim_2008, title={Spatial Macroscopic Models of a Bio-Inspired Robotic Swarm Algorithm}, DOI={<a href=\"https://doi.org/10.1109/IROS.2008.4651038\">10.1109/IROS.2008.4651038</a>}, booktitle={IEEE/RSJ 2008 International Conference on Intelligent Robots and Systems (IROS’08)}, publisher={IEEE Press}, author={Hamann, Heiko and Schmickl, Thomas and Wörn, Heinz and Crailsheim, Karl}, year={2008}, pages={1415--1420} }","mla":"Hamann, Heiko, et al. “Spatial Macroscopic Models of a Bio-Inspired Robotic Swarm Algorithm.” <i>IEEE/RSJ 2008 International Conference on Intelligent Robots and Systems (IROS’08)</i>, IEEE Press, 2008, pp. 1415--1420, doi:<a href=\"https://doi.org/10.1109/IROS.2008.4651038\">10.1109/IROS.2008.4651038</a>.","chicago":"Hamann, Heiko, Thomas Schmickl, Heinz Wörn, and Karl Crailsheim. “Spatial Macroscopic Models of a Bio-Inspired Robotic Swarm Algorithm.” In <i>IEEE/RSJ 2008 International Conference on Intelligent Robots and Systems (IROS’08)</i>, 1415--1420. IEEE Press, 2008. <a href=\"https://doi.org/10.1109/IROS.2008.4651038\">https://doi.org/10.1109/IROS.2008.4651038</a>.","ieee":"H. Hamann, T. Schmickl, H. Wörn, and K. Crailsheim, “Spatial Macroscopic Models of a Bio-Inspired Robotic Swarm Algorithm,” in <i>IEEE/RSJ 2008 International Conference on Intelligent Robots and Systems (IROS’08)</i>, 2008, pp. 1415--1420.","ama":"Hamann H, Schmickl T, Wörn H, Crailsheim K. Spatial Macroscopic Models of a Bio-Inspired Robotic Swarm Algorithm. In: <i>IEEE/RSJ 2008 International Conference on Intelligent Robots and Systems (IROS’08)</i>. IEEE Press; 2008:1415--1420. doi:<a href=\"https://doi.org/10.1109/IROS.2008.4651038\">10.1109/IROS.2008.4651038</a>"},"page":"1415--1420","year":"2008","language":[{"iso":"eng"}],"user_id":"15415","department":[{"_id":"63"},{"_id":"238"}],"_id":"20368","status":"public","abstract":[{"lang":"eng","text":"We present a comparative study of two spatially resolved macroscopic models of an autonomous robotic swarm. In previous experiments, the collective behavior of 15 autonomous swarm robots, driven by a simple bio-inspired control algorithm, was investigated: in two different environmental conditions, the ability of the robots to aggregate below a light source was tested. Distinct approaches to predict the dynamics of the spatial distribution were made by two different modeling approaches: one model was constructed in a compartmental manner (ODEs). In parallel, a space-continuous model (PDEs) was constructed. Both models show a high degree of similarity concerning the modeling of concrete environmental factors (light), but due to their different basic approaches, show also significant differences in their implementation. However, the predictions of both models compare well to the observed behavior of the robotic swarm, thus both models can be used to develop further extensions of the algorithm as well as different experimental setups without the need to run extensive real robotic preliminary experiments."}],"type":"conference","publication":"IEEE/RSJ 2008 International Conference on Intelligent Robots and Systems (IROS'08)"},{"issue":"2-4","publication_status":"published","publication_identifier":{"issn":["1935-3812","1935-3820"]},"citation":{"ama":"Hamann H, Wörn H. A framework of space–time continuous models for algorithm design in swarm robotics. <i>Swarm Intelligence</i>. 2008;2(2-4):209-239. doi:<a href=\"https://doi.org/10.1007/s11721-008-0015-3\">10.1007/s11721-008-0015-3</a>","chicago":"Hamann, Heiko, and Heinz Wörn. “A Framework of Space–Time Continuous Models for Algorithm Design in Swarm Robotics.” <i>Swarm Intelligence</i> 2, no. 2–4 (2008): 209–39. <a href=\"https://doi.org/10.1007/s11721-008-0015-3\">https://doi.org/10.1007/s11721-008-0015-3</a>.","ieee":"H. Hamann and H. Wörn, “A framework of space–time continuous models for algorithm design in swarm robotics,” <i>Swarm Intelligence</i>, vol. 2, no. 2–4, pp. 209–239, 2008.","short":"H. Hamann, H. Wörn, Swarm Intelligence 2 (2008) 209–239.","bibtex":"@article{Hamann_Wörn_2008, title={A framework of space–time continuous models for algorithm design in swarm robotics}, volume={2}, DOI={<a href=\"https://doi.org/10.1007/s11721-008-0015-3\">10.1007/s11721-008-0015-3</a>}, number={2–4}, journal={Swarm Intelligence}, author={Hamann, Heiko and Wörn, Heinz}, year={2008}, pages={209–239} }","mla":"Hamann, Heiko, and Heinz Wörn. “A Framework of Space–Time Continuous Models for Algorithm Design in Swarm Robotics.” <i>Swarm Intelligence</i>, vol. 2, no. 2–4, 2008, pp. 209–39, doi:<a href=\"https://doi.org/10.1007/s11721-008-0015-3\">10.1007/s11721-008-0015-3</a>.","apa":"Hamann, H., &#38; Wörn, H. (2008). A framework of space–time continuous models for algorithm design in swarm robotics. <i>Swarm Intelligence</i>, <i>2</i>(2–4), 209–239. <a href=\"https://doi.org/10.1007/s11721-008-0015-3\">https://doi.org/10.1007/s11721-008-0015-3</a>"},"intvolume":"         2","page":"209-239","year":"2008","author":[{"full_name":"Hamann, Heiko","last_name":"Hamann","first_name":"Heiko"},{"last_name":"Wörn","full_name":"Wörn, Heinz","first_name":"Heinz"}],"date_created":"2020-11-16T14:05:49Z","volume":2,"date_updated":"2022-01-06T06:54:26Z","doi":"10.1007/s11721-008-0015-3","title":"A framework of space–time continuous models for algorithm design in swarm robotics","type":"journal_article","publication":"Swarm Intelligence","status":"public","abstract":[{"lang":"eng","text":"Designing and analyzing self-organizing systems such as robotic swarms is a challenging task even though we have complete knowledge about the robot’s interior. It is difficult to determine the individual robot’s behavior based on the swarm behavior and vice versa due to the high number of agent–agent interactions. A step towards a solution of this problem is the development of appropriate models which accurately predict the swarm behavior based on a specified control algorithm. Such models would reduce the necessary number of time-consuming simulations and experiments during the design process of an algorithm. In this paper we propose a model with focus on an explicit representation of space because the effectiveness of many swarm robotic scenarios depends on spatial inhomogeneity. We use methods of statistical physics to address spatiality. Starting from a description of a single robot we derive an abstract model of swarm motion. The model is then extended to a generic model framework of communicating robots. In two examples we validate models against simulation results. Our experience shows that qualitative correctness is easily achieved, while quantitative correctness is disproportionately more difficult but still possible."}],"user_id":"15415","department":[{"_id":"63"},{"_id":"238"}],"_id":"20369","language":[{"iso":"eng"}]},{"department":[{"_id":"63"}],"user_id":"15415","_id":"17978","language":[{"iso":"eng"}],"publication":"Unconventional Computing","type":"book_chapter","status":"public","date_created":"2020-08-14T13:19:24Z","author":[{"first_name":"Katharina","full_name":"Lürwer-Brüggemeier, Katharina","last_name":"Lürwer-Brüggemeier"},{"first_name":"Martin","full_name":"Ziegler, Martin","last_name":"Ziegler"}],"date_updated":"2022-01-06T06:53:24Z","doi":"10.1007/978-3-540-85194-3_11","title":"On Faster Integer Calculations Using Non-arithmetic Primitives","publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783540851936","9783540851943"]},"publication_status":"published","citation":{"ama":"Lürwer-Brüggemeier K, Ziegler M. On Faster Integer Calculations Using Non-arithmetic Primitives. In: <i>Unconventional Computing</i>. Berlin, Heidelberg; 2008. doi:<a href=\"https://doi.org/10.1007/978-3-540-85194-3_11\">10.1007/978-3-540-85194-3_11</a>","ieee":"K. Lürwer-Brüggemeier and M. Ziegler, “On Faster Integer Calculations Using Non-arithmetic Primitives,” in <i>Unconventional Computing</i>, Berlin, Heidelberg, 2008.","chicago":"Lürwer-Brüggemeier, Katharina, and Martin Ziegler. “On Faster Integer Calculations Using Non-Arithmetic Primitives.” In <i>Unconventional Computing</i>. Berlin, Heidelberg, 2008. <a href=\"https://doi.org/10.1007/978-3-540-85194-3_11\">https://doi.org/10.1007/978-3-540-85194-3_11</a>.","apa":"Lürwer-Brüggemeier, K., &#38; Ziegler, M. (2008). On Faster Integer Calculations Using Non-arithmetic Primitives. In <i>Unconventional Computing</i>. Berlin, Heidelberg. <a href=\"https://doi.org/10.1007/978-3-540-85194-3_11\">https://doi.org/10.1007/978-3-540-85194-3_11</a>","mla":"Lürwer-Brüggemeier, Katharina, and Martin Ziegler. “On Faster Integer Calculations Using Non-Arithmetic Primitives.” <i>Unconventional Computing</i>, 2008, doi:<a href=\"https://doi.org/10.1007/978-3-540-85194-3_11\">10.1007/978-3-540-85194-3_11</a>.","short":"K. Lürwer-Brüggemeier, M. Ziegler, in: Unconventional Computing, Berlin, Heidelberg, 2008.","bibtex":"@inbook{Lürwer-Brüggemeier_Ziegler_2008, place={Berlin, Heidelberg}, title={On Faster Integer Calculations Using Non-arithmetic Primitives}, DOI={<a href=\"https://doi.org/10.1007/978-3-540-85194-3_11\">10.1007/978-3-540-85194-3_11</a>}, booktitle={Unconventional Computing}, author={Lürwer-Brüggemeier, Katharina and Ziegler, Martin}, year={2008} }"},"year":"2008","place":"Berlin, Heidelberg"},{"author":[{"first_name":"Christoph","last_name":"Laroque","full_name":"Laroque, Christoph"},{"last_name":"Fischer","full_name":"Fischer, Matthias","id":"146","first_name":"Matthias"},{"first_name":"Wilhelm","full_name":"Dangelmaier, Wilhelm","last_name":"Dangelmaier"},{"first_name":"Benjamin","full_name":"Eikel, Benjamin","last_name":"Eikel"}],"date_created":"2020-08-24T07:49:59Z","date_updated":"2022-01-06T06:53:26Z","publisher":"EUROSIS-ETI","title":"Dynamic Control of Animation Schemes for the Efficient 3D-Visualization of Material Flow Simulations","citation":{"mla":"Laroque, Christoph, et al. “Dynamic Control of Animation Schemes for the Efficient 3D-Visualization of Material Flow Simulations.” <i>Industrial Simulation Conference (ISC 2008)</i>, EUROSIS-ETI, 2008, pp. 306–10.","bibtex":"@inproceedings{Laroque_Fischer_Dangelmaier_Eikel_2008, title={Dynamic Control of Animation Schemes for the Efficient 3D-Visualization of Material Flow Simulations}, booktitle={Industrial Simulation Conference (ISC 2008)}, publisher={EUROSIS-ETI}, author={Laroque, Christoph and Fischer, Matthias and Dangelmaier, Wilhelm and Eikel, Benjamin}, year={2008}, pages={306–310} }","short":"C. Laroque, M. Fischer, W. Dangelmaier, B. Eikel, in: Industrial Simulation Conference (ISC 2008), EUROSIS-ETI, 2008, pp. 306–310.","apa":"Laroque, C., Fischer, M., Dangelmaier, W., &#38; Eikel, B. (2008). Dynamic Control of Animation Schemes for the Efficient 3D-Visualization of Material Flow Simulations. In <i>Industrial Simulation Conference (ISC 2008)</i> (pp. 306–310). EUROSIS-ETI.","chicago":"Laroque, Christoph, Matthias Fischer, Wilhelm Dangelmaier, and Benjamin Eikel. “Dynamic Control of Animation Schemes for the Efficient 3D-Visualization of Material Flow Simulations.” In <i>Industrial Simulation Conference (ISC 2008)</i>, 306–10. EUROSIS-ETI, 2008.","ieee":"C. Laroque, M. Fischer, W. Dangelmaier, and B. Eikel, “Dynamic Control of Animation Schemes for the Efficient 3D-Visualization of Material Flow Simulations,” in <i>Industrial Simulation Conference (ISC 2008)</i>, 2008, pp. 306–310.","ama":"Laroque C, Fischer M, Dangelmaier W, Eikel B. Dynamic Control of Animation Schemes for the Efficient 3D-Visualization of Material Flow Simulations. In: <i>Industrial Simulation Conference (ISC 2008)</i>. EUROSIS-ETI; 2008:306-310."},"page":"306-310","year":"2008","user_id":"15415","department":[{"_id":"63"}],"_id":"18139","language":[{"iso":"eng"}],"type":"conference","publication":"Industrial Simulation Conference (ISC 2008)","status":"public","abstract":[{"text":"This paper describes a method for the animation of a large number of objects within a dynamic 3D visualization of a material flow simulation model. It uses key-frame based animation. The number of animated objects may grow constantly in complex simulation models, which might lead to an amount of animations that is too big to be computed in real-time. By the use of a dynamic adjustment, the presented algorithm prefers important animations. Less relevant animations are updated rarely, whereby the selection itself is taken by multiple indicators, e.g. the visible size of the animated object on the screen, in order to keep a good optical impression. Dependent on the computing power of the computer, the algorithm controls the animations in such a way, that the fluid visualization of a large number of objects is still possible. Though the algorithm is to be used within a material flow simulator, it is moreover implemented in a specific animation editor, which allows the design and control of animation schemes. It supports the use of grouping to allow the creation of hierarchical structures for complex animations in a fast and easy manner. The evaluation of the algorithm is proven by a test scene, consisting of tens of thousands animated objects. ","lang":"eng"}]},{"language":[{"iso":"eng"}],"user_id":"5786","department":[{"_id":"63"},{"_id":"26"}],"_id":"18141","status":"public","abstract":[{"text":"Dieser Artikel beschreibt eine Methode zur Animation einer großen Anzahl von Objekten zur dynamischen 3D-Visualisierung eines Simulationsmodells mittels der Materialflusssimulation auf Basis von Schlüsselbildern. Die Anzahl zu animierender Objekte ist in komplexen Modellen zu groß, um alle Animationen flüssig darzustellen. Dynamisch abgestuft wählt das entwickelte Verfahren gezielt wichtige Animationen aus, weniger relevante Animationen werden entsprechend seltener animiert. Die Selektion der Animationen erfolgt nach der projizierten Größe der Objekte auf das Ausgabegerät, um einen guten optischen Eindruck beizubehalten. Angepasst an die Leistungsfähigkeit des Rechners wird das Verfahren so geregelt, dass die Visualisierung einer hohen Anzahl von Objekten in Echtzeit möglich bleibt. Das Verfahren ist in einem Editor prototypisch implementiert, mit dem Schlüsselbilder für Objekte erzeugt werden können. Das Gruppieren von Objekten wird erlaubt, so dass eine Hierarchie von Bewegungspfaden definierbar ist. Die Evaluierung der Methode wird mittels Testszenen durchgeführt, die aus mehreren zehntausend animierten Objekten bestehen.","lang":"ger"}],"type":"conference","publication":"Augmented & Virtual Reality in der Produktentstehung","title":"Regelung von Animationen in Simulationen von  hochdynamischen Fabrikszenen ","author":[{"first_name":"Christoph","last_name":"Laroque","full_name":"Laroque, Christoph"},{"last_name":"Fischer","full_name":"Fischer, Matthias","id":"146","first_name":"Matthias"},{"first_name":"Benjamin","full_name":"Eikel, Benjamin","last_name":"Eikel"}],"date_created":"2020-08-24T07:56:43Z","volume":232,"date_updated":"2022-01-06T06:53:26Z","publisher":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","citation":{"ama":"Laroque C, Fischer M, Eikel B. Regelung von Animationen in Simulationen von  hochdynamischen Fabrikszenen . In: <i>Augmented &#38; Virtual Reality in Der Produktentstehung</i>. Vol 232. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn; 2008:193--206.","ieee":"C. Laroque, M. Fischer, and B. Eikel, “Regelung von Animationen in Simulationen von  hochdynamischen Fabrikszenen ,” in <i>Augmented &#38; Virtual Reality in der Produktentstehung</i>, 2008, vol. 232, pp. 193--206.","chicago":"Laroque, Christoph, Matthias Fischer, and Benjamin Eikel. “Regelung von Animationen in Simulationen von  Hochdynamischen Fabrikszenen .” In <i>Augmented &#38; Virtual Reality in Der Produktentstehung</i>, 232:193--206. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2008.","apa":"Laroque, C., Fischer, M., &#38; Eikel, B. (2008). Regelung von Animationen in Simulationen von  hochdynamischen Fabrikszenen . <i>Augmented &#38; Virtual Reality in Der Produktentstehung</i>, <i>232</i>, 193--206.","bibtex":"@inproceedings{Laroque_Fischer_Eikel_2008, title={Regelung von Animationen in Simulationen von  hochdynamischen Fabrikszenen }, volume={232}, booktitle={Augmented &#38; Virtual Reality in der Produktentstehung}, publisher={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, author={Laroque, Christoph and Fischer, Matthias and Eikel, Benjamin}, year={2008}, pages={193--206} }","mla":"Laroque, Christoph, et al. “Regelung von Animationen in Simulationen von  Hochdynamischen Fabrikszenen .” <i>Augmented &#38; Virtual Reality in Der Produktentstehung</i>, vol. 232, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2008, pp. 193--206.","short":"C. Laroque, M. Fischer, B. Eikel, in: Augmented &#38; Virtual Reality in Der Produktentstehung, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2008, pp. 193--206."},"intvolume":"       232","page":"193--206","year":"2008"},{"citation":{"chicago":"Le Roux, Stéphane, and Martin Ziegler. “Singular Coverings and Non-Uniform Notions of Closed Set Computability.” <i>Electronic Notes in Theoretical Computer Science</i>, 2008, 73–88. <a href=\"https://doi.org/10.1016/j.entcs.2008.03.009\">https://doi.org/10.1016/j.entcs.2008.03.009</a>.","ieee":"S. Le Roux and M. Ziegler, “Singular Coverings and Non-Uniform Notions of Closed Set Computability,” <i>Electronic Notes in Theoretical Computer Science</i>, pp. 73–88, 2008, doi: <a href=\"https://doi.org/10.1016/j.entcs.2008.03.009\">10.1016/j.entcs.2008.03.009</a>.","ama":"Le Roux S, Ziegler M. Singular Coverings and Non-Uniform Notions of Closed Set Computability. <i>Electronic Notes in Theoretical Computer Science</i>. Published online 2008:73-88. doi:<a href=\"https://doi.org/10.1016/j.entcs.2008.03.009\">10.1016/j.entcs.2008.03.009</a>","apa":"Le Roux, S., &#38; Ziegler, M. (2008). Singular Coverings and Non-Uniform Notions of Closed Set Computability. <i>Electronic Notes in Theoretical Computer Science</i>, 73–88. <a href=\"https://doi.org/10.1016/j.entcs.2008.03.009\">https://doi.org/10.1016/j.entcs.2008.03.009</a>","bibtex":"@article{Le Roux_Ziegler_2008, title={Singular Coverings and Non-Uniform Notions of Closed Set Computability}, DOI={<a href=\"https://doi.org/10.1016/j.entcs.2008.03.009\">10.1016/j.entcs.2008.03.009</a>}, journal={Electronic Notes in Theoretical Computer Science}, author={Le Roux, Stéphane and Ziegler, Martin}, year={2008}, pages={73–88} }","short":"S. Le Roux, M. Ziegler, Electronic Notes in Theoretical Computer Science (2008) 73–88.","mla":"Le Roux, Stéphane, and Martin Ziegler. “Singular Coverings and Non-Uniform Notions of Closed Set Computability.” <i>Electronic Notes in Theoretical Computer Science</i>, 2008, pp. 73–88, doi:<a href=\"https://doi.org/10.1016/j.entcs.2008.03.009\">10.1016/j.entcs.2008.03.009</a>."},"page":"73-88","year":"2008","publication_status":"published","publication_identifier":{"issn":["1571-0661"]},"doi":"10.1016/j.entcs.2008.03.009","title":"Singular Coverings and Non-Uniform Notions of Closed Set Computability","author":[{"first_name":"Stéphane","full_name":"Le Roux, Stéphane","last_name":"Le Roux"},{"last_name":"Ziegler","full_name":"Ziegler, Martin","first_name":"Martin"}],"date_created":"2020-08-24T08:07:43Z","date_updated":"2022-01-06T06:53:26Z","status":"public","type":"journal_article","publication":"Electronic Notes in Theoretical Computer Science","language":[{"iso":"eng"}],"user_id":"15415","department":[{"_id":"63"}],"_id":"18143"},{"publication":"Internet Mathematics","abstract":[{"lang":"eng","text":"We present a game theoretic study of hybrid communication networks in which mobile devices can connect in an ad hoc fashion to a base station, possibly via a few hops using other mobile devices as intermediate nodes. The maximal number of allowed hops might be bounded with the motivation to guarantee small latency. We introduce hybrid connectivity games to study the impact of selfishness on this kind of infrastructure.\r\n\r\nMobile devices are represented by selfish players, each of which aims at establishing an uplink path to the base station minimizing its individual cost. Our model assumes that intermediate nodes on an uplink path are reimbursed for transmitting the packets of other devices. The reimbursements can be paid either by a benevolent network operator or by the senders of the packets using micropayments via a clearing agency that possibly collects a small percentage as commission. These different ways to implement the payments lead to different variants of the hybrid connectivity game. Our main findings are: (1) If there is no constraint on the number of allowed hops on the path to the base station, then the existence of equilibria is guaranteed regardless of whether the network operator or the senders pay for forwarding packets. (2) If the network operator pays, then the existence of equilibria is guaranteed only if at most one intermediate node is allowed, i.e., for at most two hops on the uplink path of a device, but not if the maximal number of allowed hops is three or larger. (3) In contrast, if the senders pay for forwarding their packets, then equilibria are guaranteed to exist given any bound on the number of allowed hops.\r\n\r\nThe equilibrium analysis presented in this paper gives a first game theoretical motivation for the implementation of micropayment schemes in which senders pay for forwarding their packets. We further support this evidence by giving an upper bound on the Price of Anarchy for this kind of hybrid connectivity games that is independent of the number of nodes, but only depends on the number of hops and the power gradient."}],"language":[{"iso":"eng"}],"issue":"4","year":"2008","publisher":"Springer","date_created":"2020-08-28T12:29:59Z","title":"Who Should Pay for Forwarding Packets?","type":"journal_article","status":"public","_id":"18570","user_id":"15415","department":[{"_id":"63"}],"publication_status":"published","publication_identifier":{"isbn":["9783540771043"]},"citation":{"bibtex":"@article{Ackermann_Briest_Fanghänel_Vöcking_2008, title={Who Should Pay for Forwarding Packets?}, volume={5}, DOI={<a href=\"https://doi.org/10.1007/978-3-540-77105-0_21\">10.1007/978-3-540-77105-0_21</a>}, number={4}, journal={Internet Mathematics}, publisher={Springer}, author={Ackermann, Heiner and Briest, Patrick and Fanghänel, Alexander and Vöcking, Berthold}, year={2008}, pages={459–475} }","mla":"Ackermann, Heiner, et al. “Who Should Pay for Forwarding Packets?” <i>Internet Mathematics</i>, vol. 5, no. 4, Springer, 2008, pp. 459–75, doi:<a href=\"https://doi.org/10.1007/978-3-540-77105-0_21\">10.1007/978-3-540-77105-0_21</a>.","short":"H. Ackermann, P. Briest, A. Fanghänel, B. Vöcking, Internet Mathematics 5 (2008) 459–475.","apa":"Ackermann, H., Briest, P., Fanghänel, A., &#38; Vöcking, B. (2008). Who Should Pay for Forwarding Packets? <i>Internet Mathematics</i>, <i>5</i>(4), 459–475. <a href=\"https://doi.org/10.1007/978-3-540-77105-0_21\">https://doi.org/10.1007/978-3-540-77105-0_21</a>","ieee":"H. Ackermann, P. Briest, A. Fanghänel, and B. Vöcking, “Who Should Pay for Forwarding Packets?,” <i>Internet Mathematics</i>, vol. 5, no. 4, pp. 459–475, 2008.","chicago":"Ackermann, Heiner, Patrick Briest, Alexander Fanghänel, and Berthold Vöcking. “Who Should Pay for Forwarding Packets?” <i>Internet Mathematics</i> 5, no. 4 (2008): 459–75. <a href=\"https://doi.org/10.1007/978-3-540-77105-0_21\">https://doi.org/10.1007/978-3-540-77105-0_21</a>.","ama":"Ackermann H, Briest P, Fanghänel A, Vöcking B. Who Should Pay for Forwarding Packets? <i>Internet Mathematics</i>. 2008;5(4):459-475. doi:<a href=\"https://doi.org/10.1007/978-3-540-77105-0_21\">10.1007/978-3-540-77105-0_21</a>"},"page":"459-475","intvolume":"         5","date_updated":"2022-01-06T06:53:40Z","author":[{"first_name":"Heiner","full_name":"Ackermann, Heiner","last_name":"Ackermann"},{"first_name":"Patrick","last_name":"Briest","full_name":"Briest, Patrick"},{"first_name":"Alexander","full_name":"Fanghänel, Alexander","last_name":"Fanghänel"},{"first_name":"Berthold","last_name":"Vöcking","full_name":"Vöcking, Berthold"}],"volume":5,"doi":"10.1007/978-3-540-77105-0_21"},{"_id":"16463","user_id":"15415","department":[{"_id":"63"}],"language":[{"iso":"eng"}],"type":"book_chapter","publication":"Biologically-Inspired Collaborative Computing","status":"public","date_updated":"2022-01-06T06:52:50Z","date_created":"2020-04-08T08:32:22Z","author":[{"last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","id":"15523","first_name":"Friedhelm"},{"first_name":"Barbara","full_name":"Schneider, Barbara","last_name":"Schneider"}],"title":"Local Strategies for Connecting Stations by Small Robotic Networks","doi":"10.1007/978-0-387-09655-1_9","publication_status":"published","publication_identifier":{"issn":["1571-5736"],"isbn":["9780387096544","9780387096551"]},"place":"Boston, MA","year":"2008","citation":{"ama":"Meyer auf der Heide F, Schneider B. Local Strategies for Connecting Stations by Small Robotic Networks. In: <i>Biologically-Inspired Collaborative Computing</i>. Boston, MA; 2008. doi:<a href=\"https://doi.org/10.1007/978-0-387-09655-1_9\">10.1007/978-0-387-09655-1_9</a>","ieee":"F. Meyer auf der Heide and B. Schneider, “Local Strategies for Connecting Stations by Small Robotic Networks,” in <i>Biologically-Inspired Collaborative Computing</i>, Boston, MA, 2008.","chicago":"Meyer auf der Heide, Friedhelm, and Barbara Schneider. “Local Strategies for Connecting Stations by Small Robotic Networks.” In <i>Biologically-Inspired Collaborative Computing</i>. Boston, MA, 2008. <a href=\"https://doi.org/10.1007/978-0-387-09655-1_9\">https://doi.org/10.1007/978-0-387-09655-1_9</a>.","mla":"Meyer auf der Heide, Friedhelm, and Barbara Schneider. “Local Strategies for Connecting Stations by Small Robotic Networks.” <i>Biologically-Inspired Collaborative Computing</i>, 2008, doi:<a href=\"https://doi.org/10.1007/978-0-387-09655-1_9\">10.1007/978-0-387-09655-1_9</a>.","short":"F. Meyer auf der Heide, B. Schneider, in: Biologically-Inspired Collaborative Computing, Boston, MA, 2008.","bibtex":"@inbook{Meyer auf der Heide_Schneider_2008, place={Boston, MA}, title={Local Strategies for Connecting Stations by Small Robotic Networks}, DOI={<a href=\"https://doi.org/10.1007/978-0-387-09655-1_9\">10.1007/978-0-387-09655-1_9</a>}, booktitle={Biologically-Inspired Collaborative Computing}, author={Meyer auf der Heide, Friedhelm and Schneider, Barbara}, year={2008} }","apa":"Meyer auf der Heide, F., &#38; Schneider, B. (2008). Local Strategies for Connecting Stations by Small Robotic Networks. In <i>Biologically-Inspired Collaborative Computing</i>. Boston, MA. <a href=\"https://doi.org/10.1007/978-0-387-09655-1_9\">https://doi.org/10.1007/978-0-387-09655-1_9</a>"}},{"user_id":"15415","department":[{"_id":"63"}],"_id":"16464","language":[{"iso":"eng"}],"type":"book_chapter","publication":"Taschenbuch der Algorithmen","status":"public","author":[{"first_name":"Joachim","full_name":"Gehweiler, Joachim","last_name":"Gehweiler"},{"id":"15523","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","first_name":"Friedhelm"}],"date_created":"2020-04-08T08:39:36Z","date_updated":"2022-01-06T06:52:50Z","doi":"10.1007/978-3-540-76394-9_40","title":"Bin Packing oder „Wie bekomme ich die Klamotten in die Kisten?“","publication_status":"published","publication_identifier":{"isbn":["9783540763932","9783540763949"]},"citation":{"ama":"Gehweiler J, Meyer auf der Heide F. Bin Packing oder „Wie bekomme ich die Klamotten in die Kisten?“. In: <i>Taschenbuch Der Algorithmen</i>. Berlin, Heidelberg; 2008. doi:<a href=\"https://doi.org/10.1007/978-3-540-76394-9_40\">10.1007/978-3-540-76394-9_40</a>","ieee":"J. Gehweiler and F. Meyer auf der Heide, “Bin Packing oder „Wie bekomme ich die Klamotten in die Kisten?“,” in <i>Taschenbuch der Algorithmen</i>, Berlin, Heidelberg, 2008.","chicago":"Gehweiler, Joachim, and Friedhelm Meyer auf der Heide. “Bin Packing Oder „Wie Bekomme Ich Die Klamotten in Die Kisten?“.” In <i>Taschenbuch Der Algorithmen</i>. Berlin, Heidelberg, 2008. <a href=\"https://doi.org/10.1007/978-3-540-76394-9_40\">https://doi.org/10.1007/978-3-540-76394-9_40</a>.","apa":"Gehweiler, J., &#38; Meyer auf der Heide, F. (2008). Bin Packing oder „Wie bekomme ich die Klamotten in die Kisten?“. In <i>Taschenbuch der Algorithmen</i>. Berlin, Heidelberg. <a href=\"https://doi.org/10.1007/978-3-540-76394-9_40\">https://doi.org/10.1007/978-3-540-76394-9_40</a>","bibtex":"@inbook{Gehweiler_Meyer auf der Heide_2008, place={Berlin, Heidelberg}, title={Bin Packing oder „Wie bekomme ich die Klamotten in die Kisten?“}, DOI={<a href=\"https://doi.org/10.1007/978-3-540-76394-9_40\">10.1007/978-3-540-76394-9_40</a>}, booktitle={Taschenbuch der Algorithmen}, author={Gehweiler, Joachim and Meyer auf der Heide, Friedhelm}, year={2008} }","mla":"Gehweiler, Joachim, and Friedhelm Meyer auf der Heide. “Bin Packing Oder „Wie Bekomme Ich Die Klamotten in Die Kisten?“.” <i>Taschenbuch Der Algorithmen</i>, 2008, doi:<a href=\"https://doi.org/10.1007/978-3-540-76394-9_40\">10.1007/978-3-540-76394-9_40</a>.","short":"J. Gehweiler, F. Meyer auf der Heide, in: Taschenbuch Der Algorithmen, Berlin, Heidelberg, 2008."},"year":"2008","place":"Berlin, Heidelberg"},{"publication":"arXiv:0810.0052","type":"preprint","status":"public","abstract":[{"lang":"eng","text":"For a fixed virtual scene (=collection of simplices) S and given observer\r\nposition p, how many elements of S are weakly visible (i.e. not fully occluded\r\nby others) from p? The present work explores the trade-off between query time\r\nand preprocessing space for these quantities in 2D: exactly, in the approximate\r\ndeterministic, and in the probabilistic sense. We deduce the EXISTENCE of an\r\nO(m^2/n^2) space data structure for S that, given p and time O(log n), allows\r\nto approximate the ratio of occluded segments up to arbitrary constant absolute\r\nerror; here m denotes the size of the Visibility Graph--which may be quadratic,\r\nbut typically is just linear in the size n of the scene S. On the other hand,\r\nwe present a data structure CONSTRUCTIBLE in O(n*log(n)+m^2*polylog(n)/k)\r\npreprocessing time and space with similar approximation properties and query\r\ntime O(k*polylog n), where k<n is an arbitrary parameter. We describe an\r\nimplementation of this approach and demonstrate the practical benefit of the\r\nparameter k to trade memory for query time in an empirical evaluation on three\r\nclasses of benchmark scenes."}],"department":[{"_id":"63"}],"user_id":"15415","external_id":{"arxiv":["0810.0052"]},"_id":"16465","language":[{"iso":"eng"}],"citation":{"bibtex":"@article{Fischer_Hilbig_Jähn_Meyer auf der Heide_Ziegler_2008, title={Planar Visibility Counting}, journal={arXiv:0810.0052}, author={Fischer, Matthias and Hilbig, Matthias and Jähn, Claudius and Meyer auf der Heide, Friedhelm and Ziegler, Martin}, year={2008} }","mla":"Fischer, Matthias, et al. “Planar Visibility Counting.” <i>ArXiv:0810.0052</i>, 2008.","short":"M. Fischer, M. Hilbig, C. Jähn, F. Meyer auf der Heide, M. Ziegler, ArXiv:0810.0052 (2008).","apa":"Fischer, M., Hilbig, M., Jähn, C., Meyer auf der Heide, F., &#38; Ziegler, M. (2008). Planar Visibility Counting. <i>ArXiv:0810.0052</i>.","chicago":"Fischer, Matthias, Matthias Hilbig, Claudius Jähn, Friedhelm Meyer auf der Heide, and Martin Ziegler. “Planar Visibility Counting.” <i>ArXiv:0810.0052</i>, 2008.","ieee":"M. Fischer, M. Hilbig, C. Jähn, F. Meyer auf der Heide, and M. Ziegler, “Planar Visibility Counting,” <i>arXiv:0810.0052</i>. 2008.","ama":"Fischer M, Hilbig M, Jähn C, Meyer auf der Heide F, Ziegler M. Planar Visibility Counting. <i>arXiv:08100052</i>. 2008."},"year":"2008","author":[{"first_name":"Matthias","last_name":"Fischer","id":"146","full_name":"Fischer, Matthias"},{"full_name":"Hilbig, Matthias","last_name":"Hilbig","first_name":"Matthias"},{"full_name":"Jähn, Claudius","last_name":"Jähn","first_name":"Claudius"},{"full_name":"Meyer auf der Heide, Friedhelm","id":"15523","last_name":"Meyer auf der Heide","first_name":"Friedhelm"},{"first_name":"Martin","last_name":"Ziegler","full_name":"Ziegler, Martin"}],"date_created":"2020-04-08T08:41:52Z","date_updated":"2022-01-06T06:52:50Z","title":"Planar Visibility Counting"},{"type":"conference_editor","status":"public","editor":[{"first_name":"Friedhelm","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","id":"15523"},{"first_name":"Nir","full_name":"Shavit, Nir","last_name":"Shavit"}],"user_id":"15415","department":[{"_id":"63"}],"_id":"16466","language":[{"iso":"eng"}],"publication_status":"published","publication_identifier":{"isbn":["978-1-59593-973-9"]},"citation":{"bibtex":"@book{Meyer auf der Heide_Shavit_2008, title={Proceedings of the twentieth annual symposium on Parallelism in algorithms and architectures - SPAA ’08}, DOI={<a href=\"https://doi.org/10.1145/1378533\">10.1145/1378533</a>}, publisher={ACM}, year={2008} }","mla":"Meyer auf der Heide, Friedhelm, and Nir Shavit, editors. <i>Proceedings of the Twentieth Annual Symposium on Parallelism in Algorithms and Architectures - SPAA ’08</i>. ACM, 2008, doi:<a href=\"https://doi.org/10.1145/1378533\">10.1145/1378533</a>.","short":"F. Meyer auf der Heide, N. Shavit, eds., Proceedings of the Twentieth Annual Symposium on Parallelism in Algorithms and Architectures - SPAA ’08, ACM, 2008.","apa":"Meyer auf der Heide, F., &#38; Shavit, N. (Eds.). (2008). <i>Proceedings of the twentieth annual symposium on Parallelism in algorithms and architectures - SPAA ’08</i>. ACM. <a href=\"https://doi.org/10.1145/1378533\">https://doi.org/10.1145/1378533</a>","ieee":"F. Meyer auf der Heide and N. Shavit, Eds., <i>Proceedings of the twentieth annual symposium on Parallelism in algorithms and architectures - SPAA ’08</i>. ACM, 2008.","chicago":"Meyer auf der Heide, Friedhelm, and Nir Shavit, eds. <i>Proceedings of the Twentieth Annual Symposium on Parallelism in Algorithms and Architectures - SPAA ’08</i>. ACM, 2008. <a href=\"https://doi.org/10.1145/1378533\">https://doi.org/10.1145/1378533</a>.","ama":"Meyer auf der Heide F, Shavit N, eds. <i>Proceedings of the Twentieth Annual Symposium on Parallelism in Algorithms and Architectures - SPAA ’08</i>. ACM; 2008. doi:<a href=\"https://doi.org/10.1145/1378533\">10.1145/1378533</a>"},"year":"2008","date_created":"2020-04-08T08:46:08Z","date_updated":"2022-01-06T06:52:50Z","publisher":"ACM","doi":"10.1145/1378533","title":"Proceedings of the twentieth annual symposium on Parallelism in algorithms and architectures - SPAA '08"},{"date_updated":"2026-03-10T11:00:35Z","publisher":"Fakultät für Elektrotechnik, Informatik und Mathematik, Universität Paderborn","volume":222,"author":[{"last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","id":"15523","first_name":"Friedhelm"}],"date_created":"2020-08-03T14:19:28Z","title":"The European Integrated Project \"Dynamically Evolving, Large Scale Information Systems (DELIS)\"","publication_identifier":{"isbn":["ISBN 978-3-939350-41-5"]},"place":"Paderborn","year":"2008","intvolume":"       222","citation":{"apa":"Meyer auf der Heide, F. (2008). <i>The European Integrated Project “Dynamically Evolving, Large Scale Information Systems (DELIS)”</i> (Vol. 222). Fakultät für Elektrotechnik, Informatik und Mathematik, Universität Paderborn.","bibtex":"@book{Meyer auf der Heide_2008, place={Paderborn}, series={Verlagsschriftenreihe des Heinz Nixdorf Instituts}, title={The European Integrated Project “Dynamically Evolving, Large Scale Information Systems (DELIS)”}, volume={222}, publisher={Fakultät für Elektrotechnik, Informatik und Mathematik, Universität Paderborn}, author={Meyer auf der Heide, Friedhelm}, year={2008}, collection={Verlagsschriftenreihe des Heinz Nixdorf Instituts} }","short":"F. Meyer auf der Heide, The European Integrated Project “Dynamically Evolving, Large Scale Information Systems (DELIS),” Fakultät für Elektrotechnik, Informatik und Mathematik, Universität Paderborn, Paderborn, 2008.","mla":"Meyer auf der Heide, Friedhelm. <i>The European Integrated Project “Dynamically Evolving, Large Scale Information Systems (DELIS).”</i> Fakultät für Elektrotechnik, Informatik und Mathematik, Universität Paderborn, 2008.","ama":"Meyer auf der Heide F. <i>The European Integrated Project “Dynamically Evolving, Large Scale Information Systems (DELIS).”</i> Vol 222. Fakultät für Elektrotechnik, Informatik und Mathematik, Universität Paderborn; 2008.","ieee":"F. Meyer auf der Heide, <i>The European Integrated Project “Dynamically Evolving, Large Scale Information Systems (DELIS),”</i> vol. 222. Paderborn: Fakultät für Elektrotechnik, Informatik und Mathematik, Universität Paderborn, 2008.","chicago":"Meyer auf der Heide, Friedhelm. <i>The European Integrated Project “Dynamically Evolving, Large Scale Information Systems (DELIS).”</i> Vol. 222. Verlagsschriftenreihe Des Heinz Nixdorf Instituts. Paderborn: Fakultät für Elektrotechnik, Informatik und Mathematik, Universität Paderborn, 2008."},"_id":"17566","department":[{"_id":"63"}],"series_title":"Verlagsschriftenreihe des Heinz Nixdorf Instituts","user_id":"14972","language":[{"iso":"eng"}],"alternative_title":[" Proceedings of the Final Workshop, Barcelona, February 27-28, 2008"],"type":"book","status":"public"},{"language":[{"iso":"eng"}],"_id":"19689","department":[{"_id":"63"}],"user_id":"15415","status":"public","publication":"Proceedings of the 18th ACM-SIAM Symposium on Discrete Algorithms (SODA)","type":"conference","title":"Buying Cheap is Expensive: Hardness of Non-Parametric Multi-Product Pricing","date_updated":"2022-01-06T06:54:10Z","date_created":"2020-09-25T10:19:13Z","author":[{"last_name":"Briest","full_name":"Briest, Patrick","first_name":"Patrick"},{"last_name":"Krysta","full_name":"Krysta, Piotr","first_name":"Piotr"}],"year":"2007","citation":{"bibtex":"@inproceedings{Briest_Krysta_2007, title={Buying Cheap is Expensive: Hardness of Non-Parametric Multi-Product Pricing}, booktitle={Proceedings of the 18th ACM-SIAM Symposium on Discrete Algorithms (SODA)}, author={Briest, Patrick and Krysta, Piotr}, year={2007} }","short":"P. Briest, P. Krysta, in: Proceedings of the 18th ACM-SIAM Symposium on Discrete Algorithms (SODA), 2007.","mla":"Briest, Patrick, and Piotr Krysta. “Buying Cheap Is Expensive: Hardness of Non-Parametric Multi-Product Pricing.” <i>Proceedings of the 18th ACM-SIAM Symposium on Discrete Algorithms (SODA)</i>, 2007.","apa":"Briest, P., &#38; Krysta, P. (2007). Buying Cheap is Expensive: Hardness of Non-Parametric Multi-Product Pricing. In <i>Proceedings of the 18th ACM-SIAM Symposium on Discrete Algorithms (SODA)</i>.","ama":"Briest P, Krysta P. Buying Cheap is Expensive: Hardness of Non-Parametric Multi-Product Pricing. In: <i>Proceedings of the 18th ACM-SIAM Symposium on Discrete Algorithms (SODA)</i>. ; 2007.","chicago":"Briest, Patrick, and Piotr Krysta. “Buying Cheap Is Expensive: Hardness of Non-Parametric Multi-Product Pricing.” In <i>Proceedings of the 18th ACM-SIAM Symposium on Discrete Algorithms (SODA)</i>, 2007.","ieee":"P. Briest and P. Krysta, “Buying Cheap is Expensive: Hardness of Non-Parametric Multi-Product Pricing,” in <i>Proceedings of the 18th ACM-SIAM Symposium on Discrete Algorithms (SODA)</i>, 2007."}},{"type":"conference","publication":"2007 IEEE International Parallel and Distributed Processing Symposium","status":"public","user_id":"15415","department":[{"_id":"63"}],"_id":"19725","language":[{"iso":"eng"}],"publication_status":"published","publication_identifier":{"isbn":["1424409098"]},"citation":{"ama":"Bonorden O. Load Balancing in the Bulk-Synchronous-Parallel Setting using Process Migrations. In: <i>2007 IEEE International Parallel and Distributed Processing Symposium</i>. ; 2007. doi:<a href=\"https://doi.org/10.1109/ipdps.2007.370330\">10.1109/ipdps.2007.370330</a>","ieee":"O. Bonorden, “Load Balancing in the Bulk-Synchronous-Parallel Setting using Process Migrations,” in <i>2007 IEEE International Parallel and Distributed Processing Symposium</i>, 2007.","chicago":"Bonorden, Olaf. “Load Balancing in the Bulk-Synchronous-Parallel Setting Using Process Migrations.” In <i>2007 IEEE International Parallel and Distributed Processing Symposium</i>, 2007. <a href=\"https://doi.org/10.1109/ipdps.2007.370330\">https://doi.org/10.1109/ipdps.2007.370330</a>.","apa":"Bonorden, O. (2007). Load Balancing in the Bulk-Synchronous-Parallel Setting using Process Migrations. In <i>2007 IEEE International Parallel and Distributed Processing Symposium</i>. <a href=\"https://doi.org/10.1109/ipdps.2007.370330\">https://doi.org/10.1109/ipdps.2007.370330</a>","short":"O. Bonorden, in: 2007 IEEE International Parallel and Distributed Processing Symposium, 2007.","bibtex":"@inproceedings{Bonorden_2007, title={Load Balancing in the Bulk-Synchronous-Parallel Setting using Process Migrations}, DOI={<a href=\"https://doi.org/10.1109/ipdps.2007.370330\">10.1109/ipdps.2007.370330</a>}, booktitle={2007 IEEE International Parallel and Distributed Processing Symposium}, author={Bonorden, Olaf}, year={2007} }","mla":"Bonorden, Olaf. “Load Balancing in the Bulk-Synchronous-Parallel Setting Using Process Migrations.” <i>2007 IEEE International Parallel and Distributed Processing Symposium</i>, 2007, doi:<a href=\"https://doi.org/10.1109/ipdps.2007.370330\">10.1109/ipdps.2007.370330</a>."},"year":"2007","author":[{"full_name":"Bonorden, Olaf","last_name":"Bonorden","first_name":"Olaf"}],"date_created":"2020-09-28T10:34:50Z","date_updated":"2022-01-06T06:54:10Z","doi":"10.1109/ipdps.2007.370330","title":"Load Balancing in the Bulk-Synchronous-Parallel Setting using Process Migrations"},{"type":"conference","publication":"ROBOCOMM'07: Proc. of the 1st International Conference on Robot Communication and Coordination","status":"public","abstract":[{"lang":"eng","text":"For the first time, the problem of optimizing energy for communication and motion is investigated. We consider a single mobile robot with continuous high bandwidth wireless communication, e.g. caused by a multimedia application like video surveillance. This robot is connected to a radio base station and moves with constant speed from a given starting point on the plane to a target point. The task is to find the best path such that the energy consumption for mobility and the communication is optimized. This is motivated by the fact that the energy\r\nconsumption of radio devices increases polynomially (at least to\r\nthe power of two) with the transmission distance. We introduce efficient approximation algorithms finding the optimal path given the starting point, the target point and the position of the radio stations. We exemplify the influence of the communication cost by a starting scenario with one radio station. We study the performance of the proposed algorithm in simulation, compare it with the scenario without applying our approach, and present the results."}],"user_id":"15415","department":[{"_id":"63"}],"_id":"19809","language":[{"iso":"eng"}],"publication_status":"published","publication_identifier":{"issn":["1383-469X","1572-8153"]},"citation":{"ama":"Ooi CC, Schindelhauer C. Minimal Energy Path Planning for Wireless Robots. In: <i>ROBOCOMM’07: Proc. of the 1st International Conference on Robot Communication and Coordination</i>. ; 2007:309-321. doi:<a href=\"https://doi.org/10.1007/s11036-008-0150-5\">10.1007/s11036-008-0150-5</a>","chicago":"Ooi, Chia Ching, and Christian Schindelhauer. “Minimal Energy Path Planning for Wireless Robots.” In <i>ROBOCOMM’07: Proc. of the 1st International Conference on Robot Communication and Coordination</i>, 309–21, 2007. <a href=\"https://doi.org/10.1007/s11036-008-0150-5\">https://doi.org/10.1007/s11036-008-0150-5</a>.","ieee":"C. C. Ooi and C. Schindelhauer, “Minimal Energy Path Planning for Wireless Robots,” in <i>ROBOCOMM’07: Proc. of the 1st International Conference on Robot Communication and Coordination</i>, 2007, pp. 309–321.","mla":"Ooi, Chia Ching, and Christian Schindelhauer. “Minimal Energy Path Planning for Wireless Robots.” <i>ROBOCOMM’07: Proc. of the 1st International Conference on Robot Communication and Coordination</i>, 2007, pp. 309–21, doi:<a href=\"https://doi.org/10.1007/s11036-008-0150-5\">10.1007/s11036-008-0150-5</a>.","bibtex":"@inproceedings{Ooi_Schindelhauer_2007, title={Minimal Energy Path Planning for Wireless Robots}, DOI={<a href=\"https://doi.org/10.1007/s11036-008-0150-5\">10.1007/s11036-008-0150-5</a>}, booktitle={ROBOCOMM’07: Proc. of the 1st International Conference on Robot Communication and Coordination}, author={Ooi, Chia Ching and Schindelhauer, Christian}, year={2007}, pages={309–321} }","short":"C.C. Ooi, C. Schindelhauer, in: ROBOCOMM’07: Proc. of the 1st International Conference on Robot Communication and Coordination, 2007, pp. 309–321.","apa":"Ooi, C. C., &#38; Schindelhauer, C. (2007). Minimal Energy Path Planning for Wireless Robots. In <i>ROBOCOMM’07: Proc. of the 1st International Conference on Robot Communication and Coordination</i> (pp. 309–321). <a href=\"https://doi.org/10.1007/s11036-008-0150-5\">https://doi.org/10.1007/s11036-008-0150-5</a>"},"page":"309-321","year":"2007","author":[{"full_name":"Ooi, Chia Ching","last_name":"Ooi","first_name":"Chia Ching"},{"first_name":"Christian","last_name":"Schindelhauer","full_name":"Schindelhauer, Christian"}],"date_created":"2020-09-30T13:15:46Z","date_updated":"2022-01-06T06:54:13Z","doi":"10.1007/s11036-008-0150-5","title":"Minimal Energy Path Planning for Wireless Robots"},{"language":[{"iso":"eng"}],"_id":"19853","department":[{"_id":"63"}],"user_id":"15415","status":"public","publication":"Advanced Information Networking and Applications (AINA-07)","type":"conference","title":"DHHT-RAID: A Distributed Heterogeneous Scalable Architecture for Dynamic Storage Environments","doi":"10.1109/aina.2007.59","date_updated":"2022-01-06T06:54:13Z","volume":21,"date_created":"2020-10-02T11:49:58Z","author":[{"first_name":"Gunnar","last_name":"Schomaker","full_name":"Schomaker, Gunnar"}],"year":"2007","page":"331-339","intvolume":"        21","citation":{"ama":"Schomaker G. DHHT-RAID: A Distributed Heterogeneous Scalable Architecture for Dynamic Storage Environments. In: <i>Advanced Information Networking and Applications (AINA-07)</i>. Vol 21. ; 2007:331-339. doi:<a href=\"https://doi.org/10.1109/aina.2007.59\">10.1109/aina.2007.59</a>","ieee":"G. Schomaker, “DHHT-RAID: A Distributed Heterogeneous Scalable Architecture for Dynamic Storage Environments,” in <i>Advanced Information Networking and Applications (AINA-07)</i>, 2007, vol. 21, pp. 331–339.","chicago":"Schomaker, Gunnar. “DHHT-RAID: A Distributed Heterogeneous Scalable Architecture for Dynamic Storage Environments.” In <i>Advanced Information Networking and Applications (AINA-07)</i>, 21:331–39, 2007. <a href=\"https://doi.org/10.1109/aina.2007.59\">https://doi.org/10.1109/aina.2007.59</a>.","mla":"Schomaker, Gunnar. “DHHT-RAID: A Distributed Heterogeneous Scalable Architecture for Dynamic Storage Environments.” <i>Advanced Information Networking and Applications (AINA-07)</i>, vol. 21, 2007, pp. 331–39, doi:<a href=\"https://doi.org/10.1109/aina.2007.59\">10.1109/aina.2007.59</a>.","bibtex":"@inproceedings{Schomaker_2007, title={DHHT-RAID: A Distributed Heterogeneous Scalable Architecture for Dynamic Storage Environments}, volume={21}, DOI={<a href=\"https://doi.org/10.1109/aina.2007.59\">10.1109/aina.2007.59</a>}, booktitle={Advanced Information Networking and Applications (AINA-07)}, author={Schomaker, Gunnar}, year={2007}, pages={331–339} }","short":"G. Schomaker, in: Advanced Information Networking and Applications (AINA-07), 2007, pp. 331–339.","apa":"Schomaker, G. (2007). DHHT-RAID: A Distributed Heterogeneous Scalable Architecture for Dynamic Storage Environments. In <i>Advanced Information Networking and Applications (AINA-07)</i> (Vol. 21, pp. 331–339). <a href=\"https://doi.org/10.1109/aina.2007.59\">https://doi.org/10.1109/aina.2007.59</a>"},"publication_identifier":{"isbn":["0769528465"],"issn":["1550-445X"]},"publication_status":"published"},{"publication_identifier":{"issn":["0302-9743","1611-3349"]},"publication_status":"published","place":"Berlin, Heidelberg","year":"2007","citation":{"apa":"Bienkowski, M., &#38; Kutyłowski, J. (2007). The k-Resource Problem on Uniform and on Uniformly Decomposable Metric Spaces. <i>Lecture Notes in Computer Science</i>. <a href=\"https://doi.org/10.1007/978-3-540-73951-7_30\">https://doi.org/10.1007/978-3-540-73951-7_30</a>","short":"M. Bienkowski, J. Kutyłowski, in: Lecture Notes in Computer Science, Berlin, Heidelberg, 2007.","bibtex":"@inproceedings{Bienkowski_Kutyłowski_2007, place={Berlin, Heidelberg}, title={The k-Resource Problem on Uniform and on Uniformly Decomposable Metric Spaces}, DOI={<a href=\"https://doi.org/10.1007/978-3-540-73951-7_30\">10.1007/978-3-540-73951-7_30</a>}, booktitle={Lecture Notes in Computer Science}, author={Bienkowski, Marcin and Kutyłowski, Jarosław}, year={2007} }","mla":"Bienkowski, Marcin, and Jarosław Kutyłowski. “The K-Resource Problem on Uniform and on Uniformly Decomposable Metric Spaces.” <i>Lecture Notes in Computer Science</i>, 2007, doi:<a href=\"https://doi.org/10.1007/978-3-540-73951-7_30\">10.1007/978-3-540-73951-7_30</a>.","ama":"Bienkowski M, Kutyłowski J. The k-Resource Problem on Uniform and on Uniformly Decomposable Metric Spaces. In: <i>Lecture Notes in Computer Science</i>. ; 2007. doi:<a href=\"https://doi.org/10.1007/978-3-540-73951-7_30\">10.1007/978-3-540-73951-7_30</a>","ieee":"M. Bienkowski and J. Kutyłowski, “The k-Resource Problem on Uniform and on Uniformly Decomposable Metric Spaces,” 2007, doi: <a href=\"https://doi.org/10.1007/978-3-540-73951-7_30\">10.1007/978-3-540-73951-7_30</a>.","chicago":"Bienkowski, Marcin, and Jarosław Kutyłowski. “The K-Resource Problem on Uniform and on Uniformly Decomposable Metric Spaces.” In <i>Lecture Notes in Computer Science</i>. Berlin, Heidelberg, 2007. <a href=\"https://doi.org/10.1007/978-3-540-73951-7_30\">https://doi.org/10.1007/978-3-540-73951-7_30</a>."},"date_updated":"2022-01-06T06:56:13Z","date_created":"2021-09-13T13:07:57Z","author":[{"first_name":"Marcin","full_name":"Bienkowski, Marcin","last_name":"Bienkowski"},{"last_name":"Kutyłowski","full_name":"Kutyłowski, Jarosław","first_name":"Jarosław"}],"title":"The k-Resource Problem on Uniform and on Uniformly Decomposable Metric Spaces","doi":"10.1007/978-3-540-73951-7_30","publication":"Lecture Notes in Computer Science","type":"conference","abstract":[{"lang":"eng","text":"We define a natural generalization of the prominent k-server problem, the k-resource problem. It occurs in metric spaces with some demands and resources given at its points. The demands may vary with time, but the total demand may never exceed k. The goal of an online algorithm is to satisfy demands by moving resources, while minimizing the cost for transporting resources. We give an asymptotically optimal O(log(min {n,k}))-competitive randomized algorithm and an O(min {k,n})-competitive deterministic one for the k-resource problem on uniform metric spaces consisting of n points. This extends known results for paging to the more general setting of k-resource.\r\nBasing on the results for uniform metric spaces, we develop a randomized algorithm solving the k-resource and the k-server problem on metric spaces which can be decomposed into components far away from each other. The algorithm achieves a competitive ratio of O(log(min {n,k})), provided that it has some extra resources more than the optimal algorithm.\r\n"}],"status":"public","_id":"24276","department":[{"_id":"63"}],"user_id":"15415","language":[{"iso":"eng"}]},{"abstract":[{"lang":"eng","text":"Dieses Buch beschäftigt sich mit Algorithmen und Methoden der Peer-to-Peer-Netzwerke und gibt einen Einblick in die aktuelle Forschung.\r\n\r\nUrsprünglich waren Peer-to-Peer-Netzwerke nur für File-Sharing konzipiert. Mittlerweile hat sich Peer-to-Peer zum Paradigma für Rechnernetzwerke entwickelt. Ziel dieses Buches ist es, dem Leser ein grundlegendes Verständnis der Techniken hinter den aktuellen Peer-to-Peer-Netzwerken aufzuzeigen und im nächsten Schritt Algorithmen vorzustellen, die vielleicht erst in einigen Jahren umgesetzt werden.\r\n\r\nDas Buch richtet sich in erster Linie an Informatiker (Studenten ab dem 5. Semester). Aber auch interessierte Nichtinformatiker können von diesem Buch profitieren, wobei grundlegende Kenntnisse aus den Bereichen der Mathematik und Informatik vorausgesetzt werden. Die Ziele, Kernaussagen und Ergebnisse sollten jedoch auch ohne akademischen Hintergrund klar werden."}],"status":"public","type":"book","language":[{"iso":"eng"}],"_id":"24366","department":[{"_id":"63"}],"user_id":"15415","place":"Berlin","year":"2007","citation":{"ama":"Mahlmann P, Schindelhauer C. <i>Peer-to-Peer-Netzwerke</i>. Springer; 2007. doi:<a href=\"https://doi.org/10.1007/978-3-540-33992-2\">10.1007/978-3-540-33992-2</a>","chicago":"Mahlmann, Peter, and Christian Schindelhauer. <i>Peer-to-Peer-Netzwerke</i>. Berlin: Springer, 2007. <a href=\"https://doi.org/10.1007/978-3-540-33992-2\">https://doi.org/10.1007/978-3-540-33992-2</a>.","ieee":"P. Mahlmann and C. Schindelhauer, <i>Peer-to-Peer-Netzwerke</i>. Berlin: Springer, 2007.","bibtex":"@book{Mahlmann_Schindelhauer_2007, place={Berlin}, title={Peer-to-Peer-Netzwerke}, DOI={<a href=\"https://doi.org/10.1007/978-3-540-33992-2\">10.1007/978-3-540-33992-2</a>}, publisher={Springer}, author={Mahlmann, Peter and Schindelhauer, Christian}, year={2007} }","short":"P. Mahlmann, C. Schindelhauer, Peer-to-Peer-Netzwerke, Springer, Berlin, 2007.","mla":"Mahlmann, Peter, and Christian Schindelhauer. <i>Peer-to-Peer-Netzwerke</i>. Springer, 2007, doi:<a href=\"https://doi.org/10.1007/978-3-540-33992-2\">10.1007/978-3-540-33992-2</a>.","apa":"Mahlmann, P., &#38; Schindelhauer, C. (2007). <i>Peer-to-Peer-Netzwerke</i>. Springer. <a href=\"https://doi.org/10.1007/978-3-540-33992-2\">https://doi.org/10.1007/978-3-540-33992-2</a>"},"publication_identifier":{"isbn":["9783540339915"]},"publication_status":"published","title":"Peer-to-Peer-Netzwerke","doi":"10.1007/978-3-540-33992-2","date_updated":"2022-01-06T06:56:18Z","publisher":"Springer","author":[{"first_name":"Peter","full_name":"Mahlmann, Peter","last_name":"Mahlmann"},{"last_name":"Schindelhauer","full_name":"Schindelhauer, Christian","first_name":"Christian"}],"date_created":"2021-09-14T10:29:29Z"}]