<?xml version="1.0" encoding="utf-8"?>
<export-example>
  <doc>
    <id>5663</id>
    <completedYear/>
    <publishedYear>2023</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst>1</pageFirst>
    <pageLast>27</pageLast>
    <pageNumber/>
    <edition/>
    <issue>1</issue>
    <volume>1</volume>
    <type>article</type>
    <publisherName>ACM</publisherName>
    <publisherPlace>New York, NY,</publisherPlace>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Ready to Leap (by Co-Design)? Join Order Optimisation on Quantum Hardware</title>
    <abstract language="eng">The prospect of achieving computational speedups by exploiting quantum phenomena makes the use of quantum processing units (QPUs) attractive for many algorithmic database problems. Query optimisation, which concerns problems that typically need to explore large search spaces, seems like an ideal match for the known quantum algorithms. We present the first quantum implementation of join ordering, which is one of the most investigated and fundamental query optimisation problems, based on a reformulation to quadratic binary unconstrained optimisation problems. We empirically characterise our method on two state-of-the-art approaches (gate-based quantum computing and quantum annealing), and identify speed-ups compared to the best know classical join ordering approaches for input sizes that can be processed with current quantum annealers. However, we also confirm that limits of early-stage technology are quickly reached.&#13;
Current QPUs are classified as noisy, intermediate scale quantum computers (NISQ), and are restricted by a variety of limitations that reduce their capabilities as compared to ideal future quantum computers, which prevents us from scaling up problem dimensions and reaching practical utility. To overcome these challenges, our formulation accounts for specific QPU properties and limitations, and allows us to trade between achievable solution quality and possible problem size.&#13;
In contrast to all prior work on quantum computing for query optimisation and database-related challenges, we go beyond currently available QPUs, and explicitly target the scalability limitations: Using insights gained from numerical simulations and our experimental analysis, we identify key criteria for co-designing QPUs to improve their usefulness for join ordering, and show how even relatively minor physical architectural improvements can result in substantial enhancements. Finally, we outline a path towards practical utility of custom-designed QPUs.</abstract>
    <parentTitle language="eng">Proceedings of the ACM on Management of Data, PACMMOD</parentTitle>
    <identifier type="doi">10.1145/3588946</identifier>
    <identifier type="urn">urn:nbn:de:bvb:898-opus4-56634</identifier>
    <note>Corresponding author: Manuel Schönberger</note>
    <enrichment key="BegutachtungStatus">peer-reviewed</enrichment>
    <enrichment key="CorrespondingAuthor">Manuel Schönberger</enrichment>
    <licence>Creative Commons - CC BY-NC-SA - Namensnennung - Nicht kommerziell -  Weitergabe unter gleichen Bedingungen 4.0 International</licence>
    <author>Manuel Schönberger</author>
    <author>Stefanie Scherzinger</author>
    <author>Wolfgang Mauerer</author>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Hardware</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Quantum cmputation</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Informations systems</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Join algorithms</value>
    </subject>
    <collection role="institutes" number="FakIM">Fakultät Informatik und Mathematik</collection>
    <collection role="othforschungsschwerpunkt" number="16311">Digitalisierung</collection>
    <collection role="oaweg" number="">Hybrid Open Access - OA-Veröffentlichung in einer Subskriptionszeitschrift/-medium</collection>
    <collection role="oaweg" number="">Corresponding author der OTH Regensburg</collection>
    <collection role="funding" number="">Publikationsfonds der OTH Regensburg</collection>
    <collection role="institutes" number="">Labor für Digitalisierung (LFD)</collection>
    <thesisPublisher>Ostbayerische Technische Hochschule Regensburg</thesisPublisher>
    <file>https://opus4.kobv.de/opus4-oth-regensburg/files/5663/Schoenberger_ACM.pdf</file>
  </doc>
  <doc>
    <id>2698</id>
    <completedYear/>
    <publishedYear>2019</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst>807</pageFirst>
    <pageLast>818</pageLast>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume/>
    <type>conferenceobject</type>
    <publisherName>IEEE</publisherName>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">The List is the Process: Reliable Pre-Integration Tracking of Commits on Mailing Lists</title>
    <abstract language="eng">A considerable corpus of research on software evolution focuses on mining changes in software repositories, but omits their pre-integration history. We present a novel method for tracking this otherwise invisible evolution of software changes on mailing lists by connecting all early revisions of changes to their final version in repositories. Since artefact modifications on mailing lists are communicated by updates to fragments (i.e., patches) only, identifying semantically similar changes is a non-trivial task that our approach solves in a language-independent way. We evaluate our method on high-profile open source software (OSS) projects like the Linux kernel, and validate its high accuracy using an elaborately created ground truth. Our approach can be used to quantify properties of OSS development processes, which is an essential requirement for using OSS in reliable or safety-critical industrial products, where certifiability and conformance to processes are crucial. The high accuracy of our technique allows, to the best of our knowledge, for the first time to quantitatively determine if an open development process effectively aligns with given formal process requirements.</abstract>
    <parentTitle language="eng">2019 IEEE/ACM 41st International Conference on Software Engineering (ICSE), 25-31 May 2019, Montreal, QC, Canada</parentTitle>
    <identifier type="doi">10.1109/ICSE.2019.00088</identifier>
    <enrichment key="opus.import.date">2022-02-04T08:58:18+00:00</enrichment>
    <enrichment key="opus.source">sword</enrichment>
    <enrichment key="opus.import.user">importuser</enrichment>
    <enrichment key="BegutachtungStatus">peer-reviewed</enrichment>
    <licence>Keine Lizenz - Es gilt das deutsche Urheberrecht: § 53 UrhG</licence>
    <author>Ralf Ramsauer</author>
    <author>Daniel Lohmann</author>
    <author>Wolfgang Mauerer</author>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>commits</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Data mining</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Electronic mail</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Linux</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>mailing lists</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>mining software repositories</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Open source software</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>patches</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Software engineering</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Software maintenance</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Software reliability</value>
    </subject>
    <collection role="institutes" number="FakIM">Fakultät Informatik und Mathematik</collection>
    <collection role="othforschungsschwerpunkt" number="16311">Digitalisierung</collection>
    <collection role="institutes" number="">Labor für Digitalisierung (LFD)</collection>
  </doc>
  <doc>
    <id>3462</id>
    <completedYear/>
    <publishedYear>2021</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst>2377</pageFirst>
    <pageLast>2380</pageLast>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume/>
    <type>conferenceobject</type>
    <publisherName>IEEE</publisherName>
    <publisherPlace>Piscataway, NJ</publisherPlace>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Nullius in Verba: Reproducibility for Database Systems Research, Revisited</title>
    <abstract language="eng">Over the last decade, reproducibility of experimental results has been a prime focus in database systems research, and many high-profile conferences award results that can be independently verified. Since database systems research involves complex software stacks that non-trivially interact with hardware, sharing experimental setups is anything but trivial: Building a working reproduction package goes far beyond providing a DOI to some repository hosting data, code, and setup instructions.This tutorial revisits reproducible engineering in the face of state-of-the-art technology, and best practices gained in other computer science research communities. In particular, in the hands-on part, we demonstrate how to package entire system software stacks for dissemination. To ascertain long-term reproducibility over decades (or ideally, forever), we discuss why relying on open source technologies massively employed in industry has essential advantages over approaches crafted specifically for research. Supplementary material shows how version control systems that allow for non-linearly rewriting recorded history can document the structured genesis behind experimental setups in a way that is substantially easier to understand, without involvement of the original authors, compared to detour-ridden, strictly historic evolution.</abstract>
    <parentTitle language="eng">2021 IEEE 37th International Conference on Data Engineering (ICDE 2021): 19-22 April 2021, Chania, Greece</parentTitle>
    <identifier type="isbn">978-1-7281-9184-3</identifier>
    <identifier type="doi">10.1109/ICDE51399.2021.00270</identifier>
    <enrichment key="opus.import.date">2022-04-10T09:34:41+00:00</enrichment>
    <enrichment key="opus.source">sword</enrichment>
    <enrichment key="opus.import.user">importuser</enrichment>
    <enrichment key="BegutachtungStatus">peer-reviewed</enrichment>
    <licence>Keine Lizenz - Es gilt das deutsche Urheberrecht: § 53 UrhG</licence>
    <author>Wolfgang Mauerer</author>
    <author>Stefanie Scherzinger</author>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Control systems</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Data engineering</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Database systems</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>docker</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>git</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Hardware</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Industries</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Reproducibility of results</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>reproducible science</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>reproduction, reproduction package</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>scientific attribution</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>scientific method</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Tutorials</value>
    </subject>
    <collection role="institutes" number="FakIM">Fakultät Informatik und Mathematik</collection>
    <collection role="othforschungsschwerpunkt" number="16311">Digitalisierung</collection>
    <collection role="institutes" number="">Labor für Digitalisierung (LFD)</collection>
  </doc>
  <doc>
    <id>3480</id>
    <completedYear/>
    <publishedYear>2021</publishedYear>
    <thesisYearAccepted/>
    <language>deu</language>
    <pageFirst>397</pageFirst>
    <pageLast>421</pageLast>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume/>
    <type>conferenceobject</type>
    <publisherName>Gesellschaft für Informatik</publisherName>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="deu">Silentium! Run-Analyse-Eradicate the Noise out of the DB/OS Stack</title>
    <abstract language="eng">When multiple tenants compete for resources, database performance tends to suffer. Yet there are scenarios where guaranteed sub-millisecond latencies are crucial, such as in real-time data processing, IoT devices, or when operating in safety-critical environments. In this paper, we study how to make query latencies deterministic in the face of noise (whether caused by other tenants or unrelated operating system tasks). We perform controlled experiments with an in-memory database engine in a multi-tenant setting, where we successively eradicate noisy interference from within the system software stack, to the point where the engine runs close to bare-metal on the underlying hardware. We show that we can achieve query latencies comparable to the database engine running as the sole tenant, but without noticeably impacting the workload of competing tenants. We discuss these results in the context of ongoing efforts to build custom operating systems for database workloads, and point out that for certain use cases, the margin for improvement is rather narrow. In fact, for scenarios like ours, existing operating systems might just be good enough, provided that they are expertly configured. We then critically discuss these findings in the light of a broader family of database systems (e.g., including disk-based), and how to extend the approach of this paper accordingly.&#13;
Low-latency databases; tail latency; real-time databases; bounded-time query processing;&#13;
DB-OS co-engineering</abstract>
    <parentTitle language="deu">Datenbanksysteme für Business, Technologie und Web (BTW 2021): 13.-17. September 2021, Dresden, Deutschland</parentTitle>
    <identifier type="doi">10.18420/btw2021-21</identifier>
    <identifier type="handle">https://dl.gi.de/handle/20.500.12116/35805</identifier>
    <enrichment key="opus.import.date">2022-04-10T09:34:41+00:00</enrichment>
    <enrichment key="opus.source">sword</enrichment>
    <enrichment key="opus.import.user">importuser</enrichment>
    <enrichment key="OtherSeries">GI-Edition. Proceedings ; 311</enrichment>
    <licence>Creative Commons - CC BY-NC - Namensnennung - Nicht kommerziell 4.0 International</licence>
    <author>Wolfgang Mauerer</author>
    <author>Ralf Ramsauer</author>
    <author>Edson R. F. Lucas</author>
    <author>Stefanie Scherzinger</author>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>bounded-time query processing</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>DB-OS co-engineering</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Low-latency databases</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>real-time databases</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>tail latency</value>
    </subject>
    <collection role="institutes" number="FakIM">Fakultät Informatik und Mathematik</collection>
    <collection role="othforschungsschwerpunkt" number="16311">Digitalisierung</collection>
    <collection role="institutes" number="">Labor für Digitalisierung (LFD)</collection>
  </doc>
  <doc>
    <id>3472</id>
    <completedYear/>
    <publishedYear>2022</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst/>
    <pageLast/>
    <pageNumber/>
    <edition>In Press, Corrected Proof</edition>
    <issue/>
    <volume/>
    <type>article</type>
    <publisherName>Elsevier</publisherName>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Uncovering Instabilities in Variational-Quantum Deep Q-Networks</title>
    <abstract language="eng">Deep Reinforcement Learning (RL) has considerably advanced over the past decade. At the same time, state-of-the-art RL algorithms require a large computational budget in terms of training time to converge. Recent work has started to approach this problem through the lens of quantum computing, which promises theoretical speed-ups for several traditionally hard tasks. In this work, we examine a class of hybrid quantumclassical RL algorithms that we collectively refer to as variational quantum deep Q-networks (VQ-DQN). We show that VQ-DQN approaches are subject to instabilities that cause the learned policy to diverge, study the extent to which this afflicts reproduciblity of established results based on classical simulation, and perform systematic experiments to identify potential explanations for the observed instabilities. Additionally, and in contrast to most existing work on quantum reinforcement learning, we execute RL algorithms on an actual quantum processing unit (an IBM Quantum Device) and investigate differences in behaviour between simulated and physical quantum systems that suffer from implementation deficiencies. Our experiments show that, contrary to opposite claims in the literature, it cannot be conclusively decided if known quantum approaches, even if simulated without physical imperfections, can provide an advantage as compared to classical approaches. Finally, we provide a robust, universal and well-tested implementation of VQ-DQN as a reproducible testbed for future experiments.</abstract>
    <parentTitle language="eng">Journal of the Franklin Institute</parentTitle>
    <identifier type="issn">0016-0032</identifier>
    <identifier type="doi">10.1016/j.jfranklin.2022.08.021</identifier>
    <note>Corresponding author: Maja Franz</note>
    <enrichment key="opus.import.date">2022-04-10T09:34:41+00:00</enrichment>
    <enrichment key="opus.source">sword</enrichment>
    <enrichment key="opus.import.user">importuser</enrichment>
    <enrichment key="BegutachtungStatus">peer-reviewed</enrichment>
    <enrichment key="CorrespondingAuthor">Maja Franz</enrichment>
    <licence>Creative Commons - CC BY - Namensnennung 4.0 International</licence>
    <author>Maja Franz</author>
    <author>Lucas Wolf</author>
    <author>Maniraman Periyasamy</author>
    <author>Christian Ufrecht</author>
    <author>Daniel D. Scherer</author>
    <author>Axel Plinge</author>
    <author>Christopher Mutschler</author>
    <author>Wolfgang Mauerer</author>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Artificial Intelligence</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Computer Science</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Quantum Physics</value>
    </subject>
    <collection role="institutes" number="FakIM">Fakultät Informatik und Mathematik</collection>
    <collection role="othforschungsschwerpunkt" number="16311">Digitalisierung</collection>
    <collection role="oaweg" number="">Hybrid Open Access - OA-Veröffentlichung in einer Subskriptionszeitschrift/-medium</collection>
    <collection role="oaweg" number="">Corresponding author der OTH Regensburg</collection>
    <collection role="institutes" number="">Labor für Digitalisierung (LFD)</collection>
  </doc>
  <doc>
    <id>3638</id>
    <completedYear/>
    <publishedYear>2020</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst>104</pageFirst>
    <pageLast/>
    <pageNumber/>
    <edition/>
    <issue>1</issue>
    <volume>4</volume>
    <type>article</type>
    <publisherName>DIGITALE WELT Academy c/o Ludwig-Maximilians-Universität München</publisherName>
    <publisherPlace>München</publisherPlace>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Towards Understanding Approximation Complexity on a Quantum Annealer</title>
    <abstract language="eng">Many industrially relevant problems can be deterministically solved by computers in principle, but are intractable in practice, as the seminal P/NP dichotomy of complexity theory and Cobham’s thesis testify. For the many NP-complete problems, industry needs to resort to using heuristics or approximation algorithms. For approximation algorithms, there is a more refined classification in complexity classes that goes beyond the simple P/NP dichotomy. As it is well known, approximation classes form a hierarchy, that is, FPTAS \subseteq  PTAS \subseteq  APX \subseteq  NPO. This classification gives a more realistic notion of complexity but—unless unexpected breakthroughs happen for fundamental problems like P = NP or related questions— there is no known efficient algorithm that can solve such problems exactly on a realistic computer. Therefore, new ways of computations are sought. Recently, considerable hope was placed on the possible computational powers of quantum computers and quantum annealing (QA) in particular. However, the precise benefits of such a drastic shift in hardware are still unchartered territory to a good extent. Firstly, the exact relations between classical and quantum complexity classes pose many open questions, and secondly, technical details of formulating and implementing quantum algorithms play a crucial role in real-world applications. Guided by the hierarchy of classical optimisation complexity classes, we discuss how to map problems of each class to a quantum annealer. Those problems are the Minimum Multiprocessor Scheduling (MMS) problem, the Minimum Vertex Cover (MVC) problem and the Maximum Independent Set (MIS) problem. We experimentally investigate if and how the degree of approximability influences implementation and run-time performance. Our experiments indicate a discrepancy between classical approximation complexity and QA behaviour: Problems MIS and MVC, members of APX respectively PTAS, exhibit better solution quality on a QA than MMS, which is in FPTAS, even despite the use of preprocessing the for latter. This leads to the hypothesis that traditional classifications do not immediately extend to the quantum annealing domain, at least when the properties of real-world devices are taken into account. A structural reason, why FPTAS problems do not show good solution quality, might be the use of an inequlity in the problem description of the FPTAS problems. Formulating those inequalities on a quantum hardware (mostly done by formulating a Quadratic Unconstrained Binary optimisation (QUBO) problem in form of a matrix) requires a lot of hardware space which makes finding an optimal solution more difficult. Reducing the density of a QUBO is possible by appropriately pruning QUBO matrices. For the problems considered in our evaluation, we find that the achievable solution quality on a real-world machine is unexpectedly robust against pruning, often up to ratios as high as 50% or more. Since quantum annealers are probabilistic machines by design, the loss in solution quality is only of subordinate relevance, especially considering that the pruning of QUBO matrices allows for solving larger problem instances on hardware of a given capacity. We quantitatively discuss the interplay between these factors.</abstract>
    <parentTitle language="eng">Digitale Welt</parentTitle>
    <identifier type="doi">10.1007/s42354-019-0244-1</identifier>
    <enrichment key="opus.import.date">2022-04-28T11:07:17+00:00</enrichment>
    <enrichment key="opus.source">sword</enrichment>
    <enrichment key="opus.import.user">importuser</enrichment>
    <enrichment key="BegutachtungStatus">peer-reviewed</enrichment>
    <enrichment key="ConferenceStatement">First International Symposium On Applied Artificial Intelligence (ISAAI’19)</enrichment>
    <licence>Keine Lizenz - Es gilt das deutsche Urheberrecht: § 53 UrhG</licence>
    <author>Irmi Sax</author>
    <author>Sebastian Feld</author>
    <author>Sebastian Zielinski</author>
    <author>Thomas Gabor</author>
    <author>Claudia Linnhoff-Popien</author>
    <author>Wolfgang Mauerer</author>
    <collection role="institutes" number="FakIM">Fakultät Informatik und Mathematik</collection>
    <collection role="othforschungsschwerpunkt" number="16311">Digitalisierung</collection>
    <collection role="institutes" number="">Labor für Digitalisierung (LFD)</collection>
  </doc>
  <doc>
    <id>3461</id>
    <completedYear/>
    <publishedYear>2020</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst>56</pageFirst>
    <pageLast>60</pageLast>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume/>
    <type>conferenceobject</type>
    <publisherName>RWTH Aachen</publisherName>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Educating Future Software Architects in the Art and Science of Analysing Software Data.</title>
    <abstract language="eng">We report the design and teaching experience of a Master-level seminar course on quantitative and empirical software engineering. The course combines elements of traditional literature seminars with active learning by scientific project work, in particular quantitative mixed-method analyses of open source systems. It also provides short introductions and refreshers to data mining and statistical analysis, and discusses the nature and practice of scientific knowledge inference. Student presentations of published research, augmented by summary reports, bridge to standard seminars. We discuss our educational goals and the course structure derived from them. We review research questions addressed by students in mini research reports, and analyse them as tokens on how junior-level software engineers perceive the potential of empirical software engineering research. We assess challenges faced, and discuss possible solutions.</abstract>
    <parentTitle language="eng">SEUH 2020: Software Engineering im Unterricht der Hochschulen, Tagungsband des 17. Workshops "Software Engineering im Unterricht der Hochschulen", Innsbruck, Österreich, 26. - 27.02.2020</parentTitle>
    <identifier type="url">http://ceur-ws.org/Vol-2531/paper10.pdf</identifier>
    <enrichment key="opus.import.date">2022-04-10T09:34:41+00:00</enrichment>
    <enrichment key="opus.source">sword</enrichment>
    <enrichment key="opus.import.user">importuser</enrichment>
    <enrichment key="OtherSeries">CEUR workshop proceedings ; 2531</enrichment>
    <enrichment key="BegutachtungStatus">peer-reviewed</enrichment>
    <licence>Creative Commons - CC BY - Namensnennung 4.0 International</licence>
    <author>Wolfgang Mauerer</author>
    <author>Stefanie Scherzinger</author>
    <collection role="institutes" number="FakIM">Fakultät Informatik und Mathematik</collection>
    <collection role="othforschungsschwerpunkt" number="16311">Digitalisierung</collection>
    <collection role="institutes" number="">Labor für Digitalisierung (LFD)</collection>
  </doc>
  <doc>
    <id>2408</id>
    <completedYear/>
    <publishedYear>2022</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst/>
    <pageLast/>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume/>
    <type>preprint</type>
    <publisherName/>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Static Hardware Partitioning on RISC-V - Shortcomings, Limitations, and Prospects</title>
    <abstract language="eng">On embedded processors that are increasingly equipped with multiple CPU cores, static hardware partitioning is an established means of consolidating and isolating workloads onto single chips. This architectural pattern is suitable for mixed-criticality workloads that need to satisfy both, real-time and safety requirements, given suitable hardware properties. In this work, we focus on exploiting contemporary virtualisation mechanisms to achieve freedom from interference respectively isolation between workloads. Possibilities to achieve temporal and spatial isolation-while maintaining real-time capabilities-include statically partitioning resources, avoiding the sharing of devices, and ascertaining zero interventions of superordinate control structures. This eliminates overhead due to hardware partitioning, but implies certain hardware capabilities that are not yet fully implemented in contemporary standard systems. To address such hardware limitations, the customisable and configurable RISC-V instruction set architecture offers the possibility of swift, unrestricted modifications. We present findings on the current RISC-V specification and its implementations that necessitate interventions of superordinate control structures. We identify numerous issues adverse to implementing our goal of achieving zero interventions respectively zero overhead: On the design level, and especially with regards to handling interrupts. Based on micro-benchmark measurements, we discuss the implications of our findings, and argue how they can provide a basis for future extensions and improvements of the RISC-V architecture.</abstract>
    <identifier type="doi">10.48550/arXiv.2208.02703</identifier>
    <identifier type="arxiv">arXiv:2208.02703v1</identifier>
    <enrichment key="ConferenceStatement">IEEE 8th World Forum on the Internet of Things (WF-IoT), Nov. 03 - 18, 2022, Yokohama, Japan</enrichment>
    <licence>Keine Lizenz - Es gilt das deutsche Urheberrecht: § 53 UrhG</licence>
    <author>Ralf Ramsauer</author>
    <author>Stefan Huber</author>
    <author>Konrad Schwarz</author>
    <author>Jan Kiszka</author>
    <author>Wolfgang Mauerer</author>
    <collection role="institutes" number="FakIM">Fakultät Informatik und Mathematik</collection>
    <collection role="othforschungsschwerpunkt" number="16311">Digitalisierung</collection>
    <collection role="institutes" number="">Labor für Digitalisierung (LFD)</collection>
  </doc>
  <doc>
    <id>3898</id>
    <completedYear/>
    <publishedYear>2012</publishedYear>
    <thesisYearAccepted/>
    <language>deu</language>
    <pageFirst/>
    <pageLast/>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume/>
    <type>preprint</type>
    <publisherName/>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="deu">Sicherheit von Android-Systemen</title>
    <author>S. Oberthür</author>
    <author>Wolfgang Mauerer</author>
    <collection role="institutes" number="FakIM">Fakultät Informatik und Mathematik</collection>
    <collection role="othpublikationsherkunft" number="">Externe Publikationen</collection>
    <collection role="othforschungsschwerpunkt" number="16311">Digitalisierung</collection>
    <collection role="institutes" number="">Labor für Digitalisierung (LFD)</collection>
  </doc>
  <doc>
    <id>3896</id>
    <completedYear/>
    <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">Supershrink Linux – and beyond</title>
    <parentTitle language="eng">Embedded Linux Conference Europe (Dublin), 2015</parentTitle>
    <author>Wolfgang Mauerer</author>
    <collection role="institutes" number="FakIM">Fakultät Informatik und Mathematik</collection>
    <collection role="othpublikationsherkunft" number="">Externe Publikationen</collection>
    <collection role="othforschungsschwerpunkt" number="16311">Digitalisierung</collection>
    <collection role="institutes" number="">Labor für Digitalisierung (LFD)</collection>
  </doc>
  <doc>
    <id>3460</id>
    <completedYear/>
    <publishedYear>2021</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst>2697</pageFirst>
    <pageLast>2700</pageLast>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume/>
    <type>conferenceobject</type>
    <publisherName>IEEE</publisherName>
    <publisherPlace>Piscataway, NJ</publisherPlace>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">DeBinelle: Semantic Patches for Coupled Database-Application Evolution</title>
    <abstract language="eng">Databases are at the core of virtually any software product. Changes to database schemas cannot be made in isolation, as they are intricately coupled with application code. Such couplings enforce collateral evolution, which is a recognised, important research problem. In this demonstration, we show a new dimension to this problem, in software that supports alternative database backends: vendor-specific SQL dialects necessitate a simultaneous evolution of both, database schema and program code, for all supported DB variants. These near-same changes impose substantial manual effort for software developers. We introduce DeBinelle, a novel framework and domain-specific language for semantic patches that abstracts DB-variant schema changes and coupled program code into a single, unified representation. DeBinelle further offers a novel alternative to manually evolving coupled schemas and code. DeBinelle considerably extends established, seminal results in software engineering research, supporting several programming languages, and the many dialects of SQL. It effectively eliminates the need to perform vendor-specific changes, replacing them with intuitive semantic patches. Our demo of DeBinelle is based on real-world use cases from reference systems for schema evolution.</abstract>
    <parentTitle language="eng">2021 IEEE 37th International Conference on Data Engineering (ICDE 2021): 19-22 April 2021, Chania, Greece</parentTitle>
    <identifier type="isbn">978-1-7281-9184-3</identifier>
    <identifier type="doi">10.1109/ICDE51399.2021.00307</identifier>
    <enrichment key="opus.import.date">2022-04-10T09:34:41+00:00</enrichment>
    <enrichment key="opus.source">sword</enrichment>
    <enrichment key="opus.import.user">importuser</enrichment>
    <enrichment key="BegutachtungStatus">peer-reviewed</enrichment>
    <licence>Keine Lizenz - Es gilt das deutsche Urheberrecht: § 53 UrhG</licence>
    <author>Stefanie Scherzinger</author>
    <author>Wolfgang Mauerer</author>
    <author>Haridimos Kondylakis</author>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>database management systems</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>databases</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>evolution</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>programming language semantics</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>semantic patches</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>software product lines</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>specification languages</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>SQL</value>
    </subject>
    <collection role="institutes" number="FakIM">Fakultät Informatik und Mathematik</collection>
    <collection role="othforschungsschwerpunkt" number="16311">Digitalisierung</collection>
    <collection role="institutes" number="">Labor für Digitalisierung (LFD)</collection>
  </doc>
  <doc>
    <id>3465</id>
    <completedYear/>
    <publishedYear>2022</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst>119</pageFirst>
    <pageLast>134</pageLast>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume/>
    <type>conferenceobject</type>
    <publisherName>Springer</publisherName>
    <publisherPlace>Cham, Switzerland</publisherPlace>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Tell-Tale Tail Latencies: Pitfalls and Perils in Database Benchmarking</title>
    <abstract language="eng">The performance of database systems is usually characterised by their average-case (i.e., throughput) behaviour in standardised or de-facto standard benchmarks like TPC-X or YCSB. While tails of the latency (i.e., response time) distribution receive considerably less attention, they have been identified as a threat to the overall system performance: In large-scale systems, even a fraction of requests delayed can build up into delays perceivable by end users. To eradicate large tail latencies from database systems, the ability to faithfully record them, and likewise pinpoint them to the root causes, is imminently required. In this paper, we address the challenge of measuring tail latencies using standard benchmarks, and identify subtle perils and pitfalls. In particular, we demonstrate how Java-based benchmarking approaches can substantially distort tail latency observations, and discuss how the discovery of such problems is inhibited by the common focus on throughput performance. We make a case for purposefully re-designing database benchmarking harnesses based on these observations to arrive at faithful characterisations of database performance from multiple important angles.</abstract>
    <parentTitle language="eng">Performance evaluation and benchmarking, 13th TPC Technology Conference (TPCTC 2021): Copenhagen, Denmark, August 20, 2021, Revised Selected Papers</parentTitle>
    <identifier type="isbn">9783030944377</identifier>
    <identifier type="doi">10.1007/978-3-030-94437-7_8</identifier>
    <enrichment key="opus.import.date">2022-04-10T09:34:41+00:00</enrichment>
    <enrichment key="opus.source">sword</enrichment>
    <enrichment key="opus.import.user">importuser</enrichment>
    <enrichment key="BegutachtungStatus">peer-reviewed</enrichment>
    <enrichment key="OtherSeries">Lecture Notes in Computer Science; vol 13169</enrichment>
    <licence>Keine Lizenz - Es gilt das deutsche Urheberrecht: § 53 UrhG</licence>
    <author>Michael Fruth</author>
    <author>Stefanie Scherzinger</author>
    <author>Wolfgang Mauerer</author>
    <author>Ralf Ramsauer</author>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Benchmark harness</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Database benchmarks</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Tail latencies</value>
    </subject>
    <collection role="institutes" number="FakIM">Fakultät Informatik und Mathematik</collection>
    <collection role="othforschungsschwerpunkt" number="16311">Digitalisierung</collection>
    <collection role="institutes" number="">Labor für Digitalisierung (LFD)</collection>
  </doc>
  <doc>
    <id>3458</id>
    <completedYear/>
    <publishedYear>2020</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst>108</pageFirst>
    <pageLast>117</pageLast>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume/>
    <type>conferenceobject</type>
    <publisherName>Association for Computing Machinery</publisherName>
    <publisherPlace>New York, NY, United States</publisherPlace>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Approximate approximation on a quantum annealer</title>
    <abstract language="eng">Many problems of industrial interest are NP-complete, and quickly exhaust resources of computational devices with increasing input sizes. Quantum annealers (QA) are physical devices that aim at this class of problems by exploiting quantum mechanical properties of nature. However, they compete with efficient heuristics and probabilistic or randomised algorithms on classical machines that allow for finding approximate solutions to large NP-complete problems. While first implementations of QA have become commercially available, their practical benefits are far from fully explored. To the best of our knowledge, approximation techniques have not yet received substantial attention. In this paper, we explore how problems' approximate versions of varying degree can be systematically constructed for quantum annealer programs, and how this influences result quality or the handling of larger problem instances on given set of qubits. We illustrate various approximation techniques on both, simulations and real QA hardware, on different seminal problems, and interpret the results to contribute towards a better understanding of the real-world power and limitations of current-state and future quantum computing.</abstract>
    <parentTitle language="eng">Proceedings of the 17th ACM International Conference on Computing Frontiers (CF '20): Catania Sicily Italy 11.05.2020 -13.05.2020</parentTitle>
    <identifier type="isbn">9781450379564</identifier>
    <identifier type="doi">10.1145/3387902.3392635</identifier>
    <enrichment key="opus.import.date">2022-04-10T09:34:41+00:00</enrichment>
    <enrichment key="opus.source">sword</enrichment>
    <enrichment key="opus.import.user">importuser</enrichment>
    <enrichment key="BegutachtungStatus">peer-reviewed</enrichment>
    <licence>Keine Lizenz - Es gilt das deutsche Urheberrecht: § 53 UrhG</licence>
    <author>Irmi Sax</author>
    <author>Sebastian Feld</author>
    <author>Sebastian Zielinski</author>
    <author>Thomas Gabor</author>
    <author>Claudia Linnhoff-Popien</author>
    <author>Wolfgang Mauerer</author>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>approximation algorithms analysis</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Approximation, NP-complete problems</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Quantum Annealin</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>quantum computation</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Simplifying Qubos</value>
    </subject>
    <collection role="institutes" number="FakIM">Fakultät Informatik und Mathematik</collection>
    <collection role="othforschungsschwerpunkt" number="16311">Digitalisierung</collection>
    <collection role="institutes" number="">Labor für Digitalisierung (LFD)</collection>
  </doc>
  <doc>
    <id>3468</id>
    <completedYear/>
    <publishedYear>2022</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst>1247</pageFirst>
    <pageLast>1248</pageLast>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume/>
    <type>conferenceobject</type>
    <publisherName>IEEE</publisherName>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">1-2-3 Reproducibility for Quantum Software Experiments</title>
    <abstract language="eng">Various fields of science face a reproducibility crisis. For quantum software engineering as an emerging field, it is therefore imminent to focus on proper reproducibility engineering from the start. Yet the provision of reproduction packages is almost universally lacking. Actionable advice on how to build such packages is rare, particularly unfortunate in a field with many contributions from researchers with backgrounds outside computer science. In this article, we argue how to rectify this deficiency by proposing a 1-2-3~approach to reproducibility engineering for quantum software experiments: Using a meta-generation mechanism, we generate DOI-safe, long-term functioning and dependency-free reproduction packages. They are designed to satisfy the requirements of professional and learned societies solely on the basis of project-specific research artefacts (source code, measurement and configuration data), and require little temporal investment by researchers. Our scheme ascertains long-term traceability even when the quantum processor itself is no longer accessible. By drastically lowering the technical bar, we foster the proliferation of reproduction packages in quantum software experiments and ease the inclusion of non-CS researchers entering the field.</abstract>
    <parentTitle language="eng">2022 IEEE International Conference on Software Analysis, Evolution and Reengineering (SANER), Honolulu, HI, USA, 15-18 March 2022</parentTitle>
    <identifier type="doi">10.1109/SANER53432.2022.00148</identifier>
    <enrichment key="opus.import.date">2022-04-10T09:34:41+00:00</enrichment>
    <enrichment key="opus.source">sword</enrichment>
    <enrichment key="opus.import.user">importuser</enrichment>
    <enrichment key="BegutachtungStatus">peer-reviewed</enrichment>
    <licence>Creative Commons - CC BY - Namensnennung 4.0 International</licence>
    <licence>Keine Lizenz - Es gilt das deutsche Urheberrecht: § 53 UrhG</licence>
    <author>Wolfgang Mauerer</author>
    <author>Stefanie Scherzinger</author>
    <subject>
      <language>deu</language>
      <type>uncontrolled</type>
      <value>Computer Science</value>
    </subject>
    <subject>
      <language>deu</language>
      <type>uncontrolled</type>
      <value>Quantum Physics</value>
    </subject>
    <subject>
      <language>deu</language>
      <type>uncontrolled</type>
      <value>Software Engineering</value>
    </subject>
    <collection role="institutes" number="FakIM">Fakultät Informatik und Mathematik</collection>
    <collection role="othforschungsschwerpunkt" number="16311">Digitalisierung</collection>
    <collection role="institutes" number="">Labor für Digitalisierung (LFD)</collection>
  </doc>
  <doc>
    <id>3464</id>
    <completedYear/>
    <publishedYear>2020</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst>210</pageFirst>
    <pageLast>219</pageLast>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume>12584</volume>
    <type>conferenceobject</type>
    <publisherName>Springer</publisherName>
    <publisherPlace>Cham</publisherPlace>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Replicability and Reproducibility of a Schema Evolution Study in Embedded Databases</title>
    <abstract language="eng">Ascertaining the feasibility of independent falsification or repetition of published results is vital to the scientific process, and replication or reproduction experiments are routinely performed in many disciplines. Unfortunately, such studies are only scarcely available in database research, with few papers dedicated to re-evaluating published results. In this paper, we conduct a case study on replicating and reproducing a study on schema evolution in embedded databases. We can exactly repeat the outcome for one out of four database applications studied, and come close in two further cases. By reporting results, efforts, and obstacles encountered, we hope to increase appreciation for the substantial efforts required to ensure reproducibility. By discussing minutiae details required to ascertain reproducible work, we argue that such important, but often ignored aspects of scientific work should receive more credit in the evaluation of future research.</abstract>
    <parentTitle language="eng">Advances in conceptual modeling: ER 2020 Workshops CMAI, CMLS, CMOMM4FAIR, CoMoNoS, EmpER, Vienna, Austria, November 3-6, 2020, Proceedings</parentTitle>
    <identifier type="isbn">978-3-030-65846-5</identifier>
    <identifier type="doi">10.1007/978-3-030-65847-2_19</identifier>
    <enrichment key="opus.import.date">2022-04-10T09:34:41+00:00</enrichment>
    <enrichment key="opus.source">sword</enrichment>
    <enrichment key="opus.import.user">importuser</enrichment>
    <enrichment key="OtherSeries">Lecture Notes in Computer Science ; 12584</enrichment>
    <enrichment key="BegutachtungStatus">peer-reviewed</enrichment>
    <licence>Keine Lizenz - Es gilt das deutsche Urheberrecht: § 53 UrhG</licence>
    <author>Dimitri Braininger</author>
    <author>Wolfgang Mauerer</author>
    <author>Stefanie Scherzinger</author>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>replicability</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>reproducibility</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>schema evolution</value>
    </subject>
    <collection role="institutes" number="FakIM">Fakultät Informatik und Mathematik</collection>
    <collection role="othforschungsschwerpunkt" number="16311">Digitalisierung</collection>
    <collection role="institutes" number="">Labor für Digitalisierung (LFD)</collection>
  </doc>
  <doc>
    <id>3463</id>
    <completedYear/>
    <publishedYear>2020</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst>445</pageFirst>
    <pageLast>450</pageLast>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume/>
    <type>conferenceobject</type>
    <publisherName>Association for Computing Machinery</publisherName>
    <publisherPlace>New York, NY</publisherPlace>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Quantum Annealing-Based Software Components</title>
    <abstract language="eng">Quantum computers have the potential of solving problems more efficiently than classical computers. While first commercial prototypes have become available, the performance of such machines in practical application is still subject to exploration. Quantum computers will not entirely replace classical machines, but serve as accelerators for specific problems. This necessitates integrating quantum computational primitives into existing applications. In this paper, we perform a case study on how to augment existing software with quantum computational primitives for the Boolean satisfiability problem (SAT) implemented using a quantum annealer (QA). We discuss relevant quality measures for quantum components, and show that mathematically equivalent, but structurally different ways of transforming SAT to a QA can lead to substantial differences regarding these qualities. We argue that engineers need to be aware that (and which) details, although they may be less relevant in traditional software engineering, require considerable attention in quantum computing.</abstract>
    <parentTitle language="eng">Proceedings of the IEEE/ACM 42nd International Conference on Software Engineering Workshops (ICSE'20): Seoul Republic of Korea 27.06.2020 - 19.07.2020</parentTitle>
    <identifier type="isbn">9781450379632</identifier>
    <identifier type="doi">10.1145/3387940.3391472</identifier>
    <enrichment key="opus.import.date">2022-04-10T09:34:41+00:00</enrichment>
    <enrichment key="opus.source">sword</enrichment>
    <enrichment key="opus.import.user">importuser</enrichment>
    <enrichment key="BegutachtungStatus">peer-reviewed</enrichment>
    <licence>Keine Lizenz - Es gilt das deutsche Urheberrecht: § 53 UrhG</licence>
    <author>Tom Krüger</author>
    <author>Wolfgang Mauerer</author>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Boolean Satisfiability</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Experimental Performance Analysis</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Quantum Annealin</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Quantum computing</value>
    </subject>
    <collection role="institutes" number="FakIM">Fakultät Informatik und Mathematik</collection>
    <collection role="othforschungsschwerpunkt" number="16311">Digitalisierung</collection>
    <collection role="institutes" number="">Labor für Digitalisierung (LFD)</collection>
  </doc>
  <doc>
    <id>3459</id>
    <completedYear/>
    <publishedYear>2019</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst>23</pageFirst>
    <pageLast>35</pageLast>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume>11413</volume>
    <type>conferenceobject</type>
    <publisherName>Springer International Publishing</publisherName>
    <publisherPlace>Cham</publisherPlace>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Assessing Solution Quality of 3SAT on a Quantum Annealing Platform</title>
    <parentTitle language="eng">Quantum Technology and Optimization Problems : First International Workshop, QTOP 2019, Munich, Germany, March 18, 2019, Proceedings</parentTitle>
    <identifier type="isbn">978-3-030-14081-6</identifier>
    <identifier type="doi">10.1007/978-3-030-14082-3_3</identifier>
    <enrichment key="opus.import.date">2022-04-10T09:34:41+00:00</enrichment>
    <enrichment key="opus.source">sword</enrichment>
    <enrichment key="opus.import.user">importuser</enrichment>
    <enrichment key="OtherSeries">Lecture Notes in Computer Science ; 11413</enrichment>
    <enrichment key="BegutachtungStatus">peer-reviewed</enrichment>
    <licence>Keine Lizenz - Es gilt das deutsche Urheberrecht: § 53 UrhG</licence>
    <author>Thomas Gabor</author>
    <author>Sebastian Zielinski</author>
    <author>Sebastian Feld</author>
    <author>Christoph Roch</author>
    <author>Christian Seidel</author>
    <author>Florian Neukart</author>
    <author>Isabella Galter</author>
    <author>Wolfgang Mauerer</author>
    <author>Claudia Linnhoff-Popien</author>
    <collection role="institutes" number="FakIM">Fakultät Informatik und Mathematik</collection>
    <collection role="othforschungsschwerpunkt" number="16311">Digitalisierung</collection>
    <collection role="institutes" number="">Labor für Digitalisierung (LFD)</collection>
  </doc>
  <doc>
    <id>3637</id>
    <completedYear/>
    <publishedYear>2021</publishedYear>
    <thesisYearAccepted/>
    <language>deu</language>
    <pageFirst>816</pageFirst>
    <pageLast>817</pageLast>
    <pageNumber/>
    <edition/>
    <issue>10</issue>
    <volume>28</volume>
    <type>article</type>
    <publisherName>Zentrum für Wissenschaftsmanagement e.V. (ZWM) </publisherName>
    <publisherPlace/>
    <creatingCorporation>Deutscher Hochschullehrerverband</creatingCorporation>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="deu">Digitale Forschungswerkzeuge : Nachhaltigkeit für Software und Daten</title>
    <abstract language="deu">Die wissenschaftliche Reproduktionskrise hat den Blick auf digitale Forschungswerkzeuge intensiviert. Auch wenn der Mehraufwand für Reproduzierbarkeit und Zugänglichkeit zunehmend anerkannt wird, existieren noch Defizite in der Umsetzung, wenn es darum geht, die Datenbasis und Forschungswerkzeuge verfügbar zu machen</abstract>
    <parentTitle language="deu">Forschung &amp; Lehre (Forschung und Lehre)</parentTitle>
    <identifier type="url">https://www.wissenschaftsmanagement-online.de/system/files/downloads-wimoarticle/2021-10_WIMO_Digitale_Forschungswerkzeuge_Mauerer_Scherzinger.pdf</identifier>
    <enrichment key="opus.import.date">2022-04-28T11:07:17+00:00</enrichment>
    <enrichment key="opus.source">sword</enrichment>
    <enrichment key="opus.import.user">importuser</enrichment>
    <enrichment key="BegutachtungStatus">peer-reviewed</enrichment>
    <licence>Keine Lizenz - Es gilt das deutsche Urheberrecht: § 53 UrhG</licence>
    <author>Wolfgang Mauerer</author>
    <author>Stefanie Scherzinger</author>
    <collection role="institutes" number="FakIM">Fakultät Informatik und Mathematik</collection>
    <collection role="othforschungsschwerpunkt" number="16311">Digitalisierung</collection>
    <collection role="institutes" number="">Labor für Digitalisierung (LFD)</collection>
  </doc>
  <doc>
    <id>3479</id>
    <completedYear/>
    <publishedYear>2021</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst>1</pageFirst>
    <pageLast>17</pageLast>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume>8</volume>
    <type>article</type>
    <publisherName>Springer</publisherName>
    <publisherPlace/>
    <creatingCorporation>Springer</creatingCorporation>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Industry quantum computing applications</title>
    <abstract language="eng">Quantum computing promises to overcome computational limitations with better and faster solutions for optimization, simulation, and machine learning problems. Europe and Germany are in the process of successfully establishing research and funding programs with the objective to dvance the technology’s ecosystem and industrialization, thereby ensuring digital sovereignty, security, and competitiveness. Such an ecosystem comprises hardware/software solution providers, system integrators, and users from research institutions, start-ups, and industry. The vision of the Quantum Technology and Application Consortium (QUTAC) is to establish and advance the quantum computing ecosystem, supporting the ambitious goals of the German government and various research programs. QUTAC is comprised of ten members representing different industries, in particular automotive manufacturing, chemical and pharmaceutical production, insurance, and technology. In this paper, we survey the current state of quantum computing in these sectors as well as the aerospace industry and identify the contributions of QUTAC to the ecosystem. We propose an application-centric approach for the industrialization of the technology based on proven business impact. This paper identifies 24 different use cases. By formalizing high-value use cases into well-described reference problems and benchmarks, we will guide technological progress and eventually commercialization. Our results will be beneficial to all ecosystem participants, including suppliers, system integrators, software developers, users, policymakers, funding program managers, and investors.</abstract>
    <parentTitle language="eng">EPJ Quantum Technology</parentTitle>
    <identifier type="doi">10.1140/epjqt/s40507-021-00114-x</identifier>
    <enrichment key="opus.import.date">2022-04-10T09:34:41+00:00</enrichment>
    <enrichment key="opus.source">sword</enrichment>
    <enrichment key="opus.import.user">importuser</enrichment>
    <enrichment key="BegutachtungStatus">peer-reviewed</enrichment>
    <licence>Creative Commons - CC BY - Namensnennung 4.0 International</licence>
    <author>Andreas Bayerstadler</author>
    <author>Guillaume Becquin</author>
    <author>Julia Binder</author>
    <author>Thierry Botter</author>
    <author>Hans Ehm</author>
    <author>Thomas Ehmer</author>
    <author>Marvin Erdmann</author>
    <author>Norbert Gaus</author>
    <author>Philipp Harbach</author>
    <author>Maximilian Hess</author>
    <author>Johannes Klepsch</author>
    <author>Martin Leib</author>
    <author>Sebastian Luber</author>
    <author>Andre Luckow</author>
    <author>Maximilian Mansky</author>
    <author>Wolfgang Mauerer</author>
    <author>Florian Neukart</author>
    <author>Christoph Niedermeier</author>
    <author>Lilly Palackal</author>
    <author>Ruben Pfeiffer</author>
    <author>Carsten Polenz</author>
    <author>Johanna Sepulveda</author>
    <author>Tammo Sievers</author>
    <author>Brian Standen</author>
    <author>Michael Streif</author>
    <author>Thomas Strohm</author>
    <author>Clemens Utschig-Utschig</author>
    <author>Daniel Volz</author>
    <author>Horst Weiss</author>
    <author>Fabian Winter</author>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Benchmarks</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Industry application</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Quantum computing</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>QUTAC</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Reference problems</value>
    </subject>
    <collection role="institutes" number="FakIM">Fakultät Informatik und Mathematik</collection>
    <collection role="oaweg" number="">Gold Open Access- Erstveröffentlichung in einem/als Open-Access-Medium</collection>
    <collection role="othforschungsschwerpunkt" number="16311">Digitalisierung</collection>
    <collection role="institutes" number="">Labor für Digitalisierung (LFD)</collection>
  </doc>
  <doc>
    <id>3643</id>
    <completedYear/>
    <publishedYear>2013</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst/>
    <pageLast/>
    <pageNumber/>
    <edition/>
    <issue>5</issue>
    <volume>15</volume>
    <type>article</type>
    <publisherName>IOP</publisherName>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Theory of quantum frequency conversion and type-II parametric down-conversion in the high-gain regime</title>
    <abstract language="eng">Frequency conversion (FC) and type-II parametric down-conversion (PDC) processes serve as basic building blocks for the implementation of quantum optical experiments: type-II PDC enables the efficient creation of quantum states such as photon-number states and Einstein–Podolsky–Rosen (EPR)-states. FC gives rise to technologies enabling efficient atom–photon coupling, ultrafast pulse gates and enhanced detection schemes. However, despite their widespread deployment, their theoretical treatment remains challenging. Especially the multi-photon components in the high-gain regime as well as the explicit time-dependence of the involved Hamiltonians hamper an efficient theoretical description of these nonlinear optical processes. In this paper, we investigate these effects and put forward two models that enable a full description of FC and type-II PDC in the high-gain regime. We present a rigorous numerical model relying on the solution of coupled integro-differential equations that covers the complete dynamics of the process. As an alternative, we develop a simplified model that, at the expense of neglecting time-ordering effects, enables an analytical solution. While the simplified model approximates the correct solution with high fidelity in a broad parameter range, sufficient for many experimental situations, such as FC with low efficiency, entangled photon-pair generation and the heralding of single photons from type-II PDC, our investigations reveal that the rigorous model predicts a decreased performance for FC processes in quantum pulse gate applications and an enhanced EPR-state generation rate during type-II PDC, when EPR squeezing values above 12 dB are considered.</abstract>
    <parentTitle language="eng">New Journal of Physics</parentTitle>
    <identifier type="doi">10.1088/1367-2630/15/5/053038</identifier>
    <enrichment key="opus.import.date">2022-04-28T11:07:17+00:00</enrichment>
    <enrichment key="opus.source">sword</enrichment>
    <enrichment key="opus.import.user">importuser</enrichment>
    <enrichment key="BegutachtungStatus">peer-reviewed</enrichment>
    <enrichment key="opus.doi.autoCreate">false</enrichment>
    <enrichment key="opus.urn.autoCreate">false</enrichment>
    <author>Andreas Christ</author>
    <author>Benjamin Brecht</author>
    <author>Wolfgang Mauerer</author>
    <author>Christine Silberhorn</author>
    <collection role="institutes" number="FakIM">Fakultät Informatik und Mathematik</collection>
    <collection role="othpublikationsherkunft" number="">Externe Publikationen</collection>
    <collection role="oaweg" number="">Gold Open Access- Erstveröffentlichung in einem/als Open-Access-Medium</collection>
    <collection role="othforschungsschwerpunkt" number="16311">Digitalisierung</collection>
  </doc>
  <doc>
    <id>3645</id>
    <completedYear/>
    <publishedYear>2010</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst>711</pageFirst>
    <pageLast>715</pageLast>
    <pageNumber/>
    <edition/>
    <issue>10</issue>
    <volume>4</volume>
    <type>article</type>
    <publisherName>Springer</publisherName>
    <publisherPlace/>
    <creatingCorporation>Springer</creatingCorporation>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">A generator for unique quantum random numbers based on vacuum states</title>
    <abstract language="eng">Random numbers are a valuable component in diverse applications that range from simulations over gambling to cryptography. The quest for true randomness in these applications has engendered a large variety of different proposals for producing random numbers based on the foundational unpredictability of quantum mechanics4,5,6,7,8,9,10,11. However, most approaches do not consider that a potential adversary could have knowledge about the generated numbers, so the numbers are not verifiably random and unique12,13,14,15. Here we present a simple experimental setup based on homodyne measurements that uses the purity of a continuous-variable quantum vacuum state to generate unique random numbers. We use the intrinsic randomness in measuring the quadratures of a mode in the lowest energy vacuum state, which cannot be correlated to any other state. The simplicity of our source, combined with its verifiably unique randomness, are important attributes for achieving high-reliability, high-speed and low-cost quantum random number generators.</abstract>
    <parentTitle language="eng">Nature Photonics</parentTitle>
    <identifier type="doi">10.1038/nphoton.2010.197</identifier>
    <enrichment key="opus.import.date">2022-04-28T11:07:17+00:00</enrichment>
    <enrichment key="opus.source">sword</enrichment>
    <enrichment key="opus.import.user">importuser</enrichment>
    <enrichment key="BegutachtungStatus">peer-reviewed</enrichment>
    <enrichment key="opus.doi.autoCreate">false</enrichment>
    <enrichment key="opus.urn.autoCreate">false</enrichment>
    <licence>Keine Lizenz - Es gilt das deutsche Urheberrecht: § 53 UrhG</licence>
    <author>Christian Gabriel</author>
    <author>Christoffer Wittmann</author>
    <author>Denis Sych</author>
    <author>Ruifang Dong</author>
    <author>Wolfgang Mauerer</author>
    <author>Ulrik L. Andersen</author>
    <author>Christoph Marquardt</author>
    <author>Gerd Leuchs</author>
    <collection role="institutes" number="FakIM">Fakultät Informatik und Mathematik</collection>
    <collection role="othpublikationsherkunft" number="">Externe Publikationen</collection>
    <collection role="othforschungsschwerpunkt" number="16311">Digitalisierung</collection>
    <collection role="institutes" number="">Labor für Digitalisierung (LFD)</collection>
  </doc>
  <doc>
    <id>3642</id>
    <completedYear/>
    <publishedYear>2013</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst>196</pageFirst>
    <pageLast>203</pageLast>
    <pageNumber/>
    <edition/>
    <issue>5</issue>
    <volume>55</volume>
    <type>article</type>
    <publisherName>de Gruyter</publisherName>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Open Source Engineering Processes</title>
    <abstract language="eng">Software engineering  in open source projectsfaces similar challenges as in traditional software development(coordination of and cooperation between contributors, changeand release management, quality assurance, . . .), but often usesdifferent means of solving them. This leads to some salientdistinctions between both worlds, especially with respect tocommunication and how technical issues are addressed. Thevariations within open source software (OSS) communities areconsiderable, and many different approaches are currently inuse, ranging from informal conventions to highly systematic,formally specified and rigidly applied processes. We discussthe archetypal best practises in the field, illustrate them bypresenting example projects, and provide a comparison to tradi-tional approaches.</abstract>
    <parentTitle language="eng">it - Information Technology</parentTitle>
    <additionalTitle language="deu">Open Source-Entwicklungsprozesse</additionalTitle>
    <identifier type="doi">10.1515/itit.2013.1008</identifier>
    <enrichment key="opus.import.date">2022-04-28T11:07:17+00:00</enrichment>
    <enrichment key="opus.source">sword</enrichment>
    <enrichment key="opus.import.user">importuser</enrichment>
    <enrichment key="BegutachtungStatus">peer-reviewed</enrichment>
    <enrichment key="opus.doi.autoCreate">false</enrichment>
    <enrichment key="opus.urn.autoCreate">false</enrichment>
    <licence>Keine Lizenz - Es gilt das deutsche Urheberrecht: § 53 UrhG</licence>
    <author>Wolfgang Mauerer</author>
    <author>Michael C. Jaeger</author>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Open-Source-Softwaretechnik</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Softwareentwicklungsprozesse</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Softwarereleases</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Linux</value>
    </subject>
    <collection role="institutes" number="FakIM">Fakultät Informatik und Mathematik</collection>
    <collection role="othpublikationsherkunft" number="">Externe Publikationen</collection>
    <collection role="othforschungsschwerpunkt" number="16311">Digitalisierung</collection>
    <collection role="oaweg" number="">Hybrid Open Access - OA-Veröffentlichung in einer Subskriptionszeitschrift/-medium</collection>
  </doc>
  <doc>
    <id>3646</id>
    <completedYear/>
    <publishedYear>2009</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst>432</pageFirst>
    <pageLast>441</pageLast>
    <pageNumber/>
    <edition/>
    <issue>2-3</issue>
    <volume>56</volume>
    <type>article</type>
    <publisherName>Taylor&amp;Francis</publisherName>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">A proposed testbed for detector tomography</title>
    <abstract language="deu">Measurement is the only part of a general quantum system that has yet to be characterised experimentally in a complete manner. Detector tomography provides a procedure for doing just this; an arbitrary measurement device can be fully characterised, and thus calibrated, in a systematic way without access to its components or its design. The result is a reconstructed POVM containing the measurement operators associated with each measurement outcome. We consider two detectors, a single-photon detector and a photon-number counter, and propose an easily realised experimental apparatus to perform detector tomography on them. We also present a method of visualising the resulting measurement operators.</abstract>
    <parentTitle language="eng">Journal of Modern Optics</parentTitle>
    <identifier type="doi">10.1080/09500340802304929</identifier>
    <enrichment key="opus.import.date">2022-04-28T11:07:17+00:00</enrichment>
    <enrichment key="opus.source">sword</enrichment>
    <enrichment key="opus.import.user">importuser</enrichment>
    <enrichment key="BegutachtungStatus">peer-reviewed</enrichment>
    <licence>Keine Lizenz - Es gilt das deutsche Urheberrecht: § 53 UrhG</licence>
    <author>Hendrik B. Coldenstrodt-Ronge</author>
    <author>Jeff S. Lundeen</author>
    <author>Kenny L. Pregnell</author>
    <author>Alvaro Feito</author>
    <author>Brian J. Smith</author>
    <author>Wolfgang Mauerer</author>
    <author>Christine Silberhorn</author>
    <author>Jens Eisert</author>
    <author>Martin B. Plenio</author>
    <author>Ian A. Walmsley</author>
    <collection role="institutes" number="FakIM">Fakultät Informatik und Mathematik</collection>
    <collection role="othpublikationsherkunft" number="">Externe Publikationen</collection>
    <collection role="othforschungsschwerpunkt" number="16311">Digitalisierung</collection>
    <collection role="institutes" number="">Labor für Digitalisierung (LFD)</collection>
  </doc>
  <doc>
    <id>3647</id>
    <completedYear/>
    <publishedYear>2009</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst/>
    <pageLast/>
    <pageNumber/>
    <edition/>
    <issue>5</issue>
    <volume>80</volume>
    <type>article</type>
    <publisherName>American Physical Society</publisherName>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">How colors influence numbers: Photon statistics of parametric down-conversion</title>
    <abstract language="eng">Parametric down-conversion (PDC) is a technique of ubiquitous experimental significance in the production of nonclassical, photon-number-correlated twin beams. Standard theory of PDC as a two-mode squeezing process predicts and homodyne measurements observe a thermal photon number distribution per beam. Recent experiments have obtained conflicting distributions. In this article, we explain the observation by an a priori theoretical model solely based on directly accessible physical quantities. We compare our predictions with experimental data and find excellent agreement.</abstract>
    <parentTitle language="eng">Physical Review A (Phys. Rev. A)</parentTitle>
    <identifier type="doi">10.1103/physreva.80.053815</identifier>
    <enrichment key="opus.import.date">2022-04-28T11:07:17+00:00</enrichment>
    <enrichment key="opus.source">sword</enrichment>
    <enrichment key="opus.import.user">importuser</enrichment>
    <enrichment key="BegutachtungStatus">peer-reviewed</enrichment>
    <licence>Keine Lizenz - Es gilt das deutsche Urheberrecht: § 53 UrhG</licence>
    <author>Wolfgang Mauerer</author>
    <author>Malte Avenhaus</author>
    <author>Wolfram Helwig</author>
    <author>Christine Silberhorn</author>
    <collection role="institutes" number="FakIM">Fakultät Informatik und Mathematik</collection>
    <collection role="othpublikationsherkunft" number="">Externe Publikationen</collection>
    <collection role="othforschungsschwerpunkt" number="16311">Digitalisierung</collection>
    <collection role="institutes" number="">Labor für Digitalisierung (LFD)</collection>
  </doc>
  <doc>
    <id>3641</id>
    <completedYear/>
    <publishedYear>2014</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst>1</pageFirst>
    <pageLast>7</pageLast>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume/>
    <type>article</type>
    <publisherName/>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Real-Time Android: Achieving determinism and ease of use</title>
    <parentTitle language="eng">Embedded Wold Conference; Nuremberg, Germany, February 25, 2014 - February 27, 2014</parentTitle>
    <identifier type="url">http://www.linuxtag.org/2012/fileadmin/www.linuxtag.org/slides/Gernot%20Hillier%20+%20Wolfgang%20Mauerer%20+%20Jan%20Sawallisch%20-%20Android_%20real-time%20for%20the%20rest%20of%20us.p416.pdf</identifier>
    <enrichment key="opus.import.date">2022-04-28T11:07:17+00:00</enrichment>
    <enrichment key="opus.source">sword</enrichment>
    <enrichment key="opus.import.user">importuser</enrichment>
    <licence>Keine Lizenz - Es gilt das deutsche Urheberrecht: § 53 UrhG</licence>
    <author>Wolfgang Mauerer</author>
    <author>J. Sawallisch</author>
    <author>G. Hillier</author>
    <author>S. Oberthür</author>
    <author>S. Hönick</author>
    <collection role="institutes" number="FakIM">Fakultät Informatik und Mathematik</collection>
    <collection role="othpublikationsherkunft" number="">Externe Publikationen</collection>
    <collection role="othforschungsschwerpunkt" number="16311">Digitalisierung</collection>
    <collection role="institutes" number="">Labor für Digitalisierung (LFD)</collection>
  </doc>
  <doc>
    <id>3652</id>
    <completedYear/>
    <publishedYear>2007</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst/>
    <pageLast/>
    <pageNumber>91</pageNumber>
    <edition/>
    <issue>4</issue>
    <volume>9</volume>
    <type>article</type>
    <publisherName>IOP Publishing</publisherName>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Spectral structure and decompositions of optical states, and their applications</title>
    <abstract language="eng">We discuss the spectral structure and decomposition of multi-photon states. Ordinarily 'multi-photon states' and 'Fock states' are regarded as synonymous. However, when the spectral degrees of freedom are included this is not the case, and the class of 'multi-photon' states is much broader than the class of 'Fock' states. We discuss the criteria for a state to be considered a Fock state. We then address the decomposition of general multi-photon states into bases of orthogonal eigenmodes, building on existing multi-mode theory, and introduce an occupation number representation that provides an elegant description of such states. This representation allows us to work in bases imposed by experimental constraints, simplifying calculations in many situations. Finally we apply this technique to several example situations, which are highly relevant for state of the art experiments. These include Hong–Ou–Mandel interference, spectral filtering, finite bandwidth photo-detection, homodyne detection and the conditional preparation of Schrödinger kitten and Fock states. Our techniques allow for very simple descriptions of each of these examples.</abstract>
    <parentTitle language="eng">New Journal of Physics</parentTitle>
    <identifier type="doi">10.1088/1367-2630/9/4/091</identifier>
    <enrichment key="opus.import.date">2022-04-28T11:07:17+00:00</enrichment>
    <enrichment key="opus.source">sword</enrichment>
    <enrichment key="opus.import.user">importuser</enrichment>
    <enrichment key="BegutachtungStatus">peer-reviewed</enrichment>
    <author>Peter P. Rohde</author>
    <author>Wolfgang Mauerer</author>
    <author>Christine Silberhorn</author>
    <collection role="institutes" number="FakIM">Fakultät Informatik und Mathematik</collection>
    <collection role="othpublikationsherkunft" number="">Externe Publikationen</collection>
    <collection role="oaweg" number="">Gold Open Access- Erstveröffentlichung in einem/als Open-Access-Medium</collection>
    <collection role="othforschungsschwerpunkt" number="16311">Digitalisierung</collection>
    <collection role="institutes" number="">Labor für Digitalisierung (LFD)</collection>
  </doc>
  <doc>
    <id>3648</id>
    <completedYear/>
    <publishedYear>2009</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst/>
    <pageLast/>
    <pageNumber/>
    <edition/>
    <issue>5</issue>
    <volume>80</volume>
    <type>article</type>
    <publisherName>American Physical Society</publisherName>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Multimode states in decoy-based quantum-key-distribution protocols</title>
    <abstract language="eng">Every security analysis of quantum-key distribution (QKD) relies on a faithful modeling of the employed quantum states. Many photon sources, such as for instance a parametric down-conversion (PDC) source, require a multimode description but are usually only considered in a single-mode representation. In general, the important claim in decoy-based QKD protocols for indistinguishability between signal and decoy states does not hold for all sources. We derive bounds on the single-photon transmission probability and error rate for multimode states and apply these bounds to the output state of a PDC source. We observe two opposing effects on the secure key rate. First, the multimode structure of the state gives rise to a new attack that decreases the key rate. Second, more contributing modes change the photon number distribution from a thermal toward a Poissonian distribution, which increases the key rate.</abstract>
    <parentTitle language="eng">Physical Review A</parentTitle>
    <identifier type="doi">10.1103/physreva.80.052326</identifier>
    <enrichment key="opus.import.date">2022-04-28T11:07:17+00:00</enrichment>
    <enrichment key="opus.source">sword</enrichment>
    <enrichment key="opus.import.user">importuser</enrichment>
    <enrichment key="BegutachtungStatus">peer-reviewed</enrichment>
    <enrichment key="opus.doi.autoCreate">false</enrichment>
    <enrichment key="opus.urn.autoCreate">false</enrichment>
    <licence>Keine Lizenz - Es gilt das deutsche Urheberrecht: § 53 UrhG</licence>
    <author>Wolfram Helwig</author>
    <author>Wolfgang Mauerer</author>
    <author>Christine Silberhorn</author>
    <collection role="institutes" number="FakIM">Fakultät Informatik und Mathematik</collection>
    <collection role="othpublikationsherkunft" number="">Externe Publikationen</collection>
    <collection role="othforschungsschwerpunkt" number="16311">Digitalisierung</collection>
    <collection role="institutes" number="">Labor für Digitalisierung (LFD)</collection>
  </doc>
  <doc>
    <id>3650</id>
    <completedYear/>
    <publishedYear>2008</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst>158</pageFirst>
    <pageLast>175</pageLast>
    <pageNumber/>
    <edition/>
    <issue>2-3</issue>
    <volume>17</volume>
    <type>article</type>
    <publisherName>Wiley</publisherName>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Recent developments in quantum key distribution: Theory and practice</title>
    <abstract language="eng">Quantum key distribution is among the foremost applications of quantum mechanics, both in terms of fundamental physics and as a technology on the brink of commercial deployment. Starting from principal schemes and initial proofs of unconditional security for perfect systems, much effort has gone into providing secure schemes which can cope with numerous experimental imperfections unavoidable in real world implementations. In this paper, we provide a comparison of various schemes and protocols. We analyse their efficiency and performance when implemented with imperfect physical components. We consider how experimental faults are accounted for using effective parameters. We compare various recent protocols and provide guidelines as to which components propose best advances when being improved.</abstract>
    <parentTitle language="eng">Annalen der Physik</parentTitle>
    <identifier type="doi">10.1002/andp.200710284</identifier>
    <enrichment key="opus.import.date">2022-04-28T11:07:17+00:00</enrichment>
    <enrichment key="opus.source">sword</enrichment>
    <enrichment key="opus.import.user">importuser</enrichment>
    <enrichment key="BegutachtungStatus">peer-reviewed</enrichment>
    <enrichment key="opus.doi.autoCreate">false</enrichment>
    <enrichment key="opus.urn.autoCreate">false</enrichment>
    <licence>Keine Lizenz - Es gilt das deutsche Urheberrecht: § 53 UrhG</licence>
    <author>Wolfgang Mauerer</author>
    <author>Wolfram Helwig</author>
    <author>Christine Silberhorn</author>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>experimental imperfections</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>quantum communication</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Quantum cryptography</value>
    </subject>
    <collection role="institutes" number="FakIM">Fakultät Informatik und Mathematik</collection>
    <collection role="othpublikationsherkunft" number="">Externe Publikationen</collection>
    <collection role="othforschungsschwerpunkt" number="16311">Digitalisierung</collection>
    <collection role="institutes" number="">Labor für Digitalisierung (LFD)</collection>
  </doc>
  <doc>
    <id>3649</id>
    <completedYear/>
    <publishedYear>2008</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst/>
    <pageLast/>
    <pageNumber/>
    <edition/>
    <issue>5</issue>
    <volume>101</volume>
    <type>article</type>
    <publisherName>American Physical Society</publisherName>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Photon Number Statistics of Multimode Parametric Down-Conversion</title>
    <abstract language="eng">We experimentally analyze the complete photon number statistics of parametric down-conversion and ascertain the influence of multimode effects. Our results clearly reveal a difference between single-mode theoretical description and the measured distributions. Further investigations assure the applicability of loss-tolerant photon number reconstruction and prove strict photon number correlation between signal and idler modes.</abstract>
    <parentTitle language="eng">Physical Review Letters</parentTitle>
    <identifier type="doi">10.1103/physrevlett.101.053601</identifier>
    <enrichment key="opus.import.date">2022-04-28T11:07:17+00:00</enrichment>
    <enrichment key="opus.source">sword</enrichment>
    <enrichment key="opus.import.user">importuser</enrichment>
    <enrichment key="BegutachtungStatus">peer-reviewed</enrichment>
    <enrichment key="opus.doi.autoCreate">false</enrichment>
    <enrichment key="opus.urn.autoCreate">false</enrichment>
    <licence>Keine Lizenz - Es gilt das deutsche Urheberrecht: § 53 UrhG</licence>
    <author>Malte Avenhaus</author>
    <author>Hendrik B. Coldenstrodt-Ronge</author>
    <author>K. Laiho</author>
    <author>Wolfgang Mauerer</author>
    <author>I. A. Walmsley</author>
    <author>Christine Silberhorn</author>
    <collection role="institutes" number="FakIM">Fakultät Informatik und Mathematik</collection>
    <collection role="othpublikationsherkunft" number="">Externe Publikationen</collection>
    <collection role="othforschungsschwerpunkt" number="16311">Digitalisierung</collection>
    <collection role="institutes" number="">Labor für Digitalisierung (LFD)</collection>
  </doc>
  <doc>
    <id>3651</id>
    <completedYear/>
    <publishedYear>2007</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst/>
    <pageLast/>
    <pageNumber/>
    <edition/>
    <issue>5</issue>
    <volume>75</volume>
    <type>article</type>
    <publisherName>American Physical Society</publisherName>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Quantum key distribution with passive decoy state selection</title>
    <abstract language="eng">We propose a quantum key distribution scheme which closely matches the performance of a perfect single photon source. It nearly attains the physical upper bound in terms of key generation rate and maximally achievable distance. Our scheme relies on a practical setup based on a parametric downconversion source and present day, nonideal photon-number detection. Arbitrary experimental imperfections which lead to bit errors are included. We select decoy states by classical postprocessing. This allows one to improve the effective signal statistics and achievable distance.</abstract>
    <parentTitle language="eng">Physical Review A</parentTitle>
    <identifier type="doi">10.1103/physreva.75.050305</identifier>
    <enrichment key="opus.import.date">2022-04-28T11:07:17+00:00</enrichment>
    <enrichment key="opus.source">sword</enrichment>
    <enrichment key="opus.import.user">importuser</enrichment>
    <enrichment key="BegutachtungStatus">peer-reviewed</enrichment>
    <enrichment key="opus.doi.autoCreate">false</enrichment>
    <enrichment key="opus.urn.autoCreate">false</enrichment>
    <licence>Keine Lizenz - Es gilt das deutsche Urheberrecht: § 53 UrhG</licence>
    <author>Wolfgang Mauerer</author>
    <author>Christine Silberhorn</author>
    <collection role="institutes" number="FakIM">Fakultät Informatik und Mathematik</collection>
    <collection role="othpublikationsherkunft" number="">Externe Publikationen</collection>
    <collection role="othforschungsschwerpunkt" number="16311">Digitalisierung</collection>
    <collection role="institutes" number="">Labor für Digitalisierung (LFD)</collection>
  </doc>
  <doc>
    <id>3654</id>
    <completedYear/>
    <publishedYear>2008</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst/>
    <pageLast/>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume/>
    <type>book</type>
    <publisherName>Wiley</publisherName>
    <publisherPlace>Indianapolis</publisherPlace>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Professional Linux kernel architecture</title>
    <abstract language="eng">Find an introduction to the architecture, concepts and algorithms of the Linux kernel in Professional Linux Kernel Architecture, a guide to the kernel sources and large number of connections among subsystems. Find an introduction to the relevant structures and functions exported by the kernel to userland, understand the theoretical and conceptual aspects of the Linux kernel and Unix derivatives, and gain a deeper understanding of the kernel. Learn how to reduce the vast amount of information contained in the kernel sources and obtain the skills necessary to understand the kernel sources.</abstract>
    <parentTitle language="eng">Wrox professional guides</parentTitle>
    <identifier type="isbn">9780470343432</identifier>
    <enrichment key="opus.import.date">2022-04-28T11:07:17+00:00</enrichment>
    <enrichment key="opus.source">sword</enrichment>
    <enrichment key="opus.import.user">importuser</enrichment>
    <enrichment key="BegutachtungStatus">peer-reviewed</enrichment>
    <licence>Keine Lizenz - Es gilt das deutsche Urheberrecht: § 53 UrhG</licence>
    <author>Wolfgang Mauerer</author>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Architektur &lt;Informatik&gt;</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Kernel &lt;Informatik&gt;</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Linux</value>
    </subject>
    <collection role="institutes" number="FakIM">Fakultät Informatik und Mathematik</collection>
    <collection role="othpublikationsherkunft" number="">Externe Publikationen</collection>
    <collection role="othforschungsschwerpunkt" number="16311">Digitalisierung</collection>
    <collection role="institutes" number="">Labor für Digitalisierung (LFD)</collection>
  </doc>
  <doc>
    <id>3644</id>
    <completedYear/>
    <publishedYear>2012</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst/>
    <pageLast/>
    <pageNumber/>
    <edition/>
    <issue>3</issue>
    <volume/>
    <type>article</type>
    <publisherName>Linux New Media AG</publisherName>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Datenvisualisierung mit Ggplot2</title>
    <abstract language="deu">Wer seine Daten mit ansehnlichen und informativen Graphen veranschaulichen möchte, braucht meist viel Geduld. Die R-Erweiterung Ggplot2 bringt System in die Grafik, drückt sich in knappem Quellcode aus und bläst frischen Wind in den Alltag der Datenvisualisierung.</abstract>
    <parentTitle language="eng">Linux-Magazin</parentTitle>
    <identifier type="url">www.linux-magazin.de/Heft-Abo/Ausgaben/2012/03/Ggplot2</identifier>
    <enrichment key="opus.import.date">2022-04-28T11:07:17+00:00</enrichment>
    <enrichment key="opus.source">sword</enrichment>
    <enrichment key="opus.import.user">importuser</enrichment>
    <enrichment key="opus.doi.autoCreate">false</enrichment>
    <enrichment key="opus.urn.autoCreate">false</enrichment>
    <licence>Keine Lizenz - Es gilt das deutsche Urheberrecht: § 53 UrhG</licence>
    <author>Wolfgang Mauerer</author>
    <collection role="institutes" number="FakIM">Fakultät Informatik und Mathematik</collection>
    <collection role="othpublikationsherkunft" number="">Externe Publikationen</collection>
    <collection role="othforschungsschwerpunkt" number="16311">Digitalisierung</collection>
    <collection role="institutes" number="">Labor für Digitalisierung (LFD)</collection>
  </doc>
  <doc>
    <id>3655</id>
    <completedYear/>
    <publishedYear>2004</publishedYear>
    <thesisYearAccepted/>
    <language>deu</language>
    <pageFirst/>
    <pageLast/>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume/>
    <type>book</type>
    <publisherName>Hanser</publisherName>
    <publisherPlace>München</publisherPlace>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="deu">Linux-Kernelarchitektur : Konzepte Strukturen und Algorithmen von Kernel 2.6</title>
    <identifier type="isbn">9783446225664</identifier>
    <enrichment key="opus.import.date">2022-04-28T11:07:17+00:00</enrichment>
    <enrichment key="opus.source">sword</enrichment>
    <enrichment key="opus.import.user">importuser</enrichment>
    <licence>Keine Lizenz - Es gilt das deutsche Urheberrecht: § 53 UrhG</licence>
    <author>Wolfgang Mauerer</author>
    <subject>
      <language>deu</language>
      <type>uncontrolled</type>
      <value>Kernel &lt;Informatik&gt;</value>
    </subject>
    <subject>
      <language>deu</language>
      <type>uncontrolled</type>
      <value>LINUX 2.6</value>
    </subject>
    <collection role="institutes" number="FakIM">Fakultät Informatik und Mathematik</collection>
    <collection role="othpublikationsherkunft" number="">Externe Publikationen</collection>
    <collection role="othforschungsschwerpunkt" number="16311">Digitalisierung</collection>
    <collection role="institutes" number="">Labor für Digitalisierung (LFD)</collection>
  </doc>
  <doc>
    <id>3656</id>
    <completedYear/>
    <publishedYear>1997</publishedYear>
    <thesisYearAccepted/>
    <language>deu</language>
    <pageFirst/>
    <pageLast/>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume/>
    <type>book</type>
    <publisherName>Hanser</publisherName>
    <publisherPlace>München</publisherPlace>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="deu">Textverarbeitung mit LATEX 2e [2 epsilon] unter UNIX</title>
    <identifier type="isbn">9783446189096</identifier>
    <enrichment key="opus.import.date">2022-04-28T11:07:17+00:00</enrichment>
    <enrichment key="opus.source">sword</enrichment>
    <enrichment key="opus.import.user">importuser</enrichment>
    <enrichment key="opus.doi.autoCreate">false</enrichment>
    <enrichment key="opus.urn.autoCreate">false</enrichment>
    <licence>Keine Lizenz - Es gilt das deutsche Urheberrecht: § 53 UrhG</licence>
    <author>Wolfgang Mauerer</author>
    <subject>
      <language>deu</language>
      <type>uncontrolled</type>
      <value>LATEX 2E</value>
    </subject>
    <subject>
      <language>deu</language>
      <type>uncontrolled</type>
      <value>Textverarbeitung</value>
    </subject>
    <subject>
      <language>deu</language>
      <type>uncontrolled</type>
      <value>UNIX</value>
    </subject>
    <collection role="institutes" number="FakIM">Fakultät Informatik und Mathematik</collection>
    <collection role="othpublikationsherkunft" number="">Externe Publikationen</collection>
    <collection role="othforschungsschwerpunkt" number="16311">Digitalisierung</collection>
    <collection role="institutes" number="">Labor für Digitalisierung (LFD)</collection>
  </doc>
  <doc>
    <id>3653</id>
    <completedYear/>
    <publishedYear>2000</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst/>
    <pageLast/>
    <pageNumber/>
    <edition/>
    <issue>51</issue>
    <volume/>
    <type>article</type>
    <publisherName/>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Gimp-Perl: Gimp scripting for the rest of us</title>
    <parentTitle language="eng">Linux Gazette</parentTitle>
    <identifier type="issn">1934-371X</identifier>
    <identifier type="url">https://linuxgazette.net/issue51/mauerer.html</identifier>
    <enrichment key="opus.import.date">2022-04-28T11:07:17+00:00</enrichment>
    <enrichment key="opus.source">sword</enrichment>
    <enrichment key="opus.import.user">importuser</enrichment>
    <licence>Keine Lizenz - Es gilt das deutsche Urheberrecht: § 53 UrhG</licence>
    <author>Wolfgang Mauerer</author>
    <collection role="institutes" number="FakIM">Fakultät Informatik und Mathematik</collection>
    <collection role="othpublikationsherkunft" number="">Externe Publikationen</collection>
    <collection role="othforschungsschwerpunkt" number="16311">Digitalisierung</collection>
    <collection role="institutes" number="">Labor für Digitalisierung (LFD)</collection>
  </doc>
  <doc>
    <id>3660</id>
    <completedYear/>
    <publishedYear>2017</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst>26</pageFirst>
    <pageLast>29</pageLast>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume/>
    <type>conferenceobject</type>
    <publisherName>IEEE</publisherName>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">McFSM: Globally Taming Complex Systems</title>
    <abstract language="eng">Industrial computing devices, in particular cyber-physical, real-time and safety-critical systems, focus on reacting to external events and the need to cooperate with other devices to create a functional system. They are often implemented with languages that focus on a simple, local description of how a component reacts to external input data and stimuli. Despite the trend in modern software architectures to structure systems into largely independent components, the remaining interdependencies still create rich behavioural dynamics even for small systems. Standard and industrial programming approaches do usually not model or extensively describe the global properties of an entire system. Although a large number of approaches to solve this dilemma have been suggested, it remains a hard and error-prone task to implement systems with complex interdependencies correctly. We introduce multiple coupled finite state machines (McFSMs), a novel mechanism that allows us to model and manage such interdependencies. It is based on a consistent, well-structured and simple global description. A sound theoretical foundation is provided, and associated tools allow us to generate efficient low-level code in various programming languages using model-driven techniques. We also present a domain specific language to express McFSMs and their connections to other systems, to model their dynamic behaviour, and to investigate their efficiency and correctness at compile-time.</abstract>
    <parentTitle language="eng">2017 IEEE/ACM 3rd International Workshop on Software Engineering for Smart Cyber-Physical Systems (SEsCPS), 21-21 May 2017, Buenos Aires, Argentina</parentTitle>
    <identifier type="doi">10.1109/SEsCPS.2017.7</identifier>
    <enrichment key="opus.import.date">2022-04-28T11:11:46+00:00</enrichment>
    <enrichment key="opus.source">sword</enrichment>
    <enrichment key="opus.import.user">importuser</enrichment>
    <enrichment key="BegutachtungStatus">peer-reviewed</enrichment>
    <licence>Keine Lizenz - Es gilt das deutsche Urheberrecht: § 53 UrhG</licence>
    <author>Florian Murr</author>
    <author>Wolfgang Mauerer</author>
    <collection role="institutes" number="FakIM">Fakultät Informatik und Mathematik</collection>
    <collection role="othforschungsschwerpunkt" number="16311">Digitalisierung</collection>
    <collection role="institutes" number="">Labor für Digitalisierung (LFD)</collection>
  </doc>
  <doc>
    <id>3673</id>
    <completedYear/>
    <publishedYear>2020</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst>121</pageFirst>
    <pageLast>128</pageLast>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume/>
    <type>conferenceobject</type>
    <publisherName>Springer International Publishing</publisherName>
    <publisherPlace>Cham</publisherPlace>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">A Novel Software Architecture for Mixed Criticality Systems</title>
    <abstract language="eng">The advent of multi-core CPUs in nearly all embedded markets has prompted an architectural trend towards combining safety critical and uncritical software on single hardware units. We present a novel architecture for mixed criticality systems based on Linux that allows us to consolidate critical and uncritical parts onto a single hardware unit. CPU virtualisation extensions enable strict and static partitioning of hardware by direct assignment of resources, which allows us to boot additional operating systems or bare metal applications running aside Linux. The hypervisor Jailhouse is at the core of the architecture and ensures that the resulting domains may serve workloads of different criticality and can not interfere in an unintended way. This retains Linux’s feature-richness in uncritical parts, while frugal safety and real-time critical applications execute in isolated domains. Architectural simplicity is a central aspect of our approach and a precondition for reliable implementability and successful certification. While standard virtualisation extensions provided by current hardware seem to suffice for a straight forward implementation of our approach, there are a number of further limitations that need to be worked around. This paper discusses the arising issues, and evaluates the suitability of our approach for real-world safety and real-time critical scenarios.</abstract>
    <parentTitle language="eng">Digital Transformation in Semiconductor Manufacturing: Proceedings of the 1st and 2nd European Advances in Digital Transformation Conference, EADTC 2018, Zittau, Germany and EADTC 2019, Milan, Italy</parentTitle>
    <identifier type="doi">10.1007/978-3-030-48602-0_11</identifier>
    <enrichment key="opus.import.date">2022-04-28T11:11:46+00:00</enrichment>
    <enrichment key="opus.source">sword</enrichment>
    <enrichment key="opus.import.user">importuser</enrichment>
    <enrichment key="OtherSeries">Lecture Notes in Electrical Engineering ; 670</enrichment>
    <enrichment key="BegutachtungStatus">peer-reviewed</enrichment>
    <licence>Creative Commons - CC BY - Namensnennung 4.0 International</licence>
    <author>Ralf Ramsauer</author>
    <author>Jan Kiszka</author>
    <author>Wolfgang Mauerer</author>
    <collection role="institutes" number="FakIM">Fakultät Informatik und Mathematik</collection>
    <collection role="oaweg" number="">Gold Open Access- Erstveröffentlichung in einem/als Open-Access-Medium</collection>
    <collection role="othforschungsschwerpunkt" number="16311">Digitalisierung</collection>
    <collection role="institutes" number="">Labor für Digitalisierung (LFD)</collection>
  </doc>
  <doc>
    <id>3677</id>
    <completedYear/>
    <publishedYear>2017</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">Look Mum, no VM Exits! (Almost)</title>
    <abstract language="eng">Multi-core CPUs are a standard component in many modern embedded systems. Their virtualisation extensions enable the isolation of services, and gain popularity to implement mixed-criticality or otherwise split systems. We present Jailhouse, a Linux-based, OS-agnostic partitioning hypervisor that uses novel architectural approaches to combine Linux, a powerful general-purpose system, with strictly isolated special-purpose components. Our design goals favour simplicity over features, establish a minimal code base, and minimise hypervisor activity. Direct assignment of hardware to guests, together with a deferred initialisation scheme, offloads any complex hardware handling and bootstrapping issues from the hypervisor to the general purpose OS. The hypervisor establishes isolated domains that directly access physical resources without the need for emulation or paravirtualisation. This retains, with negligible system overhead, Linux's feature-richness in uncritical parts, while frugal safety and real-time critical workloads execute in isolated, safe domains.</abstract>
    <parentTitle language="eng">Proceedings of the 13th Annual Workshop on Operating Systems Platforms for Embedded Real-Time Applications (OSPERT '17)</parentTitle>
    <identifier type="doi">10.48550/arXiv.1705.06932</identifier>
    <identifier type="url">https://ospert2017.uni.lu/</identifier>
    <enrichment key="opus.import.date">2022-04-28T11:11:46+00:00</enrichment>
    <enrichment key="opus.source">sword</enrichment>
    <enrichment key="opus.import.user">importuser</enrichment>
    <licence>Keine Lizenz - Es gilt das deutsche Urheberrecht: § 53 UrhG</licence>
    <author>Ralf Ramsauer</author>
    <author>Jan Kiszka</author>
    <author>Daniel Lohmann</author>
    <author>Wolfgang Mauerer</author>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>FOS: Computer and information sciences</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Operating Systems (cs.OS)</value>
    </subject>
    <collection role="institutes" number="FakIM">Fakultät Informatik und Mathematik</collection>
    <collection role="othforschungsschwerpunkt" number="16311">Digitalisierung</collection>
    <collection role="institutes" number="">Labor für Digitalisierung (LFD)</collection>
  </doc>
  <doc>
    <id>3679</id>
    <completedYear/>
    <publishedYear>2017</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst>175</pageFirst>
    <pageLast>178</pageLast>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume/>
    <type>conferenceobject</type>
    <publisherName>IEEE</publisherName>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Towards Architect’s Activity Detection through a Common Model for Project Pattern Analysis</title>
    <abstract language="eng">Software development projects leave a large amount of data in repositories of Application Lifecycle Management (ALM) tools. These data contain detailed histories of their respective projects, their results and decisions made along the way. Analysis of such data helps uncover various interesting facts about projects, e.g. their socio-technical structures and the actual (vs. purported) roles of team members. Based on experiences with tools supporting our research we are convinced that it is feasible to consolidate data from different ALM tools, tapping into the situation common in real-life projects. In this paper we report on our work towards a shared common data model and tool integration aimed at improved project analysis. We discuss how this can help in the identification of architects in the project organizational structures, their activity patterns and collaboration with other team roles.</abstract>
    <parentTitle language="eng">First International Workshop on the Social and Organization Dimensions of Software, 5-7 April 2017, Gothenburg, Sweden</parentTitle>
    <identifier type="doi">10.1109/ICSAW.2017.46</identifier>
    <enrichment key="opus.import.date">2022-04-28T11:11:46+00:00</enrichment>
    <enrichment key="opus.source">sword</enrichment>
    <enrichment key="opus.import.user">importuser</enrichment>
    <enrichment key="BegutachtungStatus">peer-reviewed</enrichment>
    <licence>Keine Lizenz - Es gilt das deutsche Urheberrecht: § 53 UrhG</licence>
    <author>Petr Picha</author>
    <author>Premek Brada</author>
    <author>Ralf Ramsauer</author>
    <author>Wolfgang Mauerer</author>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>data analysis</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Data Models</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>project management</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Software Architecture</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>software tools</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>team working</value>
    </subject>
    <collection role="institutes" number="FakIM">Fakultät Informatik und Mathematik</collection>
    <collection role="othforschungsschwerpunkt" number="16311">Digitalisierung</collection>
    <collection role="institutes" number="">Labor für Digitalisierung (LFD)</collection>
  </doc>
  <doc>
    <id>3680</id>
    <completedYear/>
    <publishedYear>2016</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst>1</pageFirst>
    <pageLast>4</pageLast>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume/>
    <type>conferenceobject</type>
    <publisherName>ACM</publisherName>
    <publisherPlace>New York</publisherPlace>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Observing Custom Software Modifications: A Quantitative Approach of Tracking the Evolution of Patch Stacks</title>
    <abstract language="deu">Modifications to open-source software (OSS) are often provided in the form of "patch stacks" -- sets of changes (patches) that modify a given body of source code. Maintaining patch stacks over extended periods of time is problematic when the underlying base project changes frequently. This necessitates a continuous and engineering-intensive adaptation of the stack. Nonetheless, long-term maintenance is an important problem for changes that are not integrated into projects, for instance when they are controversial or only of value to a limited group of users.&#13;
&#13;
We present and implement a methodology to systematically examine the temporal evolution of patch stacks, track non-functional properties like integrability and maintainability, and estimate the eventual economic and engineering effort required to successfully develop and maintain patch stacks. Our results provide a basis for quantitative research on patch stacks, including statistical analyses and other methods that lead to actionable advice on the construction and long-term maintenance of custom extensions to OSS.</abstract>
    <parentTitle language="eng">Proceedings of the 12th International Symposium on Open Collaboration (OpenSym '16)</parentTitle>
    <identifier type="doi">10.1145/2957792.2957810</identifier>
    <enrichment key="opus.import.date">2022-04-28T11:11:46+00:00</enrichment>
    <enrichment key="opus.source">sword</enrichment>
    <enrichment key="opus.import.user">importuser</enrichment>
    <enrichment key="BegutachtungStatus">peer-reviewed</enrichment>
    <licence>Keine Lizenz - Es gilt das deutsche Urheberrecht: § 53 UrhG</licence>
    <author>Ralf Ramsauer</author>
    <author>Daniel Lohmann</author>
    <author>Wolfgang Mauerer</author>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>CADOS</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>collaboration</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Linux</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>maintenance</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>patch stacks</value>
    </subject>
    <collection role="institutes" number="FakIM">Fakultät Informatik und Mathematik</collection>
    <collection role="othforschungsschwerpunkt" number="16311">Digitalisierung</collection>
    <collection role="institutes" number="">Labor für Digitalisierung (LFD)</collection>
  </doc>
  <doc>
    <id>3682</id>
    <completedYear/>
    <publishedYear>2013</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst>245</pageFirst>
    <pageLast>256</pageLast>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume>404</volume>
    <type>conferenceobject</type>
    <publisherName>Springer</publisherName>
    <publisherPlace>Berlin</publisherPlace>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">A Dual Model of Open Source License Growth</title>
    <abstract language="eng">Every open source project needs to decide on an open source license. This decision is of high economic relevance: Just which license is the best one to help the project grow and attract a community? The most common question is: Should the project choose a restrictive (reciprocal) license or a more permissive one? As an important step towards answering this question, this paper analyses actual license choice and correlated project growth from ten years of open source projects. It provides closed analytical models and finds that around 2001 a reversal in license choice occurred from restrictive towards permissive licenses.</abstract>
    <parentTitle language="eng">Open Source Software: Quality Verification : 9th IFIP WG 2.13 International Conference, OSS 2013, Koper-Capodistria, Slovenia, June 25-28, 2013, Proceedings</parentTitle>
    <identifier type="doi">10.1007/978-3-642-38928-3_18</identifier>
    <enrichment key="opus.import.date">2022-04-28T11:11:46+00:00</enrichment>
    <enrichment key="opus.source">sword</enrichment>
    <enrichment key="opus.import.user">importuser</enrichment>
    <enrichment key="BegutachtungStatus">peer-reviewed</enrichment>
    <licence>Keine Lizenz - Es gilt das deutsche Urheberrecht: § 53 UrhG</licence>
    <author>Gottfried Hofmann</author>
    <author>Dirk Riehle</author>
    <author>Carsten Kolassa</author>
    <author>Wolfgang Mauerer</author>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Dual Model</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Free Software Foundation</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Open Source</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Open Source License</value>
    </subject>
    <collection role="institutes" number="FakIM">Fakultät Informatik und Mathematik</collection>
    <collection role="othpublikationsherkunft" number="">Externe Publikationen</collection>
    <collection role="othforschungsschwerpunkt" number="16311">Digitalisierung</collection>
    <collection role="institutes" number="">Labor für Digitalisierung (LFD)</collection>
  </doc>
  <doc>
    <id>3685</id>
    <completedYear/>
    <publishedYear>2019</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst/>
    <pageLast/>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume/>
    <type>movingimage</type>
    <publisherName/>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Cyclic Tests Unleashed: Large-Scale RT Analysis with Jitterdebugger</title>
    <parentTitle language="deu">Open Source Summit, North America, 17.07.2019</parentTitle>
    <identifier type="url">https://www.youtube.com/watch?v=wNQ24TFjzCw</identifier>
    <enrichment key="opus.import.date">2022-04-28T11:20:23+00:00</enrichment>
    <enrichment key="opus.source">sword</enrichment>
    <enrichment key="opus.import.user">importuser</enrichment>
    <licence>Keine Lizenz - Es gilt das deutsche Urheberrecht: § 53 UrhG</licence>
    <author>Wolfgang Mauerer</author>
    <author>Daniel Wagner</author>
    <collection role="institutes" number="FakIM">Fakultät Informatik und Mathematik</collection>
    <collection role="othforschungsschwerpunkt" number="16311">Digitalisierung</collection>
    <collection role="institutes" number="">Labor für Digitalisierung (LFD)</collection>
  </doc>
  <doc>
    <id>3688</id>
    <completedYear/>
    <publishedYear>2018</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">Are any big brothers watching you, and if yes, what can they tell about Debian</title>
    <abstract language="eng">Debian, as a collection of software packages and components, is known to be one of the largest software projects in the history of mankind. Combined with a traceable history over many years, the artefacts created by Debian developers and users make it one of science’s favourite targets to quantitatively or qualitatively understand how real-world software development works (or does not), how people collaborate, and many other other related questions. Unfortunately, while scientists make ample use of the resources and artefacts created by FLOSS and friends, the exchange of insights and ideas does not seem to extend in both directions: Developers, users and integrators are often unaware of results obtained in science. This talk will introduce the Debian community to a selection the most important results obtained by scientific (software engineering) research, with a special focus on large-scale socio-technical analysis of projects like Debian, and the possible implications and improvements these may bring to Debian development itself.</abstract>
    <parentTitle language="deu">DebConf18 Hsinchu, Taiwan</parentTitle>
    <identifier type="url">https://meetings-archive.debian.net/pub/debian-meetings/2018/DebConf18/2018-08-03/are-any-big-brothers-watching-you-and-if.webm</identifier>
    <enrichment key="opus.import.date">2022-04-28T11:20:23+00:00</enrichment>
    <enrichment key="opus.source">sword</enrichment>
    <enrichment key="opus.import.user">importuser</enrichment>
    <enrichment key="BegutachtungStatus">peer-reviewed</enrichment>
    <licence>Keine Lizenz - Es gilt das deutsche Urheberrecht: § 53 UrhG</licence>
    <author>Wolfgang Mauerer</author>
    <collection role="institutes" number="FakIM">Fakultät Informatik und Mathematik</collection>
    <collection role="othforschungsschwerpunkt" number="16311">Digitalisierung</collection>
    <collection role="institutes" number="">Labor für Digitalisierung (LFD)</collection>
  </doc>
  <doc>
    <id>3687</id>
    <completedYear/>
    <publishedYear>2019</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst/>
    <pageLast/>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume/>
    <type>movingimage</type>
    <publisherName/>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Torturing Git for Fun and Profit</title>
    <abstract language="deu">In diesem Talk blicken Prof. Dr. Wolfgang Mauerer und Ralf Ramsauer unter die Haube des verteilten Versionskontrollsystems Git. Neben einer genauen Beschreibung der Strukturen und Plumbing APIs, mit denen Git intern Commits erzeugt und verknüpft, gehen die Vortragenden auch auf nützliche Features und Standards ein, welche die Kollaborition in großen Open-Source Projekten erleichtern.</abstract>
    <parentTitle language="deu">Microsoft Developer Meetup Regensburg 02.04.2019</parentTitle>
    <identifier type="url">https://www.youtube.com/watch?v=CrUwmO4tvLI</identifier>
    <enrichment key="opus.import.date">2022-04-28T11:20:23+00:00</enrichment>
    <enrichment key="opus.source">sword</enrichment>
    <enrichment key="opus.import.user">importuser</enrichment>
    <licence>Keine Lizenz - Es gilt das deutsche Urheberrecht: § 53 UrhG</licence>
    <author>Wolfgang Mauerer</author>
    <author>Ralf Ramsauer</author>
    <collection role="institutes" number="FakIM">Fakultät Informatik und Mathematik</collection>
    <collection role="othforschungsschwerpunkt" number="16311">Digitalisierung</collection>
    <collection role="institutes" number="">Labor für Digitalisierung (LFD)</collection>
  </doc>
  <doc>
    <id>2642</id>
    <completedYear/>
    <publishedYear>2019</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst>1</pageFirst>
    <pageLast>13</pageLast>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume>6</volume>
    <type>article</type>
    <publisherName>Frontiers</publisherName>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">A Hybrid Solution Method for the Capacitated Vehicle Routing Problem Using a Quantum Annealer</title>
    <abstract language="eng">he Capacitated Vehicle Routing Problem (CVRP) is an NP-optimization problem (NPO) that has been of great interest for decades for both, science and industry. The CVRP is a variant of the vehicle routing problem characterized by capacity constrained vehicles. The aim is to plan tours for vehicles to supply a given number of customers as efficiently as possible. The problem is the combinatorial explosion of possible solutions, which increases superexponentially with the number of customers. Classical solutions provide good approximations to the globally optimal solution. D-Wave's quantum annealer is a machine designed to solve optimization problems. This machine uses quantum effects to speed up computation time compared to classic computers. The problem on solving the CVRP on the quantum annealer is the particular formulation of the optimization problem. For this, it has to be mapped onto a quadratic unconstrained binary optimization (QUBO) problem. Complex optimization problems such as the CVRP can be translated to smaller subproblems and thus enable a sequential solution of the partitioned problem. This work presents a quantum-classic hybrid solution method for the CVRP. It clarifies whether the implementation of such a method pays off in comparison to existing classical solution methods regarding computation time and solution quality. Several approaches to solving the CVRP are elaborated, the arising problems are discussed, and the results are evaluated in terms of solution quality and computation time.</abstract>
    <parentTitle language="eng">Frontiers in ICT</parentTitle>
    <identifier type="doi">10.3389/fict.2019.00013</identifier>
    <enrichment key="opus.import.date">2022-01-28T13:58:12+00:00</enrichment>
    <enrichment key="opus.source">sword</enrichment>
    <enrichment key="opus.import.user">importuser</enrichment>
    <enrichment key="BegutachtungStatus">peer-reviewed</enrichment>
    <licence>Creative Commons - CC BY - Namensnennung 4.0 International</licence>
    <author>Sebastian Feld</author>
    <author>Christoph Roch</author>
    <author>Thomas Gabor</author>
    <author>Christian Seidel</author>
    <author>Florian Neukart</author>
    <author>Isabella Galter</author>
    <author>Wolfgang Mauerer</author>
    <author>Claudia Linnhoff-Popien</author>
    <collection role="institutes" number="FakIM">Fakultät Informatik und Mathematik</collection>
    <collection role="oaweg" number="">Gold Open Access- Erstveröffentlichung in einem/als Open-Access-Medium</collection>
    <collection role="othforschungsschwerpunkt" number="16311">Digitalisierung</collection>
    <collection role="institutes" number="">Labor für Digitalisierung (LFD)</collection>
  </doc>
  <doc>
    <id>2771</id>
    <completedYear/>
    <publishedYear>2020</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst>147</pageFirst>
    <pageLast>157</pageLast>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume/>
    <type>conferenceobject</type>
    <publisherName>ACM</publisherName>
    <publisherPlace>New York, NY, USA</publisherPlace>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">The Sound of Silence : Mining Security Vulnerabilities from Secret Integration Channels in Open-Source Projects</title>
    <abstract language="eng">Public development processes are a key characteristic of open source projects. However, fixes for vulnerabilities are usually discussed privately among a small group of trusted maintainers, and integrated without prior public involvement. This is supposed to prevent early disclosure, and cope with embargo and non-disclosure agreement (NDA) rules. While regular development activities leave publicly available traces, fixes for vulnerabilities that bypass the standard process do not.&#13;
&#13;
We present a data-mining based approach to detect code fragments that arise from such infringements of the standard process. By systematically mapping public development artefacts to source code repositories, we can exclude regular process activities, and infer irregularities that stem from non-public integration channels. For the Linux kernel, the most crucial component of many systems, we apply our method to a period of seven months before the release of Linux 5.4. We find 29 commits that address 12 vulnerabilities. For these vulnerabilities, our approach provides a temporal advantage of 2 to 179 days to design exploits before public disclosure takes place, and fixes are rolled out.&#13;
&#13;
Established responsible disclosure approaches in open development processes are supposed to limit premature visibility of security vulnerabilities. However, our approach shows that, instead, they open additional possibilities to uncover such changes that thwart the very premise. We conclude by discussing implications and partial countermeasures.</abstract>
    <parentTitle language="eng">Proceedings of the 2020 ACM SIGSAC Conference on Cloud Computing Security Workshop: 09.11.2020, virtual event</parentTitle>
    <identifier type="isbn">9781450380843</identifier>
    <identifier type="doi">10.1145/3411495.3421360</identifier>
    <enrichment key="opus.import.date">2022-02-09T06:20:59+00:00</enrichment>
    <enrichment key="opus.source">sword</enrichment>
    <enrichment key="opus.import.user">importuser</enrichment>
    <enrichment key="BegutachtungStatus">peer-reviewed</enrichment>
    <licence>Keine Lizenz - Es gilt das deutsche Urheberrecht: § 53 UrhG</licence>
    <author>Ralf Ramsauer</author>
    <author>Lukas Bulwahn</author>
    <author>Daniel Lohmann</author>
    <author>Wolfgang Mauerer</author>
    <collection role="institutes" number="FakIM">Fakultät Informatik und Mathematik</collection>
    <collection role="othforschungsschwerpunkt" number="16311">Digitalisierung</collection>
    <collection role="institutes" number="">Labor für Digitalisierung (LFD)</collection>
  </doc>
  <doc>
    <id>3901</id>
    <completedYear/>
    <publishedYear>2009</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst/>
    <pageLast/>
    <pageNumber/>
    <edition/>
    <issue>1</issue>
    <volume>1110</volume>
    <type>conferenceobject</type>
    <publisherName>AIP Publishing</publisherName>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Numerical Analysis of Parametric Downconversion</title>
    <abstract language="eng">Parametric downconversion (PDC) is a popular technique to produce twin beams of photons that are entangled in multiple degrees of freedom. The generated states form the basis for numerous applications that require entanglement. An exact quantification of this resource is therefore essential, for instance for quantum cryptography that relies on a complete knowledge of the correlation contained in the state. While the determination of an entanglement monotone for the PDC process is only possible analytically in special cases, an exact calculation must usually be performed numerically. Recent work by Mikhailova et al. [2] analyses a certain class of PDC states for which the concurrence entanglement measure can be obtained by an analytical approximation. In this contribution, we analyse the validity of the approximation by comparison with exact numerical methods.</abstract>
    <parentTitle language="eng">AIP Conference Proceedings</parentTitle>
    <identifier type="doi">10.1063/1.3131312</identifier>
    <enrichment key="ConferenceStatement">Proc. 8th Int. Conf. on Quantum Comm., Meas. and Comp., Calgary, Kanada (2008)</enrichment>
    <enrichment key="BegutachtungStatus">peer-reviewed</enrichment>
    <licence>Keine Lizenz - Es gilt das deutsche Urheberrecht: § 53 UrhG</licence>
    <author>Wolfgang Mauerer</author>
    <author>Christine Silberhorn</author>
    <collection role="institutes" number="FakIM">Fakultät Informatik und Mathematik</collection>
    <collection role="othpublikationsherkunft" number="">Externe Publikationen</collection>
    <collection role="othforschungsschwerpunkt" number="16311">Digitalisierung</collection>
    <collection role="institutes" number="">Labor für Digitalisierung (LFD)</collection>
  </doc>
  <doc>
    <id>3903</id>
    <completedYear/>
    <publishedYear>2019</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst/>
    <pageLast/>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume/>
    <type>conferencesummary</type>
    <publisherName/>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">OSS Community, Health and Ecosystem Research: Theory and, or Theory versus Practice?</title>
    <parentTitle language="eng">2nd International Workshop on Software Health (SoHEAL@ICSE, Montréal), 2019</parentTitle>
    <enrichment key="BegutachtungStatus">peer-reviewed</enrichment>
    <author>Wolfgang Mauerer</author>
    <collection role="institutes" number="FakIM">Fakultät Informatik und Mathematik</collection>
    <collection role="othforschungsschwerpunkt" number="16311">Digitalisierung</collection>
    <collection role="institutes" number="">Labor für Digitalisierung (LFD)</collection>
  </doc>
  <doc>
    <id>3884</id>
    <completedYear/>
    <publishedYear>2018</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">System Software for Manufacturing Systems</title>
    <parentTitle language="eng">Proc. First European Advances in Digital Transformation Conference, (2018)</parentTitle>
    <author>Ralf Ramsauer</author>
    <author>Daniel Lohmann</author>
    <author>Wolfgang Mauerer</author>
    <collection role="institutes" number="FakIM">Fakultät Informatik und Mathematik</collection>
    <collection role="othforschungsschwerpunkt" number="16311">Digitalisierung</collection>
    <collection role="institutes" number="">Labor für Digitalisierung (LFD)</collection>
  </doc>
  <doc>
    <id>3897</id>
    <completedYear/>
    <publishedYear>2016</publishedYear>
    <thesisYearAccepted/>
    <language>deu</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="deu">A Virtual Computing Platform for the Internet of Things</title>
    <parentTitle language="deu">Embedded Linux Conference (San Diego), 2016</parentTitle>
    <author>Wolfgang Mauerer</author>
    <collection role="institutes" number="FakIM">Fakultät Informatik und Mathematik</collection>
    <collection role="othforschungsschwerpunkt" number="16311">Digitalisierung</collection>
    <collection role="institutes" number="">Labor für Digitalisierung (LFD)</collection>
  </doc>
</export-example>
