[{"department":[{"_id":"63"},{"_id":"238"}],"user_id":"15415","_id":"20160","language":[{"iso":"eng"}],"publication":"7th IEEE Int. Conf. on Self-Adaptive and Self-Organizing Systems (SASO 2013)","type":"conference","status":"public","date_created":"2020-10-21T13:48:26Z","author":[{"last_name":"Hamann","full_name":"Hamann, Heiko","first_name":"Heiko"}],"publisher":"IEEE Press","date_updated":"2022-01-06T06:54:20Z","doi":"10.1109/SASO.2013.10","title":"A Reductionist Approach to Hypothesis-Catching for the Analysis of Self-Organizing Decision-Making Systems","page":"227-236","citation":{"short":"H. Hamann, in: 7th IEEE Int. Conf. on Self-Adaptive and Self-Organizing Systems (SASO 2013), IEEE Press, 2013, pp. 227–236.","bibtex":"@inproceedings{Hamann_2013, title={A Reductionist Approach to Hypothesis-Catching for the Analysis of Self-Organizing Decision-Making Systems}, DOI={<a href=\"https://doi.org/10.1109/SASO.2013.10\">10.1109/SASO.2013.10</a>}, booktitle={7th IEEE Int. Conf. on Self-Adaptive and Self-Organizing Systems (SASO 2013)}, publisher={IEEE Press}, author={Hamann, Heiko}, year={2013}, pages={227–236} }","mla":"Hamann, Heiko. “A Reductionist Approach to Hypothesis-Catching for the Analysis of Self-Organizing Decision-Making Systems.” <i>7th IEEE Int. Conf. on Self-Adaptive and Self-Organizing Systems (SASO 2013)</i>, IEEE Press, 2013, pp. 227–36, doi:<a href=\"https://doi.org/10.1109/SASO.2013.10\">10.1109/SASO.2013.10</a>.","apa":"Hamann, H. (2013). A Reductionist Approach to Hypothesis-Catching for the Analysis of Self-Organizing Decision-Making Systems. In <i>7th IEEE Int. Conf. on Self-Adaptive and Self-Organizing Systems (SASO 2013)</i> (pp. 227–236). IEEE Press. <a href=\"https://doi.org/10.1109/SASO.2013.10\">https://doi.org/10.1109/SASO.2013.10</a>","ama":"Hamann H. A Reductionist Approach to Hypothesis-Catching for the Analysis of Self-Organizing Decision-Making Systems. In: <i>7th IEEE Int. Conf. on Self-Adaptive and Self-Organizing Systems (SASO 2013)</i>. IEEE Press; 2013:227-236. doi:<a href=\"https://doi.org/10.1109/SASO.2013.10\">10.1109/SASO.2013.10</a>","chicago":"Hamann, Heiko. “A Reductionist Approach to Hypothesis-Catching for the Analysis of Self-Organizing Decision-Making Systems.” In <i>7th IEEE Int. Conf. on Self-Adaptive and Self-Organizing Systems (SASO 2013)</i>, 227–36. IEEE Press, 2013. <a href=\"https://doi.org/10.1109/SASO.2013.10\">https://doi.org/10.1109/SASO.2013.10</a>.","ieee":"H. Hamann, “A Reductionist Approach to Hypothesis-Catching for the Analysis of Self-Organizing Decision-Making Systems,” in <i>7th IEEE Int. Conf. on Self-Adaptive and Self-Organizing Systems (SASO 2013)</i>, 2013, pp. 227–236."},"year":"2013"},{"publication":"12th European Conference on Artificial Life (ECAL 2013)","type":"conference","status":"public","_id":"20161","department":[{"_id":"63"},{"_id":"238"}],"user_id":"15415","language":[{"iso":"eng"}],"year":"2013","citation":{"ama":"Hamann H, Lio P, Miglino O, Nicosia G, Nolfi S, Pavone M. Speciation Dynamics: Generating Selective Pressure Towards Diversity. In: <i>12th European Conference on Artificial Life (ECAL 2013)</i>. MIT Press; 2013.","chicago":"Hamann, Heiko, Pietro Lio, Orazio Miglino, Giuseppe Nicosia, Stefano Nolfi, and Mario Pavone. “Speciation Dynamics: Generating Selective Pressure Towards Diversity.” In <i>12th European Conference on Artificial Life (ECAL 2013)</i>. MIT Press, 2013.","ieee":"H. Hamann, P. Lio, O. Miglino, G. Nicosia, S. Nolfi, and M. Pavone, “Speciation Dynamics: Generating Selective Pressure Towards Diversity,” in <i>12th European Conference on Artificial Life (ECAL 2013)</i>, 2013.","short":"H. Hamann, P. Lio, O. Miglino, G. Nicosia, S. Nolfi, M. Pavone, in: 12th European Conference on Artificial Life (ECAL 2013), MIT Press, 2013.","bibtex":"@inproceedings{Hamann_Lio_Miglino_Nicosia_Nolfi_Pavone_2013, title={Speciation Dynamics: Generating Selective Pressure Towards Diversity}, booktitle={12th European Conference on Artificial Life (ECAL 2013)}, publisher={MIT Press}, author={Hamann, Heiko and Lio, Pietro and Miglino, Orazio and Nicosia, Giuseppe and Nolfi, Stefano and Pavone, Mario}, year={2013} }","mla":"Hamann, Heiko, et al. “Speciation Dynamics: Generating Selective Pressure Towards Diversity.” <i>12th European Conference on Artificial Life (ECAL 2013)</i>, MIT Press, 2013.","apa":"Hamann, H., Lio, P., Miglino, O., Nicosia, G., Nolfi, S., &#38; Pavone, M. (2013). Speciation Dynamics: Generating Selective Pressure Towards Diversity. In <i>12th European Conference on Artificial Life (ECAL 2013)</i>. MIT Press."},"publisher":"MIT Press","date_updated":"2022-01-06T06:54:20Z","date_created":"2020-10-21T13:53:59Z","author":[{"first_name":"Heiko","last_name":"Hamann","full_name":"Hamann, Heiko"},{"first_name":"Pietro","full_name":"Lio, Pietro","last_name":"Lio"},{"last_name":"Miglino","full_name":"Miglino, Orazio","first_name":"Orazio"},{"last_name":"Nicosia","full_name":"Nicosia, Giuseppe","first_name":"Giuseppe"},{"first_name":"Stefano","last_name":"Nolfi","full_name":"Nolfi, Stefano"},{"first_name":"Mario","full_name":"Pavone, Mario","last_name":"Pavone"}],"title":"Speciation Dynamics: Generating Selective Pressure Towards Diversity"},{"publication":"Swarm Intelligence","type":"journal_article","status":"public","department":[{"_id":"63"},{"_id":"238"}],"user_id":"15415","_id":"20162","language":[{"iso":"eng"}],"issue":"3","page":"145-172","intvolume":"         7","citation":{"ama":"Hamann H. Towards Swarm Calculus: Urn Models of Collective Decisions and Universal Properties of Swarm Performance. <i>Swarm Intelligence</i>. 2013;7(3):145-172. doi:<a href=\"https://doi.org/10.1007/s11721-013-0080-0\">10.1007/s11721-013-0080-0</a>","ieee":"H. Hamann, “Towards Swarm Calculus: Urn Models of Collective Decisions and Universal Properties of Swarm Performance,” <i>Swarm Intelligence</i>, vol. 7, no. 3, pp. 145–172, 2013.","chicago":"Hamann, Heiko. “Towards Swarm Calculus: Urn Models of Collective Decisions and Universal Properties of Swarm Performance.” <i>Swarm Intelligence</i> 7, no. 3 (2013): 145–72. <a href=\"https://doi.org/10.1007/s11721-013-0080-0\">https://doi.org/10.1007/s11721-013-0080-0</a>.","apa":"Hamann, H. (2013). Towards Swarm Calculus: Urn Models of Collective Decisions and Universal Properties of Swarm Performance. <i>Swarm Intelligence</i>, <i>7</i>(3), 145–172. <a href=\"https://doi.org/10.1007/s11721-013-0080-0\">https://doi.org/10.1007/s11721-013-0080-0</a>","bibtex":"@article{Hamann_2013, title={Towards Swarm Calculus: Urn Models of Collective Decisions and Universal Properties of Swarm Performance}, volume={7}, DOI={<a href=\"https://doi.org/10.1007/s11721-013-0080-0\">10.1007/s11721-013-0080-0</a>}, number={3}, journal={Swarm Intelligence}, author={Hamann, Heiko}, year={2013}, pages={145–172} }","mla":"Hamann, Heiko. “Towards Swarm Calculus: Urn Models of Collective Decisions and Universal Properties of Swarm Performance.” <i>Swarm Intelligence</i>, vol. 7, no. 3, 2013, pp. 145–72, doi:<a href=\"https://doi.org/10.1007/s11721-013-0080-0\">10.1007/s11721-013-0080-0</a>.","short":"H. Hamann, Swarm Intelligence 7 (2013) 145–172."},"year":"2013","volume":7,"author":[{"last_name":"Hamann","full_name":"Hamann, Heiko","first_name":"Heiko"}],"date_created":"2020-10-21T13:57:36Z","date_updated":"2022-01-06T06:54:20Z","doi":"10.1007/s11721-013-0080-0","title":"Towards Swarm Calculus: Urn Models of Collective Decisions and Universal Properties of Swarm Performance"},{"title":"Darstellung heterogener 3-D-Szenen in Echtzeit","volume":311,"date_created":"2020-07-29T08:55:43Z","author":[{"full_name":"Petring, Ralf","last_name":"Petring","first_name":"Ralf"},{"full_name":"Eikel, Benjamin","last_name":"Eikel","first_name":"Benjamin"},{"first_name":"Claudius","full_name":"Jähn, Claudius","last_name":"Jähn"},{"first_name":"Matthias","full_name":"Fischer, Matthias","id":"146","last_name":"Fischer"},{"id":"15523","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","first_name":"Friedhelm"}],"date_updated":"2022-01-06T06:53:12Z","intvolume":"       311","page":"49--60","citation":{"apa":"Petring, R., Eikel, B., Jähn, C., Fischer, M., &#38; Meyer auf der Heide, F. (2013). Darstellung heterogener 3-D-Szenen in Echtzeit. In <i>11. Paderborner Workshop Augmented &#38; Virtual Reality in der Produktentstehung</i> (Vol. 311, pp. 49--60). Paderborn.","mla":"Petring, Ralf, et al. “Darstellung Heterogener 3-D-Szenen in Echtzeit.” <i>11. Paderborner Workshop Augmented &#38; Virtual Reality in Der Produktentstehung</i>, vol. 311, 2013, pp. 49--60.","short":"R. Petring, B. Eikel, C. Jähn, M. Fischer, F. Meyer auf der Heide, in: 11. Paderborner Workshop Augmented &#38; Virtual Reality in Der Produktentstehung, Paderborn, 2013, pp. 49--60.","bibtex":"@inproceedings{Petring_Eikel_Jähn_Fischer_Meyer auf der Heide_2013, place={Paderborn}, series={Verlagsschriftenreihe des Heinz Nixdorf Instituts}, title={Darstellung heterogener 3-D-Szenen in Echtzeit}, volume={311}, booktitle={11. Paderborner Workshop Augmented &#38; Virtual Reality in der Produktentstehung}, author={Petring, Ralf and Eikel, Benjamin and Jähn, Claudius and Fischer, Matthias and Meyer auf der Heide, Friedhelm}, year={2013}, pages={49--60}, collection={Verlagsschriftenreihe des Heinz Nixdorf Instituts} }","ama":"Petring R, Eikel B, Jähn C, Fischer M, Meyer auf der Heide F. Darstellung heterogener 3-D-Szenen in Echtzeit. In: <i>11. Paderborner Workshop Augmented &#38; Virtual Reality in Der Produktentstehung</i>. Vol 311. Verlagsschriftenreihe des Heinz Nixdorf Instituts. Paderborn; 2013:49--60.","ieee":"R. Petring, B. Eikel, C. Jähn, M. Fischer, and F. Meyer auf der Heide, “Darstellung heterogener 3-D-Szenen in Echtzeit,” in <i>11. Paderborner Workshop Augmented &#38; Virtual Reality in der Produktentstehung</i>, 2013, vol. 311, pp. 49--60.","chicago":"Petring, Ralf, Benjamin Eikel, Claudius Jähn, Matthias Fischer, and Friedhelm Meyer auf der Heide. “Darstellung Heterogener 3-D-Szenen in Echtzeit.” In <i>11. Paderborner Workshop Augmented &#38; Virtual Reality in Der Produktentstehung</i>, 311:49--60. Verlagsschriftenreihe Des Heinz Nixdorf Instituts. Paderborn, 2013."},"year":"2013","place":"Paderborn","language":[{"iso":"eng"}],"department":[{"_id":"63"}],"series_title":"Verlagsschriftenreihe des Heinz Nixdorf Instituts","user_id":"15415","_id":"17439","status":"public","abstract":[{"text":"Viele virtuelle 3-D-Szenen im industriellen Bereich sind nicht gleichmäßig strukturiert, z.B. weil sie eine stark unterschiedliche Dichteverteilung der Polygone aufweisen. Für solch heterogene Daten existiert kein Algorithmus, der die Gesamtheit der Daten sowohl schnell als auch mit guter Qualität darstellen kann. Die Auswahl der richtigen Algorithmen für einzelne Szenenteile durch einen Experten ist zeitintensiv und in vielen Visualisierungssystemen nicht umzusetzen. Um dieses Problem zu lösen, setzt das hier vorgestellte Multi-Algorithmen-Rendering verschiedene Renderingalgorithmen gleichzeitig ein, um eine virtuelle 3-D-Szene darzustellen. Das Verfahren unterteilt die Szene dafür in einem Vorverarbeitungsschritt automatisch in geeignete Teilregionen und bestimmt deren Eigenschaften. Diese Daten werden zur Laufzeit dazu genutzt, um ständig für den aktuellen Standpunkt des Betrachters eine Abschätzung der Qualität und Laufzeit der zur Auswahl stehenden Renderingalgorithmen zu berechnen. Durch die Lösung eines Optimierungsproblems kann so bei vorgegebener Bildrate durch die passende Zuordnung der Algorithmen zu den Regionen die Bildqualität optimiert werden – bei automatischer Anpassung an die Leistungsfähigkeit der eingesetzten Hardware. In einer experimentellen Evaluierung vergleichen wir die Laufzeit und Bildqualität des Verfahrens mit denen verbreiteter Standardrenderingverfahren.","lang":"eng"}],"publication":"11. Paderborner Workshop Augmented & Virtual Reality in der Produktentstehung","type":"conference"},{"language":[{"iso":"eng"}],"_id":"17440","user_id":"15415","department":[{"_id":"63"}],"status":"public","type":"dissertation","title":"Spherical visibility sampling : preprocessed visibility for occlusion culling in complex 3D scenes","date_updated":"2022-01-06T06:53:12Z","date_created":"2020-07-29T09:11:23Z","supervisor":[{"last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","id":"15523","first_name":"Friedhelm"}],"author":[{"first_name":"Benjamin","full_name":"Eikel, Benjamin","last_name":"Eikel"}],"place":"Universität Paderborn","year":"2013","citation":{"ama":"Eikel B. <i>Spherical Visibility Sampling : Preprocessed Visibility for Occlusion Culling in Complex 3D Scenes</i>. Universität Paderborn; 2013.","ieee":"B. Eikel, <i>Spherical visibility sampling : preprocessed visibility for occlusion culling in complex 3D scenes</i>. Universität Paderborn, 2013.","chicago":"Eikel, Benjamin. <i>Spherical Visibility Sampling : Preprocessed Visibility for Occlusion Culling in Complex 3D Scenes</i>. Universität Paderborn, 2013.","mla":"Eikel, Benjamin. <i>Spherical Visibility Sampling : Preprocessed Visibility for Occlusion Culling in Complex 3D Scenes</i>. 2013.","bibtex":"@book{Eikel_2013, place={Universität Paderborn}, title={Spherical visibility sampling : preprocessed visibility for occlusion culling in complex 3D scenes}, author={Eikel, Benjamin}, year={2013} }","short":"B. Eikel, Spherical Visibility Sampling : Preprocessed Visibility for Occlusion Culling in Complex 3D Scenes, Universität Paderborn, 2013.","apa":"Eikel, B. (2013). <i>Spherical visibility sampling : preprocessed visibility for occlusion culling in complex 3D scenes</i>. Universität Paderborn."},"related_material":{"link":[{"url":"http://nbn-resolving.de/urn:nbn:de:hbz:466:2-12683","relation":"confirmation"}]}},{"language":[{"iso":"eng"}],"_id":"17442","department":[{"_id":"63"},{"_id":"26"}],"user_id":"5786","series_title":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","status":"public","publication":"11. Paderborner Workshop Augmented & Virtual Reality in der Produktentstehung","type":"conference","title":"Algorithmische Grundlagen für die Selbstorganisation von Roboterschwärmen","publisher":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","date_updated":"2022-01-06T06:53:12Z","volume":311,"date_created":"2020-07-29T09:44:04Z","author":[{"first_name":"Friedhelm","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","id":"15523"}],"year":"2013","intvolume":"       311","page":"7-16","citation":{"ama":"Meyer auf der Heide F. Algorithmische Grundlagen für die Selbstorganisation von Roboterschwärmen. In: <i>11. Paderborner Workshop Augmented &#38; Virtual Reality in Der Produktentstehung</i>. Vol 311. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn; 2013:7-16.","chicago":"Meyer auf der Heide, Friedhelm. “Algorithmische Grundlagen Für Die Selbstorganisation von Roboterschwärmen.” In <i>11. Paderborner Workshop Augmented &#38; Virtual Reality in Der Produktentstehung</i>, 311:7–16. Verlagsschriftenreihe Des Heinz Nixdorf Instituts, Paderborn. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2013.","ieee":"F. Meyer auf der Heide, “Algorithmische Grundlagen für die Selbstorganisation von Roboterschwärmen,” in <i>11. Paderborner Workshop Augmented &#38; Virtual Reality in der Produktentstehung</i>, 2013, vol. 311, pp. 7–16.","apa":"Meyer auf der Heide, F. (2013). Algorithmische Grundlagen für die Selbstorganisation von Roboterschwärmen. <i>11. Paderborner Workshop Augmented &#38; Virtual Reality in Der Produktentstehung</i>, <i>311</i>, 7–16.","short":"F. Meyer auf der Heide, in: 11. Paderborner Workshop Augmented &#38; Virtual Reality in Der Produktentstehung, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2013, pp. 7–16.","bibtex":"@inproceedings{Meyer auf der Heide_2013, series={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, title={Algorithmische Grundlagen für die Selbstorganisation von Roboterschwärmen}, volume={311}, booktitle={11. Paderborner Workshop Augmented &#38; Virtual Reality in der Produktentstehung}, publisher={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, author={Meyer auf der Heide, Friedhelm}, year={2013}, pages={7–16}, collection={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn} }","mla":"Meyer auf der Heide, Friedhelm. “Algorithmische Grundlagen Für Die Selbstorganisation von Roboterschwärmen.” <i>11. Paderborner Workshop Augmented &#38; Virtual Reality in Der Produktentstehung</i>, vol. 311, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2013, pp. 7–16."}},{"title":"11. Paderborner Workshop Augmented & Virtual Reality in der Produktentstehung","volume":311,"date_created":"2020-07-29T09:52:31Z","date_updated":"2022-01-06T06:53:12Z","publisher":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","intvolume":"       311","citation":{"short":"J. Gausemeier, M. Grafe, F. Meyer auf der Heide, eds., 11. Paderborner Workshop Augmented &#38; Virtual Reality in Der Produktentstehung, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2013.","mla":"Gausemeier, Jürgen, et al., editors. <i>11. Paderborner Workshop Augmented &#38; Virtual Reality in Der Produktentstehung</i>. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2013.","bibtex":"@book{Gausemeier_Grafe_Meyer auf der Heide_2013, series={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, title={11. Paderborner Workshop Augmented &#38; Virtual Reality in der Produktentstehung}, volume={311}, publisher={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, year={2013}, collection={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn} }","apa":"Gausemeier, J., Grafe, M., &#38; Meyer auf der Heide, F. (Eds.). (2013). <i>11. Paderborner Workshop Augmented &#38; Virtual Reality in der Produktentstehung</i> (Vol. 311). Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn.","ieee":"J. Gausemeier, M. Grafe, and F. Meyer auf der Heide, Eds., <i>11. Paderborner Workshop Augmented &#38; Virtual Reality in der Produktentstehung</i>, vol. 311. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2013.","chicago":"Gausemeier, Jürgen, Michael Grafe, and Friedhelm Meyer auf der Heide, eds. <i>11. Paderborner Workshop Augmented &#38; Virtual Reality in Der Produktentstehung</i>. Vol. 311. Verlagsschriftenreihe Des Heinz Nixdorf Instituts, Paderborn. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2013.","ama":"Gausemeier J, Grafe M, Meyer auf der Heide F, eds. <i>11. Paderborner Workshop Augmented &#38; Virtual Reality in Der Produktentstehung</i>. Vol 311. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn; 2013."},"year":"2013","language":[{"iso":"eng"}],"department":[{"_id":"63"},{"_id":"26"}],"series_title":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","user_id":"5786","_id":"17443","status":"public","editor":[{"first_name":"Jürgen","last_name":"Gausemeier","full_name":"Gausemeier, Jürgen"},{"first_name":"Michael","last_name":"Grafe","full_name":"Grafe, Michael"},{"full_name":"Meyer auf der Heide, Friedhelm","id":"15523","last_name":"Meyer auf der Heide","first_name":"Friedhelm"}],"type":"conference_editor"},{"abstract":[{"text":"In this paper, we define and study a new problem, referred to as the Dependent Unsplittable Flow Problem (D-UFP). We present and discuss this problem in the context of large-scale powerful (radar/camera) sensor networks, but we believe it has important applications on the admission of large flows in other networks as well. In order to optimize the selection of flows transmitted to the gateway, D-UFP takes into account possible dependencies between flows. We show that D-UFP is more difficult than NP-hard problems for which no good approximation is known. Then, we address two special cases of this problem: the case where all the sensors have a shared channel and the case where the sensors form a mesh and route to the gateway over a spanning tree.","lang":"eng"}],"status":"public","type":"journal_article","publication":"Networking, IEEE/ACM Transactions on","keyword":["Approximation algorithms","Approximation methods","Bandwidth","Logic gates","Radar","Vectors","Wireless sensor networks","Dependent flow scheduling","sensor networks"],"extern":"1","language":[{"iso":"eng"}],"_id":"17663","user_id":"83983","department":[{"_id":"63"},{"_id":"541"}],"year":"2013","citation":{"ama":"Cohen R, Nudelman I, Polevoy G. On the Admission of Dependent Flows in Powerful Sensor Networks. <i>Networking, IEEE/ACM Transactions on</i>. 2013;21(5):1461-1471. doi:<a href=\"https://doi.org/10.1109/TNET.2012.2227792\">10.1109/TNET.2012.2227792</a>","ieee":"R. Cohen, I. Nudelman, and G. Polevoy, “On the Admission of Dependent Flows in Powerful Sensor Networks,” <i>Networking, IEEE/ACM Transactions on</i>, vol. 21, no. 5, pp. 1461–1471, 2013.","chicago":"Cohen, R., I. Nudelman, and Gleb Polevoy. “On the Admission of Dependent Flows in Powerful Sensor Networks.” <i>Networking, IEEE/ACM Transactions On</i> 21, no. 5 (2013): 1461–71. <a href=\"https://doi.org/10.1109/TNET.2012.2227792\">https://doi.org/10.1109/TNET.2012.2227792</a>.","mla":"Cohen, R., et al. “On the Admission of Dependent Flows in Powerful Sensor Networks.” <i>Networking, IEEE/ACM Transactions On</i>, vol. 21, no. 5, 2013, pp. 1461–71, doi:<a href=\"https://doi.org/10.1109/TNET.2012.2227792\">10.1109/TNET.2012.2227792</a>.","bibtex":"@article{Cohen_Nudelman_Polevoy_2013, title={On the Admission of Dependent Flows in Powerful Sensor Networks}, volume={21}, DOI={<a href=\"https://doi.org/10.1109/TNET.2012.2227792\">10.1109/TNET.2012.2227792</a>}, number={5}, journal={Networking, IEEE/ACM Transactions on}, author={Cohen, R. and Nudelman, I. and Polevoy, Gleb}, year={2013}, pages={1461–1471} }","short":"R. Cohen, I. Nudelman, G. Polevoy, Networking, IEEE/ACM Transactions On 21 (2013) 1461–1471.","apa":"Cohen, R., Nudelman, I., &#38; Polevoy, G. (2013). On the Admission of Dependent Flows in Powerful Sensor Networks. <i>Networking, IEEE/ACM Transactions On</i>, <i>21</i>(5), 1461–1471. <a href=\"https://doi.org/10.1109/TNET.2012.2227792\">https://doi.org/10.1109/TNET.2012.2227792</a>"},"intvolume":"        21","page":"1461-1471","publication_identifier":{"issn":["1063-6692"]},"issue":"5","title":"On the Admission of Dependent Flows in Powerful Sensor Networks","doi":"10.1109/TNET.2012.2227792","date_updated":"2022-01-06T06:53:16Z","date_created":"2020-08-06T15:22:05Z","author":[{"first_name":"R.","last_name":"Cohen","full_name":"Cohen, R."},{"full_name":"Nudelman, I.","last_name":"Nudelman","first_name":"I."},{"last_name":"Polevoy","full_name":"Polevoy, Gleb","id":"83983","first_name":"Gleb"}],"volume":21},{"ddc":["040"],"file_date_updated":"2018-03-15T14:06:38Z","_id":"477","project":[{"_id":"1","name":"SFB 901"},{"_id":"5","name":"SFB 901 - Subprojekt A1"},{"name":"SFB 901 - Project Area A","_id":"2"}],"department":[{"_id":"63"}],"series_title":"Lecture Notes in Computer Science","user_id":"15504","abstract":[{"lang":"eng","text":"We consider the k-token dissemination problem, where k initially arbitrarily distributed tokens have to be disseminated to all nodes in a dynamic network (as introduced by Kuhn et al., STOC 2010). In contrast to general dynamic networks, our dynamic networks are unit disk graphs, i.e., nodes are embedded into the Euclidean plane and two nodes are connected if and only if their distance is at most R. Our worst-case adversary is allowed to move the nodes on the plane, but the maximum velocity v_max of each node is limited and the graph must be connected in each round. For this model, we provide almost tight lower and upper bounds for k-token dissemination if nodes are restricted to send only one token per round. It turns out that the maximum velocity v_max is a meaningful parameter to characterize dynamics in our model."}],"status":"public","file":[{"content_type":"application/pdf","relation":"main_file","success":1,"date_created":"2018-03-15T14:06:38Z","creator":"florida","date_updated":"2018-03-15T14:06:38Z","access_level":"closed","file_id":"1325","file_name":"477-geometric-dynamic-networks_01.pdf","file_size":193169}],"publication":"Algorithms for Sensor Systems - 9th International Symposium on Algorithms and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics, {ALGOSENSORS} 2013, Sophia Antipolis, France, September 5-6, 2013, Revised Selected Papers","type":"conference","title":"Token Dissemination in Geometric Dynamic Networks","doi":"10.1007/978-3-642-45346-5_3","date_updated":"2022-01-06T07:01:21Z","author":[{"first_name":"Sebastian","last_name":"Abshoff","full_name":"Abshoff, Sebastian"},{"first_name":"Markus","last_name":"Benter","full_name":"Benter, Markus"},{"full_name":"Cord-Landwehr, Andreas","last_name":"Cord-Landwehr","first_name":"Andreas"},{"full_name":"Malatyali, Manuel","last_name":"Malatyali","first_name":"Manuel"},{"id":"15523","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","first_name":"Friedhelm"}],"date_created":"2017-10-17T12:42:25Z","year":"2013","page":"22-34","citation":{"apa":"Abshoff, S., Benter, M., Cord-Landwehr, A., Malatyali, M., &#38; Meyer auf der Heide, F. (2013). Token Dissemination in Geometric Dynamic Networks. In <i>Algorithms for Sensor Systems - 9th International Symposium on Algorithms and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics, {ALGOSENSORS} 2013, Sophia Antipolis, France, September 5-6, 2013, Revised Selected Papers</i> (pp. 22–34). <a href=\"https://doi.org/10.1007/978-3-642-45346-5_3\">https://doi.org/10.1007/978-3-642-45346-5_3</a>","bibtex":"@inproceedings{Abshoff_Benter_Cord-Landwehr_Malatyali_Meyer auf der Heide_2013, series={Lecture Notes in Computer Science}, title={Token Dissemination in Geometric Dynamic Networks}, DOI={<a href=\"https://doi.org/10.1007/978-3-642-45346-5_3\">10.1007/978-3-642-45346-5_3</a>}, booktitle={Algorithms for Sensor Systems - 9th International Symposium on Algorithms and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics, {ALGOSENSORS} 2013, Sophia Antipolis, France, September 5-6, 2013, Revised Selected Papers}, author={Abshoff, Sebastian and Benter, Markus and Cord-Landwehr, Andreas and Malatyali, Manuel and Meyer auf der Heide, Friedhelm}, year={2013}, pages={22–34}, collection={Lecture Notes in Computer Science} }","mla":"Abshoff, Sebastian, et al. “Token Dissemination in Geometric Dynamic Networks.” <i>Algorithms for Sensor Systems - 9th International Symposium on Algorithms and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics, {ALGOSENSORS} 2013, Sophia Antipolis, France, September 5-6, 2013, Revised Selected Papers</i>, 2013, pp. 22–34, doi:<a href=\"https://doi.org/10.1007/978-3-642-45346-5_3\">10.1007/978-3-642-45346-5_3</a>.","short":"S. Abshoff, M. Benter, A. Cord-Landwehr, M. Malatyali, F. Meyer auf der Heide, in: Algorithms for Sensor Systems - 9th International Symposium on Algorithms and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics, {ALGOSENSORS} 2013, Sophia Antipolis, France, September 5-6, 2013, Revised Selected Papers, 2013, pp. 22–34.","chicago":"Abshoff, Sebastian, Markus Benter, Andreas Cord-Landwehr, Manuel Malatyali, and Friedhelm Meyer auf der Heide. “Token Dissemination in Geometric Dynamic Networks.” In <i>Algorithms for Sensor Systems - 9th International Symposium on Algorithms and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics, {ALGOSENSORS} 2013, Sophia Antipolis, France, September 5-6, 2013, Revised Selected Papers</i>, 22–34. Lecture Notes in Computer Science, 2013. <a href=\"https://doi.org/10.1007/978-3-642-45346-5_3\">https://doi.org/10.1007/978-3-642-45346-5_3</a>.","ieee":"S. Abshoff, M. Benter, A. Cord-Landwehr, M. Malatyali, and F. Meyer auf der Heide, “Token Dissemination in Geometric Dynamic Networks,” in <i>Algorithms for Sensor Systems - 9th International Symposium on Algorithms and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics, {ALGOSENSORS} 2013, Sophia Antipolis, France, September 5-6, 2013, Revised Selected Papers</i>, 2013, pp. 22–34.","ama":"Abshoff S, Benter M, Cord-Landwehr A, Malatyali M, Meyer auf der Heide F. Token Dissemination in Geometric Dynamic Networks. In: <i>Algorithms for Sensor Systems - 9th International Symposium on Algorithms and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics, {ALGOSENSORS} 2013, Sophia Antipolis, France, September 5-6, 2013, Revised Selected Papers</i>. Lecture Notes in Computer Science. ; 2013:22-34. doi:<a href=\"https://doi.org/10.1007/978-3-642-45346-5_3\">10.1007/978-3-642-45346-5_3</a>"},"has_accepted_license":"1"},{"ddc":["040"],"language":[{"iso":"eng"}],"file_date_updated":"2018-03-15T13:40:02Z","_id":"499","project":[{"name":"SFB 901","_id":"1"},{"_id":"16","name":"SFB 901 - Subproject C4"},{"_id":"14","name":"SFB 901 - Subproject C2"},{"_id":"4","name":"SFB 901 - Project Area C"}],"department":[{"_id":"63"}],"user_id":"477","abstract":[{"lang":"eng","text":"We present a new online algorithm for profit-oriented scheduling on multiple speed-scalable processors.Moreover, we provide a tight analysis of the algorithm's competitiveness.Our results generalize and improve upon work by \\citet{Chan:2010}, which considers a single speed-scalable processor.Using significantly different techniques, we can not only extend their model to multiprocessors but also prove an enhanced and tight competitive ratio for our algorithm.In our scheduling problem, jobs arrive over time and are preemptable.They have different workloads, values, and deadlines.The scheduler may decide not to finish a job but instead to suffer a loss equaling the job's value.However, to process a job's workload until its deadline the scheduler must invest a certain amount of energy.The cost of a schedule is the sum of lost values and invested energy.In order to finish a job the scheduler has to determine which processors to use and set their speeds accordingly.A processor's energy consumption is power $\\Power{s}$ integrated over time, where $\\Power{s}=s^{\\alpha}$ is the power consumption when running at speed $s$.Since we consider the online variant of the problem, the scheduler has no knowledge about future jobs.This problem was introduced by~\\citet{Chan:2010} for the case of a single processor.They presented an online algorithm which is $\\alpha^{\\alpha}+2e\\alpha$-competitive.We provide an online algorithm for the case of multiple processors with an improved competitive ratio of $\\alpha^{\\alpha}$."}],"status":"public","file":[{"file_name":"499-P._Kling__P._Pietryzk_-_Profitable_Scheduling_on_Multiple_Speed-scalable_Processors__2013_.pdf","access_level":"closed","file_id":"1310","file_size":558661,"date_created":"2018-03-15T13:40:02Z","creator":"florida","date_updated":"2018-03-15T13:40:02Z","relation":"main_file","success":1,"content_type":"application/pdf"}],"publication":"Proceedings of the 25th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)","type":"conference","title":"Profitable Scheduling on Multiple Speed-Scalable Processors","doi":"10.1145/2486159.2486183","date_updated":"2022-01-06T07:01:34Z","author":[{"last_name":"Kling","full_name":"Kling, Peter","first_name":"Peter"},{"last_name":"Pietrzyk","full_name":"Pietrzyk, Peter","first_name":"Peter"}],"date_created":"2017-10-17T12:42:29Z","year":"2013","page":"251-260 ","citation":{"ama":"Kling P, Pietrzyk P. Profitable Scheduling on Multiple Speed-Scalable Processors. In: <i>Proceedings of the 25th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)</i>. ; 2013:251-260. doi:<a href=\"https://doi.org/10.1145/2486159.2486183\">10.1145/2486159.2486183</a>","ieee":"P. Kling and P. Pietrzyk, “Profitable Scheduling on Multiple Speed-Scalable Processors,” in <i>Proceedings of the 25th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)</i>, 2013, pp. 251–260.","chicago":"Kling, Peter, and Peter Pietrzyk. “Profitable Scheduling on Multiple Speed-Scalable Processors.” In <i>Proceedings of the 25th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)</i>, 251–60, 2013. <a href=\"https://doi.org/10.1145/2486159.2486183\">https://doi.org/10.1145/2486159.2486183</a>.","mla":"Kling, Peter, and Peter Pietrzyk. “Profitable Scheduling on Multiple Speed-Scalable Processors.” <i>Proceedings of the 25th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)</i>, 2013, pp. 251–60, doi:<a href=\"https://doi.org/10.1145/2486159.2486183\">10.1145/2486159.2486183</a>.","short":"P. Kling, P. Pietrzyk, in: Proceedings of the 25th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 2013, pp. 251–260.","bibtex":"@inproceedings{Kling_Pietrzyk_2013, title={Profitable Scheduling on Multiple Speed-Scalable Processors}, DOI={<a href=\"https://doi.org/10.1145/2486159.2486183\">10.1145/2486159.2486183</a>}, booktitle={Proceedings of the 25th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)}, author={Kling, Peter and Pietrzyk, Peter}, year={2013}, pages={251–260} }","apa":"Kling, P., &#38; Pietrzyk, P. (2013). Profitable Scheduling on Multiple Speed-Scalable Processors. In <i>Proceedings of the 25th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)</i> (pp. 251–260). <a href=\"https://doi.org/10.1145/2486159.2486183\">https://doi.org/10.1145/2486159.2486183</a>"},"has_accepted_license":"1"},{"ddc":["040"],"file_date_updated":"2018-03-15T10:47:31Z","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt A1","_id":"5"},{"_id":"2","name":"SFB 901 - Project Area A"}],"_id":"507","series_title":"LNCS","user_id":"15504","department":[{"_id":"63"}],"abstract":[{"lang":"eng","text":"We study two-party communication in the context of directed dynamic networks that are controlled by an adaptive adversary. This adversary is able to change all edges as long as the networks stay strongly-connected in each round. In this work, we establish a relation between counting the total number of nodes in the network and the problem of exchanging tokens between two communication partners which communicate through a dynamic network. We show that the communication problem for a constant fraction of n tokens in a dynamic network with n nodes is at most as hard as counting the number of nodes in a dynamic network with at most 4n+3 nodes. For the proof, we construct a family of directed dynamic networks and apply a lower bound from two-party communication complexity."}],"file":[{"date_updated":"2018-03-15T10:47:31Z","creator":"florida","date_created":"2018-03-15T10:47:31Z","file_size":181398,"access_level":"closed","file_name":"507-on-two-party-communication-through-dynamic-networks_01.pdf","file_id":"1305","content_type":"application/pdf","success":1,"relation":"main_file"}],"status":"public","type":"conference","publication":"Proceedings of the 17th International Conference on Principles of Distributed Systems (OPODIS)","title":"On Two-Party Communication Through Dynamic Networks","doi":"10.1007/978-3-319-03850-6_2","date_updated":"2022-01-06T07:01:36Z","author":[{"first_name":"Sebastian","full_name":"Abshoff, Sebastian","last_name":"Abshoff"},{"first_name":"Markus","last_name":"Benter","full_name":"Benter, Markus"},{"first_name":"Manuel","last_name":"Malatyali","full_name":"Malatyali, Manuel"},{"full_name":"Meyer auf der Heide, Friedhelm","id":"15523","last_name":"Meyer auf der Heide","first_name":"Friedhelm"}],"date_created":"2017-10-17T12:42:31Z","year":"2013","citation":{"mla":"Abshoff, Sebastian, et al. “On Two-Party Communication Through Dynamic Networks.” <i>Proceedings of the 17th International Conference on Principles of Distributed Systems (OPODIS)</i>, 2013, pp. 11–22, doi:<a href=\"https://doi.org/10.1007/978-3-319-03850-6_2\">10.1007/978-3-319-03850-6_2</a>.","bibtex":"@inproceedings{Abshoff_Benter_Malatyali_Meyer auf der Heide_2013, series={LNCS}, title={On Two-Party Communication Through Dynamic Networks}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-03850-6_2\">10.1007/978-3-319-03850-6_2</a>}, booktitle={Proceedings of the 17th International Conference on Principles of Distributed Systems (OPODIS)}, author={Abshoff, Sebastian and Benter, Markus and Malatyali, Manuel and Meyer auf der Heide, Friedhelm}, year={2013}, pages={11–22}, collection={LNCS} }","short":"S. Abshoff, M. Benter, M. Malatyali, F. Meyer auf der Heide, in: Proceedings of the 17th International Conference on Principles of Distributed Systems (OPODIS), 2013, pp. 11–22.","apa":"Abshoff, S., Benter, M., Malatyali, M., &#38; Meyer auf der Heide, F. (2013). On Two-Party Communication Through Dynamic Networks. In <i>Proceedings of the 17th International Conference on Principles of Distributed Systems (OPODIS)</i> (pp. 11–22). <a href=\"https://doi.org/10.1007/978-3-319-03850-6_2\">https://doi.org/10.1007/978-3-319-03850-6_2</a>","ama":"Abshoff S, Benter M, Malatyali M, Meyer auf der Heide F. On Two-Party Communication Through Dynamic Networks. In: <i>Proceedings of the 17th International Conference on Principles of Distributed Systems (OPODIS)</i>. LNCS. ; 2013:11-22. doi:<a href=\"https://doi.org/10.1007/978-3-319-03850-6_2\">10.1007/978-3-319-03850-6_2</a>","ieee":"S. Abshoff, M. Benter, M. Malatyali, and F. Meyer auf der Heide, “On Two-Party Communication Through Dynamic Networks,” in <i>Proceedings of the 17th International Conference on Principles of Distributed Systems (OPODIS)</i>, 2013, pp. 11–22.","chicago":"Abshoff, Sebastian, Markus Benter, Manuel Malatyali, and Friedhelm Meyer auf der Heide. “On Two-Party Communication Through Dynamic Networks.” In <i>Proceedings of the 17th International Conference on Principles of Distributed Systems (OPODIS)</i>, 11–22. LNCS, 2013. <a href=\"https://doi.org/10.1007/978-3-319-03850-6_2\">https://doi.org/10.1007/978-3-319-03850-6_2</a>."},"page":"11-22","has_accepted_license":"1"},{"ddc":["040"],"file_date_updated":"2018-03-15T10:44:13Z","_id":"514","project":[{"_id":"1","name":"SFB 901"},{"_id":"5","name":"SFB 901 - Subprojekt A1"},{"name":"SFB 901 - Project Area A","_id":"2"}],"department":[{"_id":"63"}],"user_id":"477","abstract":[{"lang":"eng","text":"Diese Arbeit besch{\\\"a}ftigt sich mit dem Facility Location Problem. Dies ist ein Optimierungsproblem, bei dem festgelegt werden muss an welchen Positionen Ressourcen zur Verf{\\\"u}gung gestellt werden, so dass diese von Nutzern gut erreicht werden k{\\\"o}nnen. Es sollen dabei Kosten minimiert werden, die zum einen durch Bereitstellung von Ressourcen und zum anderen durch Verbindungskosten zwischen Nutzern und Ressourcen entstehen. Die Schwierigkeit des Problems liegt darin, dass man einerseits m{\\\"o}glichst wenige Ressourcen zur Verf{\\\"u}gung stellen m{\\\"o}chte, andererseits daf{\\\"u}r sorgen muss, dass sich Nutzer nicht all zu weit weg von Ressourcen befinden. Dies w{\\\"u}rde n{\\\"a}mlich hohe Verbindungskosten nach sich ziehen. Das Facility Location Problem wurde bereits sehr intensiv in vielen unterschiedlichen Varianten untersucht. In dieser Arbeit werden drei Varianten des Problems modelliert und neue Algorithmen f{\\\"u}r sie entwickelt und bez{\\\"u}glich ihres Approximationsfaktors und ihrer Laufzeit analysiert. Jede dieser drei untersuchten Varianten hat einen besonderen Schwerpunkt. Bei der ersten Varianten handelt es sich um ein Online Problem, da hier die Eingabe nicht von Anfang an bekannt ist, sondern Schritt f{\\\"u}r Schritt enth{\\\"u}llt wird. Die Schwierigkeit hierbei besteht darin unwiderrufliche Entscheidungen treffen zu m{\\\"u}ssen ohne dabei die Zukunft zu kennen und trotzdem eine zu jeder Zeit gute L{\\\"o}sung angeben zu k{\\\"o}nnen. Der Schwerpunkt der zweiten Variante liegt auf Lokalit{\\\"a}t, die z.B. in Sensornetzwerken von großer Bedeutung ist. Hier soll eine L{\\\"o}sung verteilt und nur mit Hilfe von lokalen Information berechnet werden. Schließlich besch{\\\"a}ftigt sich die dritte Variante mit einer verteilten Berechnung, bei welcher nur eine stark beschr{\\\"a}nkte Datenmenge verschickt werden darf und dabei trotzdem ein sehr guter Approximationsfaktor erreicht werden muss. Die bei der Analyse der Approximationsfaktoren bzw. der Kompetitivit{\\\"a}t verwendeten Techniken basieren zum großen Teil auf Absch{\\\"a}tzung der primalen L{\\\"o}sung mit Hilfe einer L{\\\"o}sung des zugeh{\\\"o}rigen dualen Problems. F{\\\"u}r die Modellierung von Lokalit{\\\"a}t wird das weitverbreitete LOCAL Modell verwendet. In diesem Modell werden f{\\\"u}r die Algorithmen subpolynomielle obere Laufzeitschranken gezeigt."}],"status":"public","file":[{"success":1,"relation":"main_file","content_type":"application/pdf","file_size":790821,"access_level":"closed","file_id":"1302","file_name":"514-DissertationPietrzyk.pdf","date_updated":"2018-03-15T10:44:13Z","date_created":"2018-03-15T10:44:13Z","creator":"florida"}],"type":"dissertation","title":"Local and Online Algorithms for Facility Location","publisher":"Universität Paderborn","date_updated":"2022-01-06T07:01:38Z","supervisor":[{"last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","id":"15523","first_name":"Friedhelm"}],"author":[{"full_name":"Pietrzyk, Peter","last_name":"Pietrzyk","first_name":"Peter"}],"date_created":"2017-10-17T12:42:32Z","year":"2013","citation":{"mla":"Pietrzyk, Peter. <i>Local and Online Algorithms for Facility Location</i>. Universität Paderborn, 2013.","short":"P. Pietrzyk, Local and Online Algorithms for Facility Location, Universität Paderborn, 2013.","bibtex":"@book{Pietrzyk_2013, title={Local and Online Algorithms for Facility Location}, publisher={Universität Paderborn}, author={Pietrzyk, Peter}, year={2013} }","apa":"Pietrzyk, P. (2013). <i>Local and Online Algorithms for Facility Location</i>. Universität Paderborn.","ama":"Pietrzyk P. <i>Local and Online Algorithms for Facility Location</i>. Universität Paderborn; 2013.","chicago":"Pietrzyk, Peter. <i>Local and Online Algorithms for Facility Location</i>. Universität Paderborn, 2013.","ieee":"P. Pietrzyk, <i>Local and Online Algorithms for Facility Location</i>. Universität Paderborn, 2013."},"has_accepted_license":"1"},{"ddc":["040"],"language":[{"iso":"eng"}],"external_id":{"arxiv":["1311.7229"]},"abstract":[{"text":"We study the complexity theory for the local distributed setting introduced by Korman, Peleg and Fraigniaud. They have defined three complexity classes LD (Local Decision), NLD (Nondeterministic Local Decision) and NLD^#n. The class LD consists of all languages which can be decided with a constant number of communication rounds. The class NLD consists of all languages which can be verified by a nondeterministic algorithm with a constant number of communication rounds. In order to define the nondeterministic classes, they have transferred the notation of nondeterminism into the distributed setting by the use of certificates and verifiers. The class NLD^#n consists of all languages which can be verified by a nondeterministic algorithm where each node has access to an oracle for the number of nodes. They have shown the hierarchy LD subset NLD subset NLD^#n. Our main contributions are strict hierarchies within the classes defined by Korman, Peleg and Fraigniaud. We define additional complexity classes: the class LD(t) consists of all languages which can be decided with at most t communication rounds. The class NLD-O(f) consists of all languages which can be verified by a local verifier such that the size of the certificates that are needed to verify the language are bounded by a function from O(f). Our main results are refined strict hierarchies within these nondeterministic classes.","lang":"eng"}],"file":[{"file_name":"524-paper_01.pdf","access_level":"closed","file_id":"1296","file_size":534906,"date_created":"2018-03-15T10:37:07Z","creator":"florida","date_updated":"2018-03-15T10:37:07Z","relation":"main_file","success":1,"content_type":"application/pdf"}],"title":"Hierarchies in Local Distributed Decision","publisher":"arXiv","date_created":"2017-10-17T12:42:34Z","year":"2013","file_date_updated":"2018-03-15T10:37:07Z","_id":"524","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt A1","_id":"5"},{"_id":"2","name":"SFB 901 - Project Area A"}],"department":[{"_id":"63"}],"user_id":"15415","status":"public","type":"preprint","date_updated":"2022-01-06T07:01:48Z","author":[{"first_name":"Friedhelm","id":"15523","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide"},{"first_name":"Kamil","last_name":"Swirkot","full_name":"Swirkot, Kamil"}],"citation":{"apa":"Meyer auf der Heide, F., &#38; Swirkot, K. (2013). Hierarchies in Local Distributed Decision. arXiv.","mla":"Meyer auf der Heide, Friedhelm, and Kamil Swirkot. <i>Hierarchies in Local Distributed Decision</i>. arXiv, 2013.","bibtex":"@article{Meyer auf der Heide_Swirkot_2013, title={Hierarchies in Local Distributed Decision}, publisher={arXiv}, author={Meyer auf der Heide, Friedhelm and Swirkot, Kamil}, year={2013} }","short":"F. Meyer auf der Heide, K. Swirkot, (2013).","ama":"Meyer auf der Heide F, Swirkot K. Hierarchies in Local Distributed Decision. 2013.","chicago":"Meyer auf der Heide, Friedhelm, and Kamil Swirkot. “Hierarchies in Local Distributed Decision.” arXiv, 2013.","ieee":"F. Meyer auf der Heide and K. Swirkot, “Hierarchies in Local Distributed Decision.” arXiv, 2013."},"has_accepted_license":"1"},{"language":[{"iso":"eng"}],"ddc":["000"],"file":[{"date_updated":"2018-11-02T16:29:07Z","creator":"ups","date_created":"2018-11-02T16:29:07Z","file_size":9186107,"access_level":"closed","file_id":"5327","file_name":"2014_Book_AlgorithmsForSensorSystems-1.pdf","content_type":"application/pdf","success":1,"relation":"main_file"}],"date_created":"2017-10-17T12:42:41Z","publisher":"Springer","title":"Algorithms for Sensor Systems - 9th International Symposium on Algorithms and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics","year":"2013","user_id":"477","series_title":"LNCS","department":[{"_id":"63"}],"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt A1","_id":"5"},{"_id":"2","name":"SFB 901 - Project Area A"}],"_id":"558","file_date_updated":"2018-11-02T16:29:07Z","type":"conference_editor","status":"public","editor":[{"last_name":"Flocchini","full_name":"Flocchini, Paola","first_name":"Paola"},{"full_name":"Gao, Jie","last_name":"Gao","first_name":"Jie"},{"last_name":"Kranakis","full_name":"Kranakis, Evangelos","first_name":"Evangelos"},{"first_name":"Friedhelm","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","id":"15523"}],"volume":8243,"date_updated":"2022-01-06T07:02:02Z","doi":"10.1007/978-3-642-45346-5","conference":{"name":"ALGOSENSORS 2013","start_date":"2013-09-05","end_date":"2013-09-06","location":"Sophia Antipolis, France"},"has_accepted_license":"1","citation":{"apa":"Flocchini, P., Gao, J., Kranakis, E., &#38; Meyer auf der Heide, F. (Eds.). (2013). <i>Algorithms for Sensor Systems - 9th International Symposium on Algorithms and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics</i> (Vol. 8243). Presented at the ALGOSENSORS 2013, Sophia Antipolis, France: Springer. <a href=\"https://doi.org/10.1007/978-3-642-45346-5\">https://doi.org/10.1007/978-3-642-45346-5</a>","bibtex":"@book{Flocchini_Gao_Kranakis_Meyer auf der Heide_2013, series={LNCS}, title={Algorithms for Sensor Systems - 9th International Symposium on Algorithms and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics}, volume={8243}, DOI={<a href=\"https://doi.org/10.1007/978-3-642-45346-5\">10.1007/978-3-642-45346-5</a>}, publisher={Springer}, year={2013}, collection={LNCS} }","mla":"Flocchini, Paola, et al., editors. <i>Algorithms for Sensor Systems - 9th International Symposium on Algorithms and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics</i>. Vol. 8243, Springer, 2013, doi:<a href=\"https://doi.org/10.1007/978-3-642-45346-5\">10.1007/978-3-642-45346-5</a>.","short":"P. Flocchini, J. Gao, E. Kranakis, F. Meyer auf der Heide, eds., Algorithms for Sensor Systems - 9th International Symposium on Algorithms and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics, Springer, 2013.","ama":"Flocchini P, Gao J, Kranakis E, Meyer auf der Heide F, eds. <i>Algorithms for Sensor Systems - 9th International Symposium on Algorithms and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics</i>. Vol 8243. Springer; 2013. doi:<a href=\"https://doi.org/10.1007/978-3-642-45346-5\">10.1007/978-3-642-45346-5</a>","ieee":"P. Flocchini, J. Gao, E. Kranakis, and F. Meyer auf der Heide, Eds., <i>Algorithms for Sensor Systems - 9th International Symposium on Algorithms and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics</i>, vol. 8243. Springer, 2013.","chicago":"Flocchini, Paola, Jie Gao, Evangelos Kranakis, and Friedhelm Meyer auf der Heide, eds. <i>Algorithms for Sensor Systems - 9th International Symposium on Algorithms and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics</i>. Vol. 8243. LNCS. Springer, 2013. <a href=\"https://doi.org/10.1007/978-3-642-45346-5\">https://doi.org/10.1007/978-3-642-45346-5</a>."},"intvolume":"      8243"},{"date_created":"2017-10-17T12:42:41Z","author":[{"full_name":"Keller, Matthias","last_name":"Keller","first_name":"Matthias"},{"full_name":"Pawlik, Stefan","last_name":"Pawlik","first_name":"Stefan"},{"last_name":"Pietrzyk","full_name":"Pietrzyk, Peter","first_name":"Peter"},{"last_name":"Karl","full_name":"Karl, Holger","id":"126","first_name":"Holger"}],"date_updated":"2022-01-06T07:02:11Z","doi":"10.1109/UCC.2013.85","title":"A Local Heuristic for Latency-Optimized Distributed Cloud Deployment","has_accepted_license":"1","page":"429-434","citation":{"ama":"Keller M, Pawlik S, Pietrzyk P, Karl H. A Local Heuristic for Latency-Optimized Distributed Cloud Deployment. In: <i>Proceedings of the 6th International Conference on Utility and Cloud Computing (UCC) Workshop on Distributed Cloud Computing</i>. ; 2013:429-434. doi:<a href=\"https://doi.org/10.1109/UCC.2013.85\">10.1109/UCC.2013.85</a>","ieee":"M. Keller, S. Pawlik, P. Pietrzyk, and H. Karl, “A Local Heuristic for Latency-Optimized Distributed Cloud Deployment,” in <i>Proceedings of the 6th International Conference on Utility and Cloud Computing (UCC) workshop on Distributed cloud computing</i>, 2013, pp. 429–434.","chicago":"Keller, Matthias, Stefan Pawlik, Peter Pietrzyk, and Holger Karl. “A Local Heuristic for Latency-Optimized Distributed Cloud Deployment.” In <i>Proceedings of the 6th International Conference on Utility and Cloud Computing (UCC) Workshop on Distributed Cloud Computing</i>, 429–34, 2013. <a href=\"https://doi.org/10.1109/UCC.2013.85\">https://doi.org/10.1109/UCC.2013.85</a>.","short":"M. Keller, S. Pawlik, P. Pietrzyk, H. Karl, in: Proceedings of the 6th International Conference on Utility and Cloud Computing (UCC) Workshop on Distributed Cloud Computing, 2013, pp. 429–434.","mla":"Keller, Matthias, et al. “A Local Heuristic for Latency-Optimized Distributed Cloud Deployment.” <i>Proceedings of the 6th International Conference on Utility and Cloud Computing (UCC) Workshop on Distributed Cloud Computing</i>, 2013, pp. 429–34, doi:<a href=\"https://doi.org/10.1109/UCC.2013.85\">10.1109/UCC.2013.85</a>.","bibtex":"@inproceedings{Keller_Pawlik_Pietrzyk_Karl_2013, title={A Local Heuristic for Latency-Optimized Distributed Cloud Deployment}, DOI={<a href=\"https://doi.org/10.1109/UCC.2013.85\">10.1109/UCC.2013.85</a>}, booktitle={Proceedings of the 6th International Conference on Utility and Cloud Computing (UCC) workshop on Distributed cloud computing}, author={Keller, Matthias and Pawlik, Stefan and Pietrzyk, Peter and Karl, Holger}, year={2013}, pages={429–434} }","apa":"Keller, M., Pawlik, S., Pietrzyk, P., &#38; Karl, H. (2013). A Local Heuristic for Latency-Optimized Distributed Cloud Deployment. In <i>Proceedings of the 6th International Conference on Utility and Cloud Computing (UCC) workshop on Distributed cloud computing</i> (pp. 429–434). <a href=\"https://doi.org/10.1109/UCC.2013.85\">https://doi.org/10.1109/UCC.2013.85</a>"},"year":"2013","department":[{"_id":"75"},{"_id":"63"}],"user_id":"477","_id":"562","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt A2","_id":"6"},{"_id":"5","name":"SFB 901 - Subproject A1"},{"name":"SFB 901 - Project Area A","_id":"2"}],"language":[{"iso":"eng"}],"file_date_updated":"2018-03-15T10:25:45Z","ddc":["040"],"publication":"Proceedings of the 6th International Conference on Utility and Cloud Computing (UCC) workshop on Distributed cloud computing","type":"conference","status":"public","file":[{"file_id":"1279","access_level":"closed","file_name":"562-dcc13_paper.pdf","file_size":347873,"date_created":"2018-03-15T10:25:45Z","creator":"florida","date_updated":"2018-03-15T10:25:45Z","relation":"main_file","success":1,"content_type":"application/pdf"}],"abstract":[{"text":"In Distributed Cloud Computing, applications are deployed across many data centres at topologically diverse locations to improved network-related quality of service (QoS). As we focus on interactive applications, we minimize the latency between users and an application by allocating Cloud resources nearby the customers. Allocating resources at all locations will result in the best latency but also in the highest expenses. So we need to find an optimal subset of locations which reduces the latency but also the expenses – the facility location problem (FLP). In addition, we consider resource capacity restrictions, as a resource can only serve a limited amount of users. An FLP can be globally solved. Additionally, we propose a local, distributed heuristic. This heuristic is running within the network and does not depend on a global component. No distributed, local approximations for the capacitated FLP have been proposed so far due to the complexity of the problem. We compared the heuristic with an optimal solution obtained from a mixed integer program for different network topologies. We investigated the influence of different parameters like overall resource utilization or different latency weights.","lang":"eng"}]},{"type":"conference","publication":"Proceedings of the 9th International Symposium on Algorithms and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics (ALGOSENSORS)","abstract":[{"lang":"eng","text":"Dominating set based virtual backbones are used for rou-ting in wireless ad-hoc networks. Such backbones receive and transmit messages from/to every node in the network. Existing distributed algorithms only consider undirected graphs, which model symmetric networks with uniform transmission ranges. We are particularly interested in the well-established disk graphs, which model asymmetric networks with non-uniform transmission ranges. The corresponding graph theoretic problem seeks a strongly connected dominating-absorbent set of minimum cardinality in a digraph. A subset of nodes in a digraph is a strongly connected dominating-absorbent set if the subgraph induced by these nodes is strongly connected and each node in the graph is either in the set or has both an in-neighbor and an out-neighbor in it. We introduce the first distributed algorithm for this problem in disk graphs. The algorithm gives an O(k^4) -approximation ratio and has a runtime bound of O(Diam) where Diam is the diameter of the graph and k denotes the transmission ratio r_{max}/r_{min} with r_{max} and r_{min} being the maximum and minimum transmission range, respectively. Moreover, we apply our algorithm on the subgraph of disk graphs consisting of only bidirectional edges. Our algorithm gives an O(ln k) -approximation and a runtime bound of O(k^8 log^∗ n) , which, for bounded k , is an optimal approximation for the problem, following Lenzen and Wattenhofer’s Ω(log^∗ n) runtime lower bound for distributed constant approximation in disk graphs."}],"file":[{"date_updated":"2018-03-15T10:25:15Z","date_created":"2018-03-15T10:25:15Z","creator":"florida","file_size":348191,"file_id":"1278","file_name":"563-978-3-642-45346-5_16.pdf","access_level":"closed","content_type":"application/pdf","success":1,"relation":"main_file"}],"status":"public","project":[{"_id":"1","name":"SFB 901"},{"_id":"5","name":"SFB 901 - Subprojekt A1"},{"_id":"2","name":"SFB 901 - Project Area A"}],"_id":"563","series_title":"LNCS","user_id":"477","department":[{"_id":"63"}],"ddc":["040"],"file_date_updated":"2018-03-15T10:25:15Z","has_accepted_license":"1","year":"2013","citation":{"apa":"Markarian, C., Meyer auf der Heide, F., &#38; Schubert, M. (2013). A Distributed Approximation Algorithm for Strongly Connected Dominating-Absorbent Sets in Asymmetric Wireless Ad-Hoc Networks. In <i>Proceedings of the 9th International Symposium on Algorithms and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics (ALGOSENSORS)</i> (pp. 217–227). <a href=\"https://doi.org/10.1007/978-3-642-45346-5_16\">https://doi.org/10.1007/978-3-642-45346-5_16</a>","mla":"Markarian, Christine, et al. “A Distributed Approximation Algorithm for Strongly Connected Dominating-Absorbent Sets in Asymmetric Wireless Ad-Hoc Networks.” <i>Proceedings of the 9th International Symposium on Algorithms and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics (ALGOSENSORS)</i>, 2013, pp. 217–27, doi:<a href=\"https://doi.org/10.1007/978-3-642-45346-5_16\">10.1007/978-3-642-45346-5_16</a>.","bibtex":"@inproceedings{Markarian_Meyer auf der Heide_Schubert_2013, series={LNCS}, title={A Distributed Approximation Algorithm for Strongly Connected Dominating-Absorbent Sets in Asymmetric Wireless Ad-Hoc Networks}, DOI={<a href=\"https://doi.org/10.1007/978-3-642-45346-5_16\">10.1007/978-3-642-45346-5_16</a>}, booktitle={Proceedings of the 9th International Symposium on Algorithms and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics (ALGOSENSORS)}, author={Markarian, Christine and Meyer auf der Heide, Friedhelm and Schubert, Michael}, year={2013}, pages={217–227}, collection={LNCS} }","short":"C. Markarian, F. Meyer auf der Heide, M. Schubert, in: Proceedings of the 9th International Symposium on Algorithms and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics (ALGOSENSORS), 2013, pp. 217–227.","ama":"Markarian C, Meyer auf der Heide F, Schubert M. A Distributed Approximation Algorithm for Strongly Connected Dominating-Absorbent Sets in Asymmetric Wireless Ad-Hoc Networks. In: <i>Proceedings of the 9th International Symposium on Algorithms and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics (ALGOSENSORS)</i>. LNCS. ; 2013:217-227. doi:<a href=\"https://doi.org/10.1007/978-3-642-45346-5_16\">10.1007/978-3-642-45346-5_16</a>","chicago":"Markarian, Christine, Friedhelm Meyer auf der Heide, and Michael Schubert. “A Distributed Approximation Algorithm for Strongly Connected Dominating-Absorbent Sets in Asymmetric Wireless Ad-Hoc Networks.” In <i>Proceedings of the 9th International Symposium on Algorithms and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics (ALGOSENSORS)</i>, 217–27. LNCS, 2013. <a href=\"https://doi.org/10.1007/978-3-642-45346-5_16\">https://doi.org/10.1007/978-3-642-45346-5_16</a>.","ieee":"C. Markarian, F. Meyer auf der Heide, and M. Schubert, “A Distributed Approximation Algorithm for Strongly Connected Dominating-Absorbent Sets in Asymmetric Wireless Ad-Hoc Networks,” in <i>Proceedings of the 9th International Symposium on Algorithms and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics (ALGOSENSORS)</i>, 2013, pp. 217–227."},"page":"217-227","date_updated":"2022-01-06T07:02:13Z","date_created":"2017-10-17T12:42:42Z","author":[{"last_name":"Markarian","id":"37612","full_name":"Markarian, Christine","first_name":"Christine"},{"last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","id":"15523","first_name":"Friedhelm"},{"first_name":"Michael","full_name":"Schubert, Michael","last_name":"Schubert"}],"title":"A Distributed Approximation Algorithm for Strongly Connected Dominating-Absorbent Sets in Asymmetric Wireless Ad-Hoc Networks","doi":"10.1007/978-3-642-45346-5_16"},{"publication":"Computer Graphics Forum","type":"conference","abstract":[{"lang":"eng","text":"Many 3D scenes (e.g. generated from CAD data) are composed of a multitude of objects that are nested in each other. A showroom, for instance, may contain multiple cars and every car has a gearbox with many gearwheels located inside. Because the objects occlude each other, only few are visible from outside. We present a new technique, Spherical Visibility Sampling (SVS), for real-time 3D rendering of such -- possibly highly complex -- scenes. SVS exploits the occlusion and annotates hierarchically structured objects with directional visibility information in a preprocessing step. For different directions, the directional visibility encodes which objects of a scene's region are visible from the outside of the regions' enclosing bounding sphere. Since there is no need to store a separate view space subdivision as in most techniques based on preprocessed visibility, a small memory footprint is achieved. Using the directional visibility information for an interactive walkthrough, the potentially visible objects can be retrieved very efficiently without the need for further visibility tests. Our evaluation shows that using SVS allows to preprocess complex 3D scenes fast and to visualize them in real time (e.g. a Power Plant model and five animated Boeing 777 models with billions of triangles). Because SVS does not require hardware support for occlusion culling during rendering, it is even applicable for rendering large scenes on mobile devices."}],"status":"public","_id":"16393","department":[{"_id":"63"}],"user_id":"15415","series_title":"Proceedings of the 24th Eurographics Symposium on Rendering","language":[{"iso":"eng"}],"publication_identifier":{"issn":["0167-7055"]},"publication_status":"published","issue":"4","year":"2013","page":"49-58","intvolume":"        32","citation":{"ama":"Eikel B, Jähn C, Fischer M, Meyer auf der Heide F. Spherical Visibility Sampling. In: <i>Computer Graphics Forum</i>. Vol 32. Proceedings of the 24th Eurographics Symposium on Rendering. ; 2013:49-58. doi:<a href=\"https://doi.org/10.1111/cgf.12150\">10.1111/cgf.12150</a>","chicago":"Eikel, Benjamin, Claudius Jähn, Matthias Fischer, and Friedhelm Meyer auf der Heide. “Spherical Visibility Sampling.” In <i>Computer Graphics Forum</i>, 32:49–58. Proceedings of the 24th Eurographics Symposium on Rendering, 2013. <a href=\"https://doi.org/10.1111/cgf.12150\">https://doi.org/10.1111/cgf.12150</a>.","ieee":"B. Eikel, C. Jähn, M. Fischer, and F. Meyer auf der Heide, “Spherical Visibility Sampling,” in <i>Computer Graphics Forum</i>, 2013, vol. 32, no. 4, pp. 49–58.","bibtex":"@inproceedings{Eikel_Jähn_Fischer_Meyer auf der Heide_2013, series={Proceedings of the 24th Eurographics Symposium on Rendering}, title={Spherical Visibility Sampling}, volume={32}, DOI={<a href=\"https://doi.org/10.1111/cgf.12150\">10.1111/cgf.12150</a>}, number={4}, booktitle={Computer Graphics Forum}, author={Eikel, Benjamin and Jähn, Claudius and Fischer, Matthias and Meyer auf der Heide, Friedhelm}, year={2013}, pages={49–58}, collection={Proceedings of the 24th Eurographics Symposium on Rendering} }","short":"B. Eikel, C. Jähn, M. Fischer, F. Meyer auf der Heide, in: Computer Graphics Forum, 2013, pp. 49–58.","mla":"Eikel, Benjamin, et al. “Spherical Visibility Sampling.” <i>Computer Graphics Forum</i>, vol. 32, no. 4, 2013, pp. 49–58, doi:<a href=\"https://doi.org/10.1111/cgf.12150\">10.1111/cgf.12150</a>.","apa":"Eikel, B., Jähn, C., Fischer, M., &#38; Meyer auf der Heide, F. (2013). Spherical Visibility Sampling. In <i>Computer Graphics Forum</i> (Vol. 32, pp. 49–58). <a href=\"https://doi.org/10.1111/cgf.12150\">https://doi.org/10.1111/cgf.12150</a>"},"date_updated":"2022-01-06T06:52:50Z","volume":32,"author":[{"first_name":"Benjamin","full_name":"Eikel, Benjamin","last_name":"Eikel"},{"first_name":"Claudius","full_name":"Jähn, Claudius","last_name":"Jähn"},{"last_name":"Fischer","full_name":"Fischer, Matthias","id":"146","first_name":"Matthias"},{"first_name":"Friedhelm","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","id":"15523"}],"date_created":"2020-04-03T07:48:48Z","title":"Spherical Visibility Sampling","doi":"10.1111/cgf.12150"},{"type":"book_chapter","publication":"Advances in Visual Computing","abstract":[{"lang":"eng","text":"In order to evaluate the efficiency of algorithms for real-time 3D rendering, different properties like rendering time, occluded triangles, or image quality, need to be investigated. Since these properties depend on the position of the camera, usually some camera path is chosen, along which the measurements are performed. As those measurements cover only a small part of the scene, this approach hardly allows drawing conclusions regarding the algorithm's properties at arbitrary positions in the scene. The presented method allows the systematic and position-independent evaluation of rendering algorithms. It uses an adaptive sampling approach to approximate the distribution of a property (like rendering time) for all positions in the scene. This approximation can be visualized to produce an intuitive impression of the algorithm's behavior or be statistically analyzed for objectively rating and comparing algorithms. We demonstrate our method by evaluating performance aspects of a known occlusion culling algorithm.\r\n"}],"status":"public","_id":"16406","user_id":"15415","department":[{"_id":"63"}],"language":[{"iso":"eng"}],"publication_status":"published","publication_identifier":{"isbn":["9783642419133","9783642419140"],"issn":["0302-9743","1611-3349"]},"year":"2013","place":"Berlin, Heidelberg","citation":{"ieee":"C. Jähn, B. Eikel, M. Fischer, R. Petring, and F. Meyer auf der Heide, “Evaluation of Rendering Algorithms Using Position-Dependent Scene Properties,” in <i>Advances in Visual Computing</i>, Berlin, Heidelberg, 2013.","chicago":"Jähn, Claudius, Benjamin Eikel, Matthias Fischer, Ralf Petring, and Friedhelm Meyer auf der Heide. “Evaluation of Rendering Algorithms Using Position-Dependent Scene Properties.” In <i>Advances in Visual Computing</i>. Berlin, Heidelberg, 2013. <a href=\"https://doi.org/10.1007/978-3-642-41914-0_12\">https://doi.org/10.1007/978-3-642-41914-0_12</a>.","ama":"Jähn C, Eikel B, Fischer M, Petring R, Meyer auf der Heide F. Evaluation of Rendering Algorithms Using Position-Dependent Scene Properties. In: <i>Advances in Visual Computing</i>. Berlin, Heidelberg; 2013. doi:<a href=\"https://doi.org/10.1007/978-3-642-41914-0_12\">10.1007/978-3-642-41914-0_12</a>","apa":"Jähn, C., Eikel, B., Fischer, M., Petring, R., &#38; Meyer auf der Heide, F. (2013). Evaluation of Rendering Algorithms Using Position-Dependent Scene Properties. In <i>Advances in Visual Computing</i>. Berlin, Heidelberg. <a href=\"https://doi.org/10.1007/978-3-642-41914-0_12\">https://doi.org/10.1007/978-3-642-41914-0_12</a>","mla":"Jähn, Claudius, et al. “Evaluation of Rendering Algorithms Using Position-Dependent Scene Properties.” <i>Advances in Visual Computing</i>, 2013, doi:<a href=\"https://doi.org/10.1007/978-3-642-41914-0_12\">10.1007/978-3-642-41914-0_12</a>.","bibtex":"@inbook{Jähn_Eikel_Fischer_Petring_Meyer auf der Heide_2013, place={Berlin, Heidelberg}, title={Evaluation of Rendering Algorithms Using Position-Dependent Scene Properties}, DOI={<a href=\"https://doi.org/10.1007/978-3-642-41914-0_12\">10.1007/978-3-642-41914-0_12</a>}, booktitle={Advances in Visual Computing}, author={Jähn, Claudius and Eikel, Benjamin and Fischer, Matthias and Petring, Ralf and Meyer auf der Heide, Friedhelm}, year={2013} }","short":"C. Jähn, B. Eikel, M. Fischer, R. Petring, F. Meyer auf der Heide, in: Advances in Visual Computing, Berlin, Heidelberg, 2013."},"date_updated":"2022-01-06T06:52:50Z","author":[{"first_name":"Claudius","full_name":"Jähn, Claudius","last_name":"Jähn"},{"full_name":"Eikel, Benjamin","last_name":"Eikel","first_name":"Benjamin"},{"first_name":"Matthias","full_name":"Fischer, Matthias","id":"146","last_name":"Fischer"},{"first_name":"Ralf","full_name":"Petring, Ralf","last_name":"Petring"},{"id":"15523","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","first_name":"Friedhelm"}],"date_created":"2020-04-06T07:21:55Z","title":"Evaluation of Rendering Algorithms Using Position-Dependent Scene Properties","doi":"10.1007/978-3-642-41914-0_12"},{"language":[{"iso":"eng"}],"_id":"16407","department":[{"_id":"63"}],"user_id":"15415","abstract":[{"text":"Many virtual 3D scenes, especially those that are large, are not structured evenly. For such heterogeneous data, there is no single algorithm that is able to render every scene type at each position fast and with the same high image quality. For a small set of scenes, this situation can be improved if different rendering algorithms are manually assigned to particular parts of the scene by an experienced user. We introduce the Multi-Algorithm-Rendering method. It automatically deploys different rendering algorithms simultaneously for a broad range of scene types. The method divides the scene into subregions and measures the behavior of different algorithms for each region in a preprocessing step. During runtime, this data is utilized to compute an estimate for the quality and running time of the available rendering algorithms from the observer's point of view. By solving an optimizing problem, the image quality can be optimized by an assignment of algorithms to regions while keeping the frame rate almost constant.\r\n","lang":"eng"}],"status":"public","publication":"Advances in Visual Computing","type":"book_chapter","title":"Real-Time 3D Rendering of Heterogeneous Scenes","doi":"10.1007/978-3-642-41914-0_44","date_updated":"2022-01-06T06:52:50Z","date_created":"2020-04-06T07:38:52Z","author":[{"first_name":"Ralf","last_name":"Petring","full_name":"Petring, Ralf"},{"first_name":"Benjamin","full_name":"Eikel, Benjamin","last_name":"Eikel"},{"first_name":"Claudius","last_name":"Jähn","full_name":"Jähn, Claudius"},{"last_name":"Fischer","full_name":"Fischer, Matthias","id":"146","first_name":"Matthias"},{"last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","id":"15523","first_name":"Friedhelm"}],"year":"2013","place":"Berlin, Heidelberg","citation":{"ama":"Petring R, Eikel B, Jähn C, Fischer M, Meyer auf der Heide F. Real-Time 3D Rendering of Heterogeneous Scenes. In: <i>Advances in Visual Computing</i>. Berlin, Heidelberg; 2013. doi:<a href=\"https://doi.org/10.1007/978-3-642-41914-0_44\">10.1007/978-3-642-41914-0_44</a>","chicago":"Petring, Ralf, Benjamin Eikel, Claudius Jähn, Matthias Fischer, and Friedhelm Meyer auf der Heide. “Real-Time 3D Rendering of Heterogeneous Scenes.” In <i>Advances in Visual Computing</i>. Berlin, Heidelberg, 2013. <a href=\"https://doi.org/10.1007/978-3-642-41914-0_44\">https://doi.org/10.1007/978-3-642-41914-0_44</a>.","ieee":"R. Petring, B. Eikel, C. Jähn, M. Fischer, and F. Meyer auf der Heide, “Real-Time 3D Rendering of Heterogeneous Scenes,” in <i>Advances in Visual Computing</i>, Berlin, Heidelberg, 2013.","short":"R. Petring, B. Eikel, C. Jähn, M. Fischer, F. Meyer auf der Heide, in: Advances in Visual Computing, Berlin, Heidelberg, 2013.","mla":"Petring, Ralf, et al. “Real-Time 3D Rendering of Heterogeneous Scenes.” <i>Advances in Visual Computing</i>, 2013, doi:<a href=\"https://doi.org/10.1007/978-3-642-41914-0_44\">10.1007/978-3-642-41914-0_44</a>.","bibtex":"@inbook{Petring_Eikel_Jähn_Fischer_Meyer auf der Heide_2013, place={Berlin, Heidelberg}, title={Real-Time 3D Rendering of Heterogeneous Scenes}, DOI={<a href=\"https://doi.org/10.1007/978-3-642-41914-0_44\">10.1007/978-3-642-41914-0_44</a>}, booktitle={Advances in Visual Computing}, author={Petring, Ralf and Eikel, Benjamin and Jähn, Claudius and Fischer, Matthias and Meyer auf der Heide, Friedhelm}, year={2013} }","apa":"Petring, R., Eikel, B., Jähn, C., Fischer, M., &#38; Meyer auf der Heide, F. (2013). Real-Time 3D Rendering of Heterogeneous Scenes. In <i>Advances in Visual Computing</i>. Berlin, Heidelberg. <a href=\"https://doi.org/10.1007/978-3-642-41914-0_44\">https://doi.org/10.1007/978-3-642-41914-0_44</a>"},"publication_identifier":{"isbn":["9783642419133","9783642419140"],"issn":["0302-9743","1611-3349"]},"publication_status":"published"},{"project":[{"name":"SFB 901","_id":"1","grant_number":"160364472"},{"name":"SFB 901 - Subprojekt C2","_id":"14","grant_number":"160364472"},{"name":"SFB 901 - Project Area C","_id":"4"}],"_id":"505","user_id":"15278","department":[{"_id":"63"},{"_id":"27"},{"_id":"518"},{"_id":"78"}],"ddc":["040"],"language":[{"iso":"eng"}],"file_date_updated":"2018-03-15T13:38:56Z","type":"conference","publication":"Proceedings of the 9th IEEE Workshop on Software Technology for Future embedded and Ubiquitous Systems (SEUS)","abstract":[{"lang":"eng","text":"In this paper we introduce “On-The-Fly Computing”, our vision of future IT services that will be provided by assembling modular software components available on world-wide markets. After suitable components have been found, they are automatically integrated, configured and brought to execution in an On-The-Fly Compute Center. We envision that these future compute centers will continue to leverage three current trends in large scale computing which are an increasing amount of parallel processing, a trend to use heterogeneous computing resources, and—in the light of rising energy cost—energy-efficiency as a primary goal in the design and operation of computing systems. In this paper, we point out three research challenges and our current work in these areas."}],"file":[{"file_size":1040834,"access_level":"closed","file_name":"505-Plessl13_seus.pdf","file_id":"1308","date_updated":"2018-03-15T13:38:56Z","date_created":"2018-03-15T13:38:56Z","creator":"florida","success":1,"relation":"main_file","content_type":"application/pdf"}],"status":"public","date_updated":"2023-09-26T13:38:20Z","publisher":"IEEE","date_created":"2017-10-17T12:42:30Z","author":[{"first_name":"Markus","full_name":"Happe, Markus","last_name":"Happe"},{"first_name":"Peter","full_name":"Kling, Peter","last_name":"Kling"},{"last_name":"Plessl","orcid":"0000-0001-5728-9982","id":"16153","full_name":"Plessl, Christian","first_name":"Christian"},{"first_name":"Marco","id":"398","full_name":"Platzner, Marco","last_name":"Platzner"},{"first_name":"Friedhelm","id":"15523","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide"}],"title":"On-The-Fly Computing: A Novel Paradigm for Individualized IT Services","doi":"10.1109/ISORC.2013.6913232","quality_controlled":"1","has_accepted_license":"1","year":"2013","citation":{"short":"M. Happe, P. Kling, C. Plessl, M. Platzner, F. Meyer auf der Heide, in: Proceedings of the 9th IEEE Workshop on Software Technology for Future Embedded and Ubiquitous Systems (SEUS), IEEE, 2013.","bibtex":"@inproceedings{Happe_Kling_Plessl_Platzner_Meyer auf der Heide_2013, title={On-The-Fly Computing: A Novel Paradigm for Individualized IT Services}, DOI={<a href=\"https://doi.org/10.1109/ISORC.2013.6913232\">10.1109/ISORC.2013.6913232</a>}, booktitle={Proceedings of the 9th IEEE Workshop on Software Technology for Future embedded and Ubiquitous Systems (SEUS)}, publisher={IEEE}, author={Happe, Markus and Kling, Peter and Plessl, Christian and Platzner, Marco and Meyer auf der Heide, Friedhelm}, year={2013} }","mla":"Happe, Markus, et al. “On-The-Fly Computing: A Novel Paradigm for Individualized IT Services.” <i>Proceedings of the 9th IEEE Workshop on Software Technology for Future Embedded and Ubiquitous Systems (SEUS)</i>, IEEE, 2013, doi:<a href=\"https://doi.org/10.1109/ISORC.2013.6913232\">10.1109/ISORC.2013.6913232</a>.","apa":"Happe, M., Kling, P., Plessl, C., Platzner, M., &#38; Meyer auf der Heide, F. (2013). On-The-Fly Computing: A Novel Paradigm for Individualized IT Services. <i>Proceedings of the 9th IEEE Workshop on Software Technology for Future Embedded and Ubiquitous Systems (SEUS)</i>. <a href=\"https://doi.org/10.1109/ISORC.2013.6913232\">https://doi.org/10.1109/ISORC.2013.6913232</a>","chicago":"Happe, Markus, Peter Kling, Christian Plessl, Marco Platzner, and Friedhelm Meyer auf der Heide. “On-The-Fly Computing: A Novel Paradigm for Individualized IT Services.” In <i>Proceedings of the 9th IEEE Workshop on Software Technology for Future Embedded and Ubiquitous Systems (SEUS)</i>. IEEE, 2013. <a href=\"https://doi.org/10.1109/ISORC.2013.6913232\">https://doi.org/10.1109/ISORC.2013.6913232</a>.","ieee":"M. Happe, P. Kling, C. Plessl, M. Platzner, and F. Meyer auf der Heide, “On-The-Fly Computing: A Novel Paradigm for Individualized IT Services,” 2013, doi: <a href=\"https://doi.org/10.1109/ISORC.2013.6913232\">10.1109/ISORC.2013.6913232</a>.","ama":"Happe M, Kling P, Plessl C, Platzner M, Meyer auf der Heide F. On-The-Fly Computing: A Novel Paradigm for Individualized IT Services. In: <i>Proceedings of the 9th IEEE Workshop on Software Technology for Future Embedded and Ubiquitous Systems (SEUS)</i>. IEEE; 2013. doi:<a href=\"https://doi.org/10.1109/ISORC.2013.6913232\">10.1109/ISORC.2013.6913232</a>"}}]