Filtern
Erscheinungsjahr
- 2024 (1)
- 2023 (3)
- 2020 (7)
- 2019 (3)
- 2018 (5)
- 2017 (5)
- 2016 (3)
- 2015 (13)
- 2014 (4)
- 2013 (3)
- 2012 (6)
- 2011 (3)
- 2010 (9)
- 2009 (8)
- 2008 (15)
- 2007 (10)
- 2006 (3)
- 2005 (9)
- 2004 (3)
- 2003 (6)
- 2002 (6)
- 2001 (6)
- 2000 (2)
- 1999 (4)
- 1998 (4)
- 1997 (2)
- 1996 (4)
- 1995 (3)
- 1994 (1)
- 1992 (1)
- 1991 (1)
- 1990 (1)
- 1986 (1)
- 1985 (2)
- 1984 (2)
- 1981 (1)
- 1980 (2)
- 1977 (2)
- 1975 (1)
Dokumenttyp
- Buchkapitel (165) (entfernen)
Volltext vorhanden
- nein (165) (entfernen)
Institut
- Mathematical Optimization (53)
- Visual and Data-centric Computing (35)
- Numerical Mathematics (34)
- Visual Data Analysis (34)
- Visual Data Analysis in Science and Engineering (20)
- Distributed Algorithms and Supercomputing (13)
- Computational Nano Optics (12)
- Therapy Planning (10)
- Computational Medicine (6)
- Applied Algorithmic Intelligence Methods (5)
Line Planning Problem
(2023)
Computational approaches are practical when investigating putative peroxisomal proteins and for sub-peroxisomal protein localization in unknown protein sequences. Nowadays, advancements in computational methods and Machine Learning (ML) can be used to hasten the discovery of novel peroxisomal proteins and can be combined with more established computational methodologies. Here, we explain and list some of the most used tools and methodologies for novel peroxisomal protein detection and localization.
The recent advances in machine learning in various fields of applications can be largely attributed to the rise of deep learning (DL) methods and architectures. Despite being a key technology behind autonomous cars, image processing, speech recognition, etc., a notorious problem remains the lack of theoretical understanding of DL and related interpretability and (adversarial) robustness issues. Understanding the specifics of DL, as compared to, say, other forms of nonlinear regression methods or statistical learning, is interesting from a mathematical perspective, but at the same time it is of crucial importance in practice: treating neural networks as mere black boxes might be sufficient in certain cases, but many applications require waterproof performance guarantees and a deeper understanding of what could go wrong and why it could go wrong. It is probably fair to say that, despite being mathematically well founded as a method to approximate complicated functions, DL is mostly still more like modern alchemy that is firmly in the hands of engineers and computer scientists. Nevertheless, it is evident that certain specifics of DL that could explain its success in applications demands systematic mathematical approaches. In this work, we review robustness issues of DL and particularly bridge concerns and attempts from approximation theory to statistical learning theory. Further, we review Bayesian Deep Learning as a means for uncertainty quantification and rigorous explainability.
This chapter explains the different ways in which Markov State Models (MSMs) can be helpful in structure-based drug design. MSMs are constructed from the time series of molecular dynamics (MD), which can be generated by classical MD simulations. Several features of the MSMs can be utilized for rational drug design. The discretization of a validated MSM is particularly suited to extract meaningful representatives from the conformational ensemble, because the discretization yields a small number of microstates and mirrors the features of the free energy landscape. Long-lived conformations consist of a set of microstates which show high transition rates within the set and low transition rates to microstates outside of the set. The Bayesian agglomerative clustering engine (BACE) algorithm uses the observed transition counts to extract long-lived conformations from an MSM. By iteratively merging microstates according to the Bayes factor and recalculating the Bayes-factor matrix, the algorithm yields an aggregation of the microstates into long-lived conformations.
Network and Storage
(2020)
Natural gas is considered by many to be the most important energy source for the future. The objectives of energy commodities strategic problems can be mainly related to natural gas and deal with the definition of the “optimal” gas pipelines design which includes a number of related sub problems such as: Gas stations (compression) location and Gas storage locations, as well as compression station design and optimal operation.
Demand Side Management (DSM) is usually considered as a process of energy consumption shifting from peak hours to off-peak times. DSM does not always reduce total energy consumption, but it helps to meet energy demand and supply. For example, it balances variable generation from renewables (such as solar and wind) when energy demand differs from renewable generation.
Adjoint-Based Identification of Sound Sources for Sound Reinforcement and Source Localization
(2020)
The identification of sound sources is a common problem in acoustics. Different parameters are sought, among these are signal and position of the sources. We present an adjoint-based approach for sound source identification, which employs computational aeroacoustic techniques. Two different applications are presented as a proof-of-concept: optimization of a sound reinforcement setup and the localization of (moving) sound sources.
In this article we introduce a Minimum Cycle Partition Problem with Length Requirements (CPLR). This generalization of the Travelling Salesman Problem (TSP) originates from routing Unmanned Aerial Vehicles (UAVs). Apart from nonnegative edge weights, CPLR has an individual critical weight value associated with each vertex. A cycle partition, i.e., a vertex disjoint cycle cover, is regarded as a feasible solution if the length of each cycle, which is the sum of the weights of its edges, is not greater than the critical weight of each of its vertices. The goal is to find a feasible partition, which minimizes the number of cycles. In this article, a heuristic algorithm is presented together with a Mixed Integer Programming (MIP) formulation of CPLR. We furthermore introduce a conflict graph, whose cliques yield valid constraints for the MIP model. Finally, we report on computational experiments conducted on TSPLIB-based test instances.