[{"citation":{"bibtex":"@inbook{Biehler_Kawakami_Lampen_Weiland_Zapata-Cardona_2025, title={Statistics and data science education as a vehicle for empowering citizens – short summary of a survey}, volume={1}, booktitle={Proceedings of the 15th International Congress on Mathematical Education}, publisher={MERGA}, author={Biehler, Rolf and Kawakami, T. and Lampen, E. and Weiland, T. and Zapata-Cardona, L.}, editor={Beswick, K. and Kaur, B. and Makar, K. and Ochoviet, C. and Venkat, H.}, year={2025}, pages={198–203} }","ama":"Biehler R, Kawakami T, Lampen E, Weiland T, Zapata-Cardona L. Statistics and data science education as a vehicle for empowering citizens – short summary of a survey. In: Beswick K, Kaur B, Makar K, Ochoviet C, Venkat H, eds. <i>Proceedings of the 15th International Congress on Mathematical Education</i>. Vol 1. MERGA; 2025:198-203.","mla":"Biehler, Rolf, et al. “Statistics and Data Science Education as a Vehicle for Empowering Citizens – Short Summary of a Survey.” <i>Proceedings of the 15th International Congress on Mathematical Education</i>, edited by K. Beswick et al., vol. 1, MERGA, 2025, pp. 198–203.","short":"R. Biehler, T. Kawakami, E. Lampen, T. Weiland, L. Zapata-Cardona, in: K. Beswick, B. Kaur, K. Makar, C. Ochoviet, H. Venkat (Eds.), Proceedings of the 15th International Congress on Mathematical Education, MERGA, 2025, pp. 198–203.","chicago":"Biehler, Rolf, T. Kawakami, E. Lampen, T. Weiland, and L. Zapata-Cardona. “Statistics and Data Science Education as a Vehicle for Empowering Citizens – Short Summary of a Survey.” In <i>Proceedings of the 15th International Congress on Mathematical Education</i>, edited by K. Beswick, B. Kaur, K. Makar, C. Ochoviet, and H. Venkat, 1:198–203. MERGA, 2025.","ieee":"R. Biehler, T. Kawakami, E. Lampen, T. Weiland, and L. Zapata-Cardona, “Statistics and data science education as a vehicle for empowering citizens – short summary of a survey,” in <i>Proceedings of the 15th International Congress on Mathematical Education</i>, vol. 1, K. Beswick, B. Kaur, K. Makar, C. Ochoviet, and H. Venkat, Eds. MERGA, 2025, pp. 198–203.","apa":"Biehler, R., Kawakami, T., Lampen, E., Weiland, T., &#38; Zapata-Cardona, L. (2025). Statistics and data science education as a vehicle for empowering citizens – short summary of a survey. In K. Beswick, B. Kaur, K. Makar, C. Ochoviet, &#38; H. Venkat (Eds.), <i>Proceedings of the 15th International Congress on Mathematical Education</i> (Vol. 1, pp. 198–203). MERGA."},"publication":"Proceedings of the 15th International Congress on Mathematical Education","department":[{"_id":"363"}],"type":"book_chapter","date_created":"2026-03-02T12:18:38Z","intvolume":"         1","publication_status":"published","date_updated":"2026-07-09T11:23:23Z","author":[{"first_name":"Rolf","last_name":"Biehler","full_name":"Biehler, Rolf","id":"16274"},{"full_name":"Kawakami, T.","first_name":"T.","last_name":"Kawakami"},{"last_name":"Lampen","first_name":"E.","full_name":"Lampen, E."},{"full_name":"Weiland, T.","first_name":"T.","last_name":"Weiland"},{"full_name":"Zapata-Cardona, L.","first_name":"L.","last_name":"Zapata-Cardona"}],"title":"Statistics and data science education as a vehicle for empowering citizens – short summary of a survey","year":"2025","status":"public","volume":1,"editor":[{"first_name":"K.","last_name":"Beswick","full_name":"Beswick, K."},{"full_name":"Kaur, B.","last_name":"Kaur","first_name":"B."},{"first_name":"K.","last_name":"Makar","full_name":"Makar, K."},{"full_name":"Ochoviet, C.","first_name":"C.","last_name":"Ochoviet"},{"full_name":"Venkat, H.","last_name":"Venkat","first_name":"H."}],"user_id":"37888","language":[{"iso":"eng"}],"_id":"64806","publisher":"MERGA","page":"198-203"},{"project":[{"name":"PC2: Computing Resources Provided by the Paderborn Center for Parallel Computing","_id":"52"}],"publication":"OSSMPIC - Open Source Solutions for Massively Parallel Integrated Circuits","citation":{"mla":"Luchterhandt, Lars, et al. “Case Study on Combining Open-Source Tool Flows for Grids of Processing Cells.” <i>OSSMPIC - Open Source Solutions for Massively Parallel Integrated Circuits</i>, 2025.","ama":"Luchterhandt L, Govindasamy V, Wang Y, Dömer R, Müller W, Scheytt JC. Case Study on Combining Open-Source Tool Flows for Grids of Processing Cells. In: <i>OSSMPIC - Open Source Solutions for Massively Parallel Integrated Circuits</i>. ; 2025.","bibtex":"@inproceedings{Luchterhandt_Govindasamy_Wang_Dömer_Müller_Scheytt_2025, place={Lyon, France}, title={Case Study on Combining Open-Source Tool Flows for Grids of Processing Cells}, booktitle={OSSMPIC - Open Source Solutions for Massively Parallel Integrated Circuits}, author={Luchterhandt, Lars and Govindasamy, Vivek and Wang, Yutong and Dömer, Rainer and Müller, Wolfgang and Scheytt, J. Christoph}, year={2025} }","apa":"Luchterhandt, L., Govindasamy, V., Wang, Y., Dömer, R., Müller, W., &#38; Scheytt, J. C. (2025). Case Study on Combining Open-Source Tool Flows for Grids of Processing Cells. <i>OSSMPIC - Open Source Solutions for Massively Parallel Integrated Circuits</i>.","ieee":"L. Luchterhandt, V. Govindasamy, Y. Wang, R. Dömer, W. Müller, and J. C. Scheytt, “Case Study on Combining Open-Source Tool Flows for Grids of Processing Cells,” 2025.","short":"L. Luchterhandt, V. Govindasamy, Y. Wang, R. Dömer, W. Müller, J.C. Scheytt, in: OSSMPIC - Open Source Solutions for Massively Parallel Integrated Circuits, Lyon, France, 2025.","chicago":"Luchterhandt, Lars, Vivek Govindasamy, Yutong Wang, Rainer Dömer, Wolfgang Müller, and J. Christoph Scheytt. “Case Study on Combining Open-Source Tool Flows for Grids of Processing Cells.” In <i>OSSMPIC - Open Source Solutions for Massively Parallel Integrated Circuits</i>. Lyon, France, 2025."},"type":"conference","department":[{"_id":"58"}],"date_created":"2025-02-26T14:40:23Z","place":"Lyon, France","date_updated":"2026-07-16T14:58:16Z","title":"Case Study on Combining Open-Source Tool Flows for Grids of Processing Cells","status":"public","year":"2025","author":[{"id":"74648","full_name":"Luchterhandt, Lars","first_name":"Lars","last_name":"Luchterhandt"},{"last_name":"Govindasamy","first_name":"Vivek","full_name":"Govindasamy, Vivek"},{"full_name":"Wang, Yutong","first_name":"Yutong","last_name":"Wang"},{"full_name":"Dömer, Rainer","first_name":"Rainer","last_name":"Dömer"},{"full_name":"Müller, Wolfgang","last_name":"Müller","first_name":"Wolfgang","id":"16243"},{"full_name":"Scheytt, J. Christoph","first_name":"J. Christoph","orcid":"0000-0002-5950-6618 ","last_name":"Scheytt","id":"37144"}],"user_id":"16243","language":[{"iso":"eng"}],"_id":"58861"},{"type":"preprint","department":[{"_id":"10"}],"external_id":{"arxiv":["2511.08312"]},"date_created":"2025-11-19T15:09:51Z","abstract":[{"text":"We construct the first examples of chamber-regular lattices on C̃₂-buildings. Assuming a conjecture of Kantor our list of examples becomes a classification for chamber-regular C̃₂-lattices on locally-finite C̃₂-buildings. The links of special vertices in the buildings we construct, are all isomorphic to (the incidence graph of) the unique generalized quadrangle Q of order (3,5). In particular our constructions involve chamber-regular actions on Q. These actions on Q are the first (and if Kantor's conjecture holds the only) chamber-regular actions on a finite generalized quadrangle and therefore interesting in their own right. Moreover Q is not Moufang and therefore none of our examples is a Bruhat-Tits building and all our lattices are exotic building lattices.","lang":"eng"}],"citation":{"apa":"Stamer, F., &#38; Titz Mite, T. (2025). <i>On Chamber-regular C̃₂-Lattices</i>.","ieee":"F. Stamer and T. Titz Mite, “On Chamber-regular C̃₂-Lattices.” 2025.","short":"F. Stamer, T. Titz Mite, (2025).","chicago":"Stamer, Franziska, and Thomas  Titz Mite. “On Chamber-Regular C̃₂-Lattices,” 2025.","mla":"Stamer, Franziska, and Thomas Titz Mite. <i>On Chamber-Regular C̃₂-Lattices</i>. 2025.","ama":"Stamer F, Titz Mite T. On Chamber-regular C̃₂-Lattices. Published online 2025.","bibtex":"@article{Stamer_Titz Mite_2025, title={On Chamber-regular C̃₂-Lattices}, author={Stamer, Franziska and Titz Mite, Thomas }, year={2025} }"},"user_id":"121813","page":"29","language":[{"iso":"eng"}],"_id":"62262","date_updated":"2026-06-30T10:45:29Z","status":"public","year":"2025","title":"On Chamber-regular C̃₂-Lattices","author":[{"id":"121813","first_name":"Franziska","last_name":"Stamer","full_name":"Stamer, Franziska"},{"first_name":"Thomas ","last_name":"Titz Mite","full_name":"Titz Mite, Thomas "}]},{"date_updated":"2026-07-01T12:33:09Z","title":"Out of Order: On the Importance of Word Positions in Explaining Text Classification","status":"public","year":"2025","author":[{"first_name":"Janina","last_name":"Lütke Stockdiek","full_name":"Lütke Stockdiek, Janina"},{"id":"103682","full_name":"Grimme, Britta","first_name":"Britta","last_name":"Grimme"},{"last_name":"Griesbach","first_name":"Marie","full_name":"Griesbach, Marie"},{"full_name":"Grimme, Christian","first_name":"Christian","last_name":"Grimme"}],"user_id":"15504","page":"432–447","language":[{"iso":"eng"}],"_id":"66098","publication":"International Artificial Intelligence Symposium","citation":{"ama":"Lütke Stockdiek J, Grimme B, Griesbach M, Grimme C. Out of Order: On the Importance of Word Positions in Explaining Text Classification. In: <i>International Artificial Intelligence Symposium</i>. ; 2025:432–447.","bibtex":"@inproceedings{Lütke Stockdiek_Grimme_Griesbach_Grimme_2025, title={Out of Order: On the Importance of Word Positions in Explaining Text Classification}, booktitle={International Artificial Intelligence Symposium}, author={Lütke Stockdiek, Janina and Grimme, Britta and Griesbach, Marie and Grimme, Christian}, year={2025}, pages={432–447} }","mla":"Lütke Stockdiek, Janina, et al. “Out of Order: On the Importance of Word Positions in Explaining Text Classification.” <i>International Artificial Intelligence Symposium</i>, 2025, pp. 432–447.","short":"J. Lütke Stockdiek, B. Grimme, M. Griesbach, C. Grimme, in: International Artificial Intelligence Symposium, 2025, pp. 432–447.","chicago":"Lütke Stockdiek, Janina, Britta Grimme, Marie Griesbach, and Christian Grimme. “Out of Order: On the Importance of Word Positions in Explaining Text Classification.” In <i>International Artificial Intelligence Symposium</i>, 432–447, 2025.","apa":"Lütke Stockdiek, J., Grimme, B., Griesbach, M., &#38; Grimme, C. (2025). Out of Order: On the Importance of Word Positions in Explaining Text Classification. <i>International Artificial Intelligence Symposium</i>, 432–447.","ieee":"J. Lütke Stockdiek, B. Grimme, M. Griesbach, and C. Grimme, “Out of Order: On the Importance of Word Positions in Explaining Text Classification,” in <i>International Artificial Intelligence Symposium</i>, 2025, pp. 432–447."},"type":"conference","department":[{"_id":"819"}],"date_created":"2026-07-01T12:32:42Z"},{"date_updated":"2026-07-06T08:42:10Z","status":"public","year":"2025","title":"Statistics and data science education as a vehicle for empowering citizens–short summary of a survey","author":[{"full_name":"Biehler, Rolf","last_name":"Biehler","first_name":"Rolf","id":"16274"},{"full_name":"Kawakami, Takashi","first_name":"Takashi","last_name":"Kawakami"},{"full_name":"Lampen, Erna","last_name":"Lampen","first_name":"Erna"},{"full_name":"Weiland, Travis","last_name":"Weiland","first_name":"Travis"},{"full_name":"Zapata-Cardona, Lucía","first_name":"Lucía","last_name":"Zapata-Cardona"}],"doi":"10.17619/UNIPB/1-2633","user_id":"37888","page":"49–52","main_file_link":[{"url":"https://doi.org/10.17619/UNIPB/1-2633","open_access":"1"}],"_id":"66278","language":[{"iso":"eng"}],"issue":"136","publication":"European Mathematical Society Magazine","citation":{"chicago":"Biehler, Rolf, Takashi Kawakami, Erna Lampen, Travis Weiland, and Lucía Zapata-Cardona. “Statistics and Data Science Education as a Vehicle for Empowering Citizens–Short Summary of a Survey.” <i>European Mathematical Society Magazine</i>, no. 136 (2025): 49–52. <a href=\"https://doi.org/10.17619/UNIPB/1-2633\">https://doi.org/10.17619/UNIPB/1-2633</a>.","short":"R. Biehler, T. Kawakami, E. Lampen, T. Weiland, L. Zapata-Cardona, European Mathematical Society Magazine (2025) 49–52.","ieee":"R. Biehler, T. Kawakami, E. Lampen, T. Weiland, and L. Zapata-Cardona, “Statistics and data science education as a vehicle for empowering citizens–short summary of a survey,” <i>European Mathematical Society Magazine</i>, no. 136, pp. 49–52, 2025, doi: <a href=\"https://doi.org/10.17619/UNIPB/1-2633\">10.17619/UNIPB/1-2633</a>.","apa":"Biehler, R., Kawakami, T., Lampen, E., Weiland, T., &#38; Zapata-Cardona, L. (2025). Statistics and data science education as a vehicle for empowering citizens–short summary of a survey. <i>European Mathematical Society Magazine</i>, <i>136</i>, 49–52. <a href=\"https://doi.org/10.17619/UNIPB/1-2633\">https://doi.org/10.17619/UNIPB/1-2633</a>","bibtex":"@article{Biehler_Kawakami_Lampen_Weiland_Zapata-Cardona_2025, title={Statistics and data science education as a vehicle for empowering citizens–short summary of a survey}, DOI={<a href=\"https://doi.org/10.17619/UNIPB/1-2633\">10.17619/UNIPB/1-2633</a>}, number={136}, journal={European Mathematical Society Magazine}, author={Biehler, Rolf and Kawakami, Takashi and Lampen, Erna and Weiland, Travis and Zapata-Cardona, Lucía}, year={2025}, pages={49–52} }","ama":"Biehler R, Kawakami T, Lampen E, Weiland T, Zapata-Cardona L. Statistics and data science education as a vehicle for empowering citizens–short summary of a survey. <i>European Mathematical Society Magazine</i>. 2025;(136):49–52. doi:<a href=\"https://doi.org/10.17619/UNIPB/1-2633\">10.17619/UNIPB/1-2633</a>","mla":"Biehler, Rolf, et al. “Statistics and Data Science Education as a Vehicle for Empowering Citizens–Short Summary of a Survey.” <i>European Mathematical Society Magazine</i>, no. 136, 2025, pp. 49–52, doi:<a href=\"https://doi.org/10.17619/UNIPB/1-2633\">10.17619/UNIPB/1-2633</a>."},"type":"journal_article","oa":"1","department":[{"_id":"363"}],"date_created":"2026-07-06T08:40:10Z"},{"title":"A Quantitative Guide to Navigate Speed/Accuracy Tradeoffs in System Level Design of RISC-V Processor Grids","status":"public","year":"2025","author":[{"full_name":"Luchterhandt, Lars","first_name":"Lars","last_name":"Luchterhandt","id":"74648"},{"last_name":"Govindasamy","first_name":"Vivek","full_name":"Govindasamy, Vivek"},{"full_name":"Wang, Yutong","last_name":"Wang","first_name":"Yutong"},{"full_name":"Scheytt, Christoph","first_name":"Christoph","last_name":"Scheytt","orcid":"0000-0002-5950-6618 ","id":"37144"},{"last_name":"Müller","first_name":"Wolfgang","full_name":"Müller, Wolfgang","id":"16243"},{"last_name":"Dömer","first_name":"Rainer","full_name":"Dömer, Rainer"}],"publication_status":"published","date_updated":"2026-07-16T15:17:01Z","language":[{"iso":"eng"}],"_id":"66520","publisher":"IEEE","user_id":"16243","doi":"10.1109/fdl68117.2025.11165408","publication":"2025 Forum on Specification &amp;amp; Design Languages (FDL)","citation":{"mla":"Luchterhandt, Lars, et al. “A Quantitative Guide to Navigate Speed/Accuracy Tradeoffs in System Level Design of RISC-V Processor Grids.” <i>2025 Forum on Specification &#38;amp;Amp; Design Languages (FDL)</i>, IEEE, 2025, doi:<a href=\"https://doi.org/10.1109/fdl68117.2025.11165408\">10.1109/fdl68117.2025.11165408</a>.","bibtex":"@inproceedings{Luchterhandt_Govindasamy_Wang_Scheytt_Müller_Dömer_2025, title={A Quantitative Guide to Navigate Speed/Accuracy Tradeoffs in System Level Design of RISC-V Processor Grids}, DOI={<a href=\"https://doi.org/10.1109/fdl68117.2025.11165408\">10.1109/fdl68117.2025.11165408</a>}, booktitle={2025 Forum on Specification &#38;amp;amp; Design Languages (FDL)}, publisher={IEEE}, author={Luchterhandt, Lars and Govindasamy, Vivek and Wang, Yutong and Scheytt, Christoph and Müller, Wolfgang and Dömer, Rainer}, year={2025} }","ama":"Luchterhandt L, Govindasamy V, Wang Y, Scheytt C, Müller W, Dömer R. A Quantitative Guide to Navigate Speed/Accuracy Tradeoffs in System Level Design of RISC-V Processor Grids. In: <i>2025 Forum on Specification &#38;amp;Amp; Design Languages (FDL)</i>. IEEE; 2025. doi:<a href=\"https://doi.org/10.1109/fdl68117.2025.11165408\">10.1109/fdl68117.2025.11165408</a>","ieee":"L. Luchterhandt, V. Govindasamy, Y. Wang, C. Scheytt, W. Müller, and R. Dömer, “A Quantitative Guide to Navigate Speed/Accuracy Tradeoffs in System Level Design of RISC-V Processor Grids,” 2025, doi: <a href=\"https://doi.org/10.1109/fdl68117.2025.11165408\">10.1109/fdl68117.2025.11165408</a>.","apa":"Luchterhandt, L., Govindasamy, V., Wang, Y., Scheytt, C., Müller, W., &#38; Dömer, R. (2025). A Quantitative Guide to Navigate Speed/Accuracy Tradeoffs in System Level Design of RISC-V Processor Grids. <i>2025 Forum on Specification &#38;amp;Amp; Design Languages (FDL)</i>. <a href=\"https://doi.org/10.1109/fdl68117.2025.11165408\">https://doi.org/10.1109/fdl68117.2025.11165408</a>","short":"L. Luchterhandt, V. Govindasamy, Y. Wang, C. Scheytt, W. Müller, R. Dömer, in: 2025 Forum on Specification &#38;amp;Amp; Design Languages (FDL), IEEE, 2025.","chicago":"Luchterhandt, Lars, Vivek Govindasamy, Yutong Wang, Christoph Scheytt, Wolfgang Müller, and Rainer Dömer. “A Quantitative Guide to Navigate Speed/Accuracy Tradeoffs in System Level Design of RISC-V Processor Grids.” In <i>2025 Forum on Specification &#38;amp;Amp; Design Languages (FDL)</i>. IEEE, 2025. <a href=\"https://doi.org/10.1109/fdl68117.2025.11165408\">https://doi.org/10.1109/fdl68117.2025.11165408</a>."},"date_created":"2026-07-16T15:15:02Z","type":"conference","department":[{"_id":"58"}]},{"quality_controlled":"1","file_date_updated":"2026-08-17T07:40:31Z","citation":{"chicago":"Lange, Felix, Niklas Niere, Jonathan von Niessen, Dennis Suermann, Nico Heitmann, and Juraj Somorovsky. “I(Ra)Nconsistencies: Novel Insights into Iran’s Censorship.” In <i>Proceedings on Privacy Enhancing Technologies</i>, 2025.","short":"F. Lange, N. Niere, J. von Niessen, D. Suermann, N. Heitmann, J. Somorovsky, in: Proceedings on Privacy Enhancing Technologies, 2025.","ieee":"F. Lange, N. Niere, J. von Niessen, D. Suermann, N. Heitmann, and J. Somorovsky, “I(ra)nconsistencies: Novel Insights into Iran’s Censorship,” presented at the Free and Open Communications on the Internet, Virtual, 2025.","apa":"Lange, F., Niere, N., von Niessen, J., Suermann, D., Heitmann, N., &#38; Somorovsky, J. (2025). I(ra)nconsistencies: Novel Insights into Iran’s Censorship. <i>Proceedings on Privacy Enhancing Technologies</i>. Free and Open Communications on the Internet, Virtual.","bibtex":"@inproceedings{Lange_Niere_von Niessen_Suermann_Heitmann_Somorovsky_2025, title={I(ra)nconsistencies: Novel Insights into Iran’s Censorship}, booktitle={Proceedings on Privacy Enhancing Technologies}, author={Lange, Felix and Niere, Niklas and von Niessen, Jonathan and Suermann, Dennis and Heitmann, Nico and Somorovsky, Juraj}, year={2025} }","ama":"Lange F, Niere N, von Niessen J, Suermann D, Heitmann N, Somorovsky J. I(ra)nconsistencies: Novel Insights into Iran’s Censorship. In: <i>Proceedings on Privacy Enhancing Technologies</i>. ; 2025.","mla":"Lange, Felix, et al. “I(Ra)Nconsistencies: Novel Insights into Iran’s Censorship.” <i>Proceedings on Privacy Enhancing Technologies</i>, 2025."},"oa":"1","has_accepted_license":"1","status":"public","conference":{"start_date":"2025-02-20","name":"Free and Open Communications on the Internet","location":"Virtual","end_date":"2025-02-20"},"user_id":"63563","ddc":["006"],"_id":"58801","abstract":[{"lang":"eng","text":"Iran employs one of the most prominent Internet censors in the world. An important part of Iran’s censorship apparatus is its analysis of unencrypted protocols such as HTTP and DNS. During routine evaluations of Iran’s HTTP and DNS censorship, we noticed several properties we believe to be unknown today. For instance, we found injections of correct static IPs for some domains such as google.com on the DNS level, unclear HTTP version parsing, and correlations between DNS and HTTP censorship. In this paper, we present our findings to the community and discuss possible takeaways for affected people and the censorship circumvention community. As some of our findings left us bewildered, we hope to ignite a discussion about Iran’s censorship behavior. We aim to use the discussion of our work to execute a thorough analysis and explanation of Iran’s censorship behavior in the future."}],"publication":"Proceedings on Privacy Enhancing Technologies","type":"conference","department":[{"_id":"632"}],"file":[{"date_created":"2025-02-24T08:07:59Z","creator":"flange","content_type":"application/pdf","file_id":"58802","access_level":"local","file_size":535700,"file_name":"foci-2025-0002.pdf","date_updated":"2026-08-17T07:40:31Z","relation":"main_file"}],"date_created":"2025-02-24T08:09:56Z","date_updated":"2026-08-17T07:40:31Z","year":"2025","title":"I(ra)nconsistencies: Novel Insights into Iran’s Censorship","author":[{"last_name":"Lange","first_name":"Felix","full_name":"Lange, Felix","id":"67893"},{"full_name":"Niere, Niklas","last_name":"Niere","first_name":"Niklas","id":"63563"},{"full_name":"von Niessen, Jonathan","last_name":"von Niessen","first_name":"Jonathan"},{"full_name":"Suermann, Dennis","last_name":"Suermann","first_name":"Dennis"},{"id":"74619","full_name":"Heitmann, Nico","last_name":"Heitmann","first_name":"Nico","orcid":"0009-0003-7687-7044"},{"full_name":"Somorovsky, Juraj","first_name":"Juraj","orcid":"0000-0002-3593-7720","last_name":"Somorovsky","id":"83504"}],"main_file_link":[{"url":"https://www.petsymposium.org/foci/2025/foci-2025-0002.pdf","open_access":"1"}],"language":[{"iso":"eng"}]},{"_id":"66747","language":[{"iso":"eng"}],"publisher":"Wiley-VCH, Weinheim","user_id":"16148","publication_identifier":{"isbn":[" 978-3-527-72181-8"]},"author":[{"id":"28836","full_name":"Krauter, Stefan","last_name":"Krauter","orcid":"0000-0002-3594-260X","first_name":"Stefan"},{"first_name":"Christian","last_name":"Ofenheusle","full_name":"Ofenheusle, Christian"},{"full_name":"Haselhuhn, Ralf","last_name":"Haselhuhn","first_name":"Ralf"}],"title":"Balkonkraftwerke kompakt für Dummies","status":"public","year":"2025","date_updated":"2026-08-19T13:39:51Z","date_created":"2026-08-19T13:39:37Z","department":[{"_id":"53"}],"type":"book","citation":{"short":"S. Krauter, C. Ofenheusle, R. Haselhuhn, Balkonkraftwerke Kompakt Für Dummies, Wiley-VCH, Weinheim, 2025.","chicago":"Krauter, Stefan, Christian Ofenheusle, and Ralf Haselhuhn. <i>Balkonkraftwerke Kompakt Für Dummies</i>. Wiley-VCH, Weinheim, 2025.","ieee":"S. Krauter, C. Ofenheusle, and R. Haselhuhn, <i>Balkonkraftwerke kompakt für Dummies</i>. Wiley-VCH, Weinheim, 2025.","apa":"Krauter, S., Ofenheusle, C., &#38; Haselhuhn, R. (2025). <i>Balkonkraftwerke kompakt für Dummies</i>. Wiley-VCH, Weinheim.","bibtex":"@book{Krauter_Ofenheusle_Haselhuhn_2025, title={Balkonkraftwerke kompakt für Dummies}, publisher={Wiley-VCH, Weinheim}, author={Krauter, Stefan and Ofenheusle, Christian and Haselhuhn, Ralf}, year={2025} }","ama":"Krauter S, Ofenheusle C, Haselhuhn R. <i>Balkonkraftwerke Kompakt Für Dummies</i>. Wiley-VCH, Weinheim; 2025.","mla":"Krauter, Stefan, et al. <i>Balkonkraftwerke Kompakt Für Dummies</i>. Wiley-VCH, Weinheim, 2025."}},{"department":[{"_id":"61"},{"_id":"230"},{"_id":"429"},{"_id":"623"}],"type":"journal_article","keyword":["tet_topic_waveguide"],"date_created":"2025-08-06T09:36:30Z","file":[{"access_level":"closed","file_size":5417636,"file_name":"2025-08 Hammer - Optics Continuum - TFLN channel waveguides of rib and strip type. Properties of guided modes (official version).pdf","date_updated":"2025-10-05T11:48:25Z","relation":"main_file","success":1,"content_type":"application/pdf","file_id":"61516","creator":"fossie","date_created":"2025-10-05T11:48:25Z"}],"abstract":[{"text":"Straight dielectric waveguide channels made from slabs of thin-film lithium niobate (TFLN), or lithium niobate on insulator (LNOI), are investigated in the linear regime, for channels of rib and strip type with common trapezoidal cross sections, in Z-cut and X-cut samples at varying on-chip orientation. We clarify the theoretical basis for the waveguides with potentially non-diagonal core permittivity. Symmetry classes can be distinguished that differ in their consequences for potential modal degeneracy and polarization conversion. Our rigorous numerical analysis by means of a finite-element solver takes the anisotropy of the lithium niobate cores rigorously into account. We discuss extensive data for effective indices, polarization properties, and hybridization of guided modes, in single- and multimode channels. Scans over the waveguide width and orientation as primary parameters are complemented by a series of illustrations of vectorial mode profiles. These turn out to be essentially complex in cases of X-cut channels at non-crystal-axis-aligned orientations.","lang":"eng"}],"issue":"10","publication":"Optics Continuum","doi":"10.1364/optcon.569959","language":[{"iso":"eng"}],"main_file_link":[{"open_access":"1"}],"intvolume":"         4","publication_status":"published","date_updated":"2026-09-03T09:07:47Z","publication_identifier":{"issn":["2770-0208"]},"author":[{"full_name":"Hammer, Manfred","orcid":"0000-0002-6331-9348","first_name":"Manfred","last_name":"Hammer","id":"48077"},{"last_name":"Khan","first_name":"Shahriar","full_name":"Khan, Shahriar"},{"first_name":"Behnood","last_name":"Taheri","full_name":"Taheri, Behnood"},{"id":"53444","full_name":"Farheen, Henna","orcid":"0000-0001-7730-3489","last_name":"Farheen","first_name":"Henna"},{"id":"158","orcid":"0000-0001-7059-9862","first_name":"Jens","last_name":"Förstner","full_name":"Förstner, Jens"}],"year":"2025","title":"TFLN channel waveguides of rib and strip type: Properties of guided modes","oa":"1","citation":{"chicago":"Hammer, Manfred, Shahriar Khan, Behnood Taheri, Henna Farheen, and Jens Förstner. “TFLN Channel Waveguides of Rib and Strip Type: Properties of Guided Modes.” <i>Optics Continuum</i> 4, no. 10 (2025): 2356. <a href=\"https://doi.org/10.1364/optcon.569959\">https://doi.org/10.1364/optcon.569959</a>.","short":"M. Hammer, S. Khan, B. Taheri, H. Farheen, J. Förstner, Optics Continuum 4 (2025) 2356.","ieee":"M. Hammer, S. Khan, B. Taheri, H. Farheen, and J. Förstner, “TFLN channel waveguides of rib and strip type: Properties of guided modes,” <i>Optics Continuum</i>, vol. 4, no. 10, p. 2356, 2025, doi: <a href=\"https://doi.org/10.1364/optcon.569959\">10.1364/optcon.569959</a>.","apa":"Hammer, M., Khan, S., Taheri, B., Farheen, H., &#38; Förstner, J. (2025). TFLN channel waveguides of rib and strip type: Properties of guided modes. <i>Optics Continuum</i>, <i>4</i>(10), 2356. <a href=\"https://doi.org/10.1364/optcon.569959\">https://doi.org/10.1364/optcon.569959</a>","bibtex":"@article{Hammer_Khan_Taheri_Farheen_Förstner_2025, title={TFLN channel waveguides of rib and strip type: Properties of guided modes}, volume={4}, DOI={<a href=\"https://doi.org/10.1364/optcon.569959\">10.1364/optcon.569959</a>}, number={10}, journal={Optics Continuum}, publisher={Optica Publishing Group}, author={Hammer, Manfred and Khan, Shahriar and Taheri, Behnood and Farheen, Henna and Förstner, Jens}, year={2025}, pages={2356} }","ama":"Hammer M, Khan S, Taheri B, Farheen H, Förstner J. TFLN channel waveguides of rib and strip type: Properties of guided modes. <i>Optics Continuum</i>. 2025;4(10):2356. doi:<a href=\"https://doi.org/10.1364/optcon.569959\">10.1364/optcon.569959</a>","mla":"Hammer, Manfred, et al. “TFLN Channel Waveguides of Rib and Strip Type: Properties of Guided Modes.” <i>Optics Continuum</i>, vol. 4, no. 10, Optica Publishing Group, 2025, p. 2356, doi:<a href=\"https://doi.org/10.1364/optcon.569959\">10.1364/optcon.569959</a>."},"file_date_updated":"2025-10-05T11:48:25Z","volume":4,"user_id":"77496","ddc":["530"],"publisher":"Optica Publishing Group","_id":"60891","page":"2356","has_accepted_license":"1","status":"public"},{"abstract":[{"lang":"eng","text":"Digital Servitization is one of the significant trends affecting the manufacturing industry. Companies try to tackle challenges regarding their differentiation and profitability using digital services. One specific type of digital services are smart services, which are digital services built on data from smart products. Introducing these kinds of offerings into the portfolio of manufacturing companies is not trivial. Moreover, they require conscious action to align all relevant capabilities to realize the respective business goals. However, what capabilities are generally relevant for smart services remains opaque. We conducted a systematic literature review to identify them and extended the results through an interview study. Our analysis results in 78 capabilities clustered among 12 principles and six dimensions. These results provide significant support for the smart service transformation of manufacturing companies and for structuring the research field of smart services."}],"citation":{"apa":"Koldewey, C., Fichtler, T., Scholtysik, M., Biehler, J., Schreiner, N., Sommer, F., Schacht, M., Kaufmann, J., Rabe, M., Sedlmeier, J., &#38; Dumitrescu, R. (2024). <i>Exploring Capabilities for the Smart Service Transformation in Manufacturing: Insights from Theory and Practice</i>. Hawaii International Conference on System Sciences, Hawaii.","ieee":"C. Koldewey <i>et al.</i>, “Exploring Capabilities for the Smart Service Transformation in Manufacturing: Insights from Theory and Practice,” presented at the Hawaii International Conference on System Sciences, Hawaii, 2024.","short":"C. Koldewey, T. Fichtler, M. Scholtysik, J. Biehler, N. Schreiner, F. Sommer, M. Schacht, J. Kaufmann, M. Rabe, J. Sedlmeier, R. Dumitrescu, in: 2024.","chicago":"Koldewey, Christian, Timm Fichtler, Michel Scholtysik, Jan Biehler, Nick Schreiner, Franziska Sommer, Maximilian Schacht, et al. “Exploring Capabilities for the Smart Service Transformation in Manufacturing: Insights from Theory and Practice,” 2024.","mla":"Koldewey, Christian, et al. <i>Exploring Capabilities for the Smart Service Transformation in Manufacturing: Insights from Theory and Practice</i>. 2024.","ama":"Koldewey C, Fichtler T, Scholtysik M, et al. Exploring Capabilities for the Smart Service Transformation in Manufacturing: Insights from Theory and Practice. In: ; 2024.","bibtex":"@inproceedings{Koldewey_Fichtler_Scholtysik_Biehler_Schreiner_Sommer_Schacht_Kaufmann_Rabe_Sedlmeier_et al._2024, title={Exploring Capabilities for the Smart Service Transformation in Manufacturing: Insights from Theory and Practice}, author={Koldewey, Christian and Fichtler, Timm and Scholtysik, Michel and Biehler, Jan and Schreiner, Nick and Sommer, Franziska and Schacht, Maximilian and Kaufmann, Jonas and Rabe, Martin and Sedlmeier, Joachim and et al.}, year={2024} }"},"department":[{"_id":"563"},{"_id":"241"}],"type":"conference","keyword":["Digital Servitization","Transformation","Capabilities","Maturity","Smart Services"],"date_created":"2023-11-06T15:31:32Z","date_updated":"2023-11-06T15:40:33Z","conference":{"end_date":"2024-01-06","start_date":"2024-01-03","name":"Hawaii International Conference on System Sciences","location":"Hawaii"},"author":[{"id":"43136","first_name":"Christian","orcid":"https://orcid.org/0000-0001-7992-6399","last_name":"Koldewey","full_name":"Koldewey, Christian"},{"orcid":"https://orcid.org/0000-0001-6034-4399","first_name":"Timm","last_name":"Fichtler","full_name":"Fichtler, Timm","id":"66731"},{"id":"50562","full_name":"Scholtysik, Michel","last_name":"Scholtysik","first_name":"Michel"},{"full_name":"Biehler, Jan","first_name":"Jan","last_name":"Biehler"},{"last_name":"Schreiner","first_name":"Nick","full_name":"Schreiner, Nick"},{"first_name":"Franziska","last_name":"Sommer","full_name":"Sommer, Franziska"},{"full_name":"Schacht, Maximilian","last_name":"Schacht","first_name":"Maximilian"},{"full_name":"Kaufmann, Jonas","first_name":"Jonas","last_name":"Kaufmann"},{"last_name":"Rabe","first_name":"Martin","full_name":"Rabe, Martin"},{"full_name":"Sedlmeier, Joachim","last_name":"Sedlmeier","first_name":"Joachim"},{"full_name":"Dumitrescu, Roman","first_name":"Roman","last_name":"Dumitrescu","id":"16190"}],"title":"Exploring Capabilities for the Smart Service Transformation in Manufacturing: Insights from Theory and Practice","status":"public","year":"2024","user_id":"66731","language":[{"iso":"eng"}],"_id":"48632"},{"publication":"ML4CPS 2023","citation":{"mla":"Afroze, Lameya, et al. “Domain Knowledge Injection Guidance for Predictive Maintenance.” <i>ML4CPS 2023</i>, 2024.","bibtex":"@inproceedings{Afroze_Merkelbach_von Enzberg_Dumitrescu_2024, title={Domain Knowledge Injection Guidance for Predictive Maintenance}, booktitle={ML4CPS 2023}, author={Afroze, Lameya and Merkelbach, Silke and von Enzberg, Sebastian and Dumitrescu, Roman}, year={2024} }","ama":"Afroze L, Merkelbach S, von Enzberg S, Dumitrescu R. Domain Knowledge Injection Guidance for Predictive Maintenance. In: <i>ML4CPS 2023</i>. ; 2024.","ieee":"L. Afroze, S. Merkelbach, S. von Enzberg, and R. Dumitrescu, “Domain Knowledge Injection Guidance for Predictive Maintenance,” presented at the ML4CPS – Machine Learning For Cyber-Physical Systems, Hamburg, 2024.","apa":"Afroze, L., Merkelbach, S., von Enzberg, S., &#38; Dumitrescu, R. (2024). Domain Knowledge Injection Guidance for Predictive Maintenance. <i>ML4CPS 2023</i>. ML4CPS – Machine Learning For Cyber-Physical Systems, Hamburg.","short":"L. Afroze, S. Merkelbach, S. von Enzberg, R. Dumitrescu, in: ML4CPS 2023, 2024.","chicago":"Afroze, Lameya, Silke Merkelbach, Sebastian von Enzberg, and Roman Dumitrescu. “Domain Knowledge Injection Guidance for Predictive Maintenance.” In <i>ML4CPS 2023</i>, 2024."},"date_created":"2023-11-30T09:59:41Z","type":"conference","department":[{"_id":"563"}],"title":"Domain Knowledge Injection Guidance for Predictive Maintenance","status":"public","year":"2024","conference":{"location":"Hamburg","start_date":"2023-03-29","name":"ML4CPS – Machine Learning For Cyber-Physical Systems","end_date":"2023-0331"},"author":[{"full_name":"Afroze, Lameya","last_name":"Afroze","first_name":"Lameya"},{"full_name":"Merkelbach, Silke","first_name":"Silke","last_name":"Merkelbach"},{"full_name":"von Enzberg, Sebastian","first_name":"Sebastian","last_name":"von Enzberg"},{"last_name":"Dumitrescu","first_name":"Roman","full_name":"Dumitrescu, Roman","id":"16190"}],"date_updated":"2023-11-30T14:09:47Z","_id":"49354","language":[{"iso":"eng"}],"user_id":"15782"},{"date_updated":"2023-11-30T14:27:55Z","status":"public","year":"2024","title":"Business strategy taxonomy and solution patterns for the circular economy","author":[{"id":"50562","last_name":"Scholtysik","first_name":"Michel","full_name":"Scholtysik, Michel"},{"first_name":"Malte","last_name":"Rohde","full_name":"Rohde, Malte"},{"id":"43136","first_name":"Christian","orcid":"https://orcid.org/0000-0001-7992-6399","last_name":"Koldewey","full_name":"Koldewey, Christian"},{"id":"16190","full_name":"Dumitrescu, Roman","last_name":"Dumitrescu","first_name":"Roman"}],"user_id":"50562","_id":"49364","language":[{"iso":"eng"}],"citation":{"ieee":"M. Scholtysik, M. Rohde, C. Koldewey, and R. Dumitrescu, “Business strategy taxonomy and solution patterns for the circular economy,” 2024.","apa":"Scholtysik, M., Rohde, M., Koldewey, C., &#38; Dumitrescu, R. (2024). <i>Business strategy taxonomy and solution patterns for the circular economy</i>.","short":"M. Scholtysik, M. Rohde, C. Koldewey, R. Dumitrescu, in: 2024.","chicago":"Scholtysik, Michel, Malte Rohde, Christian Koldewey, and Roman Dumitrescu. “Business Strategy Taxonomy and Solution Patterns for the Circular Economy,” 2024.","mla":"Scholtysik, Michel, et al. <i>Business Strategy Taxonomy and Solution Patterns for the Circular Economy</i>. 2024.","bibtex":"@inproceedings{Scholtysik_Rohde_Koldewey_Dumitrescu_2024, title={Business strategy taxonomy and solution patterns for the circular economy}, author={Scholtysik, Michel and Rohde, Malte and Koldewey, Christian and Dumitrescu, Roman}, year={2024} }","ama":"Scholtysik M, Rohde M, Koldewey C, Dumitrescu R. Business strategy taxonomy and solution patterns for the circular economy. In: ; 2024."},"type":"conference","department":[{"_id":"563"}],"date_created":"2023-11-30T10:57:30Z"},{"date_updated":"2024-02-06T08:52:44Z","title":"Extended Dynamic Mode Decomposition: Sharp bounds on the sample  efficiency","status":"public","year":"2024","author":[{"first_name":"Friedrich M.","last_name":"Philipp","full_name":"Philipp, Friedrich M."},{"first_name":"Manuel","last_name":"Schaller","full_name":"Schaller, Manuel"},{"full_name":"Boshoff, Septimus","last_name":"Boshoff","first_name":"Septimus"},{"last_name":"Peitz","first_name":"Sebastian","orcid":"0000-0002-3389-793X","full_name":"Peitz, Sebastian","id":"47427"},{"first_name":"Feliks","last_name":"Nüske","full_name":"Nüske, Feliks"},{"full_name":"Worthmann, Karl","last_name":"Worthmann","first_name":"Karl"}],"user_id":"47427","main_file_link":[{"url":"https://arxiv.org/pdf/2402.02494.pdf","open_access":"1"}],"language":[{"iso":"eng"}],"_id":"51160","abstract":[{"lang":"eng","text":"We rigorously derive novel and sharp finite-data error bounds for highly\r\nsample-efficient Extended Dynamic Mode Decomposition (EDMD) for both i.i.d. and\r\nergodic sampling. In particular, we show all results in a very general setting\r\nremoving most of the typically imposed assumptions such that, among others,\r\ndiscrete- and continuous-time stochastic processes as well as nonlinear partial\r\ndifferential equations are contained in the considered system class. Besides\r\nshowing an exponential rate for i.i.d. sampling, we prove, to the best of our\r\nknowledge, the first superlinear convergence rates for ergodic sampling of\r\ndeterministic systems. We verify sharpness of the derived error bounds by\r\nconducting numerical simulations for highly-complex applications from molecular\r\ndynamics and chaotic flame propagation."}],"publication":"arXiv:2402.02494","citation":{"ieee":"F. M. Philipp, M. Schaller, S. Boshoff, S. Peitz, F. Nüske, and K. Worthmann, “Extended Dynamic Mode Decomposition: Sharp bounds on the sample  efficiency,” <i>arXiv:2402.02494</i>. 2024.","apa":"Philipp, F. M., Schaller, M., Boshoff, S., Peitz, S., Nüske, F., &#38; Worthmann, K. (2024). Extended Dynamic Mode Decomposition: Sharp bounds on the sample  efficiency. In <i>arXiv:2402.02494</i>.","mla":"Philipp, Friedrich M., et al. “Extended Dynamic Mode Decomposition: Sharp Bounds on the Sample  Efficiency.” <i>ArXiv:2402.02494</i>, 2024.","bibtex":"@article{Philipp_Schaller_Boshoff_Peitz_Nüske_Worthmann_2024, title={Extended Dynamic Mode Decomposition: Sharp bounds on the sample  efficiency}, journal={arXiv:2402.02494}, author={Philipp, Friedrich M. and Schaller, Manuel and Boshoff, Septimus and Peitz, Sebastian and Nüske, Feliks and Worthmann, Karl}, year={2024} }","chicago":"Philipp, Friedrich M., Manuel Schaller, Septimus Boshoff, Sebastian Peitz, Feliks Nüske, and Karl Worthmann. “Extended Dynamic Mode Decomposition: Sharp Bounds on the Sample  Efficiency.” <i>ArXiv:2402.02494</i>, 2024.","short":"F.M. Philipp, M. Schaller, S. Boshoff, S. Peitz, F. Nüske, K. Worthmann, ArXiv:2402.02494 (2024).","ama":"Philipp FM, Schaller M, Boshoff S, Peitz S, Nüske F, Worthmann K. Extended Dynamic Mode Decomposition: Sharp bounds on the sample  efficiency. <i>arXiv:240202494</i>. Published online 2024."},"type":"preprint","oa":"1","department":[{"_id":"655"}],"external_id":{"arxiv":["2402.02494"]},"date_created":"2024-02-06T08:52:21Z"},{"year":"2024","status":"public","title":"A note on the convergence of deterministic gradient sampling in nonsmooth optimization","author":[{"id":"32643","first_name":"Bennet","last_name":"Gebken","full_name":"Gebken, Bennet"}],"publication_identifier":{"issn":["0926-6003","1573-2894"]},"date_updated":"2024-02-08T08:05:54Z","publication_status":"published","_id":"51208","publisher":"Springer Science and Business Media LLC","language":[{"iso":"eng"}],"doi":"10.1007/s10589-024-00552-0","user_id":"32643","publication":"Computational Optimization and Applications","citation":{"mla":"Gebken, Bennet. “A Note on the Convergence of Deterministic Gradient Sampling in Nonsmooth Optimization.” <i>Computational Optimization and Applications</i>, Springer Science and Business Media LLC, 2024, doi:<a href=\"https://doi.org/10.1007/s10589-024-00552-0\">10.1007/s10589-024-00552-0</a>.","bibtex":"@article{Gebken_2024, title={A note on the convergence of deterministic gradient sampling in nonsmooth optimization}, DOI={<a href=\"https://doi.org/10.1007/s10589-024-00552-0\">10.1007/s10589-024-00552-0</a>}, journal={Computational Optimization and Applications}, publisher={Springer Science and Business Media LLC}, author={Gebken, Bennet}, year={2024} }","ama":"Gebken B. A note on the convergence of deterministic gradient sampling in nonsmooth optimization. <i>Computational Optimization and Applications</i>. Published online 2024. doi:<a href=\"https://doi.org/10.1007/s10589-024-00552-0\">10.1007/s10589-024-00552-0</a>","ieee":"B. Gebken, “A note on the convergence of deterministic gradient sampling in nonsmooth optimization,” <i>Computational Optimization and Applications</i>, 2024, doi: <a href=\"https://doi.org/10.1007/s10589-024-00552-0\">10.1007/s10589-024-00552-0</a>.","apa":"Gebken, B. (2024). A note on the convergence of deterministic gradient sampling in nonsmooth optimization. <i>Computational Optimization and Applications</i>. <a href=\"https://doi.org/10.1007/s10589-024-00552-0\">https://doi.org/10.1007/s10589-024-00552-0</a>","short":"B. Gebken, Computational Optimization and Applications (2024).","chicago":"Gebken, Bennet. “A Note on the Convergence of Deterministic Gradient Sampling in Nonsmooth Optimization.” <i>Computational Optimization and Applications</i>, 2024. <a href=\"https://doi.org/10.1007/s10589-024-00552-0\">https://doi.org/10.1007/s10589-024-00552-0</a>."},"abstract":[{"text":"<jats:title>Abstract</jats:title><jats:p>Approximation of subdifferentials is one of the main tasks when computing descent directions for nonsmooth optimization problems. In this article, we propose a bisection method for weakly lower semismooth functions which is able to compute new subgradients that improve a given approximation in case a direction with insufficient descent was computed. Combined with a recently proposed deterministic gradient sampling approach, this yields a deterministic and provably convergent way to approximate subdifferentials for computing descent directions.</jats:p>","lang":"eng"}],"date_created":"2024-02-07T07:23:23Z","keyword":["Applied Mathematics","Computational Mathematics","Control and Optimization"],"type":"journal_article","department":[{"_id":"101"}]},{"date_updated":"2024-02-21T10:13:33Z","publication_status":"published","year":"2024","title":"Fast Multiobjective Gradient Methods with Nesterov Acceleration via Inertial Gradient-Like Systems","status":"public","author":[{"id":"56399","full_name":"Sonntag, Konstantin","first_name":"Konstantin","orcid":"https://orcid.org/0000-0003-3384-3496","last_name":"Sonntag"},{"full_name":"Peitz, Sebastian","last_name":"Peitz","first_name":"Sebastian","orcid":"0000-0002-3389-793X","id":"47427"}],"doi":"10.1007/s10957-024-02389-3","user_id":"56399","main_file_link":[{"url":"https://link.springer.com/content/pdf/10.1007/s10957-024-02389-3.pdf","open_access":"1"}],"language":[{"iso":"eng"}],"_id":"46019","publisher":"Springer","abstract":[{"text":"We derive efficient algorithms to compute weakly Pareto optimal solutions for smooth, convex and unconstrained multiobjective optimization problems in general Hilbert spaces. To this end, we define a novel inertial gradient-like dynamical system in the multiobjective setting, which trajectories converge weakly to Pareto optimal solutions. Discretization of this system yields an inertial multiobjective algorithm which generates sequences that converge weakly to Pareto optimal solutions. We employ Nesterov acceleration to define an algorithm with an improved convergence rate compared to the plain multiobjective steepest descent method (Algorithm 1). A further improvement in terms of efficiency is achieved by avoiding the solution of a quadratic subproblem to compute a common step direction for all objective functions, which is usually required in first-order methods. Using a different discretization of our inertial gradient-like dynamical system, we obtain an accelerated multiobjective gradient method that does not require the solution of a subproblem in each step (Algorithm 2). While this algorithm does not converge in general, it yields good results on test problems while being faster than standard steepest descent.","lang":"eng"}],"publication":"Journal of Optimization Theory and Applications","citation":{"chicago":"Sonntag, Konstantin, and Sebastian Peitz. “Fast Multiobjective Gradient Methods with Nesterov Acceleration via Inertial Gradient-Like Systems.” <i>Journal of Optimization Theory and Applications</i>, 2024. <a href=\"https://doi.org/10.1007/s10957-024-02389-3\">https://doi.org/10.1007/s10957-024-02389-3</a>.","short":"K. Sonntag, S. Peitz, Journal of Optimization Theory and Applications (2024).","apa":"Sonntag, K., &#38; Peitz, S. (2024). Fast Multiobjective Gradient Methods with Nesterov Acceleration via Inertial Gradient-Like Systems. <i>Journal of Optimization Theory and Applications</i>. <a href=\"https://doi.org/10.1007/s10957-024-02389-3\">https://doi.org/10.1007/s10957-024-02389-3</a>","ieee":"K. Sonntag and S. Peitz, “Fast Multiobjective Gradient Methods with Nesterov Acceleration via Inertial Gradient-Like Systems,” <i>Journal of Optimization Theory and Applications</i>, 2024, doi: <a href=\"https://doi.org/10.1007/s10957-024-02389-3\">10.1007/s10957-024-02389-3</a>.","ama":"Sonntag K, Peitz S. Fast Multiobjective Gradient Methods with Nesterov Acceleration via Inertial Gradient-Like Systems. <i>Journal of Optimization Theory and Applications</i>. Published online 2024. doi:<a href=\"https://doi.org/10.1007/s10957-024-02389-3\">10.1007/s10957-024-02389-3</a>","bibtex":"@article{Sonntag_Peitz_2024, title={Fast Multiobjective Gradient Methods with Nesterov Acceleration via Inertial Gradient-Like Systems}, DOI={<a href=\"https://doi.org/10.1007/s10957-024-02389-3\">10.1007/s10957-024-02389-3</a>}, journal={Journal of Optimization Theory and Applications}, publisher={Springer}, author={Sonntag, Konstantin and Peitz, Sebastian}, year={2024} }","mla":"Sonntag, Konstantin, and Sebastian Peitz. “Fast Multiobjective Gradient Methods with Nesterov Acceleration via Inertial Gradient-Like Systems.” <i>Journal of Optimization Theory and Applications</i>, Springer, 2024, doi:<a href=\"https://doi.org/10.1007/s10957-024-02389-3\">10.1007/s10957-024-02389-3</a>."},"type":"journal_article","oa":"1","department":[{"_id":"101"},{"_id":"655"}],"date_created":"2023-07-12T06:35:58Z"},{"user_id":"56399","_id":"51334","language":[{"iso":"eng"}],"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/2402.06376"}],"has_accepted_license":"1","date_updated":"2024-02-21T10:21:03Z","author":[{"last_name":"Sonntag","first_name":"Konstantin","orcid":"https://orcid.org/0000-0003-3384-3496","full_name":"Sonntag, Konstantin","id":"56399"},{"id":"32643","full_name":"Gebken, Bennet","last_name":"Gebken","first_name":"Bennet"},{"full_name":"Müller, Georg","last_name":"Müller","first_name":"Georg"},{"full_name":"Peitz, Sebastian","orcid":"0000-0002-3389-793X","last_name":"Peitz","first_name":"Sebastian","id":"47427"},{"full_name":"Volkwein, Stefan","last_name":"Volkwein","first_name":"Stefan"}],"status":"public","title":"A Descent Method for Nonsmooth Multiobjective Optimization in Hilbert Spaces","year":"2024","oa":"1","department":[{"_id":"101"},{"_id":"655"}],"type":"preprint","date_created":"2024-02-13T09:35:26Z","external_id":{"arxiv":["\t2402.06376"]},"abstract":[{"text":"The efficient optimization method for locally Lipschitz continuous multiobjective optimization problems from [1] is extended from finite-dimensional problems to general Hilbert spaces. The method iteratively computes Pareto critical points, where in each iteration, an approximation of the subdifferential is computed in an efficient manner and then used to compute a common descent direction for all objective functions. To prove convergence, we present some new optimality results for nonsmooth multiobjective optimization problems in Hilbert spaces. Using these, we can show that every accumulation point of the sequence generated by our algorithm is Pareto critical under common assumptions. Computational efficiency for finding Pareto critical points is numerically demonstrated for multiobjective optimal control of an obstacle problem.","lang":"eng"}],"citation":{"ieee":"K. Sonntag, B. Gebken, G. Müller, S. Peitz, and S. Volkwein, “A Descent Method for Nonsmooth Multiobjective Optimization in Hilbert Spaces,” <i>arXiv:2402.06376</i>. 2024.","apa":"Sonntag, K., Gebken, B., Müller, G., Peitz, S., &#38; Volkwein, S. (2024). A Descent Method for Nonsmooth Multiobjective Optimization in Hilbert Spaces. In <i>arXiv:2402.06376</i>.","chicago":"Sonntag, Konstantin, Bennet Gebken, Georg Müller, Sebastian Peitz, and Stefan Volkwein. “A Descent Method for Nonsmooth Multiobjective Optimization in Hilbert Spaces.” <i>ArXiv:2402.06376</i>, 2024.","short":"K. Sonntag, B. Gebken, G. Müller, S. Peitz, S. Volkwein, ArXiv:2402.06376 (2024).","mla":"Sonntag, Konstantin, et al. “A Descent Method for Nonsmooth Multiobjective Optimization in Hilbert Spaces.” <i>ArXiv:2402.06376</i>, 2024.","bibtex":"@article{Sonntag_Gebken_Müller_Peitz_Volkwein_2024, title={A Descent Method for Nonsmooth Multiobjective Optimization in Hilbert Spaces}, journal={arXiv:2402.06376}, author={Sonntag, Konstantin and Gebken, Bennet and Müller, Georg and Peitz, Sebastian and Volkwein, Stefan}, year={2024} }","ama":"Sonntag K, Gebken B, Müller G, Peitz S, Volkwein S. A Descent Method for Nonsmooth Multiobjective Optimization in Hilbert Spaces. <i>arXiv:240206376</i>. Published online 2024."},"publication":"arXiv:2402.06376"},{"user_id":"47427","volume":461,"page":"134096","publisher":"Elsevier","_id":"40171","status":"public","oa":"1","citation":{"mla":"Peitz, Sebastian, et al. “Distributed Control of Partial Differential Equations Using  Convolutional Reinforcement Learning.” <i>Physica D: Nonlinear Phenomena</i>, vol. 461, Elsevier, 2024, p. 134096, doi:<a href=\"https://doi.org/10.1016/j.physd.2024.134096\">10.1016/j.physd.2024.134096</a>.","bibtex":"@article{Peitz_Stenner_Chidananda_Wallscheid_Brunton_Taira_2024, title={Distributed Control of Partial Differential Equations Using  Convolutional Reinforcement Learning}, volume={461}, DOI={<a href=\"https://doi.org/10.1016/j.physd.2024.134096\">10.1016/j.physd.2024.134096</a>}, journal={Physica D: Nonlinear Phenomena}, publisher={Elsevier}, author={Peitz, Sebastian and Stenner, Jan and Chidananda, Vikas and Wallscheid, Oliver and Brunton, Steven L. and Taira, Kunihiko}, year={2024}, pages={134096} }","ama":"Peitz S, Stenner J, Chidananda V, Wallscheid O, Brunton SL, Taira K. Distributed Control of Partial Differential Equations Using  Convolutional Reinforcement Learning. <i>Physica D: Nonlinear Phenomena</i>. 2024;461:134096. doi:<a href=\"https://doi.org/10.1016/j.physd.2024.134096\">10.1016/j.physd.2024.134096</a>","ieee":"S. Peitz, J. Stenner, V. Chidananda, O. Wallscheid, S. L. Brunton, and K. Taira, “Distributed Control of Partial Differential Equations Using  Convolutional Reinforcement Learning,” <i>Physica D: Nonlinear Phenomena</i>, vol. 461, p. 134096, 2024, doi: <a href=\"https://doi.org/10.1016/j.physd.2024.134096\">10.1016/j.physd.2024.134096</a>.","apa":"Peitz, S., Stenner, J., Chidananda, V., Wallscheid, O., Brunton, S. L., &#38; Taira, K. (2024). Distributed Control of Partial Differential Equations Using  Convolutional Reinforcement Learning. <i>Physica D: Nonlinear Phenomena</i>, <i>461</i>, 134096. <a href=\"https://doi.org/10.1016/j.physd.2024.134096\">https://doi.org/10.1016/j.physd.2024.134096</a>","short":"S. Peitz, J. Stenner, V. Chidananda, O. Wallscheid, S.L. Brunton, K. Taira, Physica D: Nonlinear Phenomena 461 (2024) 134096.","chicago":"Peitz, Sebastian, Jan Stenner, Vikas Chidananda, Oliver Wallscheid, Steven L. Brunton, and Kunihiko Taira. “Distributed Control of Partial Differential Equations Using  Convolutional Reinforcement Learning.” <i>Physica D: Nonlinear Phenomena</i> 461 (2024): 134096. <a href=\"https://doi.org/10.1016/j.physd.2024.134096\">https://doi.org/10.1016/j.physd.2024.134096</a>."},"doi":"10.1016/j.physd.2024.134096","main_file_link":[{"url":"https://doi.org/10.1016/j.physd.2024.134096","open_access":"1"}],"language":[{"iso":"eng"}],"date_updated":"2024-02-23T10:53:42Z","intvolume":"       461","article_type":"original","year":"2024","title":"Distributed Control of Partial Differential Equations Using  Convolutional Reinforcement Learning","author":[{"id":"47427","orcid":"0000-0002-3389-793X","first_name":"Sebastian","last_name":"Peitz","full_name":"Peitz, Sebastian"},{"full_name":"Stenner, Jan","last_name":"Stenner","first_name":"Jan","id":"65520"},{"full_name":"Chidananda, Vikas","last_name":"Chidananda","first_name":"Vikas"},{"id":"11291","orcid":"https://orcid.org/0000-0001-9362-8777","last_name":"Wallscheid","first_name":"Oliver","full_name":"Wallscheid, Oliver"},{"full_name":"Brunton, Steven L.","first_name":"Steven L.","last_name":"Brunton"},{"last_name":"Taira","first_name":"Kunihiko","full_name":"Taira, Kunihiko"}],"type":"journal_article","department":[{"_id":"655"}],"date_created":"2023-01-26T07:56:26Z","abstract":[{"lang":"eng","text":"We present a convolutional framework which significantly reduces the complexity and thus, the computational effort for distributed reinforcement learning control of dynamical systems governed by partial differential equations (PDEs). Exploiting translational equivariances, the high-dimensional distributed control problem can be transformed into a multi-agent control problem with many identical, uncoupled agents. Furthermore, using the fact that information is transported with finite velocity in many cases, the dimension of the agents’ environment can be drastically reduced using a convolution operation over the state space of the PDE, by which we effectively tackle the curse of dimensionality otherwise present in deep reinforcement learning. In this setting, the complexity can be flexibly adjusted via the kernel width or by using a stride greater than one (meaning that we do not place an actuator at each sensor location). Moreover, scaling from smaller to larger domains – or the transfer between different domains – becomes a straightforward task requiring little effort. We demonstrate the performance of the proposed framework using several PDE examples with increasing complexity, where stabilization is achieved by training a low-dimensional deep deterministic policy gradient agent using minimal computing resources."}],"publication":"Physica D: Nonlinear Phenomena"},{"citation":{"ama":"Dorociak S. <i>Implementierung Eines Algorithmus Zur Motivbasierten Schnitt-Sparsifizierung</i>.; 2024.","bibtex":"@book{Dorociak_2024, title={Implementierung eines Algorithmus zur motivbasierten Schnitt-Sparsifizierung}, author={Dorociak, Svitlana}, year={2024} }","mla":"Dorociak, Svitlana. <i>Implementierung Eines Algorithmus Zur Motivbasierten Schnitt-Sparsifizierung</i>. 2024.","short":"S. Dorociak, Implementierung Eines Algorithmus Zur Motivbasierten Schnitt-Sparsifizierung, 2024.","chicago":"Dorociak, Svitlana. <i>Implementierung Eines Algorithmus Zur Motivbasierten Schnitt-Sparsifizierung</i>, 2024.","apa":"Dorociak, S. (2024). <i>Implementierung eines Algorithmus zur motivbasierten Schnitt-Sparsifizierung</i>.","ieee":"S. Dorociak, <i>Implementierung eines Algorithmus zur motivbasierten Schnitt-Sparsifizierung</i>. 2024."},"supervisor":[{"id":"20792","last_name":"Scheideler","first_name":"Christian","full_name":"Scheideler, Christian"}],"date_created":"2024-03-05T12:52:59Z","type":"bachelorsthesis","department":[{"_id":"34"},{"_id":"7"},{"_id":"79"}],"title":"Implementierung eines Algorithmus zur motivbasierten Schnitt-Sparsifizierung","year":"2024","status":"public","author":[{"full_name":"Dorociak, Svitlana","last_name":"Dorociak","first_name":"Svitlana"}],"date_updated":"2024-03-05T12:53:25Z","language":[{"iso":"eng"}],"_id":"52318","user_id":"15578"},{"external_id":{"arxiv":["2209.09977"]},"oa":"1","citation":{"ama":"Otto SE, Peitz S, Rowley CW. Learning Bilinear Models of Actuated Koopman Generators from  Partially-Observed Trajectories. <i>SIAM Journal on Applied Dynamical Systems</i>. 2024;23(1):885-923. doi:<a href=\"https://doi.org/10.1137/22M1523601\">10.1137/22M1523601</a>","bibtex":"@article{Otto_Peitz_Rowley_2024, title={Learning Bilinear Models of Actuated Koopman Generators from  Partially-Observed Trajectories}, volume={23}, DOI={<a href=\"https://doi.org/10.1137/22M1523601\">10.1137/22M1523601</a>}, number={1}, journal={SIAM Journal on Applied Dynamical Systems}, publisher={SIAM}, author={Otto, Samuel E. and Peitz, Sebastian and Rowley, Clarence W.}, year={2024}, pages={885–923} }","mla":"Otto, Samuel E., et al. “Learning Bilinear Models of Actuated Koopman Generators from  Partially-Observed Trajectories.” <i>SIAM Journal on Applied Dynamical Systems</i>, vol. 23, no. 1, SIAM, 2024, pp. 885–923, doi:<a href=\"https://doi.org/10.1137/22M1523601\">10.1137/22M1523601</a>.","short":"S.E. Otto, S. Peitz, C.W. Rowley, SIAM Journal on Applied Dynamical Systems 23 (2024) 885–923.","chicago":"Otto, Samuel E., Sebastian Peitz, and Clarence W. Rowley. “Learning Bilinear Models of Actuated Koopman Generators from  Partially-Observed Trajectories.” <i>SIAM Journal on Applied Dynamical Systems</i> 23, no. 1 (2024): 885–923. <a href=\"https://doi.org/10.1137/22M1523601\">https://doi.org/10.1137/22M1523601</a>.","apa":"Otto, S. E., Peitz, S., &#38; Rowley, C. W. (2024). Learning Bilinear Models of Actuated Koopman Generators from  Partially-Observed Trajectories. <i>SIAM Journal on Applied Dynamical Systems</i>, <i>23</i>(1), 885–923. <a href=\"https://doi.org/10.1137/22M1523601\">https://doi.org/10.1137/22M1523601</a>","ieee":"S. E. Otto, S. Peitz, and C. W. Rowley, “Learning Bilinear Models of Actuated Koopman Generators from  Partially-Observed Trajectories,” <i>SIAM Journal on Applied Dynamical Systems</i>, vol. 23, no. 1, pp. 885–923, 2024, doi: <a href=\"https://doi.org/10.1137/22M1523601\">10.1137/22M1523601</a>."},"project":[{"_id":"52","name":"PC2: Computing Resources Provided by the Paderborn Center for Parallel Computing"}],"publisher":"SIAM","_id":"33461","page":"885-923","volume":23,"user_id":"47427","status":"public","date_created":"2022-09-22T07:21:40Z","department":[{"_id":"655"}],"type":"journal_article","publication":"SIAM Journal on Applied Dynamical Systems","issue":"1","abstract":[{"text":"Data-driven models for nonlinear dynamical systems based on approximating the underlying Koopman operator or generator have proven to be successful tools for forecasting, feature learning, state estimation, and control. It has become well known that the Koopman generators for control-affine systems also have affine dependence on the input, leading to convenient finite-dimensional bilinear approximations of the dynamics. Yet there are still two main obstacles that limit the scope of current approaches for approximating the Koopman generators of systems with actuation. First, the performance of existing methods depends heavily on the choice of basis functions over which the Koopman generator is to be approximated; and there is currently no universal way to choose them for systems that are not measure preserving. Secondly, if we do not observe the full state, we may not gain access to a sufficiently rich collection of such functions to describe the dynamics. This is because the commonly used method of forming time-delayed observables fails when there is actuation. To remedy these issues, we write the dynamics of observables governed by the Koopman generator as a bilinear hidden Markov model, and determine the model parameters using the expectation-maximization (EM) algorithm. The E-step involves a standard Kalman filter and smoother, while the M-step resembles control-affine dynamic mode decomposition for the generator. We demonstrate the performance of this method on three examples, including recovery of a finite-dimensional Koopman-invariant subspace for an actuated system with a slow manifold; estimation of Koopman eigenfunctions for the unforced Duffing equation; and model-predictive control of a fluidic pinball system based only on noisy observations of lift and drag.","lang":"eng"}],"language":[{"iso":"eng"}],"main_file_link":[{"url":"https://arxiv.org/pdf/2209.09977.pdf","open_access":"1"}],"doi":"10.1137/22M1523601","author":[{"first_name":"Samuel E.","last_name":"Otto","full_name":"Otto, Samuel E."},{"id":"47427","first_name":"Sebastian","last_name":"Peitz","orcid":"0000-0002-3389-793X","full_name":"Peitz, Sebastian"},{"full_name":"Rowley, Clarence W.","first_name":"Clarence W.","last_name":"Rowley"}],"title":"Learning Bilinear Models of Actuated Koopman Generators from  Partially-Observed Trajectories","year":"2024","intvolume":"        23","date_updated":"2024-03-18T10:40:08Z","publication_status":"published"},{"status":"public","year":"2024","title":"Supporting Error Chains in Static Analysis for Precise Evaluation Results and Enhanced Usability","author":[{"first_name":"Anna-Katharina","last_name":"Wickert","full_name":"Wickert, Anna-Katharina"},{"full_name":"Schlichtig, Michael","last_name":"Schlichtig","orcid":"0000-0001-6600-6171","first_name":"Michael","id":"32312"},{"full_name":"Vogel, Marvin","first_name":"Marvin","last_name":"Vogel"},{"first_name":"Lukas","last_name":"Winter","full_name":"Winter, Lukas"},{"first_name":"Mira","last_name":"Mezini","full_name":"Mezini, Mira"},{"last_name":"Bodden","orcid":"0000-0003-3470-3647","first_name":"Eric","full_name":"Bodden, Eric","id":"59256"}],"date_updated":"2024-03-20T09:32:29Z","main_file_link":[{"url":"https://arxiv.org/abs/2403.07808"}],"language":[{"iso":"eng"}],"_id":"52663","user_id":"32312","citation":{"bibtex":"@book{Wickert_Schlichtig_Vogel_Winter_Mezini_Bodden_2024, title={Supporting Error Chains in Static Analysis for Precise Evaluation Results and Enhanced Usability}, author={Wickert, Anna-Katharina and Schlichtig, Michael and Vogel, Marvin and Winter, Lukas and Mezini, Mira and Bodden, Eric}, year={2024} }","ama":"Wickert A-K, Schlichtig M, Vogel M, Winter L, Mezini M, Bodden E. <i>Supporting Error Chains in Static Analysis for Precise Evaluation Results and Enhanced Usability</i>.; 2024.","mla":"Wickert, Anna-Katharina, et al. <i>Supporting Error Chains in Static Analysis for Precise Evaluation Results and Enhanced Usability</i>. 2024.","short":"A.-K. Wickert, M. Schlichtig, M. Vogel, L. Winter, M. Mezini, E. Bodden, Supporting Error Chains in Static Analysis for Precise Evaluation Results and Enhanced Usability, 2024.","chicago":"Wickert, Anna-Katharina, Michael Schlichtig, Marvin Vogel, Lukas Winter, Mira Mezini, and Eric Bodden. <i>Supporting Error Chains in Static Analysis for Precise Evaluation Results and Enhanced Usability</i>, 2024.","ieee":"A.-K. Wickert, M. Schlichtig, M. Vogel, L. Winter, M. Mezini, and E. Bodden, <i>Supporting Error Chains in Static Analysis for Precise Evaluation Results and Enhanced Usability</i>. 2024.","apa":"Wickert, A.-K., Schlichtig, M., Vogel, M., Winter, L., Mezini, M., &#38; Bodden, E. (2024). <i>Supporting Error Chains in Static Analysis for Precise Evaluation Results and Enhanced Usability</i>."},"abstract":[{"text":"Context\r\nStatic analyses are well-established to aid in understanding bugs or vulnerabilities during the development process or in large-scale studies. A low false-positive rate is essential for the adaption in practice and for precise results of empirical studies. Unfortunately, static analyses tend to report where a vulnerability manifests rather than the fix location. This can cause presumed false positives or imprecise results.\r\nMethod\r\nTo address this problem, we designed an adaption of an existing static analysis algorithm that can distinguish between a manifestation and fix location, and reports error chains. An error chain represents at least two interconnected errors that occur successively, thus building the connection between the fix and manifestation location. We used our tool CogniCryptSUBS for a case study on 471 GitHub repositories, a performance benchmark to compare different analysis configurations, and conducted an expert interview.\r\nResult\r\nWe found that 50 % of the projects with a report had at least one error chain. Our runtime benchmark demonstrated that our improvement caused only a minimal runtime overhead of less than 4 %. The results of our expert interview indicate that with our adapted version participants require fewer executions of the analysis.\r\nConclusion\r\nOur results indicate that error chains occur frequently in real-world projects, and ignoring them can lead to imprecise evaluation results. The runtime benchmark indicates that our tool is a feasible and efficient solution for detecting error chains in real-world projects. Further, our results gave a hint that the usability of static analyses may benefit from supporting error chains.","lang":"eng"}],"date_created":"2024-03-20T09:28:36Z","keyword":["Static analysis","error chains","false positive re- duction","empirical studies"],"type":"misc","department":[{"_id":"76"}]}]