<?xml version="1.0" encoding="utf-8"?>
<export-example>
  <doc>
    <id>7145</id>
    <completedYear/>
    <publishedYear>2020</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst>65</pageFirst>
    <pageLast>88</pageLast>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume>27</volume>
    <type>incollection</type>
    <publisherName>De Gruyter</publisherName>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Optimality criteria for probabilistic numerical methods</title>
    <abstract language="eng">It is well understood that Bayesian decision theory and average case analysis are essentially identical. However, if one is interested in performing uncertainty quantification for a numerical task, it can be argued that the decision-theoretic framework is neither appropriate nor sufficient. To this end, we consider an alternative optimality criterion from Bayesian experimental design and study its implied optimal information in the numerical context. This information is demonstrated to differ, in general, from the information that would be used in an average-case-optimal numerical method. The explicit connection to Bayesian experimental design suggests several distinct regimes in which optimal probabilistic numerical methods can be developed.</abstract>
    <parentTitle language="eng">Multivariate Algorithms and Information-Based Complexity</parentTitle>
    <identifier type="arxiv">1901.04326</identifier>
    <identifier type="doi">10.1515/9783110635461-005</identifier>
    <enrichment key="PeerReviewed">yes</enrichment>
    <author>Chris Oates</author>
    <submitter>T. J. Sullivan</submitter>
    <editor>F. J. Hickernell</editor>
    <author>Jon Cockayne</author>
    <editor>P. Kritzer</editor>
    <author>Dennis Prangle</author>
    <author>T. J. Sullivan</author>
    <author>Mark Girolami</author>
    <collection role="institutes" number="num">Numerical Mathematics</collection>
    <collection role="projects" number="no-project">no-project</collection>
    <collection role="institutes" number="MSoCP">Modeling and Simulation of Complex Processes</collection>
  </doc>
  <doc>
    <id>6867</id>
    <completedYear/>
    <publishedYear>2018</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst>283</pageFirst>
    <pageLast>336</pageLast>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume/>
    <type>incollection</type>
    <publisherName>Springer Nature</publisherName>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Parallel Solvers for Mixed Integer Linear Optimization</title>
    <parentTitle language="eng">Handbook of Parallel Constraint Reasoning</parentTitle>
    <identifier type="doi">10.1007/978-3-319-63516-3_8</identifier>
    <enrichment key="PeerReviewed">yes</enrichment>
    <enrichment key="PreprintUrn">urn:nbn:de:0297-zib-62239</enrichment>
    <author>Ted Ralphs</author>
    <editor>Youssef Hamadi</editor>
    <submitter>Katharina Lachmann</submitter>
    <author>Yuji Shinano</author>
    <author>Timo Berthold</author>
    <author>Thorsten Koch</author>
    <collection role="institutes" number="optimization">Mathematical Optimization</collection>
    <collection role="persons" number="berthold">Berthold, Timo</collection>
    <collection role="persons" number="koch">Koch, Thorsten</collection>
    <collection role="persons" number="shinano">Shinano, Yuji</collection>
    <collection role="projects" number="MIP-ZIBOPT">MIP-ZIBOPT</collection>
    <collection role="projects" number="MODAL-SynLab">MODAL-SynLab</collection>
    <collection role="projects" number="MODAL-Gesamt">MODAL-Gesamt</collection>
    <collection role="institutes" number="aopt">Applied Optimization</collection>
  </doc>
  <doc>
    <id>6863</id>
    <completedYear/>
    <publishedYear>2018</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst/>
    <pageLast/>
    <pageNumber/>
    <edition/>
    <issue>5</issue>
    <volume>20</volume>
    <type>incollection</type>
    <publisherName/>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>2018-05-07</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Molecular Dynamics vs. Stochastic Processes: Are We Heading Anywhere?</title>
    <parentTitle language="eng">Special Issue: Understanding Molecular Dynamics via Stochastic Processes, Entropy</parentTitle>
    <identifier type="doi">10.3390/e20050348</identifier>
    <enrichment key="PeerReviewed">yes</enrichment>
    <enrichment key="FulltextUrl">http://www.mdpi.com/journal/entropy/special_issues/stochastic_processes</enrichment>
    <enrichment key="AcceptedDate">02.05.2018</enrichment>
    <author>Giovanni Ciccotti</author>
    <submitter>Erlinda Koernig</submitter>
    <author>Mauro Ferrario</author>
    <author>Christof Schütte</author>
    <collection role="institutes" number="num">Numerical Mathematics</collection>
    <collection role="persons" number="schuette">Schütte, Christof</collection>
    <collection role="projects" number="no-project">no-project</collection>
  </doc>
  <doc>
    <id>6701</id>
    <completedYear/>
    <publishedYear>2018</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst>363</pageFirst>
    <pageLast>371</pageLast>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume/>
    <type>incollection</type>
    <publisherName>Springer</publisherName>
    <publisherPlace>Cham</publisherPlace>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Parallel-in-Time for Parabolic Optimal Control Problems Using PFASST</title>
    <abstract language="eng">In gradient-based methods for parabolic optimal control problems, it is necessary to solve both the state equation and a backward-in-time adjoint equation in each iteration of the optimization method. In order to facilitate fully parallel gradient-type and nonlinear conjugate gradient methods for the solution of such optimal control problems, we discuss the application of the parallel-in-time method PFASST to adjoint gradient computation. In addition to enabling time parallelism, PFASST provides high flexibility for handling nonlinear equations, as well as potential extra computational savings from reusing previous solutions in the optimization loop. The approach is demonstrated here for a model reaction-diffusion optimal control problem.</abstract>
    <parentTitle language="eng">Domain Decomposition Methods in Science and Engineering XXIV</parentTitle>
    <subTitle language="deu">DD 2017.</subTitle>
    <identifier type="doi">10.1007/978-3-319-93873-8_34</identifier>
    <enrichment key="PeerReviewed">yes</enrichment>
    <enrichment key="PreprintUrn">urn:nbn:de:0297-zib-64989</enrichment>
    <enrichment key="AcceptedDate">2018-02-15</enrichment>
    <author>Sebastian Götschel</author>
    <submitter>Sebastian Götschel</submitter>
    <author>Michael L. Minion</author>
    <collection role="institutes" number="num">Numerical Mathematics</collection>
    <collection role="institutes" number="compmed">Computational Medicine</collection>
    <collection role="projects" number="DFG-RTThermo">DFG-RTThermo</collection>
    <collection role="projects" number="HPCompression">HPCompression</collection>
  </doc>
  <doc>
    <id>6682</id>
    <completedYear/>
    <publishedYear>2017</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst>320</pageFirst>
    <pageLast>321</pageLast>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume/>
    <type>incollection</type>
    <publisherName>Seemann Henschel</publisherName>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Face to Face-Interface</title>
    <parentTitle language="eng">+ultra. Knowledge &amp; Gestaltung</parentTitle>
    <enrichment key="PeerReviewed">no</enrichment>
    <author>Carl Martin Grewe</author>
    <editor>Nikola Doll</editor>
    <submitter>Carl Martin Grewe</submitter>
    <author>Stefan Zachow</author>
    <editor>Horst Bredekamp</editor>
    <editor>Wolfgang Schäffner</editor>
    <collection role="institutes" number="vis">Visual Data Analysis</collection>
    <collection role="persons" number="zachow">Zachow, Stefan</collection>
    <collection role="projects" number="IKG-FacialMorphology">IKG-FacialMorphology</collection>
    <collection role="institutes" number="VDcC">Visual and Data-centric Computing</collection>
  </doc>
  <doc>
    <id>6681</id>
    <completedYear/>
    <publishedYear>2017</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst>281</pageFirst>
    <pageLast>286</pageLast>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume/>
    <type>incollection</type>
    <publisherName>Seemann Henschel</publisherName>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Digital Image Archive. The Archiving and Coding of Emotions</title>
    <parentTitle language="eng">+ultra. Knowledge &amp; Gestaltung</parentTitle>
    <enrichment key="PeerReviewed">no</enrichment>
    <author>Carl Martin Grewe</author>
    <editor>Nikola Doll</editor>
    <submitter>Carl Martin Grewe</submitter>
    <author>Lisa Schreiber</author>
    <editor>Horst Bredekamp</editor>
    <editor>Wolfgang Schäffner</editor>
    <collection role="institutes" number="vis">Visual Data Analysis</collection>
    <collection role="projects" number="IKG-FacialMorphology">IKG-FacialMorphology</collection>
    <collection role="institutes" number="VDcC">Visual and Data-centric Computing</collection>
  </doc>
  <doc>
    <id>6145</id>
    <completedYear/>
    <publishedYear>2016</publishedYear>
    <thesisYearAccepted/>
    <language>deu</language>
    <pageFirst>110</pageFirst>
    <pageLast>118</pageLast>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume>4/2016</volume>
    <type>incollection</type>
    <publisherName>VDB - Verein Deutscher Bibliothekarinnen und Bibliothekare e.V.</publisherName>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="deu">DeepGreen - Entwicklung eines rechtssicheren Workflows zur effizienten Umsetzung der Open-Access-Komponente in den Allianz-Lizenzen für die Wissenschaft</title>
    <abstract language="deu">Die Grundsätze für den Erwerb überregionaler Lizenzen, die von der Deutschen Forschungsgemeinschaft(DFG) gefördert werden (sog. Allianz-Lizenzen), beinhalten spezifische Regelungen zum Open Access. &#13;
Damit wird DFG-seitig sichergestellt, dass bei Abschluss von Allianz-Verträgen die inkludierten Inhalte sowohl von Autoren als auch von den lizenznehmenden Einrichtungen unter vorteilhafteren Konditionen gegenüber den üblichen Self Archiving Policies (z.B. Verlagsversion, verkürzte Embargofrist) in Repositorien archiviert und veröffentlicht werden dürfen. Die Erfahrung der seit 2011 getätigten Allianz-Abschlüsse zeigt allerdings, dass der Kreis berechtigter Autorinnen und Autoren und Institutionen eigenständig kaum Gebrauch von ihren hierdurch erhaltenen Open-Access-Rechten macht. Entsprechend liegt ein großer Schatz wissenschaftlicher Literatur bei den Verlagen, der noch zu heben ist. Das bewilligte DFG-Projekt DeepGreen (Ausschreibung „Open-Access-Transformation“ von 2014) zielt darauf ab, die vereinbarten Open-Access-Konditionen der Allianz-Lizenzen auf technischer Ebene komfortabel auszugestalten und, wenn möglich, zu automatisieren, so dass nicht mehr Autorinnen und Autoren oder die hierzu berechtigten Bibliotheken die Publikationen manuell in Open-Access-Repositorien einpflegen müssen, sondern die Verlage selbst zyklisch über definierte Schnittstellen abliefern. Dazu bauen die Projektpartner (Universitätsbibliothek Erlangen-Nürnberg, Universitätsbibliothek TU Berlin, Helmholtz Open Science Koordinationsbüro am Deutschen GeoForschungsZentrum, Bayerische Staatsbibliothek München sowie die Verbünde&#13;
Bibliotheksverbund Bayern und KooperativerBibliotheksverbund Berlin-Brandenburg) ein Dark&#13;
Archive namens DeepGreen auf, in das teilnehmende Allianz-Lizenz-Verlage Publikationen und Metadaten einspeisen. DeepGreen soll im Anschluss als Datendrehscheibe für berechtigte Open-Access-Repositorien dienen. Als Pilotpartner konnten die Verlage Karger und SAGE gewonnen werden. Der vorliegende Aufsatz stellt das Projekt und den aktuellen Stand der Arbeiten vor.</abstract>
    <parentTitle language="deu">o-bib. Das offene Bibliotheksjournal / herausgegeben vom VDB, 4/2016</parentTitle>
    <identifier type="doi">10.5282/o-bib/2016H4S110-119</identifier>
    <enrichment key="Series">o-bib</enrichment>
    <enrichment key="PeerReviewed">yes</enrichment>
    <author>Beate Rusch</author>
    <editor>Klaus-Rainer Brintzinger</editor>
    <submitter>Anne-Beatrix Bauknecht</submitter>
    <editor>Ulrich Hohoff</editor>
    <author>Markus Putnings</author>
    <editor>Ulrike Scholle</editor>
    <editor>Thomas Stäcker</editor>
    <editor>Helge Steenweg</editor>
    <editor>Heidrun Wiesenmüller</editor>
    <collection role="institutes" number="sis">Digital Data and Information for Society, Science, and Culture</collection>
    <collection role="persons" number="rusch">Rusch, Beate</collection>
    <collection role="projects" number="KOBV">KOBV</collection>
    <collection role="projects" number="DeepGreen">DeepGreen</collection>
  </doc>
  <doc>
    <id>6119</id>
    <completedYear/>
    <publishedYear>2016</publishedYear>
    <thesisYearAccepted/>
    <language>deu</language>
    <pageFirst/>
    <pageLast/>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume/>
    <type>incollection</type>
    <publisherName>Deutsche Digitale Bibliothek</publisherName>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="deu">Was in der Zwischenzeit geschah – vier Jahre und  49 Digitalisierungsprojekte später: Förderprogramm Digitalisierung und Servicestelle Digitalisierung Berlin (digiS) 2012 bis 2016</title>
    <parentTitle language="deu">Föderale Vielfalt – Globale Vernetzung. Strategien der Bundesländer für das kulturelle Erbe in der digitalen Welt.</parentTitle>
    <identifier type="doi">10.15460/ddb.2.168</identifier>
    <enrichment key="PeerReviewed">no</enrichment>
    <author>Anja Müller</author>
    <submitter>Anja Müller</submitter>
    <author>Beate Rusch</author>
    <collection role="institutes" number="sis">Digital Data and Information for Society, Science, and Culture</collection>
    <collection role="persons" number="anja.mueller">Müller, Anja</collection>
    <collection role="persons" number="rusch">Rusch, Beate</collection>
    <collection role="projects" number="digiS">digiS</collection>
  </doc>
  <doc>
    <id>5716</id>
    <completedYear/>
    <publishedYear>2015</publishedYear>
    <thesisYearAccepted/>
    <language>deu</language>
    <pageFirst>33</pageFirst>
    <pageLast>46</pageLast>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume/>
    <type>incollection</type>
    <publisherName>Walter De Gruyter</publisherName>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="deu">Raumtiefe in Malerei und Computergrafik</title>
    <abstract language="deu">Einführung: Die Tiefenwirkung dreidimensionaler Räume in einem zweidimensionalen Bild einzufangen, ist ein Faszinosum nahezu aller Kulturen der Menschheitsgeschichte. Der vorliegende Aufsatz folgt den Spuren dieses Faszinosums, vergleichend in der Malerei und der mathematisierten Computergrafik. Die Entdeckung der Zentralperspektive in der italienischen Renaissance zeigt bereits den engen Zusammenhang von Malerei und Mathematik. Auf der Suche nach Maltechniken, mit denen Raumtiefe bildnerisch dargestellt werden kann, beginnen wir in Kap. 2 mit einem chronologischen Gang durch verschiedene Epochen der europäischen Malerei. Hieraus abgeleitete Prinzipien, soweit sie im Rechner realisierbar scheinen, stellen wir in Kap. 3 am Beispiel moderner Methoden der mathematischen Visualisierung vor.</abstract>
    <parentTitle language="deu">Räume - Bilder - Kulturen</parentTitle>
    <identifier type="isbn">978-3-11-035993-0</identifier>
    <enrichment key="PeerReviewed">no</enrichment>
    <author>Peter Deuflhard</author>
    <editor>Verena Lepper</editor>
    <submitter>Erlinda Koernig</submitter>
    <author>Hans-Christian Hege</author>
    <editor>Peter Deuflhard</editor>
    <editor>Christoph Markschies</editor>
    <collection role="institutes" number="num">Numerical Mathematics</collection>
    <collection role="institutes" number="vis">Visual Data Analysis</collection>
    <collection role="persons" number="deuflhard">Deuflhard, Peter</collection>
    <collection role="persons" number="hege">Hege, Hans-Christian</collection>
    <collection role="projects" number="no-project">no-project</collection>
    <collection role="institutes" number="VDcC">Visual and Data-centric Computing</collection>
  </doc>
  <doc>
    <id>5483</id>
    <completedYear/>
    <publishedYear>2010</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst>296</pageFirst>
    <pageLast>314</pageLast>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume>6130</volume>
    <type>incollection</type>
    <publisherName>Springer Berlin / Heidelberg</publisherName>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Eigenmodes of Surface Energies for Shape Analysis</title>
    <abstract language="eng">In this work, we study the spectra and eigenmodes of the Hessian of various discrete surface energies and discuss applications to shape analysis. In particular, we consider a physical model that describes the vibration modes and frequencies of a surface through the eigenfunctions and eigenvalues of the Hessian of a deformation energy, and we derive a closed form representation for the Hessian (at the rest state of the energy) for a general class of deformation energies. Furthermore, we design a quadratic energy, such that the eigenmodes of the Hessian of this energy are sensitive to the extrinsic curvature of the surface. &#13;
Based on these spectra and eigenmodes, we derive two shape signatures. One that measures the similarity of points on a surface, and another that can be used to identify features of the surface. In addition, we discuss a spectral quadrangulation scheme for surfaces.</abstract>
    <parentTitle language="eng">Advances in Geometric Modeling and Processing (Proceedings of Geometric Modeling and Processing 2010)</parentTitle>
    <identifier type="doi">10.1007/978-3-642-13411-1_20</identifier>
    <enrichment key="Series">Lecture Notes in Computer Science</enrichment>
    <enrichment key="PeerReviewed">yes</enrichment>
    <enrichment key="FulltextUrl">https://nbn-resolving.org/urn:nbn:de:0296-matheon-7325</enrichment>
    <author>Klaus Hildebrandt</author>
    <editor>Bernard Mourrain</editor>
    <submitter>Christoph von Tycowicz</submitter>
    <author>Christian Schulz</author>
    <editor>Scott Schaefer</editor>
    <author>Christoph von Tycowicz</author>
    <editor>Guoliang Xu</editor>
    <author>Konrad Polthier</author>
    <collection role="institutes" number="vis">Visual Data Analysis</collection>
    <collection role="persons" number="vontycowicz">Tycowicz, Christoph von</collection>
    <collection role="institutes" number="VDcC">Visual and Data-centric Computing</collection>
  </doc>
</export-example>
