@misc{KharmaWiesSchintke2026, author = {Kharma, Sami and Wies, Tobias and Schintke, Florian}, title = {Comprehensive Plugin-Based Monitoring of Nexflow Workflow Executions}, journal = {SCA/HPC Asia 2026}, arxiv = {http://arxiv.org/abs/2603.28783}, year = {2026}, language = {en} } @article{SchuetteSikorskiKresseetal.2026, author = {Sch{\"u}tte, Christof and Sikorski, Alexander and Kresse, Jakob and Weber, Marcus}, title = {On-the-Fly Lifting of Coarse Reaction-Coordinate Paths to Full-Dimensional Transition Path Ensembles}, arxiv = {http://arxiv.org/abs/2603.23266}, doi = {10.48550/arXiv.2603.23266}, year = {2026}, abstract = {Effective dynamics on a low-dimensional collective-variable (CV) or latent space can be simulated far more cheaply than the underlying high-dimensional stochastic system, but exploiting such coarse predictions requires lifting: turning a coarse CV trajectory into dynamically consistent full-dimensional states and path ensembles, without relying on global sampling of invariant or conditional fiber measures. We present a local, on-the-fly lifting strategy based on guided full-system trajectories. First an effective model in CV space is used to obtain a coarse reference trajectory. Then, an ensemble of full-dimensional trajectories is generated from a guided version of the original dynamics, where the guidance steers the trajectory to track the CV reference path. Because guidance biases the path distribution, we correct it via pathwise Girsanov reweighting, yielding a correct-by-construction importance-sampling approximation of the conditional law of the uncontrolled dynamics. We further connect the approach to stochastic optimal control, clarifying how coarse models can inform variance-reducing guidance for rare-event quantities. Numerical experiments demonstrate that inexpensive coarse transition paths can be converted into realistic full-system transition pathways (including barrier crossings and detours) and can accelerate estimation of transition pathways and statistics while providing minimal bias through weighted ensembles.}, language = {en} } @misc{RamakiSchintke2025, author = {Ramaki, Niaz Mohammad and Schintke, Florian}, title = {Ensuring Reproducibility in Stream Processing with Blockchain Technologies}, journal = {2025 11th International Conference on Computer and Communications (ICCC)}, publisher = {IEEE}, doi = {10.1109/ICCC68654.2025.11437772}, pages = {1383 -- 1391}, year = {2025}, language = {en} } @article{VillaniAndresArconesUngeretal.2026, author = {Villani, Paolo and Andr{\´e}s Arcones, Daniel and Unger, J{\"o}rg F. and Weiser, Martin}, title = {Gaussian mixture models for model improvement}, arxiv = {http://arxiv.org/abs/2603.15101}, year = {2026}, abstract = {Modeling complex physical systems such as they arise in civil engineering applications requires finding a trade-off between physical fidelity and practicality. Consequently, deviations of simulation from measurements are ubiquitous even after model calibration due to the model discrepancy, which may result from deliberate modeling decisions, ignorance, or lack of knowledge. If the mismatch between simulation and measurements are deemed unacceptable, the model has to be improved. Targeted model improvement is challenging due to a non-local impact of model discrepancies on measurements and the dependence on sensor configurations. Many approaches to model improvement, such as Bayesian calibration with additive mismatch terms, gray-box models, symbolic regression, or stochastic model updating, often lack interpretability, generalizability, physical consistency, or practical applicability. This paper introduces a non-intrusive approach to model discrepancy analysis using mixture models. Instead of directly modifying the model structure, the method maps sensor readings to clusters of physically meaningful parameters, automatically assigning sensor readings to parameter vector clusters. This mapping can reveal systematic discrepancies and model biases, guiding targeted, physics-based refinements by the modeler. The approach is formulated within a Bayesian framework, enabling the identification of parameter clusters and their assignments via the Expectation-Maximization (EM) algorithm. The methodology is demonstrated through numerical experiments, including an illustrative example and a real-world case study of heat transfer in a concrete bridge.}, language = {en} } @inproceedings{RiccardiLindner2026, author = {Riccardi, Gabor and Lindner, Niels}, title = {On The Minimum-Weight Forward (Weakly) Fundamental Cycle Basis Problem in Directed Graphs}, booktitle = {International Network Optimization Conference 2026 (INOC 2026)}, year = {2026}, abstract = {The cycle space of a directed graph is generated by a cycle basis, where, in general, cycles are allowed to have both forward and backward arcs. In a forward cycle, all arcs have to follow the given direction. We study the existence, structure, and computational complexity of minimum-weight forward cycle bases in directed graphs. We give a complete structural characterization of digraphs that admit weakly fundamental (and hence integral) forward cycle bases, showing that this holds if and only if every block is either strongly connected or a single arc. We further provide an easily verifiable characterization of when a strongly connected digraph admits a forward fundamental cycle basis, proving that such a basis exists if and only if the set of directed cycles has cardinality equal to the cycle rank; in this case, the basis is unique and computable in polynomial time, and nonexistence can likewise be certified efficiently. Lastly, we show that while minimum-weight forward fundamental cycle bases can be found in polynomial time whenever they exist, the minimum-weight forward weakly fundamental cycle basis problem is NP-hard via a polynomial-time reduction from the minimum-weight weakly fundamental cycle basis problem on digraphs with metric weights.}, language = {en} } @inproceedings{ScheltenChristgauHutzleretal.2026, author = {Schelten, Niklas and Christgau, Steffen and Hutzler, Merit and Kreowsky, Philipp and De Lucia, Marco and Schnor, Bettina and Signer, Hannes and Spazier, Johannes and Stabernack, Benno and Yahdzhyiev, Serhii}, title = {Using FPGA-based Network-Attached Accelerators for Energy-Efficient AI Training in HPC Datacenters}, booktitle = {2026 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW)}, year = {2026}, abstract = {FPGA-based Network-Attached Accelerators offer a disaggregated alternative to closely-coupled FPGAs or GPUs, but their adoption is very limited due to missing hardware/software frameworks. However, the usability and energy-efficiency of FPGAs for HPC use-cases has been demonstrated previously. Yet, the support by HPC infrastructure for those devices is lacking behind other accelerators. This paper addresses this shortcoming and demonstrates a full-stack approach that seamlessly integrates Network-Attached Accelerators in HPC datacenters and allows flexible and scalable usage of FPGAs. The presented work includes the according framework, integration steps and a show-case application from the geoscience domain. We evaluate our approach by comparing the training of a Physics-Informed Neural Network on the NAA against two GPU implementations. The NAA reduces total energy consumption by about 50\% and 17\% compared to the Keras and CUDA implementation, respectively. These results demonstrate that FPGA-based NAAs can be successfully integrated into HPC environments and are a viable path toward more energy-efficient AI training.}, language = {en} } @inproceedings{BorndoerferJocasWeiser2026, author = {Bornd{\"o}rfer, Ralf and Jocas, Arturas and Weiser, Martin}, title = {An Eikonal Approach for Globally Optimal Free Flight Trajectories}, arxiv = {http://arxiv.org/abs/2603.11830}, year = {2026}, abstract = {We present an eikonal-based approach that is capable of finding a continuous globally optimal trajectory for an aircraft in a stationary wind field. This minimizes emissions and fuel consumption. If the destination is close to a cut locus of the associated Hamilton-Jacobi-Bellman equation, small numerical discretization errors can lead to selecting a merely locally optimal trajectory and missing the globally optimal one. Based on finite element error estimates, we construct a trust region around the cut loci in order to guarantee uniqueness of trajectories for destinations sufficiently far from cut loci.}, language = {en} } @article{WuttkeStockmannWinkler2026, author = {Wuttke, Ulrike and Stockmann, Ralf and Winkler, Alexander}, title = {Podcasts als bibliothekarisches Handlungsfeld}, volume = {29}, journal = {B.I.T. online (BIT online) : Bibliothek, Information, Technologie}, number = {1}, issn = {1616-2617}, pages = {48 -- 53}, year = {2026}, language = {de} } @inproceedings{SunkaraRostamivonTycowiczetal.2026, author = {Sunkara, Vikram and Rostami, Atefe and von Tycowicz, Christoph and Sch{\"u}tte, Christof}, title = {Stop throwing away your Decoder; extract the learnt local coordinate system using Latent-XAI}, booktitle = {The 4th World Conference on Explainable Artificial Intelligence (XAI-2026)}, year = {2026}, language = {en} } @inproceedings{ScheltenChristgauSchulteetal.2026, author = {Schelten, Niklas and Christgau, Steffen and Schulte, Anton and Schnor, Bettina and Signer, Hannes and Stabernack, Benno}, title = {A Flexible Open-Source Framework for FPGA-based Network-Attached Accelerators using SpinalHDL}, booktitle = {Architecture of Computing Systems - 39th International Conference, ARCS 2026, Mainz, Germany, March 24-26, 2026, Proceedings.}, year = {2026}, abstract = {Domain-specific accelerators are increasingly vital in heterogeneous computing systems, driven by the demand for higher computational capacity and especially energy efficiency. Network-attached FPGAs promise a scalable and flexible alternative to closely coupled FPGAs for integrating accelerators into computing environments. While the advantages of specialized hardware implementations are apparent, traditional hardware development and integration remain time-consuming and complex. We present an open-source framework which combines a hardware shell with supporting software libraries, which enables fast development and deployment of FPGA-based network-attached accelerators. In contrast to traditional approaches using VHDL or Verilog, we leverage generative programming with SpinalHDL, providing a flexible hardware description with multi-level abstractions. This work eases the integration of accelerators into existing network infrastructures and simplifies adaptation to different FPGAs, eliminating complex and lengthy top-level hardware descriptions.}, language = {en} } @inproceedings{FrankeHamacherManns2026, author = {Franke, Paula and Hamacher, Kay and Manns, Paul}, title = {Minimizing and Maximizing the Shannon Entropy for Fixed Marginals}, booktitle = {Operations Research Proceedings 2025}, year = {2026}, abstract = {The mutual information (MI) between two random variables is an important correlation measure in data analysis. The Shannon entropy of a joint probability distri- bution is the variable part under fixed marginals. We aim to minimize and maximize it to obtain the largest and smallest MI possible in this case, leading to a scaled MI ratio for better comparability. We present algorithmic approaches and optimal solutions for a set of problem instances based on data from molecular evolution. We show that this allows us to construct a sensible, systematic correction to raw MI values.}, language = {en} } @inproceedings{SenguptaKuşLietal.2026, author = {Sengupta, Agniva and Ku{\c{s}}, Dilara and Li, Jianning and Zachow, Stefan}, title = {Globally Optimal Pose from Orthographic Silhouettes}, year = {2026}, abstract = {We solve the problem of determining the pose of known shapes in R^3 from their unoccluded silhouettes. The pose is determined up to global optimality using a simple yet under-explored property of the area-of-silhouette: its continuity w.r.t trajectories in the rotation space. The proposed method utilises pre-computed silhouette-signatures, modelled as a response surface of the area-of-silhouettes. Querying this silhouette-signature response surface for pose estimation leads to a strong branching of the rotation search space, making resolution-guided candidate search feasible. Additionally, we utilise the aspect ratio of 2D ellipses fitted to projected silhouettes as an auxiliary global shape signature to accelerate the pose search. This combined strategy forms the first method to efficiently estimate globally optimal pose from just the silhouettes, without being guided by correspondences, for any shape, irrespective of its convexity and genus. We validate our method on synthetic and real examples, demonstrating significantly improved accuracy against comparable approaches.}, language = {en} } @misc{KempkeMaherRehfeldtetal.2026, author = {Kempke, Nils-Christian and Maher, Stephen John and Rehfeldt, Daniel and Gleixner, Ambros and Koch, Thorsten and Uslu, Svenja}, title = {Distributed Parallel Structure-Aware Presolving for Arrowhead Linear Programs}, issn = {1438-0064}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-103034}, year = {2026}, abstract = {We present a structure-aware parallel presolve framework specialized to arrowhead linear programs (AHLPs) and designed for high-performance computing (HPC) environments, integrated into the parallel interior point solver PIPS-IPM++. Large-scale LPs arising from automated model generation frequently contain redundancies and numerical pathologies that necessitate effective presolve, yet existing presolve techniques are primarily serial or structure-agnostic and can become time-consuming in parallel solution workflows. Within PIPS-IPM++, AHLPs are stored in distributed memory, and our presolve builds on this to apply a highly parallel, distributed presolve across compute nodes while keeping communication overhead low and preserving the underlying arrowhead structure. We demonstrate the scalability and effectiveness of our approach on a diverse set of AHLPs and compare it against state-of-the-art presolve implementations, including PaPILO and the presolve implemented within Gurobi. Even on a single machine, our presolve significantly outperforms PaPILO by a factor of 18 and Gurobi's presolve by a factor of 6 in terms of shifted geometric mean runtime, while reducing the problems by a similar amount to PaPILO. Using a distributed compute environment, we outperform Gurobi's presolve by a factor of 13.}, language = {en} } @inproceedings{DingerGerberGnypetal.2026, author = {Dinger, Patrick and Gerber, Anja and Gnyp, Anna and von Hagel, Frank and Hohmann, Georg and Krause, Celia and Wagner, Sarah and Winkler, Alexander}, title = {Sammlungsdaten als Forschungsdaten in den Digital Humanities}, booktitle = {Book of Abstracts - DHd 2026}, doi = {10.5281/zenodo.18702753}, pages = {69 -- 74}, year = {2026}, language = {de} } @article{MehrmannJohnyEbbinghausetal.2026, author = {Mehrmann, Carolin and Johny, Jacob and Ebbinghaus, Petra and Hammerschmidt, Martin and Das, Ankita and Wei, Xin and Tesch, Marc F. and Rabe, Martin}, title = {Nano IR spectroscopy on Silicon-Supported Organic-Inorganic Hybrid Materials}, journal = {Phys. Chem. Chem. Phys.}, publisher = {Royal Society of Chemistry (RSC)}, doi = {10.1039/D5CP03815D}, year = {2026}, language = {en} } @inproceedings{PedersenLindnerRehfeldtetal.2026, author = {Pedersen, Jaap and Lindner, Niels and Rehfeldt, Daniel and Koch, Thorsten}, title = {Comparing Branching Rules for the Quota Steiner Tree Problem with Interference}, booktitle = {Operations Research Proceedings 2025}, year = {2026}, abstract = {Branching decisions play a crucial role in branch-and-bound algorithms for solving combinatorial optimization problems. In this paper, we investigate several branching rules applied to the Quota Steiner Tree Problem with Interference (QSTPI). The Quota Steiner Tree Problem (QSTP) generalizes the classical Steiner Tree Problem (STP) in graphs by seeking a minimum-cost tree that connects a subset of profit-associated vertices whose cumulative profit meets or exceeds a given quota. The QSTPI introduces interference among vertices: Selecting certain vertices simultaneously reduces their individual contributions to the overall profit. This problem arises, for example, in positioning and connecting wind turbines, where turbines possibly shadow other turbines, reducing their energy yield. Unlike classical STP variants, large QSTPI instances require significantly more branching to compute provably optimal solutions. In contrast to branching on variables, we utilize the combinatorial structure of the QSTPI by branching on the graph's vertices. We adapt classical and problem-specific branching rules and present a comprehensive computational study comparing the effectiveness of these branching strategies.}, language = {en} } @article{FariasBasultoMehlhopOttoetal.2025, author = {Farias-Basulto, Guillermo and Mehlhop, Thede and Otto, Nicolas J. and Bertram, Tobias and J{\"a}ger, Klaus and Gall, Stefan and Weinberger, Nikolaus and Schlatmann, Rutger and Lauermann, Iver and Klenk, Reiner and List-Kratochvil, Emil and Kaufmann, Christian A.}, title = {Improving Perovskite/CIGS Tandem Solar Cells for Higher Power Conversion Efficiency through Light Management and Bandgap Engineering}, volume = {17}, journal = {ACS Appl. Mater. Interfaces}, doi = {10.1021/acsami.5c15458}, pages = {56250}, year = {2025}, language = {en} } @article{BrenceBrummerDercksenetal.2026, author = {Brence, Blaž and Brummer, Josephine and Dercksen, Vincent J. and {\"O}zel, Mehmet Neset and Kulkarni, Abhishek and Wolterhoff, Neele and Prohaska, Steffen and Hiesinger, Peter Robin and Baum, Daniel}, title = {Semi-automatic geometrical reconstruction and analysis of filopodia dynamics in 4D two-photon microscopy images}, volume = {27}, journal = {BMC Bioinformatics}, doi = {10.1186/s12859-026-06385-4}, year = {2026}, abstract = {Background: Filopodia are thin and dynamic membrane protrusions that play a crucial role in cell migration, axon guidance, and other processes where cells explore and interact with their surroundings. Historically, filopodial dynamics have been studied in great detail in 2D in cultured cells, and more recently in 3D culture as well as living brains. However, there is a lack of efficient tools to trace and track filopodia in 4D images of complex brain cells. Results: To address this issue, we have developed a semi-automatic workflow for tracing filopodia in 3D images and tracking the traced filopodia over time. The workflow was developed based on high-resolution data of photoreceptor axon terminals in the in vivo context of normal Drosophila brain development, but devised to be applicable to filopodia in any system, including at different temporal and spatial scales. In contrast to the pre-existing methods, our workflow relies solely on the original intensity images without the requirement for segmentation or complex preprocessing. The workflow was realized in C++ within the Amira software system and consists of two main parts, dataset pre-processing, and geometrical filopodia reconstruction, where each of the two parts comprises multiple steps. In this paper, we provide an extensive workflow description and demonstrate its versatility for two different axo-dendritic morphologies, R7 and Dm8 cells. Finally, we provide an analysis of the time requirements for user input and data processing. Conclusion: To facilitate simple application within Amira or other frameworks, we share the source code, which is available at https://github.com/zibamira/filopodia-tool.}, language = {en} } @article{FischbachBetzRebholzetal.2026, author = {Fischbach, Jan David and Betz, Fridtjof and Rebholz, Lukas and Garg, Puneet and Frizyuk, Kristina and Binkowski, Felix and Burger, Sven and Hammerschmidt, Martin and Rockstuhl, Carsten}, title = {Pole-Expansion of the T-Matrix Based on a Matrix-Valued AAA-Algorithm}, journal = {ArXiV}, arxiv = {http://arxiv.org/abs/2602.18414}, doi = {10.48550/arXiv.2602.18414}, pages = {arXiv:2602.18414}, year = {2026}, language = {en} } @inproceedings{VillimNguyenBobiketal.2025, author = {Villim, J{\´a}n and Nguyen, Martin and Bobik, Pavol and Genci, Jan and Gec{\´a}šek, Daniel}, title = {New Version of the COR Simulation Engine}, volume = {501}, booktitle = {Proceedings of 39th International Cosmic Ray Conference — PoS(ICRC2025)}, publisher = {Sissa Medialab}, address = {Trieste, Italy}, doi = {https://doi.org/10.22323/1.501.1377}, year = {2025}, abstract = {The COR simulation engine is a tool devoted to evaluating cosmic ray trajectories in Earth's magnetosphere. It is part of the COR System, available at https://cor.crmodels.org, and it also functions as a standalone command line tool. The former tool was published in 2022. We report the new version of the tool status with improved performance, precision, new functions/features, and refactored code.}, language = {en} } @article{KruegerDopslaffManleyetal.2026, author = {Kr{\"u}ger, Jan and Dopslaff, Sven and Manley, Phillip and Bergmann, Detlef and K{\"o}ning, Rainer and Dai, Gaoliang and Hahm, Kai and Schneider, Philipp-Immanuel and Hammerschmidt, Martin and Zschiedrich, Lin and Bosse, Harald and Bodermann, Bernd}, title = {Photomask linewidth measurement comparison including an improved model-based through-focus measurement approach}, volume = {37}, journal = {Meas. Sci. Technol.}, doi = {10.1088/1361-6501/ae44bb}, pages = {095004}, year = {2026}, language = {en} } @misc{FrankeSeeligerStomporetal.2026, author = {Franke, Fabian and Seeliger, Frank and Stompor, Tomasz and Wawra, Steffen}, title = {K{\"u}nstliche Intelligenz in Bibliotheken}, volume = {13}, journal = {o-bib. Das offene Bibliotheksjournal}, number = {1}, issn = {2363-9814}, doi = {https://doi.org/10.5282/o-bib/6231}, pages = {1 -- 6}, year = {2026}, abstract = {Der Bibliotheksverbund Bayern und der Kooperative Bibliotheksverbund Berlin-Brandenburg haben in einem gemeinsamen Ideenworkshop im Mai 2025 Potenziale, Herausforderungen, Projekteans{\"a}tze und Handlungsbedarfe bei Anwendung K{\"u}nstlicher Intelligenz in Bibliotheken analysiert und diskutiert. F{\"u}r die Handlungsfelder Interne Gesch{\"a}ftsg{\"a}nge, Bibliotheksdienste, Forschungsnahe Dienste, Informationskompetenz und Analyse von Nutzungsdaten wurden Bedarfe identifiziert, Projektideen entwickelt und Handlungsempfehlungen formuliert.}, language = {de} } @article{GonnermannMuellerHaaseLeinsetal.2026, author = {Gonnermann-M{\"u}ller, Jana and Haase, Jennifer and Leins, Nicolas and Igel, Moritz and Fackeldey, Konstantin and Pokutta, Sebastian}, title = {FACET: Multi-Agent AI Supporting Teachers in Scaling Differentiated Learning for Diverse Students}, journal = {arXiv}, arxiv = {http://arxiv.org/abs/2601.22788}, doi = {https://arxiv.org/abs/2601.22788}, year = {2026}, abstract = {Classrooms are becoming increasingly heterogeneous, comprising learners with diverse performance and motivation levels, language proficiencies, and learning differences such as dyslexia and ADHD. While teachers recognize the need for differentiated instruction, growing workloads create substantial barriers, making differentiated instruction an ideal that is often unrealized in practice. Current AI educational tools, which promise differentiated materials, are predominantly student-facing and performance-centric, ignoring other aspects that shape learning outcomes. We introduce FACET, a teacher-facing multi-agent framework designed to address these gaps by supporting differentiation that accounts for motivation, performance, and learning differences. Developed with educational stakeholders from the outset, the framework coordinates four specialized agents, including learner simulation, diagnostic assessment, material generation, and evaluation within a teacher-in-the-loop design. School principals (N = 30) shaped system requirements through participatory workshops, while in-service K-12 teachers (N = 70) evaluated material quality. Mixed-methods evaluation demonstrates strong perceived value for inclusive differentiation. Practitioners emphasized both the urgent need arising from classroom heterogeneity and the importance of maintaining pedagogical autonomy as a prerequisite for adoption. We discuss implications for future school deployment and outline partnerships for longitudinal classroom implementation.}, language = {en} } @article{RayaMorenoDaschFarahanietal.2026, author = {Raya-Moreno, Mart{\´i} and Dasch, Noah Alexy and Farahani, Nasrin and Gonzalez Oliva, Ignacio and Gulans, Andris and Hossain, Manoar and Kleine, Hannah and Kuban, Martin and Lubeck, Sven and Maurer, Benedikt and Pavone, Pasquale and Peschel, Fabian and Popova-Gorelova, Daria and Qiao, Lu and Richter, Elias and Rigamonti, Santiago and Rodrigues Pel{\´a}, Ronaldo and Sinha, Kshitij and Speckhard, Daniel T. and Tillack, Sebastian and Tumakov, Dmitry and Hong, Seokhyun and Uzulis, Janis and Voiculescu, Mara and Vona, Cecilia and Yang, Mao and Draxl, Claudia}, title = {An exciting approach to theoretical spectroscopy}, arxiv = {http://arxiv.org/abs/2601.11388}, year = {2026}, language = {en} } @article{QiaoRodriguesPelaDraxl2026, author = {Qiao, Lu and Rodrigues Pel{\´a}, Ronaldo and Draxl, Claudia}, title = {First-principles approach to ultrafast pump-probe spectroscopy in solids}, arxiv = {http://arxiv.org/abs/2509.07612}, year = {2026}, language = {en} } @misc{BaumannDudaSchielaetal.2026, author = {Baumann, Felix and Duda, Georg and Schiela, Anton and Weiser, Martin}, title = {Identification of Stress in Heterogeneous Contact Models}, volume = {173}, journal = {Non-Smooth and Complementarity-Based Distributed Parameter Systems}, editor = {Hinterm{\"u}ller, Michael and Herzog, Roland and Kanzow, Christian and Ulbrich, Michael and Ulbrich, Stefan}, publisher = {Springer Nature}, year = {2026}, abstract = {We develop a heterogeneous model of the lower limb system to simulate muscle forces and stresses acting on the knee joint. The modelling of the bone dynamics leads to an index-3 DAE, which we discretize by higher order collocation methods. Furthermore, we present an elastomechanical contact knee joint model of the articular cartilage. For the solution of the contact problem we develop an efficient multigrid solver, based on an Augmented-Lagrangian relaxation of the contact constraints. We formulate the identification of joint forces and resulting stresses with respect to different knee joint models as an inverse problem based on medical gait data.}, language = {en} } @article{RongChenKochetal.2026, author = {Rong, Guoyang and Chen, Ying and Koch, Thorsten and Honda, Keisuke}, title = {Assessing data quality in citation analysis: A case study of web of science and Crossref}, volume = {20}, journal = {Journal of Informetrics}, number = {1}, publisher = {Elsevier BV}, issn = {1751-1577}, doi = {10.1016/j.joi.2026.101775}, year = {2026}, language = {en} } @misc{Villani2025, type = {Master Thesis}, author = {Villani, Paolo}, title = {Regression Techniques for Surrogate Modelling in Bayesian Inverse Problems}, pages = {59}, year = {2025}, abstract = {For many real-world applications, a system of interest can be represented via a mathematical model which depends on a set of parameters. In order to identify the parameters, a set of observations is available and an Inverse Problem is formulated. Identifying the parameters from the observations is often a challenging task, especially when the model is expensive to evaluate. This is the case for Partial Differential Equations models, where numerical simulations which are both inexact and computationally expensive are required to obtain the model output. To ease the computational costs, surrogate models can be used to approximate the forward model. In this work, we present two different regression techniques, Gaussian Process Regression and Lipschitz Regression. After reformulating the Inverse Problem to account for the surrogate model, we develope an adaptive training strategy to train the surrogate model. The proposed training strategy aims at optimizing not only the training points' positions but also their evaluation accuracies. Moreover, interleaved sampling of the posterior distribution of the unknown parameters is performed while the surrogate model is trained, providing a solution for the Inverse Problem. The quality of the surrogating techniques as well as the effectiveness of the adaptive training strategy are tested through different numerical experiments.}, language = {en} } @inproceedings{KochKempkeLindneretal.2026, author = {Koch, Thorsten and Kempke, Nils-Christian and Lindner, Niels and Mehl, Lukas and Wetzel, Manuel and Zittel, Janina}, title = {High-Performance Robust Energy System Planning with Storage: A Single-LP Approach}, booktitle = {Proceedings of URBSENSE 2026 - 1st International Workshop on URBan SENSEmaking and Intelligence for Safer Cities}, year = {2026}, language = {en} } @article{HadjidimitriouKochLippietal.2026, author = {Hadjidimitriou, Natalia Selini and Koch, Thorsten and Lippi, Marco and Petkovic, Milena and Mamei, Marco}, title = {Spatial analysis of COVID-19 and the Russia-Ukraine war impacts on natural gas flows using statistical and machine learning models}, volume = {29}, journal = {World Wide Web}, number = {2}, publisher = {Springer Science and Business Media LLC}, issn = {1386-145X}, doi = {https://doi.org/10.1007/s11280-025-01402-7}, year = {2026}, language = {en} } @article{NgokinghaTchoutoMehlKhomeijaniFarahanietal.2026, author = {Ngokingha Tchouto, Mireille and Mehl, Julia and Khomeijani Farahani, Saeed and Baum, Daniel and Duda, Georg}, title = {Novel image registration approach for combining 2D Osterix and collagen bundles images with 3D µCT}, volume = {10}, journal = {Journal of Bone and Mineral Research}, number = {3}, doi = {10.1093/jbmrpl/ziag009}, year = {2026}, language = {en} } @article{ZimperDjurdjevacHartmannetal.2025, author = {Zimper, Sebastian and Djurdjevac, Ana and Hartmann, Carsten and Sch{\"u}tte, Christof and Conrad, Natasa Djurdjevac}, title = {Mean-field optimal control with stochastic leaders}, arxiv = {http://arxiv.org/abs/2512.19201}, year = {2025}, abstract = {We consider interacting agent systems with a large number of stochastic agents (or particles) influenced by a fixed number of external stochastic lead agents. Such examples arise, for example in models of opinion dynamics, where a small number of leaders (influencers) can steer the behaviour of a large population of followers. In this context, we study a partial mean-field limit where the number of followers tends to infinity, while the number of leaders stays constant. The partial mean-field limit dynamics is then given by a McKean-Vlasov stochastic differential equation (SDE) for the followers, coupled to a controlled It{\^o}-SDE governing the dynamics of the lead agents. For a given cost functional that the lead agents seek to minimise, we show that the unique optimal control of the finite agent system convergences to the optimal control of the limiting system. This establishes that the low-dimensional control of the partial (mean-field) system provides an effective approximation for controlling the high-dimensional finite agent system. In addition, we propose a stochastic gradient descent algorithm that can efficiently approximate the mean-field control. Our theoretical results are illustrated on opinion dynamics model with lead agents, where the control objective is to drive the followers to reach consensus in finite time.}, language = {en} } @article{KresseSikorskiChewleetal.2026, author = {Kresse, Jakob and Sikorski, Alexander and Chewle, Surahit and Sunkara, Vikram and Weber, Marcus}, title = {Revealing the Atomistic Mechanism of Rare Events in Molecular Dynamics}, volume = {22}, journal = {Journal of Chemical Theory and Computation}, number = {5}, arxiv = {http://arxiv.org/abs/2511.15514}, doi = {10.1021/acs.jctc.5c01906}, pages = {2380 -- 2389}, year = {2026}, abstract = {Interpretable reaction coordinates are essential for understanding rare conformational transitions in molecular dynamics. The Atomistic Mechanism Of Rare Events in Molecular Dynamics (AMORE-MD) framework enhances interpretability of deep-learned reaction coordinates by connecting them to atomistic mechanisms, without requiring any a priori knowledge of collective variables, pathways, or endpoints. Here, AMORE-MD employs the ISOKANN algorithm to learn a neural membership function χ representing the dominant slow process, from which transition pathways are reconstructed as minimum-energy paths aligned with the gradient of χ, and atomic contributions are quantified through gradient-based sensitivity analysis. Iterative enhanced sampling further enriches transition regions and improves coverage of rare events enabling recovery of known mechanisms and chemically interpretable structural rearrangements at atomic resolution for the M{\"u}ller-Brown potential, alanine dipeptide, and the elastin-derived hexapeptide VGVAPG.}, language = {en} } @article{HartmannJoesterSchuetteetal.2026, author = {Hartmann, Carsten and J{\"o}ster, Annika and Sch{\"u}tte, Christof and Sikorski, Alexander and Weber, Marcus}, title = {Importance sampling of unbounded random stopping times: computing committor functions and exit rates without reweighting}, arxiv = {http://arxiv.org/abs/2601.01489}, year = {2026}, abstract = {Rare events in molecular dynamics are often related to noise-induced transitions between different macroscopic states (e.g., in protein folding). A common feature of these rare transitions is that they happen on timescales that are on average exponentially long compared to the characteristic timescale of the system, with waiting time distributions that have (sub)exponential tails and infinite support. As a result, sampling such rare events can lead to trajectories that can be become arbitrarily long, with not too low probability, which makes the reweighting of such trajectories a real challenge. Here, we discuss rare event simulation by importance sampling from a variational perspective, with a focus on applications in molecular dynamics, in particular the computation of committor functions. The idea is to design importance sampling schemes that (a) reduce the variance of a rare event estimator while controlling the average length of the trajectories and (b) that do not require the reweighting of possibly very long trajectories. In doing so, we study different stochastic control formulations for committor and mean first exit times, which we compare both from a theoretical and a computational point of view, including numerical studies of some benchmark examples.}, language = {en} } @article{AbouHamdanJanaColometal.2026, author = {Abou Hamdan, Loubnan and Jana, Aloke and Colom, R{\´e}mi and Aboujoussef, Nour and Carlson, Cooper and Overvig, Adam and Binkowski, Felix and Burger, Sven and Genevet, Patrice}, title = {A Complex-Frequency Framework for Kerker Unidirectionality in Photonic Resonators}, doi = {10.21203/rs.3.rs-8444305/v1}, year = {2026}, language = {en} } @article{WehlitzPavliotisSchuetteetal.2026, author = {Wehlitz, Nathalie and Pavliotis, Grigorios and Sch{\"u}tte, Christof and Winkelmann, Stefanie}, title = {Data-driven Reduction of Transfer Operators for Particle Clustering Dynamics}, arxiv = {http://arxiv.org/abs/2601.02932}, year = {2026}, abstract = {We develop an operator-based framework to coarse-grain interacting particle systems that exhibit clustering dynamics. Starting from the particle-based transfer operator, we first construct a sequence of reduced representations: the operator is projected onto concentrations and then further reduced by representing the concentration dynamics on a geometric low-dimensional manifold and an adapted finite-state discretization. The resulting coarse-grained transfer operator is finally estimated from dynamical simulation data by inferring the transition probabilities between the Markov states. Applied to systems with multichromatic and Morse interaction potentials, the reduced model reproduces key features of the clustering process, including transitions between cluster configurations and the emergence of metastable states. Spectral analysis and transition-path analysis of the estimated operator reveal implied time scales and dominant transition pathways, providing an interpretable and efficient description of particle-clustering dynamics.}, language = {en} } @article{AkhyarZhangStoltzetal.2025, author = {Akhyar, Fatima-Zahrae and Zhang, Wei and Stoltz, Gabriel and Sch{\"u}tte, Christof}, title = {Generative modeling of conditional probability distributions on the level-sets of collective variables}, arxiv = {http://arxiv.org/abs/2512.17374}, year = {2025}, abstract = {Given a probability distribution \$\mu\$ in \$\mathbb{R}^d\$ represented by data, we study in this paper the generative modeling of its conditional probability distributions on the level-sets of a collective variable \$\xi: \mathbb{R}^d \rightarrow \mathbb{R}^k\$, where \$1 \le k