Publication Server of Zuse Institute Berlin (ZIB)
Not a member yet
6648 research outputs found
Sort by
Supplementary code and data for Royal Society Open Science Manuscript rsos.230495
No full textIn this repository are all files necessary to run the agent-based model of the paper "Insights into drivers of mobility and cultural dynamics of African hunter–gatherers over the past 120 000 years", Royal Society Open Science, 10(11), 2023
Coarse Graining of Agent-Based Models and Spatio-Temporal Modeling of Spreading Processes
No full textVirtualFlow 2.0 - The Next Generation Drug Discovery Platform Enabling Adaptive Screens of 69 Billion Molecules
No full textAn Exceptionally Difficult Binary Quadratic Optimization Problem with Symmetry: a Challenge for The Largest Unsolved QAP Instance Tai256c
No full textTai256c is the largest unsolved quadratic assignment problem (QAP) instance in QAPLIB. It is known that QAP tai256c can be converted into a 256 dimensional binary quadratic optimization problem (BQOP) with a single cardinality constraint which requires the sum of the binary variables to be 92. As the BQOP is much simpler than the original QAP, the conversion increases the possibility to solve the QAP. Solving exactly the BQOP, however, is still very difficult. Indeed, a 1.48% gap remains between the best known upper bound (UB) and lower bound (LB) of the unknown optimal value. This paper shows that the BQOP admits a nontrivial symmetry, a property that makes the BQOP very hard to solve. The symmetry induces equivalent subproblems in branch and bound (BB) methods. To effectively improve the LB, we propose an efficient BB method that incorporates a doubly nonnegative relaxation, the standard orbit branching and a technique to prune equivalent subproblems. With this BB method, a new LB with 1.25% gap is successfully obtained, and computing an LB with 1.0% gap is shown to be still quite difficult
Investigating the Latitudinal Dependence of Lunar Regolith Properties Using LRO/Diviner Data and a Microphysical Thermal Model
No full textRegolith is formed through weathering of the local rock by meteorite bombardment, space weathering (Pieters & Noble, 2016) and thermal erosion (Delbo et al., 2014). In the case of the Moon, the space weathering effects and diurnal temperature variations are reduced towards the poles. The aim of this study is to investigate whether the lunar regolith properties derived from the comparison of regolith temperatures measured by the Diviner radiometer (Paige et al., 2010) on board the Lunar Reconnaissance Orbiter (LRO) with simulated temperatures derived from a microphysical thermal model show a latitudinal dependence. The developed microphysical thermal model expands upon previous models by more directly simulating regolith properties, such as grain radius and volume filling factor
Adaptive Cut Selection in Mixed-Integer Linear Programming
No full textCutting plane selection is a subroutine used in all modern mixed-integer linear programming solvers with the goal of selecting a subset of generated cuts that induce optimal solver performance. These solvers have millions of parameter combinations, and so are excellent candidates for parameter tuning. Cut selection scoring rules are usually weighted sums of different measurements, where the weights are parameters. We present a parametric family of mixed-integer linear programs together with infinitely many family-wide valid cuts. Some of these cuts can induce integer optimal solutions directly after being applied, while others fail to do so even if an infinite amount are applied. We show for a specific cut selection rule, that any finite grid search of the parameter space will always miss all parameter values, which select integer optimal inducing cuts in an infinite amount of our problems. We propose a variation on the design of existing graph convolutional neural networks, adapting them to learn cut selection rule parameters. We present a reinforcement learning framework for selecting cuts, and train our design using said framework over MIPLIB 2017 and a neural network verification data set. Our framework and design show that adaptive cut selection does substantially improve performance over a diverse set of instances, but that finding a single function describing such a rule is difficult. Code for reproducing all experiments is available at https://github.com/Opt-Mucca/Adaptive-Cutsel-MILP
Sawfish Photonic Crystal Cavity for Near-Unity Emitter-to-Fiber Interfacing in Quantum Network Applications
No full textAccelerated Riemannian Optimization: Handling Constraints with a Prox to Bound Geometric Penalties
No full textWe propose a globally-accelerated, first-order method for the optimization of smooth and (strongly or not) geodesically-convex functions in a wide class of Hadamard manifolds. We achieve the same convergence rates as Nesterov’s accelerated gradient descent, up to a multiplicative geometric penalty and log factors. Crucially, we can enforce our method to stay within a compact set we define. Prior fully accelerated works \emph{resort to assuming} that the iterates of their algorithms stay in some pre-specified compact set, except for two previous methods of limited applicability. For our manifolds, this solves the open question in (Kim and Yang, 2022) about obtaining global general acceleration without iterates assumptively staying in the feasible set.In our solution, we design an accelerated Riemannian inexact proximal point algorithm, which is a result that was unknown even with exact access to the proximal operator, and is of independent interest. For smooth functions, we show we can implement the prox step inexactly with first-order methods in Riemannian balls of certain diameter that is enough for global accelerated optimization
Handlungsempfehlung zur integrativen Bewertung der weitergehenden Abwasserbehandlung von kommunalen Kläranlagen
No full textDer DWA-Themenband beschreibt ein Konzept zur weitergehenden Abwasserbehandlung für die Bewertung von Aufbereitungsverfahren, sowohl in einer Pilotphase zur Auswahl von Verfahrensoptionen als auch für die Bewertung großtechnischer Anlagen. Emissionsseitig basiert das Konzept auf bereits regulatorisch definierten Parametern wie anorganischen Stickstoff-Verbindungen oder Phosphat sowie auf neuen noch nicht in der Abwasserverordnung regulierten Parametern. Die immissionsseitige Betrachtung erfolgt auf Basis der rechtlich durch die Europäische Wasserrahmenrichtlinie und andere Anforderungen bindenden Instrumente. Hierfür werden spezifische Vorgehensweisen vorgeschlagen. Anhand zweier ausgewählter Praxisbeispiele wird deutlich, dass es zur Bewertung der Verfahrensoptionen an einem Standort dienlich ist, ausgewählte Reduktionen bzw. Entfernungen von Stoffen, Organismen und Effekten zu bestimmen