<?xml version="1.0" encoding="utf-8"?>
<export-example>
  <doc>
    <id>10202</id>
    <completedYear/>
    <publishedYear>2023</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst/>
    <pageLast/>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume/>
    <type>conferenceobject</type>
    <publisherName/>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">To What Extent Can Individualisation in Terms of Different Types of Mode Improve Learning Outcomes and Learner Satisfaction? A Pre-study</title>
    <parentTitle language="eng">Proceedings of the Hawaii International Conference on System Sciences</parentTitle>
    <enrichment key="PeerReviewed">yes</enrichment>
    <enrichment key="opus.source">publish</enrichment>
    <author>Jana Gonnermann-Müller</author>
    <submitter>Christoph Spiegel</submitter>
    <author>Bonny Brandenburger</author>
    <author>Gergana Vladova</author>
    <author>Norbert Gronau</author>
    <collection role="projects" number="no-project">no-project</collection>
    <collection role="institutes" number="ais2t">AI in Society, Science, and Technology</collection>
    <collection role="persons" number="gonnermann-mueller">Gonnermann-Müller, Jana</collection>
  </doc>
  <doc>
    <id>9893</id>
    <completedYear/>
    <publishedYear>2023</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst>191</pageFirst>
    <pageLast>214</pageLast>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume>197</volume>
    <type>article</type>
    <publisherName/>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Revisiting the Approximate Carathéodory Problem via the Frank-Wolfe Algorithm</title>
    <parentTitle language="eng">Mathematical Programming A</parentTitle>
    <identifier type="doi">10.1007/s10107-021-01735-x</identifier>
    <enrichment key="PeerReviewed">yes</enrichment>
    <enrichment key="opus.source">publish</enrichment>
    <author>Cyrille Combettes</author>
    <submitter>Christoph Spiegel</submitter>
    <author>Sebastian Pokutta</author>
    <collection role="projects" number="no-project">no-project</collection>
    <collection role="persons" number="pokutta">Pokutta, Sebastian</collection>
    <collection role="institutes" number="ais2t">AI in Society, Science, and Technology</collection>
  </doc>
  <doc>
    <id>9836</id>
    <completedYear/>
    <publishedYear>2023</publishedYear>
    <thesisYearAccepted/>
    <language>deu</language>
    <pageFirst>103</pageFirst>
    <pageLast>146</pageLast>
    <pageNumber>44</pageNumber>
    <edition/>
    <issue>2</issue>
    <volume>70</volume>
    <type>article</type>
    <publisherName>Springer Science and Business Media LLC</publisherName>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="deu">Mathematische Gesellschaft der DDR – die Vorgeschichte</title>
    <abstract language="deu">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.</abstract>
    <parentTitle language="deu">Mathematische Semesterberichte</parentTitle>
    <identifier type="doi">10.1007/s00591-023-00350-5</identifier>
    <identifier type="issn">0720-728X</identifier>
    <enrichment key="opus_doi_flag">true</enrichment>
    <enrichment key="opus_crossrefDocumentType">journal-article</enrichment>
    <enrichment key="opus_crossrefLicence">https://creativecommons.org/licenses/by/4.0</enrichment>
    <enrichment key="opus_import_origin">crossref</enrichment>
    <enrichment key="opus_doiImportPopulated">PersonAuthorFirstName_1,PersonAuthorLastName_1,PublisherName,TitleMain_1,Language,TitleAbstract_1,TitleParent_1,PageNumber,PageFirst,PageLast,Issue,Volume,PublishedYear,IdentifierIssn,Enrichmentopus_crossrefLicence,PersonAuthorFirstName_1,PersonAuthorLastName_1,PublisherName,TitleMain_1,Language,TitleAbstract_1,TitleParent_1,PageNumber,PageFirst,PageLast,Issue,Volume,PublishedYear,IdentifierIssn,Enrichmentopus_crossrefLicence</enrichment>
    <enrichment key="PeerReviewed">yes</enrichment>
    <enrichment key="opus.source">doi-import</enrichment>
    <author>Wolfram Sperber</author>
    <collection role="institutes" number="sis">Digital Data and Information for Society, Science, and Culture</collection>
    <collection role="projects" number="no-project">no-project</collection>
    <collection role="persons" number="sperber">Sperber, Wolfram</collection>
  </doc>
  <doc>
    <id>9734</id>
    <completedYear/>
    <publishedYear>2023</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst/>
    <pageLast/>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume/>
    <type>doctoralthesis</type>
    <publisherName/>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>2024-04-29</thesisDateAccepted>
    <title language="eng">A Discrete-Continuous Algorithm for Globally Optimal Free Flight Trajectory Optimization</title>
    <abstract language="eng">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.</abstract>
    <identifier type="url">http://dx.doi.org/10.17169/refubium-43526</identifier>
    <enrichment key="opus.source">publish</enrichment>
    <licence>Creative Commons - CC BY-NC - Namensnennung - Nicht kommerziell 4.0 International</licence>
    <advisor>Ralf Borndörfer</advisor>
    <author>Fabian Danecker</author>
    <submitter>Martin Weiser</submitter>
    <advisor>Martin Weiser</advisor>
    <collection role="institutes" number="num">Numerical Mathematics</collection>
    <collection role="institutes" number="MSoCP">Modeling and Simulation of Complex Processes</collection>
    <collection role="institutes" number="neo">Network Optimization</collection>
    <collection role="projects" number="MathPlus-AA3-3">MathPlus-AA3-3</collection>
    <collection role="projects" number="MathPlus-TrU-4">MathPlus-TrU-4</collection>
    <thesisGrantor>Freie Universität Berlin</thesisGrantor>
  </doc>
  <doc>
    <id>9719</id>
    <completedYear/>
    <publishedYear>2023</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst>1</pageFirst>
    <pageLast>15</pageLast>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume/>
    <type>conferenceobject</type>
    <publisherName/>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Evaluation of Model Bias Identification Approaches Based on Bayesian Inference and Applications to Digital Twins</title>
    <abstract language="eng">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.&#13;
&#13;
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.</abstract>
    <parentTitle language="eng">5th ECCOMAS Thematic Conference on Uncertainty Quantification in Computational Sciences and Engineering</parentTitle>
    <identifier type="url">https://2023.uncecomp.org/proceedings/pdf/19795.pdf</identifier>
    <enrichment key="Series">UNCECOMP</enrichment>
    <enrichment key="PeerReviewed">no</enrichment>
    <enrichment key="opus.source">publish</enrichment>
    <author>Daniel Andrés Arcones</author>
    <submitter>Martin Weiser</submitter>
    <author>Martin Weiser</author>
    <author>Faidon-Stelios Koutsourelakis</author>
    <author>Jörg F. Unger</author>
    <collection role="institutes" number="num">Numerical Mathematics</collection>
    <collection role="persons" number="weiser">Weiser, Martin</collection>
    <collection role="institutes" number="MSoCP">Modeling and Simulation of Complex Processes</collection>
    <collection role="projects" number="DigitalTwins">DigitalTwins</collection>
  </doc>
  <doc>
    <id>9717</id>
    <completedYear/>
    <publishedYear>2023</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst>734</pageFirst>
    <pageLast>740</pageLast>
    <pageNumber/>
    <edition/>
    <issue>5</issue>
    <volume>6</volume>
    <type>article</type>
    <publisherName/>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">A Bayesian Framework for Simulation-based Digital Twins of Bridges</title>
    <abstract language="eng">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.</abstract>
    <parentTitle language="eng">EUROSTRUCT 2023:European Association on Quality Control of Bridges and Structures: Digital Transformation in Sustainability</parentTitle>
    <identifier type="doi">10.1002/cepa.2177</identifier>
    <enrichment key="PeerReviewed">no</enrichment>
    <enrichment key="opus.source">publish</enrichment>
    <author>Daniel Andrés Arcones</author>
    <submitter>Martin Weiser</submitter>
    <author>Martin Weiser</author>
    <author>Faidon-Stelios Koutsourelakis</author>
    <author>Jörg F. Unger</author>
    <collection role="institutes" number="num">Numerical Mathematics</collection>
    <collection role="persons" number="weiser">Weiser, Martin</collection>
    <collection role="institutes" number="MSoCP">Modeling and Simulation of Complex Processes</collection>
    <collection role="projects" number="DigitalTwins">DigitalTwins</collection>
  </doc>
  <doc>
    <id>9696</id>
    <completedYear/>
    <publishedYear>2023</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst>2817</pageFirst>
    <pageLast>2839</pageLast>
    <pageNumber/>
    <edition/>
    <issue>6</issue>
    <volume>55</volume>
    <type>article</type>
    <publisherName/>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">A general approach to transversal versions of Dirac-type theorems</title>
    <parentTitle language="eng">Bulletin of the London Mathematical Society</parentTitle>
    <enrichment key="PeerReviewed">yes</enrichment>
    <enrichment key="opus.source">publish</enrichment>
    <author>Pranshu Gupta</author>
    <submitter>Christoph Spiegel</submitter>
    <author>Fabian Hamann</author>
    <author>Alp Müyesser</author>
    <author>Amedeo Sgueglia</author>
    <author>Olaf Parczyk</author>
    <collection role="projects" number="no-project">no-project</collection>
    <collection role="institutes" number="ais2t">AI in Society, Science, and Technology</collection>
    <collection role="persons" number="parczyk">Parczyk, Olaf</collection>
  </doc>
  <doc>
    <id>9698</id>
    <completedYear/>
    <publishedYear>2023</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst/>
    <pageLast/>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume/>
    <type>article</type>
    <publisherName/>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Anti-Ramsey threshold of complete graphs for sparse graphs</title>
    <parentTitle language="eng">Discrete Mathematics</parentTitle>
    <enrichment key="PeerReviewed">yes</enrichment>
    <enrichment key="opus.source">publish</enrichment>
    <author>Yoshiharu Kohayakawa</author>
    <submitter>Christoph Spiegel</submitter>
    <author>Guilherme O. Mota</author>
    <author>Jakob Schnitzer</author>
    <author>Olaf Parczyk</author>
    <collection role="projects" number="no-project">no-project</collection>
    <collection role="institutes" number="ais2t">AI in Society, Science, and Technology</collection>
    <collection role="persons" number="parczyk">Parczyk, Olaf</collection>
  </doc>
  <doc>
    <id>9668</id>
    <completedYear/>
    <publishedYear>2023</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst/>
    <pageLast/>
    <pageNumber>35</pageNumber>
    <edition/>
    <issue/>
    <volume/>
    <type>bachelorthesis</type>
    <publisherName/>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>2023-06-06</thesisDateAccepted>
    <title language="eng">Finding Rules and Patterns in Egyptological Research Objects using Boolean Polynomial Rings</title>
    <enrichment key="opus.source">publish</enrichment>
    <advisor>Konstantin Fackeldey</advisor>
    <author>Noor-Cella Bena</author>
    <submitter>Konstantin Fackeldey</submitter>
    <advisor>Marcus Weber</advisor>
    <collection role="institutes" number="scp">Supercomputing</collection>
    <collection role="institutes" number="MSoCP">Modeling and Simulation of Complex Processes</collection>
    <collection role="projects" number="MathPlus EF5-4_Ancient-Egyptian">MathPlus EF5-4_Ancient-Egyptian</collection>
    <thesisGrantor>Technische Universität Berlin</thesisGrantor>
  </doc>
  <doc>
    <id>9646</id>
    <completedYear/>
    <publishedYear>2023</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst/>
    <pageLast/>
    <pageNumber>84</pageNumber>
    <edition/>
    <issue/>
    <volume/>
    <type>masterthesis</type>
    <publisherName/>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>2023-12-10</thesisDateAccepted>
    <title language="eng">The n-Queens Problem in Higher Dimensions</title>
    <abstract language="eng">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.</abstract>
    <identifier type="urn">urn:nbn:de:0297-zib-96468</identifier>
    <enrichment key="opus.source">publish</enrichment>
    <licence>Creative Commons - CC BY - Namensnennung 4.0 International</licence>
    <advisor>Thorsten Koch</advisor>
    <author>Tim Kunt</author>
    <submitter>Tim Kunt</submitter>
    <series>
      <title>ZIB-Report</title>
      <number>24-05</number>
    </series>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Integer Programming</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Maximum Independent Set</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>n-Queens</value>
    </subject>
    <collection role="projects" number="no-project">no-project</collection>
    <collection role="institutes" number="aim">Applied Algorithmic Intelligence Methods</collection>
    <collection role="persons" number="kunt">Kunt, Tim</collection>
    <collection role="institutes" number="aopt">Applied Optimization</collection>
    <thesisGrantor>Technische Universität Berlin</thesisGrantor>
    <file>https://opus4.kobv.de/opus4-zib/files/9646/The_n-Queens_Problem_in_Higher_Dimensions.pdf</file>
  </doc>
  <doc>
    <id>9638</id>
    <completedYear/>
    <publishedYear>2023</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst>161</pageFirst>
    <pageLast>168</pageLast>
    <pageNumber>8</pageNumber>
    <edition>Communications in Computer and Information Science</edition>
    <issue/>
    <volume/>
    <type>conferenceobject</type>
    <publisherName>Springer Nature Switzerland</publisherName>
    <publisherPlace>Cham</publisherPlace>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Ontologies for Models and Algorithms in Applied Mathematics and Related Disciplines</title>
    <abstract language="eng">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.</abstract>
    <parentTitle language="eng">Metadata and Semantic Research - MTSR 2023</parentTitle>
    <identifier type="arxiv">2310.20443</identifier>
    <identifier type="doi">10.1007/978-3-031-65990-4_14</identifier>
    <enrichment key="PeerReviewed">yes</enrichment>
    <enrichment key="AcceptedDate">15.09.2023</enrichment>
    <author>Björn Schembera</author>
    <submitter>Marco Reidelbach</submitter>
    <author>Frank Wübbeling</author>
    <author>Hendrik Kleikamp</author>
    <author>Christine Biedinger</author>
    <author>Jochen Fiedler</author>
    <author>Marco Reidelbach</author>
    <author>Aurela Shehu</author>
    <author>Burkhard Schmidt</author>
    <author>Thomas Koprucki</author>
    <author>Dotothea Iglezakis</author>
    <author>Dominik Göddeke</author>
    <collection role="institutes" number="MSoCP">Modeling and Simulation of Complex Processes</collection>
    <collection role="persons" number="reidelbach">Reidelbach, Marco</collection>
    <collection role="projects" number="MaRDI-TA4">MaRDI-TA4</collection>
  </doc>
  <doc>
    <id>9636</id>
    <completedYear/>
    <publishedYear>2023</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst/>
    <pageLast/>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume>1</volume>
    <type>article</type>
    <publisherName>TIB Open Publishing</publisherName>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Building Ontologies and Knowledge Graphs for Mathematics and its Applications</title>
    <abstract language="eng">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.</abstract>
    <parentTitle language="eng">Proceedings of the Conference on Research Data Infrastructure</parentTitle>
    <identifier type="doi">10.52825/cordi.v1i.255</identifier>
    <identifier type="issn">2941-296X</identifier>
    <enrichment key="opus_doi_flag">true</enrichment>
    <enrichment key="opus_doi_json">{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,9,9]],"date-time":"2023-09-09T04:56:03Z","timestamp":1694235363725},"reference-count":14,"publisher":"TIB Open Publishing","license":[{"start":{"date-parts":[[2023,9,7]],"date-time":"2023-09-07T00:00:00Z","timestamp":1694044800000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100001659","name":"Deutsche Forschungsgemeinschaft","doi-asserted-by":"publisher","award":["460135501"]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Proc Conf Res Data Infrastr"],"abstract":"&lt;jats:p&gt;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.&lt;\/jats:p&gt;","DOI":"10.52825\/cordi.v1i.255","type":"journal-article","created":{"date-parts":[[2023,9,8]],"date-time":"2023-09-08T08:06:54Z","timestamp":1694160414000},"source":"Crossref","is-referenced-by-count":0,"title":["Building Ontologies and Knowledge Graphs for Mathematics and its Applications"],"prefix":"10.52825","volume":"1","author":[{"ORCID":"http:\/\/orcid.org\/0000-0003-2860-6621","authenticated-orcid":false,"given":"Bj\u00f6rn","family":"Schembera","sequence":"first","affiliation":[]},{"ORCID":"http:\/\/orcid.org\/0000-0002-2375-2008","authenticated-orcid":false,"given":"Frank","family":"W\u00fcbbeling","sequence":"additional","affiliation":[]},{"ORCID":"http:\/\/orcid.org\/0000-0001-6235-9412","authenticated-orcid":false,"given":"Thomas","family":"Koprucki","sequence":"additional","affiliation":[]},{"ORCID":"http:\/\/orcid.org\/0009-0002-5082-8386","authenticated-orcid":false,"given":"Christine","family":"Biedinger","sequence":"additional","affiliation":[]},{"ORCID":"http:\/\/orcid.org\/0000-0002-1919-1834","authenticated-orcid":false,"given":"Marco","family":"Reidelbach","sequence":"additional","affiliation":[]},{"ORCID":"http:\/\/orcid.org\/0000-0002-9658-499X","authenticated-orcid":false,"given":"Burkhard","family":"Schmidt","sequence":"additional","affiliation":[]},{"ORCID":"http:\/\/orcid.org\/0000-0002-1552-497X","authenticated-orcid":false,"given":"Dominik","family":"G\u00f6ddeke","sequence":"additional","affiliation":[]},{"given":"Jochen","family":"Fiedler","sequence":"additional","affiliation":[]}],"member":"30396","published-online":{"date-parts":[[2023,9,7]]},"reference":[{"key":"12644","unstructured":"T. Boege, R. Fritze, C. G\u00a8orgen, et al., \u201cData Management Planning in the German Mathematical Community,\u201d arXiv preprint arXiv:2211.12071, 2022."},{"key":"12645","doi-asserted-by":"crossref","unstructured":"C. G\u00a8orgen and R. Sinn, \u201cMathematik in der Nationalen Forschungsdateninfrastruktur,\u201d Mitteilungen der Deutschen Mathematiker-Vereinigung, vol. 29, no. 3, pp. 122\u2013123, 2021.","DOI":"10.1515\/dmvm-2021-0049"},{"key":"12646","unstructured":"P. Benner, M. Burger, D. G\u00a8oddeke, et al., \u201cDie mathematische Forschungsdateninitiative in der NFDI: MaRDI (Mathematical Research Data Initiative),\u201d GAMM Rundbrief, no. 1, pp. 40\u201343, 2022."},{"key":"12647","doi-asserted-by":"crossref","unstructured":"M. T. Horsch, S. Chiacchiera, W. L. Cavalcanti, and B. Schembera, Data Technology in Materials Modelling. Springer Nature, 2021.","DOI":"10.1007\/978-3-030-68597-3"},{"key":"12648","unstructured":"M. D. Wilkinson, M. Dumontier, I. J. Aalbersberg, et al., \u201cThe FAIR Guiding Principles for scientific data management and stewardship,\u201d Scientific data, vol. 3, no. 1, pp. 1\u20139, 2016."},{"key":"12649","unstructured":"The MaRDI consortium, MaRDI: Mathematical Research Data Initiative Proposal, May 2022. DOI: 10.5281\/zenodo.6552436. [Online]. Available: https:\/\/doi.org\/10.5281\/zenodo.6552436."},{"key":"12650","unstructured":"A. Schiewe, S. Albert, P. Schiewe, A. Sch\u00a8 obel, F. Sp\u00a8 uhler, and M. Stinzend\u00a8 orfer, Documentation for LinTim 2022.08, coursematerial, 2022. [Online]. Available: http:\/\/nbnresolving.de\/urn:nbn:de:hbz:386-kluedo-69236."},{"key":"12651","unstructured":"A. Schiewe, S. Albert, V. Grafe, P. Schiewe, A. Sch\u00a8 obel, and F. Sp\u00a8 uhler, LinTim - integrated optimization in public transportation. [Online]. Available: https:\/\/www.lintim.net."},{"key":"12652","doi-asserted-by":"crossref","unstructured":"M. Goerigk, S. Michael, and A. Sch\u00a8 obel, \u201cEvaluating line concepts using travel times and robustness: Simulations with the LinTim toolbox,\u201d Public Transport, vol. 5, pp. 267\u2013284, 2013. DOI: https:\/\/doi.org\/10.1007\/s12469-013-0072-x.","DOI":"10.1007\/s12469-013-0072-x"},{"key":"12653","unstructured":"C. Himpe, H. Kleikamp, R. Fritze, and S. Rave, MaRDI Task Area 2 - Scientific Computing @WWU M\u00a8unster. AlgoData - Algorithm Knowledge Graph - Ontology (Version 0.1), 2022. [Online]. Available: https:\/\/mardi4nfdi.de\/algodata\/0.1."},{"key":"12654","unstructured":"The MaRDI consortium, AlgoData, https:\/\/algodata.mardi4nfdi.de\/, [Online; accessed 24-April-2023], 2023."},{"key":"12655","unstructured":"The MaRDI consortium, AlgoData Editorial Access Beta, https:\/\/beta.m1.mardi.ovh\/, [Online; accessed 24-April-2023], 2023."},{"key":"12656","unstructured":"The MaRDI consortium, MaRDI TA4 Portal, https:\/\/portal.mardi4nfdi.de\/wiki\/Portal\/TA4, [Online; accessed 24-April-2023], 2023."},{"key":"12657","doi-asserted-by":"crossref","unstructured":"T. Koprucki, M. Kohlhase, K. Tabelow, D. M\u00a8 uller, and F. Rabe, \u201cModel pathway diagrams for the representation of mathematical models,\u201d Optical and Quantum Electronics, vol. 50, pp. 1\u20139, 2018.","DOI":"10.1007\/s11082-018-1321-7"}],"container-title":["Proceedings of the Conference on Research Data Infrastructure"],"original-title":[],"link":[{"URL":"https:\/\/www.tib-op.org\/ojs\/index.php\/CoRDI\/article\/download\/255\/479","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.tib-op.org\/ojs\/index.php\/CoRDI\/article\/download\/255\/479","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,8]],"date-time":"2023-09-08T08:07:01Z","timestamp":1694160421000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.tib-op.org\/ojs\/index.php\/CoRDI\/article\/view\/255"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,9,7]]},"references-count":14,"URL":"http:\/\/dx.doi.org\/10.52825\/cordi.v1i.255","relation":{},"ISSN":["2941-296X"],"issn-type":[{"value":"2941-296X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,9,7]]}}}</enrichment>
    <enrichment key="opus_crossrefDocumentType">journal-article</enrichment>
    <enrichment key="opus_crossrefLicence">https://creativecommons.org/licenses/by/4.0</enrichment>
    <enrichment key="opus_import_origin">crossref</enrichment>
    <enrichment key="opus_doiImportPopulated">PersonAuthorFirstName_1,PersonAuthorLastName_1,PersonAuthorIdentifierOrcid_1,PersonAuthorFirstName_2,PersonAuthorLastName_2,PersonAuthorIdentifierOrcid_2,PersonAuthorFirstName_3,PersonAuthorLastName_3,PersonAuthorIdentifierOrcid_3,PersonAuthorFirstName_4,PersonAuthorLastName_4,PersonAuthorIdentifierOrcid_4,PersonAuthorFirstName_5,PersonAuthorLastName_5,PersonAuthorIdentifierOrcid_5,PersonAuthorFirstName_6,PersonAuthorLastName_6,PersonAuthorIdentifierOrcid_6,PersonAuthorFirstName_7,PersonAuthorLastName_7,PersonAuthorIdentifierOrcid_7,PersonAuthorFirstName_8,PersonAuthorLastName_8,PublisherName,TitleMain_1,TitleAbstract_1,TitleParent_1,Volume,PublishedYear,IdentifierIssn,Enrichmentopus_crossrefLicence</enrichment>
    <enrichment key="opus.source">doi-import</enrichment>
    <enrichment key="PeerReviewed">yes</enrichment>
    <author>Björn Schembera</author>
    <submitter>Marco Reidelbach</submitter>
    <author>Frank Wübbeling</author>
    <author>Thomas Koprucki</author>
    <author>Christine Biedinger</author>
    <author>Marco Reidelbach</author>
    <author>Burkhard Schmidt</author>
    <author>Dominik Göddeke</author>
    <author>Jochen Fiedler</author>
    <collection role="institutes" number="MSoCP">Modeling and Simulation of Complex Processes</collection>
    <collection role="persons" number="reidelbach">Reidelbach, Marco</collection>
    <collection role="projects" number="MaRDI-TA4">MaRDI-TA4</collection>
  </doc>
  <doc>
    <id>9635</id>
    <completedYear/>
    <publishedYear>2023</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst/>
    <pageLast/>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume>1</volume>
    <type>article</type>
    <publisherName>TIB Open Publishing</publisherName>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">MaRDMO Plugin</title>
    <abstract language="eng">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.</abstract>
    <parentTitle language="eng">Proceedings of the Conference on Research Data Infrastructure</parentTitle>
    <subTitle language="eng">Document and Retrieve Workflows Using the MaRDI Portal</subTitle>
    <identifier type="doi">10.52825/cordi.v1i.254</identifier>
    <identifier type="issn">2941-296X</identifier>
    <enrichment key="opus_doi_flag">true</enrichment>
    <enrichment key="opus_doi_json">{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,9,9]],"date-time":"2023-09-09T04:56:26Z","timestamp":1694235386988},"reference-count":7,"publisher":"TIB Open Publishing","license":[{"start":{"date-parts":[[2023,9,7]],"date-time":"2023-09-07T00:00:00Z","timestamp":1694044800000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100001659","name":"Deutsche Forschungsgemeinschaft","doi-asserted-by":"publisher","award":["460135501","NFDI 29\/1 \u201cMaRDI \u2013 Mathematische Forschungsdateninitiative\u201d"]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Proc Conf Res Data Infrastr"],"abstract":"&lt;jats:p&gt;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.&lt;\/jats:p&gt;","DOI":"10.52825\/cordi.v1i.254","type":"journal-article","created":{"date-parts":[[2023,9,8]],"date-time":"2023-09-08T08:16:33Z","timestamp":1694160993000},"source":"Crossref","is-referenced-by-count":0,"title":["MaRDMO Plugin"],"prefix":"10.52825","volume":"1","author":[{"ORCID":"http:\/\/orcid.org\/0000-0002-1919-1834","authenticated-orcid":false,"given":"Marco","family":"Reidelbach","sequence":"first","affiliation":[]},{"ORCID":"http:\/\/orcid.org\/0009-0009-2327-2619","authenticated-orcid":false,"given":"Eloi","family":"Ferrer","sequence":"additional","affiliation":[]},{"given":"Marcus","family":"Weber","sequence":"additional","affiliation":[]}],"member":"30396","published-online":{"date-parts":[[2023,9,7]]},"reference":[{"key":"12260","doi-asserted-by":"crossref","unstructured":"M. Baker, \u201c1,500 scientists lift the lid on reproducibility,\u201d Nature, vol. 533, pp. 452\u2013454, May 2016. DOI: 10.1038\/533452a.","DOI":"10.1038\/533452a"},{"key":"12261","doi-asserted-by":"crossref","unstructured":"Krishna Tiwari, Sarubini Kananathan, Matthew G. Roberts, Johannes P. Meyer, Mohammad Umer Sharif Shohan, Ashley Xavier, Matthieu Maire, Ahmad Zyoud, Jinghao Men, Szeyi Ng, Tung V. N. Nguyen, Mihai Glont, Henning Hermjakob and Rahuman S. Malik-Sheriff, \u201cReproducibility in systems biology modelling,\u201d Molecular Systems Biology, vol. 17, e9982, Feb. 2021. DOI: 10.15252\/msb.20209982.","DOI":"10.15252\/msb.20209982"},{"key":"12262","doi-asserted-by":"crossref","unstructured":"D. Fanelli, \u201cHow many scientists fabricate and falsify research? a systematic review and meta-analysis of survey data,\u201d PLOS ONE, vol. 4, no. 5, e5738, May 2009. DOI: 10.1371\/journal.pone.0005738.","DOI":"10.1371\/journal.pone.0005738"},{"key":"12263","doi-asserted-by":"crossref","unstructured":"Christiane G\u00a8orgen and Rainer Sinn, \u201cMathematik in der nationalen forschungsdateninfrastruktur,\u201d Mitteilungen der Deutschen Mathematiker-Vereinigung, vol. 29, no. 3, pp. 122\u2013123, Oct. 2021. DOI: 10.1515\/dmvm-2021-0049.","DOI":"10.1515\/dmvm-2021-0049"},{"key":"12264","unstructured":"Tobias Boege, Ren\u00b4e Fritze, Christiane G\u00a8orgen, Jeroen Hanselman, Dorothea Iglezakis, Lars Kastner, Thomas Koprucki, Tabea Krause, Christoph Lehrenfeld, Silvia Polla, Marco Reidelbach, Christian Riedel, Jens Saak, Bj \u00a8 orn Schembera, Karsten Tabelow and Marcus Weber, \u201cResearch-data management planning in the german mathematical community,\u201d Nov. 2022. DOI: 10.48550\/arXiv.2211.12071."},{"key":"12265","unstructured":"R. Arbeitsgemeinschaft. \u201cRDMO - Cooperations.\u201d (2023), [Online]. Available: hhttps:\/\/rdmorganiser.github.io\/en\/cooperations\/ (visited on 04\/16\/2023)."},{"key":"12266","unstructured":"Harry Enke, Daniela Hausen, Christin Henzen, Gerald Jagusch, Celia Krause, Sabine Sch\u00a8onau, Lukas Weimer and J\u00a8urgen Windeck, \u201cData management planning: Concept for setting up a working group in the nfdi section common infrastructures,\u201d Jan. 2023. DOI: 10.5281\/zenodo.7540682."}],"container-title":["Proceedings of the Conference on Research Data Infrastructure"],"original-title":[],"link":[{"URL":"https:\/\/www.tib-op.org\/ojs\/index.php\/CoRDI\/article\/download\/254\/537","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.tib-op.org\/ojs\/index.php\/CoRDI\/article\/download\/254\/537","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,8]],"date-time":"2023-09-08T08:16:41Z","timestamp":1694161001000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.tib-op.org\/ojs\/index.php\/CoRDI\/article\/view\/254"}},"subtitle":["Document and Retrieve Workflows Using the MaRDI Portal"],"short-title":[],"issued":{"date-parts":[[2023,9,7]]},"references-count":7,"URL":"http:\/\/dx.doi.org\/10.52825\/cordi.v1i.254","relation":{},"ISSN":["2941-296X"],"issn-type":[{"value":"2941-296X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,9,7]]}}}</enrichment>
    <enrichment key="opus_crossrefDocumentType">journal-article</enrichment>
    <enrichment key="opus_crossrefLicence">https://creativecommons.org/licenses/by/4.0</enrichment>
    <enrichment key="opus_import_origin">crossref</enrichment>
    <enrichment key="opus_doiImportPopulated">PersonAuthorFirstName_1,PersonAuthorLastName_1,PersonAuthorIdentifierOrcid_1,PersonAuthorFirstName_2,PersonAuthorLastName_2,PersonAuthorIdentifierOrcid_2,PersonAuthorFirstName_3,PersonAuthorLastName_3,PublisherName,TitleMain_1,TitleAbstract_1,TitleParent_1,Volume,PublishedYear,IdentifierIssn,Enrichmentopus_crossrefLicence</enrichment>
    <enrichment key="PeerReviewed">yes</enrichment>
    <enrichment key="opus.source">doi-import</enrichment>
    <author>Marco Reidelbach</author>
    <submitter>Marco Reidelbach</submitter>
    <author>Eloi Ferrer</author>
    <author>Marcus Weber</author>
    <collection role="persons" number="weber">Weber, Marcus</collection>
    <collection role="institutes" number="MSoCP">Modeling and Simulation of Complex Processes</collection>
    <collection role="institutes" number="VDcC">Visual and Data-centric Computing</collection>
    <collection role="persons" number="reidelbach">Reidelbach, Marco</collection>
    <collection role="persons" number="ferrer">Ferrer, Eloi</collection>
    <collection role="projects" number="MaRDI-TA4">MaRDI-TA4</collection>
  </doc>
  <doc>
    <id>9634</id>
    <completedYear/>
    <publishedYear>2023</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst/>
    <pageLast/>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume/>
    <type>article</type>
    <publisherName/>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Research Data Management Planning in Mathematics</title>
    <abstract language="eng">Research data are crucial in mathematics and all scientific disciplines, as they form the&#13;
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.</abstract>
    <identifier type="doi">10.5281/zenodo.10018245</identifier>
    <enrichment key="PeerReviewed">no</enrichment>
    <enrichment key="opus.source">publish</enrichment>
    <author>Peter Benner</author>
    <submitter>Marco Reidelbach</submitter>
    <author>Renita Danabalan</author>
    <author>Dominik Gödekke</author>
    <author>Lars Kastner</author>
    <author>Tabea Krause</author>
    <author>Daniel Mietchen</author>
    <author>Marco Reidelbach</author>
    <author>Björn Schembera</author>
    <author>Moritz Schubotz</author>
    <author>Rainer Sinn</author>
    <author>Karsten Tabelow</author>
    <collection role="institutes" number="MSoCP">Modeling and Simulation of Complex Processes</collection>
    <collection role="persons" number="reidelbach">Reidelbach, Marco</collection>
    <collection role="projects" number="MaRDI-TA4">MaRDI-TA4</collection>
  </doc>
  <doc>
    <id>9622</id>
    <completedYear/>
    <publishedYear>2023</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst/>
    <pageLast/>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume/>
    <type>researchdata</type>
    <publisherName/>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Novel multi-objective affinity approach allows to identify pH-specific μ-opioid receptor agonists (Dataset)</title>
    <abstract language="eng">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)</abstract>
    <identifier type="doi">10.12752/9622</identifier>
    <identifier type="urn">urn:nbn:de:0297-zib-96220</identifier>
    <enrichment key="zib_DownloadUrl">https://www.zib.de/ext-data/pH_specific_screening_MOR/</enrichment>
    <enrichment key="ScientificResourceTypeGeneral">Dataset</enrichment>
    <enrichment key="ScientificDateCreated">19.09.2023</enrichment>
    <enrichment key="opus.source">publish</enrichment>
    <enrichment key="zib_relatedIdentifier">https://doi.org/10.1186/s13321-023-00746-4</enrichment>
    <author>Christopher Secker</author>
    <submitter>Christopher Secker</submitter>
    <collection role="persons" number="fackeldey">Fackeldey, Konstantin</collection>
    <collection role="persons" number="schuette">Schütte, Christof</collection>
    <collection role="persons" number="weber">Weber, Marcus</collection>
    <collection role="institutes" number="scp">Supercomputing</collection>
    <collection role="institutes" number="MSoCP">Modeling and Simulation of Complex Processes</collection>
    <collection role="institutes" number="PaDC">Parallel and Distributed Computing</collection>
    <collection role="persons" number="gorgulla">Gorgulla, Christoph</collection>
    <collection role="projects" number="MathPlusAA1-15">MathPlusAA1-15</collection>
    <collection role="persons" number="secker">Secker, Christopher</collection>
    <collection role="projects" number="MathPlusAA1-19">MathPlusAA1-19</collection>
  </doc>
  <doc>
    <id>9600</id>
    <completedYear/>
    <publishedYear>2023</publishedYear>
    <thesisYearAccepted/>
    <language>deu</language>
    <pageFirst>101</pageFirst>
    <pageLast>108</pageLast>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume/>
    <type>article</type>
    <publisherName/>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="deu">Berliner Kulturerbe digital: Ein quantitativer Blick auf die Metadatenqualität</title>
    <abstract language="deu">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&#13;
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)</abstract>
    <parentTitle language="deu">EVA BERLIN 2023. Elektronische Medien &amp; Kunst, Kultur und Historie. 27. Berliner Veranstaltung der internationalen EVA-Serie (29. November 2023 – 01. Dezember 2023)</parentTitle>
    <enrichment key="PeerReviewed">no</enrichment>
    <enrichment key="opus.source">publish</enrichment>
    <author>Alexander Winkler</author>
    <submitter>Alexander Winkler</submitter>
    <collection role="institutes" number="sis">Digital Data and Information for Society, Science, and Culture</collection>
    <collection role="projects" number="digiS">digiS</collection>
    <collection role="persons" number="winkler">Winkler, Alexander</collection>
  </doc>
  <doc>
    <id>9576</id>
    <completedYear/>
    <publishedYear>2023</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst/>
    <pageLast/>
    <pageNumber>95</pageNumber>
    <edition/>
    <issue>DLR-FB-2023-15</issue>
    <volume/>
    <type>other</type>
    <publisherName/>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Evaluation of Uncertainties in Linear-Optimizing Energy System Models - Compendium</title>
    <abstract language="deu">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.</abstract>
    <parentTitle language="deu">DLR-Forschungsbericht</parentTitle>
    <identifier type="doi">10.57676/w2rq-bj85</identifier>
    <enrichment key="PeerReviewed">no</enrichment>
    <enrichment key="opus.source">publish</enrichment>
    <enrichment key="opus.doi.autoCreate">false</enrichment>
    <enrichment key="opus.urn.autoCreate">true</enrichment>
    <author>Karl-Kien Cao</author>
    <submitter>Janina Zittel</submitter>
    <author>Lovis Anderson</author>
    <author>Aileen Böhme</author>
    <author>Thomas Breuer</author>
    <author>Jan Buschmann</author>
    <author>Frederick Fiand</author>
    <author>Ulrich Frey</author>
    <author>Benjamin Fuchs</author>
    <author>Nils-Christian Kempe</author>
    <author>Kai von Krbek</author>
    <author>Wided Medjroubi</author>
    <author>Judith Riehm</author>
    <author>Shima Sasanpour</author>
    <author>Sonja Simon</author>
    <author>Charlie Vanaret</author>
    <author>Manuel Wetzel</author>
    <author>Mengzhu Xiao</author>
    <author>Janina Zittel</author>
    <collection role="persons" number="zittel">Zittel, Janina</collection>
    <collection role="institutes" number="aim">Applied Algorithmic Intelligence Methods</collection>
    <collection role="persons" number="vanaret">Vanaret, Charlie William</collection>
    <collection role="projects" number="UNSEEN">UNSEEN</collection>
    <collection role="institutes" number="aopt">Applied Optimization</collection>
  </doc>
  <doc>
    <id>9505</id>
    <completedYear/>
    <publishedYear>2023</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst>106186</pageFirst>
    <pageLast/>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume>154</volume>
    <type>article</type>
    <publisherName/>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>2023-02-24</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">A three-phase heuristic for the Fairness-Oriented Crew Rostering Problem</title>
    <abstract language="eng">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.</abstract>
    <parentTitle language="eng">Computers &amp; Operations Research</parentTitle>
    <identifier type="doi">10.1016/j.cor.2023.106186</identifier>
    <enrichment key="PeerReviewed">yes</enrichment>
    <enrichment key="SubmissionStatus">epub ahead of print</enrichment>
    <enrichment key="AcceptedDate">2023-03-06</enrichment>
    <enrichment key="opus.source">publish</enrichment>
    <author>Thomas Breugem</author>
    <submitter>Thomas Schlechte</submitter>
    <author>Thomas Schlechte</author>
    <author>Christof Schulz</author>
    <author>Ralf Borndörfer</author>
    <collection role="persons" number="borndoerfer">Borndörfer, Ralf</collection>
    <collection role="persons" number="schlechte">Schlechte, Thomas</collection>
    <collection role="persons" number="schulz">Schulz, Christof</collection>
    <collection role="projects" number="WS-OPT">WS-OPT</collection>
    <collection role="institutes" number="neo">Network Optimization</collection>
  </doc>
  <doc>
    <id>9492</id>
    <completedYear/>
    <publishedYear>2023</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst/>
    <pageLast/>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume/>
    <type>conferenceobject</type>
    <publisherName/>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Learning cuts via enumeration oracles</title>
    <parentTitle language="eng">Proceedings of Conference on Neural Information Processing Systems</parentTitle>
    <enrichment key="PeerReviewed">yes</enrichment>
    <enrichment key="opus.source">publish</enrichment>
    <author>Daniel Thuerck</author>
    <submitter>Christoph Spiegel</submitter>
    <author>Boro Sofranac</author>
    <author>Marc Pfetsch</author>
    <author>Sebastian Pokutta</author>
    <collection role="persons" number="pokutta">Pokutta, Sebastian</collection>
    <collection role="persons" number="sofranac">Šofranac, Boro</collection>
    <collection role="institutes" number="ais2t">AI in Society, Science, and Technology</collection>
  </doc>
  <doc>
    <id>9494</id>
    <completedYear/>
    <publishedYear>2023</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst/>
    <pageLast/>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume/>
    <type>conferenceobject</type>
    <publisherName/>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Accelerated Riemannian Min-Max Optimization Ensuring Bounded Geometric Penalties</title>
    <parentTitle language="eng">Proceedings of Optimization for Machine Learning (NeurIPS Workshop OPT 2023)</parentTitle>
    <enrichment key="PeerReviewed">yes</enrichment>
    <enrichment key="opus.source">publish</enrichment>
    <author>David Martínez-Rubio</author>
    <submitter>Christoph Spiegel</submitter>
    <author>Christophe Roux</author>
    <author>Christopher Criscitiello</author>
    <author>Sebastian Pokutta</author>
    <collection role="persons" number="pokutta">Pokutta, Sebastian</collection>
    <collection role="institutes" number="ais2t">AI in Society, Science, and Technology</collection>
    <collection role="persons" number="Roux">Roux, Christophe</collection>
    <collection role="projects" number="MathPlus-AA5-1">MathPlus-AA5-1</collection>
  </doc>
</export-example>
