@phdthesis{Le2015, author = {Le, Ngoc Long}, title = {Various Differents for 0-Dimensional Schemes and Applications}, url = {http://nbn-resolving.de/urn:nbn:de:bvb:739-opus4-3386}, school = {Universit{\"a}t Passau}, pages = {205}, year = {2015}, abstract = {This thesis attempts to investigate the Noether, Dedekind, and K{\"a}hler differents for a 0-dimensional scheme X in the projective n-space P^n_K over an arbitrary field K. In particular, we focus on studying the relations between the algebraic structure of these differents and geometric properties of the scheme X. In Chapter 1 we give an outline to the problems this thesis is concerned with, a brief literature review for each problem, and the main results regarding these problems. Chapter 2 contains background results that we will need in the subsequent chapters. We introduce the concept of maximal p_j-subschemes of a 0-dimensional scheme X and give some descriptions of them and their Hilbert functions. Furthermore, we generalize the notion of a separator of a subscheme of X of degree deg(X)-1 to a set of separators of a maximal p_j-subscheme of X. In Chapter 3 we explore the Noether, Dedekind, and K{\"a}hler differents for 0-dimensional schemes X. First we define these differents for X, and take a look at how to compute these differents and examine their relations. Then we give an answer to the question "What are the Hilbert functions of these differents?" in some cases. In Chapter 4 we use the differents to investigate the Cayley-Bacharach property of 0-dimensional schemes over an arbitrary field K. The principal results of this chapter are characterizations of CB-schemes and of arithmetically Gorenstein schemes in terms of their Dedekind differents and a criterion for a 0-dimensional smooth scheme to be a complete intersection. We also generalize some results such as Dedekind's formula and the characterization of the Cayley-Bacharach property by using Liaison theory. In addition, several propositions on the uniformities are proven. In Chapter 5 we are interested in studying the Noether, Dedekind, and K{\"a}hler differents for finite special classes of schemes and finding out some applications of these differents. First, we investigate these differents for reduced 0-dimensional almost complete intersections X in P^n_K over a perfect field K. Then we investigate the relationships between these differents and the i-th Fitting ideals of the module of K{\"a}hler differentials of the homogeneous coordinate ring of X. Finally, we look more closely at the Hilbert functions and the regularity indices of these differents for fat point schemes.}, subject = {Kommutativer Ring}, language = {en} } @phdthesis{Makeschin2015, author = {Makeschin, Sarah}, title = {"The Imagined Presidency": Political Communication as "Narrative" and "Performance" - A Case Study of Barack Obama's 2008 Presidential Campaign}, url = {http://nbn-resolving.de/urn:nbn:de:bvb:739-opus4-4496}, school = {Universit{\"a}t Passau}, pages = {230 S.}, year = {2015}, abstract = {Many communication scholars agree that political communication in the 21st century has permanently changed due to the enormous shifts in mass media communications landscape. Today, political culture and public debate are characterized by a highly individualistic and consumption-oriented electorate conditioned by a hypermedialized public sphere spawned by the so-called "Digital Revolution". Confronted with a fluid and volatile communications landscape, political actors of the 21st century have had to develop new strategies to fulfill their functional role in the public arena and satisfy their audiences' expectations. This has had massive impact on the communication logistics of perhaps the world's most powerful political office and the ultimate of collective meaning-making and national identity in the United States: that of the American Presidency. The perception of Barack Obama's 2008 election campaign as epitomizing such shifts in the collective meaning-making processes lies at the core of this research project. The analyzes Barack Obama's 2008 presidential election campaign with respect to its underlying communicational and performative concept(s), and its impact on the socio-ontological dimension of the office of the American Presidency in the 21st century. While storytelling and performative staging have always been crucial to the American presidential office (Cornog 2004; Woodward 2007, Weiss 2008), this research project aims to show how "telling a story" and staging it properly have become the sine qua non for American presidential political communication. This case study of Barack Obama's 2008 presidential election campaign examines the central role that imaginative processes, their narrative formation and performative staging play in 21st century political dialog. Furthermore the dissertation suggests, that these paradigmatic shifts demand a refinement of existing socio-political concepts of the institution of the American Presidency.}, subject = {Obama, Barack}, language = {en} } @misc{Barbato2015, author = {Barbato, Mariano}, title = {Posts{\"a}kulare Weltpolitik}, editor = {Barbato, Mariano and Marfeld, Sarah}, url = {http://nbn-resolving.de/urn:nbn:de:bvb:739-opus4-5564}, pages = {190 Seiten}, year = {2015}, abstract = {Der Sammelband analysiert den Einfluss von Religion in der Weltpolitik an Fallbeispielen zwischen Internationalen Beziehungen, Welt{\"o}ffentlichkeit, L{\"a}nderstudien und Europ{\"a}ischer Integration. Der posts{\"a}kulare Ansatz von J{\"u}rgen Habermas wird auf sein globales Potential an der Schnittstelle von Außen- und Innenpolitik {\"u}berpr{\"u}ft und weiterentwickelt.}, subject = {Religion}, language = {de} } @phdthesis{Stadler2015, author = {Stadler, Thomas}, title = {Eine Anwendung der Invariantentheorie auf das Korrespondenzproblem lokaler Bildmerkmale}, url = {http://nbn-resolving.de/urn:nbn:de:bvb:739-opus4-4026}, school = {Universit{\"a}t Passau}, pages = {XII, 324 S.}, year = {2015}, abstract = {Als sich in der ersten H{\"a}lfte des 19. Jahrhunderts zunehmend mehr bedeutende Mathematiker mit der Suche nach Invarianten besch{\"a}ftigten, konnte nat{\"u}rlich noch niemand vorhersehen, dass die Invariantentheorie mit Beginn des Computerzeitalters in der Bildverarbeitung bzw. dem Rechnersehen ein {\"a}ußerst fruchtbares Anwendungsgebiet finden wird. In dieser Arbeit wird eine neue Anwendungsm{\"o}glichkeit der Invariantentheorie in der Bildverarbeitung vorgestellt. Dazu werden lokale Bildmerkmale betrachtet. Dabei handelt es sich um die Koordinaten einer Polynomfunktion bzgl. einer geeigneten Orthonormalbasis von P_n(R^2,R), die die zeitintegrierte Sensorinputfunktion auf lokalen Pixelfenstern bestm{\"o}glich approximiert. Diese Bildmerkmale werden in vielen Anwendungen eingesetzt, um Objekte in Bildern zu erkennen und zu lokalisieren. Beispiele hierf{\"u}r sind die Detektion von Werkst{\"u}cken an einem Fließband oder die Verfolgung von Fahrbahnmarkierungen in Fahrerassistenzsystemen. Modellieren l{\"a}sst sich die Suche nach einem Muster in einem Suchbild als Paar von Stereobildern, auf denen lokal die affin-lineare Gruppe AGL(R) operiert. Will man also feststellen, ob zwei lokale Pixelfenster in etwa Bilder eines bestimmten dreidimensionalen Oberfl{\"a}chenausschnitts sind, ist zu kl{\"a}ren, ob die Bildausschnitte durch eine Operation der Gruppe AGL(R) n{\"a}herungsweise ineinander {\"u}bergef{\"u}hrt werden k{\"o}nnen. Je nach Anwendung gen{\"u}gt es bereits, passende Untergruppen G von AGL(R) zu betrachten. Dank der lokalen Approximation durch Polynomfunktionen induziert die Operation einer Untergruppe G eine Operation auf dem reellen Vektorraum P_n(R^2,R). Damit l{\"a}sst sich das Korrespondenzproblem auf die Frage reduzieren, ob es eine Transformation T in G gibt so, dass p ungef{\"a}hr mit der Komposition von q und T f{\"u}r die zugeh{\"o}rigen Approximationspolynome p,q in P_n(R^2,R) gilt. Mit anderen Worten, es ist zu kl{\"a}ren, ob sich p und q n{\"a}herungsweise in einer G-Bahn befinden, eine typische Fragestellung der Invariantentheorie. Da nur lokale Bildausschnitte betrachtet werden, gen{\"u}gt es weiter, Untergruppen G von GL_2(R) zu betrachten. Dann erh{\"a}lt man sofort auch die Antwort f{\"u}r das semidirekte Produkt von R^2 mit G. Besonders interessant f{\"u}r Anwendungen ist hierbei die spezielle orthogonale Gruppe G=SO_2(R) und damit insgesamt die eigentliche Euklidische Gruppe. F{\"u}r diese Gruppe und spezielle Pixelfenster ist das Korrespondenzproblem bereits gel{\"o}st. In dieser Arbeit wird das Problem in eben dieser Konstellation ebenfalls gel{\"o}st, allerdings auf elegante Weise mit Methoden der Invariantentheorie. Der Ansatz, der hier vorgestellt wird, ist aber nicht auf diese Gruppe und spezielle Pixelfenster begrenzt, sondern leicht auf weitere F{\"a}lle erweiterbar. Dazu ist insbesondere zu kl{\"a}ren, wie sich sogenannte fundamentale Invarianten von lokalen Bildmerkmalen, also letztendlich Invarianten von Polynomfunktionen, berechnen lassen, d.h. Erzeugendensysteme der entsprechenden Invariantenringe. Mit deren Hilfe l{\"a}sst sich die Zugeh{\"o}rigkeit einer Polynomfunktion zur Bahn einer anderen Funktion auf einfache Weise untersuchen. Neben der Vorstellung des Verfahrens zur Korrespondenzfindung und der daf{\"u}r notwendigen Theorie werden in dieser Arbeit Erzeugendensysteme von Invariantenringen untersucht, die besonders "sch{\"o}ne" Eigenschaften besitzen. Diese sch{\"o}nen Erzeugendensysteme von Unteralgebren werden, analog zu Gr{\"o}bner-Basen als Erzeugendensysteme von Idealen, SAGBI-Basen genannt ("Subalgebra Analogs to Gr{\"o}bner Bases for Ideals"). SAGBI-Basen werden hier insbesondere aus algorithmischer Sicht behandelt, d.h. die Berechnung von SAGBI-Basen steht im Vordergrund. Dazu werden verschiedene Algorithmen erarbeitet, deren Korrektheit bewiesen und implementiert. Daraus resultiert ein Software-Paket zu SAGBI-Basen f{\"u}r das Computeralgebrasystem ApCoCoA, dessen Funktionalit{\"a}t in diesem Umfang in keinem Computeralgebrasystem zu finden sein wird. Im Zuge der Umsetzung der einzelnen Algorithmen konnte außerdem die Theorie der SAGBI-Basen an zahlreichen Stellen erweitert werden.}, language = {de} } @phdthesis{Ehlers2015, author = {Ehlers, Christoph}, title = {Top-k Semantic Caching}, url = {http://nbn-resolving.de/urn:nbn:de:bvb:739-opus4-3055}, school = {Universit{\"a}t Passau}, pages = {266}, year = {2015}, abstract = {The subject of this thesis is the intelligent caching of top-k queries in an environment with high latency and low throughput. In such an environment, caching can be used to reduce network traffic and improve response time. Slow database connections of mobile devices and to databases, which have been offshored, are practical use cases. A semantic cache is a query-based cache that caches query results and maintains their semantic description. It reuses partial matches of previous query results. Each query that is processed by the semantic cache is split into two disjoint parts: one that can be completely answered with tuples of the cache probe query, and another that requires tuples to be transferred from the server (remainder query). Existing semantic caches do not support top-k queries, i.e., ordered and limited queries. In this thesis, we present an innovative semantic cache that naturally supports top-k queries. The support of top-k queries in a semantic cache has considerable effects on cache elements, operations on cache elements -- like creation, difference, intersection, and union -- and query answering. Hence, we introduce new techniques for cache management and query processing. They enable the semantic cache to become a true top-k semantic cache. In addition, we have developed a new algorithm that can estimate the lower bounds of query results of sorted queries using multidimensional histograms. Using this algorithm, our top-k semantic cache is able to pipeline partial query results of top-k queries. Thereby, query execution performance can be significantly increased. We have implemented a prototype of a top-k semantic cache called IQCache (Intelligent Query Cache). An extensive and thorough evaluation with various benchmarks using our prototype demonstrates the applicability and performance of top-k semantic caching in practice. The experiments prove that the top-k semantic cache invariably outperforms simple hash-based caching strategies and scales very well.}, subject = {Semantisches Caching}, language = {en} } @phdthesis{Braun2015, author = {Braun, Bastian}, title = {Web-based Secure Application Control}, url = {http://nbn-resolving.de/urn:nbn:de:bvb:739-opus4-3048}, school = {Universit{\"a}t Passau}, year = {2015}, abstract = {The world wide web today serves as a distributed application platform. Its origins, however, go back to a simple delivery network for static hypertexts. The legacy from these days can still be observed in the communication protocol used by increasingly sophisticated clients and applications. This thesis identifies the actual security requirements of modern web applications and shows that HTTP does not fit them: user and application authentication, message integrity and confidentiality, control-flow integrity, and application-to-application authorization. We explore the other protocols in the web stack and work out why they can not fill the gap. Our analysis shows that the underlying problem is the connectionless property of HTTP. However, history shows that a fresh start with web communication is far from realistic. As a consequence, we come up with approaches that contribute to meet the identified requirements. We first present impersonation attack vectors that begin before the actual user authentication, i.e. when secure web interaction and authentication seem to be unnecessary. Session fixation attacks exploit a responsibility mismatch between the web developer and the used web application framework. We describe and compare three countermeasures on different implementation levels: on the source code level, on the framework level, and on the network level as a reverse proxy. Then, we explain how the authentication credentials that are transmitted for the user login, i.e. the password, and for session tracking, i.e. the session cookie, can be complemented by browser-stored and user-based secrets respectively. This way, an attacker can not hijack user accounts only by phishing the user's password because an additional browser-based secret is required for login. Also, the class of well-known session hijacking attacks is mitigated because a secret only known by the user must be provided in order to perform critical actions. In the next step, we explore alternative approaches to static authentication credentials. Our approach implements a trusted UI and a mutually authenticated session using signatures as a means to authenticate requests. This way, it establishes a trusted path between the user and the web application without exchanging reusable authentication credentials. As a downside, this approach requires support on the client side and on the server side in order to provide maximum protection. Another approach avoids client-side support but can not implement a trusted UI and is thus susceptible to phishing and clickjacking attacks. Our approaches described so far increase the security level of all web communication at all time. This is why we investigate adaptive security policies that fit the actual risk instead of permanently restricting all kinds of communication including non-critical requests. We develop a smart browser extension that detects when the user is authenticated on a website meaning that she can be impersonated because all requests carry her identity proof. Uncritical communication, however, is released from restrictions to enable all intended web features. Finally, we focus on attacks targeting a web application's control-flow integrity. We explain them thoroughly, check whether current web application frameworks provide means for protection, and implement two approaches to protect web applications: The first approach is an extension for a web application framework and provides protection based on its configuration by checking all requests for policy conformity. The second approach generates its own policies ad hoc based on the observed web traffic and assuming that regular users only click on links and buttons and fill forms but do not craft requests to protected resources.}, subject = {Computersicherheit}, language = {en} } @phdthesis{Tran2015, author = {Tran, Nguyen Khanh Linh}, title = {Kaehler Differential Algebras for 0-Dimensional Schemes and Applications}, url = {http://nbn-resolving.de/urn:nbn:de:bvb:739-opus4-3290}, school = {Universit{\"a}t Passau}, pages = {158}, year = {2015}, abstract = {The aim of this dissertation is to investigate Kaehler differential algebras and their Hilbert functions for 0-dimensional schemes in P^n. First we give relations between Kaehler differential 1-forms of fat point schemes and another fat point schemes. Then we determine the Hilbert polynomial and give a sharp bound for the regularity index of the module of Kaehler differential m-forms, for 0