[{"publication_identifier":{"issn":["0732-3123"]},"publication_status":"published","year":"2025","intvolume":"        79","citation":{"ama":"Krüger K, Werth G. Mathematics education for girls in Prussia 1890–1925. <i>The Journal of Mathematical Behavior</i>. 2025;79. doi:<a href=\"https://doi.org/10.1016/j.jmathb.2025.101242\">10.1016/j.jmathb.2025.101242</a>","ieee":"K. Krüger and G. Werth, “Mathematics education for girls in Prussia 1890–1925,” <i>The Journal of Mathematical Behavior</i>, vol. 79, Art. no. 101242, 2025, doi: <a href=\"https://doi.org/10.1016/j.jmathb.2025.101242\">10.1016/j.jmathb.2025.101242</a>.","chicago":"Krüger, Katja, and Gerda Werth. “Mathematics Education for Girls in Prussia 1890–1925.” <i>The Journal of Mathematical Behavior</i> 79 (2025). <a href=\"https://doi.org/10.1016/j.jmathb.2025.101242\">https://doi.org/10.1016/j.jmathb.2025.101242</a>.","bibtex":"@article{Krüger_Werth_2025, title={Mathematics education for girls in Prussia 1890–1925}, volume={79}, DOI={<a href=\"https://doi.org/10.1016/j.jmathb.2025.101242\">10.1016/j.jmathb.2025.101242</a>}, number={101242}, journal={The Journal of Mathematical Behavior}, publisher={Elsevier BV}, author={Krüger, Katja and Werth, Gerda}, year={2025} }","mla":"Krüger, Katja, and Gerda Werth. “Mathematics Education for Girls in Prussia 1890–1925.” <i>The Journal of Mathematical Behavior</i>, vol. 79, 101242, Elsevier BV, 2025, doi:<a href=\"https://doi.org/10.1016/j.jmathb.2025.101242\">10.1016/j.jmathb.2025.101242</a>.","short":"K. Krüger, G. Werth, The Journal of Mathematical Behavior 79 (2025).","apa":"Krüger, K., &#38; Werth, G. (2025). Mathematics education for girls in Prussia 1890–1925. <i>The Journal of Mathematical Behavior</i>, <i>79</i>, Article 101242. <a href=\"https://doi.org/10.1016/j.jmathb.2025.101242\">https://doi.org/10.1016/j.jmathb.2025.101242</a>"},"publisher":"Elsevier BV","date_updated":"2025-03-10T10:54:03Z","volume":79,"author":[{"last_name":"Krüger","full_name":"Krüger, Katja","first_name":"Katja"},{"last_name":"Werth","full_name":"Werth, Gerda","id":"578","first_name":"Gerda"}],"date_created":"2025-03-10T10:46:07Z","title":"Mathematics education for girls in Prussia 1890–1925","doi":"10.1016/j.jmathb.2025.101242","publication":"The Journal of Mathematical Behavior","type":"journal_article","status":"public","_id":"58947","department":[{"_id":"34"},{"_id":"10"},{"_id":"98"},{"_id":"360"}],"user_id":"578","article_number":"101242","language":[{"iso":"eng"}]},{"year":"2025","title":"Analyzing Symmetries of Swarms of Mobile Robots Using Equivariant  Dynamical Systems","date_created":"2025-03-11T08:21:05Z","abstract":[{"text":"In this article, we investigate symmetry properties of distributed systems of mobile robots. We consider a swarm of n robots in the OBLOT model and analyze their collective Fsync dynamics using of equivariant dynamical systems theory. To this end, we show that the corresponding evolution function commutes with rotational and reflective transformations of R^2. These form a group that is isomorphic to O(2) x S_n, the product group of the orthogonal group and the permutation on n elements. The theory of equivariant dynamical systems is used to deduce a hierarchy along which symmetries of a robot swarm can potentially increase following an arbitrary protocol. By decoupling the Look phase from the Compute and Move phases in the mathematical description of an LCM cycle, this hierarchy can be characterized in terms of automorphisms of connectivity graphs. In particular, we find all possible types of symmetry increase, if the decoupled Compute and Move phase is invertible. Finally, we apply our results to protocols which induce state-dependent linear dynamics, where the reduced system consisting of only the Compute and Move phase is linear.","lang":"eng"}],"file":[{"access_level":"open_access","file_id":"58954","file_name":"Analyzing_Symmetries_of_Swarms_of_Mobile_Robots_Using_Equivariant_Dynamical_Systems.pdf","file_size":812198,"date_created":"2025-03-11T08:27:32Z","creator":"svdg","date_updated":"2025-03-11T08:27:32Z","relation":"main_file","content_type":"application/pdf"}],"publication":"arXiv:2503.07576","keyword":["dynamical systems","coupled systems","distributed computing","robot swarms","autonomous mobile robots","symmetry","equivariant dynamics"],"ddc":["004"],"language":[{"iso":"eng"}],"external_id":{"arxiv":["2503.07576"]},"page":"23","citation":{"bibtex":"@article{Gerlach_von der Gracht_2025, title={Analyzing Symmetries of Swarms of Mobile Robots Using Equivariant  Dynamical Systems}, journal={arXiv:2503.07576}, author={Gerlach, Raphael and von der Gracht, Sören}, year={2025} }","mla":"Gerlach, Raphael, and Sören von der Gracht. “Analyzing Symmetries of Swarms of Mobile Robots Using Equivariant  Dynamical Systems.” <i>ArXiv:2503.07576</i>, 2025.","short":"R. Gerlach, S. von der Gracht, ArXiv:2503.07576 (2025).","apa":"Gerlach, R., &#38; von der Gracht, S. (2025). Analyzing Symmetries of Swarms of Mobile Robots Using Equivariant  Dynamical Systems. In <i>arXiv:2503.07576</i>.","ama":"Gerlach R, von der Gracht S. Analyzing Symmetries of Swarms of Mobile Robots Using Equivariant  Dynamical Systems. <i>arXiv:250307576</i>. Published online 2025.","chicago":"Gerlach, Raphael, and Sören von der Gracht. “Analyzing Symmetries of Swarms of Mobile Robots Using Equivariant  Dynamical Systems.” <i>ArXiv:2503.07576</i>, 2025.","ieee":"R. Gerlach and S. von der Gracht, “Analyzing Symmetries of Swarms of Mobile Robots Using Equivariant  Dynamical Systems,” <i>arXiv:2503.07576</i>. 2025."},"has_accepted_license":"1","date_updated":"2025-03-11T08:53:02Z","oa":"1","author":[{"first_name":"Raphael","orcid":"0009-0002-4750-2051","last_name":"Gerlach","id":"32655","full_name":"Gerlach, Raphael"},{"full_name":"von der Gracht, Sören","id":"97359","orcid":"0000-0002-8054-2058","last_name":"von der Gracht","first_name":"Sören"}],"status":"public","type":"preprint","file_date_updated":"2025-03-11T08:27:32Z","_id":"58953","project":[{"_id":"106","name":"Algorithmen für Schwarmrobotik: Verteiltes Rechnen trifft Dynamische Systeme","grant_number":"453112019"}],"department":[{"_id":"101"}],"user_id":"97359"},{"citation":{"chicago":"Last, Yorick, and Patricia Arias Cabarcos. “Vision: Towards True User-Centric Design for Digital Identity Wallets.” In <i>Symposium on Usable Security and Privacy (USEC) 2025</i>, 2025.","ieee":"Y. Last and P. Arias Cabarcos, “Vision: Towards True User-Centric Design for Digital Identity Wallets,” presented at the Symposium on Usable Security and Privacy (USEC) 2025, San Diego, U.S.A., 2025.","ama":"Last Y, Arias Cabarcos P. Vision: Towards True User-Centric Design for Digital Identity Wallets. In: <i>Symposium on Usable Security and Privacy (USEC) 2025</i>. ; 2025.","bibtex":"@inproceedings{Last_Arias Cabarcos_2025, title={Vision: Towards True User-Centric Design for Digital Identity Wallets}, booktitle={Symposium on Usable Security and Privacy (USEC) 2025}, author={Last, Yorick and Arias Cabarcos, Patricia}, year={2025} }","mla":"Last, Yorick, and Patricia Arias Cabarcos. “Vision: Towards True User-Centric Design for Digital Identity Wallets.” <i>Symposium on Usable Security and Privacy (USEC) 2025</i>, 2025.","short":"Y. Last, P. Arias Cabarcos, in: Symposium on Usable Security and Privacy (USEC) 2025, 2025.","apa":"Last, Y., &#38; Arias Cabarcos, P. (2025). Vision: Towards True User-Centric Design for Digital Identity Wallets. <i>Symposium on Usable Security and Privacy (USEC) 2025</i>. Symposium on Usable Security and Privacy (USEC) 2025, San Diego, U.S.A."},"year":"2025","publication_identifier":{"isbn":["979-8-9919276-5-9"]},"conference":{"name":"Symposium on Usable Security and Privacy (USEC) 2025","location":"San Diego, U.S.A."},"main_file_link":[{"url":"https://www.ndss-symposium.org/wp-content/uploads/usec25-1.pdf","open_access":"1"}],"title":"Vision: Towards True User-Centric Design for Digital Identity Wallets","author":[{"orcid":"0009-0008-9529-2427","last_name":"Last","full_name":"Last, Yorick","id":"100966","first_name":"Yorick"},{"last_name":"Arias Cabarcos","full_name":"Arias Cabarcos, Patricia","id":"92804","first_name":"Patricia"}],"date_created":"2025-03-14T23:12:43Z","oa":"1","date_updated":"2025-03-15T09:08:45Z","status":"public","abstract":[{"lang":"eng","text":"To facilitate the growing demand for a universal means of digital identification across services, while preserving user control and privacy, multiple digital identity implementations have emerged. From a technical perspective, many of these rely on established concepts within cryptography, allowing them to provide benefits in terms of security and privacy. Recent legislation also promises broader recognition and acceptance of digital identities, both in the digital world and beyond. However, research into the usability, accessibility, and user understanding of digital identities is rare. We argue that the development of usable digital identity wallets is vital to the successful and inclusive application of digital identities in society. In this vision paper, we describe our research plans for obtaining a better understanding of how to develop these usable digital identities wallets."}],"publication":"Symposium on Usable Security and Privacy (USEC) 2025","type":"conference","language":[{"iso":"eng"}],"department":[{"_id":"679"}],"user_id":"100966","_id":"59019"},{"title":"Förderung von statistischem Denken im Mathematikunterricht der Primarstufe: Bedeutsame Ideen und Förderungsmöglichkeiten","author":[{"last_name":"Frischemeier","full_name":"Frischemeier, Daniel","first_name":"Daniel"},{"first_name":"Rolf","full_name":"Biehler, Rolf","id":"16274","last_name":"Biehler"}],"date_created":"2025-03-17T09:02:59Z","volume":45,"date_updated":"2025-03-17T09:03:05Z","citation":{"apa":"Frischemeier, D., &#38; Biehler, R. (2025). Förderung von statistischem Denken im Mathematikunterricht der Primarstufe: Bedeutsame Ideen und Förderungsmöglichkeiten. <i>Stochastik in der Schule</i>, <i>45</i>(1), 22–33.","mla":"Frischemeier, Daniel, and Rolf Biehler. “Förderung von statistischem Denken im Mathematikunterricht der Primarstufe: Bedeutsame Ideen und Förderungsmöglichkeiten.” <i>Stochastik in der Schule</i>, vol. 45, no. 1, 2025, pp. 22–33.","bibtex":"@article{Frischemeier_Biehler_2025, title={Förderung von statistischem Denken im Mathematikunterricht der Primarstufe: Bedeutsame Ideen und Förderungsmöglichkeiten}, volume={45}, number={1}, journal={Stochastik in der Schule}, author={Frischemeier, Daniel and Biehler, Rolf}, year={2025}, pages={22–33} }","short":"D. Frischemeier, R. Biehler, Stochastik in der Schule 45 (2025) 22–33.","ama":"Frischemeier D, Biehler R. Förderung von statistischem Denken im Mathematikunterricht der Primarstufe: Bedeutsame Ideen und Förderungsmöglichkeiten. <i>Stochastik in der Schule</i>. 2025;45(1):22-33.","ieee":"D. Frischemeier and R. Biehler, “Förderung von statistischem Denken im Mathematikunterricht der Primarstufe: Bedeutsame Ideen und Förderungsmöglichkeiten,” <i>Stochastik in der Schule</i>, vol. 45, no. 1, pp. 22–33, 2025.","chicago":"Frischemeier, Daniel, and Rolf Biehler. “Förderung von statistischem Denken im Mathematikunterricht der Primarstufe: Bedeutsame Ideen und Förderungsmöglichkeiten.” <i>Stochastik in der Schule</i> 45, no. 1 (2025): 22–33."},"page":"22-33","intvolume":"        45","year":"2025","issue":"1","language":[{"iso":"ger"}],"user_id":"37888","department":[{"_id":"363"}],"_id":"59053","status":"public","type":"journal_article","publication":"Stochastik in der Schule"},{"author":[{"first_name":"Stephan","last_name":"Kruse","full_name":"Kruse, Stephan","id":"38254"},{"last_name":"Brockmeier","full_name":"Brockmeier, Jan","id":"67349","first_name":"Jan"},{"first_name":"Tobias","full_name":"Schwabe, Tobias","id":"39217","last_name":"Schwabe"},{"first_name":"J. Christoph","orcid":"0000-0002-5950-6618 ","last_name":"Scheytt","id":"37144","full_name":"Scheytt, J. Christoph"}],"date_created":"2025-01-17T06:28:06Z","date_updated":"2025-03-24T06:40:47Z","conference":{"location":"Dresden","end_date":"2025-03-19","start_date":"2025-03-17","name":"German Microwave Conference"},"title":"A Visible Light FMCW Lidar System Based on LEDs","citation":{"short":"S. Kruse, J. Brockmeier, T. Schwabe, J.C. Scheytt, in: 2025.","bibtex":"@inproceedings{Kruse_Brockmeier_Schwabe_Scheytt_2025, title={A Visible Light FMCW Lidar System Based on LEDs}, author={Kruse, Stephan and Brockmeier, Jan and Schwabe, Tobias and Scheytt, J. Christoph}, year={2025} }","mla":"Kruse, Stephan, et al. <i>A Visible Light FMCW Lidar System Based on LEDs</i>. 2025.","apa":"Kruse, S., Brockmeier, J., Schwabe, T., &#38; Scheytt, J. C. (2025). <i>A Visible Light FMCW Lidar System Based on LEDs</i>. German Microwave Conference, Dresden.","ama":"Kruse S, Brockmeier J, Schwabe T, Scheytt JC. A Visible Light FMCW Lidar System Based on LEDs. In: ; 2025.","ieee":"S. Kruse, J. Brockmeier, T. Schwabe, and J. C. Scheytt, “A Visible Light FMCW Lidar System Based on LEDs,” presented at the German Microwave Conference, Dresden, 2025.","chicago":"Kruse, Stephan, Jan Brockmeier, Tobias Schwabe, and J. Christoph Scheytt. “A Visible Light FMCW Lidar System Based on LEDs,” 2025."},"year":"2025","department":[{"_id":"58"}],"user_id":"38254","_id":"58232","language":[{"iso":"eng"}],"type":"conference","status":"public"},{"type":"conference","status":"public","user_id":"76626","department":[{"_id":"58"}],"_id":"58231","language":[{"iso":"eng"}],"citation":{"short":"S. Kruse, V. Surendranath Shroff, M. Bahmanian, J. Brockmeier, J.C. Scheytt, in: 2025.","mla":"Kruse, Stephan, et al. <i>An Ultra Low Phase Noise Frequency Synthesizer with Optical Output for 77 GHz Photonic Radar</i>. 2025.","bibtex":"@inproceedings{Kruse_Surendranath Shroff_Bahmanian_Brockmeier_Scheytt_2025, title={An Ultra Low Phase Noise Frequency Synthesizer with Optical Output for 77 GHz Photonic Radar}, author={Kruse, Stephan and Surendranath Shroff, Vijayalakshmi and Bahmanian, Meysam and Brockmeier, Jan and Scheytt, J. Christoph}, year={2025} }","apa":"Kruse, S., Surendranath Shroff, V., Bahmanian, M., Brockmeier, J., &#38; Scheytt, J. C. (2025). <i>An Ultra Low Phase Noise Frequency Synthesizer with Optical Output for 77 GHz Photonic Radar</i>. German Microwave Conference, Dresden.","chicago":"Kruse, Stephan, Vijayalakshmi Surendranath Shroff, Meysam Bahmanian, Jan Brockmeier, and J. Christoph Scheytt. “An Ultra Low Phase Noise Frequency Synthesizer with Optical Output for 77 GHz Photonic Radar,” 2025.","ieee":"S. Kruse, V. Surendranath Shroff, M. Bahmanian, J. Brockmeier, and J. C. Scheytt, “An Ultra Low Phase Noise Frequency Synthesizer with Optical Output for 77 GHz Photonic Radar,” presented at the German Microwave Conference, Dresden, 2025.","ama":"Kruse S, Surendranath Shroff V, Bahmanian M, Brockmeier J, Scheytt JC. An Ultra Low Phase Noise Frequency Synthesizer with Optical Output for 77 GHz Photonic Radar. In: ; 2025."},"year":"2025","date_created":"2025-01-17T06:26:14Z","author":[{"last_name":"Kruse","id":"38254","full_name":"Kruse, Stephan","first_name":"Stephan"},{"first_name":"Vijayalakshmi","id":"76626","full_name":"Surendranath Shroff, Vijayalakshmi","last_name":"Surendranath Shroff"},{"id":"69233","full_name":"Bahmanian, Meysam","last_name":"Bahmanian","first_name":"Meysam"},{"last_name":"Brockmeier","id":"67349","full_name":"Brockmeier, Jan","first_name":"Jan"},{"first_name":"J. Christoph","id":"37144","full_name":"Scheytt, J. Christoph","orcid":"0000-0002-5950-6618 ","last_name":"Scheytt"}],"date_updated":"2025-03-24T06:40:59Z","conference":{"start_date":"2025-03-17","name":"German Microwave Conference","location":"Dresden","end_date":"2025-03-19"},"title":"An Ultra Low Phase Noise Frequency Synthesizer with Optical Output for 77 GHz Photonic Radar"},{"publisher":"Springer Science and Business Media LLC","date_created":"2025-03-27T09:46:34Z","title":"Sets of r-Graphs that Color All r-Graphs","issue":"2","year":"2025","language":[{"iso":"eng"}],"publication":"Combinatorica","abstract":[{"lang":"eng","text":"An r-regular graph is an r-graph, if every odd set of vertices is connected to its complement by at least r edges. Let G and H be r-graphs. An H-coloring of G is a mapping such that each r adjacent edges of G are mapped to r adjacent edges of H. For every , let be an inclusion-wise minimal set of connected r-graphs, such that for every connected r-graph G there is an which colors G. The Petersen Coloring Conjecture states that consists of the Petersen graph P. We show that if true, then this is a very exclusive situation. Our main result is that either or is an infinite set and if , then is an infinite set. In particular, for all , is unique. We first characterize and then prove that if contains more than one element, then it is an infinite set. To obtain our main result we show that contains the smallest r-graphs of class 2 and the smallest poorly matchable r-graphs, and we determine the smallest r-graphs of class 2."}],"date_updated":"2025-03-27T09:48:48Z","volume":45,"author":[{"full_name":"Ma, Yulai","last_name":"Ma","first_name":"Yulai"},{"last_name":"Mattiolo","full_name":"Mattiolo, Davide","first_name":"Davide"},{"first_name":"Eckhard","last_name":"Steffen","orcid":"0000-0002-9808-7401","full_name":"Steffen, Eckhard","id":"15548"},{"first_name":"Isaak H.","last_name":"Wolf","full_name":"Wolf, Isaak H."}],"doi":"10.1007/s00493-025-00144-4","publication_identifier":{"issn":["0209-9683","1439-6912"]},"publication_status":"published","intvolume":"        45","citation":{"apa":"Ma, Y., Mattiolo, D., Steffen, E., &#38; Wolf, I. H. (2025). Sets of r-Graphs that Color All r-Graphs. <i>Combinatorica</i>, <i>45</i>(2), Article 16. <a href=\"https://doi.org/10.1007/s00493-025-00144-4\">https://doi.org/10.1007/s00493-025-00144-4</a>","bibtex":"@article{Ma_Mattiolo_Steffen_Wolf_2025, title={Sets of r-Graphs that Color All r-Graphs}, volume={45}, DOI={<a href=\"https://doi.org/10.1007/s00493-025-00144-4\">10.1007/s00493-025-00144-4</a>}, number={216}, journal={Combinatorica}, publisher={Springer Science and Business Media LLC}, author={Ma, Yulai and Mattiolo, Davide and Steffen, Eckhard and Wolf, Isaak H.}, year={2025} }","short":"Y. Ma, D. Mattiolo, E. Steffen, I.H. Wolf, Combinatorica 45 (2025).","mla":"Ma, Yulai, et al. “Sets of R-Graphs That Color All r-Graphs.” <i>Combinatorica</i>, vol. 45, no. 2, 16, Springer Science and Business Media LLC, 2025, doi:<a href=\"https://doi.org/10.1007/s00493-025-00144-4\">10.1007/s00493-025-00144-4</a>.","ieee":"Y. Ma, D. Mattiolo, E. Steffen, and I. H. Wolf, “Sets of r-Graphs that Color All r-Graphs,” <i>Combinatorica</i>, vol. 45, no. 2, Art. no. 16, 2025, doi: <a href=\"https://doi.org/10.1007/s00493-025-00144-4\">10.1007/s00493-025-00144-4</a>.","chicago":"Ma, Yulai, Davide Mattiolo, Eckhard Steffen, and Isaak H. Wolf. “Sets of R-Graphs That Color All r-Graphs.” <i>Combinatorica</i> 45, no. 2 (2025). <a href=\"https://doi.org/10.1007/s00493-025-00144-4\">https://doi.org/10.1007/s00493-025-00144-4</a>.","ama":"Ma Y, Mattiolo D, Steffen E, Wolf IH. Sets of r-Graphs that Color All r-Graphs. <i>Combinatorica</i>. 2025;45(2). doi:<a href=\"https://doi.org/10.1007/s00493-025-00144-4\">10.1007/s00493-025-00144-4</a>"},"_id":"59169","department":[{"_id":"542"}],"user_id":"15540","article_number":"16","type":"journal_article","status":"public"},{"publication_identifier":{"issn":["0022-0396"]},"publication_status":"published","intvolume":"       443","citation":{"ama":"Black T. Very mild diffusion enhancement and singular sensitivity: Existence of bounded weak solutions in a two-dimensional chemotaxis-Navier–Stokes system. <i>Journal of Differential Equations</i>. 2025;443. doi:<a href=\"https://doi.org/10.1016/j.jde.2025.113555\">10.1016/j.jde.2025.113555</a>","ieee":"T. Black, “Very mild diffusion enhancement and singular sensitivity: Existence of bounded weak solutions in a two-dimensional chemotaxis-Navier–Stokes system,” <i>Journal of Differential Equations</i>, vol. 443, Art. no. 113555, 2025, doi: <a href=\"https://doi.org/10.1016/j.jde.2025.113555\">10.1016/j.jde.2025.113555</a>.","chicago":"Black, Tobias. “Very Mild Diffusion Enhancement and Singular Sensitivity: Existence of Bounded Weak Solutions in a Two-Dimensional Chemotaxis-Navier–Stokes System.” <i>Journal of Differential Equations</i> 443 (2025). <a href=\"https://doi.org/10.1016/j.jde.2025.113555\">https://doi.org/10.1016/j.jde.2025.113555</a>.","apa":"Black, T. (2025). Very mild diffusion enhancement and singular sensitivity: Existence of bounded weak solutions in a two-dimensional chemotaxis-Navier–Stokes system. <i>Journal of Differential Equations</i>, <i>443</i>, Article 113555. <a href=\"https://doi.org/10.1016/j.jde.2025.113555\">https://doi.org/10.1016/j.jde.2025.113555</a>","short":"T. Black, Journal of Differential Equations 443 (2025).","bibtex":"@article{Black_2025, title={Very mild diffusion enhancement and singular sensitivity: Existence of bounded weak solutions in a two-dimensional chemotaxis-Navier–Stokes system}, volume={443}, DOI={<a href=\"https://doi.org/10.1016/j.jde.2025.113555\">10.1016/j.jde.2025.113555</a>}, number={113555}, journal={Journal of Differential Equations}, publisher={Elsevier BV}, author={Black, Tobias}, year={2025} }","mla":"Black, Tobias. “Very Mild Diffusion Enhancement and Singular Sensitivity: Existence of Bounded Weak Solutions in a Two-Dimensional Chemotaxis-Navier–Stokes System.” <i>Journal of Differential Equations</i>, vol. 443, 113555, Elsevier BV, 2025, doi:<a href=\"https://doi.org/10.1016/j.jde.2025.113555\">10.1016/j.jde.2025.113555</a>."},"year":"2025","volume":443,"date_created":"2025-06-13T11:12:23Z","author":[{"first_name":"Tobias","full_name":"Black, Tobias","id":"23686","orcid":"0000-0001-9963-0800","last_name":"Black"}],"date_updated":"2025-06-13T11:13:22Z","publisher":"Elsevier BV","doi":"10.1016/j.jde.2025.113555","title":"Very mild diffusion enhancement and singular sensitivity: Existence of bounded weak solutions in a two-dimensional chemotaxis-Navier–Stokes system","publication":"Journal of Differential Equations","type":"journal_article","status":"public","department":[{"_id":"34"},{"_id":"10"},{"_id":"90"}],"user_id":"23686","_id":"60205","language":[{"iso":"eng"}],"article_number":"113555"},{"status":"public","editor":[{"full_name":"Singh, Hemant K.","last_name":"Singh","first_name":"Hemant K."},{"last_name":"Ray","full_name":"Ray, Tapabrata","first_name":"Tapabrata"},{"full_name":"Knowles, Joshua D.","last_name":"Knowles","first_name":"Joshua D."},{"full_name":"Li, Xiaodong","last_name":"Li","first_name":"Xiaodong"},{"first_name":"Juergen","last_name":"Branke","full_name":"Branke, Juergen"},{"first_name":"Bing","last_name":"Wang","full_name":"Wang, Bing"},{"full_name":"Oyama, Akira","last_name":"Oyama","first_name":"Akira"}],"publication":"Evolutionary Multi-Criterion Optimization - 13th International Conference, EMO 2025, Canberra, ACT, Australia, March 4-7, 2025, Proceedings, Part I","type":"conference","language":[{"iso":"eng"}],"department":[{"_id":"819"}],"user_id":"15504","series_title":"Lecture Notes in Computer Science","_id":"60219","intvolume":"     15512","page":"242–256","citation":{"ama":"Vermetten D, Rook J, Preuß OL, et al. MO-IOHinspector: Anytime Benchmarking of Multi-objective Algorithms Using IOHprofiler. In: Singh HK, Ray T, Knowles JD, et al., eds. <i>Evolutionary Multi-Criterion Optimization - 13th International Conference, EMO 2025, Canberra, ACT, Australia, March 4-7, 2025, Proceedings, Part I</i>. Vol 15512. Lecture Notes in Computer Science. Springer; 2025:242–256. doi:<a href=\"https://doi.org/10.1007/978-981-96-3506-1_17\">10.1007/978-981-96-3506-1_17</a>","ieee":"D. Vermetten <i>et al.</i>, “MO-IOHinspector: Anytime Benchmarking of Multi-objective Algorithms Using IOHprofiler,” in <i>Evolutionary Multi-Criterion Optimization - 13th International Conference, EMO 2025, Canberra, ACT, Australia, March 4-7, 2025, Proceedings, Part I</i>, 2025, vol. 15512, pp. 242–256, doi: <a href=\"https://doi.org/10.1007/978-981-96-3506-1_17\">10.1007/978-981-96-3506-1_17</a>.","chicago":"Vermetten, Diederick, Jeroen Rook, Oliver Ludger Preuß, Jacob de Nobel, Carola Doerr, Manuel López-Ibáñez, Heike Trautmann, and Thomas Bäck. “MO-IOHinspector: Anytime Benchmarking of Multi-Objective Algorithms Using IOHprofiler.” In <i>Evolutionary Multi-Criterion Optimization - 13th International Conference, EMO 2025, Canberra, ACT, Australia, March 4-7, 2025, Proceedings, Part I</i>, edited by Hemant K. Singh, Tapabrata Ray, Joshua D. Knowles, Xiaodong Li, Juergen Branke, Bing Wang, and Akira Oyama, 15512:242–256. Lecture Notes in Computer Science. Springer, 2025. <a href=\"https://doi.org/10.1007/978-981-96-3506-1_17\">https://doi.org/10.1007/978-981-96-3506-1_17</a>.","apa":"Vermetten, D., Rook, J., Preuß, O. L., de Nobel, J., Doerr, C., López-Ibáñez, M., Trautmann, H., &#38; Bäck, T. (2025). MO-IOHinspector: Anytime Benchmarking of Multi-objective Algorithms Using IOHprofiler. In H. K. Singh, T. Ray, J. D. Knowles, X. Li, J. Branke, B. Wang, &#38; A. Oyama (Eds.), <i>Evolutionary Multi-Criterion Optimization - 13th International Conference, EMO 2025, Canberra, ACT, Australia, March 4-7, 2025, Proceedings, Part I</i> (Vol. 15512, pp. 242–256). Springer. <a href=\"https://doi.org/10.1007/978-981-96-3506-1_17\">https://doi.org/10.1007/978-981-96-3506-1_17</a>","mla":"Vermetten, Diederick, et al. “MO-IOHinspector: Anytime Benchmarking of Multi-Objective Algorithms Using IOHprofiler.” <i>Evolutionary Multi-Criterion Optimization - 13th International Conference, EMO 2025, Canberra, ACT, Australia, March 4-7, 2025, Proceedings, Part I</i>, edited by Hemant K. Singh et al., vol. 15512, Springer, 2025, pp. 242–256, doi:<a href=\"https://doi.org/10.1007/978-981-96-3506-1_17\">10.1007/978-981-96-3506-1_17</a>.","short":"D. Vermetten, J. Rook, O.L. Preuß, J. de Nobel, C. Doerr, M. López-Ibáñez, H. Trautmann, T. Bäck, in: H.K. Singh, T. Ray, J.D. Knowles, X. Li, J. Branke, B. Wang, A. Oyama (Eds.), Evolutionary Multi-Criterion Optimization - 13th International Conference, EMO 2025, Canberra, ACT, Australia, March 4-7, 2025, Proceedings, Part I, Springer, 2025, pp. 242–256.","bibtex":"@inproceedings{Vermetten_Rook_Preuß_de Nobel_Doerr_López-Ibáñez_Trautmann_Bäck_2025, series={Lecture Notes in Computer Science}, title={MO-IOHinspector: Anytime Benchmarking of Multi-objective Algorithms Using IOHprofiler}, volume={15512}, DOI={<a href=\"https://doi.org/10.1007/978-981-96-3506-1_17\">10.1007/978-981-96-3506-1_17</a>}, booktitle={Evolutionary Multi-Criterion Optimization - 13th International Conference, EMO 2025, Canberra, ACT, Australia, March 4-7, 2025, Proceedings, Part I}, publisher={Springer}, author={Vermetten, Diederick and Rook, Jeroen and Preuß, Oliver Ludger and de Nobel, Jacob and Doerr, Carola and López-Ibáñez, Manuel and Trautmann, Heike and Bäck, Thomas}, editor={Singh, Hemant K. and Ray, Tapabrata and Knowles, Joshua D. and Li, Xiaodong and Branke, Juergen and Wang, Bing and Oyama, Akira}, year={2025}, pages={242–256}, collection={Lecture Notes in Computer Science} }"},"year":"2025","doi":"10.1007/978-981-96-3506-1_17","title":"MO-IOHinspector: Anytime Benchmarking of Multi-objective Algorithms Using IOHprofiler","volume":15512,"date_created":"2025-06-16T12:01:12Z","author":[{"full_name":"Vermetten, Diederick","last_name":"Vermetten","first_name":"Diederick"},{"first_name":"Jeroen","last_name":"Rook","id":"102977","full_name":"Rook, Jeroen"},{"first_name":"Oliver Ludger","orcid":"0009-0008-9308-2418","last_name":"Preuß","full_name":"Preuß, Oliver Ludger","id":"102978"},{"first_name":"Jacob","full_name":"de Nobel, Jacob","last_name":"de Nobel"},{"first_name":"Carola","full_name":"Doerr, Carola","last_name":"Doerr"},{"last_name":"López-Ibáñez","full_name":"López-Ibáñez, Manuel","first_name":"Manuel"},{"first_name":"Heike","full_name":"Trautmann, Heike","id":"100740","orcid":"0000-0002-9788-8282","last_name":"Trautmann"},{"first_name":"Thomas","last_name":"Bäck","full_name":"Bäck, Thomas"}],"date_updated":"2025-06-16T12:20:36Z","publisher":"Springer"},{"status":"public","type":"journal_article","publication":"Evolutionary Computation","language":[{"iso":"eng"}],"_id":"60220","user_id":"15504","department":[{"_id":"819"}],"year":"2025","citation":{"ama":"Seiler M, Kerschke P, Trautmann H. Deep-ELA: Deep Exploratory Landscape Analysis with Self-Supervised Pretrained Transformers for Single- and Multi-Objective Continuous Optimization Problems . <i>Evolutionary Computation</i>. Published online 2025:1-27. doi:<a href=\"https://doi.org/10.1162/evco_a_00367\">https://doi.org/10.1162/evco_a_00367</a>","chicago":"Seiler, Moritz, Pascal Kerschke, and Heike Trautmann. “Deep-ELA: Deep Exploratory Landscape Analysis with Self-Supervised Pretrained Transformers for Single- and Multi-Objective Continuous Optimization Problems .” <i>Evolutionary Computation</i>, 2025, 1–27. <a href=\"https://doi.org/10.1162/evco_a_00367\">https://doi.org/10.1162/evco_a_00367</a>.","ieee":"M. Seiler, P. Kerschke, and H. Trautmann, “Deep-ELA: Deep Exploratory Landscape Analysis with Self-Supervised Pretrained Transformers for Single- and Multi-Objective Continuous Optimization Problems ,” <i>Evolutionary Computation</i>, pp. 1–27, 2025, doi: <a href=\"https://doi.org/10.1162/evco_a_00367\">https://doi.org/10.1162/evco_a_00367</a>.","bibtex":"@article{Seiler_Kerschke_Trautmann_2025, title={Deep-ELA: Deep Exploratory Landscape Analysis with Self-Supervised Pretrained Transformers for Single- and Multi-Objective Continuous Optimization Problems }, DOI={<a href=\"https://doi.org/10.1162/evco_a_00367\">https://doi.org/10.1162/evco_a_00367</a>}, journal={Evolutionary Computation}, author={Seiler, Moritz and Kerschke, Pascal and Trautmann, Heike}, year={2025}, pages={1–27} }","short":"M. Seiler, P. Kerschke, H. Trautmann, Evolutionary Computation (2025) 1–27.","mla":"Seiler, Moritz, et al. “Deep-ELA: Deep Exploratory Landscape Analysis with Self-Supervised Pretrained Transformers for Single- and Multi-Objective Continuous Optimization Problems .” <i>Evolutionary Computation</i>, 2025, pp. 1–27, doi:<a href=\"https://doi.org/10.1162/evco_a_00367\">https://doi.org/10.1162/evco_a_00367</a>.","apa":"Seiler, M., Kerschke, P., &#38; Trautmann, H. (2025). Deep-ELA: Deep Exploratory Landscape Analysis with Self-Supervised Pretrained Transformers for Single- and Multi-Objective Continuous Optimization Problems . <i>Evolutionary Computation</i>, 1–27. <a href=\"https://doi.org/10.1162/evco_a_00367\">https://doi.org/10.1162/evco_a_00367</a>"},"page":"1-27","title":"Deep-ELA: Deep Exploratory Landscape Analysis with Self-Supervised Pretrained Transformers for Single- and Multi-Objective Continuous Optimization Problems ","doi":"https://doi.org/10.1162/evco_a_00367","date_updated":"2025-06-16T12:24:15Z","author":[{"first_name":"Moritz","last_name":"Seiler","full_name":"Seiler, Moritz","id":"105520"},{"first_name":"Pascal","last_name":"Kerschke","full_name":"Kerschke, Pascal"},{"orcid":"0000-0002-9788-8282","last_name":"Trautmann","id":"100740","full_name":"Trautmann, Heike","first_name":"Heike"}],"date_created":"2025-06-16T12:20:20Z"},{"citation":{"apa":"Jalowy, J., &#38; Stange, H. (2025). Box-Covariances of Hyperuniform Point Processes. In <i>arXiv:2506.13661</i>.","bibtex":"@article{Jalowy_Stange_2025, title={Box-Covariances of Hyperuniform Point Processes}, journal={arXiv:2506.13661}, author={Jalowy, Jonas and Stange, Hanna}, year={2025} }","mla":"Jalowy, Jonas, and Hanna Stange. “Box-Covariances of Hyperuniform Point Processes.” <i>ArXiv:2506.13661</i>, 2025.","short":"J. Jalowy, H. Stange, ArXiv:2506.13661 (2025).","ieee":"J. Jalowy and H. Stange, “Box-Covariances of Hyperuniform Point Processes,” <i>arXiv:2506.13661</i>. 2025.","chicago":"Jalowy, Jonas, and Hanna Stange. “Box-Covariances of Hyperuniform Point Processes.” <i>ArXiv:2506.13661</i>, 2025.","ama":"Jalowy J, Stange H. Box-Covariances of Hyperuniform Point Processes. <i>arXiv:250613661</i>. Published online 2025."},"year":"2025","title":"Box-Covariances of Hyperuniform Point Processes","author":[{"first_name":"Jonas","orcid":"0000-0001-9624-2685","last_name":"Jalowy","full_name":"Jalowy, Jonas","id":"113768"},{"full_name":"Stange, Hanna","last_name":"Stange","first_name":"Hanna"}],"date_created":"2025-06-22T08:02:28Z","date_updated":"2025-06-22T08:03:20Z","status":"public","abstract":[{"text":"In this work, we present a complete characterization of the covariance\r\nstructure of number statistics in boxes for hyperuniform point processes. Under\r\na standard integrability assumption, the covariance depends solely on the\r\noverlap of the faces of the box. Beyond this assumption, a novel interpolating\r\ncovariance structure emerges. This enables us to identify a limiting Gaussian\r\n'coarse-grained' process, counting the number of points in large boxes as a\r\nfunction of the box position. Depending on the integrability assumption, this\r\nprocess may be continuous or discontinuous, e.g. in d=1 it is given by an\r\nincrement process of a fractional Brownian motion.","lang":"eng"}],"publication":"arXiv:2506.13661","type":"preprint","language":[{"iso":"eng"}],"department":[{"_id":"94"}],"user_id":"113768","external_id":{"arxiv":["2506.13661"]},"_id":"60293"},{"project":[{"name":"EKI-App: EKI-App: Energieeffiziente Künstliche Intelligenz im Rechenzentrum durch Approximation von tiefen neuronalen Netzen für Field-Programmable Gate Arrays","_id":"296"}],"_id":"59804","user_id":"67601","department":[{"_id":"518"}],"language":[{"iso":"eng"}],"type":"conference","publication":"Proceedings of the 15th International Symposium on Highly Efficient Accelerators and Reconfigurable Technologies","status":"public","publisher":"ACM","date_updated":"2025-06-23T08:39:26Z","date_created":"2025-05-05T11:12:47Z","author":[{"first_name":"Linus","full_name":"Jungemann, Linus","id":"67601","orcid":"0009-0003-9757-988X","last_name":"Jungemann"},{"first_name":"Bjarne","last_name":"Wintermann","full_name":"Wintermann, Bjarne"},{"full_name":"Riebler, Heinrich","id":"8961","last_name":"Riebler","first_name":"Heinrich"},{"first_name":"Christian","id":"16153","full_name":"Plessl, Christian","orcid":"0000-0001-5728-9982","last_name":"Plessl"}],"title":"FINN-HPC: Closing the Gap for Energy-Efficient Neural Network Inference on FPGAs in HPC","doi":"10.1145/3728179.3728189","conference":{"name":"The International Symposium on Highly Efficient Accelerators and Reconfigurable Technologies 2025 (HEART 2025)","start_date":"2025-05-26","end_date":"2025-05-28","location":"Kumamoto, Japan"},"publication_status":"published","publication_identifier":{"unknown":["979-8-4007-1432-0/25/05"]},"year":"2025","place":"New York City","citation":{"apa":"Jungemann, L., Wintermann, B., Riebler, H., &#38; Plessl, C. (2025). FINN-HPC: Closing the Gap for Energy-Efficient Neural Network Inference on FPGAs in HPC. <i>Proceedings of the 15th International Symposium on Highly Efficient Accelerators and Reconfigurable Technologies</i>. The International Symposium on Highly Efficient Accelerators and Reconfigurable Technologies 2025 (HEART 2025), Kumamoto, Japan. <a href=\"https://doi.org/10.1145/3728179.3728189\">https://doi.org/10.1145/3728179.3728189</a>","short":"L. Jungemann, B. Wintermann, H. Riebler, C. Plessl, in: Proceedings of the 15th International Symposium on Highly Efficient Accelerators and Reconfigurable Technologies, ACM, New York City, 2025.","bibtex":"@inproceedings{Jungemann_Wintermann_Riebler_Plessl_2025, place={New York City}, title={FINN-HPC: Closing the Gap for Energy-Efficient Neural Network Inference on FPGAs in HPC}, DOI={<a href=\"https://doi.org/10.1145/3728179.3728189\">10.1145/3728179.3728189</a>}, booktitle={Proceedings of the 15th International Symposium on Highly Efficient Accelerators and Reconfigurable Technologies}, publisher={ACM}, author={Jungemann, Linus and Wintermann, Bjarne and Riebler, Heinrich and Plessl, Christian}, year={2025} }","mla":"Jungemann, Linus, et al. “FINN-HPC: Closing the Gap for Energy-Efficient Neural Network Inference on FPGAs in HPC.” <i>Proceedings of the 15th International Symposium on Highly Efficient Accelerators and Reconfigurable Technologies</i>, ACM, 2025, doi:<a href=\"https://doi.org/10.1145/3728179.3728189\">10.1145/3728179.3728189</a>.","ama":"Jungemann L, Wintermann B, Riebler H, Plessl C. FINN-HPC: Closing the Gap for Energy-Efficient Neural Network Inference on FPGAs in HPC. In: <i>Proceedings of the 15th International Symposium on Highly Efficient Accelerators and Reconfigurable Technologies</i>. ACM; 2025. doi:<a href=\"https://doi.org/10.1145/3728179.3728189\">10.1145/3728179.3728189</a>","chicago":"Jungemann, Linus, Bjarne Wintermann, Heinrich Riebler, and Christian Plessl. “FINN-HPC: Closing the Gap for Energy-Efficient Neural Network Inference on FPGAs in HPC.” In <i>Proceedings of the 15th International Symposium on Highly Efficient Accelerators and Reconfigurable Technologies</i>. New York City: ACM, 2025. <a href=\"https://doi.org/10.1145/3728179.3728189\">https://doi.org/10.1145/3728179.3728189</a>.","ieee":"L. Jungemann, B. Wintermann, H. Riebler, and C. Plessl, “FINN-HPC: Closing the Gap for Energy-Efficient Neural Network Inference on FPGAs in HPC,” presented at the The International Symposium on Highly Efficient Accelerators and Reconfigurable Technologies 2025 (HEART 2025), Kumamoto, Japan, 2025, doi: <a href=\"https://doi.org/10.1145/3728179.3728189\">10.1145/3728179.3728189</a>."}},{"language":[{"iso":"eng"}],"_id":"60351","department":[{"_id":"363"}],"user_id":"37888","abstract":[{"lang":"eng","text":"<jats:p>This article is a short summary of the report of survey team 3, presented to the 15th International Congress on Mathematical Education (ICME-15) in Sydney in July 2024.</jats:p>"}],"status":"public","publication":"European Mathematical Society Magazine","type":"journal_article","title":"Statistics and data science education as a vehicle for empowering citizens – short summary of a survey","doi":"10.4171/mag/257","main_file_link":[{"url":"https://doi.org/10.4171/MAG/257","open_access":"1"}],"oa":"1","publisher":"European Mathematical Society - EMS - Publishing House GmbH","date_updated":"2025-06-24T06:59:42Z","author":[{"full_name":"Biehler, Rolf","id":"16274","last_name":"Biehler","first_name":"Rolf"},{"first_name":"Takashi","full_name":"Kawakami, Takashi","last_name":"Kawakami"},{"full_name":"Lampen, Erna","last_name":"Lampen","first_name":"Erna"},{"last_name":"Weiland","full_name":"Weiland, Travis","first_name":"Travis"},{"first_name":"Lucía","full_name":"Zapata-Cardona, Lucía","last_name":"Zapata-Cardona"}],"date_created":"2025-06-24T06:58:17Z","year":"2025","citation":{"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.4171/mag/257\">10.4171/mag/257</a>}, journal={European Mathematical Society Magazine}, publisher={European Mathematical Society - EMS - Publishing House GmbH}, author={Biehler, Rolf and Kawakami, Takashi and Lampen, Erna and Weiland, Travis and Zapata-Cardona, Lucía}, year={2025} }","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>, European Mathematical Society - EMS - Publishing House GmbH, 2025, doi:<a href=\"https://doi.org/10.4171/mag/257\">10.4171/mag/257</a>.","short":"R. Biehler, T. Kawakami, E. Lampen, T. Weiland, L. Zapata-Cardona, European Mathematical Society Magazine (2025).","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>. <a href=\"https://doi.org/10.4171/mag/257\">https://doi.org/10.4171/mag/257</a>","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>, 2025, doi: <a href=\"https://doi.org/10.4171/mag/257\">10.4171/mag/257</a>.","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>, 2025. <a href=\"https://doi.org/10.4171/mag/257\">https://doi.org/10.4171/mag/257</a>.","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>. Published online 2025. doi:<a href=\"https://doi.org/10.4171/mag/257\">10.4171/mag/257</a>"},"publication_identifier":{"issn":["2747-7894","2747-7908"]},"publication_status":"published"},{"title":"Transcription in Computing Education Research: A Review and Recommendations","main_file_link":[{"open_access":"1","url":"https://infedu.vu.lt/journal/INFEDU/article/805/info"}],"doi":"10.15388/infedu.2025.09","oa":"1","publisher":"Vilnius University Press","date_updated":"2025-06-24T10:02:22Z","date_created":"2025-06-24T10:00:27Z","author":[{"last_name":"Terfloth","id":"37320","full_name":"Terfloth, Lutz","first_name":"Lutz"},{"first_name":"Vivien","last_name":"Lohmer","full_name":"Lohmer, Vivien"},{"full_name":"Kern, Friederike","last_name":"Kern","first_name":"Friederike"},{"last_name":"Schulte","full_name":"Schulte, Carsten","id":"60311","first_name":"Carsten"}],"year":"2025","citation":{"bibtex":"@article{Terfloth_Lohmer_Kern_Schulte_2025, title={Transcription in Computing Education Research: A Review and Recommendations}, DOI={<a href=\"https://doi.org/10.15388/infedu.2025.09\">10.15388/infedu.2025.09</a>}, journal={Informatics in Education}, publisher={Vilnius University Press}, author={Terfloth, Lutz and Lohmer, Vivien and Kern, Friederike and Schulte, Carsten}, year={2025} }","mla":"Terfloth, Lutz, et al. “Transcription in Computing Education Research: A Review and Recommendations.” <i>Informatics in Education</i>, Vilnius University Press, 2025, doi:<a href=\"https://doi.org/10.15388/infedu.2025.09\">10.15388/infedu.2025.09</a>.","short":"L. Terfloth, V. Lohmer, F. Kern, C. Schulte, Informatics in Education (2025).","apa":"Terfloth, L., Lohmer, V., Kern, F., &#38; Schulte, C. (2025). Transcription in Computing Education Research: A Review and Recommendations. <i>Informatics in Education</i>. <a href=\"https://doi.org/10.15388/infedu.2025.09\">https://doi.org/10.15388/infedu.2025.09</a>","chicago":"Terfloth, Lutz, Vivien Lohmer, Friederike Kern, and Carsten Schulte. “Transcription in Computing Education Research: A Review and Recommendations.” <i>Informatics in Education</i>, 2025. <a href=\"https://doi.org/10.15388/infedu.2025.09\">https://doi.org/10.15388/infedu.2025.09</a>.","ieee":"L. Terfloth, V. Lohmer, F. Kern, and C. Schulte, “Transcription in Computing Education Research: A Review and Recommendations,” <i>Informatics in Education</i>, 2025, doi: <a href=\"https://doi.org/10.15388/infedu.2025.09\">10.15388/infedu.2025.09</a>.","ama":"Terfloth L, Lohmer V, Kern F, Schulte C. Transcription in Computing Education Research: A Review and Recommendations. <i>Informatics in Education</i>. Published online 2025. doi:<a href=\"https://doi.org/10.15388/infedu.2025.09\">10.15388/infedu.2025.09</a>"},"publication_status":"published","publication_identifier":{"issn":["1648-5831","2335-8971"]},"language":[{"iso":"eng"}],"_id":"60357","user_id":"37320","department":[{"_id":"67"}],"abstract":[{"text":"<jats:p>Transcripts play a crucial role in qualitative research in computing education, with significant implications for the credibility and reproducibility of findings. However, unreflective and inconsistent transcription standards may unintentionally introduce biases, potentially undermining the validity of research outcomes and the collective progress of the field. In this article, we introduce transcription as a theoretically guided process rather than a mere preparatory step, illustrating its role using a case example. Additionally, through a systematic review of 107 qualitative research articles in computing education, we identify widespread shortcomings in the reporting and implementation of transcription practices, revealing a need for greater intentionality and transparency. To address these challenges, we propose a three-step framework for selecting, applying, and documenting transcription standards that align with the specific context and goals of a study. Rather than advocating for overly complex, one-size-fits-all transcription strategies, we emphasize the importance of a context-appropriate approach that is clearly communicated to foster trust and reproducibility. By advancing a more robust transcription culture, this work aims to support computing education researchers in adopting standards that enhance the quality and reliability of qualitative research in the field.</jats:p>","lang":"eng"}],"status":"public","type":"journal_article","publication":"Informatics in Education"},{"citation":{"ieee":"C. Offen, “Machine learning of continuous and discrete variational ODEs with convergence guarantee and uncertainty quantification,” <i>Mathematics of Computation</i>, 2025, doi: <a href=\"https://doi.org/10.1090/mcom/4120\">10.1090/mcom/4120</a>.","chicago":"Offen, Christian. “Machine Learning of Continuous and Discrete Variational ODEs with Convergence Guarantee and Uncertainty Quantification.” <i>Mathematics of Computation</i>, 2025. <a href=\"https://doi.org/10.1090/mcom/4120\">https://doi.org/10.1090/mcom/4120</a>.","ama":"Offen C. Machine learning of continuous and discrete variational ODEs with convergence guarantee and uncertainty quantification. <i>Mathematics of Computation</i>. Published online 2025. doi:<a href=\"https://doi.org/10.1090/mcom/4120\">10.1090/mcom/4120</a>","apa":"Offen, C. (2025). Machine learning of continuous and discrete variational ODEs with convergence guarantee and uncertainty quantification. <i>Mathematics of Computation</i>. <a href=\"https://doi.org/10.1090/mcom/4120\">https://doi.org/10.1090/mcom/4120</a>","bibtex":"@article{Offen_2025, title={Machine learning of continuous and discrete variational ODEs with convergence guarantee and uncertainty quantification}, DOI={<a href=\"https://doi.org/10.1090/mcom/4120\">10.1090/mcom/4120</a>}, journal={Mathematics of Computation}, publisher={American Mathematical Society}, author={Offen, Christian}, year={2025} }","short":"C. Offen, Mathematics of Computation (2025).","mla":"Offen, Christian. “Machine Learning of Continuous and Discrete Variational ODEs with Convergence Guarantee and Uncertainty Quantification.” <i>Mathematics of Computation</i>, American Mathematical Society, 2025, doi:<a href=\"https://doi.org/10.1090/mcom/4120\">10.1090/mcom/4120</a>."},"related_material":{"link":[{"description":"GitHub","relation":"software","url":"https://github.com/Christian-Offen/Lagrangian_GP"}]},"publication_status":"epub_ahead","has_accepted_license":"1","doi":"10.1090/mcom/4120","author":[{"first_name":"Christian","orcid":"0000-0002-5940-8057","last_name":"Offen","id":"85279","full_name":"Offen, Christian"}],"oa":"1","date_updated":"2025-06-29T13:03:55Z","status":"public","type":"journal_article","file_date_updated":"2025-05-02T13:20:31Z","article_type":"original","user_id":"85279","department":[{"_id":"636"}],"project":[{"_id":"52","name":"PC2: Computing Resources Provided by the Paderborn Center for Parallel Computing"}],"_id":"53805","year":"2025","quality_controlled":"1","title":"Machine learning of continuous and discrete variational ODEs with convergence guarantee and uncertainty quantification","date_created":"2024-04-30T16:04:40Z","publisher":"American Mathematical Society","file":[{"relation":"main_file","content_type":"application/pdf","access_level":"open_access","file_name":"L_Collocation_ODE_mcom-l-template.pdf","file_id":"59759","description":"The article introduces a method to learn dynamical systems that\nare governed by Euler–Lagrange equations from data. The method is based on\nGaussian process regression and identifies continuous or discrete Lagrangians\nand is, therefore, structure preserving by design. A rigorous proof of con-\nvergence as the distance between observation data points converges to zero\nand lower bounds for convergence rates are provided. Next to convergence\nguarantees, the method allows for quantification of model uncertainty, which\ncan provide a basis of adaptive sampling techniques. We provide efficient uncertainty quantification of any observable that is linear in the Lagrangian,\nincluding of Hamiltonian functions (energy) and symplectic structures, which\nis of interest in the context of system identification. The article overcomes\nmajor practical and theoretical difficulties related to the ill-posedness of the\nidentification task of (discrete) Lagrangians through a careful design of geometric regularisation strategies and through an exploit of a relation to convex\nminimisation problems in reproducing kernel Hilbert spaces.","file_size":1819189,"title":"Machine learning of continuous and discrete variational ODEs with convergence guarantee and uncertainty quantification ","date_created":"2025-05-02T13:20:31Z","creator":"coffen","date_updated":"2025-05-02T13:20:31Z"}],"abstract":[{"lang":"eng","text":"The article introduces a method to learn dynamical systems that are governed by Euler–Lagrange equations from data. The method is based on Gaussian process regression and identifies continuous or discrete Lagrangians and is, therefore, structure preserving by design. A rigorous proof of convergence as the distance between observation data points converges to zero and lower bounds for convergence rates are provided. Next to convergence guarantees, the method allows for quantification of model uncertainty, which can provide a basis of adaptive sampling techniques. We provide efficient uncertainty quantification of any observable that is linear in the Lagrangian, including of Hamiltonian functions (energy) and symplectic structures, which is of interest in the context of system identification. The article overcomes major practical and theoretical difficulties related to the ill-posedness of the identification task of (discrete) Lagrangians through a careful design of geometric regularisation strategies and through an exploit of a relation to convex minimisation problems in reproducing kernel Hilbert spaces."}],"publication":"Mathematics of Computation","language":[{"iso":"eng"}],"ddc":["510"],"external_id":{"arxiv":["arXiv:2404.19626"]}},{"oa":"1","date_updated":"2025-07-02T11:45:18Z","volume":3,"author":[{"full_name":"Lanzinger, Matthias","last_name":"Lanzinger","first_name":"Matthias"},{"id":"114410","full_name":"Okulmus, Cem","orcid":"0000-0002-7742-0439","last_name":"Okulmus","first_name":"Cem"},{"last_name":"Pichler","full_name":"Pichler, Reinhard","first_name":"Reinhard"},{"first_name":"Alexander","full_name":"Selzer, Alexander","last_name":"Selzer"},{"first_name":"Georg","full_name":"Gottlob, Georg","last_name":"Gottlob"}],"conference":{"location":"Berlin","end_date":"2025-06-27","start_date":"2025-06-22","name":"44th ACM Symposium on Principles of Database Systems (PODS) 2025"},"doi":"10.1145/3725251","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/2412.11669"}],"publication_identifier":{"issn":["2836-6573"]},"publication_status":"published","intvolume":"         3","page":"1-25","citation":{"ieee":"M. Lanzinger, C. Okulmus, R. Pichler, A. Selzer, and G. Gottlob, “Soft and Constrained Hypertree Width,” <i>Proceedings of the ACM on Management of Data</i>, vol. 3, no. 2, pp. 1–25, 2025, doi: <a href=\"https://doi.org/10.1145/3725251\">10.1145/3725251</a>.","chicago":"Lanzinger, Matthias, Cem Okulmus, Reinhard Pichler, Alexander Selzer, and Georg Gottlob. “Soft and Constrained Hypertree Width.” <i>Proceedings of the ACM on Management of Data</i> 3, no. 2 (2025): 1–25. <a href=\"https://doi.org/10.1145/3725251\">https://doi.org/10.1145/3725251</a>.","ama":"Lanzinger M, Okulmus C, Pichler R, Selzer A, Gottlob G. Soft and Constrained Hypertree Width. <i>Proceedings of the ACM on Management of Data</i>. 2025;3(2):1-25. doi:<a href=\"https://doi.org/10.1145/3725251\">10.1145/3725251</a>","bibtex":"@article{Lanzinger_Okulmus_Pichler_Selzer_Gottlob_2025, title={Soft and Constrained Hypertree Width}, volume={3}, DOI={<a href=\"https://doi.org/10.1145/3725251\">10.1145/3725251</a>}, number={2}, journal={Proceedings of the ACM on Management of Data}, publisher={Association for Computing Machinery (ACM)}, author={Lanzinger, Matthias and Okulmus, Cem and Pichler, Reinhard and Selzer, Alexander and Gottlob, Georg}, year={2025}, pages={1–25} }","mla":"Lanzinger, Matthias, et al. “Soft and Constrained Hypertree Width.” <i>Proceedings of the ACM on Management of Data</i>, vol. 3, no. 2, Association for Computing Machinery (ACM), 2025, pp. 1–25, doi:<a href=\"https://doi.org/10.1145/3725251\">10.1145/3725251</a>.","short":"M. Lanzinger, C. Okulmus, R. Pichler, A. Selzer, G. Gottlob, Proceedings of the ACM on Management of Data 3 (2025) 1–25.","apa":"Lanzinger, M., Okulmus, C., Pichler, R., Selzer, A., &#38; Gottlob, G. (2025). Soft and Constrained Hypertree Width. <i>Proceedings of the ACM on Management of Data</i>, <i>3</i>(2), 1–25. <a href=\"https://doi.org/10.1145/3725251\">https://doi.org/10.1145/3725251</a>"},"_id":"60496","department":[{"_id":"888"}],"user_id":"114410","type":"journal_article","status":"public","publisher":"Association for Computing Machinery (ACM)","date_created":"2025-07-02T11:41:00Z","title":"Soft and Constrained Hypertree Width","issue":"2","year":"2025","language":[{"iso":"eng"}],"publication":"Proceedings of the ACM on Management of Data","abstract":[{"lang":"eng","text":"<jats:p>Hypertree decompositions provide a way to evaluate Conjunctive Queries (CQs) in polynomial time, where the exponent of this polynomial is determined by the width of the decomposition. In theory, the goal of efficient CQ evaluation therefore has to be a minimisation of the width. However, in practical settings, it turns out that there are also other properties of a decomposition that influence the performance of query evaluation. It is therefore of interest to restrict the computation of decompositions by constraints and to guide this computation by preferences. To this end, we propose a novel framework based on candidate tree decompositions, which allows us to introduce soft hypertree width (shw). This width measure is a relaxation of hypertree width (hw); it is never greater than hw and, in some cases, shw may actually be lower than hw. Most importantly, shw preserves the tractability of deciding if a given CQ is below some fixed bound, while offering more algorithmic flexibility. In particular, it provides a natural way to incorporate preferences and constraints into the computation of decompositions. A prototype implementation and preliminary experiments confirm that this novel framework can indeed have a practical impact on query evaluation.</jats:p>"}]},{"language":[{"iso":"ger"}],"department":[{"_id":"363"}],"user_id":"37888","_id":"60495","status":"public","publication":"Stochastik in der Schule","type":"journal_article","title":"Explorative Datenanalyse in der Schule – Analyse der Mediennutzung von Jugendlichen mit den YOU‑PB Daten","volume":45,"author":[{"orcid":"0000-0002-6313-5987","last_name":"Podworny","full_name":"Podworny, Susanne","id":"30619","first_name":"Susanne"},{"id":"42660","full_name":"Fleischer, Yannik","last_name":"Fleischer","orcid":"https://orcid.org/0000-0003-0318-0329","first_name":"Yannik"},{"first_name":"Rolf","last_name":"Biehler","id":"16274","full_name":"Biehler, Rolf"}],"date_created":"2025-07-02T09:45:14Z","date_updated":"2025-07-02T09:45:22Z","page":"9-16","intvolume":"        45","citation":{"ieee":"S. Podworny, Y. Fleischer, and R. Biehler, “Explorative Datenanalyse in der Schule – Analyse der Mediennutzung von Jugendlichen mit den YOU‑PB Daten,” <i>Stochastik in der Schule</i>, vol. 45, no. 2, pp. 9–16, 2025.","chicago":"Podworny, Susanne, Yannik Fleischer, and Rolf Biehler. “Explorative Datenanalyse in der Schule – Analyse der Mediennutzung von Jugendlichen mit den YOU‑PB Daten.” <i>Stochastik in der Schule</i> 45, no. 2 (2025): 9–16.","ama":"Podworny S, Fleischer Y, Biehler R. Explorative Datenanalyse in der Schule – Analyse der Mediennutzung von Jugendlichen mit den YOU‑PB Daten. <i>Stochastik in der Schule</i>. 2025;45(2):9-16.","apa":"Podworny, S., Fleischer, Y., &#38; Biehler, R. (2025). Explorative Datenanalyse in der Schule – Analyse der Mediennutzung von Jugendlichen mit den YOU‑PB Daten. <i>Stochastik in der Schule</i>, <i>45</i>(2), 9–16.","bibtex":"@article{Podworny_Fleischer_Biehler_2025, title={Explorative Datenanalyse in der Schule – Analyse der Mediennutzung von Jugendlichen mit den YOU‑PB Daten}, volume={45}, number={2}, journal={Stochastik in der Schule}, author={Podworny, Susanne and Fleischer, Yannik and Biehler, Rolf}, year={2025}, pages={9–16} }","short":"S. Podworny, Y. Fleischer, R. Biehler, Stochastik in der Schule 45 (2025) 9–16.","mla":"Podworny, Susanne, et al. “Explorative Datenanalyse in der Schule – Analyse der Mediennutzung von Jugendlichen mit den YOU‑PB Daten.” <i>Stochastik in der Schule</i>, vol. 45, no. 2, 2025, pp. 9–16."},"year":"2025","issue":"2","publication_status":"published"},{"title":"On the association scheme of perfect matchings and their designs","date_created":"2025-07-02T07:37:23Z","author":[{"id":"91965","full_name":"Klawuhn, Lukas-André Dominik","last_name":"Klawuhn","orcid":"0009-0009-7736-4885","first_name":"Lukas-André Dominik"},{"first_name":"John","last_name":"Bamberg","full_name":"Bamberg, John"}],"date_updated":"2025-07-02T07:47:09Z","citation":{"ieee":"L.-A. D. Klawuhn and J. Bamberg, “On the association scheme of perfect matchings and their designs.” 2025.","chicago":"Klawuhn, Lukas-André Dominik, and John Bamberg. “On the Association Scheme of Perfect Matchings and Their Designs,” 2025.","ama":"Klawuhn L-AD, Bamberg J. On the association scheme of perfect matchings and their designs. Published online 2025.","apa":"Klawuhn, L.-A. D., &#38; Bamberg, J. (2025). <i>On the association scheme of perfect matchings and their designs</i>.","short":"L.-A.D. Klawuhn, J. Bamberg, (2025).","bibtex":"@article{Klawuhn_Bamberg_2025, title={On the association scheme of perfect matchings and their designs}, author={Klawuhn, Lukas-André Dominik and Bamberg, John}, year={2025} }","mla":"Klawuhn, Lukas-André Dominik, and John Bamberg. <i>On the Association Scheme of Perfect Matchings and Their Designs</i>. 2025."},"year":"2025","language":[{"iso":"eng"}],"user_id":"91965","department":[{"_id":"100"}],"_id":"60491","external_id":{"arxiv":["2507.00813"]},"status":"public","abstract":[{"text":"We investigate generalisations of 1-factorisations and hyperfactorisations of the complete graph $K_{2n}$. We show that they are special subsets of the association scheme obtained from the Gelfand pair $(S_{2n},S_2 \\wr S_n)$. This unifies and extends results by Cameron (1976) and gives rise to new existence and non-existence results. Our methods involve working in the group algebra $\\mathbb{C}[S_{2n}]$ and using the representation theory of $S_{2n}$.","lang":"eng"}],"type":"preprint"},{"quality_controlled":"1","year":"2025","publisher":"Springer Nature Switzerland","date_created":"2025-07-02T11:46:06Z","title":"Towards Practicable Algorithms for Rewriting Graph Queries Beyond DL-Lite","publication":"The Semantic Web - 22nd European Semantic Web Conference, {ESWC} 2025, Portoroz, Slovenia, June 1-5, 2025, Proceedings, Part {I}","abstract":[{"text":"Despite the advantages that the virtual knowledge graph paradigm has brought to many application domains, state-of-the-art systems still do not support popular graph database management systems like Neo4j. Their query rewriting algorithms focus on languages like conjunctive queries and their unions, which were developed for relational data and are poorly suited for graph data. Moreover, they also limit the expressiveness of the ontology languages that admit rewritings, restricting them to those that enjoy the so-called FO-rewritability property. Rewritings have thus focused on the DL-Lite family of Description Logics. In this paper, we propose a technique for rewriting a family of navigational queries for a suitably tailored fragment of ELHI. Leveraging navigational features in the target query language, we can include some widely-used axiom shapes not supported by DL-Lite. We implemented a proof-of-concept prototype that rewrites into Cypher queries, and tested it on a real-world cognitive neuroscience use case with promising results.","lang":"eng"}],"keyword":["Ontology-based Data Access","Property Graphs","Navigational Queries"],"language":[{"iso":"eng"}],"publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783031945748","9783031945755"]},"publication_status":"published","page":"342--361","intvolume":"     15718","citation":{"mla":"Löhnert, Bianca, et al. “Towards Practicable Algorithms for Rewriting Graph Queries Beyond DL-Lite.” <i>The Semantic Web - 22nd European Semantic Web Conference, {ESWC} 2025, Portoroz, Slovenia, June 1-5, 2025, Proceedings, Part {I}</i>, vol. 15718, Springer Nature Switzerland, 2025, pp. 342--361, doi:<a href=\"https://doi.org/10.1007/978-3-031-94575-5_19\">10.1007/978-3-031-94575-5_19</a>.","short":"B. Löhnert, N. Augsten, C. Okulmus, M. Ortiz, in: The Semantic Web - 22nd European Semantic Web Conference, {ESWC} 2025, Portoroz, Slovenia, June 1-5, 2025, Proceedings, Part {I}, Springer Nature Switzerland, 2025, pp. 342--361.","bibtex":"@inproceedings{Löhnert_Augsten_Okulmus_Ortiz_2025, series={Lecture Notes in Computer Science}, title={Towards Practicable Algorithms for Rewriting Graph Queries Beyond DL-Lite}, volume={15718}, DOI={<a href=\"https://doi.org/10.1007/978-3-031-94575-5_19\">10.1007/978-3-031-94575-5_19</a>}, booktitle={The Semantic Web - 22nd European Semantic Web Conference, {ESWC} 2025, Portoroz, Slovenia, June 1-5, 2025, Proceedings, Part {I}}, publisher={Springer Nature Switzerland}, author={Löhnert, Bianca and Augsten, Nikolaus and Okulmus, Cem and Ortiz, Magdalena}, year={2025}, pages={342--361}, collection={Lecture Notes in Computer Science} }","apa":"Löhnert, B., Augsten, N., Okulmus, C., &#38; Ortiz, M. (2025). Towards Practicable Algorithms for Rewriting Graph Queries Beyond DL-Lite. <i>The Semantic Web - 22nd European Semantic Web Conference, {ESWC} 2025, Portoroz, Slovenia, June 1-5, 2025, Proceedings, Part {I}</i>, <i>15718</i>, 342--361. <a href=\"https://doi.org/10.1007/978-3-031-94575-5_19\">https://doi.org/10.1007/978-3-031-94575-5_19</a>","chicago":"Löhnert, Bianca, Nikolaus Augsten, Cem Okulmus, and Magdalena Ortiz. “Towards Practicable Algorithms for Rewriting Graph Queries Beyond DL-Lite.” In <i>The Semantic Web - 22nd European Semantic Web Conference, {ESWC} 2025, Portoroz, Slovenia, June 1-5, 2025, Proceedings, Part {I}</i>, 15718:342--361. Lecture Notes in Computer Science. Springer Nature Switzerland, 2025. <a href=\"https://doi.org/10.1007/978-3-031-94575-5_19\">https://doi.org/10.1007/978-3-031-94575-5_19</a>.","ieee":"B. Löhnert, N. Augsten, C. Okulmus, and M. Ortiz, “Towards Practicable Algorithms for Rewriting Graph Queries Beyond DL-Lite,” in <i>The Semantic Web - 22nd European Semantic Web Conference, {ESWC} 2025, Portoroz, Slovenia, June 1-5, 2025, Proceedings, Part {I}</i>, Portorož, Slovenia, 2025, vol. 15718, pp. 342--361, doi: <a href=\"https://doi.org/10.1007/978-3-031-94575-5_19\">10.1007/978-3-031-94575-5_19</a>.","ama":"Löhnert B, Augsten N, Okulmus C, Ortiz M. Towards Practicable Algorithms for Rewriting Graph Queries Beyond DL-Lite. In: <i>The Semantic Web - 22nd European Semantic Web Conference, {ESWC} 2025, Portoroz, Slovenia, June 1-5, 2025, Proceedings, Part {I}</i>. Vol 15718. Lecture Notes in Computer Science. Springer Nature Switzerland; 2025:342--361. doi:<a href=\"https://doi.org/10.1007/978-3-031-94575-5_19\">10.1007/978-3-031-94575-5_19</a>"},"oa":"1","date_updated":"2025-07-02T11:55:19Z","volume":15718,"author":[{"first_name":"Bianca","full_name":"Löhnert, Bianca","last_name":"Löhnert"},{"first_name":"Nikolaus","full_name":"Augsten, Nikolaus","last_name":"Augsten"},{"first_name":"Cem","id":"114410","full_name":"Okulmus, Cem","last_name":"Okulmus","orcid":"0000-0002-7742-0439"},{"first_name":"Magdalena","full_name":"Ortiz, Magdalena","last_name":"Ortiz"}],"doi":"10.1007/978-3-031-94575-5_19","conference":{"end_date":"2025-06-05","location":"Portorož, Slovenia","name":"22th European Semantic Web Conference (ESWC 2025)","start_date":"2025-06-01"},"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/2405.18181"}],"type":"conference","status":"public","_id":"60497","department":[{"_id":"888"}],"user_id":"114410","series_title":"Lecture Notes in Computer Science"},{"status":"public","type":"conference","language":[{"iso":"eng"}],"_id":"60502","department":[{"_id":"49"}],"user_id":"32580","year":"2025","citation":{"short":"H. Zeipert, L. Claes, C. Stoeckel, S. Mulay, B. Henning, in: 2025.","mla":"Zeipert, Henning, et al. <i>Evaluation of Piezoelectric Micromachined Ultrasonic Transducers (PMUT) for the Broadband Detection of Ultrasonic Elastic Waves</i>. 2025, doi:<a href=\"https://doi.org/10.5162/SMSI2025/D5.2\">10.5162/SMSI2025/D5.2</a>.","bibtex":"@inproceedings{Zeipert_Claes_Stoeckel_Mulay_Henning_2025, title={Evaluation of piezoelectric micromachined ultrasonic transducers (PMUT) for the broadband detection of ultrasonic elastic waves}, DOI={<a href=\"https://doi.org/10.5162/SMSI2025/D5.2\">10.5162/SMSI2025/D5.2</a>}, author={Zeipert, Henning and Claes, Leander and Stoeckel, Chris and Mulay, Shubham and Henning, Bernd}, year={2025} }","apa":"Zeipert, H., Claes, L., Stoeckel, C., Mulay, S., &#38; Henning, B. (2025). <i>Evaluation of piezoelectric micromachined ultrasonic transducers (PMUT) for the broadband detection of ultrasonic elastic waves</i>. SMSI 2025, Nürnberg. <a href=\"https://doi.org/10.5162/SMSI2025/D5.2\">https://doi.org/10.5162/SMSI2025/D5.2</a>","ama":"Zeipert H, Claes L, Stoeckel C, Mulay S, Henning B. Evaluation of piezoelectric micromachined ultrasonic transducers (PMUT) for the broadband detection of ultrasonic elastic waves. In: ; 2025. doi:<a href=\"https://doi.org/10.5162/SMSI2025/D5.2\">10.5162/SMSI2025/D5.2</a>","ieee":"H. Zeipert, L. Claes, C. Stoeckel, S. Mulay, and B. Henning, “Evaluation of piezoelectric micromachined ultrasonic transducers (PMUT) for the broadband detection of ultrasonic elastic waves,” presented at the SMSI 2025, Nürnberg, 2025, doi: <a href=\"https://doi.org/10.5162/SMSI2025/D5.2\">10.5162/SMSI2025/D5.2</a>.","chicago":"Zeipert, Henning, Leander Claes, Chris Stoeckel, Shubham Mulay, and Bernd Henning. “Evaluation of Piezoelectric Micromachined Ultrasonic Transducers (PMUT) for the Broadband Detection of Ultrasonic Elastic Waves,” 2025. <a href=\"https://doi.org/10.5162/SMSI2025/D5.2\">https://doi.org/10.5162/SMSI2025/D5.2</a>."},"title":"Evaluation of piezoelectric micromachined ultrasonic transducers (PMUT) for the broadband detection of ultrasonic elastic waves","doi":"10.5162/SMSI2025/D5.2","conference":{"name":"SMSI 2025","start_date":"2025-05-06","end_date":"2025-05-08","location":"Nürnberg"},"date_updated":"2025-07-03T07:09:09Z","author":[{"last_name":"Zeipert","id":"32580","full_name":"Zeipert, Henning","first_name":"Henning"},{"first_name":"Leander","last_name":"Claes","orcid":"0000-0002-4393-268X","full_name":"Claes, Leander","id":"11829"},{"first_name":"Chris","full_name":"Stoeckel, Chris","last_name":"Stoeckel"},{"last_name":"Mulay","full_name":"Mulay, Shubham","first_name":"Shubham"},{"full_name":"Henning, Bernd","id":"213","last_name":"Henning","first_name":"Bernd"}],"date_created":"2025-07-03T07:08:58Z"}]