TY - JOUR A1 - Lindner, Niels A1 - Reisch, Julian T1 - An analysis of the parameterized complexity of periodic timetabling JF - Journal of Scheduling N2 - Public transportation networks are typically operated with a periodic timetable. The periodic event scheduling problem (PESP) is the standard mathematical modeling tool for periodic timetabling. PESP is a computationally very challenging problem: For example, solving the instances of the benchmarking library PESPlib to optimality seems out of reach. Since PESP can be solved in linear time on trees, and the treewidth is a rather small graph parameter in the networks of the PESPlib, it is a natural question to ask whether there are polynomial-time algorithms for input networks of bounded treewidth, or even better, fixed-parameter tractable algorithms. We show that deciding the feasibility of a PESP instance is NP-hard even when the treewidth is 2, the branchwidth is 2, or the carvingwidth is 3. Analogous results hold for the optimization of reduced PESP instances, where the feasibility problem is trivial. Moreover, we show W[1]-hardness of the general feasibility problem with respect to treewidth, which means that we can most likely only accomplish pseudo-polynomial-time algorithms on input networks with bounded tree- or branchwidth. We present two such algorithms based on dynamic programming. We further analyze the parameterized complexity of PESP with bounded cyclomatic number, diameter, or vertex cover number. For event-activity networks with a special—but standard—structure, we give explicit and sharp bounds on the branchwidth in terms of the maximum degree and the carvingwidth of an underlying line network. Finally, we investigate several parameters on the smallest instance of the benchmarking library PESPlib. Y1 - 2022 U6 - https://doi.org/10.1007/s10951-021-00719-1 VL - 25 SP - 157 EP - 176 ER - TY - GEN A1 - Dittmann, Antje A1 - Hasler, Tim A1 - Oltmanns, Elias T1 - Archivierungsstrategie für audiovisuelles Material N2 - Im Rahmen ihrer Strategie zur Langzeitarchivierung forscht die Deutsche Kinemathek in einer Kooperation mit dem Zuse-Institut Berlin (ZIB) an der digitalen Langzeitarchivierung von AV-Materialien. Ausgangspunkt des Projektes sind die enormen Dateigrößen und die heterogenen Dateiformate, die einem Werk und einer Fassung zugeordnet werden müssen. Die Verwendung von persistenten Identifikatoren stellt den Lösungsansatz dar. T3 - ZIB-Report - 22-03 Y1 - 2022 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:0297-zib-85916 ER - TY - JOUR A1 - Prasad, Anup K. A1 - Tiwari, Chandni A1 - Ray, Sourav A1 - Holden, Stephanie A1 - Armstrong, David A. A1 - Rosengren, K. Johan A1 - Rodger, Alison A1 - Panwar, Ajay S. A1 - Martin, Lisandra L. T1 - Secondary Structure Transitions for a Family of Amyloidogenic, Antimircobial Uperin 3 Peptides in Contact with Sodium Dodecyl Sulfate JF - ChemPlusChem Y1 - 2022 U6 - https://doi.org/10.1002/cplu.202100408 VL - 87 SP - e202100408 ER - TY - JOUR A1 - Mokhtari, Zahra A1 - Patterson, Robert I. A. A1 - Höfling, Felix T1 - Spontaneous trail formation in populations of auto-chemotactic walkers JF - New Journal of Physics Y1 - 2022 U6 - https://doi.org/10.1088/1367-2630/ac43ec VL - 24 SP - 013012 ER - TY - GEN A1 - Rehfeldt, Daniel A1 - Koch, Thorsten A1 - Shinano, Yuji T1 - Faster exact solution of sparse MaxCut and QUBO problems T3 - ZIB-Report - 22-02 Y1 - 2022 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:0297-zib-85715 SN - 1438-0064 ER - TY - GEN A1 - Masing, Berenike A1 - Lindner, Niels A1 - Borndörfer, Ralf T1 - The Price of Symmetric Line Plans in the Parametric City N2 - We consider the line planning problem in public transport in the Parametric City, an idealized model that captures typical scenarios by a (small) number of parameters. The Parametric City is rotation symmetric, but optimal line plans are not always symmetric. This raises the question to quantify the symmetry gap between the best symmetric and the overall best solution. For our analysis, we formulate the line planning problem as a mixed integer linear program, that can be solved in polynomial time if the solutions are forced to be symmetric. The symmetry gap is provably small when a specific Parametric City parameter is fixed, and we give an approximation algorithm for line planning in the Parametric City in this case. While the symmetry gap can be arbitrarily large in general, we show that symmetric line plans are a good choice in most practical situations. T3 - ZIB-Report - 22-01 KW - line planning KW - mixed integer programming KW - parametric city modeling Y1 - 2022 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:0297-zib-85648 SN - 1438-0064 ER - TY - GEN T1 - Annual Report 2020 T3 - Jahresbericht - 2020 KW - Jahresbericht Y1 - 2022 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:0297-zib-85609 SN - 0934-5892 VL - 2020 ER - TY - GEN T1 - Annual Report 2019 T3 - Jahresbericht - 2019 KW - Jahresbericht Y1 - 2022 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:0297-zib-85594 SN - 0934-5892 VL - 2019 ER - TY - JOUR A1 - Šofranac, Boro A1 - Gleixner, Ambros A1 - Pokutta, Sebastian T1 - Accelerating domain propagation: An efficient GPU-parallel algorithm over sparse matrices JF - Parallel Computing N2 - • Currently, domain propagation in state-of-the-art MIP solvers is single thread only. • The paper presents a novel, efficient GPU algorithm to perform domain propagation. • Challenges are dynamic algorithmic behavior, dependency structures, sparsity patterns. • The algorithm is capable of running entirely on the GPU with no CPU involvement. • We achieve speed-ups of around 10x to 20x, up to 180x on favorably-large instances. Y1 - 2022 U6 - https://doi.org/10.1016/j.parco.2021.102874 VL - 109 SP - 102874 ER - TY - JOUR A1 - Eifler, Leon A1 - Gleixner, Ambros T1 - A computational status update for exact rational mixed integer programming JF - Mathematical Programming N2 - The last milestone achievement for the roundoff-error-free solution of general mixed integer programs over the rational numbers was a hybrid-precision branch-and-bound algorithm published by Cook, Koch, Steffy, and Wolter in 2013. We describe a substantial revision and extension of this framework that integrates symbolic presolving, features an exact repair step for solutions from primal heuristics, employs a faster rational LP solver based on LP iterative refinement, and is able to produce independently verifiable certificates of optimality. We study the significantly improved performance and give insights into the computational behavior of the new algorithmic components. On the MIPLIB 2017 benchmark set, we observe an average speedup of 10.7x over the original framework and 2.9 times as many instances solved within a time limit of two hours. Y1 - 2022 U6 - https://doi.org/10.1007/s10107-021-01749-5 PB - Springer ER - TY - JOUR A1 - Heida, Martin A1 - Sikorski, Alexander A1 - Weber, Marcus T1 - Consistency and order 1 convergence of cell-centered finite volume discretizations of degenerate elliptic problems in any space dimension JF - SIAM Journal on Numerical Analysis N2 - We study consistency of cell-centered finite difference methods for elliptic equations with degenerate coefficients in any space dimension $d \geq 2$. This results in order of convergence estimates in the natural weighted energy norm and in the weighted discrete $L^2$-norm on admissible meshes. The cells of meshes under consideration may be very irregular in size. We particularly allow the size of certain cells to remain bounded from below even in the asymptotic limit. For uniform meshes we show that the order of convergence is at least 1 in the energy semi-norm, provided the discrete and continuous solutions exist and the continuous solution has $H^2$ regularity. Y1 - 2022 U6 - https://doi.org/10.20347/WIAS.PREPRINT.2913 ER - TY - GEN A1 - Bertelmann, Roland A1 - Koch, Thorsten A1 - Ceynowa, Klaus A1 - Söllner, Konstanze A1 - Christof, Jürgen A1 - Rusch, Beate A1 - Schäffler, Hildegard A1 - Putnings, Markus A1 - Pampel, Heinz A1 - Kuberek, Monika A1 - Boltze, Julia A1 - Lohrum, Stefan A1 - Retter, Regina A1 - Höllerl, Annika A1 - Faensen, Katja A1 - Steffen, Ronald A1 - Gross, Matthias A1 - Hoffmann, Cornelia A1 - Haoua, Marsa T1 - DeepGreen: Etablierung und Weiterentwicklung rechtssicherer Workflows zur effizienten Umsetzung von Open-Access-Komponenten in Lizenzvereinbarungen für wissenschaftliche Publikationen – Abschlussbericht N2 - DeepGreen wurde vom 01.08.2018 bis zum 30.06.2021 in einer zweiten Projektphase von der Deutschen Forschungsgemeinschaft (DFG) gefördert. DeepGreen unterstützt Bibliotheken als Dienstleister für Hochschulen, außeruniversitäre Forschungseinrichtungen und die dort tätigen Wissenschaftler:innen dabei, Publikationen auf Open-Access-Repositorien frei zugänglich zu machen und fördert das Zusammenspiel von wissenschaftlichen Einrichtungen und Verlagen. An der zweiten Projektphase waren der Kooperative Bibliotheksverbund Berlin-Brandenburg, die Bayerische Staatsbibliothek, der Bibliotheksverbund Bayern, die Universitätsbibliotheken der Friedrich-Alexander-Universität Erlangen-Nürnberg und der Technischen Universität Berlin und das Helmholtz Open Science Office beteiligt. In dem Projekt wurde erfolgreich eine technische und organisatorische Lösung zur automatisierten Verteilung von Artikeldaten wissenschaftlicher Verlage an institutionelle und fachliche Repositorien entwickelt. In der zweiten Projektphase lag der Fokus auf der Erprobung der Datendrehscheibe in der Praxis und der Ausweitung auf weitere Datenabnehmer und weitere Verlage. Im Anschluss an die DFG-geförderte Projektlaufzeit ist DeepGreen in einen zweijährigen Pilotbetrieb übergegangen. Ziel des Pilotbetriebs ist es, den Übergang in einen bundesweiten Real-Betrieb vorzubereiten. T3 - ZIB-Report - 21-37 KW - Open Access KW - Repositorien KW - DeepGreen Y1 - 2022 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:0297-zib-85420 SN - 1438-0064 ER - TY - CHAP A1 - Hanik, Martin A1 - Hege, Hans-Christian A1 - von Tycowicz, Christoph T1 - A Nonlinear Hierarchical Model for Longitudinal Data on Manifolds T2 - 2022 IEEE 19th International Symposium on Biomedical Imaging (ISBI) N2 - Large longitudinal studies provide lots of valuable information, especially in medical applications. A problem which must be taken care of in order to utilize their full potential is that of correlation between intra-subject measurements taken at different times. For data in Euclidean space this can be done with hierarchical models, that is, models that consider intra-subject and between-subject variability in two different stages. Nevertheless, data from medical studies often takes values in nonlinear manifolds. Here, as a first step, geodesic hierarchical models have been developed that generalize the linear ansatz by assuming that time-induced intra-subject variations occur along a generalized straight line in the manifold. However, this is often not the case (e.g., periodic motion or processes with saturation). We propose a hierarchical model for manifold-valued data that extends this to include trends along higher-order curves, namely Bézier splines in the manifold. To this end, we present a principled way of comparing shape trends in terms of a functional-based Riemannian metric. Remarkably, this metric allows efficient, yet simple computations by virtue of a variational time discretization requiring only the solution of regression problems. We validate our model on longitudinal data from the osteoarthritis initiative, including classification of disease progression. Y1 - 2022 U6 - https://doi.org/10.1109/ISBI52829.2022.9761465 SP - 1 EP - 5 ER - TY - JOUR A1 - Garcia Santiago, Xavier A1 - Hammerschmidt, Martin A1 - Sachs, Johannes A1 - Burger, Sven A1 - Kwon, Hyunah A1 - Knöller, Marvin A1 - Arens, Tilo A1 - Fischer, Peer A1 - Fernandez-Corbaton, Ivan A1 - Rockstuhl, Carsten T1 - Toward maximally electromagnetically chiral scatterers at optical frequencies JF - ACS Photonics Y1 - 2022 U6 - https://doi.org/10.1021/acsphotonics.1c01887 VL - 9 SP - 1954 ER - TY - JOUR A1 - Rehfeldt, Daniel A1 - Franz, Henriette A1 - Koch, Thorsten T1 - Optimal Connected Subgraphs: Integer Programming Formulations and Polyhedra JF - Networks Y1 - 2022 U6 - https://doi.org/10.1002/net.22101 VL - 80 IS - 3 SP - 314 EP - 332 PB - Wiley ER - TY - JOUR A1 - Grewe, Carl Martin A1 - Liu, Tuo A1 - Hildebrandt, Andrea A1 - Zachow, Stefan T1 - The Open Virtual Mirror Framework for Enfacement Illusions - Enhancing the Sense of Agency With Avatars That Imitate Facial Expressions JF - Behavior Research Methods Y1 - 2022 U6 - https://doi.org/10.3758/s13428-021-01761-9 PB - Springer ER - TY - JOUR A1 - Colom, Remi A1 - Binkowski, Felix A1 - Betz, Fridtjof A1 - Kivshar, Yuri A1 - Burger, Sven T1 - Enhanced Purcell factor for nanoantennas supporting interfering resonances JF - Phys. Rev. Research Y1 - 2022 U6 - https://doi.org/10.1103/PhysRevResearch.4.023189 VL - 4 SP - 023189 ER - TY - JOUR A1 - Zhang, Wei A1 - Li, Tiejun A1 - Schütte, Christof T1 - Solving eigenvalue PDEs of metastable diffusion processes using artificial neural networks JF - Journal of Computational Physics N2 - In this paper, we consider the eigenvalue PDE problem of the infinitesimal generators of metastable diffusion processes. We propose a numerical algorithm based on training artificial neural networks for solving the leading eigenvalues and eigenfunctions of such high-dimensional eigenvalue problem. The algorithm is useful in understanding the dynamical behaviors of metastable processes on large timescales. We demonstrate the capability of our algorithm on a high-dimensional model problem, and on the simple molecular system alanine dipeptide. Y1 - 2021 U6 - https://doi.org/10.1016/j.jcp.2022.111377 VL - 465 ER - TY - JOUR A1 - Martens, Kevin A1 - Funck, Timon A1 - Santiago, Eva Y. A1 - Govorov, Alexander O. A1 - Burger, Sven A1 - Liedl, Tim T1 - Onset of Chirality in Plasmonic Meta-Molecules and Dielectric Coupling JF - ACS Nano Y1 - 2022 U6 - https://doi.org/10.1021/acsnano.2c04729 VL - 16 SP - 16143 ER - TY - JOUR A1 - Eifler, Leon A1 - Gleixner, Ambros A1 - Pulaj, Jonad T1 - A Safe Computational Framework for Integer Programming applied to Chvátal's Conjecture JF - ACM Transactions on Mathematical Software N2 - We describe a general and safe computational framework that provides integer programming results with the degree of certainty that is required for machine-assisted proofs of mathematical theorems. At its core, the framework relies on a rational branch-and-bound certificate produced by an exact integer programming solver, SCIP, in order to circumvent floating-point roundoff errors present in most state-of-the-art solvers for mixed-integer programs.The resulting certificates are self-contained and checker software exists that can verify their correctness independently of the integer programming solver used to produce the certificate. This acts as a safeguard against programming errors that may be present in complex solver software. The viability of this approach is tested by applying it to finite cases of Chvátal's conjecture, a long-standing open question in extremal combinatorics. We take particular care to verify also the correctness of the input for this specific problem, using the Coq formal proof assistant. As a result we are able to provide a first machine-assisted proof that Chvátal's conjecture holds for all downsets whose union of sets contains seven elements or less. Y1 - 2022 U6 - https://doi.org/10.1145/3485630 VL - 48 IS - 2 ER - TY - JOUR A1 - Mollenhauer, Mattes A1 - Klus, Stefan A1 - Schütte, Christof A1 - Koltai, Péter T1 - Kernel Autocovariance Operators of Stationary Processes: Estimation and Convergence JF - Journal of Machine Learning Research N2 - We consider autocovariance operators of a stationary stochastic process on a Polish space that is embedded into a reproducing kernel Hilbert space. We investigate how empirical estimates of these operators converge along realizations of the process under various conditions. In particular, we examine ergodic and strongly mixing processes and obtain several asymptotic results as well as finite sample error bounds. We provide applications of our theory in terms of consistency results for kernel PCA with dependent data and the conditional mean embedding of transition probabilities. Finally, we use our approach to examine the nonparametric estimation of Markov transition operators and highlight how our theory can give a consistency analysis for a large family of spectral analysis methods including kernel-based dynamic mode decomposition. Y1 - 2022 UR - https://jmlr.org/papers/v23/20-442.html VL - 23 IS - 327 SP - 1 EP - 34 ER - TY - JOUR A1 - Hanik, Martin A1 - Demirtaş, Mehmet Arif A1 - Gharsallaoui, Mohammed Amine A1 - Rekik, Islem T1 - Predicting cognitive scores with graph neural networks through sample selection learning JF - Brain Imaging and Behavior N2 - Analyzing the relation between intelligence and neural activity is of the utmost importance in understanding the working principles of the human brain in health and disease. In existing literature, functional brain connectomes have been used successfully to predict cognitive measures such as intelligence quotient (IQ) scores in both healthy and disordered cohorts using machine learning models. However, existing methods resort to flattening the brain connectome (i.e., graph) through vectorization which overlooks its topological properties. To address this limitation and inspired from the emerging graph neural networks (GNNs), we design a novel regression GNN model (namely RegGNN) for predicting IQ scores from brain connectivity. On top of that, we introduce a novel, fully modular sample selection method to select the best samples to learn from for our target prediction task. However, since such deep learning architectures are computationally expensive to train, we further propose a \emph{learning-based sample selection} method that learns how to choose the training samples with the highest expected predictive power on unseen samples. For this, we capitalize on the fact that connectomes (i.e., their adjacency matrices) lie in the symmetric positive definite (SPD) matrix cone. Our results on full-scale and verbal IQ prediction outperforms comparison methods in autism spectrum disorder cohorts and achieves a competitive performance for neurotypical subjects using 3-fold cross-validation. Furthermore, we show that our sample selection approach generalizes to other learning-based methods, which shows its usefulness beyond our GNN architecture. Y1 - 2022 U6 - https://doi.org/10.1007/s11682-021-00585-7 VL - 16 SP - 1123 EP - 1138 ER - TY - JOUR A1 - Schlechte, Thomas A1 - Borndörfer, Ralf A1 - Denißen, Jonas A1 - Heller, Simon A1 - Klug, Torsten A1 - Küpper, Michael A1 - Lindner, Niels A1 - Reuther, Markus A1 - Söhlke, Andreas A1 - Steadman, William T1 - Timetable Optimization for a Moving Block System JF - Journal of Rail Transport Planning & Management N2 - We present an optimization model which is capable of routing and ordering trains on a microscopic level under a moving block regime. Based on a general timetabling definition (GTTP) that allows the plug in of arbitrarily detailed methods to compute running and headway times, we describe a layered graph approach using velocity expansion, and develop a mixed integer linear programming formulation. Finally, we present promising results for a German corridor scenario with mixed traffic, indicating that applying branch-and-cut to our model is able to solve reasonably sized instances with up to hundred trains to optimality. Y1 - 2022 U6 - https://doi.org/10.1016/j.jrtpm.2022.100315 SN - 2210-9706 VL - 22 SP - 100315 ER - TY - JOUR A1 - del Razo, Mauricio A1 - Frömberg, Daniela A1 - Straube, Arthur A1 - Schütte, Christof A1 - Höfling, Felix A1 - Winkelmann, Stefanie T1 - A probabilistic framework for particle-based reaction–diffusion dynamics using classical Fock space representations JF - Letters in Mathematical Physics Y1 - 2022 U6 - https://doi.org/10.1007/s11005-022-01539-w VL - 112 IS - 49 ER - TY - JOUR A1 - Lenz, Ralf A1 - Becker, Kai-Helge T1 - Optimization of Capacity Expansion in Potential-driven Networks including Multiple Looping - A comparison of modelling approaches JF - OR Spectrum N2 - In commodity transport networks such as natural gas, hydrogen and water networks, flows arise from nonlinear potential differences between the nodes, which can be represented by so-called "potential-driven" network models. When operators of these networks face increasing demand or the need to handle more diverse transport situations, they regularly seek to expand the capacity of their network by building new pipelines parallel to existing ones ("looping"). The paper introduces a new mixed-integer non-linear programming (MINLP) model and a new non-linear programming (NLP) model and compares these with existing models for the looping problem and related problems in the literature, both theoretically and experimentally. On this basis, we give recommendations about the circumstances under which a certain model should be used. In particular, it turns out that one of our novel models outperforms the existing models. Moreover, the paper is the first to include the practically relevant option that a particular pipeline may be looped several times. Y1 - 2022 U6 - https://doi.org/https://doi.org/10.1007/s00291-021-00648-7 VL - 44 SP - 179 EP - 224 ER - TY - JOUR A1 - Mathieu, Besançon A1 - Carderera, Alejandro A1 - Pokutta, Sebastian T1 - FrankWolfe.jl: a high-performance and flexible toolbox for Frank-Wolfe algorithms and Conditional Gradients JF - INFORMS Journal on Computing N2 - We present FrankWolfe.jl, an open-source implementation of several popular Frank–Wolfe and conditional gradients variants for first-order constrained optimization. The package is designed with flexibility and high performance in mind, allowing for easy extension and relying on few assumptions regarding the user-provided functions. It supports Julia’s unique multiple dispatch feature, and it interfaces smoothly with generic linear optimization formulations using MathOptInterface.jl. Y1 - 2022 U6 - https://doi.org/10.1287/ijoc.2022.1191 VL - 34 IS - 5 SP - 2383 EP - 2865 ER - TY - CHAP A1 - Criado, Francisco A1 - Martínez-Rubio, David A1 - Pokutta, Sebastian T1 - Fast Algorithms for Packing Proportional Fairness and its Dual T2 - Proceedings of the Conference on Neural Information Processing Systems N2 - The proportional fair resource allocation problem is a major problem studied in flow control of networks, operations research, and economic theory, where it has found numerous applications. This problem, defined as the constrained maximization of sum_i log x_i, is known as the packing proportional fairness problem when the feasible set is defined by positive linear constraints and x ∈ R≥0. In this work, we present a distributed accelerated first-order method for this problem which improves upon previous approaches. We also design an algorithm for the optimization of its dual problem. Both algorithms are width-independent. Y1 - 2022 VL - 36 ER - TY - CHAP A1 - Pedersen, Jaap A1 - Hoppmann-Baum, Kai A1 - Zittel, Janina A1 - Koch, Thorsten T1 - Blending hydrogen into natural gas: An assessment of the capacity of the German gas grid T2 - Operations Research Proceedings 2021 N2 - In the transition towards a pure hydrogen infrastructure, repurposing the existing natural gas infrastructure is considered. In this study, the maximal technically feasible injection of hydrogen into the existing German natural gas transmission network is analysed with respect to regulatory limits regarding the gas quality. We propose a transient tracking model based on the general pooling problem including linepack. The analysis is conducted using real-world hourly gas flow data on a network of about 10,000 km length. Y1 - 2022 U6 - https://doi.org/https://doi.org/10.1007/978-3-031-08623-6_28 SP - 182 EP - 187 ER - TY - JOUR A1 - Petkovic, Milena A1 - Chen, Ying A1 - Gamrath, Inken A1 - Gotzes, Uwe A1 - Hadjidimitrou, Natalia Selini A1 - Zittel, Janina A1 - Xu, Xiaofei A1 - Koch, Thorsten T1 - A hybrid approach for high precision prediction of gas flows JF - Energy Systems N2 - About 23% of the German energy demand is supplied by natural gas. Additionally, for about the same amount Germany serves as a transit country. Thereby, the German network represents a central hub in the European natural gas transport network. The transport infrastructure is operated by transmissions system operators (TSOs). The number one priority of the TSOs is to ensure the security of supply. However, the TSOs have only very limited knowledge about the intentions and planned actions of the shippers (traders). Open Grid Europe (OGE), one of Germany’s largest TSO, operates a high-pressure transport network of about 12,000 km length. With the introduction of peak-load gas power stations, it is of great importance to predict in- and out-flow of the network to ensure the necessary flexibility and security of supply for the German Energy Transition (“Energiewende”). In this paper, we introduce a novel hybrid forecast method applied to gas flows at the boundary nodes of a transport network. This method employs an optimized feature selection and minimization. We use a combination of a FAR, LSTM and mathematical programming to achieve robust high-quality forecasts on real-world data for different types of network nodes. Y1 - 2022 U6 - https://doi.org/10.1007/s12667-021-00466-4 VL - 13 SP - 383 EP - 408 ER - TY - JOUR A1 - Le, Thi Thai A1 - Fukumoto, Yasuhide T1 - Effect of depth discontinuity on interfacial stability of tangential-velocity discontinuity in shallow-water flow JF - Physics Letters A N2 - It is well known as the Kelvin-Helmholtz instability (KHI) that an interface of tangential velocity discontinuity is necessarily unstable, regardless of the velocity difference's strength. However, the KHI is suppressed for shallow water flows if the Froude number, defined by the ratio of the velocity difference to the gravity wave's speed, is sufficiently large. In this investigation, we examine the effect of the depth difference of two fluid layers on the KHI. The depth difference enhances instability. Given the Froude number in the instability range, the growth rate sensitively depends on the depth ratio and increases monotonically with the depth ratio difference from unity. The critical value of the Froude number for stabilization varies with the depth ratio and attains the minimum value √8 for equal depth. This behavior is verified by asymptotic analysis. Y1 - 2022 U6 - https://doi.org/10.1016/j.physleta.2022.128073 VL - 436 SP - 128073 PB - ELSEVIER ER - TY - JOUR A1 - Oehme, Stephan A1 - Moewis, Philippe A1 - Boeth, Heide A1 - Bartek, Benjamin A1 - Lippert, Annika A1 - von Tycowicz, Christoph A1 - Ehrig, Rainald A1 - Duda, Georg A1 - Jung, Tobias T1 - PCL insufficient patients with increased translational and rotational passive knee joint laxity have no increased range of anterior–posterior and rotational tibiofemoral motion during level walking JF - Scientific Reports Y1 - 2022 U6 - https://doi.org/10.1038/s41598-022-17328-3 VL - 12 IS - 1 SP - 1 EP - 11 ER - TY - JOUR A1 - Ayanbayev, Birzhan A1 - Klebanov, Ilja A1 - Lie, Han Cheng A1 - Sullivan, T. J. T1 - Γ-convergence of Onsager–Machlup functionals: II. Infinite product measures on Banach spaces JF - Inverse Problems Y1 - 2022 U6 - https://doi.org/10.1088/1361-6420/ac3f82 VL - 38 IS - 2 ER - TY - JOUR A1 - Ayanbayev, Birzhan A1 - Klebanov, Ilja A1 - Lie, Han Cheng A1 - Sullivan, T. J. T1 - Γ-convergence of Onsager–Machlup functionals: I. With applications to maximum a posteriori estimation in Bayesian inverse problems JF - Inverse Problems Y1 - 2022 U6 - https://doi.org/10.1088/1361-6420/ac3f81 VL - 38 IS - 2 ER - TY - JOUR A1 - Alhaddad, Samer A1 - Förstner, Jens A1 - Groth, Stefan A1 - Grünewald, Daniel A1 - Grynko, Yevgen A1 - Hannig, Frank A1 - Kenter, Tobias A1 - Pfreundt, F.J. A1 - Plessl, Christian A1 - Schotte, Merlind A1 - Steinke, Thomas A1 - Teich, J. A1 - Weiser, Martin A1 - Wende, Florian T1 - The HighPerMeshes Framework for Numerical Algorithms on Unstructured Grids JF - Concurrency and Computation: Practice and Experience N2 - Solving PDEs on unstructured grids is a cornerstone of engineering and scientific computing. Heterogeneous parallel platforms, including CPUs, GPUs, and FPGAs, enable energy-efficient and computationally demanding simulations. In this article, we introduce the HPM C++-embedded DSL that bridges the abstraction gap between the mathematical formulation of mesh-based algorithms for PDE problems on the one hand and an increasing number of heterogeneous platforms with their different programming models on the other hand. Thus, the HPM DSL aims at higher productivity in the code development process for multiple target platforms. We introduce the concepts as well as the basic structure of the HPM DSL, and demonstrate its usage with three examples. The mapping of the abstract algorithmic description onto parallel hardware, including distributed memory compute clusters, is presented. A code generator and a matching back end allow the acceleration of HPM code with GPUs. Finally, the achievable performance and scalability are demonstrated for different example problems. Y1 - 2022 U6 - https://doi.org/10.1002/cpe.6616 VL - 34 IS - 14 ER - TY - CHAP A1 - Chegini, Fatemeh A1 - Kopanicakova, Alena A1 - Weiser, Martin A1 - Krause, Rolf T1 - Quantitative Analysis of Nonlinear MultifidelityOptimization for Inverse Electrophysiology T2 - Domain Decomposition Methods in Science and Engineering XXVI N2 - The electric conductivity of cardiac tissue determines excitation propagation and is important for quantifying ischemia and scar tissue and for building personalized models. Estimating conductivity distributions from endocardial mapping data is a challenging inverse problem due to the computational complexity of the monodomain equation, which describes the cardiac excitation. For computing a maximum posterior estimate, we investigate different optimization approaches based on adjoint gradient computation: steepest descent, limited memory BFGS, and recursive multilevel trust region methods, which are using mesh hierarchies or heterogeneous model hierarchies. We compare overall performance, asymptotic convergence rate, and pre-asymptotic progress on selected examples in order to assess the benefit of our multifidelity acceleration. Y1 - 2022 SP - 65 EP - 76 PB - Springer ER - TY - JOUR A1 - Negrin-Montecelo, Yoel A1 - Movsesyan, Artur A1 - Gao, Jie A1 - Burger, Sven A1 - Wang, Zhiming A1 - Nlate, Sylvain A1 - Pouget, Emilie A1 - Oda, Reiko A1 - Comesana-Hermo, Miguel A1 - Govorov, Alexander O. A1 - Correa-Duarte, Miguel T1 - Chiral Generation of Hot Carriers for Polarization-Sensitive Plasmonic Photocatalysis with Hybrid Nanostructures JF - J. Am. Chem. Soc. Y1 - 2022 U6 - https://doi.org/10.1021/jacs.1c10526 VL - 144 SP - 1663 ER - TY - GEN A1 - Koch, Thorsten A1 - Berthold, Timo A1 - Pedersen, Jaap A1 - Vanaret, Charlie T1 - Progress in Mathematical Programming Solvers from 2001 to 2020 N2 - This study investigates the progress made in LP and MILP solver performance during the last two decades by comparing the solver software from the beginning of the millennium with the codes available today. On average, we found out that for solving LP/MILP, computer hardware got about 20 times faster, and the algorithms improved by a factor of about nine for LP and around 50 for MILP, which gives a total speed-up of about 180 and 1,000 times, respectively. However, these numbers have a very high variance and they considerably underestimate the progress made on the algorithmic side: many problem instances can nowadays be solved within seconds, which the old codes are not able to solve within any reasonable time. T3 - ZIB-Report - 21-20 Y1 - 2022 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:0297-zib-82779 SN - 1438-0064 ER - TY - JOUR A1 - Ernst, Ariane A1 - Schütte, Christof A1 - Sigrist, Stephan A1 - Winkelmann, Stefanie T1 - Variance of filtered signals: Characterization for linear reaction networks and application to neurotransmission dynamics JF - Mathematical Biosciences N2 - Neurotransmission at chemical synapses relies on the calcium-induced fusion of synaptic vesicles with the presynaptic membrane. The distance to the calcium channels determines the release probability and thereby the postsynaptic signal. Suitable models of the process need to capture both the mean and the variance observed in electrophysiological measurements of the postsynaptic current. In this work, we propose a method to directly compute the exact first- and second-order moments for signals generated by a linear reaction network under convolution with an impulse response function, rendering computationally expensive numerical simulations of the underlying stochastic counting process obsolete. We show that the autocorrelation of the process is central for the calculation of the filtered signal’s second-order moments, and derive a system of PDEs for the cross-correlation functions (including the autocorrelations) of linear reaction networks with time-dependent rates. Finally, we employ our method to efficiently compare different spatial coarse graining approaches for a specific model of synaptic vesicle fusion. Beyond the application to neurotransmission processes, the developed theory can be applied to any linear reaction system that produces a filtered stochastic signal. Y1 - 2022 U6 - https://doi.org/10.1016/j.mbs.2021.108760 VL - 343 ER - TY - JOUR A1 - Gao, Timm A1 - Rickert, Lucas A1 - Urban, Felix A1 - Große, Jan A1 - Srocka, Nicole A1 - Rodt, Sven A1 - Musial, Anna A1 - Zolnacz, Kinga A1 - Mergo, Pawel A1 - Dybka, Kamil A1 - Urbanczyk, Waclaw A1 - Sek, Grzegorz A1 - Burger, Sven A1 - Reitzenstein, Stephan A1 - Heindel, Tobias T1 - A quantum key distribution testbed using a plug&play telecom-wavelength single-photon source JF - Appl. Phys. Rev. Y1 - 2022 U6 - https://doi.org/10.1063/5.0070966 VL - 9 SP - 011412 ER - TY - JOUR A1 - Peppert, Felix A1 - von Kleist, Max A1 - Schütte, Christof A1 - Sunkara, Vikram T1 - On the Sufficient Condition for Solving the Gap-Filling Problem Using Deep Convolutional Neural Networks JF - IEEE Transactions on Neural Networks and Learning Systems N2 - Deep convolutional neural networks (DCNNs) are routinely used for image segmentation of biomedical data sets to obtain quantitative measurements of cellular structures like tissues. These cellular structures often contain gaps in their boundaries, leading to poor segmentation performance when using DCNNs like the U-Net. The gaps can usually be corrected by post-hoc computer vision (CV) steps, which are specific to the data set and require a disproportionate amount of work. As DCNNs are Universal Function Approximators, it is conceivable that the corrections should be obsolete by selecting the appropriate architecture for the DCNN. In this article, we present a novel theoretical framework for the gap-filling problem in DCNNs that allows the selection of architecture to circumvent the CV steps. Combining information-theoretic measures of the data set with a fundamental property of DCNNs, the size of their receptive field, allows us to formulate statements about the solvability of the gap-filling problem independent of the specifics of model training. In particular, we obtain mathematical proof showing that the maximum proficiency of filling a gap by a DCNN is achieved if its receptive field is larger than the gap length. We then demonstrate the consequence of this result using numerical experiments on a synthetic and real data set and compare the gap-filling ability of the ubiquitous U-Net architecture with variable depths. Our code is available at https://github.com/ai-biology/dcnn-gap-filling. Y1 - 2022 U6 - https://doi.org/10.1109/TNNLS.2021.3072746 VL - 33 IS - 11 SP - 6194 EP - 6205 ER - TY - JOUR A1 - Lücke, Marvin A1 - Lu, Jingyi A1 - Quevedo, Daniel E. T1 - Coding for secrecy in remote state estimation with an adversary JF - IEEE Transactions on Automatic Control N2 - We study the problem of remote state estimation in the presence of an eavesdropper. A sensor transmits state information over a packet-dropping link to a legitimate user. This information is randomly overheard by an eavesdropper. To reduce information leakage to the eavesdropper, previous studies have shown that by encoding the estimate with the acknowledgments (Acks), perfect secrecy can be achieved. However, this strategy greatly relies on the accuracy of the Acks and may easily fail if the Acks are compromised by cyberattacks. In this article, we tackle this issue by proposing to switch between sending an encoded state and sending the plain state to stay resilient against fake Acks. Specifically, we assume the Acks to be randomly attacked and derive recursive expressions for the minimum-mean-squared error estimates and error covariance matrices at the legitimate user and at the eavesdropper. Based upon this, we propose a transmission policy that depends on the probability of synchronization. We formulate a partially observable Markov decision process to model the evolution of the synchronization status and derive associated optimal transmission policies. Numerical examples are provided to verify the theoretical results. Y1 - 2022 U6 - https://doi.org/10.1109/TAC.2022.3169839 VL - 67 IS - 9 SP - 4955 EP - 4962 ER - TY - JOUR A1 - Rehfeldt, Daniel A1 - Hobbie, Hannes A1 - Schönheit, David A1 - Koch, Thorsten A1 - Möst, Dominik A1 - Gleixner, Ambros T1 - A massively parallel interior-point solver for LPs with generalized arrowhead structure, and applications to energy system models JF - European Journal of Operational Research N2 - Linear energy system models are a crucial component of energy system design and operations, as well as energy policy consulting. If detailed enough, such models lead to large-scale linear programs, which can be intractable even for the best state-of-the-art solvers. This article introduces an interior-point solver that exploits common structures of energy system models to efficiently run in parallel on distributed-memory systems. The solver is designed for linear programs with doubly-bordered block-diagonal constraint matrix and makes use of a Schur complement based decomposition. In order to handle the large number of linking constraints and variables commonly observed in energy system models, a distributed Schur complement preconditioner is used. In addition, the solver features a number of more generic techniques such as parallel matrix scaling and structure-preserving presolving. The implementation is based on the solver PIPS-IPM. We evaluate the computational performance on energy system models with up to four billion nonzero entries in the constraint matrix—and up to one billion columns and one billion rows. This article mainly concentrates on the energy system model ELMOD, which is a linear optimization model representing the European electricity markets by the use of a nodal pricing market-clearing. It has been widely applied in the literature on energy system analyses in recent years. However, it will be demonstrated that the new solver is also applicable to other energy system models. Y1 - 2022 U6 - https://doi.org/10.1016/j.ejor.2021.06.063 VL - 296 IS - 1 SP - 60 EP - 71 ER - TY - JOUR A1 - Anderson, Lovis A1 - Turner, Mark A1 - Koch, Thorsten T1 - Generative deep learning for decision making in gas networks JF - Mathematical Methods of Operations Research N2 - A decision support system relies on frequent re-solving of similar problem instances. While the general structure remains the same in corresponding applications, the input parameters are updated on a regular basis. We propose a generative neural network design for learning integer decision variables of mixed-integer linear programming (MILP) formulations of these problems. We utilise a deep neural network discriminator and a MILP solver as our oracle to train our generative neural network. In this article, we present the results of our design applied to the transient gas optimisation problem. With the trained network we produce a feasible solution in 2.5s, use it as a warm-start solution, and thereby decrease global optimal solution solve time by 60.5%. Y1 - 2022 U6 - https://doi.org/10.1007/s00186-022-00777-x VL - 95 SP - 503 EP - 532 PB - Springer Nature ER - TY - JOUR A1 - Rams, Mona A1 - Conrad, Tim T1 - Dictionary learning allows model-free pseudotime estimation of transcriptomics data JF - BMC Genomics Y1 - 2022 U6 - https://doi.org/10.1186/s12864-021-08276-9 VL - 23 PB - BioMed Central ER - TY - JOUR A1 - Fackeldey, Konstantin A1 - Oster, Mathias A1 - Sallandt, Leon A1 - Schneider, Reinhold T1 - Approximative Policy Iteration for Exit Time Feedback Control Problems driven by Stochastic Differential Equations using Tensor Train format JF - SIAM Journal on Multiscale Modeling and Simulation N2 - We consider a stochastic optimal exit time feedback control problem. The Bellman equation is solved approximatively via the Policy Iteration algorithm on a polynomial ansatz space by a sequence of linear equations. As high degree multi-polynomials are needed, the corresponding equations suffer from the curse of dimensionality even in moderate dimensions. We employ tensor-train methods to account for this problem. The approximation process within the Policy Iteration is done via a Least-Squares ansatz and the integration is done via Monte-Carlo methods. Numerical evidences are given for the (multi dimensional) double well potential and a three-hole potential. Y1 - 2022 U6 - https://doi.org/10.1137/20M1372500 VL - 20 IS - 1 SP - 379 EP - 403 ER - TY - JOUR A1 - Lelievre, Tony A1 - Stoltz, Gabriel A1 - Zhang, Wei T1 - Multiple projection MCMC algorithms on submanifolds JF - IMA Journal of Numerical Analysis N2 - We propose new Markov Chain Monte Carlo algorithms to sample probability distributions on submanifolds, which generalize previous methods by allowing the use of set-valued maps in the proposal step of the MCMC algorithms. The motivation for this generalization is that the numerical solvers used to project proposed moves to the submanifold of interest may find several solutions. We show that the new algorithms indeed sample the target probability measure correctly, thanks to some carefully enforced reversibility property. We demonstrate the interest of the new MCMC algorithms on illustrative numerical examples. Y1 - 2022 U6 - https://doi.org/10.1093/imanum/drac006 ER - TY - JOUR A1 - Plöntzke, Julia A1 - Berg, Mascha A1 - Ehrig, Rainald A1 - Leonhard-Marek, Sabine A1 - Müller, Kerstin-Elisabeth A1 - Röblitz, Susanna T1 - Model Based Exploration of Hypokalemia in Dairy Cows JF - Scientific Reports N2 - Hypokalemia, characterized by too low serum potassium levels, is a severe mineral disorder which can be life threatening. It is increasingly diagnosed in veterinarian healthcare and a topic of ongoing research. In this paper, we explore the different originating conditions of hypokalemia: reduced potassium intake, increased excretion, acid-base disturbances, or increased insulin, by using a dynamic mathematical model for potassium balance in non-lactating and lactating cows. Simulations are compared with literature. The results give insights into the network dynamics and point to scenarios on which experimental effort should be focused. Application of mathematical models can assist in experimental planning as well as the reduction, refinement and replacement of animal experiments. Y1 - 2022 U6 - https://doi.org/10.1038/s41598-022-22596-0 VL - 12, 19781 ER -