Refine
Year of publication
- 2020 (122) (remove)
Document Type
- Article (122) (remove)
Keywords
Institute
- Modeling and Simulation of Complex Processes (47)
- Numerical Mathematics (46)
- Visual Data Analysis (26)
- Visual and Data-centric Computing (26)
- Computational Nano Optics (23)
- Applied Algorithmic Intelligence Methods (15)
- Mathematical Optimization (15)
- Distributed Algorithms and Supercomputing (14)
- Image Analysis in Biology and Materials Science (11)
- Mathematical Algorithmic Intelligence (10)
- AI in Society, Science, and Technology (8)
- Mathematical Optimization Methods (4)
- Mathematics for Life and Materials Science (4)
- Computational Systems Biology (3)
- Network Optimization (3)
- Parallel and Distributed Computing (3)
- Therapy Planning (3)
- Visual Data Analysis in Science and Engineering (3)
- Digital Data and Information for Society, Science, and Culture (2)
- Energy Network Optimization (2)
- Computational Molecular Design (1)
- Geometric Data Analysis and Processing (1)
- Mathematics of Health Care (1)
Cycle inequalities play an important role in the polyhedral study of the periodic timetabling problem in public transport. We give the first pseudo-polynomial time separation algorithm for cycle inequalities, and we contribute a rigorous proof for the pseudo-polynomial time separability of the change-cycle inequalities. Moreover, we provide several NP-completeness results, indicating that pseudo-polynomial time is best possible. The efficiency of these cutting planes is demonstrated on real-world instances of the periodic timetabling problem.
We introduce a concurrent solver for the periodic event scheduling problem (PESP). It combines mixed integer programming techniques, the modulo network simplex method, satisfiability approaches, and a new heuristic based on maximum cuts. Running these components in parallel speeds up the overall solution process. This enables us to significantly improve the current upper and lower bounds for all benchmark instances of the library PESPlib.
Understanding the pathophysiological processes of cartilage degradation requires adequate model systems to develop therapeutic strategies towards osteoarthritis (OA). Although different in vitro or in vivo models have been described, further comprehensive approaches are needed to study specific disease aspects. This study aimed to combine in vitro and in silico modeling based on a tissue-engineering approach using mesenchymal condensation to mimic cytokine-induced cellular and matrix-related changes during cartilage degradation. Thus, scaffold-free cartilage-like constructs (SFCCs) were produced based on self-organization of mesenchymal stromal cells (mesenchymal condensation) and i) characterized regarding their cellular and matrix composition or secondly ii) treated with interleukin-1β (IL-1β) and tumor necrosis factor α (TNFα) for 3 weeks to simulate OA-related matrix degradation. In addition, an existing mathematical model based on partial differential equations was optimized and transferred to the underlying settings to simulate distribution of IL-1β, type II collagen degradation and cell number reduction. By combining in vitro and in silico methods, we aim to develop a valid, efficient alternative approach to examine and predict disease progression and effects of new therapeutics.
Recently, Kronqvist et al. (J Global Optim 64(2):249–272, 2016) rediscovered the supporting hyperplane algorithm of Veinott (Oper Res 15(1):147–152, 1967) and demonstrated its computational benefits for solving convex mixed integer nonlinear programs. In this paper we derive the algorithm from a geometric point of view. This enables us to show that the supporting hyperplane algorithm is equivalent to Kelley’s cutting plane algorithm (J Soc Ind Appl Math 8(4):703–712, 1960) applied to a particular reformulation of the problem. As a result, we extend the applicability of the supporting hyperplane algorithm to convex problems represented by a class of general, not necessarily convex nor differentiable, functions.
The images of D’Arcy Wentworth Thompson’s book “On Growth and Form” got an iconic status and became influential for biometrics and other mathematical approaches to organismic form. In particular, this is true for those of the chapter on the theory of transformation, which even has an impact on art and humanities. Based on his approach, Thompson formulated far-reaching conclusions with a partly anti-Darwinian stance. Here, we use the example of Thompson’s transformation of crab carapaces to test to what degree the transformation of grids, landmarks, and shapes result in congruent images. For comparison, we applied the same series of tests to digitized carapaces of real crabs. Both approaches show similar results. Only the simple transformations show a reasonable form of congruence. In particular, the transformations to majoid spider crabs reveal a complicated transformation of grids with partly crossing lines. By contrast, the carapace of the lithodid species is relatively easily created despite the fact that it is no brachyuran, but evolved a spider crab-like shape convergently from a hermit crab ancestor.