@inproceedings{58227,
  author       = {{Brockmeier, Jan and Kruse, Stephan and Scheytt, J. Christoph}},
  booktitle    = {{German Microwave Conference 2025}},
  location     = {{Dresden}},
  title        = {{{A Mach-Zehnder-Modulator based FMCW Lidar Emulator in C-Band}}},
  year         = {{2025}},
}

@article{58353,
  abstract     = {{<jats:title>Abstract</jats:title>
          <jats:p>Statistics and machine learning are critical because they play an essential role in our everyday lives and the careers we may pursue in the future. It may be beneficial to introduce machine learning, such as decision trees (DTs), at an early stage of education. The data-based construction of DTs is an example of a machine learning process, which can be addressed in mathematics or statistics teaching because of relatively low prior knowledge requirements. This paper focuses on investigating how sixth-grade students create and evaluate data-based DTs. The basis is a teaching unit that aims to lay the foundation for machine learning and enhance students’ understanding of the process. We investigate students’ processes in detail while they build DTs with data cards about food items to predict whether a new item is recommendable. After the teaching unit, an interview study examines students’ strategies for creating decision trees. The findings contribute to understanding students’ learning processes and the challenges when working with decision trees.</jats:p>}},
  author       = {{Podworny, Susanne and Biehler, Rolf and Fleischer, Yannik}},
  issn         = {{1863-9690}},
  journal      = {{ZDM – Mathematics Education}},
  publisher    = {{Springer Science and Business Media LLC}},
  title        = {{{Young students’ engagement with data to create decision trees}}},
  doi          = {{10.1007/s11858-024-01649-w}},
  year         = {{2025}},
}

@article{54450,
  abstract     = {{In the last decade, there has been increasing interest in allowing users to understand how the predictions of machine-learned models come about, thus increasing transparency and empowering users to understand and potentially contest those decisions.Dialogue-based approaches, in contrast to traditional one-shot eXplainable Artificial Intelligence (XAI) methods, facilitate interactive, in-depth exploration through multi-turn dialogues, simulating expert conversations. This paper reviews the current state of dialogue-based XAI, presenting a systematic review of 1,339 publications, narrowed down to 14 based on inclusion criteria. We explore theoretical foundations of the systems, propose key dimensions along which different solutions to dialogue-based XAI differ, and identify key use cases, target audiences, system components, and the types of supported queries and responses. Furthermore, we investigate the current paradigms by which systems are evaluated and highlight their key limitations. Key findings include identifying the main use cases, objectives, and audiences targeted by dialogue-based XAI methods, and summarize the main types of questions and information needs. Beyond discussing avenues for future work, we present a meta-architecture for these systems from existing literature and outlined prevalent theoretical frameworks.}},
  author       = {{Mindlin, Dimitry and Beer, Fabian and Sieger, Leonie Nora and Heindorf, Stefan and Cimiano, Philipp and Esposito, Elena and Ngonga Ngomo, Axel-Cyrille}},
  journal      = {{Artificial Intelligence Review}},
  number       = {{3}},
  publisher    = {{Springer}},
  title        = {{{Beyond One-Shot Explanations: A Systematic Literature Review of Dialogue-Based XAI Approaches}}},
  doi          = {{10.1007/s10462-024-11007-7}},
  volume       = {{58}},
  year         = {{2025}},
}

@article{59414,
  author       = {{Häsel-Weide, Uta and Nührenbörger, M.}},
  journal      = {{Zeitschrift für Grundschulforschung}},
  title        = {{{Unterrichtsintegrierte Förderung von mathematischen Basiskompetenzen. Empirische Rekonstruktion interferierender Praktiken der Förderung im Mathematikunterricht der Grundschule}}},
  doi          = {{ https://doi.org/10.1007/s42278-025-00223-x }},
  year         = {{2025}},
}

@article{59512,
  abstract     = {{<jats:title>Abstract</jats:title>
               <jats:p>Große Sprachmodelle wie GPT-4 bieten erhebliche Potenziale für das Systems Engineering. Prompt-Engineering ermöglicht einen flexiblen Einsatz im Anforderungsmanagement, Systementwurf und in der Integration, Verifikation und Validierung ohne aufwendiges Modelltraining. Die Formulierung von Prompts und die Anwendung fortschrittlicher Techniken erfordern jedoch tiefes Domänenwissen. Der Beitrag zeigt Potenziale und Herausforderungen dieser Technik auf und illustriert praktische Anwendungsbeispiele</jats:p>}},
  author       = {{Hovemann, Aschot and Bita, Isaac Mpidi and Aldade, Abed Alrahman and von Heißen, Oliver and Dumitrescu, Roman}},
  issn         = {{2511-0896}},
  journal      = {{Zeitschrift für wirtschaftlichen Fabrikbetrieb}},
  number       = {{s1}},
  pages        = {{101--106}},
  publisher    = {{Walter de Gruyter GmbH}},
  title        = {{{Prompt Engineering im Systems Engineering}}},
  doi          = {{10.1515/zwf-2024-0139}},
  volume       = {{120}},
  year         = {{2025}},
}

@article{59513,
  abstract     = {{<jats:title>Abstract</jats:title>
               <jats:p>The increasing complexity of modern technical systems necessitates innovative approaches such as Model-Based Systems Engineering (MBSE). In this context, using Artificial Intelligence (AI) emerges as a key enabler for practical application and efficiency improvement. This article introduces a maturity model for AI-based assistance systems in MBSE. It helps companies assess their current automation level in MBSE activities, providing a foundation for strategic planning of process improvements.</jats:p>}},
  author       = {{Bernijazov, Ruslan and Dumitrescu, Roman and Hanke, Fabian and von Heißen, Oliver and Kaiser, Lydia and Tissen, Denis}},
  issn         = {{2511-0896}},
  journal      = {{Zeitschrift für wirtschaftlichen Fabrikbetrieb}},
  number       = {{s1}},
  pages        = {{96--100}},
  publisher    = {{Walter de Gruyter GmbH}},
  title        = {{{AI-Augmented Model-Based Systems Engineering}}},
  doi          = {{10.1515/zwf-2024-0123}},
  volume       = {{120}},
  year         = {{2025}},
}

@inproceedings{59514,
  author       = {{Humpert, Lynn and Zagatta, Kristin and Anacker, Harald and Dumitrescu, Roman}},
  booktitle    = {{Proceedings of the 2024 7th International Conference on Computational Intelligence and Intelligent Systems}},
  publisher    = {{ACM}},
  title        = {{{Systems Engineering and Validation: A systematic literature review}}},
  doi          = {{10.1145/3708778.3708793}},
  year         = {{2025}},
}

@article{59532,
  author       = {{Knorr, Lukas and Buchenau, N. and Schlosser, Florian and Divkovic, Denis and Prina, M.G. and Meschede, Henning}},
  issn         = {{1364-0321}},
  journal      = {{Renewable and Sustainable Energy Reviews}},
  publisher    = {{Elsevier BV}},
  title        = {{{Electrification and flexibility of process heat in energy system modelling: A review}}},
  doi          = {{10.1016/j.rser.2025.115698}},
  volume       = {{216}},
  year         = {{2025}},
}

@article{59622,
  abstract     = {{<jats:title>Abstract</jats:title>
          <jats:p>This study explores how high school students construct decision trees using data cards and the software CODAP (codap.concord.org) in interviews after attending a teaching unit. We conceptualized data-based decision tree construction using nine key aspects that we intended to teach, tested variations of two design elements in teaching, and analyzed the interviews qualitatively to compare student behavior to intended outcomes. We found high alignment to intentions but also deviations in data activities and informal or context-based rather than data-based reasoning. The design element of context-free (blinded) data seems to enhance data-based reasoning, while the design element of data card use showed diagnostic potential.</jats:p>}},
  author       = {{Fleischer, Yannik and Biehler, Rolf}},
  issn         = {{1863-9690}},
  journal      = {{ZDM – Mathematics Education}},
  number       = {{1}},
  publisher    = {{Springer Science and Business Media LLC}},
  title        = {{{Exploring students’ constructions of data-based decision trees after an introductory teaching unit on machine learning}}},
  doi          = {{10.1007/s11858-025-01663-6}},
  volume       = {{57}},
  year         = {{2025}},
}

@misc{59624,
  author       = {{Showmik, Md Jannatul Baki}},
  title        = {{{Enhancing Blockchain Efficiency via Median Rule}}},
  year         = {{2025}},
}

@unpublished{59664,
  abstract     = {{Given a sequence of polynomials $(P_n)_{n \in \mathbb{N}}$ with only
nonpositive zeros, the aim of this article is to present a user-friendly
approach for determining the limiting zero distribution of $P_n$ as
$\mathrm{deg}\, P_n \to \infty$. The method is based on establishing an
equivalence between the existence of a limiting empirical zero distribution
$\mu$ and the existence of an exponential profile $g$ associated with the
coefficients of the polynomials $(P_n)_{n \in \mathbb{N}}$. The exponential
profile $g$, which can be roughly described by $[z^k]P_n(z) \approx \exp(n
g(k/n))$, offers a direct route to computing the Cauchy transform $G$ of $\mu$:
the functions $t \mapsto tG(t)$ and $\alpha \mapsto \exp(-g'(\alpha))$ are
mutual inverses. This relationship, in various forms, has previously appeared
in the literature, most notably in the paper [Van Assche, Fano and Ortolani,
SIAM J. Math. Anal., 1987].
  As a first contribution, we present a self-contained probabilistic proof of
this equivalence by representing the polynomials as generating functions of
sums of independent Bernoulli random variables. This probabilistic framework
naturally lends itself to tools from large deviation theory, such as the
exponential change of measure. The resulting theorems generalize and unify a
range of previously known results, which were traditionally established through
analytic or combinatorial methods.
  Secondly, using the profile-based approach, we investigate how the
exponential profile and the limiting zero distribution behave under certain
operations on polynomials, including finite free convolutions, Hadamard
products, and repeated differentiation. In particular, our approach yields new
proofs of the convergence results `$\boxplus_n \to \boxplus$' and `$\boxtimes_n
\to \boxtimes$', extending them to cases where the distributions are not
necessarily compactly supported.}},
  author       = {{Jalowy, Jonas and Kabluchko, Zakhar and Marynych, Alexander}},
  booktitle    = {{arXiv:2504.11593}},
  title        = {{{Zeros and exponential profiles of polynomials I: Limit distributions,  finite free convolutions and repeated differentiation}}},
  year         = {{2025}},
}

@article{59665,
  author       = {{Erbar, Matthias and Huesmann, Martin and Jalowy, Jonas and Müller, Bastian}},
  issn         = {{0022-1236}},
  journal      = {{Journal of Functional Analysis}},
  number       = {{4}},
  publisher    = {{Elsevier BV}},
  title        = {{{Optimal transport of stationary point processes: Metric structure, gradient flow and convexity of the specific entropy}}},
  doi          = {{10.1016/j.jfa.2025.110974}},
  volume       = {{289}},
  year         = {{2025}},
}

@inproceedings{59683,
  abstract     = {{Woven fibre-reinforced polymers are used in a variety of application, especially where a low mass to stiffness ratio is required. Of paramount importance for the tailored mechanical properties these composite materials exhibit is the type and geometry of the fibre weave. Especially continuous fibre-reinforced thermoplastic composites are fabricated as laminates and subsequently exposed to forming processes which alter the geometry of the fibres unit cell and thus the local mechanical properties of the material. An approach utilising broadband ultrasonic waves is proposed to non-destructively determine the geometry of the unit cell of the weave.

The dispersive behaviour of woven fibre-reinforced sheets is described in accordance with the Flouquet-Bloch theorem as a phononic crystal. In order to develop a model for a description of these periodically structured waveguides, the smallest repeating unit of the wave is modelled with periodic boundary conditions. The resulting dispersion diagram exhibits similarities to that of a homogeneous plate, but additionally displays a periodicity in the wavenumber regime, which correspond with the size of the unit cell. Experimental studies of the dispersive behaviour of acoustic waves in woven fibre-reinforced samples also show a periodicity in the wavenumber regime, enabling a measurement procedure of the unit cell geometry.}},
  author       = {{Wippermann, Mareen and Claes, Leander and Brandes, Philipp and Moritzer, Elmar and Henning, Bernd}},
  location     = {{Copenhagen}},
  title        = {{{Determination of the unit cell geometry in fibre-reinforced polymer sheets using guided acoustic waves}}},
  doi          = {{10.71568/DASDAGA2025.116}},
  year         = {{2025}},
}

@inproceedings{59688,
  author       = {{Claes, Leander and Zeipert, Henning and Brandes, Philipp and Moritzer, Elmar and Henning, Bernd}},
  location     = {{Copenhagen}},
  title        = {{{Assessment of Fibre-Matrix Adhesion in Reinforced Polymers by Modal Damping of Guided Acoustic Waves}}},
  doi          = {{10.71568/DASDAGA2025.052}},
  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}},
}

@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}},
}

@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}},
}

@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}},
}

