@inproceedings{59896,
  abstract     = {{We present an electronic-photonic co-designed Mach-Zehnder modulator with linear segment drivers in a photonic SOI-CMOS technology with an EO 3-dB bandwidth of ≥ 27 GHz and data transmission up to 64 Gbit/s without pre-emphasis.}},
  author       = {{Kress, Christian and Schwabe, Tobias and Mihaylov, Martin Miroslavov and Scheytt, J. Christoph}},
  location     = {{Long Beach, CA, USA}},
  title        = {{{High-Speed Mach-Zehnder Modulator with Linear Segmented On-Chip Drivers in Photonic 45nm SOI-CMOS Technology }}},
  year         = {{2025}},
}

@article{53413,
  abstract     = {{For negatively curved symmetric spaces it is known that the poles of the
scattering matrices defined via the standard intertwining operators for the
spherical principal representations of the isometry group are either given as
poles of the intertwining operators or as quantum resonances, i.e. poles of the
meromorphically continued resolvents of the Laplace-Beltrami operator. We
extend this result to classical locally symmetric spaces of negative curvature
with convex-cocompact fundamental group using results of Bunke and Olbrich. The
method of proof forces us to exclude the spectral parameters corresponding to
singular Poisson transforms.}},
  author       = {{Delarue, Benjamin and Hilgert, Joachim}},
  issn         = {{0949-5932}},
  journal      = {{Journal of Lie Theory}},
  number       = {{(4)}},
  pages        = {{787----804}},
  title        = {{{Quantum resonances and scattering poles of classical rank one locally  symmetric spaces}}},
  volume       = {{35}},
  year         = {{2025}},
}

@inproceedings{60504,
  author       = {{Nellius, Tom and Henne, Kevin and Hartinger, Maximilian and Meihost, Lars and Hetkämper, Tim and Zeipert, Henning and Claes, Leander and Henning, Bernd}},
  location     = {{Nürnberg}},
  title        = {{{Ultrasonic phased array interface using programmable I/O and microprocessor clock synchronisation}}},
  doi          = {{ 10.5162/SMSI2025/A5.4}},
  year         = {{2025}},
}

@misc{64902,
  abstract     = {{Diese Dissertation behandelt die Entwicklung, Erprobung und Evaluation einer mobilen Augmented Reality Anwendung (mAR-App) namens PEARL (Paderborner Elektrotechnik AR Laborpraktikum), die als Vorbereitungsmaßnahme für elektrotechnische Laborpraktika konzipiert wird. Ziel ist es, Studierenden eine zeitlich und örtlich flexible Möglichkeit zu bieten, den realitätsnahen Umgang mit Laborgeräten - primär dem Oszilloskop - zu erlernen. Die methodische Grundlage bilden der Makrozyklus von Design-Based Research (DBR) als strukturierender Rahmen und das heuristische Modell des Research Pentagons, das die Durchführung auf Mikroebene bestimmt. In insgesamt vier Research Pentagons werden didaktische, technologische, motivationale und evaluative Komponenten systematisch untersucht und weiterentwickelt. Das erste Pentagon fokussiert die Entwicklung eines didaktisch fundierten Konzepts nach dem Prinzip des Constructive Alignment, das Lernziele, Lernaktivitäten und Prüfungsformen in fünf abgestufte Lernlevel überführt. Diese reichen von der initialen Orientierung bis zur eigenständigen Problemlösung in einem freien Experimentiermodus. Im zweiten Research Pentagon wird die technische Machbarkeit von Augmented - und Virtual Reality (VR) im Laborumfeld anhand mehrerer funktionaler Prototypen evaluiert. Während sich VR aufgrund technischer Einschränkungen als ungeeignet erweist, zeigt AR - insbesondere in der markerlosen Ausführung mittels der Software Development Kits (SDKs) ARCore und ARKit - ein hohes Potenzial für den praktischen Einsatz. Im dritten Pentagon entsteht ein Onboarding-Modul, das auf die erste Version der mobilen App (V0.17.01) aufsetzt und grundlegende Funktionen eines realen Oszilloskops digital abbildet. Dabei werden Nutzer:innen schrittweise an das virtuelle Oszilloskop herangeführt und lernen zugleich die zentralen Funktionen der mAR-App kennen. Die Ergebnisse zeigen eine insgesamt neutrale bis leicht positive Nutzungserfahrung, wobei technische Schwächen (z.B. Reaktionszeit oder Objektverankerung) die Effizienz und Steuerbarkeit beeinträchtigen. Im Exkurs-Kapitel erfolgt eine Eye-Tracking-Studie zur Untersuchung visueller Aufmerksamkeit und individueller Lösungsstrategien von Expert:innen und Noviz:innen bei der Arbeit am realen Oszilloskop. Heatmaps und Zeitverläufe in definierten Areas of Interest (AOI) liefern erste Hinweise auf Unterschiede im Blickverhalten zwischen den Gruppen. Die algorithmischen Scanpfadanalysen der Blickverläufe hingegen zeigen eine geringe Trennschärfe. Das Potenzial von Eye-Tracking als Evaluationsmethode wird daher kritisch reflektiert, aber angesichts technologischer Entwicklungen und verfügbarer Eye-Tracker in Mixed Reality (MR) Brillen weiterhin als zukunftsrelevant eingeordnet. Die abschließende summative Evaluation nutzt ein Prä‑Post-Test-Design mit Kontrollgruppenvergleich mit 70 Teilnehmenden, um die Lernwirksamkeit der überarbeiteten mAR-App mit klassischen Materialien wie Videos und Handbüchern zu vergleichen. In der Interventionsgruppe (IG) zeigen sich auf kognitiver und affektiver Ebene signifikant positive Veränderungen: Die Leistungen steigen deutlich, insbesondere in den Taxonomiestufen Anwendung, Verständnis und Analyse; zugleich nehmen experimentelles Selbstkonzept und experimentelles Sachinteresse zu, während Überforderung und Ängstlichkeit im Hinblick auf die Laborpraktika abnehmen. Als Einschränkung zeigt sich, dass die mAR-App keinen klaren Vorsprung gegenüber der Kontrollgruppe (KG) erreicht, was sowohl auf die sehr gut ausgearbeiteten Materialien und Videos der KG als auch auf technische Begrenzungen der mobilen Umsetzung zurückzuführen ist: Kleine Displays, 2D-Oberflächen für 3D-Geräte und unpräzise Touch-Interaktionen erschweren komplexe, feinmotorische Aufgaben. In den begleitenden User Interface (UI) und User Experience (UX) Fragebögen spiegeln sich diese Limitationen in gemischten Bewertungen der App wider. Die Arbeit verdeutlicht, dass die mobile AR-Anwendung trotz technischer Einschränkungen wertvolle Möglichkeiten für die Vorbereitung auf Laborpraktika und das Kennenlernen von Laborgeräten bieten kann. Der Fokus bei der Entwicklung liegt von Beginn an auf einer modularen und flexiblen App-Architektur, um sie mit neuen Geräten und Aufgaben zu erweitern. Der Hauptnutzen liegt perspektivisch nicht in der mobilen Anwendung selbst, sondern in der strategischen Ausrichtung auf zukunftsfähige, skalierbare Lösungen für MR-Brillen. Diese erlauben eine authentische Gestensteuerung und realitätsnahe Interaktionen.}},
  author       = {{Alptekin, Mesut}},
  publisher    = {{LibreCat University}},
  title        = {{{Entwicklung einer Augmented Reality basierten Anwendung als Vorbereitungsmaßnahme zum Laborpraktikum in der Elektrotechnik}}},
  doi          = {{10.17619/UNIPB/1-2483}},
  year         = {{2025}},
}

@inproceedings{65466,
  author       = {{Bäumer, Fabian and Brinkmann, Marcus and Radoy, Maximilian and Schwenk, Jörg and Somorovsky, Juraj}},
  booktitle    = {{Proceedings of the 2025 ACM SIGSAC Conference on Computer and Communications Security}},
  publisher    = {{ACM}},
  title        = {{{On the Security of SSH Client Signatures}}},
  doi          = {{10.1145/3719027.3765079}},
  year         = {{2025}},
}

@inproceedings{65474,
  author       = {{Rook, Jeroen and López-Ibáñez, Manuel}},
  booktitle    = {{Proceedings of the Genetic and Evolutionary Computation Conference Companion, GECCO 2025, NH Malaga Hotel, Malaga, Spain, July 14-18, 2025}},
  editor       = {{Filipic, Bogdan}},
  pages        = {{1617–1642}},
  publisher    = {{ACM}},
  title        = {{{Advanced Use of Automatic Algorithm Configuration: Single- and Multi-Objective Approaches}}},
  doi          = {{10.1145/3712255.3716537}},
  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}},
}

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

@inproceedings{48632,
  abstract     = {{Digital Servitization is one of the significant trends affecting the manufacturing industry. Companies try to tackle challenges regarding their differentiation and profitability using digital services. One specific type of digital services are smart services, which are digital services built on data from smart products. Introducing these kinds of offerings into the portfolio of manufacturing companies is not trivial. Moreover, they require conscious action to align all relevant capabilities to realize the respective business goals. However, what capabilities are generally relevant for smart services remains opaque. We conducted a systematic literature review to identify them and extended the results through an interview study. Our analysis results in 78 capabilities clustered among 12 principles and six dimensions. These results provide significant support for the smart service transformation of manufacturing companies and for structuring the research field of smart services.}},
  author       = {{Koldewey, Christian and Fichtler, Timm and Scholtysik, Michel and Biehler, Jan and Schreiner, Nick and Sommer, Franziska and Schacht, Maximilian and Kaufmann, Jonas and Rabe, Martin and Sedlmeier, Joachim and Dumitrescu, Roman}},
  keywords     = {{Digital Servitization, Transformation, Capabilities, Maturity, Smart Services}},
  location     = {{Hawaii}},
  title        = {{{Exploring Capabilities for the Smart Service Transformation in Manufacturing: Insights from Theory and Practice}}},
  year         = {{2024}},
}

@inproceedings{49354,
  author       = {{Afroze, Lameya and Merkelbach, Silke and von Enzberg, Sebastian and Dumitrescu, Roman}},
  booktitle    = {{ML4CPS 2023}},
  location     = {{Hamburg}},
  title        = {{{Domain Knowledge Injection Guidance for Predictive Maintenance}}},
  year         = {{2024}},
}

@inproceedings{49364,
  author       = {{Scholtysik, Michel and Rohde, Malte and Koldewey, Christian and Dumitrescu, Roman}},
  title        = {{{Business strategy taxonomy and solution patterns for the circular economy}}},
  year         = {{2024}},
}

@unpublished{51160,
  abstract     = {{We rigorously derive novel and sharp finite-data error bounds for highly
sample-efficient Extended Dynamic Mode Decomposition (EDMD) for both i.i.d. and
ergodic sampling. In particular, we show all results in a very general setting
removing most of the typically imposed assumptions such that, among others,
discrete- and continuous-time stochastic processes as well as nonlinear partial
differential equations are contained in the considered system class. Besides
showing an exponential rate for i.i.d. sampling, we prove, to the best of our
knowledge, the first superlinear convergence rates for ergodic sampling of
deterministic systems. We verify sharpness of the derived error bounds by
conducting numerical simulations for highly-complex applications from molecular
dynamics and chaotic flame propagation.}},
  author       = {{Philipp, Friedrich M. and Schaller, Manuel and Boshoff, Septimus and Peitz, Sebastian and Nüske, Feliks and Worthmann, Karl}},
  booktitle    = {{arXiv:2402.02494}},
  title        = {{{Extended Dynamic Mode Decomposition: Sharp bounds on the sample  efficiency}}},
  year         = {{2024}},
}

@article{51208,
  abstract     = {{<jats:title>Abstract</jats:title><jats:p>Approximation of subdifferentials is one of the main tasks when computing descent directions for nonsmooth optimization problems. In this article, we propose a bisection method for weakly lower semismooth functions which is able to compute new subgradients that improve a given approximation in case a direction with insufficient descent was computed. Combined with a recently proposed deterministic gradient sampling approach, this yields a deterministic and provably convergent way to approximate subdifferentials for computing descent directions.</jats:p>}},
  author       = {{Gebken, Bennet}},
  issn         = {{0926-6003}},
  journal      = {{Computational Optimization and Applications}},
  keywords     = {{Applied Mathematics, Computational Mathematics, Control and Optimization}},
  publisher    = {{Springer Science and Business Media LLC}},
  title        = {{{A note on the convergence of deterministic gradient sampling in nonsmooth optimization}}},
  doi          = {{10.1007/s10589-024-00552-0}},
  year         = {{2024}},
}

@article{46019,
  abstract     = {{We derive efficient algorithms to compute weakly Pareto optimal solutions for smooth, convex and unconstrained multiobjective optimization problems in general Hilbert spaces. To this end, we define a novel inertial gradient-like dynamical system in the multiobjective setting, which trajectories converge weakly to Pareto optimal solutions. Discretization of this system yields an inertial multiobjective algorithm which generates sequences that converge weakly to Pareto optimal solutions. We employ Nesterov acceleration to define an algorithm with an improved convergence rate compared to the plain multiobjective steepest descent method (Algorithm 1). A further improvement in terms of efficiency is achieved by avoiding the solution of a quadratic subproblem to compute a common step direction for all objective functions, which is usually required in first-order methods. Using a different discretization of our inertial gradient-like dynamical system, we obtain an accelerated multiobjective gradient method that does not require the solution of a subproblem in each step (Algorithm 2). While this algorithm does not converge in general, it yields good results on test problems while being faster than standard steepest descent.}},
  author       = {{Sonntag, Konstantin and Peitz, Sebastian}},
  journal      = {{Journal of Optimization Theory and Applications}},
  publisher    = {{Springer}},
  title        = {{{Fast Multiobjective Gradient Methods with Nesterov Acceleration via Inertial Gradient-Like Systems}}},
  doi          = {{10.1007/s10957-024-02389-3}},
  year         = {{2024}},
}

@unpublished{51334,
  abstract     = {{The efficient optimization method for locally Lipschitz continuous multiobjective optimization problems from [1] is extended from finite-dimensional problems to general Hilbert spaces. The method iteratively computes Pareto critical points, where in each iteration, an approximation of the subdifferential is computed in an efficient manner and then used to compute a common descent direction for all objective functions. To prove convergence, we present some new optimality results for nonsmooth multiobjective optimization problems in Hilbert spaces. Using these, we can show that every accumulation point of the sequence generated by our algorithm is Pareto critical under common assumptions. Computational efficiency for finding Pareto critical points is numerically demonstrated for multiobjective optimal control of an obstacle problem.}},
  author       = {{Sonntag, Konstantin and Gebken, Bennet and Müller, Georg and Peitz, Sebastian and Volkwein, Stefan}},
  booktitle    = {{arXiv:2402.06376}},
  title        = {{{A Descent Method for Nonsmooth Multiobjective Optimization in Hilbert Spaces}}},
  year         = {{2024}},
}

@article{40171,
  abstract     = {{We present a convolutional framework which significantly reduces the complexity and thus, the computational effort for distributed reinforcement learning control of dynamical systems governed by partial differential equations (PDEs). Exploiting translational equivariances, the high-dimensional distributed control problem can be transformed into a multi-agent control problem with many identical, uncoupled agents. Furthermore, using the fact that information is transported with finite velocity in many cases, the dimension of the agents’ environment can be drastically reduced using a convolution operation over the state space of the PDE, by which we effectively tackle the curse of dimensionality otherwise present in deep reinforcement learning. In this setting, the complexity can be flexibly adjusted via the kernel width or by using a stride greater than one (meaning that we do not place an actuator at each sensor location). Moreover, scaling from smaller to larger domains – or the transfer between different domains – becomes a straightforward task requiring little effort. We demonstrate the performance of the proposed framework using several PDE examples with increasing complexity, where stabilization is achieved by training a low-dimensional deep deterministic policy gradient agent using minimal computing resources.}},
  author       = {{Peitz, Sebastian and Stenner, Jan and Chidananda, Vikas and Wallscheid, Oliver and Brunton, Steven L. and Taira, Kunihiko}},
  journal      = {{Physica D: Nonlinear Phenomena}},
  pages        = {{134096}},
  publisher    = {{Elsevier}},
  title        = {{{Distributed Control of Partial Differential Equations Using  Convolutional Reinforcement Learning}}},
  doi          = {{10.1016/j.physd.2024.134096}},
  volume       = {{461}},
  year         = {{2024}},
}

@misc{52318,
  author       = {{Dorociak, Svitlana}},
  title        = {{{Implementierung eines Algorithmus zur motivbasierten Schnitt-Sparsifizierung}}},
  year         = {{2024}},
}

@article{33461,
  abstract     = {{Data-driven models for nonlinear dynamical systems based on approximating the underlying Koopman operator or generator have proven to be successful tools for forecasting, feature learning, state estimation, and control. It has become well known that the Koopman generators for control-affine systems also have affine dependence on the input, leading to convenient finite-dimensional bilinear approximations of the dynamics. Yet there are still two main obstacles that limit the scope of current approaches for approximating the Koopman generators of systems with actuation. First, the performance of existing methods depends heavily on the choice of basis functions over which the Koopman generator is to be approximated; and there is currently no universal way to choose them for systems that are not measure preserving. Secondly, if we do not observe the full state, we may not gain access to a sufficiently rich collection of such functions to describe the dynamics. This is because the commonly used method of forming time-delayed observables fails when there is actuation. To remedy these issues, we write the dynamics of observables governed by the Koopman generator as a bilinear hidden Markov model, and determine the model parameters using the expectation-maximization (EM) algorithm. The E-step involves a standard Kalman filter and smoother, while the M-step resembles control-affine dynamic mode decomposition for the generator. We demonstrate the performance of this method on three examples, including recovery of a finite-dimensional Koopman-invariant subspace for an actuated system with a slow manifold; estimation of Koopman eigenfunctions for the unforced Duffing equation; and model-predictive control of a fluidic pinball system based only on noisy observations of lift and drag.}},
  author       = {{Otto, Samuel E. and Peitz, Sebastian and Rowley, Clarence W.}},
  journal      = {{SIAM Journal on Applied Dynamical Systems}},
  number       = {{1}},
  pages        = {{885--923}},
  publisher    = {{SIAM}},
  title        = {{{Learning Bilinear Models of Actuated Koopman Generators from  Partially-Observed Trajectories}}},
  doi          = {{10.1137/22M1523601}},
  volume       = {{23}},
  year         = {{2024}},
}

@misc{52663,
  abstract     = {{Context
Static analyses are well-established to aid in understanding bugs or vulnerabilities during the development process or in large-scale studies. A low false-positive rate is essential for the adaption in practice and for precise results of empirical studies. Unfortunately, static analyses tend to report where a vulnerability manifests rather than the fix location. This can cause presumed false positives or imprecise results.
Method
To address this problem, we designed an adaption of an existing static analysis algorithm that can distinguish between a manifestation and fix location, and reports error chains. An error chain represents at least two interconnected errors that occur successively, thus building the connection between the fix and manifestation location. We used our tool CogniCryptSUBS for a case study on 471 GitHub repositories, a performance benchmark to compare different analysis configurations, and conducted an expert interview.
Result
We found that 50 % of the projects with a report had at least one error chain. Our runtime benchmark demonstrated that our improvement caused only a minimal runtime overhead of less than 4 %. The results of our expert interview indicate that with our adapted version participants require fewer executions of the analysis.
Conclusion
Our results indicate that error chains occur frequently in real-world projects, and ignoring them can lead to imprecise evaluation results. The runtime benchmark indicates that our tool is a feasible and efficient solution for detecting error chains in real-world projects. Further, our results gave a hint that the usability of static analyses may benefit from supporting error chains.}},
  author       = {{Wickert, Anna-Katharina and Schlichtig, Michael and Vogel, Marvin and Winter, Lukas and Mezini, Mira and Bodden, Eric}},
  keywords     = {{Static analysis, error chains, false positive re- duction, empirical studies}},
  title        = {{{Supporting Error Chains in Static Analysis for Precise Evaluation Results and Enhanced Usability}}},
  year         = {{2024}},
}

@unpublished{52691,
  abstract     = {{We prove Feynman-Kac formulas for the semigroups generated by selfadjoint
operators in a class containing Fr\"ohlich Hamiltonians known from solid state
physics. The latter model multi-polarons, i.e., a fixed number of quantum
mechanical electrons moving in a polarizable crystal and interacting with the
quantized phonon field generated by the crystal's vibrational modes. Both the
electrons and phonons can be confined to suitable open subsets of Euclidean
space. We also include possibly very singular magnetic vector potentials and
electrostatic potentials. Our Feynman-Kac formulas comprise Fock space
operator-valued multiplicative functionals and can be applied to every vector
in the underlying Hilbert space. In comparison to the renormalized Nelson
model, for which analogous Feynman-Kac formulas are known, the analysis of the
creation and annihilation terms in the multiplicative functionals requires
novel ideas to overcome difficulties caused by the phonon dispersion relation
being constant. Getting these terms under control and generalizing other
construction steps so as to cover confined systems are the main achievements of
this article.}},
  author       = {{Hinrichs, Benjamin and Matte, Oliver}},
  booktitle    = {{arXiv:2403.12147}},
  title        = {{{Feynman-Kac formulas for semigroups generated by multi-polaron  Hamiltonians in magnetic fields and on general domains}}},
  year         = {{2024}},
}