[{"_id":"58657","user_id":"58331","department":[{"_id":"632"}],"file_date_updated":"2025-02-17T11:13:10Z","type":"conference","status":"public","date_updated":"2025-08-22T10:34:24Z","oa":"1","author":[{"id":"58331","full_name":"Rossel, Jost","orcid":"0000-0002-3182-4059","last_name":"Rossel","first_name":"Jost"},{"first_name":"Vladislav","full_name":"Mladenov, Vladislav","last_name":"Mladenov"},{"first_name":"Nico","last_name":"Wördenweber","full_name":"Wördenweber, Nico"},{"first_name":"Juraj","orcid":"0000-0002-3593-7720","last_name":"Somorovsky","id":"83504","full_name":"Somorovsky, Juraj"}],"main_file_link":[{"open_access":"1","url":"https://www.usenix.org/conference/usenixsecurity25/presentation/rossel"}],"conference":{"end_date":"2025-08-15","location":"Seattle, WA, USA","name":"34th USENIX Security Symposium","start_date":"2025-08-13"},"publication_status":"published","has_accepted_license":"1","citation":{"ama":"Rossel J, Mladenov V, Wördenweber N, Somorovsky J. Security Implications of Malicious G-Codes in 3D Printing. In: <i>Proceedings of the 34th USENIX Security Symposium</i>. ; 2025:1867-1885.","chicago":"Rossel, Jost, Vladislav Mladenov, Nico Wördenweber, and Juraj Somorovsky. “Security Implications of Malicious G-Codes in 3D Printing.” In <i>Proceedings of the 34th USENIX Security Symposium</i>, 1867–85, 2025.","ieee":"J. Rossel, V. Mladenov, N. Wördenweber, and J. Somorovsky, “Security Implications of Malicious G-Codes in 3D Printing,” in <i>Proceedings of the 34th USENIX Security Symposium</i>, Seattle, WA, USA, 2025, pp. 1867–1885.","apa":"Rossel, J., Mladenov, V., Wördenweber, N., &#38; Somorovsky, J. (2025). Security Implications of Malicious G-Codes in 3D Printing. <i>Proceedings of the 34th USENIX Security Symposium</i>, 1867–1885.","bibtex":"@inproceedings{Rossel_Mladenov_Wördenweber_Somorovsky_2025, title={Security Implications of Malicious G-Codes in 3D Printing}, booktitle={Proceedings of the 34th USENIX Security Symposium}, author={Rossel, Jost and Mladenov, Vladislav and Wördenweber, Nico and Somorovsky, Juraj}, year={2025}, pages={1867–1885} }","short":"J. Rossel, V. Mladenov, N. Wördenweber, J. Somorovsky, in: Proceedings of the 34th USENIX Security Symposium, 2025, pp. 1867–1885.","mla":"Rossel, Jost, et al. “Security Implications of Malicious G-Codes in 3D Printing.” <i>Proceedings of the 34th USENIX Security Symposium</i>, 2025, pp. 1867–85."},"page":"1867 - 1885","ddc":["000"],"language":[{"iso":"eng"}],"publication":"Proceedings of the 34th USENIX Security Symposium","abstract":[{"text":"The rapid growth of 3D printing technology has transformed a wide range of industries, enabling the on-demand production of complex objects, from aerospace components to medical devices. However, this technology also introduces significant security challenges. Previous research highlighted the security implications of G-Codes—commands used to control the printing process. These studies assumed powerful attackers and focused on manipulations of the printed models, leaving gaps in understanding the full attack potential.\r\n\r\nIn this study, we systematically analyze security threats associated with 3D printing, focusing specifically on vulnerabilities caused by G-Code commands. We introduce attacks and attacker models that assume a less powerful adversary than traditionally considered, broadening the scope of potential security threats. Our findings show that even minimal access to the 3D printer can result in significant security breaches, such as unauthorized access to subsequent print jobs or persistent misconfiguration of the printer. We identify 278 potentially malicious G-Codes across the attack categories Information Disclosure, Denial of Service, and Model Manipulation. Our evaluation demonstrates the applicability of these attacks across various 3D printers and their firmware. Our findings underscore the need for a better standardization process of G-Codes and corresponding security best practices.\r\n","lang":"eng"}],"file":[{"date_created":"2025-02-17T11:10:31Z","creator":"jrossel","date_updated":"2025-02-17T11:13:10Z","file_id":"58660","file_name":"Security_Analysis_of_G_Codes.pdf","access_level":"open_access","file_size":1562838,"content_type":"application/pdf","relation":"main_file"}],"date_created":"2025-02-17T11:12:17Z","title":"Security Implications of Malicious G-Codes in 3D Printing","quality_controlled":"1","year":"2025"},{"year":"2025","intvolume":"        62","citation":{"apa":"Dalfó, C., Fiol, M. A., &#38; Steffen, E. (2025). On token signed graphs. <i>Journal of Algebraic Combinatorics</i>, <i>62</i>(1), Article 7. <a href=\"https://doi.org/10.1007/s10801-025-01416-4\">https://doi.org/10.1007/s10801-025-01416-4</a>","short":"C. Dalfó, M.A. Fiol, E. Steffen, Journal of Algebraic Combinatorics 62 (2025).","bibtex":"@article{Dalfó_Fiol_Steffen_2025, title={On token signed graphs}, volume={62}, DOI={<a href=\"https://doi.org/10.1007/s10801-025-01416-4\">10.1007/s10801-025-01416-4</a>}, number={17}, journal={Journal of Algebraic Combinatorics}, publisher={Springer Science and Business Media LLC}, author={Dalfó, C. and Fiol, M. A. and Steffen, Eckhard}, year={2025} }","mla":"Dalfó, C., et al. “On Token Signed Graphs.” <i>Journal of Algebraic Combinatorics</i>, vol. 62, no. 1, 7, Springer Science and Business Media LLC, 2025, doi:<a href=\"https://doi.org/10.1007/s10801-025-01416-4\">10.1007/s10801-025-01416-4</a>.","ieee":"C. Dalfó, M. A. Fiol, and E. Steffen, “On token signed graphs,” <i>Journal of Algebraic Combinatorics</i>, vol. 62, no. 1, Art. no. 7, 2025, doi: <a href=\"https://doi.org/10.1007/s10801-025-01416-4\">10.1007/s10801-025-01416-4</a>.","chicago":"Dalfó, C., M. A. Fiol, and Eckhard Steffen. “On Token Signed Graphs.” <i>Journal of Algebraic Combinatorics</i> 62, no. 1 (2025). <a href=\"https://doi.org/10.1007/s10801-025-01416-4\">https://doi.org/10.1007/s10801-025-01416-4</a>.","ama":"Dalfó C, Fiol MA, Steffen E. On token signed graphs. <i>Journal of Algebraic Combinatorics</i>. 2025;62(1). doi:<a href=\"https://doi.org/10.1007/s10801-025-01416-4\">10.1007/s10801-025-01416-4</a>"},"publication_identifier":{"issn":["0925-9899","1572-9192"]},"publication_status":"published","issue":"1","title":"On token signed graphs","doi":"10.1007/s10801-025-01416-4","publisher":"Springer Science and Business Media LLC","date_updated":"2025-08-28T07:57:27Z","volume":62,"author":[{"first_name":"C.","full_name":"Dalfó, C.","last_name":"Dalfó"},{"full_name":"Fiol, M. A.","last_name":"Fiol","first_name":"M. A."},{"full_name":"Steffen, Eckhard","id":"15548","last_name":"Steffen","orcid":"0000-0002-9808-7401","first_name":"Eckhard"}],"date_created":"2025-08-28T07:50:03Z","abstract":[{"text":"We introduce the concept of a k-token signed graph and study some of its combinatorial and algebraic properties. We prove that two switching isomorphic signed graphs have switching isomorphic token graphs. Moreover, we show that the Laplacian spectrum of a balanced signed graph is contained in the Laplacian spectra of its k-token signed graph. Besides, we introduce and study the unbalance level of a signed graph, which is a new parameter that measures how far a signed graph is from being balanced. Moreover, we study the relation between the frustration index and the unbalance level of signed graphs and their token signed graphs.","lang":"eng"}],"status":"public","publication":"Journal of Algebraic Combinatorics","type":"journal_article","article_number":"7","language":[{"iso":"eng"}],"_id":"61042","department":[{"_id":"542"}],"user_id":"15540"},{"type":"conference","publication":"Interspeech 2025","status":"public","project":[{"name":"TRR 318; TP C06: Technisch unterstütztes Erklären von Stimmcharakteristika","_id":"129"}],"_id":"61047","user_id":"72602","department":[{"_id":"54"},{"_id":"660"}],"language":[{"iso":"eng"}],"year":"2025","citation":{"ama":"Rautenberg F, Seebauer F, Wiechmann J, Kuhlmann M, Wagner P, Haeb-Umbach R. Synthesizing Speech with Selected Perceptual Voice Qualities – A Case Study with Creaky Voice. In: <i>Interspeech 2025</i>. ISCA; 2025. doi:<a href=\"https://doi.org/10.21437/Interspeech.2025-1443\">10.21437/Interspeech.2025-1443</a>","chicago":"Rautenberg, Frederik, Fritz Seebauer, Jana Wiechmann, Michael Kuhlmann, Petra Wagner, and Reinhold Haeb-Umbach. “Synthesizing Speech with Selected Perceptual Voice Qualities – A Case Study with Creaky Voice.” In <i>Interspeech 2025</i>. ISCA, 2025. <a href=\"https://doi.org/10.21437/Interspeech.2025-1443\">https://doi.org/10.21437/Interspeech.2025-1443</a>.","ieee":"F. Rautenberg, F. Seebauer, J. Wiechmann, M. Kuhlmann, P. Wagner, and R. Haeb-Umbach, “Synthesizing Speech with Selected Perceptual Voice Qualities – A Case Study with Creaky Voice,” presented at the Interspeech, Rotterdam, 2025, doi: <a href=\"https://doi.org/10.21437/Interspeech.2025-1443\">10.21437/Interspeech.2025-1443</a>.","apa":"Rautenberg, F., Seebauer, F., Wiechmann, J., Kuhlmann, M., Wagner, P., &#38; Haeb-Umbach, R. (2025). Synthesizing Speech with Selected Perceptual Voice Qualities – A Case Study with Creaky Voice. <i>Interspeech 2025</i>. Interspeech, Rotterdam. <a href=\"https://doi.org/10.21437/Interspeech.2025-1443\">https://doi.org/10.21437/Interspeech.2025-1443</a>","short":"F. Rautenberg, F. Seebauer, J. Wiechmann, M. Kuhlmann, P. Wagner, R. Haeb-Umbach, in: Interspeech 2025, ISCA, 2025.","bibtex":"@inproceedings{Rautenberg_Seebauer_Wiechmann_Kuhlmann_Wagner_Haeb-Umbach_2025, title={Synthesizing Speech with Selected Perceptual Voice Qualities – A Case Study with Creaky Voice}, DOI={<a href=\"https://doi.org/10.21437/Interspeech.2025-1443\">10.21437/Interspeech.2025-1443</a>}, booktitle={Interspeech 2025}, publisher={ISCA}, author={Rautenberg, Frederik and Seebauer, Fritz and Wiechmann, Jana and Kuhlmann, Michael and Wagner, Petra and Haeb-Umbach, Reinhold}, year={2025} }","mla":"Rautenberg, Frederik, et al. “Synthesizing Speech with Selected Perceptual Voice Qualities – A Case Study with Creaky Voice.” <i>Interspeech 2025</i>, ISCA, 2025, doi:<a href=\"https://doi.org/10.21437/Interspeech.2025-1443\">10.21437/Interspeech.2025-1443</a>."},"publisher":"ISCA","date_updated":"2025-08-28T08:56:49Z","date_created":"2025-08-28T08:39:01Z","author":[{"first_name":"Frederik","full_name":"Rautenberg, Frederik","id":"72602","last_name":"Rautenberg"},{"first_name":"Fritz","full_name":"Seebauer, Fritz","last_name":"Seebauer"},{"first_name":"Jana","last_name":"Wiechmann","full_name":"Wiechmann, Jana"},{"first_name":"Michael","last_name":"Kuhlmann","id":"49871","full_name":"Kuhlmann, Michael"},{"last_name":"Wagner","full_name":"Wagner, Petra","first_name":"Petra"},{"first_name":"Reinhold","last_name":"Haeb-Umbach","id":"242","full_name":"Haeb-Umbach, Reinhold"}],"title":"Synthesizing Speech with Selected Perceptual Voice Qualities – A Case Study with Creaky Voice","doi":"10.21437/Interspeech.2025-1443","conference":{"location":"Rotterdam","end_date":"2025-08-21","start_date":"2025-08-17","name":"Interspeech"}},{"_id":"61090","department":[{"_id":"69"}],"series_title":"LIPIcs","user_id":"14961","language":[{"iso":"eng"}],"publication":"23rd International Symposium on Experimental Algorithms","type":"conference","status":"public","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","date_updated":"2025-08-29T12:02:08Z","volume":228,"author":[{"first_name":"Enno","last_name":"Adler","full_name":"Adler, Enno"},{"last_name":"Böttcher","id":"624","full_name":"Böttcher, Stefan","first_name":"Stefan"},{"first_name":"Rita","last_name":"Hartel","full_name":"Hartel, Rita","id":"14961"},{"full_name":"Steininger, Cedric Alexander","last_name":"Steininger","first_name":"Cedric Alexander"}],"date_created":"2025-08-29T12:01:53Z","title":"IBB: Fast Burrows-Wheeler Transform Construction for Length-Diverse DNA Data","year":"2025","place":"Venice, Italy","intvolume":"       228","page":"2:1--2:18","citation":{"mla":"Adler, Enno, et al. “IBB: Fast Burrows-Wheeler Transform Construction for Length-Diverse DNA Data.” <i>23rd International Symposium on Experimental Algorithms</i>, vol. 228, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2025, p. 2:1--2:18.","bibtex":"@inproceedings{Adler_Böttcher_Hartel_Steininger_2025, place={Venice, Italy}, series={LIPIcs}, title={IBB: Fast Burrows-Wheeler Transform Construction for Length-Diverse DNA Data}, volume={228}, booktitle={23rd International Symposium on Experimental Algorithms}, publisher={Schloss Dagstuhl - Leibniz-Zentrum für Informatik}, author={Adler, Enno and Böttcher, Stefan and Hartel, Rita and Steininger, Cedric Alexander}, year={2025}, pages={2:1--2:18}, collection={LIPIcs} }","short":"E. Adler, S. Böttcher, R. Hartel, C.A. Steininger, in: 23rd International Symposium on Experimental Algorithms, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Venice, Italy, 2025, p. 2:1--2:18.","apa":"Adler, E., Böttcher, S., Hartel, R., &#38; Steininger, C. A. (2025). IBB: Fast Burrows-Wheeler Transform Construction for Length-Diverse DNA Data. <i>23rd International Symposium on Experimental Algorithms</i>, <i>228</i>, 2:1--2:18.","chicago":"Adler, Enno, Stefan Böttcher, Rita Hartel, and Cedric Alexander Steininger. “IBB: Fast Burrows-Wheeler Transform Construction for Length-Diverse DNA Data.” In <i>23rd International Symposium on Experimental Algorithms</i>, 228:2:1--2:18. LIPIcs. Venice, Italy: Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2025.","ieee":"E. Adler, S. Böttcher, R. Hartel, and C. A. Steininger, “IBB: Fast Burrows-Wheeler Transform Construction for Length-Diverse DNA Data,” in <i>23rd International Symposium on Experimental Algorithms</i>, 2025, vol. 228, p. 2:1--2:18.","ama":"Adler E, Böttcher S, Hartel R, Steininger CA. IBB: Fast Burrows-Wheeler Transform Construction for Length-Diverse DNA Data. In: <i>23rd International Symposium on Experimental Algorithms</i>. Vol 228. LIPIcs. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2025:2:1--2:18."}},{"year":"2025","citation":{"ama":"Kummita S, Miao M, Bodden E, Wei S. Visualization Task Taxonomy to Understand the Fuzzing Internals. <i>ACM Transactions on Software Engineering and Methodology</i>. Published online 2025. doi:<a href=\"https://doi.org/10.1145/3718346\">10.1145/3718346</a>","ieee":"S. Kummita, M. Miao, E. Bodden, and S. Wei, “Visualization Task Taxonomy to Understand the Fuzzing Internals,” <i>ACM Transactions on Software Engineering and Methodology</i>, Art. no. 3718346, 2025, doi: <a href=\"https://doi.org/10.1145/3718346\">10.1145/3718346</a>.","chicago":"Kummita, Sriteja, Miao Miao, Eric Bodden, and Shiyi Wei. “Visualization Task Taxonomy to Understand the Fuzzing Internals.” <i>ACM Transactions on Software Engineering and Methodology</i>, 2025. <a href=\"https://doi.org/10.1145/3718346\">https://doi.org/10.1145/3718346</a>.","bibtex":"@article{Kummita_Miao_Bodden_Wei_2025, title={Visualization Task Taxonomy to Understand the Fuzzing Internals}, DOI={<a href=\"https://doi.org/10.1145/3718346\">10.1145/3718346</a>}, number={3718346}, journal={ACM Transactions on Software Engineering and Methodology}, publisher={Association for Computing Machinery (ACM)}, author={Kummita, Sriteja and Miao, Miao and Bodden, Eric and Wei, Shiyi}, year={2025} }","mla":"Kummita, Sriteja, et al. “Visualization Task Taxonomy to Understand the Fuzzing Internals.” <i>ACM Transactions on Software Engineering and Methodology</i>, 3718346, Association for Computing Machinery (ACM), 2025, doi:<a href=\"https://doi.org/10.1145/3718346\">10.1145/3718346</a>.","short":"S. Kummita, M. Miao, E. Bodden, S. Wei, ACM Transactions on Software Engineering and Methodology (2025).","apa":"Kummita, S., Miao, M., Bodden, E., &#38; Wei, S. (2025). Visualization Task Taxonomy to Understand the Fuzzing Internals. <i>ACM Transactions on Software Engineering and Methodology</i>, Article 3718346. <a href=\"https://doi.org/10.1145/3718346\">https://doi.org/10.1145/3718346</a>"},"publication_identifier":{"issn":["1049-331X","1557-7392"]},"publication_status":"published","title":"Visualization Task Taxonomy to Understand the Fuzzing Internals","doi":"10.1145/3718346","publisher":"Association for Computing Machinery (ACM)","date_updated":"2025-09-01T10:16:03Z","date_created":"2025-09-01T10:15:26Z","author":[{"id":"72582","full_name":"Kummita, Sriteja","last_name":"Kummita","first_name":"Sriteja"},{"last_name":"Miao","full_name":"Miao, Miao","first_name":"Miao"},{"orcid":"0000-0003-3470-3647","last_name":"Bodden","id":"59256","full_name":"Bodden, Eric","first_name":"Eric"},{"full_name":"Wei, Shiyi","last_name":"Wei","first_name":"Shiyi"}],"abstract":[{"text":"<jats:p>Greybox fuzzing is used extensively in research and practice. There are umpteen publications that improve greybox fuzzing. However, to what extent do these improvements affect the internal components or internals of a given fuzzer is not yet understood as the improvements are mostly evaluated using code coverage and bug finding capability. Such an evaluation is insufficient to understand the effect of improvements on the fuzzer internals. Some of the literature visualizes the outcomes of fuzzing to enhance the understanding. However, they only focus on high-level information and no previous research on visualization has been dedicated to understanding fuzzing internals.</jats:p>\r\n          <jats:p>To close this gap, we propose the first step towards development of a fuzzing-specific visualization framework: a taxonomy of visualization analysis tasks that fuzzing experts desire to help them understand the fuzzing internals. Our approach involves conducting interviews with fuzzing experts and using qualitative data analysis to systematically extract the task taxonomy from the interview data. We also evaluate the support of existing fuzzing visualization tools through the lens of our taxonomy. In our study, we have conducted 33 interviews with fuzzing practitioners and extracted a taxonomy of 120 visualization analysis tasks. Our evaluation shows that the existing fuzzing visualization tools only provide aids to support 10 of them.</jats:p>","lang":"eng"}],"status":"public","publication":"ACM Transactions on Software Engineering and Methodology","type":"journal_article","article_number":"3718346","language":[{"iso":"eng"}],"_id":"61108","department":[{"_id":"76"}],"user_id":"15249"},{"main_file_link":[{"open_access":"1","url":"https://doi.org/10.1515/dmvm-2025-0053"}],"title":"studiVEMINT Mathematik-Online-Vorkurs jetzt mit 300 integrierten Lernvideos frei verfügbar","volume":33,"author":[{"first_name":"Rolf","last_name":"Biehler","full_name":"Biehler, Rolf","id":"16274"},{"first_name":"Michael","full_name":"Liebendörfer, Michael","last_name":"Liebendörfer"},{"last_name":"Schmitz","full_name":"Schmitz, Angela","first_name":"Angela"},{"first_name":"Birte","last_name":"Reich","full_name":"Reich, Birte"}],"date_created":"2025-09-04T09:23:47Z","oa":"1","publisher":"De Gruyter","date_updated":"2025-09-04T09:25:03Z","page":"170–171","intvolume":"        33","citation":{"ieee":"R. Biehler, M. Liebendörfer, A. Schmitz, and B. Reich, “studiVEMINT Mathematik-Online-Vorkurs jetzt mit 300 integrierten Lernvideos frei verfügbar,” <i>Mitteilungen der Deutschen Mathematiker-Vereinigung</i>, vol. 33, no. 3, pp. 170–171, 2025.","chicago":"Biehler, Rolf, Michael Liebendörfer, Angela Schmitz, and Birte Reich. “studiVEMINT Mathematik-Online-Vorkurs jetzt mit 300 integrierten Lernvideos frei verfügbar.” <i>Mitteilungen der Deutschen Mathematiker-Vereinigung</i> 33, no. 3 (2025): 170–171.","ama":"Biehler R, Liebendörfer M, Schmitz A, Reich B. studiVEMINT Mathematik-Online-Vorkurs jetzt mit 300 integrierten Lernvideos frei verfügbar. <i>Mitteilungen der Deutschen Mathematiker-Vereinigung</i>. 2025;33(3):170–171.","short":"R. Biehler, M. Liebendörfer, A. Schmitz, B. Reich, Mitteilungen der Deutschen Mathematiker-Vereinigung 33 (2025) 170–171.","bibtex":"@article{Biehler_Liebendörfer_Schmitz_Reich_2025, title={studiVEMINT Mathematik-Online-Vorkurs jetzt mit 300 integrierten Lernvideos frei verfügbar}, volume={33}, number={3}, journal={Mitteilungen der Deutschen Mathematiker-Vereinigung}, publisher={De Gruyter}, author={Biehler, Rolf and Liebendörfer, Michael and Schmitz, Angela and Reich, Birte}, year={2025}, pages={170–171} }","mla":"Biehler, Rolf, et al. “studiVEMINT Mathematik-Online-Vorkurs jetzt mit 300 integrierten Lernvideos frei verfügbar.” <i>Mitteilungen der Deutschen Mathematiker-Vereinigung</i>, vol. 33, no. 3, De Gruyter, 2025, pp. 170–171.","apa":"Biehler, R., Liebendörfer, M., Schmitz, A., &#38; Reich, B. (2025). studiVEMINT Mathematik-Online-Vorkurs jetzt mit 300 integrierten Lernvideos frei verfügbar. <i>Mitteilungen der Deutschen Mathematiker-Vereinigung</i>, <i>33</i>(3), 170–171."},"year":"2025","issue":"3","publication_status":"published","language":[{"iso":"ger"}],"department":[{"_id":"363"}],"user_id":"37888","_id":"61125","status":"public","publication":"Mitteilungen der Deutschen Mathematiker-Vereinigung","type":"journal_article"},{"status":"public","publication":"Ultrasonics","type":"journal_article","language":[{"iso":"eng"}],"article_number":"107799","department":[{"_id":"49"}],"user_id":"32580","_id":"61140","project":[{"_id":"105","name":"Vermiedene Kreuzungen von Lamb-Wellenmoden in mehrlagigen Strukturen"}],"intvolume":"       158","citation":{"ieee":"M. Nicolai, J. Bulling, M. M. Narayanan, H. Zeipert, J. Prager, and B. Henning, “Dynamic interface behavior in coupled plates: Investigating Lamb wave mode repulsion with a spring-based model,” <i>Ultrasonics</i>, vol. 158, Art. no. 107799, 2025, doi: <a href=\"https://doi.org/10.1016/j.ultras.2025.107799\">10.1016/j.ultras.2025.107799</a>.","chicago":"Nicolai, Marcel, Jannis Bulling, M.M. Narayanan, Henning Zeipert, Jens Prager, and Bernd Henning. “Dynamic Interface Behavior in Coupled Plates: Investigating Lamb Wave Mode Repulsion with a Spring-Based Model.” <i>Ultrasonics</i> 158 (2025). <a href=\"https://doi.org/10.1016/j.ultras.2025.107799\">https://doi.org/10.1016/j.ultras.2025.107799</a>.","ama":"Nicolai M, Bulling J, Narayanan MM, Zeipert H, Prager J, Henning B. Dynamic interface behavior in coupled plates: Investigating Lamb wave mode repulsion with a spring-based model. <i>Ultrasonics</i>. 2025;158. doi:<a href=\"https://doi.org/10.1016/j.ultras.2025.107799\">10.1016/j.ultras.2025.107799</a>","apa":"Nicolai, M., Bulling, J., Narayanan, M. M., Zeipert, H., Prager, J., &#38; Henning, B. (2025). Dynamic interface behavior in coupled plates: Investigating Lamb wave mode repulsion with a spring-based model. <i>Ultrasonics</i>, <i>158</i>, Article 107799. <a href=\"https://doi.org/10.1016/j.ultras.2025.107799\">https://doi.org/10.1016/j.ultras.2025.107799</a>","bibtex":"@article{Nicolai_Bulling_Narayanan_Zeipert_Prager_Henning_2025, title={Dynamic interface behavior in coupled plates: Investigating Lamb wave mode repulsion with a spring-based model}, volume={158}, DOI={<a href=\"https://doi.org/10.1016/j.ultras.2025.107799\">10.1016/j.ultras.2025.107799</a>}, number={107799}, journal={Ultrasonics}, publisher={Elsevier BV}, author={Nicolai, Marcel and Bulling, Jannis and Narayanan, M.M. and Zeipert, Henning and Prager, Jens and Henning, Bernd}, year={2025} }","mla":"Nicolai, Marcel, et al. “Dynamic Interface Behavior in Coupled Plates: Investigating Lamb Wave Mode Repulsion with a Spring-Based Model.” <i>Ultrasonics</i>, vol. 158, 107799, Elsevier BV, 2025, doi:<a href=\"https://doi.org/10.1016/j.ultras.2025.107799\">10.1016/j.ultras.2025.107799</a>.","short":"M. Nicolai, J. Bulling, M.M. Narayanan, H. Zeipert, J. Prager, B. Henning, Ultrasonics 158 (2025)."},"year":"2025","publication_identifier":{"issn":["0041-624X"]},"publication_status":"published","doi":"10.1016/j.ultras.2025.107799","title":"Dynamic interface behavior in coupled plates: Investigating Lamb wave mode repulsion with a spring-based model","volume":158,"author":[{"last_name":"Nicolai","full_name":"Nicolai, Marcel","first_name":"Marcel"},{"first_name":"Jannis","full_name":"Bulling, Jannis","last_name":"Bulling"},{"first_name":"M.M.","full_name":"Narayanan, M.M.","last_name":"Narayanan"},{"first_name":"Henning","last_name":"Zeipert","full_name":"Zeipert, Henning","id":"32580"},{"first_name":"Jens","full_name":"Prager, Jens","last_name":"Prager"},{"last_name":"Henning","full_name":"Henning, Bernd","id":"213","first_name":"Bernd"}],"date_created":"2025-09-08T06:50:08Z","date_updated":"2025-09-08T06:51:16Z","publisher":"Elsevier BV"},{"citation":{"mla":"Kablo, Emiram, et al. “PrivaCI in VR: Exploring Perceptions and Acceptability of Data Sharing in Virtual Reality Through Contextual Integrity.” <i>34th USENIX Security Symposium (USENIX Security 25)</i>, 2025, pp. 1531–1548.","bibtex":"@inproceedings{Kablo_Kleber_Arias Cabarcos_2025, title={PrivaCI in VR: Exploring Perceptions and Acceptability of Data Sharing in Virtual Reality Through Contextual Integrity}, booktitle={34th USENIX Security Symposium (USENIX Security 25)}, author={Kablo, Emiram and Kleber, Melina and Arias Cabarcos, Patricia}, year={2025}, pages={1531–1548} }","short":"E. Kablo, M. Kleber, P. Arias Cabarcos, in: 34th USENIX Security Symposium (USENIX Security 25), 2025, pp. 1531–1548.","apa":"Kablo, E., Kleber, M., &#38; Arias Cabarcos, P. (2025). PrivaCI in VR: Exploring Perceptions and Acceptability of Data Sharing in Virtual Reality Through Contextual Integrity. <i>34th USENIX Security Symposium (USENIX Security 25)</i>, 1531–1548.","ieee":"E. Kablo, M. Kleber, and P. Arias Cabarcos, “PrivaCI in VR: Exploring Perceptions and Acceptability of Data Sharing in Virtual Reality Through Contextual Integrity,” in <i>34th USENIX Security Symposium (USENIX Security 25)</i>, 2025, pp. 1531–1548.","chicago":"Kablo, Emiram, Melina Kleber, and Patricia Arias Cabarcos. “PrivaCI in VR: Exploring Perceptions and Acceptability of Data Sharing in Virtual Reality Through Contextual Integrity.” In <i>34th USENIX Security Symposium (USENIX Security 25)</i>, 1531–1548, 2025.","ama":"Kablo E, Kleber M, Arias Cabarcos P. PrivaCI in VR: Exploring Perceptions and Acceptability of Data Sharing in Virtual Reality Through Contextual Integrity. In: <i>34th USENIX Security Symposium (USENIX Security 25)</i>. ; 2025:1531–1548."},"page":"1531–1548","year":"2025","date_created":"2025-09-08T08:45:30Z","author":[{"first_name":"Emiram","last_name":"Kablo","full_name":"Kablo, Emiram","id":"46433"},{"first_name":"Melina","last_name":"Kleber","full_name":"Kleber, Melina"},{"first_name":"Patricia","last_name":"Arias Cabarcos","full_name":"Arias Cabarcos, Patricia","id":"92804"}],"date_updated":"2025-09-08T08:48:37Z","oa":"1","main_file_link":[{"open_access":"1","url":"https://www.usenix.org/conference/usenixsecurity25/presentation/kablo"}],"title":"PrivaCI in VR: Exploring Perceptions and Acceptability of Data Sharing in Virtual Reality Through Contextual Integrity","type":"conference","publication":"34th USENIX Security Symposium (USENIX Security 25)","status":"public","user_id":"46433","department":[{"_id":"679"}],"_id":"61144","language":[{"iso":"eng"}]},{"external_id":{"unknown":["10.1145/3749838"]},"ddc":["006"],"keyword":["fact checking","knowledge graphs","fact-checkers","check worthiness","evidence retrieval","trust","veracity."],"language":[{"iso":"eng"}],"publication":"ACM Computing Surveys","abstract":[{"lang":"eng","text":"<jats:p>Knowledge graphs are used by a growing number of applications to represent structured data. Hence, evaluating the veracity of assertions in knowledge graphs—dubbed fact checking—is currently a challenge of growing importance. However, manual fact checking is commonly impractical due to the sheer size of knowledge graphs. This paper is a systematic survey of recent works on automatic fact checking with a focus on knowledge graphs. We present recent fact-checking approaches, the varied sources they use as background knowledge, and the features they rely upon. Finally, we draw conclusions pertaining to possible future research directions in fact checking knowledge graphs.</jats:p>"}],"file":[{"access_level":"closed","file_id":"61195","file_name":"3749838.pdf","file_size":1062387,"creator":"uqudus","date_created":"2025-09-11T09:26:29Z","date_updated":"2025-09-11T09:26:29Z","relation":"main_file","success":1,"content_type":"application/pdf"}],"publisher":"Association for Computing Machinery (ACM)","date_created":"2025-09-03T15:46:43Z","title":"Fact Checking Knowledge Graphs -- A Survey","quality_controlled":"1","year":"2025","_id":"61123","user_id":"83392","department":[{"_id":"574"}],"article_number":"3749838","article_type":"original","file_date_updated":"2025-09-11T09:26:29Z","popular_science":"1","type":"journal_article","status":"public","date_updated":"2025-09-11T09:30:28Z","oa":"1","author":[{"id":"83392","full_name":"Qudus, Umair","last_name":"Qudus","orcid":"0000-0001-6714-8729","first_name":"Umair"},{"first_name":"Michael","last_name":"Röder","orcid":"https://orcid.org/0000-0002-8609-8277","full_name":"Röder, Michael","id":"67199"},{"first_name":"Muhammad","last_name":"Saleem","full_name":"Saleem, Muhammad"},{"last_name":"Ngonga Ngomo","full_name":"Ngonga Ngomo, Axel-Cyrille","id":"65716","first_name":"Axel-Cyrille"}],"volume":58,"main_file_link":[{"open_access":"1","url":"https://dl.acm.org/doi/pdf/10.1145/3749838"}],"doi":"10.1145/3749838","publication_status":"published","publication_identifier":{"issn":["0360-0300","1557-7341"]},"has_accepted_license":"1","citation":{"short":"U. Qudus, M. Röder, M. Saleem, A.-C. Ngonga Ngomo, ACM Computing Surveys 58 (2025).","mla":"Qudus, Umair, et al. “Fact Checking Knowledge Graphs -- A Survey.” <i>ACM Computing Surveys</i>, vol. 58, 3749838, Association for Computing Machinery (ACM), 2025, doi:<a href=\"https://doi.org/10.1145/3749838\">10.1145/3749838</a>.","bibtex":"@article{Qudus_Röder_Saleem_Ngonga Ngomo_2025, title={Fact Checking Knowledge Graphs -- A Survey}, volume={58}, DOI={<a href=\"https://doi.org/10.1145/3749838\">10.1145/3749838</a>}, number={3749838}, journal={ACM Computing Surveys}, publisher={Association for Computing Machinery (ACM)}, author={Qudus, Umair and Röder, Michael and Saleem, Muhammad and Ngonga Ngomo, Axel-Cyrille}, year={2025} }","apa":"Qudus, U., Röder, M., Saleem, M., &#38; Ngonga Ngomo, A.-C. (2025). Fact Checking Knowledge Graphs -- A Survey. <i>ACM Computing Surveys</i>, <i>58</i>, Article 3749838. <a href=\"https://doi.org/10.1145/3749838\">https://doi.org/10.1145/3749838</a>","ama":"Qudus U, Röder M, Saleem M, Ngonga Ngomo A-C. Fact Checking Knowledge Graphs -- A Survey. <i>ACM Computing Surveys</i>. 2025;58. doi:<a href=\"https://doi.org/10.1145/3749838\">10.1145/3749838</a>","ieee":"U. Qudus, M. Röder, M. Saleem, and A.-C. Ngonga Ngomo, “Fact Checking Knowledge Graphs -- A Survey,” <i>ACM Computing Surveys</i>, vol. 58, Art. no. 3749838, 2025, doi: <a href=\"https://doi.org/10.1145/3749838\">10.1145/3749838</a>.","chicago":"Qudus, Umair, Michael Röder, Muhammad Saleem, and Axel-Cyrille Ngonga Ngomo. “Fact Checking Knowledge Graphs -- A Survey.” <i>ACM Computing Surveys</i> 58 (2025). <a href=\"https://doi.org/10.1145/3749838\">https://doi.org/10.1145/3749838</a>."},"intvolume":"        58"},{"year":"2025","citation":{"short":"M. Hannula, M. Hirvonen, J. Kontinen, Y. Mahmood, A. Meier, J. Virtema, Journal of Logic and Computation 35 (2025).","bibtex":"@article{Hannula_Hirvonen_Kontinen_Mahmood_Meier_Virtema_2025, title={Logics with probabilistic team semantics and the Boolean negation}, volume={35}, DOI={<a href=\"https://doi.org/10.1093/logcom/exaf021\">10.1093/logcom/exaf021</a>}, number={3}, journal={Journal of Logic and Computation}, publisher={Oxford University Press (OUP)}, author={Hannula, Miika and Hirvonen, Minna and Kontinen, Juha and Mahmood, Yasir and Meier, Arne and Virtema, Jonni}, year={2025} }","mla":"Hannula, Miika, et al. “Logics with Probabilistic Team Semantics and the Boolean Negation.” <i>Journal of Logic and Computation</i>, vol. 35, no. 3, Oxford University Press (OUP), 2025, doi:<a href=\"https://doi.org/10.1093/logcom/exaf021\">10.1093/logcom/exaf021</a>.","apa":"Hannula, M., Hirvonen, M., Kontinen, J., Mahmood, Y., Meier, A., &#38; Virtema, J. (2025). Logics with probabilistic team semantics and the Boolean negation. <i>Journal of Logic and Computation</i>, <i>35</i>(3). <a href=\"https://doi.org/10.1093/logcom/exaf021\">https://doi.org/10.1093/logcom/exaf021</a>","ama":"Hannula M, Hirvonen M, Kontinen J, Mahmood Y, Meier A, Virtema J. Logics with probabilistic team semantics and the Boolean negation. <i>Journal of Logic and Computation</i>. 2025;35(3). doi:<a href=\"https://doi.org/10.1093/logcom/exaf021\">10.1093/logcom/exaf021</a>","ieee":"M. Hannula, M. Hirvonen, J. Kontinen, Y. Mahmood, A. Meier, and J. Virtema, “Logics with probabilistic team semantics and the Boolean negation,” <i>Journal of Logic and Computation</i>, vol. 35, no. 3, 2025, doi: <a href=\"https://doi.org/10.1093/logcom/exaf021\">10.1093/logcom/exaf021</a>.","chicago":"Hannula, Miika, Minna Hirvonen, Juha Kontinen, Yasir Mahmood, Arne Meier, and Jonni Virtema. “Logics with Probabilistic Team Semantics and the Boolean Negation.” <i>Journal of Logic and Computation</i> 35, no. 3 (2025). <a href=\"https://doi.org/10.1093/logcom/exaf021\">https://doi.org/10.1093/logcom/exaf021</a>."},"intvolume":"        35","publication_status":"published","publication_identifier":{"issn":["0955-792X","1465-363X"]},"issue":"3","title":"Logics with probabilistic team semantics and the Boolean negation","doi":"10.1093/logcom/exaf021","date_updated":"2025-09-11T10:00:26Z","publisher":"Oxford University Press (OUP)","author":[{"first_name":"Miika","last_name":"Hannula","full_name":"Hannula, Miika"},{"first_name":"Minna","full_name":"Hirvonen, Minna","last_name":"Hirvonen"},{"last_name":"Kontinen","full_name":"Kontinen, Juha","first_name":"Juha"},{"first_name":"Yasir","id":"99353","full_name":"Mahmood, Yasir","last_name":"Mahmood"},{"last_name":"Meier","full_name":"Meier, Arne","first_name":"Arne"},{"first_name":"Jonni","full_name":"Virtema, Jonni","last_name":"Virtema"}],"date_created":"2025-05-15T11:07:28Z","volume":35,"abstract":[{"text":"<jats:title>Abstract</jats:title>\r\n               <jats:p>We study the expressivity and the complexity of various logics in probabilistic team semantics with the Boolean negation. In particular, we study the extension of probabilistic independence logic with the Boolean negation, and a recently introduced logic first-order theory of random variables with probabilistic independence. We give several results that compare the expressivity of these logics with the most studied logics in probabilistic team semantics setting, as well as relating their expressivity to a numerical variant of second-order logic. In addition, we introduce novel entropy atoms and show that the extension of first-order logic by entropy atoms subsumes probabilistic independence logic. Finally, we obtain some results on the complexity of model checking, validity and satisfiability of our logics.</jats:p>","lang":"eng"}],"status":"public","type":"journal_article","publication":"Journal of Logic and Computation","language":[{"iso":"eng"}],"project":[{"_id":"121","name":"TRR 318; TP B01: Ein dialogbasierter Ansatz zur Erklärung von Modellen des maschinellen Lernens"}],"_id":"59912","user_id":"99353","department":[{"_id":"574"}]},{"date_created":"2025-03-17T13:41:48Z","author":[{"first_name":"Asep Fajar","last_name":"Firmansyah","id":"76787","full_name":"Firmansyah, Asep Fajar"},{"id":"72768","full_name":"Zahera, Hamada Mohamed Abdelsamee","orcid":"0000-0003-0215-1278","last_name":"Zahera","first_name":"Hamada Mohamed Abdelsamee"},{"id":"67234","full_name":"Sherif, Mohamed","last_name":"Sherif","orcid":"https://orcid.org/0000-0002-9927-2203","first_name":"Mohamed"},{"full_name":"Moussallem, Diego","id":"71635","last_name":"Moussallem","first_name":"Diego"},{"last_name":"Ngonga Ngomo","id":"65716","full_name":"Ngonga Ngomo, Axel-Cyrille","first_name":"Axel-Cyrille"}],"publisher":"pringer Nature Switzerland","date_updated":"2025-09-11T10:00:44Z","doi":"10.1007/978-3-031-94575-5_8","conference":{"name":"ESWC 2025"},"title":"ANTS: Abstractive Entity Summarization in Knowledge Graphs","publication_identifier":{"isbn":["978-3-031-94575-5"]},"publication_status":"published","page":"133--151","citation":{"bibtex":"@inproceedings{Firmansyah_Zahera_Sherif_Moussallem_Ngonga Ngomo_2025, series={The Semantic Web}, title={ANTS: Abstractive Entity Summarization in Knowledge Graphs}, DOI={<a href=\"https://doi.org/10.1007/978-3-031-94575-5_8\">10.1007/978-3-031-94575-5_8</a>}, booktitle={ESWC2025}, publisher={pringer Nature Switzerland}, author={Firmansyah, Asep Fajar and Zahera, Hamada Mohamed Abdelsamee and Sherif, Mohamed and Moussallem, Diego and Ngonga Ngomo, Axel-Cyrille}, year={2025}, pages={133--151}, collection={The Semantic Web} }","mla":"Firmansyah, Asep Fajar, et al. “ANTS: Abstractive Entity Summarization in Knowledge Graphs.” <i>ESWC2025</i>, pringer Nature Switzerland, 2025, pp. 133--151, doi:<a href=\"https://doi.org/10.1007/978-3-031-94575-5_8\">10.1007/978-3-031-94575-5_8</a>.","short":"A.F. Firmansyah, H.M.A. Zahera, M. Sherif, D. Moussallem, A.-C. Ngonga Ngomo, in: ESWC2025, pringer Nature Switzerland, 2025, pp. 133--151.","apa":"Firmansyah, A. F., Zahera, H. M. A., Sherif, M., Moussallem, D., &#38; Ngonga Ngomo, A.-C. (2025). ANTS: Abstractive Entity Summarization in Knowledge Graphs. <i>ESWC2025</i>, 133--151. <a href=\"https://doi.org/10.1007/978-3-031-94575-5_8\">https://doi.org/10.1007/978-3-031-94575-5_8</a>","chicago":"Firmansyah, Asep Fajar, Hamada Mohamed Abdelsamee Zahera, Mohamed Sherif, Diego Moussallem, and Axel-Cyrille Ngonga Ngomo. “ANTS: Abstractive Entity Summarization in Knowledge Graphs.” In <i>ESWC2025</i>, 133--151. The Semantic Web. pringer Nature Switzerland, 2025. <a href=\"https://doi.org/10.1007/978-3-031-94575-5_8\">https://doi.org/10.1007/978-3-031-94575-5_8</a>.","ieee":"A. F. Firmansyah, H. M. A. Zahera, M. Sherif, D. Moussallem, and A.-C. Ngonga Ngomo, “ANTS: Abstractive Entity Summarization in Knowledge Graphs,” in <i>ESWC2025</i>, 2025, pp. 133--151, doi: <a href=\"https://doi.org/10.1007/978-3-031-94575-5_8\">10.1007/978-3-031-94575-5_8</a>.","ama":"Firmansyah AF, Zahera HMA, Sherif M, Moussallem D, Ngonga Ngomo A-C. ANTS: Abstractive Entity Summarization in Knowledge Graphs. In: <i>ESWC2025</i>. The Semantic Web. pringer Nature Switzerland; 2025:133--151. doi:<a href=\"https://doi.org/10.1007/978-3-031-94575-5_8\">10.1007/978-3-031-94575-5_8</a>"},"year":"2025","department":[{"_id":"574"}],"series_title":"The Semantic Web","user_id":"67234","_id":"59054","language":[{"iso":"eng"}],"keyword":["firmansyah mousallem ngonga sherif zahera"],"publication":"ESWC2025","type":"conference","status":"public"},{"citation":{"ama":"Fichte J, Fröhlich N, Hecher M, et al. Facets in Argumentation: A Formal Approach to Argument Significance. <i>arXiv:250510982</i>. Published online 2025.","ieee":"J. Fichte <i>et al.</i>, “Facets in Argumentation: A Formal Approach to Argument Significance,” <i>arXiv:2505.10982</i>. 2025.","chicago":"Fichte, Johannes, Nicolas Fröhlich, Markus Hecher, Victor Lagerkvist, Yasir Mahmood, Arne Meier, and Jonathan Persson. “Facets in Argumentation: A Formal Approach to Argument Significance.” <i>ArXiv:2505.10982</i>, 2025.","apa":"Fichte, J., Fröhlich, N., Hecher, M., Lagerkvist, V., Mahmood, Y., Meier, A., &#38; Persson, J. (2025). Facets in Argumentation: A Formal Approach to Argument Significance. In <i>arXiv:2505.10982</i>.","bibtex":"@article{Fichte_Fröhlich_Hecher_Lagerkvist_Mahmood_Meier_Persson_2025, title={Facets in Argumentation: A Formal Approach to Argument Significance}, journal={arXiv:2505.10982}, author={Fichte, Johannes and Fröhlich, Nicolas and Hecher, Markus and Lagerkvist, Victor and Mahmood, Yasir and Meier, Arne and Persson, Jonathan}, year={2025} }","short":"J. Fichte, N. Fröhlich, M. Hecher, V. Lagerkvist, Y. Mahmood, A. Meier, J. Persson, ArXiv:2505.10982 (2025).","mla":"Fichte, Johannes, et al. “Facets in Argumentation: A Formal Approach to Argument Significance.” <i>ArXiv:2505.10982</i>, 2025."},"year":"2025","date_created":"2025-08-29T08:07:43Z","author":[{"first_name":"Johannes","full_name":"Fichte, Johannes","last_name":"Fichte"},{"full_name":"Fröhlich, Nicolas","last_name":"Fröhlich","first_name":"Nicolas"},{"last_name":"Hecher","full_name":"Hecher, Markus","first_name":"Markus"},{"first_name":"Victor","full_name":"Lagerkvist, Victor","last_name":"Lagerkvist"},{"first_name":"Yasir","last_name":"Mahmood","id":"99353","full_name":"Mahmood, Yasir"},{"first_name":"Arne","full_name":"Meier, Arne","last_name":"Meier"},{"first_name":"Jonathan","last_name":"Persson","full_name":"Persson, Jonathan"}],"date_updated":"2025-09-11T09:58:34Z","title":"Facets in Argumentation: A Formal Approach to Argument Significance","publication":"arXiv:2505.10982","type":"preprint","status":"public","abstract":[{"lang":"eng","text":"Argumentation is a central subarea of Artificial Intelligence (AI) for\r\nmodeling and reasoning about arguments. The semantics of abstract argumentation\r\nframeworks (AFs) is given by sets of arguments (extensions) and conditions on\r\nthe relationship between them, such as stable or admissible. Today's solvers\r\nimplement tasks such as finding extensions, deciding credulous or skeptical\r\nacceptance, counting, or enumerating extensions. While these tasks are well\r\ncharted, the area between decision, counting/enumeration and fine-grained\r\nreasoning requires expensive reasoning so far. We introduce a novel concept\r\n(facets) for reasoning between decision and enumeration. Facets are arguments\r\nthat belong to some extensions (credulous) but not to all extensions\r\n(skeptical). They are most natural when a user aims to navigate, filter, or\r\ncomprehend the significance of specific arguments, according to their needs. We\r\nstudy the complexity and show that tasks involving facets are much easier than\r\ncounting extensions. Finally, we provide an implementation, and conduct\r\nexperiments to demonstrate feasibility."}],"department":[{"_id":"574"}],"user_id":"99353","external_id":{"arxiv":["2505.10982"]},"_id":"61066","project":[{"name":"TRR 318; TP B01: Ein dialogbasierter Ansatz zur Erklärung von Modellen des maschinellen Lernens","_id":"121"}],"language":[{"iso":"eng"}]},{"title":"GLIDE: Knowledge Graph Linking using Distance-Aware Embeddings","conference":{"name":"ISWC 2025"},"date_updated":"2025-09-11T10:34:52Z","date_created":"2025-09-11T10:04:16Z","author":[{"full_name":"Becker, Alexander","last_name":"Becker","first_name":"Alexander"},{"first_name":"Axel-Cyrille","full_name":"Ngonga Ngomo, Axel-Cyrille","id":"65716","last_name":"Ngonga Ngomo"},{"full_name":"Sherif, Mohamed ","last_name":"Sherif","first_name":"Mohamed "}],"place":"Nara, Japan","year":"2025","citation":{"apa":"Becker, A., Ngonga Ngomo, A.-C., &#38; Sherif, M. (2025). GLIDE: Knowledge Graph Linking using Distance-Aware Embeddings. <i>The Semantic Web – ISWC 2025</i>. ISWC 2025.","bibtex":"@inproceedings{Becker_Ngonga Ngomo_Sherif_2025, place={Nara, Japan}, title={GLIDE: Knowledge Graph Linking using Distance-Aware Embeddings}, booktitle={The Semantic Web – ISWC 2025}, author={Becker, Alexander and Ngonga Ngomo, Axel-Cyrille and Sherif, Mohamed }, year={2025} }","mla":"Becker, Alexander, et al. “GLIDE: Knowledge Graph Linking Using Distance-Aware Embeddings.” <i>The Semantic Web – ISWC 2025</i>, 2025.","short":"A. Becker, A.-C. Ngonga Ngomo, M. Sherif, in: The Semantic Web – ISWC 2025, Nara, Japan, 2025.","chicago":"Becker, Alexander, Axel-Cyrille Ngonga Ngomo, and Mohamed  Sherif. “GLIDE: Knowledge Graph Linking Using Distance-Aware Embeddings.” In <i>The Semantic Web – ISWC 2025</i>. Nara, Japan, 2025.","ieee":"A. Becker, A.-C. Ngonga Ngomo, and M. Sherif, “GLIDE: Knowledge Graph Linking using Distance-Aware Embeddings,” presented at the ISWC 2025, 2025.","ama":"Becker A, Ngonga Ngomo A-C, Sherif M. GLIDE: Knowledge Graph Linking using Distance-Aware Embeddings. In: <i>The Semantic Web – ISWC 2025</i>. ; 2025."},"keyword":["becker sherif enexa sailproject dice simba ngonga whale"],"language":[{"iso":"eng"}],"_id":"61202","user_id":"67234","department":[{"_id":"574"}],"abstract":[{"lang":"eng","text":"The number of datasets on the web of data increases continuously. However, the knowledge contained therein cannot be fully utilized without finding links between the entities contained in these datasets. Equivalent entities can not be identified solely by checking the equivalence of IRIs because of the different origins and naming schemes of different data providers. Yet, such equivalences can be discovered by computing the similarity of their attributes. In this paper we propose GLIDE, an approach that links entities from two different datasets by embedding a joint model of these datasets enriched by additional relations describing the similarity of literals. The joint model is embedded into a latent vector space while paying attention to juxtaposing similar literals. We evaluate our approach against state-of-the-art algorithms using real-world datasets commonly used in link discovery literature. The results show that GLIDE outperforms all baselines on 5 of 7 datasets with perfect or near-perfect accuracy. Our approach achieves its best performance on datasets that feature several literals with similarities. Our experiments indicate that researchers should not only pay attention to equal literals in knowledge graph embedding but should also be aware of the distance between similar literals."}],"status":"public","type":"conference","publication":"The Semantic Web – ISWC 2025"},{"year":"2025","citation":{"ama":"Manzoor A, Speck R, Zahera HMA, Saleem M, Moussallem D, Ngonga Ngomo A-C. Multilingual Relation Extraction - A Survey. <i>IEEE Access</i>. Published online 2025:1-1. doi:<a href=\"https://doi.org/10.1109/access.2025.3604258\">10.1109/access.2025.3604258</a>","chicago":"Manzoor, Ali, René Speck, Hamada Mohamed Abdelsamee Zahera, Muhammad Saleem, Diego Moussallem, and Axel-Cyrille Ngonga Ngomo. “Multilingual Relation Extraction - A Survey.” <i>IEEE Access</i>, 2025, 1–1. <a href=\"https://doi.org/10.1109/access.2025.3604258\">https://doi.org/10.1109/access.2025.3604258</a>.","ieee":"A. Manzoor, R. Speck, H. M. A. Zahera, M. Saleem, D. Moussallem, and A.-C. Ngonga Ngomo, “Multilingual Relation Extraction - A Survey,” <i>IEEE Access</i>, pp. 1–1, 2025, doi: <a href=\"https://doi.org/10.1109/access.2025.3604258\">10.1109/access.2025.3604258</a>.","apa":"Manzoor, A., Speck, R., Zahera, H. M. A., Saleem, M., Moussallem, D., &#38; Ngonga Ngomo, A.-C. (2025). Multilingual Relation Extraction - A Survey. <i>IEEE Access</i>, 1–1. <a href=\"https://doi.org/10.1109/access.2025.3604258\">https://doi.org/10.1109/access.2025.3604258</a>","short":"A. Manzoor, R. Speck, H.M.A. Zahera, M. Saleem, D. Moussallem, A.-C. Ngonga Ngomo, IEEE Access (2025) 1–1.","bibtex":"@article{Manzoor_Speck_Zahera_Saleem_Moussallem_Ngonga Ngomo_2025, title={Multilingual Relation Extraction - A Survey}, DOI={<a href=\"https://doi.org/10.1109/access.2025.3604258\">10.1109/access.2025.3604258</a>}, journal={IEEE Access}, publisher={Institute of Electrical and Electronics Engineers (IEEE)}, author={Manzoor, Ali and Speck, René and Zahera, Hamada Mohamed Abdelsamee and Saleem, Muhammad and Moussallem, Diego and Ngonga Ngomo, Axel-Cyrille}, year={2025}, pages={1–1} }","mla":"Manzoor, Ali, et al. “Multilingual Relation Extraction - A Survey.” <i>IEEE Access</i>, Institute of Electrical and Electronics Engineers (IEEE), 2025, pp. 1–1, doi:<a href=\"https://doi.org/10.1109/access.2025.3604258\">10.1109/access.2025.3604258</a>."},"page":"1-1","publication_status":"published","publication_identifier":{"issn":["2169-3536"]},"title":"Multilingual Relation Extraction - A Survey","doi":"10.1109/access.2025.3604258","date_updated":"2025-09-11T11:14:27Z","publisher":"Institute of Electrical and Electronics Engineers (IEEE)","author":[{"first_name":"Ali","full_name":"Manzoor, Ali","id":"77309","last_name":"Manzoor","orcid":"https://orcid.org/0000-0001-8403-5160"},{"last_name":"Speck","full_name":"Speck, René","id":"70843","first_name":"René"},{"first_name":"Hamada Mohamed Abdelsamee","full_name":"Zahera, Hamada Mohamed Abdelsamee","id":"72768","last_name":"Zahera","orcid":"0000-0003-0215-1278"},{"full_name":"Saleem, Muhammad","last_name":"Saleem","first_name":"Muhammad"},{"last_name":"Moussallem","full_name":"Moussallem, Diego","id":"71635","first_name":"Diego"},{"first_name":"Axel-Cyrille","last_name":"Ngonga Ngomo","id":"65716","full_name":"Ngonga Ngomo, Axel-Cyrille"}],"date_created":"2025-09-04T13:32:08Z","status":"public","type":"journal_article","publication":"IEEE Access","language":[{"iso":"eng"}],"_id":"61134","user_id":"77309","department":[{"_id":"574"}]},{"publication_identifier":{"isbn":["9783032012210","9783032012227"],"issn":["0302-9743","1611-3349"]},"publication_status":"published","citation":{"short":"M. Lenke, N. Klowait, L. Biere, C. Schulte, in: Lecture Notes in Computer Science, Springer Nature Switzerland, Cham, 2025.","bibtex":"@inbook{Lenke_Klowait_Biere_Schulte_2025, place={Cham}, title={Assessing AI Literacy: A Systematic Review of Questionnaires with Emphasis on Affective, Behavioral, Cognitive, and Ethical Aspects}, DOI={<a href=\"https://doi.org/10.1007/978-3-032-01222-7_8\">10.1007/978-3-032-01222-7_8</a>}, booktitle={Lecture Notes in Computer Science}, publisher={Springer Nature Switzerland}, author={Lenke, Michael and Klowait, Nils and Biere, Lea and Schulte, Carsten}, year={2025} }","mla":"Lenke, Michael, et al. “Assessing AI Literacy: A Systematic Review of Questionnaires with Emphasis on Affective, Behavioral, Cognitive, and Ethical Aspects.” <i>Lecture Notes in Computer Science</i>, Springer Nature Switzerland, 2025, doi:<a href=\"https://doi.org/10.1007/978-3-032-01222-7_8\">10.1007/978-3-032-01222-7_8</a>.","apa":"Lenke, M., Klowait, N., Biere, L., &#38; Schulte, C. (2025). Assessing AI Literacy: A Systematic Review of Questionnaires with Emphasis on Affective, Behavioral, Cognitive, and Ethical Aspects. In <i>Lecture Notes in Computer Science</i>. Springer Nature Switzerland. <a href=\"https://doi.org/10.1007/978-3-032-01222-7_8\">https://doi.org/10.1007/978-3-032-01222-7_8</a>","ama":"Lenke M, Klowait N, Biere L, Schulte C. Assessing AI Literacy: A Systematic Review of Questionnaires with Emphasis on Affective, Behavioral, Cognitive, and Ethical Aspects. In: <i>Lecture Notes in Computer Science</i>. Springer Nature Switzerland; 2025. doi:<a href=\"https://doi.org/10.1007/978-3-032-01222-7_8\">10.1007/978-3-032-01222-7_8</a>","chicago":"Lenke, Michael, Nils Klowait, Lea Biere, and Carsten Schulte. “Assessing AI Literacy: A Systematic Review of Questionnaires with Emphasis on Affective, Behavioral, Cognitive, and Ethical Aspects.” In <i>Lecture Notes in Computer Science</i>. Cham: Springer Nature Switzerland, 2025. <a href=\"https://doi.org/10.1007/978-3-032-01222-7_8\">https://doi.org/10.1007/978-3-032-01222-7_8</a>.","ieee":"M. Lenke, N. Klowait, L. Biere, and C. Schulte, “Assessing AI Literacy: A Systematic Review of Questionnaires with Emphasis on Affective, Behavioral, Cognitive, and Ethical Aspects,” in <i>Lecture Notes in Computer Science</i>, Cham: Springer Nature Switzerland, 2025."},"place":"Cham","year":"2025","date_created":"2025-09-11T14:02:42Z","author":[{"first_name":"Michael","last_name":"Lenke","full_name":"Lenke, Michael","id":"32621"},{"last_name":"Klowait","orcid":"0000-0002-7347-099X","id":"98454","full_name":"Klowait, Nils","first_name":"Nils"},{"first_name":"Lea","last_name":"Biere","id":"46664","full_name":"Biere, Lea"},{"first_name":"Carsten","last_name":"Schulte","full_name":"Schulte, Carsten","id":"60311"}],"publisher":"Springer Nature Switzerland","date_updated":"2025-09-11T14:07:54Z","doi":"10.1007/978-3-032-01222-7_8","title":"Assessing AI Literacy: A Systematic Review of Questionnaires with Emphasis on Affective, Behavioral, Cognitive, and Ethical Aspects","publication":"Lecture Notes in Computer Science","type":"book_chapter","status":"public","department":[{"_id":"67"}],"user_id":"98454","_id":"61222","project":[{"_id":"119","name":"TRR 318 - Project Area Ö"}],"language":[{"iso":"eng"}]},{"place":"Nürnberg","year":"2025","citation":{"mla":"Nölle, Florian, et al. “Erfolgreich Studieren - sinnvolle Lernstrategien erlernen (Posterbeitrag).” <i>MINT-Symposium</i>, 2025.","bibtex":"@inproceedings{Nölle_Schmid_Bentrup_Temmen_2025, place={Nürnberg}, title={Erfolgreich Studieren - sinnvolle Lernstrategien erlernen (Posterbeitrag)}, booktitle={MINT-Symposium}, author={Nölle, Florian and Schmid, Hans-Joachim and Bentrup, Leon Alexander and Temmen, Katrin}, year={2025} }","short":"F. Nölle, H.-J. Schmid, L.A. Bentrup, K. Temmen, in: MINT-Symposium, Nürnberg, 2025.","apa":"Nölle, F., Schmid, H.-J., Bentrup, L. A., &#38; Temmen, K. (2025). Erfolgreich Studieren - sinnvolle Lernstrategien erlernen (Posterbeitrag). <i>MINT-Symposium</i>. MINT-Symposium, Nürnberg.","ieee":"F. Nölle, H.-J. Schmid, L. A. Bentrup, and K. Temmen, “Erfolgreich Studieren - sinnvolle Lernstrategien erlernen (Posterbeitrag),” presented at the MINT-Symposium, Nürnberg, 2025.","chicago":"Nölle, Florian, Hans-Joachim Schmid, Leon Alexander Bentrup, and Katrin Temmen. “Erfolgreich Studieren - sinnvolle Lernstrategien erlernen (Posterbeitrag).” In <i>MINT-Symposium</i>. Nürnberg, 2025.","ama":"Nölle F, Schmid H-J, Bentrup LA, Temmen K. Erfolgreich Studieren - sinnvolle Lernstrategien erlernen (Posterbeitrag). In: <i>MINT-Symposium</i>. ; 2025."},"publication_status":"published","has_accepted_license":"1","title":"Erfolgreich Studieren - sinnvolle Lernstrategien erlernen (Posterbeitrag)","conference":{"name":"MINT-Symposium","start_date":"2025-09-17","end_date":"2025-09-19","location":"Nürnberg"},"date_updated":"2025-09-22T12:46:53Z","oa":"1","date_created":"2025-09-22T11:39:21Z","author":[{"first_name":"Florian","last_name":"Nölle","full_name":"Nölle, Florian","id":"50522"},{"first_name":"Hans-Joachim","orcid":"000-0001-8590-1921","last_name":"Schmid","id":"464","full_name":"Schmid, Hans-Joachim"},{"last_name":"Bentrup","id":"65001","full_name":"Bentrup, Leon Alexander","first_name":"Leon Alexander"},{"first_name":"Katrin","last_name":"Temmen","full_name":"Temmen, Katrin","id":"30086"}],"file":[{"date_updated":"2025-09-22T12:46:35Z","date_created":"2025-09-22T11:36:05Z","creator":"noelflor","file_size":349667,"access_level":"open_access","file_id":"61397","file_name":"250922_MINT_Erfolgreich studieren.pdf","content_type":"application/pdf","relation":"main_file"}],"status":"public","type":"conference_abstract","publication":"MINT-Symposium","ddc":["370"],"file_date_updated":"2025-09-22T12:46:35Z","language":[{"iso":"ger"}],"project":[{"_id":"1387","name":"DigiSelF - Digitalisierung als Herausforderung und Innovation in der Hochschullehre"}],"_id":"61396","user_id":"50522","department":[{"_id":"150"},{"_id":"300"}]},{"date_updated":"2025-09-26T07:55:21Z","author":[{"last_name":"Lorke","full_name":"Lorke, Mariya","first_name":"Mariya"},{"full_name":"Amelung, Rena","last_name":"Amelung","first_name":"Rena"},{"first_name":"Peter","full_name":"Kuchling, Peter","last_name":"Kuchling"},{"full_name":"Paaßen, Benjamin","last_name":"Paaßen","first_name":"Benjamin"},{"first_name":"Miriam","full_name":"Pein-Hackelbusch, Miriam","last_name":"Pein-Hackelbusch"},{"id":"33185","full_name":"Schloots, Franziska Margarete","last_name":"Schloots","orcid":"0009-0008-9673-2615","first_name":"Franziska Margarete"},{"first_name":"Klara","last_name":"Schulz","full_name":"Schulz, Klara"},{"first_name":"Annette","full_name":"Nauerth, Annette","last_name":"Nauerth"}],"date_created":"2025-09-26T07:54:16Z","volume":2,"title":"Development and Implementation of Diversity Programs in Large Collaborative Research Projects: An Example From Germany","doi":"https://doi.org/10.1002/dvr2.70040","publication_status":"published","issue":"4","year":"2025","citation":{"mla":"Lorke, Mariya, et al. “Development and Implementation of Diversity Programs in Large Collaborative Research Projects: An Example From Germany.” <i>Diversity &#38; Inclusion Research</i>, vol. 2, no. 4, 2025, p. e70040, doi:<a href=\"https://doi.org/10.1002/dvr2.70040\">https://doi.org/10.1002/dvr2.70040</a>.","short":"M. Lorke, R. Amelung, P. Kuchling, B. Paaßen, M. Pein-Hackelbusch, F.M. Schloots, K. Schulz, A. Nauerth, Diversity &#38; Inclusion Research 2 (2025) e70040.","bibtex":"@article{Lorke_Amelung_Kuchling_Paaßen_Pein-Hackelbusch_Schloots_Schulz_Nauerth_2025, title={Development and Implementation of Diversity Programs in Large Collaborative Research Projects: An Example From Germany}, volume={2}, DOI={<a href=\"https://doi.org/10.1002/dvr2.70040\">https://doi.org/10.1002/dvr2.70040</a>}, number={4}, journal={Diversity &#38; Inclusion Research}, author={Lorke, Mariya and Amelung, Rena and Kuchling, Peter and Paaßen, Benjamin and Pein-Hackelbusch, Miriam and Schloots, Franziska Margarete and Schulz, Klara and Nauerth, Annette}, year={2025}, pages={e70040} }","apa":"Lorke, M., Amelung, R., Kuchling, P., Paaßen, B., Pein-Hackelbusch, M., Schloots, F. M., Schulz, K., &#38; Nauerth, A. (2025). Development and Implementation of Diversity Programs in Large Collaborative Research Projects: An Example From Germany. <i>Diversity &#38; Inclusion Research</i>, <i>2</i>(4), e70040. <a href=\"https://doi.org/10.1002/dvr2.70040\">https://doi.org/10.1002/dvr2.70040</a>","ama":"Lorke M, Amelung R, Kuchling P, et al. Development and Implementation of Diversity Programs in Large Collaborative Research Projects: An Example From Germany. <i>Diversity &#38; Inclusion Research</i>. 2025;2(4):e70040. doi:<a href=\"https://doi.org/10.1002/dvr2.70040\">https://doi.org/10.1002/dvr2.70040</a>","chicago":"Lorke, Mariya, Rena Amelung, Peter Kuchling, Benjamin Paaßen, Miriam Pein-Hackelbusch, Franziska Margarete Schloots, Klara Schulz, and Annette Nauerth. “Development and Implementation of Diversity Programs in Large Collaborative Research Projects: An Example From Germany.” <i>Diversity &#38; Inclusion Research</i> 2, no. 4 (2025): e70040. <a href=\"https://doi.org/10.1002/dvr2.70040\">https://doi.org/10.1002/dvr2.70040</a>.","ieee":"M. Lorke <i>et al.</i>, “Development and Implementation of Diversity Programs in Large Collaborative Research Projects: An Example From Germany,” <i>Diversity &#38; Inclusion Research</i>, vol. 2, no. 4, p. e70040, 2025, doi: <a href=\"https://doi.org/10.1002/dvr2.70040\">https://doi.org/10.1002/dvr2.70040</a>."},"page":"e70040","intvolume":"         2","_id":"61445","user_id":"33185","department":[{"_id":"574"}],"keyword":["collaborative research projects","diversity strategy","gender equality"],"language":[{"iso":"eng"}],"type":"journal_article","publication":"Diversity & Inclusion Research","abstract":[{"text":"ABSTRACT In recent years, there has been an increasing awareness of the importance of incorporating diversity into research projects, focusing on both how they are conducted and their content. Funding organizations have started to require that research applicants pay attention to inclusion and diversity by considering gender dimensions and other diversity factors in their project plans and ensuring gender equality during execution. Based on an extensive literature research and expert discussions on how to develop and implement diversity strategies in large collaborative research projects, we argue that there is a lack of practical advice in existing literature. Drawing from our own experiences in conceptualizing and implementing a Diversity Program across four universities in Germany, we propose a framework for effectively integrating diversity into collaborative research initiatives across various academic fields.","lang":"eng"}],"status":"public"},{"year":"2025","citation":{"ieee":"S. N. Hebrok, T. L. Storm, F. M. Cramer, M. M. Radoy, and J. Somorovsky, “STEK Sharing is Not Caring: Bypassing TLS Authentication in Web Servers using Session Tickets,” 2025.","chicago":"Hebrok, Sven Niclas, Tim Leonhard Storm, Felix Matthias Cramer, Maximilian Manfred Radoy, and Juraj Somorovsky. “STEK Sharing Is Not Caring: Bypassing TLS Authentication in Web Servers Using Session Tickets.” In <i>34th USENIX Security Symposium</i>, 2025.","ama":"Hebrok SN, Storm TL, Cramer FM, Radoy MM, Somorovsky J. STEK Sharing is Not Caring: Bypassing TLS Authentication in Web Servers using Session Tickets. In: <i>34th USENIX Security Symposium</i>. ; 2025.","short":"S.N. Hebrok, T.L. Storm, F.M. Cramer, M.M. Radoy, J. Somorovsky, in: 34th USENIX Security Symposium, 2025.","bibtex":"@inproceedings{Hebrok_Storm_Cramer_Radoy_Somorovsky_2025, title={STEK Sharing is Not Caring: Bypassing TLS Authentication in Web Servers using Session Tickets}, booktitle={34th USENIX Security Symposium}, author={Hebrok, Sven Niclas and Storm, Tim Leonhard and Cramer, Felix Matthias and Radoy, Maximilian Manfred and Somorovsky, Juraj}, year={2025} }","mla":"Hebrok, Sven Niclas, et al. “STEK Sharing Is Not Caring: Bypassing TLS Authentication in Web Servers Using Session Tickets.” <i>34th USENIX Security Symposium</i>, 2025.","apa":"Hebrok, S. N., Storm, T. L., Cramer, F. M., Radoy, M. M., &#38; Somorovsky, J. (2025). STEK Sharing is Not Caring: Bypassing TLS Authentication in Web Servers using Session Tickets. <i>34th USENIX Security Symposium</i>."},"has_accepted_license":"1","title":"STEK Sharing is Not Caring: Bypassing TLS Authentication in Web Servers using Session Tickets","main_file_link":[{"open_access":"1","url":"https://www.usenix.org/conference/usenixsecurity25/presentation/hebrok"}],"date_updated":"2025-09-29T13:46:49Z","oa":"1","author":[{"last_name":"Hebrok","orcid":"0009-0006-1172-1665","id":"55616","full_name":"Hebrok, Sven Niclas","first_name":"Sven Niclas"},{"first_name":"Tim Leonhard","orcid":"0009-0001-2681-1624","last_name":"Storm","id":"74914","full_name":"Storm, Tim Leonhard"},{"last_name":"Cramer","full_name":"Cramer, Felix Matthias","first_name":"Felix Matthias"},{"first_name":"Maximilian Manfred","last_name":"Radoy","orcid":"0009-0005-3059-6823","id":"68826","full_name":"Radoy, Maximilian Manfred"},{"last_name":"Somorovsky","orcid":"0000-0002-3593-7720","full_name":"Somorovsky, Juraj","id":"83504","first_name":"Juraj"}],"date_created":"2025-08-21T13:43:47Z","file":[{"date_created":"2025-09-29T13:41:18Z","creator":"snhebrok","date_updated":"2025-09-29T13:46:49Z","file_id":"61465","file_name":"paper.pdf","access_level":"open_access","file_size":333869,"content_type":"application/pdf","relation":"main_file"},{"relation":"supplementary_material","content_type":"application/pdf","file_size":162464,"file_name":"ae.pdf","file_id":"61466","access_level":"open_access","date_updated":"2025-09-29T13:46:49Z","date_created":"2025-09-29T13:41:27Z","creator":"snhebrok"},{"content_type":"application/pdf","relation":"poster","date_updated":"2025-09-29T13:46:49Z","date_created":"2025-09-29T13:41:41Z","creator":"snhebrok","file_size":535577,"access_level":"open_access","file_id":"61467","file_name":"poster.pdf"},{"content_type":"application/pdf","relation":"slides","date_updated":"2025-09-29T13:46:49Z","date_created":"2025-09-29T13:42:04Z","creator":"snhebrok","file_size":3057223,"access_level":"open_access","file_name":"slides.pdf","file_id":"61468"}],"status":"public","type":"conference","publication":"34th USENIX Security Symposium","ddc":["000"],"file_date_updated":"2025-09-29T13:46:49Z","language":[{"iso":"eng"}],"_id":"60970","user_id":"55616","department":[{"_id":"632"}]},{"author":[{"first_name":"Guido","full_name":"Governatori, Guido","last_name":"Governatori"},{"full_name":"Turhan, Anni-Yasmin","id":"104470","last_name":"Turhan","first_name":"Anni-Yasmin"}],"date_created":"2025-09-30T07:58:55Z","volume":25,"date_updated":"2025-09-30T08:02:13Z","doi":"10.1017/S1471068425000079","title":"Introduction to the Special Issue on Logic Rules and Reasoning: Selected Papers From the 6th International Joint Conference on Rules and Reasoning (RuleML+RR 2022)","issue":"2","citation":{"bibtex":"@article{Governatori_Turhan_2025, title={Introduction to the Special Issue on Logic Rules and Reasoning: Selected Papers From the 6th International Joint Conference on Rules and Reasoning (RuleML+RR 2022)}, volume={25}, DOI={<a href=\"https://doi.org/10.1017/S1471068425000079\">10.1017/S1471068425000079</a>}, number={2}, journal={Theory Pract. Log. Program.}, author={Governatori, Guido and Turhan, Anni-Yasmin}, year={2025}, pages={132–133} }","mla":"Governatori, Guido, and Anni-Yasmin Turhan. “Introduction to the Special Issue on Logic Rules and Reasoning: Selected Papers From the 6th International Joint Conference on Rules and Reasoning (RuleML+RR 2022).” <i>Theory Pract. Log. Program.</i>, vol. 25, no. 2, 2025, pp. 132–133, doi:<a href=\"https://doi.org/10.1017/S1471068425000079\">10.1017/S1471068425000079</a>.","short":"G. Governatori, A.-Y. Turhan, Theory Pract. Log. Program. 25 (2025) 132–133.","apa":"Governatori, G., &#38; Turhan, A.-Y. (2025). Introduction to the Special Issue on Logic Rules and Reasoning: Selected Papers From the 6th International Joint Conference on Rules and Reasoning (RuleML+RR 2022). <i>Theory Pract. Log. Program.</i>, <i>25</i>(2), 132–133. <a href=\"https://doi.org/10.1017/S1471068425000079\">https://doi.org/10.1017/S1471068425000079</a>","ieee":"G. Governatori and A.-Y. Turhan, “Introduction to the Special Issue on Logic Rules and Reasoning: Selected Papers From the 6th International Joint Conference on Rules and Reasoning (RuleML+RR 2022),” <i>Theory Pract. Log. Program.</i>, vol. 25, no. 2, pp. 132–133, 2025, doi: <a href=\"https://doi.org/10.1017/S1471068425000079\">10.1017/S1471068425000079</a>.","chicago":"Governatori, Guido, and Anni-Yasmin Turhan. “Introduction to the Special Issue on Logic Rules and Reasoning: Selected Papers From the 6th International Joint Conference on Rules and Reasoning (RuleML+RR 2022).” <i>Theory Pract. Log. Program.</i> 25, no. 2 (2025): 132–133. <a href=\"https://doi.org/10.1017/S1471068425000079\">https://doi.org/10.1017/S1471068425000079</a>.","ama":"Governatori G, Turhan A-Y. Introduction to the Special Issue on Logic Rules and Reasoning: Selected Papers From the 6th International Joint Conference on Rules and Reasoning (RuleML+RR 2022). <i>Theory Pract Log Program</i>. 2025;25(2):132–133. doi:<a href=\"https://doi.org/10.1017/S1471068425000079\">10.1017/S1471068425000079</a>"},"intvolume":"        25","page":"132–133","year":"2025","user_id":"117185","department":[{"_id":"888"}],"_id":"61471","language":[{"iso":"eng"}],"type":"journal_article","publication":"Theory Pract. Log. Program.","status":"public"},{"type":"preprint","status":"public","file":[{"success":1,"relation":"main_file","content_type":"application/pdf","file_size":1830758,"file_id":"59795","access_level":"closed","file_name":"2410.09537v2.pdf","date_updated":"2025-05-05T09:28:02Z","date_created":"2025-05-05T09:28:02Z","creator":"sofyam"}],"abstract":[{"text":"The depth of networks plays a crucial role in the effectiveness of deep learning. However, the memory requirement for backpropagation scales linearly with the number of layers, which leads to memory bottlenecks during training. Moreover, deep networks are often unable to handle time-series data appearing at irregular intervals. These issues can be resolved by considering continuous-depth networks based on the neural ODE framework in combination with reversible integration methods that allow for variable time-steps. Reversibility of the method ensures that the memory requirement for training is independent of network depth, while variable time-steps are required for assimilating time-series data on irregular intervals. However, at present, there are no known higher-order reversible methods with this property. High-order methods are especially important when a high level of accuracy in learning is required or when small time-steps are necessary due to large errors in time integration of neural ODEs, for instance in context of complex dynamical systems such as Kepler systems and molecular dynamics. The requirement of small time-steps when using a low-order method can significantly increase the computational cost of training as well as inference. In this work, we present an approach for constructing high-order reversible methods that allow adaptive time-stepping. Our numerical tests show the advantages in computational speed when applied to the task of learning dynamical systems.","lang":"eng"}],"department":[{"_id":"636"}],"user_id":"85279","_id":"59794","external_id":{"arxiv":["2410.09537"]},"language":[{"iso":"eng"}],"file_date_updated":"2025-05-05T09:28:02Z","ddc":["510"],"has_accepted_license":"1","citation":{"mla":"Maslovskaya, Sofya, et al. <i>Adaptive Higher Order Reversible Integrators for Memory Efficient Deep Learning</i>. 2025.","bibtex":"@article{Maslovskaya_Ober-Blöbaum_Offen_Singh_Wembe Moafo_2025, title={Adaptive higher order reversible integrators for memory efficient deep learning}, author={Maslovskaya, Sofya and Ober-Blöbaum, Sina and Offen, Christian and Singh, Pranav and Wembe Moafo, Boris Edgar}, year={2025} }","short":"S. Maslovskaya, S. Ober-Blöbaum, C. Offen, P. Singh, B.E. Wembe Moafo, (2025).","apa":"Maslovskaya, S., Ober-Blöbaum, S., Offen, C., Singh, P., &#38; Wembe Moafo, B. E. (2025). <i>Adaptive higher order reversible integrators for memory efficient deep learning</i>.","ieee":"S. Maslovskaya, S. Ober-Blöbaum, C. Offen, P. Singh, and B. E. Wembe Moafo, “Adaptive higher order reversible integrators for memory efficient deep learning.” 2025.","chicago":"Maslovskaya, Sofya, Sina Ober-Blöbaum, Christian Offen, Pranav Singh, and Boris Edgar Wembe Moafo. “Adaptive Higher Order Reversible Integrators for Memory Efficient Deep Learning,” 2025.","ama":"Maslovskaya S, Ober-Blöbaum S, Offen C, Singh P, Wembe Moafo BE. Adaptive higher order reversible integrators for memory efficient deep learning. Published online 2025."},"year":"2025","author":[{"first_name":"Sofya","id":"87909","full_name":"Maslovskaya, Sofya","last_name":"Maslovskaya"},{"full_name":"Ober-Blöbaum, Sina","id":"16494","last_name":"Ober-Blöbaum","first_name":"Sina"},{"first_name":"Christian","last_name":"Offen","orcid":"0000-0002-5940-8057","id":"85279","full_name":"Offen, Christian"},{"first_name":"Pranav","last_name":"Singh","full_name":"Singh, Pranav"},{"full_name":"Wembe Moafo, Boris Edgar","id":"95394","last_name":"Wembe Moafo","first_name":"Boris Edgar"}],"date_created":"2025-05-05T09:25:28Z","date_updated":"2025-09-30T15:16:09Z","title":"Adaptive higher order reversible integrators for memory efficient deep learning"}]