[{"citation":{"mla":"Lukovszki, Tamás. “New Results on Fault Tolerant Geometric Spanners.” <i>Proceedings of the 6th Workshop on Algorithms an Data Structures (WADS’99), LNCS</i>, 1999, pp. 193–204, doi:<a href=\"https://doi.org/10.1007/3-540-48447-7_20\">10.1007/3-540-48447-7_20</a>.","ama":"Lukovszki T. New Results on Fault Tolerant Geometric Spanners. In: <i>Proceedings of the 6th Workshop on Algorithms an Data Structures (WADS’99), LNCS</i>. ; 1999:193-204. doi:<a href=\"https://doi.org/10.1007/3-540-48447-7_20\">10.1007/3-540-48447-7_20</a>","bibtex":"@inproceedings{Lukovszki_1999, title={New Results on Fault Tolerant Geometric Spanners}, DOI={<a href=\"https://doi.org/10.1007/3-540-48447-7_20\">10.1007/3-540-48447-7_20</a>}, booktitle={Proceedings of the 6th Workshop on Algorithms an Data Structures (WADS’99), LNCS}, author={Lukovszki, Tamás}, year={1999}, pages={193–204} }","apa":"Lukovszki, T. (1999). New Results on Fault Tolerant Geometric Spanners. In <i>Proceedings of the 6th Workshop on Algorithms an Data Structures (WADS’99), LNCS</i> (pp. 193–204). <a href=\"https://doi.org/10.1007/3-540-48447-7_20\">https://doi.org/10.1007/3-540-48447-7_20</a>","ieee":"T. Lukovszki, “New Results on Fault Tolerant Geometric Spanners,” in <i>Proceedings of the 6th Workshop on Algorithms an Data Structures (WADS’99), LNCS</i>, 1999, pp. 193–204.","short":"T. Lukovszki, in: Proceedings of the 6th Workshop on Algorithms an Data Structures (WADS’99), LNCS, 1999, pp. 193–204.","chicago":"Lukovszki, Tamás. “New Results on Fault Tolerant Geometric Spanners.” In <i>Proceedings of the 6th Workshop on Algorithms an Data Structures (WADS’99), LNCS</i>, 193–204, 1999. <a href=\"https://doi.org/10.1007/3-540-48447-7_20\">https://doi.org/10.1007/3-540-48447-7_20</a>."},"publication":"Proceedings of the 6th Workshop on Algorithms an Data Structures (WADS'99), LNCS","abstract":[{"text":"We investigate the problem of constructing spanners for a given set of points that are tolerant for edge/vertex faults. Let S be a set of $n$ points in the d-dimensional space and let k be an integer number. A k-edge/vertex fault tolerant spanner for S has the property that after the deletion of k arbitrary edges/vertices each pair of points in the remaining graph is still connected by a short path.<br><br>Recently it was shown that for each set S of n points there exists a k-edge/vertex fault tolerant spanner with O(k^2 n) edges which can be constructed in O(n log n + k^2 n) time. Furthermore, it was shown that for each set S of n points there exists a k-edge/vertex fault tolerant spanner whose degree is bouned by O(c^k+1) for some constant c.<br><br>Our first contribution is a construction of a k-vertex fault tolerant spanner with O(kn) edges which is a tight bound. The computation takes O(n log^d-1 n + k n log log n) time. Then we show that the same k-vertex fault tolerant spanner is also k-edge fault tolerant. Thereafter, we construct a k-vertex fault tolerant spanner with O(k^2 n) edges whose degree is bounded by O(k^2). Finally, we give a more natural but stronger definition of k-edge fault tolerance which not necessarily can be satisfied if one allows only simple edges between the points of S. We investigate the question whether Steiner points help. We answer this question affirmatively and prove Theta(kn) bounds on the number of Steiner points and on the number of edges in such spanners.","lang":"eng"}],"date_created":"2020-09-03T13:03:45Z","department":[{"_id":"63"}],"type":"conference","author":[{"full_name":"Lukovszki, Tamás","first_name":"Tamás","last_name":"Lukovszki"}],"publication_identifier":{"isbn":["9783540662792","9783540484479"],"issn":["0302-9743"]},"title":"New Results on Fault Tolerant Geometric Spanners","year":"1999","status":"public","publication_status":"published","date_updated":"2022-01-06T06:53:55Z","language":[{"iso":"eng"}],"_id":"18959","page":"193-204","user_id":"15415","doi":"10.1007/3-540-48447-7_20"},{"date_created":"2020-09-03T14:27:14Z","type":"conference","department":[{"_id":"63"}],"publication":"Proceedings of the eleventh annual ACM symposium on Parallel algorithms and architectures  - SPAA '99","citation":{"bibtex":"@inproceedings{Krick_Meyer auf der Heide_Räcke_Vöcking_Westermann_1999, title={Data management in networks: experimental evaluation of a provably good strategy}, DOI={<a href=\"https://doi.org/10.1145/305619.305637\">10.1145/305619.305637</a>}, booktitle={Proceedings of the eleventh annual ACM symposium on Parallel algorithms and architectures  - SPAA ’99}, author={Krick, Christof and Meyer auf der Heide, Friedhelm and Räcke, Harald and Vöcking, Berthold and Westermann, Matthias}, year={1999}, pages={165–174} }","ama":"Krick C, Meyer auf der Heide F, Räcke H, Vöcking B, Westermann M. Data management in networks: experimental evaluation of a provably good strategy. In: <i>Proceedings of the Eleventh Annual ACM Symposium on Parallel Algorithms and Architectures  - SPAA ’99</i>. ; 1999:165-174. doi:<a href=\"https://doi.org/10.1145/305619.305637\">10.1145/305619.305637</a>","mla":"Krick, Christof, et al. “Data Management in Networks: Experimental Evaluation of a Provably Good Strategy.” <i>Proceedings of the Eleventh Annual ACM Symposium on Parallel Algorithms and Architectures  - SPAA ’99</i>, 1999, pp. 165–74, doi:<a href=\"https://doi.org/10.1145/305619.305637\">10.1145/305619.305637</a>.","short":"C. Krick, F. Meyer auf der Heide, H. Räcke, B. Vöcking, M. Westermann, in: Proceedings of the Eleventh Annual ACM Symposium on Parallel Algorithms and Architectures  - SPAA ’99, 1999, pp. 165–174.","chicago":"Krick, Christof, Friedhelm Meyer auf der Heide, Harald Räcke, Berthold Vöcking, and Matthias Westermann. “Data Management in Networks: Experimental Evaluation of a Provably Good Strategy.” In <i>Proceedings of the Eleventh Annual ACM Symposium on Parallel Algorithms and Architectures  - SPAA ’99</i>, 165–74, 1999. <a href=\"https://doi.org/10.1145/305619.305637\">https://doi.org/10.1145/305619.305637</a>.","ieee":"C. Krick, F. Meyer auf der Heide, H. Räcke, B. Vöcking, and M. Westermann, “Data management in networks: experimental evaluation of a provably good strategy,” in <i>Proceedings of the eleventh annual ACM symposium on Parallel algorithms and architectures  - SPAA ’99</i>, 1999, pp. 165–174.","apa":"Krick, C., Meyer auf der Heide, F., Räcke, H., Vöcking, B., &#38; Westermann, M. (1999). Data management in networks: experimental evaluation of a provably good strategy. In <i>Proceedings of the eleventh annual ACM symposium on Parallel algorithms and architectures  - SPAA ’99</i> (pp. 165–174). <a href=\"https://doi.org/10.1145/305619.305637\">https://doi.org/10.1145/305619.305637</a>"},"page":"165-174","_id":"18965","language":[{"iso":"eng"}],"user_id":"15415","doi":"10.1145/305619.305637","status":"public","title":"Data management in networks: experimental evaluation of a provably good strategy","year":"1999","author":[{"full_name":"Krick, Christof","first_name":"Christof","last_name":"Krick"},{"id":"15523","full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm","last_name":"Meyer auf der Heide"},{"full_name":"Räcke, Harald","last_name":"Räcke","first_name":"Harald"},{"full_name":"Vöcking, Berthold","first_name":"Berthold","last_name":"Vöcking"},{"full_name":"Westermann, Matthias","last_name":"Westermann","first_name":"Matthias"}],"publication_identifier":{"isbn":["1581131240"]},"publication_status":"published","date_updated":"2022-01-06T06:53:56Z"},{"year":"1999","status":"public","title":"Generating Random Star-Shaped Polygons","author":[{"first_name":"Christian","last_name":"Sohler","full_name":"Sohler, Christian"}],"date_updated":"2022-01-06T06:53:40Z","page":"174-177","_id":"18576","language":[{"iso":"eng"}],"user_id":"15415","publication":"Proceedings of the 11th Canadian Conference on Computational Geometry ('CCCG'99)","citation":{"bibtex":"@inproceedings{Sohler_1999, title={Generating Random Star-Shaped Polygons}, booktitle={Proceedings of the 11th Canadian Conference on Computational Geometry ('CCCG’99)}, author={Sohler, Christian}, year={1999}, pages={174–177} }","ama":"Sohler C. Generating Random Star-Shaped Polygons. In: <i>Proceedings of the 11th Canadian Conference on Computational Geometry ('CCCG’99)</i>. ; 1999:174-177.","mla":"Sohler, Christian. “Generating Random Star-Shaped Polygons.” <i>Proceedings of the 11th Canadian Conference on Computational Geometry ('CCCG’99)</i>, 1999, pp. 174–77.","short":"C. Sohler, in: Proceedings of the 11th Canadian Conference on Computational Geometry ('CCCG’99), 1999, pp. 174–177.","chicago":"Sohler, Christian. “Generating Random Star-Shaped Polygons.” In <i>Proceedings of the 11th Canadian Conference on Computational Geometry ('CCCG’99)</i>, 174–77, 1999.","ieee":"C. Sohler, “Generating Random Star-Shaped Polygons,” in <i>Proceedings of the 11th Canadian Conference on Computational Geometry ('CCCG’99)</i>, 1999, pp. 174–177.","apa":"Sohler, C. (1999). Generating Random Star-Shaped Polygons. In <i>Proceedings of the 11th Canadian Conference on Computational Geometry ('CCCG’99)</i> (pp. 174–177)."},"abstract":[{"lang":"eng","text":"In this paper we deal with two problems on star-shaped polygons. First, we present a Las-Vegas algorithm that uniformly at random creates a star-shaped polygon whose vertices are given by a point set ( S ) of ( n ) points in the plane that does not admit degenerate star-shaped polygons. The expected running time of the algorithm is ( O(n^2log n) ) and it uses ( O(n) ) memory. We call a star-shaped polygon degenerate if its kernel has 0 area.<br><br>Secondly, we show how to count all star-shaped polygons whose vertices are a subset of ( S ) in ( O(n^5log n) ) time and ( O(n) ) space. The algorithm can also be used for random uniform generation. We also present lower and upper bounds on the number of star-shaped polygons."}],"date_created":"2020-08-28T14:20:42Z","type":"conference","department":[{"_id":"63"}]},{"citation":{"mla":"Berenbrink, Petra, et al. “Design of the PRESTO Multimedia Storage Network (Extended Abstract).” <i>International Workshop on Communication and Data Management in Large Networks (CDMLarge)</i>, 1999, pp. 2–12.","bibtex":"@inproceedings{Berenbrink_Riedel_Scheideler_1999, title={Design of the PRESTO Multimedia Storage Network (Extended Abstract)}, booktitle={International Workshop on Communication and Data Management in Large Networks (CDMLarge)}, author={Berenbrink, Petra and Riedel, Marco and Scheideler, Christian}, year={1999}, pages={2–12} }","ama":"Berenbrink P, Riedel M, Scheideler C. Design of the PRESTO Multimedia Storage Network (Extended Abstract). In: <i>International Workshop on Communication and Data Management in Large Networks (CDMLarge)</i>. ; 1999:2-12.","ieee":"P. Berenbrink, M. Riedel, and C. Scheideler, “Design of the PRESTO Multimedia Storage Network (Extended Abstract),” in <i>International Workshop on Communication and Data Management in Large Networks (CDMLarge)</i>, 1999, pp. 2–12.","apa":"Berenbrink, P., Riedel, M., &#38; Scheideler, C. (1999). Design of the PRESTO Multimedia Storage Network (Extended Abstract). In <i>International Workshop on Communication and Data Management in Large Networks (CDMLarge)</i> (pp. 2–12).","short":"P. Berenbrink, M. Riedel, C. Scheideler, in: International Workshop on Communication and Data Management in Large Networks (CDMLarge), 1999, pp. 2–12.","chicago":"Berenbrink, Petra, Marco Riedel, and Christian Scheideler. “Design of the PRESTO Multimedia Storage Network (Extended Abstract).” In <i>International Workshop on Communication and Data Management in Large Networks (CDMLarge)</i>, 2–12, 1999."},"publication":"International Workshop on Communication and Data Management in Large Networks (CDMLarge)","file_date_updated":"2018-04-12T08:34:00Z","oa":"1","department":[{"_id":"79"},{"_id":"63"}],"type":"conference","date_created":"2018-04-05T07:00:11Z","file":[{"creator":"florida","date_created":"2018-04-12T08:34:00Z","relation":"main_file","date_updated":"2018-04-12T08:34:00Z","file_name":"CDMLarge-99.pdf","access_level":"open_access","file_size":211926,"file_id":"2294","content_type":"application/pdf"}],"has_accepted_license":"1","date_updated":"2022-01-06T06:55:26Z","author":[{"full_name":"Berenbrink, Petra","last_name":"Berenbrink","first_name":"Petra"},{"last_name":"Riedel","first_name":"Marco","full_name":"Riedel, Marco"},{"id":"20792","full_name":"Scheideler, Christian","first_name":"Christian","last_name":"Scheideler"}],"title":"Design of the PRESTO Multimedia Storage Network (Extended Abstract)","year":"1999","status":"public","ddc":["040"],"user_id":"14955","urn":"22109","_id":"2210","language":[{"iso":"eng"}],"page":"2-12"},{"ddc":["040"],"user_id":"14955","_id":"2166","language":[{"iso":"eng"}],"urn":"21668","page":"215--224","has_accepted_license":"1","date_updated":"2022-01-06T06:55:10Z","author":[{"last_name":"Scheideler","first_name":"Christian","full_name":"Scheideler, Christian","id":"20792"},{"last_name":"Vöcking","first_name":"Berthold","full_name":"Vöcking, Berthold"}],"status":"public","title":"From Static to Dynamic Routing: Efficient Transformations of Store-and-Forward Protocols","year":"1999","oa":"1","department":[{"_id":"79"},{"_id":"63"}],"type":"conference","date_created":"2018-04-03T08:57:30Z","file":[{"file_id":"2289","content_type":"application/pdf","file_name":"STOC-99.pdf","access_level":"open_access","file_size":227305,"relation":"main_file","date_updated":"2018-04-12T07:35:46Z","date_created":"2018-04-12T07:35:46Z","creator":"florida"}],"citation":{"apa":"Scheideler, C., &#38; Vöcking, B. (1999). From Static to Dynamic Routing: Efficient Transformations of Store-and-Forward Protocols. In <i>STOC</i> (pp. 215--224).","ieee":"C. Scheideler and B. Vöcking, “From Static to Dynamic Routing: Efficient Transformations of Store-and-Forward Protocols,” in <i>STOC</i>, 1999, pp. 215--224.","short":"C. Scheideler, B. Vöcking, in: STOC, 1999, pp. 215--224.","chicago":"Scheideler, Christian, and Berthold Vöcking. “From Static to Dynamic Routing: Efficient Transformations of Store-and-Forward Protocols.” In <i>STOC</i>, 215--224, 1999.","mla":"Scheideler, Christian, and Berthold Vöcking. “From Static to Dynamic Routing: Efficient Transformations of Store-and-Forward Protocols.” <i>STOC</i>, 1999, pp. 215--224.","ama":"Scheideler C, Vöcking B. From Static to Dynamic Routing: Efficient Transformations of Store-and-Forward Protocols. In: <i>STOC</i>. ; 1999:215--224.","bibtex":"@inproceedings{Scheideler_Vöcking_1999, title={From Static to Dynamic Routing: Efficient Transformations of Store-and-Forward Protocols}, booktitle={STOC}, author={Scheideler, Christian and Vöcking, Berthold}, year={1999}, pages={215--224} }"},"publication":"STOC","file_date_updated":"2018-04-12T07:35:46Z"},{"citation":{"apa":"Engels, G., Beiersdörfer, K., &#38; Schäfer, W. (Eds.). (1999). <i>Informatik ’99: Informatik überwindet Grenzen. Tagungsband der 29. Jahrestagung der Gesellschaft für Informatik, Paderborn (Germany)</i>. Berlin/Heidelberg: Springer.","ieee":"G. Engels, K. Beiersdörfer, and W. Schäfer, Eds., <i>Informatik ’99: Informatik überwindet Grenzen. Tagungsband der 29. Jahrestagung der Gesellschaft für Informatik, Paderborn (Germany)</i>. Berlin/Heidelberg: Springer, 1999.","chicago":"Engels, Gregor, K. Beiersdörfer, and Wilhelm Schäfer, eds. <i>Informatik ’99: Informatik Überwindet Grenzen. Tagungsband Der 29. Jahrestagung Der Gesellschaft Für Informatik, Paderborn (Germany)</i>. Informatik Aktuell. Berlin/Heidelberg: Springer, 1999.","short":"G. Engels, K. Beiersdörfer, W. Schäfer, eds., Informatik ’99: Informatik Überwindet Grenzen. Tagungsband Der 29. Jahrestagung Der Gesellschaft Für Informatik, Paderborn (Germany), Springer, Berlin/Heidelberg, 1999.","mla":"Engels, Gregor, et al., editors. <i>Informatik ’99: Informatik Überwindet Grenzen. Tagungsband Der 29. Jahrestagung Der Gesellschaft Für Informatik, Paderborn (Germany)</i>. Springer, 1999.","ama":"Engels G, Beiersdörfer K, Schäfer W, eds. <i>Informatik ’99: Informatik Überwindet Grenzen. Tagungsband Der 29. Jahrestagung Der Gesellschaft Für Informatik, Paderborn (Germany)</i>. Berlin/Heidelberg: Springer; 1999.","bibtex":"@book{Engels_Beiersdörfer_Schäfer_1999, place={Berlin/Heidelberg}, series={Informatik aktuell}, title={Informatik ’99: Informatik überwindet Grenzen. Tagungsband der 29. Jahrestagung der Gesellschaft für Informatik, Paderborn (Germany)}, publisher={Springer}, year={1999}, collection={Informatik aktuell} }"},"date_created":"2019-02-19T19:13:34Z","place":"Berlin/Heidelberg","department":[{"_id":"66"}],"type":"conference_editor","title":"Informatik '99: Informatik überwindet Grenzen. Tagungsband der 29. Jahrestagung der Gesellschaft für Informatik, Paderborn (Germany)","status":"public","year":"1999","date_updated":"2022-01-06T07:03:46Z","_id":"7792","series_title":"Informatik aktuell","language":[{"iso":"eng"}],"publisher":"Springer","editor":[{"id":"107","first_name":"Gregor","last_name":"Engels","full_name":"Engels, Gregor"},{"full_name":"Beiersdörfer, K.","first_name":"K.","last_name":"Beiersdörfer"},{"first_name":"Wilhelm","last_name":"Schäfer","full_name":"Schäfer, Wilhelm"}],"user_id":"52534"},{"date_created":"2019-02-20T14:13:43Z","type":"conference","department":[{"_id":"66"}],"publication":"Proceedings of the conference on Artificial Intelligence (IC-AI 1999) Las Vegas, Nevada (USA)","citation":{"mla":"Deugo, Dwight, et al. “Patterns as a Means for Intelligent Software Engineering.” <i>Proceedings of the Conference on Artificial Intelligence (IC-AI 1999) Las Vegas, Nevada (USA)</i>, vol. 2, CSREA Press, 1999, pp. 605–11.","ama":"Deugo D, Küster J, Oppacher F, von Otte I. Patterns as a Means for Intelligent Software Engineering. In: <i>Proceedings of the Conference on Artificial Intelligence (IC-AI 1999) Las Vegas, Nevada (USA)</i>. Vol 2. CSREA Press; 1999:605-611.","bibtex":"@inproceedings{Deugo_Küster_Oppacher_von Otte_1999, title={Patterns as a Means for Intelligent Software Engineering}, volume={2}, booktitle={Proceedings of the conference on Artificial Intelligence (IC-AI 1999) Las Vegas, Nevada (USA)}, publisher={CSREA Press}, author={Deugo, Dwight and Küster, Jochen and Oppacher, Franz and von Otte, Ingo}, year={1999}, pages={605–611} }","apa":"Deugo, D., Küster, J., Oppacher, F., &#38; von Otte, I. (1999). Patterns as a Means for Intelligent Software Engineering. In <i>Proceedings of the conference on Artificial Intelligence (IC-AI 1999) Las Vegas, Nevada (USA)</i> (Vol. 2, pp. 605–611). CSREA Press.","ieee":"D. Deugo, J. Küster, F. Oppacher, and I. von Otte, “Patterns as a Means for Intelligent Software Engineering,” in <i>Proceedings of the conference on Artificial Intelligence (IC-AI 1999) Las Vegas, Nevada (USA)</i>, 1999, vol. 2, pp. 605–611.","chicago":"Deugo, Dwight, Jochen Küster, Franz Oppacher, and Ingo von Otte. “Patterns as a Means for Intelligent Software Engineering.” In <i>Proceedings of the Conference on Artificial Intelligence (IC-AI 1999) Las Vegas, Nevada (USA)</i>, 2:605–11. CSREA Press, 1999.","short":"D. Deugo, J. Küster, F. Oppacher, I. von Otte, in: Proceedings of the Conference on Artificial Intelligence (IC-AI 1999) Las Vegas, Nevada (USA), CSREA Press, 1999, pp. 605–611."},"page":"605-611","language":[{"iso":"eng"}],"_id":"7849","publisher":"CSREA Press","user_id":"52534","volume":2,"status":"public","year":"1999","title":"Patterns as a Means for Intelligent Software Engineering","author":[{"first_name":"Dwight","last_name":"Deugo","full_name":"Deugo, Dwight"},{"last_name":"Küster","first_name":"Jochen","full_name":"Küster, Jochen"},{"full_name":"Oppacher, Franz","last_name":"Oppacher","first_name":"Franz"},{"last_name":"von Otte","first_name":"Ingo","full_name":"von Otte, Ingo"}],"date_updated":"2022-01-06T07:03:47Z","intvolume":"         2"},{"place":"Berlin/Heidelberg","date_created":"2019-02-20T14:14:10Z","type":"conference","department":[{"_id":"66"}],"publication":"Proceedings of the 12th International Symposium on Fundamentals of Computation Theory (FCT '99)","citation":{"mla":"Corradini, Andrea, et al. “Tile Transition Systems as Structured Coalgebras.” <i>Proceedings of the 12th International Symposium on Fundamentals of Computation Theory (FCT ’99)</i>, vol. 1684, Springer, 1999, pp. 13–38.","apa":"Corradini, A., Heckel, R., &#38; Montanari, U. (1999). Tile Transition Systems as Structured Coalgebras. In <i>Proceedings of the 12th International Symposium on Fundamentals of Computation Theory (FCT ’99)</i> (Vol. 1684, pp. 13–38). Berlin/Heidelberg: Springer.","ieee":"A. Corradini, R. Heckel, and U. Montanari, “Tile Transition Systems as Structured Coalgebras,” in <i>Proceedings of the 12th International Symposium on Fundamentals of Computation Theory (FCT ’99)</i>, 1999, vol. 1684, pp. 13–38.","short":"A. Corradini, R. Heckel, U. Montanari, in: Proceedings of the 12th International Symposium on Fundamentals of Computation Theory (FCT ’99), Springer, Berlin/Heidelberg, 1999, pp. 13–38.","ama":"Corradini A, Heckel R, Montanari U. Tile Transition Systems as Structured Coalgebras. In: <i>Proceedings of the 12th International Symposium on Fundamentals of Computation Theory (FCT ’99)</i>. Vol 1684. LNCS. Berlin/Heidelberg: Springer; 1999:13-38.","chicago":"Corradini, Andrea, Reiko Heckel, and Ugo Montanari. “Tile Transition Systems as Structured Coalgebras.” In <i>Proceedings of the 12th International Symposium on Fundamentals of Computation Theory (FCT ’99)</i>, 1684:13–38. LNCS. Berlin/Heidelberg: Springer, 1999.","bibtex":"@inproceedings{Corradini_Heckel_Montanari_1999, place={Berlin/Heidelberg}, series={LNCS}, title={Tile Transition Systems as Structured Coalgebras}, volume={1684}, booktitle={Proceedings of the 12th International Symposium on Fundamentals of Computation Theory (FCT ’99)}, publisher={Springer}, author={Corradini, Andrea and Heckel, Reiko and Montanari, Ugo}, year={1999}, pages={13–38}, collection={LNCS} }"},"page":"13-38","_id":"7850","publisher":"Springer","series_title":"LNCS","language":[{"iso":"eng"}],"user_id":"52534","volume":1684,"year":"1999","status":"public","title":"Tile Transition Systems as Structured Coalgebras","author":[{"first_name":"Andrea","last_name":"Corradini","full_name":"Corradini, Andrea"},{"full_name":"Heckel, Reiko","last_name":"Heckel","first_name":"Reiko"},{"full_name":"Montanari, Ugo","first_name":"Ugo","last_name":"Montanari"}],"date_updated":"2022-01-06T07:03:47Z","intvolume":"      1684"},{"publication":"Proceedings of the All-Russia Students’, Young Scientists’ and Specialists’ Scientific and Technical Conference \"New Information Technologies in Scientific Researches and in Education\" (Ryazan, Russia)","citation":{"short":"A. Cherchago, in: Proceedings of the All-Russia Students’, Young Scientists’ and Specialists’ Scientific and Technical Conference “New Information Technologies in Scientific Researches and in Education” (Ryazan, Russia), 1999.","chicago":"Cherchago, Alexey. “Application of the Structured Analysis and Design Technique (SADT) Methodology for the Medical Information Systems Development.” In <i>Proceedings of the All-Russia Students’, Young Scientists’ and Specialists’ Scientific and Technical Conference “New Information Technologies in Scientific Researches and in Education” (Ryazan, Russia)</i>, 1999.","ieee":"A. Cherchago, “Application of the Structured Analysis and Design Technique (SADT) Methodology for the Medical Information Systems Development,” in <i>Proceedings of the All-Russia Students’, Young Scientists’ and Specialists’ Scientific and Technical Conference “New Information Technologies in Scientific Researches and in Education” (Ryazan, Russia)</i>, 1999.","apa":"Cherchago, A. (1999). Application of the Structured Analysis and Design Technique (SADT) Methodology for the Medical Information Systems Development. In <i>Proceedings of the All-Russia Students’, Young Scientists’ and Specialists’ Scientific and Technical Conference “New Information Technologies in Scientific Researches and in Education” (Ryazan, Russia)</i>.","bibtex":"@inproceedings{Cherchago_1999, title={Application of the Structured Analysis and Design Technique (SADT) Methodology for the Medical Information Systems Development}, booktitle={Proceedings of the All-Russia Students’, Young Scientists’ and Specialists’ Scientific and Technical Conference “New Information Technologies in Scientific Researches and in Education” (Ryazan, Russia)}, author={Cherchago, Alexey}, year={1999} }","ama":"Cherchago A. Application of the Structured Analysis and Design Technique (SADT) Methodology for the Medical Information Systems Development. In: <i>Proceedings of the All-Russia Students’, Young Scientists’ and Specialists’ Scientific and Technical Conference “New Information Technologies in Scientific Researches and in Education” (Ryazan, Russia)</i>. ; 1999.","mla":"Cherchago, Alexey. “Application of the Structured Analysis and Design Technique (SADT) Methodology for the Medical Information Systems Development.” <i>Proceedings of the All-Russia Students’, Young Scientists’ and Specialists’ Scientific and Technical Conference “New Information Technologies in Scientific Researches and in Education” (Ryazan, Russia)</i>, 1999."},"date_created":"2019-02-20T14:14:39Z","type":"conference","department":[{"_id":"66"}],"status":"public","title":"Application of the Structured Analysis and Design Technique (SADT) Methodology for the Medical Information Systems Development","year":"1999","author":[{"full_name":"Cherchago, Alexey","first_name":"Alexey","last_name":"Cherchago"}],"date_updated":"2022-01-06T07:03:47Z","language":[{"iso":"eng"}],"_id":"7851","user_id":"52534"},{"publication":"Kolloquium Software-Entwicklung - Methoden, Werkzeuge, Erfahrungen","citation":{"mla":"Engels, Gregor, et al. “Konzeption Und Objektorientierte Realisierung Einer Internet-Basierten Datenbankanwendung.” <i>Kolloquium Software-Entwicklung - Methoden, Werkzeuge, Erfahrungen</i>, vol. 8, Technische Akademie Esslingen, 1999, pp. 531–40.","bibtex":"@inproceedings{Engels_Depke_Borowski_1999, place={Ostfildern}, title={Konzeption und objektorientierte Realisierung einer internet-basierten Datenbankanwendung}, volume={8}, booktitle={Kolloquium Software-Entwicklung - Methoden, Werkzeuge, Erfahrungen}, publisher={Technische Akademie Esslingen}, author={Engels, Gregor and Depke, Ralph and Borowski, Christoph}, year={1999}, pages={531–540} }","ama":"Engels G, Depke R, Borowski C. Konzeption und objektorientierte Realisierung einer internet-basierten Datenbankanwendung. In: <i>Kolloquium Software-Entwicklung - Methoden, Werkzeuge, Erfahrungen</i>. Vol 8. Ostfildern: Technische Akademie Esslingen; 1999:531-540.","ieee":"G. Engels, R. Depke, and C. Borowski, “Konzeption und objektorientierte Realisierung einer internet-basierten Datenbankanwendung,” in <i>Kolloquium Software-Entwicklung - Methoden, Werkzeuge, Erfahrungen</i>, 1999, vol. 8, pp. 531–540.","apa":"Engels, G., Depke, R., &#38; Borowski, C. (1999). Konzeption und objektorientierte Realisierung einer internet-basierten Datenbankanwendung. In <i>Kolloquium Software-Entwicklung - Methoden, Werkzeuge, Erfahrungen</i> (Vol. 8, pp. 531–540). Ostfildern: Technische Akademie Esslingen.","short":"G. Engels, R. Depke, C. Borowski, in: Kolloquium Software-Entwicklung - Methoden, Werkzeuge, Erfahrungen, Technische Akademie Esslingen, Ostfildern, 1999, pp. 531–540.","chicago":"Engels, Gregor, Ralph Depke, and Christoph Borowski. “Konzeption Und Objektorientierte Realisierung Einer Internet-Basierten Datenbankanwendung.” In <i>Kolloquium Software-Entwicklung - Methoden, Werkzeuge, Erfahrungen</i>, 8:531–40. Ostfildern: Technische Akademie Esslingen, 1999."},"abstract":[{"lang":"eng","text":"Today e-commerce applications use web browsers as an uniform user interface and they rely on databases as data sources. Different technologies exist for database access: common gateway interface (CGI), Java and its database interface java database connectivity (JDBC), proprietary approaches of database vendors, etc. We present criteria for the selection of an appropriate solution and we successivly apply them in our application development process. Throughout the development process of internet based database applications object oriented techniques can be used. The unified modeling language (UML) is used for requirement analysis and design of the application and the implementation proceeds with the programming language Java. The transition from the object oriented modeling language UML to the object oriented programming language Java succeeds smoothly. We report on our experience with the modeling tool Rational Rose 98 of Rational, Inc. We use Java and JDBC to implement a seminar reservation system that can be regarded as a small e-commerce application."}],"date_created":"2019-02-20T14:15:05Z","place":"Ostfildern","type":"conference","department":[{"_id":"66"}],"title":"Konzeption und objektorientierte Realisierung einer internet-basierten Datenbankanwendung","year":"1999","status":"public","author":[{"full_name":"Engels, Gregor","last_name":"Engels","first_name":"Gregor","id":"107"},{"full_name":"Depke, Ralph","last_name":"Depke","first_name":"Ralph"},{"full_name":"Borowski, Christoph","first_name":"Christoph","last_name":"Borowski"}],"date_updated":"2022-01-06T07:03:47Z","intvolume":"         8","page":"531-540","publisher":"Technische Akademie Esslingen","_id":"7852","language":[{"iso":"eng"}],"user_id":"52534","volume":8},{"intvolume":"      1723","date_updated":"2022-01-06T07:03:47Z","author":[{"full_name":"Engels, Gregor","first_name":"Gregor","last_name":"Engels","id":"107"},{"full_name":"Hücking, Roland","first_name":"Roland","last_name":"Hücking"},{"id":"447","first_name":"Stefan","last_name":"Sauer","full_name":"Sauer, Stefan"},{"full_name":"Wagner, Annika","last_name":"Wagner","first_name":"Annika"}],"title":"UML Collaboration Diagrams and Their Transformation to Java","year":"1999","status":"public","volume":1723,"user_id":"52534","publisher":"Springer","_id":"7856","language":[{"iso":"eng"}],"series_title":"LNCS","page":"473-488","citation":{"ieee":"G. Engels, R. Hücking, S. Sauer, and A. Wagner, “UML Collaboration Diagrams and Their Transformation to Java,” in <i>Proceddings of The Unified Modeling Language: Beyond the Standard, Second International Conference (UML 99), Fort Collins, Colorado, USA</i>, 1999, vol. 1723, pp. 473–488.","apa":"Engels, G., Hücking, R., Sauer, S., &#38; Wagner, A. (1999). UML Collaboration Diagrams and Their Transformation to Java. In <i>Proceddings of The Unified Modeling Language: Beyond the Standard, Second International Conference (UML 99), Fort Collins, Colorado, USA</i> (Vol. 1723, pp. 473–488). Berlin/Heidelberg: Springer.","mla":"Engels, Gregor, et al. “UML Collaboration Diagrams and Their Transformation to Java.” <i>Proceddings of The Unified Modeling Language: Beyond the Standard, Second International Conference (UML 99), Fort Collins, Colorado, USA</i>, vol. 1723, Springer, 1999, pp. 473–88.","bibtex":"@inproceedings{Engels_Hücking_Sauer_Wagner_1999, place={Berlin/Heidelberg}, series={LNCS}, title={UML Collaboration Diagrams and Their Transformation to Java}, volume={1723}, booktitle={Proceddings of The Unified Modeling Language: Beyond the Standard, Second International Conference (UML 99), Fort Collins, Colorado, USA}, publisher={Springer}, author={Engels, Gregor and Hücking, Roland and Sauer, Stefan and Wagner, Annika}, year={1999}, pages={473–488}, collection={LNCS} }","ama":"Engels G, Hücking R, Sauer S, Wagner A. UML Collaboration Diagrams and Their Transformation to Java. In: <i>Proceddings of The Unified Modeling Language: Beyond the Standard, Second International Conference (UML 99), Fort Collins, Colorado, USA</i>. Vol 1723. LNCS. Berlin/Heidelberg: Springer; 1999:473-488.","short":"G. Engels, R. Hücking, S. Sauer, A. Wagner, in: Proceddings of The Unified Modeling Language: Beyond the Standard, Second International Conference (UML 99), Fort Collins, Colorado, USA, Springer, Berlin/Heidelberg, 1999, pp. 473–488.","chicago":"Engels, Gregor, Roland Hücking, Stefan Sauer, and Annika Wagner. “UML Collaboration Diagrams and Their Transformation to Java.” In <i>Proceddings of The Unified Modeling Language: Beyond the Standard, Second International Conference (UML 99), Fort Collins, Colorado, USA</i>, 1723:473–88. LNCS. Berlin/Heidelberg: Springer, 1999."},"publication":"Proceddings of The Unified Modeling Language: Beyond the Standard, Second International Conference (UML 99), Fort Collins, Colorado, USA","department":[{"_id":"66"}],"type":"conference","place":"Berlin/Heidelberg","date_created":"2019-02-20T14:36:26Z"},{"volume":29,"user_id":"52534","doi":"http://dx.doi.org/10.1016/S1571-0661(05)80309-3","series_title":"Electronic Notes in Theoretical Computer Science","_id":"7858","language":[{"iso":"eng"}],"publisher":"Elsevier","page":"80-100","intvolume":"        29","date_updated":"2022-01-06T07:03:47Z","author":[{"first_name":"Fabio","last_name":"Gadducci","full_name":"Gadducci, Fabio"},{"last_name":"Heckel","first_name":"Reiko","full_name":"Heckel, Reiko"},{"first_name":"Mercé","last_name":"Llabrés","full_name":"Llabrés, Mercé"}],"year":"1999","status":"public","title":"A Bi-Categorical Axiomatisation of Concurrent Graph Rewriting","department":[{"_id":"66"}],"type":"conference","date_created":"2019-02-20T14:36:57Z","abstract":[{"text":"In this paper the concurrent semantics of double-pushout (DPO) graph rewriting, which is classically defined in terms of shift-equivalence classes of graph derivations, is axiomatised via the construction of a free monoidal bi-category. In contrast to a previous attempt based on 2-categories, the use of bi-categories allows to define rewriting on concrete graphs. Thus, the problem of composition of isomorphism classes of rewriting sequences is avoided. Moreover, as a first step towards the recovery of the full expressive power of the formalism via a purely algebraic description, the concept of disconnected rules is introduced, i.e., rules whose interface graphs are made of disconnected nodes and edges only. It is proved that, under reasonable assumptions, rewriting via disconnected rules enjoys similar concurrency properties like in the classical approach.","lang":"eng"}],"citation":{"ieee":"F. Gadducci, R. Heckel, and M. Llabrés, “A Bi-Categorical Axiomatisation of Concurrent Graph Rewriting,” in <i>Proceedings of the 8th Conference on Category Theory and Computer Science (CTCS 1999), Edinburgh (UK)</i>, 1999, vol. 29, pp. 80–100.","apa":"Gadducci, F., Heckel, R., &#38; Llabrés, M. (1999). A Bi-Categorical Axiomatisation of Concurrent Graph Rewriting. In <i>Proceedings of the 8th Conference on Category Theory and Computer Science (CTCS 1999), Edinburgh (UK)</i> (Vol. 29, pp. 80–100). Elsevier. <a href=\"http://dx.doi.org/10.1016/S1571-0661(05)80309-3\">http://dx.doi.org/10.1016/S1571-0661(05)80309-3</a>","short":"F. Gadducci, R. Heckel, M. Llabrés, in: Proceedings of the 8th Conference on Category Theory and Computer Science (CTCS 1999), Edinburgh (UK), Elsevier, 1999, pp. 80–100.","chicago":"Gadducci, Fabio, Reiko Heckel, and Mercé Llabrés. “A Bi-Categorical Axiomatisation of Concurrent Graph Rewriting.” In <i>Proceedings of the 8th Conference on Category Theory and Computer Science (CTCS 1999), Edinburgh (UK)</i>, 29:80–100. Electronic Notes in Theoretical Computer Science. Elsevier, 1999. <a href=\"http://dx.doi.org/10.1016/S1571-0661(05)80309-3\">http://dx.doi.org/10.1016/S1571-0661(05)80309-3</a>.","mla":"Gadducci, Fabio, et al. “A Bi-Categorical Axiomatisation of Concurrent Graph Rewriting.” <i>Proceedings of the 8th Conference on Category Theory and Computer Science (CTCS 1999), Edinburgh (UK)</i>, vol. 29, Elsevier, 1999, pp. 80–100, doi:<a href=\"http://dx.doi.org/10.1016/S1571-0661(05)80309-3\">http://dx.doi.org/10.1016/S1571-0661(05)80309-3</a>.","bibtex":"@inproceedings{Gadducci_Heckel_Llabrés_1999, series={Electronic Notes in Theoretical Computer Science}, title={A Bi-Categorical Axiomatisation of Concurrent Graph Rewriting}, volume={29}, DOI={<a href=\"http://dx.doi.org/10.1016/S1571-0661(05)80309-3\">http://dx.doi.org/10.1016/S1571-0661(05)80309-3</a>}, booktitle={Proceedings of the 8th Conference on Category Theory and Computer Science (CTCS 1999), Edinburgh (UK)}, publisher={Elsevier}, author={Gadducci, Fabio and Heckel, Reiko and Llabrés, Mercé}, year={1999}, pages={80–100}, collection={Electronic Notes in Theoretical Computer Science} }","ama":"Gadducci F, Heckel R, Llabrés M. A Bi-Categorical Axiomatisation of Concurrent Graph Rewriting. In: <i>Proceedings of the 8th Conference on Category Theory and Computer Science (CTCS 1999), Edinburgh (UK)</i>. Vol 29. Electronic Notes in Theoretical Computer Science. Elsevier; 1999:80-100. doi:<a href=\"http://dx.doi.org/10.1016/S1571-0661(05)80309-3\">http://dx.doi.org/10.1016/S1571-0661(05)80309-3</a>"},"publication":"Proceedings of the 8th Conference on Category Theory and Computer Science (CTCS 1999), Edinburgh (UK)"},{"title":"Modeling Agent-Based Systems with Graph Transformation and UML","status":"public","year":"1999","author":[{"last_name":"Heckel","first_name":"Reiko","full_name":"Heckel, Reiko"}],"date_updated":"2022-01-06T07:03:47Z","_id":"7859","language":[{"iso":"eng"}],"user_id":"52534","publication":"Proceedings of the Dagstuhl-Seminar 99451 on Rigorous Analysis and Design for Software Intensive Systems","issue":"258","citation":{"short":"R. Heckel, in: Proceedings of the Dagstuhl-Seminar 99451 on Rigorous Analysis and Design for Software Intensive Systems, 1999.","chicago":"Heckel, Reiko. “Modeling Agent-Based Systems with Graph Transformation and UML.” In <i>Proceedings of the Dagstuhl-Seminar 99451 on Rigorous Analysis and Design for Software Intensive Systems</i>, 1999.","apa":"Heckel, R. (1999). Modeling Agent-Based Systems with Graph Transformation and UML. In <i>Proceedings of the Dagstuhl-Seminar 99451 on Rigorous Analysis and Design for Software Intensive Systems</i>.","ieee":"R. Heckel, “Modeling Agent-Based Systems with Graph Transformation and UML,” in <i>Proceedings of the Dagstuhl-Seminar 99451 on Rigorous Analysis and Design for Software Intensive Systems</i>, 1999, no. 258.","ama":"Heckel R. Modeling Agent-Based Systems with Graph Transformation and UML. In: <i>Proceedings of the Dagstuhl-Seminar 99451 on Rigorous Analysis and Design for Software Intensive Systems</i>. ; 1999.","bibtex":"@inproceedings{Heckel_1999, title={Modeling Agent-Based Systems with Graph Transformation and UML}, number={258}, booktitle={Proceedings of the Dagstuhl-Seminar 99451 on Rigorous Analysis and Design for Software Intensive Systems}, author={Heckel, Reiko}, year={1999} }","mla":"Heckel, Reiko. “Modeling Agent-Based Systems with Graph Transformation and UML.” <i>Proceedings of the Dagstuhl-Seminar 99451 on Rigorous Analysis and Design for Software Intensive Systems</i>, no. 258, 1999."},"date_created":"2019-02-20T14:37:40Z","type":"conference","department":[{"_id":"66"}]},{"year":"1999","status":"public","title":"Extending UML for Modeling of Multimedia Applications","author":[{"id":"447","first_name":"Stefan","last_name":"Sauer","full_name":"Sauer, Stefan"},{"id":"107","full_name":"Engels, Gregor","first_name":"Gregor","last_name":"Engels"}],"date_updated":"2022-01-06T07:03:47Z","page":"80-87","_id":"7860","publisher":"IEEE Computer Society","language":[{"iso":"eng"}],"user_id":"52534","doi":"http://doi.ieeecomputersociety.org/10.1109/VL.1999.795878","publication":"Proceedings of the IEEE Symposium on Visual Languages (VL 1999), Tokyo (Japan)","citation":{"short":"S. Sauer, G. Engels, in: Proceedings of the IEEE Symposium on Visual Languages (VL 1999), Tokyo (Japan), IEEE Computer Society, Tokyo, Japan, 1999, pp. 80–87.","ama":"Sauer S, Engels G. Extending UML for Modeling of Multimedia Applications. In: <i>Proceedings of the IEEE Symposium on Visual Languages (VL 1999), Tokyo (Japan)</i>. Tokyo, Japan: IEEE Computer Society; 1999:80-87. doi:<a href=\"http://doi.ieeecomputersociety.org/10.1109/VL.1999.795878\">http://doi.ieeecomputersociety.org/10.1109/VL.1999.795878</a>","chicago":"Sauer, Stefan, and Gregor Engels. “Extending UML for Modeling of Multimedia Applications.” In <i>Proceedings of the IEEE Symposium on Visual Languages (VL 1999), Tokyo (Japan)</i>, 80–87. Tokyo, Japan: IEEE Computer Society, 1999. <a href=\"http://doi.ieeecomputersociety.org/10.1109/VL.1999.795878\">http://doi.ieeecomputersociety.org/10.1109/VL.1999.795878</a>.","bibtex":"@inproceedings{Sauer_Engels_1999, place={Tokyo, Japan}, title={Extending UML for Modeling of Multimedia Applications}, DOI={<a href=\"http://doi.ieeecomputersociety.org/10.1109/VL.1999.795878\">http://doi.ieeecomputersociety.org/10.1109/VL.1999.795878</a>}, booktitle={Proceedings of the IEEE Symposium on Visual Languages (VL 1999), Tokyo (Japan)}, publisher={IEEE Computer Society}, author={Sauer, Stefan and Engels, Gregor}, year={1999}, pages={80–87} }","mla":"Sauer, Stefan, and Gregor Engels. “Extending UML for Modeling of Multimedia Applications.” <i>Proceedings of the IEEE Symposium on Visual Languages (VL 1999), Tokyo (Japan)</i>, IEEE Computer Society, 1999, pp. 80–87, doi:<a href=\"http://doi.ieeecomputersociety.org/10.1109/VL.1999.795878\">http://doi.ieeecomputersociety.org/10.1109/VL.1999.795878</a>.","apa":"Sauer, S., &#38; Engels, G. (1999). Extending UML for Modeling of Multimedia Applications. In <i>Proceedings of the IEEE Symposium on Visual Languages (VL 1999), Tokyo (Japan)</i> (pp. 80–87). Tokyo, Japan: IEEE Computer Society. <a href=\"http://doi.ieeecomputersociety.org/10.1109/VL.1999.795878\">http://doi.ieeecomputersociety.org/10.1109/VL.1999.795878</a>","ieee":"S. Sauer and G. Engels, “Extending UML for Modeling of Multimedia Applications,” in <i>Proceedings of the IEEE Symposium on Visual Languages (VL 1999), Tokyo (Japan)</i>, 1999, pp. 80–87."},"abstract":[{"lang":"eng","text":"An analysis of how visual modeling of structure and dynamic behavior of a multimedia application differs from modeling conventional software yields that aspects of the graphical user interface and time-dynamic behavior ought to be integral parts of a coherent multimedia application model. In this sense, we extend the model-view-controller paradigm towards multimedia.As a result, we present OMMMA-L, a visual Language for the Object-Oriented Modeling of MultiMedia Applications that is based on the Unified Modeling Language (UML). The structural and behavioral diagram types of UML have been analyzed and are adapted and extended according to multimedia application characteristics.A presentation diagram is introduced and integrated to adequately describe the visual presentation. In addition to explaining the different diagram types, we also give pragmatic guidelines on how to deploy and combine the various diagrams."}],"date_created":"2019-02-20T14:38:09Z","place":"Tokyo, Japan","type":"conference","department":[{"_id":"66"}]},{"_id":"8203","publisher":"Technical University of Berlin","language":[{"iso":"eng"}],"user_id":"52534","author":[{"first_name":"Hartmut","last_name":"Ehrig","full_name":"Ehrig, Hartmut"},{"last_name":"Heckel","first_name":"Reiko","full_name":"Heckel, Reiko"},{"full_name":"Llabrés, Mercé","first_name":"Mercé","last_name":"Llabrés"},{"full_name":"Orejas, Fernando","first_name":"Fernando","last_name":"Orejas"}],"title":"Basic Properties of Double Pullback Graph Transitions","status":"public","year":"1999","date_updated":"2022-01-06T07:03:52Z","date_created":"2019-03-03T16:13:00Z","department":[{"_id":"66"}],"type":"report","citation":{"mla":"Ehrig, Hartmut, et al. <i>Basic Properties of Double Pullback Graph Transitions</i>. Technical University of Berlin, 1999.","bibtex":"@book{Ehrig_Heckel_Llabrés_Orejas_1999, title={Basic Properties of Double Pullback Graph Transitions}, publisher={Technical University of Berlin}, author={Ehrig, Hartmut and Heckel, Reiko and Llabrés, Mercé and Orejas, Fernando}, year={1999} }","ama":"Ehrig H, Heckel R, Llabrés M, Orejas F. <i>Basic Properties of Double Pullback Graph Transitions</i>. Technical University of Berlin; 1999.","ieee":"H. Ehrig, R. Heckel, M. Llabrés, and F. Orejas, <i>Basic Properties of Double Pullback Graph Transitions</i>. Technical University of Berlin, 1999.","apa":"Ehrig, H., Heckel, R., Llabrés, M., &#38; Orejas, F. (1999). <i>Basic Properties of Double Pullback Graph Transitions</i>. Technical University of Berlin.","short":"H. Ehrig, R. Heckel, M. Llabrés, F. Orejas, Basic Properties of Double Pullback Graph Transitions, Technical University of Berlin, 1999.","chicago":"Ehrig, Hartmut, Reiko Heckel, Mercé Llabrés, and Fernando Orejas. <i>Basic Properties of Double Pullback Graph Transitions</i>. Technical University of Berlin, 1999."},"report_number":"99-02"},{"report_number":"99-208","citation":{"apa":"Engels, G., Hücking, R., Sauer, S., &#38; Wagner, A. (1999). <i>UML Collaboration Diagrams and Their Transformation to Java</i>. University of Paderborn, Department of Computer Science.","ieee":"G. Engels, R. Hücking, S. Sauer, and A. Wagner, <i>UML Collaboration Diagrams and Their Transformation to Java</i>. University of Paderborn, Department of Computer Science, 1999.","chicago":"Engels, Gregor, Roland Hücking, Stefan Sauer, and Annika Wagner. <i>UML Collaboration Diagrams and Their Transformation to Java</i>. University of Paderborn, Department of Computer Science, 1999.","short":"G. Engels, R. Hücking, S. Sauer, A. Wagner, UML Collaboration Diagrams and Their Transformation to Java, University of Paderborn, Department of Computer Science, 1999.","mla":"Engels, Gregor, et al. <i>UML Collaboration Diagrams and Their Transformation to Java</i>. University of Paderborn, Department of Computer Science, 1999.","ama":"Engels G, Hücking R, Sauer S, Wagner A. <i>UML Collaboration Diagrams and Their Transformation to Java</i>. University of Paderborn, Department of Computer Science; 1999.","bibtex":"@book{Engels_Hücking_Sauer_Wagner_1999, title={UML Collaboration Diagrams and Their Transformation to Java}, publisher={University of Paderborn, Department of Computer Science}, author={Engels, Gregor and Hücking, Roland and Sauer, Stefan and Wagner, Annika}, year={1999} }"},"type":"report","department":[{"_id":"66"}],"date_created":"2019-03-03T16:13:01Z","date_updated":"2022-01-06T07:03:52Z","title":"UML Collaboration Diagrams and Their Transformation to Java","year":"1999","status":"public","author":[{"id":"107","last_name":"Engels","first_name":"Gregor","full_name":"Engels, Gregor"},{"first_name":"Roland","last_name":"Hücking","full_name":"Hücking, Roland"},{"id":"447","full_name":"Sauer, Stefan","last_name":"Sauer","first_name":"Stefan"},{"full_name":"Wagner, Annika","last_name":"Wagner","first_name":"Annika"}],"user_id":"52534","_id":"8204","language":[{"iso":"eng"}],"publisher":"University of Paderborn, Department of Computer Science"},{"page":"99-06","_id":"8205","publisher":"Leiden Institute of Advanced Computer Science","language":[{"iso":"eng"}],"user_id":"52534","title":"SOCCA Extended with UML like Packages","year":"1999","status":"public","author":[{"first_name":"Gregor","last_name":"Engels","full_name":"Engels, Gregor","id":"107"},{"last_name":"Jan t'Hoen","first_name":"Pieter","full_name":"Jan t'Hoen, Pieter"},{"last_name":"Dassen","first_name":"Ray","full_name":"Dassen, Ray"},{"full_name":"Groenewegen, Luuk","last_name":"Groenewegen","first_name":"Luuk"},{"full_name":"G. Sprinkhuizen-Kuyper, Ida","first_name":"Ida","last_name":"G. Sprinkhuizen-Kuyper"},{"full_name":"Koopman, Pieter","first_name":"Pieter","last_name":"Koopman"}],"date_updated":"2022-01-06T07:03:52Z","date_created":"2019-03-03T16:13:02Z","type":"report","department":[{"_id":"66"}],"citation":{"ama":"Engels G, Jan t’Hoen P, Dassen R, Groenewegen L, G. Sprinkhuizen-Kuyper I, Koopman P. <i>SOCCA Extended with UML like Packages</i>. Leiden Institute of Advanced Computer Science; 1999:99-06.","bibtex":"@book{Engels_Jan t’Hoen_Dassen_Groenewegen_G. Sprinkhuizen-Kuyper_Koopman_1999, title={SOCCA Extended with UML like Packages}, publisher={Leiden Institute of Advanced Computer Science}, author={Engels, Gregor and Jan t’Hoen, Pieter and Dassen, Ray and Groenewegen, Luuk and G. Sprinkhuizen-Kuyper, Ida and Koopman, Pieter}, year={1999}, pages={99–06} }","mla":"Engels, Gregor, et al. <i>SOCCA Extended with UML like Packages</i>. Leiden Institute of Advanced Computer Science, 1999, pp. 99–06.","short":"G. Engels, P. Jan t’Hoen, R. Dassen, L. Groenewegen, I. G. Sprinkhuizen-Kuyper, P. Koopman, SOCCA Extended with UML like Packages, Leiden Institute of Advanced Computer Science, 1999.","chicago":"Engels, Gregor, Pieter Jan t’Hoen, Ray Dassen, Luuk Groenewegen, Ida G. Sprinkhuizen-Kuyper, and Pieter Koopman. <i>SOCCA Extended with UML like Packages</i>. Leiden Institute of Advanced Computer Science, 1999.","apa":"Engels, G., Jan t’Hoen, P., Dassen, R., Groenewegen, L., G. Sprinkhuizen-Kuyper, I., &#38; Koopman, P. (1999). <i>SOCCA Extended with UML like Packages</i> (pp. 99–06). Leiden Institute of Advanced Computer Science.","ieee":"G. Engels, P. Jan t’Hoen, R. Dassen, L. Groenewegen, I. G. Sprinkhuizen-Kuyper, and P. Koopman, <i>SOCCA Extended with UML like Packages</i>. Leiden Institute of Advanced Computer Science, 1999, pp. 99–06."}},{"report_number":"1999-03","abstract":[{"lang":"eng","text":"This document starts the formalisation of the modelling language of the SOCCA OO method in the formal specification language Z. It captures the `static' aspects of SOCCA, i.e. the meaning of SOCCA language elements at the type level, rather than `dynamic' aspects (dealing with the instance level (objects in execution)). It is restricted to core SOCCA; proposed extensions are not formalised."}],"citation":{"chicago":"Engels, Gregor, Ray Dassen, Luuk Groenewegen, Ida G. Sprinkhuizen-Kuyper, Pieter Koopman, and Pieter Jan t’Hoen. <i>A Formalisation of SOCCA Using Z, Part 1: The Type Level Concepts</i>. Leiden Institute of Advanced Computer Science, 1999.","short":"G. Engels, R. Dassen, L. Groenewegen, I. G. Sprinkhuizen-Kuyper, P. Koopman, P. Jan t’Hoen, A Formalisation of SOCCA Using Z, Part 1: The Type Level Concepts, Leiden Institute of Advanced Computer Science, 1999.","ieee":"G. Engels, R. Dassen, L. Groenewegen, I. G. Sprinkhuizen-Kuyper, P. Koopman, and P. Jan t’Hoen, <i>A Formalisation of SOCCA using Z, part 1: The Type Level Concepts</i>. Leiden Institute of Advanced Computer Science, 1999.","apa":"Engels, G., Dassen, R., Groenewegen, L., G. Sprinkhuizen-Kuyper, I., Koopman, P., &#38; Jan t’Hoen, P. (1999). <i>A Formalisation of SOCCA using Z, part 1: The Type Level Concepts</i>. Leiden Institute of Advanced Computer Science.","bibtex":"@book{Engels_Dassen_Groenewegen_G. Sprinkhuizen-Kuyper_Koopman_Jan t’Hoen_1999, title={A Formalisation of SOCCA using Z, part 1: The Type Level Concepts}, publisher={Leiden Institute of Advanced Computer Science}, author={Engels, Gregor and Dassen, Ray and Groenewegen, Luuk and G. Sprinkhuizen-Kuyper, Ida and Koopman, Pieter and Jan t’Hoen, Pieter}, year={1999} }","ama":"Engels G, Dassen R, Groenewegen L, G. Sprinkhuizen-Kuyper I, Koopman P, Jan t’Hoen P. <i>A Formalisation of SOCCA Using Z, Part 1: The Type Level Concepts</i>. Leiden Institute of Advanced Computer Science; 1999.","mla":"Engels, Gregor, et al. <i>A Formalisation of SOCCA Using Z, Part 1: The Type Level Concepts</i>. Leiden Institute of Advanced Computer Science, 1999."},"department":[{"_id":"66"}],"type":"report","date_created":"2019-03-03T16:13:03Z","date_updated":"2022-01-06T07:03:52Z","author":[{"id":"107","full_name":"Engels, Gregor","first_name":"Gregor","last_name":"Engels"},{"first_name":"Ray","last_name":"Dassen","full_name":"Dassen, Ray"},{"full_name":"Groenewegen, Luuk","last_name":"Groenewegen","first_name":"Luuk"},{"full_name":"G. Sprinkhuizen-Kuyper, Ida","last_name":"G. Sprinkhuizen-Kuyper","first_name":"Ida"},{"first_name":"Pieter","last_name":"Koopman","full_name":"Koopman, Pieter"},{"full_name":"Jan t'Hoen, Pieter","last_name":"Jan t'Hoen","first_name":"Pieter"}],"year":"1999","title":"A Formalisation of SOCCA using Z, part 1: The Type Level Concepts","status":"public","user_id":"52534","_id":"8206","publisher":"Leiden Institute of Advanced Computer Science","language":[{"iso":"eng"}]},{"status":"public","year":"1999","title":"UML-basierte Modellierung von Multimediaanwendungen","author":[{"id":"447","full_name":"Sauer, Stefan","first_name":"Stefan","last_name":"Sauer"},{"id":"107","first_name":"Gregor","last_name":"Engels","full_name":"Engels, Gregor"}],"date_updated":"2022-01-06T07:03:53Z","page":"155-170","publisher":"Teubner, Stuttgart","_id":"8321","language":[{"iso":"eng"}],"user_id":"52534","publication":"Modellierung 1999, Workshop der Gesellschaft für Informatik e. V. (GI), März 1999 in Karlsruhe","citation":{"ieee":"S. Sauer and G. Engels, “UML-basierte Modellierung von Multimediaanwendungen,” in <i>Modellierung 1999, Workshop der Gesellschaft für Informatik e. V. (GI), März 1999 in Karlsruhe</i>, 1999, pp. 155–170.","mla":"Sauer, Stefan, and Gregor Engels. “UML-Basierte Modellierung von Multimediaanwendungen.” <i>Modellierung 1999, Workshop Der Gesellschaft Für Informatik e. V. (GI), März 1999 in Karlsruhe</i>, Teubner, Stuttgart, 1999, pp. 155–70.","apa":"Sauer, S., &#38; Engels, G. (1999). UML-basierte Modellierung von Multimediaanwendungen. In <i>Modellierung 1999, Workshop der Gesellschaft für Informatik e. V. (GI), März 1999 in Karlsruhe</i> (pp. 155–170). Karlsruhe, Germany: Teubner, Stuttgart.","bibtex":"@inproceedings{Sauer_Engels_1999, place={Karlsruhe, Germany}, title={UML-basierte Modellierung von Multimediaanwendungen}, booktitle={Modellierung 1999, Workshop der Gesellschaft für Informatik e. V. (GI), März 1999 in Karlsruhe}, publisher={Teubner, Stuttgart}, author={Sauer, Stefan and Engels, Gregor}, year={1999}, pages={155–170} }","ama":"Sauer S, Engels G. UML-basierte Modellierung von Multimediaanwendungen. In: <i>Modellierung 1999, Workshop Der Gesellschaft Für Informatik e. V. (GI), März 1999 in Karlsruhe</i>. Karlsruhe, Germany: Teubner, Stuttgart; 1999:155-170.","short":"S. Sauer, G. Engels, in: Modellierung 1999, Workshop Der Gesellschaft Für Informatik e. V. (GI), März 1999 in Karlsruhe, Teubner, Stuttgart, Karlsruhe, Germany, 1999, pp. 155–170.","chicago":"Sauer, Stefan, and Gregor Engels. “UML-Basierte Modellierung von Multimediaanwendungen.” In <i>Modellierung 1999, Workshop Der Gesellschaft Für Informatik e. V. (GI), März 1999 in Karlsruhe</i>, 155–70. Karlsruhe, Germany: Teubner, Stuttgart, 1999."},"abstract":[{"lang":"eng","text":"Der Entwicklungsprozeß von Multimediaanwendungen sollte ebenso wie der herkömmlicher Softwaresysteme eine Analyse und einen Entwurf beinhalten. In dieser Arbeit diskutieren wir, inwiefern die Modellierung der Struktur und des dynamischen Verhaltens einer Multimediaanwendung über die Modellierung herkömmlicher Software hinausgeht. Wir zeigen, daß Aspekte der Benutzungsschnittstelle und das Zeitverhalten integraler Bestandteil der Modellierung sein sollten. Als Ergebnis stellen wir die objektorientierte Modellierungssprache OMMMA-L vor, die auf der Unified Modeling Language (UML) aufbaut. Die Struktur- und Verhaltensdiagramme von UML wurden analysiert und gemäß der Charakteristika von Multimedia adaptiert bzw. erweitert. Im Klassendiagramm werden die Medientypen und die logische Struktur der Anwendung modelliert. Als Verhaltensdiagramme werden spezialisierte Sequenz- und Zustandsdiagramme eingesetzt. Mit dem Layoutdiagramm wird ein neuer Diagrammtyp hinzugefügt, der die integrierte und anschauliche Beschreibung der visuellen Darstellung und interaktiver Benutzereingaben einer Multimediaanwendung erlaubt. Neben der Vorstellung der einzelnen Diagrammtypen geben wir ein aus dem Metamodell zu UML abgeleitetes OMMMA-L-Metamodell an, in dem das Zusammenspiel der Modellelemente aus den verschiedenen Diagrammen spezifiziert wird."}],"place":"Karlsruhe, Germany","date_created":"2019-03-05T13:29:08Z","type":"conference","department":[{"_id":"66"}]},{"abstract":[{"text":"We present an object-oriented approach based on the Unified Modeling Language (UML) for modeling structure and dynamic behavior of a multimedia information system. We extend the Model-View-Controller paradigm for interactive systems towards multimedia and show that aspects of the graphical user interface and time-dynamic behavior ought to be integral parts of a model. This is done in the intention of achieving a coherent model of a multimedia information system. As a result, we present OMMMA-L a UML-based language for the Object-Oriented Modeling of MultiMedia Applications. OMMMA-L deploys class and state diagrams of UML as well as an extended sequence diagram and a newly introduced presentation diagram to adequately specify the visual presentation within a multimedia information system. In addition to explaining the different diagram types, we also define pragmatic rules on how to deploy and combine the various diagrams. Additionally, we relate OMMMA-L to basic ideas of multimedia information systems.","lang":"eng"}],"citation":{"chicago":"Sauer, Stefan, and Gregor Engels. “OMMMA: An Object-Oriented Approach for Modeling Multimedia Information Systems.” In <i>Proceedings of the Workshop on Multimedia Information Systems (MIS 1999), Indian Wells, CA (USA)</i>, 64–71. Indian Wells, California, USA, 1999.","short":"S. Sauer, G. Engels, in: Proceedings of the Workshop on Multimedia Information Systems (MIS 1999), Indian Wells, CA (USA), Indian Wells, California, USA, 1999, pp. 64–71.","ieee":"S. Sauer and G. Engels, “OMMMA: An Object-Oriented Approach for Modeling Multimedia Information Systems,” in <i>Proceedings of the workshop on Multimedia Information Systems (MIS 1999), Indian Wells, CA (USA)</i>, 1999, pp. 64–71.","apa":"Sauer, S., &#38; Engels, G. (1999). OMMMA: An Object-Oriented Approach for Modeling Multimedia Information Systems. In <i>Proceedings of the workshop on Multimedia Information Systems (MIS 1999), Indian Wells, CA (USA)</i> (pp. 64–71). Indian Wells, California, USA.","bibtex":"@inproceedings{Sauer_Engels_1999, place={Indian Wells, California, USA}, title={OMMMA: An Object-Oriented Approach for Modeling Multimedia Information Systems}, booktitle={Proceedings of the workshop on Multimedia Information Systems (MIS 1999), Indian Wells, CA (USA)}, author={Sauer, Stefan and Engels, Gregor}, year={1999}, pages={64–71} }","ama":"Sauer S, Engels G. OMMMA: An Object-Oriented Approach for Modeling Multimedia Information Systems. In: <i>Proceedings of the Workshop on Multimedia Information Systems (MIS 1999), Indian Wells, CA (USA)</i>. Indian Wells, California, USA; 1999:64-71.","mla":"Sauer, Stefan, and Gregor Engels. “OMMMA: An Object-Oriented Approach for Modeling Multimedia Information Systems.” <i>Proceedings of the Workshop on Multimedia Information Systems (MIS 1999), Indian Wells, CA (USA)</i>, 1999, pp. 64–71."},"publication":"Proceedings of the workshop on Multimedia Information Systems (MIS 1999), Indian Wells, CA (USA)","department":[{"_id":"66"}],"type":"conference","place":"Indian Wells, California, USA","date_created":"2019-03-05T13:29:09Z","date_updated":"2022-01-06T07:03:53Z","author":[{"id":"447","full_name":"Sauer, Stefan","last_name":"Sauer","first_name":"Stefan"},{"id":"107","full_name":"Engels, Gregor","first_name":"Gregor","last_name":"Engels"}],"status":"public","title":"OMMMA: An Object-Oriented Approach for Modeling Multimedia Information Systems","year":"1999","user_id":"52534","language":[{"iso":"eng"}],"_id":"8322","page":"64-71"}]