[{"type":"conference","department":[{"_id":"600"},{"_id":"568"}],"date_created":"2020-02-06T10:41:22Z","publication":"Proceedings of the Thirty-Fourth AAAI Conference on Artificial Intelligence (AAAI 2020)","citation":{"mla":"Al-Khatib, Khalid, et al. “End-to-End Argumentation Knowledge Graph Construction.” <i>Proceedings of the Thirty-Fourth AAAI Conference on Artificial Intelligence (AAAI 2020)</i>, 2020, pp. 7367–74.","ama":"Al-Khatib K, Hou Y, Wachsmuth H, Jochim C, Bonin F, Stein B. End-to-End Argumentation Knowledge Graph Construction. In: <i>Proceedings of the Thirty-Fourth AAAI Conference on Artificial Intelligence (AAAI 2020)</i>. ; 2020:7367-7374.","bibtex":"@inproceedings{Al-Khatib_Hou_Wachsmuth_Jochim_Bonin_Stein_2020, title={End-to-End Argumentation Knowledge Graph Construction}, booktitle={Proceedings of the Thirty-Fourth AAAI Conference on Artificial Intelligence (AAAI 2020)}, author={Al-Khatib, Khalid and Hou, Yufang and Wachsmuth, Henning and Jochim, Charles and Bonin, Francesca and Stein, Benno}, year={2020}, pages={7367–7374} }","apa":"Al-Khatib, K., Hou, Y., Wachsmuth, H., Jochim, C., Bonin, F., &#38; Stein, B. (2020). End-to-End Argumentation Knowledge Graph Construction. In <i>Proceedings of the Thirty-Fourth AAAI Conference on Artificial Intelligence (AAAI 2020)</i> (pp. 7367–7374).","ieee":"K. Al-Khatib, Y. Hou, H. Wachsmuth, C. Jochim, F. Bonin, and B. Stein, “End-to-End Argumentation Knowledge Graph Construction,” in <i>Proceedings of the Thirty-Fourth AAAI Conference on Artificial Intelligence (AAAI 2020)</i>, 2020, pp. 7367–7374.","short":"K. Al-Khatib, Y. Hou, H. Wachsmuth, C. Jochim, F. Bonin, B. Stein, in: Proceedings of the Thirty-Fourth AAAI Conference on Artificial Intelligence (AAAI 2020), 2020, pp. 7367–7374.","chicago":"Al-Khatib, Khalid, Yufang Hou, Henning Wachsmuth, Charles Jochim, Francesca Bonin, and Benno Stein. “End-to-End Argumentation Knowledge Graph Construction.” In <i>Proceedings of the Thirty-Fourth AAAI Conference on Artificial Intelligence (AAAI 2020)</i>, 7367–74, 2020."},"user_id":"82920","page":"7367 - 7374","main_file_link":[{"url":"https://aaai.org/ojs/index.php/AAAI/article/view/6231"}],"_id":"15820","language":[{"iso":"eng"}],"date_updated":"2022-01-06T06:52:37Z","year":"2020","status":"public","title":"End-to-End Argumentation Knowledge Graph Construction","author":[{"full_name":"Al-Khatib, Khalid","first_name":"Khalid","last_name":"Al-Khatib"},{"full_name":"Hou, Yufang","first_name":"Yufang","last_name":"Hou"},{"id":"3900","first_name":"Henning","last_name":"Wachsmuth","full_name":"Wachsmuth, Henning"},{"full_name":"Jochim, Charles","last_name":"Jochim","first_name":"Charles"},{"first_name":"Francesca","last_name":"Bonin","full_name":"Bonin, Francesca"},{"full_name":"Stein, Benno","first_name":"Benno","last_name":"Stein"}]},{"citation":{"mla":"Bondarenko, Alexander, et al. “Touché: First Shared Task on Argument Retrieval.” <i>Proceedings of the 42nd European Conference on Information Retrieval (ECIR 2020)</i>, 2020, pp. 517–23.","bibtex":"@inproceedings{Bondarenko_Hagen_Potthast_Wachsmuth_Beloucif_Biemann_Panchenko_Stein_2020, title={Touché: First Shared Task on Argument Retrieval}, booktitle={Proceedings of the 42nd European Conference on Information Retrieval (ECIR 2020)}, author={Bondarenko, Alexander and Hagen, Matthias and Potthast, Martin and Wachsmuth, Henning and Beloucif, Meriem and Biemann, Chris and Panchenko, Alexander and Stein, Benno}, year={2020}, pages={517–523} }","ama":"Bondarenko A, Hagen M, Potthast M, et al. Touché: First Shared Task on Argument Retrieval. In: <i>Proceedings of the 42nd European Conference on Information Retrieval (ECIR 2020)</i>. ; 2020:517-523.","ieee":"A. Bondarenko <i>et al.</i>, “Touché: First Shared Task on Argument Retrieval,” in <i>Proceedings of the 42nd European Conference on Information Retrieval (ECIR 2020)</i>, 2020, pp. 517–523.","apa":"Bondarenko, A., Hagen, M., Potthast, M., Wachsmuth, H., Beloucif, M., Biemann, C., … Stein, B. (2020). Touché: First Shared Task on Argument Retrieval. In <i>Proceedings of the 42nd European Conference on Information Retrieval (ECIR 2020)</i> (pp. 517–523).","short":"A. Bondarenko, M. Hagen, M. Potthast, H. Wachsmuth, M. Beloucif, C. Biemann, A. Panchenko, B. Stein, in: Proceedings of the 42nd European Conference on Information Retrieval (ECIR 2020), 2020, pp. 517–523.","chicago":"Bondarenko, Alexander, Matthias Hagen, Martin Potthast, Henning Wachsmuth, Meriem Beloucif, Chris Biemann, Alexander Panchenko, and Benno Stein. “Touché: First Shared Task on Argument Retrieval.” In <i>Proceedings of the 42nd European Conference on Information Retrieval (ECIR 2020)</i>, 517–23, 2020."},"publication":"Proceedings of the 42nd European Conference on Information Retrieval (ECIR 2020)","date_created":"2020-02-06T10:42:19Z","department":[{"_id":"600"},{"_id":"568"}],"type":"conference","author":[{"last_name":"Bondarenko","first_name":"Alexander","full_name":"Bondarenko, Alexander"},{"full_name":"Hagen, Matthias","last_name":"Hagen","first_name":"Matthias"},{"full_name":"Potthast, Martin","last_name":"Potthast","first_name":"Martin"},{"id":"3900","full_name":"Wachsmuth, Henning","first_name":"Henning","last_name":"Wachsmuth"},{"full_name":"Beloucif, Meriem","last_name":"Beloucif","first_name":"Meriem"},{"full_name":"Biemann, Chris","last_name":"Biemann","first_name":"Chris"},{"last_name":"Panchenko","first_name":"Alexander","full_name":"Panchenko, Alexander"},{"full_name":"Stein, Benno","first_name":"Benno","last_name":"Stein"}],"title":"Touché: First Shared Task on Argument Retrieval","status":"public","year":"2020","date_updated":"2022-01-06T06:52:37Z","_id":"15821","language":[{"iso":"eng"}],"main_file_link":[{"url":"https://webis.de/downloads/publications/papers/stein_2020c.pdf"}],"page":"517-523","user_id":"82920"},{"citation":{"apa":"Kiesel, J., Lang, K., Wachsmuth, H., Hornecker, E., &#38; Stein, B. (2020). Investigating Expectations for Voice-based and Conversational Argument Search on the Web. In <i>Proceedings of the 2020 ACM SIGIR Conference on Human Information Interaction &#38; Retrieval (CHIIR 2020)</i> (pp. 53–62).","ieee":"J. Kiesel, K. Lang, H. Wachsmuth, E. Hornecker, and B. Stein, “Investigating Expectations for Voice-based and Conversational Argument Search on the Web,” in <i>Proceedings of the 2020 ACM SIGIR Conference on Human Information Interaction &#38; Retrieval (CHIIR 2020)</i>, 2020, pp. 53–62.","short":"J. Kiesel, K. Lang, H. Wachsmuth, E. Hornecker, B. Stein, in: Proceedings of the 2020 ACM SIGIR Conference on Human Information Interaction &#38; Retrieval (CHIIR 2020), 2020, pp. 53–62.","chicago":"Kiesel, Johannes, Kevin Lang, Henning Wachsmuth, Eva Hornecker, and Benno Stein. “Investigating Expectations for Voice-Based and Conversational Argument Search on the Web.” In <i>Proceedings of the 2020 ACM SIGIR Conference on Human Information Interaction &#38; Retrieval (CHIIR 2020)</i>, 53–62, 2020.","mla":"Kiesel, Johannes, et al. “Investigating Expectations for Voice-Based and Conversational Argument Search on the Web.” <i>Proceedings of the 2020 ACM SIGIR Conference on Human Information Interaction &#38; Retrieval (CHIIR 2020)</i>, 2020, pp. 53–62.","ama":"Kiesel J, Lang K, Wachsmuth H, Hornecker E, Stein B. Investigating Expectations for Voice-based and Conversational Argument Search on the Web. In: <i>Proceedings of the 2020 ACM SIGIR Conference on Human Information Interaction &#38; Retrieval (CHIIR 2020)</i>. ; 2020:53-62.","bibtex":"@inproceedings{Kiesel_Lang_Wachsmuth_Hornecker_Stein_2020, title={Investigating Expectations for Voice-based and Conversational Argument Search on the Web}, booktitle={Proceedings of the 2020 ACM SIGIR Conference on Human Information Interaction &#38; Retrieval (CHIIR 2020)}, author={Kiesel, Johannes and Lang, Kevin and Wachsmuth, Henning and Hornecker, Eva and Stein, Benno}, year={2020}, pages={53–62} }"},"publication":"Proceedings of the 2020 ACM SIGIR Conference on Human Information Interaction & Retrieval (CHIIR 2020)","date_created":"2020-02-06T10:49:08Z","department":[{"_id":"600"},{"_id":"568"}],"type":"conference","author":[{"first_name":"Johannes","last_name":"Kiesel","full_name":"Kiesel, Johannes"},{"last_name":"Lang","first_name":"Kevin","full_name":"Lang, Kevin"},{"id":"3900","full_name":"Wachsmuth, Henning","first_name":"Henning","last_name":"Wachsmuth"},{"full_name":"Hornecker, Eva","last_name":"Hornecker","first_name":"Eva"},{"last_name":"Stein","first_name":"Benno","full_name":"Stein, Benno"}],"status":"public","title":"Investigating Expectations for Voice-based and Conversational Argument Search on the Web","year":"2020","date_updated":"2022-01-06T06:52:37Z","_id":"15825","language":[{"iso":"eng"}],"page":"53-62","main_file_link":[{"url":"https://webis.de/downloads/publications/papers/stein_2020b.pdf"}],"user_id":"82920"},{"date_created":"2020-02-06T15:05:45Z","type":"journal_article","department":[{"_id":"78"}],"publication":"ACM Transactions on Cyber-Physical Systems","citation":{"ieee":"K. Bellman <i>et al.</i>, “Self-aware Cyber-Physical Systems,” <i>ACM Transactions on Cyber-Physical Systems</i>, vol. Accepted for Publication, pp. 1–24, 2020.","mla":"Bellman, K., et al. “Self-Aware Cyber-Physical Systems.” <i>ACM Transactions on Cyber-Physical Systems</i>, vol. Accepted for Publication, 2020, pp. 1–24.","apa":"Bellman, K., Dutt, N., Esterle, L., Herkersdorf, A., Jantsch, A., Landauer, C., … Tammemäe, K. (2020). Self-aware Cyber-Physical Systems. <i>ACM Transactions on Cyber-Physical Systems</i>, <i>Accepted for Publication</i>, 1–24.","bibtex":"@article{Bellman_Dutt_Esterle_Herkersdorf_Jantsch_Landauer_R. Lewis_Platzner_TaheriNejad_Tammemäe_2020, title={Self-aware Cyber-Physical Systems}, volume={Accepted for Publication}, journal={ACM Transactions on Cyber-Physical Systems}, author={Bellman, K. and Dutt, N. and Esterle, L. and Herkersdorf, A. and Jantsch, A. and Landauer, C. and R. Lewis, P. and Platzner, Marco and TaheriNejad, N. and Tammemäe, K.}, year={2020}, pages={1–24} }","chicago":"Bellman, K., N. Dutt, L. Esterle, A. Herkersdorf, A. Jantsch, C. Landauer, P. R. Lewis, Marco Platzner, N. TaheriNejad, and K. Tammemäe. “Self-Aware Cyber-Physical Systems.” <i>ACM Transactions on Cyber-Physical Systems</i> Accepted for Publication (2020): 1–24.","ama":"Bellman K, Dutt N, Esterle L, et al. Self-aware Cyber-Physical Systems. <i>ACM Transactions on Cyber-Physical Systems</i>. 2020;Accepted for Publication:1-24.","short":"K. Bellman, N. Dutt, L. Esterle, A. Herkersdorf, A. Jantsch, C. Landauer, P. R. Lewis, M. Platzner, N. TaheriNejad, K. Tammemäe, ACM Transactions on Cyber-Physical Systems Accepted for Publication (2020) 1–24."},"page":"1-24","_id":"15836","language":[{"iso":"eng"}],"user_id":"398","volume":"Accepted for Publication","title":"Self-aware Cyber-Physical Systems","status":"public","year":"2020","author":[{"first_name":"K.","last_name":"Bellman","full_name":"Bellman, K."},{"full_name":"Dutt, N.","last_name":"Dutt","first_name":"N."},{"full_name":"Esterle, L.","first_name":"L.","last_name":"Esterle"},{"first_name":"A.","last_name":"Herkersdorf","full_name":"Herkersdorf, A."},{"full_name":"Jantsch, A.","first_name":"A.","last_name":"Jantsch"},{"first_name":"C.","last_name":"Landauer","full_name":"Landauer, C."},{"last_name":"R. Lewis","first_name":"P.","full_name":"R. Lewis, P."},{"id":"398","full_name":"Platzner, Marco","last_name":"Platzner","first_name":"Marco"},{"full_name":"TaheriNejad, N.","first_name":"N.","last_name":"TaheriNejad"},{"full_name":"Tammemäe, K.","last_name":"Tammemäe","first_name":"K."}],"date_updated":"2022-01-06T06:52:37Z"},{"year":"2020","title":"Multi-Oracle Coevolutionary Learning of Requirements Specifications from Examples in On-The-Fly Markets","author":[{"id":"33176","first_name":"Marcel Dominik","last_name":"Wever","orcid":" https://orcid.org/0000-0001-9782-6818","full_name":"Wever, Marcel Dominik"},{"id":"58843","first_name":"Lorijn","last_name":"van Rooijen","full_name":"van Rooijen, Lorijn"},{"full_name":"Hamann, Heiko","last_name":"Hamann","first_name":"Heiko"}],"date_updated":"2022-01-06T06:52:15Z","publication_status":"published","intvolume":"        28","language":[{"iso":"eng"}],"doi":"10.1162/evco_a_00266","publication":"Evolutionary Computation","issue":"2","related_material":{"link":[{"relation":"confirmation","url":"https://www.mitpressjournals.org/doi/pdf/10.1162/evco_a_00266"}]},"abstract":[{"text":"In software engineering, the imprecise requirements of a user are transformed to a formal requirements specification during the requirements elicitation process. This process is usually guided by requirements engineers interviewing the user. We want to partially automate this first step of the software engineering process in order to enable users to specify a desired software system on their own. With our approach, users are only asked to provide exemplary behavioral descriptions. The problem of synthesizing a requirements specification from examples can partially be reduced to the problem of grammatical inference, to which we apply an active coevolutionary learning approach. However, this approach would usually require many feedback queries to be sent to the user. In this work, we extend and generalize our active learning approach to receive knowledge from multiple oracles, also known as proactive learning. The ‘user oracle’ represents input received from the user and the ‘knowledge oracle’ represents available, formalized domain knowledge. We call our two-oracle approach the ‘first apply knowledge then query’ (FAKT/Q) algorithm. We compare FAKT/Q to the active learning approach and provide an extensive benchmark evaluation. As result we find that the number of required user queries is reduced and the inference process is sped up significantly. Finally, with so-called On-The-Fly Markets, we present a motivation and an application of our approach where such knowledge is available.","lang":"eng"}],"date_created":"2019-11-18T14:19:19Z","type":"journal_article","department":[{"_id":"34"},{"_id":"355"},{"_id":"26"},{"_id":"63"},{"_id":"238"}],"status":"public","page":"165–193","publisher":"MIT Press Journals","_id":"15025","user_id":"15415","volume":28,"citation":{"apa":"Wever, M. D., van Rooijen, L., &#38; Hamann, H. (2020). Multi-Oracle Coevolutionary Learning of Requirements Specifications from Examples in On-The-Fly Markets. <i>Evolutionary Computation</i>, <i>28</i>(2), 165–193. <a href=\"https://doi.org/10.1162/evco_a_00266\">https://doi.org/10.1162/evco_a_00266</a>","ieee":"M. D. Wever, L. van Rooijen, and H. Hamann, “Multi-Oracle Coevolutionary Learning of Requirements Specifications from Examples in On-The-Fly Markets,” <i>Evolutionary Computation</i>, vol. 28, no. 2, pp. 165–193, 2020, doi: <a href=\"https://doi.org/10.1162/evco_a_00266\">10.1162/evco_a_00266</a>.","chicago":"Wever, Marcel Dominik, Lorijn van Rooijen, and Heiko Hamann. “Multi-Oracle Coevolutionary Learning of Requirements Specifications from Examples in On-The-Fly Markets.” <i>Evolutionary Computation</i> 28, no. 2 (2020): 165–193. <a href=\"https://doi.org/10.1162/evco_a_00266\">https://doi.org/10.1162/evco_a_00266</a>.","short":"M.D. Wever, L. van Rooijen, H. Hamann, Evolutionary Computation 28 (2020) 165–193.","mla":"Wever, Marcel Dominik, et al. “Multi-Oracle Coevolutionary Learning of Requirements Specifications from Examples in On-The-Fly Markets.” <i>Evolutionary Computation</i>, vol. 28, no. 2, MIT Press Journals, 2020, pp. 165–193, doi:<a href=\"https://doi.org/10.1162/evco_a_00266\">10.1162/evco_a_00266</a>.","ama":"Wever MD, van Rooijen L, Hamann H. Multi-Oracle Coevolutionary Learning of Requirements Specifications from Examples in On-The-Fly Markets. <i>Evolutionary Computation</i>. 2020;28(2):165–193. doi:<a href=\"https://doi.org/10.1162/evco_a_00266\">10.1162/evco_a_00266</a>","bibtex":"@article{Wever_van Rooijen_Hamann_2020, title={Multi-Oracle Coevolutionary Learning of Requirements Specifications from Examples in On-The-Fly Markets}, volume={28}, DOI={<a href=\"https://doi.org/10.1162/evco_a_00266\">10.1162/evco_a_00266</a>}, number={2}, journal={Evolutionary Computation}, publisher={MIT Press Journals}, author={Wever, Marcel Dominik and van Rooijen, Lorijn and Hamann, Heiko}, year={2020}, pages={165–193} }"},"project":[{"_id":"1","name":"SFB 901"},{"_id":"3","name":"SFB 901 - Project Area B"},{"name":"SFB 901 - Subproject B1","_id":"9"},{"name":"SFB 901 - Subproject B2","_id":"10"},{"_id":"52","name":"Computing Resources Provided by the Paderborn Center for Parallel Computing"}]},{"date_created":"2019-11-25T12:18:41Z","type":"conference","department":[{"_id":"63"},{"_id":"79"}],"publication":"Proceedings of the 21st International Conference on Distributed Computing and Networking (ICDCN)","citation":{"bibtex":"@inproceedings{Castenow_Kolb_Scheideler, title={A Bounding Box Overlay for Competitive Routing in Hybrid Communication Networks}, booktitle={Proceedings of the 21st International Conference on Distributed Computing and Networking (ICDCN)}, publisher={ACM}, author={Castenow, Jannik and Kolb, Christina and Scheideler, Christian} }","ama":"Castenow J, Kolb C, Scheideler C. A Bounding Box Overlay for Competitive Routing in Hybrid Communication Networks. In: <i>Proceedings of the 21st International Conference on Distributed Computing and Networking (ICDCN)</i>. ACM.","mla":"Castenow, Jannik, et al. “A Bounding Box Overlay for Competitive Routing in Hybrid Communication Networks.” <i>Proceedings of the 21st International Conference on Distributed Computing and Networking (ICDCN)</i>, ACM.","chicago":"Castenow, Jannik, Christina Kolb, and Christian Scheideler. “A Bounding Box Overlay for Competitive Routing in Hybrid Communication Networks.” In <i>Proceedings of the 21st International Conference on Distributed Computing and Networking (ICDCN)</i>. ACM, n.d.","short":"J. Castenow, C. Kolb, C. Scheideler, in: Proceedings of the 21st International Conference on Distributed Computing and Networking (ICDCN), ACM, n.d.","ieee":"J. Castenow, C. Kolb, and C. Scheideler, “A Bounding Box Overlay for Competitive Routing in Hybrid Communication Networks,” in <i>Proceedings of the 21st International Conference on Distributed Computing and Networking (ICDCN)</i>, Kolkata, Indien.","apa":"Castenow, J., Kolb, C., &#38; Scheideler, C. (n.d.). A Bounding Box Overlay for Competitive Routing in Hybrid Communication Networks. In <i>Proceedings of the 21st International Conference on Distributed Computing and Networking (ICDCN)</i>. Kolkata, Indien: ACM."},"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area A","_id":"2"},{"_id":"5","name":"SFB 901 - Subproject A1"}],"_id":"15169","publisher":"ACM","language":[{"iso":"eng"}],"user_id":"477","year":"2020","title":"A Bounding Box Overlay for Competitive Routing in Hybrid Communication Networks","status":"public","author":[{"id":"38705","first_name":"Jannik","last_name":"Castenow","full_name":"Castenow, Jannik"},{"id":"43647","full_name":"Kolb, Christina","last_name":"Kolb","first_name":"Christina"},{"full_name":"Scheideler, Christian","first_name":"Christian","last_name":"Scheideler","id":"20792"}],"conference":{"end_date":"07.01.2020","location":"Kolkata, Indien","start_date":"04.01.2020","name":"21st International Conference on Distributed Computing and Networking "},"publication_status":"accepted","date_updated":"2022-01-06T06:52:16Z"},{"author":[{"id":"8447","full_name":"Yigitbas, Enes","last_name":"Yigitbas","first_name":"Enes","orcid":"0000-0002-5967-833X"},{"id":"39187","full_name":"Jovanovikj, Ivan","first_name":"Ivan","last_name":"Jovanovikj","orcid":"https://orcid.org/0000-0002-1838-794X"},{"id":"447","full_name":"Sauer, Stefan","first_name":"Stefan","last_name":"Sauer"},{"id":"107","first_name":"Gregor","last_name":"Engels","full_name":"Engels, Gregor"}],"year":"2020","title":"On the Development of Context-aware Augmented Reality Applications ","status":"public","date_updated":"2022-01-06T06:52:20Z","_id":"15267","language":[{"iso":"eng"}],"publisher":"Springer, LNCS","user_id":"8447","citation":{"apa":"Yigitbas, E., Jovanovikj, I., Sauer, S., &#38; Engels, G. (2020). On the Development of Context-aware Augmented Reality Applications . In <i>Handling Security, Usability, User Experience and Reliability in User-Centered Development Processes - IFIP WG 13.2/13.5</i>. Springer, LNCS.","mla":"Yigitbas, Enes, et al. “On the Development of Context-Aware Augmented Reality Applications .” <i>Handling Security, Usability, User Experience and Reliability in User-Centered Development Processes - IFIP WG 13.2/13.5</i>, Springer, LNCS, 2020.","ieee":"E. Yigitbas, I. Jovanovikj, S. Sauer, and G. Engels, “On the Development of Context-aware Augmented Reality Applications ,” in <i>Handling Security, Usability, User Experience and Reliability in User-Centered Development Processes - IFIP WG 13.2/13.5</i>, Springer, LNCS, 2020.","chicago":"Yigitbas, Enes, Ivan Jovanovikj, Stefan Sauer, and Gregor Engels. “On the Development of Context-Aware Augmented Reality Applications .” In <i>Handling Security, Usability, User Experience and Reliability in User-Centered Development Processes - IFIP WG 13.2/13.5</i>. Springer, LNCS, 2020.","ama":"Yigitbas E, Jovanovikj I, Sauer S, Engels G. On the Development of Context-aware Augmented Reality Applications . In: <i>Handling Security, Usability, User Experience and Reliability in User-Centered Development Processes - IFIP WG 13.2/13.5</i>. Springer, LNCS; 2020.","short":"E. Yigitbas, I. Jovanovikj, S. Sauer, G. Engels, in: Handling Security, Usability, User Experience and Reliability in User-Centered Development Processes - IFIP WG 13.2/13.5, Springer, LNCS, 2020.","bibtex":"@inbook{Yigitbas_Jovanovikj_Sauer_Engels_2020, title={On the Development of Context-aware Augmented Reality Applications }, booktitle={Handling Security, Usability, User Experience and Reliability in User-Centered Development Processes - IFIP WG 13.2/13.5}, publisher={Springer, LNCS}, author={Yigitbas, Enes and Jovanovikj, Ivan and Sauer, Stefan and Engels, Gregor}, year={2020} }"},"publication":"Handling Security, Usability, User Experience and Reliability in User-Centered Development Processes - IFIP WG 13.2/13.5","date_created":"2019-12-10T12:10:04Z","department":[{"_id":"66"},{"_id":"534"}],"type":"book_chapter"},{"date_updated":"2022-01-06T06:52:45Z","publication_status":"published","title":"A Hybrid Synthesis Methodology for Approximate Circuits","status":"public","year":"2020","conference":{"location":"Beijing, China","name":"ACM Great Lakes Symposium on VLSI (GLSVLSI) 2020"},"author":[{"first_name":"Muhammad","orcid":"https://orcid.org/0000-0003-4148-2969","last_name":"Awais","full_name":"Awais, Muhammad","id":"64665"},{"id":"61186","last_name":"Ghasemzadeh Mohammadi","first_name":"Hassan","full_name":"Ghasemzadeh Mohammadi, Hassan"},{"full_name":"Platzner, Marco","first_name":"Marco","last_name":"Platzner","id":"398"}],"doi":"10.1145/3386263.3406952","user_id":"64665","page":"421-426","_id":"16213","publisher":"ACM","language":[{"iso":"eng"}],"abstract":[{"text":"Automated synthesis of approximate circuits via functional approximations is of prominent importance to provide efficiency in energy, runtime, and chip area required to execute an application. Approximate circuits are usually obtained either through analytical approximation methods leveraging approximate transformations such as bit-width scaling or via iterative search-based optimization methods when a library of approximate components, e.g., approximate adders and multipliers, is available. For the latter, exploring the extremely large design space is challenging in terms of both computations and quality of results. While the combination of both methods can create more room for further approximations, the \\textit{Design Space Exploration}~(DSE) becomes a crucial issue. In this paper, we present such a hybrid synthesis methodology that applies a low-cost analytical method followed by parallel stochastic search-based optimization. We address the DSE challenge through efficient pruning of the design space and skipping unnecessary expensive testing and/or verification steps. The experimental results reveal up to 10.57x area savings in comparison with both purely analytical or search-based approaches. ","lang":"eng"}],"publication":"Proceedings of the 30th ACM Great Lakes Symposium on VLSI (GLSVLSI) 2020","citation":{"ama":"Awais M, Ghasemzadeh Mohammadi H, Platzner M. A Hybrid Synthesis Methodology for Approximate Circuits. In: <i>Proceedings of the 30th ACM Great Lakes Symposium on VLSI (GLSVLSI) 2020</i>. ACM; 2020:421-426. doi:<a href=\"https://doi.org/10.1145/3386263.3406952\">10.1145/3386263.3406952</a>","bibtex":"@inproceedings{Awais_Ghasemzadeh Mohammadi_Platzner_2020, title={A Hybrid Synthesis Methodology for Approximate Circuits}, DOI={<a href=\"https://doi.org/10.1145/3386263.3406952\">10.1145/3386263.3406952</a>}, booktitle={Proceedings of the 30th ACM Great Lakes Symposium on VLSI (GLSVLSI) 2020}, publisher={ACM}, author={Awais, Muhammad and Ghasemzadeh Mohammadi, Hassan and Platzner, Marco}, year={2020}, pages={421–426} }","mla":"Awais, Muhammad, et al. “A Hybrid Synthesis Methodology for Approximate Circuits.” <i>Proceedings of the 30th ACM Great Lakes Symposium on VLSI (GLSVLSI) 2020</i>, ACM, 2020, pp. 421–26, doi:<a href=\"https://doi.org/10.1145/3386263.3406952\">10.1145/3386263.3406952</a>.","short":"M. Awais, H. Ghasemzadeh Mohammadi, M. Platzner, in: Proceedings of the 30th ACM Great Lakes Symposium on VLSI (GLSVLSI) 2020, ACM, 2020, pp. 421–426.","chicago":"Awais, Muhammad, Hassan Ghasemzadeh Mohammadi, and Marco Platzner. “A Hybrid Synthesis Methodology for Approximate Circuits.” In <i>Proceedings of the 30th ACM Great Lakes Symposium on VLSI (GLSVLSI) 2020</i>, 421–26. ACM, 2020. <a href=\"https://doi.org/10.1145/3386263.3406952\">https://doi.org/10.1145/3386263.3406952</a>.","apa":"Awais, M., Ghasemzadeh Mohammadi, H., &#38; Platzner, M. (2020). A Hybrid Synthesis Methodology for Approximate Circuits. In <i>Proceedings of the 30th ACM Great Lakes Symposium on VLSI (GLSVLSI) 2020</i> (pp. 421–426). Beijing, China: ACM. <a href=\"https://doi.org/10.1145/3386263.3406952\">https://doi.org/10.1145/3386263.3406952</a>","ieee":"M. Awais, H. Ghasemzadeh Mohammadi, and M. Platzner, “A Hybrid Synthesis Methodology for Approximate Circuits,” in <i>Proceedings of the 30th ACM Great Lakes Symposium on VLSI (GLSVLSI) 2020</i>, Beijing, China, 2020, pp. 421–426."},"type":"conference","department":[{"_id":"78"}],"date_created":"2020-03-02T15:49:38Z"},{"_id":"16219","publisher":"IEEE","ddc":["000"],"user_id":"35343","conference":{"name":"IEEE Conference on Network Softwarization (NetSoft)","location":"Ghent, Belgium"},"status":"public","has_accepted_license":"1","oa":"1","citation":{"apa":"Schneider, S. B., Satheeschandran, N. P., Peuster, M., &#38; Karl, H. (2020). Machine Learning for Dynamic Resource Allocation in Network Function Virtualization. In <i>IEEE Conference on Network Softwarization (NetSoft)</i>. Ghent, Belgium: IEEE.","ieee":"S. B. Schneider, N. P. Satheeschandran, M. Peuster, and H. Karl, “Machine Learning for Dynamic Resource Allocation in Network Function Virtualization,” in <i>IEEE Conference on Network Softwarization (NetSoft)</i>, Ghent, Belgium, 2020.","chicago":"Schneider, Stefan Balthasar, Narayanan Puthenpurayil Satheeschandran, Manuel Peuster, and Holger Karl. “Machine Learning for Dynamic Resource Allocation in Network Function Virtualization.” In <i>IEEE Conference on Network Softwarization (NetSoft)</i>. IEEE, 2020.","short":"S.B. Schneider, N.P. Satheeschandran, M. Peuster, H. Karl, in: IEEE Conference on Network Softwarization (NetSoft), IEEE, 2020.","mla":"Schneider, Stefan Balthasar, et al. “Machine Learning for Dynamic Resource Allocation in Network Function Virtualization.” <i>IEEE Conference on Network Softwarization (NetSoft)</i>, IEEE, 2020.","ama":"Schneider SB, Satheeschandran NP, Peuster M, Karl H. Machine Learning for Dynamic Resource Allocation in Network Function Virtualization. In: <i>IEEE Conference on Network Softwarization (NetSoft)</i>. IEEE; 2020.","bibtex":"@inproceedings{Schneider_Satheeschandran_Peuster_Karl_2020, title={Machine Learning for Dynamic Resource Allocation in Network Function Virtualization}, booktitle={IEEE Conference on Network Softwarization (NetSoft)}, publisher={IEEE}, author={Schneider, Stefan Balthasar and Satheeschandran, Narayanan Puthenpurayil and Peuster, Manuel and Karl, Holger}, year={2020} }"},"file_date_updated":"2020-03-03T11:42:16Z","project":[{"_id":"28","grant_number":"761493","name":"5G Development and validation platform for global industry-specific network services and Apps"},{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area C","_id":"4"},{"name":"SFB 901 - Subproject C4","_id":"16"}],"language":[{"iso":"eng"}],"author":[{"orcid":"0000-0001-8210-4011","first_name":"Stefan Balthasar","last_name":"Schneider","full_name":"Schneider, Stefan Balthasar","id":"35343"},{"first_name":"Narayanan Puthenpurayil","last_name":"Satheeschandran","full_name":"Satheeschandran, Narayanan Puthenpurayil"},{"first_name":"Manuel","last_name":"Peuster","full_name":"Peuster, Manuel","id":"13271"},{"id":"126","full_name":"Karl, Holger","last_name":"Karl","first_name":"Holger"}],"year":"2020","title":"Machine Learning for Dynamic Resource Allocation in Network Function Virtualization","date_updated":"2022-01-06T06:52:46Z","date_created":"2020-03-03T11:42:22Z","file":[{"creator":"stschn","date_created":"2020-03-03T11:42:16Z","access_level":"open_access","file_size":476590,"file_name":"ris_preprint.pdf","date_updated":"2020-03-03T11:42:16Z","relation":"main_file","content_type":"application/pdf","file_id":"16220"}],"department":[{"_id":"75"}],"type":"conference","publication":"IEEE Conference on Network Softwarization (NetSoft)","abstract":[{"text":"Network function virtualization (NFV) proposes\r\nto replace physical middleboxes with more flexible virtual\r\nnetwork functions (VNFs). To dynamically adjust to everchanging\r\ntraffic demands, VNFs have to be instantiated and\r\ntheir allocated resources have to be adjusted on demand.\r\nDeciding the amount of allocated resources is non-trivial.\r\nExisting optimization approaches often assume fixed resource\r\nrequirements for each VNF instance. However, this can easily\r\nlead to either waste of resources or bad service quality if too\r\nmany or too few resources are allocated.\r\n\r\nTo solve this problem, we train machine learning models\r\non real VNF data, containing measurements of performance\r\nand resource requirements. For each VNF, the trained models\r\ncan then accurately predict the required resources to handle\r\na certain traffic load. We integrate these machine learning\r\nmodels into an algorithm for joint VNF scaling and placement\r\nand evaluate their impact on resulting VNF placements. Our\r\nevaluation based on real-world data shows that using suitable\r\nmachine learning models effectively avoids over- and underallocation\r\nof resources, leading to up to 12 times lower resource\r\nconsumption and better service quality with up to 4.5 times\r\nlower total delay than using standard fixed resource allocation.","lang":"eng"}]},{"language":[{"iso":"eng"}],"_id":"16222","user_id":"35343","title":"Benchmarking and Profiling 5G Verticals' Applications: An Industrial IoT Use Case","year":"2020","status":"public","author":[{"full_name":"Zafeiropoulos, A.","first_name":"A.","last_name":"Zafeiropoulos"},{"first_name":"E.","last_name":"Fotopoulou","full_name":"Fotopoulou, E."},{"id":"13271","full_name":"Peuster, Manuel","last_name":"Peuster","first_name":"Manuel"},{"id":"35343","full_name":"Schneider, Stefan Balthasar","first_name":"Stefan Balthasar","last_name":"Schneider","orcid":"0000-0001-8210-4011"},{"last_name":"Gouvas","first_name":"P.","full_name":"Gouvas, P."},{"last_name":"Behnke","first_name":"D.","full_name":"Behnke, D."},{"first_name":"M.","last_name":"Müller","full_name":"Müller, M."},{"last_name":"Bök","first_name":"P.","full_name":"Bök, P."},{"first_name":"P.","last_name":"Trakadas","full_name":"Trakadas, P."},{"full_name":"Karkazis, P.","last_name":"Karkazis","first_name":"P."},{"full_name":"Karl, Holger","last_name":"Karl","first_name":"Holger","id":"126"}],"date_updated":"2022-01-06T06:52:46Z","date_created":"2020-03-03T11:51:22Z","type":"conference","department":[{"_id":"75"}],"publication":"IEEE Conference on Network Softwarization (NetSoft)","citation":{"bibtex":"@inproceedings{Zafeiropoulos_Fotopoulou_Peuster_Schneider_Gouvas_Behnke_Müller_Bök_Trakadas_Karkazis_et al._2020, title={Benchmarking and Profiling 5G Verticals’ Applications: An Industrial IoT Use Case}, booktitle={IEEE Conference on Network Softwarization (NetSoft)}, author={Zafeiropoulos, A. and Fotopoulou, E. and Peuster, Manuel and Schneider, Stefan Balthasar and Gouvas, P. and Behnke, D. and Müller, M. and Bök, P. and Trakadas, P. and Karkazis, P. and et al.}, year={2020} }","chicago":"Zafeiropoulos, A., E. Fotopoulou, Manuel Peuster, Stefan Balthasar Schneider, P. Gouvas, D. Behnke, M. Müller, et al. “Benchmarking and Profiling 5G Verticals’ Applications: An Industrial IoT Use Case.” In <i>IEEE Conference on Network Softwarization (NetSoft)</i>, 2020.","ama":"Zafeiropoulos A, Fotopoulou E, Peuster M, et al. Benchmarking and Profiling 5G Verticals’ Applications: An Industrial IoT Use Case. In: <i>IEEE Conference on Network Softwarization (NetSoft)</i>. ; 2020.","short":"A. Zafeiropoulos, E. Fotopoulou, M. Peuster, S.B. Schneider, P. Gouvas, D. Behnke, M. Müller, P. Bök, P. Trakadas, P. Karkazis, H. Karl, in: IEEE Conference on Network Softwarization (NetSoft), 2020.","ieee":"A. Zafeiropoulos <i>et al.</i>, “Benchmarking and Profiling 5G Verticals’ Applications: An Industrial IoT Use Case,” in <i>IEEE Conference on Network Softwarization (NetSoft)</i>, 2020.","apa":"Zafeiropoulos, A., Fotopoulou, E., Peuster, M., Schneider, S. B., Gouvas, P., Behnke, D., … Karl, H. (2020). Benchmarking and Profiling 5G Verticals’ Applications: An Industrial IoT Use Case. In <i>IEEE Conference on Network Softwarization (NetSoft)</i>.","mla":"Zafeiropoulos, A., et al. “Benchmarking and Profiling 5G Verticals’ Applications: An Industrial IoT Use Case.” <i>IEEE Conference on Network Softwarization (NetSoft)</i>, 2020."},"project":[{"_id":"28","grant_number":"761493","name":"5G Development and validation platform for global industry-specific network services and Apps"}]},{"department":[{"_id":"66"},{"_id":"534"}],"type":"conference","date_created":"2020-03-09T13:11:25Z","citation":{"short":"I. Jovanovikj, A. Nagaraj, E. Yigitbas, A. Anjorin, S. Sauer, G. Engels, in: Proceedings of the 1st IEEE/ACM International Conference on Automation of Software Test AST, ACM, 2020, pp. 31–40.","chicago":"Jovanovikj, Ivan, Achyuth Nagaraj, Enes Yigitbas, Anthony Anjorin, Stefan Sauer, and Gregor Engels. “Validating Test Case Migration via Mutation Analysis .” In <i>Proceedings of the 1st IEEE/ACM International Conference on Automation of Software Test AST</i>, 31–40. ACM, 2020.","apa":"Jovanovikj, I., Nagaraj, A., Yigitbas, E., Anjorin, A., Sauer, S., &#38; Engels, G. (2020). Validating Test Case Migration via Mutation Analysis . In <i>Proceedings of the 1st IEEE/ACM International Conference on Automation of Software Test AST</i> (pp. 31–40). Seoul: ACM.","ieee":"I. Jovanovikj, A. Nagaraj, E. Yigitbas, A. Anjorin, S. Sauer, and G. Engels, “Validating Test Case Migration via Mutation Analysis ,” in <i>Proceedings of the 1st IEEE/ACM International Conference on Automation of Software Test AST</i>, Seoul, 2020, pp. 31–40.","ama":"Jovanovikj I, Nagaraj A, Yigitbas E, Anjorin A, Sauer S, Engels G. Validating Test Case Migration via Mutation Analysis . In: <i>Proceedings of the 1st IEEE/ACM International Conference on Automation of Software Test AST</i>. ACM; 2020:31-40.","bibtex":"@inproceedings{Jovanovikj_Nagaraj_Yigitbas_Anjorin_Sauer_Engels_2020, title={Validating Test Case Migration via Mutation Analysis }, booktitle={Proceedings of the 1st IEEE/ACM International Conference on Automation of Software Test AST}, publisher={ACM}, author={Jovanovikj, Ivan and Nagaraj, Achyuth and Yigitbas, Enes and Anjorin, Anthony and Sauer, Stefan and Engels, Gregor}, year={2020}, pages={31–40} }","mla":"Jovanovikj, Ivan, et al. “Validating Test Case Migration via Mutation Analysis .” <i>Proceedings of the 1st IEEE/ACM International Conference on Automation of Software Test AST</i>, ACM, 2020, pp. 31–40."},"publication":"Proceedings of the 1st IEEE/ACM International Conference on Automation of Software Test AST","user_id":"8447","publisher":"ACM","_id":"16274","language":[{"iso":"eng"}],"page":"31-40","date_updated":"2022-01-06T06:52:47Z","author":[{"id":"39187","last_name":"Jovanovikj","first_name":"Ivan","orcid":"https://orcid.org/0000-0002-1838-794X","full_name":"Jovanovikj, Ivan"},{"full_name":"Nagaraj, Achyuth","first_name":"Achyuth","last_name":"Nagaraj"},{"id":"8447","first_name":"Enes","last_name":"Yigitbas","orcid":"0000-0002-5967-833X","full_name":"Yigitbas, Enes"},{"full_name":"Anjorin, Anthony","first_name":"Anthony","last_name":"Anjorin"},{"last_name":"Sauer","first_name":"Stefan","full_name":"Sauer, Stefan","id":"447"},{"full_name":"Engels, Gregor","last_name":"Engels","first_name":"Gregor","id":"107"}],"conference":{"name":"1st IEEE/ACM International Conference on Automation of Software Test (AST 2020)","location":"Seoul"},"year":"2020","status":"public","title":"Validating Test Case Migration via Mutation Analysis "},{"publication":"Vehicular Communications","citation":{"ieee":"N. Nomikos <i>et al.</i>, “A UAV-based moving 5G RAN for massive connectivity of mobile users and IoT devices,” <i>Vehicular Communications</i>, 2020.","apa":"Nomikos, N., Michailidis, E. T., Trakadas, P., Vouyioukas, D., Karl, H., Martrat, J., … Voliotis, S. (2020). A UAV-based moving 5G RAN for massive connectivity of mobile users and IoT devices. <i>Vehicular Communications</i>. <a href=\"https://doi.org/10.1016/j.vehcom.2020.100250\">https://doi.org/10.1016/j.vehcom.2020.100250</a>","chicago":"Nomikos, Nikolaos, Emmanouel T. Michailidis, Panagiotis Trakadas, Demosthenes Vouyioukas, Holger Karl, Josep Martrat, Theodore Zahariadis, Konstantinos Papadopoulos, and Stamatis Voliotis. “A UAV-Based Moving 5G RAN for Massive Connectivity of Mobile Users and IoT Devices.” <i>Vehicular Communications</i>, 2020. <a href=\"https://doi.org/10.1016/j.vehcom.2020.100250\">https://doi.org/10.1016/j.vehcom.2020.100250</a>.","short":"N. Nomikos, E.T. Michailidis, P. Trakadas, D. Vouyioukas, H. Karl, J. Martrat, T. Zahariadis, K. Papadopoulos, S. Voliotis, Vehicular Communications (2020).","mla":"Nomikos, Nikolaos, et al. “A UAV-Based Moving 5G RAN for Massive Connectivity of Mobile Users and IoT Devices.” <i>Vehicular Communications</i>, 100250, 2020, doi:<a href=\"https://doi.org/10.1016/j.vehcom.2020.100250\">10.1016/j.vehcom.2020.100250</a>.","bibtex":"@article{Nomikos_Michailidis_Trakadas_Vouyioukas_Karl_Martrat_Zahariadis_Papadopoulos_Voliotis_2020, title={A UAV-based moving 5G RAN for massive connectivity of mobile users and IoT devices}, DOI={<a href=\"https://doi.org/10.1016/j.vehcom.2020.100250\">10.1016/j.vehcom.2020.100250</a>}, number={100250}, journal={Vehicular Communications}, author={Nomikos, Nikolaos and Michailidis, Emmanouel T. and Trakadas, Panagiotis and Vouyioukas, Demosthenes and Karl, Holger and Martrat, Josep and Zahariadis, Theodore and Papadopoulos, Konstantinos and Voliotis, Stamatis}, year={2020} }","ama":"Nomikos N, Michailidis ET, Trakadas P, et al. A UAV-based moving 5G RAN for massive connectivity of mobile users and IoT devices. <i>Vehicular Communications</i>. 2020. doi:<a href=\"https://doi.org/10.1016/j.vehcom.2020.100250\">10.1016/j.vehcom.2020.100250</a>"},"abstract":[{"lang":"eng","text":"Currently, the coexistence of multiple users and devices challenges the network's ability to reliably connect them. This article proposes a novel communication architecture that satisfies the requirements of fifth-generation (5G) mobile network applications. In particular, this architecture extends and combines ultra-dense networking (UDN), multi-access edge computing (MEC), and virtual infrastructure manager (VIM) concepts to provide a flexible network of moving radio access (RA) nodes, flying or moving to areas where users and devices struggle for connectivity and data rate. Furthermore, advances in radio communications and non-orthogonal multiple access (NOMA), virtualization technologies and energy-awareness mechanisms are integrated towards a mobile UDN that not only allows RA nodes to follow the user but also enables the virtualized network functions (VNFs) to adapt to user mobility by migrating from one node to another. Performance evaluation shows that the underlying network improves connectivity of users and devices through the flexible deployment of moving RA nodes and the use of NOMA."}],"date_created":"2020-03-10T15:59:56Z","type":"journal_article","department":[{"_id":"75"}],"status":"public","title":"A UAV-based moving 5G RAN for massive connectivity of mobile users and IoT devices","year":"2020","publication_identifier":{"issn":["2214-2096"]},"author":[{"first_name":"Nikolaos","last_name":"Nomikos","full_name":"Nomikos, Nikolaos"},{"full_name":"Michailidis, Emmanouel T.","last_name":"Michailidis","first_name":"Emmanouel T."},{"last_name":"Trakadas","first_name":"Panagiotis","full_name":"Trakadas, Panagiotis"},{"first_name":"Demosthenes","last_name":"Vouyioukas","full_name":"Vouyioukas, Demosthenes"},{"id":"126","last_name":"Karl","first_name":"Holger","full_name":"Karl, Holger"},{"last_name":"Martrat","first_name":"Josep","full_name":"Martrat, Josep"},{"full_name":"Zahariadis, Theodore","first_name":"Theodore","last_name":"Zahariadis"},{"first_name":"Konstantinos","last_name":"Papadopoulos","full_name":"Papadopoulos, Konstantinos"},{"full_name":"Voliotis, Stamatis","last_name":"Voliotis","first_name":"Stamatis"}],"publication_status":"published","date_updated":"2022-01-06T06:52:48Z","article_number":"100250","_id":"16278","language":[{"iso":"eng"}],"user_id":"126","doi":"10.1016/j.vehcom.2020.100250"},{"user_id":"126","doi":"10.1109/mwc.001.1900280","page":"24-30","language":[{"iso":"eng"}],"_id":"16280","publication_status":"published","date_updated":"2022-01-06T06:52:48Z","year":"2020","status":"public","title":"Multi-Armed-Bandit-Based Spectrum Scheduling Algorithms in Wireless Networks: A Survey","publication_identifier":{"issn":["1536-1284","1558-0687"]},"author":[{"last_name":"Li","first_name":"Feng","full_name":"Li, Feng"},{"first_name":"Dongxiao","last_name":"Yu","full_name":"Yu, Dongxiao"},{"last_name":"Yang","first_name":"Huan","full_name":"Yang, Huan"},{"full_name":"Yu, Jiguo","first_name":"Jiguo","last_name":"Yu"},{"first_name":"Holger","last_name":"Karl","full_name":"Karl, Holger","id":"126"},{"first_name":"Xiuzhen","last_name":"Cheng","full_name":"Cheng, Xiuzhen"}],"type":"journal_article","department":[{"_id":"75"}],"date_created":"2020-03-10T16:02:30Z","abstract":[{"lang":"eng","text":"Assigning bands of the wireless spectrum as resources to users is a common problem in wireless networks. Typically, frequency bands were assumed to be available in a stable manner. Nevertheless, in recent scenarios where wireless networks may be deployed in unknown environments, spectrum competition is considered, making it uncertain whether a frequency band is available at all or at what quality. To fully exploit such resources with uncertain availability, the multi-armed bandit (MAB) method, a representative online learning technique, has been applied to design spectrum scheduling algorithms. This article surveys such proposals. We describe the following three aspects: how to model spectrum scheduling problems within the MAB framework, what the main thread is following which prevalent algorithms are designed, and how to evaluate algorithm performance and complexity. We also give some promising directions for future research in related fields."}],"publication":"IEEE Wireless Communications","citation":{"bibtex":"@article{Li_Yu_Yang_Yu_Karl_Cheng_2020, title={Multi-Armed-Bandit-Based Spectrum Scheduling Algorithms in Wireless Networks: A Survey}, DOI={<a href=\"https://doi.org/10.1109/mwc.001.1900280\">10.1109/mwc.001.1900280</a>}, journal={IEEE Wireless Communications}, author={Li, Feng and Yu, Dongxiao and Yang, Huan and Yu, Jiguo and Karl, Holger and Cheng, Xiuzhen}, year={2020}, pages={24–30} }","ama":"Li F, Yu D, Yang H, Yu J, Karl H, Cheng X. Multi-Armed-Bandit-Based Spectrum Scheduling Algorithms in Wireless Networks: A Survey. <i>IEEE Wireless Communications</i>. 2020:24-30. doi:<a href=\"https://doi.org/10.1109/mwc.001.1900280\">10.1109/mwc.001.1900280</a>","short":"F. Li, D. Yu, H. Yang, J. Yu, H. Karl, X. Cheng, IEEE Wireless Communications (2020) 24–30.","chicago":"Li, Feng, Dongxiao Yu, Huan Yang, Jiguo Yu, Holger Karl, and Xiuzhen Cheng. “Multi-Armed-Bandit-Based Spectrum Scheduling Algorithms in Wireless Networks: A Survey.” <i>IEEE Wireless Communications</i>, 2020, 24–30. <a href=\"https://doi.org/10.1109/mwc.001.1900280\">https://doi.org/10.1109/mwc.001.1900280</a>.","ieee":"F. Li, D. Yu, H. Yang, J. Yu, H. Karl, and X. Cheng, “Multi-Armed-Bandit-Based Spectrum Scheduling Algorithms in Wireless Networks: A Survey,” <i>IEEE Wireless Communications</i>, pp. 24–30, 2020.","mla":"Li, Feng, et al. “Multi-Armed-Bandit-Based Spectrum Scheduling Algorithms in Wireless Networks: A Survey.” <i>IEEE Wireless Communications</i>, 2020, pp. 24–30, doi:<a href=\"https://doi.org/10.1109/mwc.001.1900280\">10.1109/mwc.001.1900280</a>.","apa":"Li, F., Yu, D., Yang, H., Yu, J., Karl, H., &#38; Cheng, X. (2020). Multi-Armed-Bandit-Based Spectrum Scheduling Algorithms in Wireless Networks: A Survey. <i>IEEE Wireless Communications</i>, 24–30. <a href=\"https://doi.org/10.1109/mwc.001.1900280\">https://doi.org/10.1109/mwc.001.1900280</a>"}},{"author":[{"id":"38705","first_name":"Jannik","last_name":"Castenow","full_name":"Castenow, Jannik"},{"id":"146","last_name":"Fischer","first_name":"Matthias","full_name":"Fischer, Matthias"},{"full_name":"Harbig, Jonas","first_name":"Jonas","last_name":"Harbig"},{"full_name":"Jung, Daniel","last_name":"Jung","first_name":"Daniel","id":"37827"},{"last_name":"Meyer auf der Heide","first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm","id":"15523"}],"publication_identifier":{"issn":["0304-3975"]},"title":"Gathering Anonymous, Oblivious Robots on a Grid","status":"public","year":"2020","intvolume":"       815","publication_status":"published","date_updated":"2022-01-06T06:52:48Z","language":[{"iso":"eng"}],"_id":"16299","page":"289-309","volume":815,"user_id":"38705","doi":"10.1016/j.tcs.2020.02.018","citation":{"short":"J. Castenow, M. Fischer, J. Harbig, D. Jung, F. Meyer auf der Heide, Theoretical Computer Science 815 (2020) 289–309.","chicago":"Castenow, Jannik, Matthias Fischer, Jonas Harbig, Daniel Jung, and Friedhelm Meyer auf der Heide. “Gathering Anonymous, Oblivious Robots on a Grid.” <i>Theoretical Computer Science</i> 815 (2020): 289–309. <a href=\"https://doi.org/10.1016/j.tcs.2020.02.018\">https://doi.org/10.1016/j.tcs.2020.02.018</a>.","ieee":"J. Castenow, M. Fischer, J. Harbig, D. Jung, and F. Meyer auf der Heide, “Gathering Anonymous, Oblivious Robots on a Grid,” <i>Theoretical Computer Science</i>, vol. 815, pp. 289–309, 2020.","apa":"Castenow, J., Fischer, M., Harbig, J., Jung, D., &#38; Meyer auf der Heide, F. (2020). Gathering Anonymous, Oblivious Robots on a Grid. <i>Theoretical Computer Science</i>, <i>815</i>, 289–309. <a href=\"https://doi.org/10.1016/j.tcs.2020.02.018\">https://doi.org/10.1016/j.tcs.2020.02.018</a>","bibtex":"@article{Castenow_Fischer_Harbig_Jung_Meyer auf der Heide_2020, title={Gathering Anonymous, Oblivious Robots on a Grid}, volume={815}, DOI={<a href=\"https://doi.org/10.1016/j.tcs.2020.02.018\">10.1016/j.tcs.2020.02.018</a>}, journal={Theoretical Computer Science}, author={Castenow, Jannik and Fischer, Matthias and Harbig, Jonas and Jung, Daniel and Meyer auf der Heide, Friedhelm}, year={2020}, pages={289–309} }","ama":"Castenow J, Fischer M, Harbig J, Jung D, Meyer auf der Heide F. Gathering Anonymous, Oblivious Robots on a Grid. <i>Theoretical Computer Science</i>. 2020;815:289-309. doi:<a href=\"https://doi.org/10.1016/j.tcs.2020.02.018\">10.1016/j.tcs.2020.02.018</a>","mla":"Castenow, Jannik, et al. “Gathering Anonymous, Oblivious Robots on a Grid.” <i>Theoretical Computer Science</i>, vol. 815, 2020, pp. 289–309, doi:<a href=\"https://doi.org/10.1016/j.tcs.2020.02.018\">10.1016/j.tcs.2020.02.018</a>."},"publication":"Theoretical Computer Science","date_created":"2020-03-13T12:55:53Z","department":[{"_id":"63"}],"type":"journal_article"},{"user_id":"477","page":"125-126","_id":"16363","publisher":"Association for Computing Machinery (ACM)","status":"public","conference":{"end_date":"2020-07-12","name":"The Genetic and Evolutionary Computation Conference (GECCO 2020)","start_date":"2020-07-08","location":"Cancún, Mexico"},"place":"New York, NY, United States","project":[{"_id":"4","name":"SFB 901 - Project Area C"},{"name":"SFB 901","_id":"1"},{"_id":"14","name":"SFB 901 - Subproject C2"}],"citation":{"apa":"Hansmeier, T., Kaufmann, P., &#38; Platzner, M. (2020). Enabling XCSF to Cope with Dynamic Environments via an Adaptive Error Threshold. In <i>GECCO ’20: Proceedings of the Genetic and Evolutionary Computation Conference Companion</i> (pp. 125–126). New York, NY, United States: Association for Computing Machinery (ACM). <a href=\"https://doi.org/10.1145/3377929.3389968\">https://doi.org/10.1145/3377929.3389968</a>","ieee":"T. Hansmeier, P. Kaufmann, and M. Platzner, “Enabling XCSF to Cope with Dynamic Environments via an Adaptive Error Threshold,” in <i>GECCO ’20: Proceedings of the Genetic and Evolutionary Computation Conference Companion</i>, Cancún, Mexico, 2020, pp. 125–126.","chicago":"Hansmeier, Tim, Paul Kaufmann, and Marco Platzner. “Enabling XCSF to Cope with Dynamic Environments via an Adaptive Error Threshold.” In <i>GECCO ’20: Proceedings of the Genetic and Evolutionary Computation Conference Companion</i>, 125–26. New York, NY, United States: Association for Computing Machinery (ACM), 2020. <a href=\"https://doi.org/10.1145/3377929.3389968\">https://doi.org/10.1145/3377929.3389968</a>.","short":"T. Hansmeier, P. Kaufmann, M. Platzner, in: GECCO ’20: Proceedings of the Genetic and Evolutionary Computation Conference Companion, Association for Computing Machinery (ACM), New York, NY, United States, 2020, pp. 125–126.","mla":"Hansmeier, Tim, et al. “Enabling XCSF to Cope with Dynamic Environments via an Adaptive Error Threshold.” <i>GECCO ’20: Proceedings of the Genetic and Evolutionary Computation Conference Companion</i>, Association for Computing Machinery (ACM), 2020, pp. 125–26, doi:<a href=\"https://doi.org/10.1145/3377929.3389968\">10.1145/3377929.3389968</a>.","ama":"Hansmeier T, Kaufmann P, Platzner M. Enabling XCSF to Cope with Dynamic Environments via an Adaptive Error Threshold. In: <i>GECCO ’20: Proceedings of the Genetic and Evolutionary Computation Conference Companion</i>. New York, NY, United States: Association for Computing Machinery (ACM); 2020:125-126. doi:<a href=\"https://doi.org/10.1145/3377929.3389968\">10.1145/3377929.3389968</a>","bibtex":"@inproceedings{Hansmeier_Kaufmann_Platzner_2020, place={New York, NY, United States}, title={Enabling XCSF to Cope with Dynamic Environments via an Adaptive Error Threshold}, DOI={<a href=\"https://doi.org/10.1145/3377929.3389968\">10.1145/3377929.3389968</a>}, booktitle={GECCO ’20: Proceedings of the Genetic and Evolutionary Computation Conference Companion}, publisher={Association for Computing Machinery (ACM)}, author={Hansmeier, Tim and Kaufmann, Paul and Platzner, Marco}, year={2020}, pages={125–126} }"},"doi":"10.1145/3377929.3389968","language":[{"iso":"eng"}],"publication_status":"published","date_updated":"2022-01-06T06:52:49Z","year":"2020","title":"Enabling XCSF to Cope with Dynamic Environments via an Adaptive Error Threshold","author":[{"last_name":"Hansmeier","orcid":"0000-0003-1377-3339","first_name":"Tim","full_name":"Hansmeier, Tim","id":"49992"},{"full_name":"Kaufmann, Paul","first_name":"Paul","last_name":"Kaufmann"},{"id":"398","last_name":"Platzner","first_name":"Marco","full_name":"Platzner, Marco"}],"publication_identifier":{"isbn":["978-1-4503-7127-8"]},"type":"conference","department":[{"_id":"78"}],"date_created":"2020-04-02T10:07:10Z","publication":"GECCO '20: Proceedings of the Genetic and Evolutionary Computation Conference Companion"},{"publication":"IEEE Conference on Network Softwarization (NetSoft) Demo Track","citation":{"short":"M. Müller, D. Behnke, P.-B. Bök, S.B. Schneider, M. Peuster, H. Karl, in: IEEE Conference on Network Softwarization (NetSoft) Demo Track, IEEE, Ghent, Belgium, 2020.","chicago":"Müller, Marcel, Daniel Behnke, Patrick-Benjamin Bök, Stefan Balthasar Schneider, Manuel Peuster, and Holger Karl. “Cloud-Native Threat Detection and Containment for Smart Manufacturing.” In <i>IEEE Conference on Network Softwarization (NetSoft) Demo Track</i>. Ghent, Belgium: IEEE, 2020.","apa":"Müller, M., Behnke, D., Bök, P.-B., Schneider, S. B., Peuster, M., &#38; Karl, H. (2020). Cloud-Native Threat Detection and Containment for Smart Manufacturing. In <i>IEEE Conference on Network Softwarization (NetSoft) Demo Track</i>. Ghent, Belgium: IEEE.","ieee":"M. Müller, D. Behnke, P.-B. Bök, S. B. Schneider, M. Peuster, and H. Karl, “Cloud-Native Threat Detection and Containment for Smart Manufacturing,” in <i>IEEE Conference on Network Softwarization (NetSoft) Demo Track</i>, Ghent, Belgium, 2020.","ama":"Müller M, Behnke D, Bök P-B, Schneider SB, Peuster M, Karl H. Cloud-Native Threat Detection and Containment for Smart Manufacturing. In: <i>IEEE Conference on Network Softwarization (NetSoft) Demo Track</i>. Ghent, Belgium: IEEE; 2020.","bibtex":"@inproceedings{Müller_Behnke_Bök_Schneider_Peuster_Karl_2020, place={Ghent, Belgium}, title={Cloud-Native Threat Detection and Containment for Smart Manufacturing}, booktitle={IEEE Conference on Network Softwarization (NetSoft) Demo Track}, publisher={IEEE}, author={Müller, Marcel and Behnke, Daniel and Bök, Patrick-Benjamin and Schneider, Stefan Balthasar and Peuster, Manuel and Karl, Holger}, year={2020} }","mla":"Müller, Marcel, et al. “Cloud-Native Threat Detection and Containment for Smart Manufacturing.” <i>IEEE Conference on Network Softwarization (NetSoft) Demo Track</i>, IEEE, 2020."},"abstract":[{"lang":"eng","text":"Softwarization facilitates the introduction of smart\r\nmanufacturing applications in the industry. Manifold devices\r\nsuch as machine computers, Industrial IoT devices, tablets,\r\nsmartphones and smart glasses are integrated into factory networks\r\nto enable shop floor digitalization and big data analysis. To\r\nhandle the increasing number of devices and the resulting traffic,\r\na flexible and scalable factory network is necessary which can be\r\nrealized using softwarization technologies like Network Function\r\nVirtualization (NFV). However, the security risks increase with\r\nthe increasing number of new devices, so that cyber security must\r\nalso be considered in NFV-based networks.\r\n\r\nTherefore, extending our previous work, we showcase threat\r\ndetection using a cloud-native NFV-driven intrusion detection\r\nsystem (IDS) that is integrated in our industrial-specific network\r\nservices. As a result of the threat detection, the affected network\r\nservice is put into quarantine via automatic network reconfiguration.\r\nWe use the 5GTANGO service platform to deploy our\r\ndeveloped network services on Kubernetes and to initiate the\r\nnetwork reconfiguration."}],"project":[{"name":"5G Development and validation platform for global industry-specific network services and Apps","grant_number":"761493","_id":"28"},{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area C","_id":"4"},{"_id":"16","name":"SFB 901 - Subproject C4"}],"date_created":"2020-04-03T11:53:00Z","place":"Ghent, Belgium","type":"conference","department":[{"_id":"75"}],"year":"2020","title":"Cloud-Native Threat Detection and Containment for Smart Manufacturing","status":"public","author":[{"last_name":"Müller","first_name":"Marcel","full_name":"Müller, Marcel"},{"first_name":"Daniel","last_name":"Behnke","full_name":"Behnke, Daniel"},{"first_name":"Patrick-Benjamin","last_name":"Bök","full_name":"Bök, Patrick-Benjamin"},{"id":"35343","full_name":"Schneider, Stefan Balthasar","orcid":"0000-0001-8210-4011","first_name":"Stefan Balthasar","last_name":"Schneider"},{"first_name":"Manuel","last_name":"Peuster","full_name":"Peuster, Manuel","id":"13271"},{"id":"126","first_name":"Holger","last_name":"Karl","full_name":"Karl, Holger"}],"conference":{"location":"Ghent, Belgium","name":"IEEE Conference on Network Softwarization (NetSoft) Demo Track"},"date_updated":"2022-01-06T06:52:50Z","_id":"16400","language":[{"iso":"eng"}],"publisher":"IEEE","user_id":"35343"},{"project":[{"_id":"4","name":"SFB 901 - Project Area C"},{"_id":"1","name":"SFB 901"},{"_id":"16","name":"SFB 901 - Subproject C4"}],"citation":{"ieee":"S. Pukrop, A. Mäcker, and F. Meyer auf der Heide, “Approximating Weighted Completion Time for Order Scheduling with Setup Times,” in <i>Proceedings of the 46th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM)</i>, 2020.","apa":"Pukrop, S., Mäcker, A., &#38; Meyer auf der Heide, F. (2020). Approximating Weighted Completion Time for Order Scheduling with Setup Times. In <i>Proceedings of the 46th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM)</i>.","mla":"Pukrop, Simon, et al. “Approximating Weighted Completion Time for Order Scheduling with Setup Times.” <i>Proceedings of the 46th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM)</i>, 2020.","bibtex":"@inproceedings{Pukrop_Mäcker_Meyer auf der Heide_2020, title={Approximating Weighted Completion Time for Order Scheduling with Setup Times}, booktitle={Proceedings of the 46th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM)}, author={Pukrop, Simon and Mäcker, Alexander and Meyer auf der Heide, Friedhelm}, year={2020} }","ama":"Pukrop S, Mäcker A, Meyer auf der Heide F. Approximating Weighted Completion Time for Order Scheduling with Setup Times. In: <i>Proceedings of the 46th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM)</i>. ; 2020.","short":"S. Pukrop, A. Mäcker, F. Meyer auf der Heide, in: Proceedings of the 46th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM), 2020.","chicago":"Pukrop, Simon, Alexander Mäcker, and Friedhelm Meyer auf der Heide. “Approximating Weighted Completion Time for Order Scheduling with Setup Times.” In <i>Proceedings of the 46th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM)</i>, 2020."},"publication":"Proceedings of the 46th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM)","department":[{"_id":"63"}],"type":"conference","date_created":"2019-10-15T12:19:49Z","date_updated":"2022-01-06T06:51:45Z","author":[{"full_name":"Pukrop, Simon","last_name":"Pukrop","first_name":"Simon","id":"44428"},{"full_name":"Mäcker, Alexander","last_name":"Mäcker","first_name":"Alexander","id":"13536"},{"id":"15523","last_name":"Meyer auf der Heide","first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm"}],"year":"2020","title":"Approximating Weighted Completion Time for Order Scheduling with Setup Times","status":"public","user_id":"44428","language":[{"iso":"eng"}],"_id":"13868"},{"author":[{"last_name":"Kiesel","first_name":"Dora","full_name":"Kiesel, Dora"},{"last_name":"Riehmann","first_name":"Patrick","full_name":"Riehmann, Patrick"},{"first_name":"Henning","last_name":"Wachsmuth","full_name":"Wachsmuth, Henning","id":"3900"},{"first_name":"Benno","last_name":"Stein","full_name":"Stein, Benno"},{"first_name":"Bernd","last_name":"Fröhlich","full_name":"Fröhlich, Bernd"}],"status":"public","title":"Visual Analysis of Argumentation in Essays","year":"2020","intvolume":"        27","publication_status":"accepted","date_updated":"2022-01-06T06:50:37Z","_id":"10330","language":[{"iso":"eng"}],"page":"1139-1148","main_file_link":[{"url":"https://www.uni-weimar.de/fileadmin/user/fak/medien/professuren/Virtual_Reality/documents/publications/Visual_Analysis_of_Argumentation_in_Essays.pdf"}],"volume":27,"user_id":"82920","citation":{"bibtex":"@article{Kiesel_Riehmann_Wachsmuth_Stein_Fröhlich, title={Visual Analysis of Argumentation in Essays}, volume={27}, number={2}, journal={IEEE Transactions of Visualization &#38; Computer Graphics}, author={Kiesel, Dora and Riehmann, Patrick and Wachsmuth, Henning and Stein, Benno and Fröhlich, Bernd}, pages={1139–1148} }","chicago":"Kiesel, Dora, Patrick Riehmann, Henning Wachsmuth, Benno Stein, and Bernd Fröhlich. “Visual Analysis of Argumentation in Essays.” <i>IEEE Transactions of Visualization &#38; Computer Graphics</i> 27, no. 2 (n.d.): 1139–48.","ama":"Kiesel D, Riehmann P, Wachsmuth H, Stein B, Fröhlich B. Visual Analysis of Argumentation in Essays. <i>IEEE Transactions of Visualization &#38; Computer Graphics</i>. 27(2):1139-1148.","short":"D. Kiesel, P. Riehmann, H. Wachsmuth, B. Stein, B. Fröhlich, IEEE Transactions of Visualization &#38; Computer Graphics 27 (n.d.) 1139–1148.","ieee":"D. Kiesel, P. Riehmann, H. Wachsmuth, B. Stein, and B. Fröhlich, “Visual Analysis of Argumentation in Essays,” <i>IEEE Transactions of Visualization &#38; Computer Graphics</i>, vol. 27, no. 2, pp. 1139–1148.","apa":"Kiesel, D., Riehmann, P., Wachsmuth, H., Stein, B., &#38; Fröhlich, B. (n.d.). Visual Analysis of Argumentation in Essays. <i>IEEE Transactions of Visualization &#38; Computer Graphics</i>, <i>27</i>(2), 1139–1148.","mla":"Kiesel, Dora, et al. “Visual Analysis of Argumentation in Essays.” <i>IEEE Transactions of Visualization &#38; Computer Graphics</i>, vol. 27, no. 2, pp. 1139–48."},"issue":"2","publication":"IEEE Transactions of Visualization & Computer Graphics","date_created":"2019-06-27T12:58:13Z","department":[{"_id":"600"}],"type":"journal_article"},{"_id":"25336","publisher":"Association for Computing Machinery","page":"1647–1664","user_id":"83504","status":"public","place":"New York, NY, USA","citation":{"ieee":"J. Schwenk, M. Brinkmann, D. Poddebniak, J. Müller, J. Somorovsky, and S. Schinzel, “Mitigation of Attacks on Email End-to-End Encryption,” in <i>Proceedings of the 2020 ACM SIGSAC Conference on Computer and Communications Security</i>, 2020, pp. 1647–1664, doi: <a href=\"https://doi.org/10.1145/3372297.3417878\">10.1145/3372297.3417878</a>.","apa":"Schwenk, J., Brinkmann, M., Poddebniak, D., Müller, J., Somorovsky, J., &#38; Schinzel, S. (2020). Mitigation of Attacks on Email End-to-End Encryption. <i>Proceedings of the 2020 ACM SIGSAC Conference on Computer and Communications Security</i>, 1647–1664. <a href=\"https://doi.org/10.1145/3372297.3417878\">https://doi.org/10.1145/3372297.3417878</a>","short":"J. Schwenk, M. Brinkmann, D. Poddebniak, J. Müller, J. Somorovsky, S. Schinzel, in: Proceedings of the 2020 ACM SIGSAC Conference on Computer and Communications Security, Association for Computing Machinery, New York, NY, USA, 2020, pp. 1647–1664.","chicago":"Schwenk, Jörg, Marcus Brinkmann, Damian Poddebniak, Jens Müller, Juraj Somorovsky, and Sebastian Schinzel. “Mitigation of Attacks on Email End-to-End Encryption.” In <i>Proceedings of the 2020 ACM SIGSAC Conference on Computer and Communications Security</i>, 1647–1664. CCS ’20. New York, NY, USA: Association for Computing Machinery, 2020. <a href=\"https://doi.org/10.1145/3372297.3417878\">https://doi.org/10.1145/3372297.3417878</a>.","mla":"Schwenk, Jörg, et al. “Mitigation of Attacks on Email End-to-End Encryption.” <i>Proceedings of the 2020 ACM SIGSAC Conference on Computer and Communications Security</i>, Association for Computing Machinery, 2020, pp. 1647–1664, doi:<a href=\"https://doi.org/10.1145/3372297.3417878\">10.1145/3372297.3417878</a>.","bibtex":"@inproceedings{Schwenk_Brinkmann_Poddebniak_Müller_Somorovsky_Schinzel_2020, place={New York, NY, USA}, series={CCS ’20}, title={Mitigation of Attacks on Email End-to-End Encryption}, DOI={<a href=\"https://doi.org/10.1145/3372297.3417878\">10.1145/3372297.3417878</a>}, booktitle={Proceedings of the 2020 ACM SIGSAC Conference on Computer and Communications Security}, publisher={Association for Computing Machinery}, author={Schwenk, Jörg and Brinkmann, Marcus and Poddebniak, Damian and Müller, Jens and Somorovsky, Juraj and Schinzel, Sebastian}, year={2020}, pages={1647–1664}, collection={CCS ’20} }","ama":"Schwenk J, Brinkmann M, Poddebniak D, Müller J, Somorovsky J, Schinzel S. Mitigation of Attacks on Email End-to-End Encryption. In: <i>Proceedings of the 2020 ACM SIGSAC Conference on Computer and Communications Security</i>. CCS ’20. Association for Computing Machinery; 2020:1647–1664. doi:<a href=\"https://doi.org/10.1145/3372297.3417878\">10.1145/3372297.3417878</a>"},"series_title":"CCS '20","language":[{"iso":"eng"}],"doi":"10.1145/3372297.3417878","author":[{"last_name":"Schwenk","first_name":"Jörg","full_name":"Schwenk, Jörg"},{"full_name":"Brinkmann, Marcus","last_name":"Brinkmann","first_name":"Marcus"},{"last_name":"Poddebniak","first_name":"Damian","full_name":"Poddebniak, Damian"},{"full_name":"Müller, Jens","last_name":"Müller","first_name":"Jens"},{"full_name":"Somorovsky, Juraj","first_name":"Juraj","orcid":"0000-0002-3593-7720","last_name":"Somorovsky","id":"83504"},{"full_name":"Schinzel, Sebastian","last_name":"Schinzel","first_name":"Sebastian"}],"publication_identifier":{"isbn":["9781450370899"]},"year":"2020","title":"Mitigation of Attacks on Email End-to-End Encryption","date_updated":"2022-08-03T09:57:27Z","publication_status":"published","date_created":"2021-10-04T18:58:37Z","department":[{"_id":"632"}],"keyword":["decryption contexts","EFAIL","OpenPGP","S/MIME","AEAD"],"type":"conference","publication":"Proceedings of the 2020 ACM SIGSAC Conference on Computer and Communications Security","abstract":[{"lang":"eng","text":"OpenPGP and S/MIME are two major standards for securing email communication introduced in the early 1990s. Three recent classes of attacks exploit weak cipher modes (EFAIL Malleability Gadgets, or EFAIL-MG), the flexibility of the MIME email structure (EFAIL Direct Exfiltration, or EFAIL-DE), and the Reply action of the email client (REPLY attacks). Although all three break message confidentiality by using standardized email features, only EFAIL-MG has been mitigated in IETF standards with the introduction of AEAD algorithms. So far, no uniform and reliable countermeasures have been adopted by email clients to prevent EFAIL-DE and REPLY attacks. Instead, email clients implement a variety of different ad-hoc countermeasures which are only partially effective, cause interoperability problems, and fragment the secure email ecosystem.We present the first generic countermeasure against both REPLY and EFAIL-DE attacks by checking the decryption context including SMTP headers and MIME structure during decryption. The decryption context is encoded into a string DC and used as Associated Data (AD) in the AEAD encryption. Thus the proposed solution seamlessly extends the EFAIL-MG countermeasures. The decryption context changes whenever an attacker alters the email source code in a critical way, for example, if the attacker changes the MIME structure or adds a new Reply-To header. The proposed solution does not cause any interoperability problems and legacy emails can still be decrypted. We evaluate our approach by implementing the decryption contexts in Thunderbird/Enigmail and by verifying their correct functionality after the email has been transported over all major email providers, including Gmail and iCloud Mail."}]},{"date_created":"2020-05-05T06:16:29Z","type":"dissertation","department":[{"_id":"574"}],"supervisor":[{"first_name":"Axel-Cyrille","last_name":"Ngonga Ngomo","full_name":"Ngonga Ngomo, Axel-Cyrille","id":"65716"}],"citation":{"apa":"Moussalem, D. C. (2020). <i>Knowledge Graphs for Multilingual Language Translation and Generation</i>. <a href=\"https://doi.org/10.17619/UNIPB/1-980\">https://doi.org/10.17619/UNIPB/1-980</a>","ieee":"D. C. Moussalem, <i>Knowledge Graphs for Multilingual Language Translation and Generation</i>. 2020.","short":"D.C. Moussalem, Knowledge Graphs for Multilingual Language Translation and Generation, 2020.","chicago":"Moussalem, Diego Campos. <i>Knowledge Graphs for Multilingual Language Translation and Generation</i>, 2020. <a href=\"https://doi.org/10.17619/UNIPB/1-980\">https://doi.org/10.17619/UNIPB/1-980</a>.","mla":"Moussalem, Diego Campos. <i>Knowledge Graphs for Multilingual Language Translation and Generation</i>. 2020, doi:<a href=\"https://doi.org/10.17619/UNIPB/1-980\">10.17619/UNIPB/1-980</a>.","ama":"Moussalem DC. <i>Knowledge Graphs for Multilingual Language Translation and Generation</i>.; 2020. doi:<a href=\"https://doi.org/10.17619/UNIPB/1-980\">10.17619/UNIPB/1-980</a>","bibtex":"@book{Moussalem_2020, title={Knowledge Graphs for Multilingual Language Translation and Generation}, DOI={<a href=\"https://doi.org/10.17619/UNIPB/1-980\">10.17619/UNIPB/1-980</a>}, author={Moussalem, Diego Campos}, year={2020} }"},"project":[{"_id":"1","name":"SFB 901"},{"_id":"3","name":"SFB 901 - Project Area B"},{"_id":"10","name":"SFB 901 - Subproject B2"}],"language":[{"iso":"eng"}],"_id":"16935","doi":"10.17619/UNIPB/1-980","user_id":"477","status":"public","year":"2020","title":"Knowledge Graphs for Multilingual Language Translation and Generation","author":[{"full_name":"Moussalem, Diego Campos","first_name":"Diego Campos","last_name":"Moussalem"}],"date_updated":"2022-11-30T13:43:53Z"}]