@techreport{AzcuyBecquerHeinrich2023, author = {Azcuy Becquer, Claudia and Heinrich, Horst-Alfred}, title = {Data documentation on history visualisations on the covers of all issues of Der Spiegel between 1965 and 2021}, url = {http://nbn-resolving.de/urn:nbn:de:bvb:739-opus4-12678}, pages = {126 Seiten}, year = {2023}, abstract = {To answer the research question, all SPIEGEL covers from 1965 to 2021 were examined for a reference to history topics. The report documents the assignments of the 533 covers recorded to the categories of history narrative, politics of memory and politics of the past. Main article: https://doi.org/10.3167/jemms.2023.150107}, language = {en} } @phdthesis{Stuedlein2022, author = {St{\"u}dlein, Nadine}, title = {Data as a Common Good: Essays on Data Portability and B2B Industrial Data Sharing}, url = {http://nbn-resolving.de/urn:nbn:de:bvb:739-opus4-11205}, school = {Universit{\"a}t Passau}, pages = {iii, 96 Seiten}, year = {2022}, abstract = {Data is an important resource in our economy and society, substantially improving overall business efficiency, innovativeness and competitiveness, and shaping our everyday lives. Yet, to leverage the data's full potential, its access and availability is vital. Thus, data sharing across organizations is of particular importance. This thesis examines the role of data sharing in the digital economy and contributes to a better understanding why data sharing matters, why it is still underutilized, and how data sharing can be encouraged. Thereby, the thesis contributes to the ongoing academic debate as well as the practical and political efforts on how to promote data sharing. The thesis is comprised of three studies. Study 1 examines personal data sharing among (competing) online services. Particularly, it investigates the consequences of Article 20 in the General Data Protection Regulation (GDPR, May 2018), ensuring the right to data portability. This relatively new right allows online service users to transfer any personal data from one service provider to another. Focusing on a) the amount of data provided by users and b) the amount of user data disclosed to third party data brokers by service providers, the study investigates the right to data portability's effect on competitiveness and consumer surplus. Study 2 and Study 3 focus on non-personal data sharing among competing firms. Study 2 examines the literature to identify and classify barriers to non-personal, machine-generated data sharing. The study explains firms' reluctance to sharing data and discusses policy and managerial implications for overcoming the data sharing barriers. Study 3 focuses on data sharing via platforms. It investigates the Business-to-Business (B2B) data sharing platform design implications for promoting industrial data sharing. In particular, Study 3 investigates the dimensions control and transparency regarding their effect in eliciting cooperation and encouraging data sharing among firms. In summary, this thesis examines and reveals how access and availability of data can be increased through creating beneficial data sharing conditions in B2B relationships. Particularly, the thesis contributes to the understanding of a) the implications of data sharing laws, defined in the GDPR for personal data and b) the challenges and measures of the not yet successfully established, non-personal data sharing.}, language = {en} } @phdthesis{Fischer2001, author = {Fischer, Bernd}, title = {Deduction-Based Software Component Retrieval}, url = {http://nbn-resolving.de/urn:nbn:de:bvb:739-opus-231}, school = {Universit{\"a}t Passau}, year = {2001}, abstract = {Deduction-based software component retrieval is a software reuse technique that uses formal specifications as component descriptors and as search keys; matching components are identified using an automated theorem prover. This dissertation contains a detailed theoretical investigation of the concept as well as the first substantial experimental evaluation of its technical feasibility.}, subject = {Software engineering}, language = {en} } @phdthesis{Braumandl2002, author = {Braumandl, Reinhard}, title = {Quality of Service and Optimization in Data Integration Systems}, url = {http://nbn-resolving.de/urn:nbn:de:bvb:739-opus-279}, school = {Universit{\"a}t Passau}, year = {2002}, abstract = {This work presents techniques for the construction of a global data integrations system. Similar to distributed databases this system allows declarative queries in order to express user-specific information needs. Scalability towards global data integration systems and openness were major design goals for the architecture and techniques developed in this work. It is shown how service composition, extensibility and quality of service can be supported in an open system of providers for data, functionality for query processing operations, and computing power.}, subject = {Dienstg{\"u}te}, language = {en} } @phdthesis{Baehne2015, author = {B{\"a}hne, Katharina}, title = {The Will to Play. Performance and Construction of Royal Masculinity in Early Modern History Plays}, url = {http://nbn-resolving.de/urn:nbn:de:bvb:739-opus4-3329}, school = {Universit{\"a}t Passau}, pages = {415}, year = {2015}, abstract = {Die vorliegende Arbeit untersucht M{\"a}nnlichkeitskonzepte in der Fr{\"u}hen Neuzeit, wobei das Hauptaugenmerk auf die dramatische Konstruktion der Figur des K{\"o}nigs gerichtet wird. Anhand von zehn Historiendramen der 1590er wird zum einen die diskursive Komplexit{\"a}t k{\"o}niglicher M{\"a}nnlichkeit in der Renaissance untersucht, um darauf aufbauend deren performative Darstellung zu analysieren. Im Theorieteil werden M{\"a}nnlichkeit und Herrschaft im elisabethanischen England mithilfe zeitgen{\"o}ssischer Texte diskutiert und durch den Genderdiskurs und die Performativit{\"a}t von Gender erweitert. Der darauf folgende Methodikteil entwickelt aus den gewonnenen Erkenntnissen eine Semiotik von k{\"o}niglicher M{\"a}nnlichkeit, die anschließend im Analyseteil anhand der ausgew{\"a}hlten Historiendramen evaluiert wird.}, subject = {M{\"a}nnlichkeit}, language = {en} } @phdthesis{Zukowski2001, author = {Zukowski, Ulrich}, title = {Flexible Computation of the Well-Founded Semantics of Normal Logic Programs}, url = {http://nbn-resolving.de/urn:nbn:de:bvb:739-opus-226}, school = {Universit{\"a}t Passau}, year = {2001}, abstract = {The well-founded semantics has been accepted as the most relevant semantics for logic-based information systems. In this dissertation a framework based on a set of program transformations is presented that generalizes all major computation approaches for the well-founded semantics using a common data structure and provides a common language to describe their evaluation strategy. This rewriting system gives the formal background to analyze and combine different evaluation strategies in a common framework, or to design new algorithms and prove the correctness of its implementations at a high level just by changing the order of program transformations.}, subject = {Logische Programmierung}, language = {en} } @phdthesis{Wichert2000, author = {Wichert, Carl-Alexander}, title = {ULTRA - A Logic Transaction Programming Language}, url = {http://nbn-resolving.de/urn:nbn:de:bvb:739-opus-105}, school = {Universit{\"a}t Passau}, year = {2000}, abstract = {Rule-based language for the specification of complex database updates and transactions. Formal treatment of the syntax and the declarative semantics}, subject = {Programmierlogik}, language = {en} } @phdthesis{Dolzmann2000, author = {Dolzmann, Andreas}, title = {Algorithmic strategies for applicable real quantifier elimination}, url = {http://nbn-resolving.de/urn:nbn:de:bvb:739-opus-64}, school = {Universit{\"a}t Passau}, year = {2000}, abstract = {One of the most important algorithms for real quantifier elimination is the quantifier elimination by virtual substitution introduced by Weispfenning in 1988. In this thesis we present numerous algorithmic approaches for optimizing this quantifier elimination algorithm. Optimization goals are the actual running time of the implementation of the algorithm and the size of the output formula. Strategies for obtaining these goals include simplification of first-order formulas,reduction of the size of the computed elimination set, and condensing a new replacement for the virtual substitution. Local quantifier elimination computes formulas that are equivalent to the input formula only nearby a given point. We can make use of this restriction for further optimizing the quantifier elimination by virtual substitution. Finally we discuss how to solve a large class of scheduling problems by real quantifier elimination. To optimize our algorithm for solving scheduling problems we make use of the special form of the input formula and of additional information given by the description of the scheduling problem}, subject = {Quantorenelimination}, language = {en} } @phdthesis{Seidl2006, author = {Seidl, Andreas}, title = {Cylindrical Decomposition Under Application-Oriented Paradigms}, url = {http://nbn-resolving.de/urn:nbn:de:bvb:739-opus-816}, school = {Universit{\"a}t Passau}, year = {2006}, abstract = {Quantifier elimination (QE) is a powerful tool for problem solving. Once a problem is expressed as a formula, such a method converts it to a simpler, quantifier-free equivalent, thus solving the problem. Particularly many problems live in the domain of real numbers, which makes real QE very interesting. Among the so far implemented methods, QE by cylindrical algebraic decomposition (CAD) is the most important complete method. The aim of this thesis is to develop CAD-based algorithms, which can solve more problems in practice and/or provide more interesting information as output. An algorithm that satisfies these standards would concentrate on generic cases and postpone special and degenerated ones to be treated separately or to be abandoned completely. It would give a solution, which is locally correct for a region the user is interested in. It would give answers, which can provide much valuable information in particular for decision problems. It would combine these methods with more specialized ones, for subcases that allow for. It would exploit degrees of freedom in the algorithms by deciding to proceed in a way that promises to be efficient. It is the focus of this dissertation to treat these challenges. Algorithms described here are implemented in the computer logic system REDLOG and ship with the computer algebra system REDUCE.}, subject = {Quantorenelimination}, language = {en} } @phdthesis{Ellmenreich2004, author = {Ellmenreich, Nils}, title = {PolyAPM: Comparative Parallel Programming with Abstract Parallel Machines}, url = {http://nbn-resolving.de/urn:nbn:de:bvb:739-opus-447}, school = {Universit{\"a}t Passau}, year = {2004}, abstract = {A parallelising compilation consists of many translation and optimisation stages. The programmer may steer the compiler through these stages by supplying directives with the source code or setting compiler switches. However, for an evaluation of the effects of individual stages, their selection and their best order, this approach is not optimal. To solve this problem, we propose the following method. The compilation is cast as a sequence of program transformations. Each intermediate program runs on an Abstract Parallel Machine (APM), while the program generated by the final transformation runs on the target architecture. Our intermediate programs are all in the same language, Haskell. Thus, each program is executable and still abstract enough to be legible, which enables the evaluation of the transformation that generated it. This evaluation is supported by a cost model, which makes a performance prediction of the abstract program for a real machine. Our project, PolyAPM, provides an acyclic directed graph -- usually a tree -- of APMs whose traversal specifies different combinations and orders of transformations. From one source program, several target programs can be constructed. Their run time characteristics can be evaluated and compared. The goal of PolyAPM is not to support the one-off construction of parallel application programs. For the method's overhead to pay off, the project aims rather at supporting the construction and comparison of many similar variations of a parallel program and a comparative evaluation of parallelisation techniques. With the automation of transformations, PolyAPM can also be used to construct semi-automatic compilation systems.}, subject = {Parallelverarbeitung}, language = {en} }