@inbook{65670, abstract = {{Ensuring the veracity of assertions is {vital for building reliable and consistent knowledge graphs}. A variety of automatic fact-checking approaches have been proposed over the past decade. Among these, path-based fact-checking approaches are particularly attractive due to their independence of supplementary external knowledge and their faster runtimes compared to methods reliant on external corpora or embeddings. However, the effectiveness of these approaches is fundamentally limited by the incompleteness of existing knowledge graphs, which often lack the paths necessary to support or refute assertions. To address this limitation, we propose \system{}, a framework that supplements the knowledge graph with shallow knowledge---automatically extracted RDF assertions from external unstructured sources---even if this additional knowledge may not always fit a well-defined ontology nor be fully verified. By appending such shallow knowledge, we enhance the graph’s coverage and increase the chances of finding relevant evidence for fact checking. Comprehensive experiments on three widely used benchmark datasets demonstrate that integrating \system{} consistently and significantly enhances the performance of {state-of-the-art path-based fact-checking approaches}, yielding improvements of up to 0.24 in Area Under the Receiver Operating Characteristic Curve (AUROC). These results establish \system{} as a broadly applicable auxiliary component for improving the reliability and coverage of automatic fact checking in knowledge graphs. Our code is open-source and can be found at \url{https://github.com/dice-group/ShallKnow}.}}, author = {{Qudus, Umair and Pokharel, Neha and Röder, Michael and Ngonga Ngomo, Axel-Cyrille}}, booktitle = {{Lecture Notes in Computer Science}}, isbn = {{9783032251558}}, issn = {{0302-9743}}, keywords = {{fact checking}}, publisher = {{Springer Nature Switzerland}}, title = {{{No Need to Be a Know-It-All: Fact Checking with Shallow Knowledge}}}, doi = {{10.1007/978-3-032-25156-5_23}}, year = {{2026}}, } @inproceedings{65566, author = {{Haak, Anselm and Koopmann, Patrick and Mahmood, Yasir and Turhan, Anni-Yasmin}}, location = {{Lisbon}}, title = {{{ABox Abduction for Inconsistent Knowledge Bases under Repair Semantics}}}, year = {{2026}}, } @article{65682, author = {{Vernholz, Mats and Sims, Craig and Treagust, David}}, journal = {{Education Sciences}}, number = {{5}}, pages = {{782}}, title = {{{From Time-Saving to Skill-Building: Reframing Generative AI for Lesson-Planning—A Conceptual Design Paper}}}, doi = {{https://doi.org/10.3390/educsci16050782}}, volume = {{16}}, year = {{2026}}, } @inproceedings{64211, author = {{Wiebe, Vivien and Häsel-Weide, Uta}}, booktitle = {{Proceedings of the Nineteenth ERME Topic Conference: Connecting the Learning of Mathematics Teaching to Practice}}, editor = {{Mosvold, R. and Fauskanger, J. and Ferretti, F. and Vondrová, N.}}, location = {{Prag}}, pages = {{122--129}}, title = {{{ Initiating and establishing mathematical practices of determining and transforming numbers as a foundational skill in fostering mathematics teaching}}}, year = {{2026}}, } @article{65733, abstract = {{Abstract In this paper, we study the computation of shortest paths within the geometric amoebot model , a commonly used model for programmable matter. Shortest paths are essential for various tasks and therefore have been heavily investigated in many different contexts. We consider the reconfigurable circuit extension of the model where the amoebot structure is able to interconnect amoebots by so-called circuits. These circuits permit the instantaneous transmission of simple signals between connected amoebots. We propose distributed algorithms for the shortest path forest problem where, given a set of k sources and a set of $$\ell $$ ℓ destinations, the amoebot structure has to compute a forest that connects each destination to its closest source on a shortest path. Our main results are two algorithms for hole-free structures. The first algorithm constructs a shortest path tree for a single source within $$O(\log \ell )$$ O ( log ℓ ) rounds, and the second algorithm a shortest path forest for an arbitrary number of sources within $$O(\log n \log ^2 k)$$ O ( log n log 2 k ) rounds. The former algorithm also provides an O (1) rounds solution for the single pair shortest path problem (SPSP) and an $$O(\log n)$$ O ( log n ) rounds solution for the single source shortest path problem (SSSP) since these problems are special cases of the considered problem. Then, we adapt the latter algorithm to an offset version of the problem. This allows us to solve the problem for amoebot structures with holes within $$O(h \log ^3 n)$$ O ( h log 3 n ) rounds w.h.p. where h denotes the number of holes. }}, author = {{Padalkin, Andreas and Scheideler, Christian}}, issn = {{0178-2770}}, journal = {{Distributed Computing}}, number = {{2}}, publisher = {{Springer Science and Business Media LLC}}, title = {{{Polylogarithmic time algorithms for shortest path forests in programmable matter}}}, doi = {{10.1007/s00446-026-00505-2}}, volume = {{39}}, year = {{2026}}, } @article{65745, abstract = {{Abstract In this work, we address the numerical identification of entanglement in dynamical scenarios. To this end, we consider different programs based on the restriction of the evolution to the set of separable (i.e., non-entangled) states, together with the discretization of the space of variables for numerical computations. As a first approach, we apply linear splitting methods to the restricted, continuous equations of motion derived from variational principles. We utilize an exchange interaction Hamiltonian to confirm that the numerical and analytical solutions coincide in the limit of small time steps. The application to different Hamiltonians shows the wide applicability of the method to detect dynamical entanglement. To avoid the derivation of analytical solutions for complex dynamics, we consider variational, numerical integration schemes, introducing a variational discretization for Lagrangians linear in velocities. Here, we examine and compare two approaches: one in which the system is discretized before the restriction is applied, and another in which the restriction precedes the discretization. We find that the "first-discretize-then-restrict" method becomes numerically unstable, already for the example of an exchange-interaction Hamiltonian, which can be an important consideration for the numerical analysis of constrained quantum dynamics. Thereby, broadly applicable numerical tools, including their limitations, for studying entanglement over time are established for assessing the entangling power of processes that are used in quantum information theory.}}, author = {{Offen, Christian and Wembe, Boris and Ares, Laura and Sperling, Jan and Ober-Blöbaum, Sina}}, issn = {{1751-8113}}, journal = {{Journal of Physics A: Mathematical and Theoretical}}, publisher = {{IOP Publishing}}, title = {{{Numerical approaches to entangling dynamics from variational principles}}}, doi = {{10.1088/1751-8121/ae6d51}}, year = {{2026}}, } @article{65742, abstract = {{Abstract In this work, we address the numerical identification of entanglement in dynamical scenarios. To this end, we consider different programs based on the restriction of the evolution to the set of separable (i.e., non-entangled) states, together with the discretization of the space of variables for numerical computations. As a first approach, we apply linear splitting methods to the restricted, continuous equations of motion derived from variational principles. We utilize an exchange interaction Hamiltonian to confirm that the numerical and analytical solutions coincide in the limit of small time steps. The application to different Hamiltonians shows the wide applicability of the method to detect dynamical entanglement. To avoid the derivation of analytical solutions for complex dynamics, we consider variational, numerical integration schemes, introducing a variational discretization for Lagrangians linear in velocities. Here, we examine and compare two approaches: one in which the system is discretized before the restriction is applied, and another in which the restriction precedes the discretization. We find that the "first-discretize-then-restrict" method becomes numerically unstable, already for the example of an exchange-interaction Hamiltonian, which can be an important consideration for the numerical analysis of constrained quantum dynamics. Thereby, broadly applicable numerical tools, including their limitations, for studying entanglement over time are established for assessing the entangling power of processes that are used in quantum information theory.}}, author = {{Offen, Christian and Wembe, Boris and Ares, Laura and Sperling, Jan and Ober-Blöbaum, Sina}}, issn = {{1751-8113}}, journal = {{Journal of Physics A: Mathematical and Theoretical}}, publisher = {{IOP Publishing}}, title = {{{Numerical approaches to entangling dynamics from variational principles}}}, doi = {{10.1088/1751-8121/ae6d51}}, year = {{2026}}, } @inproceedings{65746, abstract = {{This paper presents a class of structure-preserving numerical methods for quantum optimal control problems, based on commutator-free Cayley integrators. Starting from the Krotov framework, we reformulate the forward and backward propagation steps using Cayley-type schemes that preserve unitarity and symmetry at the discrete level. This approach eliminates the need for matrix exponentials and commutators, leading to significant computational savings while maintaining higher-order accuracy. We first recall the standard linear setting and then extend the formulation to nonlinear Schrödinger and Gross-Pitaevskii equations using a Cayley-polynomial interpolation strategy. Numerical experiments on state-transfer problems illustrate that the CF-Cayley method achieves the same accuracy as high-order exponential or Cayley-Magnus schemes at substantially lower cost, especially for longtime or highly oscillatory dynamics. In the nonlinear regime, the structure-preserving properties of the method ensure stability and norm conservation, making it a robust tool for large-scale quantum control simulations. The proposed framework thus bridges geometric integration and optimal control, offering an efficient and reliable alternative to existing exponential-based propagators.}}, author = {{Wembe Moafo, Boris Edgar and Ali, Usman and Meier, Torsten and Ober-Blöbaum, Sina}}, location = {{Reykjavík, Iceland}}, title = {{{Cayley Commutator-free Methods for Krotov-Type Algorithms in Quantum Optimal Control}}}, doi = {{10.48550/ARXIV.2603.11697}}, year = {{2026}}, } @unpublished{65744, abstract = {{Optimal control problems with symmetries often admit a non stationary turnpike property called trim turnpike, which characterizes the convergence of optimal solutions to certain symmetry induced trajectories called trim primitives. In this paper we establish an exponential trim turnpike property for a class of optimal control problems with structural properties related to Abelian Lie group symmetries. The key ingredient of our approach is the introduction of an appropriate reduced optimal control problem. We show that extremals of the original problem can be characterized through a reduced Hamiltonian boundary value problem that coincides with the optimality system of the reduced problem. Under a hyperbolicity assumption on the equilibrium of the corresponding reduced Hamiltonian system we prove that optimal trajectories remain exponentially close, up to boundary layers near the endpoints, to a trim primitive defined by the static reduced problem. The theoretical results are illustrated on three representative examples: linear and nonlinear problems with quadratic cost and the Kepler orbital transfer problem.}}, author = {{Maslovskaya, Sofya and Ober-Blöbaum, Sina and Wembe Moafo, Boris Edgar}}, title = {{{Non static exponential turnpike property for optimal control problems with symmetries and boundary conditions}}}, year = {{2026}}, } @article{65747, abstract = {{In this work, we address the numerical identification of entanglement in dynamical scenarios. To this end, we consider different programs based on the restriction of the evolution to the set of separable (i.e., non-entangled) states, together with the discretization of the space of variables for numerical computations. As a first approach, we apply linear splitting methods to the restricted, continuous equations of motion derived from variational principles. We utilize an exchange interaction Hamiltonian to confirm that the numerical and analytical solutions coincide in the limit of small time steps. The application to different Hamiltonians shows the wide applicability of the method to detect dynamical entanglement. To avoid the derivation of analytical solutions for complex dynamics, we consider variational, numerical integration schemes, introducing a variational discretization for Lagrangians linear in velocities. Here, we examine and compare two approaches: one in which the system is discretized before the restriction is applied, and another in which the restriction precedes the discretization. We find that the "first-discretize-then-restrict" method becomes numerically unstable, already for the example of an exchange-interaction Hamiltonian, which can be an important consideration for the numerical analysis of constrained quantum dynamics. Thereby, broadly applicable numerical tools, including their limitations, for studying entanglement over time are established for assessing the entangling power of processes that are used in quantum information theory.}}, author = {{Offen, Christian and Wembe, Boris and Ares, Laura and Sperling, Jan and Ober-Blöbaum, Sina}}, issn = {{1751-8113}}, journal = {{Journal of Physics A: Mathematical and Theoretical}}, publisher = {{IOP Publishing}}, title = {{{Numerical approaches to entangling dynamics from variational principles}}}, doi = {{10.1088/1751-8121/ae6d51}}, year = {{2026}}, } @inbook{65749, abstract = {{Abstract Phase noise is one of the most important properties of oscillators that limit the capacity of high-frequency communication systems. In heterodyne conversion schemes, the phase noise of the local oscillator will be multiplied and up-converted to the transmission channel. Therefore, accurate characterization of the oscillators is highly important for the design of THz communication systems. Especially when it comes to the characterization of high-quality oscillators with extremely low phase noise, traceable measurement methods are not available. In this chapter, the mathematical model and definition of the amplitude noise (AM noise) and phase noise (PM noise) are given. Different phase noise definition standards such as single sideband (SSB) and double sideband will also be provided. Phase noise measurement techniques such as frequency discrimination and phase-locked loop (PLL) technique will be discussed. The standard two-channel cross correlation for statistical analysis of phase noise at levels below the detection limit of the phase noise receiver will be explained with mathematical formalism.}}, author = {{Bahmanian, Meysam and Scheytt, J. Christoph and Meyne, Nora and Kleine-Ostmann, Thomas}}, booktitle = {{Springer Series in Optical Sciences}}, isbn = {{9783032019851}}, issn = {{0342-4111}}, publisher = {{Springer Nature Switzerland}}, title = {{{Phase Noise Metrology}}}, doi = {{10.1007/978-3-032-01986-8_4}}, year = {{2026}}, } @inbook{65748, abstract = {{Abstract In this chapter, the precision of optical clocks based on mode-locked laser (MLL) is compared with more conventional types of clock sources. It is shown that the phase noise of the optical pulse train from the MLL can be better than other types of clock sources by orders of magnitude. Then, an abstract representation of frequency synthesizer is demonstrated. Different techniques for RF generation using MLL are shown, and their pros and cons are discussed. Finally, a comparison of all these techniques is made with respect to their phase noise and capability to generate RF signal with different frequencies for different applications.}}, author = {{Bahmanian, Meysam and Scheytt, J. Christoph}}, booktitle = {{Springer Series in Optical Sciences}}, isbn = {{9783032019851}}, issn = {{0342-4111}}, publisher = {{Springer Nature Switzerland}}, title = {{{Frequency Synthesis Based on MLLs}}}, doi = {{10.1007/978-3-032-01986-8_28}}, year = {{2026}}, } @inbook{65755, author = {{Twardzik, Jan Luca and Humpert, Lynn and Cichon, Gerrit and Dumitrescu, Roman}}, booktitle = {{Lecture Notes in Mechanical Engineering}}, isbn = {{9783032211569}}, issn = {{2195-4356}}, publisher = {{Springer Nature Switzerland}}, title = {{{Knowledge Gaps in Circular Product Development: A Systematic Literature Review of the Manufacturing Industry}}}, doi = {{10.1007/978-3-032-21157-6_39}}, year = {{2026}}, } @article{65757, abstract = {{Electrifying the heating sector is essential for achieving global climate targets like the Paris Agreement’s 1.5 °C goal. In Germany, where 80 % of household energy goes to space heating and hot water, shifting to low-carbon solutions is crucial. Fossil-fuelled district heating networks can incorporate renewable energy via heat pumps, improving efficiency. Although heat pump design typically favours minimal temperature lifts, higher lifts can be economically viable with low electricity prices and abundant renewables. Adding thermal energy storage boosts operational flexibility. This study explores a flexible heat pump operation incorporating part load behaviour with a thermal energy storage in a German city’s district heating system to minimise costs and carbon dioxide emissions. Using a mixed-integer linear programming model, it examines the impact of temperature adjustments and storage on system efficiency. The results show that the integration of a heat pump in a district heating system reduces operating costs. Compared to a supply without a heat pump, with levelised cost of heating of 9.98 cent/kWhth and a fixed operating mode with costs between 9.96 cent/kWhth and 11.49 cent/kWhth, the flexible use results in lowest costs of 9.85 cent/kWhth, while also reducing overall CO2 emissions. Using a full factorial sensitivity analysis, the levelised cost of heating ranged between 9.15 cent/kWhth in the best case and 10.37 cent/kWhth in the worst case for the selected configuration.}}, author = {{Rahlf, Henning Christoph and Divkovic, Denis and Knorr, Lukas and Schlosser, Florian and Meschede, Henning}}, issn = {{0196-8904}}, journal = {{Energy Conversion and Management}}, keywords = {{Heat transition, Optimisation, Temperature flexibility, Decarbonisation, Multi energy}}, publisher = {{Elsevier BV}}, title = {{{Flexible operation strategies for heat pumps in district heating systems using dynamic electricity prices}}}, doi = {{10.1016/j.enconman.2026.121714}}, volume = {{364}}, year = {{2026}}, } @article{63838, abstract = {{Industrial electrification is increasing to reduce fossil fuel dependence, alongside a growing share of volatile renewables. A secure and reliable energy supply is crucial for industry, leading to a shift from centralised to decentralised grid structures. DC microgrids becoming increasingly popular in industry, since they enable energy recuperation from braking, reduce components and cables, and integrate storage and local generation to manage supply interruptions or peak loads. EVs add further synergies by serving as mobile storage units, helping to store and redistribute locally generated renewable energy. This paper analyses how EV integration in droop-controlled DC grids can contribute to a more stable, low-emission and peak-reduced load profile to the supply grid through load shifting and bridge interruptions. A droop-controlled DC grid model has been developed, incorporating an EV charging park based on probability functions. Scalable scenarios allow for diverse condition analysis using an energy management system that utilises fuzzy logic and sequential MILP optimisation. It has been shown that a 7% improvement of coefficient represented grid-serving behaviour is possible by load shifting. It has also been demonstrated that an optimised EMS can reduce the demand-based CO2 emissions by 41kg for a representative day compared to a fuzzy logic EMS. At the same time peak load is decreased yielding a more constant residual load. These results highlight the potential of a controlled bidirectional charging infrastructure in DC grids and underscore the need to explicitly consider charging processes to ensure a residual load as constant as possible.}}, author = {{Rahlf, Henning Christoph and Knorr, Lukas and Althoff, Simon and Meschede, Henning}}, issn = {{2666-9552}}, journal = {{Smart Energy}}, keywords = {{DC-grid, Droop control, Grid-serving behaviour, Grid stability, Bidirectional charging, Sequential decision, MILP optimisation}}, publisher = {{Elsevier BV}}, title = {{{Analysis of bidirectional EV charging infrastructures within industrial DC grids}}}, doi = {{10.1016/j.segy.2026.100227}}, year = {{2026}}, } @article{65785, abstract = {{Simulation-based design of high-power ultrasonic systems depends on the accurate modelling of the electromechanical behaviour of piezoceramic materials. In practical transducer applications, the relevant operating points are influenced by mechanical preload and heating, both of which give rise to changes in the elastic, dielectric, and piezoelectric material properties. Material parameters identified under idealised, unloaded conditions are therefore insufficient to represent piezoceramic material behaviour under realistic operating conditions. To overcome this limitation, experimental setups are developed that enable the measurement of electrical impedance spectra under controlled thermal and mechanical conditions. The acquired impedance data are used in an inverse identification procedure, in which the behaviour of a finite element forward model is iteratively fitted to the measurements using a block coordinate descent optimisation strategy guided by a sensitivity analysis. This yields effective linear material parameters as a function of temperature and mechanical stress at varying operating points. The identified temperature-dependent parameters, for instance, can be employed in a coupled thermo-electromechanical simulation framework to predict the temperature-dependent material behaviour during operation. The linear identification based on varying operation points provides an initial approximation of the nonlinear material response, establishing a basis for the development of corresponding nonlinear material models.}}, author = {{Friesen, Olga and Claes, Leander and Hölscher, Jonas and Henning, Bernd and Scheidemann, Claus and Hemsel, Tobias and Kuess, Raphael and Walther, Andrea and Spieker, Carsten and Förstner, Jens}}, issn = {{0171-8096}}, journal = {{tm - Technisches Messen}}, keywords = {{tet_topic_piezo}}, publisher = {{Walter de Gruyter GmbH}}, title = {{{Measurement of multiphysical material parameters of piezoceramic components for high-power ultrasonic applications}}}, doi = {{10.1515/teme-2026-0042}}, year = {{2026}}, } @inproceedings{65588, author = {{Spieker, Carsten and Kuess, Raphael and Walther, Andrea and Förstner, Jens}}, booktitle = {{Fortschritte der Akustik - DAGA 2026}}, keywords = {{tet_topic_piezo}}, pages = {{1066–1069}}, title = {{{Modellierung und Simulation des temperaturabhängigen Materialverhaltens von Piezokeramiken mit FEniCS}}}, doi = {{10.71568/DAGA2026.549}}, year = {{2026}}, } @inproceedings{65825, author = {{Kürpick, Dominik and Hovemann, Aschot and Kürpick, Christian and Gabriel, Stefan and Lick, Jonas and Dumitrescu, Roman}}, booktitle = {{2025 International Conference on Intelligent & Innovative Practices in Engineering & Management (IIPEM)}}, publisher = {{IEEE}}, title = {{{AI-Based Enterprise Architecture Management in Engineering Domain: A Systematic Literature Review}}}, doi = {{10.1109/iipem65914.2025.11548261}}, year = {{2026}}, } @inbook{65835, author = {{Koldewey, Christian and Avermeyer, Celina Maleen and van der Valk, Hendrik and Zerbin, Julian and Dumitrescu, Roman}}, booktitle = {{Lecture Notes in Computer Science}}, isbn = {{9783032283122}}, issn = {{0302-9743}}, publisher = {{Springer Nature Switzerland}}, title = {{{Fundamental Patterns – A Taxonomy for Archetype Development in Information Systems}}}, doi = {{10.1007/978-3-032-28313-9_18}}, year = {{2026}}, } @article{65834, author = {{Humpert, Lynn and Disselkamp, Jan-Philipp and Cichon, Gerrit and Anacker, Harald and Dumitrescu, Roman}}, issn = {{0360-8581}}, journal = {{IEEE Engineering Management Review}}, pages = {{1--22}}, publisher = {{Institute of Electrical and Electronics Engineers (IEEE)}}, title = {{{Systematic Approach to Early Validation Based on the System Architecture of Advanced Systems in the B2B Sector}}}, doi = {{10.1109/emr.2026.3700482}}, year = {{2026}}, }