[{"language":[{"iso":"eng"}],"department":[{"_id":"66"}],"user_id":"52534","_id":"7571","status":"public","abstract":[{"text":"Driven by the need for a closer alignment of business and IT requirements, the role of business process models in the development of enterprise software systems has increased continuously. Similar to other software artifacts, process models are developed and refined in team environments by several stakeholders, resulting in different versions. These versions need to be merged in order to obtain an integrated process model. Existing solutions to this basic problem in the field of software configuration management are mainly limited to textual documents, e.g., source code. This monograph presents a generally applicable framework for process model change management, which provides easy-to-use comparison and merging capabilities for the integration of different process model versions. The framework supports popular modeling languages such as BPMN, BPEL, or UML Activity Diagrams. Differences between process models are represented in terms of intuitive, high-level change operations. Equipped with a sophisticated analysis of dependencies and a semantic-aware computation of conflicts between differences, the framework constitutes a comprehensive and practically usable solution for process model change management in the model-driven development of enterprise software systems.","lang":"eng"}],"type":"dissertation","title":"Business Process Models - Change Management","date_created":"2019-02-06T14:18:12Z","author":[{"first_name":"Christian","full_name":"Gerth, Christian","last_name":"Gerth"}],"date_updated":"2022-01-06T07:03:40Z","citation":{"mla":"Gerth, Christian. <i>Business Process Models - Change Management</i>. 2013.","short":"C. Gerth, Business Process Models - Change Management, 2013.","bibtex":"@book{Gerth_2013, title={Business Process Models - Change Management}, author={Gerth, Christian}, year={2013} }","apa":"Gerth, C. (2013). <i>Business Process Models - Change Management</i>.","chicago":"Gerth, Christian. <i>Business Process Models - Change Management</i>, 2013.","ieee":"C. Gerth, <i>Business Process Models - Change Management</i>. 2013.","ama":"Gerth C. <i>Business Process Models - Change Management</i>.; 2013."},"year":"2013","related_material":{"link":[{"url":"http://www.springer.com/computer/database+management+%26+information+retrieval/book/978-3-642-38603-9","relation":"confirmation"}]}},{"publication":"{IEEE} Communications Magazine","type":"journal_article","status":"public","department":[{"_id":"75"}],"user_id":"15572","_id":"769","issue":"8","citation":{"apa":"Biermann, T., Scalia, L., Choi, C., Kellerer, W., &#38; Karl, H. (2013). How backhaul networks influence the feasibility of coordinated multipoint in cellular networks. <i>{IEEE} Communications Magazine</i>, (8). <a href=\"https://doi.org/10.1109/MCOM.2013.6576356\">https://doi.org/10.1109/MCOM.2013.6576356</a>","short":"T. Biermann, L. Scalia, C. Choi, W. Kellerer, H. Karl, {IEEE} Communications Magazine (2013).","bibtex":"@article{Biermann_Scalia_Choi_Kellerer_Karl_2013, title={How backhaul networks influence the feasibility of coordinated multipoint in cellular networks}, DOI={<a href=\"https://doi.org/10.1109/MCOM.2013.6576356\">10.1109/MCOM.2013.6576356</a>}, number={8}, journal={{IEEE} Communications Magazine}, author={Biermann, Thorsten and Scalia, Luca and Choi, Changsoon and Kellerer, Wolfgang and Karl, Holger}, year={2013} }","mla":"Biermann, Thorsten, et al. “How Backhaul Networks Influence the Feasibility of Coordinated Multipoint in Cellular Networks.” <i>{IEEE} Communications Magazine</i>, no. 8, 2013, doi:<a href=\"https://doi.org/10.1109/MCOM.2013.6576356\">10.1109/MCOM.2013.6576356</a>.","ama":"Biermann T, Scalia L, Choi C, Kellerer W, Karl H. How backhaul networks influence the feasibility of coordinated multipoint in cellular networks. <i>{IEEE} Communications Magazine</i>. 2013;(8). doi:<a href=\"https://doi.org/10.1109/MCOM.2013.6576356\">10.1109/MCOM.2013.6576356</a>","chicago":"Biermann, Thorsten, Luca Scalia, Changsoon Choi, Wolfgang Kellerer, and Holger Karl. “How Backhaul Networks Influence the Feasibility of Coordinated Multipoint in Cellular Networks.” <i>{IEEE} Communications Magazine</i>, no. 8 (2013). <a href=\"https://doi.org/10.1109/MCOM.2013.6576356\">https://doi.org/10.1109/MCOM.2013.6576356</a>.","ieee":"T. Biermann, L. Scalia, C. Choi, W. Kellerer, and H. Karl, “How backhaul networks influence the feasibility of coordinated multipoint in cellular networks,” <i>{IEEE} Communications Magazine</i>, no. 8, 2013."},"year":"2013","date_created":"2017-11-27T10:22:26Z","author":[{"full_name":"Biermann, Thorsten","last_name":"Biermann","first_name":"Thorsten"},{"last_name":"Scalia","full_name":"Scalia, Luca","first_name":"Luca"},{"full_name":"Choi, Changsoon","last_name":"Choi","first_name":"Changsoon"},{"first_name":"Wolfgang","last_name":"Kellerer","full_name":"Kellerer, Wolfgang"},{"first_name":"Holger","last_name":"Karl","full_name":"Karl, Holger"}],"date_updated":"2022-01-06T07:03:44Z","doi":"10.1109/MCOM.2013.6576356","title":"How backhaul networks influence the feasibility of coordinated multipoint in cellular networks"},{"year":"2013","page":"425--434","intvolume":"       215","citation":{"ama":"Spijkerman M. Ein pragmatischer Ansatz zur Entwicklung situationsgerechter Entwicklungsmethoden. In: <i>Software Engineering 2013 - Workshopband (Inkl. Doktorandensymposium) SE 2013 (to Appear)</i>. Vol 215. LNI. GI; 2013:425--434.","ieee":"M. Spijkerman, “Ein pragmatischer Ansatz zur Entwicklung situationsgerechter Entwicklungsmethoden,” in <i>Software Engineering 2013 - Workshopband (inkl. Doktorandensymposium) SE 2013 (to appear)</i>, 2013, vol. 215, pp. 425--434.","chicago":"Spijkerman, Michael . “Ein Pragmatischer Ansatz Zur Entwicklung Situationsgerechter Entwicklungsmethoden.” In <i>Software Engineering 2013 - Workshopband (Inkl. Doktorandensymposium) SE 2013 (to Appear)</i>, 215:425--434. LNI. GI, 2013.","apa":"Spijkerman, M. (2013). Ein pragmatischer Ansatz zur Entwicklung situationsgerechter Entwicklungsmethoden. In <i>Software Engineering 2013 - Workshopband (inkl. Doktorandensymposium) SE 2013 (to appear)</i> (Vol. 215, pp. 425--434). GI.","bibtex":"@inproceedings{Spijkerman_2013, series={LNI}, title={Ein pragmatischer Ansatz zur Entwicklung situationsgerechter Entwicklungsmethoden}, volume={215}, booktitle={Software Engineering 2013 - Workshopband (inkl. Doktorandensymposium) SE 2013 (to appear)}, publisher={GI}, author={Spijkerman, Michael }, year={2013}, pages={425--434}, collection={LNI} }","mla":"Spijkerman, Michael. “Ein Pragmatischer Ansatz Zur Entwicklung Situationsgerechter Entwicklungsmethoden.” <i>Software Engineering 2013 - Workshopband (Inkl. Doktorandensymposium) SE 2013 (to Appear)</i>, vol. 215, GI, 2013, pp. 425--434.","short":"M. Spijkerman, in: Software Engineering 2013 - Workshopband (Inkl. Doktorandensymposium) SE 2013 (to Appear), GI, 2013, pp. 425--434."},"title":"Ein pragmatischer Ansatz zur Entwicklung situationsgerechter Entwicklungsmethoden","date_updated":"2022-01-06T07:03:55Z","publisher":"GI","volume":215,"date_created":"2019-03-08T13:53:50Z","author":[{"last_name":"Spijkerman","full_name":"Spijkerman, Michael ","first_name":"Michael "}],"status":"public","publication":"Software Engineering 2013 - Workshopband (inkl. Doktorandensymposium) SE 2013 (to appear)","type":"conference","language":[{"iso":"eng"}],"_id":"8485","department":[{"_id":"66"}],"user_id":"52534","series_title":"LNI"},{"year":"2013","intvolume":"       998","page":"9--16","citation":{"short":"B. Nagel , C. Gerth , J. Post, G. Engels, in: Proceedings of the CAiSE’13 Forum at the 25th International Conference on Advanced Information Systems Engineering (CAiSE’13), CEUR-WS.org, 2013, pp. 9--16.","bibtex":"@inproceedings{Nagel _Gerth _Post_Engels_2013, series={CEUR Workshop Proceedings}, title={Kaos4SOA - Extending KAOS Models with Temporal and Logical Dependencies}, volume={998}, booktitle={Proceedings of the CAiSE’13 Forum at the 25th International Conference on Advanced Information Systems Engineering (CAiSE’13)}, publisher={CEUR-WS.org}, author={Nagel , Benjamin  and Gerth , Christian  and Post, Jennifer  and Engels, Gregor}, year={2013}, pages={9--16}, collection={CEUR Workshop Proceedings} }","mla":"Nagel , Benjamin, et al. “Kaos4SOA - Extending KAOS Models with Temporal and Logical Dependencies.” <i>Proceedings of the CAiSE’13 Forum at the 25th International Conference on Advanced Information Systems Engineering (CAiSE’13)</i>, vol. 998, CEUR-WS.org, 2013, pp. 9--16.","apa":"Nagel , B., Gerth , C., Post, J., &#38; Engels, G. (2013). Kaos4SOA - Extending KAOS Models with Temporal and Logical Dependencies. In <i>Proceedings of the CAiSE’13 Forum at the 25th International Conference on Advanced Information Systems Engineering (CAiSE’13)</i> (Vol. 998, pp. 9--16). CEUR-WS.org.","ieee":"B. Nagel , C. Gerth , J. Post, and G. Engels, “Kaos4SOA - Extending KAOS Models with Temporal and Logical Dependencies,” in <i>Proceedings of the CAiSE’13 Forum at the 25th International Conference on Advanced Information Systems Engineering (CAiSE’13)</i>, 2013, vol. 998, pp. 9--16.","chicago":"Nagel , Benjamin , Christian  Gerth , Jennifer  Post, and Gregor Engels. “Kaos4SOA - Extending KAOS Models with Temporal and Logical Dependencies.” In <i>Proceedings of the CAiSE’13 Forum at the 25th International Conference on Advanced Information Systems Engineering (CAiSE’13)</i>, 998:9--16. CEUR Workshop Proceedings. CEUR-WS.org, 2013.","ama":"Nagel  B, Gerth  C, Post J, Engels G. Kaos4SOA - Extending KAOS Models with Temporal and Logical Dependencies. In: <i>Proceedings of the CAiSE’13 Forum at the 25th International Conference on Advanced Information Systems Engineering (CAiSE’13)</i>. Vol 998. CEUR Workshop Proceedings. CEUR-WS.org; 2013:9--16."},"publisher":"CEUR-WS.org","date_updated":"2022-01-06T07:03:55Z","volume":998,"date_created":"2019-03-08T13:55:30Z","author":[{"first_name":"Benjamin ","last_name":"Nagel ","full_name":"Nagel , Benjamin "},{"first_name":"Christian ","full_name":"Gerth , Christian ","last_name":"Gerth "},{"last_name":"Post","full_name":"Post, Jennifer ","first_name":"Jennifer "},{"first_name":"Gregor","last_name":"Engels","id":"107","full_name":"Engels, Gregor"}],"title":"Kaos4SOA - Extending KAOS Models with Temporal and Logical Dependencies","publication":"Proceedings of the CAiSE'13 Forum at the 25th International Conference on Advanced Information Systems Engineering (CAiSE'13)","type":"conference","status":"public","_id":"8486","department":[{"_id":"66"}],"series_title":"CEUR Workshop Proceedings","user_id":"52534","language":[{"iso":"eng"}]},{"date_created":"2019-03-08T13:57:51Z","author":[{"full_name":"Kehrer , Timo ","last_name":"Kehrer ","first_name":"Timo "},{"last_name":"Gerth","full_name":"Gerth, Christian ","first_name":"Christian "}],"volume":33,"publisher":"FG Softwaretechnik, Gesellschaft für Informatik e.v. (GI)","date_updated":"2022-01-06T07:03:55Z","title":"CVSM 2013 Challenge: Recognizing High-level Edit Operations in Evolving Models.","issue":"2","citation":{"apa":"Kehrer , T., &#38; Gerth, C. (2013). CVSM 2013 Challenge: Recognizing High-level Edit Operations in Evolving Models. In <i>Proceedings of the Workshop on Comparison and Versioning of Software Models (CVSM’13)</i> (Vol. 33, pp. 32–34). FG Softwaretechnik, Gesellschaft für Informatik e.v. (GI).","mla":"Kehrer , Timo, and Christian Gerth. “CVSM 2013 Challenge: Recognizing High-Level Edit Operations in Evolving Models.” <i>Proceedings of the Workshop on Comparison and Versioning of Software Models (CVSM’13)</i>, vol. 33, no. 2, FG Softwaretechnik, Gesellschaft für Informatik e.v. (GI), 2013, pp. 32–34.","short":"T. Kehrer , C. Gerth, in: Proceedings of the Workshop on Comparison and Versioning of Software Models (CVSM’13), FG Softwaretechnik, Gesellschaft für Informatik e.v. (GI), 2013, pp. 32–34.","bibtex":"@inproceedings{Kehrer _Gerth_2013, series={Softwaretechnik-Trends}, title={CVSM 2013 Challenge: Recognizing High-level Edit Operations in Evolving Models.}, volume={33}, number={2}, booktitle={Proceedings of the Workshop on Comparison and Versioning of Software Models (CVSM’13)}, publisher={FG Softwaretechnik, Gesellschaft für Informatik e.v. (GI)}, author={Kehrer , Timo  and Gerth, Christian }, year={2013}, pages={32–34}, collection={Softwaretechnik-Trends} }","ieee":"T. Kehrer  and C. Gerth, “CVSM 2013 Challenge: Recognizing High-level Edit Operations in Evolving Models.,” in <i>Proceedings of the Workshop on Comparison and Versioning of Software Models (CVSM’13)</i>, 2013, vol. 33, no. 2, pp. 32–34.","chicago":"Kehrer , Timo , and Christian  Gerth. “CVSM 2013 Challenge: Recognizing High-Level Edit Operations in Evolving Models.” In <i>Proceedings of the Workshop on Comparison and Versioning of Software Models (CVSM’13)</i>, 33:32–34. Softwaretechnik-Trends. FG Softwaretechnik, Gesellschaft für Informatik e.v. (GI), 2013.","ama":"Kehrer  T, Gerth C. CVSM 2013 Challenge: Recognizing High-level Edit Operations in Evolving Models. In: <i>Proceedings of the Workshop on Comparison and Versioning of Software Models (CVSM’13)</i>. Vol 33. Softwaretechnik-Trends. FG Softwaretechnik, Gesellschaft für Informatik e.v. (GI); 2013:32-34."},"intvolume":"        33","page":"32-34","year":"2013","user_id":"52534","series_title":"Softwaretechnik-Trends","department":[{"_id":"66"}],"_id":"8487","language":[{"iso":"eng"}],"type":"conference","publication":"Proceedings of the Workshop on Comparison and Versioning of Software Models (CVSM'13)","status":"public"},{"date_created":"2019-03-08T13:59:14Z","author":[{"first_name":"Marvin ","full_name":"Grieger , Marvin ","last_name":"Grieger "},{"full_name":"Sauer, Stefan","id":"447","last_name":"Sauer","first_name":"Stefan"}],"date_updated":"2022-01-06T07:03:55Z","publisher":"GI, Köllen Druck+Verlag GmbH, Bonn","title":"Wiederverwendbarkeit von Migrationswissen durch Techniken der modellgetriebenen Softwareentwicklung","page":"189-200","citation":{"apa":"Grieger , M., &#38; Sauer, S. (2013). Wiederverwendbarkeit von Migrationswissen durch Techniken der modellgetriebenen Softwareentwicklung. In <i>Software Engineering 2013 Workshopband</i> (pp. 189–200). GI, Köllen Druck+Verlag GmbH, Bonn.","bibtex":"@inproceedings{Grieger _Sauer_2013, title={Wiederverwendbarkeit von Migrationswissen durch Techniken der modellgetriebenen Softwareentwicklung}, booktitle={Software Engineering 2013 Workshopband}, publisher={GI, Köllen Druck+Verlag GmbH, Bonn}, author={Grieger , Marvin  and Sauer, Stefan}, year={2013}, pages={189–200} }","mla":"Grieger , Marvin, and Stefan Sauer. “Wiederverwendbarkeit von Migrationswissen Durch Techniken Der Modellgetriebenen Softwareentwicklung.” <i>Software Engineering 2013 Workshopband</i>, GI, Köllen Druck+Verlag GmbH, Bonn, 2013, pp. 189–200.","short":"M. Grieger , S. Sauer, in: Software Engineering 2013 Workshopband, GI, Köllen Druck+Verlag GmbH, Bonn, 2013, pp. 189–200.","ieee":"M. Grieger  and S. Sauer, “Wiederverwendbarkeit von Migrationswissen durch Techniken der modellgetriebenen Softwareentwicklung,” in <i>Software Engineering 2013 Workshopband</i>, 2013, pp. 189–200.","chicago":"Grieger , Marvin , and Stefan Sauer. “Wiederverwendbarkeit von Migrationswissen Durch Techniken Der Modellgetriebenen Softwareentwicklung.” In <i>Software Engineering 2013 Workshopband</i>, 189–200. GI, Köllen Druck+Verlag GmbH, Bonn, 2013.","ama":"Grieger  M, Sauer S. Wiederverwendbarkeit von Migrationswissen durch Techniken der modellgetriebenen Softwareentwicklung. In: <i>Software Engineering 2013 Workshopband</i>. GI, Köllen Druck+Verlag GmbH, Bonn; 2013:189-200."},"year":"2013","department":[{"_id":"66"}],"user_id":"52534","_id":"8488","language":[{"iso":"eng"}],"publication":"Software Engineering 2013 Workshopband","type":"conference","status":"public"},{"language":[{"iso":"eng"}],"user_id":"52534","department":[{"_id":"66"}],"_id":"8489","status":"public","type":"conference","publication":"Proceedings of the 9th Workshop on Engineering Service-Oriented Applications (WESOA 2013) (accepted for application)","title":"Goal-driven Composition of Business Process Models","author":[{"full_name":"Nagel , Benjamin ","last_name":"Nagel ","first_name":"Benjamin "},{"full_name":"Gerth , Christian ","last_name":"Gerth ","first_name":"Christian "},{"first_name":"Gregor","full_name":"Engels, Gregor","id":"107","last_name":"Engels"}],"date_created":"2019-03-08T14:02:17Z","date_updated":"2022-01-06T07:03:55Z","citation":{"ama":"Nagel  B, Gerth  C, Engels G. Goal-driven Composition of Business Process Models. In: <i>Proceedings of the 9th Workshop on Engineering Service-Oriented Applications (WESOA 2013) (Accepted for Application)</i>. ; 2013.","ieee":"B. Nagel , C. Gerth , and G. Engels, “Goal-driven Composition of Business Process Models,” in <i>Proceedings of the 9th Workshop on Engineering Service-Oriented Applications (WESOA 2013) (accepted for application)</i>, 2013.","chicago":"Nagel , Benjamin , Christian  Gerth , and Gregor Engels. “Goal-Driven Composition of Business Process Models.” In <i>Proceedings of the 9th Workshop on Engineering Service-Oriented Applications (WESOA 2013) (Accepted for Application)</i>, 2013.","mla":"Nagel , Benjamin, et al. “Goal-Driven Composition of Business Process Models.” <i>Proceedings of the 9th Workshop on Engineering Service-Oriented Applications (WESOA 2013) (Accepted for Application)</i>, 2013.","bibtex":"@inproceedings{Nagel _Gerth _Engels_2013, title={Goal-driven Composition of Business Process Models}, booktitle={Proceedings of the 9th Workshop on Engineering Service-Oriented Applications (WESOA 2013) (accepted for application)}, author={Nagel , Benjamin  and Gerth , Christian  and Engels, Gregor}, year={2013} }","short":"B. Nagel , C. Gerth , G. Engels, in: Proceedings of the 9th Workshop on Engineering Service-Oriented Applications (WESOA 2013) (Accepted for Application), 2013.","apa":"Nagel , B., Gerth , C., &#38; Engels, G. (2013). Goal-driven Composition of Business Process Models. In <i>Proceedings of the 9th Workshop on Engineering Service-Oriented Applications (WESOA 2013) (accepted for application)</i>."},"year":"2013"},{"language":[{"iso":"eng"}],"_id":"8490","department":[{"_id":"66"}],"user_id":"52534","status":"public","publication":"Software Engineering 2013 Workshopband","type":"conference","title":"Assembly-based Method Engineering with Method Patterns","publisher":"GI, Köllen Druck+Verlag GmbH, Bonn","date_updated":"2022-01-06T07:03:56Z","author":[{"last_name":"Fazal-Baqaie ","full_name":"Fazal-Baqaie , Masud ","first_name":"Masud "},{"first_name":"Markus ","full_name":"Luckey , Markus ","last_name":"Luckey "},{"first_name":"Gregor","id":"107","full_name":"Engels, Gregor","last_name":"Engels"}],"date_created":"2019-03-08T14:03:48Z","year":"2013","page":"435-444","citation":{"bibtex":"@inproceedings{Fazal-Baqaie _Luckey _Engels_2013, title={Assembly-based Method Engineering with Method Patterns}, booktitle={Software Engineering 2013 Workshopband}, publisher={GI, Köllen Druck+Verlag GmbH, Bonn}, author={Fazal-Baqaie , Masud  and Luckey , Markus  and Engels, Gregor}, year={2013}, pages={435–444} }","mla":"Fazal-Baqaie , Masud, et al. “Assembly-Based Method Engineering with Method Patterns.” <i>Software Engineering 2013 Workshopband</i>, GI, Köllen Druck+Verlag GmbH, Bonn, 2013, pp. 435–44.","short":"M. Fazal-Baqaie , M. Luckey , G. Engels, in: Software Engineering 2013 Workshopband, GI, Köllen Druck+Verlag GmbH, Bonn, 2013, pp. 435–444.","apa":"Fazal-Baqaie , M., Luckey , M., &#38; Engels, G. (2013). Assembly-based Method Engineering with Method Patterns. In <i>Software Engineering 2013 Workshopband</i> (pp. 435–444). GI, Köllen Druck+Verlag GmbH, Bonn.","chicago":"Fazal-Baqaie , Masud , Markus  Luckey , and Gregor Engels. “Assembly-Based Method Engineering with Method Patterns.” In <i>Software Engineering 2013 Workshopband</i>, 435–44. GI, Köllen Druck+Verlag GmbH, Bonn, 2013.","ieee":"M. Fazal-Baqaie , M. Luckey , and G. Engels, “Assembly-based Method Engineering with Method Patterns,” in <i>Software Engineering 2013 Workshopband</i>, 2013, pp. 435–444.","ama":"Fazal-Baqaie  M, Luckey  M, Engels G. Assembly-based Method Engineering with Method Patterns. In: <i>Software Engineering 2013 Workshopband</i>. GI, Köllen Druck+Verlag GmbH, Bonn; 2013:435-444."}},{"related_material":{"link":[{"url":"https://www.logos-verlag.de/cgi-bin/engbuchmid?isbn=3425&lng=deu&id=","relation":"confirmation"}]},"publication_status":"published","publication_identifier":{"isbn":["978-3-8325-3425-7"]},"citation":{"mla":"Happe, Markus. <i>Performance and Thermal Management on Self-Adaptive Hybrid Multi-Cores</i>. Logos Verlag Berlin GmbH, 2013.","short":"M. Happe, Performance and Thermal Management on Self-Adaptive Hybrid Multi-Cores, Logos Verlag Berlin GmbH, Berlin, 2013.","bibtex":"@book{Happe_2013, place={Berlin}, title={Performance and thermal management on self-adaptive hybrid multi-cores}, publisher={Logos Verlag Berlin GmbH}, author={Happe, Markus}, year={2013} }","apa":"Happe, M. (2013). <i>Performance and thermal management on self-adaptive hybrid multi-cores</i>. Berlin: Logos Verlag Berlin GmbH.","ama":"Happe M. <i>Performance and Thermal Management on Self-Adaptive Hybrid Multi-Cores</i>. Berlin: Logos Verlag Berlin GmbH; 2013.","ieee":"M. Happe, <i>Performance and thermal management on self-adaptive hybrid multi-cores</i>. Berlin: Logos Verlag Berlin GmbH, 2013.","chicago":"Happe, Markus. <i>Performance and Thermal Management on Self-Adaptive Hybrid Multi-Cores</i>. Berlin: Logos Verlag Berlin GmbH, 2013."},"page":"220","year":"2013","place":"Berlin","author":[{"full_name":"Happe, Markus","last_name":"Happe","first_name":"Markus"}],"supervisor":[{"full_name":"Platzner, Marco","id":"398","last_name":"Platzner","first_name":"Marco"}],"date_created":"2017-10-17T12:42:30Z","date_updated":"2022-01-06T07:01:34Z","publisher":"Logos Verlag Berlin GmbH","title":"Performance and thermal management on self-adaptive hybrid multi-cores","type":"dissertation","status":"public","abstract":[{"text":"Handling run-time dynamics on embedded system-on-chip architectures has become more challenging over the years. On the one hand, the impact of workload and physical dynamics on the system behavior has dramatically increased. On the other hand, embedded architectures have become more complex as they have evolved from single-processor systems over multi-processor systems to hybrid multi-core platforms.Static design-time techniques no longer provide suitable solutions to deal with the run-time dynamics of today's embedded systems. Therefore, system designers have to apply run-time solutions, which have hardly been investigated for hybrid multi-core platforms.In this thesis, we present fundamental work in the new area of run-time management on hybrid multi-core platforms. We propose a novel architecture, a self-adaptive hybrid multi-core system, that combines heterogeneous processors, reconfigurable hardware cores, and monitoring cores on a single chip. Using self-adaptation on thread-level, our hybrid multi-core systems can effectively perform performance and thermal management autonomously at run-time. ","lang":"eng"}],"user_id":"477","department":[{"_id":"78"}],"project":[{"_id":"14","name":"SFB 901 - Subprojekt C2"},{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area C","_id":"4"}],"_id":"501","language":[{"iso":"eng"}]},{"_id":"506","project":[{"name":"SFB 901","_id":"1"},{"_id":"9","name":"SFB 901 - Subprojekt B1"},{"_id":"3","name":"SFB 901 - Project Area B"}],"department":[{"_id":"66"}],"user_id":"477","series_title":"LNI","ddc":["040"],"file_date_updated":"2018-03-15T10:48:11Z","language":[{"iso":"eng"}],"publication":"Proceedings of the Multikonferenz Sofware Engineering 2013 (SE 2013)","type":"conference","abstract":[{"text":"Alle Dom{\\\"a}nen und Branchen der heutigen Wirtschaft sind auf eine effiziente und effektive Entwicklung von ben{\\\"o}tigten Softwaresystemen angewiesen. Das 40 Jahre alte Prinzip der Beschaffung von Softwaresystemen durch den Einkauf von teuren, relativ unflexiblen Standardl{\\\"o}sungen beziehungsweise der noch teureren Erstellung durch Softwareh{\\\"a}user oder eigene Softwareabteilungen muss deshalb in Frage gestellt werden. Mit dem Einsatz von Cloud Computing-Techniken wird es m{\\\"o}glich, Softwaresysteme und die f{\\\"u}r den Betrieb ben{\\\"o}tigten Ressourcen nur bei Bedarf und nur in der ben{\\\"o}tigten Form einzukaufen. Mit dem Ansatz der service-orientierten Architekturen stehen Methoden zur Verf{\\\"u}gung, Software zumindest unternehmensintern flexibel zusammenzustellen. Diese ersten Ans{\\\"a}tze f{\\\"u}r eine neue Art der Entwicklung und des Betriebs von Softwaresystemen bilden den Ausgangspunkt f{\\\"u}r die Forschungen in dem seit 2011 laufenden DFG Sonderforschungsbereich (SFB) 901 „On-The-Fly Computing“ an der Universit{\\\"a}t Paderborn. Die Vision des On-The-Fly Computing ist, dass die Softwaresysteme der Zukunft aus individuell und automatisch konfigurierten und zur Ausf{\\\"u}hrung gebrachten Softwarebausteinen bestehen, die auf M{\\\"a}rkten frei gehandelt werden und flexibel kombinierbar sind. Um zu erforschen, in wie weit diese Vision realisierbar ist, werden Konzepte, Methoden und Techniken entwickelt, die eine weitestgehend automatische Konfiguration, Ausf{\\\"u}hrung und Adaption von Softwaresystemen aus auf weltweiten M{\\\"a}rkten verf{\\\"u}gbaren Services erm{\\\"o}glichen. Um diese Ziele zu erreichen, arbeiten an der Universit{\\\"a}t Paderborn Informatiker aus unterschiedlichen Disziplinen wie Softwaretechnik, Algorithmik, Rechnernetze, Systementwurf, Sicherheit und Kryptographie mit Wirtschaftswissenschaftlern zusammen, die ihre spezifische Expertise einbringen, mit der die Organisation und Weiterentwicklung des Marktes vorangetrieben werden kann.","lang":"eng"}],"status":"public","file":[{"file_id":"1306","file_name":"506-SE2013-OntheFlyComputing-GE.pdf","access_level":"closed","file_size":175876,"creator":"florida","date_created":"2018-03-15T10:48:11Z","date_updated":"2018-03-15T10:48:11Z","relation":"main_file","success":1,"content_type":"application/pdf"}],"date_updated":"2022-01-06T07:01:36Z","author":[{"first_name":"Gregor","id":"107","full_name":"Engels, Gregor","last_name":"Engels"}],"date_created":"2017-10-17T12:42:31Z","title":"On-The-Fly Computing -- Das Entwicklungs- und Betriebsparadigma fürSoftwaresysteme der Zukunft","has_accepted_license":"1","year":"2013","page":"17-18","citation":{"mla":"Engels, Gregor. “On-The-Fly Computing -- Das Entwicklungs- Und Betriebsparadigma FürSoftwaresysteme Der Zukunft.” <i>Proceedings of the Multikonferenz Sofware Engineering 2013 (SE 2013)</i>, 2013, pp. 17–18.","short":"G. Engels, in: Proceedings of the Multikonferenz Sofware Engineering 2013 (SE 2013), 2013, pp. 17–18.","bibtex":"@inproceedings{Engels_2013, series={LNI}, title={On-The-Fly Computing -- Das Entwicklungs- und Betriebsparadigma fürSoftwaresysteme der Zukunft}, booktitle={Proceedings of the Multikonferenz Sofware Engineering 2013 (SE 2013)}, author={Engels, Gregor}, year={2013}, pages={17–18}, collection={LNI} }","apa":"Engels, G. (2013). On-The-Fly Computing -- Das Entwicklungs- und Betriebsparadigma fürSoftwaresysteme der Zukunft. In <i>Proceedings of the Multikonferenz Sofware Engineering 2013 (SE 2013)</i> (pp. 17–18).","ama":"Engels G. On-The-Fly Computing -- Das Entwicklungs- und Betriebsparadigma fürSoftwaresysteme der Zukunft. In: <i>Proceedings of the Multikonferenz Sofware Engineering 2013 (SE 2013)</i>. LNI. ; 2013:17-18.","chicago":"Engels, Gregor. “On-The-Fly Computing -- Das Entwicklungs- Und Betriebsparadigma FürSoftwaresysteme Der Zukunft.” In <i>Proceedings of the Multikonferenz Sofware Engineering 2013 (SE 2013)</i>, 17–18. LNI, 2013.","ieee":"G. Engels, “On-The-Fly Computing -- Das Entwicklungs- und Betriebsparadigma fürSoftwaresysteme der Zukunft,” in <i>Proceedings of the Multikonferenz Sofware Engineering 2013 (SE 2013)</i>, 2013, pp. 17–18."}},{"author":[{"last_name":"Abshoff","full_name":"Abshoff, Sebastian","first_name":"Sebastian"},{"first_name":"Markus","full_name":"Benter, Markus","last_name":"Benter"},{"full_name":"Malatyali, Manuel","last_name":"Malatyali","first_name":"Manuel"},{"first_name":"Friedhelm","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","id":"15523"}],"date_created":"2017-10-17T12:42:31Z","date_updated":"2022-01-06T07:01:36Z","doi":"10.1007/978-3-319-03850-6_2","title":"On Two-Party Communication Through Dynamic Networks","has_accepted_license":"1","citation":{"chicago":"Abshoff, Sebastian, Markus Benter, Manuel Malatyali, and Friedhelm Meyer auf der Heide. “On Two-Party Communication Through Dynamic Networks.” In <i>Proceedings of the 17th International Conference on Principles of Distributed Systems (OPODIS)</i>, 11–22. LNCS, 2013. <a href=\"https://doi.org/10.1007/978-3-319-03850-6_2\">https://doi.org/10.1007/978-3-319-03850-6_2</a>.","ieee":"S. Abshoff, M. Benter, M. Malatyali, and F. Meyer auf der Heide, “On Two-Party Communication Through Dynamic Networks,” in <i>Proceedings of the 17th International Conference on Principles of Distributed Systems (OPODIS)</i>, 2013, pp. 11–22.","ama":"Abshoff S, Benter M, Malatyali M, Meyer auf der Heide F. On Two-Party Communication Through Dynamic Networks. In: <i>Proceedings of the 17th International Conference on Principles of Distributed Systems (OPODIS)</i>. LNCS. ; 2013:11-22. doi:<a href=\"https://doi.org/10.1007/978-3-319-03850-6_2\">10.1007/978-3-319-03850-6_2</a>","mla":"Abshoff, Sebastian, et al. “On Two-Party Communication Through Dynamic Networks.” <i>Proceedings of the 17th International Conference on Principles of Distributed Systems (OPODIS)</i>, 2013, pp. 11–22, doi:<a href=\"https://doi.org/10.1007/978-3-319-03850-6_2\">10.1007/978-3-319-03850-6_2</a>.","bibtex":"@inproceedings{Abshoff_Benter_Malatyali_Meyer auf der Heide_2013, series={LNCS}, title={On Two-Party Communication Through Dynamic Networks}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-03850-6_2\">10.1007/978-3-319-03850-6_2</a>}, booktitle={Proceedings of the 17th International Conference on Principles of Distributed Systems (OPODIS)}, author={Abshoff, Sebastian and Benter, Markus and Malatyali, Manuel and Meyer auf der Heide, Friedhelm}, year={2013}, pages={11–22}, collection={LNCS} }","short":"S. Abshoff, M. Benter, M. Malatyali, F. Meyer auf der Heide, in: Proceedings of the 17th International Conference on Principles of Distributed Systems (OPODIS), 2013, pp. 11–22.","apa":"Abshoff, S., Benter, M., Malatyali, M., &#38; Meyer auf der Heide, F. (2013). On Two-Party Communication Through Dynamic Networks. In <i>Proceedings of the 17th International Conference on Principles of Distributed Systems (OPODIS)</i> (pp. 11–22). <a href=\"https://doi.org/10.1007/978-3-319-03850-6_2\">https://doi.org/10.1007/978-3-319-03850-6_2</a>"},"page":"11-22","year":"2013","series_title":"LNCS","user_id":"15504","department":[{"_id":"63"}],"project":[{"_id":"1","name":"SFB 901"},{"_id":"5","name":"SFB 901 - Subprojekt A1"},{"name":"SFB 901 - Project Area A","_id":"2"}],"_id":"507","file_date_updated":"2018-03-15T10:47:31Z","ddc":["040"],"type":"conference","publication":"Proceedings of the 17th International Conference on Principles of Distributed Systems (OPODIS)","file":[{"file_size":181398,"file_name":"507-on-two-party-communication-through-dynamic-networks_01.pdf","access_level":"closed","file_id":"1305","date_updated":"2018-03-15T10:47:31Z","date_created":"2018-03-15T10:47:31Z","creator":"florida","success":1,"relation":"main_file","content_type":"application/pdf"}],"status":"public","abstract":[{"text":"We study two-party communication in the context of directed dynamic networks that are controlled by an adaptive adversary. This adversary is able to change all edges as long as the networks stay strongly-connected in each round. In this work, we establish a relation between counting the total number of nodes in the network and the problem of exchanging tokens between two communication partners which communicate through a dynamic network. We show that the communication problem for a constant fraction of n tokens in a dynamic network with n nodes is at most as hard as counting the number of nodes in a dynamic network with at most 4n+3 nodes. For the proof, we construct a family of directed dynamic networks and apply a lower bound from two-party communication complexity.","lang":"eng"}]},{"date_created":"2017-10-17T12:42:31Z","author":[{"first_name":"Philip","last_name":"Wette","full_name":"Wette, Philip"},{"first_name":"Holger","id":"126","full_name":"Karl, Holger","last_name":"Karl"}],"date_updated":"2022-01-06T07:01:37Z","doi":"10.1109/LANMAN.2013.6528271","title":"On the Quality of Selfish Virtual Topology Reconfiguration in IP-over-WDM Networks","has_accepted_license":"1","citation":{"apa":"Wette, P., &#38; Karl, H. (2013). On the Quality of Selfish Virtual Topology Reconfiguration in IP-over-WDM Networks. In <i>Proceedings of the 19th IEEE International Workshop on Local and Metropolitan Area Networks (IEEE LANMAN)</i> (pp. 1–6). <a href=\"https://doi.org/10.1109/LANMAN.2013.6528271\">https://doi.org/10.1109/LANMAN.2013.6528271</a>","short":"P. Wette, H. Karl, in: Proceedings of the 19th IEEE International Workshop on Local and Metropolitan Area Networks (IEEE LANMAN), 2013, pp. 1–6.","bibtex":"@inproceedings{Wette_Karl_2013, title={On the Quality of Selfish Virtual Topology Reconfiguration in IP-over-WDM Networks}, DOI={<a href=\"https://doi.org/10.1109/LANMAN.2013.6528271\">10.1109/LANMAN.2013.6528271</a>}, booktitle={Proceedings of the 19th IEEE International Workshop on Local and Metropolitan Area Networks (IEEE LANMAN)}, author={Wette, Philip and Karl, Holger}, year={2013}, pages={1–6} }","mla":"Wette, Philip, and Holger Karl. “On the Quality of Selfish Virtual Topology Reconfiguration in IP-over-WDM Networks.” <i>Proceedings of the 19th IEEE International Workshop on Local and Metropolitan Area Networks (IEEE LANMAN)</i>, 2013, pp. 1–6, doi:<a href=\"https://doi.org/10.1109/LANMAN.2013.6528271\">10.1109/LANMAN.2013.6528271</a>.","ama":"Wette P, Karl H. On the Quality of Selfish Virtual Topology Reconfiguration in IP-over-WDM Networks. In: <i>Proceedings of the 19th IEEE International Workshop on Local and Metropolitan Area Networks (IEEE LANMAN)</i>. ; 2013:1-6. doi:<a href=\"https://doi.org/10.1109/LANMAN.2013.6528271\">10.1109/LANMAN.2013.6528271</a>","chicago":"Wette, Philip, and Holger Karl. “On the Quality of Selfish Virtual Topology Reconfiguration in IP-over-WDM Networks.” In <i>Proceedings of the 19th IEEE International Workshop on Local and Metropolitan Area Networks (IEEE LANMAN)</i>, 1–6, 2013. <a href=\"https://doi.org/10.1109/LANMAN.2013.6528271\">https://doi.org/10.1109/LANMAN.2013.6528271</a>.","ieee":"P. Wette and H. Karl, “On the Quality of Selfish Virtual Topology Reconfiguration in IP-over-WDM Networks,” in <i>Proceedings of the 19th IEEE International Workshop on Local and Metropolitan Area Networks (IEEE LANMAN)</i>, 2013, pp. 1–6."},"page":"1 - 6 ","year":"2013","user_id":"15572","department":[{"_id":"75"}],"project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt A2","_id":"6"},{"name":"SFB 901 - Project Area A","_id":"2"}],"_id":"508","file_date_updated":"2018-03-15T10:50:19Z","ddc":["040"],"type":"conference","publication":"Proceedings of the 19th IEEE International Workshop on Local and Metropolitan Area Networks (IEEE LANMAN)","file":[{"relation":"main_file","success":1,"content_type":"application/pdf","access_level":"closed","file_name":"508-06528271.pdf","file_id":"1307","file_size":219902,"creator":"florida","date_created":"2018-03-15T10:50:19Z","date_updated":"2018-03-15T10:50:19Z"}],"status":"public","abstract":[{"lang":"eng","text":"The process of planning a virtual topology for a Wavelength Devision Multiplexing (WDM) network is called Virtual Topology Design (VTD). The goal of VTD is to find a virtual topology that supports forwarding the expected traffic without congestion. In networks with fluctuating, high traffic demands, it can happen that no single topology fits all changing traffic demands occurring over a longer time. Thus, during operation, the virtual topology has to be reconfigured. Since modern networks tend to be large, VTD algorithms have to scale well with increasing network size, requiring distributed algorithms. Existing distributed VTD algorithms, however, react too slowly on congestion for the real-time reconfiguration of large networks. We propose Selfish Virtual Topology Reconfiguration (SVTR) as a new algorithm for distributed VTD. It combines reconfiguring the virtual topology and routing through a Software Defined Network (SDN). SVTR is used for online, on-the-fly network reconfiguration. Its integrated routing and WDM reconfiguration keeps connection disruption due to network reconfiguration to a minimum and is able to react very quickly to traffic pattern changes. SVTR works by iteratively adapting the virtual topology to the observed traffic patterns without global traffic information and without future traffic estimations. We evaluated SVTR by simulation and found that it significantly lowers congestion in realistic networks and high load scenarios."}]},{"abstract":[{"text":"In this paper we will introduce a new d-dimensional graph for constructing geometric application layer overlay net-works. Our approach will use internet coordinates, embedded using the L∞ -metric. After describing the graph structure, we will show how it limits maintenance overhead by bounding each node’s out-degree and how it supports greedy routing using one-hop neighbourhood information in each routing step. We will further show that greedy routing can always compute a path in our graph and we will also prove that in each forwarding step the next hop is closer to the destination than the current node.","lang":"eng"}],"status":"public","file":[{"file_size":197048,"file_id":"1304","access_level":"closed","file_name":"509-06529245.pdf","date_updated":"2018-03-15T10:46:51Z","date_created":"2018-03-15T10:46:51Z","creator":"florida","success":1,"relation":"main_file","content_type":"application/pdf"}],"publication":"Proceedings of the Conference on Networked Systems (NetSys)","type":"conference","ddc":["040"],"file_date_updated":"2018-03-15T10:46:51Z","_id":"509","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt A2","_id":"6"},{"name":"SFB 901 - Project Area A","_id":"2"}],"department":[{"_id":"75"}],"user_id":"15504","year":"2013","page":"126-131","citation":{"apa":"Autenrieth, M., &#38; Frey, H. (2013). On Greedy Routing in Degree-bounded Graphs over d-Dimensional Internet Coordinate Embeddings. In <i>Proceedings of the Conference on Networked Systems (NetSys)</i> (pp. 126–131). <a href=\"https://doi.org/10.1109/NetSys.2013.10\">https://doi.org/10.1109/NetSys.2013.10</a>","bibtex":"@inproceedings{Autenrieth_Frey_2013, title={On Greedy Routing in Degree-bounded Graphs over d-Dimensional Internet Coordinate Embeddings}, DOI={<a href=\"https://doi.org/10.1109/NetSys.2013.10\">10.1109/NetSys.2013.10</a>}, booktitle={Proceedings of the Conference on Networked Systems (NetSys)}, author={Autenrieth, Marcus and Frey, Hannes}, year={2013}, pages={126–131} }","mla":"Autenrieth, Marcus, and Hannes Frey. “On Greedy Routing in Degree-Bounded Graphs over d-Dimensional Internet Coordinate Embeddings.” <i>Proceedings of the Conference on Networked Systems (NetSys)</i>, 2013, pp. 126–31, doi:<a href=\"https://doi.org/10.1109/NetSys.2013.10\">10.1109/NetSys.2013.10</a>.","short":"M. Autenrieth, H. Frey, in: Proceedings of the Conference on Networked Systems (NetSys), 2013, pp. 126–131.","ieee":"M. Autenrieth and H. Frey, “On Greedy Routing in Degree-bounded Graphs over d-Dimensional Internet Coordinate Embeddings,” in <i>Proceedings of the Conference on Networked Systems (NetSys)</i>, 2013, pp. 126–131.","chicago":"Autenrieth, Marcus, and Hannes Frey. “On Greedy Routing in Degree-Bounded Graphs over d-Dimensional Internet Coordinate Embeddings.” In <i>Proceedings of the Conference on Networked Systems (NetSys)</i>, 126–31, 2013. <a href=\"https://doi.org/10.1109/NetSys.2013.10\">https://doi.org/10.1109/NetSys.2013.10</a>.","ama":"Autenrieth M, Frey H. On Greedy Routing in Degree-bounded Graphs over d-Dimensional Internet Coordinate Embeddings. In: <i>Proceedings of the Conference on Networked Systems (NetSys)</i>. ; 2013:126-131. doi:<a href=\"https://doi.org/10.1109/NetSys.2013.10\">10.1109/NetSys.2013.10</a>"},"has_accepted_license":"1","title":"On Greedy Routing in Degree-bounded Graphs over d-Dimensional Internet Coordinate Embeddings","doi":"10.1109/NetSys.2013.10","date_updated":"2022-01-06T07:01:37Z","date_created":"2017-10-17T12:42:31Z","author":[{"last_name":"Autenrieth","full_name":"Autenrieth, Marcus","first_name":"Marcus"},{"full_name":"Frey, Hannes","last_name":"Frey","first_name":"Hannes"}]},{"department":[{"_id":"75"}],"user_id":"15504","_id":"511","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt A2","_id":"6"},{"_id":"2","name":"SFB 901 - Project Area A"}],"status":"public","type":"bachelorsthesis","title":"MapReduce in Software Defined Networks","author":[{"first_name":"Malte","full_name":"Splietker, Malte","last_name":"Splietker"}],"date_created":"2017-10-17T12:42:32Z","publisher":"Universität Paderborn","date_updated":"2022-01-06T07:01:38Z","citation":{"apa":"Splietker, M. (2013). <i>MapReduce in Software Defined Networks</i>. Universität Paderborn.","mla":"Splietker, Malte. <i>MapReduce in Software Defined Networks</i>. Universität Paderborn, 2013.","bibtex":"@book{Splietker_2013, title={MapReduce in Software Defined Networks}, publisher={Universität Paderborn}, author={Splietker, Malte}, year={2013} }","short":"M. Splietker, MapReduce in Software Defined Networks, Universität Paderborn, 2013.","chicago":"Splietker, Malte. <i>MapReduce in Software Defined Networks</i>. Universität Paderborn, 2013.","ieee":"M. Splietker, <i>MapReduce in Software Defined Networks</i>. Universität Paderborn, 2013.","ama":"Splietker M. <i>MapReduce in Software Defined Networks</i>. Universität Paderborn; 2013."},"year":"2013"},{"doi":"10.1109/IPDPS.2013.40","title":"Locally Self-Adjusting Tree Networks","author":[{"last_name":"Avin","full_name":"Avin, Chen","first_name":"Chen"},{"last_name":"Häupler","full_name":"Häupler, Bernhard","first_name":"Bernhard"},{"last_name":"Lotker","full_name":"Lotker, Zvi","first_name":"Zvi"},{"id":"20792","full_name":"Scheideler, Christian","last_name":"Scheideler","first_name":"Christian"},{"first_name":"Stefan","last_name":"Schmid","full_name":"Schmid, Stefan"}],"date_created":"2017-10-17T12:42:32Z","date_updated":"2022-01-06T07:01:38Z","page":"395-406","citation":{"chicago":"Avin, Chen, Bernhard Häupler, Zvi Lotker, Christian Scheideler, and Stefan Schmid. “Locally Self-Adjusting Tree Networks.” In <i>Proceedings of the 27th IEEE International Parallel and Distributed Processing Symposium (IPDPS)</i>, 395–406, 2013. <a href=\"https://doi.org/10.1109/IPDPS.2013.40\">https://doi.org/10.1109/IPDPS.2013.40</a>.","ieee":"C. Avin, B. Häupler, Z. Lotker, C. Scheideler, and S. Schmid, “Locally Self-Adjusting Tree Networks,” in <i>Proceedings of the 27th IEEE International Parallel and Distributed Processing Symposium (IPDPS)</i>, 2013, pp. 395–406.","ama":"Avin C, Häupler B, Lotker Z, Scheideler C, Schmid S. Locally Self-Adjusting Tree Networks. In: <i>Proceedings of the 27th IEEE International Parallel and Distributed Processing Symposium (IPDPS)</i>. ; 2013:395-406. doi:<a href=\"https://doi.org/10.1109/IPDPS.2013.40\">10.1109/IPDPS.2013.40</a>","apa":"Avin, C., Häupler, B., Lotker, Z., Scheideler, C., &#38; Schmid, S. (2013). Locally Self-Adjusting Tree Networks. In <i>Proceedings of the 27th IEEE International Parallel and Distributed Processing Symposium (IPDPS)</i> (pp. 395–406). <a href=\"https://doi.org/10.1109/IPDPS.2013.40\">https://doi.org/10.1109/IPDPS.2013.40</a>","bibtex":"@inproceedings{Avin_Häupler_Lotker_Scheideler_Schmid_2013, title={Locally Self-Adjusting Tree Networks}, DOI={<a href=\"https://doi.org/10.1109/IPDPS.2013.40\">10.1109/IPDPS.2013.40</a>}, booktitle={Proceedings of the 27th IEEE International Parallel and Distributed Processing Symposium (IPDPS)}, author={Avin, Chen and Häupler, Bernhard and Lotker, Zvi and Scheideler, Christian and Schmid, Stefan}, year={2013}, pages={395–406} }","short":"C. Avin, B. Häupler, Z. Lotker, C. Scheideler, S. Schmid, in: Proceedings of the 27th IEEE International Parallel and Distributed Processing Symposium (IPDPS), 2013, pp. 395–406.","mla":"Avin, Chen, et al. “Locally Self-Adjusting Tree Networks.” <i>Proceedings of the 27th IEEE International Parallel and Distributed Processing Symposium (IPDPS)</i>, 2013, pp. 395–406, doi:<a href=\"https://doi.org/10.1109/IPDPS.2013.40\">10.1109/IPDPS.2013.40</a>."},"year":"2013","has_accepted_license":"1","file_date_updated":"2018-03-15T10:45:15Z","ddc":["040"],"department":[{"_id":"79"}],"user_id":"15504","_id":"513","project":[{"name":"SFB 901","_id":"1"},{"_id":"5","name":"SFB 901 - Subprojekt A1"},{"_id":"2","name":"SFB 901 - Project Area A"}],"status":"public","file":[{"access_level":"closed","file_name":"513-ipdps13_01.pdf","file_id":"1303","file_size":518804,"date_created":"2018-03-15T10:45:15Z","creator":"florida","date_updated":"2018-03-15T10:45:15Z","relation":"main_file","success":1,"content_type":"application/pdf"}],"abstract":[{"text":"This paper initiates the study of self-adjusting networks (or distributed data structures) whose topologies dynamically adapt to a communication pattern $\\sigma$. We present a fully decentralized self-adjusting solution called SplayNet. A SplayNet is a distributed generalization of the classic splay tree concept. It ensures short paths (which can be found using local-greedy routing) between communication partners while minimizing topological rearrangements. We derive an upper bound for the amortized communication cost of a SplayNet based on empirical entropies of $\\sigma$, and show that SplayNets have several interesting convergence properties. For instance, SplayNets features a provable online optimality under special requests scenarios. We also investigate the optimal static network and prove different lower bounds for the average communication cost based on graph cuts and on the empirical entropy of the communication pattern $\\sigma$. From these lower bounds it follows, e.g., that SplayNets are optimal in scenarios where the requests follow a product distribution as well. Finally, this paper shows that in contrast to the Minimum Linear Arrangement problem which is generally NP-hard, the optimal static tree network can be computed in polynomial time for any guest graph, despite the exponentially large graph family. We complement our formal analysis with a small simulation study on a Facebook graph.","lang":"eng"}],"publication":"Proceedings of the 27th IEEE International Parallel and Distributed Processing Symposium (IPDPS)","type":"conference"},{"year":"2013","citation":{"ama":"Pietrzyk P. <i>Local and Online Algorithms for Facility Location</i>. Universität Paderborn; 2013.","ieee":"P. Pietrzyk, <i>Local and Online Algorithms for Facility Location</i>. Universität Paderborn, 2013.","chicago":"Pietrzyk, Peter. <i>Local and Online Algorithms for Facility Location</i>. Universität Paderborn, 2013.","mla":"Pietrzyk, Peter. <i>Local and Online Algorithms for Facility Location</i>. Universität Paderborn, 2013.","short":"P. Pietrzyk, Local and Online Algorithms for Facility Location, Universität Paderborn, 2013.","bibtex":"@book{Pietrzyk_2013, title={Local and Online Algorithms for Facility Location}, publisher={Universität Paderborn}, author={Pietrzyk, Peter}, year={2013} }","apa":"Pietrzyk, P. (2013). <i>Local and Online Algorithms for Facility Location</i>. Universität Paderborn."},"has_accepted_license":"1","title":"Local and Online Algorithms for Facility Location","date_updated":"2022-01-06T07:01:38Z","publisher":"Universität Paderborn","supervisor":[{"first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm","id":"15523","last_name":"Meyer auf der Heide"}],"author":[{"first_name":"Peter","last_name":"Pietrzyk","full_name":"Pietrzyk, Peter"}],"date_created":"2017-10-17T12:42:32Z","abstract":[{"lang":"eng","text":"Diese Arbeit besch{\\\"a}ftigt sich mit dem Facility Location Problem. Dies ist ein Optimierungsproblem, bei dem festgelegt werden muss an welchen Positionen Ressourcen zur Verf{\\\"u}gung gestellt werden, so dass diese von Nutzern gut erreicht werden k{\\\"o}nnen. Es sollen dabei Kosten minimiert werden, die zum einen durch Bereitstellung von Ressourcen und zum anderen durch Verbindungskosten zwischen Nutzern und Ressourcen entstehen. Die Schwierigkeit des Problems liegt darin, dass man einerseits m{\\\"o}glichst wenige Ressourcen zur Verf{\\\"u}gung stellen m{\\\"o}chte, andererseits daf{\\\"u}r sorgen muss, dass sich Nutzer nicht all zu weit weg von Ressourcen befinden. Dies w{\\\"u}rde n{\\\"a}mlich hohe Verbindungskosten nach sich ziehen. Das Facility Location Problem wurde bereits sehr intensiv in vielen unterschiedlichen Varianten untersucht. In dieser Arbeit werden drei Varianten des Problems modelliert und neue Algorithmen f{\\\"u}r sie entwickelt und bez{\\\"u}glich ihres Approximationsfaktors und ihrer Laufzeit analysiert. Jede dieser drei untersuchten Varianten hat einen besonderen Schwerpunkt. Bei der ersten Varianten handelt es sich um ein Online Problem, da hier die Eingabe nicht von Anfang an bekannt ist, sondern Schritt f{\\\"u}r Schritt enth{\\\"u}llt wird. Die Schwierigkeit hierbei besteht darin unwiderrufliche Entscheidungen treffen zu m{\\\"u}ssen ohne dabei die Zukunft zu kennen und trotzdem eine zu jeder Zeit gute L{\\\"o}sung angeben zu k{\\\"o}nnen. Der Schwerpunkt der zweiten Variante liegt auf Lokalit{\\\"a}t, die z.B. in Sensornetzwerken von großer Bedeutung ist. Hier soll eine L{\\\"o}sung verteilt und nur mit Hilfe von lokalen Information berechnet werden. Schließlich besch{\\\"a}ftigt sich die dritte Variante mit einer verteilten Berechnung, bei welcher nur eine stark beschr{\\\"a}nkte Datenmenge verschickt werden darf und dabei trotzdem ein sehr guter Approximationsfaktor erreicht werden muss. Die bei der Analyse der Approximationsfaktoren bzw. der Kompetitivit{\\\"a}t verwendeten Techniken basieren zum großen Teil auf Absch{\\\"a}tzung der primalen L{\\\"o}sung mit Hilfe einer L{\\\"o}sung des zugeh{\\\"o}rigen dualen Problems. F{\\\"u}r die Modellierung von Lokalit{\\\"a}t wird das weitverbreitete LOCAL Modell verwendet. In diesem Modell werden f{\\\"u}r die Algorithmen subpolynomielle obere Laufzeitschranken gezeigt."}],"file":[{"creator":"florida","date_created":"2018-03-15T10:44:13Z","date_updated":"2018-03-15T10:44:13Z","file_name":"514-DissertationPietrzyk.pdf","file_id":"1302","access_level":"closed","file_size":790821,"content_type":"application/pdf","relation":"main_file","success":1}],"status":"public","type":"dissertation","ddc":["040"],"file_date_updated":"2018-03-15T10:44:13Z","project":[{"name":"SFB 901","_id":"1"},{"_id":"5","name":"SFB 901 - Subprojekt A1"},{"_id":"2","name":"SFB 901 - Project Area A"}],"_id":"514","user_id":"477","department":[{"_id":"63"}]},{"doi":"10.1109/ICECCS.2013.14","title":"Knowledge-Based Verification of Service Compositions - An SMT approach","date_created":"2017-10-17T12:42:33Z","author":[{"first_name":"Sven","full_name":"Walther, Sven","last_name":"Walther"},{"first_name":"Heike","last_name":"Wehrheim","full_name":"Wehrheim, Heike","id":"573"}],"date_updated":"2022-01-06T07:01:41Z","page":"24 - 32 ","citation":{"chicago":"Walther, Sven, and Heike Wehrheim. “Knowledge-Based Verification of Service Compositions - An SMT Approach.” In <i>Proceedings of the 18th IEEE International Conference on Engineering of Complex Computer Systems (ICECCS)</i>, 24–32, 2013. <a href=\"https://doi.org/10.1109/ICECCS.2013.14\">https://doi.org/10.1109/ICECCS.2013.14</a>.","ieee":"S. Walther and H. Wehrheim, “Knowledge-Based Verification of Service Compositions - An SMT approach,” in <i>Proceedings of the 18th IEEE International Conference on Engineering of Complex Computer Systems (ICECCS)</i>, 2013, pp. 24–32.","ama":"Walther S, Wehrheim H. Knowledge-Based Verification of Service Compositions - An SMT approach. In: <i>Proceedings of the 18th IEEE International Conference on Engineering of Complex Computer Systems (ICECCS)</i>. ; 2013:24-32. doi:<a href=\"https://doi.org/10.1109/ICECCS.2013.14\">10.1109/ICECCS.2013.14</a>","short":"S. Walther, H. Wehrheim, in: Proceedings of the 18th IEEE International Conference on Engineering of Complex Computer Systems (ICECCS), 2013, pp. 24–32.","bibtex":"@inproceedings{Walther_Wehrheim_2013, title={Knowledge-Based Verification of Service Compositions - An SMT approach}, DOI={<a href=\"https://doi.org/10.1109/ICECCS.2013.14\">10.1109/ICECCS.2013.14</a>}, booktitle={Proceedings of the 18th IEEE International Conference on Engineering of Complex Computer Systems (ICECCS)}, author={Walther, Sven and Wehrheim, Heike}, year={2013}, pages={24–32} }","mla":"Walther, Sven, and Heike Wehrheim. “Knowledge-Based Verification of Service Compositions - An SMT Approach.” <i>Proceedings of the 18th IEEE International Conference on Engineering of Complex Computer Systems (ICECCS)</i>, 2013, pp. 24–32, doi:<a href=\"https://doi.org/10.1109/ICECCS.2013.14\">10.1109/ICECCS.2013.14</a>.","apa":"Walther, S., &#38; Wehrheim, H. (2013). Knowledge-Based Verification of Service Compositions - An SMT approach. In <i>Proceedings of the 18th IEEE International Conference on Engineering of Complex Computer Systems (ICECCS)</i> (pp. 24–32). <a href=\"https://doi.org/10.1109/ICECCS.2013.14\">https://doi.org/10.1109/ICECCS.2013.14</a>"},"year":"2013","has_accepted_license":"1","language":[{"iso":"eng"}],"file_date_updated":"2018-11-02T13:26:08Z","ddc":["000"],"department":[{"_id":"77"}],"user_id":"477","_id":"517","project":[{"_id":"1","name":"SFB 901"},{"_id":"11","name":"SFB 901 - Subprojekt B3"},{"name":"SFB 901 - Project Area B","_id":"3"}],"status":"public","file":[{"content_type":"application/pdf","relation":"main_file","date_updated":"2018-11-02T13:26:08Z","creator":"ups","date_created":"2018-11-02T13:26:08Z","file_size":217085,"file_id":"5248","access_level":"closed","file_name":"06601801.pdf"}],"abstract":[{"lang":"eng","text":"In the Semantic (Web) Services area, services are considered black boxes with a semantic description of their interfaces as to allow for precise service selection and configuration. The semantic description is usually grounded on domain-specific concepts as modeled in ontologies. This accounts for types used in service signatures, but also predicates occurring in preconditions and effects of services. Ontologies, in particular those enhanced with rules, capture the knowledge of domain experts on properties of and relations between domain concepts. In this paper, we present a verification technique for service compositions which makes use of this domain knowledge. We consider a service composition to be an assembly of services of which we just know signatures, preconditions, and effects. We aim at proving that a composition satisfies a (user-defined) requirement, specified in terms of guaranteed preconditions and required postconditions. As an underlying verification engine we use an SMT solver. To take advantage of the domain knowledge (and often, to enable verification at all), the knowledge is fed into the solver in the form of sorts, uninterpreted functions and in particular assertions as to enhance the solver’s reasoning capabilities. Thereby, we allow for deductions within a domain previously unknown to the solver. We exemplify our technique on a case study from the area of water network optimization software."}],"publication":"Proceedings of the 18th IEEE International Conference on Engineering of Complex Computer Systems (ICECCS)","type":"conference"},{"file_date_updated":"2018-03-15T10:38:34Z","ddc":["040"],"user_id":"15504","department":[{"_id":"79"}],"project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt C1","_id":"13"},{"_id":"4","name":"SFB 901 - Project Area C"}],"_id":"519","file":[{"success":1,"relation":"main_file","content_type":"application/pdf","file_size":554618,"access_level":"closed","file_id":"1299","file_name":"519-iris-spaa2013_01.pdf","date_updated":"2018-03-15T10:38:34Z","date_created":"2018-03-15T10:38:34Z","creator":"florida"}],"status":"public","abstract":[{"text":"In this work we present the first scalable distributed information system,i.e., a system with low storage overhead, that is provably robust againstDenial-of-Service (DoS) attacks by a current insider. We allow acurrent insider to have complete knowledge about the information systemand to have the power to block any \\epsilon-fraction of its serversby a DoS-attack, where \\epsilon can be chosen up to a constant. The taskof the system is to serve any collection of lookup requests with at most oneper non-blocked server in an efficient way despite this attack. Previously,scalable solutions were only known for DoS-attacks of past insiders, where apast insider only has complete knowledge about some past time pointt_0 of the information system. Scheideler et al. (DISC 2007, SPAA 2009) showedthat in this case it is possible to design an information system so that anyinformation that was inserted or last updated after t_0 is safe against a DoS-attack. But their constructions would not work at all for a current insider. The key idea behindour IRIS system is to make extensive use of coding. More precisely, we presenttwo alternative distributed coding strategies with an at most logarithmicstorage overhead that can handle up to a constant fraction of blocked servers.","lang":"eng"}],"type":"conference","publication":"Proceedings of the 25th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)","doi":"10.1145/2486159.2486186","title":"IRIS: A Robust Information System Against Insider DoS-Attacks","date_created":"2017-10-17T12:42:33Z","author":[{"last_name":"Eikel","full_name":"Eikel, Martina","first_name":"Martina"},{"last_name":"Scheideler","id":"20792","full_name":"Scheideler, Christian","first_name":"Christian"}],"date_updated":"2022-01-06T07:01:42Z","citation":{"chicago":"Eikel, Martina, and Christian Scheideler. “IRIS: A Robust Information System Against Insider DoS-Attacks.” In <i>Proceedings of the 25th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)</i>, 119–29, 2013. <a href=\"https://doi.org/10.1145/2486159.2486186\">https://doi.org/10.1145/2486159.2486186</a>.","ieee":"M. Eikel and C. Scheideler, “IRIS: A Robust Information System Against Insider DoS-Attacks,” in <i>Proceedings of the 25th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)</i>, 2013, pp. 119–129.","ama":"Eikel M, Scheideler C. IRIS: A Robust Information System Against Insider DoS-Attacks. In: <i>Proceedings of the 25th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)</i>. ; 2013:119-129. doi:<a href=\"https://doi.org/10.1145/2486159.2486186\">10.1145/2486159.2486186</a>","apa":"Eikel, M., &#38; Scheideler, C. (2013). IRIS: A Robust Information System Against Insider DoS-Attacks. In <i>Proceedings of the 25th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)</i> (pp. 119–129). <a href=\"https://doi.org/10.1145/2486159.2486186\">https://doi.org/10.1145/2486159.2486186</a>","short":"M. Eikel, C. Scheideler, in: Proceedings of the 25th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 2013, pp. 119–129.","mla":"Eikel, Martina, and Christian Scheideler. “IRIS: A Robust Information System Against Insider DoS-Attacks.” <i>Proceedings of the 25th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)</i>, 2013, pp. 119–29, doi:<a href=\"https://doi.org/10.1145/2486159.2486186\">10.1145/2486159.2486186</a>.","bibtex":"@inproceedings{Eikel_Scheideler_2013, title={IRIS: A Robust Information System Against Insider DoS-Attacks}, DOI={<a href=\"https://doi.org/10.1145/2486159.2486186\">10.1145/2486159.2486186</a>}, booktitle={Proceedings of the 25th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)}, author={Eikel, Martina and Scheideler, Christian}, year={2013}, pages={119–129} }"},"page":"119-129","year":"2013","has_accepted_license":"1"},{"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt A2","_id":"6"},{"name":"SFB 901 - Project Area A","_id":"2"}],"_id":"520","user_id":"15504","department":[{"_id":"75"}],"ddc":["040"],"file_date_updated":"2018-03-15T10:38:04Z","type":"conference","publication":"Proceedings of the 32nd IEEE International Conference on Computer Communications (INFOCOM)","abstract":[{"lang":"eng","text":"Preemptive Routing and Wavelength Assignment (RWA) algorithms preempt established lightpaths in case not enough resources are available to set up a new lightpath in a Wavelength Division Multiplexing (WDM) network. The selection of lightpaths to be preempted relies on internal decisions of the RWA algorithm. Thus, if dedicated properties of the network topology are required by the applications running on the network, these requirements have to be known to the RWA algorithm.Otherwise it might happen that by preempting a particular lightpath these requirements are violated. If, however, these requirements include parametersknown only at the nodes running the application, the RWA algorithm cannot evaluate the requirements. For this reason an RWA algorithm is needed which incorporates feedback from the application layer in the preemption decisions.This work proposes a simple interface along with an algorithm for computing and selecting preemption candidates in case a lightpath cannot be established. We reason about the necessity of using information from the application layer in the RWA and present two example applications which benefit from this idea."}],"file":[{"date_updated":"2018-03-15T10:38:04Z","date_created":"2018-03-15T10:38:04Z","creator":"florida","file_size":131502,"file_name":"520-wetteinfocom2013.pdf","access_level":"closed","file_id":"1298","content_type":"application/pdf","success":1,"relation":"main_file"}],"status":"public","date_updated":"2022-01-06T07:01:43Z","author":[{"first_name":"Philip","last_name":"Wette","full_name":"Wette, Philip"},{"first_name":"Holger","last_name":"Karl","id":"126","full_name":"Karl, Holger"}],"date_created":"2017-10-17T12:42:33Z","title":"Incorporating feedback from application layer into routing and wavelength assignment algorithms","main_file_link":[{"url":"http://ieeexplore.ieee.org/document/6970733/"}],"doi":"10.1109/INFCOMW.2013.6970733","has_accepted_license":"1","year":"2013","citation":{"ieee":"P. Wette and H. Karl, “Incorporating feedback from application layer into routing and wavelength assignment algorithms,” in <i>Proceedings of the 32nd IEEE International Conference on Computer Communications (INFOCOM)</i>, 2013, pp. 51–52.","chicago":"Wette, Philip, and Holger Karl. “Incorporating Feedback from Application Layer into Routing and Wavelength Assignment Algorithms.” In <i>Proceedings of the 32nd IEEE International Conference on Computer Communications (INFOCOM)</i>, 51–52, 2013. <a href=\"https://doi.org/10.1109/INFCOMW.2013.6970733\">https://doi.org/10.1109/INFCOMW.2013.6970733</a>.","ama":"Wette P, Karl H. Incorporating feedback from application layer into routing and wavelength assignment algorithms. In: <i>Proceedings of the 32nd IEEE International Conference on Computer Communications (INFOCOM)</i>. ; 2013:51-52. doi:<a href=\"https://doi.org/10.1109/INFCOMW.2013.6970733\">10.1109/INFCOMW.2013.6970733</a>","apa":"Wette, P., &#38; Karl, H. (2013). Incorporating feedback from application layer into routing and wavelength assignment algorithms. In <i>Proceedings of the 32nd IEEE International Conference on Computer Communications (INFOCOM)</i> (pp. 51–52). <a href=\"https://doi.org/10.1109/INFCOMW.2013.6970733\">https://doi.org/10.1109/INFCOMW.2013.6970733</a>","short":"P. Wette, H. Karl, in: Proceedings of the 32nd IEEE International Conference on Computer Communications (INFOCOM), 2013, pp. 51–52.","mla":"Wette, Philip, and Holger Karl. “Incorporating Feedback from Application Layer into Routing and Wavelength Assignment Algorithms.” <i>Proceedings of the 32nd IEEE International Conference on Computer Communications (INFOCOM)</i>, 2013, pp. 51–52, doi:<a href=\"https://doi.org/10.1109/INFCOMW.2013.6970733\">10.1109/INFCOMW.2013.6970733</a>.","bibtex":"@inproceedings{Wette_Karl_2013, title={Incorporating feedback from application layer into routing and wavelength assignment algorithms}, DOI={<a href=\"https://doi.org/10.1109/INFCOMW.2013.6970733\">10.1109/INFCOMW.2013.6970733</a>}, booktitle={Proceedings of the 32nd IEEE International Conference on Computer Communications (INFOCOM)}, author={Wette, Philip and Karl, Holger}, year={2013}, pages={51–52} }"},"page":"51-52"},{"type":"mastersthesis","status":"public","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt C1","_id":"13"},{"_id":"14","name":"SFB 901 - Subprojekt C2"},{"name":"SFB 901 - Project Area C","_id":"4"}],"_id":"521","user_id":"477","department":[{"_id":"27"},{"_id":"518"}],"keyword":["coldboot"],"language":[{"iso":"ger"}],"year":"2013","citation":{"apa":"Riebler, H. (2013). <i>Identifikation und Wiederherstellung von kryptographischen Schlüsseln mit FPGAs</i>. Universität Paderborn.","bibtex":"@book{Riebler_2013, title={Identifikation und Wiederherstellung von kryptographischen Schlüsseln mit FPGAs}, publisher={Universität Paderborn}, author={Riebler, Heinrich}, year={2013} }","mla":"Riebler, Heinrich. <i>Identifikation und Wiederherstellung von kryptographischen Schlüsseln mit FPGAs</i>. Universität Paderborn, 2013.","short":"H. Riebler, Identifikation und Wiederherstellung von kryptographischen Schlüsseln mit FPGAs, Universität Paderborn, 2013.","ama":"Riebler H. <i>Identifikation und Wiederherstellung von kryptographischen Schlüsseln mit FPGAs</i>. Universität Paderborn; 2013.","chicago":"Riebler, Heinrich. <i>Identifikation und Wiederherstellung von kryptographischen Schlüsseln mit FPGAs</i>. Universität Paderborn, 2013.","ieee":"H. Riebler, <i>Identifikation und Wiederherstellung von kryptographischen Schlüsseln mit FPGAs</i>. Universität Paderborn, 2013."},"publisher":"Universität Paderborn","date_updated":"2022-01-06T07:01:46Z","author":[{"first_name":"Heinrich","id":"8961","full_name":"Riebler, Heinrich","last_name":"Riebler"}],"date_created":"2017-10-17T12:42:34Z","title":"Identifikation und Wiederherstellung von kryptographischen Schlüsseln mit FPGAs"}]