@inproceedings{63544, author = {{Schreiner, Nick and Trienens, Malte and Kürpick, Christian and Asmar, Laban and Dumitrescu, Roman}}, booktitle = {{2025 IEEE European Technology and Engineering Management Summit (E-TEMS)}}, publisher = {{IEEE}}, title = {{{Product Decarbonization From an Engineering Perspective: Drawing Insights From Industry}}}, doi = {{10.1109/e-tems64751.2025.11239319}}, year = {{2025}}, } @article{63556, author = {{Biehler, Rolf and Engel, Joachim and Frischemeier, Daniel and Podworny, Susanne}}, journal = {{mathematica didactica}}, number = {{2}}, title = {{{Civic Statistical Literacy: Konzept und praxisnahe Umsetzung am Beispiel des Klimawandels}}}, doi = {{10.18716/ojs/md/2025.2297}}, volume = {{48}}, year = {{2025}}, } @unpublished{63569, abstract = {{Let $G$ be a totally disconnected locally compact (tdlc) group. The contraction group $\mathrm{con}(g)$ of an element $g\in G$ is the set of all $h\in G$ such that $g^n h g^{-n} \to 1_G$ as $n \to \infty$. The nub of $g$ can then be characterized as the intersection $\mathrm{nub}(g)$ of the closures of $\mathrm{con}(g)$ and $\mathrm{con}(g^{-1})$. Contraction groups and nubs provide important tools in the study of the structure of tdlc groups, as already evidenced in the work of G. Willis. It is known that $\mathrm{nub}(g) = \{1\}$ if and only if $\mathrm{con}(g)$ is closed. In general, contraction groups are not closed and computing the nub is typically a challenging problem. Maximal Kac-Moody groups over finite fields form a prominent family of non-discrete compactly generated simple tdlc groups. In this paper we give a complete description of the nub of any element in these groups.}}, author = {{Bischof, Sebastian and Marquis, Timothée}}, title = {{{Describing the nub in maximal Kac-Moody groups}}}, year = {{2025}}, } @unpublished{63568, abstract = {{In this article we work out the details of flat groups of the automorphism group of locally finite Bruhat-Tits buildings.}}, author = {{Bischof, Sebastian}}, title = {{{On flat groups in affine buildings}}}, year = {{2025}}, } @inproceedings{63571, abstract = {{Prüfungen sind ein wesentlicher Bestandteil des Mathematikunterrichts. Mündliche Prüfungsformate sind insbesondere in Abschlussprüfungen üblich, wurden aber bislang kaum untersucht. Dieses Projekt widmet sich dem Vorkommen und der Bedeutung verschiedener Wissensarten in mündlichen Prüfungen. Dazu soll auf Grundlage videografierter Prüfungsgespräche eine Taxonomie für abgefragte Wissensarten entwickelt werden. Der Vortrag präsentiert die Konzeption sowie erste Ergebnisse einer Vorstudie, die als Basis für eine vertiefte Analyse realer Prüfungen dient.}}, author = {{Hellmund, Johannes}}, booktitle = {{Beiträge zum Mathematikunterricht 2025}}, editor = {{Schick, L. and Platz, M. and Lambert, A.}}, location = {{Saarbrücken}}, pages = {{1417}}, publisher = {{WTM}}, title = {{{Mündliche Prüfungen im Mathematikunterricht – welche Arten des Wissens werden abgefragt?}}}, doi = {{10.17877/DE290R-25900}}, year = {{2025}}, } @inproceedings{63572, author = {{Demir, Caglar and Yekini, Moshood Olawale and Röder, Michael and Mahmood, Yasir and Ngonga Ngomo, Axel-Cyrille}}, booktitle = {{Lecture Notes in Computer Science}}, isbn = {{9783032060655}}, issn = {{0302-9743}}, location = {{Porto}}, publisher = {{Springer Nature Switzerland}}, title = {{{Tree-Based OWL Class Expression Learner over Large Graphs}}}, doi = {{10.1007/978-3-032-06066-2_29}}, year = {{2025}}, } @inproceedings{63575, author = {{Kapoor, Sourabh and Sharma, Arnab and Röder, Michael and Demir, Caglar and Ngonga Ngomo, Axel-Cyrille}}, booktitle = {{Lecture Notes in Computer Science}}, isbn = {{9783031945748}}, issn = {{0302-9743}}, publisher = {{Springer Nature Switzerland}}, title = {{{Robustness Evaluation of Knowledge Graph Embedding Models Under Non-targeted Attacks}}}, doi = {{10.1007/978-3-031-94575-5_15}}, year = {{2025}}, } @inproceedings{63573, author = {{Memariani, Adel and Röder, Michael and Sharma, Arnab and Demir, Caglar and Ngonga Ngomo, Axel-Cyrille}}, booktitle = {{Lecture Notes in Computer Science}}, isbn = {{9783032095268}}, issn = {{0302-9743}}, publisher = {{Springer Nature Switzerland}}, title = {{{Link Prediction Under Non-targeted Attacks: Do Soft Labels Always Help?}}}, doi = {{10.1007/978-3-032-09527-5_6}}, year = {{2025}}, } @inproceedings{63574, author = {{Zhang, Quannian and Röder, Michael and Srivastava, Nikit and KOUAGOU, N'Dah Jean and Ngonga Ngomo, Axel-Cyrille}}, booktitle = {{Proceedings of the Knowledge Capture Conference 2025}}, publisher = {{ACM}}, title = {{{Explainable Benchmarking through the Lense of Concept Learning}}}, doi = {{10.1145/3731443.3771359}}, year = {{2025}}, } @article{54970, author = {{Quack, Carolin and Bruns, Julia}}, journal = {{Frühe Bildung}}, number = {{2}}, pages = {{72--78}}, title = {{{Mathematikbezogenes Wissen, Einstellungen und Lerngelegenheiten als Einflussfaktoren der situativen Beobachtung und Wahrnehmung angehender frühpädagogischer Fachkräfte}}}, doi = {{https://doi.org/10.1026/2191-9186/a000712}}, volume = {{14}}, year = {{2025}}, } @unpublished{65018, abstract = {{Android applications collecting data from users must protect it according to the current legal frameworks. Such data protection has become even more important since in 2018 the European Union rolled out the General Data Protection Regulation (GDPR). Since app developers are not legal experts, they find it difficult to integrate privacy-aware practices into source code development. Despite these legal obligations, developers have limited tool support to reason about data protection throughout their app development process. This paper explores the use of static program slicing and software visualization to analyze privacy-relevant data flows in Android apps. We introduce SliceViz, a web tool that analyzes an Android app by slicing all privacy-relevant data sources detected in the source code on the back-end. It then helps developers by visualizing these privacy-relevant program slices. We conducted a user study with 12 participants demonstrating that SliceViz effectively aids developers in identifying privacy-relevant properties in Android apps. Our findings indicate that program slicing can be employed to identify and reason about privacy-relevant data flows in Android applications. With further usability improvements, developers can be better equipped to handle privacy-sensitive information.}}, author = {{Khedkar, Mugdha and Schlichtig, Michael and Mohan, Santhosh and Bodden, Eric}}, booktitle = {{arXiv:2503.16640}}, title = {{{Visualizing Privacy-Relevant Data Flows in Android Applications}}}, year = {{2025}}, } @inproceedings{65038, abstract = {{The rapid advancements in digital transformation have led to the emergence of dataspaces as a pivotal element for industry-wide and cross-industry data integration and interoperability across various businesses. Despite their potential, the adoption and effective utilization of dataspaces by business stakeholders remain challenging. This paper aims to address this gap by developing a comprehensive learning environment tailored for business stakeholders. Through an interview study and an analysis of the current state of research, we identify problem fields and derive key requirements for the development of the learning environment. The proposed environment includes a demonstrator and a training concept designed to enhance stakeholders' understanding and capabilities in managing and leveraging dataspaces. Our findings contribute to the body of knowledge by providing practical guidance through learning environments for the deployment of dataspaces in business contexts and highlighting areas for future research.}}, author = {{Lick, Jonas and Lamarz, Jessica and Dohmann, Friederike and Kulkarni, Pranav Jayant and Zerbin, Julian and Koldewey, Christian}}, booktitle = {{2024 6th International Conference on Control and Robotics (ICCR)}}, location = {{Yokohama, Japan }}, publisher = {{IEEE}}, title = {{{Guidance on Dataspaces: Development of a Learning Environment for Industrial SMEs}}}, doi = {{10.1109/iccr64365.2024.10927580}}, year = {{2025}}, } @article{62291, abstract = {{In [Jalowy, Kabluchko, Marynych, arXiv:2504.11593v1, 2025], the authors discuss a user-friendly approach to determine the limiting empirical zero distribution of a sequence of real-rooted polynomials, as the degree goes to $\infty$. In this note, we aim to apply it to a vast range of examples of polynomials providing a unifying source for limiting empirical zero distributions. We cover Touchard, Fubini, Eulerian, Narayana and little $q$-Laguerre polynomials as well as hypergeometric polynomials including the classical Hermite, Laguerre and Jacobi polynomials. We construct polynomials whose empirical zero distributions converge to the free multiplicative normal and Poisson distributions. Furthermore, we study polynomials generated by some differential operators. As one inverse result, we derive coefficient asymptotics of the characteristic polynomial of random covariance matrices.}}, title = {{{Zeros and exponential profiles of polynomials II: Examples}}}, doi = {{10.48550/ARXIV.2509.11248}}, year = {{2025}}, } @inproceedings{62302, abstract = {{The degree of crosslinking in unidirectional prepreg materials was investigated using differential scanning calorimetry to assess their curing behavior and thermal characteristics. To complement these measurements with a non-destructive, in-situ method, the propagation properties of guided acoustic waves in cured carbon fibre-reinforced epoxy plates were analysed. Correlations between the degree of crosslinking and acoustically determined mechanical properties were drawn to enable a future non-destructive evaluation approach.}}, author = {{Irmak, Hayrettin and Claes, Leander and Wu, Shuang and Marten, Thorsten and Tröster, Thomas}}, booktitle = {{2025 International Congress on Ultrasonics}}, isbn = {{978-3-910600-08-9}}, keywords = {{fibre-reinforced polymers, differential scanning calorimetry, degree of crosslinking, guided waves, ultrasound}}, location = {{Paderborn, Germany}}, pages = {{235–238}}, publisher = {{AMA Service GmbH}}, title = {{{Assessment of the influence of curing parameters on fibre reinforced epoxy composite properties using guided ultrasonic waves}}}, doi = {{10.5162/ultrasonic2025/c13-b3}}, year = {{2025}}, } @inproceedings{65097, author = {{Weber, Daniel and Lange, Jarren and Wallscheid, Oliver}}, booktitle = {{2025 IEEE Kiel PowerTech}}, publisher = {{IEEE}}, title = {{{Safe Reinforcement Learning-based Control for a Voltage Source Inverter Operating in an Unbalanced Grid}}}, doi = {{10.1109/powertech59965.2025.11180230}}, year = {{2025}}, } @inproceedings{65102, abstract = {{Efficient graph processing is essential for a wide range of applications. Scalability and memory access patterns are still a challenge, especially with the Breadth-First Search algorithm. This work focuses on leveraging HPC systems with multiple GPUs available in a single node with peer-to-peer functionality of the Intel oneAPI implementation of SYCL. We propose three GPU-based load-balancing methods: work-group localisation for efficient data access, even workload distribution for higher GPU occupancy, and a hybrid strided-access approach for heuristic balancing. These methods ensure performance, portability, and productivity with a unified codebase. Our proposed methodologies outperform state-of-the-art single-GPU implementations based on CUDA on synthetic RMAT graphs. We analysed BFS performance across NVIDIA A100, Intel Max 1550, and AMD MI300X GPUs, achieving a peak performance of 153.27 GTEPS on an RMAT25-64 graph using 8 GPUs on the NVIDIA A100. Furthermore, our work demonstrates the capability to handle RMAT graphs up to scale 29, achieving superior performance on synthetic graphs and competitive results on real-world datasets.}}, author = {{Olgu, Kaan and Kenter, Tobias and Nunez-Yanez, Jose and McIntosh-Smith, Simon and Deakin, Tom}}, booktitle = {{Proceedings of the SC '25 Workshops of the International Conference for High Performance Computing, Networking, Storage and Analysis}}, publisher = {{ACM}}, title = {{{Towards Efficient Load Balancing BFS on GPUs: One Code for AMD, Intel & Nvidia}}}, doi = {{10.1145/3731599.3767570}}, year = {{2025}}, } @techreport{62981, abstract = {{Otus is a high-performance computing cluster that was launched in 2025 and is operated by the Paderborn Center for Parallel Computing (PC2) at Paderborn University in Germany. The system is part of the National High Performance Computing (NHR) initiative. Otus complements the previous supercomputer Noctua 2, offering approximately twice the computing power while retaining the three node types that were characteristic of Noctua 2: 1) CPU compute nodes with different memory capacities, 2) high-end GPU nodes, and 3) HPC-grade FPGA nodes. On the Top500 list, which ranks the 500 most powerful supercomputers in the world, Otus is in position 164 with the CPU partition and in position 255 with the GPU partition (June 2025). On the Green500 list, ranking the 500 most energy-efficient supercomputers in the world, Otus is in position 5 with the GPU partition (June 2025). This article provides a comprehensive overview of the system in terms of its hardware, software, system integration, and its overall integration into the data center building to ensure energy-efficient operation. The article aims to provide unique insights for scientists using the system and for other centers operating HPC clusters. The article will be continuously updated to reflect the latest system setup and measurements. }}, author = {{Ehtesabi, Sadaf and Hossain, Manoar and Kenter, Tobias and Krawinkel, Andreas and Ostermann, Lukas and Plessl, Christian and Riebler, Heinrich and Rohde, Stefan and Schade, Robert and Schwarz, Michael and Simon, Jens and Winnwa, Nils and Wiens, Alex and Wu, Xin}}, keywords = {{Otus, Supercomputer, FPGA, PC2, Paderborn Center for Parallel Computing, Noctua 2, HPC}}, pages = {{33}}, publisher = {{Paderborn Center for Parallel Computing (PC2)}}, title = {{{Otus Supercomputer}}}, doi = {{10.48550/ARXIV.2512.07401}}, volume = {{1}}, year = {{2025}}, } @article{56131, abstract = {{This article provides a comprehensive mathematical-didactic analysis of how the highly relevant topic symmetry can be prepared for the university education of PSTs. Methodologically, the analysis is embedded in a design research cycle and serves as preparation for the actual design of learning activities. The procedure of "specifying and structuring" learning objects is used and adapted in such a way that, in addition to mathematical aspects, profession-oriented references to school mathematics are also considered. An essential result of the analysis is the formulation of so-called interface aspects to symmetry, which prove to be helpful in establishing such references. }}, author = {{Hoffmann, Max}}, journal = {{Recherches en Didactique des Mathématiques}}, number = {{2}}, pages = {{85--120}}, title = {{{Symmetry as a Topic for the University Education of Pre-Service Teachers}}}, doi = {{10.46298/rdm.14256}}, volume = {{45}}, year = {{2025}}, } @inproceedings{65246, author = {{Hoffmann, Max}}, booktitle = {{Proceedings of the Fourteenth Congress of the European Society for Research in Mathematics Education (CERME14)}}, editor = {{Bosch, Marianna and Bolondi, Giorgio and Carreira, Susana and Gaidoschik, Michael and Spagnolo, Camilla}}, pages = {{2245--2252}}, publisher = {{Free University of Bozen-Bolzano and ERME}}, title = {{{Using scriptwriting as a response format for interface tasks: Exemplary analyses in the context of symmetry}}}, year = {{2025}}, } @inproceedings{63441, author = {{Moritzer, Elmar and Brandes, Philipp and Wittler, Maurice and Claes, Leander and Wippermann, Mareen and Henning, Bernd}}, booktitle = {{40th International Conference of the Polymer Processing Society}}, keywords = {{Faser-Kunststoff-Verbunde (FKV), Faserverstärkte Kunststoffe (FVK), Organobleche, Ultraschall}}, title = {{{Non-destructive fiber-matrix adhesion measurement of glass fiber reinforced thermoplastic composite laminates using ultrasound}}}, year = {{2025}}, }