[{"date_updated":"2022-01-06T06:53:56Z","has_accepted_license":"1","status":"public","title":"Entwurf und Implementierung einer Laufzeitumgebung für parallele Algorithmen in Java","year":"2003","author":[{"full_name":"Gehweiler, Joachim","last_name":"Gehweiler","first_name":"Joachim"}],"ddc":["004"],"user_id":"15415","_id":"18982","language":[{"iso":"eng"}],"abstract":[{"lang":"ger","text":"In dieser Studienarbeit wurde ein System entworfen und implementiert, das der Ausführung paralleler Algorithmen nach dem Bulk-Synchronous Parallel (BSP)-Modell dient. Von der Paderborn University BSP Library (PUB) unterscheidet es sich dadurch, dass es vom Einsatzgebiet her nicht für Parallelrechner konzipiert ist, sondern vielmehr für eine Ansammlung von PCs und Workstations, die über das gesamte Internet verteilt sind.<br>Gegenüber anderen bekannten Web-Computing Projekten wie z.B. SETI@home oder distributed.net zeichnet sich dieses System dadurch aus, dass nicht Clients von einem zentralen Server \"häppchenweise\" unabhängige Teilprobleme anfordern und lösen, sondern dass die Clients gemeinsam an einem Problem arbeiten, indem sie nach dem BSP-Modell miteinander kommunizieren und sich synchronisieren."}],"file_date_updated":"2020-09-04T08:03:11Z","citation":{"ieee":"J. Gehweiler, <i>Entwurf und Implementierung einer Laufzeitumgebung für parallele Algorithmen in Java</i>. Universität Paderborn, 2003.","apa":"Gehweiler, J. (2003). <i>Entwurf und Implementierung einer Laufzeitumgebung für parallele Algorithmen in Java</i>. Universität Paderborn.","chicago":"Gehweiler, Joachim. <i>Entwurf Und Implementierung Einer Laufzeitumgebung Für Parallele Algorithmen in Java</i>. Universität Paderborn, 2003.","short":"J. Gehweiler, Entwurf Und Implementierung Einer Laufzeitumgebung Für Parallele Algorithmen in Java, Universität Paderborn, 2003.","mla":"Gehweiler, Joachim. <i>Entwurf Und Implementierung Einer Laufzeitumgebung Für Parallele Algorithmen in Java</i>. 2003.","bibtex":"@book{Gehweiler_2003, place={Universität Paderborn}, title={Entwurf und Implementierung einer Laufzeitumgebung für parallele Algorithmen in Java}, author={Gehweiler, Joachim}, year={2003} }","ama":"Gehweiler J. <i>Entwurf Und Implementierung Einer Laufzeitumgebung Für Parallele Algorithmen in Java</i>. Universität Paderborn; 2003."},"type":"mastersthesis","department":[{"_id":"63"}],"file":[{"creator":"koala","date_created":"2020-09-04T08:03:11Z","file_name":"pub-hni-2464.pdf","file_size":703144,"access_level":"closed","relation":"main_file","date_updated":"2020-09-04T08:03:11Z","file_id":"18985","content_type":"application/pdf","success":1}],"place":"Universität Paderborn","date_created":"2020-09-04T08:03:37Z"},{"title":"Definition and Behavior of Langton's Ant in Three Dimensions","year":"2003","status":"public","author":[{"full_name":"Hamann, Heiko","last_name":"Hamann","first_name":"Heiko"}],"date_updated":"2022-01-06T06:54:27Z","intvolume":"        14","page":"263--268","language":[{"iso":"eng"}],"_id":"20435","user_id":"15415","volume":14,"issue":"3","publication":"Complex Systems","citation":{"ieee":"H. Hamann, “Definition and Behavior of Langton’s Ant in Three Dimensions,” <i>Complex Systems</i>, vol. 14, no. 3, pp. 263--268, 2003.","apa":"Hamann, H. (2003). Definition and Behavior of Langton’s Ant in Three Dimensions. <i>Complex Systems</i>, <i>14</i>(3), 263--268.","chicago":"Hamann, Heiko. “Definition and Behavior of Langton’s Ant in Three Dimensions.” <i>Complex Systems</i> 14, no. 3 (2003): 263--268.","short":"H. Hamann, Complex Systems 14 (2003) 263--268.","mla":"Hamann, Heiko. “Definition and Behavior of Langton’s Ant in Three Dimensions.” <i>Complex Systems</i>, vol. 14, no. 3, 2003, pp. 263--268.","bibtex":"@article{Hamann_2003, title={Definition and Behavior of Langton’s Ant in Three Dimensions}, volume={14}, number={3}, journal={Complex Systems}, author={Hamann, Heiko}, year={2003}, pages={263--268} }","ama":"Hamann H. Definition and Behavior of Langton’s Ant in Three Dimensions. <i>Complex Systems</i>. 2003;14(3):263--268."},"date_created":"2020-11-19T12:15:45Z","type":"journal_article","department":[{"_id":"63"},{"_id":"238"}]},{"date_created":"2020-08-24T14:18:19Z","department":[{"_id":"63"}],"type":"conference","citation":{"apa":"Ziegler, M. (2003). Quasi-optimal Arithmetic for Quaternion Polynomials. In <i>Proc. 14th Annual International Symposium on Algorithms and Computation (ISAAC’03)</i> (pp. 705–715). <a href=\"https://doi.org/10.1007/978-3-540-24587-2_72\">https://doi.org/10.1007/978-3-540-24587-2_72</a>","ieee":"M. Ziegler, “Quasi-optimal Arithmetic for Quaternion Polynomials,” in <i>Proc. 14th Annual International Symposium on Algorithms and Computation (ISAAC’03)</i>, 2003, pp. 705–715.","chicago":"Ziegler, Martin. “Quasi-Optimal Arithmetic for Quaternion Polynomials.” In <i>Proc. 14th Annual International Symposium on Algorithms and Computation (ISAAC’03)</i>, 705–15. Lecture Notes in Computer Science, Vol 2906. Springer, Berlin, Heidelberg, 2003. <a href=\"https://doi.org/10.1007/978-3-540-24587-2_72\">https://doi.org/10.1007/978-3-540-24587-2_72</a>.","short":"M. Ziegler, in: Proc. 14th Annual International Symposium on Algorithms and Computation (ISAAC’03), 2003, pp. 705–715.","mla":"Ziegler, Martin. “Quasi-Optimal Arithmetic for Quaternion Polynomials.” <i>Proc. 14th Annual International Symposium on Algorithms and Computation (ISAAC’03)</i>, 2003, pp. 705–15, doi:<a href=\"https://doi.org/10.1007/978-3-540-24587-2_72\">10.1007/978-3-540-24587-2_72</a>.","ama":"Ziegler M. Quasi-optimal Arithmetic for Quaternion Polynomials. In: <i>Proc. 14th Annual International Symposium on Algorithms and Computation (ISAAC’03)</i>. Lecture Notes in Computer Science, vol 2906. Springer, Berlin, Heidelberg. ; 2003:705-715. doi:<a href=\"https://doi.org/10.1007/978-3-540-24587-2_72\">10.1007/978-3-540-24587-2_72</a>","bibtex":"@inproceedings{Ziegler_2003, series={Lecture Notes in Computer Science, vol 2906. Springer, Berlin, Heidelberg}, title={Quasi-optimal Arithmetic for Quaternion Polynomials}, DOI={<a href=\"https://doi.org/10.1007/978-3-540-24587-2_72\">10.1007/978-3-540-24587-2_72</a>}, booktitle={Proc. 14th Annual International Symposium on Algorithms and Computation (ISAAC’03)}, author={Ziegler, Martin}, year={2003}, pages={705–715}, collection={Lecture Notes in Computer Science, vol 2906. Springer, Berlin, Heidelberg} }"},"publication":"Proc. 14th Annual International Symposium on Algorithms and Computation (ISAAC'03)","abstract":[{"lang":"eng","text":"Fast algorithms for arithmetic on real or complex polynomials are well-known and have proven to be not only asymptotically efficient but also very practical. Based on FAST FOURIER TRANSFORM, they for instance multiply two polynomials of degree up to N or multi-evaluate one at N points simultaneously within quasi-linear time O(N polylog N). An extension to (and in fact the mere definition of) polynomials over fields R and C to the SKEW-field H of quaternions is promising but still missing. The present work proposes three approaches which in the commutative case coincide but for H turn out to differ, each one satisfying some desirable properties while lacking others. For each notion, we devise algorithms for according arithmetic; these are quasi-optimal in that their running times match lower complexity bounds up to polylogarithmic factors."}],"_id":"18196","language":[{"iso":"eng"}],"series_title":"Lecture Notes in Computer Science, vol 2906. Springer, Berlin, Heidelberg","page":"705-715","doi":"10.1007/978-3-540-24587-2_72","user_id":"15415","publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783540206958","9783540245872"]},"author":[{"full_name":"Ziegler, Martin","last_name":"Ziegler","first_name":"Martin"}],"title":"Quasi-optimal Arithmetic for Quaternion Polynomials","year":"2003","status":"public","date_updated":"2022-01-06T06:53:27Z","publication_status":"published"},{"date_created":"2020-08-25T10:15:14Z","type":"book_chapter","department":[{"_id":"63"}],"publication":"Lecture Notes in Computer Science","abstract":[{"text":"Multi-evaluation of the Coulomb potential induced by N particles is a central part of N-body simulations. In 3D, known subquadratic time algorithms return approximations up to given ABSOLUTE precision. By combining data structures from Computational Geometry with fast polynomial arithmetic, the present work obtains approximations of prescribable RELATIVE error e>0 in time O(1/e*N*polylog N).","lang":"eng"}],"series_title":"Lecture Notes in Computer Science","language":[{"iso":"eng"}],"doi":"10.1007/978-3-540-45078-8_13","year":"2003","title":"Fast Relative Approximation of Potential Fields","publication_identifier":{"isbn":["9783540405450","9783540450788"],"issn":["0302-9743","1611-3349"]},"author":[{"full_name":"Ziegler, Martin","last_name":"Ziegler","first_name":"Martin"}],"corporate_editor":["Algorithms and Data Structures. WADS 2003"],"date_updated":"2022-01-06T06:53:28Z","publication_status":"published","intvolume":"      2748","place":"Berlin, Heidelberg","citation":{"chicago":"Ziegler, Martin. “Fast Relative Approximation of Potential Fields.” In <i>Lecture Notes in Computer Science</i>, edited by F. Dehne, JR. Sack, M. Smid, and Algorithms and Data Structures. WADS 2003, Vol. 2748. Lecture Notes in Computer Science. Berlin, Heidelberg: Springer, 2003. <a href=\"https://doi.org/10.1007/978-3-540-45078-8_13\">https://doi.org/10.1007/978-3-540-45078-8_13</a>.","short":"M. Ziegler, in: F. Dehne, J. Sack, M. Smid, Algorithms and Data Structures. WADS 2003 (Eds.), Lecture Notes in Computer Science, Springer, Berlin, Heidelberg, 2003.","apa":"Ziegler, M. (2003). Fast Relative Approximation of Potential Fields. In F. Dehne, J. Sack, M. Smid, &#38; Algorithms and Data Structures. WADS 2003 (Eds.), <i>Lecture Notes in Computer Science</i> (Vol. 2748). Berlin, Heidelberg: Springer. <a href=\"https://doi.org/10.1007/978-3-540-45078-8_13\">https://doi.org/10.1007/978-3-540-45078-8_13</a>","ieee":"M. Ziegler, “Fast Relative Approximation of Potential Fields,” in <i>Lecture Notes in Computer Science</i>, vol. 2748, F. Dehne, J. Sack, M. Smid, and Algorithms and Data Structures. WADS 2003, Eds. Berlin, Heidelberg: Springer, 2003.","ama":"Ziegler M. Fast Relative Approximation of Potential Fields. In: Dehne F, Sack J, Smid M, Algorithms and Data Structures. WADS 2003, eds. <i>Lecture Notes in Computer Science</i>. Vol 2748. Lecture Notes in Computer Science. Berlin, Heidelberg: Springer; 2003. doi:<a href=\"https://doi.org/10.1007/978-3-540-45078-8_13\">10.1007/978-3-540-45078-8_13</a>","bibtex":"@inbook{Ziegler_2003, place={Berlin, Heidelberg}, series={Lecture Notes in Computer Science}, title={Fast Relative Approximation of Potential Fields}, volume={2748}, DOI={<a href=\"https://doi.org/10.1007/978-3-540-45078-8_13\">10.1007/978-3-540-45078-8_13</a>}, booktitle={Lecture Notes in Computer Science}, publisher={Springer}, author={Ziegler, Martin}, editor={Dehne, F. and Sack, JR. and Smid, M. and Algorithms and Data Structures. WADS 2003Editors}, year={2003}, collection={Lecture Notes in Computer Science} }","mla":"Ziegler, Martin. “Fast Relative Approximation of Potential Fields.” <i>Lecture Notes in Computer Science</i>, edited by F. Dehne et al., vol. 2748, Springer, 2003, doi:<a href=\"https://doi.org/10.1007/978-3-540-45078-8_13\">10.1007/978-3-540-45078-8_13</a>."},"publisher":"Springer","_id":"18258","user_id":"15415","editor":[{"last_name":"Dehne","first_name":"F.","full_name":"Dehne, F."},{"last_name":"Sack","first_name":"JR.","full_name":"Sack, JR."},{"first_name":"M.","last_name":"Smid","full_name":"Smid, M."}],"volume":2748,"status":"public"},{"place":"Karlsruhe","file_date_updated":"2020-08-26T12:52:18Z","citation":{"mla":"Fischer, Matthias, et al. “Virtual and Augmented Reality Support for Discrete Manufacturing System Simulation.” <i>Human Aspects in Production Management - Proceedings of the IFIP WG 5.7 Working Conference on Human Aspects in Production Management</i>, vol. 5, Shaker Verlag, 2003, pp. 170–77.","ama":"Fischer M, Grafe M, Matysczok C, Mueck B, Schoo M. Virtual and Augmented Reality Support for Discrete Manufacturing System Simulation. In: <i>Human Aspects in Production Management - Proceedings of the IFIP WG 5.7 Working Conference on Human Aspects in Production Management</i>. Vol 5. ESIM - European Series in Industrial Management. Karlsruhe: Shaker Verlag; 2003:170-177.","bibtex":"@inproceedings{Fischer_Grafe_Matysczok_Mueck_Schoo_2003, place={Karlsruhe}, series={ESIM - European Series in Industrial Management}, title={Virtual and Augmented Reality Support for Discrete Manufacturing System Simulation}, volume={5}, booktitle={Human Aspects in Production Management - Proceedings of the IFIP WG 5.7 Working Conference on Human Aspects in Production Management}, publisher={Shaker Verlag}, author={Fischer, Matthias and Grafe, Michael and Matysczok, Carsten and Mueck, Bengt and Schoo, Michael}, year={2003}, pages={170–177}, collection={ESIM - European Series in Industrial Management} }","apa":"Fischer, M., Grafe, M., Matysczok, C., Mueck, B., &#38; Schoo, M. (2003). Virtual and Augmented Reality Support for Discrete Manufacturing System Simulation. In <i>Human Aspects in Production Management - Proceedings of the IFIP WG 5.7 Working Conference on Human Aspects in Production Management</i> (Vol. 5, pp. 170–177). Karlsruhe: Shaker Verlag.","ieee":"M. Fischer, M. Grafe, C. Matysczok, B. Mueck, and M. Schoo, “Virtual and Augmented Reality Support for Discrete Manufacturing System Simulation,” in <i>Human Aspects in Production Management - Proceedings of the IFIP WG 5.7 Working Conference on Human Aspects in Production Management</i>, 2003, vol. 5, pp. 170–177.","short":"M. Fischer, M. Grafe, C. Matysczok, B. Mueck, M. Schoo, in: Human Aspects in Production Management - Proceedings of the IFIP WG 5.7 Working Conference on Human Aspects in Production Management, Shaker Verlag, Karlsruhe, 2003, pp. 170–177.","chicago":"Fischer, Matthias, Michael Grafe, Carsten Matysczok, Bengt Mueck, and Michael Schoo. “Virtual and Augmented Reality Support for Discrete Manufacturing System Simulation.” In <i>Human Aspects in Production Management - Proceedings of the IFIP WG 5.7 Working Conference on Human Aspects in Production Management</i>, 5:170–77. ESIM - European Series in Industrial Management. Karlsruhe: Shaker Verlag, 2003."},"ddc":["000"],"user_id":"15415","volume":5,"page":"170-177","_id":"18367","publisher":"Shaker Verlag","has_accepted_license":"1","status":"public","type":"conference","department":[{"_id":"63"}],"file":[{"file_id":"18368","content_type":"application/pdf","success":1,"file_name":"hni-id-1445.pdf","file_size":221846,"access_level":"closed","relation":"main_file","date_updated":"2020-08-26T12:52:18Z","date_created":"2020-08-26T12:52:18Z","creator":"koala"}],"date_created":"2020-08-26T12:53:13Z","abstract":[{"text":"Unternehmen operieren zunehmend in einem schwierigen Umfeld: Die Innovationsdynamik nimmt zu; die Produktlebenszyklen werden kürzer; gleichzeitig werden die Produkte komplexer; der harte Wettbewerb zwingt die Unternehmen, auf Marktveränderungen zu reagieren. Aus dieser Entwicklung resultieren hohe Anforderungen an die Gestaltung der Fertigungsprozesse. Im Wesentlichen kommt es darauf an, die Fertigungsprozesse möglichst rasch an die neuen Gegebenheiten anzupassen, bzw. neue Fertigungsprozesse so zu planen, dass sie auf Anhieb die erforderlichen Resultate bringen.\r\nEin wichtiges Mittel hierfür der Einsatz von Materialflusssimulationen. Hierzu ist zunächst die Erstellung eines Simulationsmodells notwendig. Dafür wird in einem ersten Schritt das zu betrachtende System analysiert und ein rechnerinternes Modell erzeugt. Dieses beinhaltet die Modellierung von Funktionen, Prozessen, Verhaltensweisen oder Regeln, die im Modell die tatsächlichen Wirkzusammenhänge im Unternehmen widerspiegeln sollen. Die so modellierten Aspekte sind untereinander so vernetzt, dass alle Funktionen des Modells ein Ganzes ergeben. Für viele Fragenstellungen werden umfangreiche Modelle mit einem komplexen Verhalten benötigt. Andererseits steigt mit zunehmender Größe und Komplexität des Simulationsmodells auch der Modellierungsaufwand, die Fehleranfälligkeit, die Laufzeit und der Interpretationsaufwand bei der Ergebnisauswertung. Fehler bei der Modellbildung führen bei der Simulation zu Fehlinterpretationen und falschen Ergebnissen.\r\nEinen wesentlichen Anteil daran hat die Gestaltung der Benutzungsschnittstelle: Das übliche, wenig intuitive WIMP-Interface (Windows, Icons, Mouse, Pointer) erfordert sehr gut geschulte Benutzer, sodass die Erzeugung der meist komplexen Simulationsmodelle mit großen Zeitaufwand verbunden ist. Die Präsentation der Simulationsergebnisse erfolgt in Form von Wertetabellen und zweidimensionalen, abstrakten Darstellungen des Fertigungssystems. Für die Simulationsexperten erscheint dies ausreichend, für ein aus verschiedenen Bereichen und Disziplinen zusammengesetztes Planungsteam ist das aber nicht akzeptabel. So können Fehlinterpretationen aufgrund der unklaren Darstellungen auftreten.\r\nDurch eine durchgängige Unterstützung von der Modellierung über die Ausführung bis zur Analyse von Simulationen durch Augmented-Reality und Virtual-Reality werden viele dieser Probleme überwunden aber viele neue Probleme entstehen.\r\nMarktgängige Simulatoren unterstützen zwar z.T. schon Virtual Reality; eine durchgängige Simulationsunterstützung wird aber in der Virtuellen Umgebung nicht geboten. Argumented Reality-Komponenten sind bisher nicht bekannt.\r\nIn diesem Artikel werden nach einer Analyse der benötigten Technologien die Nutzenpotentiale insb. durch den Einsatz von AR ausgelotet.\r\n","lang":"eng"}],"publication":"Human Aspects in Production Management - Proceedings of the IFIP WG 5.7 Working Conference on Human Aspects in Production Management","language":[{"iso":"eng"}],"series_title":"ESIM - European Series in Industrial Management","date_updated":"2022-01-06T06:53:30Z","intvolume":"         5","title":"Virtual and Augmented Reality Support for Discrete Manufacturing System Simulation","year":"2003","author":[{"id":"146","full_name":"Fischer, Matthias","first_name":"Matthias","last_name":"Fischer"},{"full_name":"Grafe, Michael","last_name":"Grafe","first_name":"Michael"},{"full_name":"Matysczok, Carsten","last_name":"Matysczok","first_name":"Carsten"},{"full_name":"Mueck, Bengt","last_name":"Mueck","first_name":"Bengt"},{"first_name":"Michael","last_name":"Schoo","full_name":"Schoo, Michael"}]},{"abstract":[{"lang":"ger","text":"Simulation und Visualisierung sind anerkannte Mittel zum Verstehen und Analysieren von Fertigungsprozessen. In Visualisierungen von Fertigungsprozessen können Betrachter frei und ungeleitet umherwandern. Erkenntnisse werden so aber eher zufällig erworben. Dieser Artikel skizziert ein System und Methoden, die den Betrachter unterstützen auf auffällige/signifikante Prozesse/ Punkte in Materialflusssimulationen aufmerksam zu werden und diese zu entschärfen.\r\nEs wird der Entwurf eines Werkzeugs beschrieben, dass den Betrachter einer Simulation die Möglichkeit bietet, signifikante Produktionsprozesse interaktiv zu verbessern. Der Benutzer wird sich in einer virtuellen 3D-Umgebung (Walkthrough-System) bewegen können und automatisch ermittelte Indizien für signifikante Abläufe erhalten. Zugleich soll die Simulation signifikante Objekte genauer simulieren. Bekundet der Benutzer Interesse an einem signifikanten Prozess, wird er automatisch zu dem jeweiligen Ort geführt werden und dort durch Eingriffe in die Simulation die kritische Situation experimentell untersuchen können. Da der kritische Moment in der Vergangenheit liegt und somit vom Betrachter schon verpasst ist, wird es dem Betrachter möglich sein, die Simulation auf einen Zeitpunkt vor dem Eintreten zurück zu setzen.\r\nDie virtuelle Szene (3D-Grafik-Modelle) einer typischen dynamischen Simulationsumgebung ist in der Regel zu komplex, um sie in Echtzeit in einem Walkthrough-System zu visualisieren und darzustellen. Typischerweise werden Approximationsverfahren eingesetzt, um die Komplexität zu reduzieren und ein flüssiges Navigieren des Betrachters zu erlauben. Durch spezifische Simulations-Anforderungen ist bekannt, an welchen Objekten des Simulationsmodells Probleme auftreten; sie sind für den Betrachter wichtig. Die zugehörigen virtuellen 3D-Repräsentanten, können von den Approximationsalgorithmen mit einer besonders hohen Darstellungsqualität dargestellt werden und die übrigen Teile der virtuellen Szene entsprechend vernachlässigt werden. Solche Approximationsalgorithmen und Datenstrukturen nutzen die spezifischen Eigenschaften virtueller Simulationsumgebungen aus, um eine hohe Darstellungsqualität und Darstellungsperformance zu erreichen.\r\n"}],"publication":"2. Paderborner Workshop Augmented & Virtual Reality in der Produktentstehung","type":"conference","department":[{"_id":"63"}],"file":[{"file_size":166316,"access_level":"closed","file_name":"hni-id-1340.pdf","date_updated":"2020-08-26T13:15:56Z","relation":"main_file","success":1,"content_type":"application/pdf","file_id":"18373","creator":"koala","date_created":"2020-08-26T13:15:56Z"}],"date_created":"2020-08-26T13:16:08Z","date_updated":"2022-01-06T06:53:31Z","intvolume":"       123","title":"Komponenten zur aktiven Unterstützung der Analyse von Materialflusssimulationen in virtuellen Umgebungen","year":"2003","author":[{"last_name":"Dangelmaier","first_name":"Wilhelm","full_name":"Dangelmaier, Wilhelm"},{"full_name":" Franke, Werner","last_name":" Franke","first_name":"Werner"},{"full_name":"Mueck, Bengt","first_name":"Bengt","last_name":"Mueck"},{"last_name":"Fischer","first_name":"Matthias","full_name":"Fischer, Matthias","id":"146"}],"language":[{"iso":"eng"}],"series_title":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","file_date_updated":"2020-08-26T13:15:56Z","citation":{"ama":"Dangelmaier W,  Franke W, Mueck B, Fischer M. Komponenten zur aktiven Unterstützung der Analyse von Materialflusssimulationen in virtuellen Umgebungen. In: <i>2. Paderborner Workshop Augmented &#38; Virtual Reality in Der Produktentstehung</i>. Vol 123. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn. ; 2003:141-151.","bibtex":"@inproceedings{Dangelmaier_ Franke_Mueck_Fischer_2003, series={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, title={Komponenten zur aktiven Unterstützung der Analyse von Materialflusssimulationen in virtuellen Umgebungen}, volume={123}, booktitle={2. Paderborner Workshop Augmented &#38; Virtual Reality in der Produktentstehung}, author={Dangelmaier, Wilhelm and  Franke, Werner and Mueck, Bengt and Fischer, Matthias}, year={2003}, pages={141–151}, collection={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn} }","mla":"Dangelmaier, Wilhelm, et al. “Komponenten Zur Aktiven Unterstützung Der Analyse von Materialflusssimulationen in Virtuellen Umgebungen.” <i>2. Paderborner Workshop Augmented &#38; Virtual Reality in Der Produktentstehung</i>, vol. 123, 2003, pp. 141–51.","chicago":"Dangelmaier, Wilhelm, Werner  Franke, Bengt Mueck, and Matthias Fischer. “Komponenten Zur Aktiven Unterstützung Der Analyse von Materialflusssimulationen in Virtuellen Umgebungen.” In <i>2. Paderborner Workshop Augmented &#38; Virtual Reality in Der Produktentstehung</i>, 123:141–51. Verlagsschriftenreihe Des Heinz Nixdorf Instituts, Paderborn, 2003.","short":"W. Dangelmaier, W.  Franke, B. Mueck, M. Fischer, in: 2. Paderborner Workshop Augmented &#38; Virtual Reality in Der Produktentstehung, 2003, pp. 141–151.","apa":"Dangelmaier, W.,  Franke, W., Mueck, B., &#38; Fischer, M. (2003). Komponenten zur aktiven Unterstützung der Analyse von Materialflusssimulationen in virtuellen Umgebungen. In <i>2. Paderborner Workshop Augmented &#38; Virtual Reality in der Produktentstehung</i> (Vol. 123, pp. 141–151).","ieee":"W. Dangelmaier, W.  Franke, B. Mueck, and M. Fischer, “Komponenten zur aktiven Unterstützung der Analyse von Materialflusssimulationen in virtuellen Umgebungen,” in <i>2. Paderborner Workshop Augmented &#38; Virtual Reality in der Produktentstehung</i>, 2003, vol. 123, pp. 141–151."},"has_accepted_license":"1","status":"public","user_id":"15415","ddc":["000"],"volume":123,"page":"141-151","_id":"18372"},{"publication":"2. Paderborner Workshop Augmented & Virtual Reality in der Produktentstehung","abstract":[{"lang":"ger","text":"In der heutigen Zeit operieren Unternehmen zunehmend in einem schwierigen Umfeld: Die Innovationsdynamik nimmt zu und die Produktlebenszyklen werden kürzer. Daraus resultieren hohe Anforderungen an die Planung von Fertigungssysteme. Um diesen Prozess zu unterstützen, sollen die Technologien Augmented Reality und Virtual Reality in einem integrierten System genutzt werden. Dieses System unterstützt den Anwender bei der Modellbildung, der Validierung des Simulationsmodells sowie der folgenden Optimierung des Fertigungssystems. Durch die Entwicklung geeigneter Kopplungs- bzw. Integrationsmechanismen wird eine durchgängige Nutzung der Technologien AR, VR und Simulation realisiert. Die Visualisierung der anfallenden 3D-Daten innerhalb der VR- und ARUmgebungen erfolgt mittels einer 3D-Renderinglibrary, die es durch den Einsatz von neuen entwickelten Verfahren ermöglicht, die verwendeten 3D-Modelle weitgehend automatisiert aus unternehmensinternen 3D-CAD-Modellen zu generieren."}],"date_created":"2020-08-26T13:24:57Z","file":[{"date_created":"2020-08-26T13:24:28Z","creator":"koala","file_id":"18375","success":1,"content_type":"application/pdf","relation":"main_file","date_updated":"2020-08-26T13:24:28Z","file_name":"hni-id-1343.pdf","access_level":"closed","file_size":906882}],"department":[{"_id":"63"},{"_id":"26"}],"type":"conference","author":[{"id":"146","last_name":"Fischer","first_name":"Matthias","full_name":"Fischer, Matthias"},{"last_name":"Grafe","first_name":"Michael","full_name":"Grafe, Michael"},{"last_name":"Matysczok","first_name":"Carsten","full_name":"Matysczok, Carsten"},{"last_name":"Schoo","first_name":"Michael","full_name":"Schoo, Michael"},{"full_name":"Mueck, Bengt","last_name":"Mueck","first_name":"Bengt"}],"title":"Planung von komplexen Fertigungssystemen durch Einsatz einer VR/AR-unterstützten Simulation","year":"2003","intvolume":"       123","date_updated":"2022-01-06T06:53:31Z","language":[{"iso":"eng"}],"series_title":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","citation":{"chicago":"Fischer, Matthias, Michael Grafe, Carsten Matysczok, Michael Schoo, and Bengt Mueck. “Planung von Komplexen Fertigungssystemen Durch Einsatz Einer VR/AR-Unterstützten Simulation.” In <i>2. Paderborner Workshop Augmented &#38; Virtual Reality in Der Produktentstehung</i>, 123:153–66. Verlagsschriftenreihe Des Heinz Nixdorf Instituts, Paderborn. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2003.","short":"M. Fischer, M. Grafe, C. Matysczok, M. Schoo, B. Mueck, in: 2. Paderborner Workshop Augmented &#38; Virtual Reality in Der Produktentstehung, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2003, pp. 153–166.","ieee":"M. Fischer, M. Grafe, C. Matysczok, M. Schoo, and B. Mueck, “Planung von komplexen Fertigungssystemen durch Einsatz einer VR/AR-unterstützten Simulation,” in <i>2. Paderborner Workshop Augmented &#38; Virtual Reality in der Produktentstehung</i>, 2003, vol. 123, pp. 153–166.","apa":"Fischer, M., Grafe, M., Matysczok, C., Schoo, M., &#38; Mueck, B. (2003). Planung von komplexen Fertigungssystemen durch Einsatz einer VR/AR-unterstützten Simulation. <i>2. Paderborner Workshop Augmented &#38; Virtual Reality in Der Produktentstehung</i>, <i>123</i>, 153–166.","bibtex":"@inproceedings{Fischer_Grafe_Matysczok_Schoo_Mueck_2003, series={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, title={Planung von komplexen Fertigungssystemen durch Einsatz einer VR/AR-unterstützten Simulation}, volume={123}, booktitle={2. Paderborner Workshop Augmented &#38; Virtual Reality in der Produktentstehung}, publisher={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, author={Fischer, Matthias and Grafe, Michael and Matysczok, Carsten and Schoo, Michael and Mueck, Bengt}, year={2003}, pages={153–166}, collection={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn} }","ama":"Fischer M, Grafe M, Matysczok C, Schoo M, Mueck B. Planung von komplexen Fertigungssystemen durch Einsatz einer VR/AR-unterstützten Simulation. In: <i>2. Paderborner Workshop Augmented &#38; Virtual Reality in Der Produktentstehung</i>. Vol 123. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn; 2003:153-166.","mla":"Fischer, Matthias, et al. “Planung von Komplexen Fertigungssystemen Durch Einsatz Einer VR/AR-Unterstützten Simulation.” <i>2. Paderborner Workshop Augmented &#38; Virtual Reality in Der Produktentstehung</i>, vol. 123, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2003, pp. 153–66."},"file_date_updated":"2020-08-26T13:24:28Z","status":"public","has_accepted_license":"1","_id":"18374","publisher":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","page":"153-166","volume":123,"ddc":["000"],"user_id":"5786"},{"title":"Randomized Pursuit-Evasion in Graphs","year":"2003","status":"public","author":[{"full_name":"Adler, Micah","first_name":"Micah","last_name":"Adler"},{"full_name":"Vöcking, Berthold","last_name":"Vöcking","first_name":"Berthold"},{"full_name":"Sohler, Christian","first_name":"Christian","last_name":"Sohler"},{"full_name":"Räcke, Harald","last_name":"Räcke","first_name":"Harald"},{"full_name":"Sivadasan, Naveen","last_name":"Sivadasan","first_name":"Naveen"}],"date_updated":"2022-01-06T06:53:40Z","page":"225-244","_id":"18567","language":[{"iso":"eng"}],"user_id":"15415","publication":"Combinatorics, Probability & Computing","citation":{"ieee":"M. Adler, B. Vöcking, C. Sohler, H. Räcke, and N. Sivadasan, “Randomized Pursuit-Evasion in Graphs,” <i>Combinatorics, Probability &#38; Computing</i>, pp. 225–244, 2003.","apa":"Adler, M., Vöcking, B., Sohler, C., Räcke, H., &#38; Sivadasan, N. (2003). Randomized Pursuit-Evasion in Graphs. <i>Combinatorics, Probability &#38; Computing</i>, 225–244.","chicago":"Adler, Micah, Berthold Vöcking, Christian Sohler, Harald Räcke, and Naveen Sivadasan. “Randomized Pursuit-Evasion in Graphs.” <i>Combinatorics, Probability &#38; Computing</i>, 2003, 225–44.","short":"M. Adler, B. Vöcking, C. Sohler, H. Räcke, N. Sivadasan, Combinatorics, Probability &#38; Computing (2003) 225–244.","mla":"Adler, Micah, et al. “Randomized Pursuit-Evasion in Graphs.” <i>Combinatorics, Probability &#38; Computing</i>, 2003, pp. 225–44.","bibtex":"@article{Adler_Vöcking_Sohler_Räcke_Sivadasan_2003, title={Randomized Pursuit-Evasion in Graphs}, journal={Combinatorics, Probability &#38; Computing}, author={Adler, Micah and Vöcking, Berthold and Sohler, Christian and Räcke, Harald and Sivadasan, Naveen}, year={2003}, pages={225–244} }","ama":"Adler M, Vöcking B, Sohler C, Räcke H, Sivadasan N. Randomized Pursuit-Evasion in Graphs. <i>Combinatorics, Probability &#38; Computing</i>. 2003:225-244."},"date_created":"2020-08-28T12:14:18Z","type":"journal_article","department":[{"_id":"63"}]},{"citation":{"bibtex":"@book{Sohler_2003, series={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, title={Property Testing and Geometry}, volume={119}, publisher={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, author={Sohler, Christian}, year={2003}, collection={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn} }","ama":"Sohler C. <i>Property Testing and Geometry</i>. Vol 119. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn; 2003.","mla":"Sohler, Christian. <i>Property Testing and Geometry</i>. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2003.","short":"C. Sohler, Property Testing and Geometry, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2003.","chicago":"Sohler, Christian. <i>Property Testing and Geometry</i>. Vol. 119. Verlagsschriftenreihe Des Heinz Nixdorf Instituts, Paderborn. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2003.","ieee":"C. Sohler, <i>Property Testing and Geometry</i>, vol. 119. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2003.","apa":"Sohler, C. (2003). <i>Property Testing and Geometry</i> (Vol. 119). Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn."},"supervisor":[{"first_name":"Friedhelm","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","id":"15523"}],"related_material":{"link":[{"relation":"confirmation","url":"http://digital.ub.uni-paderborn.de/ubpb/urn/urn:nbn:de:hbz:466-20020101281"}]},"date_created":"2020-08-28T13:11:56Z","department":[{"_id":"63"},{"_id":"26"}],"type":"dissertation","publication_identifier":{"isbn":["3-935433-28-X"]},"author":[{"first_name":"Christian","last_name":"Sohler","full_name":"Sohler, Christian"}],"status":"public","year":"2003","title":"Property Testing and Geometry","intvolume":"       119","date_updated":"2022-01-06T06:53:40Z","_id":"18573","series_title":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","language":[{"iso":"eng"}],"publisher":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","volume":119,"user_id":"5786"},{"date_created":"2020-04-09T07:27:56Z","type":"journal_article","department":[{"_id":"63"}],"publication":"it - Information Technology","citation":{"mla":"Meyer auf der Heide, Friedhelm. “Sonderforschungsbereich 376 Massive Parallelität: Algorithmen – Entwurfsmethoden – Anwendungen (Massively Parallel Computing: Algorithms – Design Methods – Applications).” <i>It - Information Technology</i>, 2003, doi:<a href=\"https://doi.org/10.1524/itit.45.2.108.19606\">10.1524/itit.45.2.108.19606</a>.","ama":"Meyer auf der Heide F. Sonderforschungsbereich 376 Massive Parallelität: Algorithmen – Entwurfsmethoden – Anwendungen (Massively Parallel Computing: Algorithms – Design Methods – Applications). <i>it - Information Technology</i>. 2003. doi:<a href=\"https://doi.org/10.1524/itit.45.2.108.19606\">10.1524/itit.45.2.108.19606</a>","bibtex":"@article{Meyer auf der Heide_2003, title={Sonderforschungsbereich 376 Massive Parallelität: Algorithmen – Entwurfsmethoden – Anwendungen (Massively Parallel Computing: Algorithms – Design Methods – Applications)}, DOI={<a href=\"https://doi.org/10.1524/itit.45.2.108.19606\">10.1524/itit.45.2.108.19606</a>}, journal={it - Information Technology}, author={Meyer auf der Heide, Friedhelm}, year={2003} }","apa":"Meyer auf der Heide, F. (2003). Sonderforschungsbereich 376 Massive Parallelität: Algorithmen – Entwurfsmethoden – Anwendungen (Massively Parallel Computing: Algorithms – Design Methods – Applications). <i>It - Information Technology</i>. <a href=\"https://doi.org/10.1524/itit.45.2.108.19606\">https://doi.org/10.1524/itit.45.2.108.19606</a>","ieee":"F. Meyer auf der Heide, “Sonderforschungsbereich 376 Massive Parallelität: Algorithmen – Entwurfsmethoden – Anwendungen (Massively Parallel Computing: Algorithms – Design Methods – Applications),” <i>it - Information Technology</i>, 2003.","short":"F. Meyer auf der Heide, It - Information Technology (2003).","chicago":"Meyer auf der Heide, Friedhelm. “Sonderforschungsbereich 376 Massive Parallelität: Algorithmen – Entwurfsmethoden – Anwendungen (Massively Parallel Computing: Algorithms – Design Methods – Applications).” <i>It - Information Technology</i>, 2003. <a href=\"https://doi.org/10.1524/itit.45.2.108.19606\">https://doi.org/10.1524/itit.45.2.108.19606</a>."},"abstract":[{"text":"<jats:title>Zusammenfassung</jats:title><jats:p>Vernetzte Systeme sind zu unverzichtbaren Bestandteilen unseres Umfelds geworden, zum Beispiel als Höchstleistungsrechner, als Kommunikations- und Informationssysteme oder als Planungs- und Steuerungskomponenten von Transport- und Produktionssystemen. Die ständig wachsende Komplexität solcher Systeme stellt Informatiker und Ingenieure vor immer neue Herausforderungen. In diesem Beitrag beschreibe ich die Zielsetzungen und die Struktur des SFB 376 Massive Parallelität: Algorithmen – Entwurfsmethoden – Anwendungen. Als Beispiel für unsere Arbeiten beschreibe ich einen algorithmisch orientierten Forschungszweig, in dem wir, ausgehend von theoretischen Problemen über effiziente Simulationen zwischen parallelen Rechenmodellen, Methoden, Techniken und Implementierungen entwickelt haben, die zu produktnahen Prototypen für die Speichervirtualisierung in verteilten Datenservern führen.</jats:p>","lang":"eng"}],"_id":"16481","language":[{"iso":"eng"}],"doi":"10.1524/itit.45.2.108.19606","user_id":"15415","status":"public","title":"Sonderforschungsbereich 376 Massive Parallelität: Algorithmen – Entwurfsmethoden – Anwendungen (Massively Parallel Computing: Algorithms – Design Methods – Applications)","year":"2003","author":[{"id":"15523","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","first_name":"Friedhelm"}],"publication_identifier":{"issn":["2196-7032","1611-2776"]},"date_updated":"2022-01-06T06:52:50Z","publication_status":"published"},{"citation":{"mla":"Juurlink, Bernhardus, et al. “Optimal Broadcast on Parallel Locality Models.” <i>Journal of Discrete Algorithms</i>, 2003, pp. 151–66, doi:<a href=\"https://doi.org/10.1016/s1570-8667(03)00023-6\">10.1016/s1570-8667(03)00023-6</a>.","ama":"Juurlink B, Kolman P, Meyer auf der Heide F, Rieping I. Optimal broadcast on parallel locality models. <i>Journal of Discrete Algorithms</i>. 2003:151-166. doi:<a href=\"https://doi.org/10.1016/s1570-8667(03)00023-6\">10.1016/s1570-8667(03)00023-6</a>","bibtex":"@article{Juurlink_Kolman_Meyer auf der Heide_Rieping_2003, title={Optimal broadcast on parallel locality models}, DOI={<a href=\"https://doi.org/10.1016/s1570-8667(03)00023-6\">10.1016/s1570-8667(03)00023-6</a>}, journal={Journal of Discrete Algorithms}, author={Juurlink, Bernhardus and Kolman, Petr and Meyer auf der Heide, Friedhelm and Rieping, Ingo}, year={2003}, pages={151–166} }","apa":"Juurlink, B., Kolman, P., Meyer auf der Heide, F., &#38; Rieping, I. (2003). Optimal broadcast on parallel locality models. <i>Journal of Discrete Algorithms</i>, 151–166. <a href=\"https://doi.org/10.1016/s1570-8667(03)00023-6\">https://doi.org/10.1016/s1570-8667(03)00023-6</a>","ieee":"B. Juurlink, P. Kolman, F. Meyer auf der Heide, and I. Rieping, “Optimal broadcast on parallel locality models,” <i>Journal of Discrete Algorithms</i>, pp. 151–166, 2003.","short":"B. Juurlink, P. Kolman, F. Meyer auf der Heide, I. Rieping, Journal of Discrete Algorithms (2003) 151–166.","chicago":"Juurlink, Bernhardus, Petr Kolman, Friedhelm Meyer auf der Heide, and Ingo Rieping. “Optimal Broadcast on Parallel Locality Models.” <i>Journal of Discrete Algorithms</i>, 2003, 151–66. <a href=\"https://doi.org/10.1016/s1570-8667(03)00023-6\">https://doi.org/10.1016/s1570-8667(03)00023-6</a>."},"publication":"Journal of Discrete Algorithms","department":[{"_id":"63"}],"type":"journal_article","date_created":"2020-04-09T07:33:09Z","publication_status":"published","date_updated":"2022-01-06T06:52:50Z","publication_identifier":{"issn":["1570-8667"]},"author":[{"full_name":"Juurlink, Bernhardus","last_name":"Juurlink","first_name":"Bernhardus"},{"full_name":"Kolman, Petr","last_name":"Kolman","first_name":"Petr"},{"full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","first_name":"Friedhelm","id":"15523"},{"full_name":"Rieping, Ingo","first_name":"Ingo","last_name":"Rieping"}],"year":"2003","title":"Optimal broadcast on parallel locality models","status":"public","user_id":"15415","doi":"10.1016/s1570-8667(03)00023-6","_id":"16482","language":[{"iso":"eng"}],"page":"151-166"},{"date_created":"2020-04-09T07:41:53Z","department":[{"_id":"63"}],"type":"conference_editor","citation":{"ama":"Rosenberg AL, Meyer auf der Heide F, eds. <i>Proceedings of the Fifteenth Annual ACM Symposium on Parallel Algorithms and Architectures  - SPAA ’03</i>.; 2003. doi:<a href=\"https://doi.org/10.1145/777412\">10.1145/777412</a>","short":"A.L. Rosenberg, F. Meyer auf der Heide, eds., Proceedings of the Fifteenth Annual ACM Symposium on Parallel Algorithms and Architectures  - SPAA ’03, 2003.","chicago":"Rosenberg, Arnold L., and Friedhelm Meyer auf der Heide, eds. <i>Proceedings of the Fifteenth Annual ACM Symposium on Parallel Algorithms and Architectures  - SPAA ’03</i>, 2003. <a href=\"https://doi.org/10.1145/777412\">https://doi.org/10.1145/777412</a>.","bibtex":"@book{Rosenberg_Meyer auf der Heide_2003, title={Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures  - SPAA ’03}, DOI={<a href=\"https://doi.org/10.1145/777412\">10.1145/777412</a>}, year={2003} }","mla":"Rosenberg, Arnold L., and Friedhelm Meyer auf der Heide, editors. <i>Proceedings of the Fifteenth Annual ACM Symposium on Parallel Algorithms and Architectures  - SPAA ’03</i>. 2003, doi:<a href=\"https://doi.org/10.1145/777412\">10.1145/777412</a>.","apa":"Rosenberg, A. L., &#38; Meyer auf der Heide, F. (Eds.). (2003). <i>Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures  - SPAA ’03</i>. <a href=\"https://doi.org/10.1145/777412\">https://doi.org/10.1145/777412</a>","ieee":"A. L. Rosenberg and F. Meyer auf der Heide, Eds., <i>Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures  - SPAA ’03</i>. 2003."},"_id":"16484","language":[{"iso":"eng"}],"editor":[{"full_name":"Rosenberg, Arnold L.","last_name":"Rosenberg","first_name":"Arnold L."},{"full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","first_name":"Friedhelm","id":"15523"}],"user_id":"15415","doi":"10.1145/777412","publication_identifier":{"isbn":["1581136617"]},"year":"2003","title":"Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures  - SPAA '03","status":"public","publication_status":"published","date_updated":"2022-01-06T06:52:50Z"},{"type":"conference","department":[{"_id":"63"}],"date_created":"2020-04-17T08:31:57Z","publication":"28th Annual IEEE International Conference on Local Computer Networks","citation":{"ieee":"O. Bonorden <i>et al.</i>, “A holistic methodology for network processor design,” in <i>28th Annual IEEE International Conference on Local Computer Networks</i>, 2003.","apa":"Bonorden, O., Bruls, N., Kastens, U., Le, D. K., Meyer auf der Heide, F., Niemann, J.-C., … Thies, M. (2003). A holistic methodology for network processor design. In <i>28th Annual IEEE International Conference on Local Computer Networks</i>. <a href=\"https://doi.org/10.1109/LCN.2003.1243185\">https://doi.org/10.1109/LCN.2003.1243185</a>","chicago":"Bonorden, Olaf, N. Bruls, U. Kastens, D. K. Le, Friedhelm Meyer auf der Heide, J.-C. Niemann, M. Porrmann, U. Rückert, A. Slowik, and M. Thies. “A Holistic Methodology for Network Processor Design.” In <i>28th Annual IEEE International Conference on Local Computer Networks</i>, 2003. <a href=\"https://doi.org/10.1109/LCN.2003.1243185\">https://doi.org/10.1109/LCN.2003.1243185</a>.","short":"O. Bonorden, N. Bruls, U. Kastens, D.K. Le, F. Meyer auf der Heide, J.-C. Niemann, M. Porrmann, U. Rückert, A. Slowik, M. Thies, in: 28th Annual IEEE International Conference on Local Computer Networks, 2003.","mla":"Bonorden, Olaf, et al. “A Holistic Methodology for Network Processor Design.” <i>28th Annual IEEE International Conference on Local Computer Networks</i>, 2003, doi:<a href=\"https://doi.org/10.1109/LCN.2003.1243185\">10.1109/LCN.2003.1243185</a>.","bibtex":"@inproceedings{Bonorden_Bruls_Kastens_Le_Meyer auf der Heide_Niemann_Porrmann_Rückert_Slowik_Thies_2003, title={A holistic methodology for network processor design}, DOI={<a href=\"https://doi.org/10.1109/LCN.2003.1243185\">10.1109/LCN.2003.1243185</a>}, booktitle={28th Annual IEEE International Conference on Local Computer Networks}, author={Bonorden, Olaf and Bruls, N. and Kastens, U. and Le, D. K. and Meyer auf der Heide, Friedhelm and Niemann, J.-C. and Porrmann, M. and Rückert, U. and Slowik, A. and Thies, M.}, year={2003} }","ama":"Bonorden O, Bruls N, Kastens U, et al. A holistic methodology for network processor design. In: <i>28th Annual IEEE International Conference on Local Computer Networks</i>. ; 2003. doi:<a href=\"https://doi.org/10.1109/LCN.2003.1243185\">10.1109/LCN.2003.1243185</a>"},"user_id":"15415","doi":"10.1109/LCN.2003.1243185","_id":"16720","language":[{"iso":"eng"}],"date_updated":"2022-01-06T06:52:55Z","title":"A holistic methodology for network processor design","year":"2003","status":"public","author":[{"first_name":"Olaf","last_name":"Bonorden","full_name":"Bonorden, Olaf"},{"last_name":"Bruls","first_name":"N.","full_name":"Bruls, N."},{"full_name":"Kastens, U.","first_name":"U.","last_name":"Kastens"},{"full_name":"Le, D. K.","first_name":"D. K.","last_name":"Le"},{"full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm","last_name":"Meyer auf der Heide","id":"15523"},{"full_name":"Niemann, J.-C.","last_name":"Niemann","first_name":"J.-C."},{"first_name":"M.","last_name":"Porrmann","full_name":"Porrmann, M."},{"full_name":"Rückert, U.","last_name":"Rückert","first_name":"U."},{"full_name":"Slowik, A.","first_name":"A.","last_name":"Slowik"},{"last_name":"Thies","first_name":"M.","full_name":"Thies, M."}]},{"citation":{"short":"O. Bonorden, F. Meyer auf der Heide, R. Wanka, in: Int. Conf. on Parallel and Distributed Processing Techniques and Applications (PDPTA), 2002, pp. 2202–2208.","chicago":"Bonorden, Olaf, Friedhelm Meyer auf der Heide, and Rolf Wanka. “Composition of Efficient Nested BSP Algorithms: Minimum Spanning Tree Computation as an Instructive Example.” In <i>Int. Conf. on Parallel and Distributed Processing Techniques and Applications (PDPTA)</i>, 2202–8, 2002.","ieee":"O. Bonorden, F. Meyer auf der Heide, and R. Wanka, “Composition of Efficient Nested BSP Algorithms: Minimum Spanning Tree Computation as an Instructive Example,” in <i>Int. Conf. on Parallel and Distributed Processing Techniques and Applications (PDPTA)</i>, 2002, pp. 2202–2208.","apa":"Bonorden, O., Meyer auf der Heide, F., &#38; Wanka, R. (2002). Composition of Efficient Nested BSP Algorithms: Minimum Spanning Tree Computation as an Instructive Example. In <i>Int. Conf. on Parallel and Distributed Processing Techniques and Applications (PDPTA)</i> (pp. 2202–2208).","bibtex":"@inproceedings{Bonorden_Meyer auf der Heide_Wanka_2002, title={Composition of Efficient Nested BSP Algorithms: Minimum Spanning Tree Computation as an Instructive Example}, booktitle={Int. Conf. on Parallel and Distributed Processing Techniques and Applications (PDPTA)}, author={Bonorden, Olaf and Meyer auf der Heide, Friedhelm and Wanka, Rolf}, year={2002}, pages={2202–2208} }","ama":"Bonorden O, Meyer auf der Heide F, Wanka R. Composition of Efficient Nested BSP Algorithms: Minimum Spanning Tree Computation as an Instructive Example. In: <i>Int. Conf. on Parallel and Distributed Processing Techniques and Applications (PDPTA)</i>. ; 2002:2202-2208.","mla":"Bonorden, Olaf, et al. “Composition of Efficient Nested BSP Algorithms: Minimum Spanning Tree Computation as an Instructive Example.” <i>Int. Conf. on Parallel and Distributed Processing Techniques and Applications (PDPTA)</i>, 2002, pp. 2202–08."},"publication":"Int. Conf. on Parallel and Distributed Processing Techniques and Applications (PDPTA)","department":[{"_id":"63"}],"type":"conference","date_created":"2020-09-28T10:49:50Z","date_updated":"2022-01-06T06:54:10Z","author":[{"first_name":"Olaf","last_name":"Bonorden","full_name":"Bonorden, Olaf"},{"id":"15523","last_name":"Meyer auf der Heide","first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm"},{"full_name":"Wanka, Rolf","last_name":"Wanka","first_name":"Rolf"}],"title":"Composition of Efficient Nested BSP Algorithms: Minimum Spanning Tree Computation as an Instructive Example","year":"2002","status":"public","user_id":"15415","_id":"19727","language":[{"iso":"eng"}],"page":"2202-2208"},{"department":[{"_id":"63"}],"type":"conference","place":"Berlin, Heidelberg","date_created":"2020-10-02T11:16:31Z","citation":{"mla":"Wanka, Rolf. “Any Load-Balancing Regimen for Evolving Tree Computations on Circulant Graphs Is Asymptotically Optimal.” <i>Proc. Workshop on Graph-Theoretic Concepts in Computer Science (WG)</i>, 2002, pp. 413–20, doi:<a href=\"https://doi.org/10.1007/3-540-36379-3_36\">10.1007/3-540-36379-3_36</a>.","ama":"Wanka R. Any Load-Balancing Regimen for Evolving Tree Computations on Circulant Graphs Is Asymptotically Optimal. In: <i>Proc. Workshop on Graph-Theoretic Concepts in Computer Science (WG)</i>. Berlin, Heidelberg; 2002:413-420. doi:<a href=\"https://doi.org/10.1007/3-540-36379-3_36\">10.1007/3-540-36379-3_36</a>","bibtex":"@inproceedings{Wanka_2002, place={Berlin, Heidelberg}, title={Any Load-Balancing Regimen for Evolving Tree Computations on Circulant Graphs Is Asymptotically Optimal}, DOI={<a href=\"https://doi.org/10.1007/3-540-36379-3_36\">10.1007/3-540-36379-3_36</a>}, booktitle={Proc. Workshop on Graph-Theoretic Concepts in Computer Science (WG)}, author={Wanka, Rolf}, year={2002}, pages={413–420} }","apa":"Wanka, R. (2002). Any Load-Balancing Regimen for Evolving Tree Computations on Circulant Graphs Is Asymptotically Optimal. In <i>Proc. Workshop on Graph-Theoretic Concepts in Computer Science (WG)</i> (pp. 413–420). Berlin, Heidelberg. <a href=\"https://doi.org/10.1007/3-540-36379-3_36\">https://doi.org/10.1007/3-540-36379-3_36</a>","ieee":"R. Wanka, “Any Load-Balancing Regimen for Evolving Tree Computations on Circulant Graphs Is Asymptotically Optimal,” in <i>Proc. Workshop on Graph-Theoretic Concepts in Computer Science (WG)</i>, 2002, pp. 413–420.","short":"R. Wanka, in: Proc. Workshop on Graph-Theoretic Concepts in Computer Science (WG), Berlin, Heidelberg, 2002, pp. 413–420.","chicago":"Wanka, Rolf. “Any Load-Balancing Regimen for Evolving Tree Computations on Circulant Graphs Is Asymptotically Optimal.” In <i>Proc. Workshop on Graph-Theoretic Concepts in Computer Science (WG)</i>, 413–20. Berlin, Heidelberg, 2002. <a href=\"https://doi.org/10.1007/3-540-36379-3_36\">https://doi.org/10.1007/3-540-36379-3_36</a>."},"publication":"Proc. Workshop on Graph-Theoretic Concepts in Computer Science (WG)","doi":"10.1007/3-540-36379-3_36","user_id":"15415","language":[{"iso":"eng"}],"_id":"19850","page":"413-420","date_updated":"2022-01-06T06:54:13Z","publication_status":"published","publication_identifier":{"isbn":["9783540003311","9783540363798"],"issn":["0302-9743"]},"author":[{"full_name":"Wanka, Rolf","first_name":"Rolf","last_name":"Wanka"}],"title":"Any Load-Balancing Regimen for Evolving Tree Computations on Circulant Graphs Is Asymptotically Optimal","year":"2002","status":"public"},{"type":"conference","department":[{"_id":"63"}],"date_created":"2020-10-05T09:51:08Z","abstract":[{"text":"We present a new and easy to use framework for navigating through scenes of arbitrary complexity and topology. In the preprocessing, images for discrete viewpoints and viewing directions are rendered and stored on an external volume. During navigation each image can be displayed within a very short time by loading it from the volume. For acceleration, our prefetching strategy loads possibly needed images for the next few frames if the viewer takes a break. The measurements show that we achieve interactive frame rates, whereby the difference between the minimal and maximal display time is very small. Our system works well with scenes modelled by polygons, but also digital photos can easily be used for describing a 3D scene.","lang":"eng"}],"publication":"Proc. of 4. GI-Informatiktage","citation":{"short":"J. Klein, J. Krokowski, N. Cuntz, in: Proc. of 4. GI-Informatiktage, 2002, pp. 224–229.","chicago":"Klein, Jan, Jens Krokowski, and Nicolas Cuntz. “Realtime Navigation in Highly Complex 3D-Scenes Using JPEG Compression.” In <i>Proc. of 4. GI-Informatiktage</i>, 224–29, 2002.","apa":"Klein, J., Krokowski, J., &#38; Cuntz, N. (2002). Realtime Navigation in Highly Complex 3D-Scenes Using JPEG Compression. In <i>Proc. of 4. GI-Informatiktage</i> (pp. 224–229).","ieee":"J. Klein, J. Krokowski, and N. Cuntz, “Realtime Navigation in Highly Complex 3D-Scenes Using JPEG Compression,” in <i>Proc. of 4. GI-Informatiktage</i>, 2002, pp. 224–229.","ama":"Klein J, Krokowski J, Cuntz N. Realtime Navigation in Highly Complex 3D-Scenes Using JPEG Compression. In: <i>Proc. of 4. GI-Informatiktage</i>. ; 2002:224-229.","bibtex":"@inproceedings{Klein_Krokowski_Cuntz_2002, title={Realtime Navigation in Highly Complex 3D-Scenes Using JPEG Compression}, booktitle={Proc. of 4. GI-Informatiktage}, author={Klein, Jan and Krokowski, Jens and Cuntz, Nicolas}, year={2002}, pages={224–229} }","mla":"Klein, Jan, et al. “Realtime Navigation in Highly Complex 3D-Scenes Using JPEG Compression.” <i>Proc. of 4. GI-Informatiktage</i>, 2002, pp. 224–29."},"user_id":"15415","page":"224-229","language":[{"iso":"eng"}],"_id":"19873","date_updated":"2022-01-06T06:54:14Z","title":"Realtime Navigation in Highly Complex 3D-Scenes Using JPEG Compression","status":"public","year":"2002","author":[{"first_name":"Jan","last_name":"Klein","full_name":"Klein, Jan"},{"full_name":"Krokowski, Jens","first_name":"Jens","last_name":"Krokowski"},{"full_name":"Cuntz, Nicolas","last_name":"Cuntz","first_name":"Nicolas"}]},{"abstract":[{"lang":"eng","text":"We  define  here  a  distributed  abstract state  machine (DASM)  [7]  of \r\nthe network or routing layer of mobile ad hoc networks [13]. Such networks re-\r\nquire routing strategies substantially different from those used in static commu-\r\nnication  networks,  since  storing  and  updating  large  routing  tables  at  mobile \r\nhosts  would  congest  the  network  with  administration  packets  very  fast.  In  [1], \r\nthe  hypercubic  location  service  is  presented,  which  considers  a  very  strong \r\ndefinition  of  fault-tolerance  thereby  improving  state-of-the-art  ad  hoc  routing \r\nprotocols in several respects. Our goal in modeling the protocols for the distrib-\r\nuted location service and the position based routing is twofold. First, we support \r\nthe  definition  and  validation  of  wireless  communication  protocols  and  imple-\r\nmentations based thereon. Second, we feel that the abstract computation model \r\nnaturally reflects the layering principle of communication architectures in com-\r\nbination with an uncompromisingly local view of the application domain. Thus \r\nwe can identify fundamental semantic concepts, such as concurrency, reactivity \r\nand  asynchronism,  directly  with  the  related  concepts  as  imposed  by  the  given \r\napplication context. "}],"citation":{"apa":"Benczúr, A., Glässer, U., &#38; Lukovszki, T. (2002). Formal Description of a Distributed Location Service for Mobile Ad Hoc Networks. <i>Proc. of 10th International Workshop on Abstract State Machines, LNCS</i>.","ieee":"A.  Benczúr, U. Glässer, and T. Lukovszki, “Formal Description of a Distributed Location Service for Mobile Ad Hoc Networks,” <i>Proc. of 10th International Workshop on Abstract State Machines, LNCS</i>, 2002.","short":"A.  Benczúr, U. Glässer, T. Lukovszki, Proc. of 10th International Workshop on Abstract State Machines, LNCS (2002).","chicago":"Benczúr, András, Uwe Glässer, and Tamás Lukovszki. “Formal Description of a Distributed Location Service for Mobile Ad Hoc Networks.” <i>Proc. of 10th International Workshop on Abstract State Machines, LNCS</i>, 2002.","mla":"Benczúr, András, et al. “Formal Description of a Distributed Location Service for Mobile Ad Hoc Networks.” <i>Proc. of 10th International Workshop on Abstract State Machines, LNCS</i>, 2002.","ama":"Benczúr A, Glässer U, Lukovszki T. Formal Description of a Distributed Location Service for Mobile Ad Hoc Networks. <i>Proc of 10th International Workshop on Abstract State Machines, LNCS</i>. Published online 2002.","bibtex":"@article{ Benczúr_Glässer_Lukovszki_2002, title={Formal Description of a Distributed Location Service for Mobile Ad Hoc Networks}, journal={Proc. of 10th International Workshop on Abstract State Machines, LNCS}, author={ Benczúr, András and Glässer, Uwe and Lukovszki, Tamás}, year={2002} }"},"publication":"Proc. of 10th International Workshop on Abstract State Machines, LNCS","file_date_updated":"2021-09-14T09:09:28Z","department":[{"_id":"63"}],"type":"journal_article","date_created":"2021-09-14T08:51:39Z","file":[{"relation":"main_file","date_updated":"2021-09-14T09:09:28Z","file_name":"asm03.pdf","access_level":"closed","file_size":162215,"file_id":"24337","content_type":"application/pdf","success":1,"creator":"koala","date_created":"2021-09-14T09:09:28Z"}],"has_accepted_license":"1","date_updated":"2022-01-06T06:56:18Z","publication_status":"published","author":[{"last_name":" Benczúr","first_name":"András","full_name":" Benczúr, András"},{"first_name":"Uwe","last_name":"Glässer","full_name":"Glässer, Uwe"},{"first_name":"Tamás","last_name":"Lukovszki","full_name":"Lukovszki, Tamás"}],"status":"public","title":"Formal Description of a Distributed Location Service for Mobile Ad Hoc Networks","year":"2002","ddc":["000"],"user_id":"15415","_id":"24336","language":[{"iso":"eng"}]},{"place":"Paderborn, Germany","date_created":"2021-09-14T09:15:57Z","type":"conference","department":[{"_id":"63"}],"publication":"Proceedings of the 8th International Euro-Par Conference","citation":{"mla":"Grünewald, Matthias, et al. “Distributed Maintenance of Resource Efficient Wireless Network Topologies.” <i>Proceedings of the 8th International Euro-Par Conference</i>, 2002, doi:<a href=\"https://doi.org/10.1007/3-540-45706-2_134\">10.1007/3-540-45706-2_134</a>.","bibtex":"@inproceedings{Grünewald_Lukovszki_Schindelhauer_Volbert_2002, place={Paderborn, Germany}, title={Distributed Maintenance of Resource Efficient Wireless Network Topologies}, DOI={<a href=\"https://doi.org/10.1007/3-540-45706-2_134\">10.1007/3-540-45706-2_134</a>}, booktitle={Proceedings of the 8th International Euro-Par Conference}, author={Grünewald, Matthias and Lukovszki, Tamás and Schindelhauer, Christian and Volbert, Klaus}, year={2002} }","ama":"Grünewald M, Lukovszki T, Schindelhauer C, Volbert K. Distributed Maintenance of Resource Efficient Wireless Network Topologies. In: <i>Proceedings of the 8th International Euro-Par Conference</i>. ; 2002. doi:<a href=\"https://doi.org/10.1007/3-540-45706-2_134\">10.1007/3-540-45706-2_134</a>","ieee":"M. Grünewald, T. Lukovszki, C. Schindelhauer, and K. Volbert, “Distributed Maintenance of Resource Efficient Wireless Network Topologies,” 2002, doi: <a href=\"https://doi.org/10.1007/3-540-45706-2_134\">10.1007/3-540-45706-2_134</a>.","apa":"Grünewald, M., Lukovszki, T., Schindelhauer, C., &#38; Volbert, K. (2002). Distributed Maintenance of Resource Efficient Wireless Network Topologies. <i>Proceedings of the 8th International Euro-Par Conference</i>. <a href=\"https://doi.org/10.1007/3-540-45706-2_134\">https://doi.org/10.1007/3-540-45706-2_134</a>","short":"M. Grünewald, T. Lukovszki, C. Schindelhauer, K. Volbert, in: Proceedings of the 8th International Euro-Par Conference, Paderborn, Germany, 2002.","chicago":"Grünewald, Matthias, Tamás Lukovszki, Christian Schindelhauer, and Klaus Volbert. “Distributed Maintenance of Resource Efficient Wireless Network Topologies.” In <i>Proceedings of the 8th International Euro-Par Conference</i>. Paderborn, Germany, 2002. <a href=\"https://doi.org/10.1007/3-540-45706-2_134\">https://doi.org/10.1007/3-540-45706-2_134</a>."},"language":[{"iso":"eng"}],"_id":"24338","doi":"10.1007/3-540-45706-2_134","user_id":"15415","year":"2002","status":"public","title":"Distributed Maintenance of Resource Efficient Wireless Network Topologies","publication_identifier":{"issn":["0302-9743"]},"author":[{"last_name":"Grünewald","first_name":"Matthias","full_name":"Grünewald, Matthias"},{"last_name":"Lukovszki","first_name":"Tamás","full_name":"Lukovszki, Tamás"},{"first_name":"Christian","last_name":"Schindelhauer","full_name":"Schindelhauer, Christian"},{"full_name":"Volbert, Klaus","last_name":"Volbert","first_name":"Klaus"}],"date_updated":"2022-01-06T06:56:18Z","publication_status":"published"},{"date_created":"2021-10-18T15:45:20Z","type":"conference","department":[{"_id":"63"},{"_id":"26"}],"publication":"Proceedings 10th Euromicro Workshop on Parallel, Distributed and Network-based Processing","citation":{"bibtex":"@inproceedings{Volbert_2002, title={A simulation environment for ad hoc networks using sector subdivision}, DOI={<a href=\"https://doi.org/10.1109/empdp.2002.994324\">10.1109/empdp.2002.994324</a>}, booktitle={Proceedings 10th Euromicro Workshop on Parallel, Distributed and Network-based Processing}, author={Volbert, Klaus}, year={2002} }","ama":"Volbert K. A simulation environment for ad hoc networks using sector subdivision. In: <i>Proceedings 10th Euromicro Workshop on Parallel, Distributed and Network-Based Processing</i>. ; 2002. doi:<a href=\"https://doi.org/10.1109/empdp.2002.994324\">10.1109/empdp.2002.994324</a>","mla":"Volbert, Klaus. “A Simulation Environment for Ad Hoc Networks Using Sector Subdivision.” <i>Proceedings 10th Euromicro Workshop on Parallel, Distributed and Network-Based Processing</i>, 2002, doi:<a href=\"https://doi.org/10.1109/empdp.2002.994324\">10.1109/empdp.2002.994324</a>.","short":"K. Volbert, in: Proceedings 10th Euromicro Workshop on Parallel, Distributed and Network-Based Processing, 2002.","chicago":"Volbert, Klaus. “A Simulation Environment for Ad Hoc Networks Using Sector Subdivision.” In <i>Proceedings 10th Euromicro Workshop on Parallel, Distributed and Network-Based Processing</i>, 2002. <a href=\"https://doi.org/10.1109/empdp.2002.994324\">https://doi.org/10.1109/empdp.2002.994324</a>.","ieee":"K. Volbert, “A simulation environment for ad hoc networks using sector subdivision,” 2002, doi: <a href=\"https://doi.org/10.1109/empdp.2002.994324\">10.1109/empdp.2002.994324</a>.","apa":"Volbert, K. (2002). A simulation environment for ad hoc networks using sector subdivision. <i>Proceedings 10th Euromicro Workshop on Parallel, Distributed and Network-Based Processing</i>. <a href=\"https://doi.org/10.1109/empdp.2002.994324\">https://doi.org/10.1109/empdp.2002.994324</a>"},"_id":"26412","language":[{"iso":"eng"}],"user_id":"15415","doi":"10.1109/empdp.2002.994324","year":"2002","status":"public","title":"A simulation environment for ad hoc networks using sector subdivision","author":[{"full_name":"Volbert, Klaus","first_name":"Klaus","last_name":"Volbert"}],"publication_status":"published","date_updated":"2022-01-06T06:57:20Z"},{"citation":{"chicago":"Brinkmann, André, Kay Salzwedel, and Christian Scheideler. “Compact, Adaptive Placement Schemes for Non-Uniform Requirements.” In <i>SPAA</i>, 53--62, 2002.","short":"A. Brinkmann, K. Salzwedel, C. Scheideler, in: SPAA, 2002, pp. 53--62.","ieee":"A. Brinkmann, K. Salzwedel, and C. Scheideler, “Compact, adaptive placement schemes for non-uniform requirements,” in <i>SPAA</i>, 2002, pp. 53--62.","apa":"Brinkmann, A., Salzwedel, K., &#38; Scheideler, C. (2002). Compact, adaptive placement schemes for non-uniform requirements. In <i>SPAA</i> (pp. 53--62).","bibtex":"@inproceedings{Brinkmann_Salzwedel_Scheideler_2002, title={Compact, adaptive placement schemes for non-uniform requirements}, booktitle={SPAA}, author={Brinkmann, André and Salzwedel, Kay and Scheideler, Christian}, year={2002}, pages={53--62} }","ama":"Brinkmann A, Salzwedel K, Scheideler C. Compact, adaptive placement schemes for non-uniform requirements. In: <i>SPAA</i>. ; 2002:53--62.","mla":"Brinkmann, André, et al. “Compact, Adaptive Placement Schemes for Non-Uniform Requirements.” <i>SPAA</i>, 2002, pp. 53--62."},"publication":"SPAA","file_date_updated":"2018-04-12T09:02:22Z","date_created":"2018-04-03T05:44:56Z","file":[{"date_created":"2018-04-12T09:02:22Z","creator":"florida","content_type":"application/pdf","file_id":"2305","access_level":"open_access","file_size":123373,"file_name":"BSS-SPAA-02.pdf","date_updated":"2018-04-12T09:02:22Z","relation":"main_file"}],"oa":"1","department":[{"_id":"79"},{"_id":"63"}],"type":"conference","author":[{"first_name":"André","last_name":"Brinkmann","full_name":"Brinkmann, André"},{"full_name":"Salzwedel, Kay","last_name":"Salzwedel","first_name":"Kay"},{"full_name":"Scheideler, Christian","last_name":"Scheideler","first_name":"Christian","id":"20792"}],"status":"public","year":"2002","title":"Compact, adaptive placement schemes for non-uniform requirements","has_accepted_license":"1","date_updated":"2022-01-06T06:54:56Z","urn":"21366","_id":"2136","language":[{"iso":"eng"}],"page":"53--62","ddc":["040"],"user_id":"14955"}]