68-XX COMPUTER SCIENCE (For papers involving machine computations and programs in a specific mathematical area, see Section -04 in that area)
Refine
Year of publication
Document Type
- ZIB-Report (38)
- Master's Thesis (6)
- Software (4)
- Article (1)
- Bachelor's Thesis (1)
Is part of the Bibliography
- no (50) (remove)
Keywords
- Computational Diagnosis (2)
- Convex Optimization (2)
- Knee Osteoarthritis (2)
- MSM (2)
- Machine Learning (2)
- Reversible Markov Chain (2)
- branch-and-bound parallelization (2)
- integer optimization (2)
- parallelization framework (2)
- 2-photon microscopy (1)
- ADOL-C (1)
- Adaptive Importance Sampling (1)
- Automatic differentiation (1)
- Bayesian inverse problem (1)
- Branch and Bound (1)
- Branchwidth (1)
- Carvingwidth (1)
- Classification (1)
- Combinatorial Optimization, Robust Optimization, Multiband Robustness, Network Design (1)
- Computational graph (1)
- Connected Component Labeling (1)
- DVR (1)
- Data Mining (1)
- Data Uncertainty (1)
- Dynamic Traffic (1)
- Forschungsdatenmanagement (1)
- GPGPU (1)
- GPU acceleration (1)
- Gaussian mixture model (1)
- Generalized Hermite interpolation (1)
- Girsanov (1)
- Harvest Scheduling (1)
- Heterogeneous Wireless Networks, Biobjective Optimization, Mixed Integer Linear Programming, Simulation (1)
- Ising Model (1)
- Langzeitverfügbarkeit (1)
- Lipschitz continuity (1)
- MINLP (1)
- MIP (1)
- MIPLIB (1)
- Metadynamics (1)
- Metastability (1)
- Mixed Integer Programming (1)
- Molecular Dynamics (1)
- Monte Carlo methods for light transport (1)
- Multiband Robustness (1)
- Multiperiod Network Design, Traffic Uncertainty, Robust Optimization, Multiband Robustness, Hybrid Heuristics (1)
- NBLAST (1)
- Network Design (1)
- Network Design, Demand Uncertainty, Robust Optimization, Telecommunications (1)
- Node merging (1)
- Non Equilibrium Sampling (1)
- Optical access networks (1)
- Optimization (1)
- PIPS-SBB, UG, Parallel Branch and Bound (1)
- Parallel processing (1)
- Parallelization, Branch-and-bound, Mixed Integer Programming, UG, ParaSCIP, FiberSCIP, ParaXpress, FiberXpress, SCIP-Jack (1)
- Parameterized complexity (1)
- Periodic Event Scheduling Problem (1)
- Periodic timetabling (1)
- Racing ParaSCIP (1)
- Robust Optimization (1)
- Robust Optimization, Uncertainty Set, Multiband Robustness, Network Design (1)
- SCIP (1)
- Scheduling, Extended Formulations, Network Migration, WDM Networks (1)
- Steiner trees (1)
- Swendsen-Wang Multi-Cluster Algorithm (1)
- Telecommunication (1)
- Time Series (1)
- Treewidth (1)
- Ubiquity Generator Framework (1)
- Variance Reduction (1)
- Xeon Phi (1)
- acyclic orientations (1)
- algorithm (1)
- bipolar orientations (1)
- boundary conditions (1)
- brain wiring (1)
- branch-and-bound (1)
- cell type (1)
- chromophore concentration (1)
- clustering (1)
- competitive analysis (1)
- constraint integer programming (1)
- coordinate search (1)
- deterministic parallelism (1)
- dht (1)
- digitally reconstructed radiographs (1)
- direct volume rendering (1)
- electron tomography (1)
- enumeration algorithm (1)
- filopodia (1)
- geometric morphometrics (1)
- geometric statistics (1)
- geometry reconstruction (1)
- growth cone dynamics (1)
- image analysis (1)
- image and geometry alignment (1)
- image registration (1)
- importance sampling (1)
- level of detail (1)
- mesh deformation (1)
- metadynamics (1)
- metastability (1)
- microtubules (1)
- mixed integer nonlinear programming (1)
- mixed integer programming (1)
- model (1)
- model-based inversion (1)
- multiple sources and sinks (1)
- natural scene (1)
- neural networks (1)
- neuroinformatics (1)
- neuron similarity (1)
- online algorithms (1)
- online algorithms, stochastic dominance, algorithm analysis, Markov chains (1)
- oxygen saturation (1)
- parallel (1)
- peer-to-peer, machine learning, approximate, clustering, quantile, linear regression (1)
- photoacoustic imaging (1)
- picking (1)
- point correspondence (1)
- pointing (1)
- posterior consistency (1)
- probabilistic analysis (1)
- probabilistic numerics (1)
- quantitative photoacoustic tomography (1)
- random likelihood (1)
- randomised misfit (1)
- rare event simulation (1)
- rendering (1)
- scalaris (1)
- serial sectioning (1)
- shape analysis (1)
- software information, software citation, mathematical research data (1)
- statistical shape and intensity models (1)
- stochastic optimal control (1)
- surrogate model (1)
- survey (1)
- uncertainty quantification (1)
- unfolding, papyri, computed tomography (1)
- volume rendering (1)
Institute
- Mathematical Optimization (21)
- Visual and Data-centric Computing (14)
- Visual Data Analysis (11)
- Mathematics of Telecommunication (7)
- Numerical Mathematics (5)
- Distributed Algorithms and Supercomputing (4)
- Mathematical Optimization Methods (3)
- Computational Molecular Design (2)
- Digital Data and Information for Society, Science, and Culture (2)
- Image Analysis in Biology and Materials Science (2)
The optimization of periodic timetables is an indispensable planning task in public transport. Although the periodic event scheduling problem (PESP) provides an elegant mathematical formulation of the periodic timetabling problem that led to many insights for primal heuristics, it is notoriously hard to solve to optimality. One reason is that for the standard mixed-integer linear programming formulations, linear programming relaxations are weak and the integer variables are of pure technical nature and in general do not correlate with the objective value. While the first problem has been addressed by developing several families of cutting planes, we focus on the second aspect. We discuss integral forward cycle bases as a concept to compute improved dual bounds for PESP instances. To this end, we develop the theory of forward cycle bases on general digraphs. Specifically for the application of timetabling, we devise a generic procedure to construct line-based event-activity networks, and give a simple recipe for an integral forward cycle basis on such networks. Finally, we analyze the 16 railway instances of the benchmark library PESPlib, match them to the line-based structure and use forward cycle bases to compute better dual bounds for 14 out of the 16 instances.
Estimating 3D Shape of the Head Skeleton of Basking Sharks Using Annotated Landmarks on a 2D Image
(2022)
Basking sharks are thought to be one of the most efficient filter-feeding fish in terms of the throughput of water filtered through their gills. Details about the underlying morphology of their branchial region have not been studied due to various challenges in acquiring real-world data. The present thesis aims to facilitate this, by developing a mathematical shape model which constructs the 3D structure of the head skeleton of a basking shark using annotated landmarks on a single 2D image. This is an ill-posed problem as estimating the depth of a 3D object from a single 2D view is, in general, not possible. To reduce this ambiguity, we create a set of pre-defined training shapes in 3D from CT scans of basking sharks. First, the damaged structures of the sharks in the scans are corrected via solving a set of optimization problems, before using them as accurate 3D representations of the object. Then, two approaches are employed for the 2D-to-3D shape fitting problem–an Active Shape Model approach and a Kendall’s Shape Space approach. The former represents a shape as a point on a high-dimensional Euclidean space, whereas the latter represents a shape as an equivalence class of points in this Euclidean space. Kendall’s shape space approach is a novel technique that has not yet been applied in this context, and a comprehensive comparison of the two approaches suggests this approach to be superior for the problem at hand. This can be credited to an improved interpolation of the training shapes.
Morphomatics is an open-source Python library for (statistical) shape analysis developed within the geometric data analysis and processing research group at Zuse Institute Berlin. It contains prototype implementations of intrinsic manifold-based methods that are highly consistent and avoid the influence of unwanted effects such as bias due to arbitrary choices of coordinates.
UG is a generic framework to parallelize branch-and-bound based solvers (e.g., MIP, MINLP, ExactIP) in a distributed or shared memory computing environment. It exploits the powerful performance of state-of-the-art "base solvers", such as SCIP, CPLEX, etc. without the need for base solver parallelization.
UG framework, ParaSCIP(ug[SCIP,MPI]) and FiberSCIP (ug[SCIP,Pthreads]) are available as a beta version.
v1.0.0: new documentation and cmake, generalization of ug framework, implementation of selfsplitrampup for fiber- and parascip, better memory and time limit handling.
Sampling rare events in metastable dynamical systems is often a computationally expensive task and one needs to resort to enhanced sampling methods such as importance sampling. Since we can formulate the problem of finding optimal importance sampling controls as a stochastic optimization problem, this then brings additional numerical challenges and the convergence of corresponding algorithms might as well suffer from metastabilty. In this article we address this issue by combining systematic control approaches with the heuristic adaptive metadynamics method. Crucially, we approximate the importance sampling control by a neural network, which makes the algorithm in principle feasible for high dimensional applications. We can numerically demonstrate in relevant metastable problems that our algorithm is more effective than previous attempts and that only the combination of the two approaches leads to a satisfying convergence and therefore to an efficient sampling in certain metastable settings.
UG is a generic framework to parallelize branch-and-bound based solvers (e.g., MIP, MINLP, ExactIP) in a distributed or shared memory computing environment. It exploits the powerful performance of state-of-the-art "base solvers", such as SCIP, CPLEX, etc. without the need for base solver parallelization.
UG framework, ParaSCIP(ug[SCIP,MPI]) and FiberSCIP (ug[SCIP,Pthreads]) are available as a beta version. For MIP solving, ParaSCIP and FiberSCIP are well debugged and should be stable. For MINLP solving, they are relatively stable, but not as thoroughly debugged. This release version should handle branch-and-cut approaches where subproblems are defined by variable bounds and also by constrains for ug[SCIP,*] ParaSCIP and FiberSCIP). Therefore, problem classes other than MIP or MINLP can be handled, but they have not been tested yet.
v0.9.1: Update orbitope cip files.
This work presents a fully automated pipeline, centered around a deep neural network, as well as a method to train that network in an efficient manner, that enables accurate detection of lesions in meniscal anatomical subregions. The network architecture is based on a transformer encoder/decoder. It is trained on DESS and tuned on IW TSE 3D MRI scans sourced from the Osteoarthritis Initiative. Furthermore, it is trained in a multilabel, and multitask fashion, using an auxiliary detection head. The former enables implicit localisation
of meniscal defects, that to the best of my knowledge, has not yet been reported elsewhere. The latter enables efficient learning on the entire 3D MRI volume. Thus, the proposed method does not require any expert knowledge at inference. Aggregated inference results from two datasets resulted in an overall AUCROC result of 0.90, 0.91 and 0.93 for meniscal lesion detection anywhere in the knee, in medial and in lateral menisci respectively. These results compare very well to the related work, even though only a fraction of the data has been utilized. Clinical applicability and benefit is yet to be determined.
Public transportation networks are typically operated with a periodic timetable. The Periodic Event Scheduling Problem (PESP) is the standard mathematical modelling tool for periodic timetabling. Since PESP can be solved in linear time on trees, it is a natural question to ask whether there are polynomial-time algorithms for input networks of bounded treewidth. We show that deciding the feasibility of a PESP instance is NP-hard even when the treewidth is 2, the branchwidth is 2, or the carvingwidth is 3. Analogous results hold for the optimization of reduced PESP instances, where the feasibility problem is trivial. To complete the picture, we present two pseudo-polynomial-time dynamic programming algorithms solving PESP on input networks with bounded tree- or branchwidth. We further analyze the parameterized complexity of PESP with bounded cyclomatic number, diameter, or vertex cover number. For event-activity networks with a special -- but standard -- structure, we give explicit and sharp bounds on the branchwidth in terms of the maximum degree and the carvingwidth of an underlying line network. Finally, we investigate several parameters on the smallest instance of the benchmarking library PESPlib.