Filtern
Erscheinungsjahr
- 2024 (57)
- 2023 (129)
- 2022 (125)
- 2021 (143)
- 2020 (118)
- 2019 (104)
- 2018 (116)
- 2017 (92)
- 2016 (84)
- 2015 (74)
- 2014 (82)
- 2013 (98)
- 2012 (97)
- 2011 (75)
- 2010 (62)
- 2009 (69)
- 2008 (56)
- 2007 (67)
- 2006 (71)
- 2005 (50)
- 2004 (44)
- 2003 (26)
- 2002 (36)
- 2001 (29)
- 2000 (20)
- 1999 (30)
- 1998 (21)
- 1997 (13)
- 1996 (20)
- 1995 (14)
- 1994 (8)
- 1993 (9)
- 1992 (12)
- 1991 (4)
- 1990 (5)
- 1989 (8)
- 1988 (3)
- 1987 (3)
- 1986 (3)
- 1985 (6)
- 1984 (5)
- 1983 (2)
- 1981 (6)
- 1980 (6)
- 1979 (7)
- 1978 (2)
- 1977 (2)
- 1976 (2)
- 1975 (1)
- 1974 (1)
- 1968 (1)
Dokumenttyp
- Artikel (2119) (entfernen)
Volltext vorhanden
- nein (2119) (entfernen)
Schlagworte
- MSM (2)
- nasal breathing (2)
- sensitivity analysis (2)
- statistical shape model (2)
- ANFIS (1)
- ANN (1)
- Applied Mathematics (1)
- COVID-19 (1)
- CT segmentation (1)
- Computational Theory and Mathematics (1)
Institut
- Numerical Mathematics (721)
- Visual and Data-centric Computing (434)
- Visual Data Analysis (366)
- Mathematical Optimization (322)
- Modeling and Simulation of Complex Processes (252)
- Computational Nano Optics (235)
- Distributed Algorithms and Supercomputing (149)
- Visual Data Analysis in Science and Engineering (133)
- Computational Molecular Design (103)
- Therapy Planning (103)
Introduction and application of a new approach for model-based optical bidirectional measurements
(2024)
The Koopman operator has entered and transformed many research areas over the last years. Although the underlying concept–representing highly nonlinear dynamical systems by infinite-dimensional linear operators–has been known for a long time, the availability of large data sets and efficient machine learning algorithms for estimating the Koopman operator from data make this framework extremely powerful and popular. Koopman operator theory allows us to gain insights into the characteristic global properties of a system without requiring detailed mathematical models. We will show how these methods can also be used to analyze complex networks and highlight relationships between Koopman operators and graph Laplacians.
This paper is concerned with collective variables, or reaction coordinates, that map a discrete-in-time Markov process X_n in R^d to a (much) smaller dimension k≪d. We define the effective dynamics under a given collective variable map ξ as the best Markovian representation of X_n under ξ. The novelty of the paper is that it gives strict criteria for selecting optimal collective variables via the properties of the effective dynamics. In particular, we show that the transition density of the effective dynamics of the optimal collective variable solves a relative entropy minimization problem from certain family of densities to the transition density of X_n. We also show that many transfer operator-based data-driven numerical approaches essentially learn quantities of the effective dynamics. Furthermore, we obtain various error estimates for the effective dynamics in approximating dominant timescales / eigenvalues and transition rates of the original process X_n and how optimal collective variables minimize these errors. Our results contribute to the development of theoretical tools for the understanding of complex dynamical systems, e.g. molecular kinetics, on large timescales. These results shed light on the relations among existing data-driven numerical approaches for identifying good collective variables, and they also motivate the development of new methods.
The multi-grid reaction-diffusion master equation (mgRDME) provides a generalization of stochastic compartment-based reaction-diffusion modelling described by the standard reaction-diffusion master equation (RDME). By enabling different resolutions on lattices for biochemical species with different diffusion constants, the mgRDME approach improves both accuracy and efficiency of compartment-based reaction-diffusion simulations. The mgRDME framework is examined through its application to morphogen gradient formation in stochastic reaction-diffusion scenarios, using both an analytically tractable first-order reaction network and a model with a second-order reaction. The results obtained by the mgRDME modelling are compared with the standard RDME model and with the (more detailed) particle-based Brownian dynamics simulations. The dependence of error and numerical cost on the compartment sizes is defined and investigated through a multi-objective optimization problem.
Existing planning approaches for onshore wind farm siting and grid integration often do not meet minimum cost solutions or social and environmental considerations. In this paper, we develop an exact approach for the integrated layout and cable routing problem of onshore wind farm planning using the Quota Steiner tree problem. Applying a novel transformation on a known directed cut formulation, reduction techniques, and heuristics, we design an exact solver that makes large problem instances solvable and outperforms generic MIP solvers. In selected regions of Germany, the trade-offs between minimizing costs and landscape impact of onshore wind farm siting are investigated. Although our case studies show large trade-offs between the objective criteria of cost and landscape impact, small burdens on one criterion can significantly improve the other criteria. In addition, we demonstrate that contrary to many approaches for exclusive turbine siting, grid integration must be simultaneously optimized to avoid excessive costs or landscape impacts in the course of a wind farm project. Our novel problem formulation and the developed solver can assist planners in decision-making and help optimize wind farms in large regions in the future.
AI-guided pipeline for protein–protein interaction drug discovery identifies a SARS-CoV-2 inhibitor
(2024)
Protein–protein interactions (PPIs) offer great opportunities to expand the druggable proteome and therapeutically tackle various diseases, but remain challenging targets for drug discovery. Here, we provide a comprehensive pipeline that combines experimental and computational tools to identify and validate PPI targets and perform early-stage drug discovery. We have developed a machine learning approach that prioritizes interactions by analyzing quantitative data from binary PPI assays or AlphaFold-Multimer predictions. Using the quantitative assay LuTHy together with our machine learning algorithm, we identified high-confidence interactions among SARS-CoV-2 proteins for which we predicted three-dimensional structures using AlphaFold-Multimer. We employed VirtualFlow to target the contact interface of the NSP10-NSP16 SARS-CoV-2 methyltransferase complex by ultra-large virtual drug screening. Thereby, we identified a compound that binds to NSP10 and inhibits its interaction with NSP16, while also disrupting the methyltransferase activity of the complex, and SARS-CoV-2 replication. Overall, this pipeline will help to prioritize PPI targets to accelerate the discovery of early-stage drug candidates targeting protein complexes and pathways.
An Iterative Refinement Approach for the Rolling Stock Rotation Problem with Predictive Maintenance
(2024)
The rolling stock rotation problem with predictive maintenance (RSRP-PdM) involves the assignment of trips to a fleet of vehicles with integrated maintenance scheduling based on the predicted failure probability of the vehicles. These probabilities are determined by the health states of the vehicles, which are considered to be random variables distributed by a parameterized family of probability distribution functions. During the operation of the trips, the corresponding parameters get updated. In this article, we present a dual solution approach for RSRP-PdM and generalize a linear programming based lower bound for this problem to families of probability distribution functions with more than one parameter. For this purpose, we define a rounding function that allows for a consistent underestimation of the parameters and model the problem by a state-expanded event-graph in which the possible states are restricted to a discrete set. This induces a flow problem that is solved by an integer linear program. We show that the iterative refinement of the underlying discretization leads to solutions that converge from below to an optimal solution of the original instance. Thus, the linear relaxation of the considered integer linear program results in a lower bound for RSRP-PdM. Finally, we report on the results of computational experiments conducted on a library of test instances.