Refine
Year of publication
- 2014 (53) (remove)
Document Type
- ZIB-Report (44)
- Master's Thesis (7)
- ZIB-Annual (1)
- Bachelor's Thesis (1)
Has Fulltext
- yes (53) (remove)
Keywords
- directed networks (2)
- finite element method (2)
- metastability (2)
- 3D neural network (1)
- 3D reconstruction (1)
- Active message (1)
- Alanine dipeptide (1)
- Ant Colony Optimization (1)
- Benders' decomposition (1)
- Beton (1)
Institute
- Mathematical Optimization (22)
- Numerical Mathematics (15)
- Visual Data Analysis (10)
- Visual and Data-centric Computing (10)
- Mathematics of Transportation and Logistics (9)
- Distributed Algorithms and Supercomputing (4)
- Computational Nano Optics (3)
- Computational Molecular Design (2)
- Computational Systems Biology (2)
- Digital Data and Information for Society, Science, and Culture (2)
Kurzfassung. Durch die Alkalität des Betons wird Betonstahl dauerhaft vor
Korrosion geschützt. Infolge von Chlorideintrag kann dieser Schutz nicht länger
aufrechterhalten werden und führt zu Lochkorrosion. Die zerstörungsfreie Prüfung
von Stahlbetonproben mit 3D-CT bietet die Möglichkeit, eine Probe mehrfach
gezielt vorzuschädigen und den Korrosionsfortschritt zu untersuchen. Zur Quantifizierung
des Schädigungsgrades müssen die bei dieser Untersuchung anfallenden
großen Bilddaten mit Bildverarbeitungsmethoden ausgewertet werden. Ein wesentlicher
Schritt dabei ist die Segmentierung der Bilddaten, bei der zwischen Korrosionsprodukt
(Rost), Betonstahl (BSt), Beton, Rissen, Poren und Umgebung
unterschieden werden muss. Diese Segmentierung bildet die Grundlage für statistische
Untersuchungen des Schädigungsfortschritts. Hierbei sind die Änderung
der BSt-Geometrie, die Zunahme von Korrosionsprodukten und deren Veränderung
über die Zeit sowie ihrer räumlichen Verteilung in der Probe von Interesse. Aufgrund
der Größe der CT-Bilddaten ist eine manuelle Segmentierung nicht durchführbar,
so dass automatische Verfahren unabdingbar sind. Dabei ist insbesondere
die Segmentierung der Korrosionsprodukte in den Bilddaten ein schwieriges
Problem. Allein aufgrund der Grauwerte ist eine Zuordnung nahezu unmöglich,
denn die Grauwerte von Beton und Korrosionsprodukt unterscheiden sich kaum.
Eine formbasierte Suche ist nicht offensichtlich, da die Korrosionsprodukte in Beton
diffuse Formen haben.
Allerdings lässt sich Vorwissen über die Ausbreitung der Korrosionsprodukte
nutzen. Sie bilden sich in räumlicher Nähe des BSt (in Bereichen vorheriger
Volumenabnahme des BSt), entlang von Rissen sowie in Porenräumen, die direkt
am BSt und in dessen Nahbereich liegen. Davon ausgehend wird vor der
Korrosionsprodukterkennung zunächst eine BSt-Volumen-, Riss- und Porenerkennung
durchgeführt. Dieser in der Arbeit näher beschriebene Schritt erlaubt es, halbautomatisch
Startpunkte (Seed Points) für die Korrosionsprodukterkennung zu
finden. Weiterhin werden verschiedene in der Bildverarbeitung bekannte
Algorithmen auf ihre Eignung untersucht werden.
We employ the adaptive resolution approach AdResS, in its recently developed Grand Canonicallike version (GC-AdResS) [Wang et al. Phys.Rev.X 3, 011018 (2013)], to calculate the excess chemical potential, $μ^{ex}$, of various liquids and mixtures. We compare our results with those obtained from full atomistic simulations using the technique of thermodynamic integration and show a satisfactory agreement. In GC-AdResS the procedure to calculate $μ^{ex}$ corresponds to the process of standard initial equilibration of the system; this implies that, independently of the specific aim of the study, $μ^{ex}$, for each molecular species, is automatically calculated every time a GC-AdResS simulation is performed.
The set packing problem, sometimes also called the stable set problem, is a well-known NP-hard problem in combinatorial optimization with a wide range of applications and an interesting polyhedral structure, that has been the subject of intensive study. We contribute to this field by showing how, employing cliques, odd set inequalities for the matching problem can be generalized to valid inequalities for the set packing polytope with a clear combinatorial meaning.
Today's gas markets demand more flexibility from the network operators which in turn have to invest into their network infrastructure. As these investments are very cost-intensive and long-living, network extensions should not only focus on one bottleneck scenario, but should increase the flexibility to fulfill different demand scenarios. We formulate a model for the network extension problem for multiple demand scenarios and propose a scenario decomposition. We solve MINLP single-scenario sub-problems and obtain valid bounds even without solving them to optimality. Heuristics prove capable of improving the initial solutions substantially. Results of computational experiments are presented.
This work deals with the reduction of a previously developed ODE model for the bovine estrous cycle. After applying a method for exploring the parameter space by Apri et al. (2012), we perform structure-based reduction steps and several system specific adaptations. Overall, the original model consisting of 15 ODEs and 60 parameters is reduced to a model of 10 odes and 38 parameters. The reduced model qualitatively reproduces the state trajectories of the original model.
In this thesis we present a novel extended formulation for the line planning problem that is based on what we call "configurations" of lines and frequencies. Configurations are combinatorial building blocks of primal solutions; they rule out the "capacity numerics" and make the problem purely combinatorial. The concept of configurations can also be adapted to other capacitated network design problems.
The configuration model is strong in the sense that it implies several facet-defining inequalities for the standard model: set cover, symmetric band, multicover, and MIR inequalities. These theoretical findings can be confirmed in computations, however, the enormous number of configurations can blow up the formulation for large instances. We propose a mixed model that enriches the standard model by a judiciously chosen subset of configurations that provide a good compromise between model strength and size. Computational results for large-scale line planning problems are presented.
We investigate the matching and perfect matching polytopes of hypergraphs having a special structure, which we call partitioned hypergraphs. We show that the integrality gap of the standard LP-relaxation is at most $2\sqrt{d}$ for partitioned hypergraphs with parts of size $\leq d$. Furthermore, we show that this bound cannot be improved to $\mathcal{O}(d^{0.5-\epsilon})$.
The problem of decomposing networks into modules (or clusters) has gained much attention in recent years, as it can account for a coarsegrained description of complex systems, often revealing functional subunits of these systems. A variety of module detection algorithms have been proposed, mostly oriented towards finding hard partitionings of undirected networks. Despite the increasing number of fuzzy clustering methods for directed networks, many of these approaches tend to neglect important directional information. In this paper, we present a novel random walk based approach for finding fuzzy partitions of directed, weighted networks, where edge directions play a crucial role in defining how well nodes in a module are interconnected. We will show that cycle decomposition of a random walk process connects the notion of network modules and information transport in a network, leading to a new, symmetric measure of node communication. Finally, we will use this measure to introduce a communication graph, for which we will show that although being undirected it inherits all necessary information about modular structures from the original network.
The most popular molecular surface in molecular visualization is the solvent excluded surface (SES). It provides information about the accessibility of a biomolecule for a solvent molecule that is geometrically approximated by a sphere. During a period of almost four decades, the SES has served for many purposes – including
visualization, analysis of molecular interactions and the study of cavities in molecular structures. However, if one is interested in the surface that is accessible to a molecule whose shape differs significantly from a sphere, a different concept is necessary. To address this problem, we generalize the definition of the SES by replacing the probe sphere with the full geometry of the ligand defined by the arrangement of its van der Waals spheres. We call the new surface ligand excluded surface (LES) and present an efficient, grid-based algorithm for its computation.
Furthermore, we show that this algorithm can also be used to compute molecular cavities that could host the ligand molecule. We provide a detailed description of its implementation on CPU and GPU. Furthermore, we present a performance and convergence analysis and compare the LES for several molecules, using as ligands either water or small organic molecules.
Techniques for finding metastable or almost invariant sets have been investigated, e.g., for deterministic dynamical systems in set-oriented numerics, for stochastic processes in molecular dynamics, and for random walks on complex networks. Most prominent algorithms are based on spectral apporaches and identify metastable sets via the doimant eigenvalues of the transfer operator associated with the dynamical system under consideration. These algorithms require the dominant eigenvalues to be real-valued. However, for many types of dynamics, e.g. for non-reversible Markov chains, this condition is not met. In this paper we utilize the hitting time apporach to metastable sets and demonstrate how the wellknown statements about optimal metastable decompositions of reversible chains can be reformulated for non-reversible chains if one switches from a spectral approach to an exit time approach. The performance of the resulting algorithm is illustrated by numerical experiments on random walks on complex networks.