<?xml version="1.0" encoding="utf-8"?>
<export-example>
  <doc>
    <id>5337</id>
    <completedYear/>
    <publishedYear>2022</publishedYear>
    <thesisYearAccepted/>
    <language>deu</language>
    <pageFirst/>
    <pageLast/>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume/>
    <type>conferencepresentation</type>
    <publisherName/>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="deu">Fork à la carte für In-Memory-Datenbanken</title>
    <parentTitle language="deu">Frühjahrstreffen der Fachgruppen Betriebssysteme, Hamburg, 17. März 2022</parentTitle>
    <identifier type="url">https://www.lfdr.de/Publications/2022/FGBS_Spring22_Mintel.pdf</identifier>
    <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>Mario Mintel</author>
    <author>Ralf Ramsauer</author>
    <author>Daniel Lohmann</author>
    <author>Stefanie Scherzinger</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>5758</id>
    <completedYear/>
    <publishedYear>2017</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst/>
    <pageLast/>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume/>
    <type>conferencepresentation</type>
    <publisherName/>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">The Many Approaches to Real-Time and Safety-Critical Linux</title>
    <parentTitle language="eng">Open Source Summit Japan 2017</parentTitle>
    <identifier type="url">http://events17.linuxfoundation.org/sites/events/files/slides/talk_10.pdf</identifier>
    <enrichment key="opus.doi.autoCreate">false</enrichment>
    <enrichment key="opus.urn.autoCreate">true</enrichment>
    <licence>Keine Lizenz - Es gilt das deutsche Urheberrecht: § 53 UrhG</licence>
    <author>Wolfgang Mauerer</author>
    <author>Ralf Ramsauer</author>
    <author>Andreas Kölbl</author>
    <collection role="institutes" number="FakIM">Fakultät Informatik und Mathematik</collection>
    <collection role="othforschungsschwerpunkt" number="16311">Digitalisierung</collection>
    <collection role="institutes" number="RCAI">Regensburg Center for Artificial Intelligence - RCAI</collection>
  </doc>
  <doc>
    <id>6640</id>
    <completedYear/>
    <publishedYear>2023</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst/>
    <pageLast/>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume/>
    <type>conferencepresentation</type>
    <publisherName/>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Semi-Formal Verification of Embedded Linux Systems Using Trace-Based Models</title>
    <parentTitle language="eng">Semi-Formal Verification of Embedded Linux Systems Using Trace-Based Models</parentTitle>
    <identifier type="url">https://www.lfdr.de/Publications/2022/bielmeier_ossj22.pdf</identifier>
    <identifier type="url">https://www.youtube.com/watch?v=w42ab8-CH1o</identifier>
    <enrichment key="opus.doi.autoCreate">false</enrichment>
    <enrichment key="opus.urn.autoCreate">true</enrichment>
    <author>Benno Bielmeier</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>3664</id>
    <completedYear/>
    <publishedYear>2019</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst/>
    <pageLast/>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume/>
    <type>conferencepresentation</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 Japan (Tokio) and OSSNA 17.07.2019</parentTitle>
    <identifier type="url">https://events19.linuxfoundation.org/wp-content/uploads/2018/07/talk.pdf</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>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>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>
  <doc>
    <id>5345</id>
    <completedYear/>
    <publishedYear>2022</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst>100</pageFirst>
    <pageLast>114</pageLast>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume/>
    <type>conferenceobject</type>
    <publisherName>Springer</publisherName>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">QPU-System Co-Design for Quantum HPC Accelerators?</title>
    <abstract language="eng">The use of quantum processing units (QPUs) promises speed-ups for solving computational problems, but the quantum devices currently available possess only a very limited number of qubits and suffer from considerable imperfections. One possibility to progress towards practical utility is to use a co-design approach: Problem formulation and algorithm, but also the physical QPU properties are tailored to the specific application. Since QPUs will likely be used as accelerators for classical computers, details of systemic integration into existing architectures are another lever to influence and improve the practical utility of QPUs.&#13;
In this work, we investigate the influence of different parameters on the runtime of quantum programs on tailored hybrid CPU-QPU-systems. We study the influence of communication times between CPU and QPU, how adapting QPU designs influences quantum and overall execution performance, and how these factors interact. Using a simple model that allows for estimating which design choices should be subjected to optimisation for a given task, we provide an intuition to the HPC community on potentials and limitations of co-design approaches. We also discuss physical limitations for implementing the proposed changes on real quantum hardware devices.</abstract>
    <parentTitle language="eng">Architecture of Computing Systems: 35th International Conference, ARCS 2022, Heilbronn, Germany, September 13–15, 2022, Proceedings</parentTitle>
    <identifier type="doi">10.1007/978-3-031-21867-5_7</identifier>
    <identifier type="isbn">978-3-031-21866-8</identifier>
    <note>Preprint unter: https://arxiv.org/abs/2208.11449</note>
    <enrichment key="OtherSeries">Lecture Notes in Computer Science book series; 13642</enrichment>
    <enrichment key="BegutachtungStatus">peer-reviewed</enrichment>
    <licence>Keine Lizenz - Es gilt das deutsche Urheberrecht: § 53 UrhG</licence>
    <author>Karen Wintersperger</author>
    <author>Hila Safi</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>5755</id>
    <completedYear/>
    <publishedYear>2021</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst/>
    <pageLast/>
    <pageNumber>11</pageNumber>
    <edition/>
    <issue/>
    <volume/>
    <type>preprint</type>
    <publisherName/>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">McFSM: Near Turing-Complete Finite-State Based Programming</title>
    <abstract language="eng">Finite state machines (FSMs) are an appealing mechanism for simple practical computations: They lend themselves to very effcient and deterministic implementation, are easy to understand, and allow for formally proving many properties of interest. Unfortunately,  their computational power is deemed insuffcient for many tasks, and their usefulness has been further hampered by the state space explosion problem and other issues when naïvely trying to scale them to sizes large enough for many real–life applications.&#13;
This paper expounds on theory and implementation of multiple coupled fnite state machines (McFSMs), a novel mechanism that combines benefits of FSMs with near Turing-complete, practical computing power, and that was designed from the ground up to support static analysis and reasoning. We develop an elaborate category–theoretical foundation based on non–deterministic Mealy machines, which gives a suitable algebraic description for novel ways of blending di#erent computing models. Our experience is based on a domain specific language and an integrated development environment that can compile McFSM models to multiple target languages, applying it to use-cases based on industrial scenarios. We discuss properties and advantages of McFSMs, explain how the mechanism can interact with real–world systems and existing code without sacrificing provability, determinism or performance.&#13;
We discuss how McFSMs can be used to replace and improve on commonly employed programming patterns, and show how their effcient handling of large state spaces enables them to be used as core building blocks for distributed, safety critical, and real–time systems of industrial complexity, which contributes to the longdesired goal of providing executable specifications.</abstract>
    <identifier type="url">https://www.lfdr.de/Publications/2021/MuMa21.pdf</identifier>
    <licence>Keine Lizenz - Es gilt das deutsche Urheberrecht: § 53 UrhG</licence>
    <author>Florian Murr</author>
    <author>Wolfgang Mauerer</author>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Finite state machines</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Mealy machines</value>
    </subject>
    <subject>
      <language>deu</language>
      <type>uncontrolled</type>
      <value>automata</value>
    </subject>
    <subject>
      <language>deu</language>
      <type>uncontrolled</type>
      <value>coupled machines</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>executable specifcation</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>category theory</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>generative approaches</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>formal models</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>static analysis</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>5812</id>
    <completedYear/>
    <publishedYear>2022</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst>1</pageFirst>
    <pageLast>4</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">Beyond the badge: reproducibility engineering as a lifetime skill</title>
    <abstract language="eng">Ascertaining reproducibility of scientific experiments is receiving increased attention across disciplines. We argue that the necessary skills are important beyond pure scientific utility, and that they should be taught as part of software engineering (SWE) education. They serve a dual purpose: Apart from acquiring the coveted badges assigned to reproducible research, reproducibility engineering is a lifetime skill for a professional industrial career in computer science.&#13;
SWE curricula seem an ideal fit for conveying such capabilities, yet they require some extensions, especially given that even at flagship conferences like ICSE, only slightly more than one-third of the technical papers (at the 2021 edition) receive recognition for artefact reusability. Knowledge and capabilities in setting up engineering environments that allow for reproducing artefacts and results over decades (a standard requirement in many traditional engineering disciplines), writing semi-literate commit messages that document crucial steps of a decision-making process and that are tightly coupled with code, or sustainably taming dynamic, quickly changing software dependencies, to name a few: They all contribute to solving the scientific reproducibility crisis, and enable software engineers to build sustainable, long-term maintainable, software-intensive, industrial systems. We propose to teach these skills at the undergraduate level, on par with traditional SWE topics.</abstract>
    <parentTitle language="eng">Proceedings 4th International Workshop on Software Engineering Education for the Next Generation SEENG 2022, 17 May 2022, Pittsburgh, PA, USA</parentTitle>
    <identifier type="isbn">9781450393362</identifier>
    <identifier type="doi">10.1145/3528231.3528359</identifier>
    <note>Preprint unter: https://doi.org/10.48550/arXiv.2203.05283</note>
    <enrichment key="opus.import.date">2023-02-14T16:16:10+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>Stefan Klessinger</author>
    <author>Stefanie Scherzinger</author>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>reproducibility engineering</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>teaching 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>5816</id>
    <completedYear/>
    <publishedYear>2023</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst/>
    <pageLast/>
    <pageNumber>8</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">Quantum Machine Learning: Foundation, New Techniques, and Opportunities for Database Research</title>
    <abstract language="eng">In the last few years, the field of quantum computing has experienced remarkable progress. The prototypes of quantum computers already exist and have been made available to users through cloud services (e.g., IBM Q experience, Google quantum AI, or Xanadu quantum cloud). While fault-tolerant and large-scale quantum computers are not available yet (and may not be for a long time, if ever), the potential of this new technology is undeniable. Quantum algorithms havethe proven ability to either outperform classical approaches for several tasks, or are impossible to be efficiently simulated by classical means under reasonable complexity-theoretic assumptions. Even imperfect current-day technology is speculated to exhibit computational advantages over classical systems. Recent research is using quantum computers to solve machine learning tasks. Meanwhile, the database community already successfully applied various machine learning algorithms for data management tasks, so combining the fields seems to be a promising endeavour. However, quantum machine learning is a new research field for most database researchers. In this tutorial, we provide a fundamental introduction to quantum computing and quantum machine learning and show the potential benefits and applications for database research. In addition, we demonstrate how to apply quantum machine learning to the optimization of join order problem for databases.</abstract>
    <parentTitle language="eng">SIGMOD '23, proceedings of the 2023 International Conference on Management of Data: June 18-23, 2023, Seattle, WA, USA</parentTitle>
    <identifier type="doi">10.1145/3555041.3589404</identifier>
    <enrichment key="opus.import.date">2023-02-14T16:16:10+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>Tobias Winker</author>
    <author>Sven Groppe</author>
    <author>Valter Johan Edvard Uotila</author>
    <author>Zhengtong Yan</author>
    <author>Jiaheng Lu</author>
    <author>Franz Maja</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>7684</id>
    <completedYear/>
    <publishedYear>2024</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">Approximating under the Influence of Quantum Noise and Compute Power</title>
    <abstract language="deu">The quantum approximate optimisation algorithm (QAOA) is at the core of many scenarios that aim to combine the power of quantum computers and classical high-performance computing appliances for combinatorial optimisation. Several obstacles challenge concrete benefits now and in the foreseeable future: Imperfections quickly degrade algorithmic performance below practical utility; overheads arising from alternating between classical and quantum primitives can counter any advantage; and the choice of parameters or algorithmic variant can substantially influence runtime and result quality. Selecting the optimal combination is a non-trivial issue, as it not only depends on user requirements, but also on details of the hardware and software stack. Appropriate automation can lift the burden of choosing optimal combinations for end-users: They should not be required to understand technicalities like differences between QAOA variants, required number of QAOA layers, or necessary measurement samples. Yet, they should receive best-possible satisfaction of their non-functional requirements, be it performance or other. We determine factors that affect solution quality and temporal behaviour of four QAOA variants using comprehensive density-matrix-based simulations targeting three widely studied optimisation problems. Our simulations consider ideal quantum computation, and a continuum of scenarios troubled by realistic imperfections. Our quantitative results, accompanied by a comprehensive reproduction package, show strong differences between QAOA variants that can be pinpointed to narrow and specific effects. We identify influential co-variables and relevant non-functional quality goals that, we argue, mark the relevant ingredients for designing appropriate software engineering abstraction mechanisms and automated tool-chains for devising quantum solutions from high-level problem specifications.</abstract>
    <parentTitle language="eng">Proceedings of WIHPQC@IEEE QCE</parentTitle>
    <identifier type="arxiv">2408.02287</identifier>
    <enrichment key="opus.import.date">2024-09-11T22:10:01+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>Creative Commons - CC BY - Namensnennung 4.0 International</licence>
    <author>Simon Thelen</author>
    <author>Hila Safi</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>7686</id>
    <completedYear/>
    <publishedYear>2024</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">Guided-SPSA: Simultaneous Perturbation Stochastic Approximation assisted by the Parameter Shift Rule</title>
    <abstract language="eng">The study of variational quantum algorithms (VQCs) has received significant attention from the quantum computing community in recent years. These hybrid algorithms, utilizing both classical and quantum components, are well-suited for noisy intermediate-scale quantum devices. Though estimating exact gradients using the parameter-shift rule to optimize the VQCs is realizable in NISQ devices, they do not scale well for larger problem sizes. The computational complexity, in terms of the number of circuit evaluations required for gradient estimation by the parameter-shift rule, scales linearly with the number of parameters in VQCs. On the other hand, techniques that approximate the gradients of the VQCs, such as the simultaneous perturbation stochastic approximation (SPSA), do not scale with the number of parameters but struggle with instability and often attain suboptimal solutions. In this work, we introduce a novel gradient estimation approach called Guided-SPSA, which meaningfully combines the parameter-shift rule and SPSA-based gradient approximation. The Guided-SPSA results in a 15% to 25% reduction in the number of circuit evaluations required during training for a similar or better optimality of the solution found compared to the parameter-shift rule. The Guided-SPSA outperforms standard SPSA in all scenarios and outperforms the parameter-shift rule in scenarios such as suboptimal initialization of the parameters. We demonstrate numerically the performance of Guided-SPSA on different paradigms of quantum machine learning, such as regression, classification, and reinforcement learning.</abstract>
    <identifier type="arxiv">2404.15751</identifier>
    <enrichment key="opus.import.date">2024-09-11T22:10:01+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>Maniraman Periyasamy</author>
    <author>Axel Plinge</author>
    <author>Christopher Mutschler</author>
    <author>Daniel D. Scherer</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>7683</id>
    <completedYear/>
    <publishedYear>2023</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst/>
    <pageLast/>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume/>
    <type>conferenceobject</type>
    <publisherName>Springer Nature</publisherName>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Optimization Problems in Production and Planning: Approaches and Limitations in View of Possible Quantum Superiority</title>
    <parentTitle language="eng">Annals of Scientific Society for Assembly, Handling and Industrial Robotics 2023</parentTitle>
    <identifier type="isbn">9783031740091</identifier>
    <enrichment key="opus.import.date">2024-09-11T22:10:01+00:00</enrichment>
    <enrichment key="opus.source">sword</enrichment>
    <enrichment key="opus.import.user">importuser</enrichment>
    <enrichment key="ConferenceStatement">8th MHI Colloquium, 22. und 23. Juni 2023, Chemnitz</enrichment>
    <licence>Keine Lizenz - Es gilt das deutsche Urheberrecht: § 53 UrhG</licence>
    <author>Maximilian Zwingel</author>
    <author>Oguz Kedilioglu</author>
    <author>Sebastian Reitelshöfer</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>6650</id>
    <completedYear/>
    <publishedYear>2023</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst/>
    <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">Workshop Summary: Quantum Machine Learning</title>
    <parentTitle language="eng">2023 IEEE International Conference on Quantum Computing and Engineering, Bellevue, WA, United States, September 17-22, 2023</parentTitle>
    <identifier type="doi">10.1109/QCE57702.2023.10174</identifier>
    <licence>Keine Lizenz - Es gilt das deutsche Urheberrecht: § 53 UrhG</licence>
    <author>Volker Tresp</author>
    <author>Steffen Udluft</author>
    <author>Daniel Hein</author>
    <author>Werner Hauptmann</author>
    <author>Martin Leib</author>
    <author>Christopher Mutschler</author>
    <author>Daniel D. Scherer</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>7690</id>
    <completedYear/>
    <publishedYear>2024</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst>27</pageFirst>
    <pageLast>37</pageLast>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume/>
    <type>conferenceobject</type>
    <publisherName>ACM</publisherName>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Quantum Data Encoding Patterns and their Consequences</title>
    <abstract language="eng">The use of quantum processing units (QPUs) promises speed-ups for solving computational problems, in particular for discrete optimisation. While a few groundbreaking algorithmic approaches are known that can provably outperform classical computers, we observe a scarcity of programming abstractions for constructing efficient quantum algorithms. A good fraction of the literature that addresses solving concrete problems related to database management concentrates on casting them as quadratic unconstrained binary optimisation problems (QUBOs), which can then, among others, be processed on gate-based machines (using the quantum approximate optimisation algorithm), or quantum annealers. A critical aspect that affects efficiency and scalability of either of these approaches is how classical data are loaded into qubits, respectively how problems are encoded into QUBO representation. The effectiveness of encodings is known to be of crucial importance for quantum computers, especially since the amount of available qubits is strongly limited in the era of noisy, intermediate-size quantum computers.&#13;
In this paper, we present three encoding patterns, discuss their impact on scalability, and their ease of use. We consider the recreational (yet computationally challenging) Sudoku problem and its reduction to graph colouring as an illustrative example to discuss their individual benefits and disadvantages. Our aim is enable database researchers to choose an appropriate encoding scheme for their purpose without having to acquire in-depth knowledge on quantum peculiarities, thus easing the path towards applying quantum acceleration on data management systems.</abstract>
    <parentTitle language="eng">Q-Data '24: Proceedings of the 1st Workshop on Quantum Computing and Quantum-Inspired Technology for Data-Intensive Systems and Applications, June 9 - 15, 2024, Santiago AA Chile</parentTitle>
    <identifier type="doi">10.1145/3665225.3665446</identifier>
    <identifier type="isbn">979-8-4007-0553-3</identifier>
    <enrichment key="opus.import.date">2024-09-11T22:10:01+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">true</enrichment>
    <licence>Keine Lizenz - Es gilt das deutsche Urheberrecht: § 53 UrhG</licence>
    <author>Martin Gogeißl</author>
    <author>Hila Safi</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>7689</id>
    <completedYear/>
    <publishedYear>2024</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">QCEDA: Using Quantum Computers for EDA</title>
    <abstract language="eng">The field of Electronic Design Automation (EDA) is crucial for microelectronics, but the increasing complexity of Integrated Circuits (ICs) poses challenges for conventional EDA: Corresponding problems are often NP-hard and are therefore in general solved by heuristics, not guaranteeing optimal solutions. Quantum computers may offer better solutions due to their potential for optimization through entanglement, superposition, and interference. Most of the works in the area of EDA and quantum computers focus on how to use EDA for building quantum circuits. However, almost no research focuses on exploiting quantum computers for solving EDA problems. Therefore, this paper investigates the feasibility and potential of quantum computing for a typical EDA optimization problem broken down to the Min-k-Union problem. The problem is mathematically transformed into a Quadratic Unconstrained Binary Optimization (QUBO) problem, which was successfully solved on an IBM quantum computer and a D-Wave quantum annealer.</abstract>
    <identifier type="arxiv">2403.12998</identifier>
    <enrichment key="opus.import.date">2024-09-11T22:10:01+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">true</enrichment>
    <licence>Keine Lizenz - Es gilt das deutsche Urheberrecht: § 53 UrhG</licence>
    <author>Matthias Jung</author>
    <author>Sven O. Krumke</author>
    <author>Christof Schroth</author>
    <author>Elisabeth Lobe</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>7692</id>
    <completedYear/>
    <publishedYear>2024</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst/>
    <pageLast/>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume/>
    <type>bookpart</type>
    <publisherName>Springer Nature</publisherName>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Superoperators for Quantum Software Engineering</title>
    <abstract language="deu">As implementations of quantum computers grow in size and maturity, the question of how to program this new class of machines is attracting increasing attention in the software engineering domain. Yet, many questions from how to design expressible quantum languages augmented with formal semantics via implementing appropriate optimizing compilers to abstracting details of machine properties in software systems remain challenging. Performing research at this intersection of quantum computing and software engineering requires sufficient knowledge of the physical processes underlying quantum computations, and how to model these. In this chapter, we review a superoperator-based approach to quantum dynamics, as it can provide means that are sufficiently abstract, yet concrete enough to be useful in quantum software and systems engineering, and outline how it is used in several important applications in the field.</abstract>
    <parentTitle language="eng">Quantum Software: Aspects of Theory and System Design</parentTitle>
    <identifier type="doi">10.1007/978-3-031-64136-7_3</identifier>
    <identifier type="issn">978-3-031-64136-7</identifier>
    <enrichment key="opus.import.date">2024-09-11T22:10:01+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>Creative Commons - CC BY - Namensnennung 4.0 International</licence>
    <author>Wolfgang Mauerer</author>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>quantum computing</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>quantum software engineering</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>software development</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>software engineering</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>6050</id>
    <completedYear/>
    <publishedYear>2023</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst>104</pageFirst>
    <pageLast>115</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">Influence of HW-SW-Co-Design on Quantum Computing Scalability</title>
    <abstract language="eng">The use of quantum processing units (QPUs) promises speed-ups for solving computational problems. Yet, current devices are limited by the number of qubits and suffer from significant imperfections, which prevents achieving quantum advantage. To step towards practical utility, one approach is to apply hardware-software co-design methods. This can involve tailoring problem formulations and algorithms to the quantum execution environment, but also entails the possibility of adapting physical properties of the QPU to specific applications. In this work, we follow the latter path, and investigate how key figures— circuit depth and gate count—required to solve four cornerstone NP-complete problems vary with tailored hardware properties. Our results reveal that achieving near-optimal performance and properties does not necessarily require optimal quantum hardware, but can be satisfied with much simpler structures that can potentially be realised for many hardware approaches.m Using statistical analysis techniques, we additionally identify an underlying general model that applies to all subject problems. This suggests that our results may be universally applicable to other algorithms and problem domains, and tailored QPUs can find utility outside their initially envisaged problem domains.&#13;
The substantial possible improvements nonetheless highlight the importance of QPU tailoring to progress towards practical deployment and scalability of quantum software.</abstract>
    <parentTitle language="eng">2023 IEEE International Conference on Quantum Software (QSW), Chicago, IL, USA, 02-08 July 2023</parentTitle>
    <identifier type="doi">10.1109/QSW59989.2023.00022</identifier>
    <identifier type="isbn">979-8-3503-0479-4</identifier>
    <enrichment key="BegutachtungStatus">peer-reviewed</enrichment>
    <licence>Keine Lizenz - Es gilt das deutsche Urheberrecht: § 53 UrhG</licence>
    <author>Hila Safi</author>
    <author>Karen Wintersperger</author>
    <author>Wolfgang Mauerer</author>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>quantum computing</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>software engineering</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>hardware-software co-design</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>quantum algorithm performance analysis</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>scalability of quantum applications</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>6047</id>
    <completedYear/>
    <publishedYear>2023</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst/>
    <pageLast/>
    <pageNumber>27</pageNumber>
    <edition/>
    <issue/>
    <volume>10</volume>
    <type>article</type>
    <publisherName>Springer Nature</publisherName>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Neutral Atom Quantum Computing Hardware: Performance and End-User Perspective</title>
    <abstract language="eng">We present an industrial end-user perspective on the current state of quantum computing hardware for one specific technological approach, the neutral atom platform. Our aim is to assist developers in understanding the impact of the specific properties of these devices on the effectiveness of algorithm execution. Based on discussions with different vendors and recent literature, we discuss the performance data of the neutral atom platform. Specifically, we focus on the physical qubit architecture, which affects state preparation, qubit-to-qubit connectivity, gate fidelities, native gate instruction set, and individual qubit stability. These factors determine both the quantum-part execution time and the end-to-end wall clock time relevant for end-users, but also the ability to perform fault-tolerant quantum computation in the future. We end with an overview of which applications have been shown to be well suited for the peculiar properties of neutral atom-based quantum computers.</abstract>
    <parentTitle language="eng">EPJ Quantum Technology</parentTitle>
    <identifier type="doi">10.1140/epjqt/s40507-023-00190-1</identifier>
    <enrichment key="BegutachtungStatus">peer-reviewed</enrichment>
    <licence>Creative Commons - CC BY - Namensnennung 4.0 International</licence>
    <author>Karen Wintersperger</author>
    <author>Florian Dommert</author>
    <author>Thomas Ehmer</author>
    <author>Andrey Hoursanov</author>
    <author>Johannes Klepsch</author>
    <author>Wolfgang Mauerer</author>
    <author>Georg Reuber</author>
    <author>Thomas Strohm</author>
    <author>Ming Yin</author>
    <author>Sebastian Luber</author>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Neutral atom quantum computers</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Review</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Quantum computing platforms</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Performance metrics</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Benchmarks</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>6052</id>
    <completedYear/>
    <publishedYear>2023</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst>31</pageFirst>
    <pageLast>42</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">Effects of Imperfections on Quantum Algorithms</title>
    <abstract language="eng">Quantum computers promise considerable speedups over classical approaches, which has raised interest from many disciplines. Since any currently available implementations suffer from noise and imperfections, achieving concrete speedups for meaningful problem sizes remains a major challenge. Yet, imperfections and noise may remain present in quantum computing for a long while. Such limitations play no role in classical software computing, and software engineers are typically not well accustomed to considering such imperfections, albeit they substantially influence core properties of software and systems. In this paper, we show how to model imperfections with an approach tailored to (quantum) software engineers. We intuitively illustrate, using numerical simulations, how imperfections influence core properties of quantum algorithms on NISQ systems, and show possible options for tailoring future NISQ machines to improve system performance in a co-design approach. Our results are obtained from a software framework that we provide in form of an easy-to-use reproduction package. It does not require computer scientists to acquire deep physical knowledge on noise, yet provide tangible and intuitively accessible means of interpreting the influence of noise on common software quality and performance indicators.</abstract>
    <parentTitle language="eng">2023 IEEE International Conference on Quantum Software (QSW), Chicago, IL, USA, 02-08 July 2023</parentTitle>
    <subTitle language="eng">A Software Engineering Perspective</subTitle>
    <identifier type="doi">10.1109/QSW59989.2023.00014</identifier>
    <enrichment key="BegutachtungStatus">peer-reviewed</enrichment>
    <licence>Keine Lizenz - Es gilt das deutsche Urheberrecht: § 53 UrhG</licence>
    <author>Felix Greiwe</author>
    <author>Tom Krüger</author>
    <author>Wolfgang Mauerer</author>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>noisy quantum computing</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>NISQ systems</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>quantum software engineering</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>HW-SW co-design</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>6051</id>
    <completedYear/>
    <publishedYear>2023</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst>1</pageFirst>
    <pageLast>23</pageLast>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume/>
    <type>bookpart</type>
    <publisherName/>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Challenges and Opportunities in Quantum Software Architecture</title>
    <abstract language="eng">Quantum computing is a relatively new paradigm that has raised considerable interest in physics and computer science in general but has so far received little attention in software engineering and architecture. Hybrid applications that consist of both quantum and classical components require the development of appropriate quantum software architectures. However, given that quantum software engineering (QSE) in general is a new research area, quantum software architecture–a subresearch area in QSE is also understudied. The goal of this chapter is to provide a list of research challenges and opportunities for such architectures. In addition, to make the content understandable to a broader computer science audience, we provide a brief overview of quantum computing and explain the essential technical foundations.</abstract>
    <parentTitle language="eng">Software Architecture: Research Roadmaps from the Community</parentTitle>
    <identifier type="doi">10.1007/978-3-031-36847-9_1</identifier>
    <identifier type="isbn">978-3-031-36847-9</identifier>
    <enrichment key="ConferenceStatement">Recent Trends in Software Architecture</enrichment>
    <licence>Keine Lizenz - Es gilt das deutsche Urheberrecht: § 53 UrhG</licence>
    <author>Tao Yue</author>
    <author>Wolfgang Mauerer</author>
    <author>Shaukat Ali</author>
    <author>Davide Taibi</author>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Quantum Computing</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Software Architecture</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Quantum Applications</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Quantum 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>6475</id>
    <completedYear/>
    <publishedYear>2023</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst>1</pageFirst>
    <pageLast>12</pageLast>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume/>
    <type>conferenceobject</type>
    <publisherName>RWTH Aachen, Sun SITE Central Europe</publisherName>
    <publisherPlace>Aachen</publisherPlace>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Quantum Optimisation of General Join Trees</title>
    <abstract language="eng">Recent advances in the manufacture of quantum computers attract much attention over a wide range of fields, as early-stage quantum processing units (QPU) have become accessible. While contemporary quantum machines are very limited in size and capabilities, mature QPUs are speculated to eventually excel at optimisation problems. This makes them an attractive technology for database problems, many of which are based on complex optimisation problems with large solution spaces. Yet, the use of quantum approaches on database problems remains largely unexplored. In this paper, we address the long-standing join ordering problem, one of the most extensively researched database problems. Rather than running arbitrary code, QPUs require specific mathematical problem encodings. An encoding for the join ordering problem was recently proposed, allowing first small-scale queries to be optimised on quantum hardware. However, it is based on a faithful transformation of a mixed integer linear programming (MILP) formulation for JO, and inherits all limitations of the MILP method. Most strikingly, the existing encoding only considers a solution space with left-deep join trees, which tend to yield larger costs than general, bushy join trees. We propose a novel QUBO encoding for the join ordering problem. Rather than transforming existing formulations, we&#13;
construct a native encoding tailored to quantum systems, which allows us to process general bushy join trees. This makes the&#13;
full potential of QPUs available for solving join order optimisation problems.</abstract>
    <parentTitle language="eng">Joint Workshops at 49th International Conference on Very Large Data Bases (VLDBW’23) — International Workshop on Quantum Data Science and Management (QDSM’23), August 28 - September 1, 2023, Vancouver, Canada (CEUR Workshop Proceedings)</parentTitle>
    <identifier type="url">https://ceur-ws.org/Vol-3462/QDSM2.pdf</identifier>
    <licence>Creative Commons - CC BY - Namensnennung 4.0 International</licence>
    <author>Manuel Schönberger</author>
    <author>Immanuel Trummer</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>6474</id>
    <completedYear/>
    <publishedYear>2023</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst/>
    <pageLast/>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume/>
    <type>conferenceobject</type>
    <publisherName>RWTH Aachen, Sun SITE Central Europe</publisherName>
    <publisherPlace>Aachen</publisherPlace>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Preface QDSM</title>
    <abstract language="eng">The first international workshop on Quantum Data Science and anagement (QDSM), co-located with VLDB 2023, is centered around addressing the possibilities of quantum computing for data science and data management. Quantum computing is a relatively new and emerging field that is believed to have huge computational potential in the future. In the QDSM workshop, we want to provide a venue for discussing and publishing novel results of applying quantum computing to hard data science and data management problems. These problems include join order optimization, designing efficient quantum feature maps, studying possibilities of solving linear programs with quantum algorithms, and divergent index tuning with quantum machine learning. Besides, we include a short and visionary survey on quantum computing for databases. Theworkshop provides a platform for active discussion on these and related topics.</abstract>
    <parentTitle language="eng">Joint Workshops at 49th International Conference on Very Large Data Bases (VLDBW’23) — International Workshop on Quantum Data Science and Management (QDSM’23), August 28 - September 1, 2023, Vancouver, Canada (CEUR Workshop Proceedings)</parentTitle>
    <identifier type="url">https://ceur-ws.org/Vol-3462/QDSM1.pdf</identifier>
    <enrichment key="opus.doi.autoCreate">false</enrichment>
    <enrichment key="opus.urn.autoCreate">true</enrichment>
    <licence>Creative Commons - CC BY - Namensnennung 4.0 International</licence>
    <author>Valter Uotila</author>
    <author>Sven Groppe</author>
    <author>Le Gruenwald</author>
    <author>Jiaheng Lu</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>3676</id>
    <completedYear/>
    <publishedYear>2017</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst>164</pageFirst>
    <pageLast>174</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">Classifying Developers into Core and Peripheral: An Empirical Study on Count and Network Metrics</title>
    <abstract language="eng">Knowledge about the roles developers play in a software project is crucial to understanding the project's collaborative dynamics. In practice, developers are often classified according to the dichotomy of core and peripheral roles. Typically, count-based operationalizations, which rely on simple counts of individual developer activities (e.g., number of commits), are used for this purpose, but there is concern regarding their validity and ability to elicit meaningful insights. To shed light on this issue, we investigate whether count-based operationalizations of developer roles produce consistent results, and we validate them with respect to developers' perceptions by surveying 166 developers. Improving over the state of the art, we propose a relational perspective on developer roles, using fine-grained developer networks modeling the organizational structure, and by examining developer roles in terms of developers' positions and stability within the developer network. In a study of 10 substantial open-source projects, we found that the primary difference between the count-based and our proposed network-based core-peripheral operationalizations is that the network-based ones agree more with developer perception than count-based ones. Furthermore, we demonstrate that a relational perspective can reveal further meaningful insights, such as that core developers exhibit high positional stability, upper positions in the hierarchy, and high levels of coordination with other core developers, which confirms assumptions of previous work.</abstract>
    <parentTitle language="eng">2017 IEEE/ACM 39th International Conference on Software Engineering (ICSE),  Buenos Aires, Argentina, 20-28 May 2017</parentTitle>
    <identifier type="doi">10.1109/icse.2017.23</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>Mitchell Joblin</author>
    <author>Sven Apel</author>
    <author>Claus Hunsen</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>3681</id>
    <completedYear/>
    <publishedYear>2015</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst>563</pageFirst>
    <pageLast>573</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">From Developer Networks to Verified Communities: A Fine-Grained Approach</title>
    <abstract language="eng">Effective software engineering demands a coordinated effort. Unfortunately, a comprehensive view on developer coordination is rarely available to support software-engineering decisions, despite the significant implications on software quality, software architecture, and developer productivity. We present a fine-grained, verifiable, and fully automated approach to capture a view on developer coordination, based on commit information and source-code structure, mined from version-control systems. We apply methodology from network analysis and machine learning to identify developer communities automatically. Compared to previous work, our approach is fine-grained, and identifies statistically significant communities using order-statistics and a community-verification technique based on graph conductance. To demonstrate the scalability and generality of our approach, we analyze ten open-source projects with complex and active histories, written in various programming languages. By surveying 53 open-source developers from the ten projects, we validate the authenticity of inferred community structure with respect to reality. Our results indicate that developers of open-source projects form statistically significant community structures and this particular view on collaboration largely coincides with developers' perceptions of real-world collaboration.</abstract>
    <parentTitle language="eng">2015 IEEE/ACM 37th IEEE International Conference on Software Engineering, 16-24 May 2015, Florence, Italy</parentTitle>
    <identifier type="isbn">978-1-4799-1934-5</identifier>
    <identifier type="doi">10.1109/icse.2015.73</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>Mitchell Joblin</author>
    <author>Wolfgang Mauerer</author>
    <author>Sven Apel</author>
    <author>Janet Siegmund</author>
    <author>Dirk Riehle</author>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>collaboration</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Computer languages</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Measurement</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Open Source Software</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Software systems</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Standards</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>3640</id>
    <completedYear/>
    <publishedYear>2016</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst>2050</pageFirst>
    <pageLast>2094</pageLast>
    <pageNumber/>
    <edition/>
    <issue>4</issue>
    <volume>22</volume>
    <type>article</type>
    <publisherName>Springer</publisherName>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Evolutionary trends of developer coordination: a network approach</title>
    <abstract language="eng">Software evolution is a fundamental process that transcends the realm of technical artifacts and permeates the entire organizational structure of a software project. By means of a longitudinal empirical study of 18 large open-source projects, we examine and discuss the evolutionary principles that govern the coordination of developers. By applying a network-analytic approach, we found that the implicit and self-organizing structure of developer coordination is ubiquitously described by non-random organizational principles that defy conventional software-engineering wisdom. In particular, we found that: (a) developers form scale-free networks, in which the majority of coordination requirements arise among an extremely small number of developers, (b) developers tend to accumulate coordination requirements with more and more developers over time, presumably limited by an upper bound, and (c) initially developers are hierarchically arranged, but over time, form a hybrid structure, in which core developers are hierarchically arranged and peripheral developers are not. Our results suggest that the organizational structure of large projects is constrained to evolve towards a state that balances the costs and benefits of developer coordination, and the mechanisms used to achieve this state depend on the project’s scale.</abstract>
    <parentTitle language="eng">Empirical Software Engineering</parentTitle>
    <identifier type="doi">10.1007/s10664-016-9478-9</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>Mitchell Joblin</author>
    <author>Sven Apel</author>
    <author>Wolfgang Mauerer</author>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Developer coordination</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Developer networks</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Software 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>3639</id>
    <completedYear/>
    <publishedYear>2016</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst>149</pageFirst>
    <pageLast>158</pageLast>
    <pageNumber/>
    <edition/>
    <issue>1</issue>
    <volume>8</volume>
    <type>article</type>
    <publisherName/>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">An Interactive Survey Framework for Validation of Social Network Analysis</title>
    <abstract language="eng">Abstract Social network analysis is extremely well supported by the R community and is routinely used for studying the relationships between people engaged in collaborative activities. While there has been rapid development of new approaches and metrics in this field, the challenging question of validity (how well insights derived from social networks agree with reality) is often difficult to address. We propose the use of several R packages to generate interactive surveys that are specifically well suited for validating social network analyses. Using our web-based survey application, we were able to validate the results of applying community-detection algorithms to infer the organizational structure of software developers contributing to open-source projects.</abstract>
    <parentTitle language="eng">The R Journal</parentTitle>
    <identifier type="url">https://journal.r-project.org/archive/2016/RJ-2016-010/index.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>
    <enrichment key="BegutachtungStatus">peer-reviewed</enrichment>
    <enrichment key="opus.doi.autoCreate">false</enrichment>
    <enrichment key="opus.urn.autoCreate">false</enrichment>
    <author>Mitchell Joblin</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="oaweg" number="">Diamond Open Access - OA-Veröffentlichung ohne Publikationskosten (Sponsoring)</collection>
  </doc>
  <doc>
    <id>789</id>
    <completedYear/>
    <publishedYear>2019</publishedYear>
    <thesisYearAccepted/>
    <language>deu</language>
    <pageFirst/>
    <pageLast/>
    <pageNumber>72</pageNumber>
    <edition/>
    <issue/>
    <volume/>
    <type>periodicalpart</type>
    <publisherName/>
    <publisherPlace>Regensburg</publisherPlace>
    <creatingCorporation>Ostbayerische Technische Hochschule Regensburg</creatingCorporation>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>2019-06-30</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="deu">Forschung 2019</title>
    <abstract language="deu">Bericht mit Forschungsprojekten aus verschiedenen Bereichen der OTH Regensburg mit dem Schwerpunktthema "Künstliche Intelligenz" und einem Gespräch zur "Medizin der Zukunft"</abstract>
    <subTitle language="deu">Thema: Künstliche Intelligenz</subTitle>
    <identifier type="isbn">978-3-9818209-7-3</identifier>
    <identifier type="urn">urn:nbn:de:bvb:898-opus4-7890</identifier>
    <identifier type="doi">10.35096/othr/pub-789</identifier>
    <licence>Keine Lizenz - Es gilt das deutsche Urheberrecht: § 53 UrhG</licence>
    <author>Marie-Luise Appelhans</author>
    <author>Matthias Kampmann</author>
    <author>Jürgen Mottok</author>
    <author>Michael Riederer</author>
    <author>Klaus Nagl</author>
    <author>Oliver Steffens</author>
    <author>Jan Dünnweber</author>
    <author>Markus Wildgruber</author>
    <author>Julius Roth</author>
    <author>Timo Stadler</author>
    <author>Christoph Palm</author>
    <author>Martin Georg Weiß</author>
    <author>Sandra Rochholz</author>
    <author>Rudolf Bierl</author>
    <author>Andreas Gschossmann</author>
    <author>Sonja Haug</author>
    <author>Simon Schmidbauer</author>
    <author>Anna Koch</author>
    <author>Markus Westner</author>
    <author>Benedikt von Bary</author>
    <author>Andreas Ellermeier</author>
    <author>Daniel Vögele</author>
    <author>Frederik Maiwald</author>
    <author>Stefan Hierl</author>
    <author>Matthias Schlamp</author>
    <author>Ingo Ehrlich</author>
    <author>Marco Siegl</author>
    <author>Sven Hüntelmann</author>
    <author>Matthias Wildfeuer</author>
    <author>Oliver Brückl</author>
    <author>Michael Sterner</author>
    <author>Andreas Hofrichter</author>
    <author>Fabian Eckert</author>
    <author>Franz Bauer</author>
    <author>Belal Dawoud</author>
    <author>Hans-Peter Rabl</author>
    <author>Bernd Gamisch</author>
    <author>Ottfried Schmidt</author>
    <author>Michael Heberl</author>
    <author>Martin Thema</author>
    <author>Ulrike Mayer</author>
    <author>Johannes Eller</author>
    <author>Thomas Sippenauer</author>
    <author>Christian Adelt</author>
    <author>Matthias Haslbeck</author>
    <author>Bettina Vogl</author>
    <author>Wolfgang Mauerer</author>
    <author>Ralf Ramsauer</author>
    <author>Daniel Lohmann</author>
    <author>Irmengard Sax</author>
    <author>Thomas Gabor</author>
    <author>Sebastian Feld</author>
    <author>Claudia Linnhoff-Popien</author>
    <author>Robert Damian Ławrowski</author>
    <author>Christoph Langer</author>
    <author>Rupert Schreiner</author>
    <author>Josef Sellmair</author>
    <series>
      <title>Forschungsberichte der OTH Regensburg</title>
      <number>2019</number>
    </series>
    <subject>
      <language>deu</language>
      <type>swd</type>
      <value>Forschung</value>
    </subject>
    <subject>
      <language>deu</language>
      <type>swd</type>
      <value>Forschungsbericht</value>
    </subject>
    <subject>
      <language>deu</language>
      <type>swd</type>
      <value>Künstliche Intelligenz</value>
    </subject>
    <collection role="ddc" number="0">Informatik, Informationswissenschaft, allgemeine Werke</collection>
    <collection role="institutes" number="HL">Hochschulleitung/Hochschulverwaltung</collection>
    <collection role="othpublikationsherkunft" number="">Von der OTH Regensburg herausgegeben</collection>
    <collection role="institutes" number="IAFW">Zentrum für Forschung und Transfer (ZFT ab 2024; vorher: IAFW)</collection>
    <collection role="persons" number="sternerfenes">Sterner, Michael (Prof. Dr.) - FENES / Forschungsgruppe Energiespeicher</collection>
    <collection role="persons" number="bruecklfenes">Brückl, Oliver (Prof. Dr.) - FENES / Forschungsgruppe Energienetze</collection>
    <thesisPublisher>Ostbayerische Technische Hochschule Regensburg</thesisPublisher>
    <file>https://opus4.kobv.de/opus4-oth-regensburg/files/789/Forschungsbericht_2019.pdf</file>
  </doc>
  <doc>
    <id>7939</id>
    <completedYear/>
    <publishedYear>2024</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst/>
    <pageLast/>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume>295</volume>
    <type>conferenceobject</type>
    <publisherName>EDP Sciences</publisherName>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Co-Design of Quantum Hardware and Algorithms in Nuclear and High Energy Physics</title>
    <abstract language="eng">Quantum computing (QC) has emerged as a promising technology, and is believed to have the potential to advance nuclear and high energy physics (NHEP) by harnessing quantum mechanical phenomena to accelerate computations. In this paper, we give a brief overview of the current state of quantum computing by highlighting challenges it poses and opportunities it offers to the NHEP community. Noisy intermediate-scale quantum (NISQ) computers, while limited by imperfections and small scale, may hold promise for near-term quantum advantages when coupled with co-designed quantum algorithms and special-purpose quantum processing units (QPUs). We explore various applications in NHEP, including quantum simulation, event classification, and realtime experiment control, emphasising the potential of variational quantum circuits and related techniques. To identify current interests of the community, we perform an analysis of recent literature in NHEP related to QC.</abstract>
    <parentTitle language="deu">EPJ Web of Conferences</parentTitle>
    <identifier type="doi">10.1051/epjconf/202429512002</identifier>
    <enrichment key="opus.import.date">2025-01-24T17:34:31+00:00</enrichment>
    <enrichment key="opus.source">sword</enrichment>
    <enrichment key="opus.import.user">importuser</enrichment>
    <enrichment key="ConferenceStatement">26th International Conference on Computing in High Energy and Nuclear Physics (CHEP 2023)</enrichment>
    <licence>Creative Commons - CC BY - Namensnennung 4.0 International</licence>
    <author>Maja Franz</author>
    <author>Pía Zurita</author>
    <author>Markus Diefenthaler</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>2362</id>
    <completedYear/>
    <publishedYear>2022</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst>3159</pageFirst>
    <pageLast>3184</pageLast>
    <pageNumber>29</pageNumber>
    <edition/>
    <issue>8</issue>
    <volume>48</volume>
    <type>article</type>
    <publisherName>IEEE</publisherName>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">In Search of Socio-Technical Congruence: A Large-Scale Longitudinal Study</title>
    <abstract language="eng">This paper describes a large-scale empirical study investigating the relevance of socio-technical congruence over key basic software quality metrics, namely, bugs and churn. That is, we explore whether alignment or misalignment of social communication structures and technical dependencies in large software projects influences software quality. To this end, we have defined a quantitative and operational notion of socio-technical congruence, which we call /socio-technical motif congruence/ (STMC). STMC is a measure of the degree to which developers working on the same file or on two related files, need to communicate. As socio-technical congruence is a complex and multi-faceted phenomenon, the interpretability of the results is one of our main concerns, so we have employed a careful mixed-methods statistical analysis. In particular, we provide analyses with similar techniques as employed by seminal work in the field to ensure comparability of our results with the existing body of work. The major result of our study, based on an analysis of 25 large open-source projects, is that STMC is /not/ related to project quality measures---software bugs and churn---in any temporal scenario. That is, we find no statistical relationship between the alignment of developer tasks and developer communications on one hand, and project outcomes on the other hand. We conclude that, wherefore congruence does matter as literature shows, then its measurable effect lies elsewhere.</abstract>
    <parentTitle language="eng">IEEE Transactions on Software Engineering (TSE)</parentTitle>
    <identifier type="doi">10.1109/TSE.2021.3082074</identifier>
    <note>Corresponding author: Wolfgang Mauerer</note>
    <enrichment key="opus.import.date">2022-01-14T10:19:11+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">Wolfgang Mauerer</enrichment>
    <enrichment key="AmountAPC">European Union’s Horizon 2020 Research and Innovation Programme</enrichment>
    <licence>Creative Commons - CC BY - Namensnennung 4.0 International</licence>
    <author>Wolfgang Mauerer</author>
    <author>Mitchell Joblin</author>
    <author>Damian Tamburri</author>
    <author>Carlos Paradis</author>
    <author>Rick Kazman</author>
    <author>Sven Apel</author>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Socio-Technical Congruence</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Human Factors in Software Engineering;</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Graph Analysis</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Empirical Software Engineering</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Quantitative Software Engineering</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Mixed-Methods Research</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Socio-Technical Analysis</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>3899</id>
    <completedYear/>
    <publishedYear>2012</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst/>
    <pageLast/>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume/>
    <type>conferenceobject</type>
    <publisherName>Optical Society of America</publisherName>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">A high-speed secure quantum random number generator based on vacuum states</title>
    <abstract language="eng">A high-speed continuous-variable quantum random bit generator with an expected effective bit generation rate of up to 10 GBit/s is presented. The obtained bit sequences are truly random and unique, i.e. they cannot be known by an adversary.</abstract>
    <parentTitle language="eng">IEEE/OSA Conference on Lasers and Electro-Optics (CLEO), 06-11 May 2012, San Jose CA USA</parentTitle>
    <enrichment key="BegutachtungStatus">peer-reviewed</enrichment>
    <licence>Keine Lizenz - Es gilt das deutsche Urheberrecht: § 53 UrhG</licence>
    <author>Christian Gabriel</author>
    <author>Christoffer Wittmann</author>
    <author>B. Hacker</author>
    <author>Wolfgang Mauerer</author>
    <author>E. Huntington</author>
    <author>M. Sabuncu</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>7688</id>
    <completedYear/>
    <publishedYear>2024</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst>35</pageFirst>
    <pageLast>45</pageLast>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume/>
    <type>conferenceobject</type>
    <publisherName/>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Polynomial Reduction Methods and their Impact on QAOA Circuits</title>
    <abstract language="eng">Abstraction layers are of paramount importance in software architecture, as they shield the higher-level formulation of payload computations from lower-level details. Since quantum computing (QC) introduces many such details that are often unaccustomed to computer scientists, an obvious desideratum is to devise appropriate abstraction layers for QC. For discrete optimisation, one such abstraction is to cast problems in quadratic unconstrained binary optimisation (QUBO) form, which is amenable to a variety of quantum approaches. However, different mathematically equivalent forms can lead to different behaviour on quantum hardware, ranging from ease of mapping onto qubits to performance scalability. In this work, we show how using higher-order problem formulations (that provide better expressivity in modelling optimisation tasks than plain QUBO formulations) and their automatic transformation into QUBO form can be used to leverage such differences to prioritise between different desired non-functional properties for quantum optimisation. Based on a practically relevant use-case and a graph-theoretic analysis, we evaluate how different transformation approaches influence widely used quantum performance metrics (circuit depth, gates count, gate distribution, qubit scaling), and also consider the classical computational efforts required to perform the transformations, as they influence possibilities for achieving future quantum advantage. Furthermore, we establish more general properties and invariants of the transformation methods. Our quantitative study shows that the approach allows us to satisfy different trade-offs, and suggests various possibilities for the future construction of general-purpose abstractions and automatic generation of useful quantum circuits from high-level problem descriptions.</abstract>
    <parentTitle language="eng">IEEE International Conference on Quantum Software (QSW), 7-13 July 2024, Shenzhen, China</parentTitle>
    <identifier type="doi">10.1109/QSW62656.2024.00018</identifier>
    <enrichment key="opus.import.date">2024-09-11T22:10:01+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">true</enrichment>
    <licence>Keine Lizenz - Es gilt das deutsche Urheberrecht: § 53 UrhG</licence>
    <author>Lukas Schmidbauer</author>
    <author>Karen Wintersperger</author>
    <author>Elisabeth Lobe</author>
    <author>Wolfgang Mauerer</author>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>HW-SW co design</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>NISQ systems</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>noisy quantum computing</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>quantum 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>1382</id>
    <completedYear/>
    <publishedYear>2018</publishedYear>
    <thesisYearAccepted/>
    <language>deu</language>
    <pageFirst/>
    <pageLast/>
    <pageNumber>98</pageNumber>
    <edition/>
    <issue/>
    <volume/>
    <type>periodicalpart</type>
    <publisherName/>
    <publisherPlace>Regensburg</publisherPlace>
    <creatingCorporation>Ostbayerische Technische Hochschule Regensburg</creatingCorporation>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="deu">Forschung 2018</title>
    <identifier type="isbn">978-3-9818209-5-9</identifier>
    <identifier type="urn">urn:nbn:de:bvb:898-opus4-13826</identifier>
    <identifier type="doi">10.35096/othr/pub-1382</identifier>
    <author>Christian Broser</author>
    <author>Thomas Falter</author>
    <author>Robert Damian Ławrowski</author>
    <author>Amelie Altenbuchner</author>
    <author>Daniel Vögele</author>
    <author>Claus Koss</author>
    <author>Matthias Schlamp</author>
    <author>Jan Dunnweber</author>
    <author>Oliver Steffens</author>
    <author>Markus Heckner</author>
    <author>Sabine Jaritz</author>
    <author>Thomas Schiegl</author>
    <author>Sabine Corsten</author>
    <author>Norina Lauer</author>
    <author>Katherine Guertler</author>
    <author>Eric Koenig</author>
    <author>Sonja Haug</author>
    <author>Dominik Huber</author>
    <author>Clemens Birkenmaier</author>
    <author>Lars Krenkel</author>
    <author>Thomas Wagner</author>
    <author>Xenia Justus</author>
    <author>Sean Patrick Saßmannshausen</author>
    <author>Nadine Kleine</author>
    <author>Karsten Weber</author>
    <author>Carina N. Braun</author>
    <author>Giuliano Giacoppo</author>
    <author>Michael Heinrich</author>
    <author>Tobias Just</author>
    <author>Thomas Schreck</author>
    <author>Andreas Schnabl</author>
    <author>Amador Téran Gilmore</author>
    <author>Samuel Roeslin</author>
    <author>Sandra Schmid</author>
    <author>Felix Wellnitz</author>
    <author>Sebastian Malz</author>
    <author>Andreas Maurial</author>
    <author>Florian Hauser</author>
    <author>Jürgen Mottok</author>
    <author>Meike Klettke</author>
    <author>Stefanie Scherzinger</author>
    <author>Uta Störl</author>
    <author>Markus Heckner</author>
    <author>Alexander Bazo</author>
    <author>Christian Wolff</author>
    <author>Andreas Kopper</author>
    <author>Markus Westner</author>
    <author>Christian Pongratz</author>
    <author>Ingo Ehrlich</author>
    <author>Ulrich Briem</author>
    <author>Sebastian Hederer</author>
    <author>Marcus Wagner</author>
    <author>Moritz Schillinger</author>
    <author>Julien Görlach</author>
    <author>Stefan Hierl</author>
    <author>Marco Siegl</author>
    <author>Christoph Langer</author>
    <author>Matthias Hausladen</author>
    <author>Rupert Schreiner</author>
    <author>Matthias Haslbeck</author>
    <author>Reinhard Kreuzer</author>
    <author>Oliver Brückl</author>
    <author>Belal Dawoud</author>
    <author>Hans-Peter Rabl</author>
    <author>Bernd Gamisch</author>
    <author>Ottfried Schmidt</author>
    <author>Michael Heberl</author>
    <author>Bianca Gänsbauer</author>
    <author>Werner Bick</author>
    <author>Andreas Ellermeier</author>
    <author>Gareth J. Monkman</author>
    <author>Nina Prem</author>
    <author>Dirk Sindersberger</author>
    <author>Karl Tschurtschenthaler</author>
    <author>Maximilian Aurbach</author>
    <author>Sebastian Dendorfer</author>
    <author>Michael A. Betz</author>
    <author>Tamara Szecsey</author>
    <author>Wolfgang Mauerer</author>
    <author>Florian Murr</author>
    <series>
      <title>Forschungsberichte der OTH Regensburg</title>
      <number>2018</number>
    </series>
    <subject>
      <language>deu</language>
      <type>swd</type>
      <value>Forschung</value>
    </subject>
    <subject>
      <language>deu</language>
      <type>swd</type>
      <value>Forschungsbericht</value>
    </subject>
    <collection role="institutes" number="HL">Hochschulleitung/Hochschulverwaltung</collection>
    <collection role="othpublikationsherkunft" number="">Von der OTH Regensburg herausgegeben</collection>
    <collection role="persons" number="weberlate">Weber, Karsten (Prof. Dr.) - Labor für Technikfolgenabschätzung und Angewandte Ethik</collection>
    <collection role="institutes" number="IAFW">Zentrum für Forschung und Transfer (ZFT ab 2024; vorher: IAFW)</collection>
    <collection role="persons" number="bruecklfenes">Brückl, Oliver (Prof. Dr.) - FENES / Forschungsgruppe Energienetze</collection>
    <collection role="persons" number="hauglasofo">Haug, Sonja (Prof. Dr.) - Labor Empirische Sozialforschung</collection>
    <thesisPublisher>Ostbayerische Technische Hochschule Regensburg</thesisPublisher>
    <file>https://opus4.kobv.de/opus4-oth-regensburg/files/1382/Forschung-OTHR_2018.pdf</file>
  </doc>
  <doc>
    <id>8170</id>
    <completedYear/>
    <publishedYear>2025</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst>645</pageFirst>
    <pageLast>656</pageLast>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume/>
    <type>conferenceobject</type>
    <publisherName>IEEE</publisherName>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>2025-03-04</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Does the Tool Matter? Exploring Some Causes of Threats to Validity in Mining Software Repositories</title>
    <abstract language="eng">Software repositories are an essential source of information for software engineering research on topics such as project evolution and developer collaboration. Appropriate mining tools and analysis pipelines are therefore an indispensable precondition for many research activities. Ideally, valid results should not depend on technical details of data collection and processing. It is, however, widely acknowledged that mining pipelines are complex, with a multitude of implementation decisions made by tool authors based on their interests and assumptions. This raises the questions if (and to what extent) tools agree on their results and are interchangeable. In this study, we use two tools to extract and analyse ten large software projects, quantitatively and qualitatively comparing results and derived data to better understand this concern. We analyse discrepancies from a technical point of view, and adjust code and parametrisation to minimise replication differences. Our results indicate that despite similar trends, even simple metrics such as the numbers of commits and developers may differ by up to 500%. We find that such substantial differences are often caused by minor technical details. We show how tool-level and data post-processing changes can overcome these issues, but find they may require considerable efforts. We summarise identified causes in our lessons learned to help researchers and practitioners avoid common pitfalls, and reflect on implementation decisions and their influence in ensuring obtained data meets explicit and implicit expectations. Our findings lead us to hypothesise that similar uncertainties exist in other analysis tools, which may limit the validity of conclusions drawn in tool-centric research.</abstract>
    <parentTitle language="eng">2025 IEEE International Conference on Software Analysis, Evolution and Reengineering (SANER), Montreal, QC, Canada, March, 4-7, 2025</parentTitle>
    <identifier type="isbn">979-8-3315-3510-0</identifier>
    <identifier type="doi">10.1109/SANER64311.2025.00067</identifier>
    <enrichment key="opus.import.date">2025-06-03T21:49:53+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>Nicole Hoess</author>
    <author>Carlos Paradis</author>
    <author>Rick Kazman</author>
    <author>Wolfgang Mauerer</author>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Codes</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Collaboration</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Data collection</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Data mining</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Developer Networks</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Empirical Software Engineering</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Market research</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Measurement</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Mining Software Repositories</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Pipelines</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Research Software</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Software engineering</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Uncertainty</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>
    <collection role="DFGFachsystematik" number="1">Ingenieurwissenschaften</collection>
  </doc>
  <doc>
    <id>7685</id>
    <completedYear/>
    <publishedYear>2024</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst/>
    <pageLast/>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume/>
    <type>bookpart</type>
    <publisherName>Springer-Nature</publisherName>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Challenges for Quantum Software Engineering: An Industrial Application Scenario Perspective</title>
    <abstract language="deu">Quantum software is becoming a key enabler for applying quantum computing to industrial use cases. This poses challenges to quantum software engineering in providing efficient and effective means to develop such software. Eventually, this must be reliably achieved in time, on budget, and in quality, using sound and well-principled engineering approaches. Given that quantum computers are based on fundamentally different principles than classical machines, this raises the question if, how, and to what extent established techniques for systematically engineering software need to be adapted. In this chapter, we analyze three paradigmatic application scenarios for quantum software engineering from an industrial perspective. The respective use cases center around (1) optimization and quantum cloud services, (2) quantum simulation, and (3) embedded quantum computing. Our aim is to provide a concise overview of the current and future applications of quantum computing in diverse industrial settings. We derive presumed challenges for quantum software engineering and thus provide research directions for this emerging field.</abstract>
    <parentTitle language="eng">Quantum Software: Aspects of Theory and System Design</parentTitle>
    <identifier type="doi">10.1007/978-3-031-64136-7_12</identifier>
    <identifier type="isbn">978-3-031-64135-0</identifier>
    <identifier type="isbn">978-3-031-64136-7</identifier>
    <enrichment key="opus.import.date">2024-09-11T22:10:01+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>Creative Commons - CC BY - Namensnennung 4.0 International</licence>
    <author>Cecilia Carbonelli</author>
    <author>Michael Felderer</author>
    <author>Matthias Jung</author>
    <author>Elisabeth Lobe</author>
    <author>Malte Lochau</author>
    <author>Sebastian Luber</author>
    <author>Wolfgang Mauerer</author>
    <author>Rudolf Ramler</author>
    <author>Ina Schäfer</author>
    <author>Christoph Schroth</author>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>industrial use cases</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>quantum computing</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>quantum software engineering</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>software development</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>software engineering</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>7693</id>
    <completedYear/>
    <publishedYear>2024</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">Towards View-based Development of Quantum Software</title>
    <abstract language="eng">Quantum computing is an interdisciplinary field that relies on the expertise of many&#13;
different stakeholders. The views of various stakeholders on the subject of quantum computing may differ, thereby complicating communication. To address this, we propose a view-based quantum development approach based on a Single Underlying Model (SUM) and a supporting quantumIntegrated Development Environment (IDE). We highlight emerging challenges for future research.</abstract>
    <identifier type="arxiv">2406.18363</identifier>
    <enrichment key="opus.import.date">2024-09-11T22:10:01+00:00</enrichment>
    <enrichment key="opus.source">sword</enrichment>
    <enrichment key="opus.import.user">importuser</enrichment>
    <enrichment key="ConferenceStatement">Proceedings of the GI Quantum Computing Workshop. - (GIQC ’24)</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>Joshua Ammermann</author>
    <author>Wolfgang Mauerer</author>
    <author>Ina Schäfer</author>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Quantum Computing</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>View-based Development</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Integrated Development Environment</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>5618</id>
    <completedYear/>
    <publishedYear/>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst/>
    <pageLast/>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume/>
    <type>conferencepresentation</type>
    <publisherName/>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Quantum Computing for DB - Applicability on Multi Query Optimization and Join Order Optimization</title>
    <parentTitle language="deu">Frühjahrstreffen Fachgruppe Datenbanken in Potsdam, 2022</parentTitle>
    <identifier type="url">https://www.lfdr.de/Publications/2022/FGDB_Poster_Schoenberger.pdf</identifier>
    <licence>Keine Lizenz - Es gilt das deutsche Urheberrecht: § 53 UrhG</licence>
    <author>Manuel Schönberger</author>
    <author>Stefanie Scherzinger</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>3470</id>
    <completedYear/>
    <publishedYear>2022</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst/>
    <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">Peel | Pile? Cross-Framework Portability of Quantum Software</title>
    <abstract language="eng">In recent years, various vendors have made quantum software frameworks available. Yet with vendor-specific frameworks, code portability seems at risk, especially in a field where hardware and software libraries have not yet reached a consolidated state, and even foundational aspects of the technologies are still in flux. Accordingly, the development of vendor-independent quantum programming languages and frameworks is often suggested. This follows the established architectural pattern of introducing additional levels of abstraction into software stacks, thereby piling on layers of abstraction. Yet software architecture also provides seemingly less abstract alternatives, namely to focus on hardware-specific formulations of problems that peel off unnecessary layers. In this article, we quantitatively and experimentally explore these strategic alternatives, and compare popular quantum frameworks from the software implementation perspective. We find that for several specific, yet generalisable problems, the mathematical formulation of the problem to be solved is not just sufficiently abstract and serves as precise description, but is likewise concrete enough to allow for deriving framework-specific implementations with little effort. Additionally, we argue, based on analysing dozens of existing quantum codes, that porting between frameworks is actually low-effort, since the quantum- and framework-specific portions are very manageable in terms of size, commonly in the order of mere hundreds of lines of code. Given the current state-of-the-art in quantum programming practice, this leads us to argue in favour of peeling off unnecessary abstraction levels.</abstract>
    <parentTitle language="eng">2022 IEEE 19th International Conference on Software Architecture Companion (ICSA-C), 12-15 March 2022, Honolulu, HI, USA</parentTitle>
    <identifier type="doi">10.1109/ICSA-C54293.2022.00039</identifier>
    <note>Preprint unter: https://arxiv.org/abs/2203.06289</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>
    <licence>Keine Lizenz - Es gilt das deutsche Urheberrecht: § 53 UrhG</licence>
    <author>Manuel Schönberger</author>
    <author>Maja Franz</author>
    <author>Stefanie Scherzinger</author>
    <author>Wolfgang Mauerer</author>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Computer Science</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Quantum Physics</value>
    </subject>
    <subject>
      <language>eng</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>6649</id>
    <completedYear/>
    <publishedYear>2023</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst/>
    <pageLast/>
    <pageNumber>14</pageNumber>
    <edition/>
    <issue/>
    <volume/>
    <type>preprint</type>
    <publisherName/>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Quantum-Inspired Digital Annealing for Join Ordering</title>
    <abstract language="eng">Finding the optimal join order (JO) is one of the most important problems in query optimisation, and has been extensively considered in research and practise. As it involves huge search spaces, approximation approaches and heuristics are commonly used, which explore a reduced solution space at the cost of solution quality. To explore even large JO search spaces, we may consider special-purpose software, such as mixed-integer linear programming (MILP) solvers, which have successfully solved JO problems. However, even mature solvers cannot overcome the limitations of conventional hardware prompted by the end of Moore’s law. We consider quantum-inspired digital annealing hardware, which takes inspiration from quantum processing units (QPUs). Unlike QPUs, which likely remain limited in size and reliability in the near and mid-term future, the digital annealer (DA) can solve large instances of mathematically encoded optimisation problems today. We derive a novel, native encoding for the JO problem tailored to this class of machines that substantially improves over known MILP and quantum-based encodings, and reduces encoding size over the state-of-the-art. By augmenting the computation with a novel readout method, we derive valid join orders for each solution obtained by the (probabilistically operating) DA. Most importantly and despite an extremely large solution space, our approach scales to practically relevant dimensions of around 50 relations and improves result quality over conventionally employed approaches, adding a novel alternative to solving the long-standing JO problem.</abstract>
    <parentTitle language="eng">Proceedings of the VLDB Endowment</parentTitle>
    <licence>Creative Commons - CC BY-NC-ND - Namensnennung - Nicht kommerziell - Keine Bearbeitungen 4.0 International</licence>
    <author>Manuel Schönberger</author>
    <author>Immanuel Trummer</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>7691</id>
    <completedYear/>
    <publishedYear>2024</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">Reproducibility Report for ACM SIGMOD 2023 Paper: Ready to Leap (by Co-Design)? Join Order Optimisation</title>
    <abstract language="eng">The paper “Ready to Leap (by Co-Design)? Join Order Optimisation on Quantum Hardware” proposes the first approach to solve the problem of join order optimization on quantum hardware. The authors characterize the applicability and limitations of current state-of-the-art quantum hardware, i. e. gate-based quantum computing and quantum annealing, for join ordering and recommend key improvements to the physical hardware to reach practical utility. Based on the provided database queries and QPU system processing data, we have been able to reproduce the original paper’s key insights and quantum problem characteristics reported in its experimental section. The authors provided a self-contained and fully automated reproduction package, including data (database queries, statistics, and collected QPU processing data), experiment scripts, and plotting routines that&#13;
allowed the identical reconstruction of the three main figures in the paper.</abstract>
    <identifier type="url">https://www.lfdr.de/Publications/2024/SIGMOD_ARI_2023___Paper_37.pdf</identifier>
    <enrichment key="opus.import.date">2024-09-11T22:10:01+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>Sebastian Schmidl</author>
    <author>Yangshen Deng</author>
    <author>Pingchuan Ma</author>
    <author>Manuel Schönberger</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>7682</id>
    <completedYear/>
    <publishedYear>2022</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst/>
    <pageLast/>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume/>
    <type>conferencepresentation</type>
    <publisherName/>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Applicability of Quantum Computing on Database Query Optimization</title>
    <parentTitle language="eng">Frühjahrstreffen Fachgruppe Datenbanken in Potsdam (Poster Presentation)</parentTitle>
    <enrichment key="opus.import.date">2024-09-11T22:10:01+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">true</enrichment>
    <author>Manuel Schönberger</author>
    <author>Stefanie Scherzinger</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>8515</id>
    <completedYear/>
    <publishedYear>2025</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst/>
    <pageLast/>
    <pageNumber>31</pageNumber>
    <edition/>
    <issue/>
    <volume>12</volume>
    <type>article</type>
    <publisherName>Springer</publisherName>
    <publisherPlace>Heidelberg</publisherPlace>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Stacking the odds: full-stack quantum system design space exploration</title>
    <abstract language="deu">Design space exploration (DSE) plays an important role in optimising quantum circuit execution by systematically evaluating different configurations of compilation strategies and hardware settings. In this paper, we conduct a comprehensive investigation into the impact of various layout methods, qubit routing techniques, and optimisation levels, as well as device-specific properties such as different variants and strengths of noise and imperfections, the topological structure of qubits, connectivity densities, and back-end sizes. By spanning through these dimensions, we aim to understand the interplay between compilation choices and hardware characteristics. A key question driving our exploration is whether the optimal selection of device parameters, mapping techniques, comprising of initial layout strategies and routing heuristics can mitigate device induced errors beyond standard error mitigation approaches. Our results show that carefully selecting software strategies (e.g., mapping and routing algorithms) and tailoring hardware characteristics (such as minimising noise and leveraging topology and connectivity density) significantly improve the fidelity of circuit execution outcomes, and thus the expected correctness or success probability of the computational result. We provide estimates based on key metrics such as circuit depth, gate count and expected fidelity. Our results highlight the importance of hardware–software co-design, particularly as quantum systems scale to larger dimensions, and along the way towards fully error corrected quantum systems: Our study is based on computationally noisy simulations, but considers various implementations of quantum error correction (QEC) using the same approach as for other algorithms. The observed sensitivity of circuit fidelity to noise and connectivity suggests that co-design principles will be equally critical when integrating QEC in future systems. Our exploration provides practical guidelines for co-optimising physical mapping, qubit routing, and hardware configurations in realistic quantum computing scenarios.</abstract>
    <parentTitle language="deu">EPJ Quantum Technology</parentTitle>
    <identifier type="doi">10.1140/epjqt/s40507-025-00413-7</identifier>
    <identifier type="urn">urn:nbn:de:bvb:898-opus4-85157</identifier>
    <note>Corresponding author der OTH Regensburg: Hila Safi</note>
    <enrichment key="CorrespondingAuthor">Hila Safi</enrichment>
    <enrichment key="BegutachtungStatus">peer-reviewed</enrichment>
    <enrichment key="opus.doi.autoCreate">false</enrichment>
    <enrichment key="opus.urn.autoCreate">true</enrichment>
    <licence>Creative Commons - CC BY - Namensnennung 4.0 International</licence>
    <author>Hila Safi</author>
    <author>Medina Bandic</author>
    <author>Christoph Niedermeier</author>
    <author>Carmen G. Almudever</author>
    <author>Sebastian Feld</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="oaweg" number="">Corresponding author der OTH Regensburg</collection>
    <collection role="funding" number="">DEAL Springer Nature</collection>
    <collection role="DFGFachsystematik" number="1">Ingenieurwissenschaften</collection>
    <collection role="othforschungsschwerpunkt" number="">Digitale Transformation</collection>
    <thesisPublisher>Ostbayerische Technische Hochschule Regensburg</thesisPublisher>
    <file>https://opus4.kobv.de/opus4-oth-regensburg/files/8515/s40507-025-00413-7.pdf</file>
  </doc>
  <doc>
    <id>7687</id>
    <completedYear/>
    <publishedYear>2024</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst>409</pageFirst>
    <pageLast>420</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">Hype or Heuristic? Quantum Reinforcement Learning for Join Order Optimisation</title>
    <abstract language="eng">Identifying optimal join orders (JOs) stands out as a key challenge in database research and engineering. Owing to the large search space, established classical methods rely on approximations and heuristics. Recent efforts have successfully explored reinforcement learning (RL) for JO. Likewise, quantum versions of RL have received considerable scientific attention. Yet, it is an open question if they can achieve sustainable, overall practical advantages with improved quantum processors.&#13;
In this paper, we present a novel approach that uses quantum reinforcement learning (QRL) for JO based on a hybrid variational quantum ansatz. It is able to handle general bushy join trees instead of resorting to simpler left-deep variants as compared to approaches based on quantum(-inspired) optimisation, yet requires multiple orders of magnitudes fewer qubits, which is a scarce resource even for post-NISQ systems.&#13;
Despite moderate circuit depth, the ansatz exceeds current NISQ capabilities, which requires an evaluation by numerical simulations. While QRL may not significantly outperform classical approaches in solving the JO problem with respect to result quality (albeit we see parity), we find a drastic reduction in required trainable parameters. This benefits practically relevant aspects ranging from shorter training times compared to classical RL, less involved classical optimisation passes, or better use of available training data, and fits data-stream and low-latency processing scenarios. Our comprehensive evaluation and careful discussion delivers a balanced perspective on possible practical quantum advantage, provides insights for future systemic approaches, and allows for quantitatively assessing trade-offs of quantum approaches for one of the most crucial problems of database management systems.</abstract>
    <parentTitle language="eng">2024 IEEE International Conference on Quantum Computing and Engineering (QCE),  15-20 September 2024,  Montreal, QC, Canada</parentTitle>
    <identifier type="doi">10.1109/QCE60285.2024.00055</identifier>
    <identifier type="urn">urn:nbn:de:bvb:898-opus4-76877</identifier>
    <note>Corresponding author der OTH Regensburg: Maja Franz</note>
    <enrichment key="opus.import.date">2024-09-11T22:10:01+00:00</enrichment>
    <enrichment key="opus.source">sword</enrichment>
    <enrichment key="opus.import.user">importuser</enrichment>
    <enrichment key="CorrespondingAuthor">Maja Franz</enrichment>
    <licence>Creative Commons - CC BY - Namensnennung 4.0 International</licence>
    <author>Maja Franz</author>
    <author>Tobias Winker</author>
    <author>Sven Groppe</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="oaweg" number="">Hybrid Open Access - OA-Veröffentlichung in einer Subskriptionszeitschrift/-medium</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/7687/Franz_Mauerer_Hype_or_Heuristic_IEEE.pdf</file>
  </doc>
  <doc>
    <id>8843</id>
    <completedYear/>
    <publishedYear>2025</publishedYear>
    <thesisYearAccepted/>
    <language>deu</language>
    <pageFirst/>
    <pageLast/>
    <pageNumber>32</pageNumber>
    <edition/>
    <issue/>
    <volume>9</volume>
    <type>article</type>
    <publisherName>Verein zur Förderung des Open Access Publizierens in den Quantenwissenschaften</publisherName>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="deu">Out of the Loop: Structural Approximation of Optimisation Landscapes and non-Iterative Quantum Optimisation</title>
    <abstract language="deu">The Quantum Approximate Optimisation Algorithm (QAOA) is a widely studied quantum-classical iterative heuristic for combinatorial optimisation. While QAOA targets problems in complexity class NP, the classical optimisation procedure required in every iteration is itself known to be NP-hard. Still, advantage over classical approaches is suspected for certain scenarios, but nature and origin of its computational power are not yet satisfactorily understood.&#13;
By introducing means of efficiently and accurately approximating the QAOA optimisation landscape from solution space structures, we derive a new algorithmic variant of unit-depth QAOA for two-level Hamiltonians (including all problems in NP): Instead of performing an iterative quantum-classical computation for each input instance, our non-iterative method is based on a quantum circuit that is instance-independent, but problem-specific. It matches or outperforms unit-depth QAOA for key combinatorial problems, despite reduced computational effort.&#13;
Our approach is based on proving a long-standing conjecture regarding instance-independent structures in QAOA. By ensuring generality, we link existing empirical observations on QAOA parameter clustering to established approaches in theoretical computer science, and provide a sound foundation for understanding the link between structural properties of solution spaces and quantum optimisation.</abstract>
    <parentTitle language="deu">Quantum</parentTitle>
    <identifier type="doi">10.22331/q-2025-11-06-1903</identifier>
    <note>Die Preprint-Version ist ebenfalls in diesem Repositorium verzeichnet unter: https://opus4.kobv.de/opus4-oth-regensburg/frontdoor/index/index/start/2/rows/10/sortfield/score/sortorder/desc/searchtype/simple/query/Out+of+the+Loop/docId/7938</note>
    <enrichment key="opus.import.date">2026-01-19T13:29:45+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>Creative Commons - CC BY - Namensnennung 4.0 International</licence>
    <author>Tom Krüger</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="institutes" number="">Labor für Digitalisierung (LFD)</collection>
    <collection role="DFGFachsystematik" number="1">Ingenieurwissenschaften</collection>
    <collection role="othforschungsschwerpunkt" number="">Digitale Transformation</collection>
  </doc>
  <doc>
    <id>8840</id>
    <completedYear/>
    <publishedYear>2025</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst/>
    <pageLast/>
    <pageNumber>25</pageNumber>
    <edition/>
    <issue>4</issue>
    <volume>3</volume>
    <type>conferenceobject</type>
    <publisherName>ACM</publisherName>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Large-Scale Multiple Query Optimisation with Incremental Quantum(-Inspired) Annealing</title>
    <abstract language="eng">Multiple-query optimization (MQO) seeks to reduce redundant work across query batches. While MQO offers opportunities for dramatic performance improvements, the problem is NP-hard, limiting the sizes of problems that can be solved on generic hardware. We propose to leverage specialized hardware solvers for optimization, such as Fujitsu's Digital Annealer (DA), to scale up MQO to problem sizes formerly out of reach.&#13;
We present a novel incremental processing approach that combines classical computation with DA acceleration. By efficiently partitioning MQO problems into sets of partial problems, and by applying a dynamic search steering strategy that reapplies initially discarded information to incrementally process individual problems, our method overcomes capacity limitations, and scales to extremely large MQO instances (up to νm1000 queries). A thorough and comprehensive empirical evaluation finds our method substantially outperforms existing approaches. Our generalisable framework lays the ground for other database use-cases on quantum-inspired hardware, and bridges towards future quantum accelerators.</abstract>
    <parentTitle language="eng">Proceedings of the ACM on Management of Data</parentTitle>
    <identifier type="doi">10.1145/3749171</identifier>
    <enrichment key="opus.import.date">2026-01-19T13:29:45+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>Creative Commons - CC BY - Namensnennung 4.0 International</licence>
    <author>Manuel Schönberger</author>
    <author>Immanuel Trummer</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="institutes" number="">Labor für Digitalisierung (LFD)</collection>
    <collection role="DFGFachsystematik" number="1">Ingenieurwissenschaften</collection>
    <collection role="othforschungsschwerpunkt" number="">Digitale Transformation</collection>
  </doc>
  <doc>
    <id>7938</id>
    <completedYear/>
    <publishedYear>2024</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst/>
    <pageLast/>
    <pageNumber>20</pageNumber>
    <edition/>
    <issue/>
    <volume/>
    <type>preprint</type>
    <publisherName/>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Out of the Loop: Structural Approximation of Optimisation Landscapes and non-Iterative Quantum Optimisation</title>
    <abstract language="eng">The Quantum Approximate Optimisation Algorithm (qaoa) is a widely studied quantum-classical iterative heuristic for combinatorial optimisation. While qaoa targets problems in complexity class NP, the classical optimisation procedure required in every iteration is itself known to be NP-hard. Still, advantage over classical approaches is suspected for certain scenarios, but nature and origin of its computational power are not yet satisfactorily understood. By introducing means of efficiently and accurately approximating the qaoa optimisation landscape from solution space structures, we derive a new algorithmic variant: Instead of performing an iterative quantum-classical computation for each input instance, our non-iterative method is based on a quantum circuit that is instance-independent, but problem-specific. It matches or outperforms unit-depth qaoa for key combinatorial problems, despite reduced computational effort. Our approach is based on proving a long-standing conjecture regarding instance-independent structures in qaoa. By ensuring generality, we link existing empirical observations on qaoa parameter clustering to established approaches in theoretical computer science, and provide a sound foundation for understanding the link between structural properties of solution spaces and quantum optimisation.</abstract>
    <identifier type="arxiv">2408.06493</identifier>
    <note>er Aufsatz wurde peer-reviewed veröffentlicht und ist ebenfalls in diesem Repositorium verzeichnet unter: https://opus4.kobv.de/opus4-oth-regensburg/frontdoor/index/index/start/3/rows/10/sortfield/score/sortorder/desc/searchtype/simple/query/out+of+the+loop/docId/8843</note>
    <enrichment key="opus.import.date">2025-01-24T17:34:31+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>Tom Krüger</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>8844</id>
    <completedYear/>
    <publishedYear>2025</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst>73</pageFirst>
    <pageLast>74</pageLast>
    <pageNumber/>
    <edition/>
    <issue>12</issue>
    <volume>14</volume>
    <type>bookpart</type>
    <publisherName>Dagstuhl Publishing</publisherName>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Quantum Software = Quantum minus Software?</title>
    <abstract language="eng">The Dagstuhl Seminar 24512 on "Quantum Software Engineering" was held from December 15 to 20, 2024. It brought together 26 participants from industry and academia from 13 different countries, including senior and junior researchers as well as practitioners in the field of Quantum Software Engineering. The aim of the seminar was to advance software engineering methods and tools for the engineering of hybrid quantum systems by promoting personal interaction and open discussion among researchers who are already working in this emerging area of knowledge. The first day of the seminar was devoted to the topic "When software engineering meets quantum mechanics", while the second day focused on "Quantum software engineering and its challenges." During both days, 16 invited presentations were given. The rest of the seminar was organized into three working groups to address the topics "Quantum Software Design, Modelling and Architecturing", "Adaptive Hybrid Quantum Systems", and "Quantum Software Quality Assurance". The seminar was a very fruitful experience for all participants both in terms of scientific outcomes and in terms of the personal relationships that were generated to jointly address future experiences.</abstract>
    <parentTitle language="eng">Dagstuhl Reports : Quantum Software Engineering : Report from Dagsthul Seminar 24512</parentTitle>
    <identifier type="doi">10.4230/DagRep.14.12.63</identifier>
    <identifier type="urn">urn:nbn:de:0030-drops-230469</identifier>
    <enrichment key="opus.import.date">2026-01-19T13:29:45+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>Creative Commons - CC BY - Namensnennung 4.0 International</licence>
    <author>Wolfgang Mauerer</author>
    <collection role="institutes" number="FakIM">Fakultät Informatik und Mathematik</collection>
    <collection role="oaweg" number="">Diamond Open Access - OA-Veröffentlichung ohne Publikationskosten (Sponsoring)</collection>
    <collection role="DFGFachsystematik" number="1">Ingenieurwissenschaften</collection>
    <collection role="othforschungsschwerpunkt" number="">Digitale Transformation</collection>
  </doc>
  <doc>
    <id>8123</id>
    <completedYear/>
    <publishedYear>2021</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst/>
    <pageLast/>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume/>
    <type>researchdata</type>
    <publisherName/>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>2021-05-16</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">In Search of Socio-Technical Congruence: A Large-Scale Longitudinal Study [Data set]</title>
    <identifier type="doi">10.5281/zenodo.4766388</identifier>
    <note>Archive of the accompanying website including all datasets for "In Search of Socio-Technical Congruence: A Large-Scale Longitudinal Study" (IEEE Transactions on Software Engineering): https://doi.org/10.1109/TSE.2021.3082074</note>
    <enrichment key="file_size">22,9 GB</enrichment>
    <enrichment key="file_type">Dataset</enrichment>
    <enrichment key="opus.doi.autoCreate">false</enrichment>
    <enrichment key="opus.urn.autoCreate">false</enrichment>
    <licence>Creative Commons - CC BY - Namensnennung 4.0 International</licence>
    <author>Wolfgang Mauerer</author>
    <author>Mitchell Joblin</author>
    <author>Damian Andrew Tamburri</author>
    <author>Carlos Paradis</author>
    <author>Rick Kazman</author>
    <author>Sven Apel</author>
    <collection role="institutes" number="FakIM">Fakultät Informatik und Mathematik</collection>
    <collection role="othforschungsschwerpunkt" number="16311">Digitalisierung</collection>
  </doc>
  <doc>
    <id>8124</id>
    <completedYear/>
    <publishedYear>2021</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst/>
    <pageLast/>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume/>
    <type>researchdata</type>
    <publisherName/>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>2021-04-30</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Nullius in Verba - Reproducibility Tutorial [Data set]</title>
    <abstract language="eng">Reproduction package (docker image) for the ICDE 2021 tutorial "Nullius in Verba".</abstract>
    <identifier type="doi">10.5281/zenodo.4730023</identifier>
    <note>In Verbindung mit dem Konferenzbeitrag: Nullius in Verba: Reproducibility for Database Systems Research, Revisited - https://doi.org/10.1109/ICDE51399.2021.00270</note>
    <enrichment key="file_size">647,1 MB</enrichment>
    <enrichment key="file_type">Software</enrichment>
    <enrichment key="opus.doi.autoCreate">false</enrichment>
    <enrichment key="opus.urn.autoCreate">false</enrichment>
    <licence>GNU General Public License v2.0</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>
  </doc>
  <doc>
    <id>8107</id>
    <completedYear/>
    <publishedYear>2024</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst/>
    <pageLast/>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume/>
    <type>researchdata</type>
    <publisherName/>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>2024-12-02</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">It's Quick to be Square: Fast Quadratisation for Quantum Toolchains [Data set]</title>
    <abstract language="eng">Many of the envisioned use-cases for quantum computers involve optimisation processes. While there are many algorithmic primitives to perform the required calculations, all eventually lead to quantum gates operating on quantum bits, with an order as determined by the structure of the objective function and the properties of target hardware. When the structure of the problem representation is not aligned with structure and boundary conditions of the executing hardware, various overheads to degrade the computation may arise, possibly negating any possible quantum advantage.&#13;
Therefore, automatic transformations of problem representations play an important role in quantum computing when descriptions (semi-)targeted at humans must be cast into forms that can be executed on quantum computers. Mathematically equivalent formulations are known to result in substantially different non-functional properties depending on hardware, algorithm and detail properties of the problem. Given the current state of noisy-intermediate scale quantum hardware (NISQ), these effects are considerably more pronounced than in classical computing. Likewise, efficiency of the transformation itself is relevant because possible quantum advantage may easily be eradicated by the overhead of transforming between representations. In this paper we consider a specific class of higher-level representations (polynomial unconstrained binary optimisation problems), and devise novel automatic transformation mechanisms into widely used quadratic unconstrained binary optimisation problems that substantially improve efficiency and versatility over the state of the art. We also identify what influence factors of lower-level details can be abstracted away in the transformation process, and which details must be made available to higher-level abstractions.</abstract>
    <identifier type="doi">10.5281/zenodo.14245588</identifier>
    <note>Paper: 10.48550/arXiv.2411.19934&#13;
Software: https://github.com/lfd/Fast_Quadratisation</note>
    <enrichment key="file_format">.py, .csv, .r</enrichment>
    <enrichment key="file_size">22.4 GB</enrichment>
    <enrichment key="file_type">Software</enrichment>
    <enrichment key="opus.doi.autoCreate">false</enrichment>
    <enrichment key="opus.urn.autoCreate">false</enrichment>
    <licence>Creative Commons - CC BY - Namensnennung 4.0 International</licence>
    <author>Lukas Schmidbauer</author>
    <author>Elisabeth Lobe</author>
    <author>Ina Schäfer</author>
    <author>Wolfgang Mauerer</author>
    <collection role="institutes" number="FakIM">Fakultät Informatik und Mathematik</collection>
    <collection role="othforschungsschwerpunkt" number="16311">Digitalisierung</collection>
  </doc>
  <doc>
    <id>8104</id>
    <completedYear/>
    <publishedYear>2025</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst/>
    <pageLast/>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume/>
    <type>researchdata</type>
    <publisherName/>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>2025-05-19</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">SAT Strikes Back: Parameter and Path Relations in Quantum Toolchains [Data set]</title>
    <abstract language="eng">In the foreseeable future, toolchains for quantum computing should offer automatic means of transforming a high level problem formulation down to a hardware executable form.&#13;
Thereby, it is crucial to find (multiple) transformation paths that are optimised for (hardware specific) metrics. We zoom into this pictured tree of transformations by focussing on k-SAT instances as input and their transformation to QUBO, while considering structure and characteristic metrics of input, intermediate and output representations. Our results can be used to rate valid paths of transformation in advance—also in automated (quantum)&#13;
toolchains. We support the automation aspect by considering stability and therefore predictability of free parameters and transformation paths. Moreover, our findings can be used in the manifesting era of error correction (since considering structure&#13;
in a high abstraction layer can benefit error correcting codes in layers below). We also show that current research is closely linked to quadratisation techniques and their mathematical foundation.</abstract>
    <identifier type="doi">10.5281/zenodo.15464391</identifier>
    <note>Repositoriy URL: https://github.com/lfd/QSW25-SAT-Strikes-Back</note>
    <enrichment key="file_format">.csv, .py, .pdf</enrichment>
    <enrichment key="file_size">22.4 GB</enrichment>
    <enrichment key="file_type">Software</enrichment>
    <enrichment key="opus.doi.autoCreate">false</enrichment>
    <enrichment key="opus.urn.autoCreate">false</enrichment>
    <author>Lukas Schmidbauer</author>
    <author>Wolfgang Mauerer</author>
    <collection role="institutes" number="FakIM">Fakultät Informatik und Mathematik</collection>
    <collection role="othforschungsschwerpunkt" number="16311">Digitalisierung</collection>
  </doc>
  <doc>
    <id>7681</id>
    <completedYear/>
    <publishedYear>2018</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst/>
    <pageLast/>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume/>
    <type>conferenceobject</type>
    <publisherName/>
    <publisherPlace>Edinburgh, Scotland</publisherPlace>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Reliable Pre-Integration Tracking of Commits on Mailing Lists</title>
    <parentTitle language="eng">Invited Talk at Safety Summit at Embedded Linux Conference Europe (ELCE18)</parentTitle>
    <enrichment key="opus.import.date">2024-09-11T22:10:01+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>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>9013</id>
    <completedYear/>
    <publishedYear>2026</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst/>
    <pageLast/>
    <pageNumber>22</pageNumber>
    <edition/>
    <issue/>
    <volume/>
    <type>preprint</type>
    <publisherName/>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Pattern or Not? QAOA Parameter Heuristics and Potentials of Parsimony</title>
    <abstract language="eng">Structured variational quantum algorithms such as the Quantum Approximate Optimisation Algorithm (QAOA) have emerged as leading candidates for exploiting advantages of near-term quantum hardware. They interlace classical computation, in particular optimisation of variational parameters, with quantum-specific routines, and combine problem-specific advantages -- sometimes even provable -- with adaptability to the constraints of noisy, intermediate-scale quantum (NISQ) devices. While circuit depth can be parametrically increased and is known to improve performance in an ideal (noiseless) setting, on realistic hardware greater depth exacerbates noise: The overall quality of results depends critically on both, variational parameters and circuit depth. Although identifying optimal parameters is NP-hard, prior work has suggested that they may exhibit regular, predictable patterns for increasingly deep circuits and depending on the studied class of problems. In this work, we systematically investigate the role of classical parameters in QAOA performance through extensive numerical simulations and suggest a simple, yet effective heuristic scheme to find good parameters for low-depth circuits. Our results demonstrate that: (i) optimal parameters often deviate substantially from expected patterns; (ii) QAOA performance becomes progressively less sensitive to specific parameter choices as depth increases; and (iii) iterative component-wise fixing performs on par with, and at shallow depth may even outperform, several established parameter-selection strategies. We identify conditions under which structured parameter patterns emerge, and when deviations from the patterns warrant further consideration. These insights for low-depth circuits may inform more robust pathways to harnessing QAOA in realistic quantum compute scenarios.</abstract>
    <identifier type="doi">10.48550/arXiv.2510.08153</identifier>
    <enrichment key="opus.import.date">2026-03-30T12:30:30+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>Creative Commons - CC BY - Namensnennung 4.0 International</licence>
    <author>Vincent Eichenseher</author>
    <author>Maja Franz</author>
    <author>Christian Wolff</author>
    <author>Wolfgang Mauerer</author>
    <collection role="institutes" number="FakIM">Fakultät Informatik und Mathematik</collection>
    <collection role="DFGFachsystematik" number="1">Ingenieurwissenschaften</collection>
    <collection role="othforschungsschwerpunkt" number="">Digitale Transformation</collection>
  </doc>
</export-example>
