@phdthesis{Ertel2026, author = {Ertel, Florence Laura Louise}, title = {Europapolitische Themen in Wahlk{\"a}mpfen: Chancen und Herausforderungen der Anwendung von Blended Reading-Verfahren f{\"u}r die Europ{\"a}ische Integrationsforschung}, url = {http://nbn-resolving.de/urn:nbn:de:bvb:739-opus4-20504}, school = {Universit{\"a}t Passau}, pages = {71 Seiten, 132 unterschiedlich gez{\"a}hlte Seiten, XXIII Seiten}, year = {2026}, abstract = {Durch fortschreitende Digitalisierung w{\"a}chst die Verf{\"u}gbarkeit digitaler Textdaten europapolitischer Diskurse. Gleichzeitig werden algorithmusbasierte Verfahren zur Analyse dieser großen Menge an Textdaten stetig weiterentwickelt. F{\"u}r die europ{\"a}ische Integrationsforschung bietet die Vielfalt der Kommunikationsarten und -formen die M{\"o}glichkeit, gesellschaftliche, mediale und politische Diskurse zur europ{\"a}ischen Integration auf den verschiedensten Ebenen nachzuvollziehen. Chancen birgt dies insbesondere aus der integrationstheoretischen Perspektive des Postfunktionalismus. Dieser Ansatz r{\"u}ckt die vermehrte Politisierung der europ{\"a}ischen Integration in den Mittelpunkt. Denn mit der zunehmenden Vertiefung der europ{\"a}ischen Integration w{\"a}chst zugleich der europ{\"a}ische Einfluss auf nationale Policies und wirkt sich immer unmittelbarer auf das Leben der Europ{\"a}er:innen aus. Dies f{\"u}hrt zu verst{\"a}rkter Polarisierung und Mobilisierung innerhalb der Gesellschaft und spiegelt sich in einer wachsenden Spaltung zwischen proeurop{\"a}ischen und antieurop{\"a}ischen politischen Lagern wider. So werden Einstellung zur EU zu einer wichtigen strukturellen Spaltungslinie zwischen Parteien. Folgt man der GAL/TAN-These von Hooghe und Marks (2009), k{\"o}nnen Parteien in gr{\"u}ne, alternative, libert{\"a}re und grunds{\"a}tzlich proeurop{\"a}ische sowie traditionalistische, autorit{\"a}re, nationalistische und eher euroskeptische Parteien unterteilt werden. Letztere nutzen insbesondere digitale Kommunikationsr{\"a}ume verst{\"a}rkt und effektiv. Dies unterstreicht die Notwendigkeit, Datengrundlagen f{\"u}r Analysen auf den digitalen Raum auszuweiten und zu archivieren, um den Diskurs in seiner Breite erfassen zu k{\"o}nnen. Mit der Menge an digital verf{\"u}gbaren Textdaten w{\"a}chst allerdings auch die Un{\"u}bersichtlichkeit. Dies f{\"u}hrt zu methodischen Herausforderungen in Bezug auf die Art der Daten, die Datensammlung und -speicherung sowie die Datenvorverarbeitung und -analyse. Angesichts großer Textdatenmengen stoßen in der europ{\"a}ischen Integrationsforschung {\"u}bliche qualitative Analyseverfahren an ihre Grenzen. Quantitative Analyseverfahren ver{\"a}ndern das Verh{\"a}ltnis von Textdatenmaterial und Forscher:in. Die wissenschaftliche Debatte setzt sich mit der Frage auseinander, wie sich Analysen angesichts der wachsenden Textdatenmengen gestaltet und steuern lassen, damit das Verh{\"a}ltnis von Textdatenmaterial und Forscher:in nicht durch Algorithmen, die einen Black-Box-Effekt in der Datenanalyse erzeugen k{\"o}nnen, verzerrt wird. Daraus ergibt sich die Notwendigkeit einer Verbindung von quantitativen und qualitativen Analysenmethoden auf epistemologischer und methodologischer Ebene, um reliable und valide Forschungsergebnisse zu gew{\"a}hrleisten. Dies impliziert die {\"U}berwindung der so h{\"a}ufig diskutierten Gegens{\"a}tze von qualitativen und quantitative Analysen, datengeleiteten und theoriegeleiteten Analysen oder Close und Distant Reading. Allerdings existiert in der Politikwissenschaft bislang kein Best Practice-Workflow f{\"u}r die Analyse großer Textdatenmengen webbasierter Daten, mit dem intersubjektive Nachvollziehbarkeit und Reliabilit{\"a}t im Forschungsprozess gew{\"a}hrleistet werden k{\"o}nnen. An diese Forschungsl{\"u}cke kn{\"u}pft die kumulative Dissertation an. In sechs aufeinander aufbauenden Publikationen in deutscher, englischer und franz{\"o}sischer Sprache wird ein Best Practice-Workflow f{\"u}r Blended Reading entwickelt. Dieser Ansatz verbindet die Vorteile von quantitativer und qualitativer Forschung. Der starke methodische Schwerpunkt wird durch Fallstudien zu europ{\"a}ischen und nationalen Wahlk{\"a}mpfen in Deutschland, Frankreich und {\"O}sterreich kontextualisiert. Daf{\"u}r wird die Rolle europapolitischer Themen in der Wahlkampfkommunikation der vergangenen zwei Jahrzehnte aus postfunktionalistischer Perspektive analysiert.}, language = {mul} } @phdthesis{Wirth2026, author = {Wirth, Olivia}, title = {Digital Platforms and Mobile Technologies for Development: Essays on Firm Formalization, Financial Inclusion, and Agricultural Resilience in Sub-Saharan Africa}, url = {http://nbn-resolving.de/urn:nbn:de:bvb:739-opus4-20049}, school = {Universit{\"a}t Passau}, pages = {xi, xv, 156 Seiten}, year = {2026}, abstract = {Mobile technologies and digital platforms have expanded rapidly across sub-Saharan Africa, creating opportunities to strengthen state capacity, broaden financial inclusion, and build agricultural resilience. This dissertation examines their development impacts across three settings. Chapter 1 combines novel administrative tax records with high resolution data on mobile network rollout in Uganda to estimate the effects of mobile internet access on firm tax behavior and public revenue. Exploiting plausibly exogenous rollout timing, we find that improved access increases firm formalization and expands the tax base, strengthening revenue collection. Chapter 2 presents a randomized controlled trial in Niger—the world's most financially excluded country—to identify barriers to adoption of a mobile money platform. Information provision raises awareness but not use, consistent with information being necessary but insufficient for diffusion. By contrast, a modest financial incentive significantly increases both adoption and usage. Chapter 3 uses a household panel collected before and after a severe drought in northern Ghana and exploits variation in rainfall in a differences-in-differences framework to estimate effects on production, income sources and adaptation plans. We find that increasing drought severity lowers soybean yields and revenues and decreases reliance on own-business income and remittances, reflecting broader livelihood impacts. Farmers who use mobile phones to access agricultural information make different input choices and adaptation plans. Taken together, these findings highlight the promise of mobile technologies and digital platforms for development. Their effectiveness, however, depends on complementary infrastructure and local capacity, underscoring the need for scalable, context-specific strategies to harness these tools for inclusive growth and resilience.}, language = {en} } @phdthesis{Khosravi2026, author = {Khosravi, Mohammad}, title = {Hard Instances, Improved Algorithms and New Interdiction Models for Robust Optimization}, url = {http://nbn-resolving.de/urn:nbn:de:bvb:739-opus4-20399}, school = {Universit{\"a}t Passau}, pages = {vii, 197 Seiten}, year = {2026}, abstract = {Robust combinatorial optimization seeks solutions that remain effective across all possible realizations of an uncertainty set, making the choice of this set a crucial factor in both the complexity and practical applicability of robust models. A key challenge in this field is striking a balance between computational tractability and solution quality, particularly when dealing with large uncertainty sets. This dissertation advances the field of robust optimization by addressing three central themes: (i) methods for generating hard instances and establishing a benchmark library, (ii) high-quality exact solution methods and approximation algorithms, and (iii) the modeling of uncertainty sets and their impact on problem complexity. The absence of a benchmark library for robust optimization problems makes it difficult to conduct fair and effective comparisons of different solution methods. As a result, researchers often rely on randomly generated instances, which may hinder meaningful evaluations. To address this issue, this work develops optimization-based and heuristic methods for generating challenging instances of robust problems. Additionally, to facilitate more consistent and insightful comparisons of solution algorithms with minimal effort, we introduce a standardized benchmark library for use by the research community. To tackle the computational challenges posed by large uncertainty sets, this dissertation proposes scenario reduction techniques specifically designed for robust optimization. These methods aim to reduce the size of the uncertainty set while preserving the objective value as accurately as possible. Unlike traditional clustering approaches, this formulation treats scenario reduction as an optimization problem independent of the underlying decision-making model, enabling structured reductions with theoretical performance guarantees. Experimental results demonstrate that this approach produces solutions of comparable or superior quality compared to those obtained through general-purpose clustering techniques. Building on this framework, we further refine scenario reduction by incorporating information about the structure of feasible solutions. While previous reduction methods focused exclusively on the uncertainty set, we show that integrating knowledge of feasible solutions leads to improved uncertainty sets and more accurate robust models. Through a combination of theoretical analysis and computational experiments, we establish the effectiveness of this approach in enhancing both tractability and solution quality in robust combinatorial optimization. Finally, we introduce a novel variant of discrete budgeted uncertainty for cardinality-based constraints or objectives, incorporating a weight vector into the budget constraint. Our theoretical analysis reveals that while the adversarial problem can be solved in linear time, the robust problem becomes NP-hard and non-approximable. Nonetheless, we propose and evaluate alternative modeling approaches that demonstrate promising scalability in practice. This dissertation contributes to robust optimization by offering new perspectives on uncertainty modeling, algorithmic techniques for scenario reduction, and complexity analyses of key robust problems. The proposed methods provide both theoretical guarantees and practical advancements, paving the way for more efficient and scalable robust optimization models.}, language = {en} } @misc{BauerRoesslerKasperetal.2025, author = {Bauer, Matthias and R{\"o}ssler, Reto and Kasper, Nils and Ernst, Christoph}, title = {Diagrammatische Praktiken}, volume = {2025}, number = {14}, editor = {Bauer, Matthias and R{\"o}ssler, Reto and Nies, Martin}, url = {http://nbn-resolving.de/urn:nbn:de:bvb:739-opus4-20417}, pages = {134}, year = {2025}, abstract = {Indem die Aufs{\"a}tze von Nils Kasper, Christoph Ernst, Reto R{\"o}ssler und Matthias Bauer sowohl wissens- und kulturgeschichtliche als auch medien- und verfahrenstechnische Fragestellungen behandeln, zeigen sie in ihrer Komplementarit{\"a}t das Spektrum an Denk- und Handlungsm{\"o}glichkeiten auf, das Diagramme bzw. diagrammatische Praktiken er{\"o}ffnen.}, language = {de} } @misc{Weithmann2025, author = {Weithmann, Michael}, title = {Passau und das Nibelungenlied}, series = {Altbayerische Heimatpost : Leben und Erleben in Bayern 27/2025}, volume = {2025}, journal = {Altbayerische Heimatpost : Leben und Erleben in Bayern 27/2025}, number = {27}, publisher = {Passauer Neue Presse}, address = {Passau}, url = {http://nbn-resolving.de/urn:nbn:de:bvb:739-opus4-20349}, pages = {10 -- 12}, year = {2025}, abstract = {The Nibelungenlied is an epic poem written around 1200 in Middle High German. Its anonymous poet was likely from the region of Passau. The current theory of the creation of the poem emphasizes the poet's concentration on the region of Passau: for example, the poem highlights the relatively unimportant figure of Bishop Pilgrim of Passau, and the poet's geographical knowledge appears much more firm in this region than elsewhere. These facts, combined with the dating, have led scholars to believe that Wolfger von Erla, Bishop of Passau (reigned 1191-1204) was the patron of the poem.}, subject = {Nibelungenlied}, language = {de} } @misc{HarendarskiBrieseHallmannetal.2024, author = {Harendarski, Ulf and Briese, Joschka and Hallmann, Tiziana and Dettmann, Luc and Kitzerow, Tom}, title = {Kraft und Signifikanz}, volume = {2024}, number = {13}, editor = {Harendarski, Ulf and Briese, Joschka}, doi = {10.15475/skms.2024.1}, url = {http://nbn-resolving.de/urn:nbn:de:bvb:739-opus4-20388}, pages = {162 Seiten}, year = {2024}, abstract = {Zuerst erschienen auf: https://www.kultursemiotik.com/forschung/publikationen/schriftenreihe-online/ Inhalt Vorwort Kraft und Signifikanz. Kultursemiotische Betrachtungen allt{\"a}glicher Darstellungen in der sprachbasierten Semiose Ulf Harendarski und Joschka Briese Signifikanz der Melancholie Zur diskursiven Konstitution Leonard Cohens Tiziana Hallmann Von gefallenen Helden Mythologische Umschriften und ihre semiotisierende Kraft Luc Dettmann Sprachliche Konstitutionen von Drittpersonalit{\"a}t Eine semantisch/pragmatische Analyse von distanzmarkierenden Verben in drittpersonalen Aussagen {\"o}ffentlicher Texte Tom Kitzerow Spuren diskursiver Interpretationsprozesse F{\"u}r ein elaboriertes Konzept von Signifikanz Joschka Briese Impressum}, language = {de} } @phdthesis{Rolvering2026, author = {Rolvering, Geske}, title = {Empirical Essays in Public Economics}, url = {http://nbn-resolving.de/urn:nbn:de:bvb:739-opus4-20186}, school = {Universit{\"a}t Passau}, pages = {x, 159 Seiten}, year = {2026}, abstract = {This dissertation exploits quasi-experimental methods and rich microdata to identify causal effects of public interventions that speak directly to the goals outlined in the 2030 Agenda for Sustainable Development. Specifically, the first chapter analyzes the effect of public child care provision on mothers' career trajectories, focusing on the timing of labor market re-entry and the quality of occupational outcomes. It thereby contributes to the Sustainable Development Goals of "Gender Equality", "Reducing Inequalities", and "Decent Work and Economic Growth". The second chapter investigates the impact of all-day school programs on juvenile property, violent, and drug-related crime. By providing evidence on how school schedules can be structured to promote safe learning environments, it contributes in particular to the goal of "Quality Education". In addition, it also contributes to broader objectives related to "Good Health and Well-Being" as well as "Peace, Justice and Strong Institutions". The third chapter examines public attitudes toward climate change and carbon pricing in Germany and analyzes whether different types of information shift people's policy views. By exploring measures to reduce resistance to effective but politically unpopular environmental policies, this chapter contributes to the goal of "Climate Action".}, language = {en} } @misc{LukasBrehmDurdeletal.2023, author = {Lukas, Wolfang and Brehm, David and Durdel, Patrick and Papart, S{\"o}nke and Kreuter, Sara and Weinbach, Donata and Pfeifer, Lena and Assadsolimani, Jasmin and Wagner, Alexander}, title = {Zeichen des Fremden}, volume = {2023}, number = {9}, editor = {Lukas, Wolfgang and Nies, Martin}, doi = {10.15475/skms.2023.3}, url = {http://nbn-resolving.de/urn:nbn:de:101:1-2023081602100461706063}, pages = {189 Seiten}, year = {2023}, abstract = {Zuerst erschienen auf: https://www.kultursemiotik.com/forschung/publikationen/schriftenreihe-online/ Inhalt Zeichen des Fremden Einleitung Wolfgang Lukas / Martin Nies Wessen Rettung? Gefl{\"u}chtete Figuren, Sinnproduktion und implizite Poetik in Jenny Erpenbecks 'Gehen, ging, gegangen' und Bodo Kirchhoffs 'Widerfahrnis' David Brehm Der falsche Fremde Auto- und metafiktionale Reflexionen von Identit{\"a}t und Ethnizit{\"a}t in Abbas Khiders 'Der falsche Inder' S{\"o}nke Parpart „Ich habe kein Bild mehr von mir" (De-)Konstruktion von Identit{\"a}t und Fremdheit in Jenny Erpenbecks 'Gehen, ging, gegangen' (2015) und Olga Grjasnowas 'Gott ist nicht sch{\"u}chtern' (2018) Sara Kreuter Verfinsterungen des Eigenen Konstruktionen des Anderen in Wolfram Lotz' 'Die l{\"a}cherliche Finsternis' Patrick Durdel Die vertraute Fremdheit der Anthropophagie Franzobels 'Floß der Medusa' (2017) Donata Weinbach Intimate Weavings Tracing Urban and Corporeal Others in Sin{\´e}ad Morrissey's Poetry Lena Pfeifer Make America en vogue again Die Konstruktion einer nationalen Identit{\"a}t in der US-amerikanischen Vogue nach dem Trump-Wahlsieg Jasmin Assadsolimani Schweiz / Haiti / NEW WORLD PLAZA Individualgeschichte und Universalgeschichte in Dorothee Elmigers 'Aus der Zuckerfabrik' Alexander Wagner}, subject = {Einwanderung }, language = {mul} } @phdthesis{Hosseini2026, author = {Hosseini, Amir}, title = {Integrated Scheduling and Material Handling: Theory and Applications in Manufacturing Systems}, url = {http://nbn-resolving.de/urn:nbn:de:bvb:739-opus4-20249}, school = {Universit{\"a}t Passau}, pages = {xv, 127 Seiten}, year = {2026}, abstract = {Scheduling concerns the allocation of limited resources to competing tasks over time and is central to manufacturing systems. In practice, production scheduling is tightly linked to material handling, as jobs must be transported between machines, buffers, and storage locations. However, transportation decisions have often been simplified or decoupled from classical scheduling models. This dissertation investigates the problem of Integrated Scheduling and Material Handling (ISMH), where processing and transportation decisions are jointly optimized to improve overall system performance. The thesis develops this objective in three steps. First, it provides a structured and unified classification of scheduling problems with transportation elements, organizing a fragmented body of literature and clarifying methodological foundations. Second, it studies scheduling in AGV-based material handling systems under battery constraints, proposing a novel mixed-integer programming formulation and an exact solution approach based on logic-based Benders decomposition. Third, it extends integrated models to a buffer-constrained flow shop setting with mobile buffering, introducing a decomposition-based algorithm that significantly improves scalability. Together, these contributions advance conceptual understanding, modeling frameworks, and exact solution methods for integrated production and internal logistics planning in modern manufacturing systems.}, language = {en} } @unpublished{Wehner2026, author = {Wehner, Stefanie}, title = {Regional and gendered aspects of migration: Data-exploration from a multi-local field survey in Ghana (Northern, Eastern and Greater Accra Region)}, doi = {10.15475/mitrawa.upa7}, url = {http://nbn-resolving.de/urn:nbn:de:bvb:739-opus4-20299}, pages = {25 Seiten}, year = {2026}, abstract = {This study assesses the perception of migrants and migrant households on drivers and structures of translocal mobility and their consequences for livelihoods in Ghana. A bi-local survey was conducted to collect data on households and migrants in the area of origin (AoO) and individuals in the area of destination (AoD). The survey at the AoO was conducted in two research areas (Gushiegu Municipal District in the Northern Region and Fanteakwa District in the Eastern Region). Thesample then covered 75\% migrant households and 25\% non-migrant households, both randomly selected. The collected data provides information on almost 1,000 migrants and 2,000 non-migrants. Since Greater Accra Region was identified as one major destination, this region was selected as an Area of Destination. In Accra, 50 migrants from Eastern and Northern Region each were randomly selected from the previous survey database. The perception of migrant households and migrants themselves on migration was assessed using descriptive statistics. Over 95\% said migration is essential to secure their livelihood and that migration improves the standard of living of the households. The study elucidates the challenges encountered by rural households in agriculture and the strategies implemented to address these issues. The predominant challenges confronting farmers include the escalating costs of agricultural inputs, the prevalence of pests and diseases, and fluctuations in environmental conditions. Moreover, the research highlights robust translocal networks that extend beyond mere financial remittances, encompassing an intangible web of communication, emotions, and aspirations. By traversing spatial and gender dimensions, the study unveils the extensive diversity of migration aspects, demonstrating that migration exerts markedly different impacts on women compared to men and has varying implications for households in the Northern Region versus the Eastern Region. It is evident that female migrants from Northern Ghana constitute the most vulnerable group, grappling with severe food insecurity. In contrast, translocal networks in the Eastern Region facilitate families in leveraging remittances for diversification of their economic base, thereby enhancing their capacity for future development, while those in the Northern region are essential for addressing the existential needs of families.}, language = {en} } @phdthesis{Ryzhova2026, author = {Ryzhova, Anna}, title = {The Transnational News Diets of Russian Speakers in Germany: what news they use and trust}, url = {http://nbn-resolving.de/urn:nbn:de:bvb:739-opus4-19867}, school = {Universit{\"a}t Passau}, pages = {187 Seiten}, year = {2026}, abstract = {The present cumulative dissertation consists of four articles, and is based on more than 70 semi-structured interviews with the Russian speakers in Germany. Forty two interviews were conducted before of the start of Russia's full-scale invasion of Ukraine, and the other twenty nine right after its beginning (out of which I used only twenty five for the final analysis, as I focused only on the Russian speakers, associated with agressor or neutral countries in Russia's war in Ukraine). The dissertation addresses a variety of issues, related to the media use of the Russian speakers in Germany, which was previously understudied both in general and from political communication perspective (Panagiotidis, 2023). In the strand of migrants and media research, scholars point the following gaps: the lack of political element in studies of how migrants use media (Leurs and Smets, 2018), the lack of studies how homeland and host society media are used simultaneously, not in isolation from each other, and the lack of studies on the influence of homeland media on migrants as such (Ramasubramanian et al., 2017), and finally, communication scholars not using migration studies frameworks in their research on migrants, which leads to fields existing in parallel (Leurs \& Smets 2018). This dissertation addresses all these gaps. Being the first study to apply the concepts of "news repertoires" and the latest theorization of "news literacy" for studying the migrant populations, as well as looking in-depth in the mechanisms of trust, I analyze the media diets of Russian speakers in Germany in their entirety, considering the contexts and roles, attributed to the German quality, Russian opposition, Russian state sponsored and other types of media, i.e. not analying them in isolation, and also looking at the motivations to use different media for different domains of their lives. Besides, for analysing the transformations of media diets of the Russian speakers in the aftermath of Russia's full-scale invasion of Ukraine, I use the concept of "sense of belonging" to Russia to examine the deep, underlying reasons for why news repertoires of these audiences changed, or did not change in the light of Russia's war crimes. As for the contribution to the German-language and Germany-focused literature on the Russian speakers, this is the first comprehensive study to scrutinize the media diets of Russian speakers in-depth with a special emphasis on their motivations, political affiliations and differentiating between the media these audiences "use" and the media they "trust", as previous research on Russian speakers in Germany and their media use was largely focused on integration, largely ignoring the political aspect and Russia's repetitive attempts to influence Russian speakers abroad (e.g.Hepp et al., 2011) or lacked nuance in their results (e.g. Boris Nemtsov Foundation Survey, which posed questions about "Russian media" without defining what it is, i.e. is that opposition media, Kremlin-sponsored media, etc. Finally, this thesis provides a comprehensive case study of audiences from an authoritarian context (or a former authoritarian context, for those, who migrated from Ukraine, but were socialized in the Soviet Union) who migrated to democracy and their media use, and also sheds light on the spectrum of motivations of audiences abroad to continue consuming media from an authoritarian homeland (in our case, Kremlin-sponsored media), which can provide important foundation for future research on other migrant groups from authoritarian contexts in democracies, such as Chinese migrants in Europe. Among the results of the present dissertation is an article on three types of news repertoires that these audiences have, and how political beliefs underpin them; an article on how they view the "truth" in media and why it is a concept of crucial importance for their news trust patterns; an article on news literacy and how migrant audiences need transnational news literacy knowledge in order to navigate complex media landscapes, in which authoritarian states actively try to reach them with their narratives; and finally, how a major crisis event, such as war in Ukraine, changed (or did not change) the news repertoires of the Russian speaking audiences in Germany and why the "sense of belonging" is at the core of these changes.}, language = {en} } @phdthesis{Kochendoerfer2026, author = {Kochend{\"o}rfer, Laura}, title = {Rethinking systems use in information systems research - theories on individuals' use of multiple information systems}, url = {http://nbn-resolving.de/urn:nbn:de:bvb:739-opus4-20164}, school = {Universit{\"a}t Passau}, pages = {vi, 99 Seiten}, year = {2026}, abstract = {While individuals use multiple information systems (IS) every day, research on IS use predominantly investigates use with respect to only one information system at a time. In light of this "single-IS paradigm" (Gerlach \& Cenfetelli, 2022), theoretical and empirical insights into the nature and behavioral manifestations of multiple IS use remain limited. To advance the discipline's understanding of the multiple IS use reality, this dissertation theorizes mechanisms that are idiosyncratic to the context of individuals' multiple IS use. Based on grounded theory methodology and interview data from individuals using multiple IS, this dissertation contributes two theories on multiple IS use in two essays. The first essay introduces an analytical theory of eight different interdependencies-in-use as core mechanisms that emerge as users engage with multiple IS. The second essay builds on these interdependencies-in-use and examines how one type of interdependency manifests in behavior. The resulting process theory explains a behavioral phenomenon resulting from multiple IS use: users transferring usage behaviors from one IS to another. This dissertation contributes a theoretical framework for conceptualizing multiple IS use with its underlying mechanisms that enable future research to systematically investigate multiple IS use and related phenomena. It further enriches insights on usage behavior by a multiple IS perspective, indicating that multiple IS use contexts give rise to unique behavioral dynamics. With that, the current conversation in IS use research that focuses on single IS use is extended with new theoretical insights on the use of multiple IS. The dissertation offers additional recommendations for practitioners to consider the interdependent way individuals use multiple IS.}, language = {en} } @phdthesis{WallenbornWeiss2026, author = {Wallenborn-Weiß, Benjamin}, title = {Quo vadis Spruchverfahren? - Eine Evaluation der Reform durch das UmRUG sowie des verbleibenden Reformbedarfs des Spruchverfahrensgesetzes}, url = {http://nbn-resolving.de/urn:nbn:de:bvb:739-opus4-20099}, school = {Universit{\"a}t Passau}, pages = {XIII, 400 Seiten}, year = {2026}, abstract = {Die Arbeit besch{\"a}ftigt sich mit einem Thema an der Schnittstelle zwischen dem Unternehmensrecht und dem Zivilverfahrensrecht, dem Spruchverfahrensgesetz (SpruchG). Hierbei wird der Status Quo de lege lata nach dem Gesetz zur Umsetzung der Umwandlungsrichtlinie und zur {\"A}nderung weiterer Gesetze (UmRUG) dargestellt. Anschließend nimmt der Autor eine Analyse der Ursachen f{\"u}r die lange Verfahrensdauer von Spruchverfahren vor, wobei er die Ergebnisse seiner eigens konzipierten Umfrage einfließen l{\"a}sst. Nach einem Rechtsvergleich nach {\"O}sterreich und die Schweiz werden Reformvorschl{\"a}ge und eigene Konzeptionierungen de lege lata und de lege ferenda diskutiert.}, language = {de} } @phdthesis{Min2026, author = {Min, Yufei}, title = {Informationelle Rechtspositionen von Unternehmenstr{\"a}gern in Deutschland und China - unter besonderer Ber{\"u}cksichtigung der registergest{\"u}tzten Informationsversorgung}, url = {http://nbn-resolving.de/urn:nbn:de:bvb:739-opus4-20081}, school = {Universit{\"a}t Passau}, pages = {XVIII, 255 Seiten}, year = {2026}, abstract = {Im Zeitalter der Digitalisierung und der Leistungssteigerung von Registern zur weiteren Wertsch{\"o}pfung gewinnt die rechtliche Gestaltung der Informationslage {\"u}ber Unternehmenstr{\"a}ger eine wichtige Bedeutung. Die Arbeit konzentriert sich prim{\"a}r auf staatliche Register sowie auf rein private Auskunfteien. Dabei wird die Rechtslage in Bezug auf die informationellen Rechtspositionen von Unternehmen als Registersubjekten in Deutschland und China untersucht. Auf dieser Grundlage wird ein Rechtsvergleich vorgenommen und abschließend ein internationales Registerrecht skizziert.}, language = {de} } @phdthesis{Frank2026, author = {Frank, Florian}, title = {Integrating physical unclonable functions from novel nanomaterials, circuit elements, and memory technologies into future hardware architectures}, url = {http://nbn-resolving.de/urn:nbn:de:bvb:739-opus4-20104}, school = {Universit{\"a}t Passau}, pages = {XVI, 190 Seiten}, year = {2026}, abstract = {Cryptographic keys are fundamental components for ensuring security in digital systems. To ensure reliable key generation and management, various technical concepts have been developed, primarily based on dedicated hardware components such as Trusted Platform Modules (TPMs). However, many modern systems, especially small resource-constrained devices, typically lack hardware support for secure key generation and management. To address these limitations, Physical Unclonable Functions (PUFs) have proven to be an effective solution for key generation, device authentication, and identification tasks. PUFs leverage inherent variations in hardware components to produce unique, device-specific keys. For a well-designed PUF, these keys can be reproduced reliably on the same device but are practically impossible to clone. Various types of PUFs exist, including those that exploit slight delay differences in circuits with symmetric paths. Others rely on physical characteristics of components already present in the computing system, such as SRAM or DRAM. However, many of these constructions rely on technologies that could be replaced by emerging ones in the future. Such a replacement may involve a transition from traditional memory technologies, such as SRAM, DRAM, and flash memory, to emerging Non-Volatile Memories (NVMs), including Ferroelectric RAM (FRAM), Magnetoresistive RAM (MRAM), and Resistive RAM (ReRAM). These new technologies, in turn, necessitate innovative hardware security solutions for generating intrinsic hardware fingerprints, ensuring security for next-generation embedded devices. Furthermore, the integration of nanomaterials, such as carbon nanotubes, into processor architectures and the adoption of reconfigurable hardware platforms like Field-Programmable Gate Arrays (FPGAs) require the development of specifically tailored cybersecurity solutions. This dissertation aims to develop hardware-based security mechanisms for these types of devices by designing new PUF constructions and demonstrating their practical applications. One focus lies on PUFs extracted from nanomaterials and emerging circuit elements, particularly memristive devices and Carbon NanoTube Field-Effect Transistors (CNT-FETs). For memristive devices, which form the basis of ReRAM memory, this work analyzes methods ranging from simple binary quantization to advanced techniques exploiting device-specific response patterns. In the case of CNT-FETs, custom-fabricated wafers are developed to construct PUFs with optimal properties, such as high robustness, uniformity, and entropy, even under varying environmental conditions. These conditions include fluctuations in ambient temperature. Based on an analysis of fundamental system components, this work evaluates the feasibility of deriving PUFs from fully integrated circuits. A specific focus is placed on emerging non-volatile memory technologies, assessing their potential for PUF applications. To achieve PUF behavior in these memory devices, techniques such as intentional timing manipulation, induced bit flips through row hammering, and variations in supply voltage are examined. These resulting bit flips can be exploited as PUF responses. Additionally, transforming raw PUF responses into cryptographically usable keys and integrating specific PUFs into practical applications are core components of this work. The demonstrated practical applications include an innovative architecture for encrypting and binding data to non-volatile memory modules, implemented on Multiprocessor System-on-Chips (MPSoCs) incorporating FPGAs. This architecture enables the storage of confidential data on non-volatile memory while simultaneously using the same module as a PUF, without requiring separate memory partitions solely for the PUF functionality. Finally, practical applications of hardware fingerprints in the automotive sector are demonstrated, including an FPGA-based implementation to maintain security while preserving the temporal determinism of time-critical messages. These goals are met through the use of hardware-implemented cryptographic algorithms coupled with an FPGA-based ring oscillator PUF. To summarize, this work presents new types of PUF implementations, starting with nanomaterials and emerging circuit elements, extending to PUFs derived from integrated circuits, and demonstrates innovative solutions for their integration into MPSoC-based architectures.}, language = {en} } @phdthesis{Gruener2026, author = {Gr{\"u}ner, Alina}, title = {Stranger Danger? Three Essays on Consumer Trust and Data Disclosure in Multi-Actor Environments}, url = {http://nbn-resolving.de/urn:nbn:de:bvb:739-opus4-19957}, school = {Universit{\"a}t Passau}, pages = {XVI, 201 Seiten}, year = {2026}, abstract = {Technological advancements and digitalization in recent decades have led an increasing number of firms to recognize the value of multi-actor business models. Integrating third parties into business processes provides firms with several benefits, including access to additional resources, skills, and information. However, from the consumer's perspective, the involvement of third parties, often unknown to the consumer, is frequently associated with uncertainty, privacy concerns, and, thus, a reluctance to engage with multi-actor business models. Such concerns are not unfounded: In many multi-actor environments, privacy-related misbehavior is common, whether caused by third-party firms, network users, or other actors. Incidents range from unauthorized data sharing to illegal surveillance, identity theft, and financial fraud. Consumers' skepticism poses challenges for firms, requiring strategic measures that not only foster consumer engagement with the network but also help build trust in the presence of third-party involvement and manage the consequences of trust erosion following negative third-party experiences. While privacy research recognizes consumer concerns in multi-actor environments, the literature does not offer specific business strategies to encourage data disclosure in the context of third-party involvement. Instead, research on multi-actor business models has largely focused on the benefits of shared value creation, while the broader impact of negative third-party privacy-related incidents on the overall actor-network remains underexplored. This dissertation addresses this research gap through three independent essays, aiming to identify business strategies that enhance consumer trust and willingness to disclose data in multi-actor environments and counteract the negative effects of (potential) third-party misbehavior on the actor-network. It focuses on preventive measures that address consumers' concerns before interacting with the actor-network, as well as reactive strategies that are designed to maintain consumers' engagement with an actor-network after a negative experience with one of the actors. As a first step toward identifying effective business strategies in multi-actor environments, Essay 1 examines two mechanisms: transparency and control, commonly used to foster consumers' willingness to disclose data. While not explicitly framed as a multi-actor study, Essay 1 investigates how firms' implementation of transparency and control features regarding data practices influences consumers' willingness to disclose data. Two online scenario experiments compare a proactive approach, where consumers receive all relevant information and control options upfront, with an upon-request approach, where they access details by clicking for more information. The results show that the proactive approach increases cognitive effort and reduces data disclosure, while perceptions of procedural fairness do not significantly differ between the approaches. This pattern also holds in high-sensitivity conditions involving third-party data sharing, suggesting that the upon-request approach is effective across both single-actor and multi-actor environments. Building on these findings, Essay 2 analyzes how the representation of actor-networks influences consumers' willingness to disclose data. Drawing on social psychology research on perceived entitativity, three online scenario experiments show that consumers trust firm networks more when they perceive them as highly entitative - as cohesive and integrated entities - rather than as low entitative, meaning a loose collection of independent firms. This greater trust, in turn, enhances their willingness to disclose personal data. Moreover, the analyses reveal that consumers process information about highly entitative firm networks more fluently and experience lower uncertainty than when engaging with low-entitativity networks. This essay also holds substantial practical significance by identifying concrete design recommendations to enhance perceived entitativity. In Essay 3, a platform is conceptualized as a multi-actor environment that enables peer-to-peer interactions. This essay investigates how consumers' negative experiences with other users in multi-actor environments affect trust in the platform as a whole. Two studies were conducted in the home-sharing context, where consumers grant deep access to their privacy by allowing others into their homes or by sharing images of their private living spaces, addresses, and payment details. This openness entails inherent risks when interacting with other users and may facilitate misbehavior. The findings reveal a negative bottom-up trust transfer, whereby a negative experience with another user leads to diminished trust in the misbehaving user and, subsequently, in the platform. Although the platform does not directly control user behavior, consumers attribute part of the responsibility for negative incidents to the platform, which in turn reduces loyalty. This effect is stronger for negative outcome-related incidents, which pertain to the core service itself, than for negative process-related incidents, which relate to the service delivery process. To effectively mitigate this erosion of loyalty, Essay 3 identifies high prior relationship satisfaction between the consumer and the platform as a key buffering mechanism in which firms should actively invest. The insights from my dissertation extend privacy research by examining multi-actor environments and analyzing how firms can encourage consumers to disclose personal data, which psychological mechanisms guide their decision-making, and how trust is established and transferred within the network. Furthermore, this dissertation raises corporate awareness of the risks associated with the involvement of third parties in multi-actor settings. It provides practical strategies to mitigate these risks, fostering consumer acceptance and ensuring the long-term success of such business models.}, subject = {Verbraucherverhalten}, language = {en} } @phdthesis{Hackl2026, author = {Hackl, Veronika}, title = {The Literate Human in the Loop: AI Feedback in Higher Education}, url = {http://nbn-resolving.de/urn:nbn:de:bvb:739-opus4-19982}, school = {Universit{\"a}t Passau}, pages = {iii, 22, 8, 11 Seiten}, year = {2026}, abstract = {This cumulative dissertation, titled "The Literate Human in the Loop: AI Feedback in Higher Education," investigates the integration of Artificial Intelligence (AI) feedback systems within academic settings and the critical role of user competence.}, language = {en} } @phdthesis{Wendlinger2026, author = {Wendlinger, Lorenz}, title = {Structure-aware Deep Learning}, url = {http://nbn-resolving.de/urn:nbn:de:bvb:739-opus4-19892}, school = {Universit{\"a}t Passau}, pages = {XX, 176 Seiten}, year = {2026}, abstract = {Graph structures permeate the digital landscape in explicit and implicit forms. They connect or construct artifacts by combining semantic and structural information. We also observe them in the systems designed to process this data, in their learning algorithms and the very nature of the tasks they solve. At the same time, machine learning methods are extremely data-hungry, requiring petabytes of data for training. Due to their complexity, graphs remain an under-utilized resource in this regard. Many approaches cannot incorporate them due to being fully structurally unaware or not suited to the specific flavour of graphs encountered in some domains. This disconnect is sub-optimal from an effectiveness and efficiency perspective. We present methods that extend the scope of structure-aware deep learning through structural knowledge integration and enrichment, structural performance prediction, and synergistic transfer learning. Knowledge graphs organize information and make it directly available for querying. They provide a structured inference interface for manual and automated inspection, though they can suffer from data quality issues and require careful schema design. We rephrase the reconciliation of knowledge in knowledge graphs as a link prediction task, making it tractable with adapted graph neural networks, while also benefiting conventional link prediction tasks. We further combine textual semantics and structural expression for legal reference prediction via adapted heterogeneous graph neural networks operating on complex meta-information enriched graphs. Additionally, we explore methods for the integration of intermediary expressions in strongly typed heterogeneous graphs, improving prediction via meta-path-based processing. We also develop methods for automated machine learning workflow analysis and performance prediction. This includes the learning of salient representations for management as well as improvement of workflows through automatic suggestion and refinement of components. These are then extended to the prediction of Neural Architecture Search performance prediction, including adaptation to operation-on-edge spaces. Finally, we investigate the transfer capability of pre-trained attention structures for text-based prediction tasks and find it to be both inferior to directly optimized attention masks as well as highly dependent on inherent domain knowledge. We also show that the exploitation of hierarchical task formulation can improve prediction performance through joint learning in diverse learning domains, including link prediction, performance prediction, and specialized and general argumentation mining. The dissertation contains previously published or submitted texts: Wendlinger, L., H{\"u}bscher, G., Ekelhart, A., Granitzer, M. (2022). Reconciliation of Mental Concepts with Graph Neural Networks. In: Strauss, C., Cuzzocrea, A., Kotsis, G., Tjoa, A.M., Khalil, I. (eds): Database and Expert Systems Applications. DEXA 2022. Lecture Notes in Computer Science, vol 13427, p 133-146. Springer, Cham. https://doi.org/10.1007/978-3-031-12426-6_11; Wendlinger, L., Granitzer M. (2024). Informed Heterogeneous Attention Networks for Metapath Based Learning. In: SAC '24: Proceedings of the 39th ACM/SIGAPP Symposium on Applied Computing, p 458-465, ACM, New York. https://doi.org/10.1145/3605098.3635890; Wendlinger, L., Nonn, S.A., Al Zubaer, A., Granitzer, M. (2026). The Missing Link: Joint Legal Citation Prediction Using Heterogeneous Graph Enrichment. In: Wrembel, R., Kotsis, G., Tjoa, A.M., Khalil, I. (eds) Database and Expert Systems Applications. DEXA 2025. Lecture Notes in Computer Science, vol 16047, p 197-211. Springer, Cham. https://doi.org/10.1007/978-3-032-02088-8_14; Wendlinger, L., Stier, J., Granitzer, M. (2021). Evofficient: Reproducing a Cartesian Genetic Programming Method. In: Hu, T., Louren{\c{c}}o, N., Medvet, E. (eds) Genetic Programming. EuroGP 2021. Lecture Notes in Computer Science, vol 12691, p 162-178. Springer, Cham. https://doi.org/10.1007/978-3-030-72812-0_11; Wendlinger, L., Berndl, E., Granitzer, M. (2021). Methods for Automatic Machine-Learning Workflow Analysis. In: Dong, Y., Kourtellis, N., Hammer, B., Lozano, J.A. (eds) Machine Learning and Knowledge Discovery in Databases. Applied Data Science Track. ECML PKDD 2021. Lecture Notes in Computer Science, vol 12979, p 52-67. Springer, Cham. https://doi.org/10.1007/978-3-030-86517-7_4; Wendlinger, L., Granitzer, M., Fellicious, C. (2023). Pooling Graph Convolutional Networks for Structural Performance Prediction. In: Nicosia, G., et al. (eds) Machine Learning, Optimization, and Data Science. LOD 2022. Lecture Notes in Computer Science, vol 13811, p 1-16. Springer, Cham. https://doi.org/10.1007/978-3-031-25891-6_1; Wendlinger, L., Braun, C., Zubaer, A., Nonn, S., Großkopf, S., Fellicious, C., Granitzer, M.: On the Suitability of pre-trained foundational LLMs for Analysis in German Legal Education, submitted to the proceedings of the International Conference on Machine Learning, Optimization, and Data Science 2025, preprint published: https://doi.org/10.48550/arXiv.2412.15902; Wendlinger, L., Kuhn, R., Mitrovic, J., Granitzer, M. (2025). Joint Learning for Efficient German Argument Mining. In: 2025 IEEE 37th International Conference on Tools with Artificial Intelligence (ICTAI), Athens, Greece, 2025, p 770-777. IEEE, Los Alamitos. https://doi.org/10.1109/ICTAI66417.2025.00111.}, language = {en} } @phdthesis{Neuwirth2026, author = {Neuwirth, Daniel}, title = {Einbettung und Charakterisierung von aligned bar 1-visibility Graphen und outer fan free Graphen}, url = {http://nbn-resolving.de/urn:nbn:de:bvb:739-opus4-19930}, school = {Universit{\"a}t Passau}, pages = {VII, 247 Seiten}, year = {2026}, abstract = {In dieser Arbeit werden drei verschiedene Klassen von Graphen untersucht. Die Klassen sind die bar (1;1)-visibilty Graphen, die aligned bar 1-visibility Graphen und die outer fan free Graphen. Die Klassen werden durch ihre m{\"o}glichen Einbettungen charakterisiert. Die Repr{\"a}sentation der bar (1; j)-visibility Graphen ist, dass jeder Knoten als horizontaler Strich und jede Kante als vertikaler Strich gezeichnet wird. Eine Kante kann einen Knoten genau einmal schneiden und ein Knoten kann j-mal geschnitten werden. Wir erweitern die Ergebnisse von Dean et. al. und geben Beispiele mit einer maximalen Dichte an f{\"u}r bar (1; 2)-visibility, bar (1; 3)-visibility und bar (1; 4)-visibility Graphen und geben einen maximal d{\"u}nnen Graphen f{\"u}r die Klasse der bar (1;1) visibility Graphen an. Wir zeigen, dass die Klassen der bar (1; j)-visibility Graphen f{\"u}r 1 < j < 1eine unendliche Hierarchie bilden. Abschließend beweisen wir, dass das Erkennungsproblem ob ein Graph eine bar (1;1)-visibility Repr{\"a}sentation hat, NP-vollst{\"a}ndig ist. Die Klasse der aligned bar 1-visibility Graphen (AB1V ) erh{\"a}lt man, indem man die bar (1;1)-visibility Repr{\"a}sentation um 90 Grad dreht und alle Knoten verl{\"a}ngert, so dass diese alle mit der y-Koordinate 0 starten. Die relative Position bzgl. der x-Koordinate wird mit der t-Ordnung beschrieben und mit der r-Ordnung die relative Position bzgl. der y-Koordinate. Wir erweitern die Erkenntnisse von Felsner und Massow f{\"u}r die Klasse der AB1V Graphen bzgl. ihrer maximalen Dichte, der minimale Grad eines Knotens. Wir f{\"u}hren die Methode Pfadaddition ein, um anhand deren Abschlusseigenschaften zu unterscheiden, ob ein Graph in einer Klasse liegt oder nicht. Diese Methode nutzen wir, um die Beziehung der Klasse der AB1V Graphen mit anderen Klassen zu untersuchen. F{\"u}r die Klasse der maximalen Graphen geben wir einen d{\"u}nnen Graphen und eine untere Schranke bzgl. der Dichte an. Wir geben einen Algorithmus an, welcher eine Bucheinbettung aus einer AB1V Einbettung berechnet. F{\"u}r die Klassen der optimalen AB1V Graphen geben wir einen Einbettungsalgorithmus an. Wir verbessern den Erkennungsalgorithmus von Felsner und Massow, ob ein Graph mit einer gegebenen t-Ordnung eine AB1V Einbettung besitzt. F{\"u}r die Klasse der distinkt strong AB1V Graphen, Graphen in der jeder Knoten ein unterschiedliche r-Ordnung hat und maximal f{\"u}r die r-Ordnung ist, geben wir einen Algorithmus an, der in O(n6) eine m{\"o}gliche Einbettung berechnet. Zum Schluss zeigen wir f{\"u}r diese Klasse, dass es exponentiell viele verschiedene Einbettungen gibt. Ein Graph hat eine outer fan free Einbettung, wenn alle Knoten inzident zu einer Fl{\"a}che sind und keine Kante von zwei Kanten geschnitten wird, die adjazent zu einem Knoten sind. Wir untersuchen diese Klasse zuerst auf die Dichte. Weiter erforschen wir die Beziehung zwischen den Klassen der AB1V , RAC und k-planaren Graphen. Abschließend geben wir eine Reduktion von NAE-3-SAT auf das Erkennungsproblem von outer fan free Graphen an.}, language = {de} } @misc{OPUS4-1983, title = {Befunde und Erfahrungen zum Einsatz der Passauer Standards f{\"u}r Lehrkr{\"a}ftebildung in der Praxis}, volume = {2025}, number = {13}, editor = {M{\"a}gdefrau, Jutta and Kufner, Sabrina and Birnkammerer, Hannes}, doi = {10.15475/paradigma.2025.1}, url = {http://nbn-resolving.de/urn:nbn:de:bvb:739-opus4-19839}, pages = {59 Seiten}, year = {2025}, abstract = {Inhalt Gestufte Lehrkr{\"a}ftebildungsstandards in der Praxis der Hochschullehre: Befunde aus Projekten zur Weiterentwicklung der Lehre | 5 Sabrina Kufner \& Jutta M{\"a}gdefrau Kompetenzentwicklung in der Lehrkr{\"a}ftebildung im Rahmen des studienbegleitenden fachdidaktischen Praktikums im Fach Mathematik | 11 Jakob Heller \& Matthias Brandl Was bewirkt die Arbeit mit Standards? Ein Forschungsbericht aus dem Fachpraktikum Katholischer Religionsunterricht | 18 Hans Mendl, Rudolf Sitzberger, Julia Gs{\"o}dl \& Rebecca Schmid Der Einsatz der Lehrkr{\"a}ftebildungsstandards in der Lehr:werkstatt - eine Erhebung zur Identifikation von Innovationspotentialen in der Begleitung von Schulpraktika | 27 Sabrina Kufner Kompetenzentwicklung von Lehramtsstudierenden in der Konstruktion selbstregulationsf{\"o}rderlicher Arbeitsauftr{\"a}ge | 35 Jutta M{\"a}gdefrau Standardbezogene Selbsteinsch{\"a}tzungen von Lehramtsstudierenden zur Klassenf{\"u}hrung im Fach Musik | 46 Gabriele Schellberg \& Christina Fehrenbach Autorensteckbriefe | 59}, language = {de} } @phdthesis{Fischer2025, author = {Fischer, Liliann}, title = {An exploration of professional self concepts in science communication}, url = {http://nbn-resolving.de/urn:nbn:de:bvb:739-opus4-19817}, school = {Universit{\"a}t Passau}, pages = {iv, 146 Seiten}, year = {2025}, abstract = {The dissertation explores emerging professional self concepts in the field of science communication. It integrates theories and concepts from a diverse range of disciplines from the sociology of professions to science and technology studies. It also considers organisational contexts and country specifics as major influencing factors and includes these in comparative frameworks. By triangulating data from different sources the dissertation offers broad insights not only into science communication but professionalisation more widely.}, language = {en} } @phdthesis{Schiermeier2025, author = {Schiermeier, Kathrin}, title = {Multidimensional Wavelets and Neural Networks}, url = {http://nbn-resolving.de/urn:nbn:de:bvb:739-opus4-19742}, school = {Universit{\"a}t Passau}, pages = {xx, 168 Seiten}, year = {2025}, abstract = {The construction of scaling functions and wavelets in multiple dimensions and for arbitrary scaling matrices is a challenging task entailing some complexities. Existing approaches mainly focus on the two-dimensional case using dyadic or quincunx sampling. This thesis aims to develop a method to construct multidimensional scaling and wavelet filters yielding orthogonal scaling functions and wavelets under the usage of convolutional neural networks. We start by recalling substantial fundamentals of ideals, modules, Fourier analysis, filterbanks and multiresolution analyses, where the mentioned concepts are already considered in an arbitrary dimensional setting to prepare the proof of the main result. There, we show the connection between multivariate scaling functions and multidimensional filters possessing certain properties. This enables us to construct scaling functions and corresponding wavelets by discrete filter design. Exploiting the link between the discrete wavelet decomposition, filterbanks and neural networks, we utilize the latter to do so. Being the main difficulty of this process, we especially focus on the Cohen criterion, which concerns the zeros of the Fourier transform of the scaling filter in modulus representing a multivariate trigonometric polynomial. After transferring the Bernstein inequality for univariate trigonomic polynomials to multiple dimensions, we present a method to derive a finite set of inequality constraints implying that the Cohen criterion holds true for a given multivariate cosine sum. Afterwards, we introduce neural networks and TensorFlow as the main tools to execute the described approach, formulate the described objective as an optimization problem and present some smaller numerical experiments and their results. A second objective of this thesis is the construction of filters possessing a unimodular modulation vector and therefore the ability to be completed to a perfect reconstruction filterbank. Both - the construction and the filterbank completion - can also be considered in a neural network framework as we will detail in the last section of this thesis alongside with the presentation of corresponding numerical experiments. In the context of filterbank completion, a further observation which allows to complete any given interpolatory filter to a perfect reconstruction filterbank in a very intuitive and simple way is presented. Furthermore, we explain that any given unimodular filter can be rendered interpolatory through prefiltering.}, language = {en} } @phdthesis{Henle2025, author = {Henle, Mona}, title = {Multi-Leader Congestion Games with an Adversary}, url = {http://nbn-resolving.de/urn:nbn:de:bvb:739-opus4-19683}, school = {Universit{\"a}t Passau}, pages = {112 Seiten}, year = {2025}, abstract = {In this thesis, we introduced a congestion game with multiple leaders and a single follower (adversary) which is motivated by security applications with congestion effects. Our objective was to understand the result and the impact of selfish acting individuals in these games. In this regard, we analyzed the existence, the computation and the quality of (approximate) pure Nash equilibria. First, we observed that an exact pure Nash equilibrium always exists in the resulting strategic game among the leaders if the resource cost coefficients are identical and the underlying congestion game is a matroid congestion game. If one of these two conditions is not fulfilled, the existence of PNE is not ensured anymore in general. Consequently, we focused on approximate equilibria. For the case of symmetric singleton strategies, one of our main result established that K ≈ 1.1974, the unique solution of a cubic polynomial equation, is the smallest possible factor such that the existence of a K-approximate equilibrium is guaranteed for all instances of the game. To this end, we presented an efficient algorithm which computes a K-approximate PNE. Furthermore, we showed that the factor K is tight by providing an instance where no α-approximate PNE with α < K exists. However, for a specific symmetric singleton instance there might be a better α-approximate PNE, i.e., with α < K. A given instance could even admit an exact PNE. We provided therefore a polynomial time procedure that computes a best approximate PNE of a given instance. In particular, this procedure can verify the existence of an exact PNE in a given instance efficiently and, if it exists, can also determine the corresponding load vector. Finally, for symmetric singleton instances with two resources, we compared the total cost of a best (cheapest) and worst (most expensive) PNE to the total cost of an optimal outcome, termed by the price of stability and the price of anarchy, respectively. In particular, we verified that the PoS and the PoA are 4/3.}, subject = {Spieltheorie}, language = {en} } @phdthesis{Ellinger2025, author = {Ellinger, Simon}, title = {On optimal error rates for strong approximation of stochastic differential equations with irregular drift coefficients}, url = {http://nbn-resolving.de/urn:nbn:de:bvb:739-opus4-19634}, school = {Universit{\"a}t Passau}, pages = {179 Seiten in verschiedenen Seitenz{\"a}hlungen}, year = {2025}, abstract = {In this dissertation we study strong approximation of stochastic differential equations (SDEs) with irregular drift coefficients at the final time point or globally in time by methods that use only finitely many evaluations of the driving Brownian motion. We show the optimality of well-known methods, such as the Euler-Maruyama scheme or a transformed Milstein scheme, for classes of piecewise Lipschitz continuous, H{\"o}lder continuous and Sobolev regular drift coefficients. To do this, we derive the optimal error rates for the different classes of irregular drift coefficients. Furthermore, we show that the solution of an SDE with piecewise H{\"o}lder continuous drift coefficient has a regular local density, which is used in the proofs of the lower bounds.}, language = {en} } @misc{OPUS4-1964, title = {Universit{\"a}tsbibliothek Passau: Jahresbericht 2024}, address = {Passau}, url = {http://nbn-resolving.de/urn:nbn:de:bvb:739-opus4-19641}, pages = {35 Seiten}, year = {2025}, abstract = {Jahresbericht der Universit{\"a}tsbibliothek Passau f{\"u}r das Jahr 2024.}, language = {de} } @phdthesis{Kling2025, author = {Kling, Julia}, title = {Social Networking Sites as Intermediaries of Authoritarian State Propaganda: How Facebook and VK Disseminated Predominantly Kremlin-Friendly Political Content Before and During Russia's Full-Scale Invasion of Ukraine}, url = {http://nbn-resolving.de/urn:nbn:de:bvb:739-opus4-19601}, school = {Universit{\"a}t Passau}, pages = {48 Seiten, 160 verschieden gez{\"a}hlte Seiten}, year = {2025}, abstract = {Previous research on Russia's use of social networking sites to influence foreign audiences has primarily focused on US-based platforms, such as Twitter and Facebook, the activities of Russia's "troll farms", as well as Russia's foreign broadcasters, RT and Sputnik, and their audiences. By contrast, little research has examined the global reach of Russia's state-aligned domestic news content, specifically on US- and Russia-based social networking sites that significantly differ in the level of the Kremlin's control over information flows, and how the activities of novel Russian disinformation production organizations support this reach. In my dissertation, I addressed these gaps in the extant research literature in the fields of political communication, social media, and Russia studies in four distinct research papers focusing on the reach of and engagement with Russian-speaking political content, including Russia's domestic news content, and the activities of ANO Dialog, Russia's novel disinformation production organization with close links to the Russian government, on US-based Facebook and Russia-based VK. To do so, I used innovative qualitative, quantitative, and computational research methods to create knowledge on Russia's informational influence on the two platforms before and after the start of Russia's full-scale invasion of Ukraine in February 2022. The findings highlight that, despite differing levels of Kremlin control, both of the social networking sites studied functioned as conduits for the dissemination of Russian-speaking, predominantly Kremlin-friendly political content, including state-aligned domestic news. This content reached audiences both within Russia and abroad in the lead-up to and during the full-scale war in Ukraine. While VK primarily served Russia's users, Facebook disseminated Russia's state-aligned news mostly to audiences outside Russia, particularly in former Soviet countries, in the lead-up to the invasion. During the war, Facebook continued to host critical perspectives on Russia's war crimes, in contrast to VK, where such content was blocked. However, Facebook was banned in Russia in March 2022, limiting domestic access to dissenting views. With the war ongoing as of May 2025 and organizations such as ANO Dialog intensifying their efforts to influence both domestic and foreign audiences on platforms such as VK and Facebook, it is likely that Russia will further strengthen its information control.}, language = {en} } @phdthesis{Prummer2025, author = {Prummer, Michael}, title = {Asset Tokenization and Authentication in the Industrial Metaverse}, url = {http://nbn-resolving.de/urn:nbn:de:bvb:739-opus4-19566}, school = {Universit{\"a}t Passau}, pages = {xviii, 196 Seiten}, year = {2025}, abstract = {The Industrial Revolution is a crucial development step in human history that started three centuries ago and is still ongoing. It continually influences and shapes the globalized world. Today, industries account for 20\% of carbon dioxide emissions worldwide and require more than a third of global energy consumption. Current problems, such as climate change, increasing waste, and pollution, require simultaneous optimization across all industrial domains, infrastructure, and systems as they depend on each other. The global industry faces the immense challenges of providing for a surging world population expected to peak in the mid-2080s with 10.4 billion people, as reported by the United Nations. Hence, industries are expected to become less resource-intensive, sustainable, and more resilient to disrupted supply chains while producing for a growing population for the next decades. The Fourth Industrial Revolution, or Industry 4.0 (I4.0), started around 2010 and is still an ongoing transformation of industrial processes towards digitalization, creating smart factories referring to the digital data integration of the entire manufacturing cycle. I4.0 is incredibly information-intensive and requires immense data to simulate and predict essential operations based on a digital shadow of the factory, a so-called digital twin. The Metaverse is considered a digitalization megatrend merging digital and physical worlds, creating immersive experiences and new opportunities for interaction and innovation across various sectors and industries. The vision of the Metaverse promotes interconnected and interoperable real-time 3D virtual worlds that can be frictionlessly traversed while sustaining ownership of one's assets under a self-sovereign identity in a decentralized environment without platform lock-ins to a specific ecosystem. Therefore, the Metaverse creates an immersive parallel reality with collective virtually shared spaces for entertainment, social interactions, education, and a new working environment. The Industrial Metaverse synthesizes Metaverse concepts with current industrial automation, such as I4.0, to deepen the digital-physical convergence by interconnecting internal and external systems to enable decision-making and predictions based on significantly broader knowledge. An Industrial Metaverse factory is entirely mirrored to integrate digital twins of all types of equipment, assets, and other entities that can communicate vertically and horizontally, as well as the knowledge about relevant external systems and industrial core sectors. Through the comprehensive data integration of the Industrial Metaverse, AI-driven applications can predict future events, reducing system and hardware failures. Furthermore, the interconnected virtual environments create a meta-ecosystem for global collaboration, providing spaces for solving complex problems such as engineering and product design tasks, simulation of product twins, and reduced development time and costs. The connected industrial ecosystems create a token-based digital economy for exchanging data, assets, and services cross-metaverse connecting isolated data silos. Sharing digital twin resources and services with other systems enables new innovative applications and growing ecosystems. The theoretical part of this thesis defines the essential characteristics and key technologies of the Industrial Metaverse to derive a reference architecture for a decentralized system of systems, outlining the fundamental Industrial Metaverse building blocks. Interoperable data exchange, access management, and system communication are critical challenges. Especially interoperability of assets such as 3D files that come in different formats and identities must be ensured to move between virtual environments. The unique fusion of technologies leverages interconnected digital twins in the context of immersion, interaction, and collaboration for secure, autonomous-governed, decentralized industrial applications. Hence, the Industrial Metaverse requires the possibility of exchanging assets, products, and services across all systems in a secure manner. Distributed ledger technology enables tamper-proof transactions of assets and value in a decentralized token economy. Therefore, we investigate the feasibility of current tokenization methods for industrial assets, in particular, Printed Circuit Board (PCB) designs and 3D models. We contribute methods to create unique fingerprints of PCB designs to enable their exchange in the token economy. We investigate how to bind files in different formats and quality representations to the same token. A robust multi-file binding based on the copper layers of a PCB design was achieved by calculating an adaptive perceptual hash of all files. The adaptive perceptual hash was evaluated against numerous tamperings of the routing layout of a PCB, showing decent resistance to layout changes. The resulting adaptive perceptual hash can be used as an additional identification attribute in a tokenized asset. Furthermore, assets must be authenticatable and verifiable by marketplaces, manufacturers, and other participants to create trust in a decentralized environment. While assets can be tampered with to manipulate, for example, cryptographic hashes that link the file to the token, perceptual hashes can compute a perceived or functional similarity of two objects instead of the plain file integrity. Without the possibility of verifying and protecting intellectual property, mass adoption of the Metaverse and Industrial Metaverse is unlikely. Therefore, we contribute to detecting tampering attacks on 3D models by introducing a 3D perceptual hash that is robust to a set of mesh manipulations, enabling the trusted exchange and authentication of 3D data in the Metaverse.}, language = {en} } @incollection{UngruheAgergaard2020, author = {Ungruhe, Christian and Agergaard, Sine}, title = {Postcareer precarity : occupational challenges among former West African footballers in Northern Europe}, series = {Sports in Africa : past and present (Ohio University Press Open Access Books. 42; https://ohioopen.library.ohio.edu/oupress/42/)}, booktitle = {Sports in Africa : past and present (Ohio University Press Open Access Books. 42; https://ohioopen.library.ohio.edu/oupress/42/)}, publisher = {Ohio University Press}, address = {Athens}, isbn = {978-0-8214-4696-6}, url = {http://nbn-resolving.de/urn:nbn:de:bvb:739-opus4-14897}, publisher = {Universit{\"a}t Passau}, pages = {190 -- 203}, year = {2020}, abstract = {When Beno{\^i}t Assou-Ekotto's former coach Harry Redknapp announced that the Cameroonian international had decided to end his professional football career and become an adult movie actor, the story generated astonishment and amusement in social media networks and received widespread attention from the mass media. Although the French-born footballer denied the story's validity shortly afterward, claiming Redknapp was joking, it entertained football fans and the wider public during the spring of 2017. However, while this was one of the very few occasions on which an African footballer's postcareer trajectory was a matter of public debate, it also revealed that former African professional footballers' whereabouts, occupations, and living conditions are widely unknown and remain an underresearched topic.}, language = {en} } @article{KoestlerWolff2025, author = {K{\"o}stler, Verena and Wolff, Monika-Sybille}, title = {Promoting digital competencies in pre-service teachers : the impact of integrative learning opportunities}, series = {Education Sciences}, volume = {15 (2025)}, journal = {Education Sciences}, number = {3}, editor = {Sabitzer, Barbara and H{\"o}rmann, Corinna}, publisher = {MDPI}, address = {Basel}, issn = {2227-7102}, doi = {10.3390/educsci15030337}, url = {http://nbn-resolving.de/urn:nbn:de:bvb:739-opus4-16854}, pages = {14 Seiten}, year = {2025}, abstract = {Offering learning opportunities for developing digital competencies in pre-service teacher education remains challenging despite its growing importance in preparing future educators. This study investigates the effectiveness of integrative learning opportunities, called "digitally enhanced courses", which combine subject-specific and digital learning objectives. Implemented at a German university (2019-2023). These courses aimed to promote digital competencies required for technology-supported teaching. Using survey data from 312 pre-service teachers, the research examined students' self-assessed digital competencies, technology acceptance, and value-cost assessments through multiple measurement instruments, including TPACK scales, the Technology Acceptance Model, and Expectancy-Value beliefs. Results revealed significantly higher self-assessed digital competencies in private contexts compared to teaching situations. While mere course participation showed no significant impact, both the frequency and number of attended courses positively correlated with higher self-assessed digital skills across all TPACK dimensions. Additionally, increased technology acceptance and higher success expectations were associated with enhanced teaching-related digital competencies. The findings emphasize that the effectiveness of digitally enhanced courses is contingent upon systematic implementation and student engagement, highlighting the need for structured curricular integration of digital competency development in teacher education through comprehensive, spiral-curriculum approaches rather than isolated interventions. However, this study's reliance on self-reported data may introduce social desirability and subjective estimation bias, and its cross-sectional design limits causal interpretations. Future research should employ longitudinal approaches to examine competency development over time, incorporate objective performance-based assessments, and explore how instructional design and curricular integration influence digital competency acquisition.}, language = {en} } @article{StockerAlshawishBoretal.2022, author = {Stocker, Armin and Alshawish, Ali and Bor, Martin and Vidler, John and Gouglidis, Antonios and Scott, Andrew and Marnerides, Angelos and De Meer, Hermann and Hutchison, David}, title = {An ICT architecture for enabling ancillary services in Distributed Renewable Energy Sources based on the SGAM framework}, series = {Energy Informatics (2520-8942)}, volume = {2022}, journal = {Energy Informatics (2520-8942)}, number = {5}, publisher = {Springer International Publishing}, address = {Berlin}, issn = {2520-8942}, doi = {10.1186/s42162-022-00189-5}, url = {http://nbn-resolving.de/urn:nbn:de:101:1-2022071721175548518669}, pages = {28 Seiten}, year = {2022}, abstract = {Smart Grids are electrical grids that require a decentralised way of controlling electric power conditioning and thereby control the production and distribution of energy. Yet, the integration of Distributed Renewable Energy Sources (DRESs) in the Smart Grid introduces new challenges with regards to electrical grid balancing and storing of electrical energy, as well as additional monetary costs. Furthermore, the future smart grid also has to take over the provision of Ancillary Services (ASs). In this paper, a distributed ICT infrastructure to solve such challenges, specifically related to ASs in future Smart Grids, is described. The proposed infrastructure is developed on the basis of the Smart Grid Architecture Model (SGAM) framework, which is defined by the European Commission in Smart Grid Mandate M/490. A testbed that provides a flexible, secure, and low-cost version of this architecture, illustrating the separation of systems and responsibilities, and supporting both emulated DRESs and real hardware has been developed. The resulting system supports the integration of a variety of DRESs with a secure two-way communication channel between the monitoring and controlling components. It assists in the analysis of various inter-operabilities and in the verification of eventual system designs. To validate the system design, the mapping of the proposed architecture to the testbed is presented. Further work will help improve the architecture in two directions; first, by investigating specific-purpose use cases, instantiated using this more generic framework; and second, by investigating the effects a realistic number and variety of connected devices within different grid configurations has on the testbed infrastructure.}, language = {en} } @phdthesis{Danner2025, author = {Danner, Julian}, title = {SAT Solving Using XOR-OR-AND Normal Forms and Cryptographic Fault Attacks}, url = {http://nbn-resolving.de/urn:nbn:de:bvb:739-opus4-19171}, school = {Universit{\"a}t Passau}, pages = {vi, 237 Seiten}, year = {2025}, abstract = {The Boolean satisfiability problem (SAT) lies at the core of computational logic and has found many applications in verification, cryptography, and artificial intelligence. While conflict-driven SAT solvers (CDCL) excel on large industrial instances, they struggle with XOR-rich instances arising frequently in cryptanalysis, due to the inefficiency of CNF encodings of linear constraints. Conversely, algebraic approaches can work with linear XOR constraints naturally but fail to scale to relevant sizes. Bridging these complementary paradigms with a focus on cryptographic problems is at the heart of this thesis. On one hand, this dissertation advances SAT solving by introducing the XOR-OR-AND normal form (XNF) as a generalization of the conjunctive normal form (CNF), where literals are replaced by XOR chains of literals. This allows for a native representation of XOR constraints. We generalize the CDCL architecture to the richer language of XNFs. The underlying reasoning based on the proof system SRES which is shown to be exponentially stronger than classical resolution. An implementation demonstrates competitive performance and often surpasses state-of-the-art algebraic and logic solvers on random and cryptographic benchmarks. Furthermore, we prove that every XNF formula can be converted in polynomial time to a formula in 2-XNF, enabling a graph-based approach similar to 2-SAT. Building on this, we propose advanced in- and pre-processing techniques, and construct a simple DPLL-based solving framework. Our implementation, 2-Xornado, outperforms modern algebraic and logic solving approaches on many random and some structured cryptographic problems. On the other hand, we apply combined algebraic and logical techniques to cryptanalysis of stream ciphers. We introduce a formal guess-and-determine (GD) framework using a logical abstraction of the information flow in the internal state. From an algebraic point of view, we can then find optimal GD attacks utilizing a Gr{\"o}bner basis. As a case study, we apply this method to aid in the construction of novel fault attacks on the ciphers KCipher-2 and Enocoro-128v2. Using ad hoc methods combining algebraic and logical approaches, we show that both ciphers are vulnerable to active side-channel attacks under rather weak fault models.}, language = {en} } @article{Hofstadler2025, author = {Hofstadler, Julian}, title = {Optimal convergence rates of MCMC integration for functions with unbounded second moment}, series = {Journal of Applied Probability}, volume = {62 (2025)}, journal = {Journal of Applied Probability}, number = {3}, publisher = {Cambridge University Press}, address = {Cambridge}, doi = {10.1017/jpr.2024.108}, url = {http://nbn-resolving.de/urn:nbn:de:bvb:739-opus4-19310}, pages = {1069 -- 1075}, year = {2025}, abstract = {We study the Markov chain Monte Carlo estimator for numerical integration for func- tions that do not need to be square integrable with respect to the invariant distribution. For chains with a spectral gap we show that the absolute mean error for L^p functions, with p ∈ (1, 2), decreases like n^(1/p)-1 , which is known to be the optimal rate. This improves currently known results where an additional parameter δ > 0 appears and the convergence is of order n^((1+δ)/p)-1 .}, language = {en} } @article{ChenMuellerYokoyama2024, author = {Chen, Yijia and M{\"u}ller, Moritz and Yokoyama, Keita}, title = {A parameterized halting problem, Δ0 truth and the MRDP theorem}, series = {The Journal of Symbolic Logic (ISSN 1943-5886)}, volume = {90 (2025)}, journal = {The Journal of Symbolic Logic (ISSN 1943-5886)}, number = {2}, publisher = {Cambridge University Press}, address = {Cambridge}, issn = {1943-5886}, doi = {10.1017/jsl.2024.44}, url = {http://nbn-resolving.de/urn:nbn:de:bvb:739-opus4-19308}, pages = {483 -- 508}, year = {2024}, abstract = {We study the parameterized complexity of the problem to decide whether a given natural number n satisfies a given Δ0-formula ϕ(x); the parameter is the size of ϕ. This parameterization focusses attention on instances where n is large compared to the size of ϕ.We show unconditionally that this problem does not belong to the parameterized analogue of AC0. From this we derive that certain natural upper bounds on the complexity of our parameterized problem imply certain separations of classical complexity classes. This connection is obtained via an analysis of a parameterized halting problem. Some of these upper bounds follow assuming that IΔ0 proves the MRDP theorem in a certain weak sense.}, language = {en} } @article{GishbolinerGlockSgueglia2025, author = {Gishboliner, Lior and Glock, Stefan and Sgueglia, Amedeo}, title = {Tight Hamilton cycles with high discrepancy}, series = {Combinatorics, Probability and Computing (1469-2163)}, volume = {34 (2025)}, journal = {Combinatorics, Probability and Computing (1469-2163)}, number = {4}, publisher = {Cambridge University Press}, address = {Cambridge}, issn = {1469-2163}, doi = {10.1017/S0963548325000057}, url = {http://nbn-resolving.de/urn:nbn:de:bvb:739-opus4-19166}, pages = {565 -- 584}, year = {2025}, abstract = {In this paper, we study discrepancy questions for spanning subgraphs of k-uniform hypergraphs. Our main result is that, for any integers k ≥ 3 and r ≥ 2, any r-colouring of the edges of a k-uniform n-vertex hypergraph G with minimum (k-1)-degree δ(G) ≥ (1/2+o(1))n contains a tight Hamilton cycle with high discrepancy, that is, with at least n/r +� (n) edges of one colour. The minimum degree condition is asymptotically best possible and our theorem also implies a corresponding result for perfect matchings. Our tools combine various structural techniques such as Tur{\´a}n-type problems and hypergraph shadows with probabilistic techniques such as random walks and the nibble method. We also propose several intriguing problems for future research.}, language = {en} } @phdthesis{Hagen2025, author = {Hagen, Pamina}, title = {The 2008 Beijing Olympic Games as a City and Nation Branding Tool: An Interdisciplinary Analysis of the Image of International Opinion Leaders}, url = {http://nbn-resolving.de/urn:nbn:de:bvb:739-opus4-19052}, school = {Universit{\"a}t Passau}, pages = {339 Seiten}, year = {2025}, abstract = {This dissertation examines the 2008 Beijing Olympic Games as a tool of city and nation branding, analyzing their role within China's broader soft power strategy and their impact on international perceptions of Beijing and China. Drawing from urban geography, political geography, international relations, and marketing theory, the study explores how mega-events contribute to the construction of national identity and global image. Using a mixed-methods approach, the research combines qualitative interviews with 16 international diplomats in Beijing and an online survey of 40 foreign journalists who lived and worked in China during the Olympiad. The analysis focuses on two dimensions of image: the city of Beijing and the nation of China. The findings indicate that the 2008 Summer Olympic Games did not fundamentally alter China's international image. While the event successfully projected an image of modernization, efficiency, and confidence, pre-existing concerns about political control and human rights persisted. For Beijing, the Olympics enhanced its visibility as a global city but also highlighted tensions between its traditional identity and its modern aspirations. The media's framing played a decisive role in shaping these perceptions. Overall, the study concludes that the Beijing Olympics functioned as a significant yet limited instrument of soft power. They reinforced China's global presence and urban development goals but fell short of transforming its international reputation. The research contributes to understanding how mega-events operate as strategic tools of geopolitical communication and branding in the context of globalization.}, language = {en} } @article{RehbeinEscobariFischeretal.2025, author = {Rehbein, Malte and Escobari, Belen and Fischer, Sarah and G{\"u}ntsch, Anton and Haas, Bettina and Matheisen, Giada and Perschl, Tobias and Wieshuber, Alois and Engel, Thore}, title = {Quantitative and qualitative data on historical vertebrate distributions in Bavaria 1845}, series = {scientific data}, volume = {2025}, journal = {scientific data}, publisher = {Springer Nature}, address = {Berlin}, doi = {10.1038/s41597-025-04846-8}, url = {http://nbn-resolving.de/urn:nbn:de:101:1-2506092137360.319993244702}, pages = {13 Seiten}, year = {2025}, abstract = {Archival collections contain an underutilized wealth of biodiversity data, encapsulated in government files and other historical documents. In 1845, the Bavarian government conducted a comprehensive national survey on the occurrence of 44 selected vertebrate species across the country. The detailed expert responses from 119 forestry offices, totalling 520 handwritten pages, have been preserved in the Bavarian State Archives. In this study, we digitized, annotated, geographically referenced, and published these historical records, making them widely available as data for research and conservation planning. Our dataset, openly accessible through the Global Biodiversity Information Facility (GBIF) and Zenodo, contains 5,467 species occurrence records from 1845. Besides the binary presence/absence data, we have also published the original textual survey responses, which contain rich qualitative information, such as species abundances, population trends, habitats, forest management practices, and human-nature relationships. This information can be further processed and interpreted to address a range of questions in historical and contemporary ecology.}, language = {en} } @phdthesis{Pirwitz2024, author = {Pirwitz, Anne}, title = {Migrationsfilme als ‚kritische Heimatfilme'?}, publisher = {Akademische Verlagsgemeinschaft M{\"u}nchen}, address = {M{\"u}nchen}, doi = {10.23780/9783960916338}, url = {http://nbn-resolving.de/urn:nbn:de:101:1-2409191636377.506847991255}, school = {Universit{\"a}t Passau}, pages = {330 Seiten}, year = {2024}, abstract = {Seit dem Zusammenbruch des Kommunismus ist die Anzahl im Ausland arbeitender Rum{\"a}n*innen stark angestiegen. Inzwischen leben fast 20 \% der Bev{\"o}lkerung jenseits der Landesgrenzen. Transnationale Familien­strukturen mit in Rum{\"a}nien zur{\"u}ckgelassenen Kindern oder Eltern und pluri-lokale Lebensweisen der Migrant*innen sind in k{\"u}rzester Zeit zu einem allt{\"a}glichen Ph{\"a}nomen der rum{\"a}nischen Gesellschaft geworden. Die Auswirkungen dieser Migration sind von gesamtgesellschaftlicher Relevanz und finden daher immer wieder Eingang in Literatur, Musik und Film. Diese Medien werden dabei von realen Ereignissen inspiriert, greifen aktuelle Diskurse auf und konstruieren eigene fiktionale Wirklichkeiten. Dabei vermitteln sie bestimmte Weltbilder und bieten verschiedene Sichtweisen auf die von ihnen verhandelten Themen an. Zwischen dem Ende der kommunistischen Diktatur 1989 und 2022 entstanden 52 rum{\"a}nische fiktionale Kurz- und Spielfilme, die explizit Migration ins Zentrum ihrer erz{\"a}hlten Geschichten stellen. Der vorliegende Band untersucht, auf welche Weise die rum{\"a}nische Arbeitsmigration im postkommunistischen Film verarbeitet wird, welches Bild der rum{\"a}nischen Heimat und des ‚Westens' vermittelt wird, wie diese R{\"a}ume durch filmische Mittel {\"a}sthetisch konstruiert werden und ob es sich bei diesen Werken um eine neue Form des ‚kritischen Heimatfilms' handelt.}, subject = {Rum{\"a}nien}, language = {de} } @misc{OPUS4-1516, title = {Zeitgem{\"a}sse Methoden der Kinder- und Jugendmedienforschung}, volume = {2024}, number = {60}, editor = {Lampert, Claudia and K{\"u}hn, Jessica and Wiedel, Fabian and Fehr, Ada and Domdey, Paulina and Thiel, Kira}, publisher = {OAPublishing Collective Genossenschaft}, address = {Z{\"u}rich}, doi = {10.21240/mpaed/60.X}, url = {http://nbn-resolving.de/urn:nbn:de:bvb:739-opus4-15162}, pages = {179 Seiten}, year = {2024}, abstract = {MedienP{\"a}dagogik : Zeitschrift f{\"u}r Theorie und Praxis in der Medienbildung Themenheft 60: Zeitgem{\"a}sse Methoden der Kinder- und Jugendmedienforschung Inhalte: Malin Fecke, Ada Fehr, Daniela Schl{\"u}tz Die Mobile Experience Sampling Methode (MESM) in der Kinder- und Jugendmedienforschung Andr{\´e} Weßel ‹Jeden Abend Instagram, TikTok, YouTube› - Das digitale Medientagebuch als qualitative Forschungsmethode zur Untersuchung des Medienhandelns junger Menschen Thorsten Naab, Ruth Wendt, Alexandra Langmeyer-Tornier Messung m{\"u}tterlicher Medienerziehung f{\"u}r interaktive und nicht-interaktive Medien Thorsten Naab, Moritz Abraham Wie ein Spielzeug zum Helfer in Kinderbefragungen werden kann Sophie Mayen, Anne Reinhardt , Claudia Wilhelm Instrumente zur Messung von jugendlicher Mediennutzung Paulina Domdey, Katrin Potzel Medientageb{\"u}cher als Teil sequenzieller Triangulation in der qualitativen Forschung Franziska Koschei, Lena Schmidt, Susanne Eggert, Andreas Dertinger, Michaela Kramer, Rudolf Kammerl Forschung mit Grundsch{\"u}ler:innen Jan Pfetsch, Felix Paschel, Cora Bieß, Ingrid Stapf Forschungsethik und Kinderrechte}, language = {de} } @article{Huebenthal2024, author = {Huebenthal, Sandra}, title = {Ged{\"a}chtnis trifft Einleitung : ein neuer Blick auf alte Fragen}, series = {New Testament Studies}, volume = {70 (2024)}, journal = {New Testament Studies}, number = {2}, publisher = {Cambridge University Press}, address = {Cambridge}, doi = {10.1017/S002868852300036X}, url = {http://nbn-resolving.de/urn:nbn:de:bvb:739-opus4-19277}, pages = {131 -- 148}, year = {2024}, abstract = {Ausgehend von der kulturwissenschaftlichen Forschung zu Familienalben und deren Gemeinsamkeiten mit dem Neuen Testament l{\"a}dt dieser Beitrag dazu ein, dar{\"u}ber nachzudenken, was sich ver{\"a}ndert, wenn wir die Fragen der Einf{\"u}hrung in das Neue Testament durch die Brille der Theorie des sozialen Ged{\"a}chtnisses betrachten. Aufbauend auf Forschungsergebnissen der Oral History und kulturwissenschaftlichen Ged{\"a}chtnistheorie wird argumentiert, dass die allgemeine Einleitung in den Bereich des kulturellen Ged{\"a}chtnisses und die spezielle Einleitung in den Bereich des sozialen/kollektiven Ged{\"a}chtnisses f{\"a}llt. Beide sind durch den Floating Gap getrennt, was die vielfach wahrgenommenen Ver{\"a}nderungen in der ersten H{\"a}lfte des zweiten Jahrhunderts erkl{\"a}rt. Im n{\"a}chsten Schritt wird ein Modell, das auf dem Dreigenerationenged{\"a}chtnis, der Generational Gap (nach einer Generation), der Floating Gap (nach 3-4 Generationen) und den ersten Generationen von Jesus-Anh{\"a}ngern aufbaut, mit Vorschl{\"a}gen zur Datierung neutestamentlicher B{\"u}cher aus der Einleitungswissenschaft ins Gespr{\"a}ch gebracht. Es zeigt sich, dass die vor und nach dem Generational Gap verwendeten Genres je unterschiedliche Eigenschaften haben, die den Erwartungen an Medien des sozialen und kollektiven Ged{\"a}chtnisses entsprechen. Der Beitrag schließt mit allgemeinen Fragen zu Medien und Medienwandel im Neuen Testament, d.h. M{\"u}ndlichkeit und Schriftlichkeit, identische Texte und Textkritik, dem Kanon als prim{\"a}rem Kontext, der Ausweitung des Geltungsbereichs sowie fluiden Gattungen, und kommt zu dem Schluss, dass kulturwissenschaftliche Ged{\"a}chtnistheorie in der Tat neue Perspektiven f{\"u}r die Einleitungswissenschaft bietet.}, language = {de} } @article{ŁatuszyńskiRudolf2024, author = {Łatuszyński, Krzysztof and Rudolf, Daniel}, title = {Convergence of hybrid slice sampling via spectral gap}, series = {Advances in Applied Probability}, volume = {56 (2024)}, journal = {Advances in Applied Probability}, number = {4}, publisher = {Cambridge University Press}, address = {Cambridge}, issn = {1475-6064}, doi = {10.1017/apr.2024.16}, url = {http://nbn-resolving.de/urn:nbn:de:bvb:739-opus4-19264}, pages = {1440 -- 1466}, year = {2024}, abstract = {It is known that the simple slice sampler has robust convergence properties; however, the class of problems where it can be implemented is limited. In contrast, we consider hybrid slice samplers which are easily implementable and where another Markov chain approximately samples the uniform distribution on each slice. Under appropriate assumptions on the Markov chain on the slice, we give a lower bound and an upper bound of the spectral gap of the hybrid slice sampler in terms of the spectral gap of the simple slice sampler. An immediate consequence of this is that the spectral gap and geometric ergodicity of the hybrid slice sampler can be concluded from the spectral gap and geometric ergodicity of the simple version, which is very well understood. These results indicate that robustness properties of the simple slice sampler are inherited by (appropriately designed) easily implementable hybrid versions. We apply the developed theory and analyze a number of specific algorithms, such as the stepping-out shrinkage slice sampling, hit-and-run slice sampling on a class of multivariate targets, and an easily implementable combination of both procedures on multidimensional bimodal densities.}, language = {en} } @article{BouriSokhanvarKinatederetal.2024, author = {Bouri, Elie and Sokhanvar, Amin and Kinateder, Harald and {\c{C}}ift{\c{c}}ioğlu, Serhan}, title = {Tech titans and crypto giants : mutual returns predictability and trading strategy implications}, series = {Journal of International Financial Markets, Institutions and Money}, volume = {2025}, journal = {Journal of International Financial Markets, Institutions and Money}, number = {99}, publisher = {Elsevier}, address = {Amsterdam}, issn = {1873-0612}, doi = {10.1016/j.intfin.2024.102109}, url = {http://nbn-resolving.de/urn:nbn:de:bvb:739-opus4-19259}, pages = {30 Seiten}, year = {2024}, abstract = {This study examines the directional return predictability between the technology sector of U.S. stock market and three major cryptocurrencies (Bitcoin, Ethereum, and Dogecoin). Using daily data from August 7, 2015, to February 8, 2024, and the cross-quantilogram approach in both static and dynamic settings, the results reveal significant positive predictability in the stock market-cryptocurrency nexus. The technology sector, semiconductors subsector, and Nvidia Corporation exert predictive power over cryptocurrency returns and vice versa across several quantiles and lags. When controlling for the impact of other financial variables, namely, U.S. dollar and U.S. treasury markets, the return predictability holds, especially for the two largest cryptocurrencies, Bitcoin and Ethereum, which reflects their importance and tighter connections with the U.S. technology sector. A trading strategy based on the results of the cross-quantilograms outperforms a benchmark strategy (i.e., always long position in either stocks or cryptocurrency), which underlines the practical implications of our main findings, particularly in terms of the significant return interactions between U.S. technology/semiconductors stocks and large cryptocurrencies.}, language = {en} } @article{DrescherJanzen2024, author = {Drescher, Katharina and Janzen, Benedikt}, title = {When weather wounds workers : the impact of temperature on workplace accidents}, series = {Journal of Public Economics}, volume = {2025}, journal = {Journal of Public Economics}, number = {241}, publisher = {Elsevier}, address = {Amsterdam}, doi = {10.1016/j.jpubeco.2024.105258}, url = {http://nbn-resolving.de/urn:nbn:de:bvb:739-opus4-19241}, pages = {17 Seiten}, year = {2024}, abstract = {We study the effects of temperature on occupational health using administrative data on Swiss occupational accidents from 1996 to 2019. Our results imply that on hot days (T𝑚𝑎𝑥 ≥ 30 ◦C) the number of occupational accidents increases by 7.4\% and on ice days (T𝑚𝑎𝑥 < 0 ◦C) by 6.3\%, relative to mild days. We find that extreme temperatures cause an average of 2600 workplace accidents each year, costing CHF 91 million annually. We provide suggestive evidence for insufficient sleep on hot days as a mechanism. While extreme temperatures worsen occupational health, we observe limited labor supply adaption for most workers.}, language = {en} } @article{LechldeMeerFuermann2024, author = {Lechl, Michael and de Meer, Hermann and F{\"u}rmann, Tim}, title = {A stochastic flexibility calculus for uncertainty-aware energy flexibility management}, series = {Applied Energy}, volume = {2025}, journal = {Applied Energy}, number = {379}, doi = {10.1016/j.apenergy.2024.124907}, url = {http://nbn-resolving.de/urn:nbn:de:bvb:739-opus4-19233}, pages = {16 Seiten}, year = {2024}, abstract = {The increasing share of volatile renewables in power systems requires more reserves to balance forecast errors in renewable generation and power fluctuations. In contrast, common reserves such as gas-fired power plants are phased out, impeding the procurement of sufficient reserves. Alternative reserves, particularly on the demand side, such as battery storage systems, also exhibit some degree of freedom to deviate from their scheduled operating point to supply or consume more or less power, thus providing a flexibility potential. However, demand-side flexibility potentials are generally subject to uncertainties, and so is the generation of volatile renewables. The challenge is incorporating the uncertainties on both sides to procure sufficient (uncertain) flexibility potential in advance. Considering uncertainty is important to avoid additional, drastic measures in real-time to balance generation and demand, such as curtailing renewable generation or load shedding. This work presents a stochastic flexibility calculus that provides an indicator for computing the risk of insufficient flexibility potentials or, conversely, guarantees for sufficient flexibility potentials. Thus, the stochastic flexibility calculus contributes to overcoming the challenge of procuring sufficient flexibility potentials in renewable-based systems. An evaluation based on real data is performed using an example of a renewable energy community consisting of households equipped with photovoltaic power plants and battery storage systems. The newly introduced stochastic flexibility calculus computes the number of households that must operate their battery storage systems flexibly to balance forecast errors locally. The results show that the forecast method significantly influences this number. Some numerical results appear unexpected, as too many flexibility-friendly households can negatively impact the aggregated household flexibility potential.}, language = {en} } @article{FinkForsterHeinleinHeinrich2024, author = {Fink, Thomas and Forster-Heinlein, Brigitte and Heinrich, Florian}, title = {Rebricking frames and bases}, series = {Journal of Mathematical Analysis and Applications}, volume = {2025}, journal = {Journal of Mathematical Analysis and Applications}, publisher = {Elsevier}, address = {Amsterdam}, issn = {1096-0813}, doi = {10.1016/j.jmaa.2024.129051}, url = {http://nbn-resolving.de/urn:nbn:de:bvb:739-opus4-19227}, pages = {35 Seiten}, year = {2024}, abstract = {In 1949, Denis Gabor introduced the "complex signal" (nowadays called "analytic signal") by combining a real function fwith its Hilbert transform Hfto a complex function f+iHf. His aim was to extract phase information, an idea that has inspired techniques as the monogenic signal and the complex dual tree wavelet transform. In this manuscript, we consider two questions: When do two real-valued bases or frames {fn:n∈N} and {gn:n∈N} form a complex basis or frame of the form {fn+ign:n∈N}? And for which bounded linear operators Adoes {fn+iAfn:n∈N} form a complex-valued orthonormal basis, Riesz basis or frame, when {fn:n ∈N} is a real-valued orthonormal basis, Riesz basis or frame? We call this approach rebricking. It is well-known that the analytic signals don't span the complex vector space L2(R; C), hence H is not a rebricking operator. We give a full characterization of rebricking operators for bases, in particular orthonormal and Riesz bases, Parseval frames, and frames in general. We also examine the special case of finite dimensional vector spaces and show that we can use any real, invertible matrix for rebricking if we allow for permutations in the imaginary part.}, language = {en} } @article{KehleUrhahne2024, author = {Kehle, Laura and Urhahne, Detlef}, title = {Testing the CONIC model: The interplay of conscientiousness and interest in predicting academic effort}, series = {Learning and Instruction}, volume = {2025}, journal = {Learning and Instruction}, number = {95}, publisher = {Elsevier}, address = {Amsterdam}, issn = {1873-3263}, doi = {10.1016/j.learninstruc.2024.102050}, url = {http://nbn-resolving.de/urn:nbn:de:bvb:739-opus4-19214}, pages = {13 Seiten}, year = {2024}, abstract = {Background This report comprises two studies that more closely examined the Conscientiousness × Interest Compensation (CONIC) model by Trautwein, Nagengast, Roberts, and L{\"u}dtke (2019) under laboratory conditions. The model specifies individual and compensatory effects of conscientiousness and individual interest on academic effort. Aims This research piece examines the assumed relationships between the three core variables of the CONIC model. Samples The first study was conducted with 152 university students and the second study included 120 university students randomly distributed across two experimental conditions and one control condition. Methods In an initial modeling study, we investigated the model assumptions in two different learning contexts and tested them using structural equation modeling (SEM). In a subsequent experimental study, we manipulated the predictor variables of academic effort to either promote conscientious or interest-based learning. The group differences were examined using multigroup SEM. Results In the modeling study, interest was always and conscientiousness at least partially a positive and significant predictor of academic effort. A compensatory effect of interest and conscientiousness could not be found. In the experimental study, promoting conscientious learning resulted in interest showing up as a stronger predictor of academic effort. However, promoting interest-based learning crystallized conscientiousness as the stronger predictor of academic effort. Moreover, the compensatory effect of the two personality traits was significantly stronger in the groups where conscientiousness or interest-based learning was promoted than in the control group. Conclusions Results provide support for the CONIC model and particularly highlight the compensatory effects of conscientiousness and interest at the model's heart.}, language = {en} } @article{GoerigkKurtz2024, author = {Goerigk, Marc and Kurtz, Jannis}, title = {Data-driven prediction of relevant scenarios for robust combinatorial optimization}, series = {Computers \& Operations Research}, volume = {2025}, journal = {Computers \& Operations Research}, number = {174}, publisher = {Elsevier}, address = {Amsterdam}, issn = {1873-765X}, doi = {10.1016/j.cor.2024.106886}, url = {http://nbn-resolving.de/urn:nbn:de:bvb:739-opus4-19207}, pages = {14 Seiten}, year = {2024}, abstract = {We study iterative constraint and variable generation methods for (two-stage) robust combinatorial optimization problems with discrete uncertainty. The goal of this work is to find a set of starting scenarios that provides strong lower bounds early in the process. To this end we define the Relevant Scenario Recognition Problem (RSRP) which finds the optimal choice of scenarios which maximizes the corresponding objective value. We show for classical and two-stage robust optimization that this problem can be solved in polynomial time if the number of selected scenarios is constant and NP-hard if it is part of the input. Furthermore, we derive a linear mixed-integer programming formulation for the problem in both cases. Since solving the RSRP is not possible in reasonable time, we propose a machine-learning-based heuristic to determine a good set of starting scenarios. To this end, we design a set of dimension-independent features, and train a Random Forest Classifier on already solved small-dimensional instances of the problem. Our experiments show that our method is able to improve the solution process even for larger instances than contained in the training set, and that predicting even a small number of good starting scenarios can considerably reduce the optimality gap. Additionally, our method provides a feature importance score which can give new insights into the role of scenario properties in robust optimization.}, language = {en} } @article{BaumannPfretzschnerRutter2024, author = {Baumann, Jakob and Pfretzschner, Matthias and Rutter, Ignaz}, title = {Parameterized complexity of vertex splitting to pathwidth at most 1}, series = {Theoretical Computer Science}, volume = {2024}, journal = {Theoretical Computer Science}, number = {1021}, publisher = {Elsevier}, address = {Amsterdam}, issn = {1879-2294}, doi = {10.1016/j.tcs.2024.114928}, url = {http://nbn-resolving.de/urn:nbn:de:bvb:739-opus4-19195}, pages = {15 Seiten}, year = {2024}, abstract = {Motivated by the planarization of 2-layered straight-line drawings, we consider the problem of modifying a graph such that the resulting graph has pathwidth at most 1. The problem Pathwidth-One Vertex Explosion (POVE) asks whether such a graph can be obtained using at most 𝑘 vertex explosions, where a vertex explosion replaces a vertex 𝑣 by deg(𝑣) degree-1 vertices, each incident to exactly one edge that was originally incident to 𝑣. For POVE, we give an FPT algorithm with running time 𝑂(4𝑘 ⋅ 𝑚) and an 𝑂(𝑘2) kernel, thereby improving over the 𝑂(𝑘6) kernel by Ahmed et al. [2] in a more general setting. Similarly, a vertex split replaces a vertex 𝑣 by two distinct vertices 𝑣1 and 𝑣2 and distributes the edges originally incident to 𝑣 arbitrarily to 𝑣1 and 𝑣2. Analogously to POVE, we define the problem variant Pathwidth-One Vertex Splitting (POVS) that uses the split operation instead of vertex explosions. Here we obtain a linear kernel and an algorithm with running time 𝑂((6𝑘 + 12)𝑘 ⋅ 𝑚). This answers an open question by Ahmed et al. [2]. Finally, we consider the problem Π-VertexSplitting (Π-VS), which generalizes the problem POVS and asks whether a given graph can be turned into a graph of a specific graph class Π using at most 𝑘 vertex splits. For graph classes Π that can be dfined in monadic second-order graph logic (MSO2), we show that the problem Π-VS can be expressed as an MSO2 formula, resulting in an FPT algorithm for Π-VS parameterized by 𝑘 if Π additionally has bounded treewidth. We obtain the same result for the problem variant using vertex explosions. [2] R. Ahmed, S.G. Kobourov, M. Kryven, An FPT algorithm for bipartite vertex splitting, in: P. Angelini, R. von Hanxleden (Eds.), Graph Drawing and Network Visualization -30th International Symposium, GD 2022, in: Lecture Notes in Computer Science, vol.13764, Springer, 2022, pp.261--268.}, language = {en} } @article{KreuzerMiasnikovWalsh2024, author = {Kreuzer, Martin and Miasnikov, Alexei and Walsh, Florian}, title = {Decomposing finite Z-algebras}, series = {Journal of Algebra}, volume = {2025}, journal = {Journal of Algebra}, number = {664 B}, publisher = {Elsevier}, address = {Amsterdam}, issn = {1090-266X}, doi = {10.1016/j.jalgebra.2024.10.027}, url = {http://nbn-resolving.de/urn:nbn:de:bvb:739-opus4-19184}, pages = {206 -- 246}, year = {2024}, abstract = {For a finite Z-algebra R, i.e., for a ring which is not necessarily associative or unitary, but whose additive group is finitely generated, we construct a decomposition of R/Ann(R) into directly indecomposable factors under weak hypotheses. The method is based on constructing and decomposing a ring of scalarsS, and then lifting the decomposition ofSto the bilinear map given by the multiplication of R, and finally to R/Ann(R). All steps of the construction are given as explicit algorithms and it is shown that the entire procedure has a probabilistic polynomial time complexity in the bit size of the input, except for the possible need to calculate the prime factorization of an integer. In particular, in the case when Ann(R)=0, these algorithms compute direct decompositions of R into directly indecomposable factors.}, language = {en} } @article{StoffelsFaltermaierStrunketal.2024, author = {Stoffels, Dominik and Faltermaier, Stefan and Strunk, Kim Simon and Fiedler, Marina}, title = {Guiding computationally intensive theory development with explainable artificial intelligence: The case of shapley additive explanations}, series = {Journal of Information Technology (ISSN: 1466-4437)}, volume = {40}, journal = {Journal of Information Technology (ISSN: 1466-4437)}, number = {2}, publisher = {SAGE Publications}, address = {London, England}, issn = {0268-3962}, doi = {10.1177/02683962241289597}, url = {http://nbn-resolving.de/urn:nbn:de:bvb:739-opus4-16762}, pages = {180 -- 213}, year = {2024}, abstract = {This study advances the field of Computationally Intensive Theory Development (CTD) by examining the capabilities of Explainable Artificial Intelligence (XAI), in particular SHapley Additive exPlanations (SHAP), for theory development, while providing guidelines for this process. We evaluate SHAP's methodological abilities and develop a structured approach for using SHAP to harness insights from black-box predictive models. For this purpose, we leverage a dual-methodological approach. First, to assess SHAP's capabilities in uncovering patterns that shape a phenomenon, we conduct a Monte-Carlo simulation study. Second, to illustrate and guide the theory development process with SHAP for CTD, we apply SHAP in a use-case using real-world data. Based on these analyses, we propose a stepwise uniform and replicable approach giving guidance that can benefit rigorous theory development and increase the traceability of the theorizing process. With our structured approach, we contribute to the use of XAI approaches in research and, by uncovering patterns in black-box prediction models, add to the ongoing search for next-generation theorizing methods in the field of Information Systems (IS).}, subject = {-}, language = {en} } @article{RyzhovaToepfl2024, author = {Ryzhova, Anna and Toepfl, Florian}, title = {The Consequences of Evidence- Versus Non-Evidence-Based Understandings of the "Truth": How Russian Speakers in Germany Negotiate Trust in Their Transnational News Environments}, series = {The International Journal of Press/Politics (ISSN: 1940-1620)}, volume = {30}, journal = {The International Journal of Press/Politics (ISSN: 1940-1620)}, number = {1}, publisher = {SAGE Publications}, address = {Los Angeles, CA}, issn = {1940-1612}, doi = {10.1177/19401612241257872}, url = {http://nbn-resolving.de/urn:nbn:de:bvb:739-opus4-16795}, pages = {326 -- 345}, year = {2024}, abstract = {Extant research on migrants' media use and trust has delivered mixed evidence on whether, and in which ways, migrants stay loyal to their homeland news media and/or develop trust in host-society media, particularly when the narratives of the two types of media clash. To advance this strand of research, this study scrutinizes how an audience group with migration background, who lived the first part of their lives under authoritarian rule but then relocated to a democracy, negotiates trust in their multilingual, transnational news environments. Specifically, we conducted semi-structured interviews with forty-two Russian-speaking first-generation migrants living in Germany in 2021. As we find, distinct understandings of the concept of "truth" played a pivotal role in how our participants negotiated trust in their transnational news environments. We distinguish broadly two understandings of "truth": (1) "truth" as a category grounded in factual evidence and (2) "truth" as a non-evidence based category grounded in values, emotions, or identities. Illustrative for the second understanding, some participants felt a strong moral obligation to believe Kremlin-sponsored media as they perceived these organizations as representing their homeland, independently of whether their news coverage was factually accurate or not. The two understandings of "truth" also affected how and where participants sought for what they considered the "truth." In the "Discussion" section, we argue that particularly the non-evidence-based truth-understandings formulated by our participants, and the ensuing truth-seeking strategies are conducive to the reach and persuasive impact of Kremlin-sponsored content among Russian speakers living abroad.}, subject = {-}, language = {en} }