Library

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
Filter
  • 2025-2025  (2)
  • 2020-2023  (161)
  • 2010-2014  (426)
  • 2005-2009  (13,698)
  • 1985-1989
  • 1975-1979
  • 1830-1839  (363)
  • 1800-1809  (95)
  • 2020  (163)
  • 2012  (426)
  • 2006  (13,698)
  • 1832  (363)
  • 1824
  • 1803  (95)
Years
Year
Language
  • 101
    Publication Date: 2021-08-03
    Language: English
    Type: article , doc-type:article
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 102
    Publication Date: 2021-03-05
    Description: 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.
    Language: English
    Type: article , doc-type:article
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 103
    Publication Date: 2021-10-28
    Description: Motivated by the desire to numerically calculate rigorous upper and lower bounds on deviation probabilities over large classes of probability distributions, we present an adaptive algorithm for the reconstruction of increasing real-valued functions. While this problem is similar to the classical statistical problem of isotonic regression, the optimisation setting alters several characteristics of the problem and opens natural algorithmic possibilities. We present our algorithm, establish sufficient conditions for convergence of the reconstruction to the ground truth, and apply the method to synthetic test cases and a real-world example of uncertainty quantification for aerodynamic design.
    Language: English
    Type: article , doc-type:article
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 104
    Publication Date: 2020-09-14
    Language: English
    Type: article , doc-type:article
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 105
    Publication Date: 2021-04-16
    Language: English
    Type: reportzib , doc-type:preprint
    Format: application/pdf
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 106
    Publication Date: 2021-02-23
    Language: English
    Type: conferenceobject , doc-type:conferenceObject
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 107
    Publication Date: 2021-03-26
    Language: English
    Type: conferenceobject , doc-type:conferenceObject
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 108
    Publication Date: 2021-02-23
    Language: English
    Type: conferenceobject , doc-type:conferenceObject
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 109
    Publication Date: 2022-03-14
    Description: It is a challenging task to fairly compare local solvers and heuristics against each other and against global solvers. How does one weigh a faster termination time against a better quality of the found solution? In this paper, we introduce the confined primal integral, a new performance measure that rewards a balance of speed and solution quality. It emphasizes the early part of the solution process by using an exponential decay. Thereby, it avoids that the order of solvers can be inverted by choosing an arbitrarily large time limit. We provide a closed analytic formula to compute the confined primal integral a posteriori and an incremental update formula to compute it during the run of an algorithm. For the latter, we show that we can drop one of the main assumptions of the primal integral, namely the knowledge of a fixed reference solution to compare against. Furthermore, we prove that the confined primal integral is a transitive measure when comparing local solves with different final solution values. Finally, we present a computational experiment where we compare a local MINLP solver that uses certain classes of cutting planes against a solver that does not. Both versions show very different tendencies w.r.t. average running time and solution quality, and we use the confined primal integral to argue which of the two is the preferred setting.
    Language: English
    Type: article , doc-type:article
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 110
    Publication Date: 2021-02-22
    Language: English
    Type: bookpart , doc-type:bookPart
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 111
    Publication Date: 2022-03-14
    Description: The Periodic Event Scheduling Problem is a well-studied NP-hard problem with applications in public transportation to find good periodic timetables. Among the most powerful heuristics to solve the periodic timetabling problem is the modulo network simplex method. In this paper, we consider the more difficult version with integrated passenger routing and propose a refined integrated variant to solve this problem on real-world-based instances.
    Language: English
    Type: conferenceobject , doc-type:conferenceObject
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 112
    Publication Date: 2021-02-05
    Language: English
    Type: article , doc-type:article
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 113
    Publication Date: 2022-03-14
    Description: Dual degeneracy, i.e., the presence of multiple optimal bases to a linear programming (LP) problem, heavily affects the solution process of mixed integer programming (MIP) solvers. Different optimal bases lead to different cuts being generated, different branching decisions being taken and different solutions being found by primal heuristics. Nevertheless, only a few methods have been published that either avoid or exploit dual degeneracy. The aim of the present paper is to conduct a thorough computational study on the presence of dual degeneracy for the instances of well-known public MIP instance collections. How many instances are affected by dual degeneracy? How degenerate are the affected models? How does branching affect degeneracy: Does it increase or decrease by fixing variables? Can we identify different types of degenerate MIPs? As a tool to answer these questions, we introduce a new measure for dual degeneracy: the variable–constraint ratio of the optimal face. It provides an estimate for the likelihood that a basic variable can be pivoted out of the basis. Furthermore, we study how the so-called cloud intervals—the projections of the optimal face of the LP relaxations onto the individual variables—evolve during tree search and the implications for reducing the set of branching candidates.
    Language: English
    Type: article , doc-type:article
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 114
    Publication Date: 2021-04-20
    Description: This article is mainly motivated by the urge to answer two kinds of questions regarding the Bundesliga, which is Germany’s primary football (soccer) division having the highest average stadium attendance worldwide: “At any point in the season, what is the lowest final rank a certain team can achieve?” and “At any point in the season, what is the highest final rank a certain team can achieve?”. Although we focus on the Bundesliga in particular, the integer programming formulations we introduce to answer these questions can easily be adapted to a variety of other league systems and tournaments.
    Language: English
    Type: article , doc-type:article
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 115
    Publication Date: 2021-07-06
    Description: Markov chain (MC) algorithms are ubiquitous in machine learning and statistics and many other disciplines. Typically, these algorithms can be formulated as acceptance rejection methods. In this work we present a novel estimator applicable to these methods, dubbed Markov chain importance sampling (MCIS), which efficiently makes use of rejected proposals. For the unadjusted Langevin algorithm, it provides a novel way of correcting the discretization error. Our estimator satisfies a central limit theorem and improves on error per CPU cycle, often to a large extent. As a by-product it enables estimating the normalizing constant, an important quantity in Bayesian machine learning and statistics.
    Language: English
    Type: article , doc-type:article
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 116
    Publication Date: 2021-02-23
    Description: The presence of a confining boundary can modify the local structure of a liquid markedly. In addition, small samples of finite size are known to exhibit systematic deviations of thermodynamic quantities relative to their bulk values. Here, we consider the static structure factor of a liquid sample in slab geometry with open boundaries at the surfaces, which can be thought of as virtually cutting out the sample from a macroscopically large, homogeneous fluid. This situation is a relevant limit for the interpretation of grazing-incidence diffraction experiments at liquid interfaces and films. We derive an exact, closed expression for the slab structure factor, with the bulk structure factor as the only input. This shows that such free boundary conditions cause significant differences between the two structure factors, in particular, at small wavenumbers. An asymptotic analysis of this result yields the scaling exponent and an accurate, useful approximation of these finite-size corrections. Furthermore, the open boundaries permit the interpretation of the slab as an open system, supporting particle exchange with a reservoir. We relate the slab structure factor to the particle number fluctuations and discuss conditions under which the subvolume of the slab represents a grand canonical ensemble with chemical potential μ and temperature T. Thus, the open slab serves as a test-bed for the small-system thermodynamics in a μT reservoir. We provide a microscopically justified and exact result for the size dependence of the isothermal compressibility. Our findings are corroborated by simulation data for Lennard-Jones liquids at two representative temperatures.
    Language: English
    Type: article , doc-type:article
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 117
    Publication Date: 2021-10-26
    Language: English
    Type: conferenceobject , doc-type:conferenceObject
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 118
  • 119
    Publication Date: 2022-06-13
    Language: English
    Type: conferenceobject , doc-type:conferenceObject
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 120
    Publication Date: 2022-06-13
    Language: English
    Type: conferenceobject , doc-type:conferenceObject
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 121
    Publication Date: 2022-06-13
    Language: English
    Type: masterthesis , doc-type:masterThesis
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 122
    Publication Date: 2022-06-13
    Language: English
    Type: article , doc-type:article
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 123
    Publication Date: 2022-06-13
    Language: English
    Type: article , doc-type:article
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 124
  • 125
    Publication Date: 2022-06-13
    Language: English
    Type: researchdata , doc-type:ResearchData
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 126
    Publication Date: 2022-06-13
    Description: Large capacity Storage Class Memory (SCM) opens new possibilities for workloads requiring a large memory footprint. We examine optimization strategies for a legacy Fortran application on systems with an heterogeneous memory configuration comprising SCM and DRAM. We present a performance study for the multigrid solver component of the large-eddy simulation framework PALM for different memory configurations with large capacity SCM. An important optimization approach is the explicit assignment of storage locations depending on the data access characteristic to take advantage of the heterogeneous memory configuration. We are able to demonstrate that an explicit control over memory locations provides better performance compared to transparent hardware settings. As on aforementioned systems the page management by the OS appears as critical performance factor, we study the impact of different huge page settings.
    Language: English
    Type: conferenceobject , doc-type:conferenceObject
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 127
    Publication Date: 2022-06-13
    Language: English
    Type: article , doc-type:article
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 128
    Publication Date: 2022-06-13
    Language: English
    Type: other , doc-type:Other
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 129
    Publication Date: 2022-06-27
    Language: English
    Type: conferenceobject , doc-type:conferenceObject
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 130
    Publication Date: 2022-06-27
    Language: English
    Type: article , doc-type:article
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 131
    Publication Date: 2022-06-27
    Description: In this article we introduce a Minimum Cycle Partition Problem with Length Requirements (CPLR). This generalization of the Travelling Salesman Problem (TSP) originates from routing Unmanned Aerial Vehicles (UAVs). Apart from nonnegative edge weights, CPLR has an individual critical weight value associated with each vertex. A cycle partition, i.e., a vertex disjoint cycle cover, is regarded as a feasible solution if the length of each cycle, which is the sum of the weights of its edges, is not greater than the critical weight of each of its vertices. The goal is to find a feasible partition, which minimizes the number of cycles. In this article, a heuristic algorithm is presented together with a Mixed Integer Programming (MIP) formulation of CPLR. We furthermore introduce a conflict graph, whose cliques yield valid constraints for the MIP model. Finally, we report on computational experiments conducted on TSPLIB-based test instances.
    Language: English
    Type: bookpart , doc-type:bookPart
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 132
    Publication Date: 2022-07-07
    Language: English
    Type: bookpart , doc-type:bookPart
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 133
    Publication Date: 2022-07-19
    Description: Surgical tool segmentation in endoscopic videos is an important component of computer assisted interventions systems. Recent success of image-based solutions using fully-supervised deep learning approaches can be attributed to the collection of big labeled datasets. However, the annotation of a big dataset of real videos can be prohibitively expensive and time consuming. Computer simulations could alleviate the manual labeling problem, however, models trained on simulated data do not generalize to real data. This work proposes a consistency-based framework for joint learning of simulated and real (unlabeled) endoscopic data to bridge this performance generalization issue. Empirical results on two data sets (15 videos of the Cholec80 and EndoVis'15 dataset) highlight the effectiveness of the proposed Endo-Sim2Real method for instrument segmentation. We compare the segmentation of the proposed approach with state-of-the-art solutions and show that our method improves segmentation both in terms of quality and quantity.
    Language: English
    Type: conferenceobject , doc-type:conferenceObject
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 134
    Publication Date: 2022-07-19
    Description: An advantageous property of mesh-based geometric morphometrics (GM) towards landmark-based approaches, is the possibility of precisely examining highly irregular shapes and highly topographic surfaces. In case of spherical-harmonics-based GM the main requirement is a completely closed mesh surface, which often is not given, especially when dealing with natural objects. Here we present a methodological workflow to prepare 3D segmentations containing large cavity openings for the conduction of spherical-harmonics-based GM. This will be exemplified with a case study on claws of hermit crabs (Paguroidea, Decapoda, Crustacea), whereby joint openings – between manus and “movable finger” – typify the large-cavity-opening problem. We found a methodology including an ambient-occlusion-based segmentation algorithm leading to results precise and suitable to study the inter- and intraspecific differences in shape of hermit crab claws. Statistical analyses showed a significant separation between all examined diogenid and pagurid claws, whereas the separation between all left and right claws did not show significance. Additionally, the procedure offers other benefits. It is easy to reproduce and creates sparse variance in the data, closures integrate smoothly into the total structures and the algorithm saves a significant amount of time.
    Language: English
    Type: article , doc-type:article
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 135
    Publication Date: 2022-07-19
    Description: Automatic recognition of surgical phases is an important component for developing an intra-operative context-aware system. Prior work in this area focuses on recognizing short-term tool usage patterns within surgical phases. However, the difference between intra- and inter-phase tool usage patterns has not been investigated for automatic phase recognition. We developed a Recurrent Neural Network (RNN), in particular a state-preserving Long Short Term Memory (LSTM) architecture to utilize the long-term evolution of tool usage within complete surgical procedures. For fully automatic tool presence detection from surgical video frames, a Convolutional Neural Network (CNN) based architecture namely ZIBNet is employed. Our proposed approach outperformed EndoNet by 8.1% on overall precision for phase detection tasks and 12.5% on meanAP for tool recognition tasks.
    Language: English
    Type: article , doc-type:article
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 136
    Publication Date: 2022-07-19
    Description: We propose generalizations of the T²-statistics of Hotelling and the Bhattacharayya distance for data taking values in Lie groups. A key feature of the derived measures is that they are compatible with the group structure even for manifolds that do not admit any bi-invariant metric. This property, e.g., assures analysis that does not depend on the reference shape, thus, preventing bias due to arbitrary choices thereof. Furthermore, the generalizations agree with the common definitions for the special case of flat vector spaces guaranteeing consistency. Employing a permutation test setup, we further obtain nonparametric, two-sample testing procedures that themselves are bi-invariant and consistent. We validate our method in group tests revealing significant differences in hippocampal shape between individuals with mild cognitive impairment and normal controls.
    Language: English
    Type: conferenceobject , doc-type:conferenceObject
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 137
    Publication Date: 2022-07-19
    Description: Motivation: The ever-rising volume of patients, high maintenance cost of operating rooms and time consuming analysis of surgical skills are fundamental problems that hamper the practical training of the next generation of surgeons. The hospitals prefer to keep the surgeons busy in real operations over training young surgeons for obvious economic reasons. One fundamental need in surgical training is the reduction of the time needed by the senior surgeon to review the endoscopic procedures performed by the young surgeon while minimizing the subjective bias in evaluation. The unprecedented performance of deep learning ushers the new age of data-driven automatic analysis of surgical skills. Method: Deep learning is capable of efficiently analyzing thousands of hours of laparoscopic video footage to provide an objective assessment of surgical skills. However, the traditional end-to-end setting of deep learning (video in, skill assessment out) is not explainable. Our strategy is to utilize the surgical process modeling framework to divide the surgical process into understandable components. This provides the opportunity to employ deep learning for superior yet automatic detection and evaluation of several aspects of laparoscopic cholecystectomy such as surgical tool and phase detection. We employ ZIBNet for the detection of surgical tool presence. ZIBNet employs pre-processing based on tool usage imbalance, a transfer learned 50-layer residual network (ResNet-50) and temporal smoothing. To encode the temporal evolution of tool usage (over the entire video sequence) that relates to the surgical phases, Long Short Term Memory (LSTM) units are employed with long-term dependency. Dataset: We used CHOLEC 80 dataset that consists of 80 videos of laparoscopic cholecystectomy performed by 13 surgeons, divided equally for training and testing. In these videos, up to three different tools (among 7 types of tools) can be present in a frame. Results: The mean average precision of the detection of all tools is 93.5 ranging between 86.8 and 99.3, a significant improvement (p 〈0.01) over the previous state-of-the-art. We observed that less frequent tools like Scissors, Irrigator, Specimen Bag etc. are more related to phase transitions. The overall precision (recall) of the detection of all surgical phases is 79.6 (81.3). Conclusion: While this is not the end goal for surgical skill analysis, the development of such a technological platform is essential toward a data-driven objective understanding of surgical skills. In future, we plan to investigate surgeon-in-the-loop analysis and feedback for surgical skill analysis.
    Language: English
    Type: other , doc-type:Other
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 138
    Publication Date: 2022-07-19
    Description: 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.
    Language: English
    Type: article , doc-type:article
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 139
    Publication Date: 2022-07-19
    Description: Intrinsic and parametric regression models are of high interest for the statistical analysis of manifold-valued data such as images and shapes. The standard linear ansatz has been generalized to geodesic regression on manifolds making it possible to analyze dependencies of random variables that spread along generalized straight lines. Nevertheless, in some scenarios, the evolution of the data cannot be modeled adequately by a geodesic. We present a framework for nonlinear regression on manifolds by considering Riemannian splines, whose segments are Bézier curves, as trajectories. Unlike variational formulations that require time-discretization, we take a constructive approach that provides efficient and exact evaluation by virtue of the generalized de Casteljau algorithm. We validate our method in experiments on the reconstruction of periodic motion of the mitral valve as well as the analysis of femoral shape changes during the course of osteoarthritis, endorsing Bézier spline regression as an effective and flexible tool for manifold-valued regression.
    Language: English
    Type: conferenceobject , doc-type:conferenceObject
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 140
    Publication Date: 2022-07-19
    Description: A prerequisite for many analysis tasks in modern comparative biology is the segmentation of 3-dimensional (3D) images of the specimens being investigated (e.g. from microCT data). Depending on the specific imaging technique that was used to acquire the images and on the image resolution, different segmentation tools will be required. While some standard tools exist that can often be applied for specific subtasks, building whole processing pipelines solely from standard tools is often difficult. Some tasks may even necessitate the implementation of manual interaction tools to achieve a quality that is sufficient for the subsequent analysis. In this work, we present a pipeline of segmentation tools that can be used for the semi-automatic segmentation and quantitative analysis of voids in tissue (i.e. internal structural porosity). We use this pipeline to analyze lacuno-canalicular networks in stingray tesserae from 3D images acquired with synchrotron microCT. * The first step of this processing pipeline, the segmentation of the tesserae, was performed using standard marker-based watershed segmentation. The efficient processing of the next two steps, that is, the segmentation of all lacunae spaces belonging to a specific tessera and the separation of these spaces into individual lacunae required modern, recently developed tools. * For proofreading, we developed a graph-based interactive method that allowed us to quickly split lacunae that were accidentally merged, and to merge lacunae that were wrongly split. * Finally, the tesserae and their corresponding lacunae were subdivided into anatomical regions of interest (structural wedges) using a semi- manual approach.
    Language: English
    Type: reportzib , doc-type:preprint
    Format: application/pdf
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 141
    Publication Date: 2022-07-19
    Description: In most vertebrates the embryonic cartilaginous skeleton is replaced by bone during development. During this process, cartilage cells (chondrocytes) mineralize the extracellular matrix and undergo apoptosis, giving way to bone cells (osteocytes). In contrast, sharks and rays (elasmobranchs) have cartilaginous skeletons throughout life, where only the surface mineralizes, forming a layer of tiles (tesserae). Elasmobranch chondrocytes, unlike those of other vertebrates, survive cartilage mineralization and are maintained alive in spaces (lacunae) within tesserae. However, the function(s) of the chondrocytes in the mineralized tissue remain unknown. Applying a custom analysis workflow to high-resolution synchrotron microCT scans of tesserae, we characterize the morphologies and arrangements of stingray chondrocyte lacunae, using lacunar morphology as a proxy for chondrocyte morphology. We show that the cell density is comparable in unmineralized and mineralized tissue from our study species and that cells maintain the similar volume even when they have been incorporated into tesserae. This discovery supports previous hypotheses that elasmobranch chondrocytes, unlike those of other taxa, do not proliferate, hypertrophy or undergo apoptosis during mineralization. Tessera lacunae show zonal variation in their shapes—being flatter further from and more spherical closer to the unmineralized cartilage matrix and larger in the center of tesserae— and show pronounced organization into parallel layers and strong orientation toward neighboring tesserae. Tesserae also exhibit local variation in lacunar density, with the density considerably higher near pores passing through the tesseral layer, suggesting pores and cells interact (e.g. that pores contain a nutrient source). We hypothesize that the different lacunar types reflect the stages of the tesserae formation process, while also representing local variation in tissue architecture and cell function. Lacunae are linked by small passages (canaliculi) in the matrix to form elongate series at the tesseral periphery and tight clusters in the center of tesserae, creating a rich connectivity among cells. The network arrangement and the shape variation of chondrocytes in tesserae indicate that cells may interact within and between tesserae and manage mineralization differently from chondrocytes in other vertebrates, perhaps performing analogous roles to osteocytes in bone.
    Language: English
    Type: article , doc-type:article
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 142
    Publication Date: 2022-07-19
    Description: This study’s objective was the generation of a standardized geometry of the healthy nasal cavity. An average geometry of the healthy nasal cavity was generated using a statistical shape model based on 25 symptom-free subjects. Airflow within the average geometry and these geometries was calculated using fluid simulations. Integral measures of the nasal resistance, wall shear stresses (WSS) and velocities were calculated as well as cross-sectional areas (CSA). Furthermore, individual WSS and static pressure distributions were mapped onto the average geometry. The average geometry featured an overall more regular shape that resulted in less resistance, reduced wall shear stresses and velocities compared to the median of the 25 geometries. Spatial distributions of WSS and pressure of average geometry agreed well compared to the average distributions of all individual geometries. The minimal CSA of the average geometry was larger than the median of all individual geometries (83.4 vs. 74.7 mm²). The airflow observed within the average geometry of the healthy nasal cavity did not equal the average airflow of the individual geometries. While differences observed for integral measures were notable, the calculated values for the average geometry lay within the distributions of the individual parameters. Spatially resolved parameters differed less prominently.
    Language: English
    Type: article , doc-type:article
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 143
    Publication Date: 2022-07-19
    Description: We present time-space trade-offs for computing the Euclidean minimum spanning tree of a set S of n point-sites in the plane. More precisely, we assume that S resides in a random-access memory that can only be read. The edges of the Euclidean minimum spanning tree EMST(S) have to be reported sequentially, and they cannot be accessed or modified afterwards. There is a parameter s in {1, ..., n} so that the algorithm may use O(s) cells of read-write memory (called the workspace) for its computations. Our goal is to find an algorithm that has the best possible running time for any given s between 1 and n. We show how to compute EMST(S) in O(((n^3)/(s^2)) log s) time with O(s) cells of workspace, giving a smooth trade-off between the two best-known bounds O(n^3) for s = 1 and O(n log n) for s = n. For this, we run Kruskal's algorithm on the "relative neighborhood graph" (RNG) of S. It is a classic fact that the minimum spanning tree of RNG(S) is exactly EMST(S). To implement Kruskal's algorithm with O(s) cells of workspace, we define s-nets, a compact representation of planar graphs. This allows us to efficiently maintain and update the components of the current minimum spanning forest as the edges are being inserted.
    Language: English
    Type: article , doc-type:article
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 144
    Publication Date: 2022-07-19
    Description: In most vertebrates the embryonic cartilaginous skeleton is replaced by bone during development. During this process, cartilage cells (chondrocytes) mineralize the extracellular matrix and undergo apoptosis, giving way to bone cells (osteocytes). In contrast, sharks and rays (elasmobranchs) have cartilaginous skeletons throughout life, where only the surface mineralizes, forming a layer of tiles (tesserae). Elasmobranch chondrocytes, unlike those of other vertebrates, survive cartilage mineralization and are maintained alive in spaces (lacunae) within tesserae. However, the function(s) of the chondrocytes in the mineralized tissue remain unknown. Applying a custom analysis workflow to high-resolution synchrotron microCT scans of tesserae, we characterize the morphologies and arrangements of stingray chondrocyte lacunae, using lacunar morphology as a proxy for chondrocyte morphology. We show that the cell density is comparable in unmineralized and mineralized tissue from our study species and that cells maintain the similar volume even when they have been incorporated into tesserae. This discovery supports previous hypotheses that elasmobranch chondrocytes, unlike those of other taxa, do not proliferate, hypertrophy or undergo apoptosis during mineralization. Tessera lacunae show zonal variation in their shapes—being flatter further from and more spherical closer to the unmineralized cartilage matrix and larger in the center of tesserae— and show pronounced organization into parallel layers and strong orientation toward neighboring tesserae. Tesserae also exhibit local variation in lacunar density, with the density considerably higher near pores passing through the tesseral layer, suggesting pores and cells interact (e.g. that pores contain a nutrient source). We hypothesize that the different lacunar types reflect the stages of the tesserae formation process, while also representing local variation in tissue architecture and cell function. Lacunae are linked by small passages (canaliculi) in the matrix to form elongate series at the tesseral periphery and tight clusters in the center of tesserae, creating a rich connectivity among cells. The network arrangement and the shape variation of chondrocytes in tesserae indicate that cells may interact within and between tesserae and manage mineralization differently from chondrocytes in other vertebrates, perhaps performing analogous roles to osteocytes in bone.
    Language: English
    Type: reportzib , doc-type:preprint
    Format: application/pdf
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 145
    Publication Date: 2022-07-19
    Language: English
    Type: article , doc-type:article
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 146
    Publication Date: 2022-07-19
    Description: An advantageous property of mesh-based geometric morphometrics (GM) towards landmark-based approaches, is the possibility of precisely examining highly irregular shapes and highly topographic surfaces. In case of spherical-harmonics-based GM the main requirement is a completely closed mesh surface, which often is not given, especially when dealing with natural objects. Here we present a methodological workflow to prepare 3D segmentations containing large cavity openings for the conduction of spherical-harmonics-based GM. This will be exemplified with a case study on claws of hermit crabs (Paguroidea, Decapoda, Crustacea), whereby joint openings – between manus and “movable finger” – typify the large-cavity-opening problem. We found a methodology including an ambient-occlusion-based segmentation algorithm leading to results precise and suitable to study the inter- and intraspecific differences in shape of hermit crab claws. Statistical analyses showed a significant separation between all examined diogenid and pagurid claws, whereas the separation between all left and right claws did not show significance. Additionally, the procedure offers other benefits. It is easy to reproduce and creates sparse variance in the data, closures integrate smoothly into the total structures and the algorithm saves a significant amount of time.
    Language: English
    Type: reportzib , doc-type:preprint
    Format: application/pdf
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 147
    Publication Date: 2022-07-19
    Description: We present a software-assisted workflow for the alignment and matching of filamentous structures across a 3D stack of serial images. This is achieved by combining automatic methods, visual validation, and interactive correction. After an initial alignment, the user can continuously improve the result by interactively correcting landmarks or matches of filaments. Supported by a visual quality assessment of regions that have been already inspected, this allows a trade-off between quality and manual labor. The software tool was developed to investigate cell division by quantitative 3D analysis of microtubules (MTs) in both mitotic and meiotic spindles. For this, each spindle is cut into a series of semi-thick physical sections, of which electron tomograms are acquired. The serial tomograms are then stitched and non-rigidly aligned to allow tracing and connecting of MTs across tomogram boundaries. In practice, automatic stitching alone provides only an incomplete solution, because large physical distortions and a low signal-to-noise ratio often cause experimental difficulties. To derive 3D models of spindles despite the problems related to sample preparation and subsequent data collection, semi-automatic validation and correction is required to remove stitching mistakes. However, due to the large number of MTs in spindles (up to 30k) and their resulting dense spatial arrangement, a naive inspection of each MT is too time consuming. Furthermore, an interactive visualization of the full image stack is hampered by the size of the data (up to 100 GB). Here, we present a specialized, interactive, semi-automatic solution that considers all requirements for large-scale stitching of filamentous structures in serial-section image stacks. The key to our solution is a careful design of the visualization and interaction tools for each processing step to guarantee real-time response, and an optimized workflow that efficiently guides the user through datasets.
    Language: English
    Type: article , doc-type:article
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 148
    Publication Date: 2022-07-19
    Language: English
    Type: article , doc-type:article
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 149
    Publication Date: 2022-07-19
    Description: Quantitative photoacoustic tomography aims recover the spatial distribution of absolute chromophore concentrations and their ratios from deep tissue, high-resolution images. In this study, a model-based inversion scheme based on a Monte-Carlo light transport model is experimentally validated on 3-D multispectral images of a tissue phantom acquired using an all-optical scanner with a planar detection geometry. A calibrated absorber allowed scaling of the measured data during the inversion, while an acoustic correction method was employed to compensate the effects of limited view detection. Chromophore- and fluence-dependent step sizes and Adam optimization were implemented to achieve rapid convergence. High resolution 3-D maps of absolute concentrations and their ratios were recovered with high accuracy. Potential applications of this method include quantitative functional and molecular photoacoustic tomography of deep tissue in preclinical and clinical studies.
    Language: English
    Type: article , doc-type:article
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 150
    Publication Date: 2022-07-19
    Language: English
    Type: article , doc-type:article
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 151
    Publication Date: 2022-07-19
    Description: We analytically determine Jacobi fields and parallel transports and compute geodesic regression in Kendall’s shape space. Using the derived expressions, we can fully leverage the geometry via Riemannian optimization and thereby reduce the computational expense by several orders of magnitude over common, nonlinear constrained approaches. The methodology is demonstrated by performing a longitudinal statistical analysis of epidemiological shape data. As an example application we have chosen 3D shapes of knee bones, reconstructed from image data of the Osteoarthritis Initiative (OAI). Comparing subject groups with incident and developing osteoarthritis versus normal controls, we find clear differences in the temporal development of femur shapes. This paves the way for early prediction of incident knee osteoarthritis, using geometry data alone.
    Language: English
    Type: article , doc-type:article
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 152
    Publication Date: 2022-07-19
    Description: A prerequisite for many analysis tasks in modern comparative biology is the segmentation of 3-dimensional (3D) images of the specimens being investigated (e.g. from microCT data). Depending on the specific imaging technique that was used to acquire the images and on the image resolution, different segmentation tools will be required. While some standard tools exist that can often be applied for specific subtasks, building whole processing pipelines solely from standard tools is often difficult. Some tasks may even necessitate the implementation of manual interaction tools to achieve a quality that is sufficient for the subsequent analysis. In this work, we present a pipeline of segmentation tools that can be used for the semi-automatic segmentation and quantitative analysis of voids in tissue (i.e. internal structural porosity). We use this pipeline to analyze lacuno-canalicular networks in stingray tesserae from 3D images acquired with synchrotron microCT. * The first step of this processing pipeline, the segmentation of the tesserae, was performed using standard marker-based watershed segmentation. The efficient processing of the next two steps, that is, the segmentation of all lacunae spaces belonging to a specific tessera and the separation of these spaces into individual lacunae required modern, recently developed tools. * For proofreading, we developed a graph-based interactive method that allowed us to quickly split lacunae that were accidentally merged, and to merge lacunae that were wrongly split. * Finally, the tesserae and their corresponding lacunae were subdivided into anatomical regions of interest (structural wedges) using a semi- manual approach.
    Language: English
    Type: article , doc-type:article
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 153
    Publication Date: 2022-07-19
    Description: Conflicting hypotheses about the relationships among the major lineages of aculeate Hymenoptera clearly show the necessity of detailed comparative morphological studies. Using micro-computed tomography and 3D reconstructions, the skeletal musculature of the meso- and metathorax and the first and second abdominal segment in Apoidea are described. Females of Sceliphron destillatorium, Sphex (Fernaldina) lucae (both Sphecidae), and Ampulex compressa (Ampulicidae) were examined. The morphological terminology provided by the Hymenoptera Anatomy Ontology is used. Up to 42 muscles were found. The three species differ in certain numerical and structural aspects. Ampulicidae differs significantly from Sphecidae in the metathorax and the anterior abdomen. The metapleural apodeme and paracoxal ridge are weakly developed in Ampulicidae, which affect some muscular structures. Furthermore, the muscles that insert on the coxae and trochanters are broader and longer in Ampulicidae. A conspicuous characteristic of Sphecidae is the absence of the metaphragma. Overall, we identified four hitherto unrecognized muscles. Our work suggests additional investigations on structures discussed in this paper.
    Language: English
    Type: article , doc-type:article
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 154
    Publication Date: 2022-07-19
    Description: We present an automated method for extrapolating missing regions in label data of the skull in an anatomically plausible manner. The ultimate goal is to design patient-speci� c cranial implants for correcting large, arbitrarily shaped defects of the skull that can, for example, result from trauma of the head. Our approach utilizes a 3D statistical shape model (SSM) of the skull and a 2D generative adversarial network (GAN) that is trained in an unsupervised fashion from samples of healthy patients alone. By � tting the SSM to given input labels containing the skull defect, a First approximation of the healthy state of the patient is obtained. The GAN is then applied to further correct and smooth the output of the SSM in an anatomically plausible manner. Finally, the defect region is extracted using morphological operations and subtraction between the extrapolated healthy state of the patient and the defective input labels. The method is trained and evaluated based on data from the MICCAI 2020 AutoImplant challenge. It produces state-of-the art results on regularly shaped cut-outs that were present in the training and testing data of the challenge. Furthermore, due to unsupervised nature of the approach, the method generalizes well to previously unseen defects of varying shapes that were only present in the hidden test dataset.
    Language: English
    Type: article , doc-type:article
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 155
    Publication Date: 2022-09-22
    Description: A new virtual unfolding technique was applied to a silver scroll excavated in Jerash, Jordan, in 2014. As result of the unfolding, 17 lines of writing are clearly visible in the unfolded volumetric data that is published here.
    Language: English
    Type: researchdata , doc-type:ResearchData
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 156
    Publication Date: 2022-11-28
    Language: English
    Type: book , doc-type:book
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 157
  • 158
    Publication Date: 2022-11-28
    Language: English
    Type: incollection , doc-type:Other
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 159
    Publication Date: 2022-11-28
    Description: We present a novel kernel-based machine learning algorithm for identifying the low-dimensional geometry of the effective dynamics of high-dimensional multiscale stochastic systems. Recently, the authors developed a mathematical framework for the computation of optimal reaction coordinates of such systems that is based on learning a parameterization of a low-dimensional transition manifold in a certain function space. In this article, we enhance this approach by embedding and learning this transition manifold in a reproducing kernel Hilbert space, exploiting the favorable properties of kernel embeddings. Under mild assumptions on the kernel, the manifold structure is shown to be preserved under the embedding, and distortion bounds can be derived. This leads to a more robust and more efficient algorithm compared to the previous parameterization approaches.
    Language: English
    Type: article , doc-type:article
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 160
    Publication Date: 2022-11-28
    Description: Markov State Models (MSM) sind der Goldstandard zur Modellierung biomolekularer Dynamik, da sie die Identifizierung und Analyse metastabiler Zustände ermöglichen. Die robuste Perron-Cluster-Cluster-Analyse (PCCA+) ist ein verbreiteter Spectral-Clustering-Algorithmus, der für das Clustering hochdimensionaler MSM verwendet wird. Da die PCCA+ auf reversible Prozesse beschränkt ist, wird sie zur Generalisierten PCCA+ (G-PCCA) verallgemeinert, die geeignet ist, nichtreversible Prozesse aufzuklären. Bernhard Reuter untersucht hier mittels G-PCCA die nichtthermischen Auswirkungen von Mikrowellen auf die Proteindynamik. Dazu führt er molekulardynamische Nichtgleichgewichtssimulationen des Amyloid-β-(1–40)-Peptids durch und modelliert diese.
    Language: German
    Type: book , doc-type:book
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 161
    Publication Date: 2022-11-28
    Language: English
    Type: incollection , doc-type:Other
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 162
    Publication Date: 2022-11-28
    Description: Model reduction of large Markov chains is an essential step in a wide array of techniques for understanding complex systems and for efficiently learning structures from high-dimensional data. We present a novel aggregation algorithm for compressing such chains that exploits a specific low-rank structure in the transition matrix which, e.g., is present in metastable systems, among others. It enables the recovery of the aggregates from a vastly undersampled transition matrix which in practical applications may gain a speedup of several orders of mag- nitude over methods that require the full transition matrix. Moreover, we show that the new technique is robust under perturbation of the transition matrix. The practical applicability of the new method is demonstrated by identifying a reduced model for the large-scale traffic flow patterns from real-world taxi trip data.
    Language: English
    Type: reportzib , doc-type:preprint
    Format: application/pdf
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 163
    Publication Date: 2022-12-05
    Language: English
    Type: article , doc-type:article
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 164
    E-Resource
    E-Resource
    München :Linux New Media, ; 2010(2011) - 2013(2014); damit Ersch. eingest.
    Title: Admin : Netzwerk & Security; Jahres-DVD : der komplette Jahrgang ... auf einer DVD, Elektronische Ressource
    Publisher: München :Linux New Media,
    Year of publication: 2011-2014
    Dates of Publication: 2010(2011) - 2013(2014); damit Ersch. eingest.
    Pages: DVDs
    ISSN: 2191-4494 , 2191-4494
    Type of Medium: Electronic Resource
    Language: German
    Former Title: Hauptsacht. vom Behältnis
    Note: Periodizität: jährl.
    Parallel Title: Admin
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 165
    Publication Date: 2016-06-09
    Description: We present a time-dependent finite element model of the human knee joint of full 3D geometric complexity. Its efficient numerical simulation requires advanced numerical algorithms that have been developed just recently. Up to now, the model comprises bones, cartilage, and the major ligaments (patella and menisci are still missing). Bones (femur, tibia, and fibula) are modelled by linear elastic materials, cartilage by viscoelastic materials, ligaments by one-dimensional so-called Cosserat rods. In order to capture the dynamical contact problems correctly, we solve the full PDEs of elasticity in the presence of strict contact inequalities. For the total spatio-temporal discretization we apply a method of layers approach (first time, then space discretization). For the time discretization of the elastic and viscoelastic parts, we apply a new contact-stabilized Newmark method, while for the Cosserat rods we choose an energy-momentum method. For the space discretization, we use linear finite elements for the elastic and viscoelastic parts and novel geodesic finite elements for the Cosserat rods. The coupled system is solved by a Dirichlet-Neumann method, and the arising large algebraic systems are solved by a recent fast multigrid solver, the truncated non-smooth Newton multigrid method.
    Language: English
    Type: reportzib , doc-type:preprint
    Format: application/pdf
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 166
    Publication Date: 2020-08-05
    Description: Im Zuge der Übernahme von 6 Linien der Havelbus Verkehrsgesellschaft mbH durch die ViP Verkehr in Potsdam GmbH ergab sich 2009 die Notwendigkeit der Entwicklung eines neuen Linien- und Taktplans für das Jahr 2010. Das Konrad-Zuse-Zentrum für Informationstechnik Berlin (ZIB) entwickelt in einem Projekt des DFG-Forschungszentrums Matheon ein Verfahren zur mathematischen Linienoptimierung. Dieses Tool wurde bei der Optimierung des ViP Linienplans 2010 in einer projektbegleitenden Studie eingesetzt, um Alternativen bei verschiedenen Planungs- und Zielvorgaben auszuloten. In dem Artikel wird eine Auswertung der Ergebnisse mit dem Verkehrsanalysesystem Visum der PTV AG beschrieben. Die Auswertungen bestätigen, dass mit Hilfe von mathematischer Optimierung eine weitere Verkürzung der Reisezeit um 1%, eine als um 6% verkürzt empfundene Reisezeit, 10% weniger Fahrzeit im Fahrzeug und eine gleichzeitige Kostenreduktion um 5% möglich sind.
    Language: German
    Type: reportzib , doc-type:preprint
    Format: application/pdf
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 167
    Publication Date: 2020-08-05
    Description: Vehicle rotation planning is a fundamental problem in rail transport. It decides how the railcars, locomotives, and carriages are operated in order to implement the trips of the timetable. One important planning requirement is operational regularity, i.e., using the rolling stock in the same way on every day of operation. We propose to take regularity into account by modeling the vehicle rotation planning problem as a minimum cost hyperassignment problem (HAP). Hyperassignments are generalizations of assignments from directed graphs to directed hypergraphs. Finding a minimum cost hyperassignment is NP-hard. Most instances arising from regular vehicle rotation planning, however, can be solved well in practice. We show that, in particular, clique inequalities strengthen the canonical LP relaxation substantially.
    Language: English
    Type: reportzib , doc-type:preprint
    Format: application/pdf
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 168
    Publication Date: 2020-08-05
    Description: Despite the success of constraint programming (CP) for scheduling, the much wider penetration of mixed integer programming (MIP) technology into business applications means that many practical scheduling problems are being addressed with MIP, at least as an initial approach. Furthermore, there has been impressive and well-documented improvements in the power of generic MIP solvers over the past decade. We empirically demonstrate that on an existing set of resource allocation and scheduling problems standard MIP and CP models are now competitive with the state-of-the-art manual decomposition approach. Motivated by this result, we formulate two tightly coupled hybrid models based on constraint integer programming (CIP) and demonstrate that these models, which embody advances in CP and MIP, are able to out-perform the CP, MIP, and decomposition models. We conclude that both MIP and CIP are technologies that should be considered along with CP for solving scheduling problems.
    Language: English
    Type: reportzib , doc-type:preprint
    Format: application/pdf
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 169
    Publication Date: 2020-08-05
    Description: The Steiner tree packing problem (STPP) in graphs is a long studied problem in combinatorial optimization. In contrast to many other problems, where there have been tremendous advances in practical problem solving, STPP remains very difficult. Most heuristics schemes are ineffective and even finding feasible solutions is already NP-hard. What makes this problem special is that in order to reach the overall optimal solution non-optimal solutions to the underlying NP-hard Steiner tree problems must be used. Any non-global approach to the STPP is likely to fail. Integer programming is currently the best approach for computing optimal solutions. In this paper we review some “classical” STPP instances which model the underlying real world application only in a reduced form. Through improved modelling, including some new cutting planes, and by emplyoing recent advances in solver technology we are for the first time able to solve those instances in the original 3D grid graphs to optimimality.
    Language: English
    Type: reportzib , doc-type:preprint
    Format: application/pdf
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 170
    Publication Date: 2020-08-05
    Description: We propose duty templates as a novel concept to produce similar duty schedules for similar days of operation in public transit. Duty templates can conveniently handle various types of similarity requirements, and they can be implemented with ease using standard algorithmic techniques. They have produced good results in practice.
    Language: English
    Type: reportzib , doc-type:preprint
    Format: application/pdf
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 171
    Publication Date: 2020-08-05
    Description: We propose rapid branching (RB) as a general branch-and-bound heuristic for solving large scale optimization problems in traffic and transport. The key idea is to combine a special branching rule and a greedy node selection strategy in order to produce solutions of controlled quality rapidly and efficiently. We report on three successful applications of the method for integrated vehicle and crew scheduling, railway track allocation, and railway vehicle rotation planning.
    Language: English
    Type: reportzib , doc-type:preprint
    Format: application/pdf
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 172
    Publication Date: 2020-08-05
    Description: This paper provides a generic formulation for rolling stock planning problems in the context of intercity passenger traffic. The main contributions are a graph theoretical model and a Mixed-Integer-Programming formulation that integrate all main requirements of the considered Vehicle-Rotation-Planning problem (VRPP). We show that it is possible to solve this model for real-world instances provided by our industrial partner DB Fernverkehr AG using modern algorithms and computers.
    Language: English
    Type: reportzib , doc-type:preprint
    Format: application/pdf
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 173
    Publication Date: 2022-03-14
    Description: We present Undercover, a primal heuristic for nonconvex mixed-integer nonlinear programming (MINLP) that explores a mixed-integer linear subproblem (sub-MIP) of a given MINLP. We solve a vertex covering problem to identify a minimal set of variables that need to be fixed in order to linearize each constraint, a so-called cover. Subsequently, these variables are fixed to values obtained from a reference point, e.g., an optimal solution of a linear relaxation. We apply domain propagation and conflict analysis to try to avoid infeasibilities and learn from them, respectively. Each feasible solution of the sub-MIP corresponds to a feasible solution of the original problem. We present computational results on a test set of mixed-integer quadratically constrained programs (MIQCPs) and general MINLPs from MINLPLib. It turns out that the majority of these instances allow for small covers. Although general in nature, the heuristic appears most promising for MIQCPs, and complements nicely with existing root node heuristics in different state-of-the-art solvers.
    Language: English
    Type: reportzib , doc-type:preprint
    Format: application/pdf
    Format: application/pdf
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 174
    facet.materialart.
    Unknown
    Publication Date: 2017-11-15
    Description: In this article, an illustrative example is given for the coarse-graining of a Markov process which leads to a shift in the statistical weights of a two-states-system. The example is based on a 2D-funnel trap. The funnel trap is constructed in such a way, that the area inside and outside of the trap is identical. However, observing the flight of the insect as a Markov process, the probability for being “in the trap” is higher. This example can be transferred to several kinds of processes (like receptor-ligandbinding processes in chemistry) and describes the influence of “re-entering events”.
    Language: English
    Type: reportzib , doc-type:preprint
    Format: application/pdf
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 175
    Publication Date: 2019-01-29
    Description: We consider a shape implant design problem that arises in the context of facial surgery. We introduce a reformulation as an optimal control problem, where the control acts as a boundary force. The state is modelled as a minimizer of a polyconvex hyperelastic energy functional. We show existence of optimal solutions and derive - on a formal level - first order optimality conditions. Finally, preliminary numerical results are presented.
    Language: English
    Type: reportzib , doc-type:preprint
    Format: application/pdf
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 176
    Publication Date: 2020-08-05
    Description: Das TELOTA-Projekt - zunächst nur für zwei Jahre gestartet - feierte am 15. Juni 2011 sein 10-jähriges Bestehen im Rahmen eines Workshops mit einem abschließenden Festvortrag von Richard Stallmann zum Thema „Copyright versus community in the age of computer networks“. Diese Veranstaltung zeigte, wie aktuell die TELOTA-Themen weiterhin sind und dass diese eine große Resonanz in der allgemeinen Öffentlichkeit finden. Die TELOTA-Aktivitäten haben sich als wichtiger Bestandteil der IT-Infrastruktur der BBAW erwiesen, gehen aber weit über reinen Service hinaus. Sie beeinflussen die Forschung selbst und führen zu neuen interessanten wissenschaftlichen Fragestellungen. Der Rückblick auf die ersten zehn Jahre der TELOTA-Initiative in diesem Artikel soll einen kleinen Eindruck von dem geben, was bisher geleistet wurde.
    Language: German
    Type: reportzib , doc-type:preprint
    Format: application/pdf
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 177
    Publication Date: 2020-08-05
    Description: In this paper, we study the influence of technology, traffic properties and price trends on optimized design of a reference IP-over-WDM network with rich underlying fiber topology. In each network node, we investigate the optimal degree of traffic switching in an optical (lambda) domain versus an electrical (packet) domain, also known as measure of \emph{node transparency}. This measure is studied in connection to changes in traffic volume, demand affinity, optical circuit speeds and equipment cost. By applying variable design constraints, we assess the relative roles of the two distinct equipment groups, IP routers and optical cross-connects, with respect to resulting changes in cost-sensitive network architectures.
    Language: English
    Type: reportzib , doc-type:preprint
    Format: application/pdf
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 178
    Publication Date: 2020-08-05
    Description: Wieviele Punkte braucht eine Mannschaft in der Fußball-Bundesliga mindestens, um sicher dem Abstieg zu entgehen? Wir benutzen kombinatorische Optimierung, um diese und ähnliche Fragen zu beantworten.
    Language: German
    Type: reportzib , doc-type:preprint
    Format: application/pdf
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 179
    Publication Date: 2020-11-16
    Description: Das vom BMBF geförderte Projekt FTTX-PLAN entwickelt mathematische Modelle und Optimierungsverfahren, um automatisiert kostenoptimierte FTTx-Netze berechnen zu können. Wir zeigen anhand einer Praxisstudie in Zusammenarbeit mit der Regensburger R-KOM, wie ein Planer von diesen Verfahren profitieren kann, um die Auswirkungen bestimmter Entscheidungen auf die Netzstruktur und -kosten zu untersuchen. Wir illustrieren dies am Beispiel eines FTTB/FTTH-Vergleichs, der Variation von Kundenanbindungsraten und der gezielten Ausnutzung existierender Leerrohre, um Tiefbau zu vermeiden.
    Language: German
    Type: reportzib , doc-type:preprint
    Format: application/pdf
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 180
    Publication Date: 2020-08-05
    Description: In this paper we assess to which extent trenching costs of an FTTx network are unavoidable, even if technical side constraints are neglected. For that purpose we present an extended Steiner tree model. Using a variety of realistic problem instances we demonstrate that the total trenching cost can only be reduced by about 5 percent in realistic scenarios. This work has been funded by BMBF (German Federal Ministry of Education and Research) within the program "KMU-innovativ".
    Language: English
    Type: reportzib , doc-type:preprint
    Format: application/pdf
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 181
    Publication Date: 2020-08-05
    Description: The hypergraph assignment problem (HAP) is the generalization of assignments from directed graphs to directed hypergraphs. It serves, in particular, as a universal tool to model several train composition rules in vehicle rotation planning for long distance passenger railways. We prove that even for problems with a small hyperarc size and hypergraphs with a special partitioned structure the HAP is NP-hard and APX-hard. Further, we present an extended integer linear programming formulation which implies, e. g., all clique inequalities.
    Language: English
    Type: reportzib , doc-type:preprint
    Format: application/pdf
    Format: application/pdf
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 182
    Publication Date: 2020-08-05
    Description: We show that a class of semidefinite programs (SDP) admits a solution that is a positive semidefinite matrix of rank at most $r$, where $r$ is the rank of the matrix involved in the objective function of the SDP. The optimization problems of this class are semidefinite packing problems, which are the SDP analogs to vector packing problems. Of particular interest is the case in which our result guarantees the existence of a solution of rank one: we show that the computation of this solution actually reduces to a Second Order Cone Program (SOCP). We point out an application in statistics, in the optimal design of experiments.
    Language: English
    Type: reportzib , doc-type:preprint
    Format: application/pdf
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 183
    Publication Date: 2020-08-05
    Description: In this paper, we study the hop constrained chain polytope, that is, the convex hull of the incidence vectors of (s,t)-chains using at most k arcs of a given digraph, and its dominant. We use extended formulations (implied by the inherent structure of the Moore-Bellman-Ford algorithm) to derive facet defining inequalities for these polyhedra via projection. Our findings result into characterizations of all facet defining {0,+1,-1}-inequalities for the hop constrained chain polytope and all facet defining {0,1}-inequalities for its dominant. Although the derived inequalities are already known, such classifications were not previously given to the best of our knowledge. Moreover, we use this approach to generalize so called jump inequalities, which have been introduced in a paper of Dahl and Gouveia in 2004.
    Language: English
    Type: reportzib , doc-type:preprint
    Format: application/pdf
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 184
    Publication Date: 2016-06-09
    Description: We propose a cubic regularization algorithm that is constructed to deal with nonconvex minimization problems in function space. It allows for a flexible choice of the regularization term and thus accounts for the fact that in such problems one often has to deal with more than one norm. Global and local convergence results are established in a general framework. Moreover, several variants of step computations are compared. In the context of nonlinear elasticity it turns out the a cg method applied to an augmented Hessian is more robust than truncated cg.
    Language: English
    Type: reportzib , doc-type:preprint
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 185
    Publication Date: 2020-08-05
    Description: We study a family of combinatorial optimization problems defined by a parameter $p\in[0,1]$, which involves spectral functions applied to positive semidefinite matrices, and has some application in the theory of optimal experimental design. This family of problems tends to a generalization of the classical maximum coverage problem as $p$ goes to $0$, and to a trivial instance of the knapsack problem as $p$ goes to $1$. In this article, we establish a matrix inequality which shows that the objective function is submodular for all $p\in[0,1]$, from which it follows that the greedy approach, which has often been used for this problem, always gives a design within $1-1/e$ of the optimum. We next study the design found by rounding the solution of the continuous relaxed problem, an approach which has been applied by several authors. We prove an inequality which generalizes a classical result from the theory of optimal designs, and allows us to give a rounding procedure with an approximation factor which tends to $1$ as $p$ goes to $1$.
    Language: English
    Type: reportzib , doc-type:preprint
    Format: application/pdf
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 186
    Publication Date: 2020-08-05
    Description: In the past few years several applications of optimal experimental designs have emerged to optimize the measurements in communication networks. The optimal design problems arising from this kind of applications share three interesting properties: (i) measurements are only available at a small number of locations of the network; (ii) each monitor can simultaneously measure several quantities, which can be modeled by ``multiresponse experiments"; (iii) the observation matrices depend on the topology of the network. In this paper, we give an overview of these experimental design problems and recall recent results for the computation of optimal designs by Second Order Cone Programming (SOCP). New results for the network-monitoring of a discrete time process are presented. In particular, we show that the optimal design problem for the monitoring of an AR1 process can be reduced to the standard form and we give experimental results.
    Language: English
    Type: reportzib , doc-type:preprint
    Format: application/pdf
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 187
    Publication Date: 2020-08-05
    Description: This thesis is about mathematical optimization for the efficient use of railway infrastructure. We address the optimal allocation of the available railway track capacity - the track allocation problem. This track allocation problem is a major challenge for a railway company, independent of whether a free market, a private monopoly, or a public monopoly is given. Planning and operating railway transportation systems is extremely hard due to the combinatorial complexity of the underlying discrete optimization problems, the technical intricacies, and the immense sizes of the problem instances. Mathematical models and optimization techniques can result in huge gains for both railway customers and operators, e.g., in terms of cost reductions or service quality improvements. We tackle this challenge by developing novel mathematical models and associated innovative algorithmic solution methods for large scale instances. This allows us to produce for the first time reliable solutions for a real world instance, i.e., the Simplon corridor in Switzerland. The opening chapter gives a comprehensive overview on railway planning problems. This provides insights into the regulatory and technical framework, it discusses the interaction of several planning steps, and identifies optimization potentials in railway transportation. The remainder of the thesis is comprised of two major parts. The first part is concerned with modeling railway systems to allow for resource and capacity analysis. Railway capacity has basically two dimensions, a space dimension which are the physical infrastructure elements as well as a time dimension that refers to the train movements, i.e., occupation or blocking times, on the physical infrastructure. Railway safety systems operate on the same principle all over the world. A train has to reserve infrastructure blocks for some time to pass through. Two trains reserving the same block of the infrastructure within the same point in time is called block conflict. Therefore, models for railway capacity involve the definition and calculation of reasonable running and associated reservation and blocking times to allow for a conflict free allocation. In the second and main part of the thesis, the optimal track allocation problem for macroscopic models of the railway system is considered. The literature for related problems is surveyed. A graph-theoretic model for the track allocation problem is developed. In that model optimal track allocations correspond to conflict-free paths in special time-expanded graphs. Furthermore, we made considerable progress on solving track allocation problems by two main features - a novel modeling approach for the macroscopic track allocation problem and algorithmic improvements based on the utilization of the bundle method. Finally, we go back to practice and present in the last chapter several case studies using the tools netcast and tsopt. We provide a computational comparison of our new models and standard packing models used in the literature. Our computational experience indicates that our approach, i.e., ``configuration models'', outperforms other models. Moreover, the rapid branching heuristic and the bundle method enable us to produce high quality solutions for very large scale instances, which has not been possible before. In addition, we present results for a theoretical and rather visionary auction framework for track allocation. We discuss several auction design questions and analyze experiments of various auction simulations. The highlights are results for the Simplon corridor in Switzerland. We optimized the train traffic through this tunnel using our models and software tools. To the best knowledge of the author and confirmed by several railway practitioners this was the first time that fully automatically produced track allocations on a macroscopic scale fulfill the requirements of the originating microscopic model, withstand the evaluation in the microscopic simulation tool OpenTrack, and exploit the infrastructure capacity. This documents the success of our approach in practice and the usefulness and applicability of mathematical optimization to railway track allocation.
    Language: English
    Type: doctoralthesis , doc-type:doctoralThesis
    Format: application/pdf
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 188
    Publication Date: 2020-08-05
    Description: We propose a game theoretic model for the spatial distribution of inspectors on a transportation network. The problem is to spread out the controls so as to enforce the payment of a transit toll. We formulate a linear program to find the control distribution which maximizes the expected toll revenue, and a mixed integer program for the problem of minimizing the number of evaders. Furthermore, we show that the problem of finding an optimal mixed strategy for a coalition of $N$ inspectors can be solved efficiently by a column generation procedure. Finally, we give experimental results from an application to the truck toll on German motorways.
    Language: English
    Type: reportzib , doc-type:preprint
    Format: application/pdf
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 189
    Publication Date: 2021-01-22
    Description: Die mittel- und längerfristige Planung für den Gastransport hat sich durch Änderungen in den regulatorischen Rahmenbedingungen stark verkompliziert. Kernpunkt ist die Trennung von Gashandel und -transport. Dieser Artikel diskutiert die hieraus resultierenden mathematischen Planungsprobleme, welche als Validierung von Nominierungen und Buchungen, Bestimmung der technischen Kapazität und Topologieplanung bezeichnet werden. Diese mathematischen Optimierungsprobleme werden vorgestellt und Lösungsansätze skizziert.
    Language: German
    Type: reportzib , doc-type:preprint
    Format: application/pdf
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 190
    Publication Date: 2020-08-05
    Description: In this paper we give an analytical description on the structure of solutions to the gas nomination validation problem in gas transportation networks. These networks are assumed to contain no active devices, only certain hypothetical pipelines, where the flow of gas is modeled by a generalized version of the quadratic Weymouth's equation. The purpose of considering generalized flow formulas is to be able to adapt our results to various gas network optimization problems involving gas flow formulas beyond Weymouth's equation. Such formulas can appear in leaves of branch and bound trees, or they can stem from discretization and linearization carried out at active devices. We call a balanced supply-demand vector a nomination, and the passive nomination validation problem is to decide whether there exist pressures at the nodes generating a given nomination. We prove that in our setup the pressure square vectors generating a given nomination form a one-dimensional connected and continuous curve in the pressure square space, and this curve is a line for the classical Weymouth's equation. We also present a visual approach for the easy comprehension of how this solution curve arises; we give a short investigation of the set of feasible nominations; and finally we give a proof that the nomination validation problem in gas networks with active devices is NP-complete.
    Language: English
    Type: reportzib , doc-type:preprint
    Format: application/pdf
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 191
    Publication Date: 2020-08-05
    Description: In the last 20 years competitive analysis has become the main tool for analyzing the quality of online algorithms. Despite of this, competitive analysis has also been criticized: It sometimes cannot discriminate between algorithms that exhibit significantly different empirical behavior, or it even favors an algorithm that is worse from an empirical point of view. Therefore, there have been several approaches to circumvent these drawbacks. In this survey, we discuss probabilistic alternatives for competitive analysis.
    Language: English
    Type: reportzib , doc-type:preprint
    Format: application/pdf
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 192
    Publication Date: 2016-06-09
    Description: The paper considers an improved variant of the contact-stabilized Newmark method by Deuflhard et al., which provides a spatiotemporal numerical integration of dynamical contact problems between viscoelastic bodies in the frame of the Signorini condition. Up no now, the question of consistency in the case of contact constraints has been discussed for time integrators in function space under the assumption of bounded total variation of the solution. Here, interest focusses on the consistency error of the Newmark scheme in physical energy norm after discretization both in time and in space. The resulting estimate for the local discretization error allows to prove global convergence of the Newmark scheme under an additional assumption on the active contact boundaries.
    Language: English
    Type: reportzib , doc-type:preprint
    Format: application/pdf
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 193
    Publication Date: 2022-01-07
    Description: Pulse thermography is a non-destructive testing method based on infrared imaging of transient thermal patterns. Heating the surface of the structure under test for a short period of time generates a non-stationary temperature distribution and thus a thermal contrast between the defect and the sound material. Due to measurement noise, preprocessing of the experimental data is necessary, before reconstruction algorithms can be applied. We propose a decomposition of the measured temperature into Green's function solutions to eliminate noise.
    Language: English
    Type: reportzib , doc-type:preprint
    Format: application/pdf
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 194
    facet.materialart.
    Unknown
    Publication Date: 2022-03-14
    Description: This article introduces RENS, the relaxation enforced neighborhood search, a large neighborhood search algorithm for mixed integer nonlinear programming (MINLP) that uses a sub-MINLP to explore the set of feasible roundings of an optimal solution x' of a linear or nonlinear relaxation. The sub-MINLP is constructed by fixing integer variables x_j with x'_j in Z and bounding the remaining integer variables to x_j in {floor(x'_j), ceil(x'_j)}. We describe two different applications of RENS: as a standalone algorithm to compute an optimal rounding of the given starting solution and as a primal heuristic inside a complete MINLP solver. We use the former to compare different kinds of relaxations and the impact of cutting planes on the roundability of the corresponding optimal solutions. We further utilize RENS to analyze the performance of three rounding heuristics implemented in the branch-cut-and-price framework SCIP. Finally, we study the impact of RENS when it is applied as a primal heuristic inside SCIP. All experiments were performed on three publically available test sets of mixed integer linear programs (MIPs), mixed integer quadratically constrained programs (MIQCPs), and MINLPs, using solely software which is available in source code. It turns out that for these problem classes 60% to 70% of the instances have roundable relaxation optima and that the success rate of RENS does not depend on the percentage of fractional variables. Last but not least, RENS applied as primal heuristic complements nicely with existing root node heuristics in SCIP and improves the overall performance.
    Language: English
    Type: reportzib , doc-type:preprint
    Format: application/pdf
    Format: application/pdf
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 195
    Publication Date: 2021-02-01
    Description: We describe an iterative refinement procedure for computing extended precision or exact solutions to linear programming problems (LPs). Arbitrarily precise solutions can be computed by solving a sequence of closely related LPs with limited precision arithmetic. The LPs solved share the same constraint matrix as the original problem instance and are transformed only by modification of the objective function, right-hand side, and variable bounds. Exact computation is used to compute and store the exact representation of the transformed problems, while numeric computation is used for solving LPs. At all steps of the algorithm the LP bases encountered in the transformed problems correspond directly to LP bases in the original problem description. We demonstrate that this algorithm is effective in practice for computing extended precision solutions and that this leads to direct improvement of the best known methods for solving LPs exactly over the rational numbers.
    Language: English
    Type: reportzib , doc-type:preprint
    Format: application/pdf
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 196
    Publication Date: 2016-06-30
    Description: Attributes are an important concept for modeling data in practical applications. Up to now there is no adequate way to define attributes for different kinds of models used in M-adhesive transformation systems, which are a special kind of graph transformation systems based on M-adhesive categories. Especially a proper representation and definition of attributes and their values as well as a suitable handling of the data does not fit well with other graph transformation formalisms. In this paper, we propose a new method to define attributes in a natural, but still formally precise and widely applicable way. We define a new kind of adhesive category, called W-adhesive, that can be used for transformations of attributes, while the underlying models are still M-adhesive ones. As a result, attributed models can be used as they are intended to be, but with a formal background and proven well-behavior.
    Language: English
    Type: reportzib , doc-type:preprint
    Format: application/pdf
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 197
    Publication Date: 2017-11-15
    Description: Scheduling algorithms for heterogeneous platforms make scheduling decisions based on several metrics. One of these metrics is the amount of data to be transferred from and to the accelerator. However, the automated determination of this metric is not a simple task. A few schedulers and runtime systems solve this problem by using regression models, which are imprecise though. Our novel approach for the determination of data volumes removes this limitation and thus provides a solution to obtain exact information.
    Language: English
    Type: reportzib , doc-type:preprint
    Format: application/pdf
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 198
    Publication Date: 2020-03-11
    Description: Normal follicular growth is a prerequisite for successful fertilization of dairy cows. However, submission rates have been decreasing during the last decades because animals are not ovulating at the planned time of mating or insemination. In this study we use a mathematical model to investigate mechanisms that lead to anestrus. This model is derived by coupling two previously published models: a small model for the development of multiple follicles (Smith et al., 2004), and a large estrous cycle model (St\"otzel et al., 2012). We first investigate the influence of synchronization protocols on the time-shift of ovulation. In a second scenario we simulate an extended period of anestrus as it typically occurs after calving.
    Language: English
    Type: reportzib , doc-type:preprint
    Format: application/pdf
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 199
    Publication Date: 2022-03-14
    Description: This paper introduces the SCIP Optimization Suite and discusses the capabilities of its three components: the modeling language Zimpl, the linear programming solver SoPlex, and the constraint integer programming framework SCIP. We explain how these can be used in concert to model and solve challenging mixed integer linear and nonlinear optimization problems. SCIP is currently one of the fastest non-commercial MIP and MINLP solvers. We demonstrate the usage of Zimpl, SCIP, and SoPlex by selected examples, we give an overview of available interfaces, and outline plans for future development.
    Language: English
    Type: reportzib , doc-type:preprint
    Format: application/pdf
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 200
    Publication Date: 2022-03-14
    Description: この論文ではソフトウェア・パッケージSCIP Optimization Suite を紹介し,その3つの構成要素:モデリン グ言語Zimpl, 線形計画(LP: linear programming) ソルバSoPlex, そして,制約整数計画(CIP: constraint integer programming) に対するソフトウェア・フレームワークSCIP, について述べる.本論文では,この3つの 構成要素を利用して,どのようにして挑戦的な混合整数線形計画問題(MIP: mixed integer linear optimization problems) や混合整数非線形計画問題(MINLP: mixed integer nonlinear optimization problems) をモデル化 し解くのかを説明する.SCIP は,現在,最も高速なMIP,MINLP ソルバの1つである.いくつかの例により, Zimpl, SCIP, SoPlex の利用方法を示すとともに,利用可能なインタフェースの概要を示す.最後に,将来の開 発計画の概要について述べる.
    Description: This paper introduces the SCIP Optimization Suite and discusses the capabilities of its three components: the modeling language Zimpl, the linear programming solver SoPlex, and the constraint integer programming framework SCIP. We explain how in concert these can be used to model and solve challenging mixed integer linear and nonlinear optimization problems. SCIP is currently one of the fastest non-commercial MIP and MINLP solvers. We demonstrate the usage of Zimpl, SCIP, and SoPlex by selected examples, we give an overview over available interfaces, and outline plans for future development.
    Language: Japanese
    Type: reportzib , doc-type:preprint
    Format: application/pdf
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...