Refine
Year of publication
- 2017 (170) (remove)
Document Type
- Article (92)
- In Proceedings (48)
- Master's Thesis (11)
- Book chapter (5)
- Bachelor's Thesis (3)
- Doctoral Thesis (3)
- In Collection (2)
- Poster (2)
- Research data (2)
- ZIB-Annual (1)
Has Fulltext
- no (170) (remove)
Is part of the Bibliography
- no (170)
Keywords
- CT segmentation (1)
- Computations (1)
- Consensus (1)
- Cutting Planes (1)
- Decomposition (1)
- Disease severity (1)
- Gas Network Planning (1)
- HR-pQCT measurement (1)
- Jahresbericht (1)
- KOBV (1)
Institute
- Numerical Mathematics (52)
- Visual Data Analysis (44)
- Visual and Data-centric Computing (44)
- Mathematical Optimization (37)
- Distributed Algorithms and Supercomputing (17)
- Computational Nano Optics (16)
- Mathematical Optimization Methods (15)
- Therapy Planning (9)
- Computational Medicine (8)
- Computational Molecular Design (8)
Modern mixed-integer programming (MIP) solvers employ dozens of auxiliary algorithmic components to support the branch-and-bound search in finding and improving primal solutions and in strengthening the dual bound. Typically, all components are tuned to minimize the average running time to prove optimality. In this article, we take a different look at the run of a MIP solver. We argue that the solution process consists of three distinct phases, namely achieving feasibility, improving the incumbent solution, and proving optimality. We first show that the entire solving process can be improved by adapting the search strategy with respect to the phase-specific aims using different control tunings. Afterwards, we provide criteria to predict the transition between the individual phases and evaluate the performance impact of altering the algorithmic behaviour of the non-commercial MIP solver Scip at the predicted phase transition points.
Consensus (agreement on a value) is regarded as a fundamental primitive in the design of fault tolerant distributed systems. A well-known solution to the consensus problem is Paxos. Extensions of the Paxos algorithm make it possible to reach agreement on a sequence of commands which can then be applied on a replicated state. However, concurrently proposed commands can create conflicts that must be resolved by ordering them. This thesis delivers an in-depth description of a Paxos-based algorithm to establish such command sequences, called Paxos Round Based Register (PRBR). In contrast to conventional approaches like Multi-Paxos, PRBR can manage multiple command sequences independently. Furthermore, each sequence is established in-place, which eliminates the need for managing multiple Paxos instances. PRBR is extended as part of this thesis to exploit the commutativity of concurrently proposed commands. As a result, conflict potential can be greatly reduced which increases the number of commands that can be handled by PRBR. This is shown for a number of workloads in an experimental evaluation.
The ZIMPL modeling language
(2017)
High-performing dairy cows require a particular composition of nutritional ingredients, adapted to their individual requirements and depending on their production status. The optimal dimensioning of minerals in the diet, one being potassium, is indispensable for the prevention of imbalances. Potassium balance in cows is the result of potassium intake, distribution in the organism, and excretion, and it is closely related to glucose and electrolyte metabolism. In this paper, we present a dynamical model for potassium balance in lactating and nonlactating dairy cows based on ordinary differential equations. Parameter values were obtained from clinical trial data and from the literature. To verify the consistency of the model, we present simulation outcomes for 3 different scenarios: potassium balance in (1) nonlactating cows with varying feed intake, (2) nonlactating cows with varying potassium fraction in the diet, and (3) lactating cows with varying milk production levels. The results give insights into the short- and long-term potassium metabolism, providing an important step toward the understanding of the potassium network, the design of prophylactic feed additives, and possible treatment strategies.
Degenerative Gelenkerkrankungen, wie die Osteoarthrose, sind ein häufiges Krankheitsbild unter älteren Erwachsenen. Hierbei verringert sich u.a. der Gelenkspalt aufgrund degenerierten Knorpels oder geschädigter Menisci. Ein in den Gelenkspalt eingebrachter interpositionaler Spacer soll die mit der Osteoarthrose einhergehende verringerte Gelenkkontaktfläche erhöhen und so der teilweise oder vollständige Gelenkersatz hinausgezögert oder vermieden werden.
In dieser Arbeit präsentieren wir eine Planungssoftware für die Auswahl und Positionierung eines interpositionalen Spacers am Patientenmodell.
Auf einer MRT-basierten Bildsegmentierung aufbauend erfolgt eine geometrische Rekonstruktion der 3D-Anatomie des Kniegelenks. Anhand dieser wird der Gelenkspalt bestimmt, sowie ein Spacer ausgewählt und algorithmisch vorpositioniert. Die Positionierung des Spacers ist durch den Benutzer jederzeit interaktiv anpassbar.
Für jede Positionierung eines Spacers wird ein Fitness-Wert zur Knieanatomie des jeweiligen Patienten berechnet und den Nutzern Rückmeldung hinsichtlich Passgenauigkeit gegeben. Die Software unterstützt somit als Entscheidungshilfe die behandelnden Ärzte bei der patientenspezifischen Spacerauswahl.
In this article, we study compact Mixed-Integer Programming (MIP) models for the Resource-Constrained Project Scheduling Problem (RCPSP). Compared to the classical time-indexed formulation, the size of compact models is strongly polynomial in the number of jobs. In addition to two compact models from the literature, we propose a new compact model. We can show that all three compact models are equivalent by successive linear transformations. For their LP-relaxations, however, we state a full inclusion hierarchy where our new model dominates the previous models in terms of polyhedral strength. Moreover, we reveal a polyhedral relationship to the common time-indexed model. Furthermore, a general class of valid cutting planes for the compact models is introduced and finally all models are evaluated by computational experiments.
Benchmarking five computational methods for analyzing large photonic crystal membrane cavities
(2017)
We demonstrate, based on data derived from computed tomography, that integrating 2D and 3D morphological data of ammonoid shells represent an important new approach to disentangle the palaeobiology of ammonoids. Characterization of ammonite morphology has long been constrained to 2D data and only a few studies collect ontogenetic data in 180° steps. We combine this traditional approach with 3D data collected from high-resolution nano-computed tomography. For this approach, ontogenetic morphological data of the hollow shell of a juvenile ammonite Kosmoceras (Jurassic, Callovian) is collected.
2D data is collected in 10° steps and show significant changes in shell morphology. Preserved hollow spines show multiple mineralized membranes never reported before, representing temporal changes of the ammonoid mantle tissue. 3D data show that chamber volumes do not always increase exponentially, as was generally assumed, but may represent a proxy for life events, e.g. stress phases. Furthermore, chamber volume cannot be simply derived from septal spacing in forms comparable to Kosmoceras. Vogel numbers, a 3D parameter for chamber shape, of Kosmoceras are similar to other ammonoids (Arnsbergites, Amauroceras) and modern cephalopods (Nautilus, Spirula). Two methods to virtually document the suture line ontogeny, used to document phylogenetic relationships of larger taxonomic entities, were applied for the first time and seem a promising alternative to hand drawings. The curvature of the chamber surfaces increases during ontogeny due to increasing strength of ornamentation and septal complexity. As increasing curvature may allow for faster handling of cameral liquid, it could compensate for decreasing SA/V ratios through ontogeny.
In an aging society where the number of joint replacements rises, it is important to also increase the longevity of implants.
In particular hip implants have a lifetime of at most 15 years. This derives primarily from
pain due to implant migration, wear, inflammation, and dislocation, which is affected by
the positioning of the implant during the surgery. Current joint replacement practice uses
2D software tools and relies on the experience of surgeons. Especially the 2D tools fail to
take the patients’ natural range of motion as well as stress distribution in the 3D joint
induced by different daily motions into account.
Optimizing the hip joint implant position for all possible parametrized motions under the
constraint of a contact problem is prohibitively expensive as there are too many motions
and every position change demands a recalculation of the contact problem. For the
reduction of the computational effort, we use adaptive refinement on the parameter
domain coupled with the interpolation method of Kriging. A coarse initial grid is to be
locally refined using goal-oriented error estimation, reducing locally high variances. This
approach will be combined with multi-grid optimization such that numerical errors are
reduced.