@inproceedings{61202,
abstract = {{The number of datasets on the web of data increases continuously. However, the knowledge contained therein cannot be fully utilized without finding links between the entities contained in these datasets. Equivalent entities can not be identified solely by checking the equivalence of IRIs because of the different origins and naming schemes of different data providers. Yet, such equivalences can be discovered by computing the similarity of their attributes. In this paper we propose GLIDE, an approach that links entities from two different datasets by embedding a joint model of these datasets enriched by additional relations describing the similarity of literals. The joint model is embedded into a latent vector space while paying attention to juxtaposing similar literals. We evaluate our approach against state-of-the-art algorithms using real-world datasets commonly used in link discovery literature. The results show that GLIDE outperforms all baselines on 5 of 7 datasets with perfect or near-perfect accuracy. Our approach achieves its best performance on datasets that feature several literals with similarities. Our experiments indicate that researchers should not only pay attention to equal literals in knowledge graph embedding but should also be aware of the distance between similar literals.}},
author = {{Becker, Alexander and Ngonga Ngomo, Axel-Cyrille and Sherif, Mohamed }},
booktitle = {{The Semantic Web – ISWC 2025}},
keywords = {{becker sherif enexa sailproject dice simba ngonga whale}},
title = {{{GLIDE: Knowledge Graph Linking using Distance-Aware Embeddings}}},
year = {{2025}},
}
@article{61134,
author = {{Manzoor, Ali and Speck, René and Zahera, Hamada Mohamed Abdelsamee and Saleem, Muhammad and Moussallem, Diego and Ngonga Ngomo, Axel-Cyrille}},
issn = {{2169-3536}},
journal = {{IEEE Access}},
pages = {{1--1}},
publisher = {{Institute of Electrical and Electronics Engineers (IEEE)}},
title = {{{Multilingual Relation Extraction - A Survey}}},
doi = {{10.1109/access.2025.3604258}},
year = {{2025}},
}
@inbook{61222,
author = {{Lenke, Michael and Klowait, Nils and Biere, Lea and Schulte, Carsten}},
booktitle = {{Lecture Notes in Computer Science}},
isbn = {{9783032012210}},
issn = {{0302-9743}},
publisher = {{Springer Nature Switzerland}},
title = {{{Assessing AI Literacy: A Systematic Review of Questionnaires with Emphasis on Affective, Behavioral, Cognitive, and Ethical Aspects}}},
doi = {{10.1007/978-3-032-01222-7_8}},
year = {{2025}},
}
@inproceedings{61396,
author = {{Nölle, Florian and Schmid, Hans-Joachim and Bentrup, Leon Alexander and Temmen, Katrin}},
booktitle = {{MINT-Symposium}},
location = {{Nürnberg}},
title = {{{Erfolgreich Studieren - sinnvolle Lernstrategien erlernen (Posterbeitrag)}}},
year = {{2025}},
}
@article{61445,
abstract = {{ABSTRACT In recent years, there has been an increasing awareness of the importance of incorporating diversity into research projects, focusing on both how they are conducted and their content. Funding organizations have started to require that research applicants pay attention to inclusion and diversity by considering gender dimensions and other diversity factors in their project plans and ensuring gender equality during execution. Based on an extensive literature research and expert discussions on how to develop and implement diversity strategies in large collaborative research projects, we argue that there is a lack of practical advice in existing literature. Drawing from our own experiences in conceptualizing and implementing a Diversity Program across four universities in Germany, we propose a framework for effectively integrating diversity into collaborative research initiatives across various academic fields.}},
author = {{Lorke, Mariya and Amelung, Rena and Kuchling, Peter and Paaßen, Benjamin and Pein-Hackelbusch, Miriam and Schloots, Franziska Margarete and Schulz, Klara and Nauerth, Annette}},
journal = {{Diversity & Inclusion Research}},
keywords = {{collaborative research projects, diversity strategy, gender equality}},
number = {{4}},
pages = {{e70040}},
title = {{{Development and Implementation of Diversity Programs in Large Collaborative Research Projects: An Example From Germany}}},
doi = {{https://doi.org/10.1002/dvr2.70040}},
volume = {{2}},
year = {{2025}},
}
@inproceedings{60970,
author = {{Hebrok, Sven Niclas and Storm, Tim Leonhard and Cramer, Felix Matthias and Radoy, Maximilian Manfred and Somorovsky, Juraj}},
booktitle = {{34th USENIX Security Symposium}},
title = {{{STEK Sharing is Not Caring: Bypassing TLS Authentication in Web Servers using Session Tickets}}},
year = {{2025}},
}
@article{61471,
author = {{Governatori, Guido and Turhan, Anni-Yasmin}},
journal = {{Theory Pract. Log. Program.}},
number = {{2}},
pages = {{132–133}},
title = {{{Introduction to the Special Issue on Logic Rules and Reasoning: Selected Papers From the 6th International Joint Conference on Rules and Reasoning (RuleML+RR 2022)}}},
doi = {{10.1017/S1471068425000079}},
volume = {{25}},
year = {{2025}},
}
@unpublished{59794,
abstract = {{The depth of networks plays a crucial role in the effectiveness of deep learning. However, the memory requirement for backpropagation scales linearly with the number of layers, which leads to memory bottlenecks during training. Moreover, deep networks are often unable to handle time-series data appearing at irregular intervals. These issues can be resolved by considering continuous-depth networks based on the neural ODE framework in combination with reversible integration methods that allow for variable time-steps. Reversibility of the method ensures that the memory requirement for training is independent of network depth, while variable time-steps are required for assimilating time-series data on irregular intervals. However, at present, there are no known higher-order reversible methods with this property. High-order methods are especially important when a high level of accuracy in learning is required or when small time-steps are necessary due to large errors in time integration of neural ODEs, for instance in context of complex dynamical systems such as Kepler systems and molecular dynamics. The requirement of small time-steps when using a low-order method can significantly increase the computational cost of training as well as inference. In this work, we present an approach for constructing high-order reversible methods that allow adaptive time-stepping. Our numerical tests show the advantages in computational speed when applied to the task of learning dynamical systems.}},
author = {{Maslovskaya, Sofya and Ober-Blöbaum, Sina and Offen, Christian and Singh, Pranav and Wembe Moafo, Boris Edgar}},
title = {{{Adaptive higher order reversible integrators for memory efficient deep learning}}},
year = {{2025}},
}
@article{60891,
abstract = {{Straight dielectric waveguide channels made from slabs of thin-film lithium niobate (TFLN), or lithium niobate on insulator (LNOI), are investigated in the linear regime, for channels of rib and strip type with common trapezoidal cross sections, in Z-cut and X-cut samples at varying on-chip orientation. We clarify the theoretical basis for the waveguides with potentially non-diagonal core permittivity. Symmetry classes can be distinguished that differ in their consequences for potential modal degeneracy and polarization conversion. Our rigorous numerical analysis by means of a finite-element solver takes the anisotropy of the lithium niobate cores rigorously into account. We discuss extensive data for effective indices, polarization properties, and hybridization of guided modes, in single- and multimode channels. Scans over the waveguide width and orientation as primary parameters are complemented by a series of illustrations of vectorial mode profiles. These turn out to be essentially complex in cases of X-cut channels at non-crystal-axis-aligned orientations.}},
author = {{Hammer, Manfred and Khan, Shahriar and Taheri, Behnood and Farheen, Henna and Förstner, Jens}},
issn = {{2770-0208}},
journal = {{Optics Continuum}},
keywords = {{tet_topic_waveguide}},
number = {{10}},
pages = {{2356}},
publisher = {{Optica Publishing Group}},
title = {{{TFLN channel waveguides of rib and strip type: Properties of guided modes}}},
doi = {{10.1364/optcon.569959}},
volume = {{4}},
year = {{2025}},
}
@article{61518,
abstract = {{Abstract
Teacher professional development (TPD) is a crucial support mechanism for mathematics teachers. Strategies for implementing TPD include disseminating educative curriculum materials or conducting TPD courses. However, it remains unclear whether different implementations of the same TPD support mathematics teachers in distinct ways. This study investigated two implementations of the TPD EmMa-FS which focuses early mathematics education (EME) for German vocational school (VS) teachers who instruct prospective early childhood (EC) educators. One group of teachers received an in-person TPD course along with educative curriculum materials (n
PM
= 26), whereas the other received only the educative curriculum materials (n
M
= 15). The effects on VS teachers’ beliefs and knowledge concerning EME were examined using a t-test and repeated measures ANOVA. To assess how teachers in the different implementation groups made use of the TPD in their lesson planning, participants submitted hypothetical lesson sequences on early numeracy, which were analysed for instructional quality, covered content, and the visible implementation of the provided educative curriculum materials using qualitative content analysis. The results indicated that both TPD implementations positively affected VS teachers’ knowledge related to EME but not their beliefs. While the instructional quality of the lesson sequences varied across both groups, participants who received the TPD course appeared to use the educative curriculum materials more often and to cover more content.}},
author = {{Richter, Alix and Bruns, Julia and Gasteiger, Hedwig}},
issn = {{0173-5322}},
journal = {{Journal für Mathematik-Didaktik}},
number = {{1}},
publisher = {{Springer Science and Business Media LLC}},
title = {{{Interaction- or Material-Centred Implementation of Teacher Professional Development: a Comparison of Teachers’ Competence Development and Potential Lesson Planning Lehrkräftefortbildung interaktions- oder materialzentriert implementieren: Ein Vergleich hinsichtlich der Kompetenzentwicklung sowie der potentiellen Unterrichtsplanung von Lehrkräften}}},
doi = {{10.1007/s13138-025-00259-7}},
volume = {{46}},
year = {{2025}},
}
@article{61519,
abstract = {{ Zusammenfassung: Frühe mathematische Bildung, die ihren Ausgangspunkt in den (Spiel-)Situationen der Kindertagesstätte nimmt, kann breite mathematische Erfahrungen ermöglichen, wenn die (Spiel-)Situationen entsprechende Möglichkeiten bieten. Erste Studien weisen darauf hin, dass in diesen Situationen verschiedene mathematische Inhalte angesprochen werden können. Allerdings konzentrieren sich bisherige Studien auf ausgewählte Kontexte oder Inhaltsbereiche. Diese Studie zielt daher auf eine vertiefte Analyse der Gelegenheiten für mathematische Erfahrungen, die in verschiedenen (Spiel-)Situationen im Alltag der Kindertagesstätte entstehen können. Dazu wurde eine videobasierte Beobachtungsstudie mittels einer Action-Kamera in einer Kindertagesstätte durchgeführt. Die Ergebnisse zeigen, dass eine Vielfalt von mathematischen Inhalten in (Spiel-)Situationen in der Kindertagesstätte beobachtet werden kann, einzelne Inhalte jedoch nur in formellen Lernsituationen auftreten. }},
author = {{Bruns, Julia and Mette, Tessa}},
issn = {{2191-9186}},
journal = {{Frühe Bildung}},
number = {{4}},
pages = {{193--200}},
publisher = {{Hogrefe Publishing Group}},
title = {{{Mathematik mit Kindern ausgehend von Spiel- und Routinesituationen in der Kindertagesstätte erkunden?}}},
doi = {{10.1026/2191-9186/a000730}},
volume = {{14}},
year = {{2025}},
}
@inbook{61537,
author = {{Schloots, Franziska Margarete}},
booktitle = {{Virtuelles Essen- Interdisziplinäre Perspektiven auf Ernährungspraktiken im digitalen Zeitalter}},
editor = {{Jürgens, Jane Lia and Lewandowski, Kira and Aßmann, Sandra}},
isbn = {{978-3-8394-7633-8}},
keywords = {{Selbstvermessung, Wearables, Diet Tracking, Quantifizierung}},
pages = {{225--251}},
publisher = {{transcript Verlag}},
title = {{{Essen nach Zahlen - Die Quantifizierung von Ernährung im Alltag}}},
doi = {{10.14361/9783839476338}},
year = {{2025}},
}
@article{61546,
abstract = {{Fuzzing is a powerful software testing technique renowned for its effectiveness in identifying software vulnerabilities. Traditional fuzzing evaluations typically focus on overall fuzzer performance across a set of target programs, yet few benchmarks consider how fine-grained program features influence fuzzing effectiveness. To bridge this gap, we introduce FeatureBench, a novel benchmark designed to generate programs with configurable, fine-grained program features to enhance fuzzing evaluations. We reviewed 25 recent grey-box fuzzing studies, extracting 7 program features related to control-flow and data-flow that can impact fuzzer performance. Using these features, we generated a benchmark consisting of 153 programs controlled by 10 fine-grained configurable parameters. We evaluated 11 fuzzers using this benchmark, with each fuzzer representing either distinct claimed improvements or serving as a widely used baseline in fuzzing evaluations. The results indicate that fuzzer performance varies significantly based on the program features and their strengths, highlighting the importance of incorporating program characteristics into fuzzing evaluations.}},
author = {{Miao, Miao and Kummita, Sriteja and Bodden, Eric and Wei, Shiyi}},
issn = {{2994-970X}},
journal = {{Proceedings of the ACM on Software Engineering}},
number = {{ISSTA}},
pages = {{527--549}},
publisher = {{Association for Computing Machinery (ACM)}},
title = {{{Program Feature-Based Benchmarking for Fuzz Testing}}},
doi = {{10.1145/3728899}},
volume = {{2}},
year = {{2025}},
}
@inproceedings{61760,
abstract = {{We present a topology-optimized silicon nitride (Si3N4) coupler designed to enhance the coupling efficiency between integrated single-photon emitters and photonic waveguide modes. By leveraging inverse design techniques, we optimize the coupler’s geometry to maximize power transfer while maintaining fabrication feasibility by improving mode overlap and directional emission, addressing the challenge of low coupling efficiency caused by size mismatch and material incompatibility. Simulations demonstrate a substantial enhancement in photon extraction and waveguide coupling. This approach can be extended to other photonic devices, offering a versatile framework for improving quantum light-matter interactions in integrated photonics.}},
author = {{Farheen, Henna and Chen, Yuheng and Chen, Peigang and Kryvobok, Artem and Peana, Samuel and Senichev, Alexander and Shalaev, Vladimir M. and Boltasseva, Alexandra and Förstner, Jens and Kildishev, Alexander V.}},
booktitle = {{Photonic Computing: From Materials and Devices to Systems and Applications II}},
editor = {{Ni, Xingjie and Cai, Wenshan}},
keywords = {{tet_topic_waveguide}},
publisher = {{SPIE}},
title = {{{Topology-optimized silicon nitride coupler for integrated single-photon emitters}}},
doi = {{10.1117/12.3065734}},
year = {{2025}},
}
@article{61770,
author = {{Kirschbaum, Julia and Divkovic, Denis and Meschede, Henning}},
issn = {{0306-2619}},
journal = {{Applied Energy}},
publisher = {{Elsevier BV}},
title = {{{From demand to action: Analysing building emissions and refurbishment scenarios towards climate neutrality}}},
doi = {{10.1016/j.apenergy.2025.126302}},
volume = {{396}},
year = {{2025}},
}
@article{61775,
author = {{Liu, Gaosheng and Yıldırım, Kasım Sinan and Wang, Lin}},
issn = {{1536-1233}},
journal = {{IEEE Transactions on Mobile Computing}},
pages = {{1--14}},
publisher = {{Institute of Electrical and Electronics Engineers (IEEE)}},
title = {{{FreeBeacon: Efficient Communication and Data Aggregation in Battery-Free IoT}}},
doi = {{10.1109/tmc.2025.3614227}},
year = {{2025}},
}
@article{57472,
abstract = {{In this paper we introduce, in a Hilbert space setting, a second order dynamical system with asymptotically vanishing damping and vanishing Tikhonov regularization that approaches a multiobjective optimization problem with convex and differentiable components of the objective function. Trajectory solutions are shown to exist in finite dimensions. We prove fast convergence of the function values, quantified in terms of a merit function. Based on the regime considered, we establish both weak and, in some cases, strong convergence of trajectory solutions toward a weak Pareto optimal solution. To achieve this, we apply Tikhonov regularization individually to each component of the objective function. This work extends results from single objective convex optimization into the multiobjective setting.}},
author = {{Bot, Radu Ioan and Sonntag, Konstantin}},
journal = {{Journal of Mathematical Analysis and Applications}},
keywords = {{Pareto optimization, Lyapunov analysis, gradient-like dynamical systems, inertial dynamics, asymptotic vanishing damping, Tikhonov regularization, strong convergence}},
title = {{{Inertial dynamics with vanishing Tikhonov regularization for multobjective optimization}}},
year = {{2025}},
}
@article{61859,
author = {{Jonas-Ahrend, Gabriela and Tenberg, Ralf}},
journal = {{Journal of Education for Teaching}},
title = {{{Teacher shortage in Germany - overview and insights}}},
doi = {{https://doi.org/10.1080/02607476.2025.2572577}},
year = {{2025}},
}
@article{61874,
abstract = {{
We study descriptive complexity of counting complexity classes in the range from #P to
\({\text{#}\!\cdot\!\text{NP}}\)
. The proof of Fagin’s characterization of NP by existential second-order logic generalizes to the counting setting in the following sense: The class #P can be logically described as the class of functions counting satisfying assignments to free relation variables in first-order formulae. This was first observed by Saluja et al. (1995). In this paper we extend this study to classes beyond #P and extensions of first-order logic with team semantics. These team-based logics are closely related to existential second-order logic and its fragments, hence our results also shed light on the complexity of counting for extensions of first-order logic in Tarski’s semantics. Our results show that the class
\({\text{#}\!\cdot\!\text{NP}}\)
can be logically characterized by independence logic and existential second-order logic, whereas dependence logic and inclusion logic give rise to subclasses of
\({\text{#}\!\cdot\!\text{NP}}\)
and #P , respectively. We further relate the class obtained from inclusion logic to the complexity class
\({\text{TotP}} \subseteq{\text{#P}}\)
.
}},
author = {{Haak, Anselm and Kontinen, Juha and Müller, Fabian and Vollmer, Heribert and Yang, Fan}},
issn = {{1529-3785}},
journal = {{ACM Transactions on Computational Logic}},
publisher = {{Association for Computing Machinery (ACM)}},
title = {{{Counting of Teams in First-Order Team Logics}}},
doi = {{10.1145/3771721}},
year = {{2025}},
}
@inproceedings{61873,
author = {{Khanteimouri, Payam and Campen, Marcel}},
booktitle = {{Proceedings of the 2025 SIAM International Meshing Roundtable}},
isbn = {{9781611978575}},
publisher = {{Society for Industrial and Applied Mathematics}},
title = {{{C1-Smooth Parametrization of Polynomial Shapes over Polygonal Domains}}},
doi = {{10.1137/1.9781611978575.9}},
year = {{2025}},
}