open_access
Refine
Year of publication
Document Type
- Doctoral Thesis (450)
- Part of Periodical (139)
- Article (58)
- Book (49)
- Report (21)
- Preprint (18)
- Conference Proceeding (10)
- Master's Thesis (10)
- Other (10)
- Bachelor Thesis (7)
- Review (6)
- Part of a Book (4)
- Study Thesis (1)
Language
- German (480)
- English (294)
- Multiple languages (5)
- Spanish (3)
- French (1)
Has Fulltext
- yes (783)
Keywords
- Lehrerbildung (30)
- Deutschland (22)
- Österreich (18)
- Universität Passau (13)
- Kultursemiotik (12)
- Maßtheorie (12)
- Mediensemiotik (12)
- Graphenzeichnen (9)
- Computersicherheit (8)
- Didaktik (7)
Institute
- Philosophische Fakultät (206)
- Fakultät für Informatik und Mathematik (114)
- Mitarbeiter Lehrstuhl/Einrichtung der Fakultät für Informatik und Mathematik (70)
- Wirtschaftswissenschaftliche Fakultät (67)
- Juristische Fakultät (40)
- Mitarbeiter Lehrstuhl/Einrichtung der Wirtschaftswissenschaftlichen Fakultät (40)
- Zentrum für Lehrerbildung und Fachdidaktik (32)
- Department für Katholische Theologie (28)
- Universitätsbibliothek (28)
- Philosophische Fakultät / Pädagogik (23)
Die vergleichende Sportpädagogik als Teildisziplin und zugleich Schnittmenge der vergleichenden Erziehungswissenschaft und der allgemeinen Sportpädagogik macht es sich zur Aufgabe, sportbezogene Charakteristika zweier oder mehrerer Länder oder Kulturen miteinander zu vergleichen und den dadurch entstandenen Erkenntnisgewinn in verschiedensten Sphären nutzbar zu machen – eine Wissenschaftsdisziplin, wie auch Forschungsmethode, deren Möglichkeiten nicht nur für den Sportunterricht per se, sondern auch für die (universitäre) Ausbildung der zukünftigen Arrangeure des Sportunterrichts nutzbar gemacht werden können. Im Rahmen eines melioristisch motivierten Vergleichs macht es sich diese Forschungsarbeit zum Ziel, Unterschiede und Gemeinsamkeiten der universitären Sportlehramtsausbildung in Deutschland und den USA zu eruieren, deren Ursachen zu analysieren und auf dieser Basis Potenziale, Entwicklungsperspektiven und Handlungsoptionen für den positiven Fortschritt beider universitärer Ausbildungssysteme aufzuzeigen. Dabei werden sowohl außensystemische, wie auch innensystemische Untersuchungsaspekte berücksichtigt.
Subjektive Theorien von Grundschullehrkräften über Eltern wurden qualitativ-empirisch erkundet, um einen Beitrag zur Schule-Elternhauskooperation zu leisten. Luhmanns Systemtheorie und Fends Schultheorie bilden die theoretische Basis. Mithilfe von drei Interaktionsfeldern, die entscheidende Begegnungsräume zwischen Grundschullehrkräften und Elternschaft markieren, wurde dem Verhältnis zueinander nachgegangen (Luhmann, 2014; Fend, 2008). Mittels eines halbstandardisierten Leitfadeninterviews und einer adaptierten Struktur-Legetechnik sind die Subjektiven Theorien der Untersuchungsteilnehmer*innen erfasst worden (Scheele & Groeben, 1988). Aus der Perspektive von Lehrkräften wurden die individuellen und generellen subjektiven Theorien herausgearbeitet. Die Ergebnisse offenbaren fachlich fehlerhafte und für Kooperation teilweise äußerst hemmende Überzeugungen, obgleich der Wunsch nach einem kooperativen Miteinander stets betont wurde.
Die vorliegende Arbeit erforscht den Einsatz von Ekphrasen in audiovisuellen Texten. Der ursprünglich aus der antiken Rhetoriklehre stammende Begriff bezeichnet die literarische Beschreibung von bildender Kunst und wird im Rahmen dieser Untersuchung auf den Film übertragen. Ziel der Analyse filmischer Beschreibungen von Kunst, speziell Malerei, ist es zu eruieren, wie Kunstwerke im Sinne der Bedeutungsvermittlung semantisch aufgeladen respektive funktionalisiert werden. Zentrale Forschungsgegenstände bilden demnach die Medien Bild und Film – somit ist die gesamte Arbeit in den Kontext des Intermedialitätsdiskurses eingebettet. Als Korpus dient ein Konglomerat an Texten, das neben zentralen Schlüsselwerken insbesondere jüngere – zwischen 2011 und 2016 entstandene –, wenig bis kaum erforschte Filme umfasst.
The current movement towards a smart grid serves as a solution to present power grid challenges by introducing numerous monitoring and communication technologies. A dependable, yet timely exchange of data is on the one hand an existential prerequisite to enable Advanced Metering Infrastructure (AMI) services, yet on the other a challenging endeavor, because the increasing complexity of the grid fostered by the combination of Information and Communications Technology (ICT) and utility networks inherently leads to dependability challenges.
To be able to counter this dependability degradation, current approaches based on high-reliability hardware or physical redundancy are no longer feasible, as they lead to increased hardware costs or maintenance, if not both. The flexibility of these approaches regarding vendor and regulatory interoperability is also limited. However, a suitable solution to the AMI dependability challenges is also required to maintain certain regulatory-set performance and Quality of Service (QoS) levels.
While a part of the challenge is the introduction of ICT into the power grid, it also serves as part of the solution. In this thesis a Network Functions Virtualization (NFV) based approach is proposed, which employs virtualized ICT components serving as a replacement for physical devices. By using virtualization techniques, it is possible to enhance the performability in contrast to hardware based solutions through the usage of virtual replacements of processes that would otherwise require dedicated hardware. This approach offers higher flexibility compared to hardware redundancy, as a broad variety of virtual components can be spawned, adapted and replaced in a short time. Also, as no additional hardware is necessary, the incurred costs decrease significantly. In addition to that, most of the virtualized components are deployed on Commercial-Off-The-Shelf (COTS) hardware solutions, further increasing the monetary benefit.
The approach is developed by first reviewing currently suggested solutions for AMIs and related services. Using this information, virtualization technologies are investigated for their performance influences, before a virtualized service infrastructure is devised, which replaces selected components by virtualized counterparts. Next, a novel model, which allows the separation of services and hosting substrates is developed, allowing the introduction of virtualization technologies to abstract from the underlying architecture. Third, the performability as well as monetary savings are investigated by evaluating the developed approach in several scenarios using analytical and simulative model analysis as well as proof-of-concept approaches. Last, the practical applicability and possible regulatory challenges of the approach are identified and discussed.
Results confirm that—under certain assumptions—the developed virtualized AMI is superior to the currently suggested architecture. The availability of services can be severely increased and network delays can be minimized through centralized hosting. The availability can be increased from 96.82% to 98.66% in the given scenarios, while decreasing the costs by over 60% in comparison to the currently suggested AMI architecture. Lastly, the performability analysis of a virtualized service prototype employing performance analysis and a Musa-Okumoto approach reveals that the AMI requirements are fulfilled.
Computer vision aims at developing algorithms to extract high-level information from images and videos. In the industry, for instance, such algorithms are applied to guide manufacturing robots, to visually monitor plants, or to assist human operators in recognizing specific components. Recent progress in computer vision has been dominated by deep artificial neural network, i.e., machine learning methods simulating the way that information flows in our biological brains, and the way that our neural networks adapt and learn from experience. For these methods to learn how to accurately perform complex visual tasks, large amounts of annotated images are needed. Collecting and labeling such domain-relevant training datasets is, however, a tedious—sometimes impossible—task. Therefore, it has become common practice to leverage pre-available three-dimensional (3D) models instead, to generate synthetic images for the recognition algorithms to be trained on. However, methods optimized over synthetic data usually suffer a significant performance drop when applied to real target images. This is due to the realism gap, i.e., the discrepancies between synthetic and real images (in terms of noise, clutter, etc.). In my work, three main directions were explored to bridge this gap.
First, an innovative end-to-end framework is proposed to render realistic depth images from 3D models, as a growing number of solutions (especially in the industry) are utilizing low-cost depth cameras (e.g., Microsoft Kinect and Intel RealSense) for recognition tasks. Based on a thorough study of these devices and the different types of noise impairing them, the proposed framework simulates their inner mechanisms, comprehensively modeling vital factors such as sensor noise, material reflectance, surface geometry, etc. Able to simulate a wide panel of depth sensors and to quickly generate large datasets, this framework is used to train algorithms for various recognition tasks, consistently and significantly enhancing their performance compared to other state-of-the-art simulation tools.
In some cases, however, relevant 2D or 3D object representations to generate synthetic samples are not available. Considering this different case of data scarcity, a solution is then proposed to incrementally build a representation of visual scenes from partial observations. Provided observations are localized from one to another based on their content and registered in a global memory with spatial properties. Simultaneously, this memory can be queried to render novel views of the scene. Furthermore, unobserved regions can be hallucinated in memory, in consistence with previous observations, hallucinations, and global priors. The efficacy of the proposed mnemonic and generative system, trainable end-to-end, is demonstrated on various 2D and 3D use-cases.
Finally, an advanced convolutional neural network pipeline is introduced, tackling the realism gap from a novel angle. While most methods addressing this problem focus on bringing synthetic samples—or the knowledge acquired from them—closer to the real target domain, the proposed solution performs the opposite process, mapping unseen target images into controlled synthetic domains. The pre-processed samples can then be handed to downstream recognition methods, themselves purely trained on similar synthetic data, to greatly improve their accuracy.
For each approach, a variety of qualitative and quantitative studies are detailed, providing successful comparisons to state-of-the-art methods. By proposing solutions to bridge the realism gap from either side, as well as a pipeline to improve the acquisition and generation of new visual content, this thesis provides a unique perspective on the challenges of data scarcity when building robust recognition systems.
A plethora of resources made available via retrieval systems in digital libraries remains untapped in the so called long tail of the Web. These long-tail websites get considerably less visits than major Web hubs.
Zero-effort queries ease the discovery of long-tail resources by proactively retrieving and presenting information based on a user’s context. However, zero-effort queries over existing digital library structures are challenging, since the underlying retrieval system is only accessible via an API. The information need must be expressed by a query, instead of optimizing the ranking between context and resources in the retrieval system directly. We address three research questions that arise from replacing the user information seeking process by zero-effort queries.
Our first question addresses the transformation of a user query to an automatic query, derived from the context. We present means to 1) identify the relevant context on different levels of granularity, 2) derive an information need from the context via keyword extraction and personalization and 3) express this information need in a query scheme that avoids over- or under-specified queries. We address the cold start problem with an approach to bootstrap user profiles from social media, even for passive users.
With the second question, we address the presentation of resources in zero-effort query scenarios, presenting guidelines for presentation interfaces in the browser and a visualization of the triadic relationship between context, query and results. QueryCrumbs, a compact query history visualization supports recalling information found in the past and exploratory search by visualizing qualitative and quantitative query similarity.
Our last question addresses the gap between (simple) keyword queries and the representation of resources by rich and complex meta-data. We investigate and extend feature representation learning techniques centered around the skip-gram model with negative sampling. Finally, we present an approach to learn representations from network and text jointly that can cope with the partial absence of one modality.
Experimental results show close to human performance of our zero-effort query and user profile generation approach and visualizations to be helpful in terms of transparency, efficiency and support for exploratory search. These results indicate that the proposed zero-effort query approach indeed eases the discovery of long-tail resources and the accompanying visualizations further facilitate this process. The joint representation model provides a first step to bridge the gap between query and resource representation and we plan to follow and investigate this route further in the future.
Whenever software faults can endanger human life, property, or the environment, the absence of faults must be ensured with utmost care and the best technologies available. Evidence is needed showing that all requirements are satisfied and that the risk of faults is reduced. One technique to conduct such a verification task—composed of the software to verify, the specification to check, and a model of the environment—is software model checking.
To conduct a verification task with a model checker, different models of the task are constructed. We distinguish between two types of task models: syntactic task models and semantic task models, which define the respective syntactic structure (control flow) and semantic structure (state transitions, invariants) of the verification task. When constructing such models, we can observe that similar structures and substructures reappear within and among different verification tasks. For example, the same assertions to check can appear in different functions, or the same predicate can be part of different invariants to describe sets of program states. Similarities that appear during the model construction process can be the result of solving similar reasoning problems, often solved using computationally expensive procedures (as typical for model checking), over and over again. Not reusing results of solving similar problems, not having a means for conducting repeated efforts automatically, or not trying to reduce the number of similar reasoning efforts, is a waste of precious resources.
To address these problems, we present a common conceptual and technical foundation for sharing syntactic and semantic task artifacts for reuse, within and among verification runs. Both the syntactic construction of a verification task and the construction of its semantic model—which describes all possible behaviors and states—are covered. We study how commonalities and regularities in the task models can be taken into account to facilitate the process of sharing task artifacts for reuse, and to make the overall verification process more efficient and effective. We introduce abstract transducers as the theoretical foundation of this thesis: a type of finite-state transducers with an inherent notion of abstraction for states, the input alphabet, and its output alphabet. Abstracting these transducers allows us to widen both the set of input words for that they produce output and the sets of output words. Abstract transducers are instantiated as task artifact transducers to map from program structures to task artifacts to share. We show that the notion of abstraction provides a means for increasing the scope for that task artifacts are shared for reuse. We present two instances of task artifact transducers: Yarn transducers and precision transducers. We use Yarn transducers for providing code to weave into the control-flow structure of a computer program, and present the Loom analysis as a means for orchestrating the weaving process. Precision transducers provide a means for sharing abstraction precisions for reuse, thus aid in defining the level of abstraction of a semantic task model. For both types of transducers, we provide empirical evidence on their practical applicability, for example, to verify Linux kernel modules, and show that they can help in increasing the verification performance.