TY - CHAP A1 - Gonnermann-Müller, Jana A1 - Brandenburger, Bonny A1 - Vladova, Gergana A1 - Gronau, Norbert T1 - To What Extent Can Individualisation in Terms of Different Types of Mode Improve Learning Outcomes and Learner Satisfaction? A Pre-study T2 - Proceedings of the Hawaii International Conference on System Sciences Y1 - 2023 ER - TY - JOUR A1 - Combettes, Cyrille A1 - Pokutta, Sebastian T1 - Revisiting the Approximate Carathéodory Problem via the Frank-Wolfe Algorithm JF - Mathematical Programming A Y1 - 2023 U6 - https://doi.org/10.1007/s10107-021-01735-x VL - 197 SP - 191 EP - 214 ER - TY - JOUR A1 - Sperber, Wolfram T1 - Mathematische Gesellschaft der DDR – die Vorgeschichte JF - Mathematische Semesterberichte N2 - ZusammenfassungDie Mathematische Gesellschaft der DDR (MGDDR) ist seit 1991 Geschichte. Die MGDDR spaltete sich 1962 auf Betreiben der Sozialistischen Einheitspartei (SED) der DDR von der Deutschen Mathematiker-Vereinigung (DMV) ab und beschloss 1990 den Zusammenschluss mit der DMV. Die Geschichte der MGDDR ist spannend, angefangen von der Vorgeschichte, ihren Aktivitäten in der DDR-Zeit bis zur Neupositionierung nach der Wende. Und die MGDDR hat ihre Spuren in der DMV hinterlassen. Etliche Ansätze und Aktivitäten der MGDDR wurden von der DMV fortgeführt und weiterentwickelt. Aus der Literatur sind bisher nur Darstellungen einzelner Aspekte der MGDDR bekannt. Dieser Artikel unternimmt den Versuch einer Gesamtdarstellung der Geschichte der MGDDR und soll die Ausführungen in [1] und [2] ergänzen und erweitern. Die MGDDR war ein Ergebnis des Kalten Krieges und – wesentlich stärker als bisher der Öffentlichkeit bekannt – ein Produkt der Wissenschaftspolitik von Partei und Staat der DDR. Der politische Einfluss wird in diesem Artikel durch Unterlagen belegt, die in verschiedenen Archiven gefunden wurden. Von besonderer Bedeutung bei der Recherche war das Archivgut der Stiftung Archiv der Parteien und Massenorganisationen der DDR im Bundesarchiv(SAPMO), wo seit 1990 die Unterlagen der SED, staatlicher Stellen und Massenorganisatioen der DDR systematisch aufbereitet und verfügbar gemacht worden sind. Die Mathematiker der DDR standen der Vereinnahmung durch Partei und Staat mehrheitlich kritisch gegenüber. Dies gilt insbesondere für die Zeit vor dem Mauerbau. Nach dem Mauerbau und den Einschränkungen des Reiseverkehrs war für die meisten Mathematiker der DDR die Gründung einer eigenen Fachgesellschaft alternativlos. Diese erfolgte am 8. Juni 1962. Nach dem Mauerbau war für die Mathematiker in der DDR wissenschaftlicher Austausch ohne Einbeziehung der MGDDR nahezu unmöglich. Für die Arbeit der MGDDR standen aber immer mathematische Ziele im Zentrum und die MGDDR war dabei – trotz einiger Behinderungen – durchaus erfolgreich. Nach der Wende positionierte sich die MGDDR neu und beschloss auf dem Mathematiker-Kongress der DDR im September 1990 den Zusammenschluss mit der DMV. Der vorliegende Artikel umfasst die Vorgeschichte der MGDDR bis zu deren Gründung am 08.06.1962. In zwei weiteren Publikationen soll die Arbeit der MGDDR bis zur Wende und dem Zusammenschluss mit der DMV dargestellt werden. Y1 - 2023 U6 - https://doi.org/10.1007/s00591-023-00350-5 SN - 0720-728X VL - 70 IS - 2 SP - 103 EP - 146 PB - Springer Science and Business Media LLC ER - TY - THES A1 - Danecker, Fabian T1 - A Discrete-Continuous Algorithm for Globally Optimal Free Flight Trajectory Optimization N2 - This thesis introduces the novel hybrid algorithm DisCOptER for globally optimal flight planning. DisCOptER (Discrete-Continuous Optimization for Enhanced Resolution) com- bines discrete and continuous optimization in a two-stage approach to find optimal trajectories up to arbitrary precision in finite time. In the discrete phase, a directed auxiliary graph is created in order to define a set of candidate paths that densely covers the relevant part of the trajectory space. Then, Yen’s algorithm is employed to identify a set of promising candidate paths. These are used as starting points for the subsequent stage in which they are refined with a locally convergent optimal control method. The correctness, accuracy, and complexity of DisCOptER are intricately linked to the choice of the switch-over point, defined by the discretization coarseness. Only a sufficiently dense graph enables the algorithm to find a path within the convex domain surrounding the global minimizer. Initialized with such a path, the second stage rapidly converges to the optimum. Conversely, an excessively dense graph poses the risk of overly costly and redundant computations. The determination of the optimal switch-over point necessitates a profound understanding of the local behavior of the problem, the approximation properties of the graph, and the convergence characteristics of the employed optimal control method. These topics are explored extensively in this thesis. Crucially, the density of the auxiliary graph is solely dependent on the en- vironmental conditions, yet independent of the desired solution accuracy. As a consequence, the algorithm inherits the superior asymptotic convergence properties of the optimal control stage. The practical implications of this computational efficiency are demonstrated in realistic environments, where the DisCOptER algorithm consistently delivers highly accurate globally optimal trajectories with exceptional computational efficiency. This notable improvement upon existing approaches underscores the algorithm’s significance. Beyond its technical prowess, the DisCOptER algorithm stands as a valuable tool contributing to the reduction of costs and the overall enhancement of flight operations efficiency. Y1 - 2023 UR - http://dx.doi.org/10.17169/refubium-43526 ER - TY - CHAP A1 - Andrés Arcones, Daniel A1 - Weiser, Martin A1 - Koutsourelakis, Faidon-Stelios A1 - Unger, Jörg F. T1 - Evaluation of Model Bias Identification Approaches Based on Bayesian Inference and Applications to Digital Twins T2 - 5th ECCOMAS Thematic Conference on Uncertainty Quantification in Computational Sciences and Engineering N2 - In recent years, the use of simulation-based digital twins for monitoring and assessment of complex mechanical systems has greatly expanded. Their potential to increase the information obtained from limited data makes them an invaluable tool for a broad range of real-world applications. Nonetheless, there usually exists a discrepancy between the predicted response and the measurements of the system once built. One of the main contributors to this difference in addition to miscalibrated model parameters is the model error. Quantifying this socalled model bias (as well as proper values for the model parameters) is critical for the reliable performance of digital twins. Model bias identification is ultimately an inverse problem where information from measurements is used to update the original model. Bayesian formulations can tackle this task. Including the model bias as a parameter to be inferred enables the use of a Bayesian framework to obtain a probability distribution that represents the uncertainty between the measurements and the model. Simultaneously, this procedure can be combined with a classic parameter updating scheme to account for the trainable parameters in the original model. This study evaluates the effectiveness of different model bias identification approaches based on Bayesian inference methods. This includes more classical approaches such as direct parameter estimation using MCMC in a Bayesian setup, as well as more recent proposals such as stat-FEM or orthogonal Gaussian Processes. Their potential use in digital twins, generalization capabilities, and computational cost is extensively analyzed. Y1 - 2023 UR - https://2023.uncecomp.org/proceedings/pdf/19795.pdf SP - 1 EP - 15 ER - TY - JOUR A1 - Andrés Arcones, Daniel A1 - Weiser, Martin A1 - Koutsourelakis, Faidon-Stelios A1 - Unger, Jörg F. T1 - A Bayesian Framework for Simulation-based Digital Twins of Bridges JF - EUROSTRUCT 2023:European Association on Quality Control of Bridges and Structures: Digital Transformation in Sustainability N2 - Simulation-based digital twins have emerged as a powerful tool for evaluating the mechanical response of bridges. As virtual representations of physical systems, digital twins can provide a wealth of information that complements traditional inspection and monitoring data. By incorporating virtual sensors and predictive maintenance strategies, they have the potential to improve our understanding of the behavior and performance of bridges over time. However, as bridges age and undergo regular loading and extreme events, their structural characteristics change, often differing from the predictions of their initial design. Digital twins must be continuously adapted to reflect these changes. In this article, we present a Bayesian framework for updating simulation-based digital twins in the context of bridges. Our approach integrates information from measurements to account for inaccuracies in the simulation model and quantify uncertainties. Through its implementation and assessment, this work demonstrates the potential for digital twins to provide a reliable and up-to-date representation of bridge behavior, helping to inform decision-making for maintenance and management. Y1 - 2023 U6 - https://doi.org/10.1002/cepa.2177 VL - 6 IS - 5 SP - 734 EP - 740 ER - TY - JOUR A1 - Gupta, Pranshu A1 - Hamann, Fabian A1 - Müyesser, Alp A1 - Sgueglia, Amedeo A1 - Parczyk, Olaf T1 - A general approach to transversal versions of Dirac-type theorems JF - Bulletin of the London Mathematical Society Y1 - 2023 VL - 55 IS - 6 SP - 2817 EP - 2839 ER - TY - JOUR A1 - Kohayakawa, Yoshiharu A1 - Mota, Guilherme O. A1 - Schnitzer, Jakob A1 - Parczyk, Olaf T1 - Anti-Ramsey threshold of complete graphs for sparse graphs JF - Discrete Mathematics Y1 - 2023 ER - TY - THES A1 - Bena, Noor-Cella T1 - Finding Rules and Patterns in Egyptological Research Objects using Boolean Polynomial Rings Y1 - 2023 ER - TY - THES A1 - Kunt, Tim T1 - The n-Queens Problem in Higher Dimensions N2 - How many mutually non-attacking queens can be placed on a d-dimensional chessboard of size n? The n-queens problem in higher dimensions is a generalization of the well-known n-queens problem. We provide a comprehensive overview of theoretical results, bounds, solution methods, and the interconnectivity of the problem within topics of discrete optimization and combinatorics. We present an integer programming formulation of the n-queens problem in higher dimensions and several strengthenings through additional valid inequalities. Compared to recent benchmarks, we achieve a speedup in computational time between 15-70x over all instances of the integer programs. Our computational results prove optimality of certificates for several large instances. Breaking additional, previously unsolved instances with the proposed methods is likely possible. On the primal side, we further discuss heuristic approaches to constructing solutions that turn out to be optimal when compared to the IP. We conclude with preliminary results on the number and density of the solutions. T3 - ZIB-Report - 24-05 KW - Integer Programming KW - Maximum Independent Set KW - n-Queens Y1 - 2023 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:0297-zib-96468 ER - TY - CHAP A1 - Schembera, Björn A1 - Wübbeling, Frank A1 - Kleikamp, Hendrik A1 - Biedinger, Christine A1 - Fiedler, Jochen A1 - Reidelbach, Marco A1 - Shehu, Aurela A1 - Schmidt, Burkhard A1 - Koprucki, Thomas A1 - Iglezakis, Dotothea A1 - Göddeke, Dominik T1 - Ontologies for Models and Algorithms in Applied Mathematics and Related Disciplines T2 - Metadata and Semantic Research - MTSR 2023 N2 - In applied mathematics and related disciplines, the modeling-simulation-optimization workflow is a prominent scheme, with mathematical models and numerical algorithms playing a crucial role. For these types of mathematical research data, the Mathematical Research Data Initiative has developed, merged and implemented ontologies and knowledge graphs. This contributes to making mathematical research data FAIR by introducing semantic technology and documenting the mathematical foundations accordingly. Using the concrete example of microfracture analysis of porous media, it is shown how the knowledge of the underlying mathematical model and the corresponding numerical algorithms for its solution can be represented by the ontologies. Y1 - 2023 U6 - https://doi.org/10.1007/978-3-031-65990-4_14 SP - 161 EP - 168 PB - Springer Nature Switzerland CY - Cham ET - Communications in Computer and Information Science ER - TY - JOUR A1 - Schembera, Björn A1 - Wübbeling, Frank A1 - Koprucki, Thomas A1 - Biedinger, Christine A1 - Reidelbach, Marco A1 - Schmidt, Burkhard A1 - Göddeke, Dominik A1 - Fiedler, Jochen T1 - Building Ontologies and Knowledge Graphs for Mathematics and its Applications JF - Proceedings of the Conference on Research Data Infrastructure N2 - Ontologies and knowledge graphs for mathematical algorithms and models are presented, that have been developed by the Mathematical Research Data Initiative. This enables FAIR data handling in mathematics and the applied disciplines. Moreover, challenges of harmonization during the ontology development are discussed. Y1 - 2023 U6 - https://doi.org/10.52825/cordi.v1i.255 SN - 2941-296X VL - 1 PB - TIB Open Publishing ER - TY - JOUR A1 - Reidelbach, Marco A1 - Ferrer, Eloi A1 - Weber, Marcus T1 - MaRDMO Plugin BT - Document and Retrieve Workflows Using the MaRDI Portal JF - Proceedings of the Conference on Research Data Infrastructure N2 - MaRDMO, a plugin for the Research Data Management Organiser, was developed in the Mathematical Research Data Initiative to document interdisciplinary workflows using a standardised scheme. Interdisciplinary workflows recorded this way are published directly on the MaRDI portal. In addition, central information is integrated into the MaRDI knowledge graph. Next to the documentation, MaRDMO offers the possibility to retrieve existing interdisciplinary workflows from the MaRDI Knowledge Graph to allow the reproduction of the initial work and to provide scientists with new researchimpulses. Thus, MaRDMO creates a community-driven knowledge loop that could help to overcome the replication crisis. Y1 - 2023 U6 - https://doi.org/10.52825/cordi.v1i.254 SN - 2941-296X VL - 1 PB - TIB Open Publishing ER - TY - JOUR A1 - Benner, Peter A1 - Danabalan, Renita A1 - Gödekke, Dominik A1 - Kastner, Lars A1 - Krause, Tabea A1 - Mietchen, Daniel A1 - Reidelbach, Marco A1 - Schembera, Björn A1 - Schubotz, Moritz A1 - Sinn, Rainer A1 - Tabelow, Karsten T1 - Research Data Management Planning in Mathematics N2 - Research data are crucial in mathematics and all scientific disciplines, as they form the foundation for empirical evidence, by enabling the validation and reproducibility of scientific findings. Mathematical research data (MathRD) have become vast and complex, and their interdisciplinary potential and abstract nature make them ubiquitous in various scientific fields. The volume of data and the velocity of its creation are rapidly increasing due to advancements in data science and computing power. This complexity extends to other disciplines, resulting in diverse research data and computational models. Thus, proper handling of research data is crucial both within mathematics and for its manifold connections and exchange with other disciplines. The National Research Data Infrastructure (NFDI), funded by the federal and state governments of Germany, consists of discipline-oriented consortia, including the Mathematical Research Data Initiative (MaRDI). MaRDI has been established to develop services, guidelines and outreach measures for all aspects of MathRD, and thus support the mathematical research community. Research data management (RDM) should be an integral component of every scientific project, and is becoming a mandatory component of grants with funding bodies such as the Deutsche Forschungsgemeinschaft (DFG, German Research Foundation). At the core of RDM are the FAIR (Findable, Accessible, Interoperable, and Reusable) principles. This document aims to guide mathematicians and researchers from related disciplines who create RDM plans. It highlights the benefits and opportunities of RDM in mathematics and interdisciplinary studies, showcases examples of diverse MathRD, and suggests technical solutions that meet the requirements of funding agencies with specific examples. The document is regularly updated to reflect the latest developments within the mathematical community represented by MaRDI. Y1 - 2023 U6 - https://doi.org/10.5281/zenodo.10018245 ER - TY - GEN A1 - Secker, Christopher T1 - Novel multi-objective affinity approach allows to identify pH-specific μ-opioid receptor agonists (Dataset) N2 - Virtual Screening Dataset for the paper "Novel multi-objective affinity approach allows to identify pH-specific μ-opioid receptor agonists" by Secker et al. (https://doi.org/10.1186/s13321-023-00746-4) Y1 - 2023 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:0297-zib-96220 ER - TY - JOUR A1 - Winkler, Alexander T1 - Berliner Kulturerbe digital: Ein quantitativer Blick auf die Metadatenqualität JF - EVA BERLIN 2023. Elektronische Medien & Kunst, Kultur und Historie. 27. Berliner Veranstaltung der internationalen EVA-Serie (29. November 2023 – 01. Dezember 2023) N2 - Die Metadatenqualität bestimmt wesentlich den Nutzen und Wert von Kulturerbedaten. ‚Gute‘ Metadaten erhöhen die Auffindbarkeit, Interoperabilität und Nutzbarkeit von Daten signifikant. Mit Blick auf Retrieval bzw. Discovery, Vernetzung im Kontext von Linked Open Data und wissenschaftliches Data Mining hängt die Qualität dabei wesentlich von der Verwendung von maschinenlesbaren kontrollierten Vokabularen ab. Diese wird in der vorliegenden Arbeit quantitativ untersucht. Als Datengrundlage dienen die in der Deutschen Digitalen Bibliothek aggregierten Metadaten aus Berliner Museen (ca. 1,2 Millionen Metadatenobjekte im LIDO-Format) Y1 - 2023 SP - 101 EP - 108 ER - TY - GEN A1 - Cao, Karl-Kien A1 - Anderson, Lovis A1 - Böhme, Aileen A1 - Breuer, Thomas A1 - Buschmann, Jan A1 - Fiand, Frederick A1 - Frey, Ulrich A1 - Fuchs, Benjamin A1 - Kempe, Nils-Christian A1 - von Krbek, Kai A1 - Medjroubi, Wided A1 - Riehm, Judith A1 - Sasanpour, Shima A1 - Simon, Sonja A1 - Vanaret, Charlie A1 - Wetzel, Manuel A1 - Xiao, Mengzhu A1 - Zittel, Janina T1 - Evaluation of Uncertainties in Linear-Optimizing Energy System Models - Compendium T2 - DLR-Forschungsbericht N2 - Für die Energiesystemforschung sind Software-Modelle ein Kernelement zur Analyse von Szenarien. Das Forschungsprojekt UNSEEN hatte das Ziel eine bisher unerreichte Anzahl an modellbasierten Energieszenarien zu berechnen, um Unsicherheiten – vor allem unter Nutzung linear optimierender Energiesystem-Modelle - besser bewerten zu können. Hierfür wurden umfangreiche Parametervariationen auf Energieszenarien angewendet und das wesentliche methodische Hindernis in diesem Zusammenhang adressiert: die rechnerische Beherrschbarkeit der zu lösenden mathematischen Optimierungsprobleme. Im Vorläuferprojekt BEAM-ME wurde mit der Entwicklung und Anwendung des Open-Source-Lösers PIPS-IPM++ die Grundlage für den Einsatz von High-Performance-Computing (HPC) zur Lösung dieser Modelle gelegt. In UNSEEN war dieser Löser die zentrale Komponente eines Workflows, welcher zur Generierung, Lösung und multi-kriteriellen Bewertung von Energieszenarien auf dem Hochleistungscomputer JUWELS am Forschungszentrum Jülich implementiert wurde. Zur effizienten Generierung und Kommunikation von Modellinstanzen für Methoden der mathematischen Optimierung auf HPC wurde eine weitere Workflow-Komponente von der GAMS Software GmbH entwickelt: der Szenariogenerator. Bei der Weiterentwicklung von Lösungsalgorithmen für linear optimierende Energie-Systemmodelle standen gemischt-ganzzahlige Optimierungsprobleme im Fokus, welche für die Modellierung konkreter Infrastrukturen und Maßnahmen zur Umsetzung der Energiewende gelöst werden müssen. Die in diesem Zusammenhang stehenden Arbeiten zur Entwicklung von Algorithmen wurden von der Technischen Universität Berlin verantwortet. Bei Design und Implementierung dieser Methoden wurde sie vom Zuse Instituts Berlin unterstützt. Y1 - 2023 U6 - https://doi.org/10.57676/w2rq-bj85 IS - DLR-FB-2023-15 ER - TY - JOUR A1 - Breugem, Thomas A1 - Schlechte, Thomas A1 - Schulz, Christof A1 - Borndörfer, Ralf T1 - A three-phase heuristic for the Fairness-Oriented Crew Rostering Problem JF - Computers & Operations Research N2 - The Fairness-Oriented Crew Rostering Problem (FCRP) considers the joint optimization of attractiveness and fairness in cyclic crew rostering. Like many problems in scheduling and logistics, the combinatorial complexity of cyclic rostering causes exact methods to fail for large-scale practical instances. In case of the FCRP, this is accentuated by the additionally imposed fairness requirements. Hence, heuristic methods are necessary. We present a three-phase heuristic for the FCRP combining column generation techniques with variable-depth neighborhood search. The heuristic exploits different mathematical formulations to find feasible solutions and to search for improvements. We apply our methodology to practical instances from Netherlands Railways (NS), the main passenger railway operator in the Netherlands Our results show the three-phase heuristic finds good solutions for most instances and outperforms a state-of-the-art commercial solver. Y1 - 2023 U6 - https://doi.org/10.1016/j.cor.2023.106186 VL - 154 SP - 106186 ER - TY - CHAP A1 - Thuerck, Daniel A1 - Sofranac, Boro A1 - Pfetsch, Marc A1 - Pokutta, Sebastian T1 - Learning cuts via enumeration oracles T2 - Proceedings of Conference on Neural Information Processing Systems Y1 - 2023 ER - TY - CHAP A1 - Martínez-Rubio, David A1 - Roux, Christophe A1 - Criscitiello, Christopher A1 - Pokutta, Sebastian T1 - Accelerated Riemannian Min-Max Optimization Ensuring Bounded Geometric Penalties T2 - Proceedings of Optimization for Machine Learning (NeurIPS Workshop OPT 2023) Y1 - 2023 ER -