[{"conference":{"name":"IFIP/IEEE International Symposium on Integrated Network Management (IM)","location":"Bordeaux, France"},"author":[{"last_name":"Schneider","orcid":"0000-0001-8210-4011","full_name":"Schneider, Stefan Balthasar","id":"35343","first_name":"Stefan Balthasar"},{"first_name":"Mirko","full_name":"Jürgens, Mirko","last_name":"Jürgens"},{"first_name":"Holger","id":"126","full_name":"Karl, Holger","last_name":"Karl"}],"oa":"1","date_updated":"2022-01-06T06:54:32Z","citation":{"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.","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.","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.","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.","short":"S.B. Schneider, M. Jürgens, H. Karl, in: IFIP/IEEE International Symposium on Integrated Network Management (IM), IFIP/IEEE, 2021.","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} }","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."},"has_accepted_license":"1","file_date_updated":"2020-12-11T08:37:37Z","user_id":"35343","department":[{"_id":"75"}],"project":[{"name":"SFB 901","_id":"1"},{"_id":"4","name":"SFB 901 - Project Area C"},{"name":"SFB 901 - Subproject C4","_id":"16"}],"_id":"20693","status":"public","type":"conference","title":"Divide and Conquer: Hierarchical Network and Service Coordination","date_created":"2020-12-11T08:39:47Z","publisher":"IFIP/IEEE","year":"2021","quality_controlled":"1","language":[{"iso":"eng"}],"ddc":["006"],"keyword":["network management","service management","coordination","hierarchical","scalability","nfv"],"file":[{"relation":"main_file","content_type":"application/pdf","file_size":7979772,"title":"Divide and Conquer: Hierarchical Network and Service Coordination","file_id":"20694","access_level":"open_access","file_name":"preprint_with_header.pdf","date_updated":"2020-12-11T08:37:37Z","date_created":"2020-12-11T08:37:37Z","creator":"stschn"}],"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"}],"publication":"IFIP/IEEE International Symposium on Integrated Network Management (IM)"},{"publication_status":"published","year":"2021","citation":{"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>","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>.","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.","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.","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} }","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>"},"page":"14:1 - 14:17","date_updated":"2022-01-06T06:54:40Z","date_created":"2020-12-21T13:46:16Z","author":[{"first_name":"Marcin","last_name":"Bienkowski","full_name":"Bienkowski, Marcin"},{"full_name":"Feldkord, Björn","id":"22704","last_name":"Feldkord","first_name":"Björn"},{"last_name":"Schmidt","full_name":"Schmidt, Pawel","first_name":"Pawel"}],"title":"A Nearly Optimal Deterministic Online Algorithm for Non-Metric Facility Location","doi":"10.4230/LIPIcs.STACS.2021.14","type":"conference","publication":"Proceedings of the 38th Symposium on Theoretical Aspects of Computer Science (STACS)","status":"public","project":[{"name":"SFB 901","_id":"1"},{"_id":"2","name":"SFB 901 - Project Area A"},{"_id":"5","name":"SFB 901 - Subproject A1"}],"_id":"20817","user_id":"22704","department":[{"_id":"63"}],"language":[{"iso":"eng"}]},{"status":"public","publication":"Proceedings of the IEEE/CVF Winter Conference on Applications of Computer Vision","type":"conference","language":[{"iso":"eng"}],"department":[{"_id":"66"},{"_id":"534"},{"_id":"624"},{"_id":"219"},{"_id":"27"}],"user_id":"27340","_id":"20886","page":"1994-2002","citation":{"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.","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.","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.","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} }","short":"T. Nickchen, S. Heindorf, G. Engels, in: Proceedings of the IEEE/CVF Winter Conference on Applications of Computer Vision, 2021, pp. 1994–2002.","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."},"year":"2021","publication_status":"published","conference":{"location":"Hawaii","end_date":"2021-09-01","start_date":"2021-05-01","name":"IEEE/CVF Winter Conference on Applications of Computer Vision"},"title":"Generating Physically Sound Training Data for Image Recognition of Additively Manufactured Parts","author":[{"full_name":"Nickchen, Tobias","last_name":"Nickchen","first_name":"Tobias"},{"full_name":"Heindorf, Stefan","last_name":"Heindorf","first_name":"Stefan"},{"last_name":"Engels","full_name":"Engels, Gregor","first_name":"Gregor"}],"date_created":"2021-01-07T15:32:45Z","date_updated":"2022-01-06T06:54:41Z"},{"ddc":["000"],"language":[{"iso":"eng"}],"file_date_updated":"2021-07-20T16:16:05Z","_id":"22155","project":[{"_id":"1","name":"SFB 901"},{"_id":"4","name":"SFB 901 - Project Area C"},{"_id":"17","name":"SFB 901 - Subproject C5"}],"department":[{"_id":"66"},{"_id":"534"}],"user_id":"47208","status":"public","file":[{"content_type":"application/pdf","relation":"main_file","date_updated":"2021-07-20T16:16:05Z","date_created":"2021-07-20T16:16:05Z","creator":"sego","file_size":278027,"file_name":"CAISEDC21.pdf","access_level":"open_access","file_id":"22767"}],"publication":"Advanced Software Engineering. Doctorial Consortium","type":"conference","title":"Situation-specific Development of Business Models for Services in Software Ecosystems","oa":"1","publisher":"CEUR","date_updated":"2022-01-06T06:55:28Z","date_created":"2021-05-11T12:46:07Z","author":[{"last_name":"Gottschalk","full_name":"Gottschalk, Sebastian","id":"47208","first_name":"Sebastian"}],"year":"2021","citation":{"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} }","short":"S. Gottschalk, in: Advanced Software Engineering. Doctorial Consortium, CEUR, 2021.","mla":"Gottschalk, Sebastian. “Situation-Specific Development of Business Models for Services in Software Ecosystems.” <i>Advanced Software Engineering. Doctorial Consortium</i>, CEUR, 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.","ama":"Gottschalk S. Situation-specific Development of Business Models for Services in Software Ecosystems. In: <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.","chicago":"Gottschalk, Sebastian. “Situation-Specific Development of Business Models for Services in Software Ecosystems.” In <i>Advanced Software Engineering. Doctorial Consortium</i>. CEUR, 2021."},"has_accepted_license":"1"},{"language":[{"iso":"eng"}],"_id":"22156","user_id":"82920","department":[{"_id":"600"}],"abstract":[{"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.","lang":"eng"}],"status":"public","type":"conference","publication":"Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence, IJCAI-21","title":"Bias Silhouette Analysis: Towards Assessing the Quality of Bias Metrics for Word Embedding Models","main_file_link":[{"open_access":"1","url":"https://www.ijcai.org/proceedings/2021/77"}],"conference":{"end_date":"2021-08-26","location":"Online","name":"30th International Joint Conference on Artificial Intelligence (IJCAI-21)","start_date":"2021-08-19"},"doi":"10.24963/ijcai.2021/77","oa":"1","date_updated":"2022-01-06T06:55:28Z","author":[{"first_name":"Maximilian","full_name":"Spliethöver, Maximilian","id":"84035","last_name":"Spliethöver","orcid":"0000-0003-4364-1409"},{"last_name":"Wachsmuth","full_name":"Wachsmuth, Henning","id":"3900","first_name":"Henning"}],"date_created":"2021-05-11T23:13:26Z","year":"2021","citation":{"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>.","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>.","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>","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>","short":"M. Spliethöver, H. Wachsmuth, in: Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence, IJCAI-21, 2021, pp. 552–559.","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>.","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} }"},"page":"552-559","quality_controlled":"1"},{"status":"public","type":"conference","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","language":[{"iso":"eng"}],"_id":"22158","user_id":"82920","department":[{"_id":"600"}],"year":"2021","citation":{"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.","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} }","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.","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.","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.","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."},"page":"3482-3493","title":"Generating Informative Conclusions for Argumentative Texts","main_file_link":[{"url":"https://aclanthology.org/2021.findings-acl.306.pdf","open_access":"1"}],"date_updated":"2022-01-06T06:55:28Z","oa":"1","date_created":"2021-05-11T23:18:14Z","author":[{"last_name":"Syed","full_name":"Syed, Shahbaz","first_name":"Shahbaz"},{"first_name":"Khalid","full_name":"Al-Khatib, Khalid","last_name":"Al-Khatib"},{"last_name":"Alshomary","full_name":"Alshomary, Milad","id":"73059","first_name":"Milad"},{"last_name":"Wachsmuth","id":"3900","full_name":"Wachsmuth, Henning","first_name":"Henning"},{"first_name":"Martin","full_name":"Potthast, Martin","last_name":"Potthast"}]},{"status":"public","type":"conference","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)","language":[{"iso":"eng"}],"user_id":"82920","department":[{"_id":"600"}],"_id":"22159","citation":{"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.","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.","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.","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.","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.","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} }","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."},"page":"1583-1595","year":"2021","main_file_link":[{"open_access":"1","url":"https://aclanthology.org/2021.acl-long.126.pdf"}],"title":"Syntopical Graphs for Computational Argumentation Tasks","author":[{"last_name":"Barrow","full_name":"Barrow, Joe","first_name":"Joe"},{"last_name":"Jain","full_name":"Jain, Rajiv","first_name":"Rajiv"},{"first_name":"Nedim","full_name":"Lipka, Nedim","last_name":"Lipka"},{"first_name":"Franck","last_name":"Dernoncourt","full_name":"Dernoncourt, Franck"},{"first_name":"Vlad","full_name":"Morariu, Vlad","last_name":"Morariu"},{"first_name":"Varun","full_name":"Manjunatha, Varun","last_name":"Manjunatha"},{"first_name":"Douglas","last_name":"Oard","full_name":"Oard, Douglas"},{"first_name":"Philip","last_name":"Resnik","full_name":"Resnik, Philip"},{"last_name":"Wachsmuth","full_name":"Wachsmuth, Henning","id":"3900","first_name":"Henning"}],"date_created":"2021-05-11T23:20:59Z","date_updated":"2022-01-06T06:55:28Z","oa":"1"},{"_id":"22160","user_id":"82920","department":[{"_id":"600"}],"language":[{"iso":"eng"}],"type":"conference","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)","status":"public","date_updated":"2022-01-06T06:55:28Z","date_created":"2021-05-11T23:22:36Z","author":[{"first_name":"Khalid","full_name":"Al-Khatib, Khalid","last_name":"Al-Khatib"},{"first_name":"Lukas","full_name":"Trautner, Lukas","last_name":"Trautner"},{"full_name":"Wachsmuth, Henning","id":"3900","last_name":"Wachsmuth","first_name":"Henning"},{"full_name":"Hou, Yufang","last_name":"Hou","first_name":"Yufang"},{"first_name":"Benno","full_name":"Stein, Benno","last_name":"Stein"}],"title":"Employing Argumentation Knowledge Graphs for Neural Argument Generation","main_file_link":[{"url":"https://aclanthology.org/2021.acl-long.366.pdf"}],"year":"2021","citation":{"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.","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} }","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.","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.","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.","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.","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."},"page":"4744-4754"},{"date_updated":"2022-01-06T06:55:29Z","supervisor":[{"first_name":"Marco","last_name":"Platzner","full_name":"Platzner, Marco","id":"398"},{"full_name":"Witschen, Linus Matthias","id":"49051","last_name":"Witschen","first_name":"Linus Matthias"}],"author":[{"first_name":"Jakob Werner","last_name":"Rehnen","full_name":"Rehnen, Jakob Werner"}],"date_created":"2021-05-19T16:56:11Z","title":"Decomposition of Arithmetic Components for the Approximate Circuit Synthesis with EvoApproxLib","year":"2021","citation":{"chicago":"Rehnen, Jakob Werner. <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.","ama":"Rehnen JW. <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} }","mla":"Rehnen, Jakob Werner. <i>Decomposition of Arithmetic Components for the Approximate Circuit Synthesis with EvoApproxLib</i>. 2021.","short":"J.W. Rehnen, Decomposition of Arithmetic Components for the Approximate Circuit Synthesis with EvoApproxLib, 2021.","apa":"Rehnen, J. W. (2021). <i>Decomposition of Arithmetic Components for the Approximate Circuit Synthesis with EvoApproxLib</i>."},"_id":"22216","department":[{"_id":"78"},{"_id":"7"}],"user_id":"49051","language":[{"iso":"eng"}],"type":"bachelorsthesis","status":"public"},{"publication_identifier":{"isbn":["ISBN 978-3-03868-132-8 "]},"year":"2021","citation":{"ieee":"B. Sousa Santos and G. Domik, Eds., <i>EUROGRAPHICS 2021: Education Papers Frontmatter</i>. Eurographics Association , 2021.","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>.","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>","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} }","short":"B. Sousa Santos, G. Domik, eds., EUROGRAPHICS 2021: Education Papers Frontmatter, Eurographics Association , 2021.","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>.","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>"},"publisher":"Eurographics Association ","date_updated":"2022-01-06T06:55:29Z","date_created":"2021-05-26T09:04:55Z","title":"EUROGRAPHICS 2021: Education Papers Frontmatter","conference":{"name":"Eurographics 2021","start_date":"2021-05-03","end_date":"2021-05-07","location":"Vienna"},"doi":"10.2312/EGED.20212000","type":"conference_editor","editor":[{"first_name":"Beatriz","last_name":"Sousa Santos","full_name":"Sousa Santos, Beatriz"},{"first_name":"Gitta","id":"90","full_name":"Domik, Gitta","last_name":"Domik"}],"status":"public","_id":"22230","user_id":"90","department":[{"_id":"65"}],"language":[{"iso":"eng"}]},{"has_accepted_license":"1","year":"2021","place":"Paderborn","citation":{"ieee":"S. Schott, <i>Android App Analysis Benchmark Case Generation</i>. Paderborn, 2021.","chicago":"Schott, Stefan. <i>Android App Analysis Benchmark Case Generation</i>. Paderborn, 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.","short":"S. Schott, Android App Analysis Benchmark Case Generation, Paderborn, 2021.","bibtex":"@book{Schott_2021, place={Paderborn}, title={Android App Analysis Benchmark Case Generation}, author={Schott, Stefan}, year={2021} }","apa":"Schott, S. (2021). <i>Android App Analysis Benchmark Case Generation</i>. Paderborn."},"oa":"1","date_updated":"2022-01-06T06:55:31Z","author":[{"first_name":"Stefan","full_name":"Schott, Stefan","id":"54847","last_name":"Schott"}],"date_created":"2021-06-09T06:04:12Z","supervisor":[{"last_name":"Wehrheim","id":"573","full_name":"Wehrheim, Heike","first_name":"Heike"}],"title":"Android App Analysis Benchmark Case Generation","type":"mastersthesis","file":[{"content_type":"application/pdf","relation":"main_file","date_updated":"2021-06-09T06:01:45Z","creator":"fpauck","date_created":"2021-06-09T06:01:45Z","file_size":1918444,"file_id":"22305","access_level":"open_access","file_name":"Masters_Thesis_Stefan_Schott_unsigned.pdf"}],"status":"public","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subproject B4","_id":"12"},{"_id":"3","name":"SFB 901 - Project Area B"}],"_id":"22304","user_id":"477","department":[{"_id":"77"}],"ddc":["000"],"file_date_updated":"2021-06-09T06:01:45Z","extern":"1","language":[{"iso":"eng"}]},{"publication_status":"published","page":"205-237","citation":{"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>","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>.","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} }","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.","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.","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>.","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>"},"year":"2021","place":"Cham","date_created":"2021-06-09T13:07:05Z","author":[{"id":"43136","full_name":"Koldewey, Christian","orcid":"https://orcid.org/0000-0001-7992-6399","last_name":"Koldewey","first_name":"Christian"},{"first_name":"Jürgen","full_name":"Gausemeier, Jürgen","id":"163","last_name":"Gausemeier"},{"full_name":"Dumitrescu, Roman","id":"16190","last_name":"Dumitrescu","first_name":"Roman"},{"full_name":"Evers, Hans-Heinrich","last_name":"Evers","first_name":"Hans-Heinrich"},{"full_name":"Frank, Maximilian","last_name":"Frank","first_name":"Maximilian"},{"last_name":"Reinhold","full_name":"Reinhold, Jannik","id":"33669","first_name":"Jannik"}],"publisher":"Springer Nature","date_updated":"2022-01-06T06:55:31Z","doi":"https://doi.org/10.1007/978-3-030-69380-0_12#DOI","title":"Development Process for Smart Service Strategies: Grasping the Potentials of Digitalization for Servitization","publication":"Digitalization","type":"book_chapter","status":"public","editor":[{"last_name":"Schallmo","full_name":"Schallmo, Daniel R.","first_name":"Daniel R."},{"full_name":"Tidd, Joseph","last_name":"Tidd","first_name":"Joseph"}],"department":[{"_id":"563"}],"user_id":"15782","series_title":"Management for Professionals","_id":"22306","language":[{"iso":"eng"}]},{"language":[{"iso":"eng"}],"user_id":"15782","department":[{"_id":"563"}],"_id":"22307","status":"public","type":"conference_abstract","publication":" Proceedings of the International Conference on Information and Computer Technologies","conference":{"end_date":"2021-03-14","location":"Kahului, Hawaii, United States of America","name":"4th International Conference on Information and Computer Technologies (ICICT 2021)","start_date":"2021-03-11"},"title":"Digital Knowledge Base for Industrial Augmented Reality Systems Based on Semantic Technologies","author":[{"first_name":"Daniel","last_name":"Eckertz","full_name":"Eckertz, Daniel"},{"first_name":"Marus","full_name":"Möller, Marus","last_name":"Möller"},{"full_name":"Anacker, Harald","last_name":"Anacker","first_name":"Harald"},{"full_name":"Dumitrescu, Roman","id":"16190","last_name":"Dumitrescu","first_name":"Roman"}],"date_created":"2021-06-11T09:16:17Z","date_updated":"2022-01-06T06:55:31Z","citation":{"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.","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} }","short":"D. Eckertz, M. Möller, H. Anacker, R. Dumitrescu, in:  Proceedings of the International Conference on Information and Computer Technologies, 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.","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.","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."},"year":"2021"},{"conference":{"end_date":"2021-07-09","location":"Tampa, Florida USA (Virtual)","name":"IEEE Computer Society Annual Symposium on VLSI","start_date":"2021-07-07"},"title":"MCTS-Based Synthesis Towards Efficient Approximate Accelerators","date_created":"2021-06-14T14:05:17Z","author":[{"first_name":"Muhammad","full_name":"Awais, Muhammad","id":"64665","last_name":"Awais","orcid":"https://orcid.org/0000-0003-4148-2969"},{"full_name":"Platzner, Marco","last_name":"Platzner","first_name":"Marco"}],"publisher":"IEEE","date_updated":"2022-01-06T06:55:31Z","citation":{"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.","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} }","short":"M. Awais, M. Platzner, in: Proceedings of IEEE Computer Society Annual Symposium on VLSI, IEEE, 2021, pp. 384–389.","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.","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.","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."},"page":"384-389","year":"2021","language":[{"iso":"eng"}],"keyword":["Approximate computing","Design space exploration","Accelerator synthesis"],"user_id":"64665","department":[{"_id":"78"}],"_id":"22309","status":"public","abstract":[{"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.","lang":"eng"}],"type":"conference","publication":"Proceedings of IEEE Computer Society Annual Symposium on VLSI"},{"department":[{"_id":"600"}],"user_id":"82920","_id":"22448","language":[{"iso":"eng"}],"publication":"Proceedings of the 2021 Conversational User Interfaces Conference","type":"conference","status":"public","author":[{"first_name":"Johannes","last_name":"Kiesel","full_name":"Kiesel, Johannes"},{"full_name":"Spina, Damiano","last_name":"Spina","first_name":"Damiano"},{"first_name":"Henning","full_name":"Wachsmuth, Henning","id":"3900","last_name":"Wachsmuth"},{"full_name":"Stein, Benno","last_name":"Stein","first_name":"Benno"}],"date_created":"2021-06-15T13:51:36Z","date_updated":"2022-01-06T06:55:33Z","main_file_link":[{"url":"https://dl.acm.org/doi/fullHtml/10.1145/3469595.3469615"}],"title":"The Meant, the Said, and the Understood: Conversational Argument Search and Cognitive Biases","page":"1-5","citation":{"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.","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.","short":"J. Kiesel, D. Spina, H. Wachsmuth, B. Stein, in: Proceedings of the 2021 Conversational User Interfaces Conference, 2021, pp. 1–5.","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.","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.","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."},"year":"2021"},{"title":"Implementation and Profiling of XCS in the Context of Embedded Systems","date_created":"2021-06-21T09:35:03Z","author":[{"last_name":"Brede","full_name":"Brede, Mathis","first_name":"Mathis"}],"supervisor":[{"last_name":"Platzner","full_name":"Platzner, Marco","id":"398","first_name":"Marco"},{"last_name":"Hansmeier","orcid":"0000-0003-1377-3339","full_name":"Hansmeier, Tim","id":"49992","first_name":"Tim"}],"date_updated":"2022-01-06T06:55:33Z","publisher":"Paderborn University","citation":{"ieee":"M. Brede, <i>Implementation and Profiling of XCS in the Context of Embedded Systems</i>. Paderborn: Paderborn University, 2021.","chicago":"Brede, Mathis. <i>Implementation and Profiling of XCS in the Context of Embedded Systems</i>. Paderborn: Paderborn University, 2021.","ama":"Brede M. <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.","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} }","short":"M. Brede, Implementation and Profiling of XCS in the Context of Embedded Systems, Paderborn University, Paderborn, 2021.","mla":"Brede, Mathis. <i>Implementation and Profiling of XCS in the Context of Embedded Systems</i>. Paderborn University, 2021."},"place":"Paderborn","year":"2021","extern":"1","language":[{"iso":"eng"}],"department":[{"_id":"78"}],"user_id":"477","_id":"22483","project":[{"_id":"14","name":"SFB 901 - Subproject C2"},{"_id":"4","name":"SFB 901 - Project Area C"},{"_id":"1","name":"SFB 901"}],"status":"public","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."}],"type":"bachelorsthesis"},{"title":"A continuous strategy for collisionless gathering","doi":"10.1016/j.tcs.2020.10.037","date_updated":"2022-01-06T06:55:35Z","author":[{"first_name":"Shouwei","last_name":"Li","full_name":"Li, Shouwei"},{"first_name":"Christine","last_name":"Markarian","full_name":"Markarian, Christine"},{"first_name":"Friedhelm","id":"15523","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide"},{"last_name":"Podlipyan","full_name":"Podlipyan, Pavel","first_name":"Pavel"}],"date_created":"2021-06-28T09:24:15Z","volume":852,"year":"2021","citation":{"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>","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>.","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>","short":"S. Li, C. Markarian, F. Meyer auf der Heide, P. Podlipyan, Theoretical Computer Science 852 (2021) 41–60.","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>.","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} }"},"intvolume":"       852","page":"41-60","publication_status":"published","publication_identifier":{"issn":["0304-3975"]},"keyword":["Local algorithms","Distributed algorithms","Collisionless gathering","Mobile robots","Multiagent system"],"language":[{"iso":"eng"}],"_id":"22510","user_id":"15415","department":[{"_id":"63"}],"abstract":[{"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.","lang":"eng"}],"status":"public","type":"journal_article","publication":"Theoretical Computer Science"},{"_id":"22511","user_id":"15415","department":[{"_id":"63"}],"keyword":["Local algorithms","Distributed algorithms","Collisionless gathering","Mobile robots","Multiagent system"],"language":[{"iso":"eng"}],"type":"journal_article","publication":"Theoretical Computer Science","abstract":[{"lang":"eng","text":"In this paper, we reconsider the well-known discrete, round-based Go-To-The-Center algorithm due to Ando, Suzuki, and Yamashita [2] for gathering n autonomous mobile robots with limited viewing range in the plane. Remarquably, this algorithm exploits the fact that during its execution, many collisions of robots occur. Such collisions are interpreted as a success because it is assumed that such collided robots behave the same from now on. This is acceptable under the assumption that each robot is represented by a single point. Otherwise, collisions should be avoided. In this paper, we consider a continuous Go-To-The-Center algorithm in which the robots continuously observe the positions of their neighbors and adapt their speed (assuming a speed limit) and direction. Our first results are time bounds of O(n2) for gathering in two dimensions Euclidean space, and Θ(n) for the one dimension. Our main contribution is the introduction and evaluation of a continuous algorithm which performs Go-To-The-Center considering only the neighbors of a robot with respect to the Gabriel subgraph of the visibility graph, i.e. Go-To-The-Gabriel-Center algorithm. We show that this modification still correctly executes gathering in one and two dimensions, with the same time bounds as above. Simulations exhibit a severe difference of the behavior of the Go-To-The-Center and the Go-To-The-Gabriel-Center algorithms: Whereas lots of collisions occur during a run of the Go-To-The-Center algorithm, typically only one, namely the final collision occurs during a run of the Go-To-The-Gabriel-Center algorithm. We can prove this “collisionless property” of the Go-To-The-Gabriel-Center algorithm for one dimension. In two-dimensional Euclidean space, we conjecture that the “collisionless property” holds for almost every initial configuration. We support our conjecture with measurements obtained from the simulation where robots execute both continuous Go-To-The-Center and Go-To-The-Gabriel-Center algorithms.\r\n"}],"status":"public","date_updated":"2022-01-06T06:55:35Z","author":[{"last_name":"Li","full_name":"Li, Shouwei","first_name":"Shouwei"},{"first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm","id":"15523","last_name":"Meyer auf der Heide"},{"full_name":"Podlipyan, Pavel","last_name":"Podlipyan","first_name":"Pavel"}],"date_created":"2021-06-28T09:34:45Z","volume":852,"title":"The impact of the Gabriel subgraph of the visibility graph on the gathering of mobile autonomous robots","doi":"10.1016/j.tcs.2020.11.009","publication_status":"published","publication_identifier":{"issn":["0304-3975"]},"year":"2021","citation":{"bibtex":"@article{Li_Meyer auf der Heide_Podlipyan_2021, title={The impact of the Gabriel subgraph of the visibility graph on the gathering of mobile autonomous robots}, volume={852}, DOI={<a href=\"https://doi.org/10.1016/j.tcs.2020.11.009\">10.1016/j.tcs.2020.11.009</a>}, journal={Theoretical Computer Science}, author={Li, Shouwei and Meyer auf der Heide, Friedhelm and Podlipyan, Pavel}, year={2021}, pages={29–40} }","short":"S. Li, F. Meyer auf der Heide, P. Podlipyan, Theoretical Computer Science 852 (2021) 29–40.","mla":"Li, Shouwei, et al. “The Impact of the Gabriel Subgraph of the Visibility Graph on the Gathering of Mobile Autonomous Robots.” <i>Theoretical Computer Science</i>, vol. 852, 2021, pp. 29–40, doi:<a href=\"https://doi.org/10.1016/j.tcs.2020.11.009\">10.1016/j.tcs.2020.11.009</a>.","apa":"Li, S., Meyer auf der Heide, F., &#38; Podlipyan, P. (2021). The impact of the Gabriel subgraph of the visibility graph on the gathering of mobile autonomous robots. <i>Theoretical Computer Science</i>, <i>852</i>, 29–40. <a href=\"https://doi.org/10.1016/j.tcs.2020.11.009\">https://doi.org/10.1016/j.tcs.2020.11.009</a>","chicago":"Li, Shouwei, Friedhelm Meyer auf der Heide, and Pavel Podlipyan. “The Impact of the Gabriel Subgraph of the Visibility Graph on the Gathering of Mobile Autonomous Robots.” <i>Theoretical Computer Science</i> 852 (2021): 29–40. <a href=\"https://doi.org/10.1016/j.tcs.2020.11.009\">https://doi.org/10.1016/j.tcs.2020.11.009</a>.","ieee":"S. Li, F. Meyer auf der Heide, and P. Podlipyan, “The impact of the Gabriel subgraph of the visibility graph on the gathering of mobile autonomous robots,” <i>Theoretical Computer Science</i>, vol. 852, pp. 29–40, 2021.","ama":"Li S, Meyer auf der Heide F, Podlipyan P. The impact of the Gabriel subgraph of the visibility graph on the gathering of mobile autonomous robots. <i>Theoretical Computer Science</i>. 2021;852:29-40. doi:<a href=\"https://doi.org/10.1016/j.tcs.2020.11.009\">10.1016/j.tcs.2020.11.009</a>"},"intvolume":"       852","page":"29-40"},{"publication_identifier":{"issn":["1660-1769"]},"publication_status":"published","citation":{"short":"N. Weidmann, S. Salunkhe, A. Anjorin, E. Yigitbas, G. Engels, The Journal of Object Technology (2021).","mla":"Weidmann, Nils, et al. “Automating Model Transformations for Railway Systems Engineering.” <i>The Journal of Object Technology</i>, 10:1, 2021, doi:<a href=\"https://doi.org/10.5381/jot.2021.20.3.a10\">10.5381/jot.2021.20.3.a10</a>.","bibtex":"@article{Weidmann_Salunkhe_Anjorin_Yigitbas_Engels_2021, title={Automating Model Transformations for Railway Systems Engineering.}, DOI={<a href=\"https://doi.org/10.5381/jot.2021.20.3.a10\">10.5381/jot.2021.20.3.a10</a>}, number={10:1}, journal={The Journal of Object Technology}, author={Weidmann, Nils and Salunkhe, Shubhangi and Anjorin, Anthony and Yigitbas, Enes and Engels, Gregor}, year={2021} }","apa":"Weidmann, N., Salunkhe, S., Anjorin, A., Yigitbas, E., &#38; Engels, G. (2021). Automating Model Transformations for Railway Systems Engineering. <i>The Journal of Object Technology</i>. <a href=\"https://doi.org/10.5381/jot.2021.20.3.a10\">https://doi.org/10.5381/jot.2021.20.3.a10</a>","chicago":"Weidmann, Nils, Shubhangi Salunkhe, Anthony Anjorin, Enes Yigitbas, and Gregor Engels. “Automating Model Transformations for Railway Systems Engineering.” <i>The Journal of Object Technology</i>, 2021. <a href=\"https://doi.org/10.5381/jot.2021.20.3.a10\">https://doi.org/10.5381/jot.2021.20.3.a10</a>.","ieee":"N. Weidmann, S. Salunkhe, A. Anjorin, E. Yigitbas, and G. Engels, “Automating Model Transformations for Railway Systems Engineering.,” <i>The Journal of Object Technology</i>, 2021.","ama":"Weidmann N, Salunkhe S, Anjorin A, Yigitbas E, Engels G. Automating Model Transformations for Railway Systems Engineering. <i>The Journal of Object Technology</i>. 2021. doi:<a href=\"https://doi.org/10.5381/jot.2021.20.3.a10\">10.5381/jot.2021.20.3.a10</a>"},"year":"2021","date_created":"2021-07-26T13:54:55Z","author":[{"first_name":"Nils","id":"53103","full_name":"Weidmann, Nils","last_name":"Weidmann"},{"last_name":"Salunkhe","full_name":"Salunkhe, Shubhangi","first_name":"Shubhangi"},{"first_name":"Anthony","full_name":"Anjorin, Anthony","last_name":"Anjorin"},{"orcid":"0000-0002-5967-833X","last_name":"Yigitbas","id":"8447","full_name":"Yigitbas, Enes","first_name":"Enes"},{"first_name":"Gregor","id":"107","full_name":"Engels, Gregor","last_name":"Engels"}],"date_updated":"2022-01-06T06:55:42Z","doi":"10.5381/jot.2021.20.3.a10","title":"Automating Model Transformations for Railway Systems Engineering.","publication":"The Journal of Object Technology","type":"journal_article","status":"public","department":[{"_id":"66"},{"_id":"534"}],"user_id":"8447","_id":"22814","language":[{"iso":"eng"}],"article_number":"10:1"},{"date_created":"2021-07-27T08:34:48Z","author":[{"id":"8447","full_name":"Yigitbas, Enes","orcid":"0000-0002-5967-833X","last_name":"Yigitbas","first_name":"Enes"},{"last_name":"Karakaya","orcid":"https://orcid.org/0000-0001-9266-2084","id":"70410","full_name":"Karakaya, Kadiray","first_name":"Kadiray"},{"last_name":"Jovanovikj","full_name":"Jovanovikj, Ivan","first_name":"Ivan"},{"last_name":"Engels","full_name":"Engels, Gregor","id":"107","first_name":"Gregor"}],"date_updated":"2022-01-06T06:55:42Z","doi":"10.1109/seams51251.2021.00015","title":"Enhancing Human-in-the-Loop Adaptive Systems through Digital Twins and VR Interfaces","publication_status":"published","citation":{"apa":"Yigitbas, E., Karakaya, K., Jovanovikj, I., &#38; Engels, G. (2021). Enhancing Human-in-the-Loop Adaptive Systems through Digital Twins and VR Interfaces. In <i>2021 International Symposium on Software Engineering for Adaptive and Self-Managing Systems (SEAMS)</i>. <a href=\"https://doi.org/10.1109/seams51251.2021.00015\">https://doi.org/10.1109/seams51251.2021.00015</a>","bibtex":"@inproceedings{Yigitbas_Karakaya_Jovanovikj_Engels_2021, title={Enhancing Human-in-the-Loop Adaptive Systems through Digital Twins and VR Interfaces}, DOI={<a href=\"https://doi.org/10.1109/seams51251.2021.00015\">10.1109/seams51251.2021.00015</a>}, booktitle={2021 International Symposium on Software Engineering for Adaptive and Self-Managing Systems (SEAMS)}, author={Yigitbas, Enes and Karakaya, Kadiray and Jovanovikj, Ivan and Engels, Gregor}, year={2021} }","mla":"Yigitbas, Enes, et al. “Enhancing Human-in-the-Loop Adaptive Systems through Digital Twins and VR Interfaces.” <i>2021 International Symposium on Software Engineering for Adaptive and Self-Managing Systems (SEAMS)</i>, 2021, doi:<a href=\"https://doi.org/10.1109/seams51251.2021.00015\">10.1109/seams51251.2021.00015</a>.","short":"E. Yigitbas, K. Karakaya, I. Jovanovikj, G. Engels, in: 2021 International Symposium on Software Engineering for Adaptive and Self-Managing Systems (SEAMS), 2021.","ama":"Yigitbas E, Karakaya K, Jovanovikj I, Engels G. Enhancing Human-in-the-Loop Adaptive Systems through Digital Twins and VR Interfaces. In: <i>2021 International Symposium on Software Engineering for Adaptive and Self-Managing Systems (SEAMS)</i>. ; 2021. doi:<a href=\"https://doi.org/10.1109/seams51251.2021.00015\">10.1109/seams51251.2021.00015</a>","chicago":"Yigitbas, Enes, Kadiray Karakaya, Ivan Jovanovikj, and Gregor Engels. “Enhancing Human-in-the-Loop Adaptive Systems through Digital Twins and VR Interfaces.” In <i>2021 International Symposium on Software Engineering for Adaptive and Self-Managing Systems (SEAMS)</i>, 2021. <a href=\"https://doi.org/10.1109/seams51251.2021.00015\">https://doi.org/10.1109/seams51251.2021.00015</a>.","ieee":"E. Yigitbas, K. Karakaya, I. Jovanovikj, and G. Engels, “Enhancing Human-in-the-Loop Adaptive Systems through Digital Twins and VR Interfaces,” in <i>2021 International Symposium on Software Engineering for Adaptive and Self-Managing Systems (SEAMS)</i>, 2021."},"year":"2021","user_id":"8447","department":[{"_id":"66"},{"_id":"534"}],"_id":"22819","language":[{"iso":"eng"}],"type":"conference","publication":"2021 International Symposium on Software Engineering for Adaptive and Self-Managing Systems (SEAMS)","status":"public"}]