[{"title":"No Word Embedding Model Is Perfect: Evaluating the Representation  Accuracy for Social Bias in the Media","conference":{"start_date":"2022-12-07","name":"The 2022 Conference on Empirical Methods in Natural Language Processing (EMNLP 2022)","location":"Abu Dhabi","end_date":"2022-12-11"},"publisher":"Association for Computational Linguistics","date_updated":"2022-11-11T12:49:47Z","author":[{"first_name":"Maximilian","last_name":"Spliethöver","full_name":"Spliethöver, Maximilian"},{"first_name":"Maximilian","full_name":"Keiff, Maximilian","last_name":"Keiff"},{"first_name":"Henning","full_name":"Wachsmuth, Henning","last_name":"Wachsmuth"}],"date_created":"2022-11-10T08:28:53Z","year":"2022","citation":{"ieee":"M. Spliethöver, M. Keiff, and H. Wachsmuth, “No Word Embedding Model Is Perfect: Evaluating the Representation  Accuracy for Social Bias in the Media,” presented at the The 2022 Conference on Empirical Methods in Natural Language Processing (EMNLP 2022), Abu Dhabi, 2022.","chicago":"Spliethöver, Maximilian, Maximilian Keiff, and Henning Wachsmuth. “No Word Embedding Model Is Perfect: Evaluating the Representation  Accuracy for Social Bias in the Media.” In <i>Proceedings of The 2022 Conference on Empirical Methods in Natural Language Processing (EMNLP 2022)</i>. Association for Computational Linguistics, 2022.","bibtex":"@inproceedings{Spliethöver_Keiff_Wachsmuth_2022, title={No Word Embedding Model Is Perfect: Evaluating the Representation  Accuracy for Social Bias in the Media}, booktitle={Proceedings of The 2022 Conference on Empirical Methods in Natural Language Processing (EMNLP 2022)}, publisher={Association for Computational Linguistics}, author={Spliethöver, Maximilian and Keiff, Maximilian and Wachsmuth, Henning}, year={2022} }","short":"M. Spliethöver, M. Keiff, H. Wachsmuth, in: Proceedings of The 2022 Conference on Empirical Methods in Natural Language Processing (EMNLP 2022), Association for Computational Linguistics, 2022.","mla":"Spliethöver, Maximilian, et al. “No Word Embedding Model Is Perfect: Evaluating the Representation  Accuracy for Social Bias in the Media.” <i>Proceedings of The 2022 Conference on Empirical Methods in Natural Language Processing (EMNLP 2022)</i>, Association for Computational Linguistics, 2022.","ama":"Spliethöver M, Keiff M, Wachsmuth H. No Word Embedding Model Is Perfect: Evaluating the Representation  Accuracy for Social Bias in the Media. In: <i>Proceedings of The 2022 Conference on Empirical Methods in Natural Language Processing (EMNLP 2022)</i>. Association for Computational Linguistics; 2022.","apa":"Spliethöver, M., Keiff, M., &#38; Wachsmuth, H. (2022). No Word Embedding Model Is Perfect: Evaluating the Representation  Accuracy for Social Bias in the Media. <i>Proceedings of The 2022 Conference on Empirical Methods in Natural Language Processing (EMNLP 2022)</i>. The 2022 Conference on Empirical Methods in Natural Language Processing (EMNLP 2022), Abu Dhabi."},"language":[{"iso":"eng"}],"extern":"1","_id":"34047","external_id":{"arxiv":["2211.03634"]},"user_id":"84035","department":[{"_id":"600"}],"abstract":[{"text":"News articles both shape and reflect public opinion across the political\r\nspectrum. Analyzing them for social bias can thus provide valuable insights,\r\nsuch as prevailing stereotypes in society and the media, which are often\r\nadopted by NLP models trained on respective data. Recent work has relied on\r\nword embedding bias measures, such as WEAT. However, several representation\r\nissues of embeddings can harm the measures' accuracy, including low-resource\r\nsettings and token frequency differences. In this work, we study what kind of\r\nembedding algorithm serves best to accurately measure types of social bias\r\nknown to exist in US online news articles. To cover the whole spectrum of\r\npolitical bias in the US, we collect 500k articles and review psychology\r\nliterature with respect to expected social bias. We then quantify social bias\r\nusing WEAT along with embedding algorithms that account for the aforementioned\r\nissues. We compare how models trained with the algorithms on news articles\r\nrepresent the expected social bias. Our results suggest that the standard way\r\nto quantify bias does not align well with knowledge from psychology. While the\r\nproposed algorithms reduce the~gap, they still do not fully match the\r\nliterature.","lang":"eng"}],"status":"public","type":"conference","publication":"Proceedings of The 2022 Conference on Empirical Methods in Natural Language Processing (EMNLP 2022)"},{"publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783030997380","9783030997397"]},"publication_status":"published","citation":{"mla":"Bondarenko, Alexander, et al. “Overview of Touché 2022: Argument Retrieval.” <i>Lecture Notes in Computer Science</i>, Springer International Publishing, 2022, doi:<a href=\"https://doi.org/10.1007/978-3-030-99739-7_43\">10.1007/978-3-030-99739-7_43</a>.","bibtex":"@inbook{Bondarenko_Fröbe_Kiesel_Syed_Gurcke_Beloucif_Panchenko_Biemann_Stein_Wachsmuth_et al._2022, place={Cham}, title={Overview of Touché 2022: Argument Retrieval}, DOI={<a href=\"https://doi.org/10.1007/978-3-030-99739-7_43\">10.1007/978-3-030-99739-7_43</a>}, booktitle={Lecture Notes in Computer Science}, publisher={Springer International Publishing}, author={Bondarenko, Alexander and Fröbe, Maik and Kiesel, Johannes and Syed, Shahbaz and Gurcke, Timon and Beloucif, Meriem and Panchenko, Alexander and Biemann, Chris and Stein, Benno and Wachsmuth, Henning and et al.}, year={2022} }","short":"A. Bondarenko, M. Fröbe, J. Kiesel, S. Syed, T. Gurcke, M. Beloucif, A. Panchenko, C. Biemann, B. Stein, H. Wachsmuth, M. Potthast, M. Hagen, in: Lecture Notes in Computer Science, Springer International Publishing, Cham, 2022.","apa":"Bondarenko, A., Fröbe, M., Kiesel, J., Syed, S., Gurcke, T., Beloucif, M., Panchenko, A., Biemann, C., Stein, B., Wachsmuth, H., Potthast, M., &#38; Hagen, M. (2022). Overview of Touché 2022: Argument Retrieval. In <i>Lecture Notes in Computer Science</i>. Springer International Publishing. <a href=\"https://doi.org/10.1007/978-3-030-99739-7_43\">https://doi.org/10.1007/978-3-030-99739-7_43</a>","ama":"Bondarenko A, Fröbe M, Kiesel J, et al. Overview of Touché 2022: Argument Retrieval. In: <i>Lecture Notes in Computer Science</i>. Springer International Publishing; 2022. doi:<a href=\"https://doi.org/10.1007/978-3-030-99739-7_43\">10.1007/978-3-030-99739-7_43</a>","chicago":"Bondarenko, Alexander, Maik Fröbe, Johannes Kiesel, Shahbaz Syed, Timon Gurcke, Meriem Beloucif, Alexander Panchenko, et al. “Overview of Touché 2022: Argument Retrieval.” In <i>Lecture Notes in Computer Science</i>. Cham: Springer International Publishing, 2022. <a href=\"https://doi.org/10.1007/978-3-030-99739-7_43\">https://doi.org/10.1007/978-3-030-99739-7_43</a>.","ieee":"A. Bondarenko <i>et al.</i>, “Overview of Touché 2022: Argument Retrieval,” in <i>Lecture Notes in Computer Science</i>, Cham: Springer International Publishing, 2022."},"year":"2022","place":"Cham","author":[{"first_name":"Alexander","last_name":"Bondarenko","full_name":"Bondarenko, Alexander"},{"full_name":"Fröbe, Maik","last_name":"Fröbe","first_name":"Maik"},{"first_name":"Johannes","full_name":"Kiesel, Johannes","last_name":"Kiesel"},{"last_name":"Syed","full_name":"Syed, Shahbaz","first_name":"Shahbaz"},{"full_name":"Gurcke, Timon","last_name":"Gurcke","first_name":"Timon"},{"full_name":"Beloucif, Meriem","last_name":"Beloucif","first_name":"Meriem"},{"first_name":"Alexander","last_name":"Panchenko","full_name":"Panchenko, Alexander"},{"full_name":"Biemann, Chris","last_name":"Biemann","first_name":"Chris"},{"first_name":"Benno","last_name":"Stein","full_name":"Stein, Benno"},{"first_name":"Henning","full_name":"Wachsmuth, Henning","last_name":"Wachsmuth"},{"last_name":"Potthast","full_name":"Potthast, Martin","first_name":"Martin"},{"first_name":"Matthias","last_name":"Hagen","full_name":"Hagen, Matthias"}],"date_created":"2022-11-14T13:47:51Z","publisher":"Springer International Publishing","date_updated":"2022-11-14T13:48:38Z","doi":"10.1007/978-3-030-99739-7_43","title":"Overview of Touché 2022: Argument Retrieval","publication":"Lecture Notes in Computer Science","type":"book_chapter","status":"public","department":[{"_id":"600"}],"user_id":"52174","_id":"34077","alternative_title":["Extended Abstract"]},{"publication":"28th International Conference on DNA Computing and Molecular Programming (DNA 28)","language":[{"iso":"eng"}],"year":"2022","title":"The Structural Power of Reconfigurable Circuits in the Amoebot Model","publisher":"Schloss Dagstuhl – Leibniz-Zentrum für Informatik","date_created":"2022-08-08T17:32:19Z","editor":[{"last_name":"Ouldridge","full_name":"Ouldridge, Thomas E.","first_name":"Thomas E."},{"last_name":"Wickham","full_name":"Wickham, Shelley F. J.","first_name":"Shelley F. J."}],"status":"public","type":"conference","project":[{"_id":"1","name":"SFB 901: SFB 901"},{"_id":"2","name":"SFB 901 - A: SFB 901 - Project Area A"},{"name":"SFB 901 - C: SFB 901 - Project Area C","_id":"4"},{"_id":"5","name":"SFB 901 - A1: SFB 901 - Subproject A1"},{"name":"SFB 901 - C1: SFB 901 - Subproject C1","_id":"13"}],"_id":"32602","series_title":"Leibniz International Proceedings in Informatics (LIPIcs)","user_id":"477","department":[{"_id":"79"}],"place":"Dagstuhl, Germany","citation":{"bibtex":"@inproceedings{Padalkin_Scheideler_Warner_2022, place={Dagstuhl, Germany}, series={Leibniz International Proceedings in Informatics (LIPIcs)}, title={The Structural Power of Reconfigurable Circuits in the Amoebot Model}, volume={238}, DOI={<a href=\"https://doi.org/10.4230/LIPIcs.DNA.28.8\">10.4230/LIPIcs.DNA.28.8</a>}, booktitle={28th International Conference on DNA Computing and Molecular Programming (DNA 28)}, publisher={Schloss Dagstuhl – Leibniz-Zentrum für Informatik}, author={Padalkin, Andreas and Scheideler, Christian and Warner, Daniel}, editor={Ouldridge, Thomas E. and Wickham, Shelley F. J.}, year={2022}, pages={8:1–8:22}, collection={Leibniz International Proceedings in Informatics (LIPIcs)} }","short":"A. Padalkin, C. Scheideler, D. Warner, in: T.E. Ouldridge, S.F.J. Wickham (Eds.), 28th International Conference on DNA Computing and Molecular Programming (DNA 28), Schloss Dagstuhl – Leibniz-Zentrum für Informatik, Dagstuhl, Germany, 2022, p. 8:1–8:22.","mla":"Padalkin, Andreas, et al. “The Structural Power of Reconfigurable Circuits in the Amoebot Model.” <i>28th International Conference on DNA Computing and Molecular Programming (DNA 28)</i>, edited by Thomas E. Ouldridge and Shelley F. J. Wickham, vol. 238, Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2022, p. 8:1–8:22, doi:<a href=\"https://doi.org/10.4230/LIPIcs.DNA.28.8\">10.4230/LIPIcs.DNA.28.8</a>.","apa":"Padalkin, A., Scheideler, C., &#38; Warner, D. (2022). The Structural Power of Reconfigurable Circuits in the Amoebot Model. In T. E. Ouldridge &#38; S. F. J. Wickham (Eds.), <i>28th International Conference on DNA Computing and Molecular Programming (DNA 28)</i> (Vol. 238, p. 8:1–8:22). Schloss Dagstuhl – Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.DNA.28.8\">https://doi.org/10.4230/LIPIcs.DNA.28.8</a>","ama":"Padalkin A, Scheideler C, Warner D. The Structural Power of Reconfigurable Circuits in the Amoebot Model. In: Ouldridge TE, Wickham SFJ, eds. <i>28th International Conference on DNA Computing and Molecular Programming (DNA 28)</i>. Vol 238. Leibniz International Proceedings in Informatics (LIPIcs). Schloss Dagstuhl – Leibniz-Zentrum für Informatik; 2022:8:1–8:22. doi:<a href=\"https://doi.org/10.4230/LIPIcs.DNA.28.8\">10.4230/LIPIcs.DNA.28.8</a>","chicago":"Padalkin, Andreas, Christian Scheideler, and Daniel Warner. “The Structural Power of Reconfigurable Circuits in the Amoebot Model.” In <i>28th International Conference on DNA Computing and Molecular Programming (DNA 28)</i>, edited by Thomas E. Ouldridge and Shelley F. J. Wickham, 238:8:1–8:22. Leibniz International Proceedings in Informatics (LIPIcs). Dagstuhl, Germany: Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2022. <a href=\"https://doi.org/10.4230/LIPIcs.DNA.28.8\">https://doi.org/10.4230/LIPIcs.DNA.28.8</a>.","ieee":"A. Padalkin, C. Scheideler, and D. Warner, “The Structural Power of Reconfigurable Circuits in the Amoebot Model,” in <i>28th International Conference on DNA Computing and Molecular Programming (DNA 28)</i>, 2022, vol. 238, p. 8:1–8:22, doi: <a href=\"https://doi.org/10.4230/LIPIcs.DNA.28.8\">10.4230/LIPIcs.DNA.28.8</a>."},"page":"8:1–8:22","intvolume":"       238","publication_identifier":{"isbn":["978-3-95977-253-2"],"issn":["1868-8969"]},"doi":"10.4230/LIPIcs.DNA.28.8","date_updated":"2022-11-17T14:18:24Z","author":[{"first_name":"Andreas","id":"88238","full_name":"Padalkin, Andreas","last_name":"Padalkin"},{"id":"20792","full_name":"Scheideler, Christian","last_name":"Scheideler","first_name":"Christian"},{"first_name":"Daniel","id":"3902","full_name":"Warner, Daniel","last_name":"Warner"}],"volume":238},{"project":[{"name":"SFB 901: SFB 901","_id":"1"},{"_id":"4","name":"SFB 901 - C: SFB 901 - Project Area C"},{"name":"SFB 901 - C1: SFB 901 - Subproject C1","_id":"13"}],"_id":"32603","series_title":"Leibniz International Proceedings in Informatics (LIPIcs)","user_id":"477","department":[{"_id":"79"}],"editor":[{"first_name":"Thomas E.","last_name":"Ouldridge","full_name":"Ouldridge, Thomas E."},{"full_name":"Wickham, Shelley F. J.","last_name":"Wickham","first_name":"Shelley F. J."}],"status":"public","type":"conference","doi":"10.4230/LIPIcs.DNA.28.9","date_updated":"2022-11-17T14:17:09Z","author":[{"last_name":"Kostitsyna","full_name":"Kostitsyna, Irina","first_name":"Irina"},{"first_name":"Christian","id":"20792","full_name":"Scheideler, Christian","last_name":"Scheideler"},{"full_name":"Warner, Daniel","id":"3902","last_name":"Warner","first_name":"Daniel"}],"volume":238,"place":"Dagstuhl, Germany","citation":{"apa":"Kostitsyna, I., Scheideler, C., &#38; Warner, D. (2022). Fault-Tolerant Shape Formation in the Amoebot Model. In T. E. Ouldridge &#38; S. F. J. Wickham (Eds.), <i>28th International Conference on DNA Computing and Molecular Programming (DNA 28)</i> (Vol. 238, p. 9:1–9:22). Schloss Dagstuhl – Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.DNA.28.9\">https://doi.org/10.4230/LIPIcs.DNA.28.9</a>","mla":"Kostitsyna, Irina, et al. “Fault-Tolerant Shape Formation in the Amoebot Model.” <i>28th International Conference on DNA Computing and Molecular Programming (DNA 28)</i>, edited by Thomas E. Ouldridge and Shelley F. J. Wickham, vol. 238, Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2022, p. 9:1–9:22, doi:<a href=\"https://doi.org/10.4230/LIPIcs.DNA.28.9\">10.4230/LIPIcs.DNA.28.9</a>.","bibtex":"@inproceedings{Kostitsyna_Scheideler_Warner_2022, place={Dagstuhl, Germany}, series={Leibniz International Proceedings in Informatics (LIPIcs)}, title={Fault-Tolerant Shape Formation in the Amoebot Model}, volume={238}, DOI={<a href=\"https://doi.org/10.4230/LIPIcs.DNA.28.9\">10.4230/LIPIcs.DNA.28.9</a>}, booktitle={28th International Conference on DNA Computing and Molecular Programming (DNA 28)}, publisher={Schloss Dagstuhl – Leibniz-Zentrum für Informatik}, author={Kostitsyna, Irina and Scheideler, Christian and Warner, Daniel}, editor={Ouldridge, Thomas E. and Wickham, Shelley F. J.}, year={2022}, pages={9:1–9:22}, collection={Leibniz International Proceedings in Informatics (LIPIcs)} }","short":"I. Kostitsyna, C. Scheideler, D. Warner, in: T.E. Ouldridge, S.F.J. Wickham (Eds.), 28th International Conference on DNA Computing and Molecular Programming (DNA 28), Schloss Dagstuhl – Leibniz-Zentrum für Informatik, Dagstuhl, Germany, 2022, p. 9:1–9:22.","ama":"Kostitsyna I, Scheideler C, Warner D. Fault-Tolerant Shape Formation in the Amoebot Model. In: Ouldridge TE, Wickham SFJ, eds. <i>28th International Conference on DNA Computing and Molecular Programming (DNA 28)</i>. Vol 238. Leibniz International Proceedings in Informatics (LIPIcs). Schloss Dagstuhl – Leibniz-Zentrum für Informatik; 2022:9:1–9:22. doi:<a href=\"https://doi.org/10.4230/LIPIcs.DNA.28.9\">10.4230/LIPIcs.DNA.28.9</a>","chicago":"Kostitsyna, Irina, Christian Scheideler, and Daniel Warner. “Fault-Tolerant Shape Formation in the Amoebot Model.” In <i>28th International Conference on DNA Computing and Molecular Programming (DNA 28)</i>, edited by Thomas E. Ouldridge and Shelley F. J. Wickham, 238:9:1–9:22. Leibniz International Proceedings in Informatics (LIPIcs). Dagstuhl, Germany: Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2022. <a href=\"https://doi.org/10.4230/LIPIcs.DNA.28.9\">https://doi.org/10.4230/LIPIcs.DNA.28.9</a>.","ieee":"I. Kostitsyna, C. Scheideler, and D. Warner, “Fault-Tolerant Shape Formation in the Amoebot Model,” in <i>28th International Conference on DNA Computing and Molecular Programming (DNA 28)</i>, 2022, vol. 238, p. 9:1–9:22, doi: <a href=\"https://doi.org/10.4230/LIPIcs.DNA.28.9\">10.4230/LIPIcs.DNA.28.9</a>."},"page":"9:1–9:22","intvolume":"       238","publication_identifier":{"issn":["1868-8969"],"isbn":["978-3-95977-253-2"]},"language":[{"iso":"eng"}],"publication":"28th International Conference on DNA Computing and Molecular Programming (DNA 28)","title":"Fault-Tolerant Shape Formation in the Amoebot Model","publisher":"Schloss Dagstuhl – Leibniz-Zentrum für Informatik","date_created":"2022-08-08T17:42:43Z","year":"2022"},{"abstract":[{"lang":"eng","text":"The decentralized nature of multi-agent systems requires continuous data exchange to achieve global objectives. In such scenarios, Age of Information (AoI) has become an important metric of the freshness of exchanged data due to the error-proneness and delays of communication systems. Communication systems usually possess dependencies: the process describing the success or failure of communication is highly correlated when these attempts are ``close'' in some domain (e.g. in time, frequency, space or code as in wireless communication) and is, in general, non-stationary. To study AoI in such scenarios, we consider an abstract event-based AoI process $\\Delta(n)$, expressing time since the last update: If, at time $n$, a monitoring node receives a status update from a source node (event $A(n-1)$ occurs), then $\\Delta(n)$ is reset to one; otherwise, $\\Delta(n)$ grows linearly in time. This AoI process can thus be viewed as a special random walk with resets. The event process $A(n)$ may be nonstationary and we merely assume that its temporal dependencies decay sufficiently, described by $\\alpha$-mixing. We calculate moment bounds for the resulting AoI process as a function of the mixing rate of $A(n)$. Furthermore, we prove that the AoI process $\\Delta(n)$ is itself $\\alpha$-mixing from which we conclude a strong law of large numbers for $\\Delta(n)$. These results are new, since AoI processes have not been studied so far in this general strongly mixing setting. This opens up future work on renewal processes with non-independent interarrival times."}],"status":"public","type":"conference","publication":"Proceedings of the 58th Allerton Conference on Communication, Control, and Computing","ddc":["000"],"language":[{"iso":"eng"}],"project":[{"name":"SFB 901 - C4: SFB 901 - Subproject C4","_id":"16"},{"name":"SFB 901: SFB 901","_id":"1"},{"_id":"4","name":"SFB 901 - C: SFB 901 - Project Area C"}],"_id":"32811","user_id":"477","department":[{"_id":"75"}],"year":"2022","citation":{"ieee":"A. Redder, A. Ramaswamy, and H. Karl, “Age of Information Process under Strongly Mixing Communication -- Moment Bound, Mixing Rate and Strong Law,” presented at the 58th Allerton Conference on Communication, Control, and Computing, 2022.","chicago":"Redder, Adrian, Arunselvan Ramaswamy, and Holger Karl. “Age of Information Process under Strongly Mixing Communication -- Moment Bound, Mixing Rate and Strong Law.” In <i>Proceedings of the 58th Allerton Conference on Communication, Control, and Computing</i>, 2022.","ama":"Redder A, Ramaswamy A, Karl H. Age of Information Process under Strongly Mixing Communication -- Moment Bound, Mixing Rate and Strong Law. In: <i>Proceedings of the 58th Allerton Conference on Communication, Control, and Computing</i>. ; 2022.","apa":"Redder, A., Ramaswamy, A., &#38; Karl, H. (2022). Age of Information Process under Strongly Mixing Communication -- Moment Bound, Mixing Rate and Strong Law. <i>Proceedings of the 58th Allerton Conference on Communication, Control, and Computing</i>. 58th Allerton Conference on Communication, Control, and Computing.","bibtex":"@inproceedings{Redder_Ramaswamy_Karl_2022, title={Age of Information Process under Strongly Mixing Communication -- Moment Bound, Mixing Rate and Strong Law}, booktitle={Proceedings of the 58th Allerton Conference on Communication, Control, and Computing}, author={Redder, Adrian and Ramaswamy, Arunselvan and Karl, Holger}, year={2022} }","mla":"Redder, Adrian, et al. “Age of Information Process under Strongly Mixing Communication -- Moment Bound, Mixing Rate and Strong Law.” <i>Proceedings of the 58th Allerton Conference on Communication, Control, and Computing</i>, 2022.","short":"A. Redder, A. Ramaswamy, H. Karl, in: Proceedings of the 58th Allerton Conference on Communication, Control, and Computing, 2022."},"has_accepted_license":"1","title":"Age of Information Process under Strongly Mixing Communication -- Moment Bound, Mixing Rate and Strong Law","conference":{"name":"58th Allerton Conference on Communication, Control, and Computing"},"date_updated":"2022-11-18T09:31:19Z","author":[{"id":"52265","full_name":"Redder, Adrian","last_name":"Redder","orcid":"https://orcid.org/0000-0001-7391-4688","first_name":"Adrian"},{"first_name":"Arunselvan","last_name":"Ramaswamy","orcid":"https://orcid.org/ 0000-0001-7547-8111","full_name":"Ramaswamy, Arunselvan","id":"66937"},{"first_name":"Holger","last_name":"Karl","id":"126","full_name":"Karl, Holger"}],"date_created":"2022-08-15T09:59:17Z"},{"publication_status":"published","has_accepted_license":"1","citation":{"chicago":"Redder, Adrian, Arunselvan Ramaswamy, and Holger Karl. “Multi-Agent Policy Gradient Algorithms for Cyber-Physical Systems with Lossy Communication.” In <i>Proceedings of the 14th International Conference on Agents and Artificial Intelligence</i>. SCITEPRESS - Science and Technology Publications, 2022. <a href=\"https://doi.org/10.5220/0010845400003116\">https://doi.org/10.5220/0010845400003116</a>.","ieee":"A. Redder, A. Ramaswamy, and H. Karl, “Multi-agent Policy Gradient Algorithms for Cyber-physical Systems with Lossy Communication,” 2022, doi: <a href=\"https://doi.org/10.5220/0010845400003116\">10.5220/0010845400003116</a>.","ama":"Redder A, Ramaswamy A, Karl H. Multi-agent Policy Gradient Algorithms for Cyber-physical Systems with Lossy Communication. In: <i>Proceedings of the 14th International Conference on Agents and Artificial Intelligence</i>. SCITEPRESS - Science and Technology Publications; 2022. doi:<a href=\"https://doi.org/10.5220/0010845400003116\">10.5220/0010845400003116</a>","apa":"Redder, A., Ramaswamy, A., &#38; Karl, H. (2022). Multi-agent Policy Gradient Algorithms for Cyber-physical Systems with Lossy Communication. <i>Proceedings of the 14th International Conference on Agents and Artificial Intelligence</i>. <a href=\"https://doi.org/10.5220/0010845400003116\">https://doi.org/10.5220/0010845400003116</a>","short":"A. Redder, A. Ramaswamy, H. Karl, in: Proceedings of the 14th International Conference on Agents and Artificial Intelligence, SCITEPRESS - Science and Technology Publications, 2022.","bibtex":"@inproceedings{Redder_Ramaswamy_Karl_2022, title={Multi-agent Policy Gradient Algorithms for Cyber-physical Systems with Lossy Communication}, DOI={<a href=\"https://doi.org/10.5220/0010845400003116\">10.5220/0010845400003116</a>}, booktitle={Proceedings of the 14th International Conference on Agents and Artificial Intelligence}, publisher={SCITEPRESS - Science and Technology Publications}, author={Redder, Adrian and Ramaswamy, Arunselvan and Karl, Holger}, year={2022} }","mla":"Redder, Adrian, et al. “Multi-Agent Policy Gradient Algorithms for Cyber-Physical Systems with Lossy Communication.” <i>Proceedings of the 14th International Conference on Agents and Artificial Intelligence</i>, SCITEPRESS - Science and Technology Publications, 2022, doi:<a href=\"https://doi.org/10.5220/0010845400003116\">10.5220/0010845400003116</a>."},"year":"2022","author":[{"first_name":"Adrian","full_name":"Redder, Adrian","id":"52265","last_name":"Redder","orcid":"https://orcid.org/0000-0001-7391-4688"},{"first_name":"Arunselvan","full_name":"Ramaswamy, Arunselvan","id":"66937","last_name":"Ramaswamy","orcid":"https://orcid.org/ 0000-0001-7547-8111"},{"last_name":"Karl","full_name":"Karl, Holger","id":"126","first_name":"Holger"}],"date_created":"2022-04-06T07:18:36Z","publisher":"SCITEPRESS - Science and Technology Publications","date_updated":"2022-11-18T09:32:14Z","doi":"10.5220/0010845400003116","title":"Multi-agent Policy Gradient Algorithms for Cyber-physical Systems with Lossy Communication","type":"conference","publication":"Proceedings of the 14th International Conference on Agents and Artificial Intelligence","file":[{"date_updated":"2022-08-31T07:10:13Z","date_created":"2022-08-31T07:10:13Z","creator":"aredder","file_size":298926,"file_name":"ICCART2022.pdf","file_id":"33237","access_level":"closed","content_type":"application/pdf","success":1,"relation":"main_file"}],"status":"public","user_id":"477","department":[{"_id":"75"}],"project":[{"_id":"16","name":"SFB 901 - C4: SFB 901 - Subproject C4"},{"_id":"24","name":"NICCI-CN: Netzgewahre Regelung & regelungsgewahre Netze"},{"name":"SFB 901: SFB 901","_id":"1"},{"name":"SFB 901 - C: SFB 901 - Project Area C","_id":"4"}],"_id":"30793","file_date_updated":"2022-08-31T07:10:13Z","language":[{"iso":"eng"}],"ddc":["006"]},{"author":[{"first_name":"Adrian","orcid":"https://orcid.org/0000-0001-7391-4688","last_name":"Redder","id":"52265","full_name":"Redder, Adrian"},{"last_name":"Ramaswamy","orcid":"https://orcid.org/ 0000-0001-7547-8111","id":"66937","full_name":"Ramaswamy, Arunselvan","first_name":"Arunselvan"},{"first_name":"Holger","last_name":"Karl","id":"126","full_name":"Karl, Holger"}],"date_created":"2022-04-06T06:53:38Z","date_updated":"2022-11-18T09:33:01Z","title":"Distributed gradient-based optimization in the presence of dependent  aperiodic communication","citation":{"ama":"Redder A, Ramaswamy A, Karl H. Distributed gradient-based optimization in the presence of dependent  aperiodic communication. <i>arXiv:220111343</i>. Published online 2022.","ieee":"A. Redder, A. Ramaswamy, and H. Karl, “Distributed gradient-based optimization in the presence of dependent  aperiodic communication,” <i>arXiv:2201.11343</i>. 2022.","chicago":"Redder, Adrian, Arunselvan Ramaswamy, and Holger Karl. “Distributed Gradient-Based Optimization in the Presence of Dependent  Aperiodic Communication.” <i>ArXiv:2201.11343</i>, 2022.","bibtex":"@article{Redder_Ramaswamy_Karl_2022, title={Distributed gradient-based optimization in the presence of dependent  aperiodic communication}, journal={arXiv:2201.11343}, author={Redder, Adrian and Ramaswamy, Arunselvan and Karl, Holger}, year={2022} }","short":"A. Redder, A. Ramaswamy, H. Karl, ArXiv:2201.11343 (2022).","mla":"Redder, Adrian, et al. “Distributed Gradient-Based Optimization in the Presence of Dependent  Aperiodic Communication.” <i>ArXiv:2201.11343</i>, 2022.","apa":"Redder, A., Ramaswamy, A., &#38; Karl, H. (2022). Distributed gradient-based optimization in the presence of dependent  aperiodic communication. In <i>arXiv:2201.11343</i>."},"year":"2022","department":[{"_id":"75"}],"user_id":"477","external_id":{"arxiv":["2201.11343"]},"_id":"30790","project":[{"_id":"16","name":"SFB 901 - C4: SFB 901 - Subproject C4"},{"_id":"1","name":"SFB 901: SFB 901"},{"name":"SFB 901 - C: SFB 901 - Project Area C","_id":"4"}],"language":[{"iso":"eng"}],"publication":"arXiv:2201.11343","type":"preprint","status":"public","abstract":[{"lang":"eng","text":"Iterative distributed optimization algorithms involve multiple agents that\r\ncommunicate with each other, over time, in order to minimize/maximize a global\r\nobjective. In the presence of unreliable communication networks, the\r\nAge-of-Information (AoI), which measures the freshness of data received, may be\r\nlarge and hence hinder algorithmic convergence. In this paper, we study the\r\nconvergence of general distributed gradient-based optimization algorithms in\r\nthe presence of communication that neither happens periodically nor at\r\nstochastically independent points in time. We show that convergence is\r\nguaranteed provided the random variables associated with the AoI processes are\r\nstochastically dominated by a random variable with finite first moment. This\r\nimproves on previous requirements of boundedness of more than the first moment.\r\nWe then introduce stochastically strongly connected (SSC) networks, a new\r\nstochastic form of strong connectedness for time-varying networks. We show: If\r\nfor any $p \\ge0$ the processes that describe the success of communication\r\nbetween agents in a SSC network are $\\alpha$-mixing with $n^{p-1}\\alpha(n)$\r\nsummable, then the associated AoI processes are stochastically dominated by a\r\nrandom variable with finite $p$-th moment. In combination with our first\r\ncontribution, this implies that distributed stochastic gradient descend\r\nconverges in the presence of AoI, if $\\alpha(n)$ is summable."}]},{"language":[{"iso":"eng"}],"_id":"32855","project":[{"_id":"83","name":"SFB 901 - T1: SFB 901 -Subproject T1"},{"name":"SFB 901: SFB 901","_id":"1"},{"name":"SFB 901 - T: SFB 901 - Project Area T","_id":"82"}],"department":[{"_id":"78"}],"user_id":"477","status":"public","publication":"2022 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW)","type":"conference","title":"ReconOS64: A Hardware Operating System for Modern Platform FPGAs with 64-Bit Support","doi":"10.1109/ipdpsw55747.2022.00029","conference":{"location":" Lyon, France","end_date":"2022-06-03","start_date":"2022-05-30","name":"2022 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW)"},"publisher":"IEEE","date_updated":"2022-11-18T09:36:00Z","date_created":"2022-08-16T09:58:34Z","author":[{"orcid":"0000-0003-3789-6034","last_name":"Clausing","full_name":"Clausing, Lennart","id":"74287","first_name":"Lennart"},{"full_name":"Platzner, Marco","id":"398","last_name":"Platzner","first_name":"Marco"}],"year":"2022","page":"120-127","citation":{"ieee":"L. Clausing and M. Platzner, “ReconOS64: A Hardware Operating System for Modern Platform FPGAs with 64-Bit Support,” in <i>2022 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW)</i>,  Lyon, France, 2022, pp. 120–127, doi: <a href=\"https://doi.org/10.1109/ipdpsw55747.2022.00029\">10.1109/ipdpsw55747.2022.00029</a>.","chicago":"Clausing, Lennart, and Marco Platzner. “ReconOS64: A Hardware Operating System for Modern Platform FPGAs with 64-Bit Support.” In <i>2022 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW)</i>, 120–27. IEEE, 2022. <a href=\"https://doi.org/10.1109/ipdpsw55747.2022.00029\">https://doi.org/10.1109/ipdpsw55747.2022.00029</a>.","ama":"Clausing L, Platzner M. ReconOS64: A Hardware Operating System for Modern Platform FPGAs with 64-Bit Support. In: <i>2022 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW)</i>. IEEE; 2022:120-127. doi:<a href=\"https://doi.org/10.1109/ipdpsw55747.2022.00029\">10.1109/ipdpsw55747.2022.00029</a>","apa":"Clausing, L., &#38; Platzner, M. (2022). ReconOS64: A Hardware Operating System for Modern Platform FPGAs with 64-Bit Support. <i>2022 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW)</i>, 120–127. <a href=\"https://doi.org/10.1109/ipdpsw55747.2022.00029\">https://doi.org/10.1109/ipdpsw55747.2022.00029</a>","bibtex":"@inproceedings{Clausing_Platzner_2022, title={ReconOS64: A Hardware Operating System for Modern Platform FPGAs with 64-Bit Support}, DOI={<a href=\"https://doi.org/10.1109/ipdpsw55747.2022.00029\">10.1109/ipdpsw55747.2022.00029</a>}, booktitle={2022 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW)}, publisher={IEEE}, author={Clausing, Lennart and Platzner, Marco}, year={2022}, pages={120–127} }","mla":"Clausing, Lennart, and Marco Platzner. “ReconOS64: A Hardware Operating System for Modern Platform FPGAs with 64-Bit Support.” <i>2022 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW)</i>, IEEE, 2022, pp. 120–27, doi:<a href=\"https://doi.org/10.1109/ipdpsw55747.2022.00029\">10.1109/ipdpsw55747.2022.00029</a>.","short":"L. Clausing, M. Platzner, in: 2022 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW), IEEE, 2022, pp. 120–127."},"publication_identifier":{"eisbn":["978-1-6654-9747-3"]},"publication_status":"published"},{"language":[{"iso":"eng"}],"project":[{"_id":"16","name":"SFB 901 - C4: SFB 901 - Subproject C4"},{"_id":"1","name":"SFB 901: SFB 901"},{"_id":"4","name":"SFB 901 - C: SFB 901 - Project Area C"}],"_id":"30791","external_id":{"arxiv":["2201.00570"]},"user_id":"477","department":[{"_id":"75"}],"abstract":[{"text":"We present sufficient conditions that ensure convergence of the multi-agent\r\nDeep Deterministic Policy Gradient (DDPG) algorithm. It is an example of one of\r\nthe most popular paradigms of Deep Reinforcement Learning (DeepRL) for tackling\r\ncontinuous action spaces: the actor-critic paradigm. In the setting considered\r\nherein, each agent observes a part of the global state space in order to take\r\nlocal actions, for which it receives local rewards. For every agent, DDPG\r\ntrains a local actor (policy) and a local critic (Q-function). The analysis\r\nshows that multi-agent DDPG using neural networks to approximate the local\r\npolicies and critics converge to limits with the following properties: The\r\ncritic limits minimize the average squared Bellman loss; the actor limits\r\nparameterize a policy that maximizes the local critic's approximation of\r\n$Q_i^*$, where $i$ is the agent index. The averaging is with respect to a\r\nprobability distribution over the global state-action space. It captures the\r\nasymptotics of all local training processes. Finally, we extend the analysis to\r\na fully decentralized setting where agents communicate over a wireless network\r\nprone to delays and losses; a typical scenario in, e.g., robotic applications.","lang":"eng"}],"status":"public","type":"preprint","publication":"arXiv:2201.00570","title":"Asymptotic Convergence of Deep Multi-Agent Actor-Critic Algorithms","date_updated":"2022-11-18T09:33:42Z","author":[{"first_name":"Adrian","full_name":"Redder, Adrian","id":"52265","orcid":"https://orcid.org/0000-0001-7391-4688","last_name":"Redder"},{"full_name":"Ramaswamy, Arunselvan","id":"66937","last_name":"Ramaswamy","orcid":"https://orcid.org/ 0000-0001-7547-8111","first_name":"Arunselvan"},{"first_name":"Holger","id":"126","full_name":"Karl, Holger","last_name":"Karl"}],"date_created":"2022-04-06T06:53:52Z","year":"2022","citation":{"ieee":"A. Redder, A. Ramaswamy, and H. Karl, “Asymptotic Convergence of Deep Multi-Agent Actor-Critic Algorithms,” <i>arXiv:2201.00570</i>. 2022.","chicago":"Redder, Adrian, Arunselvan Ramaswamy, and Holger Karl. “Asymptotic Convergence of Deep Multi-Agent Actor-Critic Algorithms.” <i>ArXiv:2201.00570</i>, 2022.","ama":"Redder A, Ramaswamy A, Karl H. Asymptotic Convergence of Deep Multi-Agent Actor-Critic Algorithms. <i>arXiv:220100570</i>. Published online 2022.","apa":"Redder, A., Ramaswamy, A., &#38; Karl, H. (2022). Asymptotic Convergence of Deep Multi-Agent Actor-Critic Algorithms. In <i>arXiv:2201.00570</i>.","mla":"Redder, Adrian, et al. “Asymptotic Convergence of Deep Multi-Agent Actor-Critic Algorithms.” <i>ArXiv:2201.00570</i>, 2022.","short":"A. Redder, A. Ramaswamy, H. Karl, ArXiv:2201.00570 (2022).","bibtex":"@article{Redder_Ramaswamy_Karl_2022, title={Asymptotic Convergence of Deep Multi-Agent Actor-Critic Algorithms}, journal={arXiv:2201.00570}, author={Redder, Adrian and Ramaswamy, Arunselvan and Karl, Holger}, year={2022} }"}},{"title":"Learning Realistic Mutations: Bug Creation for Neural Bug Detectors","doi":"10.1109/ICST53961.2022.00027","date_updated":"2022-11-18T09:45:40Z","date_created":"2022-08-08T07:40:04Z","author":[{"last_name":"Richter","full_name":"Richter, Cedric","id":"50003","first_name":"Cedric"},{"last_name":"Wehrheim","full_name":"Wehrheim, Heike","id":"573","first_name":"Heike"}],"year":"2022","page":"162-173","citation":{"apa":"Richter, C., &#38; Wehrheim, H. (2022). Learning Realistic Mutations: Bug Creation for Neural Bug Detectors. <i>2022 IEEE Conference on Software Testing, Verification and Validation (ICST)</i>, 162–173. <a href=\"https://doi.org/10.1109/ICST53961.2022.00027\">https://doi.org/10.1109/ICST53961.2022.00027</a>","ama":"Richter C, Wehrheim H. Learning Realistic Mutations: Bug Creation for Neural Bug Detectors. In: <i>2022 IEEE Conference on Software Testing, Verification and Validation (ICST)</i>. ; 2022:162-173. doi:<a href=\"https://doi.org/10.1109/ICST53961.2022.00027\">10.1109/ICST53961.2022.00027</a>","bibtex":"@inproceedings{Richter_Wehrheim_2022, title={Learning Realistic Mutations: Bug Creation for Neural Bug Detectors}, DOI={<a href=\"https://doi.org/10.1109/ICST53961.2022.00027\">10.1109/ICST53961.2022.00027</a>}, booktitle={2022 IEEE Conference on Software Testing, Verification and Validation (ICST)}, author={Richter, Cedric and Wehrheim, Heike}, year={2022}, pages={162–173} }","mla":"Richter, Cedric, and Heike Wehrheim. “Learning Realistic Mutations: Bug Creation for Neural Bug Detectors.” <i>2022 IEEE Conference on Software Testing, Verification and Validation (ICST)</i>, 2022, pp. 162–73, doi:<a href=\"https://doi.org/10.1109/ICST53961.2022.00027\">10.1109/ICST53961.2022.00027</a>.","short":"C. Richter, H. Wehrheim, in: 2022 IEEE Conference on Software Testing, Verification and Validation (ICST), 2022, pp. 162–173.","chicago":"Richter, Cedric, and Heike Wehrheim. “Learning Realistic Mutations: Bug Creation for Neural Bug Detectors.” In <i>2022 IEEE Conference on Software Testing, Verification and Validation (ICST)</i>, 162–73, 2022. <a href=\"https://doi.org/10.1109/ICST53961.2022.00027\">https://doi.org/10.1109/ICST53961.2022.00027</a>.","ieee":"C. Richter and H. Wehrheim, “Learning Realistic Mutations: Bug Creation for Neural Bug Detectors,” in <i>2022 IEEE Conference on Software Testing, Verification and Validation (ICST)</i>, 2022, pp. 162–173, doi: <a href=\"https://doi.org/10.1109/ICST53961.2022.00027\">10.1109/ICST53961.2022.00027</a>."},"language":[{"iso":"eng"}],"_id":"32590","project":[{"_id":"12","name":"SFB 901 - B4: SFB 901 - Subproject B4"},{"name":"SFB 901: SFB 901","_id":"1"},{"name":"SFB 901 - B: SFB 901 - Project Area B","_id":"3"}],"department":[{"_id":"77"}],"user_id":"477","status":"public","publication":"2022 IEEE Conference on Software Testing, Verification and Validation (ICST)","type":"conference"},{"year":"2022","citation":{"short":"C. Richter, H. Wehrheim, in: 2022 IEEE/ACM 19th International Conference on Mining Software Repositories (MSR), 2022, pp. 418–422.","mla":"Richter, Cedric, and Heike Wehrheim. “TSSB-3M: Mining Single Statement Bugs at Massive Scale.” <i>2022 IEEE/ACM 19th International Conference on Mining Software Repositories (MSR)</i>, 2022, pp. 418–22, doi:<a href=\"https://doi.org/10.1145/3524842.3528505\">10.1145/3524842.3528505</a>.","bibtex":"@inproceedings{Richter_Wehrheim_2022, title={TSSB-3M: Mining single statement bugs at massive scale}, DOI={<a href=\"https://doi.org/10.1145/3524842.3528505\">10.1145/3524842.3528505</a>}, booktitle={2022 IEEE/ACM 19th International Conference on Mining Software Repositories (MSR)}, author={Richter, Cedric and Wehrheim, Heike}, year={2022}, pages={418–422} }","apa":"Richter, C., &#38; Wehrheim, H. (2022). TSSB-3M: Mining single statement bugs at massive scale. <i>2022 IEEE/ACM 19th International Conference on Mining Software Repositories (MSR)</i>, 418–422. <a href=\"https://doi.org/10.1145/3524842.3528505\">https://doi.org/10.1145/3524842.3528505</a>","chicago":"Richter, Cedric, and Heike Wehrheim. “TSSB-3M: Mining Single Statement Bugs at Massive Scale.” In <i>2022 IEEE/ACM 19th International Conference on Mining Software Repositories (MSR)</i>, 418–22, 2022. <a href=\"https://doi.org/10.1145/3524842.3528505\">https://doi.org/10.1145/3524842.3528505</a>.","ieee":"C. Richter and H. Wehrheim, “TSSB-3M: Mining single statement bugs at massive scale,” in <i>2022 IEEE/ACM 19th International Conference on Mining Software Repositories (MSR)</i>, 2022, pp. 418–422, doi: <a href=\"https://doi.org/10.1145/3524842.3528505\">10.1145/3524842.3528505</a>.","ama":"Richter C, Wehrheim H. TSSB-3M: Mining single statement bugs at massive scale. In: <i>2022 IEEE/ACM 19th International Conference on Mining Software Repositories (MSR)</i>. ; 2022:418-422. doi:<a href=\"https://doi.org/10.1145/3524842.3528505\">10.1145/3524842.3528505</a>"},"page":"418-422","title":"TSSB-3M: Mining single statement bugs at massive scale","doi":"10.1145/3524842.3528505","date_updated":"2022-11-18T09:45:05Z","author":[{"first_name":"Cedric","last_name":"Richter","full_name":"Richter, Cedric","id":"50003"},{"last_name":"Wehrheim","id":"573","full_name":"Wehrheim, Heike","first_name":"Heike"}],"date_created":"2022-08-08T07:42:19Z","status":"public","type":"conference","publication":"2022 IEEE/ACM 19th International Conference on Mining Software Repositories (MSR)","language":[{"iso":"eng"}],"project":[{"_id":"12","name":"SFB 901 - B4: SFB 901 - Subproject B4"},{"_id":"1","name":"SFB 901: SFB 901"},{"name":"SFB 901 - B: SFB 901 - Project Area B","_id":"3"}],"_id":"32591","user_id":"477","department":[{"_id":"77"}]},{"user_id":"477","department":[{"_id":"64"},{"_id":"7"}],"project":[{"name":"SFB 901: SFB 901","_id":"1"},{"_id":"4","name":"SFB 901 - C: SFB 901 - Project Area C"},{"name":"SFB 901 - C1: SFB 901 - Subproject C1","_id":"13"},{"name":"SFB 901 - T2: SFB 901 -Subproject T2","_id":"84"},{"_id":"82","name":"SFB 901 - T: SFB 901 - Project Area T"}],"_id":"32398","language":[{"iso":"eng"}],"type":"bachelorsthesis","status":"public","author":[{"full_name":"Siek, Hanna","last_name":"Siek","first_name":"Hanna"}],"date_created":"2022-07-20T09:36:39Z","supervisor":[{"first_name":"Johannes","last_name":"Blömer","id":"23","full_name":"Blömer, Johannes"}],"date_updated":"2022-11-18T09:38:04Z","title":"Bringing Structure to Structure-Preserving Signatures: Overview, Implementation and Comparison of Selected SPS Schemes","citation":{"short":"H. Siek, Bringing Structure to Structure-Preserving Signatures: Overview, Implementation and Comparison of Selected SPS Schemes, 2022.","mla":"Siek, Hanna. <i>Bringing Structure to Structure-Preserving Signatures: Overview, Implementation and Comparison of Selected SPS Schemes</i>. 2022.","bibtex":"@book{Siek_2022, title={Bringing Structure to Structure-Preserving Signatures: Overview, Implementation and Comparison of Selected SPS Schemes}, author={Siek, Hanna}, year={2022} }","apa":"Siek, H. (2022). <i>Bringing Structure to Structure-Preserving Signatures: Overview, Implementation and Comparison of Selected SPS Schemes</i>.","ama":"Siek H. <i>Bringing Structure to Structure-Preserving Signatures: Overview, Implementation and Comparison of Selected SPS Schemes</i>.; 2022.","chicago":"Siek, Hanna. <i>Bringing Structure to Structure-Preserving Signatures: Overview, Implementation and Comparison of Selected SPS Schemes</i>, 2022.","ieee":"H. Siek, <i>Bringing Structure to Structure-Preserving Signatures: Overview, Implementation and Comparison of Selected SPS Schemes</i>. 2022."},"year":"2022"},{"citation":{"apa":"Kramer, P. (2022). <i>On Transforming Lattice-Based Cryptography to the Ring Setting</i>.","mla":"Kramer, Paul. <i>On Transforming Lattice-Based Cryptography to the Ring Setting</i>. 2022.","bibtex":"@book{Kramer_2022, title={On Transforming Lattice-Based Cryptography to the Ring Setting}, author={Kramer, Paul}, year={2022} }","short":"P. Kramer, On Transforming Lattice-Based Cryptography to the Ring Setting, 2022.","ama":"Kramer P. <i>On Transforming Lattice-Based Cryptography to the Ring Setting</i>.; 2022.","chicago":"Kramer, Paul. <i>On Transforming Lattice-Based Cryptography to the Ring Setting</i>, 2022.","ieee":"P. Kramer, <i>On Transforming Lattice-Based Cryptography to the Ring Setting</i>. 2022."},"year":"2022","title":"On Transforming Lattice-Based Cryptography to the Ring Setting","date_created":"2022-05-28T08:07:40Z","author":[{"first_name":"Paul","full_name":"Kramer, Paul","id":"64594","last_name":"Kramer"}],"date_updated":"2022-11-18T09:40:28Z","status":"public","type":"mastersthesis","language":[{"iso":"eng"}],"extern":"1","user_id":"477","department":[{"_id":"7"},{"_id":"64"}],"project":[{"name":"SFB 901 - C: SFB 901 - Project Area C","_id":"4"},{"name":"SFB 901 - C1: SFB 901 - Subproject C1","_id":"13"},{"name":"SFB 901: SFB 901","_id":"1"}],"_id":"31485"},{"type":"journal_article","status":"public","_id":"32854","project":[{"_id":"16","name":"SFB 901 - C4: SFB 901 - Subproject C4"},{"name":"SFB 901: SFB 901","_id":"1"},{"name":"SFB 901 - C: SFB 901 - Project Area C","_id":"4"}],"department":[{"_id":"75"}],"user_id":"477","file_date_updated":"2022-08-31T07:06:30Z","has_accepted_license":"1","intvolume":"        55","page":"133–138","citation":{"ieee":"A. Redder, A. Ramaswamy, and H. Karl, “Practical Network Conditions for the Convergence of Distributed Optimization,” <i>IFAC-PapersOnLine</i>, vol. 55, no. 13, pp. 133–138, 2022.","chicago":"Redder, Adrian, Arunselvan Ramaswamy, and Holger Karl. “Practical Network Conditions for the Convergence of Distributed Optimization.” <i>IFAC-PapersOnLine</i> 55, no. 13 (2022): 133–138.","ama":"Redder A, Ramaswamy A, Karl H. Practical Network Conditions for the Convergence of Distributed Optimization. <i>IFAC-PapersOnLine</i>. 2022;55(13):133–138.","mla":"Redder, Adrian, et al. “Practical Network Conditions for the Convergence of Distributed Optimization.” <i>IFAC-PapersOnLine</i>, vol. 55, no. 13, Elsevier, 2022, pp. 133–138.","bibtex":"@article{Redder_Ramaswamy_Karl_2022, title={Practical Network Conditions for the Convergence of Distributed Optimization}, volume={55}, number={13}, journal={IFAC-PapersOnLine}, publisher={Elsevier}, author={Redder, Adrian and Ramaswamy, Arunselvan and Karl, Holger}, year={2022}, pages={133–138} }","short":"A. Redder, A. Ramaswamy, H. Karl, IFAC-PapersOnLine 55 (2022) 133–138.","apa":"Redder, A., Ramaswamy, A., &#38; Karl, H. (2022). Practical Network Conditions for the Convergence of Distributed Optimization. <i>IFAC-PapersOnLine</i>, <i>55</i>(13), 133–138."},"date_updated":"2022-11-18T10:05:14Z","volume":55,"author":[{"first_name":"Adrian","full_name":"Redder, Adrian","id":"52265","orcid":"https://orcid.org/0000-0001-7391-4688","last_name":"Redder"},{"id":"66937","full_name":"Ramaswamy, Arunselvan","last_name":"Ramaswamy","orcid":"https://orcid.org/ 0000-0001-7547-8111","first_name":"Arunselvan"},{"last_name":"Karl","id":"126","full_name":"Karl, Holger","first_name":"Holger"}],"conference":{"name":"IFAC Conference on Networked Systems"},"publication":"IFAC-PapersOnLine","file":[{"relation":"main_file","success":1,"content_type":"application/pdf","file_name":"NecSys2022____Practical_Conditions_for_Conv.pdf","access_level":"closed","file_id":"33236","file_size":298395,"date_created":"2022-08-31T07:06:30Z","creator":"aredder","date_updated":"2022-08-31T07:06:30Z"}],"ddc":["006"],"language":[{"iso":"eng"}],"issue":"13","year":"2022","publisher":"Elsevier","date_created":"2022-08-16T09:12:55Z","title":"Practical Network Conditions for the Convergence of Distributed Optimization"},{"publication_status":"published","place":"New York, NY, United States","year":"2022","page":"2071-2079","citation":{"ama":"Hansmeier T, Brede M, Platzner M. XCS on Embedded Systems: An Analysis of Execution Profiles and Accelerated Classifier Deletion. In: <i>GECCO ’22: Proceedings of the Genetic and Evolutionary Computation Conference Companion</i>. Association for Computing Machinery (ACM); 2022:2071-2079. doi:<a href=\"https://doi.org/10.1145/3520304.3533977\">10.1145/3520304.3533977</a>","chicago":"Hansmeier, Tim, Mathis Brede, and Marco Platzner. “XCS on Embedded Systems: An Analysis of Execution Profiles and Accelerated Classifier Deletion.” In <i>GECCO ’22: Proceedings of the Genetic and Evolutionary Computation Conference Companion</i>, 2071–79. New York, NY, United States: Association for Computing Machinery (ACM), 2022. <a href=\"https://doi.org/10.1145/3520304.3533977\">https://doi.org/10.1145/3520304.3533977</a>.","ieee":"T. Hansmeier, M. Brede, and M. Platzner, “XCS on Embedded Systems: An Analysis of Execution Profiles and Accelerated Classifier Deletion,” in <i>GECCO ’22: Proceedings of the Genetic and Evolutionary Computation Conference Companion</i>, Boston, MA, USA, 2022, pp. 2071–2079, doi: <a href=\"https://doi.org/10.1145/3520304.3533977\">10.1145/3520304.3533977</a>.","apa":"Hansmeier, T., Brede, M., &#38; Platzner, M. (2022). XCS on Embedded Systems: An Analysis of Execution Profiles and Accelerated Classifier Deletion. <i>GECCO ’22: Proceedings of the Genetic and Evolutionary Computation Conference Companion</i>, 2071–2079. <a href=\"https://doi.org/10.1145/3520304.3533977\">https://doi.org/10.1145/3520304.3533977</a>","mla":"Hansmeier, Tim, et al. “XCS on Embedded Systems: An Analysis of Execution Profiles and Accelerated Classifier Deletion.” <i>GECCO ’22: Proceedings of the Genetic and Evolutionary Computation Conference Companion</i>, Association for Computing Machinery (ACM), 2022, pp. 2071–79, doi:<a href=\"https://doi.org/10.1145/3520304.3533977\">10.1145/3520304.3533977</a>.","bibtex":"@inproceedings{Hansmeier_Brede_Platzner_2022, place={New York, NY, United States}, title={XCS on Embedded Systems: An Analysis of Execution Profiles and Accelerated Classifier Deletion}, DOI={<a href=\"https://doi.org/10.1145/3520304.3533977\">10.1145/3520304.3533977</a>}, booktitle={GECCO ’22: Proceedings of the Genetic and Evolutionary Computation Conference Companion}, publisher={Association for Computing Machinery (ACM)}, author={Hansmeier, Tim and Brede, Mathis and Platzner, Marco}, year={2022}, pages={2071–2079} }","short":"T. Hansmeier, M. Brede, M. Platzner, in: GECCO ’22: Proceedings of the Genetic and Evolutionary Computation Conference Companion, Association for Computing Machinery (ACM), New York, NY, United States, 2022, pp. 2071–2079."},"publisher":"Association for Computing Machinery (ACM)","date_updated":"2022-11-18T10:13:22Z","author":[{"first_name":"Tim","orcid":"0000-0003-1377-3339","last_name":"Hansmeier","id":"49992","full_name":"Hansmeier, Tim"},{"first_name":"Mathis","last_name":"Brede","full_name":"Brede, Mathis"},{"full_name":"Platzner, Marco","id":"398","last_name":"Platzner","first_name":"Marco"}],"date_created":"2022-09-02T11:47:17Z","title":"XCS on Embedded Systems: An Analysis of Execution Profiles and Accelerated Classifier Deletion","doi":"10.1145/3520304.3533977","conference":{"location":"Boston, MA, USA","end_date":"2022-07-13","start_date":"2022-07-09","name":"International Workshop on Learning Classifier Systems (IWLCS 2022)"},"publication":"GECCO '22: Proceedings of the Genetic and Evolutionary Computation Conference Companion","type":"conference","status":"public","_id":"33253","project":[{"_id":"1","name":"SFB 901: SFB 901"},{"name":"SFB 901 - C2: SFB 901 - Subproject C2","_id":"14"},{"_id":"4","name":"SFB 901 - C: SFB 901 - Project Area C"}],"department":[{"_id":"78"}],"user_id":"477","language":[{"iso":"eng"}]},{"status":"public","type":"conference","publication":"Proceedings of the 9th Workshop on Argument Mining (ArgMining 2022)","language":[{"iso":"eng"}],"user_id":"477","department":[{"_id":"600"}],"project":[{"name":"SFB 901 - B1: SFB 901 - Subproject B1","_id":"9"},{"name":"SFB 901: SFB 901","_id":"1"},{"name":"SFB 901 - B: SFB 901 - Project Area B","_id":"3"}],"_id":"33274","citation":{"short":"W.-F. Chen, M.-H. Chen, G. Mudgal, H. Wachsmuth, in: Proceedings of the 9th Workshop on Argument Mining (ArgMining 2022), 2022, pp. 51–61.","mla":"Chen, Wei-Fan, et al. “Analyzing Culture-Specific Argument Structures in Learner Essays.” <i>Proceedings of the 9th Workshop on Argument Mining (ArgMining 2022)</i>, 2022, pp. 51–61.","bibtex":"@inproceedings{Chen_Chen_Mudgal_Wachsmuth_2022, title={Analyzing Culture-Specific Argument Structures in Learner Essays}, booktitle={Proceedings of the 9th Workshop on Argument Mining (ArgMining 2022)}, author={Chen, Wei-Fan and Chen, Mei-Hua and Mudgal, Garima and Wachsmuth, Henning}, year={2022}, pages={51–61} }","apa":"Chen, W.-F., Chen, M.-H., Mudgal, G., &#38; Wachsmuth, H. (2022). Analyzing Culture-Specific Argument Structures in Learner Essays. <i>Proceedings of the 9th Workshop on Argument Mining (ArgMining 2022)</i>, 51–61.","chicago":"Chen, Wei-Fan, Mei-Hua Chen, Garima Mudgal, and Henning Wachsmuth. “Analyzing Culture-Specific Argument Structures in Learner Essays.” In <i>Proceedings of the 9th Workshop on Argument Mining (ArgMining 2022)</i>, 51–61, 2022.","ieee":"W.-F. Chen, M.-H. Chen, G. Mudgal, and H. Wachsmuth, “Analyzing Culture-Specific Argument Structures in Learner Essays,” in <i>Proceedings of the 9th Workshop on Argument Mining (ArgMining 2022)</i>, 2022, pp. 51–61.","ama":"Chen W-F, Chen M-H, Mudgal G, Wachsmuth H. Analyzing Culture-Specific Argument Structures in Learner Essays. In: <i>Proceedings of the 9th Workshop on Argument Mining (ArgMining 2022)</i>. ; 2022:51-61."},"page":"51 - 61","year":"2022","title":"Analyzing Culture-Specific Argument Structures in Learner Essays","author":[{"first_name":"Wei-Fan","last_name":"Chen","full_name":"Chen, Wei-Fan","id":"82920"},{"first_name":"Mei-Hua","last_name":"Chen","full_name":"Chen, Mei-Hua"},{"first_name":"Garima","last_name":"Mudgal","full_name":"Mudgal, Garima"},{"last_name":"Wachsmuth","full_name":"Wachsmuth, Henning","id":"3900","first_name":"Henning"}],"date_created":"2022-09-06T13:51:23Z","date_updated":"2022-11-18T09:56:17Z"},{"author":[{"last_name":"Maack","full_name":"Maack, Marten","id":"88252","first_name":"Marten"},{"full_name":"Pukrop, Simon","id":"44428","last_name":"Pukrop","first_name":"Simon"},{"last_name":"Rasmussen","full_name":"Rasmussen, Anna Rodriguez","first_name":"Anna Rodriguez"}],"date_created":"2022-09-27T13:06:05Z","volume":244,"date_updated":"2022-11-18T10:14:14Z","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","doi":"10.4230/LIPIcs.ESA.2022.77","title":"(In-)Approximability Results for Interval, Resource Restricted, and Low Rank Scheduling","citation":{"ama":"Maack M, Pukrop S, Rasmussen AR. (In-)Approximability Results for Interval, Resource Restricted, and Low Rank Scheduling. In: Chechik S, Navarro G, Rotenberg E, Herman G, eds. <i>30th Annual European Symposium on Algorithms, ESA 2022, September 5-9, 2022, Berlin/Potsdam, Germany</i>. Vol 244. LIPIcs. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2022:77:1–77:13. doi:<a href=\"https://doi.org/10.4230/LIPIcs.ESA.2022.77\">10.4230/LIPIcs.ESA.2022.77</a>","ieee":"M. Maack, S. Pukrop, and A. R. Rasmussen, “(In-)Approximability Results for Interval, Resource Restricted, and Low Rank Scheduling,” in <i>30th Annual European Symposium on Algorithms, ESA 2022, September 5-9, 2022, Berlin/Potsdam, Germany</i>, 2022, vol. 244, p. 77:1–77:13, doi: <a href=\"https://doi.org/10.4230/LIPIcs.ESA.2022.77\">10.4230/LIPIcs.ESA.2022.77</a>.","chicago":"Maack, Marten, Simon Pukrop, and Anna Rodriguez Rasmussen. “(In-)Approximability Results for Interval, Resource Restricted, and Low Rank Scheduling.” In <i>30th Annual European Symposium on Algorithms, ESA 2022, September 5-9, 2022, Berlin/Potsdam, Germany</i>, edited by Shiri Chechik, Gonzalo Navarro, Eva Rotenberg, and Grzegorz Herman, 244:77:1–77:13. LIPIcs. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022. <a href=\"https://doi.org/10.4230/LIPIcs.ESA.2022.77\">https://doi.org/10.4230/LIPIcs.ESA.2022.77</a>.","apa":"Maack, M., Pukrop, S., &#38; Rasmussen, A. R. (2022). (In-)Approximability Results for Interval, Resource Restricted, and Low Rank Scheduling. In S. Chechik, G. Navarro, E. Rotenberg, &#38; G. Herman (Eds.), <i>30th Annual European Symposium on Algorithms, ESA 2022, September 5-9, 2022, Berlin/Potsdam, Germany</i> (Vol. 244, p. 77:1–77:13). Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.ESA.2022.77\">https://doi.org/10.4230/LIPIcs.ESA.2022.77</a>","bibtex":"@inproceedings{Maack_Pukrop_Rasmussen_2022, series={LIPIcs}, title={(In-)Approximability Results for Interval, Resource Restricted, and Low Rank Scheduling}, volume={244}, DOI={<a href=\"https://doi.org/10.4230/LIPIcs.ESA.2022.77\">10.4230/LIPIcs.ESA.2022.77</a>}, booktitle={30th Annual European Symposium on Algorithms, ESA 2022, September 5-9, 2022, Berlin/Potsdam, Germany}, publisher={Schloss Dagstuhl - Leibniz-Zentrum für Informatik}, author={Maack, Marten and Pukrop, Simon and Rasmussen, Anna Rodriguez}, editor={Chechik, Shiri and Navarro, Gonzalo and Rotenberg, Eva and Herman, Grzegorz}, year={2022}, pages={77:1–77:13}, collection={LIPIcs} }","short":"M. Maack, S. Pukrop, A.R. Rasmussen, in: S. Chechik, G. Navarro, E. Rotenberg, G. Herman (Eds.), 30th Annual European Symposium on Algorithms, ESA 2022, September 5-9, 2022, Berlin/Potsdam, Germany, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022, p. 77:1–77:13.","mla":"Maack, Marten, et al. “(In-)Approximability Results for Interval, Resource Restricted, and Low Rank Scheduling.” <i>30th Annual European Symposium on Algorithms, ESA 2022, September 5-9, 2022, Berlin/Potsdam, Germany</i>, edited by Shiri Chechik et al., vol. 244, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022, p. 77:1–77:13, doi:<a href=\"https://doi.org/10.4230/LIPIcs.ESA.2022.77\">10.4230/LIPIcs.ESA.2022.77</a>."},"intvolume":"       244","page":"77:1–77:13","year":"2022","user_id":"477","series_title":"LIPIcs","department":[{"_id":"63"}],"project":[{"name":"SFB 901: SFB 901","_id":"1"},{"_id":"16","name":"SFB 901 - C4: SFB 901 - Subproject C4"},{"name":"SFB 901 - C: SFB 901 - Project Area C","_id":"4"}],"_id":"33491","language":[{"iso":"eng"}],"type":"conference","publication":"30th Annual European Symposium on Algorithms, ESA 2022, September 5-9, 2022, Berlin/Potsdam, Germany","status":"public","editor":[{"last_name":"Chechik","full_name":"Chechik, Shiri","first_name":"Shiri"},{"last_name":"Navarro","full_name":"Navarro, Gonzalo","first_name":"Gonzalo"},{"first_name":"Eva","full_name":"Rotenberg, Eva","last_name":"Rotenberg"},{"first_name":"Grzegorz","full_name":"Herman, Grzegorz","last_name":"Herman"}]},{"project":[{"name":"SFB 901: SFB 901","_id":"1"},{"_id":"4","name":"SFB 901 - C: SFB 901 - Project Area C"},{"name":"SFB 901 - C2: SFB 901 - Subproject C2","_id":"14"}],"_id":"29769","user_id":"477","department":[{"_id":"78"}],"type":"dissertation","status":"public","oa":"1","date_updated":"2022-11-30T13:39:01Z","author":[{"id":"72764","full_name":"Ahmed, Qazi Arbab","orcid":"0000-0002-1837-2254","last_name":"Ahmed","first_name":"Qazi Arbab"}],"supervisor":[{"first_name":"Marco","id":"398","full_name":"Platzner, Marco","last_name":"Platzner"}],"main_file_link":[{"url":"\turn:nbn:de:hbz:466:2-40303","open_access":"1"}],"doi":"10.17619/UNIPB/1-1271","publication_status":"published","has_accepted_license":"1","place":"Paderborn","citation":{"apa":"Ahmed, Q. A. (2022). <i>Hardware Trojans in Reconfigurable Computing</i>.  Paderborn University, Paderborn, Germany. <a href=\"https://doi.org/10.17619/UNIPB/1-1271\">https://doi.org/10.17619/UNIPB/1-1271</a>","short":"Q.A. Ahmed, Hardware Trojans in Reconfigurable Computing,  Paderborn University, Paderborn, Germany, Paderborn, 2022.","bibtex":"@book{Ahmed_2022, place={Paderborn}, title={Hardware Trojans in Reconfigurable Computing}, DOI={<a href=\"https://doi.org/10.17619/UNIPB/1-1271\">10.17619/UNIPB/1-1271</a>}, publisher={ Paderborn University, Paderborn, Germany}, author={Ahmed, Qazi Arbab}, year={2022} }","mla":"Ahmed, Qazi Arbab. <i>Hardware Trojans in Reconfigurable Computing</i>.  Paderborn University, Paderborn, Germany, 2022, doi:<a href=\"https://doi.org/10.17619/UNIPB/1-1271\">10.17619/UNIPB/1-1271</a>.","ama":"Ahmed QA. <i>Hardware Trojans in Reconfigurable Computing</i>.  Paderborn University, Paderborn, Germany; 2022. doi:<a href=\"https://doi.org/10.17619/UNIPB/1-1271\">10.17619/UNIPB/1-1271</a>","chicago":"Ahmed, Qazi Arbab. <i>Hardware Trojans in Reconfigurable Computing</i>. Paderborn:  Paderborn University, Paderborn, Germany, 2022. <a href=\"https://doi.org/10.17619/UNIPB/1-1271\">https://doi.org/10.17619/UNIPB/1-1271</a>.","ieee":"Q. A. Ahmed, <i>Hardware Trojans in Reconfigurable Computing</i>. Paderborn:  Paderborn University, Paderborn, Germany, 2022."},"ddc":["004"],"keyword":["FPGA Security","Hardware Trojans","Bitstream-level Trojans","Bitstream Verification"],"language":[{"iso":"eng"}],"abstract":[{"text":"Wettstreit zwischen der Entwicklung neuer Hardwaretrojaner und entsprechender Gegenmaßnahmen beschreiten Widersacher immer raffiniertere Wege um Schaltungsentwürfe zu infizieren und dabei selbst fortgeschrittene Test- und Verifikationsmethoden zu überlisten. Abgesehen von den konventionellen Methoden um einen Trojaner in eine Schaltung für ein Field-programmable Gate Array (FPGA) einzuschleusen, können auch die Entwurfswerkzeuge heimlich kompromittiert werden um einen Angreifer dabei zu unterstützen einen erfolgreichen Angriff durchzuführen, der zum Beispiel Fehlfunktionen oder ungewollte Informationsabflüsse bewirken kann. Diese Dissertation beschäftigt sich hauptsächlich mit den beiden Blickwinkeln auf Hardwaretrojaner in rekonfigurierbaren Systemen, einerseits der Perspektive des Verteidigers mit einer Methode zur Erkennung von Trojanern auf der Bitstromebene, und andererseits derjenigen des Angreifers mit einer neuartigen Angriffsmethode für FPGA Trojaner. Für die Verteidigung gegen den Trojaner ``Heimtückische LUT'' stellen wir die allererste erfolgreiche Gegenmaßnahme vor, die durch Verifikation mittels Proof-carrying Hardware (PCH) auf der Bitstromebene direkt vor der Konfiguration der Hardware angewendet werden kann, und präsentieren ein vollständiges Schema für den Entwurf und die Verifikation von Schaltungen für iCE40 FPGAs. Für die Gegenseite führen wir einen neuen Angriff ein, welcher bösartiges Routing im eingefügten Trojaner ausnutzt um selbst im fertigen Bitstrom in einem inaktiven Zustand zu verbleiben: Hierdurch kann dieser neuartige Angriff zur Zeit weder von herkömmlichen Test- und Verifikationsmethoden, noch von unserer vorher vorgestellten Verifikation auf der Bitstromebene entdeckt werden.","lang":"eng"},{"lang":"eng","text":"The battle of developing hardware Trojans and corresponding countermeasures has taken adversaries towards ingenious ways of compromising hardware designs by circumventing even advanced testing and verification methods. Besides conventional methods of inserting Trojans into a design by a malicious entity, the design flow for field-programmable gate arrays (FPGAs) can also be surreptitiously compromised to assist the attacker to perform a successful malfunctioning or information leakage attack. This thesis mainly focuses on the two aspects of hardware Trojans in reconfigurable systems, the defenders perspective which corresponds to the bitstream-level Trojan detection technique, and the attackers perspective which corresponds to a novel FPGA Trojan attack. From the defender's perspective, we introduce a first-ever successful pre-configuration countermeasure against the ``Malicious LUT''-hardware Trojan, by employing bitstream-level Proof-Carrying Hardware (PCH) and present the complete design-and-verification flow for iCE40 FPGAs. Likewise, from an attackers perspective, we present a novel attack that leverages malicious routing of the inserted Trojan circuit to acquire a dormant state even in the generated and transmitted bitstream. Since the Trojan is injected in a post-synthesis step and remains unconnected in the bitstream, the presented attack can currently neither be prevented by conventional testing and verification methods nor by bitstream-level verification techniques."}],"publisher":" Paderborn University, Paderborn, Germany","date_created":"2022-02-07T14:02:36Z","title":"Hardware Trojans in Reconfigurable Computing","year":"2022"},{"status":"public","abstract":[{"text":"<jats:title>Abstract</jats:title><jats:p>Comprehensive data understanding is a key success driver for data analytics projects. Knowing the characteristics of the data helps a lot in selecting the appropriate data analysis techniques. Especially in data-driven product planning, knowledge about the data is a necessary prerequisite because data of the use phase is very heterogeneous. However, companies often do not have the necessary know-how or time to build up solid data understanding in connection with data analysis. In this paper, we develop a methodology to organize and categorize and thus understand use phase data in a way that makes it accessible to general data analytics workflows, following a design science research approach. We first present a knowledge base that lists typical use phase data from a product planning view. Second, we develop a taxonomy based on standard literature and real data objects, which covers the diversity of the data considered. The taxonomy provides 8 dimensions that support classification of use phase data and allows to capture data characteristics from a data analytics view. Finally, we combine both views by clustering the objects of the knowledge base according to the taxonomy. Each of the resulting clusters covers a typical combination of analytics relevant characteristics occurring in practice. By abstracting from the diversity of use phase data into artifacts with manageable complexity, our approach provides guidance to choose appropriate data analysis and AI techniques.</jats:p>","lang":"eng"}],"type":"journal_article","publication":"Journal of the Knowledge Economy","language":[{"iso":"eng"}],"keyword":["Economics and Econometrics"],"user_id":"15782","department":[{"_id":"563"}],"_id":"34197","citation":{"bibtex":"@article{Panzner_von Enzberg_Meyer_Dumitrescu_2022, title={Characterization of Usage Data with the Help of Data Classifications}, DOI={<a href=\"https://doi.org/10.1007/s13132-022-01081-z\">10.1007/s13132-022-01081-z</a>}, journal={Journal of the Knowledge Economy}, publisher={Springer Science and Business Media LLC}, author={Panzner, Melina and von Enzberg, Sebastian and Meyer, Maurice and Dumitrescu, Roman}, year={2022} }","mla":"Panzner, Melina, et al. “Characterization of Usage Data with the Help of Data Classifications.” <i>Journal of the Knowledge Economy</i>, Springer Science and Business Media LLC, 2022, doi:<a href=\"https://doi.org/10.1007/s13132-022-01081-z\">10.1007/s13132-022-01081-z</a>.","short":"M. Panzner, S. von Enzberg, M. Meyer, R. Dumitrescu, Journal of the Knowledge Economy (2022).","apa":"Panzner, M., von Enzberg, S., Meyer, M., &#38; Dumitrescu, R. (2022). Characterization of Usage Data with the Help of Data Classifications. <i>Journal of the Knowledge Economy</i>. <a href=\"https://doi.org/10.1007/s13132-022-01081-z\">https://doi.org/10.1007/s13132-022-01081-z</a>","ama":"Panzner M, von Enzberg S, Meyer M, Dumitrescu R. Characterization of Usage Data with the Help of Data Classifications. <i>Journal of the Knowledge Economy</i>. Published online 2022. doi:<a href=\"https://doi.org/10.1007/s13132-022-01081-z\">10.1007/s13132-022-01081-z</a>","chicago":"Panzner, Melina, Sebastian von Enzberg, Maurice Meyer, and Roman Dumitrescu. “Characterization of Usage Data with the Help of Data Classifications.” <i>Journal of the Knowledge Economy</i>, 2022. <a href=\"https://doi.org/10.1007/s13132-022-01081-z\">https://doi.org/10.1007/s13132-022-01081-z</a>.","ieee":"M. Panzner, S. von Enzberg, M. Meyer, and R. Dumitrescu, “Characterization of Usage Data with the Help of Data Classifications,” <i>Journal of the Knowledge Economy</i>, 2022, doi: <a href=\"https://doi.org/10.1007/s13132-022-01081-z\">10.1007/s13132-022-01081-z</a>."},"year":"2022","publication_status":"published","publication_identifier":{"issn":["1868-7865","1868-7873"]},"doi":"10.1007/s13132-022-01081-z","title":"Characterization of Usage Data with the Help of Data Classifications","author":[{"last_name":"Panzner","full_name":"Panzner, Melina","first_name":"Melina"},{"last_name":"von Enzberg","full_name":"von Enzberg, Sebastian","first_name":"Sebastian"},{"first_name":"Maurice","last_name":"Meyer","full_name":"Meyer, Maurice"},{"last_name":"Dumitrescu","full_name":"Dumitrescu, Roman","first_name":"Roman"}],"date_created":"2022-12-05T12:49:56Z","publisher":"Springer Science and Business Media LLC","date_updated":"2022-12-05T12:51:03Z"},{"language":[{"iso":"eng"}],"keyword":["General Medicine"],"abstract":[{"text":"<jats:p>Mounting sensors in disk stack separators is often a major challenge due to the operating conditions. However, a process cannot be optimally monitored without sensors. Virtual sensors can be a solution to calculate the sought parameters from measurable values. We measured the vibrations of disk stack separators and applied machine learning (ML) to detect whether the separator contains only water or whether particles are also present. We combined seven ML classification algorithms with three feature engineering strategies and evaluated our model successfully on vibration data of an experimental disk stack separator. Our experimental results demonstrate that random forest in combination with manual feature engineering using domain specific knowledge about suitable features outperforms all other models with an accuracy of 91.27 %.</jats:p>","lang":"eng"}],"publication":"Vibroengineering PROCEDIA","title":"Using vibration data to classify conditions in disk stack separators","date_created":"2022-12-05T12:47:22Z","publisher":"JVE International Ltd.","year":"2022","department":[{"_id":"563"}],"user_id":"15782","_id":"34196","status":"public","type":"journal_article","doi":"10.21595/vp.2022.23000","volume":46,"author":[{"first_name":"Silke","last_name":"Merkelbach","full_name":"Merkelbach, Silke"},{"first_name":"Lameya","full_name":"Afroze, Lameya","last_name":"Afroze"},{"last_name":"Janssen","full_name":"Janssen, Nils","first_name":"Nils"},{"first_name":"Sebastian","full_name":"von Enzberg, Sebastian","last_name":"von Enzberg"},{"first_name":"Arno","full_name":"Kühn, Arno","last_name":"Kühn"},{"first_name":"Roman","last_name":"Dumitrescu","full_name":"Dumitrescu, Roman"}],"date_updated":"2022-12-05T12:51:08Z","page":"21-26","intvolume":"        46","citation":{"apa":"Merkelbach, S., Afroze, L., Janssen, N., von Enzberg, S., Kühn, A., &#38; Dumitrescu, R. (2022). Using vibration data to classify conditions in disk stack separators. <i>Vibroengineering PROCEDIA</i>, <i>46</i>, 21–26. <a href=\"https://doi.org/10.21595/vp.2022.23000\">https://doi.org/10.21595/vp.2022.23000</a>","short":"S. Merkelbach, L. Afroze, N. Janssen, S. von Enzberg, A. Kühn, R. Dumitrescu, Vibroengineering PROCEDIA 46 (2022) 21–26.","bibtex":"@article{Merkelbach_Afroze_Janssen_von Enzberg_Kühn_Dumitrescu_2022, title={Using vibration data to classify conditions in disk stack separators}, volume={46}, DOI={<a href=\"https://doi.org/10.21595/vp.2022.23000\">10.21595/vp.2022.23000</a>}, journal={Vibroengineering PROCEDIA}, publisher={JVE International Ltd.}, author={Merkelbach, Silke and Afroze, Lameya and Janssen, Nils and von Enzberg, Sebastian and Kühn, Arno and Dumitrescu, Roman}, year={2022}, pages={21–26} }","mla":"Merkelbach, Silke, et al. “Using Vibration Data to Classify Conditions in Disk Stack Separators.” <i>Vibroengineering PROCEDIA</i>, vol. 46, JVE International Ltd., 2022, pp. 21–26, doi:<a href=\"https://doi.org/10.21595/vp.2022.23000\">10.21595/vp.2022.23000</a>.","ama":"Merkelbach S, Afroze L, Janssen N, von Enzberg S, Kühn A, Dumitrescu R. Using vibration data to classify conditions in disk stack separators. <i>Vibroengineering PROCEDIA</i>. 2022;46:21-26. doi:<a href=\"https://doi.org/10.21595/vp.2022.23000\">10.21595/vp.2022.23000</a>","ieee":"S. Merkelbach, L. Afroze, N. Janssen, S. von Enzberg, A. Kühn, and R. Dumitrescu, “Using vibration data to classify conditions in disk stack separators,” <i>Vibroengineering PROCEDIA</i>, vol. 46, pp. 21–26, 2022, doi: <a href=\"https://doi.org/10.21595/vp.2022.23000\">10.21595/vp.2022.23000</a>.","chicago":"Merkelbach, Silke, Lameya Afroze, Nils Janssen, Sebastian von Enzberg, Arno Kühn, and Roman Dumitrescu. “Using Vibration Data to Classify Conditions in Disk Stack Separators.” <i>Vibroengineering PROCEDIA</i> 46 (2022): 21–26. <a href=\"https://doi.org/10.21595/vp.2022.23000\">https://doi.org/10.21595/vp.2022.23000</a>."},"publication_identifier":{"issn":["2345-0533","2538-8479"]},"publication_status":"published"}]