Refine
Year of publication
Document Type
- Article (2178)
- ZIB-Report (1758)
- In Proceedings (1322)
- Master's Thesis (284)
- Book chapter (166)
- Doctoral Thesis (163)
- Other (99)
- Bachelor's Thesis (69)
- In Collection (66)
- Book (65)
Keywords
- integer programming (36)
- mixed integer programming (34)
- KOBV (33)
- optimal control (32)
- Annual Report (28)
- Kooperativer Bibliotheksverbund Berlin-Brandenburg (24)
- Mixed Integer Programming (21)
- Bibliotheksverbund (20)
- Integer Programming (19)
- mixed-integer programming (19)
Institute
- Numerical Mathematics (1502)
- Mathematical Optimization (1271)
- Visual and Data-centric Computing (1139)
- Visual Data Analysis (1017)
- ZIB Allgemein (951)
- Computational Nano Optics (496)
- Distributed Algorithms and Supercomputing (489)
- Modeling and Simulation of Complex Processes (398)
- Visual Data Analysis in Science and Engineering (378)
- Therapy Planning (315)
The first part of the report contains a lecture presented at ``Scientific Computing in der Theoretischen Physik'', a workshop organized by the DMV-Fachgruppe Scientific Computing in cooperation with the GAMM-Fachauschuß Scientific Computing at Freie Universit{ä}t Berlin in March 1994. To complete this lecture, a slightly modified version of TR 93-12 is appended.
Abstract The cost-efficient design of survivable optical telecommunication networks is the topic of this thesis. In cooperation with network operators, we have developed suitable concepts and mathematical optimization methods to solve this comprehensive planning task in practice. Optical technology is more and more employed in modern telecommunication networks. Digital information is thereby transmitted as short light pulses through glass fibers. Moreover, the optical medium allows for simultaneous transmissions on a single fiber by use of different wavelengths. Recent optical switches enable a direct forwarding of optical channels in the network nodes without the previously required signal retransformation to electronics. Their integration creates ongoing optical connections,which are called lightpaths. We study the problem of finding cost-efficient configurations of optical networks which meet specified communication requirements. A configuration comprises the determination of all lightpaths to establish as well as the detailed allocation of all required devices and systems. We use a flexible modeling framework for a realistic representation of the networks and their composition. For different network architectures, we formulate integer linear programs which model the design task in detail. Moreover, network survivability is an important issue due to the immense bandwidths offered by optical technology. Operators therefore request for designs which perpetuate protected connections and guarantee for a defined minimum throughput in case of malfunctions. In order to achieve an effective realization of scalable protection, we present a novel survivability concept tailored to optical networks and integrate several variants into the models. Our solution approach is based on a suitable model decomposition into two subtasks which separates two individually hard subproblems and enables this way to compute cost-efficient designs with approved quality guarantee. The first subtask consists of routing the connections with corresponding dimensioning of capacities and constitutes a common core task in the area of network planning. Sophisticated methods for such problems have already been developed and are deployed by appropriate integration. The second subtask is characteristic for optical networks and seeks for a conflict-free assignment of available wavelengths to the lightpaths using a minimum number of involved wavelength converters. For this coloring-like task, we derive particular models and study methods to estimate the number of unavoidable conversions. As constructive approach, we develop heuristics and an exact branch-and-price algorithm. Finally, we carry out an extensive computational study on realistic data, provided by our industrial partners. As twofold purpose, we demonstrate the potential of our approach for computing good solutions with quality guarantee, and we exemplify its flexibility for application to network design and analysis.
We consider the design of transparent optical networks from a practical perspective. Network operators aim at satisfying the communication demands at minimum cost. Such an optimization involves three interdependent planning issues: the dimensioning of the physical topology, the routing of lightpaths, and the wavelength assignment. Further topics include the reliability of the configuration and sparse wavelength conversion for efficient use of the capacities. In this paper, we investigate this extensive optical network design task. Using a flexible device-based model, we present an integer programming formulation that supports greenfield planning as well as expansion planning on top of an existing network. As solution method, we propose a suitable decomposition approach that separates the wavelength assignment from the dimensioning and routing. Our method in particular provides a lower bound on the total cost which allows to rate the solution quality. Computational experiments on realistic networks approve the solution approach to be appropriate.
By combining techniques of preparation, histology, confocal microscopy, data visualization and data processing, we have created and recently published a standard brain model for drosophila and honey bee brains. This report describes the algorithms and implementation of the corresponding software modules. At the same time it serves as a user's guide for scientist who want to reproduce the results for differerent species or mutants.
We describe a novel method for continuously transforming two triangulated models of arbitrary topology into each other. Equal global topology for both objects is assumed, extensions for genus changes during metamorphosis are provided. The proposed method addresses the major challenge in 3D metamorphosis, namely specifying the morphing process intuitively, with minimal user interaction and sufficient detail. Corresponding regions and point features are interactively identified. These regions are parametrized automatically and consistently, providing a basis for smooth interpolation. Utilizing suitable 3D interaction techniques a simple and intuitive control over the whole morphing process is offered.
Understanding the fluctuations by which phenomenological evolution equations with thermodynamic structure can be enhanced is the key to a general framework of nonequilibrium statistical mechanics. These fluctuations provide an idealized representation of microscopic details. We consider fluctuation-enhanced equations associated with Markov processes and elaborate the general recipes for evaluating dynamic material properties, which characterize force-flux constitutive laws, by statistical mechanics. Markov processes with continuous trajectories are conveniently characterized by stochastic differential equations and lead to Green–Kubo-type formulas for dynamic material properties. Markov processes with discontinuous jumps include transitions over energy barriers with the rates calculated by Kramers. We describe a unified approach to Markovian fluctuations and demonstrate how the appropriate type of fluctuations (continuous versus discontinuous) is reflected in the mathematical structure of the phenomenological equations.
Following axon pathfinding, growth cones transition from stochastic filopodial exploration to the formation of a limited number of synapses. How the interplay of filopodia and synapse assembly ensures robust connectivity in the brain has remained a challenging problem. Here, we developed a new 4D analysis method for filopodial dynamics and a data-driven computational model of synapse formation for R7 photoreceptor axons in developing Drosophila brains. Our live data support a 'serial synapse formation' model, where at any time point only a single 'synaptogenic' filopodium suppresses the synaptic competence of other filopodia through competition for synaptic seeding factors. Loss of the synaptic seeding factors Syd-1 and Liprin-α leads to a loss of this suppression, filopodial destabilization and reduced synapse formation, which is sufficient to cause the destabilization of entire axon terminals. Our model provides a filopodial 'winner-takes-all' mechanism that ensures the formation of an appropriate number of synapses.
Line Planning Problem
(2023)
• 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.