[{"file":[{"date_created":"2020-12-11T08:37:37Z","creator":"stschn","file_id":"20694","content_type":"application/pdf","title":"Divide and Conquer: Hierarchical Network and Service Coordination","file_name":"preprint_with_header.pdf","access_level":"open_access","file_size":7979772,"relation":"main_file","date_updated":"2020-12-11T08:37:37Z"}],"date_created":"2020-12-11T08:39:47Z","type":"conference","keyword":["network management","service management","coordination","hierarchical","scalability","nfv"],"department":[{"_id":"75"}],"publication":"IFIP/IEEE International Symposium on Integrated Network Management (IM)","abstract":[{"text":"In practical, large-scale networks, services are requested\r\nby users across the globe, e.g., for video streaming.\r\nServices consist of multiple interconnected components such as\r\nmicroservices in a service mesh. Coordinating these services\r\nrequires scaling them according to continuously changing user\r\ndemand, deploying instances at the edge close to their users,\r\nand routing traffic efficiently between users and connected instances.\r\nNetwork and service coordination is commonly addressed\r\nthrough centralized approaches, where a single coordinator\r\nknows everything and coordinates the entire network globally.\r\nWhile such centralized approaches can reach global optima, they\r\ndo not scale to large, realistic networks. In contrast, distributed\r\napproaches scale well, but sacrifice solution quality due to their\r\nlimited scope of knowledge and coordination decisions.\r\n\r\nTo this end, we propose a hierarchical coordination approach\r\nthat combines the good solution quality of centralized approaches\r\nwith the scalability of distributed approaches. In doing so, we divide\r\nthe network into multiple hierarchical domains and optimize\r\ncoordination in a top-down manner. We compare our hierarchical\r\nwith a centralized approach in an extensive evaluation on a real-world\r\nnetwork topology. Our results indicate that hierarchical\r\ncoordination can find close-to-optimal solutions in a fraction of\r\nthe runtime of centralized approaches.","lang":"eng"}],"language":[{"iso":"eng"}],"year":"2021","title":"Divide and Conquer: Hierarchical Network and Service Coordination","author":[{"id":"35343","last_name":"Schneider","first_name":"Stefan Balthasar","orcid":"0000-0001-8210-4011","full_name":"Schneider, Stefan Balthasar"},{"first_name":"Mirko","last_name":"Jürgens","full_name":"Jürgens, Mirko"},{"id":"126","last_name":"Karl","first_name":"Holger","full_name":"Karl, Holger"}],"date_updated":"2022-01-06T06:54:32Z","oa":"1","file_date_updated":"2020-12-11T08:37:37Z","citation":{"chicago":"Schneider, Stefan Balthasar, Mirko Jürgens, and Holger Karl. “Divide and Conquer: Hierarchical Network and Service Coordination.” In <i>IFIP/IEEE International Symposium on Integrated Network Management (IM)</i>. IFIP/IEEE, 2021.","short":"S.B. Schneider, M. Jürgens, H. Karl, in: IFIP/IEEE International Symposium on Integrated Network Management (IM), IFIP/IEEE, 2021.","ieee":"S. B. Schneider, M. Jürgens, and H. Karl, “Divide and Conquer: Hierarchical Network and Service Coordination,” in <i>IFIP/IEEE International Symposium on Integrated Network Management (IM)</i>, Bordeaux, France, 2021.","apa":"Schneider, S. B., Jürgens, M., &#38; Karl, H. (2021). Divide and Conquer: Hierarchical Network and Service Coordination. In <i>IFIP/IEEE International Symposium on Integrated Network Management (IM)</i>. Bordeaux, France: IFIP/IEEE.","bibtex":"@inproceedings{Schneider_Jürgens_Karl_2021, title={Divide and Conquer: Hierarchical Network and Service Coordination}, booktitle={IFIP/IEEE International Symposium on Integrated Network Management (IM)}, publisher={IFIP/IEEE}, author={Schneider, Stefan Balthasar and Jürgens, Mirko and Karl, Holger}, year={2021} }","ama":"Schneider SB, Jürgens M, Karl H. Divide and Conquer: Hierarchical Network and Service Coordination. In: <i>IFIP/IEEE International Symposium on Integrated Network Management (IM)</i>. IFIP/IEEE; 2021.","mla":"Schneider, Stefan Balthasar, et al. “Divide and Conquer: Hierarchical Network and Service Coordination.” <i>IFIP/IEEE International Symposium on Integrated Network Management (IM)</i>, IFIP/IEEE, 2021."},"quality_controlled":"1","project":[{"_id":"1","name":"SFB 901"},{"_id":"4","name":"SFB 901 - Project Area C"},{"_id":"16","name":"SFB 901 - Subproject C4"}],"_id":"20693","publisher":"IFIP/IEEE","user_id":"35343","ddc":["006"],"status":"public","conference":{"name":"IFIP/IEEE International Symposium on Integrated Network Management (IM)","location":"Bordeaux, France"},"has_accepted_license":"1"},{"department":[{"_id":"63"}],"type":"conference","date_created":"2020-12-21T13:46:16Z","project":[{"name":"SFB 901","_id":"1"},{"_id":"2","name":"SFB 901 - Project Area A"},{"_id":"5","name":"SFB 901 - Subproject A1"}],"citation":{"mla":"Bienkowski, Marcin, et al. “A Nearly Optimal Deterministic Online Algorithm for Non-Metric Facility Location.” <i>Proceedings of the 38th Symposium on Theoretical Aspects of Computer Science (STACS)</i>, 2021, pp. 14:1-14:17, doi:<a href=\"https://doi.org/10.4230/LIPIcs.STACS.2021.14\">10.4230/LIPIcs.STACS.2021.14</a>.","bibtex":"@inproceedings{Bienkowski_Feldkord_Schmidt_2021, title={A Nearly Optimal Deterministic Online Algorithm for Non-Metric Facility Location}, DOI={<a href=\"https://doi.org/10.4230/LIPIcs.STACS.2021.14\">10.4230/LIPIcs.STACS.2021.14</a>}, booktitle={Proceedings of the 38th Symposium on Theoretical Aspects of Computer Science (STACS)}, author={Bienkowski, Marcin and Feldkord, Björn and Schmidt, Pawel}, year={2021}, pages={14:1-14:17} }","ama":"Bienkowski M, Feldkord B, Schmidt P. A Nearly Optimal Deterministic Online Algorithm for Non-Metric Facility Location. In: <i>Proceedings of the 38th Symposium on Theoretical Aspects of Computer Science (STACS)</i>. ; 2021:14:1-14:17. doi:<a href=\"https://doi.org/10.4230/LIPIcs.STACS.2021.14\">10.4230/LIPIcs.STACS.2021.14</a>","ieee":"M. Bienkowski, B. Feldkord, and P. Schmidt, “A Nearly Optimal Deterministic Online Algorithm for Non-Metric Facility Location,” in <i>Proceedings of the 38th Symposium on Theoretical Aspects of Computer Science (STACS)</i>, 2021, pp. 14:1-14:17.","apa":"Bienkowski, M., Feldkord, B., &#38; Schmidt, P. (2021). A Nearly Optimal Deterministic Online Algorithm for Non-Metric Facility Location. In <i>Proceedings of the 38th Symposium on Theoretical Aspects of Computer Science (STACS)</i> (pp. 14:1-14:17). <a href=\"https://doi.org/10.4230/LIPIcs.STACS.2021.14\">https://doi.org/10.4230/LIPIcs.STACS.2021.14</a>","chicago":"Bienkowski, Marcin, Björn Feldkord, and Pawel Schmidt. “A Nearly Optimal Deterministic Online Algorithm for Non-Metric Facility Location.” In <i>Proceedings of the 38th Symposium on Theoretical Aspects of Computer Science (STACS)</i>, 14:1-14:17, 2021. <a href=\"https://doi.org/10.4230/LIPIcs.STACS.2021.14\">https://doi.org/10.4230/LIPIcs.STACS.2021.14</a>.","short":"M. Bienkowski, B. Feldkord, P. Schmidt, in: Proceedings of the 38th Symposium on Theoretical Aspects of Computer Science (STACS), 2021, pp. 14:1-14:17."},"publication":"Proceedings of the 38th Symposium on Theoretical Aspects of Computer Science (STACS)","user_id":"22704","doi":"10.4230/LIPIcs.STACS.2021.14","_id":"20817","language":[{"iso":"eng"}],"page":"14:1 - 14:17","publication_status":"published","date_updated":"2022-01-06T06:54:40Z","author":[{"full_name":"Bienkowski, Marcin","first_name":"Marcin","last_name":"Bienkowski"},{"id":"22704","full_name":"Feldkord, Björn","first_name":"Björn","last_name":"Feldkord"},{"first_name":"Pawel","last_name":"Schmidt","full_name":"Schmidt, Pawel"}],"year":"2021","status":"public","title":"A Nearly Optimal Deterministic Online Algorithm for Non-Metric Facility Location"},{"author":[{"first_name":"Tobias","last_name":"Nickchen","full_name":"Nickchen, Tobias"},{"full_name":"Heindorf, Stefan","last_name":"Heindorf","first_name":"Stefan"},{"first_name":"Gregor","last_name":"Engels","full_name":"Engels, Gregor"}],"conference":{"name":"IEEE/CVF Winter Conference on Applications of Computer Vision","start_date":"2021-05-01","location":"Hawaii","end_date":"2021-09-01"},"title":"Generating Physically Sound Training Data for Image Recognition of Additively Manufactured Parts","status":"public","year":"2021","publication_status":"published","date_updated":"2022-01-06T06:54:41Z","language":[{"iso":"eng"}],"_id":"20886","page":"1994-2002","user_id":"27340","citation":{"bibtex":"@inproceedings{Nickchen_Heindorf_Engels_2021, title={Generating Physically Sound Training Data for Image Recognition of Additively Manufactured Parts}, booktitle={Proceedings of the IEEE/CVF Winter Conference on Applications of Computer Vision}, author={Nickchen, Tobias and Heindorf, Stefan and Engels, Gregor}, year={2021}, pages={1994–2002} }","chicago":"Nickchen, Tobias, Stefan Heindorf, and Gregor Engels. “Generating Physically Sound Training Data for Image Recognition of Additively Manufactured Parts.” In <i>Proceedings of the IEEE/CVF Winter Conference on Applications of Computer Vision</i>, 1994–2002, 2021.","short":"T. Nickchen, S. Heindorf, G. Engels, in: Proceedings of the IEEE/CVF Winter Conference on Applications of Computer Vision, 2021, pp. 1994–2002.","ama":"Nickchen T, Heindorf S, Engels G. Generating Physically Sound Training Data for Image Recognition of Additively Manufactured Parts. In: <i>Proceedings of the IEEE/CVF Winter Conference on Applications of Computer Vision</i>. ; 2021:1994-2002.","ieee":"T. Nickchen, S. Heindorf, and G. Engels, “Generating Physically Sound Training Data for Image Recognition of Additively Manufactured Parts,” in <i>Proceedings of the IEEE/CVF Winter Conference on Applications of Computer Vision</i>, Hawaii, 2021, pp. 1994–2002.","apa":"Nickchen, T., Heindorf, S., &#38; Engels, G. (2021). Generating Physically Sound Training Data for Image Recognition of Additively Manufactured Parts. In <i>Proceedings of the IEEE/CVF Winter Conference on Applications of Computer Vision</i> (pp. 1994–2002). Hawaii.","mla":"Nickchen, Tobias, et al. “Generating Physically Sound Training Data for Image Recognition of Additively Manufactured Parts.” <i>Proceedings of the IEEE/CVF Winter Conference on Applications of Computer Vision</i>, 2021, pp. 1994–2002."},"publication":"Proceedings of the IEEE/CVF Winter Conference on Applications of Computer Vision","date_created":"2021-01-07T15:32:45Z","department":[{"_id":"66"},{"_id":"534"},{"_id":"624"},{"_id":"219"},{"_id":"27"}],"type":"conference"},{"file":[{"date_created":"2021-07-20T16:16:05Z","creator":"sego","file_id":"22767","content_type":"application/pdf","relation":"main_file","date_updated":"2021-07-20T16:16:05Z","file_name":"CAISEDC21.pdf","access_level":"open_access","file_size":278027}],"date_created":"2021-05-11T12:46:07Z","type":"conference","department":[{"_id":"66"},{"_id":"534"}],"oa":"1","file_date_updated":"2021-07-20T16:16:05Z","publication":"Advanced Software Engineering. Doctorial Consortium","citation":{"short":"S. Gottschalk, in: Advanced Software Engineering. Doctorial Consortium, CEUR, 2021.","ama":"Gottschalk S. Situation-specific Development of Business Models for Services in Software Ecosystems. In: <i>Advanced Software Engineering. Doctorial Consortium</i>. CEUR; 2021.","chicago":"Gottschalk, Sebastian. “Situation-Specific Development of Business Models for Services in Software Ecosystems.” In <i>Advanced Software Engineering. Doctorial Consortium</i>. CEUR, 2021.","bibtex":"@inproceedings{Gottschalk_2021, title={Situation-specific Development of Business Models for Services in Software Ecosystems}, booktitle={Advanced Software Engineering. Doctorial Consortium}, publisher={CEUR}, author={Gottschalk, Sebastian}, year={2021} }","apa":"Gottschalk, S. (2021). Situation-specific Development of Business Models for Services in Software Ecosystems. In <i>Advanced Software Engineering. Doctorial Consortium</i>. CEUR.","mla":"Gottschalk, Sebastian. “Situation-Specific Development of Business Models for Services in Software Ecosystems.” <i>Advanced Software Engineering. Doctorial Consortium</i>, CEUR, 2021.","ieee":"S. Gottschalk, “Situation-specific Development of Business Models for Services in Software Ecosystems,” in <i>Advanced Software Engineering. Doctorial Consortium</i>, 2021."},"project":[{"_id":"1","name":"SFB 901"},{"_id":"4","name":"SFB 901 - Project Area C"},{"_id":"17","name":"SFB 901 - Subproject C5"}],"language":[{"iso":"eng"}],"_id":"22155","publisher":"CEUR","user_id":"47208","ddc":["000"],"title":"Situation-specific Development of Business Models for Services in Software Ecosystems","status":"public","year":"2021","author":[{"full_name":"Gottschalk, Sebastian","last_name":"Gottschalk","first_name":"Sebastian","id":"47208"}],"date_updated":"2022-01-06T06:55:28Z","has_accepted_license":"1"},{"user_id":"82920","doi":"10.24963/ijcai.2021/77","language":[{"iso":"eng"}],"_id":"22156","page":"552-559","main_file_link":[{"open_access":"1","url":"https://www.ijcai.org/proceedings/2021/77"}],"date_updated":"2022-01-06T06:55:28Z","author":[{"orcid":"0000-0003-4364-1409","last_name":"Spliethöver","first_name":"Maximilian","full_name":"Spliethöver, Maximilian","id":"84035"},{"id":"3900","first_name":"Henning","last_name":"Wachsmuth","full_name":"Wachsmuth, Henning"}],"conference":{"start_date":"2021-08-19","name":"30th International Joint Conference on Artificial Intelligence (IJCAI-21)","location":"Online","end_date":"2021-08-26"},"status":"public","title":"Bias Silhouette Analysis: Towards Assessing the Quality of Bias Metrics for Word Embedding Models","year":"2021","department":[{"_id":"600"}],"oa":"1","type":"conference","date_created":"2021-05-11T23:13:26Z","quality_controlled":"1","abstract":[{"lang":"eng","text":"Word embedding models reflect bias towards genders, ethnicities, and other social groups present in the underlying training data. Metrics such as ECT, RNSB, and WEAT quantify bias in these models based on predefined word lists representing social groups and bias-conveying concepts. How suitable these lists actually are to reveal bias - let alone the bias metrics in general - remains unclear, though. In this paper, we study how to assess the quality of bias metrics for word embedding models. In particular, we present a generic method, Bias Silhouette Analysis (BSA), that quantifies the accuracy and robustness of such a metric and of the word lists used. Given a biased and an unbiased reference embedding model, BSA applies the metric systematically for several subsets of the lists to the models. The variance and rate of convergence of the bias values of each model then entail the robustness of the word lists, whereas the distance between the models' values gives indications of the general accuracy of the metric with the word lists. We demonstrate the behavior of BSA on two standard embedding models for the three mentioned metrics with several word lists from existing research."}],"citation":{"bibtex":"@inproceedings{Spliethöver_Wachsmuth_2021, title={Bias Silhouette Analysis: Towards Assessing the Quality of Bias Metrics for Word Embedding Models}, DOI={<a href=\"https://doi.org/10.24963/ijcai.2021/77\">10.24963/ijcai.2021/77</a>}, booktitle={Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence, IJCAI-21}, author={Spliethöver, Maximilian and Wachsmuth, Henning}, year={2021}, pages={552–559} }","ama":"Spliethöver M, Wachsmuth H. Bias Silhouette Analysis: Towards Assessing the Quality of Bias Metrics for Word Embedding Models. In: <i>Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence, IJCAI-21</i>. ; 2021:552-559. doi:<a href=\"https://doi.org/10.24963/ijcai.2021/77\">10.24963/ijcai.2021/77</a>","mla":"Spliethöver, Maximilian, and Henning Wachsmuth. “Bias Silhouette Analysis: Towards Assessing the Quality of Bias Metrics for Word Embedding Models.” <i>Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence, IJCAI-21</i>, 2021, pp. 552–59, doi:<a href=\"https://doi.org/10.24963/ijcai.2021/77\">10.24963/ijcai.2021/77</a>.","chicago":"Spliethöver, Maximilian, and Henning Wachsmuth. “Bias Silhouette Analysis: Towards Assessing the Quality of Bias Metrics for Word Embedding Models.” In <i>Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence, IJCAI-21</i>, 552–59, 2021. <a href=\"https://doi.org/10.24963/ijcai.2021/77\">https://doi.org/10.24963/ijcai.2021/77</a>.","short":"M. Spliethöver, H. Wachsmuth, in: Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence, IJCAI-21, 2021, pp. 552–559.","ieee":"M. Spliethöver and H. Wachsmuth, “Bias Silhouette Analysis: Towards Assessing the Quality of Bias Metrics for Word Embedding Models,” in <i>Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence, IJCAI-21</i>, Online, 2021, pp. 552–559, doi: <a href=\"https://doi.org/10.24963/ijcai.2021/77\">10.24963/ijcai.2021/77</a>.","apa":"Spliethöver, M., &#38; Wachsmuth, H. (2021). Bias Silhouette Analysis: Towards Assessing the Quality of Bias Metrics for Word Embedding Models. <i>Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence, IJCAI-21</i>, 552–559. <a href=\"https://doi.org/10.24963/ijcai.2021/77\">https://doi.org/10.24963/ijcai.2021/77</a>"},"publication":"Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence, IJCAI-21"},{"user_id":"82920","main_file_link":[{"open_access":"1","url":"https://aclanthology.org/2021.findings-acl.306.pdf"}],"page":"3482-3493","_id":"22158","language":[{"iso":"eng"}],"date_updated":"2022-01-06T06:55:28Z","title":"Generating Informative Conclusions for Argumentative Texts","status":"public","year":"2021","author":[{"last_name":"Syed","first_name":"Shahbaz","full_name":"Syed, Shahbaz"},{"last_name":"Al-Khatib","first_name":"Khalid","full_name":"Al-Khatib, Khalid"},{"last_name":"Alshomary","first_name":"Milad","full_name":"Alshomary, Milad","id":"73059"},{"id":"3900","first_name":"Henning","last_name":"Wachsmuth","full_name":"Wachsmuth, Henning"},{"last_name":"Potthast","first_name":"Martin","full_name":"Potthast, Martin"}],"type":"conference","oa":"1","department":[{"_id":"600"}],"date_created":"2021-05-11T23:18:14Z","publication":"Proceedings of the Joint Conference of the 59th Annual Meeting of the Association for Computational Linguistics and the 11th International Joint Conference on Natural Language Processing (ACL-IJCNLP 2021): Findings","citation":{"ieee":"S. Syed, K. Al-Khatib, M. Alshomary, H. Wachsmuth, and M. Potthast, “Generating Informative Conclusions for Argumentative Texts,” in <i>Proceedings of the Joint Conference of the 59th Annual Meeting of the Association for Computational Linguistics and the 11th International Joint Conference on Natural Language Processing (ACL-IJCNLP 2021): Findings</i>, 2021, pp. 3482–3493.","apa":"Syed, S., Al-Khatib, K., Alshomary, M., Wachsmuth, H., &#38; Potthast, M. (2021). Generating Informative Conclusions for Argumentative Texts. <i>Proceedings of the Joint Conference of the 59th Annual Meeting of the Association for Computational Linguistics and the 11th International Joint Conference on Natural Language Processing (ACL-IJCNLP 2021): Findings</i>, 3482–3493.","chicago":"Syed, Shahbaz, Khalid Al-Khatib, Milad Alshomary, Henning Wachsmuth, and Martin Potthast. “Generating Informative Conclusions for Argumentative Texts.” In <i>Proceedings of the Joint Conference of the 59th Annual Meeting of the Association for Computational Linguistics and the 11th International Joint Conference on Natural Language Processing (ACL-IJCNLP 2021): Findings</i>, 3482–93, 2021.","short":"S. Syed, K. Al-Khatib, M. Alshomary, H. Wachsmuth, M. Potthast, in: Proceedings of the Joint Conference of the 59th Annual Meeting of the Association for Computational Linguistics and the 11th International Joint Conference on Natural Language Processing (ACL-IJCNLP 2021): Findings, 2021, pp. 3482–3493.","mla":"Syed, Shahbaz, et al. “Generating Informative Conclusions for Argumentative Texts.” <i>Proceedings of the Joint Conference of the 59th Annual Meeting of the Association for Computational Linguistics and the 11th International Joint Conference on Natural Language Processing (ACL-IJCNLP 2021): Findings</i>, 2021, pp. 3482–93.","bibtex":"@inproceedings{Syed_Al-Khatib_Alshomary_Wachsmuth_Potthast_2021, title={Generating Informative Conclusions for Argumentative Texts}, booktitle={Proceedings of the Joint Conference of the 59th Annual Meeting of the Association for Computational Linguistics and the 11th International Joint Conference on Natural Language Processing (ACL-IJCNLP 2021): Findings}, author={Syed, Shahbaz and Al-Khatib, Khalid and Alshomary, Milad and Wachsmuth, Henning and Potthast, Martin}, year={2021}, pages={3482–3493} }","ama":"Syed S, Al-Khatib K, Alshomary M, Wachsmuth H, Potthast M. Generating Informative Conclusions for Argumentative Texts. In: <i>Proceedings of the Joint Conference of the 59th Annual Meeting of the Association for Computational Linguistics and the 11th International Joint Conference on Natural Language Processing (ACL-IJCNLP 2021): Findings</i>. ; 2021:3482-3493."}},{"citation":{"bibtex":"@inproceedings{Barrow_Jain_Lipka_Dernoncourt_Morariu_Manjunatha_Oard_Resnik_Wachsmuth_2021, title={Syntopical Graphs for Computational Argumentation Tasks}, booktitle={Proceedings of the Joint Conference of the 59th Annual Meeting of the Association for Computational Linguistics and the 11th International Joint Conference on Natural Language Processing (ACL-IJCNLP 2021)}, author={Barrow, Joe and Jain, Rajiv and Lipka, Nedim and Dernoncourt, Franck and Morariu, Vlad and Manjunatha, Varun and Oard, Douglas and Resnik, Philip and Wachsmuth, Henning}, year={2021}, pages={1583–1595} }","ama":"Barrow J, Jain R, Lipka N, et al. Syntopical Graphs for Computational Argumentation Tasks. In: <i>Proceedings of the Joint Conference of the 59th Annual Meeting of the Association for Computational Linguistics and the 11th International Joint Conference on Natural Language Processing (ACL-IJCNLP 2021)</i>. ; 2021:1583-1595.","mla":"Barrow, Joe, et al. “Syntopical Graphs for Computational Argumentation Tasks.” <i>Proceedings of the Joint Conference of the 59th Annual Meeting of the Association for Computational Linguistics and the 11th International Joint Conference on Natural Language Processing (ACL-IJCNLP 2021)</i>, 2021, pp. 1583–95.","short":"J. Barrow, R. Jain, N. Lipka, F. Dernoncourt, V. Morariu, V. Manjunatha, D. Oard, P. Resnik, H. Wachsmuth, in: Proceedings of the Joint Conference of the 59th Annual Meeting of the Association for Computational Linguistics and the 11th International Joint Conference on Natural Language Processing (ACL-IJCNLP 2021), 2021, pp. 1583–1595.","chicago":"Barrow, Joe, Rajiv Jain, Nedim Lipka, Franck Dernoncourt, Vlad Morariu, Varun Manjunatha, Douglas Oard, Philip Resnik, and Henning Wachsmuth. “Syntopical Graphs for Computational Argumentation Tasks.” In <i>Proceedings of the Joint Conference of the 59th Annual Meeting of the Association for Computational Linguistics and the 11th International Joint Conference on Natural Language Processing (ACL-IJCNLP 2021)</i>, 1583–95, 2021.","ieee":"J. Barrow <i>et al.</i>, “Syntopical Graphs for Computational Argumentation Tasks,” in <i>Proceedings of the Joint Conference of the 59th Annual Meeting of the Association for Computational Linguistics and the 11th International Joint Conference on Natural Language Processing (ACL-IJCNLP 2021)</i>, 2021, pp. 1583–1595.","apa":"Barrow, J., Jain, R., Lipka, N., Dernoncourt, F., Morariu, V., Manjunatha, V., Oard, D., Resnik, P., &#38; Wachsmuth, H. (2021). Syntopical Graphs for Computational Argumentation Tasks. <i>Proceedings of the Joint Conference of the 59th Annual Meeting of the Association for Computational Linguistics and the 11th International Joint Conference on Natural Language Processing (ACL-IJCNLP 2021)</i>, 1583–1595."},"publication":"Proceedings of the Joint Conference of the 59th Annual Meeting of the Association for Computational Linguistics and the 11th International Joint Conference on Natural Language Processing (ACL-IJCNLP 2021)","department":[{"_id":"600"}],"oa":"1","type":"conference","date_created":"2021-05-11T23:20:59Z","date_updated":"2022-01-06T06:55:28Z","author":[{"first_name":"Joe","last_name":"Barrow","full_name":"Barrow, Joe"},{"full_name":"Jain, Rajiv","last_name":"Jain","first_name":"Rajiv"},{"full_name":"Lipka, Nedim","last_name":"Lipka","first_name":"Nedim"},{"first_name":"Franck","last_name":"Dernoncourt","full_name":"Dernoncourt, Franck"},{"first_name":"Vlad","last_name":"Morariu","full_name":"Morariu, Vlad"},{"full_name":"Manjunatha, Varun","first_name":"Varun","last_name":"Manjunatha"},{"last_name":"Oard","first_name":"Douglas","full_name":"Oard, Douglas"},{"last_name":"Resnik","first_name":"Philip","full_name":"Resnik, Philip"},{"id":"3900","last_name":"Wachsmuth","first_name":"Henning","full_name":"Wachsmuth, Henning"}],"status":"public","title":"Syntopical Graphs for Computational Argumentation Tasks","year":"2021","user_id":"82920","_id":"22159","language":[{"iso":"eng"}],"page":"1583-1595","main_file_link":[{"url":"https://aclanthology.org/2021.acl-long.126.pdf","open_access":"1"}]},{"citation":{"mla":"Al-Khatib, Khalid, et al. “Employing Argumentation Knowledge Graphs for Neural Argument Generation.” <i>Proceedings of the Joint Conference of the 59th Annual Meeting of the Association for Computational Linguistics and the 11th International Joint Conference on Natural Language Processing (ACL-IJCNLP 2021)</i>, 2021, pp. 4744–54.","ama":"Al-Khatib K, Trautner L, Wachsmuth H, Hou Y, Stein B. Employing Argumentation Knowledge Graphs for Neural Argument Generation. In: <i>Proceedings of the Joint Conference of the 59th Annual Meeting of the Association for Computational Linguistics and the 11th International Joint Conference on Natural Language Processing (ACL-IJCNLP 2021)</i>. ; 2021:4744-4754.","bibtex":"@inproceedings{Al-Khatib_Trautner_Wachsmuth_Hou_Stein_2021, title={Employing Argumentation Knowledge Graphs for Neural Argument Generation}, booktitle={Proceedings of the Joint Conference of the 59th Annual Meeting of the Association for Computational Linguistics and the 11th International Joint Conference on Natural Language Processing (ACL-IJCNLP 2021)}, author={Al-Khatib, Khalid and Trautner, Lukas and Wachsmuth, Henning and Hou, Yufang and Stein, Benno}, year={2021}, pages={4744–4754} }","apa":"Al-Khatib, K., Trautner, L., Wachsmuth, H., Hou, Y., &#38; Stein, B. (2021). Employing Argumentation Knowledge Graphs for Neural Argument Generation. <i>Proceedings of the Joint Conference of the 59th Annual Meeting of the Association for Computational Linguistics and the 11th International Joint Conference on Natural Language Processing (ACL-IJCNLP 2021)</i>, 4744–4754.","ieee":"K. Al-Khatib, L. Trautner, H. Wachsmuth, Y. Hou, and B. Stein, “Employing Argumentation Knowledge Graphs for Neural Argument Generation,” in <i>Proceedings of the Joint Conference of the 59th Annual Meeting of the Association for Computational Linguistics and the 11th International Joint Conference on Natural Language Processing (ACL-IJCNLP 2021)</i>, 2021, pp. 4744–4754.","short":"K. Al-Khatib, L. Trautner, H. Wachsmuth, Y. Hou, B. Stein, in: Proceedings of the Joint Conference of the 59th Annual Meeting of the Association for Computational Linguistics and the 11th International Joint Conference on Natural Language Processing (ACL-IJCNLP 2021), 2021, pp. 4744–4754.","chicago":"Al-Khatib, Khalid, Lukas Trautner, Henning Wachsmuth, Yufang Hou, and Benno Stein. “Employing Argumentation Knowledge Graphs for Neural Argument Generation.” In <i>Proceedings of the Joint Conference of the 59th Annual Meeting of the Association for Computational Linguistics and the 11th International Joint Conference on Natural Language Processing (ACL-IJCNLP 2021)</i>, 4744–54, 2021."},"publication":"Proceedings of the Joint Conference of the 59th Annual Meeting of the Association for Computational Linguistics and the 11th International Joint Conference on Natural Language Processing (ACL-IJCNLP 2021)","date_created":"2021-05-11T23:22:36Z","department":[{"_id":"600"}],"type":"conference","author":[{"full_name":"Al-Khatib, Khalid","last_name":"Al-Khatib","first_name":"Khalid"},{"full_name":"Trautner, Lukas","last_name":"Trautner","first_name":"Lukas"},{"first_name":"Henning","last_name":"Wachsmuth","full_name":"Wachsmuth, Henning","id":"3900"},{"last_name":"Hou","first_name":"Yufang","full_name":"Hou, Yufang"},{"first_name":"Benno","last_name":"Stein","full_name":"Stein, Benno"}],"year":"2021","status":"public","title":"Employing Argumentation Knowledge Graphs for Neural Argument Generation","date_updated":"2022-01-06T06:55:28Z","language":[{"iso":"eng"}],"_id":"22160","main_file_link":[{"url":"https://aclanthology.org/2021.acl-long.366.pdf"}],"page":"4744-4754","user_id":"82920"},{"supervisor":[{"first_name":"Marco","last_name":"Platzner","full_name":"Platzner, Marco","id":"398"},{"full_name":"Witschen, Linus Matthias","last_name":"Witschen","first_name":"Linus Matthias","id":"49051"}],"citation":{"mla":"Rehnen, Jakob Werner. <i>Decomposition of Arithmetic Components for the Approximate Circuit Synthesis with EvoApproxLib</i>. 2021.","bibtex":"@book{Rehnen_2021, title={Decomposition of Arithmetic Components for the Approximate Circuit Synthesis with EvoApproxLib}, author={Rehnen, Jakob Werner}, year={2021} }","ama":"Rehnen JW. <i>Decomposition of Arithmetic Components for the Approximate Circuit Synthesis with EvoApproxLib</i>.; 2021.","ieee":"J. W. Rehnen, <i>Decomposition of Arithmetic Components for the Approximate Circuit Synthesis with EvoApproxLib</i>. 2021.","apa":"Rehnen, J. W. (2021). <i>Decomposition of Arithmetic Components for the Approximate Circuit Synthesis with EvoApproxLib</i>.","short":"J.W. Rehnen, Decomposition of Arithmetic Components for the Approximate Circuit Synthesis with EvoApproxLib, 2021.","chicago":"Rehnen, Jakob Werner. <i>Decomposition of Arithmetic Components for the Approximate Circuit Synthesis with EvoApproxLib</i>, 2021."},"type":"bachelorsthesis","department":[{"_id":"78"},{"_id":"7"}],"date_created":"2021-05-19T16:56:11Z","date_updated":"2022-01-06T06:55:29Z","year":"2021","title":"Decomposition of Arithmetic Components for the Approximate Circuit Synthesis with EvoApproxLib","status":"public","author":[{"full_name":"Rehnen, Jakob Werner","last_name":"Rehnen","first_name":"Jakob Werner"}],"user_id":"49051","language":[{"iso":"eng"}],"_id":"22216"},{"_id":"22230","publisher":"Eurographics Association ","language":[{"iso":"eng"}],"user_id":"90","doi":"10.2312/EGED.20212000","editor":[{"full_name":"Sousa Santos, Beatriz","first_name":"Beatriz","last_name":"Sousa Santos"},{"last_name":"Domik","first_name":"Gitta","full_name":"Domik, Gitta","id":"90"}],"title":"EUROGRAPHICS 2021: Education Papers Frontmatter","year":"2021","status":"public","publication_identifier":{"isbn":["ISBN 978-3-03868-132-8 "]},"conference":{"end_date":"2021-05-07","location":"Vienna","name":"Eurographics 2021","start_date":"2021-05-03"},"date_updated":"2022-01-06T06:55:29Z","date_created":"2021-05-26T09:04:55Z","type":"conference_editor","department":[{"_id":"65"}],"citation":{"bibtex":"@book{Sousa Santos_Domik_2021, title={EUROGRAPHICS 2021: Education Papers Frontmatter}, DOI={<a href=\"https://doi.org/10.2312/EGED.20212000\">10.2312/EGED.20212000</a>}, publisher={Eurographics Association }, year={2021} }","ama":"Sousa Santos B, Domik G, eds. <i>EUROGRAPHICS 2021: Education Papers Frontmatter</i>. Eurographics Association ; 2021. doi:<a href=\"https://doi.org/10.2312/EGED.20212000\">10.2312/EGED.20212000</a>","mla":"Sousa Santos, Beatriz, and Gitta Domik, editors. <i>EUROGRAPHICS 2021: Education Papers Frontmatter</i>. Eurographics Association , 2021, doi:<a href=\"https://doi.org/10.2312/EGED.20212000\">10.2312/EGED.20212000</a>.","chicago":"Sousa Santos, Beatriz, and Gitta Domik, eds. <i>EUROGRAPHICS 2021: Education Papers Frontmatter</i>. Eurographics Association , 2021. <a href=\"https://doi.org/10.2312/EGED.20212000\">https://doi.org/10.2312/EGED.20212000</a>.","short":"B. Sousa Santos, G. Domik, eds., EUROGRAPHICS 2021: Education Papers Frontmatter, Eurographics Association , 2021.","ieee":"B. Sousa Santos and G. Domik, Eds., <i>EUROGRAPHICS 2021: Education Papers Frontmatter</i>. Eurographics Association , 2021.","apa":"Sousa Santos, B., &#38; Domik, G. (Eds.). (2021). <i>EUROGRAPHICS 2021: Education Papers Frontmatter</i>. Presented at the Eurographics 2021, Vienna: Eurographics Association . <a href=\"https://doi.org/10.2312/EGED.20212000\">https://doi.org/10.2312/EGED.20212000</a>"}},{"language":[{"iso":"eng"}],"doi":"10.1145/3465084.3467932","author":[{"full_name":"Götte, Thorsten","first_name":"Thorsten","last_name":"Götte","id":"34727"},{"id":"32229","first_name":"Kristian","last_name":"Hinnenthal","full_name":"Hinnenthal, Kristian"},{"full_name":"Scheideler, Christian","first_name":"Christian","last_name":"Scheideler","id":"20792"},{"last_name":"Werthmann","first_name":"Julian","full_name":"Werthmann, Julian","id":"50024"}],"title":"Time-Optimal Construction of Overlays","year":"2021","publication_status":"accepted","date_updated":"2022-01-06T06:55:30Z","date_created":"2021-06-06T19:10:26Z","file":[{"creator":"thgoette","date_created":"2021-06-06T19:12:49Z","relation":"main_file","date_updated":"2021-06-06T19:12:49Z","file_name":"Wicked_Fast_Overlay_Construction(1).pdf","access_level":"closed","file_size":590875,"file_id":"22284","success":1,"content_type":"application/pdf"}],"department":[{"_id":"34"}],"type":"conference","publication":"Proc. of the 40th ACM Symposium on Principles of Distributed Computing (PODC '21)","abstract":[{"lang":"eng","text":"    We show how to construct an overlay network of constant degree and diameter $O(\\log n)$ in time $O(\\log n)$ starting from an arbitrary weakly connected graph.\r\n    We assume a synchronous communication network in which nodes can send messages to nodes they know the identifier of and establish new connections by sending node identifiers.\r\n    If the initial network's graph is weakly connected and has constant degree, then our algorithm constructs the desired topology with each node sending and receiving only $O(\\log n)$ messages in each round in time $O(\\log n)$, w.h.p., which beats the currently best $O(\\log^{3/2} n)$ time algorithm of [Götte et al., SIROCCO'19].\r\n    Since the problem cannot be solved faster than by using pointer jumping for $O(\\log n)$ rounds (which would even require each node to communicate $\\Omega(n)$ bits), our algorithm is asymptotically optimal.\r\n    We achieve this speedup by using short random walks to repeatedly establish random connections between the nodes that quickly reduce the conductance of the graph using an observation of [Kwok and Lau, APPROX'14].\r\n    \r\n    Additionally, we show how our algorithm can be used to efficiently solve graph problems in \\emph{hybrid networks} [Augustine et al., SODA'20].\r\n    Motivated by the idea that nodes possess two different modes of communication, we assume that communication of the \\emph{initial} edges is unrestricted. In contrast, only polylogarithmically many messages can be communicated over edges that have been established throughout an algorithm's execution.\r\n    For an (undirected) graph $G$ with arbitrary degree, we show how to compute connected components, a spanning tree, and biconnected components in time $O(\\log n)$, w.h.p.\r\n    Furthermore, we show how to compute an MIS in time $O(\\log d + \\log \\log n)$, w.h.p., where $d$ is the initial degree of $G$."}],"publisher":"ACM","_id":"22283","editor":[{"last_name":"Censor-Hillel","first_name":"Keren","full_name":"Censor-Hillel, Keren"}],"user_id":"477","ddc":["000"],"conference":{"name":"ACM Symposium on Principles of Distributed Computing (PODC)","start_date":"2021-07-26","location":"Virtual","end_date":"2021-07-30"},"status":"public","has_accepted_license":"1","place":"New York","citation":{"mla":"Götte, Thorsten, et al. “Time-Optimal Construction of Overlays.” <i>Proc. of the 40th ACM Symposium on Principles of Distributed Computing (PODC ’21)</i>, edited by Keren Censor-Hillel, ACM, doi:<a href=\"https://doi.org/10.1145/3465084.3467932\">10.1145/3465084.3467932</a>.","bibtex":"@inproceedings{Götte_Hinnenthal_Scheideler_Werthmann, place={New York}, title={Time-Optimal Construction of Overlays}, DOI={<a href=\"https://doi.org/10.1145/3465084.3467932\">10.1145/3465084.3467932</a>}, booktitle={Proc. of the 40th ACM Symposium on Principles of Distributed Computing (PODC ’21)}, publisher={ACM}, author={Götte, Thorsten and Hinnenthal, Kristian and Scheideler, Christian and Werthmann, Julian}, editor={Censor-Hillel, KerenEditor} }","ama":"Götte T, Hinnenthal K, Scheideler C, Werthmann J. Time-Optimal Construction of Overlays. In: Censor-Hillel K, ed. <i>Proc. of the 40th ACM Symposium on Principles of Distributed Computing (PODC ’21)</i>. New York: ACM. doi:<a href=\"https://doi.org/10.1145/3465084.3467932\">10.1145/3465084.3467932</a>","ieee":"T. Götte, K. Hinnenthal, C. Scheideler, and J. Werthmann, “Time-Optimal Construction of Overlays,” in <i>Proc. of the 40th ACM Symposium on Principles of Distributed Computing (PODC ’21)</i>, Virtual.","apa":"Götte, T., Hinnenthal, K., Scheideler, C., &#38; Werthmann, J. (n.d.). Time-Optimal Construction of Overlays. In K. Censor-Hillel (Ed.), <i>Proc. of the 40th ACM Symposium on Principles of Distributed Computing (PODC ’21)</i>. New York: ACM. <a href=\"https://doi.org/10.1145/3465084.3467932\">https://doi.org/10.1145/3465084.3467932</a>","chicago":"Götte, Thorsten, Kristian Hinnenthal, Christian Scheideler, and Julian Werthmann. “Time-Optimal Construction of Overlays.” In <i>Proc. of the 40th ACM Symposium on Principles of Distributed Computing (PODC ’21)</i>, edited by Keren Censor-Hillel. New York: ACM, n.d. <a href=\"https://doi.org/10.1145/3465084.3467932\">https://doi.org/10.1145/3465084.3467932</a>.","short":"T. Götte, K. Hinnenthal, C. Scheideler, J. Werthmann, in: K. Censor-Hillel (Ed.), Proc. of the 40th ACM Symposium on Principles of Distributed Computing (PODC ’21), ACM, New York, n.d."},"file_date_updated":"2021-06-06T19:12:49Z","project":[{"_id":"2","name":"SFB 901 - Project Area A"},{"_id":"5","name":"SFB 901 - Subproject A1"},{"_id":"4","name":"SFB 901 - Project Area C"},{"name":"SFB 901 - Subproject C1","_id":"13"},{"_id":"1","name":"SFB 901"}]},{"language":[{"iso":"eng"}],"date_updated":"2022-01-06T06:55:31Z","author":[{"first_name":"Stefan","last_name":"Schott","full_name":"Schott, Stefan","id":"54847"}],"year":"2021","title":"Android App Analysis Benchmark Case Generation","department":[{"_id":"77"}],"type":"mastersthesis","date_created":"2021-06-09T06:04:12Z","file":[{"creator":"fpauck","date_created":"2021-06-09T06:01:45Z","file_size":1918444,"access_level":"open_access","file_name":"Masters_Thesis_Stefan_Schott_unsigned.pdf","date_updated":"2021-06-09T06:01:45Z","relation":"main_file","content_type":"application/pdf","file_id":"22305"}],"extern":"1","ddc":["000"],"user_id":"477","_id":"22304","has_accepted_license":"1","status":"public","oa":"1","place":"Paderborn","project":[{"_id":"1","name":"SFB 901"},{"_id":"12","name":"SFB 901 - Subproject B4"},{"name":"SFB 901 - Project Area B","_id":"3"}],"supervisor":[{"id":"573","full_name":"Wehrheim, Heike","last_name":"Wehrheim","first_name":"Heike"}],"citation":{"chicago":"Schott, Stefan. <i>Android App Analysis Benchmark Case Generation</i>. Paderborn, 2021.","short":"S. Schott, Android App Analysis Benchmark Case Generation, Paderborn, 2021.","ieee":"S. Schott, <i>Android App Analysis Benchmark Case Generation</i>. Paderborn, 2021.","apa":"Schott, S. (2021). <i>Android App Analysis Benchmark Case Generation</i>. Paderborn.","bibtex":"@book{Schott_2021, place={Paderborn}, title={Android App Analysis Benchmark Case Generation}, author={Schott, Stefan}, year={2021} }","ama":"Schott S. <i>Android App Analysis Benchmark Case Generation</i>. Paderborn; 2021.","mla":"Schott, Stefan. <i>Android App Analysis Benchmark Case Generation</i>. 2021."},"file_date_updated":"2021-06-09T06:01:45Z"},{"publication":"Digitalization","citation":{"ama":"Koldewey C, Gausemeier J, Dumitrescu R, Evers H-H, Frank M, Reinhold J. Development Process for Smart Service Strategies: Grasping the Potentials of Digitalization for Servitization. In: Schallmo DR, Tidd J, eds. <i>Digitalization</i>. Management for Professionals. Springer Nature; 2021:205-237. doi:<a href=\"https://doi.org/10.1007/978-3-030-69380-0_12#DOI\">https://doi.org/10.1007/978-3-030-69380-0_12#DOI</a>","bibtex":"@inbook{Koldewey_Gausemeier_Dumitrescu_Evers_Frank_Reinhold_2021, place={Cham}, series={Management for Professionals}, title={Development Process for Smart Service Strategies: Grasping the Potentials of Digitalization for Servitization}, DOI={<a href=\"https://doi.org/10.1007/978-3-030-69380-0_12#DOI\">https://doi.org/10.1007/978-3-030-69380-0_12#DOI</a>}, booktitle={Digitalization}, publisher={Springer Nature}, author={Koldewey, Christian and Gausemeier, Jürgen and Dumitrescu, Roman and Evers, Hans-Heinrich and Frank, Maximilian and Reinhold, Jannik}, editor={Schallmo, Daniel R. and Tidd, Joseph}, year={2021}, pages={205–237}, collection={Management for Professionals} }","mla":"Koldewey, Christian, et al. “Development Process for Smart Service Strategies: Grasping the Potentials of Digitalization for Servitization.” <i>Digitalization</i>, edited by Daniel R. Schallmo and Joseph Tidd, Springer Nature, 2021, pp. 205–37, doi:<a href=\"https://doi.org/10.1007/978-3-030-69380-0_12#DOI\">https://doi.org/10.1007/978-3-030-69380-0_12#DOI</a>.","short":"C. Koldewey, J. Gausemeier, R. Dumitrescu, H.-H. Evers, M. Frank, J. Reinhold, in: D.R. Schallmo, J. Tidd (Eds.), Digitalization, Springer Nature, Cham, 2021, pp. 205–237.","chicago":"Koldewey, Christian, Jürgen Gausemeier, Roman Dumitrescu, Hans-Heinrich Evers, Maximilian Frank, and Jannik Reinhold. “Development Process for Smart Service Strategies: Grasping the Potentials of Digitalization for Servitization.” In <i>Digitalization</i>, edited by Daniel R. Schallmo and Joseph Tidd, 205–37. Management for Professionals. Cham: Springer Nature, 2021. <a href=\"https://doi.org/10.1007/978-3-030-69380-0_12#DOI\">https://doi.org/10.1007/978-3-030-69380-0_12#DOI</a>.","apa":"Koldewey, C., Gausemeier, J., Dumitrescu, R., Evers, H.-H., Frank, M., &#38; Reinhold, J. (2021). Development Process for Smart Service Strategies: Grasping the Potentials of Digitalization for Servitization. In D. R. Schallmo &#38; J. Tidd (Eds.), <i>Digitalization</i> (pp. 205–237). Springer Nature. <a href=\"https://doi.org/10.1007/978-3-030-69380-0_12#DOI\">https://doi.org/10.1007/978-3-030-69380-0_12#DOI</a>","ieee":"C. Koldewey, J. Gausemeier, R. Dumitrescu, H.-H. Evers, M. Frank, and J. Reinhold, “Development Process for Smart Service Strategies: Grasping the Potentials of Digitalization for Servitization,” in <i>Digitalization</i>, D. R. Schallmo and J. Tidd, Eds. Cham: Springer Nature, 2021, pp. 205–237."},"date_created":"2021-06-09T13:07:05Z","place":"Cham","type":"book_chapter","department":[{"_id":"563"}],"status":"public","title":"Development Process for Smart Service Strategies: Grasping the Potentials of Digitalization for Servitization","year":"2021","author":[{"full_name":"Koldewey, Christian","last_name":"Koldewey","orcid":"https://orcid.org/0000-0001-7992-6399","first_name":"Christian","id":"43136"},{"id":"163","last_name":"Gausemeier","first_name":"Jürgen","full_name":"Gausemeier, Jürgen"},{"last_name":"Dumitrescu","first_name":"Roman","full_name":"Dumitrescu, Roman","id":"16190"},{"first_name":"Hans-Heinrich","last_name":"Evers","full_name":"Evers, Hans-Heinrich"},{"first_name":"Maximilian","last_name":"Frank","full_name":"Frank, Maximilian"},{"id":"33669","full_name":"Reinhold, Jannik","last_name":"Reinhold","first_name":"Jannik"}],"publication_status":"published","date_updated":"2022-01-06T06:55:31Z","page":"205-237","_id":"22306","publisher":"Springer Nature","language":[{"iso":"eng"}],"series_title":"Management for Professionals","user_id":"15782","doi":"https://doi.org/10.1007/978-3-030-69380-0_12#DOI","editor":[{"full_name":"Schallmo, Daniel R.","last_name":"Schallmo","first_name":"Daniel R."},{"full_name":"Tidd, Joseph","last_name":"Tidd","first_name":"Joseph"}]},{"user_id":"15782","language":[{"iso":"eng"}],"_id":"22307","date_updated":"2022-01-06T06:55:31Z","title":"Digital Knowledge Base for Industrial Augmented Reality Systems Based on Semantic Technologies","status":"public","year":"2021","author":[{"full_name":"Eckertz, Daniel","last_name":"Eckertz","first_name":"Daniel"},{"last_name":"Möller","first_name":"Marus","full_name":"Möller, Marus"},{"last_name":"Anacker","first_name":"Harald","full_name":"Anacker, Harald"},{"id":"16190","full_name":"Dumitrescu, Roman","last_name":"Dumitrescu","first_name":"Roman"}],"conference":{"end_date":"2021-03-14","start_date":"2021-03-11","name":"4th International Conference on Information and Computer Technologies (ICICT 2021)","location":"Kahului, Hawaii, United States of America"},"type":"conference_abstract","department":[{"_id":"563"}],"date_created":"2021-06-11T09:16:17Z","publication":" Proceedings of the International Conference on Information and Computer Technologies","citation":{"chicago":"Eckertz, Daniel, Marus Möller, Harald Anacker, and Roman Dumitrescu. “Digital Knowledge Base for Industrial Augmented Reality Systems Based on Semantic Technologies.” In <i> Proceedings of the International Conference on Information and Computer Technologies</i>, 2021.","short":"D. Eckertz, M. Möller, H. Anacker, R. Dumitrescu, in:  Proceedings of the International Conference on Information and Computer Technologies, 2021.","apa":"Eckertz, D., Möller, M., Anacker, H., &#38; Dumitrescu, R. (2021). Digital Knowledge Base for Industrial Augmented Reality Systems Based on Semantic Technologies. In <i> Proceedings of the International Conference on Information and Computer Technologies</i>. Kahului, Hawaii, United States of America.","ieee":"D. Eckertz, M. Möller, H. Anacker, and R. Dumitrescu, “Digital Knowledge Base for Industrial Augmented Reality Systems Based on Semantic Technologies,” in <i> Proceedings of the International Conference on Information and Computer Technologies</i>, Kahului, Hawaii, United States of America, 2021.","ama":"Eckertz D, Möller M, Anacker H, Dumitrescu R. Digital Knowledge Base for Industrial Augmented Reality Systems Based on Semantic Technologies. In: <i> Proceedings of the International Conference on Information and Computer Technologies</i>. ; 2021.","bibtex":"@inproceedings{Eckertz_Möller_Anacker_Dumitrescu_2021, title={Digital Knowledge Base for Industrial Augmented Reality Systems Based on Semantic Technologies}, booktitle={ Proceedings of the International Conference on Information and Computer Technologies}, author={Eckertz, Daniel and Möller, Marus and Anacker, Harald and Dumitrescu, Roman}, year={2021} }","mla":"Eckertz, Daniel, et al. “Digital Knowledge Base for Industrial Augmented Reality Systems Based on Semantic Technologies.” <i> Proceedings of the International Conference on Information and Computer Technologies</i>, 2021."}},{"user_id":"64665","_id":"22309","language":[{"iso":"eng"}],"publisher":"IEEE","page":"384-389","date_updated":"2022-01-06T06:55:31Z","author":[{"id":"64665","full_name":"Awais, Muhammad","first_name":"Muhammad","last_name":"Awais","orcid":"https://orcid.org/0000-0003-4148-2969"},{"last_name":"Platzner","first_name":"Marco","full_name":"Platzner, Marco"}],"conference":{"start_date":"2021-07-07","name":"IEEE Computer Society Annual Symposium on VLSI","location":"Tampa, Florida USA (Virtual)","end_date":"2021-07-09"},"title":"MCTS-Based Synthesis Towards Efficient Approximate Accelerators","year":"2021","status":"public","department":[{"_id":"78"}],"keyword":["Approximate computing","Design space exploration","Accelerator synthesis"],"type":"conference","date_created":"2021-06-14T14:05:17Z","abstract":[{"lang":"eng","text":"Approximate computing (AC) has acquired significant maturity in recent years as a promising approach to obtain energy and area-efficient hardware. Automated approximate accelerator synthesis involves a great deal of complexity on the size of design space which exponentially grows with the number of possible approximations. Design space exploration of approximate accelerator synthesis is usually targeted via heuristic-based search methods. The majority of existing frameworks prune a large part of the design space using a greedy-based approach to keep the problem tractable. Therefore, they result in inferior solutions since many potential solutions are neglected in the pruning process without the possibility of backtracking of removed approximate instances. In this paper, we address the aforementioned issue by adopting Monte Carlo Tree Search (MCTS), as an efficient stochastic learning-based search algorithm, in the context of automated synthesis of approximate accelerators. This enables the synthesis frameworks to deeply subsamples the design space of approximate accelerator synthesis toward most promising approximate instances based on the required performance goals, i.e., power consumption, area, or/and delay. We investigated the challenges of providing an efficient open-source framework that benefits analytical and search-based approximation techniques simultaneously to both speed up the synthesis runtime and improve the quality of obtained results. Besides, we studied the utilization of machine learning algorithms to improve the performance of several critical steps, i.e., accelerator quality testing, in the synthesis framework. The proposed framework can help the community to rapidly generate efficient approximate accelerators in a reasonable runtime."}],"citation":{"mla":"Awais, Muhammad, and Marco Platzner. “MCTS-Based Synthesis Towards Efficient Approximate Accelerators.” <i>Proceedings of IEEE Computer Society Annual Symposium on VLSI</i>, IEEE, 2021, pp. 384–89.","ama":"Awais M, Platzner M. MCTS-Based Synthesis Towards Efficient Approximate Accelerators. In: <i>Proceedings of IEEE Computer Society Annual Symposium on VLSI</i>. IEEE; 2021:384-389.","bibtex":"@inproceedings{Awais_Platzner_2021, title={MCTS-Based Synthesis Towards Efficient Approximate Accelerators}, booktitle={Proceedings of IEEE Computer Society Annual Symposium on VLSI}, publisher={IEEE}, author={Awais, Muhammad and Platzner, Marco}, year={2021}, pages={384–389} }","apa":"Awais, M., &#38; Platzner, M. (2021). MCTS-Based Synthesis Towards Efficient Approximate Accelerators. <i>Proceedings of IEEE Computer Society Annual Symposium on VLSI</i>, 384–389.","ieee":"M. Awais and M. Platzner, “MCTS-Based Synthesis Towards Efficient Approximate Accelerators,” in <i>Proceedings of IEEE Computer Society Annual Symposium on VLSI</i>, Tampa, Florida USA (Virtual), 2021, pp. 384–389.","short":"M. Awais, M. Platzner, in: Proceedings of IEEE Computer Society Annual Symposium on VLSI, IEEE, 2021, pp. 384–389.","chicago":"Awais, Muhammad, and Marco Platzner. “MCTS-Based Synthesis Towards Efficient Approximate Accelerators.” In <i>Proceedings of IEEE Computer Society Annual Symposium on VLSI</i>, 384–89. IEEE, 2021."},"publication":"Proceedings of IEEE Computer Society Annual Symposium on VLSI"},{"author":[{"full_name":"Kiesel, Johannes","last_name":"Kiesel","first_name":"Johannes"},{"full_name":"Spina, Damiano","last_name":"Spina","first_name":"Damiano"},{"id":"3900","full_name":"Wachsmuth, Henning","first_name":"Henning","last_name":"Wachsmuth"},{"full_name":"Stein, Benno","last_name":"Stein","first_name":"Benno"}],"title":"The Meant, the Said, and the Understood: Conversational Argument Search and Cognitive Biases","year":"2021","status":"public","date_updated":"2022-01-06T06:55:33Z","_id":"22448","language":[{"iso":"eng"}],"main_file_link":[{"url":"https://dl.acm.org/doi/fullHtml/10.1145/3469595.3469615"}],"page":"1-5","user_id":"82920","citation":{"bibtex":"@inproceedings{Kiesel_Spina_Wachsmuth_Stein_2021, title={The Meant, the Said, and the Understood: Conversational Argument Search and Cognitive Biases}, booktitle={Proceedings of the 2021 Conversational User Interfaces Conference}, author={Kiesel, Johannes and Spina, Damiano and Wachsmuth, Henning and Stein, Benno}, year={2021}, pages={1–5} }","ama":"Kiesel J, Spina D, Wachsmuth H, Stein B. The Meant, the Said, and the Understood: Conversational Argument Search and Cognitive Biases. In: <i>Proceedings of the 2021 Conversational User Interfaces Conference</i>. ; 2021:1-5.","mla":"Kiesel, Johannes, et al. “The Meant, the Said, and the Understood: Conversational Argument Search and Cognitive Biases.” <i>Proceedings of the 2021 Conversational User Interfaces Conference</i>, 2021, pp. 1–5.","chicago":"Kiesel, Johannes, Damiano Spina, Henning Wachsmuth, and Benno Stein. “The Meant, the Said, and the Understood: Conversational Argument Search and Cognitive Biases.” In <i>Proceedings of the 2021 Conversational User Interfaces Conference</i>, 1–5, 2021.","short":"J. Kiesel, D. Spina, H. Wachsmuth, B. Stein, in: Proceedings of the 2021 Conversational User Interfaces Conference, 2021, pp. 1–5.","ieee":"J. Kiesel, D. Spina, H. Wachsmuth, and B. Stein, “The Meant, the Said, and the Understood: Conversational Argument Search and Cognitive Biases,” in <i>Proceedings of the 2021 Conversational User Interfaces Conference</i>, 2021, pp. 1–5.","apa":"Kiesel, J., Spina, D., Wachsmuth, H., &#38; Stein, B. (2021). The Meant, the Said, and the Understood: Conversational Argument Search and Cognitive Biases. <i>Proceedings of the 2021 Conversational User Interfaces Conference</i>, 1–5."},"publication":"Proceedings of the 2021 Conversational User Interfaces Conference","date_created":"2021-06-15T13:51:36Z","department":[{"_id":"600"}],"type":"conference"},{"place":" Valencia, Spain ","citation":{"mla":"Lange, Sven, et al. “Development of Methods for Coil-Based Localization by Magnetic Fields of Miniaturized Sensor Platforms in Bioprocesses.” <i>22nd IEEE International Conference on Industrial Technology (ICIT)</i>, IEEE, 2021, doi:<a href=\"https://doi.org/10.1109/icit46573.2021.9453609\">10.1109/icit46573.2021.9453609</a>.","ama":"Lange S, Schröder D, Hedayat C, Kuhn H, Hilleringmann U. Development of Methods for Coil-Based Localization by Magnetic Fields of Miniaturized Sensor Platforms in Bioprocesses. In: <i>22nd IEEE International Conference on Industrial Technology (ICIT)</i>.  Valencia, Spain : IEEE; 2021. doi:<a href=\"https://doi.org/10.1109/icit46573.2021.9453609\">10.1109/icit46573.2021.9453609</a>","bibtex":"@inproceedings{Lange_Schröder_Hedayat_Kuhn_Hilleringmann_2021, place={ Valencia, Spain }, title={Development of Methods for Coil-Based Localization by Magnetic Fields of Miniaturized Sensor Platforms in Bioprocesses}, DOI={<a href=\"https://doi.org/10.1109/icit46573.2021.9453609\">10.1109/icit46573.2021.9453609</a>}, booktitle={22nd IEEE International Conference on Industrial Technology (ICIT)}, publisher={IEEE}, author={Lange, Sven and Schröder, Dominik and Hedayat, Christian and Kuhn, Harald and Hilleringmann, Ulrich}, year={2021} }","apa":"Lange, S., Schröder, D., Hedayat, C., Kuhn, H., &#38; Hilleringmann, U. (2021). Development of Methods for Coil-Based Localization by Magnetic Fields of Miniaturized Sensor Platforms in Bioprocesses. In <i>22nd IEEE International Conference on Industrial Technology (ICIT)</i>.  Valencia, Spain : IEEE. <a href=\"https://doi.org/10.1109/icit46573.2021.9453609\">https://doi.org/10.1109/icit46573.2021.9453609</a>","ieee":"S. Lange, D. Schröder, C. Hedayat, H. Kuhn, and U. Hilleringmann, “Development of Methods for Coil-Based Localization by Magnetic Fields of Miniaturized Sensor Platforms in Bioprocesses,” in <i>22nd IEEE International Conference on Industrial Technology (ICIT)</i>, Valencia, Spain , 2021.","chicago":"Lange, Sven, Dominik Schröder, Christian Hedayat, Harald Kuhn, and Ulrich Hilleringmann. “Development of Methods for Coil-Based Localization by Magnetic Fields of Miniaturized Sensor Platforms in Bioprocesses.” In <i>22nd IEEE International Conference on Industrial Technology (ICIT)</i>.  Valencia, Spain : IEEE, 2021. <a href=\"https://doi.org/10.1109/icit46573.2021.9453609\">https://doi.org/10.1109/icit46573.2021.9453609</a>.","short":"S. Lange, D. Schröder, C. Hedayat, H. Kuhn, U. Hilleringmann, in: 22nd IEEE International Conference on Industrial Technology (ICIT), IEEE,  Valencia, Spain , 2021."},"project":[{"name":"Computing Resources Provided by the Paderborn Center for Parallel Computing","_id":"52"}],"publisher":"IEEE","_id":"22480","user_id":"38240","conference":{"name":"22nd IEEE International Conference on Industrial Technology (ICIT)","start_date":"2021-03-10","location":"Valencia, Spain ","end_date":"2021-03-12"},"status":"public","date_created":"2021-06-20T23:25:54Z","department":[{"_id":"59"},{"_id":"485"}],"type":"conference","keyword":["Location awareness","Coils","Couplings","Nonuniform electric fields","Magnetic separation","Neural networks","Training data"],"publication":"22nd IEEE International Conference on Industrial Technology (ICIT)","abstract":[{"lang":"eng","text":"In this publication important aspects for the implementation of inductive locating are explained. The miniaturized sensor platform called Sens-o-Spheres is used as an application of this locating method. The sensor platform is applied in bioreactors in order to obtain the environmental parameters, which makes a localization by magnetic fields necessary. Since the properties of magnetic fields in the localization area are very different from the wave characteristics, the principle of inductive localization is investigated in this publication and explained by using electrical equivalent circuit diagrams. Thereby, inductive localization uses the coupling or the mutual inductivities between coils, which is noticeable by an induced voltage. Therefore some properties and procedures are explained to extract the location of Sens-o-Spheres or other industrial sensor platforms from the couplings of the coils. One method calculates the location from an adapted ratio calculation and the other method uses neural networks and stochastic filters to obtain the results. In the end, these results are evaluated and compared."}],"language":[{"iso":"eng"}],"main_file_link":[{"url":"https://ieeexplore.ieee.org/document/9453609"}],"doi":"10.1109/icit46573.2021.9453609","author":[{"id":"38240","last_name":"Lange","first_name":"Sven","full_name":"Lange, Sven"},{"full_name":"Schröder, Dominik","last_name":"Schröder","first_name":"Dominik"},{"first_name":"Christian","last_name":"Hedayat","full_name":"Hedayat, Christian"},{"last_name":"Kuhn","first_name":"Harald","full_name":"Kuhn, Harald"},{"full_name":"Hilleringmann, Ulrich","first_name":"Ulrich","last_name":"Hilleringmann"}],"publication_identifier":{"isbn":["9781728157306"]},"year":"2021","title":"Development of Methods for Coil-Based Localization by Magnetic Fields of Miniaturized Sensor Platforms in Bioprocesses","publication_status":"published","date_updated":"2022-01-06T06:55:33Z"},{"main_file_link":[{"url":"https://ieeexplore.ieee.org/document/9453646"}],"language":[{"iso":"eng"}],"doi":"10.1109/icit46573.2021.9453646","year":"2021","title":"Detection of Defects on Irregular Structured Surfaces by Image Processing Methods for Feature Extraction","author":[{"full_name":"Sander, Tom","first_name":"Tom","last_name":"Sander"},{"id":"38240","last_name":"Lange","first_name":"Sven","full_name":"Lange, Sven"},{"full_name":"Hilleringmann, Ulrich","first_name":"Ulrich","last_name":"Hilleringmann"},{"full_name":"Geneis, Volker","last_name":"Geneis","first_name":"Volker"},{"full_name":"Hedayat, Christian","last_name":"Hedayat","first_name":"Christian"},{"full_name":"Kuhn, Harald","first_name":"Harald","last_name":"Kuhn"},{"last_name":"Gockel","first_name":"Franz-Barthold","full_name":"Gockel, Franz-Barthold"}],"publication_identifier":{"isbn":["9781728157306"]},"date_updated":"2022-01-06T06:55:33Z","publication_status":"published","date_created":"2021-06-20T23:32:11Z","keyword":["Image Processing","Defect Detection","wooden surfaces","Machine Learning","Neural Networks"],"type":"conference","department":[{"_id":"59"},{"_id":"485"}],"publication":"22nd IEEE International Conference on Industrial Technology (ICIT)","abstract":[{"lang":"eng","text":"During the industrial processing of materials for the manufacture of new products, surface defects can quickly occur. In order to achieve high quality without a long time delay, it makes sense to inspect the work pieces so that defective work pieces can be sorted out right at the beginning of the process. At the same time, the evaluation unit should come close the perception of the human eye regarding detection of defects in surfaces. Such defects often manifest themselves by a deviation of the existing structure. The only restriction should be that only matt surfaces should be considered here. Therefore in this work, different classification and image processing algorithms are applied to surface data to identify possible surface damages. For this purpose, the Gabor filter and the FST (Fused Structure and Texture) features generated with it, as well as the salience metric are used on the image processing side. On the classification side, however, deep neural networks, Convolutional Neural Networks (CNN), and autoencoders are used to make a decision. A distinction is also made between training using class labels and without. It turns out later that the salience metric are best performed by CNN. On the other hand, if there is no labeled training data available, a novelty classification can easily be achieved by using autoencoders as well as the salience metric and some filters."}],"_id":"22481","publisher":"IEEE","user_id":"38240","status":"public","conference":{"end_date":"2021-03-12","start_date":"2021-03-10","name":"22nd IEEE International Conference on Industrial Technology (ICIT)","location":"Valencia, Spain "},"place":"Valencia, Spain ","citation":{"mla":"Sander, Tom, et al. “Detection of Defects on Irregular Structured Surfaces by Image Processing Methods for Feature Extraction.” <i>22nd IEEE International Conference on Industrial Technology (ICIT)</i>, IEEE, 2021, doi:<a href=\"https://doi.org/10.1109/icit46573.2021.9453646\">10.1109/icit46573.2021.9453646</a>.","apa":"Sander, T., Lange, S., Hilleringmann, U., Geneis, V., Hedayat, C., Kuhn, H., &#38; Gockel, F.-B. (2021). Detection of Defects on Irregular Structured Surfaces by Image Processing Methods for Feature Extraction. In <i>22nd IEEE International Conference on Industrial Technology (ICIT)</i>. Valencia, Spain : IEEE. <a href=\"https://doi.org/10.1109/icit46573.2021.9453646\">https://doi.org/10.1109/icit46573.2021.9453646</a>","ieee":"T. Sander <i>et al.</i>, “Detection of Defects on Irregular Structured Surfaces by Image Processing Methods for Feature Extraction,” in <i>22nd IEEE International Conference on Industrial Technology (ICIT)</i>, Valencia, Spain , 2021.","chicago":"Sander, Tom, Sven Lange, Ulrich Hilleringmann, Volker Geneis, Christian Hedayat, Harald Kuhn, and Franz-Barthold Gockel. “Detection of Defects on Irregular Structured Surfaces by Image Processing Methods for Feature Extraction.” In <i>22nd IEEE International Conference on Industrial Technology (ICIT)</i>. Valencia, Spain : IEEE, 2021. <a href=\"https://doi.org/10.1109/icit46573.2021.9453646\">https://doi.org/10.1109/icit46573.2021.9453646</a>.","short":"T. Sander, S. Lange, U. Hilleringmann, V. Geneis, C. Hedayat, H. Kuhn, F.-B. Gockel, in: 22nd IEEE International Conference on Industrial Technology (ICIT), IEEE, Valencia, Spain , 2021.","ama":"Sander T, Lange S, Hilleringmann U, et al. Detection of Defects on Irregular Structured Surfaces by Image Processing Methods for Feature Extraction. In: <i>22nd IEEE International Conference on Industrial Technology (ICIT)</i>. Valencia, Spain : IEEE; 2021. doi:<a href=\"https://doi.org/10.1109/icit46573.2021.9453646\">10.1109/icit46573.2021.9453646</a>","bibtex":"@inproceedings{Sander_Lange_Hilleringmann_Geneis_Hedayat_Kuhn_Gockel_2021, place={Valencia, Spain }, title={Detection of Defects on Irregular Structured Surfaces by Image Processing Methods for Feature Extraction}, DOI={<a href=\"https://doi.org/10.1109/icit46573.2021.9453646\">10.1109/icit46573.2021.9453646</a>}, booktitle={22nd IEEE International Conference on Industrial Technology (ICIT)}, publisher={IEEE}, author={Sander, Tom and Lange, Sven and Hilleringmann, Ulrich and Geneis, Volker and Hedayat, Christian and Kuhn, Harald and Gockel, Franz-Barthold}, year={2021} }"}},{"date_updated":"2022-01-06T06:55:33Z","author":[{"full_name":"Brede, Mathis","first_name":"Mathis","last_name":"Brede"}],"status":"public","year":"2021","title":"Implementation and Profiling of XCS in the Context of Embedded Systems","user_id":"477","_id":"22483","publisher":"Paderborn University","language":[{"iso":"eng"}],"project":[{"name":"SFB 901 - Subproject C2","_id":"14"},{"_id":"4","name":"SFB 901 - Project Area C"},{"_id":"1","name":"SFB 901"}],"abstract":[{"lang":"eng","text":"This bachelor thesis presents a C/C++ implementation of the XCS algorithm for an embedded system and profiling results concerning the execution time of the functions. These are then analyzed in relation to the input characteristics of the examined learning environments and compared with related work. Three main conclusions can be drawn from the measured results. First, the maximum size of the population of the classifiers influences the runtime of the genetic algorithm; second, the size of the input space has a direct effect on the execution time of the matching function; and last, a larger action space results in a longer runtime generating the prediction for the possible actions. The dependencies identified here can serve to optimize the computational efficiency and make XCS more suitable for embedded systems."}],"extern":"1","supervisor":[{"id":"398","full_name":"Platzner, Marco","first_name":"Marco","last_name":"Platzner"},{"id":"49992","full_name":"Hansmeier, Tim","last_name":"Hansmeier","first_name":"Tim","orcid":"0000-0003-1377-3339"}],"citation":{"mla":"Brede, Mathis. <i>Implementation and Profiling of XCS in the Context of Embedded Systems</i>. Paderborn University, 2021.","bibtex":"@book{Brede_2021, place={Paderborn}, title={Implementation and Profiling of XCS in the Context of Embedded Systems}, publisher={Paderborn University}, author={Brede, Mathis}, year={2021} }","ama":"Brede M. <i>Implementation and Profiling of XCS in the Context of Embedded Systems</i>. Paderborn: Paderborn University; 2021.","ieee":"M. Brede, <i>Implementation and Profiling of XCS in the Context of Embedded Systems</i>. Paderborn: Paderborn University, 2021.","apa":"Brede, M. (2021). <i>Implementation and Profiling of XCS in the Context of Embedded Systems</i>. Paderborn: Paderborn University.","chicago":"Brede, Mathis. <i>Implementation and Profiling of XCS in the Context of Embedded Systems</i>. Paderborn: Paderborn University, 2021.","short":"M. Brede, Implementation and Profiling of XCS in the Context of Embedded Systems, Paderborn University, Paderborn, 2021."},"department":[{"_id":"78"}],"type":"bachelorsthesis","place":"Paderborn","date_created":"2021-06-21T09:35:03Z"},{"date_created":"2021-06-28T09:24:15Z","keyword":["Local algorithms","Distributed algorithms","Collisionless gathering","Mobile robots","Multiagent system"],"type":"journal_article","department":[{"_id":"63"}],"publication":"Theoretical Computer Science","abstract":[{"lang":"eng","text":"Over the past decades, the Gathering problem, which asks to gather a group of robots in finite time given some restrictions, has been intensively studied. In this paper, we are given a group of n autonomous, dimensionless, deterministic, and anonymous robots, with bounded viewing range. Assuming a continuous time model, the goal is to gather these robots into one point in finite time. We introduce a simple convergence criterion that defines a new class of algorithms which perform gathering in O(nd) time, where d is the diameter of the initial robot configuration. We show that some gathering algorithms in the literature belong to this class and propose two new algorithms that belong to this class and have quadratic running time, namely, Go-To-The-Relative-Center algorithm (GTRC) and Safe-Go-To-The-Relative-Center algorithm (S-GTRC). We prove that the latter can perform gathering without collision by using a slightly more complex robot model: non oblivious, chiral, and luminous (i.e. robots have observable external memory, as in [8]). We also consider a variant of the Gathering problem, the Near-Gathering problem, in which robots must get close to each other without colliding. We show that S-GTRC solves the Near-Gathering problem in quadratic time and assumes a weaker robot model than the one assumed in the current state-of-the-art."}],"language":[{"iso":"eng"}],"doi":"10.1016/j.tcs.2020.10.037","title":"A continuous strategy for collisionless gathering","year":"2021","publication_identifier":{"issn":["0304-3975"]},"author":[{"full_name":"Li, Shouwei","last_name":"Li","first_name":"Shouwei"},{"full_name":"Markarian, Christine","last_name":"Markarian","first_name":"Christine"},{"first_name":"Friedhelm","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","id":"15523"},{"first_name":"Pavel","last_name":"Podlipyan","full_name":"Podlipyan, Pavel"}],"publication_status":"published","date_updated":"2022-01-06T06:55:35Z","intvolume":"       852","citation":{"chicago":"Li, Shouwei, Christine Markarian, Friedhelm Meyer auf der Heide, and Pavel Podlipyan. “A Continuous Strategy for Collisionless Gathering.” <i>Theoretical Computer Science</i> 852 (2021): 41–60. <a href=\"https://doi.org/10.1016/j.tcs.2020.10.037\">https://doi.org/10.1016/j.tcs.2020.10.037</a>.","short":"S. Li, C. Markarian, F. Meyer auf der Heide, P. Podlipyan, Theoretical Computer Science 852 (2021) 41–60.","ieee":"S. Li, C. Markarian, F. Meyer auf der Heide, and P. Podlipyan, “A continuous strategy for collisionless gathering,” <i>Theoretical Computer Science</i>, vol. 852, pp. 41–60, 2021.","apa":"Li, S., Markarian, C., Meyer auf der Heide, F., &#38; Podlipyan, P. (2021). A continuous strategy for collisionless gathering. <i>Theoretical Computer Science</i>, <i>852</i>, 41–60. <a href=\"https://doi.org/10.1016/j.tcs.2020.10.037\">https://doi.org/10.1016/j.tcs.2020.10.037</a>","bibtex":"@article{Li_Markarian_Meyer auf der Heide_Podlipyan_2021, title={A continuous strategy for collisionless gathering}, volume={852}, DOI={<a href=\"https://doi.org/10.1016/j.tcs.2020.10.037\">10.1016/j.tcs.2020.10.037</a>}, journal={Theoretical Computer Science}, author={Li, Shouwei and Markarian, Christine and Meyer auf der Heide, Friedhelm and Podlipyan, Pavel}, year={2021}, pages={41–60} }","ama":"Li S, Markarian C, Meyer auf der Heide F, Podlipyan P. A continuous strategy for collisionless gathering. <i>Theoretical Computer Science</i>. 2021;852:41-60. doi:<a href=\"https://doi.org/10.1016/j.tcs.2020.10.037\">10.1016/j.tcs.2020.10.037</a>","mla":"Li, Shouwei, et al. “A Continuous Strategy for Collisionless Gathering.” <i>Theoretical Computer Science</i>, vol. 852, 2021, pp. 41–60, doi:<a href=\"https://doi.org/10.1016/j.tcs.2020.10.037\">10.1016/j.tcs.2020.10.037</a>."},"page":"41-60","_id":"22510","user_id":"15415","volume":852,"status":"public"}]