@inproceedings{59088,
abstract = {{This paper deals with the implementation and results of the application of a multi-stage traffic light control system which includes a simulation-based traffic estimation and model predictive control.
The traffic light control system incorporates a fuzzy system for traffic light phase preselection, followed by a model predictive control to optimise phase combinations and switching times. Predefined phases are selected without restrictions in the order according to a multi-objective optimisation to adapt to the traffic as freely as possible. Initially, the system is tested in simulations and compared with existing methods and analysed afterwards for its effectiveness in a prototype commissioning in field tests. Results indicate high potentials for reducing emissions and waiting times, highlighting the system's value. However, further refinement is necessary for standard implementation. This comprehensive approach demonstrates advancements in traffic management technology, showcasing the potential for enhancing urban mobility and reducing environmental impact.}},
author = {{Malena, Kevin and Link, Christopher and Gausemeier, Sandra and Trächtler, Ansgar}},
booktitle = {{2024 IEEE 27th International Conference on Intelligent Transportation Systems (ITSC)}},
issn = {{2153-0017}},
keywords = {{MPC}},
location = {{Edmonton (Canada)}},
publisher = {{IEEE}},
title = {{{Implementation and Results of a Multi-Stage Model Predictive Traffic Light Control System}}},
doi = {{10.1109/itsc58415.2024.10919569}},
volume = {{27}},
year = {{2025}},
}
@inbook{65510,
author = {{Rossmann, Felix}},
booktitle = {{Jahrbuch Normative und institutionelle Grundfragen der Ökonomik}},
editor = {{Sturn, Richard and Klüh, Ulrich}},
pages = {{15 pp.}},
publisher = {{Metropolis}},
title = {{{Zum Verhältnis von nachhaltigkeitsbezogener Transparenz und strategischem Sichtbarkeitsmanagement}}},
year = {{2025}},
}
@article{65509,
author = {{Rossmann, Felix Konstantin}},
issn = {{1865-5114}},
journal = {{ZfKE – Zeitschrift für KMU und Entrepreneurship}},
number = {{3–4}},
pages = {{251--256}},
publisher = {{Duncker & Humblot GmbH}},
title = {{{Forschungsperspektiven zu Sustainable Finance in kleinen und mittleren Unternehmen}}},
doi = {{10.3790/zfke.2024.1465308}},
volume = {{72}},
year = {{2025}},
}
@inproceedings{64610,
author = {{Hadipour, Amir Hossein and Jafari, Atousa and Awais, Muhammad and Platzner, Marco}},
booktitle = {{2025 IEEE 28th International Symposium on Design and Diagnostics of Electronic Circuits and Systems (DDECS)}},
publisher = {{IEEE}},
title = {{{A Two-Stage Approximation Methodology for Efficient DNN Hardware Implementation}}},
doi = {{10.1109/ddecs63720.2025.11006769}},
year = {{2025}},
}
@inproceedings{59895,
abstract = {{The generation of optically broadband Nyquist pulse sequences using an integrated Mach-Zehnder modulator (MZM) in a thin-film lithium-niobate (TFLN) platform with repetition rates of 5 to 32 GHz and optical bandwidths of up to 160 GHz is demonstrated. Nyquist pulse sequences with high optical bandwidth can be used as synchronization and control signals in quantum sources based on photon pair generation.}},
author = {{Kress, Christian and Mihaylov, Martin Miroslavov and Schwabe, Tobias and Silberhorn, Christine and Scheytt, J. Christoph}},
booktitle = {{PIERS Proceedings }},
location = {{Abu Dhabi}},
publisher = {{PhotonIcs and Electromagnetics Research Symposium (PIERS)}},
title = {{{Broadband Nyquist Pulse Generation on TFLN Platform for Integrated Quantum Source}}},
doi = {{10.1109/PIERS-Spring66516.2025.11276835}},
year = {{2025}},
}
@inproceedings{65525,
author = {{Reckmann, Eileen and Temmen, Katrin}},
location = {{Oldenburg}},
title = {{{Beforschung eines MINT Clusters – erste Ergebnisse und weitere Schritte}}},
year = {{2025}},
}
@article{65528,
author = {{Janovsky, Adam and Chmielewski, Łukasz and Svenda, Petr and Jancar, Jan and Matyas, Vashek}},
issn = {{0167-4048}},
journal = {{Computers & Security}},
publisher = {{Elsevier BV}},
title = {{{Revisiting the analysis of references among Common Criteria certified products}}},
doi = {{10.1016/j.cose.2025.104362}},
volume = {{152}},
year = {{2025}},
}
@inbook{65526,
author = {{JANCAR, Jan and SVENDA, Petr and SYS, Marek}},
booktitle = {{Embedded Cryptography 3}},
isbn = {{9781789452150}},
publisher = {{Wiley}},
title = {{{ROCA and Minerva Vulnerabilities}}},
doi = {{10.1002/9781394351930.ch10}},
year = {{2025}},
}
@article{65537,
abstract = {{It is a widely accepted standard practice to implement cryptographic software so that secret inputs do not influence the cycle count. Software following this paradigm is often referred to as “constant-time” software and typically involves following three rules: 1) never branch on a secret-dependent condition, 2) never access memory at a secret-dependent location, and 3) avoid variable-time arithmetic operations on secret data. The third rule requires knowledge about such variable-time arithmetic instructions, or vice versa, which operations are safe to use on secret inputs. For a long time, this knowledge was based on either documentation or microbenchmarks, but critically, there were never any guarantees for future microarchitectures. This changed with the introduction of the data-operand-independent-timing (DOIT) mode on Intel CPUs and, to some extent, the data-independent-timing (DIT) mode on Arm CPUs. Both Intel and Arm document a subset of their respective instruction sets that are intended to leak no information about their inputs through timing, even on future microarchitectures if the CPU is set to run in a dedicated DOIT (or DIT) mode.In this paper, we present a principled solution that leverages DOIT to enable cryptographic software that is future-proof constant-time, in the sense that it ensures that only instructions from the DOIT subset are used to operate on secret data, even during speculative execution after a mispredicted branch or function return location. For this solution, we build on top of existing security type systems in the Jasmin framework for high-assurance cryptography.We then use our solution to evaluate the extent to which existing cryptographic software built to be “constant-time” is already secure in this stricter paradigm implied by DOIT and what the performance impact is to move from constant-time to future-proof constant-time.}},
author = {{Arranz-Olmos, Santiago and Barthe, Gilles and Grégoire, Benjamin and Jancar, Jan and Laporte, Vincent and Oliveira, Tiago and Schwabe, Peter}},
issn = {{2569-2925}},
journal = {{IACR Transactions on Cryptographic Hardware and Embedded Systems}},
number = {{3}},
pages = {{644--667}},
publisher = {{Universitatsbibliothek der Ruhr-Universitat Bochum}},
title = {{{Let’s DOIT: Using Intel’s Extended HW/SW Contract for Secure Compilation of Crypto Code}}},
doi = {{10.46586/tches.v2025.i3.644-667}},
volume = {{2025}},
year = {{2025}},
}
@article{65538,
abstract = {{Developers implementing elliptic curve cryptography (ECC) face a wide range of implementation choices created by decades of research into elliptic curves. The literature on elliptic curves offers a plethora of curve models, scalar multipliers, and addition formulas, but this comes with the price of enabling attacks to also use the rich structure of these techniques. Navigating through this area is not an easy task and developers often obscure their choices, especially in black-box hardware implementations. Since side-channel attackers rely on the knowledge of the implementation details, reverse engineering becomes a crucial part of attacks.This work presents ECTester – a tool for testing black-box ECC implementations. Through various test suites, ECTester observes the behavior of the target implementation against known attacks but also non-standard inputs and elliptic curve parameters. We analyze popular ECC libraries and smartcards and show that some libraries and most smartcards do not check the order of the input points and improperly handle the infinity point. Based on these observations, we design new techniques for reverse engineering scalar randomization countermeasures that are able to distinguish between group scalar randomization, additive, multiplicative or Euclidean splitting. Our techniques do not require side-channel measurements; they only require the ability to set custom domain parameters, and are able to extract not only the size but also the exact value of the random mask used. Using the techniques, we successfully reverse-engineered the countermeasures on 13 cryptographic smartcards from 5 major manufacturers – all but one we tested on. Finally, we discuss what mitigations can be applied to prevent such reverse engineering, and whether it is possible at all.}},
author = {{Suchanek, Vojtech and Jancar, Jan and Kvapil, Jan and Svenda, Petr and Chmielewski, Łukasz}},
issn = {{2569-2925}},
journal = {{IACR Transactions on Cryptographic Hardware and Embedded Systems}},
number = {{4}},
pages = {{290--316}},
publisher = {{Universitatsbibliothek der Ruhr-Universitat Bochum}},
title = {{{ECTester: Reverse-engineering side-channel countermeasures of ECC implementations}}},
doi = {{10.46586/tches.v2025.i4.290-316}},
volume = {{2025}},
year = {{2025}},
}
@inproceedings{50272,
abstract = {{Despite the fundamental role the Quantum Satisfiability (QSAT) problem has
played in quantum complexity theory, a central question remains open: At which
local dimension does the complexity of QSAT transition from "easy" to "hard"?
Here, we study QSAT with each constraint acting on a $k$-dimensional and
$l$-dimensional qudit pair, denoted $(k,l)$-QSAT. Our first main result shows
that, surprisingly, QSAT on qubits can remain $\mathsf{QMA}_1$-hard, in that
$(2,5)$-QSAT is $\mathsf{QMA}_1$-complete. In contrast, $2$-SAT on qubits is
well-known to be poly-time solvable [Bravyi, 2006]. Our second main result
proves that $(3,d)$-QSAT on the 1D line with $d\in O(1)$ is also
$\mathsf{QMA}_1$-hard. Finally, we initiate the study of 1D $(2,d)$-QSAT by
giving a frustration-free 1D Hamiltonian with a unique, entangled ground state.
Our first result uses a direct embedding, combining a novel clock
construction with the 2D circuit-to-Hamiltonian construction of [Gosset, Nagaj,
2013]. Of note is a new simplified and analytic proof for the latter (as
opposed to a partially numeric proof in [GN13]). This exploits Unitary Labelled
Graphs [Bausch, Cubitt, Ozols, 2017] together with a new "Nullspace Connection
Lemma", allowing us to break low energy analyses into small patches of
projectors, and to improve the soundness analysis of [GN13] from
$\Omega(1/T^6)$ to $\Omega(1/T^2)$, for $T$ the number of gates. Our second
result goes via black-box reduction: Given an arbitrary 1D Hamiltonian $H$ on
$d'$-dimensional qudits, we show how to embed it into an effective null-space
of a 1D $(3,d)$-QSAT instance, for $d\in O(1)$. Our approach may be viewed as a
weaker notion of "simulation" (\`a la [Bravyi, Hastings 2017], [Cubitt,
Montanaro, Piddock 2018]). As far as we are aware, this gives the first
"black-box simulation"-based $\mathsf{QMA}_1$-hardness result, i.e. for
frustration-free Hamiltonians.}},
author = {{Rudolph, Dorian and Gharibian, Sevag and Nagaj, Daniel}},
booktitle = {{16th Innovations in Theoretical Computer Science (ITCS)}},
number = {{85}},
pages = {{1--24}},
title = {{{Quantum 2-SAT on low dimensional systems is $\mathsf{QMA}_1$-complete: Direct embeddings and black-box simulation}}},
doi = {{10.4230/LIPIcs.ITCS.2025.85}},
volume = {{325}},
year = {{2025}},
}
@unpublished{61776,
abstract = {{We investigate the role of energy, i.e. average photon number, as a resource
in the computational complexity of bosonic systems. We show three sets of
results: (1. Energy growth rates) There exist bosonic gate sets which increase
energy incredibly rapidly, obtaining e.g. infinite energy in finite/constant
time. We prove these high energies can make computing properties of bosonic
computations, such as deciding whether a given computation will attain infinite
energy, extremely difficult, formally undecidable. (2. Lower bounds on
computational power) More energy ``='' more computational power. For example,
certain gate sets allow poly-time bosonic computations to simulate PTOWER, the
set of deterministic computations whose runtime scales as a tower of
exponentials with polynomial height. Even just exponential energy and $O(1)$
modes suffice to simulate NP, which, importantly, is a setup similar to that of
the recent bosonic factoring algorithm of [Brenner, Caha, Coiteux-Roy and
Koenig (2024)]. For simpler gate sets, we show an energy hierarchy theorem. (3.
Upper bounds on computational power) Bosonic computations with polynomial
energy can be simulated in BQP, ``physical'' bosonic computations with
arbitrary finite energy are decidable, and the gate set consisting of Gaussian
gates and the cubic phase gate can be simulated in PP, with exponential bound
on energy, improving upon the previous PSPACE upper bound. Finally, combining
upper and lower bounds yields no-go theorems for a continuous-variable
Solovay--Kitaev theorem for gate sets such as the Gaussian and cubic phase
gates.}},
author = {{Chabaud, Ulysse and Gharibian, Sevag and Mehraban, Saeed and Motamedi, Arsalan and Naeij, Hamid Reza and Rudolph, Dorian and Sambrani, Dhruva}},
booktitle = {{arXiv:2510.08545}},
title = {{{Energy, Bosons and Computational Complexity}}},
year = {{2025}},
}
@unpublished{61778,
abstract = {{Understanding the entanglement structure of local Hamiltonian ground spaces
is a physically motivated problem, with applications ranging from tensor
network design to quantum error-correcting codes. To this end, we study the
complexity of estimating ground state entanglement, and more generally entropy
estimation for low energy states and Gibbs states. We find, in particular, that
the classes qq-QAM [Kobayashi, le Gall, Nishimura, SICOMP 2019] (a quantum
analogue of public-coin AM) and QMA(2) (QMA with unentangled proofs) play a
crucial role for such problems, showing: (1) Detecting a high-entanglement
ground state is qq-QAM-complete, (2) computing an additive error approximation
to the Helmholtz free energy (equivalently, a multiplicative error
approximation to the partition function) is in qq-QAM, (3) detecting a
low-entanglement ground state is QMA(2)-hard, and (4) detecting low energy
states which are close to product states can range from QMA-complete to
QMA(2)-complete. Our results make progress on an open question of [Bravyi,
Chowdhury, Gosset and Wocjan, Nature Physics 2022] on free energy, and yield
the first QMA(2)-complete Hamiltonian problem using local Hamiltonians (cf. the
sparse QMA(2)-complete Hamiltonian problem of [Chailloux, Sattath, CCC 2012]).}},
author = {{Gharibian, Sevag and Kamminga, Jonas}},
booktitle = {{arXiv:2510.06796}},
title = {{{On the complexity of estimating ground state entanglement and free energy}}},
year = {{2025}},
}
@article{61164,
abstract = {{Building on and methodologically extending conceptual metaphor theory, the article examines how personal agency as a discursively produced sociopsychological phenomenon can be studied in elicited metaphors through a discourse-analytical approach. More concretely, the study illustrates how early-career researchers experience and express their agency in research writing through personal metaphors of academic writing such as riding a roller coaster or baking a wedding cake. A two-step discursive analysis adapts Hopper and Thompson's multidimensional approach to linguistic transitivity to study agency in language. The analytical approach involves both an in-depth parametrized analysis of all metaphors in the sample and a qualitative cross-analysis of the data. The results show that the participants' metaphors reflect both nuanced personal experiences and cultural expectations of academic writing, the writer, and the text. This emphasizes that research writing is not only a highly subjective practice but also one that is socially and culturally influenced. The article argues that research on agency thus needs elaborate methodological tools to trace discursive and sociopsychological trajectories of complex socio-cognitive practices like academic writing. This has implications not only for the nexus of research writing, identity, and academic enculturation but also for other fields focusing on agency in language.}},
author = {{Karsten, Andrea}},
issn = {{2813-4605}},
journal = {{Frontiers in Language Sciences}},
publisher = {{Frontiers Media SA}},
title = {{{Understanding personal agency through metaphor, or Why academic writing is (not) like a roller-coaster ride}}},
doi = {{10.3389/flang.2025.1567498}},
volume = {{4}},
year = {{2025}},
}
@misc{65564,
author = {{Lazarov, Stefan Teodorov and Türk, Olcay and Grimminger, Angela and Wagner, Petra and Buschmeier, Hendrik}},
publisher = {{LibreCat University}},
title = {{{Annotation Schemes Project A02 "Monitoring the understanding of explanations"}}},
doi = {{10.17605/OSF.IO/J2DHA}},
year = {{2025}},
}
@article{61165,
abstract = {{Building on and methodologically extending conceptual metaphor theory, the article examines how personal agency as a discursively produced sociopsychological phenomenon can be studied in elicited metaphors through a discourse-analytical approach. More concretely, the study illustrates how early-career researchers experience and express their agency in research writing through personal metaphors of academic writing such as riding a roller coaster or baking a wedding cake. A two-step discursive analysis adapts Hopper and Thompson's multidimensional approach to linguistic transitivity to study agency in language. The analytical approach involves both an in-depth parametrized analysis of all metaphors in the sample and a qualitative cross-analysis of the data. The results show that the participants' metaphors reflect both nuanced personal experiences and cultural expectations of academic writing, the writer, and the text. This emphasizes that research writing is not only a highly subjective practice but also one that is socially and culturally influenced. The article argues that research on agency thus needs elaborate methodological tools to trace discursive and sociopsychological trajectories of complex socio-cognitive practices like academic writing. This has implications not only for the nexus of research writing, identity, and academic enculturation but also for other fields focusing on agency in language.}},
author = {{Karsten, Andrea Ramona}},
issn = {{2813-4605}},
journal = {{Frontiers in Language Sciences}},
publisher = {{Frontiers Media SA}},
title = {{{Understanding personal agency through metaphor, or Why academic writing is (not) like a roller-coaster ride}}},
doi = {{10.3389/flang.2025.1567498}},
volume = {{4}},
year = {{2025}},
}
@inproceedings{61149,
abstract = {{The use of continuous fiber-reinforced thermoplastics (FRTP) in automotive industry increases due to their excellent material properties and possibility of rapid processing. The scale spanning heterogeneity of their material structure and its influence on the material behavior, however, presents significant challenges for most joining technologies, such as self-piercing riveting (SPR). During mechanical joining, the material structure is significantly altered within and around the joining zone, heavily influencing the material behavior. A comprehensive understanding of the underlying phenomena of material alteration during the SPR process is essential as basis for validating numerical simulations. This study examines the material structure at ten stages of a step-setting test of SPR with two FRTP sheets with glass-fiber reinforcement. Utilizing X-ray computed tomography (CT), the damage phenomena within different areas of the setting test are analyzed three-dimensionally and key parameters are quantified. Dominating phenomena during the penetration of the rivet into the laminate are fiber failure (FF), interfiber failure (IFF) and fiber bending, while delamination, fiber kinking and roving splitting are also observed. At the final stages, the bottom layers of the second sheet collapse and form a bulge into the cavity of the die.}},
author = {{Dargel, Alrik and Gröger, Benjamin and Schlichter, Malte Christian and Gerritzen, Johannes and Köhler, Daniel and Meschut, Gerson and Gude, Maik and Kupfer, Robert}},
booktitle = {{Proceedings of the 8th International Conference on Integrity-Reliability-Failure (IRF2025)}},
editor = {{Gomes, J.F. Silva and Meguid, Shaker A.}},
isbn = {{9789727523238}},
keywords = {{self-piercing riveting, computed tomography, thermoplastic composites, process-structure-interaction}},
location = {{Porto}},
publisher = {{FEUP}},
title = {{{Local Deformation and Failure of Composites during Self-Piercing Riveting: A CT-Based Microstructure Investigation}}},
doi = {{10.24840/978-972-752-323-8}},
year = {{2025}},
}
@inproceedings{62108,
author = {{Luchterhandt, Lars and Govindasamy, Vivek and Wang, Yutong and Scheytt, Christoph and Mueller, Wolfgang and Dömer, Rainer}},
booktitle = {{2025 Forum on Specification & Design Languages (FDL)}},
publisher = {{IEEE}},
title = {{{A Quantitative Guide to Navigate Speed/Accuracy Tradeoffs in System Level Design of RISC-V Processor Grids}}},
doi = {{10.1109/fdl68117.2025.11165408}},
year = {{2025}},
}
@article{65559,
abstract = {{Dieser Artikel spiegelt die dreißigjährige Geschichte der Zeitschrift Tertium Comparationis, indem er eine der zentralen Vergleichseinheiten Vergleichender Erziehungswissenschaft in den Blick nimmt. Themenhefte und Einzelbeiträge der Zeitschrift Tertium Comparationis haben über die Jahrzehnte immer wieder reflexive Blicke auf die Vergleichseinheit Land und/oder Nation geworfen, aber auch – ohne Bezüge zu solchen Diskursen – Länder- und Nationenvergleiche in unterschiedlichen Vorgehensweisen präsentiert. Bei der intensiven und analytischen Lektüre der Themen und Inhalte ergeben sich Cluster der Perspektivsetzungen und damit verbundene Diskurse, von denen einige aufgrund ihrer Häufigkeit und Intensität besonders relevant erscheinen. Die aufzufindenden Diskurse und Cluster werden im Beitrag präsentiert und anhand normativer, kritischer und innovativer Beiträge verifiziert. Trotz konstant wiederholter Kritik und konzeptueller Änderungen, bleiben Land und Nation zentrale Kategorien Vergleichender Erziehungswissenschaft.}},
author = {{Freitag, Christine}},
issn = {{0947-9732}},
journal = {{Tertium Comparationis}},
keywords = {{Tertium Comparationis, Land, Nation, Vergleichende Erziehungswissenschaft, Diskurse}},
number = {{2}},
pages = {{156--167}},
publisher = {{Waxmann}},
title = {{{Land und Nation: Perspektiven vergleichender Forschung in ausgewählten Diskursen der Zeitschrift Tertium Comparationis}}},
doi = {{10.31244/tc.2025.02.02}},
volume = {{31}},
year = {{2025}},
}
@misc{59671,
author = {{Abdelrahem, Mohammed}},
publisher = {{Zekk-Bolg}},
title = {{{Die Menschheitsfamilie und der Begriff der Umma – Islamische Perspektiven im interreligiösen Dialog}}},
year = {{2025}},
}