@inbook{59788,
  author       = {{Prikoszovits, Matthias}},
  booktitle    = {{Digitale Lehr-/Lernressourcen und digitale Kompetenz. Forschung aus dem Hochschulkontext.}},
  editor       = {{Feick, Diana and Biebighäuser, Katrin}},
  pages        = {{43 -- 68}},
  publisher    = {{Erich Schmidt}},
  title        = {{{Zur lehrkräftegelenkten Digitalisierung fachsprachlich orientierten DaF-Unterrichtsmaterials}}},
  volume       = {{21}},
  year         = {{2025}},
}

@article{59792,
  abstract     = {{<jats:title>Abstract</jats:title>
          <jats:p>Motivated by mechanical systems with symmetries, we focus on optimal control problems possessing certain symmetries. Following recent works (Faulwasser in Math Control Signals Syst 34:759–788 2022; Trélat in Math Control Signals Syst 35:685–739 2023), which generalized the classical concept of <jats:italic>static turnpike to manifold turnpike</jats:italic> we extend the <jats:italic>exponential turnpike property</jats:italic> to the <jats:italic>exponential trim turnpike</jats:italic> for control systems with symmetries induced by abelian or non-abelian groups. Our analysis is mainly based on the geometric reduction of control systems with symmetries. More concretely, we first reduce the control system on the quotient space and state the turnpike theorem for the reduced problem. Then we use the group properties to obtain the <jats:italic>trim turnpike theorem</jats:italic> for the full problem. Finally, we illustrate our results on the Kepler problem and the rigid body problem.
</jats:p>}},
  author       = {{Flaßkamp, Kathrin and Maslovskaya, Sofya and Ober-Blöbaum, Sina and Wembe Moafo, Boris Edgar}},
  issn         = {{0932-4194}},
  journal      = {{Mathematics of Control, Signals, and Systems}},
  publisher    = {{Springer Science and Business Media LLC}},
  title        = {{{Trim turnpikes for optimal control problems with symmetries}}},
  doi          = {{10.1007/s00498-025-00408-w}},
  year         = {{2025}},
}

@book{59789,
  author       = {{Reis, Oliver and Walter, Marie and Frieler, Jana}},
  title        = {{{Der Morgenimpuls als Grenzgänger. Praxeologische Rekonstruktionen des Profilindikators Katholischer Schulen}}},
  year         = {{2025}},
}

@inbook{59802,
  author       = {{Löhr, Bernd and Bartelheimer, Christian and Köhne, Frank and Nordlohne, Sina and Alile, Daniel and Latten, Andrees}},
  booktitle    = {{Business Process Management Workshops}},
  isbn         = {{9783031786655}},
  issn         = {{1865-1348}},
  publisher    = {{Springer Nature Switzerland}},
  title        = {{{Forging the LongSWORD: Exaptation and Enhancement of the SWORD Framework for Workaround Detection}}},
  doi          = {{10.1007/978-3-031-78666-2_24}},
  year         = {{2025}},
}

@inproceedings{59699,
  author       = {{Jungemann, Linus and Wintermann, Bjarne and Riebler, Heinrich and Plessl, Christian}},
  booktitle    = {{Proceedings of the 2025 ACM/SIGDA International Symposium on Field Programmable Gate Arrays}},
  publisher    = {{ACM}},
  title        = {{{Neural Network Inference in High-Performance Computing: Closing the Gap for FINN based Reconfigurable Accelerators}}},
  doi          = {{10.1145/3706628.3708857}},
  year         = {{2025}},
}

@article{59805,
  abstract     = {{The LLC converter achieves the highest efficiency in resonant operation. Conventionally, the input DC-link voltage is controlled to operate the LLC converter at resonance for the given operating point. However, the DC-link capacitor voltage shows a low-frequency voltage ripple (typically the second harmonic of grid frequency) in cascaded converters so that the LLC has to adapt its switching frequency within the grid period. Conventionally, the LLC converter operates 50% of the time above the resonant frequency of 40 kHz and 50% below resonance. Both operating conditions cause additional losses. However, experimental measurements indicate that the below-resonance operation causes significantly higher losses than above-resonance operation due to much higher primary and secondary transformer currents. It is better to increase the DC-link voltage by 30% of the peak-to-peak low-frequency voltage ripple to mostly avoid below-resonance operation (i.e., from 650 V to 680 V in this case). With the proposed control, the LLC converter operates about 75% of time over resonance and only 25% of time below resonance. The overall efficiency increases from 97.66% to 97.7% for the average operating point with an 80% load current. This corresponds to a 2% total loss reduction. Finally, the peak resonance capacitor voltage decreases from 910 V to 790 V (−13%).}},
  author       = {{Unruh, Roland and Böcker, Joachim and Schafmeister, Frank}},
  issn         = {{2079-9292}},
  journal      = {{Electronics}},
  keywords     = {{adaptive DC-link voltage, cascaded H-bridge, resonant operation, Full-Bridge Converter, loss minimization, LLC Resonant Converter, peak capacitor voltage reduction}},
  number       = {{8}},
  publisher    = {{MDPI AG}},
  title        = {{{Adaptive DC-Link Voltage Control for 22 kW, 40 kHz LLC Resonant Converter Considering Low-Frequency Voltage Ripple}}},
  doi          = {{10.3390/electronics14081517}},
  volume       = {{14}},
  year         = {{2025}},
}

@article{59806,
  abstract     = {{We introduce a model of information dissemination in signed networks. It is a discrete-time process in which uninformed actors incrementally receive information from their informed neighbors or from the outside. Our goal is to minimize the number of confused actors — that is, the number of actors who receive contradictory information. We prove upper bounds for the number of confused actors in signed networks and in equivalence classes of signed networks. In particular, we show that there are signed networks where, for any information placement strategy, almost 60% of the actors are confused. Furthermore, this is also the case when considering the minimum number of confused actors within an equivalence class of signed graphs.}},
  author       = {{Jin, Ligang and Steffen, Eckhard}},
  issn         = {{0166-218X}},
  journal      = {{Discrete Applied Mathematics}},
  pages        = {{99--106}},
  publisher    = {{Elsevier BV}},
  title        = {{{Information dissemination and confusion in signed networks}}},
  doi          = {{10.1016/j.dam.2025.04.049}},
  volume       = {{373}},
  year         = {{2025}},
}

@article{59803,
  author       = {{Drossel, Kerstin and Niemann, Jan and Eickelmann, Birgit and Niggemeier, Johannes Bernd}},
  issn         = {{0937-7239}},
  journal      = {{SchulVerwaltung Nordrhein-Westfalen}},
  pages        = {{100--104}},
  publisher    = {{Carl Link Verlag}},
  title        = {{{Digitale Kompetenzen von Schüler:innen und Rahmenbedingungen des Kompetenzerwerbs in Nordrhein-Westfalen}}},
  volume       = {{4}},
  year         = {{2025}},
}

@inbook{52735,
  author       = {{Bellinger, Franziska and Dehmel, Lukas}},
  booktitle    = {{Perspektiven auf Bildung in Europa. Festschrift für Beatrix Niemexer-Jensen.}},
  editor       = {{Bellinger, Franziska and Thon, Christine and Wischmann, Anke}},
  pages        = {{37--48}},
  title        = {{{Europäische Bildungsinitiativen als Rahmen medienpädagogischer Professionalisierung in der Erwachsenenbildung. Rekonstruktive Analysen zum Medien(bildungs)begriff}}},
  year         = {{2025}},
}

@inproceedings{58801,
  abstract     = {{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.}},
  author       = {{Lange, Felix and Niere, Niklas and von Niessen, Jonathan and Suermann, Dennis and Heitmann, Nico and Somorovsky, Juraj}},
  booktitle    = {{Proceedings on Privacy Enhancing Technologies}},
  location     = {{Virtual}},
  title        = {{{I(ra)nconsistencies: Novel Insights into Iran’s Censorship}}},
  year         = {{2025}},
}

@unpublished{59839,
  abstract     = {{In many scientific approaches, especially in those that try to foster explainability of Artificial Intelligences, a narrow conception of explaining prevails. This narrow conception implies that explaining is a one-directional action in which knowledge is transferred from the explainer to an addressee. By studying the amount of agency in metaphors for explaining in scientific texts, we want to find out – or at least to contribute a partial answer to the question – why this narrow conception is so dominant. For our analysis, we use a linguistic conception of agency, transitivity. This concept allows to specify the degree of agency or effectiveness of the action in a verbalised event. It is defined by several component parts. We detail and discuss both the parameters of and global transitivity. Overall, transitivity of explaining metaphors has a rather common pattern across metaphors. Agency is not high and reduced in characteristic aspects: The metaphors imply that the object of explaining is static, i.e., is not changed within the explanation, and that explaining is the activity of one person only. This pattern may account for the narrow conception of explaining. It contrasts strongly with current co-constructive or sociotechnical approaches to explainability.}},
  author       = {{Scharlau, Ingrid and Rohlfing, Katharina J.}},
  publisher    = {{Center for Open Science}},
  title        = {{{Agency in metaphors of explaining: An analysis of scientific texts}}},
  year         = {{2025}},
}

@inproceedings{59835,
  author       = {{Hustermeier, Lennart and Yigitbas, Enes}},
  booktitle    = {{Proceedings of the 20th IFIP TC13 International Conference on Human-Computer Interaction (INTERACT 2025)}},
  publisher    = {{Springer}},
  title        = {{{A Novel Approach for Controlling Drone Swarms: Integrating LLMs and Augmented Reality}}},
  year         = {{2025}},
}

@inproceedings{59840,
  abstract     = {{The Semantic Web and Graph Database communities have developed three distinct schema languages for RDF and graph-structured data: SHACL, ShEx, and PG-Schema. Each language has its unique approach to defining constraints and validating graph data. In this work, we provide formal, concise definitions of the core components of each of these schema languages. We employ a uniform framework to facilitate a comprehensive comparison between the languages and identify a common set of functionalities, shedding light on both overlapping and distinctive features of the three languages.
}},
  author       = {{Ahmetaj, Shqiponja and Boneva, Iovka and Hidders, Jan and Hose, Katja and Jakubowski, Maxime and Labra Gayo, Jose Emilio and Martens, Wim and Mogavero, Fabio and Murlak, Filip and Okulmus, Cem and Polleres, Axel and Savković, Ognjen and Šimkus, Mantas and Tomaszuk, Dominik}},
  booktitle    = {{Proceedings of the ACM on Web Conference 2025}},
  location     = {{Sidney, Australia}},
  pages        = {{8--12}},
  publisher    = {{ACM}},
  title        = {{{Common Foundations for SHACL, ShEx, and PG-Schema}}},
  doi          = {{10.1145/3696410.3714694}},
  year         = {{2025}},
}

@inbook{58724,
  author       = {{Brennig, Katharina and Kaltenpoth, Sascha Benjamin and Müller, Oliver}},
  booktitle    = {{Lecture Notes in Business Information Processing}},
  isbn         = {{9783031786655}},
  issn         = {{1865-1348}},
  publisher    = {{Springer Nature Switzerland}},
  title        = {{{Straight Outta Logs: Can Large Language Models Overcome Preprocessing in Next Event Prediction?}}},
  doi          = {{10.1007/978-3-031-78666-2_15}},
  year         = {{2025}},
}

@article{59846,
  author       = {{Mildorf, Jarmila}},
  issn         = {{0039-4130}},
  journal      = {{Studium Ricerca, Letteratura}},
  number       = {{1}},
  pages        = {{134--160}},
  title        = {{{The Voice of the Bard: Milton’s Paradise Lost on Radio}}},
  volume       = {{121}},
  year         = {{2025}},
}

@article{59847,
  abstract     = {{<jats:title>Abstract</jats:title>
          <jats:p>The surface-assisted assembly of DNA origami lattices is a potent method for creating molecular lithography masks. Lattice quality and assembly kinetics are controlled by various environmental parameters, including the employed surface, the assembly temperature, and the ionic composition of the buffer, with optimized parameter combinations resulting in highly ordered lattices that can span surface areas of several cm<jats:sup>2</jats:sup>. Established assembly protocols, however, employ assembly times ranging from hours to days. Here, the assembly of highly ordered hexagonal DNA origami lattices at mica surfaces is observed within few minutes using high-speed atomic force microscopy (HS-AFM). A moderate increase in the DNA origami concentration enables this rapid assembly. While forming a regular lattice takes 10 min at a DNA origami concentration of 4 nM, this time is shortened to about 2 min at a concentration of 6 nM. Increasing the DNA origami concentration any further does not result in shorter assembly times, presumably because DNA origami arrival at the mica surface is diffusion-limited. Over short length scales up to 1 µm, lattice order is independent of the DNA origami concentration. However, at larger length scales of a few microns, a DNA origami concentration of 10 nM yields slightly better order than lower and higher concentrations. Therefore, 10 nM can be considered the optimum concentration for the rapid assembly of highly ordered DNA origami lattices. These results thus represent an important step toward the industrial-scale application of DNA origami-based lithography masks.</jats:p>}},
  author       = {{Pothineni, Bhanu Kiran and Barner, Jörg and Grundmeier, Guido and Contreras, David and Castro, Mario and Keller, Adrian}},
  issn         = {{2731-9229}},
  journal      = {{Discover Nano}},
  number       = {{1}},
  publisher    = {{Springer Science and Business Media LLC}},
  title        = {{{Rapid assembly of highly ordered DNA origami lattices at mica surfaces}}},
  doi          = {{10.1186/s11671-025-04254-2}},
  volume       = {{20}},
  year         = {{2025}},
}

@inbook{53445,
  author       = {{Hälterlein, Jens}},
  booktitle    = {{The Realities of Autonomous Weapons}},
  editor       = {{Bächle, Thomas Christian and Bareis, Jascha}},
  pages        = {{187--204}},
  publisher    = {{Bristol University Press}},
  title        = {{{Governing Autonomies: Imagining Responsible Artificial Intelligence in the “Future Combat Air System” European Armament Project}}},
  year         = {{2025}},
}

@unpublished{59860,
  abstract     = {{A three-dimensional quasi-Fuchsian Lorentzian manifold $M$ is a globally
hyperbolic spacetime diffeomorphic to $\Sigma\times (-1,1)$ for a closed
orientable surface $\Sigma$ of genus $\geq 2$. It is the quotient
$M=\Gamma\backslash \Omega_\Gamma$ of an open set $\Omega_\Gamma\subset {\rm
AdS}_3$ by a discrete group $\Gamma$ of isometries of ${\rm AdS}_3$ which is a
particular example of an Anosov representation of $\pi_1(\Sigma)$. We first
show that the spacelike geodesic flow of $M$ is Axiom A, has a discrete Ruelle
resonance spectrum with associated (co-)resonant states, and that the
Poincar\'e series for $\Gamma$ extend meromorphically to $\mathbb{C}$. This is
then used to prove that there is a natural notion of resolvent of the
pseudo-Riemannian Laplacian $\Box$ of $M$, which is meromorphic on $\mathbb{C}$
with poles of finite rank, defining a notion of quantum resonances and quantum
resonant states related to the Ruelle resonances and (co-)resonant states by a
quantum-classical correspondence. This initiates the spectral study of convex
co-compact pseudo-Riemannian locally symmetric spaces.}},
  author       = {{Delarue, Benjamin and Guillarmou, Colin and Monclair, Daniel}},
  booktitle    = {{arXiv:2504.21762}},
  title        = {{{Spectra of Lorentzian quasi-Fuchsian manifolds}}},
  year         = {{2025}},
}

@inbook{59867,
  author       = {{Dübbert, Alexander}},
  booktitle    = {{Transdisziplinäre Räume in den Kulturwissenschaften}},
  editor       = {{Kornbach, Alina and Lammer, Christina and Magdeburg, Lena}},
  pages        = {{403--429}},
  publisher    = {{Herder}},
  title        = {{{Muster in der Benamung 'nachhaltiger' Lebensmittelmarkennamen - Kulturbezogene Deutungen von Namen am stationären Verkaufsort als Raum}}},
  volume       = {{3}},
  year         = {{2025}},
}

@book{59862,
  editor       = {{Kornbach, Alina and Lammer, Christina and Magdeburg, Lena Maria}},
  publisher    = {{Herder Verlag}},
  title        = {{{Transdisziplinäre Räume in den Kulturwissenschaften}}},
  volume       = {{3}},
  year         = {{2025}},
}