Library

Your email was sent successfully. Check your inbox.

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

Proceed reservation?

Export
Filter
  • 2020-2024  (148)
  • 2015-2019  (666)
  • 2000-2004  (87,469)
  • 1995-1999  (26)
  • 1985-1989  (261,242)
  • 1975-1979  (89,369)
  • 1965-1969  (63,469)
  • 1935-1939  (1)
  • 1925-1929  (1)
  • 1810-1819  (157)
  • 2021  (148)
  • 2018  (313)
  • 2016  (355)
  • 2002  (40,356)
  • 2001  (47,117)
  • 1988  (133,502)
  • 1987  (127,767)
  • 1976  (89,368)
  • 1965  (63,460)
  • 1946
  • 1945
  • 1815  (157)
Years
Year
Language
  • 101
    Publication Date: 2024-03-06
    Description: In this article, we introduce the Maximum Diversity Assortment Selection Problem (MDASP), which is a generalization of the two-dimensional Knapsack Problem (2D-KP). Given a set of rectangles and a rectangular container, the goal of 2D-KP is to determine a subset of rectangles that can be placed in the container without overlapping, i.e., a feasible assortment, such that a maximum area is covered. MDASP is to determine a set of feasible assortments, each of them covering a certain minimum threshold of the container, such that the diversity among them is maximized. Thereby, diversity is defined as the minimum or average normalized Hamming distance of all assortment pairs. MDASP was the topic of the 11th AIMMS-MOPTA Competition in 2019. The methods described in this article and the resulting computational results won the contest. In the following, we give a definition of the problem, introduce a mathematical model and solution approaches, determine upper bounds on the diversity, and conclude with computational experiments conducted on test instances derived from the 2D-KP literature.
    Language: English
    Type: article , doc-type:article
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 102
    Publication Date: 2024-03-18
    Language: English
    Type: researchdata , doc-type:ResearchData
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 103
    Publication Date: 2024-03-18
    Description: Python implementation of severals tools (PCCA, AJC, SQRA, P/Q estimation) for the analysis of dynamical systems from the transfer operator perspective.
    Language: English
    Type: software , doc-type:Other
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 104
    Publication Date: 2024-03-18
    Description: The dynamical behavior of social systems can be described by agent-based models. Although single agents follow easily explainable rules, complex time-evolving patterns emerge due to their interaction. The simulation and analysis of such agent-based models, however, is often prohibitively time-consuming if the number of agents is large. In this paper, we show how Koopman operator theory can be used to derive reduced models of agent-based systems using only simulation or real-world data. Our goal is to learn coarse-grained models and to represent the reduced dynamics by ordinary or stochastic differential equations. The new variables are, for instance, aggregated state variables of the agent-based model, modeling the collective behavior of larger groups or the entire population. Using benchmark problems with known coarse-grained models, we demonstrate that the obtained reduced systems are in good agreement with the analytical results, provided that the numbers of agents is sufficiently large.
    Language: English
    Type: article , doc-type:article
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 105
    Publication Date: 2024-03-18
    Description: Modeling, simulation and analysis of interacting agent systems is a broad field of research, with existing approaches reaching from informal descriptions of interaction dynamics to more formal, mathematical models. In this paper, we study agent-based models (ABMs) given as continuous-time stochastic processes and their pathwise approximation by ordinary and stochastic differential equations (ODEs and SDEs, respectively) for medium to large populations. By means of an appropriately adapted transfer operator approach we study the behavior of the ABM process on long time scales. We show that, under certain conditions, the transfer operator approach allows to bridge the gap between the pathwise results for large populations on finite timescales, i.e., the SDE limit model, and approaches built to study dynamical behavior on long time scales like large deviation theory. The latter provides a rigorous analysis of rare events including the associated asymptotic rates on timescales that scale exponentially with the population size. We demonstrate that it is possible to reveal metastable structures and timescales of rare events of the ABM process by finite-length trajectories of the SDE process for large enough populations. This approach has the potential to drastically reduce computational effort for the analysis of ABMs.
    Language: English
    Type: article , doc-type:article
    Format: application/pdf
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 106
    Publication Date: 2024-04-05
    Language: English
    Type: conferenceobject , doc-type:conferenceObject
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 107
    Publication Date: 2024-04-05
    Description: This thesis is concerned with the wide field of feature tracking in time-dependent data. Many solutions already exist for the tracking of various features in scalar fields that are given as discrete time steps. In the field of meteorology, recently published precipitation data of the COSMO-REA2 reanalysis system gave rise to the analysis of precipitation at a convective scale for which a tracking of precipitation cells over time is desired. A previous study indicated that a tracking based on the widely used overlap criterion does not perform well for the reanalysis data. Based on a novel set of requirements, a new approach to the tracking of regions in time-dependent scalar fields is developed in the course of this thesis and applied in a prototypical study to example datasets of the COSMO-REA2 system. Despite the concrete motivation of using the developed method for subsequent studies of precipitation, the tracking approach is designed to be applicable for arbitrary scalar quantities that can conceptually be given on uniform grids of arbitrary dimensions. Based on a detailed description of the utilized methods, this thesis presents a novel tracking solution whose correspondence identification is based on image registration of successive time steps in combination with a hierarchical watershed segmentation by means of which features are extracted. The proposed implementation allows for an efficient generation of tracking results under the premise that the registration-based correspondence information has been precomputed.
    Language: English
    Type: masterthesis , doc-type:masterThesis
    Format: application/pdf
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 108
    Publication Date: 2024-04-26
    Description: The traditional linear regression model that assumes normal residuals is applied extensively in engineering and science. However, the normality assumption of the model residuals is often ineffective. This drawback can be overcome by using a generalized normal regression model that assumes a non-normal response. In this paper, we propose regression models based on generalizations of the normal distribution. The proposed regression models can be used effectively in modeling data with a highly skewed response. Furthermore, we study in some details the structural properties of the proposed generalizations of the normal distribution. The maximum likelihood method is used for estimating the parameters of the proposed method. The performance of the maximum likelihood estimators in estimating the distributional parameters is assessed through a small simulation study. Applications to two real datasets are given to illustrate the flexibility and the usefulness of the proposed distributions and their regression models.
    Language: English
    Type: article , doc-type:article
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 109
    Publication Date: 2024-04-26
    Description: Compressor stations are the heart of every high-pressure gas transport network. Located at intersection areas of the network they are contained in huge complex plants, where they are in combination with valves and regulators responsible for routing and pushing the gas through the network. Due to their complexity and lack of data compressor stations are usually dealt with in the scientific literature in a highly simplified and idealized manner. As part of an ongoing project with one of Germany's largest Transmission System Operators to develop a decision support system for their dispatching center, we investigated how to automatize control of compressor stations. Each station has to be in a particular configuration, leading in combination with the other nearby elements to a discrete set of up to 2000 possible feasible operation modes in the intersection area. Since the desired performance of the station changes over time, the configuration of the station has to adapt. Our goal is to minimize the necessary changes in the overall operation modes and related elements over time, while fulfilling a preset performance envelope or demand scenario. This article describes the chosen model and the implemented mixed integer programming based algorithms to tackle this challenge. By presenting extensive computational results on real world data we demonstrate the performance of our approach.
    Language: English
    Type: article , doc-type:article
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 110
    Publication Date: 2024-04-26
    Description: The ongoing energy transition introduces new challenges for distribution networks and brings about the need to expand existing power grid capacities. In order to contain network expansion and with it economic costs, utilization of various flexibility options to reduce expansion needs is discussed. This paper proposes a multiperiod optimal power flow (MPOPF) approach with a new continuous network expansion formulation to optimize the deployment of flexibility options under the objective of minimizing network expansion costs. In a comparison of the newly proposed continuous network expansion formulation with an existing mixed integer formulation and a continuous interpretation of the latter the here proposed formulation is shown to be useful in order to obtain a solvable problem and contain computational efforts. The presented MPOPF including the flexibility options storage units and curtailment is then assessed on synthetic medium voltage grids and applied to evaluate the benefit of a combined vs. a stepwise optimization of these flexibility options. It is demonstrated that using a local solver the proposed approach is applicable and yields a solution in reasonable time. Furthermore, it is shown that the combined optimization generally leads to a more efficient utilization of the considered flexibility options and therefore lower grid expansion costs than the stepwise consideration.
    Language: English
    Type: conferenceobject , doc-type:conferenceObject
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 111
    Publication Date: 2024-04-26
    Description: With annual consumption of approx. 95 billion cubic me-ters and similar amounts of gas just transshipped through Germany toother EU states, Germany’s gas transport system plays a vital role inEuropean energy supply. The complex, more than 40,000 km long high-pressure transmission network is controlled by several transmission sys-tem operators (TSOs) whose main task is to provide security of supplyin a cost-efficient way. Given the slow speed of gas flows through the gastransmission network pipelines, it has been an essential task for the gasnetwork operators to enhance the forecast tools to build an accurate andeffective gas flow prediction model for the whole network. By incorpo-rating the recent progress in mathematical programming and time seriesmodeling, we aim to model natural gas network and predict gas in- andout-flows at multiple supply and demand nodes for different forecastinghorizons. Our model is able to describe the dynamics in the network bydetecting the key nodes, which may help to build an optimal manage-ment strategy for transmission system operators.
    Language: English
    Type: reportzib , doc-type:preprint
    Format: application/pdf
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 112
    Publication Date: 2024-04-26
    Description: Germany is the largest market for natural gas in the European Union, with an annual consumption of approx. 95 billion cubic meters. Germany's high-pressure gas pipeline network is roughly 40,000 km long, which enables highly fluctuating quantities of gas to be transported safely over long distances. Considering that similar amounts of gas are also transshipped through Germany to other EU states, it is clear that Germany's gas transport system is essential to the European energy supply. Since the average velocity of gas in a pipeline is only 25km/h, an adequate high-precision, high-frequency forecasting of supply and demand is crucial for efficient control and operation of such a transmission network. We propose a deep learning model based on spatio-temporal convolutional neural networks (DLST) to tackle the problem of gas flow forecasting in a complex high-pressure transmission network. Experiments show that our model effectively captures comprehensive spatio-temporal correlations through modeling gas networks and consistently outperforms state-of-the-art benchmarks on real-world data sets by at least 21%. The results demonstrate that the proposed model can deal with complex nonlinear gas network flow forecasting with high accuracy and effectiveness.
    Language: English
    Type: article , doc-type:article
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 113
    Publication Date: 2024-04-26
    Description: Germany is the largest market for natural gas in the European Union, with an annual consumption of approx. 95 billion cubic meters. Germany's high-pressure gas pipeline network is roughly 40,000 km long, which enables highly fluctuating quantities of gas to be transported safely over long distances. Considering that similar amounts of gas are also transshipped through Germany to other EU states, it is clear that Germany's gas transport system is essential to the European energy supply. Since the average velocity of gas in a pipeline is only 25km/h, an adequate high-precision, high-frequency forecasting of supply and demand is crucial for efficient control and operation of such a transmission network. We propose a deep learning model based on spatio-temporal convolutional neural networks (DLST) to tackle the problem of gas flow forecasting in a complex high-pressure transmission network. Experiments show that our model effectively captures comprehensive spatio-temporal correlations through modeling gas networks and consistently outperforms state-of-the-art benchmarks on real-world data sets by at least 21$\%$. The results demonstrate that the proposed model can deal with complex nonlinear gas network flow forecasting with high accuracy and effectiveness.
    Language: English
    Type: reportzib , doc-type:preprint
    Format: application/pdf
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 114
    Publication Date: 2024-04-26
    Description: In designing energy supply systems, designers should heighten the robustness in performance criteria against the uncertainty in energy demands. In this paper, a robust optimal design method using a hierarchical mixed-integer linear programming (MILP) method is proposed to maximize the robustness of energy supply systems under uncertain energy demands based on a mixed-integer linear model. A robust optimal design problem is formulated as a three-level min-max-min MILP one by expressing uncertain energy demands by intervals, evaluating the robustness in a performance criterion based on the minimax regret criterion, and considering relationships among integer design variables, uncertain energy demands, and integer and continuous operation variables. This problem is solved by evaluating upper and lower bounds for the minimum of the maximum regret of the performance criterion repeatedly outside, and evaluating lower and upper bounds for the maximum regret repeatedly inside. Different types of optimization problems are solved by applying a hierarchical MILP method developed for ordinary optimal design problems without and with its modifications. In a case study, the proposed approach is applied to the robust optimal design of a cogeneration system. Through the study, its validity and effectiveness are ascertained, and some features of the obtained robust designs are clarified.
    Language: English
    Type: article , doc-type:article
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 115
    Publication Date: 2024-04-26
    Description: We propose a mathematical optimization model and its solution for joint chance constrained DC Optimal Power Flow. In this application, it is particularly important that there is a high probability of transmission limits being satisfied, even in the case of uncertain or fluctuating feed-in from renewable energy sources. In critical network situations where the network risks overload, renewable energy feed-in has to be curtailed by the transmission system operator (TSO). The TSO can reduce the feed-in in discrete steps at each network node. The proposed optimization model minimizes curtailment while ensuring that there is a high probability of transmission limits being maintained. The latter is modeled via (joint) chance constraints that are computationally challenging. Thus, we propose a solution approach based on the robust safe approximation of these constraints. Hereby, probabilistic constraints are replaced by robust constraints with suitably defined uncertainty sets constructed from historical data. The ability to discretely control the power feed-in then leads to a robust optimization problem with decision-dependent uncertainties, i.e. the uncertainty sets depend on decision variables. We propose an equivalent mixed-integer linear reformulation for box uncertainties with the exact linearization of bilinear terms. Finally, we present numerical results for different test cases from the Nesta archive, as well as for a real network. We consider the discrete curtailment of solar feed-in, for which we use real-world weather and network data. The experimental tests demonstrate the effectiveness of this method and run times are very fast. Moreover, on average the calculated robust solutions only lead to a small increase in curtailment, when compared to nominal solutions.
    Language: English
    Type: article , doc-type:article
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 116
    Publication Date: 2024-04-26
    Description: The mixed-integer linear programming (MILP) method has been applied widely to optimal design of energy supply systems. A hierarchical MILP method has been proposed to solve such optimal design problems efficiently. In addition, a method of reducing model by time aggregation has been proposed to search design candidates accurately and efficiently at the upper level. In this paper, the hierarchical MILP method and model reduction by time aggregation are applied to the multiobjective optimal design. The methods of clustering periods by the order of time series, by the k-medoids method, and based on an operational strategy are applied for the model reduction. As a case study, the multiobjective optimal design of a gas turbine cogeneration system is investigated by adopting the annual total cost and primary energy consumption as the objective functions, and the clustering methods are compared with one another in terms of the computation efficiency. It turns out that the model reduction by any clustering method is effective to enhance the computation efficiency when importance is given to minimizing the first objective function, but that the model reduction only by the k-medoids method is effective very limitedly when importance is given to minimizing the second objective function.
    Language: English
    Type: article , doc-type:article
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 117
    Publication Date: 2024-04-26
    Description: In many business and economics studies, researchers have sought to measure the dynamic dependence of curves with high-dimensional mixed-type predictors. We propose a partially functional autoregressive model (pFAR) where the serial dependence of curves is controlled by coefficient operators that are defined on a two-dimensional surface, and the individual and group effects of mixed-type predictors are estimated with a two-layer regularization. We develop an efficient estimation with the proven asymptotic properties of consistency and sparsity. We show how to choose the sieve and tuning parameters in regularization based on a forward-looking criterion. In addition to the asymptotic properties, numerical validation suggests that the dependence structure is accurately detected. The implementation of the pFAR within a real-world analysis of dependence in German daily natural gas flow curves, with seven lagged curves and 85 scalar predictors, produces superior forecast accuracy and an insightful understanding of the dynamics of natural gas supply and demand for the municipal, industry, and border nodes, respectively.
    Language: English
    Type: article , doc-type:article
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 118
    Publication Date: 2024-04-26
    Language: English
    Type: doctoralthesis , doc-type:doctoralThesis
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 119
    Publication Date: 2024-04-26
    Description: As a result of the legislation for gas markets introduced by the European Union in 2005, separate independent companies have to conduct the transport and trading of natural gas. The current gas market of Germany, which has a market value of more than 54 billion USD, consists of Transmission System Operators (TSO), network users, and traders. Traders can nominate a certain amount of gas anytime and anywhere in the network. Such unrestricted access for the traders, on the other hand, increase the uncertainty in the gas supply management. Some customers’ behaviors may cause abrupt structural changes in gas flow time series. In particular, it is a challenging task for the TSO operators to predict gas nominations 6 to 10 hours ahead. In our study, we aim to investigate the regime changes in the time series of nominations to predict the 6 to 10 hours ahead of gas nominations.
    Language: English
    Type: reportzib , doc-type:preprint
    Format: application/pdf
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 120
    Publication Date: 2024-04-26
    Description: Lattice problems are a class of optimization problems that are notably hard. There are no classical or quantum algorithms known to solve these problems efficiently. Their hardness has made lattices a major cryptographic primitive for post-quantum cryptography. Several different approaches have been used for lattice problems with different computational profiles; some suffer from super-exponential time, and others require exponential space. This motivated us to develop a novel lattice problem solver, CMAP-LAP, based on the clever coordination of different algorithms that run massively in parallel. With our flexible framework, heterogeneous modules run asynchronously in parallel on a large-scale distributed system while exchanging information, which drastically boosts the overall performance. We also implement full checkpoint-and-restart functionality, which is vital to high-dimensional lattice problems. Through numerical experiments with up to 103,680 cores, we evaluated the performance and stability of our system and demonstrated its high capability for future massive-scale experiments.
    Language: English
    Type: conferenceobject , doc-type:conferenceObject
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 121
    Publication Date: 2024-04-26
    Description: Lattice problems are a class of optimization problems that are notably hard. There are no classical or quantum algorithms known to solve these problems efficiently. Their hardness has made lattices a major cryptographic primitive for post-quantum cryptography. Several different approaches have been used for lattice problems with different computational profiles; some suffer from super-exponential time, and others require exponential space. This motivated us to develop a novel lattice problem solver, CMAP-LAP, based on the clever coordination of different algorithms that run massively in parallel. With our flexible framework, heterogeneous modules run asynchronously in parallel on a large-scale distributed system while exchanging information, which drastically boosts the overall performance. We also implement full checkpoint-and-restart functionality, which is vital to high-dimensional lattice problems. Through numerical experiments with up to 103,680 cores, we evaluated the performance and stability of our system and demonstrated its high capability for future massive-scale 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 ...
  • 122
    Publication Date: 2024-04-26
    Description: In the transition towards a pure hydrogen infrastructure, utilizing the existing natural gas infrastructure is a necessity. In this study, the maximal technically feasible injection of hydrogen into the existing German natural gas transmission network is analysed with respect to regulatory limits regarding the gas quality. We propose a transient tracking model based on the general pooling problem including linepack. The analysis is conducted using real-world hourly gas flow data on a network of about 10,000 km length.
    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 ...
  • 123
    Publication Date: 2024-04-26
    Description: For cryptanalysis in lattice-based schemes, the performance evaluation of lattice basis reduction using high-performance computers is becoming increasingly important for the determination of the security level. We propose a distributed and asynchronous parallel reduction algorithm based on randomization and DeepBKZ, which is an improved variant of the block Korkine-Zolotarev (BKZ) reduction algorithm. Randomized copies of a lattice basis are distributed to up to 103,680 cores and independently reduced in parallel, while some basis vectors are shared asynchronously among all processes via MPI. There is a trade-off between randomization and information sharing; if a substantial amount of information is shared, all processes will work on the same problem, thereby diminishing the benefit of parallelization. To monitor this balance between randomness and sharing, we propose a metric to quantify the variety of lattice bases. We empirically find an optimal parameter of sharing for high-dimensional lattices. We demonstrate the efficacy of our proposed parallel algorithm and implementation with respect to both performance and scalability through our 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 ...
  • 124
    Publication Date: 2024-04-26
    Description: The stability of flows in porous media plays a vital role in transiting energy supply from natural gas to hydrogen, especially for estimating the usability of existing underground gas storage infrastructures. Thus, this research aims to analyze the interface stability of the tangential-velocity discontinuity between two compressible gases by using Darcy's model to include the porosity effect. The results shown in this research will be a basis for considering whether underground gas storages in porous material can be used to store hydrogen. We show the relation between the Mach number M, the viscosity \mu, and the porosity \epsilon on the stability of the interface. This interface stability affects gases' withdrawal and injection processes, thus will help us to determine the velocity which with gas can be extracted and injected into the storage effectively. By imposing solid walls along the flow direction, the critical values of these parameters regarding the stability of the interface are smaller than when considering no walls. The consideration of bounded flows approaches the problem more realistically. In particular, this analysis plays a vital role when considering two-dimensional gas flows in storages and pipes.
    Language: English
    Type: article , doc-type:article
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 125
    Publication Date: 2024-04-26
    Description: It is well known that the interface between two regions of an incompressible ideal fluid flow moving in a relative motion is necessarily destabilized, regardless of the velocity difference's strength. This phenomenon is the so-called Kelvin-Helmholtz instability (KHI). However, a large number of works demonstrated a surprising result that the instability is suppressed for shallow water flows; the interface is stabilized if the Froude number, defined by the velocity difference's ratio to the gravity wave's speed, is sufficiently large. In a limited way, these authors have been used the shallow-water equations without the higher-order effect of the dispersive terms. Thus, this investigation aims to examine these higher-order dispersive effects to analyze the interface stability problem of tangential-velocity discontinuity in shallow-water flows. In particular, we use the Green-Naghdi equations to introduce the dispersive terms related to the depth and the depth-averaged horizontal velocities of the fluid. We show that the interface stability depends on the Froude number (i.e., the velocity difference's strength) and the water depth. A critical value of the Froude number to stabilize the interface is smaller than the case of no dispersive terms, and the flow in a deeper region is more stable than in a shallower one. We also consider the distribution of kinetic and potential energy to clarify a feature characteristic of a large class of instabilities in shallow water flow. The instability of flows is caused by the decrease in the kinetic energy during the perturbation of waves. This phenomenon is known as negative energy modes and plays a vital role in applying the model to industrial equipment. A conclusion is that the equipartition of energies occurs if and only if the velocity difference is zero and the water depth is shallow enough to ignore the dispersive terms.
    Language: English
    Type: article , doc-type:article
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 126
    Publication Date: 2024-04-26
    Description: Compressible flows appear in many natural and technological processes, for instance, the flow of natural gases in a pipe system. Thus, a detailed study of the stability of tangential velocity discontinuity in compressible media is relevant and necessary. The first early investigation in two-dimensional (2D) media was given more than 70 years ago. In this article, we continue investigating the stability in three-dimensional (3D) media. The idealized statement of this problem in an infinite spatial space was studied by Syrovatskii in 1954. However, the omission of the absolute sign of cos θ with θ being the angle between vectors of velocity and wave number in a certain inequality produced the inaccurate conclusion that the flow is always unstable for entire values of the Mach number M. First, we revisit this case to arrive at the correct conclusion, namely that the discontinuity surface is stabilized for a large Mach number with a given value of the angle θ. Next, we introduce a real finite spatial system such that it is bounded by solid walls along the flow direction. We show that the discontinuity surface is stable if and only if the dispersion relation equation has only real roots, with a large value of the Mach number; otherwise, the surface is always unstable. In particular, we show that a smaller critical value of the Mach number is required to make the flow in a narrow channel stable.
    Language: English
    Type: article , doc-type:article
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 127
    Publication Date: 2024-04-26
    Language: English
    Type: doctoralthesis , doc-type:doctoralThesis
    Format: application/pdf
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 128
    Publication Date: 2024-05-16
    Description: We study the romanization process of northern Africa from 50 BC till 300 AD. Our goal is to infer the communication strength between different subregions, based on the evolution of the status of cities. Herefore, we use the general inverse infection model, that infers the weights of a known underlying network, given observations of the spreading on this network. As infection process we choose the SI metapopulation model, where I stands for a city with a Roman status. To solve the minimization problem we use the particle swarm optimization algorithm with a specific choice of parameters.
    Language: German
    Type: conferenceobject , doc-type:conferenceObject
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 129
    Publication Date: 2024-06-13
    Language: English
    Type: article , doc-type:article
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 130
    Title: Grundlagen der Eingruppierung TVöD und TV-L : das aktuelle Eingruppierungsrecht im öffentlichen Dienst
    Author: Richter, Achim
    Contributer: Gamisch, Annett , Mohr, Thomas
    Edition: 7., aktualisierte Auflage, Bearbeitungsstand: Juni 2017
    Publisher: Berlin :Walhalla und Praetoria Verlag,
    Year of publication: 2021
    Pages: 112 Seiten
    ISBN: 978-3-8029-1599-4
    Type of Medium: Book
    Language: German
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 131
    Title: Forschungsdatenmanagement und Recht : Datenschutz-, Urheber- und Vertragsrecht
    Author: Baumann, Paul
    Contributer: Krahn, Philipp , Lauber-Rönsberg, Anne
    Publisher: Feldkirch/Düns :Neugebauer,
    Year of publication: 2021
    Pages: 304 Seiten
    ISBN: 978-3-85376-328-5
    Type of Medium: Book
    Language: German
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 132
    Title: Handbuch Prüfung ortsveränderlicher elektrischer Geräte : Prüfabläufe, Grenz- und Richtwerte gem. DIN VDE 0701-0702 für die Prüfung vor Ort
    Contributer: Donath, Karl [Verfasser] , Rottmann, Rainer [Verfasser] , Gavrancic, Milan [Verfasser] , Orgel, Christian [Verfasser]
    Edition: 4. überarbeitete Auflage
    Publisher: Forum Verlag Herkert,
    Year of publication: 2021
    Pages: 311 Seiten
    ISBN: 978-3-96314-615-2
    Type of Medium: Book
    Language: German
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 133
    Book
    Book
    München :C.H. Beck,
    Title: Muster : Theorie der digitalen Gesellschaft
    Author: Nassehi, Armin
    Edition: 1. Auflage
    Publisher: München :C.H. Beck,
    Year of publication: 2021
    Pages: 352 Seiten
    ISBN: 978-3-406-76786-9
    Type of Medium: Book
    Language: German
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 134
    Book
    Book
    Cambridge :Cambridge University Press,
    Title: ¬The¬ science of science /
    Author: Wang, Dashun
    Contributer: Barabási, Albert-László
    Publisher: Cambridge :Cambridge University Press,
    Year of publication: 2021
    Pages: x, 303 Seiten
    ISBN: 978-1-108-71695-6
    Type of Medium: Book
    Language: English
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 135
    Title: Erfurter Kommentar zum Arbeitsrecht
    Contributer: Müller-Glöge, Rudi , Preis, Ulrich , Gallner, Inken
    Edition: 22. Auflage
    Publisher: München :C.H. Beck,
    Year of publication: 2021
    Pages: 3100 Seiten
    ISBN: 978-3-406-77038-8
    Type of Medium: Book
    Language: German
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 136
    Title: Handbuch Prüfung ortsfester elektrischer Anlagen und Betriebsmittel : Prüfabläufe, Grenz- und Richtwerte gem. DIN VDE 0100-600 und 0105-100 für die Prüfung vor Ort
    Author: Donath, Karl [Verfasser]
    Contributer: Rottmann, Rainer [Verfasser] , Orgel, Christian [Verfasser]
    Edition: 4. überarbeitete Auflage
    Publisher: Forum Verlag Herkert,
    Year of publication: 2021
    Pages: 374 Seiten
    Type of Medium: Book
    Language: German
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 137
    Book
    Book
    Beijing ; Boston ; Farnham ; Sebastopol :O'Reilly,
    Title: Programming Rust : fast, safe systems development
    Author: Blandy, Jim
    Contributer: Orendorff, Jason , Tindall, Leonora
    Edition: Second edition
    Publisher: Beijing ; Boston ; Farnham ; Sebastopol :O'Reilly,
    Year of publication: 2021
    Pages: xix, 711 Seiten
    ISBN: 9781492052562
    Type of Medium: Book
    Language: English
    Parallel Title: Erscheint auch als Druck-Ausgabe 978-1-492-05259-3
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 138
    Title: Götzendämmerung : Kunst und Künstliche Intelligenz
    Contributer: Dotzler, Bernhard J. , Karpat, Berkan
    Publisher: Bielefeld :transcript,
    Year of publication: 2021
    Pages: 154 Seiten
    ISBN: 978-3-8376-5976-4
    Type of Medium: Book
    Language: German
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 139
    Title: Docker : das Praxisbuch für Entwickler und DevOps-Teams
    Author: Öggl, Bernd
    Contributer: Kofler, Michael
    Edition: 3. Aufl.
    Year of publication: 2021
    Pages: 496 S. : , Illustrationen, Diagramme
    ISBN: 978-3-8362-8634-3
    Type of Medium: Book
    Language: German
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 140
    Book
    Book
    Landshut :BMU Media Verlag,
    Title: Git Handbuch für Einsteiger : Der leichte Weg zum Git-Experten
    Author: Fuchs, Paul
    Publisher: Landshut :BMU Media Verlag,
    Year of publication: 2021
    Pages: 307 Seiten
    ISBN: 978-3-96645-119-2
    Type of Medium: Book
    Language: German
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 141
    Title: Crashkurs BWA : betriebswirtschaftliche Auswertungen erstellen, lesen und verstehen
    Author: Träger, Elisabeth
    Edition: 1. Auflage
    Year of publication: 2021
    Pages: 180 Seiten
    ISBN: 978-3-648-13768-0
    Type of Medium: Book
    Language: German
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 142
    Title: Crashkurs Internes Kontrollsystem für Buchhaltung und Steuern /
    Author: Alves, Winfried
    Edition: 2. völlig überarbeitete und erweiterte Auflage
    Year of publication: 2021
    Pages: 167 Seiten
    ISBN: 978-3-648-14049-9
    Type of Medium: Book
    Language: German
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 143
    Book
    Book
    Freiburg im Breisgau :Haufe-Lexware,
    Title: Schwierige Geschäftsvorfälle richtig buchen /
    Author: Thomsen, Iris
    Contributer: Zöllner, Nikolaus
    Edition: 15. Auflage
    Publisher: Freiburg im Breisgau :Haufe-Lexware,
    Year of publication: 2021
    Pages: 413 Seiten
    ISBN: 978-3-648-14840-2
    Type of Medium: Book
    Language: German
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 144
    Book
    Book
    Basel :Springer International Publishing,
    Title: Introduction to Quantum Computing /
    Author: LaPierre, Ray
    Publisher: Basel :Springer International Publishing,
    Year of publication: 2021
    Pages: 368 Seiten
    ISBN: 978-3-030-69317-6
    Type of Medium: Book
    Language: English
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 145
    Book
    Book
    Weinheim :Wiley-VCH,
    Title: Git für Dummies /
    Author: Kaufmann, Michael
    Contributer: Binkle, Harald
    Publisher: Weinheim :Wiley-VCH,
    Year of publication: 2021
    Pages: 417 Seiten
    ISBN: 978-3-527-71697-5
    Type of Medium: Book
    Language: German
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 146
    Book
    Book
    Sincxpress Bv,
    Title: Linear Algebra : Theory, Intuition, Code
    Author: Cohen, Mike X
    Publisher: Sincxpress Bv,
    Year of publication: 2021
    Pages: 548 S.
    ISBN: 978-90-831366-0-8
    Type of Medium: Book
    Language: German
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 147
    Book
    Book
    Bonn :Rheinwerk Verlag,
    Title: HTML und CSS : das umfassende Handbuch
    Author: Wolf, Jürgen
    Edition: 4., aktualisierte und überarbeitete Auflage
    Publisher: Bonn :Rheinwerk Verlag,
    Year of publication: 2021
    Pages: 1158 Seiten
    ISBN: 978-3-8362-8117-1
    Type of Medium: Book
    Language: German
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 148
    Book
    Book
    München :Verlag Franz Vahlen GmbH,
    Title: Liberating structures : Entscheidungsfindung revolutionieren
    Author: Steinhöfer, Daniel
    Publisher: München :Verlag Franz Vahlen GmbH,
    Year of publication: 2021
    Pages: 120 Seiten
    ISBN: 978-3-8006-5929-6
    Type of Medium: Book
    Language: German
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 149
    Publication Date: 2020-08-05
    Description: Solving mixed-integer nonlinear programs (MINLPs) to global optimality efficiently requires fast solvers for continuous sub-problems. These appear in, e.g., primal heuristics, convex relaxations, and bound tightening methods. Two of the best performing algorithms for these sub-problems are Sequential Quadratic Programming (SQP) and Interior Point Methods. In this paper we study the impact of different SQP and Interior Point implementations on important MINLP solver components that solve a sequence of similar NLPs. We use the constraint integer programming framework SCIP for our computational studies.
    Language: English
    Type: conferenceobject , doc-type:conferenceObject
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 150
    Publication Date: 2022-01-07
    Description: Parallel in time methods for solving initial value problems are a means to increase the parallelism of numerical simulations. Hybrid parareal schemes interleaving the parallel in time iteration with an iterative solution of the individual time steps are among the most efficient methods for general nonlinear problems. Despite the hiding of communication time behind computation, communication has in certain situations a significant impact on the total runtime. Here we present strict, yet no sharp, error bounds for hybrid parareal methods with inexact communication due to lossy data compression, and derive theoretical estimates of the impact of compression on parallel efficiency of the algorithms. These and some computational experiments suggest that compression is a viable method to make hybrid parareal schemes robust with respect to low bandwidth setups.
    Language: English
    Type: article , doc-type:article
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 151
  • 152
  • 153
    Publication Date: 2020-08-05
    Description: We investigate new convex relaxations for the pooling problem, a classic nonconvex production planning problem in which input materials are mixed in intermediate pools, with the outputs of these pools further mixed to make output products meeting given attribute percentage requirements. Our relaxations are derived by considering a set which arises from the formulation by considering a single product, a single attibute, and a single pool. The convex hull of the resulting nonconvex set is not polyhedral. We derive valid linear and convex nonlinear inequalities for the convex hull, and demonstrate that different subsets of these inequalities define the convex hull of the nonconvex set in three cases determined by the parameters of the set. Computational results on literature instances and newly created larger test instances demonstrate that the inequalities can significantly strengthen the convex relaxation of the pq-formulation of the pooling problem, which is the relaxation known to have the strongest bound.
    Language: English
    Type: reportzib , doc-type:preprint
    Format: application/pdf
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 154
    Publication Date: 2018-10-01
    Description: Computers, servers and supercomputers with more than one GPU become more and more common. To fully utilize such systems the application needs to be aware of the additional GPUs. E.g., computational workload needs to be distributed across the GPUs. Along with that goes data movement as well as communication. Recently, NVIDIA introduced new features, Unified Memory and Cooperative Groups, that enable programmers to extend their applications with multi-GPU capabilities. In this thesis the aforementioned features are presented in detail and evaluated in the context of the GPU molecular dynamics simulation HAL's MD package on the latest NVIDIA GPU architecture Pascal. A hotspot analysis with the NVIDIA Visual Profiler identified the radix sort as a major hotspot within HAL's MD package. This thesis presents an approach towards a multi-GPU implementation of radix sort. The individual kernels are analysed and an implementation is discussed. Then, the radix sort is transformed into a multi-GPU implementation kernel per kernel. For each step the individual runtime measurements and bottlenecks are presented to analyse the approach. A general sequence diagram of the implementation shows how the individual parts interact with each other. The outlook discusses the further development of HAL's MD package, especially the force computation for multi-GPU which has not been covered in this thesis.
    Description: Computer, Server und Supercomputer mit mehr als einer GPU sind immer häufiger zu finden. Um solche Systeme komplett ausnutzen zu können, müssen Anwendung für die Verwendung mehrerer GPUs angepasst werden. Z.B. müssen die Berechnungen zwischen den GPUs verteilt werden. Damit einher gehen die Kommunikation zwischen den GPUs sowie der Austausch der Daten. Mit Unified Memory und Cooperative Groups hat NVIDIA zwei neue Funktionen vorgestellt, damit Programmierer ihre Anwendungen einfach an Multi-GPU Systeme anpassen können. Im Rahmen dieser Arbeit werden die oben genannten Funktionen im Detail vorgestellt und anhand der Molekulardynamiksimulation HAL's MD package auf der neuesten NVIDIA GPU Architektur Pascal evaluiert. Eine Hotspot Analyse von HAL's MD package mit dem NVIDIA Visual Profiler hat den Radix Sort als einen großen Hotspot identifiziert. Daher stellt diese Arbeit eine Multi-GPU Implementierung für Radix Sort vor. Dabei werden die einzelnen Kernel Schritt für Schritt vorgestellt und ihre Implementierung, insbesondere Laufzeiten und Probleme bei der Umsetzung, im Detail diskutiert. Ein Sequenzdiagramm der einzelnen Teile von Radix Sort zeigt dabei, wie die einzelnen Teile in der Multi-GPU Implementierung zusammenarbeiten. Abschließend wird, ausgehend von den Ergebnissen, die zukünftige Entwicklung von HAL's MD package unter besonderen Berücksichtigung einer vollständigen Multi-GPU Molekulardynamiksimulation betrachtet.
    Language: English
    Type: masterthesis , doc-type:masterThesis
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 155
    Publication Date: 2019-01-29
    Language: German
    Type: article , doc-type:article
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 156
    Publication Date: 2019-01-30
    Description: Small-molecule oxoanions are often imprinted noncovalently as carboxylates into molecularly imprinted polymers (MIPs), requiring the use of an organic counterion. Popular species are either pentamethylpiperidine (PMP) as a protonatable cation or tetraalkylammonium (TXA) ions as permanent cations. The present work explores the influence of the TXA as a function of their alkyl chain length, from methyl to octyl, using UV/vis absorption, fluorescence titrations, and HPLC as well as MD simulations. Protected phenylalanines (Z-L/D-Phe) served as templates/analytes. While the influence of the counterion on the complex stability constants and anion-induced spectral changes shows a monotonous trend with increasing alkyl chain length at the prepolymerization stage, the cross-imprinting/rebinding studies showed a unique pattern that suggested the presence of adaptive cavities in the MIP matrix, related to the concept of induced fit of enzyme–substrate interaction. Larger cavities formed in the presence of larger counterions can take up pairs of Z-x-Phe and smaller TXA, eventually escaping spectroscopic detection. Correlation of the experimental data with the MD simulations revealed that counterion mobility, the relative distances between the three partners, and the hydrogen bond lifetimes are more decisive for the response features observed than actual distances between interacting atoms in a complex or the orientation of binding moieties. TBA has been found to yield the highest imprinting factor, also showing a unique dual behavior regarding the interaction with template and fluorescent monomer. Finally, interesting differences between both enantiomers have been observed in both theory and experiment, suggesting true control of enantioselectivity. The contribution concludes with suggestions for translating the findings into actual MIP development.
    Language: English
    Type: article , doc-type:article
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 157
    Publication Date: 2019-01-24
    Language: English
    Type: article , doc-type:article
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 158
  • 159
    Publication Date: 2020-03-19
    Description: Computing the Hierarchical Equations of Motion (HEOM) is by itself a challenging problem, and so is writing portable production code that runs efficiently on a variety of architectures while scaling from PCs to supercomputers. We combined both challenges to push the boundaries of simulating quantum systems, and to evaluate and improve methodologies for scientific software engineering. Our contributions are threefold: We present the first distributed memory implementation of the HEOM method (DM-HEOM), we describe an interdisciplinary development workflow, and we provide guidelines and experiences for designing distributed, performance-portable HPC applications with MPI-3, OpenCL and other state-of-the-art programming models. We evaluated the resulting code on multi- and many-core CPUs as well as GPUs, and demonstrate scalability on a Cray XC40 supercomputer for the PS I molecular light harvesting complex.
    Language: English
    Type: conferenceobject , doc-type:conferenceObject
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 160
    Publication Date: 2021-01-22
    Description: We study the problem of finding subpaths with high demand in a given network that is traversed by several users. The demand of a subpath is the number of users who completely cover this subpath during their trip. Especially with large instances, an efficient algorithm for computing all subpaths' demands is necessary. We introduce a path-graph to prevent multiple generations of the same subpath and give a recursive approach to compute the demands of all subpaths. Our runtime analysis shows, that the presented approach compares very well against the theoretical minimum runtime.
    Language: English
    Type: reportzib , doc-type:preprint
    Format: application/pdf
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 161
    Publication Date: 2021-01-22
    Description: The problem of allocating operating rooms (OR) to surgical cases is a challenging task, involving both combinatorial aspects and uncertainty handling. We formulate this problem as a parallel machines scheduling problem, in which job durations follow a lognormal distribution, and a fixed assignment of jobs to machines must be computed. We propose a cutting-plane approach to solve the robust counterpart of this optimization problem. To this end, we develop an algorithm based on fixed-point iterations that identifies worst-case scenarios and generates cut inequalities. The main result of this article uses Hilbert's projective geometry to prove the convergence of this procedure under mild conditions. We also propose two exact solution methods for a similar problem, but with a polyhedral uncertainty set, for which only approximation approaches were known. Our model can be extended to balance the load over several planning periods in a rolling horizon. We present extensive numerical experiments for instances based on real data from a major hospital in Berlin. In particular, we find that: (i) our approach performs well compared to a previous model that ignored the distribution of case durations; (ii) compared to an alternative stochastic programming approach, robust optimization yields solutions that are more robust against uncertainty, at a small price in terms of average cost; (iii) the \emph{longest expected processing time first} (LEPT) heuristic performs well and efficiently protects against extreme scenarios, but only if a good prediction model for the durations is available. Finally, we draw a number of managerial implications from these observations.
    Language: English
    Type: article , doc-type:article
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 162
    Publication Date: 2020-08-05
    Description: We consider the Cumulative Scheduling Problem (CuSP) in which a set of $n$ jobs must be scheduled according to release dates, due dates and cumulative resource constraints. In constraint programming, the CuSP is modeled as the cumulative constraint. Among the most common propagation algorithms for the CuSP there is energetic reasoning (Baptiste et al., 1999) with a complexity of O(n^3) and edge-finding (Vilim, 2009) with O(kn log n) where k 〈= n is the number of different resource demands. We consider the complete versions of the propagators that perform all deductions in one call of the algorithm. In this paper, we introduce the energetic edge-finding rule that is a generalization of both energetic reasoning and edge-finding. Our main result is a complete energetic edge-finding algorithm with a complexity of O(n^2 log n) which improves upon the complexity of energetic reasoning. Moreover, we show that a relaxation of energetic edge-finding with a complexity of O(n^2) subsumes edge-finding while performing stronger propagations from energetic reasoning. A further result shows that energetic edge-finding reaches its fixpoint in strongly polynomial time. Our main insight is that energetic schedules can be interpreted as a single machine scheduling problem from which we deduce a monotonicity property that is exploited in the algorithms. Hence, our algorithms improve upon the strength and the complexity of energetic reasoning and edge-finding whose complexity status seemed widely untouchable for the last decades.
    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: 2020-08-05
    Description: Wir beschreiben die Optimierung des Nahverkehrsnetzes der Stadt Karlsruhe im Zusammmenhang mit den Baumaßnahmen der sogenannten Kombilösung.
    Language: German
    Type: reportzib , doc-type:preprint
    Format: application/pdf
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 164
    Publication Date: 2019-01-24
    Language: English
    Type: article , doc-type:article
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 165
    Publication Date: 2022-03-11
    Description: We investigate the relation between Hall’s theorem and Kőnig’s theorem in graphs and hypergraphs. In particular, we characterize the graphs satisfying a deficiency version of Hall’s theorem, thereby showing that this class strictly contains all Kőnig–Egerváry graphs. Furthermore, we give a generalization of Hall’s theorem to normal hypergraphs.
    Language: English
    Type: article , doc-type:article
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 166
    Publication Date: 2019-04-10
    Language: English
    Type: article , doc-type:article
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 167
    Publication Date: 2020-08-05
    Description: Dieses Dokument fasst den Stand der mathematischen Modellierung von Preissystemen des öV mittels eines am ZIB entwickelten Tarifgraphenmodells zusammen. Damit sind sehr einfache und konzise Beschreibungen von Tarifstrukturen möglich, die sich algorithmisch behandeln lassen: Durch das zeitgleiche Tracken eines Pfades im Routinggraphen im Tarifgraphen kann schon während einer Routenberechnung der Preis bestimmt werden. Wir beschreiben zunächst das Konzept. Die konkrete Realisierung wird im Folgenden beispielhaft an den Tarifsystemen der Verkehrsverbünde Warnow, MDV, Vogtland, Bremen/Niedersachsen, Berlin/Brandenburg und Mittelsachsen erläutert. Anschließend folgen Überlegungen zur konkreten Implementierung von Kurzstrecken-Tarifen und zur Behandlung des Verbundübergriffs.
    Language: German
    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: 2021-03-16
    Description: Gene Regulatory Networks are powerful models for describing the mechanisms and dynamics inside a cell. These networks are generally large in dimension and seldom yield analytical formulations. It was shown that studying the conditional expectations between dimensions (vertices or species) of a network could lead to drastic dimension reduction. These conditional expectations were classically given by solving equations of motions derived from the Chemical Master Equation. In this paper we deviate from this convention and take an Algebraic approach instead. That is, we explore the consequences of conditional expectations being described by a polynomial function. There are two main results in this work. Firstly: if the conditional expectation can be described by a polynomial function, then coefficients of this polynomial function can be reconstructed using the classical moments. And secondly: there are dimensions in Gene Regulatory Networks which inherently have conditional expectations with algebraic forms. We demonstrate through examples, that the theory derived in this work can be used to develop new and effective numerical schemes for forward simulation and parameter inference. The algebraic line of investigation of conditional expectations has considerable scope to be applied to many different aspects of Gene Regulatory Networks; this paper serves as a preliminary commentary in this direction.
    Language: English
    Type: article , doc-type:article
    Format: application/pdf
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 169
    Publication Date: 2018-11-15
    Description: The paper investigates the efficient use of a linearly implicit stiff integrator for the numerical solution of density driven flow problems. Upon choosing a one-step method of extrapolation type (code LIMEX), the use of full Jacobians and reduced approximations are discussed. Numerical experiments include nonlinear density flow problems such as diffusion from a salt dome (2D), a (modified) Elder problem (3D), the saltpool benchmark (3D) and a real life salt dome problem (2D). The arising linear equations are solved using either a multigrid preconditioner from the software package UG4 or the sparse matrix solver SuperLU.
    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: 2022-03-11
    Description: The perfect matching polytope, i.e. the convex hull of (incidence vectors of) perfect matchings of a graph is used in many combinatorial algorithms. Kotzig, Lovász and Plummer developed a decomposition theory for graphs with perfect matchings and their corresponding polytopes known as the tight cut decomposition which breaks down every graph into a number of indecomposable graphs, so called bricks. For many properties that are of interest on graphs with perfect matchings, including the description of the perfect matching polytope, it suffices to consider these bricks. A key result by Lovász on the tight cut decomposition is that the list of bricks obtained is the same independent of the choice of tight cuts made during the tight cut decomposition procedure. This implies that finding a tight cut decomposition is polynomial time equivalent to finding a single tight cut. We generalise the notions of a tight cut, a tight cut contraction and a tight cut decomposition to hypergraphs. By providing an example, we show that the outcome of the tight cut decomposition on general hypergraphs is no longer unique. However, we are able to prove that the uniqueness of the tight cut decomposition is preserved on a slight generalisation of uniform hypergraphs. Moreover, we show how the tight cut decomposition leads to a decomposition of the perfect matching polytope of uniformable hypergraphs and that the recognition problem for tight cuts in uniformable hypergraphs is polynomial time solvable.
    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: 2021-10-22
    Description: In commodity transport networks such as natural gas, hydrogen and water networks, flows arise from nonlinear potential differences between the nodes, which can be represented by so-called "potential-driven" network models. When operators of these networks face increasing demand or the need to handle more diverse transport situations, they regularly seek to expand the capacity of their network by building new pipelines parallel to existing ones ("looping"). The paper introduces a new mixed-integer non-linear programming (MINLP) model and a new non-linear programming (NLP) model and compares these with existing models for the looping problem and related problems in the literature, both theoretically and experimentally. On this basis, we give recommendations about the circumstances under which a certain model should be used. In particular, it turns out that one of our novel models outperforms the existing models. Moreover, the paper is the first to include the practically relevant option that a particular pipeline may be looped several times.
    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 ...
  • 172
    Publication Date: 2022-03-14
    Description: The Ubiquity Generator (UG) is a general framework for the external parallelization of mixed integer programming (MIP) solvers. In this paper, we present ParaXpress, a distributed memory parallelization of the powerful commercial MIP solver FICO Xpress. Besides sheer performance, an important feature of Xpress is that it provides an internal parallelization for shared memory systems. When aiming for a best possible performance of ParaXpress on a supercomputer, the question arises how to balance the internal Xpress parallelization and the external parallelization by UG against each other. We provide computational experiments to address this question and we show computational results for running ParaXpress on a Top500 supercomputer, using up to 43,344 cores in parallel.
    Language: English
    Type: article , doc-type:article
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 173
    Publication Date: 2020-03-11
    Description: Mathematical models for bioregulatory networks can be based on different formalisms, depending on the quality of available data and the research question to be answered. Discrete boolean models can be constructed based on qualitative data, which are frequently available. On the other hand, continuous models in terms of ordinary differential equations (ODEs) can incorporate time-series data and give more detailed insight into the dynamics of the underlying system. A few years ago, a method based on multivariate polynomial interpolation and Hill functions has been developed for an automatic conversion of boolean models to systems of ordinary differential equations. This method is frequently used by modellers in systems biology today, but there are only a few results available about the conservation of mathematical structures and properties across the formalisms. Here, we consider subsets of the phase space where some components stay fixed, called trap spaces, and demonstrate how boolean trap spaces can be linked to invariant sets in the continuous state space. This knowledge is of practical relevance since finding trap spaces in the boolean setting, which is relatively easy, allows for the construction of reduced ODE models.
    Language: English
    Type: reportzib , doc-type:preprint
    Format: application/pdf
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 174
    Publication Date: 2020-08-05
    Description: Let $G$ be a directed acyclic graph with $n$ arcs, a source $s$ and a sink $t$. We introduce the cone $K$ of flow matrices, which is a polyhedral cone generated by the matrices $1_P 1_P^T \in R^{n\times n}$, where $1_P\in R^n$ is the incidence vector of the $(s,t)$-path $P$. Several combinatorial problems reduce to a linear optimization problem over $K$. This cone is intractable, but we provide two convergent approximation hierarchies, one of them based on a completely positive representation of $K$. We illustrate this approach by computing bounds for a maximum flow problem with pairwise arc-capacities.
    Language: English
    Type: conferenceobject , doc-type:conferenceObject
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 175
    Publication Date: 2020-08-05
    Description: Quadratic optimization problems (QPs) are ubiquitous, and solution algorithms have matured to a reliable technology. However, the precision of solutions is usually limited due to the underlying floating-point operations. This may cause inconveniences when solutions are used for rigorous reasoning. We contribute on three levels to overcome this issue. First, we present a novel refinement algorithm to solve QPs to arbitrary precision. It iteratively solves refined QPs, assuming a floating-point QP solver oracle. We prove linear convergence of residuals and primal errors. Second, we provide an efficient implementation, based on SoPlex and qpOASES that is publicly available in source code. Third, we give precise reference solutions for the Maros and Mészáros benchmark library.
    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: Mixed integer programming is a versatile and valuable optimization tool. However, solving specific problem instances can be computationally demanding even for cutting-edge solvers. Such long running times are often significantly reduced by an appropriate change of the solver's parameters. In this paper we investigate "algorithm selection", the task of choosing among a set of algorithms the ones that are likely to perform best for a particular instance. In our case, we treat different parameter settings of the MIP solver SCIP as different algorithms to choose from. Two peculiarities of the MIP solving process have our special attention. We address the well-known problem of performance variability by using multiple random seeds. Besides solving time, primal dual integrals are recorded as a second performance measure in order to distinguish solvers that timed out. We collected feature and performance data for a large set of publicly available MIP instances. The algorithm selection problem is addressed by several popular, feature-based methods, which have been partly extended for our purpose. Finally, an analysis of the feature space and performance results of the selected algorithms 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 ...
  • 177
    Publication Date: 2019-05-10
    Description: Estimation of time of death based on a single measurement of body core temperature is a standard procedure in forensic medicine. Mechanistic models using simulation of heat transport promise higher accuracy than established phenomenological models in particular in nonstandard situations, but involve many not exactly known physical parameters. Identifying both time of death and physical parameters from multiple temperature measurements is one possibility to reduce the uncertainty significantly. In this paper, we consider the inverse problem in a Bayesian setting and perform both local and sampling-based uncertainty quantification, where proper orthogonal decomposition is used as model reduction for fast solution of the forward model. Based on the local uncertainty quantification, optimal design of experiments is performed in order to minimize the uncertainty in the time of death estimate for a given number of measurements. For reasons of practicability, temperature acquisition points are selected from a set of candidates in different spatial and temporal locations. Applied to a real corpse model, a significant accuracy improvement is obtained already with a small number of measurements.
    Language: English
    Type: article , doc-type:article
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 178
    Publication Date: 2022-03-14
    Language: English
    Type: incollection , doc-type:Other
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 179
  • 180
    Publication Date: 2020-08-04
    Description: Time- and frequency resolved optical signals provide insights into the properties of light harvesting molecular complexes, including excitation energies, dipole strengths and orientations, as well as in the exciton energy flow through the complex. The hierarchical equations of motion (HEOM) provide a unifying theory, which allows one to study the combined effects of system-environment dissipation and non-Markovian memory without making restrictive assumptions about weak or strong couplings or separability of vibrational and electronic degrees of freedom. With increasing system size the exact solution of the open quantum system dynamics requires memory and compute resources beyond a single compute node. To overcome this barrier, we developed a scalable variant of HEOM. Our distributed memory HEOM, DM-HEOM, is a universal tool for open quantum system dynamics. It is used to accurately compute all experimentally accessible time- and frequency resolved processes in light harvesting molecular complexes with arbitrary system-environment couplings for a wide range of temperatures and complex sizes.
    Language: English
    Type: article , doc-type:article
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 181
  • 182
    Publication Date: 2020-03-20
    Description: Human mobility always had a great influence on the spreading of cultural, social and technological ideas. Developing realistic models that allow for a better understanding, prediction and control of such coupled processes has gained a lot of attention in recent years. However, the modeling of spreading processes that happened in ancient times faces the additional challenge that available knowledge and data is often limited and sparse. In this paper, we present a new agent-based model for the spreading of innovations in the ancient world that is governed by human movements. Our model considers the diffusion of innovations on a spatial network that is changing in time, as the agents are changing their positions. Additionally, we propose a novel stochastic simulation approach to produce spatio-temporal realizations of the spreading process that are instructive for studying its dynamical properties and exploring how different influences affect its speed and spatial evolution.
    Language: English
    Type: article , doc-type:article
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 183
    Publication Date: 2022-03-11
    Description: The reproductive cycle of mono-ovulatory species such as cows or humans is known to show two or more waves of follicular growth and decline between two successive ovulations. Within each wave, there is one dominant follicle escorted by subordinate follicles of varying number. Under the surge of the luteinizing hormone a growing dominant follicle ovulates. Rarely the number of ovulating follicles exceeds one. In the biological literature, the change of hormonal concentrations and individually varying numbers of follicular receptors are made responsible for the selection of exactly one dominant follicle, yet a clear cause has not been identified. In this paper, we suggest a synergistic explanation based on competition, formulated by a parsimoniously defined system of ordinary differential equations (ODEs) that quantifies the time evolution of multiple follicles and their competitive interaction during one wave. Not discriminating between follicles, growth and decline are given by fixed rates. Competition is introduced via a growth-suppressing term, equally supported by all follicles. We prove that the number of dominant follicles is determined exclusively by the ratio of follicular growth and competition. This number turns out to be independent of the number of subordinate follicles. The asymptotic behavior of the corresponding dynamical system is investigated rigorously, where we demonstrate that the ω-limit set only contains fixed points. When also including follicular decline, our ODEs perfectly resemble ultrasound data of bovine follicles. Implications for the involved but not explicitly modeled hormones are discussed.
    Language: English
    Type: article , doc-type:article
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 184
    Publication Date: 2019-01-30
    Language: English
    Type: doctoralthesis , doc-type:doctoralThesis
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 185
    Publication Date: 2022-03-14
    Description: “Interior point algorithms are a good choice for solving pure LPs or QPs, but when you solve MIPs, all you need is a dual simplex” This is the common conception which disregards that an interior point solution provides some unique structural insight into the problem at hand. In this paper, we will discuss some of the benefits that an interior point solver brings to the solution of difficult MIPs within FICO Xpress. This includes many different components of the MIP solver such as branching variable selection, primal heuristics, preprocessing, and of course the solution of the LP relaxation.
    Language: English
    Type: conferenceobject , doc-type:conferenceObject
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 186
    Publication Date: 2021-03-19
    Description: This book promotes the use of mathematical optimization and operations research methods in rail transportation. The editors assembled thirteen contributions from leading scholars to present a unified voice, standardize terminology, and assess the state-of-the-art. There are three main clusters of articles, corresponding to the classical stages of the planning process: strategic, tactical, and operational. These three clusters are further subdivided into five parts which correspond to the main phases of the railway network planning process: network assessment, capacity planning, timetabling, resource planning, and operational planning. Individual chapters cover: Simulation Capacity Assessment Network Design Train Routing Robust Timetabling Event Scheduling Track Allocation Blocking Shunting Rolling Stock Crew Scheduling Dispatching Delay Propagation
    Language: English
    Type: book , doc-type:book
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 187
    Publication Date: 2020-08-05
    Description: Inspired by the problem of best managing the invasive mosquito Aedes albopictus across the 17 Torres Straits islands of Australia, we aim at solving a Markov decision process on large Susceptible-Infected-Susceptible (SIS) networks that are highly connected. While dynamic programming approaches can solve sequential decision-making problems on sparsely connected networks, these approaches are intractable for highly connected networks. Inspired by our case study, we focus on problems where the probability of nodes changing state is low and propose two approximate dynamic programming approaches. The first approach is a modified version of value iteration where only those future states that are similar to the current state are accounted for. The second approach models the state space as continuous instead of binary, with an on-line algorithm that takes advantage of Bellman's adapted equation. We evaluate the resulting policies through simulations and provide a priority order to manage the 17 infested Torres Strait islands. Both algorithms show promise, with the continuous state approach being able to scale up to high dimensionality (50 nodes). This work provides a successful example of how AI algorithms can be designed to tackle challenging computational sustainability problems.
    Language: English
    Type: conferenceobject , doc-type:conferenceObject
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 188
    Publication Date: 2020-08-05
    Description: Das Wind-Interpolation-Problem (WIP) ist ein bisher selten diskutiertes Problem der Flugplanungsoptimierung, bei dem es darum geht, Wind-Komponenten auf einer Luftstraße zu approximieren. Anhand von Winddaten, die vektoriell an den Gitterpunkten eines den Globus umspannenden Gitters vorliegen, soll bestimmt werden, wie viel Wind entlang der Luftstraße und quer zu ihr weht. Thema dieser Arbeit ist ein Spezialfall des WIP, nämlich das statische WIP auf einer Planfläche (SWIPP). Dazu wird zuerst ein Algorithmus besprochen, der das SWIPP zwar löst, aber einem Ansatz zugrunde liegt, der bei genauerem Hinsehen nicht sinnvoll erscheint: hier wird Wind zwischen vier Punkten interpoliert, wozu es keine triviale Methode gibt. Ähnlich zu diesem Algorithmus, der heute als State-of-the-Art gilt, wird als Ergebnis dieser Arbeit ein neuer Algorithmus vorgestellt, der das SWIPP akkurater und schneller löst. Hier wird deutlich seltener auf die Interpolation zwischen vier Punkten zurückgegriffen - stattdessen wird fast immer linear zwischen zwei Punkten interpoliert. Die Algorithmen zum Lösen des SWIPP werden auf ihre Genauigkeit, asymptotische Laufzeit und Geschwindigkeit untersucht und verglichen. Als Testareal dienen zum einen echte Wetterdaten sowie das Luftstraßennetz, das die Erde umspannt, und zum anderen ein eigens generiertes Windfeld und fiktive Luftstraßen. Es wird gezeigt, dass der hier vorgestellte Algorithmus die State-of-the-Art-Variante in allen genannten Aspekten übertrifft.
    Language: German
    Type: bachelorthesis , doc-type:bachelorThesis
    Format: application/pdf
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 189
    Publication Date: 2019-01-29
    Description: In several inital value problems with particularly expensive right hand side evaluation or implicit step computation, there is a trade-off between accuracy and computational effort. We consider inexact spectral deferred correction (SDC) methods for solving such initial value problems. SDC methods are interpreted as fixed point iterations and, due to their corrective iterative nature, allow to exploit the accuracy-work-tradeoff for a reduction of the total computational effort. On one hand we derive error models bounding the total error in terms of the evaluation errors. On the other hand, we define work models describing the computational effort in terms of the evaluation accuracy. Combining both, a theoretically optimal local tolerance selection is worked out by minimizing the total work subject to achieving the requested tolerance. The properties of optimal local tolerances and the predicted efficiency gain compared to simpler heuristics, and a reasonable practical performance, are illustrated on simple numerical examples.
    Language: English
    Type: article , doc-type:article
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 190
    Publication Date: 2021-10-28
    Language: English
    Type: article , doc-type:article
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 191
    Publication Date: 2020-10-09
    Language: English
    Type: article , doc-type:article
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 192
    Publication Date: 2020-08-05
    Description: Transformations of Steiner tree problem variants have been frequently discussed in the literature. Besides allowing to easily transfer complexity results, they constitute a central pillar of exact state-of-the-art solvers for well-known variants such as the Steiner tree problem in graphs. In this paper transformations for both the prize-collecting Steiner tree problem and the maximum-weight connected subgraph problem to the Steiner arborescence problem are introduced for the first time. Furthermore, we demonstrate the considerable implications for practical solving approaches, including the computation of strong upper and lower bounds.
    Language: English
    Type: article , doc-type:article
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 193
    Publication Date: 2019-01-24
    Language: English
    Type: article , doc-type:article
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 194
    Publication Date: 2021-01-22
    Description: Most distributed file systems assign new files to storage servers randomly. While working well in some situations, this does not help to optimize the input performance for most MapReduce computations’ data access patterns. In this work, we consider an access pattern where input files are partitioned into groups of heterogeneous size. Each group is accessed by exactly one process. We design and implement a data placement strategy that places these file groups together on the same storage server. This colocation approach is combined with near-optimal storage load balancing. To do so, we use a classical scheduling approximation algorithm to solve the NP hard group assignment problem. We argue that local processing is not only beneficial because of reduced network traffic, but especially because it imposes an even resource schedule. Our experiments, based on the parallel processing of remote sensing images, reveal an enormous reduction of network traffic and up to 39 % faster input read times. Further, simulations show that our approximate assignments limit storage server imbalances to less than 5 % above the theoretical minimum, in contrast to more than 85 % with random assignment.
    Language: English
    Type: article , doc-type:article
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 195
    Publication Date: 2021-01-08
    Language: English
    Type: article , doc-type:article
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 196
    Publication Date: 2021-01-22
    Description: We study the problem of finding subpaths with high demand in a given network that is traversed by several users. The demand of a subpath is the number of users who completely cover this subpath during their trip. Especially with large instances, an efficient algorithm for computing all subpaths' demands is necessary. We introduce a path-graph to prevent multiple generations of the same subpath and give a recursive approach to compute the demands of all subpaths. Our runtime analysis shows, that the presented approach compares very well against the theoretical minimum runtime.
    Language: English
    Type: conferenceobject , doc-type:conferenceObject
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 197
    Publication Date: 2021-01-22
    Description: We investigate a graph theoretical problem arising in the automatic billing of a network toll. Given a network and a family of user paths, we study the graph segmentation problem (GSP) to cover parts of the user paths by a set of disjoint segments. The GSP is shown to be NP-hard but for special cases it can be solved in polynomial time. We also show that the marginal utility of a segment is bounded. Computational results for real-world instances show that in practice the problem is more amenable than the theoretic bounds suggest.
    Language: English
    Type: conferenceobject , doc-type:conferenceObject
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 198
    Publication Date: 2021-10-28
    Language: English
    Type: conferenceobject , doc-type:conferenceObject
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 199
    Publication Date: 2021-12-23
    Description: Molecular dynamics (MD) simulations can model the interactions between macromolecules with high spatiotemporal resolution but at a high computational cost. By combining high-throughput MD with Markov state models (MSMs), it is now possible to obtain long-timescale behavior of small to intermediate biomolecules and complexes. To model the interactions of many molecules at large lengthscales, particle-based reaction-diffusion (RD) simulations are more suitable but lack molecular detail. Thus, coupling MSMs and RD simulations (MSM/RD) would be highly desirable, as they could efficiently produce simulations at large time- and lengthscales, while still conserving the characteristic features of the interactions observed at atomic detail. While such a coupling seems straightforward, fundamental questions are still open: Which definition of MSM states is suitable? Which protocol to merge and split RD particles in an association/dissociation reaction will conserve the correct bimolecular kinetics and thermodynamics? In this paper, we make the first step towards MSM/RD by laying out a general theory of coupling and proposing a first implementation for association/dissociation of a protein with a small ligand (A + B 〈--〉 C). Applications on a toy model and CO diffusion into the heme cavity of myoglobin are reported.
    Language: English
    Type: article , doc-type:article
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 200
    Publication Date: 2019-01-24
    Language: English
    Type: article , doc-type:article
    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...