@misc{ScharfenbergMottokArtmannetal., author = {Scharfenberg, Georg and Mottok, J{\"u}rgen and Artmann, Christina and Hobelsberger, Martin and Paric, Ivan and Großmann, Benjamin and Pohlt, Clemens and Wackerbarth, Alena and Pausch, Uli and Heidrich, Christiane and Fadanelli, Martin and Elsner, Michael and P{\"o}cher, Daniel and Pittroff, Lenz and Beer, Stefan and Br{\"u}ckl, Oliver and Haslbeck, Matthias and Sterner, Michael and Thema, Martin and Muggenthaler, Nicole and Lenck, Thorsten and G{\"o}tz, Philipp and Eckert, Fabian and Deubzer, Michael and Stingl, Armin and Simsek, Erol and Kr{\"a}mer, Stefan and Großmann, Benjamin and Schlegl, Thomas and Niedersteiner, Sascha and Berlehner, Thomas and Joblin, Mitchell and Mauerer, Wolfgang and Apel, Sven and Siegmund, Janet and Riehle, Dirk and Weber, Joachim and Palm, Christoph and Zobel, Martin and Al-Falouji, Ghassan and Prestel, Dietmar and Scharfenberg, Georg and Mandl, Roland and Deinzer, Arnulf and Halang, W. and Margraf-Stiksrud, Jutta and Sick, Bernhard and Deinzer, Renate and Scherzinger, Stefanie and Klettke, Meike and St{\"o}rl, Uta and Wiech, Katharina and Kubata, Christoph and Sindersberger, Dirk and Monkman, Gareth J. and Dollinger, Markus and Dembianny, Sven and K{\"o}lbl, Andreas and Welker, Franz and Meier, Matthias and Thumann, Philipp and Swidergal, Krzysztof and Wagner, Marcus and Haug, Sonja and Vernim, Matthias and Seidenst{\"u}cker, Barbara and Weber, Karsten and Arsan, Christian and Schone, Reinhold and M{\"u}nder, Johannes and Schroll-Decker, Irmgard and Dillinger, Andrea Elisabeth and Fuchshofer, Rudolf and Monkman, Gareth J. and Shamonin (Chamonine), Mikhail and Geith, Markus A. and Koch, Fabian and {\"U}hlin, Christian and Schratzenstaller, Thomas and Saßmannshausen, Sean Patrick and Auchter, Eberhard and Kriz, Willy and Springer, Othmar and Thumann, Maria and Kusterle, Wolfgang and Obermeier, Andreas and Udalzow, Anton and Schmailzl, Anton and Hierl, Stefan and Langer, Christoph and Schreiner, Rupert}, title = {Forschungsbericht 2015}, editor = {Baier, Wolfgang}, address = {Regensburg}, organization = {Ostbayerische Technische Hochschule Regensburg}, isbn = {978-3-00-048589-3}, doi = {10.35096/othr/pub-1386}, url = {http://nbn-resolving.de/urn:nbn:de:bvb:898-opus4-13867}, language = {de} } @misc{MauererRexhepajMonkmanetal., author = {Mauerer, Wolfgang and Rexhepaj, Tanja and Monkman, Gareth J. and Sindersberger, Dirk and Diermeier, Andreas and Neidhart, Thomas and Wolfrum, Dominik and Sterner, Michael and Heberl, Michael and Nusko, Robert and Maier, Georg and Nagl, Klaus and Reuter, Monika and Hofrichter, Andreas and Lex, Thomas and Lesch, Florian and Kieninger, B{\"a}rbel and Szalo, Alexander Eduard and Zehner, Alexander and Palm, Christoph and Joblin, Mitchell and Apel, Sven and Ramsauer, Ralf and Lohmann, Daniel and Westner, Markus and Strasser, Artur and Munndi, Maximilian and Ebner, Lena and Elsner, Michael and Weiß, Nils and Segerer, Matthias and Hackenberg, Rudolf and Steger, Sebastian and Schmailzl, Anton and Dostalek, Michael and Armbruster, Dominik and Koch, Fabian and Hierl, Stefan and Thumann, Philipp and Swidergal, Krzysztof and Wagner, Marcus and Briem, Ulrich and Diermeier, Andreas and Spreitzer, Stefan and Beiderbeck, Sabrina and Hook, Christian and Zobel, Martin and Weber, Tim and Groß, Simon and Penzkofer, Rainer and Dendorfer, Sebastian and Schillitz, Ingo and Bauer, Thomas and Rudolph, Clarissa and Schmidt, Katja and Liebetruth, Thomas and Hamer, Markus and Haug, Sonja and Vernim, Matthias and Weber, Karsten and Saßmannshausen, Sean Patrick and Books, Sebastian and Neuleitner, Nikolaus and Rechenauer, Christian and Steffens, Oliver and Kusterle, Wolfgang and G{\"o}mmel, Roland and Wellnitz, Felix and Stierstorfer, Johannes and Stadler, Dominik and Hofmann, Matthias J. and Motschmann, Hubert and Shamonin (Chamonine), Mikhail and Bleicher, Veronika and Fischer, Sebastian and Hackenberg, Rudolf and Horn, Anton and Kawasch, Raphael and Petzenhauser, Michael and Probst, Tobias and Udalzow, Anton and Dams, Florian and Schreiner, Rupert and Langer, Christoph and Prommesberger, Christian and Ławrowski, Robert Damian}, title = {Forschungsbericht 2016}, editor = {Baier, Wolfgang}, address = {Regensburg}, organization = {Ostbayerische Technische Hochschule Regensburg}, doi = {10.35096/othr/pub-1384}, url = {http://nbn-resolving.de/urn:nbn:de:bvb:898-opus4-13840}, language = {de} } @misc{WeberDendorferSuessetal., author = {Weber, Karsten and Dendorfer, Sebastian and S{\"u}ß, Franz and Kubowitsch, Simone and Schratzenstaller, Thomas and Haug, Sonja and Mohr, Christa and Kiesl, Hans and Drechsler, J{\"o}rg and Westner, Markus and Kobus, J{\"o}rn and Schubert, Martin J. W. and Zenger, Stefan and Pietsch, Alexander and Weiß, Josef and Hinterseer, Sebastian and Schieck, Roland and Scherzinger, Stefanie and Klettke, Meike and Ringlstetter, Andreas and St{\"o}rl, Uta and Bissyand{\´e}, Tegawend{\´e} F. and Seeburger, Achim and Schindler, Timo and Ramsauer, Ralf and Kiszka, Jan and K{\"o}lbl, Andreas and Lohmann, Daniel and Mauerer, Wolfgang and Maier, Johannes and Scorna, Ulrike and Palm, Christoph and Soska, Alexander and Mottok, J{\"u}rgen and Ellermeier, Andreas and V{\"o}gele, Daniel and Hierl, Stefan and Briem, Ulrich and Buschmann, Knut and Ehrlich, Ingo and Pongratz, Christian and Pielmeier, Benjamin and Tyroller, Quirin and Monkman, Gareth J. and Gut, Franz and Roth, Carina and Hausler, Peter and Bierl, Rudolf and Prommesberger, Christian and Ławrowski, Robert Damian and Langer, Christoph and Schreiner, Rupert and Huang, Yifeng and She, Juncong and Ottl, Andreas and Rieger, Walter and Kraml, Agnes and Poxleitner, Thomas and Hofer, Simon and Heisterkamp, Benjamin and Lerch, Maximilian and Sammer, Nike and Golde, Olivia and Wellnitz, Felix and Schmid, Sandra and Muntschick, Claudia and Kusterle, Wolfgang and Paric, Ivan and Br{\"u}ckl, Oliver and Haslbeck, Matthias and Schmidt, Ottfried and Schwanzer, Peter and Rabl, Hans-Peter and Sterner, Michael and Bauer, Franz and Steinmann, Sven and Eckert, Fabian and Hofrichter, Andreas}, title = {Forschungsbericht 2017}, editor = {Baier, Wolfgang}, address = {Regensburg}, organization = {Ostbayerische Technische Hochschule Regensburg}, isbn = {978-3-9818209-3-5}, doi = {10.35096/othr/pub-1383}, url = {http://nbn-resolving.de/urn:nbn:de:bvb:898-opus4-13835}, subject = {Forschung}, language = {de} } @misc{RamsauerBulwahnLohmannetal., author = {Ramsauer, Ralf and Bulwahn, Lukas and Lohmann, Daniel and Mauerer, Wolfgang}, title = {The Sound of Silence: Mining Security Vulnerabilities from Secret Integration Channels in Open-Source Projects}, series = {MiniDebConf Regensburg (MDC) 2021}, journal = {MiniDebConf Regensburg (MDC) 2021}, address = {Regensburg}, organization = {Ostbayerische Technische Hochschule Regensburg}, language = {en} } @misc{Mauerer, author = {Mauerer, Wolfgang}, title = {Embedded Linux Quality Assurance: How to Not Lie with Statistics}, series = {Embedded Linux Conference North America ; OpenIoTSummit North America}, journal = {Embedded Linux Conference North America ; OpenIoTSummit North America}, abstract = {Embedded Linux drives an every-increasing number of appliances in many domains and applications, some even real-time and/or safety critical. Traditional quality assurance of such systems is based on testing and formal verification, but the huge amount of code and the rapid dynamics of the Linux ecosystem, as well as fundamental limitations of formal methods make these approaches unsatisfactory. Statistical quality assurance for reliability, error rates, maximal latencies etc. is needed. We will discuss current best practises, how to design and run automated statistical tests that capture relevant information, and how to properly evaluate the resulting data. Practical real-world examples and recipes are played through using the open source R language. Most importantly, we identify common mistakes in (over-)interpreting statistical results and predictions that may eventually harm people.}, language = {en} } @misc{RamsauerKiszkaMauerer, author = {Ramsauer, Ralf and Kiszka, Jan and Mauerer, Wolfgang}, title = {Building Mixed Criticality Linux Systems with the Jailhouse Hypervisor}, series = {Embedded Lunux Conference + OpenIoTSummit, Portland, OR, 21.-23.02.2017}, journal = {Embedded Lunux Conference + OpenIoTSummit, Portland, OR, 21.-23.02.2017}, abstract = {The partitioning hypervisor Jaihouse allows us to run safety critical and uncritical applications in parallel on a single SoC. We present our experiences when porting a safety and real-time critical existing application as a Jailhouse guest. It shows a novel and promising approach for implementing mixed-criticality applications with real-time requirement while not loosing the benefits of Linux. This is done by static partitioning of hardware resources; guests do not interfere. We will present a multicopter platform running the real-time critical flight stack in an isolated Jailhouse guest. This proves the practicability of Jailhouse as well as the suitability for real-time safety critical systems by porting an existing application to a Jailhouse cell. We stress its concept and show up current hardware limitations, like undesired behaviour and present possible workarounds and solutions.}, language = {en} } @misc{RamsauerDudaBulwahnetal., author = {Ramsauer, Ralf and Duda, Sebastian and Bulwahn, Lukas and Mauerer, Wolfgang}, title = {The list is our process! An analysis of the kernel's email-based development process}, series = {Embedded Linux Conference Europe, Lyon 28.10.2019}, journal = {Embedded Linux Conference Europe, Lyon 28.10.2019}, language = {en} } @misc{RamsauerDudaMauereretal., author = {Ramsauer, Ralf and Duda, Sebastian and Mauerer, Wolfgang and Bulwahn, Lukas}, title = {The list is our process: An analysis of the kernel's email-based development process}, series = {Linux Plumbers Conference, Lisbon September 9, 2019}, journal = {Linux Plumbers Conference, Lisbon September 9, 2019}, language = {en} } @misc{RamsauerKiszkaLohmannetal., author = {Ramsauer, Ralf and Kiszka, Jan and Lohmann, Daniel and Mauerer, Wolfgang}, title = {Implementierung gemischt kritischer Systeme durch statische Hardwarepartitionierung}, series = {Fr{\"u}hjahrstreffen der Fachgruppen Betriebssysteme, Hannover, 2. M{\"a}rz 2018}, journal = {Fr{\"u}hjahrstreffen der Fachgruppen Betriebssysteme, Hannover, 2. M{\"a}rz 2018}, language = {de} } @misc{Mauerer, author = {Mauerer, Wolfgang}, title = {Safety, Security, Quality: Artificial Intelligence versus Common Sense}, series = {Open Source Summit North America and Embedded Linux Conference North America 2020}, journal = {Open Source Summit North America and Embedded Linux Conference North America 2020}, language = {en} } @misc{RamsauerKiszkaMauerer, author = {Ramsauer, Ralf and Kiszka, Jan and Mauerer, Wolfgang}, title = {Spectre and Meltdown vs. Real-Time: How Much do Mitigations Cost?}, series = {Embedded Linux Conference Europe 2018, October 22 - 24, 2018, Edinburgh, UK}, journal = {Embedded Linux Conference Europe 2018, October 22 - 24, 2018, Edinburgh, UK}, language = {en} } @misc{Mauerer, author = {Mauerer, Wolfgang}, title = {Open Source in Research and Reality}, series = {Open Source Summit North America and Embedded Linux Conference North America 2020}, journal = {Open Source Summit North America and Embedded Linux Conference North America 2020}, language = {en} } @misc{RamsauerLohmannMauerer, author = {Ramsauer, Ralf and Lohmann, Daniel and Mauerer, Wolfgang}, title = {Quantifying Upstream Integration with PaStA}, series = {LTSI Workshop @ ELC17}, journal = {LTSI Workshop @ ELC17}, language = {en} } @misc{Mauerer, author = {Mauerer, Wolfgang}, title = {Approaches to Ultra Long-Term System Maintenance}, series = {Embedded Linux Conference Europe (Berlin), 2016}, journal = {Embedded Linux Conference Europe (Berlin), 2016}, language = {en} } @misc{Mauerer, author = {Mauerer, Wolfgang}, title = {Socio-Technical Aspects of Long Term Embedded Systems Maintenance}, series = {Embedded Linux Conference, April 4-6, 2016, San Diego}, journal = {Embedded Linux Conference, April 4-6, 2016, San Diego}, language = {en} } @misc{MintelRamsauerLohmannetal., author = {Mintel, Mario and Ramsauer, Ralf and Lohmann, Daniel and Scherzinger, Stefanie and Mauerer, Wolfgang}, title = {Fork {\`a} la carte f{\"u}r In-Memory-Datenbanken}, series = {Fr{\"u}hjahrstreffen der Fachgruppen Betriebssysteme, Hamburg, 17. M{\"a}rz 2022}, journal = {Fr{\"u}hjahrstreffen der Fachgruppen Betriebssysteme, Hamburg, 17. M{\"a}rz 2022}, language = {de} } @misc{MauererRamsauerKoelbl, author = {Mauerer, Wolfgang and Ramsauer, Ralf and K{\"o}lbl, Andreas}, title = {The Many Approaches to Real-Time and Safety-Critical Linux}, series = {Open Source Summit Japan 2017}, journal = {Open Source Summit Japan 2017}, language = {en} } @misc{BielmeierMauerer, author = {Bielmeier, Benno and Mauerer, Wolfgang}, title = {Semi-Formal Verification of Embedded Linux Systems Using Trace-Based Models}, series = {Semi-Formal Verification of Embedded Linux Systems Using Trace-Based Models}, journal = {Semi-Formal Verification of Embedded Linux Systems Using Trace-Based Models}, language = {en} } @misc{MauererWagner, author = {Mauerer, Wolfgang and Wagner, Daniel}, title = {Cyclic Tests Unleashed: Large-Scale RT Analysis with Jitterdebugger}, series = {Open Source Summit Japan (Tokio) and OSSNA 17.07.2019}, journal = {Open Source Summit Japan (Tokio) and OSSNA 17.07.2019}, language = {en} } @article{SchoenbergerScherzingerMauerer, author = {Sch{\"o}nberger, Manuel and Scherzinger, Stefanie and Mauerer, Wolfgang}, title = {Ready to Leap (by Co-Design)? Join Order Optimisation on Quantum Hardware}, series = {Proceedings of the ACM on Management of Data, PACMMOD}, volume = {1}, journal = {Proceedings of the ACM on Management of Data, PACMMOD}, number = {1}, publisher = {ACM}, address = {New York, NY,}, doi = {10.1145/3588946}, url = {http://nbn-resolving.de/urn:nbn:de:bvb:898-opus4-56634}, pages = {1 -- 27}, abstract = {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. 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. 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.}, language = {en} } @inproceedings{RamsauerLohmannMauerer, author = {Ramsauer, Ralf and Lohmann, Daniel and Mauerer, Wolfgang}, title = {The List is the Process: Reliable Pre-Integration Tracking of Commits on Mailing Lists}, series = {2019 IEEE/ACM 41st International Conference on Software Engineering (ICSE), 25-31 May 2019, Montreal, QC, Canada}, booktitle = {2019 IEEE/ACM 41st International Conference on Software Engineering (ICSE), 25-31 May 2019, Montreal, QC, Canada}, publisher = {IEEE}, doi = {10.1109/ICSE.2019.00088}, pages = {807 -- 818}, abstract = {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.}, language = {en} } @inproceedings{MauererScherzinger, author = {Mauerer, Wolfgang and Scherzinger, Stefanie}, title = {Nullius in Verba: Reproducibility for Database Systems Research, Revisited}, series = {2021 IEEE 37th International Conference on Data Engineering (ICDE 2021): 19-22 April 2021, Chania, Greece}, booktitle = {2021 IEEE 37th International Conference on Data Engineering (ICDE 2021): 19-22 April 2021, Chania, Greece}, editor = {Ailamaki, Anastasia}, publisher = {IEEE}, address = {Piscataway, NJ}, isbn = {978-1-7281-9184-3}, doi = {10.1109/ICDE51399.2021.00270}, pages = {2377 -- 2380}, abstract = {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.}, language = {en} } @inproceedings{MauererRamsauerLucasetal., author = {Mauerer, Wolfgang and Ramsauer, Ralf and Lucas, Edson R. F. and Scherzinger, Stefanie}, title = {Silentium! Run-Analyse-Eradicate the Noise out of the DB/OS Stack}, series = {Datenbanksysteme f{\"u}r Business, Technologie und Web (BTW 2021): 13.-17. September 2021, Dresden, Deutschland}, booktitle = {Datenbanksysteme f{\"u}r Business, Technologie und Web (BTW 2021): 13.-17. September 2021, Dresden, Deutschland}, publisher = {Gesellschaft f{\"u}r Informatik}, doi = {10.18420/btw2021-21}, pages = {397 -- 421}, abstract = {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. Low-latency databases; tail latency; real-time databases; bounded-time query processing; DB-OS co-engineering}, language = {de} } @article{FranzWolfPeriyasamyetal., author = {Franz, Maja and Wolf, Lucas and Periyasamy, Maniraman and Ufrecht, Christian and Scherer, Daniel D. and Plinge, Axel and Mutschler, Christopher and Mauerer, Wolfgang}, title = {Uncovering Instabilities in Variational-Quantum Deep Q-Networks}, series = {Journal of the Franklin Institute}, journal = {Journal of the Franklin Institute}, edition = {In Press, Corrected Proof}, publisher = {Elsevier}, issn = {0016-0032}, doi = {10.1016/j.jfranklin.2022.08.021}, abstract = {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.}, language = {en} } @article{SaxFeldZielinskietal., author = {Sax, Irmi and Feld, Sebastian and Zielinski, Sebastian and Gabor, Thomas and Linnhoff-Popien, Claudia and Mauerer, Wolfgang}, title = {Towards Understanding Approximation Complexity on a Quantum Annealer}, series = {Digitale Welt}, volume = {4}, journal = {Digitale Welt}, number = {1}, publisher = {DIGITALE WELT Academy c/o Ludwig-Maximilians-Universit{\"a}t M{\"u}nchen}, address = {M{\"u}nchen}, doi = {10.1007/s42354-019-0244-1}, pages = {104}, abstract = {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.}, language = {en} } @inproceedings{MauererScherzinger, author = {Mauerer, Wolfgang and Scherzinger, Stefanie}, title = {Educating Future Software Architects in the Art and Science of Analysing Software Data.}, series = {SEUH 2020: Software Engineering im Unterricht der Hochschulen, Tagungsband des 17. Workshops "Software Engineering im Unterricht der Hochschulen", Innsbruck, {\"O}sterreich, 26. - 27.02.2020}, booktitle = {SEUH 2020: Software Engineering im Unterricht der Hochschulen, Tagungsband des 17. Workshops "Software Engineering im Unterricht der Hochschulen", Innsbruck, {\"O}sterreich, 26. - 27.02.2020}, editor = {Krusche, Stephan and Wagner, Stefan}, publisher = {RWTH Aachen}, pages = {56 -- 60}, abstract = {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.}, language = {en} } @unpublished{RamsauerHuberSchwarzetal., author = {Ramsauer, Ralf and Huber, Stefan and Schwarz, Konrad and Kiszka, Jan and Mauerer, Wolfgang}, title = {Static Hardware Partitioning on RISC-V - Shortcomings, Limitations, and Prospects}, doi = {10.48550/arXiv.2208.02703}, abstract = {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.}, language = {en} } @unpublished{OberthuerMauerer, author = {Oberth{\"u}r, S. and Mauerer, Wolfgang}, title = {Sicherheit von Android-Systemen}, language = {de} } @inproceedings{Mauerer, author = {Mauerer, Wolfgang}, title = {Supershrink Linux - and beyond}, series = {Embedded Linux Conference Europe (Dublin), 2015}, booktitle = {Embedded Linux Conference Europe (Dublin), 2015}, language = {en} } @inproceedings{ScherzingerMauererKondylakis, author = {Scherzinger, Stefanie and Mauerer, Wolfgang and Kondylakis, Haridimos}, title = {DeBinelle: Semantic Patches for Coupled Database-Application Evolution}, series = {2021 IEEE 37th International Conference on Data Engineering (ICDE 2021): 19-22 April 2021, Chania, Greece}, booktitle = {2021 IEEE 37th International Conference on Data Engineering (ICDE 2021): 19-22 April 2021, Chania, Greece}, editor = {Ailamaki, Anastasia}, publisher = {IEEE}, address = {Piscataway, NJ}, isbn = {978-1-7281-9184-3}, doi = {10.1109/ICDE51399.2021.00307}, pages = {2697 -- 2700}, abstract = {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.}, language = {en} } @inproceedings{FruthScherzingerMauereretal., author = {Fruth, Michael and Scherzinger, Stefanie and Mauerer, Wolfgang and Ramsauer, Ralf}, title = {Tell-Tale Tail Latencies: Pitfalls and Perils in Database Benchmarking}, series = {Performance evaluation and benchmarking, 13th TPC Technology Conference (TPCTC 2021): Copenhagen, Denmark, August 20, 2021, Revised Selected Papers}, booktitle = {Performance evaluation and benchmarking, 13th TPC Technology Conference (TPCTC 2021): Copenhagen, Denmark, August 20, 2021, Revised Selected Papers}, editor = {Nambiar, Raghunath and Poess, Meikel}, publisher = {Springer}, address = {Cham, Switzerland}, isbn = {9783030944377}, doi = {10.1007/978-3-030-94437-7_8}, pages = {119 -- 134}, abstract = {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.}, language = {en} } @inproceedings{SaxFeldZielinskietal., author = {Sax, Irmi and Feld, Sebastian and Zielinski, Sebastian and Gabor, Thomas and Linnhoff-Popien, Claudia and Mauerer, Wolfgang}, title = {Approximate approximation on a quantum annealer}, series = {Proceedings of the 17th ACM International Conference on Computing Frontiers (CF '20): Catania Sicily Italy 11.05.2020 -13.05.2020}, booktitle = {Proceedings of the 17th ACM International Conference on Computing Frontiers (CF '20): Catania Sicily Italy 11.05.2020 -13.05.2020}, editor = {Palesi, Maurizio}, publisher = {Association for Computing Machinery}, address = {New York, NY, United States}, isbn = {9781450379564}, doi = {10.1145/3387902.3392635}, pages = {108 -- 117}, abstract = {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.}, language = {en} } @inproceedings{MauererScherzinger, author = {Mauerer, Wolfgang and Scherzinger, Stefanie}, title = {1-2-3 Reproducibility for Quantum Software Experiments}, series = {2022 IEEE International Conference on Software Analysis, Evolution and Reengineering (SANER), Honolulu, HI, USA, 15-18 March 2022}, booktitle = {2022 IEEE International Conference on Software Analysis, Evolution and Reengineering (SANER), Honolulu, HI, USA, 15-18 March 2022}, publisher = {IEEE}, doi = {10.1109/SANER53432.2022.00148}, pages = {1247 -- 1248}, abstract = {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.}, language = {en} } @inproceedings{BrainingerMauererScherzinger, author = {Braininger, Dimitri and Mauerer, Wolfgang and Scherzinger, Stefanie}, title = {Replicability and Reproducibility of a Schema Evolution Study in Embedded Databases}, series = {Advances in conceptual modeling: ER 2020 Workshops CMAI, CMLS, CMOMM4FAIR, CoMoNoS, EmpER, Vienna, Austria, November 3-6, 2020, Proceedings}, volume = {12584}, booktitle = {Advances in conceptual modeling: ER 2020 Workshops CMAI, CMLS, CMOMM4FAIR, CoMoNoS, EmpER, Vienna, Austria, November 3-6, 2020, Proceedings}, editor = {Grossmann, Georg and Ram, Sudha}, publisher = {Springer}, address = {Cham}, isbn = {978-3-030-65846-5}, doi = {10.1007/978-3-030-65847-2_19}, pages = {210 -- 219}, abstract = {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.}, language = {en} } @inproceedings{KruegerMauerer, author = {Kr{\"u}ger, Tom and Mauerer, Wolfgang}, title = {Quantum Annealing-Based Software Components}, series = {Proceedings of the IEEE/ACM 42nd International Conference on Software Engineering Workshops (ICSE'20): Seoul Republic of Korea 27.06.2020 - 19.07.2020}, booktitle = {Proceedings of the IEEE/ACM 42nd International Conference on Software Engineering Workshops (ICSE'20): Seoul Republic of Korea 27.06.2020 - 19.07.2020}, publisher = {Association for Computing Machinery}, address = {New York, NY}, isbn = {9781450379632}, doi = {10.1145/3387940.3391472}, pages = {445 -- 450}, abstract = {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.}, language = {en} } @inproceedings{GaborZielinskiFeldetal., author = {Gabor, Thomas and Zielinski, Sebastian and Feld, Sebastian and Roch, Christoph and Seidel, Christian and Neukart, Florian and Galter, Isabella and Mauerer, Wolfgang and Linnhoff-Popien, Claudia}, title = {Assessing Solution Quality of 3SAT on a Quantum Annealing Platform}, series = {Quantum Technology and Optimization Problems : First International Workshop, QTOP 2019, Munich, Germany, March 18, 2019, Proceedings}, volume = {11413}, booktitle = {Quantum Technology and Optimization Problems : First International Workshop, QTOP 2019, Munich, Germany, March 18, 2019, Proceedings}, editor = {Feld, Sebastian and Linnhoff-Popien, Claudia}, publisher = {Springer International Publishing}, address = {Cham}, isbn = {978-3-030-14081-6}, doi = {10.1007/978-3-030-14082-3_3}, pages = {23 -- 35}, language = {en} } @article{MauererScherzinger, author = {Mauerer, Wolfgang and Scherzinger, Stefanie}, title = {Digitale Forschungswerkzeuge : Nachhaltigkeit f{\"u}r Software und Daten}, series = {Forschung \& Lehre (Forschung und Lehre)}, volume = {28}, journal = {Forschung \& Lehre (Forschung und Lehre)}, number = {10}, publisher = {Zentrum f{\"u}r Wissenschaftsmanagement e.V. (ZWM)
}, organization = {Deutscher Hochschullehrerverband}, pages = {816 -- 817}, abstract = {Die wissenschaftliche Reproduktionskrise hat den Blick auf digitale Forschungswerkzeuge intensiviert. Auch wenn der Mehraufwand f{\"u}r Reproduzierbarkeit und Zug{\"a}nglichkeit zunehmend anerkannt wird, existieren noch Defizite in der Umsetzung, wenn es darum geht, die Datenbasis und Forschungswerkzeuge verf{\"u}gbar zu machen}, language = {de} } @article{BayerstadlerBecquinBinderetal., author = {Bayerstadler, Andreas and Becquin, Guillaume and Binder, Julia and Botter, Thierry and Ehm, Hans and Ehmer, Thomas and Erdmann, Marvin and Gaus, Norbert and Harbach, Philipp and Hess, Maximilian and Klepsch, Johannes and Leib, Martin and Luber, Sebastian and Luckow, Andre and Mansky, Maximilian and Mauerer, Wolfgang and Neukart, Florian and Niedermeier, Christoph and Palackal, Lilly and Pfeiffer, Ruben and Polenz, Carsten and Sepulveda, Johanna and Sievers, Tammo and Standen, Brian and Streif, Michael and Strohm, Thomas and Utschig-Utschig, Clemens and Volz, Daniel and Weiss, Horst and Winter, Fabian}, title = {Industry quantum computing applications}, series = {EPJ Quantum Technology}, volume = {8}, journal = {EPJ Quantum Technology}, publisher = {Springer}, organization = {Springer}, doi = {10.1140/epjqt/s40507-021-00114-x}, pages = {1 -- 17}, abstract = {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.}, language = {en} } @article{ChristBrechtMauereretal., author = {Christ, Andreas and Brecht, Benjamin and Mauerer, Wolfgang and Silberhorn, Christine}, title = {Theory of quantum frequency conversion and type-II parametric down-conversion in the high-gain regime}, series = {New Journal of Physics}, volume = {15}, journal = {New Journal of Physics}, number = {5}, publisher = {IOP}, doi = {10.1088/1367-2630/15/5/053038}, abstract = {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.}, language = {en} } @article{GabrielWittmannSychetal., author = {Gabriel, Christian and Wittmann, Christoffer and Sych, Denis and Dong, Ruifang and Mauerer, Wolfgang and Andersen, Ulrik L. and Marquardt, Christoph and Leuchs, Gerd}, title = {A generator for unique quantum random numbers based on vacuum states}, series = {Nature Photonics}, volume = {4}, journal = {Nature Photonics}, number = {10}, publisher = {Springer}, organization = {Springer}, doi = {10.1038/nphoton.2010.197}, pages = {711 -- 715}, abstract = {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.}, language = {en} } @article{MauererJaeger, author = {Mauerer, Wolfgang and Jaeger, Michael C.}, title = {Open Source Engineering Processes}, series = {it - Information Technology}, volume = {55}, journal = {it - Information Technology}, number = {5}, publisher = {de Gruyter}, doi = {10.1515/itit.2013.1008}, pages = {196 -- 203}, abstract = {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.}, language = {en} } @article{ColdenstrodtRongeLundeenPregnelletal., author = {Coldenstrodt-Ronge, Hendrik B. and Lundeen, Jeff S. and Pregnell, Kenny L. and Feito, Alvaro and Smith, Brian J. and Mauerer, Wolfgang and Silberhorn, Christine and Eisert, Jens and Plenio, Martin B. and Walmsley, Ian A.}, title = {A proposed testbed for detector tomography}, series = {Journal of Modern Optics}, volume = {56}, journal = {Journal of Modern Optics}, number = {2-3}, publisher = {Taylor\&Francis}, doi = {10.1080/09500340802304929}, pages = {432 -- 441}, abstract = {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.}, language = {en} } @article{MauererAvenhausHelwigetal., author = {Mauerer, Wolfgang and Avenhaus, Malte and Helwig, Wolfram and Silberhorn, Christine}, title = {How colors influence numbers: Photon statistics of parametric down-conversion}, series = {Physical Review A (Phys. Rev. A)}, volume = {80}, journal = {Physical Review A (Phys. Rev. A)}, number = {5}, publisher = {American Physical Society}, doi = {10.1103/physreva.80.053815}, abstract = {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.}, language = {en} } @article{MauererSawallischHillieretal., author = {Mauerer, Wolfgang and Sawallisch, J. and Hillier, G. and Oberth{\"u}r, S. and H{\"o}nick, S.}, title = {Real-Time Android: Achieving determinism and ease of use}, series = {Embedded Wold Conference; Nuremberg, Germany, February 25, 2014 - February 27, 2014}, journal = {Embedded Wold Conference; Nuremberg, Germany, February 25, 2014 - February 27, 2014}, pages = {1 -- 7}, language = {en} } @article{RohdeMauererSilberhorn, author = {Rohde, Peter P. and Mauerer, Wolfgang and Silberhorn, Christine}, title = {Spectral structure and decompositions of optical states, and their applications}, series = {New Journal of Physics}, volume = {9}, journal = {New Journal of Physics}, number = {4}, publisher = {IOP Publishing}, doi = {10.1088/1367-2630/9/4/091}, pages = {91}, abstract = {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{\"o}dinger kitten and Fock states. Our techniques allow for very simple descriptions of each of these examples.}, language = {en} } @article{HelwigMauererSilberhorn, author = {Helwig, Wolfram and Mauerer, Wolfgang and Silberhorn, Christine}, title = {Multimode states in decoy-based quantum-key-distribution protocols}, series = {Physical Review A}, volume = {80}, journal = {Physical Review A}, number = {5}, publisher = {American Physical Society}, doi = {10.1103/physreva.80.052326}, abstract = {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.}, language = {en} } @article{MauererHelwigSilberhorn, author = {Mauerer, Wolfgang and Helwig, Wolfram and Silberhorn, Christine}, title = {Recent developments in quantum key distribution: Theory and practice}, series = {Annalen der Physik}, volume = {17}, journal = {Annalen der Physik}, number = {2-3}, publisher = {Wiley}, doi = {10.1002/andp.200710284}, pages = {158 -- 175}, abstract = {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.}, language = {en} } @article{AvenhausColdenstrodtRongeLaihoetal., author = {Avenhaus, Malte and Coldenstrodt-Ronge, Hendrik B. and Laiho, K. and Mauerer, Wolfgang and Walmsley, I. A. and Silberhorn, Christine}, title = {Photon Number Statistics of Multimode Parametric Down-Conversion}, series = {Physical Review Letters}, volume = {101}, journal = {Physical Review Letters}, number = {5}, publisher = {American Physical Society}, doi = {10.1103/physrevlett.101.053601}, abstract = {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.}, language = {en} } @article{MauererSilberhorn, author = {Mauerer, Wolfgang and Silberhorn, Christine}, title = {Quantum key distribution with passive decoy state selection}, series = {Physical Review A}, volume = {75}, journal = {Physical Review A}, number = {5}, publisher = {American Physical Society}, doi = {10.1103/physreva.75.050305}, abstract = {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.}, language = {en} } @book{Mauerer, author = {Mauerer, Wolfgang}, title = {Professional Linux kernel architecture}, series = {Wrox professional guides}, journal = {Wrox professional guides}, publisher = {Wiley}, address = {Indianapolis}, isbn = {9780470343432}, abstract = {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.}, language = {en} } @article{Mauerer, author = {Mauerer, Wolfgang}, title = {Datenvisualisierung mit Ggplot2}, series = {Linux-Magazin}, journal = {Linux-Magazin}, number = {3}, publisher = {Linux New Media AG}, abstract = {Wer seine Daten mit ansehnlichen und informativen Graphen veranschaulichen m{\"o}chte, braucht meist viel Geduld. Die R-Erweiterung Ggplot2 bringt System in die Grafik, dr{\"u}ckt sich in knappem Quellcode aus und bl{\"a}st frischen Wind in den Alltag der Datenvisualisierung.}, language = {en} }