[{"_id":"21238","publisher":"Gesellschaft für Informatik e.V.","language":[{"iso":"eng"}],"page":" 83-84 ","editor":[{"full_name":"Koziolek, Anne","last_name":"Koziolek","first_name":"Anne"},{"full_name":"Schaefer, Ina","first_name":"Ina","last_name":"Schaefer"},{"first_name":"Christoph","last_name":"Seidl","full_name":"Seidl, Christoph"}],"doi":"10.18420/SE2021_30 ","user_id":"22398","author":[{"id":"22398","first_name":"Felix","last_name":"Pauck","full_name":"Pauck, Felix"},{"id":"573","full_name":"Wehrheim, Heike","last_name":"Wehrheim","first_name":"Heike"}],"status":"public","title":"Cooperative Android App Analysis with CoDiDroid","year":"2021","date_updated":"2023-01-18T08:35:20Z","publication_status":"published","place":"Bonn","date_created":"2021-02-16T09:28:49Z","department":[{"_id":"77"}],"type":"conference","citation":{"apa":"Pauck, F., &#38; Wehrheim, H. (2021). Cooperative Android App Analysis with CoDiDroid. In A. Koziolek, I. Schaefer, &#38; C. Seidl (Eds.), <i>Software Engineering 2021</i> (pp. 83–84). Gesellschaft für Informatik e.V. <a href=\"https://doi.org/10.18420/SE2021_30 \">https://doi.org/10.18420/SE2021_30 </a>","ieee":"F. Pauck and H. Wehrheim, “Cooperative Android App Analysis with CoDiDroid,” in <i>Software Engineering 2021</i>, 2021, pp. 83–84, doi: <a href=\"https://doi.org/10.18420/SE2021_30 \">10.18420/SE2021_30 </a>.","short":"F. Pauck, H. Wehrheim, in: A. Koziolek, I. Schaefer, C. Seidl (Eds.), Software Engineering 2021, Gesellschaft für Informatik e.V., Bonn, 2021, pp. 83–84.","chicago":"Pauck, Felix, and Heike Wehrheim. “Cooperative Android App Analysis with CoDiDroid.” In <i>Software Engineering 2021</i>, edited by Anne Koziolek, Ina Schaefer, and Christoph Seidl, 83–84. Bonn: Gesellschaft für Informatik e.V., 2021. <a href=\"https://doi.org/10.18420/SE2021_30 \">https://doi.org/10.18420/SE2021_30 </a>.","mla":"Pauck, Felix, and Heike Wehrheim. “Cooperative Android App Analysis with CoDiDroid.” <i>Software Engineering 2021</i>, edited by Anne Koziolek et al., Gesellschaft für Informatik e.V., 2021, pp. 83–84, doi:<a href=\"https://doi.org/10.18420/SE2021_30 \">10.18420/SE2021_30 </a>.","ama":"Pauck F, Wehrheim H. Cooperative Android App Analysis with CoDiDroid. In: Koziolek A, Schaefer I, Seidl C, eds. <i>Software Engineering 2021</i>. Gesellschaft für Informatik e.V.; 2021:83-84. doi:<a href=\"https://doi.org/10.18420/SE2021_30 \">10.18420/SE2021_30 </a>","bibtex":"@inproceedings{Pauck_Wehrheim_2021, place={Bonn}, title={Cooperative Android App Analysis with CoDiDroid}, DOI={<a href=\"https://doi.org/10.18420/SE2021_30 \">10.18420/SE2021_30 </a>}, booktitle={Software Engineering 2021}, publisher={Gesellschaft für Informatik e.V.}, author={Pauck, Felix and Wehrheim, Heike}, editor={Koziolek, Anne and Schaefer, Ina and Seidl, Christoph}, year={2021}, pages={83–84} }"},"publication":"Software Engineering 2021","project":[{"name":"SFB 901","_id":"1"},{"_id":"3","name":"SFB 901 - Project Area B"},{"name":"SFB 901 - Subproject B4","_id":"12"}]},{"project":[{"_id":"3","name":"SFB 901 - B: SFB 901 - Project Area B"},{"_id":"12","name":"SFB 901 - B4: SFB 901 - Subproject B4"},{"_id":"1","name":"SFB 901: SFB 901"}],"publication":"2021 IFIP/IEEE 29th International Conference on Very Large Scale Integration (VLSI-SoC)","citation":{"chicago":"Ahmed, Qazi Arbab. “Hardware Trojans in Reconfigurable Computing.” In <i>2021 IFIP/IEEE 29th International Conference on Very Large Scale Integration (VLSI-SoC)</i>, 2021. <a href=\"https://doi.org/10.1109/vlsi-soc53125.2021.9606974\">https://doi.org/10.1109/vlsi-soc53125.2021.9606974</a>.","short":"Q.A. Ahmed, in: 2021 IFIP/IEEE 29th International Conference on Very Large Scale Integration (VLSI-SoC), 2021.","apa":"Ahmed, Q. A. (2021). Hardware Trojans in Reconfigurable Computing. <i>2021 IFIP/IEEE 29th International Conference on Very Large Scale Integration (VLSI-SoC)</i>. <a href=\"https://doi.org/10.1109/vlsi-soc53125.2021.9606974\">https://doi.org/10.1109/vlsi-soc53125.2021.9606974</a>","ieee":"Q. A. Ahmed, “Hardware Trojans in Reconfigurable Computing,” 2021, doi: <a href=\"https://doi.org/10.1109/vlsi-soc53125.2021.9606974\">10.1109/vlsi-soc53125.2021.9606974</a>.","ama":"Ahmed QA. Hardware Trojans in Reconfigurable Computing. In: <i>2021 IFIP/IEEE 29th International Conference on Very Large Scale Integration (VLSI-SoC)</i>. ; 2021. doi:<a href=\"https://doi.org/10.1109/vlsi-soc53125.2021.9606974\">10.1109/vlsi-soc53125.2021.9606974</a>","bibtex":"@inproceedings{Ahmed_2021, title={Hardware Trojans in Reconfigurable Computing}, DOI={<a href=\"https://doi.org/10.1109/vlsi-soc53125.2021.9606974\">10.1109/vlsi-soc53125.2021.9606974</a>}, booktitle={2021 IFIP/IEEE 29th International Conference on Very Large Scale Integration (VLSI-SoC)}, author={Ahmed, Qazi Arbab}, year={2021} }","mla":"Ahmed, Qazi Arbab. “Hardware Trojans in Reconfigurable Computing.” <i>2021 IFIP/IEEE 29th International Conference on Very Large Scale Integration (VLSI-SoC)</i>, 2021, doi:<a href=\"https://doi.org/10.1109/vlsi-soc53125.2021.9606974\">10.1109/vlsi-soc53125.2021.9606974</a>."},"type":"conference","department":[{"_id":"78"}],"date_created":"2021-12-30T00:02:24Z","date_updated":"2023-04-19T15:03:45Z","publication_status":"published","status":"public","title":"Hardware Trojans in Reconfigurable Computing","year":"2021","author":[{"id":"72764","full_name":"Ahmed, Qazi Arbab","first_name":"Qazi Arbab","orcid":"0000-0002-1837-2254","last_name":"Ahmed"}],"doi":"10.1109/vlsi-soc53125.2021.9606974","user_id":"72764","_id":"29138","language":[{"iso":"eng"}]},{"has_accepted_license":"1","status":"public","conference":{"end_date":"2021-02-05","name":"Design, Automation and Test in Europe Conference (DATE'21)","start_date":"2021-02-01","location":"Alpexpo | Grenoble, France"},"ddc":["006"],"user_id":"72764","_id":"20681","publisher":"2021 Design, Automation and Test in Europe Conference (DATE)","project":[{"name":"SFB 901 - Subproject B4","_id":"12"},{"_id":"3","name":"SFB 901 - Project Area B"},{"_id":"1","name":"SFB 901"}],"file_date_updated":"2023-05-11T09:16:15Z","citation":{"bibtex":"@inproceedings{Ahmed_Wiersema_Platzner_2021, place={Alpexpo | Grenoble, France}, title={Malicious Routing: Circumventing Bitstream-level Verification for FPGAs}, DOI={<a href=\"https://doi.org/10.23919/DATE51398.2021.9474026\">10.23919/DATE51398.2021.9474026</a>}, booktitle={2021 Design, Automation &#38; Test in Europe Conference &#38; Exhibition (DATE)}, publisher={2021 Design, Automation and Test in Europe Conference (DATE)}, author={Ahmed, Qazi Arbab and Wiersema, Tobias and Platzner, Marco}, year={2021} }","ama":"Ahmed QA, Wiersema T, Platzner M. Malicious Routing: Circumventing Bitstream-level Verification for FPGAs. In: <i>2021 Design, Automation &#38; Test in Europe Conference &#38; Exhibition (DATE)</i>. 2021 Design, Automation and Test in Europe Conference (DATE); 2021. doi:<a href=\"https://doi.org/10.23919/DATE51398.2021.9474026\">10.23919/DATE51398.2021.9474026</a>","mla":"Ahmed, Qazi Arbab, et al. “Malicious Routing: Circumventing Bitstream-Level Verification for FPGAs.” <i>2021 Design, Automation &#38; Test in Europe Conference &#38; Exhibition (DATE)</i>, 2021 Design, Automation and Test in Europe Conference (DATE), 2021, doi:<a href=\"https://doi.org/10.23919/DATE51398.2021.9474026\">10.23919/DATE51398.2021.9474026</a>.","short":"Q.A. Ahmed, T. Wiersema, M. Platzner, in: 2021 Design, Automation &#38; Test in Europe Conference &#38; Exhibition (DATE), 2021 Design, Automation and Test in Europe Conference (DATE), Alpexpo | Grenoble, France, 2021.","chicago":"Ahmed, Qazi Arbab, Tobias Wiersema, and Marco Platzner. “Malicious Routing: Circumventing Bitstream-Level Verification for FPGAs.” In <i>2021 Design, Automation &#38; Test in Europe Conference &#38; Exhibition (DATE)</i>. Alpexpo | Grenoble, France: 2021 Design, Automation and Test in Europe Conference (DATE), 2021. <a href=\"https://doi.org/10.23919/DATE51398.2021.9474026\">https://doi.org/10.23919/DATE51398.2021.9474026</a>.","ieee":"Q. A. Ahmed, T. Wiersema, and M. Platzner, “Malicious Routing: Circumventing Bitstream-level Verification for FPGAs,” presented at the Design, Automation and Test in Europe Conference (DATE’21), Alpexpo | Grenoble, France, 2021, doi: <a href=\"https://doi.org/10.23919/DATE51398.2021.9474026\">10.23919/DATE51398.2021.9474026</a>.","apa":"Ahmed, Q. A., Wiersema, T., &#38; Platzner, M. (2021). Malicious Routing: Circumventing Bitstream-level Verification for FPGAs. <i>2021 Design, Automation &#38; Test in Europe Conference &#38; Exhibition (DATE)</i>. Design, Automation and Test in Europe Conference (DATE’21), Alpexpo | Grenoble, France. <a href=\"https://doi.org/10.23919/DATE51398.2021.9474026\">https://doi.org/10.23919/DATE51398.2021.9474026</a>"},"oa":"1","place":"Alpexpo | Grenoble, France","date_updated":"2023-05-11T09:16:34Z","publication_status":"published","year":"2021","title":"Malicious Routing: Circumventing Bitstream-level Verification for FPGAs","author":[{"full_name":"Ahmed, Qazi Arbab","last_name":"Ahmed","first_name":"Qazi Arbab","orcid":"0000-0002-1837-2254","id":"72764"},{"id":"3118","last_name":"Wiersema","first_name":"Tobias","full_name":"Wiersema, Tobias"},{"id":"398","full_name":"Platzner, Marco","first_name":"Marco","last_name":"Platzner"}],"publication_identifier":{"eisbn":["978-3-9819263-5-4"]},"doi":"10.23919/DATE51398.2021.9474026","main_file_link":[{"open_access":"1"}],"language":[{"iso":"eng"}],"abstract":[{"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. The advanced stealthy malicious look-up-table (LUT) attack activates a Trojan only when generating the FPGA bitstream and can thus not be detected by register transfer and gate level testing and verification. However, also this attack was recently revealed by a bitstream-level proof-carrying hardware (PCH) approach. In this paper, 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. The Trojan's payload is connected to primary inputs/outputs of the FPGA via a programmable interconnect point (PIP). The Trojan is detached from inputs/outputs during place-and-route and re-connected only when the FPGA is being programmed, thus activating the Trojan circuit without any need for a trigger logic. 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 recent bitstream-level verification techniques."}],"publication":"2021 Design, Automation & Test in Europe Conference & Exhibition (DATE)","type":"conference","department":[{"_id":"78"}],"file":[{"file_name":"1812.pdf","access_level":"closed","file_size":394011,"relation":"main_file","date_updated":"2023-05-11T09:16:15Z","file_id":"44752","content_type":"application/pdf","success":1,"creator":"qazi","date_created":"2023-05-11T09:16:15Z"}],"date_created":"2020-12-07T14:03:00Z"},{"_id":"26406","language":[{"iso":"eng"}],"user_id":"15249","title":"Into the Woods: Experiences from Building a Dataflow Analysis Framework for C/C++","year":"2021","status":"public","author":[{"id":"60543","first_name":"Philipp","last_name":"Schubert","orcid":"0000-0002-8674-1859","full_name":"Schubert, Philipp"},{"full_name":"Hermann, Ben","last_name":"Hermann","orcid":"0000-0001-9848-2017","first_name":"Ben","id":"66173"},{"full_name":"Bodden, Eric","first_name":"Eric","last_name":"Bodden","orcid":"0000-0003-3470-3647","id":"59256"},{"last_name":"Leer","first_name":"Richard","full_name":"Leer, Richard"}],"date_updated":"2023-06-15T08:39:55Z","date_created":"2021-10-18T12:52:12Z","type":"conference","department":[{"_id":"76"}],"publication":"SCAM '21: IEEE International Working Conference on Source Code Analysis and Manipulation (Engineering Track)","citation":{"apa":"Schubert, P., Hermann, B., Bodden, E., &#38; Leer, R. (2021). Into the Woods: Experiences from Building a Dataflow Analysis Framework for C/C++. <i>SCAM ’21: IEEE International Working Conference on Source Code Analysis and Manipulation (Engineering Track)</i>.","ieee":"P. Schubert, B. Hermann, E. Bodden, and R. Leer, “Into the Woods: Experiences from Building a Dataflow Analysis Framework for C/C++,” 2021.","chicago":"Schubert, Philipp, Ben Hermann, Eric Bodden, and Richard Leer. “Into the Woods: Experiences from Building a Dataflow Analysis Framework for C/C++.” In <i>SCAM ’21: IEEE International Working Conference on Source Code Analysis and Manipulation (Engineering Track)</i>, 2021.","short":"P. Schubert, B. Hermann, E. Bodden, R. Leer, in: SCAM ’21: IEEE International Working Conference on Source Code Analysis and Manipulation (Engineering Track), 2021.","mla":"Schubert, Philipp, et al. “Into the Woods: Experiences from Building a Dataflow Analysis Framework for C/C++.” <i>SCAM ’21: IEEE International Working Conference on Source Code Analysis and Manipulation (Engineering Track)</i>, 2021.","ama":"Schubert P, Hermann B, Bodden E, Leer R. Into the Woods: Experiences from Building a Dataflow Analysis Framework for C/C++. In: <i>SCAM ’21: IEEE International Working Conference on Source Code Analysis and Manipulation (Engineering Track)</i>. ; 2021.","bibtex":"@inproceedings{Schubert_Hermann_Bodden_Leer_2021, title={Into the Woods: Experiences from Building a Dataflow Analysis Framework for C/C++}, booktitle={SCAM ’21: IEEE International Working Conference on Source Code Analysis and Manipulation (Engineering Track)}, author={Schubert, Philipp and Hermann, Ben and Bodden, Eric and Leer, Richard}, year={2021} }"},"project":[{"name":"SFB 901 - B: SFB 901 - Project Area B","_id":"3"},{"_id":"12","name":"SFB 901 - B4: SFB 901 - Subproject B4"},{"name":"SFB 901: SFB 901: On-The-Fly Computing - Individualisierte IT-Dienstleistungen in dynamischen Märkten ","grant_number":"160364472","_id":"1"}]},{"date_created":"2023-06-27T12:54:30Z","department":[{"_id":"600"}],"type":"mastersthesis","citation":{"short":"J. Bülling, Political Speaker Transfer: Learning to Generate Text in the Styles of Barack Obama and Donald Trump, 2021.","chicago":"Bülling, Jonas. <i>Political Speaker Transfer: Learning to Generate Text in the Styles of Barack Obama and Donald Trump</i>, 2021.","ieee":"J. Bülling, <i>Political Speaker Transfer: Learning to Generate Text in the Styles of Barack Obama and Donald Trump</i>. 2021.","apa":"Bülling, J. (2021). <i>Political Speaker Transfer: Learning to Generate Text in the Styles of Barack Obama and Donald Trump</i>.","bibtex":"@book{Bülling_2021, title={Political Speaker Transfer: Learning to Generate Text in the Styles of Barack Obama and Donald Trump}, author={Bülling, Jonas}, year={2021} }","ama":"Bülling J. <i>Political Speaker Transfer: Learning to Generate Text in the Styles of Barack Obama and Donald Trump</i>.; 2021.","mla":"Bülling, Jonas. <i>Political Speaker Transfer: Learning to Generate Text in the Styles of Barack Obama and Donald Trump</i>. 2021."},"supervisor":[{"first_name":"Henning","last_name":"Wachsmuth","full_name":"Wachsmuth, Henning","id":"3900"}],"project":[{"grant_number":"160364472","_id":"9","name":"SFB 901 - B1: SFB 901 - Parametrisierte Servicespezifikation (Subproject B1)"},{"name":"SFB 901: SFB 901: On-The-Fly Computing - Individualisierte IT-Dienstleistungen in dynamischen Märkten ","grant_number":"160364472","_id":"1"},{"name":"SFB 901 - B: SFB 901 - Project Area B","_id":"3"}],"language":[{"iso":"eng"}],"_id":"45788","user_id":"477","author":[{"last_name":"Bülling","first_name":"Jonas","full_name":"Bülling, Jonas"}],"status":"public","title":"Political Speaker Transfer: Learning to Generate Text in the Styles of Barack Obama and Donald Trump","year":"2021","date_updated":"2023-07-05T07:32:18Z"},{"date_updated":"2023-07-05T07:32:50Z","author":[{"full_name":"Mishra, Avishek","last_name":"Mishra","first_name":"Avishek"}],"status":"public","year":"2021","title":"Computational Text Professionalization using Neural Sequence-to-Sequence Models","user_id":"477","language":[{"iso":"eng"}],"_id":"45787","project":[{"name":"SFB 901 - B1: SFB 901 - Parametrisierte Servicespezifikation (Subproject B1)","grant_number":"160364472","_id":"9"},{"_id":"1","grant_number":"160364472","name":"SFB 901: SFB 901: On-The-Fly Computing - Individualisierte IT-Dienstleistungen in dynamischen Märkten "},{"name":"SFB 901 - B: SFB 901 - Project Area B","_id":"3"}],"citation":{"apa":"Mishra, A. (2021). <i>Computational Text Professionalization using Neural Sequence-to-Sequence Models</i>.","ieee":"A. Mishra, <i>Computational Text Professionalization using Neural Sequence-to-Sequence Models</i>. 2021.","short":"A. Mishra, Computational Text Professionalization Using Neural Sequence-to-Sequence Models, 2021.","chicago":"Mishra, Avishek. <i>Computational Text Professionalization Using Neural Sequence-to-Sequence Models</i>, 2021.","mla":"Mishra, Avishek. <i>Computational Text Professionalization Using Neural Sequence-to-Sequence Models</i>. 2021.","ama":"Mishra A. <i>Computational Text Professionalization Using Neural Sequence-to-Sequence Models</i>.; 2021.","bibtex":"@book{Mishra_2021, title={Computational Text Professionalization using Neural Sequence-to-Sequence Models}, author={Mishra, Avishek}, year={2021} }"},"supervisor":[{"full_name":"Wachsmuth, Henning","first_name":"Henning","last_name":"Wachsmuth","id":"3900"}],"department":[{"_id":"600"}],"type":"mastersthesis","date_created":"2023-06-27T12:51:08Z"},{"publication":"Proceedings of the 16th Conference of the European Chapter of the Association for Computational Linguistics: Main Volume","citation":{"chicago":"Alshomary, Milad, Wei-Fan Chen, Timon Gurcke, and Henning Wachsmuth. “Belief-Based Generation of Argumentative Claims.” In <i>Proceedings of the 16th Conference of the European Chapter of the Association for Computational Linguistics: Main Volume</i>, 224–33. Association for Computational Linguistics, 2021. <a href=\"https://doi.org/10.18653/v1/2021.eacl-main.17\">https://doi.org/10.18653/v1/2021.eacl-main.17</a>.","short":"M. Alshomary, W.-F. Chen, T. Gurcke, H. Wachsmuth, in: Proceedings of the 16th Conference of the European Chapter of the Association for Computational Linguistics: Main Volume, Association for Computational Linguistics, 2021, pp. 224–233.","ieee":"M. Alshomary, W.-F. Chen, T. Gurcke, and H. Wachsmuth, “Belief-based Generation of Argumentative Claims,” in <i>Proceedings of the 16th Conference of the European Chapter of the Association for Computational Linguistics: Main Volume</i>, Online, 2021, pp. 224–233, doi: <a href=\"https://doi.org/10.18653/v1/2021.eacl-main.17\">10.18653/v1/2021.eacl-main.17</a>.","apa":"Alshomary, M., Chen, W.-F., Gurcke, T., &#38; Wachsmuth, H. (2021). Belief-based Generation of Argumentative Claims. <i>Proceedings of the 16th Conference of the European Chapter of the Association for Computational Linguistics: Main Volume</i>, 224–233. <a href=\"https://doi.org/10.18653/v1/2021.eacl-main.17\">https://doi.org/10.18653/v1/2021.eacl-main.17</a>","bibtex":"@inproceedings{Alshomary_Chen_Gurcke_Wachsmuth_2021, title={Belief-based Generation of Argumentative Claims}, DOI={<a href=\"https://doi.org/10.18653/v1/2021.eacl-main.17\">10.18653/v1/2021.eacl-main.17</a>}, booktitle={Proceedings of the 16th Conference of the European Chapter of the Association for Computational Linguistics: Main Volume}, publisher={Association for Computational Linguistics}, author={Alshomary, Milad and Chen, Wei-Fan and Gurcke, Timon and Wachsmuth, Henning}, year={2021}, pages={224–233} }","ama":"Alshomary M, Chen W-F, Gurcke T, Wachsmuth H. Belief-based Generation of Argumentative Claims. In: <i>Proceedings of the 16th Conference of the European Chapter of the Association for Computational Linguistics: Main Volume</i>. Association for Computational Linguistics; 2021:224-233. doi:<a href=\"https://doi.org/10.18653/v1/2021.eacl-main.17\">10.18653/v1/2021.eacl-main.17</a>","mla":"Alshomary, Milad, et al. “Belief-Based Generation of Argumentative Claims.” <i>Proceedings of the 16th Conference of the European Chapter of the Association for Computational Linguistics: Main Volume</i>, Association for Computational Linguistics, 2021, pp. 224–33, doi:<a href=\"https://doi.org/10.18653/v1/2021.eacl-main.17\">10.18653/v1/2021.eacl-main.17</a>."},"abstract":[{"lang":"eng","text":"When engaging in argumentative discourse, skilled human debaters tailor\r\nclaims to the beliefs of the audience, to construct effective arguments.\r\nRecently, the field of computational argumentation witnessed extensive effort\r\nto address the automatic generation of arguments. However, existing approaches\r\ndo not perform any audience-specific adaptation. In this work, we aim to bridge\r\nthis gap by studying the task of belief-based claim generation: Given a\r\ncontroversial topic and a set of beliefs, generate an argumentative claim\r\ntailored to the beliefs. To tackle this task, we model the people's prior\r\nbeliefs through their stances on controversial topics and extend\r\nstate-of-the-art text generation models to generate claims conditioned on the\r\nbeliefs. Our automatic evaluation confirms the ability of our approach to adapt\r\nclaims to a set of given beliefs. In a manual study, we additionally evaluate\r\nthe generated claims in terms of informativeness and their likelihood to be\r\nuttered by someone with a respective belief. Our results reveal the limitations\r\nof modeling users' beliefs based on their stances, but demonstrate the\r\npotential of encoding beliefs into argumentative texts, laying the ground for\r\nfuture exploration of audience reach."}],"project":[{"name":"SFB 901: SFB 901","_id":"1"},{"name":"SFB 901 - B: SFB 901 - Project Area B","_id":"3"},{"_id":"9","name":"SFB 901 - B1: SFB 901 - Subproject B1"}],"date_created":"2021-02-05T08:00:07Z","type":"conference","department":[{"_id":"600"}],"status":"public","title":"Belief-based Generation of Argumentative Claims","year":"2021","author":[{"id":"73059","full_name":"Alshomary, Milad","first_name":"Milad","last_name":"Alshomary"},{"full_name":"Chen, Wei-Fan","first_name":"Wei-Fan","last_name":"Chen","id":"82920"},{"id":"52174","last_name":"Gurcke","first_name":"Timon","full_name":"Gurcke, Timon"},{"id":"3900","last_name":"Wachsmuth","first_name":"Henning","full_name":"Wachsmuth, Henning"}],"conference":{"location":"Online","name":"Proceedings of the 16th Conference of the European Chapter of the Association for Computational Linguistics: Main Volume"},"date_updated":"2026-02-23T16:06:41Z","page":"224-233","main_file_link":[{"url":"https://www.aclweb.org/anthology/2021.eacl-main.17"}],"language":[{"iso":"eng"}],"_id":"21178","publisher":"Association for Computational Linguistics","user_id":"14972","doi":"10.18653/v1/2021.eacl-main.17"},{"user_id":"15249","language":[{"iso":"eng"}],"_id":"26405","date_updated":"2025-12-04T10:43:01Z","year":"2021","status":"public","title":"Modeling the Effects of Global Variables in Data-Flow Analysis for C/C++","author":[{"orcid":"0000-0002-8674-1859","first_name":"Philipp","last_name":"Schubert","full_name":"Schubert, Philipp","id":"60543"},{"full_name":"Sattler, Florian","last_name":"Sattler","first_name":"Florian"},{"id":"55745","first_name":"Fabian Benedikt","last_name":"Schiebel","orcid":"0009-0008-6867-9802","full_name":"Schiebel, Fabian Benedikt"},{"first_name":"Ben","last_name":"Hermann","orcid":"0000-0001-9848-2017","full_name":"Hermann, Ben","id":"66173"},{"id":"59256","full_name":"Bodden, Eric","orcid":"0000-0003-3470-3647","first_name":"Eric","last_name":"Bodden"}],"type":"conference","department":[{"_id":"76"}],"date_created":"2021-10-18T12:50:35Z","project":[{"name":"SFB 901 - B4: SFB 901 - Subproject B4","_id":"12"},{"name":"SFB 901 - B: SFB 901 - Project Area B","_id":"3"},{"_id":"1","name":"SFB 901: SFB 901: On-The-Fly Computing - Individualisierte IT-Dienstleistungen in dynamischen Märkten "}],"publication":"2021 IEEE 21st International Working Conference on Source Code Analysis and Manipulation (SCAM)","citation":{"mla":"Schubert, Philipp, et al. “Modeling the Effects of Global Variables in Data-Flow Analysis for C/C++.” <i>2021 IEEE 21st International Working Conference on Source Code Analysis and Manipulation (SCAM)</i>, 2021.","bibtex":"@inproceedings{Schubert_Sattler_Schiebel_Hermann_Bodden_2021, title={Modeling the Effects of Global Variables in Data-Flow Analysis for C/C++}, booktitle={2021 IEEE 21st International Working Conference on Source Code Analysis and Manipulation (SCAM)}, author={Schubert, Philipp and Sattler, Florian and Schiebel, Fabian Benedikt and Hermann, Ben and Bodden, Eric}, year={2021} }","ama":"Schubert P, Sattler F, Schiebel FB, Hermann B, Bodden E. Modeling the Effects of Global Variables in Data-Flow Analysis for C/C++. In: <i>2021 IEEE 21st International Working Conference on Source Code Analysis and Manipulation (SCAM)</i>. ; 2021.","ieee":"P. Schubert, F. Sattler, F. B. Schiebel, B. Hermann, and E. Bodden, “Modeling the Effects of Global Variables in Data-Flow Analysis for C/C++,” 2021.","apa":"Schubert, P., Sattler, F., Schiebel, F. B., Hermann, B., &#38; Bodden, E. (2021). Modeling the Effects of Global Variables in Data-Flow Analysis for C/C++. <i>2021 IEEE 21st International Working Conference on Source Code Analysis and Manipulation (SCAM)</i>.","short":"P. Schubert, F. Sattler, F.B. Schiebel, B. Hermann, E. Bodden, in: 2021 IEEE 21st International Working Conference on Source Code Analysis and Manipulation (SCAM), 2021.","chicago":"Schubert, Philipp, Florian Sattler, Fabian Benedikt Schiebel, Ben Hermann, and Eric Bodden. “Modeling the Effects of Global Variables in Data-Flow Analysis for C/C++.” In <i>2021 IEEE 21st International Working Conference on Source Code Analysis and Manipulation (SCAM)</i>, 2021."}},{"publication_status":"accepted","date_updated":"2022-01-06T06:54:09Z","year":"2020","status":"public","title":"Automatic Fairness Testing of Machine Learning Models","author":[{"id":"67200","first_name":"Arnab","last_name":"Sharma","full_name":"Sharma, Arnab"},{"full_name":"Wehrheim, Heike","first_name":"Heike","last_name":"Wehrheim","id":"573"}],"user_id":"477","_id":"19656","series_title":"LNCS","publisher":"Springer","language":[{"iso":"eng"}],"project":[{"name":"SFB 901","_id":"1"},{"_id":"11","name":"SFB 901 - Subproject B3"},{"_id":"3","name":"SFB 901 - Project Area B"}],"publication":"Proceedings of the 32th IFIP International Conference on Testing Software and Systems (ICTSS)","citation":{"ama":"Sharma A, Wehrheim H. Automatic Fairness Testing of Machine Learning Models. In: <i>Proceedings of the 32th IFIP International Conference on Testing Software and Systems (ICTSS)</i>. LNCS. Springer.","bibtex":"@inproceedings{Sharma_Wehrheim, series={LNCS}, title={Automatic Fairness Testing of Machine Learning Models}, booktitle={Proceedings of the 32th IFIP International Conference on Testing Software and Systems (ICTSS)}, publisher={Springer}, author={Sharma, Arnab and Wehrheim, Heike}, collection={LNCS} }","mla":"Sharma, Arnab, and Heike Wehrheim. “Automatic Fairness Testing of Machine Learning Models.” <i>Proceedings of the 32th IFIP International Conference on Testing Software and Systems (ICTSS)</i>, Springer.","short":"A. Sharma, H. Wehrheim, in: Proceedings of the 32th IFIP International Conference on Testing Software and Systems (ICTSS), Springer, n.d.","chicago":"Sharma, Arnab, and Heike Wehrheim. “Automatic Fairness Testing of Machine Learning Models.” In <i>Proceedings of the 32th IFIP International Conference on Testing Software and Systems (ICTSS)</i>. LNCS. Springer, n.d.","apa":"Sharma, A., &#38; Wehrheim, H. (n.d.). Automatic Fairness Testing of Machine Learning Models. In <i>Proceedings of the 32th IFIP International Conference on Testing Software and Systems (ICTSS)</i>. Springer.","ieee":"A. Sharma and H. Wehrheim, “Automatic Fairness Testing of Machine Learning Models,” in <i>Proceedings of the 32th IFIP International Conference on Testing Software and Systems (ICTSS)</i>."},"type":"conference","department":[{"_id":"7"},{"_id":"77"}],"date_created":"2020-09-24T12:53:02Z"},{"date_updated":"2022-01-06T06:54:18Z","author":[{"full_name":"Mayer, Stefan","first_name":"Stefan","last_name":"Mayer"}],"status":"public","title":"Optimierung von JMCTest beim Testen von Inter Method Contracts","year":"2020","user_id":"477","_id":"19999","publisher":"Universität Paderborn","language":[{"iso":"eng"}],"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area B","_id":"3"},{"name":"SFB 901 - Subproject B3","_id":"11"}],"supervisor":[{"id":"573","full_name":"Wehrheim, Heike","last_name":"Wehrheim","first_name":"Heike"}],"citation":{"ama":"Mayer S. <i>Optimierung von JMCTest Beim Testen von Inter Method Contracts</i>. Universität Paderborn; 2020.","bibtex":"@book{Mayer_2020, title={Optimierung von JMCTest beim Testen von Inter Method Contracts}, publisher={Universität Paderborn}, author={Mayer, Stefan}, year={2020} }","mla":"Mayer, Stefan. <i>Optimierung von JMCTest Beim Testen von Inter Method Contracts</i>. Universität Paderborn, 2020.","short":"S. Mayer, Optimierung von JMCTest Beim Testen von Inter Method Contracts, Universität Paderborn, 2020.","chicago":"Mayer, Stefan. <i>Optimierung von JMCTest Beim Testen von Inter Method Contracts</i>. Universität Paderborn, 2020.","apa":"Mayer, S. (2020). <i>Optimierung von JMCTest beim Testen von Inter Method Contracts</i>. Universität Paderborn.","ieee":"S. Mayer, <i>Optimierung von JMCTest beim Testen von Inter Method Contracts</i>. Universität Paderborn, 2020."},"department":[{"_id":"7"},{"_id":"77"}],"type":"bachelorsthesis","date_created":"2020-10-15T05:15:46Z"},{"doi":"https://doi.org/10.1007/978-3-030-59506-7_30","language":[{"iso":"eng"}],"series_title":"Communications in Computer and Information Science","intvolume":"      1283","date_updated":"2022-01-06T06:53:08Z","publication_status":"published","author":[{"last_name":"Bäumer","first_name":"Frederik Simon","full_name":"Bäumer, Frederik Simon","id":"38837"},{"last_name":"Kersting","first_name":"Joschka","full_name":"Kersting, Joschka","id":"58701"},{"full_name":"Buff, Bianca","first_name":"Bianca","last_name":"Buff"},{"full_name":"Geierhos, Michaela","last_name":"Geierhos","first_name":"Michaela","orcid":"0000-0002-8180-5606","id":"42496"}],"title":"Tag Me If You Can: Insights into the Challenges of Supporting Unrestricted P2P News Tagging","year":"2020","department":[{"_id":"579"},{"_id":"1"},{"_id":"36"}],"type":"book_chapter","date_created":"2020-06-26T14:23:52Z","file":[{"date_created":"2020-11-07T19:47:30Z","creator":"jkers","success":1,"content_type":"application/pdf","file_id":"20309","date_updated":"2020-11-07T19:47:30Z","relation":"main_file","access_level":"closed","file_size":599881,"file_name":"Bäumer et al. (2020), Baeumer2020.pdf .pdf"}],"abstract":[{"lang":"eng","text":"Peer-to-Peer news portals allow Internet users to write news articles and make them available online to interested readers. Despite the fact that authors are free in their choice of topics, there are a number of quality characteristics that an article must meet before it is published. In addition to meaningful titles, comprehensibly written texts and meaning- ful images, relevant tags are an important criteria for the quality of such news. In this case study, we discuss the challenges and common mistakes that Peer-to-Peer reporters face when tagging news and how incorrect information can be corrected through the orchestration of existing Natu- ral Language Processing services. Lastly, we use this illustrative example to give insight into the challenges of dealing with bottom-up taxonomies."}],"publication":"Information and Software Technologies","editor":[{"full_name":"Audrius, Lopata","last_name":"Audrius","first_name":"Lopata"},{"full_name":"Rita, Butkienė","first_name":"Butkienė","last_name":"Rita"},{"full_name":"Daina, Gudonienė","last_name":"Daina","first_name":"Gudonienė"},{"last_name":"Vilma","first_name":"Sukackė","full_name":"Vilma, Sukackė"}],"volume":1283,"ddc":["004"],"user_id":"58701","_id":"17347","publisher":"Springer","page":"368--382","has_accepted_license":"1","conference":{"start_date":"2020-10-15","name":"26th International Conference on Information and Software Technologies (ICIST 2020)","location":"Kaunas, Litauen","end_date":"2020-10-17"},"status":"public","project":[{"name":"SFB 901","_id":"1"},{"_id":"3","name":"SFB 901 - Project Area B"},{"_id":"9","name":"SFB 901 - Subproject B1"}],"citation":{"mla":"Bäumer, Frederik Simon, et al. “Tag Me If You Can: Insights into the Challenges of Supporting Unrestricted P2P News Tagging.” <i>Information and Software Technologies</i>, edited by Lopata Audrius et al., vol. 1283, Springer, 2020, pp. 368--382, doi:<a href=\"https://doi.org/10.1007/978-3-030-59506-7_30\">https://doi.org/10.1007/978-3-030-59506-7_30</a>.","bibtex":"@inbook{Bäumer_Kersting_Buff_Geierhos_2020, series={Communications in Computer and Information Science}, title={Tag Me If You Can: Insights into the Challenges of Supporting Unrestricted P2P News Tagging}, volume={1283}, DOI={<a href=\"https://doi.org/10.1007/978-3-030-59506-7_30\">https://doi.org/10.1007/978-3-030-59506-7_30</a>}, booktitle={Information and Software Technologies}, publisher={Springer}, author={Bäumer, Frederik Simon and Kersting, Joschka and Buff, Bianca and Geierhos, Michaela}, editor={Audrius, Lopata and Rita, Butkienė and Daina, Gudonienė and Vilma, SukackėEditors}, year={2020}, pages={368--382}, collection={Communications in Computer and Information Science} }","ama":"Bäumer FS, Kersting J, Buff B, Geierhos M. Tag Me If You Can: Insights into the Challenges of Supporting Unrestricted P2P News Tagging. In: Audrius L, Rita B, Daina G, Vilma S, eds. <i>Information and Software Technologies</i>. Vol 1283. Communications in Computer and Information Science. Springer; 2020:368--382. doi:<a href=\"https://doi.org/10.1007/978-3-030-59506-7_30\">https://doi.org/10.1007/978-3-030-59506-7_30</a>","ieee":"F. S. Bäumer, J. Kersting, B. Buff, and M. Geierhos, “Tag Me If You Can: Insights into the Challenges of Supporting Unrestricted P2P News Tagging,” in <i>Information and Software Technologies</i>, vol. 1283, L. Audrius, B. Rita, G. Daina, and S. Vilma, Eds. Springer, 2020, pp. 368--382.","apa":"Bäumer, F. S., Kersting, J., Buff, B., &#38; Geierhos, M. (2020). Tag Me If You Can: Insights into the Challenges of Supporting Unrestricted P2P News Tagging. In L. Audrius, B. Rita, G. Daina, &#38; S. Vilma (Eds.), <i>Information and Software Technologies</i> (Vol. 1283, pp. 368--382). Kaunas, Litauen: Springer. <a href=\"https://doi.org/10.1007/978-3-030-59506-7_30\">https://doi.org/10.1007/978-3-030-59506-7_30</a>","chicago":"Bäumer, Frederik Simon, Joschka Kersting, Bianca Buff, and Michaela Geierhos. “Tag Me If You Can: Insights into the Challenges of Supporting Unrestricted P2P News Tagging.” In <i>Information and Software Technologies</i>, edited by Lopata Audrius, Butkienė Rita, Gudonienė Daina, and Sukackė Vilma, 1283:368--382. Communications in Computer and Information Science. Springer, 2020. <a href=\"https://doi.org/10.1007/978-3-030-59506-7_30\">https://doi.org/10.1007/978-3-030-59506-7_30</a>.","short":"F.S. Bäumer, J. Kersting, B. Buff, M. Geierhos, in: L. Audrius, B. Rita, G. Daina, S. Vilma (Eds.), Information and Software Technologies, Springer, 2020, pp. 368--382."},"file_date_updated":"2020-11-07T19:47:30Z"},{"quality_controlled":"1","project":[{"_id":"12","name":"SFB 901 - Subproject B4"},{"_id":"3","name":"SFB 901 - Project Area B"},{"_id":"1","name":"SFB 901"}],"citation":{"chicago":"Witschen, Linus Matthias, Tobias Wiersema, and Marco Platzner. “Proof-Carrying Approximate Circuits.” <i>IEEE Transactions On Very Large Scale Integration Systems</i> 28, no. 9 (2020): 2084–88. <a href=\"https://doi.org/10.1109/TVLSI.2020.3008061\">https://doi.org/10.1109/TVLSI.2020.3008061</a>.","ama":"Witschen LM, Wiersema T, Platzner M. Proof-carrying Approximate Circuits. <i>IEEE Transactions On Very Large Scale Integration Systems</i>. 2020;28(9):2084-2088. doi:<a href=\"https://doi.org/10.1109/TVLSI.2020.3008061\">10.1109/TVLSI.2020.3008061</a>","short":"L.M. Witschen, T. Wiersema, M. Platzner, IEEE Transactions On Very Large Scale Integration Systems 28 (2020) 2084–2088.","bibtex":"@article{Witschen_Wiersema_Platzner_2020, title={Proof-carrying Approximate Circuits}, volume={28}, DOI={<a href=\"https://doi.org/10.1109/TVLSI.2020.3008061\">10.1109/TVLSI.2020.3008061</a>}, number={9}, journal={IEEE Transactions On Very Large Scale Integration Systems}, publisher={IEEE}, author={Witschen, Linus Matthias and Wiersema, Tobias and Platzner, Marco}, year={2020}, pages={2084–2088} }","apa":"Witschen, L. M., Wiersema, T., &#38; Platzner, M. (2020). Proof-carrying Approximate Circuits. <i>IEEE Transactions On Very Large Scale Integration Systems</i>, <i>28</i>(9), 2084–2088. <a href=\"https://doi.org/10.1109/TVLSI.2020.3008061\">https://doi.org/10.1109/TVLSI.2020.3008061</a>","mla":"Witschen, Linus Matthias, et al. “Proof-Carrying Approximate Circuits.” <i>IEEE Transactions On Very Large Scale Integration Systems</i>, vol. 28, no. 9, IEEE, 2020, pp. 2084–88, doi:<a href=\"https://doi.org/10.1109/TVLSI.2020.3008061\">10.1109/TVLSI.2020.3008061</a>.","ieee":"L. M. Witschen, T. Wiersema, and M. Platzner, “Proof-carrying Approximate Circuits,” <i>IEEE Transactions On Very Large Scale Integration Systems</i>, vol. 28, no. 9, pp. 2084–2088, 2020."},"user_id":"49051","volume":28,"page":"2084 - 2088","_id":"17358","publisher":"IEEE","funded_apc":"1","status":"public","type":"journal_article","keyword":["Approximate circuit synthesis","approximate computing","error metrics","formal verification","proof-carrying hardware"],"department":[{"_id":"78"}],"date_created":"2020-07-06T11:21:30Z","abstract":[{"lang":"eng","text":"Approximate circuits trade-off computational accuracy against improvements in hardware area, delay, or energy consumption. IP core vendors who wish to create such circuits need to convince consumers of the resulting approximation quality. As a solution we propose proof-carrying approximate circuits: The vendor creates an approximate IP core together with a certificate that proves the approximation quality. The proof certificate is bundled with the approximate IP core and sent off to the consumer. The consumer can formally verify the approximation quality of the IP core at a fraction of the typical computational cost for formal verification. In this paper, we first make the case for proof-carrying approximate circuits and then demonstrate the feasibility of the approach by a set of synthesis experiments using an exemplary approximation framework."}],"issue":"9","publication":"IEEE Transactions On Very Large Scale Integration Systems","doi":"10.1109/TVLSI.2020.3008061","language":[{"iso":"eng"}],"publication_status":"published","date_updated":"2022-01-06T06:53:09Z","article_type":"original","intvolume":"        28","title":"Proof-carrying Approximate Circuits","year":"2020","publication_identifier":{"eissn":["1557-9999"],"issn":["1063-8210"]},"author":[{"id":"49051","full_name":"Witschen, Linus Matthias","first_name":"Linus Matthias","last_name":"Witschen"},{"first_name":"Tobias","last_name":"Wiersema","full_name":"Wiersema, Tobias","id":"3118"},{"full_name":"Platzner, Marco","last_name":"Platzner","first_name":"Marco","id":"398"}]},{"conference":{"name":"Discovery Science 2020"},"author":[{"id":"38209","last_name":"Tornede","first_name":"Alexander","full_name":"Tornede, Alexander"},{"last_name":"Wever","orcid":" https://orcid.org/0000-0001-9782-6818","first_name":"Marcel Dominik","full_name":"Wever, Marcel Dominik","id":"33176"},{"id":"48129","first_name":"Eyke","last_name":"Hüllermeier","full_name":"Hüllermeier, Eyke"}],"status":"public","year":"2020","title":"Extreme Algorithm Selection with Dyadic Feature Representation","date_updated":"2022-01-06T06:53:10Z","_id":"17407","language":[{"iso":"eng"}],"user_id":"5786","citation":{"bibtex":"@inproceedings{Tornede_Wever_Hüllermeier_2020, title={Extreme Algorithm Selection with Dyadic Feature Representation}, booktitle={Discovery Science}, author={Tornede, Alexander and Wever, Marcel Dominik and Hüllermeier, Eyke}, year={2020} }","ama":"Tornede A, Wever MD, Hüllermeier E. Extreme Algorithm Selection with Dyadic Feature Representation. In: <i>Discovery Science</i>. ; 2020.","mla":"Tornede, Alexander, et al. “Extreme Algorithm Selection with Dyadic Feature Representation.” <i>Discovery Science</i>, 2020.","short":"A. Tornede, M.D. Wever, E. Hüllermeier, in: Discovery Science, 2020.","chicago":"Tornede, Alexander, Marcel Dominik Wever, and Eyke Hüllermeier. “Extreme Algorithm Selection with Dyadic Feature Representation.” In <i>Discovery Science</i>, 2020.","ieee":"A. Tornede, M. D. Wever, and E. Hüllermeier, “Extreme Algorithm Selection with Dyadic Feature Representation,” presented at the Discovery Science 2020, 2020.","apa":"Tornede, A., Wever, M. D., &#38; Hüllermeier, E. (2020). Extreme Algorithm Selection with Dyadic Feature Representation. <i>Discovery Science</i>. Discovery Science 2020."},"publication":"Discovery Science","project":[{"_id":"1","name":"SFB 901"},{"_id":"3","name":"SFB 901 - Project Area B"},{"_id":"10","name":"SFB 901 - Subproject B2"},{"_id":"52","name":"Computing Resources Provided by the Paderborn Center for Parallel Computing"}],"date_created":"2020-07-21T10:06:51Z","department":[{"_id":"34"},{"_id":"355"},{"_id":"26"}],"type":"conference"},{"user_id":"5786","language":[{"iso":"eng"}],"_id":"17408","date_updated":"2022-01-06T06:53:10Z","title":"Hybrid Ranking and Regression for Algorithm Selection","status":"public","year":"2020","conference":{"name":"43rd German Conference on Artificial Intelligence"},"author":[{"full_name":"Hanselle, Jonas Manuel","orcid":"0000-0002-1231-4985","first_name":"Jonas Manuel","last_name":"Hanselle","id":"43980"},{"id":"38209","full_name":"Tornede, Alexander","last_name":"Tornede","first_name":"Alexander"},{"full_name":"Wever, Marcel Dominik","last_name":"Wever","first_name":"Marcel Dominik","orcid":" https://orcid.org/0000-0001-9782-6818","id":"33176"},{"last_name":"Hüllermeier","first_name":"Eyke","full_name":"Hüllermeier, Eyke","id":"48129"}],"type":"conference","department":[{"_id":"34"},{"_id":"355"},{"_id":"26"}],"date_created":"2020-07-21T10:21:09Z","project":[{"name":"SFB 901","_id":"1"},{"_id":"3","name":"SFB 901 - Project Area B"},{"_id":"10","name":"SFB 901 - Subproject B2"},{"name":"Computing Resources Provided by the Paderborn Center for Parallel Computing","_id":"52"}],"publication":"KI 2020: Advances in Artificial Intelligence","citation":{"mla":"Hanselle, Jonas Manuel, et al. “Hybrid Ranking and Regression for Algorithm Selection.” <i>KI 2020: Advances in Artificial Intelligence</i>, 2020.","bibtex":"@inproceedings{Hanselle_Tornede_Wever_Hüllermeier_2020, title={Hybrid Ranking and Regression for Algorithm Selection}, booktitle={KI 2020: Advances in Artificial Intelligence}, author={Hanselle, Jonas Manuel and Tornede, Alexander and Wever, Marcel Dominik and Hüllermeier, Eyke}, year={2020} }","ama":"Hanselle JM, Tornede A, Wever MD, Hüllermeier E. Hybrid Ranking and Regression for Algorithm Selection. In: <i>KI 2020: Advances in Artificial Intelligence</i>. ; 2020.","ieee":"J. M. Hanselle, A. Tornede, M. D. Wever, and E. Hüllermeier, “Hybrid Ranking and Regression for Algorithm Selection,” presented at the 43rd German Conference on Artificial Intelligence, 2020.","apa":"Hanselle, J. M., Tornede, A., Wever, M. D., &#38; Hüllermeier, E. (2020). Hybrid Ranking and Regression for Algorithm Selection. <i>KI 2020: Advances in Artificial Intelligence</i>. 43rd German Conference on Artificial Intelligence.","chicago":"Hanselle, Jonas Manuel, Alexander Tornede, Marcel Dominik Wever, and Eyke Hüllermeier. “Hybrid Ranking and Regression for Algorithm Selection.” In <i>KI 2020: Advances in Artificial Intelligence</i>, 2020.","short":"J.M. Hanselle, A. Tornede, M.D. Wever, E. Hüllermeier, in: KI 2020: Advances in Artificial Intelligence, 2020."}},{"date_updated":"2022-01-06T06:53:11Z","author":[{"id":"40795","full_name":"Tornede, Tanja","first_name":"Tanja","last_name":"Tornede"},{"id":"38209","full_name":"Tornede, Alexander","last_name":"Tornede","first_name":"Alexander"},{"id":"33176","last_name":"Wever","first_name":"Marcel Dominik","orcid":" https://orcid.org/0000-0001-9782-6818","full_name":"Wever, Marcel Dominik"},{"full_name":"Mohr, Felix","last_name":"Mohr","first_name":"Felix"},{"last_name":"Hüllermeier","first_name":"Eyke","full_name":"Hüllermeier, Eyke","id":"48129"}],"conference":{"name":"IOTStream Workshop @ ECMLPKDD 2020"},"status":"public","year":"2020","title":"AutoML for Predictive Maintenance: One Tool to RUL Them All","user_id":"5786","doi":"10.1007/978-3-030-66770-2_8","_id":"17424","language":[{"iso":"eng"}],"project":[{"name":"Computing Resources Provided by the Paderborn Center for Parallel Computing","_id":"52"},{"_id":"3","name":"SFB 901 - Project Area B"},{"_id":"10","name":"SFB 901 - Subproject B2"},{"name":"SFB 901","_id":"1"},{"_id":"52","name":"Computing Resources Provided by the Paderborn Center for Parallel Computing"}],"citation":{"apa":"Tornede, T., Tornede, A., Wever, M. D., Mohr, F., &#38; Hüllermeier, E. (2020). AutoML for Predictive Maintenance: One Tool to RUL Them All. <i>Proceedings of the ECMLPKDD 2020</i>. IOTStream Workshop @ ECMLPKDD 2020. <a href=\"https://doi.org/10.1007/978-3-030-66770-2_8\">https://doi.org/10.1007/978-3-030-66770-2_8</a>","ieee":"T. Tornede, A. Tornede, M. D. Wever, F. Mohr, and E. Hüllermeier, “AutoML for Predictive Maintenance: One Tool to RUL Them All,” presented at the IOTStream Workshop @ ECMLPKDD 2020, 2020, doi: <a href=\"https://doi.org/10.1007/978-3-030-66770-2_8\">10.1007/978-3-030-66770-2_8</a>.","short":"T. Tornede, A. Tornede, M.D. Wever, F. Mohr, E. Hüllermeier, in: Proceedings of the ECMLPKDD 2020, 2020.","chicago":"Tornede, Tanja, Alexander Tornede, Marcel Dominik Wever, Felix Mohr, and Eyke Hüllermeier. “AutoML for Predictive Maintenance: One Tool to RUL Them All.” In <i>Proceedings of the ECMLPKDD 2020</i>, 2020. <a href=\"https://doi.org/10.1007/978-3-030-66770-2_8\">https://doi.org/10.1007/978-3-030-66770-2_8</a>.","mla":"Tornede, Tanja, et al. “AutoML for Predictive Maintenance: One Tool to RUL Them All.” <i>Proceedings of the ECMLPKDD 2020</i>, 2020, doi:<a href=\"https://doi.org/10.1007/978-3-030-66770-2_8\">10.1007/978-3-030-66770-2_8</a>.","ama":"Tornede T, Tornede A, Wever MD, Mohr F, Hüllermeier E. AutoML for Predictive Maintenance: One Tool to RUL Them All. In: <i>Proceedings of the ECMLPKDD 2020</i>. ; 2020. doi:<a href=\"https://doi.org/10.1007/978-3-030-66770-2_8\">10.1007/978-3-030-66770-2_8</a>","bibtex":"@inproceedings{Tornede_Tornede_Wever_Mohr_Hüllermeier_2020, title={AutoML for Predictive Maintenance: One Tool to RUL Them All}, DOI={<a href=\"https://doi.org/10.1007/978-3-030-66770-2_8\">10.1007/978-3-030-66770-2_8</a>}, booktitle={Proceedings of the ECMLPKDD 2020}, author={Tornede, Tanja and Tornede, Alexander and Wever, Marcel Dominik and Mohr, Felix and Hüllermeier, Eyke}, year={2020} }"},"publication":"Proceedings of the ECMLPKDD 2020","department":[{"_id":"34"},{"_id":"355"},{"_id":"26"}],"type":"conference","date_created":"2020-07-28T09:17:41Z"},{"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area B","_id":"3"},{"name":"SFB 901 - Subproject B1","_id":"9"}],"citation":{"short":"J. Kersting, F.S. Bäumer, in: PROCEEDINGS OF THE INTERNATIONAL CONFERENCE ON APPLIED COMPUTING 2020, IADIS, 2020, pp. 119--123.","chicago":"Kersting, Joschka, and Frederik Simon Bäumer. “SEMANTIC TAGGING OF REQUIREMENT DESCRIPTIONS: A TRANSFORMER-BASED APPROACH.” In <i>PROCEEDINGS OF THE INTERNATIONAL CONFERENCE ON APPLIED COMPUTING 2020</i>, 119--123. IADIS, 2020.","ieee":"J. Kersting and F. S. Bäumer, “SEMANTIC TAGGING OF REQUIREMENT DESCRIPTIONS: A TRANSFORMER-BASED APPROACH,” in <i>PROCEEDINGS OF THE INTERNATIONAL CONFERENCE ON APPLIED COMPUTING 2020</i>, Lisbon, Portugal, 2020, pp. 119--123.","apa":"Kersting, J., &#38; Bäumer, F. S. (2020). SEMANTIC TAGGING OF REQUIREMENT DESCRIPTIONS: A TRANSFORMER-BASED APPROACH. <i>PROCEEDINGS OF THE INTERNATIONAL CONFERENCE ON APPLIED COMPUTING 2020</i>, 119--123.","bibtex":"@inproceedings{Kersting_Bäumer_2020, title={SEMANTIC TAGGING OF REQUIREMENT DESCRIPTIONS: A TRANSFORMER-BASED APPROACH}, booktitle={PROCEEDINGS OF THE INTERNATIONAL CONFERENCE ON APPLIED COMPUTING 2020}, publisher={IADIS}, author={Kersting, Joschka and Bäumer, Frederik Simon}, year={2020}, pages={119--123} }","ama":"Kersting J, Bäumer FS. SEMANTIC TAGGING OF REQUIREMENT DESCRIPTIONS: A TRANSFORMER-BASED APPROACH. In: <i>PROCEEDINGS OF THE INTERNATIONAL CONFERENCE ON APPLIED COMPUTING 2020</i>. IADIS; 2020:119--123.","mla":"Kersting, Joschka, and Frederik Simon Bäumer. “SEMANTIC TAGGING OF REQUIREMENT DESCRIPTIONS: A TRANSFORMER-BASED APPROACH.” <i>PROCEEDINGS OF THE INTERNATIONAL CONFERENCE ON APPLIED COMPUTING 2020</i>, IADIS, 2020, pp. 119--123."},"file_date_updated":"2020-11-19T17:29:03Z","user_id":"58701","ddc":["000"],"publisher":"IADIS","_id":"18686","page":"119--123","has_accepted_license":"1","conference":{"location":"Lisbon, Portugal","name":"17th International Conference on Applied Computing","start_date":"18.11.2020","end_date":"20.11.2020"},"status":"public","department":[{"_id":"579"}],"type":"conference","keyword":["Software Requirements","Natural Language Processing","Transfer Learning","On-The-Fly Computing"],"date_created":"2020-08-31T10:59:54Z","file":[{"date_created":"2020-11-19T17:29:03Z","creator":"jkers","file_id":"20443","success":1,"content_type":"application/pdf","relation":"main_file","date_updated":"2020-11-19T17:29:03Z","file_name":"Kersting & Bäumer (2020), Kersting2020d.pdf","file_size":1064877,"access_level":"closed"}],"publication":"PROCEEDINGS OF THE INTERNATIONAL CONFERENCE ON APPLIED COMPUTING 2020","language":[{"iso":"eng"}],"date_updated":"2022-01-06T06:53:51Z","author":[{"id":"58701","first_name":"Joschka","last_name":"Kersting","full_name":"Kersting, Joschka"},{"full_name":"Bäumer, Frederik Simon","first_name":"Frederik Simon","last_name":"Bäumer","id":"38837"}],"title":"SEMANTIC TAGGING OF REQUIREMENT DESCRIPTIONS: A TRANSFORMER-BASED APPROACH","year":"2020"},{"_id":"20306","language":[{"iso":"eng"}],"user_id":"5786","title":"Towards Meta-Algorithm Selection","year":"2020","status":"public","author":[{"last_name":"Tornede","first_name":"Alexander","full_name":"Tornede, Alexander","id":"38209"},{"id":"33176","full_name":"Wever, Marcel Dominik","last_name":"Wever","first_name":"Marcel Dominik","orcid":" https://orcid.org/0000-0001-9782-6818"},{"first_name":"Eyke","last_name":"Hüllermeier","full_name":"Hüllermeier, Eyke","id":"48129"}],"conference":{"name":"Workshop MetaLearn 2020 @ NeurIPS 2020","location":"Online"},"date_updated":"2022-01-06T06:54:26Z","date_created":"2020-11-06T09:42:27Z","type":"conference","department":[{"_id":"34"},{"_id":"355"},{"_id":"26"}],"publication":"Workshop MetaLearn 2020 @ NeurIPS 2020","citation":{"chicago":"Tornede, Alexander, Marcel Dominik Wever, and Eyke Hüllermeier. “Towards Meta-Algorithm Selection.” In <i>Workshop MetaLearn 2020 @ NeurIPS 2020</i>, 2020.","short":"A. Tornede, M.D. Wever, E. Hüllermeier, in: Workshop MetaLearn 2020 @ NeurIPS 2020, 2020.","ieee":"A. Tornede, M. D. Wever, and E. Hüllermeier, “Towards Meta-Algorithm Selection,” presented at the Workshop MetaLearn 2020 @ NeurIPS 2020, Online, 2020.","apa":"Tornede, A., Wever, M. D., &#38; Hüllermeier, E. (2020). Towards Meta-Algorithm Selection. <i>Workshop MetaLearn 2020 @ NeurIPS 2020</i>. Workshop MetaLearn 2020 @ NeurIPS 2020, Online.","bibtex":"@inproceedings{Tornede_Wever_Hüllermeier_2020, title={Towards Meta-Algorithm Selection}, booktitle={Workshop MetaLearn 2020 @ NeurIPS 2020}, author={Tornede, Alexander and Wever, Marcel Dominik and Hüllermeier, Eyke}, year={2020} }","ama":"Tornede A, Wever MD, Hüllermeier E. Towards Meta-Algorithm Selection. In: <i>Workshop MetaLearn 2020 @ NeurIPS 2020</i>. ; 2020.","mla":"Tornede, Alexander, et al. “Towards Meta-Algorithm Selection.” <i>Workshop MetaLearn 2020 @ NeurIPS 2020</i>, 2020."},"project":[{"_id":"1","name":"SFB 901"},{"_id":"3","name":"SFB 901 - Project Area B"},{"_id":"10","name":"SFB 901 - Subproject B2"},{"name":"Computing Resources Provided by the Paderborn Center for Parallel Computing","_id":"52"}]},{"file":[{"file_name":"main.pdf","file_size":683576,"access_level":"closed","relation":"main_file","date_updated":"2020-12-14T07:39:07Z","file_id":"20713","content_type":"application/pdf","success":1,"creator":"pdschbrt","date_created":"2020-12-14T07:39:07Z"}],"date_created":"2020-12-14T07:44:11Z","type":"report","department":[{"_id":"76"}],"file_date_updated":"2020-12-14T07:39:07Z","citation":{"apa":"Schubert, P., Bodden, E., &#38; Hermann, B. (2020). <i>Accelerating Static Call-Graph, Points-to and Data-Flow Analysis Through Persisted Summaries</i>.","ieee":"P. Schubert, E. Bodden, and B. Hermann, <i>Accelerating Static Call-Graph, Points-to and Data-Flow Analysis Through Persisted Summaries</i>. 2020.","chicago":"Schubert, Philipp, Eric Bodden, and Ben Hermann. <i>Accelerating Static Call-Graph, Points-to and Data-Flow Analysis Through Persisted Summaries</i>, 2020.","short":"P. Schubert, E. Bodden, B. Hermann, Accelerating Static Call-Graph, Points-to and Data-Flow Analysis Through Persisted Summaries, 2020.","mla":"Schubert, Philipp, et al. <i>Accelerating Static Call-Graph, Points-to and Data-Flow Analysis Through Persisted Summaries</i>. 2020.","ama":"Schubert P, Bodden E, Hermann B. <i>Accelerating Static Call-Graph, Points-to and Data-Flow Analysis Through Persisted Summaries</i>.; 2020.","bibtex":"@book{Schubert_Bodden_Hermann_2020, title={Accelerating Static Call-Graph, Points-to and Data-Flow Analysis Through Persisted Summaries}, author={Schubert, Philipp and Bodden, Eric and Hermann, Ben}, year={2020} }"},"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area B","_id":"3"},{"_id":"12","name":"SFB 901 - Subproject B4"}],"language":[{"iso":"eng"}],"_id":"20712","ddc":["000"],"user_id":"477","title":"Accelerating Static Call-Graph, Points-to and Data-Flow Analysis Through Persisted Summaries","status":"public","year":"2020","author":[{"id":"60543","full_name":"Schubert, Philipp","orcid":"0000-0002-8674-1859","first_name":"Philipp","last_name":"Schubert"},{"id":"59256","full_name":"Bodden, Eric","last_name":"Bodden","first_name":"Eric","orcid":"0000-0003-3470-3647"},{"id":"66173","full_name":"Hermann, Ben","orcid":"0000-0001-9848-2017","first_name":"Ben","last_name":"Hermann"}],"date_updated":"2022-01-06T06:54:34Z","has_accepted_license":"1"},{"project":[{"_id":"12","name":"SFB 901 - Subproject B4"},{"name":"SFB 901 - Project Area B","_id":"3"},{"name":"SFB 901","_id":"1"}],"citation":{"ieee":"L. M. Witschen, T. Wiersema, and M. Platzner, “Search Space Characterization for AxC Synthesis,” <i>Fifth Workshop on Approximate Computing (AxC 2020)</i>. .","apa":"Witschen, L. M., Wiersema, T., &#38; Platzner, M. (n.d.). Search Space Characterization for AxC Synthesis. <i>Fifth Workshop on Approximate Computing (AxC 2020)</i>.","short":"L.M. Witschen, T. Wiersema, M. Platzner, Fifth Workshop on Approximate Computing (AxC 2020) (n.d.).","chicago":"Witschen, Linus Matthias, Tobias Wiersema, and Marco Platzner. “Search Space Characterization for AxC Synthesis.” <i>Fifth Workshop on Approximate Computing (AxC 2020)</i>, n.d.","mla":"Witschen, Linus Matthias, et al. “Search Space Characterization for AxC Synthesis.” <i>Fifth Workshop on Approximate Computing (AxC 2020)</i>.","bibtex":"@article{Witschen_Wiersema_Platzner, title={Search Space Characterization for AxC Synthesis}, journal={Fifth Workshop on Approximate Computing (AxC 2020)}, author={Witschen, Linus Matthias and Wiersema, Tobias and Platzner, Marco} }","ama":"Witschen LM, Wiersema T, Platzner M. Search Space Characterization for AxC Synthesis. <i>Fifth Workshop on Approximate Computing (AxC 2020)</i>."},"file_date_updated":"2020-12-15T15:11:06Z","ddc":["000"],"user_id":"3118","_id":"20748","page":"2","has_accepted_license":"1","status":"public","department":[{"_id":"78"}],"type":"preprint","date_created":"2020-12-15T15:13:49Z","file":[{"date_created":"2020-12-15T15:11:06Z","creator":"witschen","file_id":"20749","content_type":"application/pdf","success":1,"file_name":"witschen20_axc.pdf","file_size":250870,"access_level":"closed","relation":"main_file","date_updated":"2020-12-15T15:11:06Z"}],"abstract":[{"lang":"eng","text":"On the circuit level, the design paradigm Approximate Computing seeks to trade off computational accuracy against a target metric, e.g., energy consumption. This trade-off is possible for many applications due to their inherent resiliency against inaccuracies.\r\nIn the past, several automated approximation frameworks have been presented, which either utilize designated approximation techniques or libraries to replace approximable circuit parts with inaccurate versions. The frameworks invoke a search algorithm to iteratively explore the search space of performance degraded circuits, and validate their quality individually. \r\nIn this paper, we propose to reverse this procedure. Rather than exploring the search space, we delineate the approximate parts of the search space which are guaranteed to lead to valid approximate circuits. Our methodology is supported by formal verification and independent of approximation techniques. Eventually, the user is provided with quality bounds of the individual approximable circuit parts. Consequently, our approach guarantees that any approximate circuit which implements these parts within the determined quality constraints satisfies the global quality constraints, superseding a subsequent quality verification.\r\nIn our experimental results, we present the runtimes of our approach."}],"publication":"Fifth Workshop on Approximate Computing (AxC 2020)","language":[{"iso":"eng"}],"date_updated":"2022-01-06T06:54:35Z","publication_status":"accepted","author":[{"id":"49051","full_name":"Witschen, Linus Matthias","last_name":"Witschen","first_name":"Linus Matthias"},{"last_name":"Wiersema","first_name":"Tobias","full_name":"Wiersema, Tobias","id":"3118"},{"id":"398","last_name":"Platzner","first_name":"Marco","full_name":"Platzner, Marco"}],"title":"Search Space Characterization for AxC Synthesis","year":"2020"},{"title":"Run2Survive: A Decision-theoretic Approach to Algorithm Selection based on Survival Analysis","status":"public","year":"2020","author":[{"id":"38209","last_name":"Tornede","first_name":"Alexander","full_name":"Tornede, Alexander"},{"id":"33176","last_name":"Wever","orcid":" https://orcid.org/0000-0001-9782-6818","first_name":"Marcel Dominik","full_name":"Wever, Marcel Dominik"},{"last_name":"Werner","first_name":"Stefan","full_name":"Werner, Stefan"},{"first_name":"Felix","last_name":"Mohr","full_name":"Mohr, Felix"},{"last_name":"Hüllermeier","first_name":"Eyke","full_name":"Hüllermeier, Eyke","id":"48129"}],"conference":{"end_date":"2020-11-20","name":"12th Asian Conference on Machine Learning","start_date":"2020-11-18","location":"Bangkok, Thailand"},"date_updated":"2022-01-06T06:53:28Z","main_file_link":[{"url":"https://arxiv.org/pdf/2007.02816.pdf"}],"_id":"18276","language":[{"iso":"eng"}],"user_id":"5786","publication":"ACML 2020","citation":{"ieee":"A. Tornede, M. D. Wever, S. Werner, F. Mohr, and E. Hüllermeier, “Run2Survive: A Decision-theoretic Approach to Algorithm Selection based on Survival Analysis,” presented at the 12th Asian Conference on Machine Learning, Bangkok, Thailand, 2020.","apa":"Tornede, A., Wever, M. D., Werner, S., Mohr, F., &#38; Hüllermeier, E. (2020). Run2Survive: A Decision-theoretic Approach to Algorithm Selection based on Survival Analysis. <i>ACML 2020</i>. 12th Asian Conference on Machine Learning, Bangkok, Thailand.","short":"A. Tornede, M.D. Wever, S. Werner, F. Mohr, E. Hüllermeier, in: ACML 2020, 2020.","chicago":"Tornede, Alexander, Marcel Dominik Wever, Stefan Werner, Felix Mohr, and Eyke Hüllermeier. “Run2Survive: A Decision-Theoretic Approach to Algorithm Selection Based on Survival Analysis.” In <i>ACML 2020</i>, 2020.","mla":"Tornede, Alexander, et al. “Run2Survive: A Decision-Theoretic Approach to Algorithm Selection Based on Survival Analysis.” <i>ACML 2020</i>, 2020.","bibtex":"@inproceedings{Tornede_Wever_Werner_Mohr_Hüllermeier_2020, title={Run2Survive: A Decision-theoretic Approach to Algorithm Selection based on Survival Analysis}, booktitle={ACML 2020}, author={Tornede, Alexander and Wever, Marcel Dominik and Werner, Stefan and Mohr, Felix and Hüllermeier, Eyke}, year={2020} }","ama":"Tornede A, Wever MD, Werner S, Mohr F, Hüllermeier E. Run2Survive: A Decision-theoretic Approach to Algorithm Selection based on Survival Analysis. In: <i>ACML 2020</i>. ; 2020."},"abstract":[{"lang":"eng","text":"Algorithm selection (AS) deals with the automatic selection of an algorithm\r\nfrom a fixed set of candidate algorithms most suitable for a specific instance\r\nof an algorithmic problem class, where \"suitability\" often refers to an\r\nalgorithm's runtime. Due to possibly extremely long runtimes of candidate\r\nalgorithms, training data for algorithm selection models is usually generated\r\nunder time constraints in the sense that not all algorithms are run to\r\ncompletion on all instances. Thus, training data usually comprises censored\r\ninformation, as the true runtime of algorithms timed out remains unknown.\r\nHowever, many standard AS approaches are not able to handle such information in\r\na proper way. On the other side, survival analysis (SA) naturally supports\r\ncensored data and offers appropriate ways to use such data for learning\r\ndistributional models of algorithm runtime, as we demonstrate in this work. We\r\nleverage such models as a basis of a sophisticated decision-theoretic approach\r\nto algorithm selection, which we dub Run2Survive. Moreover, taking advantage of\r\na framework of this kind, we advocate a risk-averse approach to algorithm\r\nselection, in which the avoidance of a timeout is given high priority. In an\r\nextensive experimental study with the standard benchmark ASlib, our approach is\r\nshown to be highly competitive and in many cases even superior to\r\nstate-of-the-art AS approaches."}],"project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area B","_id":"3"},{"name":"SFB 901 - Subproject B2","_id":"10"},{"_id":"52","name":"Computing Resources Provided by the Paderborn Center for Parallel Computing"}],"date_created":"2020-08-25T12:09:28Z","type":"conference","department":[{"_id":"34"},{"_id":"355"},{"_id":"26"}]}]