[{"citation":{"ieee":"E. Bodden, J. Pottebaum, M. Fockel, and I. Gräßler, “Evaluating Security Through Isolation and Defense in Depth,” <i>IEEE Security &#38; Privacy</i>, vol. 22, no. 1, pp. 69–72, 2024, doi: <a href=\"https://doi.org/10.1109/msec.2023.3336028\">10.1109/msec.2023.3336028</a>.","apa":"Bodden, E., Pottebaum, J., Fockel, M., &#38; Gräßler, I. (2024). Evaluating Security Through Isolation and Defense in Depth. <i>IEEE Security &#38; Privacy</i>, <i>22</i>(1), 69–72. <a href=\"https://doi.org/10.1109/msec.2023.3336028\">https://doi.org/10.1109/msec.2023.3336028</a>","short":"E. Bodden, J. Pottebaum, M. Fockel, I. Gräßler, IEEE Security &#38; Privacy 22 (2024) 69–72.","chicago":"Bodden, Eric, Jens Pottebaum, Markus Fockel, and Iris Gräßler. “Evaluating Security Through Isolation and Defense in Depth.” <i>IEEE Security &#38; Privacy</i> 22, no. 1 (2024): 69–72. <a href=\"https://doi.org/10.1109/msec.2023.3336028\">https://doi.org/10.1109/msec.2023.3336028</a>.","mla":"Bodden, Eric, et al. “Evaluating Security Through Isolation and Defense in Depth.” <i>IEEE Security &#38; Privacy</i>, vol. 22, no. 1, Institute of Electrical and Electronics Engineers (IEEE), 2024, pp. 69–72, doi:<a href=\"https://doi.org/10.1109/msec.2023.3336028\">10.1109/msec.2023.3336028</a>.","bibtex":"@article{Bodden_Pottebaum_Fockel_Gräßler_2024, title={Evaluating Security Through Isolation and Defense in Depth}, volume={22}, DOI={<a href=\"https://doi.org/10.1109/msec.2023.3336028\">10.1109/msec.2023.3336028</a>}, number={1}, journal={IEEE Security &#38; Privacy}, publisher={Institute of Electrical and Electronics Engineers (IEEE)}, author={Bodden, Eric and Pottebaum, Jens and Fockel, Markus and Gräßler, Iris}, year={2024}, pages={69–72} }","ama":"Bodden E, Pottebaum J, Fockel M, Gräßler I. Evaluating Security Through Isolation and Defense in Depth. <i>IEEE Security &#38; Privacy</i>. 2024;22(1):69-72. doi:<a href=\"https://doi.org/10.1109/msec.2023.3336028\">10.1109/msec.2023.3336028</a>"},"quality_controlled":"1","status":"public","page":"69-72","_id":"52587","publisher":"Institute of Electrical and Electronics Engineers (IEEE)","user_id":"405","volume":22,"issue":"1","publication":"IEEE Security & Privacy","date_created":"2024-03-15T20:16:18Z","keyword":["Law","Electrical and Electronic Engineering","Computer Networks and Communications"],"type":"journal_article","department":[{"_id":"152"},{"_id":"76"},{"_id":"662"}],"year":"2024","title":"Evaluating Security Through Isolation and Defense in Depth","publication_identifier":{"issn":["1540-7993","1558-4046"]},"author":[{"id":"59256","full_name":"Bodden, Eric","last_name":"Bodden","first_name":"Eric","orcid":"0000-0003-3470-3647"},{"full_name":"Pottebaum, Jens","orcid":"http://orcid.org/0000-0001-8778-2989","first_name":"Jens","last_name":"Pottebaum","id":"405"},{"id":"8472","first_name":"Markus","last_name":"Fockel","orcid":"0000-0002-1269-0702","full_name":"Fockel, Markus"},{"full_name":"Gräßler, Iris","first_name":"Iris","last_name":"Gräßler","orcid":"0000-0001-5765-971X","id":"47565"}],"date_updated":"2026-03-31T02:19:49Z","publication_status":"published","intvolume":"        22","main_file_link":[{"url":"https://ieeexplore.ieee.org/document/10411721"}],"language":[{"iso":"eng"}],"doi":"10.1109/msec.2023.3336028"},{"type":"book_chapter","department":[{"_id":"300"}],"date_created":"2024-11-18T07:41:43Z","publication":"Bildungsmedien für Erwachsene Educational Media for Adults ","citation":{"chicago":"Asiimwe, Henry, Henrik Bode, Paul Bogere, Christine Freitag, and Teddy Mangeni. “Which Media for Whom? The Implementation of Microgrids as a Trigger of Transformational Adult Learning Opportunities in Formal, Informal and Situational Settings in Times of Change.” In <i>Bildungsmedien Für Erwachsene Educational Media for Adults </i>, edited by Ewa Andrzejewska, Eva Matthes, Sylvia Schütze, and Jan Van Wiele, 245–255. Verlag Julius Klinkhardt, 2024. <a href=\"https://doi.org/10.35468/6126\">https://doi.org/10.35468/6126</a>.","ama":"Asiimwe H, Bode H, Bogere P, Freitag C, Mangeni T. Which Media for Whom? The Implementation of Microgrids as a Trigger of Transformational Adult Learning Opportunities in Formal, Informal and Situational Settings in Times of Change. In: Andrzejewska E, Matthes E, Schütze S, Van Wiele J, eds. <i>Bildungsmedien Für Erwachsene Educational Media for Adults </i>. Verlag Julius Klinkhardt; 2024:245–255. doi:<a href=\"https://doi.org/10.35468/6126\">10.35468/6126</a>","short":"H. Asiimwe, H. Bode, P. Bogere, C. Freitag, T. Mangeni, in: E. Andrzejewska, E. Matthes, S. Schütze, J. Van Wiele (Eds.), Bildungsmedien Für Erwachsene Educational Media for Adults , Verlag Julius Klinkhardt, 2024, pp. 245–255.","bibtex":"@inbook{Asiimwe_Bode_Bogere_Freitag_Mangeni_2024, title={Which Media for Whom? The Implementation of Microgrids as a Trigger of Transformational Adult Learning Opportunities in Formal, Informal and Situational Settings in Times of Change}, DOI={<a href=\"https://doi.org/10.35468/6126\">10.35468/6126</a>}, booktitle={Bildungsmedien für Erwachsene Educational Media for Adults }, publisher={Verlag Julius Klinkhardt}, author={Asiimwe, Henry and Bode, Henrik and Bogere, Paul and Freitag, Christine and Mangeni, Teddy}, editor={Andrzejewska, Ewa and Matthes, Eva and Schütze, Sylvia and Van Wiele, Jan}, year={2024}, pages={245–255} }","apa":"Asiimwe, H., Bode, H., Bogere, P., Freitag, C., &#38; Mangeni, T. (2024). Which Media for Whom? The Implementation of Microgrids as a Trigger of Transformational Adult Learning Opportunities in Formal, Informal and Situational Settings in Times of Change. In E. Andrzejewska, E. Matthes, S. Schütze, &#38; J. Van Wiele (Eds.), <i>Bildungsmedien für Erwachsene Educational Media for Adults </i> (pp. 245–255). Verlag Julius Klinkhardt. <a href=\"https://doi.org/10.35468/6126\">https://doi.org/10.35468/6126</a>","mla":"Asiimwe, Henry, et al. “Which Media for Whom? The Implementation of Microgrids as a Trigger of Transformational Adult Learning Opportunities in Formal, Informal and Situational Settings in Times of Change.” <i>Bildungsmedien Für Erwachsene Educational Media for Adults </i>, edited by Ewa Andrzejewska et al., Verlag Julius Klinkhardt, 2024, pp. 245–255, doi:<a href=\"https://doi.org/10.35468/6126\">10.35468/6126</a>.","ieee":"H. Asiimwe, H. Bode, P. Bogere, C. Freitag, and T. Mangeni, “Which Media for Whom? The Implementation of Microgrids as a Trigger of Transformational Adult Learning Opportunities in Formal, Informal and Situational Settings in Times of Change,” in <i>Bildungsmedien für Erwachsene Educational Media for Adults </i>, E. Andrzejewska, E. Matthes, S. Schütze, and J. Van Wiele, Eds. Verlag Julius Klinkhardt, 2024, pp. 245–255."},"doi":"10.35468/6126","user_id":"10831","editor":[{"last_name":"Andrzejewska","first_name":"Ewa","full_name":"Andrzejewska, Ewa"},{"last_name":"Matthes","first_name":"Eva","full_name":"Matthes, Eva"},{"full_name":"Schütze, Sylvia","last_name":"Schütze","first_name":"Sylvia"},{"full_name":"Van Wiele, Jan","first_name":"Jan","last_name":"Van Wiele"}],"page":"245–255","_id":"57154","publisher":"Verlag Julius Klinkhardt","language":[{"iso":"eng"}],"date_updated":"2026-04-24T09:08:34Z","year":"2024","status":"public","title":"Which Media for Whom? The Implementation of Microgrids as a Trigger of Transformational Adult Learning Opportunities in Formal, Informal and Situational Settings in Times of Change","author":[{"last_name":"Asiimwe","first_name":"Henry","full_name":"Asiimwe, Henry"},{"full_name":"Bode, Henrik","last_name":"Bode","first_name":"Henrik","id":"40880"},{"id":"88496","first_name":"Paul","orcid":"0000-0002-7159-5916","last_name":"Bogere","full_name":"Bogere, Paul"},{"id":"20560","first_name":"Christine","last_name":"Freitag","full_name":"Freitag, Christine"},{"last_name":"Mangeni","first_name":"Teddy","full_name":"Mangeni, Teddy"}],"publication_identifier":{"isbn":["978-3-7815-2670-9"]}},{"date_updated":"2026-04-27T14:14:40Z","conference":{"end_date":"2024-12-12","start_date":"2024-12-10","name":"International Conference on Field Programmable Technology","location":"Sydney"},"author":[{"first_name":"Christoph","last_name":"Berganski","full_name":"Berganski, Christoph","id":"98854"},{"first_name":"Felix","last_name":"Jentzsch","orcid":"0000-0003-4987-5708","full_name":"Jentzsch, Felix","id":"55631"},{"id":"398","full_name":"Platzner, Marco","first_name":"Marco","last_name":"Platzner"},{"last_name":"Kuhmichel","first_name":"Max","full_name":"Kuhmichel, Max"},{"first_name":"Heiner","last_name":"Giefers","full_name":"Giefers, Heiner"}],"title":"FINN-T: Compiling Custom Dataflow Accelerators for Quantized Transformers","status":"public","year":"2024","user_id":"55631","language":[{"iso":"eng"}],"_id":"56481","project":[{"_id":"52","name":"Computing Resources Provided by the Paderborn Center for Parallel Computing"}],"citation":{"apa":"Berganski, C., Jentzsch, F., Platzner, M., Kuhmichel, M., &#38; Giefers, H. (2024). <i>FINN-T: Compiling Custom Dataflow Accelerators for Quantized Transformers</i>. International Conference on Field Programmable Technology, Sydney.","ieee":"C. Berganski, F. Jentzsch, M. Platzner, M. Kuhmichel, and H. Giefers, “FINN-T: Compiling Custom Dataflow Accelerators for Quantized Transformers,” presented at the International Conference on Field Programmable Technology, Sydney, 2024.","chicago":"Berganski, Christoph, Felix Jentzsch, Marco Platzner, Max Kuhmichel, and Heiner Giefers. “FINN-T: Compiling Custom Dataflow Accelerators for Quantized Transformers,” 2024.","short":"C. Berganski, F. Jentzsch, M. Platzner, M. Kuhmichel, H. Giefers, in: 2024.","mla":"Berganski, Christoph, et al. <i>FINN-T: Compiling Custom Dataflow Accelerators for Quantized Transformers</i>. 2024.","ama":"Berganski C, Jentzsch F, Platzner M, Kuhmichel M, Giefers H. FINN-T: Compiling Custom Dataflow Accelerators for Quantized Transformers. In: ; 2024.","bibtex":"@inproceedings{Berganski_Jentzsch_Platzner_Kuhmichel_Giefers_2024, title={FINN-T: Compiling Custom Dataflow Accelerators for Quantized Transformers}, author={Berganski, Christoph and Jentzsch, Felix and Platzner, Marco and Kuhmichel, Max and Giefers, Heiner}, year={2024} }"},"department":[{"_id":"78"}],"type":"conference","date_created":"2024-10-10T07:49:13Z"},{"title":"Exploring Custom FPGA Accelerators for DNN-based RF Fingerprinting","status":"public","year":"2024","author":[{"first_name":"Luca-Sebastian","last_name":"Henke","full_name":"Henke, Luca-Sebastian"}],"date_updated":"2026-04-27T14:20:23Z","_id":"54245","language":[{"iso":"eng"}],"user_id":"55631","citation":{"bibtex":"@book{Henke_2024, title={Exploring Custom FPGA Accelerators for DNN-based RF Fingerprinting}, author={Henke, Luca-Sebastian}, year={2024} }","ama":"Henke L-S. <i>Exploring Custom FPGA Accelerators for DNN-Based RF Fingerprinting</i>.; 2024.","mla":"Henke, Luca-Sebastian. <i>Exploring Custom FPGA Accelerators for DNN-Based RF Fingerprinting</i>. 2024.","short":"L.-S. Henke, Exploring Custom FPGA Accelerators for DNN-Based RF Fingerprinting, 2024.","chicago":"Henke, Luca-Sebastian. <i>Exploring Custom FPGA Accelerators for DNN-Based RF Fingerprinting</i>, 2024.","ieee":"L.-S. Henke, <i>Exploring Custom FPGA Accelerators for DNN-based RF Fingerprinting</i>. 2024.","apa":"Henke, L.-S. (2024). <i>Exploring Custom FPGA Accelerators for DNN-based RF Fingerprinting</i>."},"supervisor":[{"id":"55631","full_name":"Jentzsch, Felix","last_name":"Jentzsch","orcid":"0000-0003-4987-5708","first_name":"Felix"},{"full_name":"Platzner, Marco","first_name":"Marco","last_name":"Platzner","id":"398"}],"project":[{"_id":"52","name":"Computing Resources Provided by the Paderborn Center for Parallel Computing"}],"date_created":"2024-05-13T14:00:01Z","type":"mastersthesis","department":[{"_id":"78"}]},{"department":[{"_id":"300"}],"type":"conference_abstract","date_created":"2025-11-03T10:12:06Z","citation":{"chicago":"Reckmann, Eileen, and Katrin Temmen. “Erste Ergebnisse aus einer Interviewstudie mit Workshop-Moderierenden mobiler Schülerlaborangebote an außerschulischen Lernorten,” 2024.","short":"E. Reckmann, K. Temmen, in: 2024.","ama":"Reckmann E, Temmen K. Erste Ergebnisse aus einer Interviewstudie mit Workshop-Moderierenden mobiler Schülerlaborangebote an außerschulischen Lernorten. In: ; 2024.","bibtex":"@inproceedings{Reckmann_Temmen_2024, title={Erste Ergebnisse aus einer Interviewstudie mit Workshop-Moderierenden mobiler Schülerlaborangebote an außerschulischen Lernorten}, author={Reckmann, Eileen and Temmen, Katrin}, year={2024} }","apa":"Reckmann, E., &#38; Temmen, K. (2024). <i>Erste Ergebnisse aus einer Interviewstudie mit Workshop-Moderierenden mobiler Schülerlaborangebote an außerschulischen Lernorten</i>. GDSU-Jahrestagung, Hannover.","mla":"Reckmann, Eileen, and Katrin Temmen. <i>Erste Ergebnisse aus einer Interviewstudie mit Workshop-Moderierenden mobiler Schülerlaborangebote an außerschulischen Lernorten</i>. 2024.","ieee":"E. Reckmann and K. Temmen, “Erste Ergebnisse aus einer Interviewstudie mit Workshop-Moderierenden mobiler Schülerlaborangebote an außerschulischen Lernorten,” presented at the GDSU-Jahrestagung, Hannover, 2024."},"user_id":"101166","language":[{"iso":"ger"}],"_id":"62047","date_updated":"2026-04-30T10:41:25Z","conference":{"location":"Hannover","start_date":"2024-03-07","name":"GDSU-Jahrestagung","end_date":"2024-03-09"},"author":[{"full_name":"Reckmann, Eileen","first_name":"Eileen","last_name":"Reckmann","id":"101166"},{"last_name":"Temmen","first_name":"Katrin","full_name":"Temmen, Katrin","id":"30086"}],"year":"2024","title":"Erste Ergebnisse aus einer Interviewstudie mit Workshop-Moderierenden mobiler Schülerlaborangebote an außerschulischen Lernorten","status":"public"},{"status":"public","_id":"50273","page":"7-17","volume":306,"user_id":"71541","citation":{"mla":"Agarwal, Avantika, et al. “Quantum Polynomial Hierarchies: Karp-Lipton, Error Reduction, and Lower  Bounds.” <i>Proceedings of 49th International Symposium on Mathematical Foundations of Computer Science (MFCS)</i>, vol. 306, no. 7, 2024, pp. 7–17, doi:<a href=\"https://doi.org/10.4230/LIPIcs.MFCS.2024.7\">10.4230/LIPIcs.MFCS.2024.7</a>.","ama":"Agarwal A, Gharibian S, Koppula V, Rudolph D. Quantum Polynomial Hierarchies: Karp-Lipton, error reduction, and lower  bounds. In: <i>Proceedings of 49th International Symposium on Mathematical Foundations of Computer Science (MFCS)</i>. Vol 306. ; 2024:7-17. doi:<a href=\"https://doi.org/10.4230/LIPIcs.MFCS.2024.7\">10.4230/LIPIcs.MFCS.2024.7</a>","bibtex":"@inproceedings{Agarwal_Gharibian_Koppula_Rudolph_2024, title={Quantum Polynomial Hierarchies: Karp-Lipton, error reduction, and lower  bounds}, volume={306}, DOI={<a href=\"https://doi.org/10.4230/LIPIcs.MFCS.2024.7\">10.4230/LIPIcs.MFCS.2024.7</a>}, number={7}, booktitle={Proceedings of 49th International Symposium on Mathematical Foundations of Computer Science (MFCS)}, author={Agarwal, Avantika and Gharibian, Sevag and Koppula, Venkata and Rudolph, Dorian}, year={2024}, pages={7–17} }","apa":"Agarwal, A., Gharibian, S., Koppula, V., &#38; Rudolph, D. (2024). Quantum Polynomial Hierarchies: Karp-Lipton, error reduction, and lower  bounds. <i>Proceedings of 49th International Symposium on Mathematical Foundations of Computer Science (MFCS)</i>, <i>306</i>(7), 7–17. <a href=\"https://doi.org/10.4230/LIPIcs.MFCS.2024.7\">https://doi.org/10.4230/LIPIcs.MFCS.2024.7</a>","ieee":"A. Agarwal, S. Gharibian, V. Koppula, and D. Rudolph, “Quantum Polynomial Hierarchies: Karp-Lipton, error reduction, and lower  bounds,” in <i>Proceedings of 49th International Symposium on Mathematical Foundations of Computer Science (MFCS)</i>, 2024, vol. 306, no. 7, pp. 7–17, doi: <a href=\"https://doi.org/10.4230/LIPIcs.MFCS.2024.7\">10.4230/LIPIcs.MFCS.2024.7</a>.","chicago":"Agarwal, Avantika, Sevag Gharibian, Venkata Koppula, and Dorian Rudolph. “Quantum Polynomial Hierarchies: Karp-Lipton, Error Reduction, and Lower  Bounds.” In <i>Proceedings of 49th International Symposium on Mathematical Foundations of Computer Science (MFCS)</i>, 306:7–17, 2024. <a href=\"https://doi.org/10.4230/LIPIcs.MFCS.2024.7\">https://doi.org/10.4230/LIPIcs.MFCS.2024.7</a>.","short":"A. Agarwal, S. Gharibian, V. Koppula, D. Rudolph, in: Proceedings of 49th International Symposium on Mathematical Foundations of Computer Science (MFCS), 2024, pp. 7–17."},"external_id":{"arxiv":["2401.01633"]},"author":[{"last_name":"Agarwal","first_name":"Avantika","full_name":"Agarwal, Avantika"},{"last_name":"Gharibian","orcid":"0000-0002-9992-3379","first_name":"Sevag","full_name":"Gharibian, Sevag","id":"71541"},{"last_name":"Koppula","first_name":"Venkata","full_name":"Koppula, Venkata"},{"id":"57863","first_name":"Dorian","last_name":"Rudolph","full_name":"Rudolph, Dorian"}],"title":"Quantum Polynomial Hierarchies: Karp-Lipton, error reduction, and lower  bounds","year":"2024","intvolume":"       306","publication_status":"published","date_updated":"2026-05-15T08:39:23Z","language":[{"iso":"eng"}],"doi":"10.4230/LIPIcs.MFCS.2024.7","issue":"7","publication":"Proceedings of 49th International Symposium on Mathematical Foundations of Computer Science (MFCS)","abstract":[{"text":"The Polynomial-Time Hierarchy ($\\mathsf{PH}$) is a staple of classical\r\ncomplexity theory, with applications spanning randomized computation to circuit\r\nlower bounds to ''quantum advantage'' analyses for near-term quantum computers.\r\nQuantumly, however, despite the fact that at least \\emph{four} definitions of\r\nquantum $\\mathsf{PH}$ exist, it has been challenging to prove analogues for\r\nthese of even basic facts from $\\mathsf{PH}$. This work studies three\r\nquantum-verifier based generalizations of $\\mathsf{PH}$, two of which are from\r\n[Gharibian, Santha, Sikora, Sundaram, Yirka, 2022] and use classical strings\r\n($\\mathsf{QCPH}$) and quantum mixed states ($\\mathsf{QPH}$) as proofs, and one\r\nof which is new to this work, utilizing quantum pure states\r\n($\\mathsf{pureQPH}$) as proofs. We first resolve several open problems from\r\n[GSSSY22], including a collapse theorem and a Karp-Lipton theorem for\r\n$\\mathsf{QCPH}$. Then, for our new class $\\mathsf{pureQPH}$, we show one-sided\r\nerror reduction for $\\mathsf{pureQPH}$, as well as the first bounds relating\r\nthese quantum variants of $\\mathsf{PH}$, namely $\\mathsf{QCPH}\\subseteq\r\n\\mathsf{pureQPH} \\subseteq \\mathsf{EXP}^{\\mathsf{PP}}$.","lang":"eng"}],"date_created":"2024-01-07T20:09:32Z","department":[{"_id":"7"},{"_id":"623"}],"type":"conference"},{"external_id":{"arxiv":["2401.03943"]},"date_created":"2024-01-09T13:59:44Z","type":"conference","department":[{"_id":"7"},{"_id":"623"}],"publication":"Proceedings of 51st EATCS International Colloquium on Automata, Languages and Programming (ICALP)","issue":"70","citation":{"bibtex":"@inproceedings{Gharibian_Kamminga_2024, title={BQP, meet NP: Search-to-decision reductions and approximate counting}, volume={297}, number={70}, booktitle={Proceedings of 51st EATCS International Colloquium on Automata, Languages and Programming (ICALP)}, author={Gharibian, Sevag and Kamminga, Jonas}, year={2024}, pages={1–19} }","ama":"Gharibian S, Kamminga J. BQP, meet NP: Search-to-decision reductions and approximate counting. In: <i>Proceedings of 51st EATCS International Colloquium on Automata, Languages and Programming (ICALP)</i>. Vol 297. ; 2024:1-19.","mla":"Gharibian, Sevag, and Jonas Kamminga. “BQP, Meet NP: Search-to-Decision Reductions and Approximate Counting.” <i>Proceedings of 51st EATCS International Colloquium on Automata, Languages and Programming (ICALP)</i>, vol. 297, no. 70, 2024, pp. 1–19.","chicago":"Gharibian, Sevag, and Jonas Kamminga. “BQP, Meet NP: Search-to-Decision Reductions and Approximate Counting.” In <i>Proceedings of 51st EATCS International Colloquium on Automata, Languages and Programming (ICALP)</i>, 297:1–19, 2024.","short":"S. Gharibian, J. Kamminga, in: Proceedings of 51st EATCS International Colloquium on Automata, Languages and Programming (ICALP), 2024, pp. 1–19.","ieee":"S. Gharibian and J. Kamminga, “BQP, meet NP: Search-to-decision reductions and approximate counting,” in <i>Proceedings of 51st EATCS International Colloquium on Automata, Languages and Programming (ICALP)</i>, 2024, vol. 297, no. 70, pp. 1–19.","apa":"Gharibian, S., &#38; Kamminga, J. (2024). BQP, meet NP: Search-to-decision reductions and approximate counting. <i>Proceedings of 51st EATCS International Colloquium on Automata, Languages and Programming (ICALP)</i>, <i>297</i>(70), 1–19."},"abstract":[{"text":"What is the power of polynomial-time quantum computation with access to an NP\r\noracle? In this work, we focus on two fundamental tasks from the study of\r\nBoolean satisfiability (SAT) problems: search-to-decision reductions, and\r\napproximate counting. We first show that, in strong contrast to the classical\r\nsetting where a poly-time Turing machine requires $\\Theta(n)$ queries to an NP\r\noracle to compute a witness to a given SAT formula, quantumly $\\Theta(\\log n)$\r\nqueries suffice. We then show this is tight in the black-box model - any\r\nquantum algorithm with \"NP-like\" query access to a formula requires\r\n$\\Omega(\\log n)$ queries to extract a solution with constant probability.\r\nMoving to approximate counting of SAT solutions, by exploiting a quantum link\r\nbetween search-to-decision reductions and approximate counting, we show that\r\nexisting classical approximate counting algorithms are likely optimal. First,\r\nwe give a lower bound in the \"NP-like\" black-box query setting: Approximate\r\ncounting requires $\\Omega(\\log n)$ queries, even on a quantum computer. We then\r\ngive a \"white-box\" lower bound (i.e. where the input formula is not hidden in\r\nthe oracle) - if there exists a randomized poly-time classical or quantum\r\nalgorithm for approximate counting making $o(log n)$ NP queries, then\r\n$\\text{BPP}^{\\text{NP}[o(n)]}$ contains a $\\text{P}^{\\text{NP}}$-complete\r\nproblem if the algorithm is classical and $\\text{FBQP}^{\\text{NP}[o(n)]}$\r\ncontains an $\\text{FP}^{\\text{NP}}$-complete problem if the algorithm is\r\nquantum.","lang":"eng"}],"page":"1-19","_id":"50406","language":[{"iso":"eng"}],"user_id":"71541","volume":297,"status":"public","title":"BQP, meet NP: Search-to-decision reductions and approximate counting","year":"2024","author":[{"full_name":"Gharibian, Sevag","last_name":"Gharibian","orcid":"0000-0002-9992-3379","first_name":"Sevag","id":"71541"},{"full_name":"Kamminga, Jonas","first_name":"Jonas","last_name":"Kamminga"}],"date_updated":"2026-05-15T08:41:59Z","publication_status":"published","intvolume":"       297"},{"date_created":"2024-11-07T12:09:37Z","external_id":{"arxiv":["2411.04120"]},"department":[{"_id":"7"},{"_id":"623"}],"type":"preprint","citation":{"mla":"Huber, Felix, et al. “Second Order Cone Relaxations for Quantum Max Cut.” <i>ArXiv:2411.04120</i>, 2024.","bibtex":"@article{Huber_Thompson_Parekh_Gharibian_2024, title={Second order cone relaxations for quantum Max Cut}, journal={arXiv:2411.04120}, author={Huber, Felix and Thompson, Kevin and Parekh, Ojas and Gharibian, Sevag}, year={2024} }","ama":"Huber F, Thompson K, Parekh O, Gharibian S. Second order cone relaxations for quantum Max Cut. <i>arXiv:241104120</i>. Published online 2024.","ieee":"F. Huber, K. Thompson, O. Parekh, and S. Gharibian, “Second order cone relaxations for quantum Max Cut,” <i>arXiv:2411.04120</i>. 2024.","apa":"Huber, F., Thompson, K., Parekh, O., &#38; Gharibian, S. (2024). Second order cone relaxations for quantum Max Cut. In <i>arXiv:2411.04120</i>.","short":"F. Huber, K. Thompson, O. Parekh, S. Gharibian, ArXiv:2411.04120 (2024).","chicago":"Huber, Felix, Kevin Thompson, Ojas Parekh, and Sevag Gharibian. “Second Order Cone Relaxations for Quantum Max Cut.” <i>ArXiv:2411.04120</i>, 2024."},"publication":"arXiv:2411.04120","abstract":[{"text":"Quantum Max Cut (QMC), also known as the quantum anti-ferromagnetic\r\nHeisenberg model, is a QMA-complete problem relevant to quantum many-body\r\nphysics and computer science. Semidefinite programming relaxations have been\r\nfruitful in designing theoretical approximation algorithms for QMC, but are\r\ncomputationally expensive for systems beyond tens of qubits. We give a second\r\norder cone relaxation for QMC, which optimizes over the set of mutually\r\nconsistent three-qubit reduced density matrices. In combination with Pauli\r\nlevel-$1$ of the quantum Lasserre hierarchy, the relaxation achieves an\r\napproximation ratio of $0.526$ to the ground state energy. Our relaxation is\r\nsolvable on systems with hundreds of qubits and paves the way to\r\ncomputationally efficient lower and upper bounds on the ground state energy of\r\nlarge-scale quantum spin systems.","lang":"eng"}],"_id":"56944","language":[{"iso":"eng"}],"user_id":"71541","author":[{"full_name":"Huber, Felix","last_name":"Huber","first_name":"Felix"},{"full_name":"Thompson, Kevin","first_name":"Kevin","last_name":"Thompson"},{"first_name":"Ojas","last_name":"Parekh","full_name":"Parekh, Ojas"},{"id":"71541","full_name":"Gharibian, Sevag","first_name":"Sevag","last_name":"Gharibian","orcid":"0000-0002-9992-3379"}],"title":"Second order cone relaxations for quantum Max Cut","status":"public","year":"2024","date_updated":"2026-05-15T08:41:38Z"},{"date_created":"2023-10-30T12:19:11Z","type":"journal_article","department":[{"_id":"7"},{"_id":"623"}],"issue":"4","publication":"ACM SIGACT News","related_material":{"link":[{"url":"https://dl.acm.org/doi/abs/10.1145/3639528.3639535","relation":"confirmation"}]},"abstract":[{"text":"When it comes to NP, its natural definition, its wide applicability across scientific disciplines, and its timeless relevance, the writing is on the wall: There can be only one. Quantum NP, on the other hand, is clearly the apple that fell far from the tree of NP. Two decades since the first definitions of quantum NP started rolling in, quantum complexity theorists face a stark reality: There's QMA, QCMA, QMA1, QMA(2), StoqMA, and NQP. In this article aimed at a general theoretical computer science audience, I survey these various definitions of quantum NP, their strengths and weaknesses, and why most of them, for better or worse, actually appear to fit naturally into the complexity zoo.","lang":"eng"}],"main_file_link":[{"url":"https://arxiv.org/abs/2310.18010","open_access":"1"}],"language":[{"iso":"eng"}],"year":"2024","title":"Guest Column: The 7 faces of quantum NP","author":[{"orcid":"0000-0002-9992-3379","last_name":"Gharibian","first_name":"Sevag","full_name":"Gharibian, Sevag","id":"71541"}],"publication_status":"published","date_updated":"2026-05-15T08:42:54Z","article_type":"review","intvolume":"        54","oa":"1","citation":{"mla":"Gharibian, Sevag. “Guest Column: The 7 Faces of Quantum NP.” <i>ACM SIGACT News</i>, vol. 54, no. 4, 2024, pp. 54–91.","ama":"Gharibian S. Guest Column: The 7 faces of quantum NP. <i>ACM SIGACT News</i>. 2024;54(4):54-91.","bibtex":"@article{Gharibian_2024, title={Guest Column: The 7 faces of quantum NP}, volume={54}, number={4}, journal={ACM SIGACT News}, author={Gharibian, Sevag}, year={2024}, pages={54–91} }","apa":"Gharibian, S. (2024). Guest Column: The 7 faces of quantum NP. <i>ACM SIGACT News</i>, <i>54</i>(4), 54–91.","ieee":"S. Gharibian, “Guest Column: The 7 faces of quantum NP,” <i>ACM SIGACT News</i>, vol. 54, no. 4, pp. 54–91, 2024.","short":"S. Gharibian, ACM SIGACT News 54 (2024) 54–91.","chicago":"Gharibian, Sevag. “Guest Column: The 7 Faces of Quantum NP.” <i>ACM SIGACT News</i> 54, no. 4 (2024): 54–91."},"page":"54-91","_id":"48544","user_id":"71541","volume":54,"status":"public"},{"language":[{"iso":"eng"}],"doi":"10.3233/faia240627","year":"2024","title":"Embedding Knowledge Graphs in Degenerate Clifford Algebras","publication_identifier":{"isbn":["9781643685489"],"issn":["0922-6389","1879-8314"]},"author":[{"id":"101165","full_name":"Kamdem Teyou, Louis Mozart","first_name":"Louis Mozart","last_name":"Kamdem Teyou"},{"id":"43817","first_name":"Caglar","last_name":"Demir","full_name":"Demir, Caglar"},{"full_name":"Ngonga Ngomo, Axel-Cyrille","first_name":"Axel-Cyrille","last_name":"Ngonga Ngomo","id":"65716"}],"date_updated":"2026-05-29T14:34:11Z","publication_status":"published","date_created":"2025-11-28T14:32:43Z","type":"book_chapter","department":[{"_id":"34"},{"_id":"574"}],"publication":"Frontiers in Artificial Intelligence and Applications","abstract":[{"lang":"eng","text":"<jats:p>Clifford algebras are a natural extension of division algebras, including real numbers, complex numbers, quaternions, and octonions. Previous research in knowledge graph embeddings has focused exclusively on Clifford algebras of a specific type, which do not include nilpotent base vectors—elements that square to zero. In this work, we introduce a novel approach by incorporating nilpotent base vectors with a nilpotency index of two, leading to a more general form of Clifford algebras named degenerate Clifford algebras. This generalization to degenerate Clifford algebras does allow for covering dual numbers and as such include translations and rotations models under the same generalization paradigm for the first time. We develop two models to determine the parameters that define the algebra: one using a greedy search and another predicting the parameters based on neural network embeddings of the input knowledge graph. Our evaluation on seven benchmark datasets demonstrates that this incorporation of nilpotent vectors enhances the quality of embeddings. Additionally, our method outperforms state-of-the-art approaches in terms of generalization, particularly regarding the mean reciprocal rank achieved on validation data. Finally, we show that even a simple greedy search can effectively discover optimal or near-optimal parameters for the algebra.</jats:p>"}],"publisher":"IOS Press","_id":"62702","user_id":"101165","status":"public","conference":{"end_date":"2024-10-24","location":"Santiago de Compostela","name":"27TH EUROPEAN CONFERENCE ON ARTIFICIAL INTELLIGENCE","start_date":"2024-10-19"},"popular_science":"1","citation":{"short":"L.M. Kamdem Teyou, C. Demir, A.-C. Ngonga Ngomo, in: Frontiers in Artificial Intelligence and Applications, IOS Press, 2024.","chicago":"Kamdem Teyou, Louis Mozart, Caglar Demir, and Axel-Cyrille Ngonga Ngomo. “Embedding Knowledge Graphs in Degenerate Clifford Algebras.” In <i>Frontiers in Artificial Intelligence and Applications</i>. IOS Press, 2024. <a href=\"https://doi.org/10.3233/faia240627\">https://doi.org/10.3233/faia240627</a>.","ieee":"L. M. Kamdem Teyou, C. Demir, and A.-C. Ngonga Ngomo, “Embedding Knowledge Graphs in Degenerate Clifford Algebras,” in <i>Frontiers in Artificial Intelligence and Applications</i>, IOS Press, 2024.","apa":"Kamdem Teyou, L. M., Demir, C., &#38; Ngonga Ngomo, A.-C. (2024). Embedding Knowledge Graphs in Degenerate Clifford Algebras. In <i>Frontiers in Artificial Intelligence and Applications</i>. 27TH EUROPEAN CONFERENCE ON ARTIFICIAL INTELLIGENCE, Santiago de Compostela. IOS Press. <a href=\"https://doi.org/10.3233/faia240627\">https://doi.org/10.3233/faia240627</a>","bibtex":"@inbook{Kamdem Teyou_Demir_Ngonga Ngomo_2024, title={Embedding Knowledge Graphs in Degenerate Clifford Algebras}, DOI={<a href=\"https://doi.org/10.3233/faia240627\">10.3233/faia240627</a>}, booktitle={Frontiers in Artificial Intelligence and Applications}, publisher={IOS Press}, author={Kamdem Teyou, Louis Mozart and Demir, Caglar and Ngonga Ngomo, Axel-Cyrille}, year={2024} }","ama":"Kamdem Teyou LM, Demir C, Ngonga Ngomo A-C. Embedding Knowledge Graphs in Degenerate Clifford Algebras. In: <i>Frontiers in Artificial Intelligence and Applications</i>. IOS Press; 2024. doi:<a href=\"https://doi.org/10.3233/faia240627\">10.3233/faia240627</a>","mla":"Kamdem Teyou, Louis Mozart, et al. “Embedding Knowledge Graphs in Degenerate Clifford Algebras.” <i>Frontiers in Artificial Intelligence and Applications</i>, IOS Press, 2024, doi:<a href=\"https://doi.org/10.3233/faia240627\">10.3233/faia240627</a>."},"quality_controlled":"1"},{"abstract":[{"lang":"eng","text":"We introduce a novel embedding method diverging from conventional approaches by operating within function spaces of finite dimension rather than finite vector space, thus departing significantly from standard knowledge graph embedding techniques. Initially employing polynomial functions to compute embeddings, we progress to more intricate representations using neural networks with varying layer complexities. We argue that employing functions for embedding computation enhances expressiveness and allows for more degrees of freedom, enabling operations such as composition, derivatives and primitive of entities representation. Additionally, we meticulously outline the step-by-step construction of our approach and provide code for reproducibility, thereby facilitating further exploration and application in the field."}],"citation":{"mla":"Kamdem Teyou, Louis Mozart, et al. “Embedding Knowledge Graphs in Function Spaces.” <i>Proceedings of the 33rd ACM International Conference on Information and Knowledge Management</i>, ACM, 2024, doi:<a href=\"https://doi.org/10.1145/3627673.3679819\">10.1145/3627673.3679819</a>.","ama":"Kamdem Teyou LM, Demir C, Ngonga Ngomo A-C. Embedding Knowledge Graphs in Function Spaces. In: <i>Proceedings of the 33rd ACM International Conference on Information and Knowledge Management</i>. ACM; 2024. doi:<a href=\"https://doi.org/10.1145/3627673.3679819\">10.1145/3627673.3679819</a>","bibtex":"@inproceedings{Kamdem Teyou_Demir_Ngonga Ngomo_2024, place={Boise}, title={Embedding Knowledge Graphs in Function Spaces}, DOI={<a href=\"https://doi.org/10.1145/3627673.3679819\">10.1145/3627673.3679819</a>}, booktitle={Proceedings of the 33rd ACM International Conference on Information and Knowledge Management}, publisher={ACM}, author={Kamdem Teyou, Louis Mozart and Demir, Caglar and Ngonga Ngomo, Axel-Cyrille}, year={2024} }","apa":"Kamdem Teyou, L. M., Demir, C., &#38; Ngonga Ngomo, A.-C. (2024). Embedding Knowledge Graphs in Function Spaces. <i>Proceedings of the 33rd ACM International Conference on Information and Knowledge Management</i>. 33rd ACM International Conference on Information and Knowledge Management, Boise. <a href=\"https://doi.org/10.1145/3627673.3679819\">https://doi.org/10.1145/3627673.3679819</a>","ieee":"L. M. Kamdem Teyou, C. Demir, and A.-C. Ngonga Ngomo, “Embedding Knowledge Graphs in Function Spaces,” presented at the 33rd ACM International Conference on Information and Knowledge Management, Boise, 2024, doi: <a href=\"https://doi.org/10.1145/3627673.3679819\">10.1145/3627673.3679819</a>.","chicago":"Kamdem Teyou, Louis Mozart, Caglar Demir, and Axel-Cyrille Ngonga Ngomo. “Embedding Knowledge Graphs in Function Spaces.” In <i>Proceedings of the 33rd ACM International Conference on Information and Knowledge Management</i>. Boise: ACM, 2024. <a href=\"https://doi.org/10.1145/3627673.3679819\">https://doi.org/10.1145/3627673.3679819</a>.","short":"L.M. Kamdem Teyou, C. Demir, A.-C. Ngonga Ngomo, in: Proceedings of the 33rd ACM International Conference on Information and Knowledge Management, ACM, Boise, 2024."},"publication":"Proceedings of the 33rd ACM International Conference on Information and Knowledge Management","department":[{"_id":"34"},{"_id":"574"}],"type":"conference","date_created":"2025-11-28T14:42:32Z","place":"Boise","publication_status":"published","date_updated":"2026-05-29T14:32:04Z","author":[{"id":"101165","full_name":"Kamdem Teyou, Louis Mozart","last_name":"Kamdem Teyou","first_name":"Louis Mozart"},{"id":"43817","full_name":"Demir, Caglar","first_name":"Caglar","last_name":"Demir"},{"first_name":"Axel-Cyrille","last_name":"Ngonga Ngomo","full_name":"Ngonga Ngomo, Axel-Cyrille"}],"conference":{"start_date":"2024-10-21","name":"33rd ACM International Conference on Information and Knowledge Management","location":"Boise","end_date":"2024-10-25"},"status":"public","year":"2024","title":"Embedding Knowledge Graphs in Function Spaces","user_id":"101165","doi":"10.1145/3627673.3679819","language":[{"iso":"eng"}],"_id":"62703","publisher":"ACM"},{"year":"2024","status":"public","title":"Implementation of Different Communication Structures for a Rocket Chip Based RISC-V Grid of Processing Cells","author":[{"full_name":"Luchterhandt, Lars","first_name":"Lars","last_name":"Luchterhandt","id":"74648"},{"full_name":"Nellius, Tom","first_name":"Tom","last_name":"Nellius"},{"last_name":"Beck","first_name":"Robert","full_name":"Beck, Robert"},{"full_name":"Dömer, Rainer","first_name":"Rainer","last_name":"Dömer"},{"full_name":"Kneuper, Pascal","last_name":"Kneuper","first_name":"Pascal","id":"47367"},{"id":"16243","full_name":"Müller, Wolfgang","last_name":"Müller","first_name":"Wolfgang"},{"id":"93634","full_name":"Sadiye, Babak","last_name":"Sadiye","first_name":"Babak"}],"conference":{"end_date":"2023.03.24","location":"Germany,  Freiburg","name":"MBMV 2023 - 26. Workshop, Freiburg, ","start_date":"2023.03.23"},"date_updated":"2026-07-16T15:02:40Z","_id":"45778","language":[{"iso":"eng"}],"publisher":"VDE Verlag","user_id":"16243","publication":"MBMV 2024 - 27. Workshop Methoden und Beschreibungssprachen zur Modellierung und Verifikation von Schaltungen und Systemen“","citation":{"ieee":"L. Luchterhandt <i>et al.</i>, “Implementation of Different Communication Structures for a Rocket Chip Based RISC-V Grid of Processing Cells,” presented at the MBMV 2023 - 26. Workshop, Freiburg, , Germany,  Freiburg, 2024.","apa":"Luchterhandt, L., Nellius, T., Beck, R., Dömer, R., Kneuper, P., Müller, W., &#38; Sadiye, B. (2024). Implementation of Different Communication Structures for a Rocket Chip Based RISC-V Grid of Processing Cells. <i>MBMV 2024 - 27. Workshop Methoden Und Beschreibungssprachen Zur Modellierung Und Verifikation von Schaltungen Und Systemen“</i>. MBMV 2023 - 26. Workshop, Freiburg, , Germany,  Freiburg.","chicago":"Luchterhandt, Lars, Tom Nellius, Robert Beck, Rainer Dömer, Pascal Kneuper, Wolfgang Müller, and Babak Sadiye. “Implementation of Different Communication Structures for a Rocket Chip Based RISC-V Grid of Processing Cells.” In <i>MBMV 2024 - 27. Workshop Methoden Und Beschreibungssprachen Zur Modellierung Und Verifikation von Schaltungen Und Systemen“</i>. VDE Verlag, 2024.","short":"L. Luchterhandt, T. Nellius, R. Beck, R. Dömer, P. Kneuper, W. Müller, B. Sadiye, in: MBMV 2024 - 27. Workshop Methoden Und Beschreibungssprachen Zur Modellierung Und Verifikation von Schaltungen Und Systemen“, VDE Verlag, 2024.","mla":"Luchterhandt, Lars, et al. “Implementation of Different Communication Structures for a Rocket Chip Based RISC-V Grid of Processing Cells.” <i>MBMV 2024 - 27. Workshop Methoden Und Beschreibungssprachen Zur Modellierung Und Verifikation von Schaltungen Und Systemen“</i>, VDE Verlag, 2024.","bibtex":"@inproceedings{Luchterhandt_Nellius_Beck_Dömer_Kneuper_Müller_Sadiye_2024, title={Implementation of Different Communication Structures for a Rocket Chip Based RISC-V Grid of Processing Cells}, booktitle={MBMV 2024 - 27. Workshop Methoden und Beschreibungssprachen zur Modellierung und Verifikation von Schaltungen und Systemen“}, publisher={VDE Verlag}, author={Luchterhandt, Lars and Nellius, Tom and Beck, Robert and Dömer, Rainer and Kneuper, Pascal and Müller, Wolfgang and Sadiye, Babak}, year={2024} }","ama":"Luchterhandt L, Nellius T, Beck R, et al. Implementation of Different Communication Structures for a Rocket Chip Based RISC-V Grid of Processing Cells. In: <i>MBMV 2024 - 27. Workshop Methoden Und Beschreibungssprachen Zur Modellierung Und Verifikation von Schaltungen Und Systemen“</i>. VDE Verlag; 2024."},"abstract":[{"lang":"eng","text":"RISC-V has received worldwide acceptance in the industry and by the academic community. As of today, multiple\r\nRISC-V applications and variants are under investigation for embedded IoT systems, from resource-limited single-core\r\nprocessors up to multi-core systems for High-Performance Computing (HPC). Recently, the Grid of Processing Cells\r\n(GPC) platform has been proposed as a scalable parallel grid-oriented network of processor cores with local memories.\r\nThis paper describes a prototype design of the GPC platform for hardware implementation at Register-Transfer Level\r\n(RTL) based on modified RISC-V Rocket processors with scratchpad memories. It introduces a scalable Chisel-based\r\nimplementation of the modified Rocket cores with RTL generation and a functional test using Verilator simulation. This\r\nwork also includes the adaptation of the Chipyard software toolchain to extend the compiler to multi-core grids with\r\ndifferent local address spaces."}],"date_created":"2023-06-26T12:32:07Z","type":"conference","department":[{"_id":"58"}]},{"date_updated":"2026-08-24T12:03:25Z","publication_status":"published","year":"2024","title":"Compilation of Commit Changes Within Java Source Code Repositories","status":"public","author":[{"full_name":"Schott, Stefan","orcid":"0000-0002-0644-3297","first_name":"Stefan","last_name":"Schott","id":"54847"},{"first_name":"Wolfram","last_name":"Fischer","full_name":"Fischer, Wolfram"},{"full_name":"Ponta, Serena Elisa","last_name":"Ponta","first_name":"Serena Elisa"},{"id":"40915","full_name":"Klauke, Jonas","last_name":"Klauke","orcid":"0000-0001-9160-9636","first_name":"Jonas"},{"id":"59256","full_name":"Bodden, Eric","last_name":"Bodden","first_name":"Eric","orcid":"0000-0003-3470-3647"}],"doi":"10.1109/icsme58944.2024.00038","user_id":"15249","_id":"66834","language":[{"iso":"eng"}],"publisher":"IEEE","publication":"2024 IEEE International Conference on Software Maintenance and Evolution (ICSME)","citation":{"apa":"Schott, S., Fischer, W., Ponta, S. E., Klauke, J., &#38; Bodden, E. (2024). Compilation of Commit Changes Within Java Source Code Repositories. <i>2024 IEEE International Conference on Software Maintenance and Evolution (ICSME)</i>. <a href=\"https://doi.org/10.1109/icsme58944.2024.00038\">https://doi.org/10.1109/icsme58944.2024.00038</a>","ieee":"S. Schott, W. Fischer, S. E. Ponta, J. Klauke, and E. Bodden, “Compilation of Commit Changes Within Java Source Code Repositories,” 2024, doi: <a href=\"https://doi.org/10.1109/icsme58944.2024.00038\">10.1109/icsme58944.2024.00038</a>.","chicago":"Schott, Stefan, Wolfram Fischer, Serena Elisa Ponta, Jonas Klauke, and Eric Bodden. “Compilation of Commit Changes Within Java Source Code Repositories.” In <i>2024 IEEE International Conference on Software Maintenance and Evolution (ICSME)</i>. IEEE, 2024. <a href=\"https://doi.org/10.1109/icsme58944.2024.00038\">https://doi.org/10.1109/icsme58944.2024.00038</a>.","short":"S. Schott, W. Fischer, S.E. Ponta, J. Klauke, E. Bodden, in: 2024 IEEE International Conference on Software Maintenance and Evolution (ICSME), IEEE, 2024.","mla":"Schott, Stefan, et al. “Compilation of Commit Changes Within Java Source Code Repositories.” <i>2024 IEEE International Conference on Software Maintenance and Evolution (ICSME)</i>, IEEE, 2024, doi:<a href=\"https://doi.org/10.1109/icsme58944.2024.00038\">10.1109/icsme58944.2024.00038</a>.","ama":"Schott S, Fischer W, Ponta SE, Klauke J, Bodden E. Compilation of Commit Changes Within Java Source Code Repositories. In: <i>2024 IEEE International Conference on Software Maintenance and Evolution (ICSME)</i>. IEEE; 2024. doi:<a href=\"https://doi.org/10.1109/icsme58944.2024.00038\">10.1109/icsme58944.2024.00038</a>","bibtex":"@inproceedings{Schott_Fischer_Ponta_Klauke_Bodden_2024, title={Compilation of Commit Changes Within Java Source Code Repositories}, DOI={<a href=\"https://doi.org/10.1109/icsme58944.2024.00038\">10.1109/icsme58944.2024.00038</a>}, booktitle={2024 IEEE International Conference on Software Maintenance and Evolution (ICSME)}, publisher={IEEE}, author={Schott, Stefan and Fischer, Wolfram and Ponta, Serena Elisa and Klauke, Jonas and Bodden, Eric}, year={2024} }"},"type":"conference","department":[{"_id":"76"}],"date_created":"2026-08-24T12:02:51Z"},{"intvolume":"        24","date_updated":"2026-07-03T12:35:54Z","publication_status":"published","publication_identifier":{"issn":["1424-3199","1424-3202"]},"author":[{"id":"100325","full_name":"Papageorgiou, Efthymia","last_name":"Papageorgiou","first_name":"Efthymia"}],"year":"2024","title":"Asymptotic behavior of solutions to the extension problem for the fractional Laplacian on noncompact symmetric spaces","doi":"10.1007/s00028-024-00959-6","language":[{"iso":"eng"}],"article_number":"34","abstract":[{"lang":"eng","text":"<jats:title>Abstract</jats:title><jats:p>This work deals with the extension problem for the fractional Laplacian on Riemannian symmetric spaces <jats:italic>G</jats:italic>/<jats:italic>K</jats:italic> of noncompact type and of general rank, which gives rise to a family of convolution operators, including the Poisson operator. More precisely, motivated by Euclidean results for the Poisson semigroup, we study the long-time asymptotic behavior of solutions to the extension problem for <jats:inline-formula><jats:alternatives><jats:tex-math>$$L^1$$</jats:tex-math><mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\">\r\n                  <mml:msup>\r\n                    <mml:mi>L</mml:mi>\r\n                    <mml:mn>1</mml:mn>\r\n                  </mml:msup>\r\n                </mml:math></jats:alternatives></jats:inline-formula> initial data. In the case of the Laplace–Beltrami operator, we show that if the initial data are bi-<jats:italic>K</jats:italic>-invariant, then the solution to the extension problem behaves asymptotically as the mass times the fundamental solution, but this convergence may break down in the non-bi-<jats:italic>K</jats:italic>-invariant case. In the second part, we investigate the long-time asymptotic behavior of the extension problem associated with the so-called distinguished Laplacian on <jats:italic>G</jats:italic>/<jats:italic>K</jats:italic>. In this case, we observe phenomena which are similar to the Euclidean setting for the Poisson semigroup, such as <jats:inline-formula><jats:alternatives><jats:tex-math>$$L^1$$</jats:tex-math><mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\">\r\n                  <mml:msup>\r\n                    <mml:mi>L</mml:mi>\r\n                    <mml:mn>1</mml:mn>\r\n                  </mml:msup>\r\n                </mml:math></jats:alternatives></jats:inline-formula> asymptotic convergence without the assumption of bi-<jats:italic>K</jats:italic>-invariance.</jats:p>"}],"issue":"2","publication":"Journal of Evolution Equations","department":[{"_id":"555"}],"type":"journal_article","keyword":["Mathematics (miscellaneous)"],"date_created":"2024-04-17T13:18:30Z","status":"public","volume":24,"user_id":"100325","_id":"53542","publisher":"Springer Science and Business Media LLC","citation":{"chicago":"Papageorgiou, Efthymia. “Asymptotic Behavior of Solutions to the Extension Problem for the Fractional Laplacian on Noncompact Symmetric Spaces.” <i>Journal of Evolution Equations</i> 24, no. 2 (2024). <a href=\"https://doi.org/10.1007/s00028-024-00959-6\">https://doi.org/10.1007/s00028-024-00959-6</a>.","short":"E. Papageorgiou, Journal of Evolution Equations 24 (2024).","apa":"Papageorgiou, E. (2024). Asymptotic behavior of solutions to the extension problem for the fractional Laplacian on noncompact symmetric spaces. <i>Journal of Evolution Equations</i>, <i>24</i>(2), Article 34. <a href=\"https://doi.org/10.1007/s00028-024-00959-6\">https://doi.org/10.1007/s00028-024-00959-6</a>","ieee":"E. Papageorgiou, “Asymptotic behavior of solutions to the extension problem for the fractional Laplacian on noncompact symmetric spaces,” <i>Journal of Evolution Equations</i>, vol. 24, no. 2, Art. no. 34, 2024, doi: <a href=\"https://doi.org/10.1007/s00028-024-00959-6\">10.1007/s00028-024-00959-6</a>.","ama":"Papageorgiou E. Asymptotic behavior of solutions to the extension problem for the fractional Laplacian on noncompact symmetric spaces. <i>Journal of Evolution Equations</i>. 2024;24(2). doi:<a href=\"https://doi.org/10.1007/s00028-024-00959-6\">10.1007/s00028-024-00959-6</a>","bibtex":"@article{Papageorgiou_2024, title={Asymptotic behavior of solutions to the extension problem for the fractional Laplacian on noncompact symmetric spaces}, volume={24}, DOI={<a href=\"https://doi.org/10.1007/s00028-024-00959-6\">10.1007/s00028-024-00959-6</a>}, number={234}, journal={Journal of Evolution Equations}, publisher={Springer Science and Business Media LLC}, author={Papageorgiou, Efthymia}, year={2024} }","mla":"Papageorgiou, Efthymia. “Asymptotic Behavior of Solutions to the Extension Problem for the Fractional Laplacian on Noncompact Symmetric Spaces.” <i>Journal of Evolution Equations</i>, vol. 24, no. 2, 34, Springer Science and Business Media LLC, 2024, doi:<a href=\"https://doi.org/10.1007/s00028-024-00959-6\">10.1007/s00028-024-00959-6</a>."}},{"oa":"1","file_date_updated":"2026-08-17T07:42:08Z","citation":{"bibtex":"@inproceedings{Bäumer_Brinkmann_Erinola_Hebrok_Heitmann_Lange_Maehren_Merget_Niere_Radoy_et al._2024, title={TLS-Attacker: A Dynamic Framework for Analyzing TLS Implementations}, booktitle={Proceedings of Cybersecurity Artifacts Competition and Impact Award (ACSAC ’24)}, author={Bäumer, Fabian and Brinkmann, Marcus and Erinola, Nurullah and Hebrok, Sven Niclas and Heitmann, Nico and Lange, Felix and Maehren, Marcel and Merget, Robert and Niere, Niklas and Radoy, Maximilian Manfred and et al.}, year={2024} }","ama":"Bäumer F, Brinkmann M, Erinola N, et al. TLS-Attacker: A Dynamic Framework for Analyzing TLS Implementations. In: <i>Proceedings of Cybersecurity Artifacts Competition and Impact Award (ACSAC ’24)</i>. ; 2024.","mla":"Bäumer, Fabian, et al. “TLS-Attacker: A Dynamic Framework for Analyzing TLS Implementations.” <i>Proceedings of Cybersecurity Artifacts Competition and Impact Award (ACSAC ’24)</i>, 2024.","chicago":"Bäumer, Fabian, Marcus Brinkmann, Nurullah Erinola, Sven Niclas Hebrok, Nico Heitmann, Felix Lange, Marcel Maehren, et al. “TLS-Attacker: A Dynamic Framework for Analyzing TLS Implementations.” In <i>Proceedings of Cybersecurity Artifacts Competition and Impact Award (ACSAC ’24)</i>, 2024.","short":"F. Bäumer, M. Brinkmann, N. Erinola, S.N. Hebrok, N. Heitmann, F. Lange, M. Maehren, R. Merget, N. Niere, M.M. Radoy, C. Schmidt, J. Schwenk, J. Somorovsky, in: Proceedings of Cybersecurity Artifacts Competition and Impact Award (ACSAC ’24), 2024.","ieee":"F. Bäumer <i>et al.</i>, “TLS-Attacker: A Dynamic Framework for Analyzing TLS Implementations,” presented at the Annual Computer Security Applications Conference, Hawaii, 2024.","apa":"Bäumer, F., Brinkmann, M., Erinola, N., Hebrok, S. N., Heitmann, N., Lange, F., Maehren, M., Merget, R., Niere, N., Radoy, M. M., Schmidt, C., Schwenk, J., &#38; Somorovsky, J. (2024). TLS-Attacker: A Dynamic Framework for Analyzing TLS Implementations. <i>Proceedings of Cybersecurity Artifacts Competition and Impact Award (ACSAC ’24)</i>. Annual Computer Security Applications Conference, Hawaii."},"quality_controlled":"1","_id":"57816","user_id":"63563","ddc":["006"],"status":"public","conference":{"end_date":"2024-12-13","start_date":"2024-12-09","name":"Annual Computer Security Applications Conference","location":"Hawaii"},"has_accepted_license":"1","file":[{"file_id":"66728","content_type":"application/pdf","file_name":"comp-acsac24-final11.pdf","access_level":"local","file_size":530865,"relation":"main_file","date_updated":"2026-08-17T07:42:08Z","date_created":"2026-08-17T07:42:08Z","creator":"nniklas"}],"date_created":"2024-12-17T11:25:14Z","type":"conference","keyword":["SSL","TLS","DTLS","Protocol State Fuzzing","Planning Based"],"department":[{"_id":"632"}],"publication":"Proceedings of Cybersecurity Artifacts Competition and Impact Award (ACSAC ’24)","abstract":[{"lang":"eng","text":"TLS-Attacker is an open-source framework for analyzing Transport\r\nLayer Security (TLS) implementations. The framework allows users\r\nto specify custom protocol flows and provides modification hooks to\r\nmanipulate message contents. Since its initial publication in 2016 by\r\nJuraj Somorovsky, TLS-Attacker has been used in numerous studies\r\npublished at well-established conferences and helped to identify\r\nvulnerabilities in well-known open-source TLS libraries. To enable\r\nautomated analyses, TLS-Attacker has grown into a suite of projects,\r\neach designed as a building block that can be applied to facilitate\r\nvarious analysis methodologies. The framework still undergoes\r\ncontinuous improvements with feature extensions, such as DTLS\r\n1.3 or the addition of new dialects such as QUIC, to continue its\r\neffectiveness and relevancy as a security analysis framework."}],"main_file_link":[{"url":"https://www.acsac.org/2024/program/artifacts_competition/comp-acsac24-final11.pdf","open_access":"1"}],"language":[{"iso":"eng"}],"year":"2024","title":"TLS-Attacker: A Dynamic Framework for Analyzing TLS Implementations","author":[{"first_name":"Fabian","last_name":"Bäumer","full_name":"Bäumer, Fabian"},{"full_name":"Brinkmann, Marcus","first_name":"Marcus","last_name":"Brinkmann"},{"full_name":"Erinola, Nurullah","first_name":"Nurullah","last_name":"Erinola"},{"id":"55616","full_name":"Hebrok, Sven Niclas","orcid":"0009-0006-1172-1665","first_name":"Sven Niclas","last_name":"Hebrok"},{"orcid":"0009-0003-7687-7044","last_name":"Heitmann","first_name":"Nico","full_name":"Heitmann, Nico","id":"74619"},{"id":"67893","first_name":"Felix","last_name":"Lange","full_name":"Lange, Felix"},{"full_name":"Maehren, Marcel","first_name":"Marcel","last_name":"Maehren"},{"full_name":"Merget, Robert","first_name":"Robert","last_name":"Merget"},{"id":"63563","full_name":"Niere, Niklas","first_name":"Niklas","last_name":"Niere"},{"id":"68826","first_name":"Maximilian Manfred","orcid":"0009-0005-3059-6823","last_name":"Radoy","full_name":"Radoy, Maximilian Manfred"},{"last_name":"Schmidt","first_name":"Conrad","full_name":"Schmidt, Conrad"},{"first_name":"Jörg","last_name":"Schwenk","full_name":"Schwenk, Jörg"},{"first_name":"Juraj","orcid":"0000-0002-3593-7720","last_name":"Somorovsky","full_name":"Somorovsky, Juraj","id":"83504"}],"date_updated":"2026-08-17T07:42:41Z"},{"has_accepted_license":"1","conference":{"end_date":"2024-07-15","name":"Free and Open Communications on the Internet 2024 ","start_date":"2024-07-15","location":"Bristol"},"status":"public","ddc":["006"],"user_id":"63563","_id":"55137","quality_controlled":"1","citation":{"chicago":"Müller, Philipp, Niklas Niere, Felix Lange, and Juraj Somorovsky. “Turning Attacks into Advantages: Evading HTTP Censorship with HTTP Request Smuggling.” In <i>Proceedings on Privacy Enhancing Technologies</i>. Bristol, 2024.","short":"P. Müller, N. Niere, F. Lange, J. Somorovsky, in: Proceedings on Privacy Enhancing Technologies, Bristol, 2024.","ieee":"P. Müller, N. Niere, F. Lange, and J. Somorovsky, “Turning Attacks into Advantages: Evading HTTP Censorship with HTTP Request Smuggling,” presented at the Free and Open Communications on the Internet 2024 , Bristol, 2024.","apa":"Müller, P., Niere, N., Lange, F., &#38; Somorovsky, J. (2024). Turning Attacks into Advantages: Evading HTTP Censorship with HTTP Request Smuggling. <i>Proceedings on Privacy Enhancing Technologies</i>. Free and Open Communications on the Internet 2024 , Bristol.","bibtex":"@inproceedings{Müller_Niere_Lange_Somorovsky_2024, place={Bristol}, title={Turning Attacks into Advantages: Evading HTTP Censorship with HTTP Request Smuggling}, booktitle={Proceedings on Privacy Enhancing Technologies}, author={Müller, Philipp and Niere, Niklas and Lange, Felix and Somorovsky, Juraj}, year={2024} }","ama":"Müller P, Niere N, Lange F, Somorovsky J. Turning Attacks into Advantages: Evading HTTP Censorship with HTTP Request Smuggling. In: <i>Proceedings on Privacy Enhancing Technologies</i>. ; 2024.","mla":"Müller, Philipp, et al. “Turning Attacks into Advantages: Evading HTTP Censorship with HTTP Request Smuggling.” <i>Proceedings on Privacy Enhancing Technologies</i>, 2024."},"file_date_updated":"2026-08-17T07:40:56Z","oa":"1","place":"Bristol","date_updated":"2026-08-17T07:40:56Z","publication_status":"published","author":[{"last_name":"Müller","first_name":"Philipp","full_name":"Müller, Philipp"},{"id":"63563","first_name":"Niklas","last_name":"Niere","full_name":"Niere, Niklas"},{"id":"67893","last_name":"Lange","first_name":"Felix","full_name":"Lange, Felix"},{"id":"83504","full_name":"Somorovsky, Juraj","last_name":"Somorovsky","orcid":"0000-0002-3593-7720","first_name":"Juraj"}],"year":"2024","title":"Turning Attacks into Advantages: Evading HTTP Censorship with HTTP Request Smuggling","language":[{"iso":"eng"}],"main_file_link":[{"open_access":"1","url":"https://www.petsymposium.org/foci/2024/foci-2024-0012.pdf"}],"abstract":[{"lang":"eng","text":"Many countries limit their residents' access to various websites. As a substantial number of these websites do not support TLS encryption, censorship of unencrypted HTTP requests remains prevalent. Accordingly, circumvention techniques can and have been found for the HTTP protocol. In this paper, we infer novel circumvention techniques on the HTTP layer from a web security vulnerability by utilizing HTTP request smuggling (HRS). To demonstrate the viability of our techniques, we collected various test vectors from previous work about HRS and evaluated them on popular web servers and censors in China, Russia, and Iran. Our findings show that HRS can be successfully employed as a censorship circumvention technique against multiple censors and web servers. We also discover a standard-compliant circumvention technique in Russia, unusually inconsistent censorship in China, and an implementation bug in Iran. The results of this work imply that censorship circumvention techniques can successfully be constructed from existing vulnerabilities. We conjecture that this implication provides insights to the censorship circumvention community beyond the viability of specific techniques presented in this work."}],"publication":"Proceedings on Privacy Enhancing Technologies","department":[{"_id":"632"}],"keyword":["censorship","censorship circumvention","http","http request smuggling"],"type":"conference","date_created":"2024-07-09T07:49:37Z","file":[{"file_id":"55139","content_type":"application/pdf","file_name":"Turning Attacks into Advantages_ Evading HTTP Censorship with HTTP Request Smuggling - foci-2024-0012.pdf","file_size":189676,"access_level":"local","relation":"main_file","date_updated":"2026-08-17T07:40:56Z","date_created":"2024-07-09T07:42:54Z","creator":"flange"}]},{"publication_status":"published","date_updated":"2023-01-07T12:01:58Z","intvolume":"       149","title":"On the Universal Transformation of Data-Driven Models to Control Systems","year":"2023","author":[{"id":"47427","full_name":"Peitz, Sebastian","first_name":"Sebastian","orcid":"0000-0002-3389-793X","last_name":"Peitz"},{"id":"32829","first_name":"Katharina","last_name":"Bieker","full_name":"Bieker, Katharina"}],"doi":"10.1016/j.automatica.2022.110840","article_number":"110840","main_file_link":[{"url":"https://www.sciencedirect.com/science/article/pii/S0005109822007075/pdfft?isDTMRedir=true&download=true","open_access":"1"}],"language":[{"iso":"eng"}],"abstract":[{"lang":"eng","text":"As in almost every other branch of science, the major advances in data\r\nscience and machine learning have also resulted in significant improvements\r\nregarding the modeling and simulation of nonlinear dynamical systems. It is\r\nnowadays possible to make accurate medium to long-term predictions of highly\r\ncomplex systems such as the weather, the dynamics within a nuclear fusion\r\nreactor, of disease models or the stock market in a very efficient manner. In\r\nmany cases, predictive methods are advertised to ultimately be useful for\r\ncontrol, as the control of high-dimensional nonlinear systems is an engineering\r\ngrand challenge with huge potential in areas such as clean and efficient energy\r\nproduction, or the development of advanced medical devices. However, the\r\nquestion of how to use a predictive model for control is often left unanswered\r\ndue to the associated challenges, namely a significantly higher system\r\ncomplexity, the requirement of much larger data sets and an increased and often\r\nproblem-specific modeling effort. To solve these issues, we present a universal\r\nframework (which we call QuaSiModO:\r\nQuantization-Simulation-Modeling-Optimization) to transform arbitrary\r\npredictive models into control systems and use them for feedback control. The\r\nadvantages of our approach are a linear increase in data requirements with\r\nrespect to the control dimension, performance guarantees that rely exclusively\r\non the accuracy of the predictive model, and only little prior knowledge\r\nrequirements in control theory to solve complex control problems. In particular\r\nthe latter point is of key importance to enable a large number of researchers\r\nand practitioners to exploit the ever increasing capabilities of predictive\r\nmodels for control in a straight-forward and systematic fashion."}],"publication":"Automatica","type":"journal_article","department":[{"_id":"101"},{"_id":"655"}],"date_created":"2021-02-10T07:04:15Z","status":"public","user_id":"47427","volume":149,"_id":"21199","publisher":"Elsevier","project":[{"_id":"52","name":"PC2: Computing Resources Provided by the Paderborn Center for Parallel Computing"}],"citation":{"chicago":"Peitz, Sebastian, and Katharina Bieker. “On the Universal Transformation of Data-Driven Models to Control Systems.” <i>Automatica</i> 149 (2023). <a href=\"https://doi.org/10.1016/j.automatica.2022.110840\">https://doi.org/10.1016/j.automatica.2022.110840</a>.","short":"S. Peitz, K. Bieker, Automatica 149 (2023).","ieee":"S. Peitz and K. Bieker, “On the Universal Transformation of Data-Driven Models to Control Systems,” <i>Automatica</i>, vol. 149, Art. no. 110840, 2023, doi: <a href=\"https://doi.org/10.1016/j.automatica.2022.110840\">10.1016/j.automatica.2022.110840</a>.","apa":"Peitz, S., &#38; Bieker, K. (2023). On the Universal Transformation of Data-Driven Models to Control Systems. <i>Automatica</i>, <i>149</i>, Article 110840. <a href=\"https://doi.org/10.1016/j.automatica.2022.110840\">https://doi.org/10.1016/j.automatica.2022.110840</a>","bibtex":"@article{Peitz_Bieker_2023, title={On the Universal Transformation of Data-Driven Models to Control Systems}, volume={149}, DOI={<a href=\"https://doi.org/10.1016/j.automatica.2022.110840\">10.1016/j.automatica.2022.110840</a>}, number={110840}, journal={Automatica}, publisher={Elsevier}, author={Peitz, Sebastian and Bieker, Katharina}, year={2023} }","ama":"Peitz S, Bieker K. On the Universal Transformation of Data-Driven Models to Control Systems. <i>Automatica</i>. 2023;149. doi:<a href=\"https://doi.org/10.1016/j.automatica.2022.110840\">10.1016/j.automatica.2022.110840</a>","mla":"Peitz, Sebastian, and Katharina Bieker. “On the Universal Transformation of Data-Driven Models to Control Systems.” <i>Automatica</i>, vol. 149, 110840, Elsevier, 2023, doi:<a href=\"https://doi.org/10.1016/j.automatica.2022.110840\">10.1016/j.automatica.2022.110840</a>."},"oa":"1"},{"citation":{"ieee":"M. C. Möller and S. Krauter, “Dimensioning and Lifetime Prediction Model for a Hybrid, Hydrogen-Based Household PV Energy System Using Matlab/Simulink,” <i>Solar</i>, vol. 3, no. 1, pp. 25–48, 2023, doi: <a href=\"https://doi.org/10.3390/solar3010003\">10.3390/solar3010003</a>.","mla":"Möller, Marius Claus, and Stefan Krauter. “Dimensioning and Lifetime Prediction Model for a Hybrid, Hydrogen-Based Household PV Energy System Using Matlab/Simulink.” <i>Solar</i>, vol. 3, no. 1, MDPI AG, 2023, pp. 25–48, doi:<a href=\"https://doi.org/10.3390/solar3010003\">10.3390/solar3010003</a>.","apa":"Möller, M. C., &#38; Krauter, S. (2023). Dimensioning and Lifetime Prediction Model for a Hybrid, Hydrogen-Based Household PV Energy System Using Matlab/Simulink. <i>Solar</i>, <i>3</i>(1), 25–48. <a href=\"https://doi.org/10.3390/solar3010003\">https://doi.org/10.3390/solar3010003</a>","bibtex":"@article{Möller_Krauter_2023, title={Dimensioning and Lifetime Prediction Model for a Hybrid, Hydrogen-Based Household PV Energy System Using Matlab/Simulink}, volume={3}, DOI={<a href=\"https://doi.org/10.3390/solar3010003\">10.3390/solar3010003</a>}, number={1}, journal={Solar}, publisher={MDPI AG}, author={Möller, Marius Claus and Krauter, Stefan}, year={2023}, pages={25–48} }","ama":"Möller MC, Krauter S. Dimensioning and Lifetime Prediction Model for a Hybrid, Hydrogen-Based Household PV Energy System Using Matlab/Simulink. <i>Solar</i>. 2023;3(1):25-48. doi:<a href=\"https://doi.org/10.3390/solar3010003\">10.3390/solar3010003</a>","short":"M.C. Möller, S. Krauter, Solar 3 (2023) 25–48.","chicago":"Möller, Marius Claus, and Stefan Krauter. “Dimensioning and Lifetime Prediction Model for a Hybrid, Hydrogen-Based Household PV Energy System Using Matlab/Simulink.” <i>Solar</i> 3, no. 1 (2023): 25–48. <a href=\"https://doi.org/10.3390/solar3010003\">https://doi.org/10.3390/solar3010003</a>."},"quality_controlled":"1","status":"public","page":"25-48","publisher":"MDPI AG","_id":"35428","user_id":"16148","volume":3,"publication":"Solar","issue":"1","abstract":[{"text":"This paper presents a model of an energy system for a private household extended by a lifetime prognosis. The energy system was designed for fully covering the year-round energy demand of a private household on the basis of electricity generated by a photovoltaic (PV) system, using a hybrid energy storage system consisting of a hydrogen unit and a lithium-ion battery. Hydrogen is produced with a Proton Exchange Membrane (PEM) electrolyser by PV surplus during the summer months and then stored in a hydrogen tank. Mainly during winter, in terms of lack of PV energy, the hydrogen is converted back into electricity and heat by a fuel cell. The model was created in Matlab/Simulink and is based on real input data. Heat demand was also taken into account and is covered by a heat pump. The simulation period is a full year to account for the seasonality of energy production and demand. Due to high initial costs, the longevity of such an energy system is of vital interest. Therefore, this model was extended by a lifetime prediction in order to optimize the dimensioning with the aim of lifetime extension of a hydrogen-based energy system. Lifetime influencing factors were identified on the basis of a literature review and were integrated in the model. An extensive parameter study was performed to evaluate different dimensionings regarding the energy balance and the lifetime of the three components, electrolyser, fuel cell and lithium-ion battery. The results demonstrate the benefits of a holistic modelling approach and enable a design optimization regarding the use of resources, lifetime and self-sufficiency of the system","lang":"eng"}],"date_created":"2023-01-09T06:35:00Z","type":"journal_article","department":[{"_id":"53"}],"title":"Dimensioning and Lifetime Prediction Model for a Hybrid, Hydrogen-Based Household PV Energy System Using Matlab/Simulink","year":"2023","author":[{"id":"72391","full_name":"Möller, Marius Claus","last_name":"Möller","first_name":"Marius Claus"},{"id":"28836","full_name":"Krauter, Stefan","last_name":"Krauter","orcid":"0000-0002-3594-260X","first_name":"Stefan"}],"publication_identifier":{"issn":["2673-9941"]},"date_updated":"2023-01-09T06:36:10Z","publication_status":"published","intvolume":"         3","language":[{"iso":"eng"}],"doi":"10.3390/solar3010003"},{"_id":"47547","series_title":"LNI","language":[{"iso":"eng"}],"publisher":"Gesellschaft für Informatik e.V","user_id":"8447","editor":[{"last_name":"Kalenborn","first_name":"Axel","full_name":"Kalenborn, Axel"},{"first_name":"Masud","last_name":"Fazal-Baqaie","full_name":"Fazal-Baqaie, Masud"},{"full_name":"Linssen, Oliver","last_name":"Linssen","first_name":"Oliver"},{"full_name":"Volland, Alexander","first_name":"Alexander","last_name":"Volland"},{"first_name":"Enes","orcid":"0000-0002-5967-833X","last_name":"Yigitbas","full_name":"Yigitbas, Enes","id":"8447"},{"last_name":"Engstler","first_name":"Martin","full_name":"Engstler, Martin"},{"last_name":"Bertram","first_name":"Martin","full_name":"Bertram, Martin"}],"volume":"Vol. P340","title":"Projektmanagement Und Vorgehensmodelle 2023 - Nachhaltige IT-Projekte","year":"2023","status":"public","date_updated":"2023-10-04T08:50:47Z","date_created":"2023-10-04T08:50:38Z","type":"book_editor","department":[{"_id":"66"},{"_id":"534"}],"citation":{"chicago":"Kalenborn, Axel, Masud Fazal-Baqaie, Oliver Linssen, Alexander Volland, Enes Yigitbas, Martin Engstler, and Martin Bertram, eds. <i>Projektmanagement Und Vorgehensmodelle 2023 - Nachhaltige IT-Projekte</i>. Vol. Vol. P340. LNI. Gesellschaft für Informatik e.V, 2023.","short":"A. Kalenborn, M. Fazal-Baqaie, O. Linssen, A. Volland, E. Yigitbas, M. Engstler, M. Bertram, eds., Projektmanagement Und Vorgehensmodelle 2023 - Nachhaltige IT-Projekte, Gesellschaft für Informatik e.V, 2023.","ieee":"A. Kalenborn <i>et al.</i>, Eds., <i>Projektmanagement Und Vorgehensmodelle 2023 - Nachhaltige IT-Projekte</i>, vol. Vol. P340. Gesellschaft für Informatik e.V, 2023.","apa":"Kalenborn, A., Fazal-Baqaie, M., Linssen, O., Volland, A., Yigitbas, E., Engstler, M., &#38; Bertram, M. (Eds.). (2023). <i>Projektmanagement Und Vorgehensmodelle 2023 - Nachhaltige IT-Projekte: Vol. Vol. P340</i>. Gesellschaft für Informatik e.V.","bibtex":"@book{Kalenborn_Fazal-Baqaie_Linssen_Volland_Yigitbas_Engstler_Bertram_2023, series={LNI}, title={Projektmanagement Und Vorgehensmodelle 2023 - Nachhaltige IT-Projekte}, volume={Vol. P340}, publisher={Gesellschaft für Informatik e.V}, year={2023}, collection={LNI} }","ama":"Kalenborn A, Fazal-Baqaie M, Linssen O, et al., eds. <i>Projektmanagement Und Vorgehensmodelle 2023 - Nachhaltige IT-Projekte</i>. Vol Vol. P340. Gesellschaft für Informatik e.V; 2023.","mla":"Kalenborn, Axel, et al., editors. <i>Projektmanagement Und Vorgehensmodelle 2023 - Nachhaltige IT-Projekte</i>. Gesellschaft für Informatik e.V, 2023."}},{"user_id":"77633","language":[{"iso":"eng"}],"_id":"47590","date_updated":"2023-10-04T14:51:19Z","year":"2023","title":"Lessons learned from a global review study of physics textbook evaluation and its implications for teaching and learning in the classroom","status":"public","author":[{"orcid":"0000-0003-3898-954X","first_name":"Gabriela","last_name":"Jonas-Ahrend","full_name":"Jonas-Ahrend, Gabriela","id":"77633"},{"last_name":"Fraser-Abder","first_name":"Pamela","full_name":"Fraser-Abder, Pamela"},{"first_name":"Marika","last_name":"Kapanadze","full_name":"Kapanadze, Marika"},{"full_name":"Joubran, Fadeel","last_name":"Joubran","first_name":"Fadeel"},{"full_name":"Mazzolini, Alexander","last_name":"Mazzolini","first_name":"Alexander"}],"conference":{"location":"Panama City/Panama","start_date":"15.3.2023","name":"International Consortium of Research on Science and Mathematics Education","end_date":"18.03.2013"},"type":"conference","department":[{"_id":"300"}],"date_created":"2023-10-04T14:50:52Z","citation":{"bibtex":"@inproceedings{Jonas-Ahrend_Fraser-Abder_Kapanadze_Joubran_Mazzolini_2023, title={Lessons learned from a global review study of physics textbook evaluation and its implications for teaching and learning in the classroom}, author={Jonas-Ahrend, Gabriela and Fraser-Abder, Pamela and Kapanadze, Marika and Joubran, Fadeel and Mazzolini, Alexander}, year={2023} }","ama":"Jonas-Ahrend G, Fraser-Abder P, Kapanadze M, Joubran F, Mazzolini A. Lessons learned from a global review study of physics textbook evaluation and its implications for teaching and learning in the classroom. In: ; 2023.","mla":"Jonas-Ahrend, Gabriela, et al. <i>Lessons Learned from a Global Review Study of Physics Textbook Evaluation and Its Implications for Teaching and Learning in the Classroom</i>. 2023.","chicago":"Jonas-Ahrend, Gabriela, Pamela Fraser-Abder, Marika Kapanadze, Fadeel Joubran, and Alexander Mazzolini. “Lessons Learned from a Global Review Study of Physics Textbook Evaluation and Its Implications for Teaching and Learning in the Classroom,” 2023.","short":"G. Jonas-Ahrend, P. Fraser-Abder, M. Kapanadze, F. Joubran, A. Mazzolini, in: 2023.","ieee":"G. Jonas-Ahrend, P. Fraser-Abder, M. Kapanadze, F. Joubran, and A. Mazzolini, “Lessons learned from a global review study of physics textbook evaluation and its implications for teaching and learning in the classroom,” presented at the International Consortium of Research on Science and Mathematics Education, Panama City/Panama, 2023.","apa":"Jonas-Ahrend, G., Fraser-Abder, P., Kapanadze, M., Joubran, F., &#38; Mazzolini, A. (2023). <i>Lessons learned from a global review study of physics textbook evaluation and its implications for teaching and learning in the classroom</i>. International Consortium of Research on Science and Mathematics Education, Panama City/Panama."}}]