TY - THES A1 - Kuhn, Esther T1 - Zur Dogmatik der Zahlungsverbote N2 - Zielsetzung der vorliegenden Arbeit war es, die Dogmatik der Zahlungsverbote endgültig herauszuarbeiten. Spätestens seit Inkrafttreten des § 15b InsO durch das SanInsFOG kann nicht mehr geleugnet werden, dass es sich bei der Haftung für einen Verstoß gegen das Zahlungsverbot im Rahmen der Insolvenzverschleppungshaftung um eine schadensrechtliche Anspruchsgrundlage handeln muss. Y1 - 2024 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:bvb:739-opus4-14159 ER - TY - THES A1 - Lachat, Paul T1 - Detecting Inference Attacks Involving Sensor Data N2 - The collection of personal information by organizations has become increasingly essential for social interactions. Nevertheless, according to the GDPR (General Data Protection Regulation), the organizations have to protect collected data. Access Control (AC) mechanisms are traditionally used to secure information systems against unauthorized access to sensitive data. The increased availability of personal sensor data, thanks to IoT-oriented applications, motivates new services to offer insights about individuals. Consequently, data mining algorithms have been proposed to infer personal insights from collected sensor data. Although they can be used for genuine purposes, attackers can leverage those outcomes, combining them with other type of data, and further breaching individuals’ privacy. Thus, bypassing AC mechanisms thanks to such insights is a concrete problem. We propose an inference detection system based on the analysis of queries issued on a sensor database. The knowledge obtained through these queries, and the inference channels corresponding to the use of data mining algorithms on sensor data to infer individual information, are described using Raw sensor data based Inference ChannEl Model (RICE-M). The detection is carried out by RICE-M based inference detection System (RICE-Sy). RICE-Sy considers at the time of the query, the knowledge that a user obtains via a new query and has obtained via his query history, and determines whether this is sufficient to allow that user to operate a channel. Thus, privacy protection systems can take advantage of the inferences detected by RICE-Sy, taking into account individuals’ information obtained by the attackers via a database of sensors, to further protect these individuals. Y1 - 2024 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:bvb:739-opus4-14149 ER - TY - THES A1 - Le, Mirjam T1 - The Peri-urban City: Cargo Cult Urbanism, Porosity and an Emerging Urban Citizenship in Vietnamese Secondary Cities N2 - The impact of urban development on local residents in the urban periphery oscillates between processes of empowerment and processes of marginalization as well as between state-controlled order and decentralized self-organization. Consequently local authorities, including urban planners and local residents need to negotiate their respective roles in the production and usage of urban space defined by transition, transformation and ambiguity. Therefore, this work examines the underlying patterns, interactions and structures which define the negotiation of state-society relations in the framework of a porous peri-urban landscape in Vietnam’s secondary cities. In Chapter 1, peri-urban areas are defined as space of transformation where pattern of rural land use are intertwined with pattern of urban land use to create an urban-rural interface with blurred boundaries. The main characteristic of the spatial pattern in Tam Kỳ and Buôn Ma Thuột is rooted urban porosity leading to the spatial intertwining of rural, peri-urban and urban spaces. The emerging urban landscape can be defined as peri-urban city. Three main themes define this peri-urban city beyond porosity: (1) processes of transformation creating the peri-urban city, (2) networks of power and control as means to adapt to these transformations and (3) mobility as prerequisite for ability to benefit from the changing landscape in peri-urban cities. Chapter 2 describes how state authorities, urban planners and private investors at the local level in Tam Kỳ and Buôn Ma Thuột use porous space to reproduce the city based on their aspirations. This leads to a cargo cult urbanism, where urban planning is rooted in future aspirations for the city. Plans and construction efforts reference the image of a modern urban future and produce the image of a city, which does not exists in the real urban space of Tam Kỳ and Buôn Ma Thuột. In the meantime, practices based in peri-urban space are often contradictory to the official aspirations of local state authorities Chapter 3 explores this emerging divergence between the aspired urban space by the state and the reality of urban space rooted in material and social porosity. Traditional, newly accessible and environmental porosity provide an array of accessible space which transforms the peri-urban city into a social arena of encounters and interaction. Consequently, porosity enables local residents to maintain urban space as commons. This counters the push towards the privatization of urban space by state and private actors and creates multiple aspirations for the urban future. Rooted in urban space as commons, porosity enables the usage of peri-urban space as spaces of resistance as discussed in Chapter 4. Mobility and interaction are means of reproduction in the porous ambiguity of urban materiality but also become means of everyday resistance. The emerging spatialities of emancipation provide opportunities for an emerging urban citizenship. Urban materiality and urban citizenship have a mutually constitutive relationship. KW - peri-urbanization KW - Vietnam KW - urban citizenship KW - urban porosity KW - cargo-cult urbanism Y1 - 2024 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:bvb:739-opus4-14097 ER - TY - THES A1 - Bermeitinger, Bernhard T1 - Investigating a Second-Order Optimization Strategy for Neural Networks N2 - In summary, this cumulative dissertation investigates the application of the conjugate gradient method CG for the optimization of artificial neural networks (NNs) and compares this method with common first-order optimization methods, especially the stochastic gradient descent (SGD). The presented research results show that CG can effectively optimize both small and very large networks. However, the default machine precision of 32 bits can lead to problems. The best results are only achieved in 64-bits computations. The research also emphasizes the importance of the initialization of the NNs’ trainable parameters and shows that an initialization using singular value decomposition (SVD) leads to drastically lower error values. Surprisingly, shallow but wide NNs, both in Transformer and CNN architectures, often perform better than their deeper counterparts. Overall, the research results recommend a re-evaluation of the previous preference for extremely deep NNs and emphasize the potential of CG as an optimization method. N2 - Zusammenfassend untersucht die vorliegende kumulative Dissertation die Anwendung des konjugierten Gradienten (CG) zur Optimierung künstlicher neuronaler Netzwerke (NNs) und vergleicht diese Methode mit verbreiteten Optimierungsverfahren erster Ordnung, insbesondere dem Stochastischem Gradientenabstieg (SGD). Die in den Arbeiten präsentierten Forschungsergebnisse zeigen, dass CG in der Lage ist, sowohl kleinere als auch sehr große Netzwerke effektiv zu optimieren. Allerdings kann die Maschinen- genauigkeit bei 32-Bit-Berechnungen zu Problemen führen, beste Ergebnisse werden erst in 64-Bit-Fließkommazahlen erreicht. Die Forschung betont auch die Bedeutung der Initialisierung der NN-Parameter und zeigt, dass eine Initialisierung mittels Singulärwertzerlegung zu deutlich geringeren Fehlerwerten führt. Überraschenderweise erzielen flachere NNs bessere Ergebnisse als tiefe NNs mit einer vergleichbaren Anzahl an trainierbaren Parametern, unabhängig vom jeweiligen NN, das die künstlichen Daten erzeugt. Es zeigt sich auch, dass flache, breite NNs, sowohl in Transformer-, als auch in CNN-Architekturen oft besser abschneiden als ihre tieferen Gegenstücke. Insgesamt empfehlen die Forschungsergebnisse eine Neubewertung der bisherigen Präferenz für extrem tiefe NNs und betonen das Potential von CG als Optimierungsmethode. Y1 - 2024 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:bvb:739-opus4-14087 ER - TY - THES A1 - Schaich, Marie-Katrin T1 - Zulässigkeit und Grenzen der Projektbefristung Y1 - 2023 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:101:1-2023122219103461828092 SN - 978-3-428-59003-2 PB - Duncker & Humblot CY - Berlin ER - TY - THES A1 - Postel, Lea T1 - In Data We Trust: Three Essays on Consumers' Trust-Based Decision-Making Strategies in Privacy-Relevant Online Contexts N2 - Technological advancements and new legal requirements are continuously changing the online data disclosure landscape in terms of both, the quantity and quality of data that firms can acquire. Nowadays, consumers are required to disclose personal data online multiple times a day and in a variety of different contexts, such as creating user profiles, online payment or using location-based services. Despite consumers’ increasing online privacy concerns, firms rely ever more strongly on consumer data that they convert into a competitive advantage through personalized product recommendations and targeted advertising. In an effort to encourage consumer data disclosure, many firms have focused on building trust as a way to counterbalance privacy concerns and mitigate risk perceptions. Correspondingly, marketing literature has continued to examine the interplay of trust and consumer privacy concerns. While the extant research has considerably advanced our understanding of the role of trust in privacy-related decision-making, the majority of studies has mainly focused on single-stage, dyadic disclosure settings and cognitive decision-making processes. Against this background, the overarching goal of this thesis is to shed light on under-researched data disclosure contexts involving trust and to explore additional facets of the underlying decision-making processes. For example, considering pre- and post-disclosure stages when evaluating consumers’ data disclosure decisions allows for a more holistic picture of the decision-making process. Similarly, social media and sharing economy settings challenge the traditional assumption of purely dyadic consumer-firm data disclosure, thus extending traditional conceptualizations of trust. Across three independent essays, this thesis addresses the overarching research question of how the peculiarities of multi-stage and multi-actor settings shape consumers’ trust-based decision-making strategies. Y1 - 2024 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:bvb:739-opus4-14021 ER - TY - THES A1 - Duffourc, Mindy T1 - Liability for Negligent Healthcare Clinical Risk Management in the United States and Germany N2 - Systems-focused error prevention efforts are internationally recognized in the healthcare industry, and industry efforts to identify and correct organizational defects through the process of CRM are well established in the U.S. and Germany. However, in both countries, there is no clear corresponding liability for healthcare organizations who fail to engage in systems-based learning through the process of clinical risk management (CRM). Although both jurisdictions do recognize organization-based theories of liability, liability for negligent CRM has not been explicitly recognized by courts in either jurisdiction to date. German legal scholars, recognizing this gap in liability for healthcare organizations, have written in support of finding liability for negligent CRM under existing tort law; however, there is no corresponding discussion in the American legal literature. This dissertation fills that gap with a comparative analysis of medical negligence law in the U.S. and Germany through the international lens of modern medical error prevention science and policy to articulate a legal basis and sketch the evidentiary framework for tort liability based on negligent CRM. KW - law KW - law and medicine KW - medical liability KW - medical negligence KW - medical errors Y1 - 2024 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:bvb:739-opus4-13859 ER - TY - THES A1 - Fink, Simon Dominik T1 - Constrained Planarity Algorithms in Theory and Practice N2 - In the constrained planarity setting, we ask whether a graph admits a crossing-free drawing that additionally satisfies a given set of constraints. These constraints are often derived from very natural problems; prominent examples are Level Planarity, where vertices have to lie on given horizontal lines indicating a hierarchy, Partially Embedded Planarity, where we extend a given drawing without modifying already-drawn parts, and Clustered Planarity, where we additionally draw the boundaries of clusters which recursively group the vertices in a crossing-free manner. In the last years, the family of constrained planarity problems received a lot of attention in the field of graph drawing. Efficient algorithms were discovered for many of them, while a few others turned out to be NP-complete. In contrast to the extensive theoretical considerations and the direct motivation by applications, only very few of the found algorithms have been implemented and evaluated in practice. The goal of this thesis is to advance the research on both theoretical as well as practical aspects of constrained planarity. On the theoretical side, we consider two types of constrained planarity problems. The first type are problems that individually constrain the rotations of vertices, that is they restrict the counter-clockwise cyclic orders of the edges incident to vertices. We give a simple linear-time algorithm for the problem Partially Embedded Planarity, which also generalizes to further constrained planarity variants of this type. The second type of constrained planarity problem concerns more involved planarity variants that come down to the question whether there are embeddings of one or multiple graphs such that the rotations of certain vertices are in sync in a certain way. Clustered Planarity and a variant of the Simultaneous Embedding with Fixed Edges Problem (Connected SEFE-2) are well-known problems of this type. Both are generalized by our Synchronized Planarity problem, for which we give a quadratic algorithm. Through reductions from various other problems, we provide a unified modelling framework for almost all known efficiently solvable constrained planarity variants that also directly provides a quadratic-time solution to all of them. For both our algorithms, a key ingredient for reaching an efficient solution is the usage of the right data structure for the problem at hand. In this case, these data structures are the SPQR-tree and the PC-tree, which describe planar embedding possibilities from a global and a local perspective, respectively. More specifically, PC-trees can be used to locally describe the possible cyclic orders of edges around vertices in all planar embeddings of a graph. This makes it a key component for our algorithms, as it allows us to test planarity while also respecting further constraints, and to communicate constraints arising from the surrounding graph structure between vertices with synchronized rotation. Bridging over to the practical side, we present the first correct implementation of PC-trees. We also describe further improvements, which allow us to outperform all implementations of alternative data structures (out of which we only found very few to be fully correct) by at least a factor of 4. We show that this yields a simple and competitive planarity test that can also yield an embedding to certify planarity. We also use our PC-tree implementation to implement our quadratic algorithm for solving Synchronized Planarity. Here, we show that our algorithm greatly outperforms previous attempts at solving related problems like Clustered Planarity in practice. We also engineer its running time and show how degrees of freedom in the theoretical algorithm can be leveraged to yield an up to tenfold speed-up in practice. KW - Constrained Planarity KW - Clustered Planarity KW - Synchronized Planarity KW - Algorithm Engineering Y1 - 2024 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:bvb:739-opus4-13817 ER - TY - THES A1 - Mußotter, Marlene T1 - On nation, homeland, and democracy: Toward a novel three-factor measurement model for nationalism and patriotism BT - revisiting the nationalism-patriotism distinction N2 - The nationalism-patriotism distinction is one of the most influential distinctions in the field of political psychology. While frequently used, the distinction suffers from a number of shortcomings that have hitherto been devoted little attention to. This dissertation aims to contribute to fill this research gap by systematically addressing these pitfalls. Notably, it does not abandon the binary distinction as such, but aims to further refine it. Thoroughly revisiting the nationalism-patriotism distinction, it synthesises the field's two predominant research traditions, i.e. the work of Kosterman and Feshbach (1989) in the U.S. and the one of Blank and Schmidt (2003) in Germany, that have not been brought into dialogue. In so doing, and engaging with research on attachment, it calls for a more nuanced triad of attachments: nationalism, that revolves around the nation; patriotism, that refers to the homeland; and democratic patriotism with democracy as its object of attachment. In line with this triad, it introduces a novel three-factor measurement model that has been validated in three studies in Germany. Overall, the dissertation underlines the need to approach ambiguous and complex concepts such as nationalism and patriotism in a more theoretically consistent way before operationalizing them in a rigorous manner. KW - Nationalismus KW - Patriotismus KW - Demokratie KW - Nation KW - Identität Y1 - 2024 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:bvb:739-opus4-13781 ER - TY - THES A1 - Zimmermann, Johanna Anita T1 - Taking the First Step on the Consumer Privacy Journey - Three Essays on Consumers' Privacy-Related Decision-Making N2 - Data has become a necessary resource for firm operations in the modern digital world, explaining their growing data gathering efforts. Due to this development, consumers are confronted with decisions to disclose personal data on a daily basis, and have become increasingly intentional about data sharing. While this reluctance to disclose personal data poses challenges for firms, at the same time, it also creates new opportunities for improving privacy-related interactions with customers. This dissertation advocates for a more holistic perspective on consumers’ privacy-related decision-making and introduces the consumer privacy journey consisting of three subsequent phases: pre data disclosure, data disclosure, post data disclosure. In three independent essays, I stress the importance of investigating data requests (i.e., the first step of this journey) as they represent a largely neglected, yet, potentially powerful means to influence consumers’ decision-making and decision-evaluation processes. Based on dual-processing models of decision-making, this dissertation focuses on both consumers’ cognitive and affective evaluations of privacy-related information: First, Essay 1 offers novel conceptualizations and operationalizations of consumers’ perceived behavioral control over personal data (i.e., cognitive processing) in the context of Artificial Intelligence (AI)-based data disclosure processes. Next, Essay 2 examines consumers’ cognitive and affective processing of a data request that entails relevance arguments as well as relevance-illustrating game elements. Finally, Essay 3 categorizes affective cues that trigger consumers’ affective processing of a data request and proposes that such cues need to fit with a specific data disclosure situation to foster long-term decision satisfaction. Collectively, my findings provide research and practice with new insights into consumers’ privacy perceptions and behaviors, which are particularly valuable in the context of complex, new (technology-enabled) data disclosure situations. KW - privacy KW - data control KW - gamification KW - dual processing KW - decision making Y1 - 2024 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:bvb:739-opus4-13761 ER -