@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} } @article{BeselerToepfl2024, author = {Beseler, Arista and Toepfl, Florian}, title = {Conduits of the Kremlin's Informational Influence Abroad? How German-Language Alternative Media Outlets Are Connected to Russia's Ruling Elites}, series = {The International Journal of Press/Politics (ISSN: 1940-1620)}, volume = {30}, journal = {The International Journal of Press/Politics (ISSN: 1940-1620)}, number = {3}, publisher = {SAGE Publications}, address = {Los Angeles, CA}, issn = {1940-1612}, doi = {10.1177/19401612241230284}, url = {http://nbn-resolving.de/urn:nbn:de:bvb:739-opus4-16755}, pages = {659 -- 678}, year = {2024}, abstract = {Extant research on alternative media in Western democracies has focused on scrutinizing their content, organization, production, and audiences. However, the extent to which alternative outlets are linked to powerful foreign actors has not yet been analyzed, despite the fact that a plethora of outlets have openly sided with Russia after its full-scale invasion of Ukraine in February 2022, spreading the Kremlin's propagandistic narratives. To fill this gap, this study adopts a case study approach. It selects Germany as a revelatory case of a key target country of Russia's foreign influence efforts, raising the question of how and to what extent German-language alternative media outlets are connected to Russia's ruling elites. Grounded in qualitative analysis of a wide range of documents, this study proposes a categorization that divides the connections into three different types: organizational, media, and personal connections. Subsequently, it is demonstrated that half of the analyzed German-language alternative media outlets maintain at least one of these three types of connections to the Kremlin. These findings contribute to our knowledge of alternative media, as well as Russia's overt and covert foreign influence operations, the so-called "active measures." They also highlight the need for more transparency in alternative media landscapes in democratic contexts across the globe.}, subject = {-}, language = {en} } @phdthesis{Fellicious2025, author = {Fellicious, Christofer}, title = {Bridging the gap: Applying machine learning techniques in digital forensics}, url = {http://nbn-resolving.de/urn:nbn:de:bvb:739-opus4-18473}, school = {Universit{\"a}t Passau}, pages = {112 Seiten}, year = {2025}, abstract = {With the increasing adoption of virtualization technologies across various industries, virtual machines (VMs) offer cost-effective solutions for obtaining computing power without the burden of initial investment or ongoing maintenance. However, the widespread use of VMs also increases the risk of malicious actors attempting to gain unauthorized access due to the possibility of accessing the VMs via standard internet protocols. Virtual Machine Introspection (VMI) and Forensic Memory Analysis (FMA) are two key cybersecurity methods for addressing these threats. While FMA leverages digital forensic techniques to extract and analyse information from system memory to explain security incidents, VMI typically works with live systems, analysing running processes to detect real-time threats. Both approaches face a significant challenge known as the "semantic gap," which arises from the need to infer high-level system information from low-level data such as physical memory and CPU registers. This dissertation explores using machine learning to bridge the semantic gap in FMA and VMI applications. The research uses OpenSSH process heap dumps as a use-case to extract high-level structures, such as OpenSSH encryption keys, from raw process memory dumps. The study employs various techniques to isolate relevant memory sections, from basic memory chunking and entropy analysis to more advanced methods utilizing pointers and malloc headers. During this research study, we also identified the need for a foundation model in memory forensics. Foundation models are general purpose models trained on large amounts of data and users can later use these models to perform different tasks by finetuning the model. This research also addresses the challenge of detecting malware by analysing system-level API calls and employing custom feature engineering techniques. Given that the threat landscape is constantly evolving, we also investigate concept drift — a phenomenon where input data distribution changes affect predictive models' performance. To mitigate the degradation in performance due to concept drift, we introduce a concept drift detection algorithm complemented by a custom sampling method that optimizes training data selection. This approach reduces the training dataset size by one-third, enhancing the efficiency of model training while maintaining high performance.}, language = {en} } @article{GlockMunhaCorreiaSudakov2024, author = {Glock, Stefan and Munh{\´a} Correia, David and Sudakov, Benny}, title = {Hamilton cycles in pseudorandom graphs}, series = {Advances in Mathematics}, volume = {2024}, journal = {Advances in Mathematics}, number = {458 B}, publisher = {Elsevier}, address = {Amsterdam}, doi = {10.1016/j.aim.2024.109984}, url = {http://nbn-resolving.de/urn:nbn:de:bvb:739-opus4-19151}, pages = {45 Seiten}, year = {2024}, abstract = {Finding general conditions which ensure that a graph is Hamiltonian is a central topic in graph theory. An old and well-known conjecture in the area states that any d-regular n-vertex graph G whose second largest eigenvalue in absolute value λ(G) is at most d/C, for some universal constant C > 0, has a Hamilton cycle. In this paper, we obtain two main results which make substantial progress towards this problem. Firstly, we settle this conjecture in full when the degree d is at least a small power of n. Secondly, in the general case we show that λ(G) ≤ d/C(log n)1/3 implies the existence of a Hamilton cycle, improving the 20-year old bound of d/ log1-o(1) n of Krivelevich and Sudakov. We use in a novel way a variety of methods, such as a robust P{\´o}sa rotation-extension technique, the Friedman-Pippenger tree embedding with rollbacks and the absorbing method, combined with additional tools and ideas. Our results have several interesting applications. In particular, they imply the currently best-known bounds on the number of generators which guarantee the Hamiltonicity of random Cayley graphs, which is an important partial case of the well known Hamiltonicity conjecture of Lov{\´a}sz. They can also be used to improve a result of Alon and Bourgain on additive patterns in multiplicative subgroups.}, language = {en} } @article{EpperleinWirth2024, author = {Epperlein, Jeremias and Wirth, Fabian}, title = {The joint spectral radius is pointwise H{\"o}lder continuous}, series = {Linear Algebra and its Applications}, volume = {2025}, journal = {Linear Algebra and its Applications}, number = {704}, publisher = {Elsevier}, address = {Amsterdam}, issn = {1873-1856}, doi = {10.1016/j.laa.2024.09.016}, url = {http://nbn-resolving.de/urn:nbn:de:bvb:739-opus4-19140}, pages = {92 -- 122}, year = {2024}, abstract = {We show that the joint spectral radius is pointwise H{\"o}lder continuous. In addition, the joint spectral radius is locally H{\"o}lder continuous for ε-inflations. In the two-dimensional case, local H{\"o}lder continuity holds on the matrix sets with positive joint spectral radius.}, language = {en} } @article{KreuzerLinhLong2024, author = {Kreuzer, Martin and Linh, Tran N. K. and Long, Le N.}, title = {Differential theory of zero-dimensional schemes}, series = {Journal of Pure and Applied Algebra}, volume = {229 (2025)}, journal = {Journal of Pure and Applied Algebra}, number = {1}, publisher = {Elsevier}, address = {Amsterdam}, issn = {1873-1376}, doi = {10.1016/j.jpaa.2024.107815}, url = {http://nbn-resolving.de/urn:nbn:de:bvb:739-opus4-19130}, pages = {31 Seiten}, year = {2024}, abstract = {To study a 0-dimensional scheme |X in |P^n over a perfect field K, we use the module of K{\"a}hler differentials (Omega)(^1)(_{R/K}) of its homogeneous coordinate ring R and its exterior powers, the higher modules of K{\"a}hler differentials (Omega)(^m)(_{R/K}). One of our main results is a characterization of weakly curvilinear schemes |X by the Hilbert polynomials of the modules (Omega)(^m)(_{R/K}) which allows us to check this property algorithmically without computing the primary decomposition of the vanishing ideal of |X. Further main achievements are precise formulas for the Hilbert functions and Hilbert polynomials of the modules (Omega)(^m)(_{R/K}) for a fat point scheme |X which extend and settle previous partial results and conjectures. Underlying these results is a novel method: we first embed the homogeneous coordinate ring R into its truncated integral closure ~R. Then we use the corresponding map from the module of K{\"a}hler differentials (Omega)(^1)(_{R/K}) to (Omega)(^1)(_{~R/K}) to find a formula for the Hilbert polynomial HP((Omega)(^1)(_{R/K})) and a sharp bound for the regularity index ri((Omega)(^1)(_{R/K})). Next we extend this to formulas for the Hilbert polynomials HP((Omega)(^m)(_{R/K})) and bounds for the regularity indices of the higher modules of K{\"a}hler differentials. As a further application, we characterize uniformity conditions on |X using the Hilbert functions of the K{\"a}hler differential modules of |X and its subschemes.}, language = {en} } @article{DaschnerObermaier2022, author = {Daschner, Stefan and Obermaier, Robert}, title = {Algorithm aversion? On the influence of advice accuracy on trust in algorithmic advice}, series = {Journal of Decision Systems}, volume = {31 (2022)}, journal = {Journal of Decision Systems}, number = {S1}, publisher = {Taylor \& Francis}, address = {London}, doi = {10.1080/12460125.2022.2070951}, url = {http://nbn-resolving.de/urn:nbn:de:bvb:739-opus4-19120}, pages = {77 -- 97}, year = {2022}, abstract = {There is empirical evidence that decision makers show negative behaviours towards algorithmic advice compared to human advice, termed as algorithm aversion. Taking a trust theoretical perspective, this study broadens the quite monolithic view on behaviour to its cognitive antecedent: cognitive trust, i.e. trusting beliefs and trusting intentions. We examine initial trust (cognitive trust and behaviour) as well as its development after performance feedback by conducting an online experiment that asked participants to forecast the expected demand for a product. Advice accuracy was manipulated by ± 5 \% relative to the participant's initial forecasting accuracy determined in a pre-test. Results show that initial behaviour towards algorithmic advice is not influenced by cognitive trust. Furthermore, the decision maker's initial forecasting accuracy indicates a threshold between near-perfect and bad advice. When advice accuracy is at this threshold, we observe behavioural algorithm appreciation, particularly due to higher trusting integrity beliefs in algorithmic advice.}, language = {en} } @article{ToepflKravetsRyzhovaetal.2022, author = {T{\"o}pfl, Florian and Kravets, Daria and Ryzhova, Anna and Beseler, Arista}, title = {Who are the plotters behind the pandemic?}, series = {Information, Communication \& Society}, volume = {26 (2023)}, journal = {Information, Communication \& Society}, number = {10}, publisher = {Taylor \& Francis}, address = {London}, doi = {10.1080/1369118X.2022.2065213}, url = {http://nbn-resolving.de/urn:nbn:de:bvb:739-opus4-19119}, pages = {2033 -- 2051}, year = {2022}, abstract = {This article advances extant research that has audited search algorithms for misinformation in four respects. Firstly, this is the first misinformation audit not to implement a national but a cross-national research design. Secondly, it retrieves results not in response to the most popular query terms. Instead, it theorizes two semantic dimensions of search terms and illustrates how they impact the number of misinformative results returned. Furthermore, the analysis not only captures the mere presence of misinformative content but in addition whether the source websites are affiliated with a key misinformation actor (Russia's ruling elites) and whom the conspiracy narratives cast as the malicious plotters. Empirically, the audit compares Covid-19 conspiracy theories in Google search results across 5 key target countries of Russia's foreign communication (Belarus, Estonia, Germany, Ukraine, and the US) and Russia as of November 2020 (N = 5280 search results). It finds that, across all countries, primarily content published by mass media organizations rendered conspiracy theories visible in search results. Conspiratorial content published on websites affiliated with Russia's ruling elites was retrieved in the Belarusian, German and Russian contexts. Across all countries, the majority of conspiracy narratives suspected plotters from China. Malicious actors from the US were insinuated exclusively by sources affiliated with Russia's elites. Overall, conspiracy narratives did not primarily deepen divides within but between national communities, since - across all countries - only plotters from beyond the national borders were blamed. To conclude, the article discusses methodological advice and promising paths of research for future cross-national search engine audits.}, language = {en} } @article{FekihHassenSchoppikSchieggetal.2024, author = {Fekih Hassen, Wiem and Schoppik, Luis and Schiegg, Sascha and Gerl, Armin}, title = {Power management approach of hybrid energy storage system for electric vehicle charging stations}, series = {Smart Cities}, volume = {7 (2024)}, journal = {Smart Cities}, number = {6}, publisher = {MDPI}, address = {Basel}, issn = {2624-6511}, doi = {10.3390/smartcities7060156}, url = {http://nbn-resolving.de/urn:nbn:de:bvb:m347-opus-6045}, pages = {4025 -- 4051}, year = {2024}, abstract = {The applicability of Hybrid Energy Storage Systems (HESSs) has been shown in multiple application fields, such as Charging Stations (CSs), grid services, and microgrids. HESSs consist of an integration of two or more single Energy Storage Systems (ESSs) to combine the benefits of each ESS and improve the overall system performance. In this work, we propose a novel power management controller called the Hybrid Controller for the efficient HESS's charging and discharging, considering the State of Charge (SoC) of the HESS and the dynamic supply and load. The Hybrid Controller optimises the use of the HESS, i.e., minimises the amount of energy drawn from and discharged to the grid, thus utilising and prioritising the provided Photovoltaic (PV) power. The performance of our proposal was assessed via simulation using various evaluation metrics, i.e., Autarky, charge/discharge cycle, and Self-Consumption (SC), where we defined 24 scenarios in different locations in Germany.}, language = {en} } @article{ZubaerGranitzerMitrović2023, author = {Zubaer, Abdullah Al and Granitzer, Michael and Mitrović, Jelena}, title = {Performance analysis of large language models in the domain of legal argument mining}, series = {Frontiers in Artificial Intelligence}, volume = {2023}, journal = {Frontiers in Artificial Intelligence}, number = {6}, publisher = {Frontiers}, address = {Lausanne}, issn = {2624-8212}, doi = {10.3389/frai.2023.1278796}, url = {http://nbn-resolving.de/urn:nbn:de:bvb:739-opus4-18326}, pages = {18 Seiten}, year = {2023}, abstract = {Generative pre-trained transformers (GPT) have recently demonstrated excellent performance in various natural language tasks. The development of ChatGPT and the recently released GPT-4 model has shown competence in solving complex and higher-order reasoning tasks without further training or fine-tuning. However, the applicability and strength of these models in classifying legal texts in the context of argument mining are yet to be realized and have not been tested thoroughly. In this study, we investigate the effectiveness of GPT-like models, specifically GPT-3.5 and GPT-4, for argument mining via prompting. We closely study the model's performance considering diverse prompt formulation and example selection in the prompt via semantic search using state-of-the-art embedding models from OpenAI and sentence transformers. We primarily concentrate on the argument component classification task on the legal corpus from the European Court of Human Rights. To address these models' inherent non-deterministic nature and make our result statistically sound, we conducted 5-fold cross-validation on the test set. Our experiments demonstrate, quite surprisingly, that relatively small domain-specific models outperform GPT 3.5 and GPT-4 in the F1-score for premise and conclusion classes, with 1.9\% and 12\% improvements, respectively. We hypothesize that the performance drop indirectly reflects the complexity of the structure in the dataset, which we verify through prompt and data analysis. Nevertheless, our results demonstrate a noteworthy variation in the performance of GPT models based on prompt formulation. We observe comparable performance between the two embedding models, with a slight improvement in the local model's ability for prompt selection. This suggests that local models are as semantically rich as the embeddings from the OpenAI model. Our results indicate that the structure of prompts significantly impacts the performance of GPT models and should be considered when designing them.}, language = {en} } @article{HacklMuellerGranitzeretal.2023, author = {Hackl, Veronika and M{\"u}ller, Alexandra Elena and Granitzer, Michael and Sailer, Maximilian}, title = {Is GPT-4 a reliable rater? Evaluating consistency in GPT-4's text ratings}, series = {Frontiers in Education}, volume = {2023}, journal = {Frontiers in Education}, number = {8}, publisher = {Frontiers}, address = {Lausanne}, issn = {2504-284X}, doi = {10.3389/feduc.2023.1272229}, url = {http://nbn-resolving.de/urn:nbn:de:bvb:739-opus4-18348}, pages = {8 Seiten}, year = {2023}, abstract = {This study reports the Intraclass Correlation Coefficients of feedback ratings produced by OpenAI's GPT-4, a large language model (LLM), across various iterations, time frames, and stylistic variations. The model was used to rate responses to tasks related to macroeconomics in higher education (HE), based on their content and style. Statistical analysis was performed to determine the absolute agreement and consistency of ratings in all iterations, and the correlation between the ratings in terms of content and style. The findings revealed high interrater reliability, with ICC scores ranging from 0.94 to 0.99 for different time periods, indicating that GPT-4 is capable of producing consistent ratings. The prompt used in this study is also presented and explained.}, language = {en} } @inproceedings{BergerRodriguesReiseretal.2024, author = {Berger, Christian and Rodrigues, L{\´i}vio and Reiser, Hans P. and Cogo, Vin{\´i}cius and Bessani, Alysson}, title = {Chasing lightspeed consensus}, series = {Middleware '24: Proceedings of the 25th International Middleware Conference}, volume = {2024}, booktitle = {Middleware '24: Proceedings of the 25th International Middleware Conference}, publisher = {ACM}, address = {New York}, isbn = {979-8-4007-0623-3}, doi = {10.1145/3652892.3700756}, url = {http://nbn-resolving.de/urn:nbn:de:bvb:739-opus4-19106}, pages = {158 -- 171}, year = {2024}, abstract = {Blockchain technology sparked renewed interest in planetary-scale Byzantine fault-tolerant (BFT) state machine replication (SMR). While recent works predominantly focused on improving the scalability and throughput of these protocols, few of them addressed latency. We present Mercury, a novel transformation to autonomously optimize the latency of quorum-based BFT consensus. Mercury employs a dual resilience threshold that enables faster transaction ordering when the system contains few faulty replicas. Mercury allows forming compact quorums that substantially accelerate consensus using a smaller resilience threshold. Nevertheless, Mercury upholds standard SMR safety and liveness guarantees with optimal resilience, thanks to its judicious use of a dual operation mode and BFT forensics techniques. Our experiments spread tens of replicas across continents and reveal that Mercury can order transactions with finality in less than 0.4s, half the time of a PBFT-like protocol (optimal in terms of number of communication steps and resilience) in the same network. Furthermore, Mercury matches the latency of running its base protocol on theoretically optimal internet links (transmitting at 67\% of the speed of light).}, language = {en} } @book{OPUS4-1908, title = {African data protection laws}, series = {Global and comparative data law (edited by Moritz Hennemann; Lea Katharina Kumkar; Linda Kuschel; Bj{\"o}rn Steinr{\"o}tter)}, volume = {2024}, journal = {Global and comparative data law (edited by Moritz Hennemann; Lea Katharina Kumkar; Linda Kuschel; Bj{\"o}rn Steinr{\"o}tter)}, number = {volume 3}, editor = {Atuguba, Raymond and Hennemann, Moritz and Boshe, Patricia and Dei-Tutu, Sena Afua}, publisher = {Walter de Gruyter}, address = {Berlin/Boston}, doi = {10.1515/9783110797909}, url = {http://nbn-resolving.de/urn:nbn:de:101:1-2404231639273.359651152421}, publisher = {Universit{\"a}t Passau}, pages = {X, 213 Seiten}, year = {2024}, subject = {Afrika}, language = {en} } @article{Bach2024, author = {Bach, Maurizio}, title = {Effektiveres Pandemiemanagement durch sozialwissenschaftliche Politikberatung? Ein kritischer Kommentar zu J{\"o}rn Knoblochs Beitrag in Heft 4/2023}, series = {Berliner Journal f{\"u}r Soziologie (ISSN: 1862-2593)}, volume = {34}, journal = {Berliner Journal f{\"u}r Soziologie (ISSN: 1862-2593)}, number = {3}, publisher = {Springer Fachmedien}, address = {Wiesbaden}, issn = {0863-1808}, doi = {10.1007/s11609-024-00535-2}, url = {http://nbn-resolving.de/urn:nbn:de:101:1-2412102126103.260519352471}, pages = {443 -- 460}, year = {2024}, abstract = {Der Kommentar setzt sich kritisch mit J{\"o}rn Knoblochs Analyse des Corona-Pandemiemanagements in Deutschland auseinander. Er hinterfragt die Behauptung Knoblochs, durch eine st{\"a}rkere Ber{\"u}cksichtigung von Sozialwissenschaftlern in den einschl{\"a}gigen Beratungsgremien h{\"a}tte eine effektivere Krisenbew{\"a}ltigung erreicht werden k{\"o}nnen. Der Beitrag fokussiert zum einen die strukturellen epistemischen Grenzen sowohl der biomedizinischen Wissenschaften als auch der empirischen Sozialforschung. Zum anderen beleuchtet er die Eigenlogik politischer Entscheidungsprozesse, die durch die Notwendigkeit der Unsicherheitsabsorption und Systemstabilisierung gepr{\"a}gt sind und gegen{\"u}ber externen Einfl{\"u}ssen als relativ immun erscheinen. Der Beitrag pl{\"a}diert f{\"u}r eine differenzierte Betrachtung der Schnittstelle zwischen wissenschaftlicher Beratung und politischer Praxis und mahnt eine kritische Reflexion der Rolle und der Grenzen der wissenschaftsgest{\"u}tzten Politikberatung an.}, subject = {-}, language = {de} } @article{AndraschkoDannerKreuzer2024, author = {Andraschko, Bernhard and Danner, Julian and Kreuzer, Martin}, title = {SAT Solving Using XOR-OR-AND Normal Forms}, series = {Mathematics in Computer Science (ISSN: 1661-8289)}, volume = {18}, journal = {Mathematics in Computer Science (ISSN: 1661-8289)}, number = {4}, publisher = {Springer International Publishing}, address = {Cham}, issn = {1661-8270}, doi = {10.1007/s11786-024-00594-x}, url = {http://nbn-resolving.de/urn:nbn:de:101:1-2502242130589.859216082138}, pages = {26 Seiten}, year = {2024}, abstract = {This paper introduces the XOR-OR-AND normal form (XNF) for logical formulas. It is a generalization of the well-known Conjunctive Normal Form (CNF) where literals are replaced by XORs of literals. As a first theoretic result, we show that every CNF formula is equisatisfiable to a formula in 2-XNF, i.e., a formula in XNF where each clause involves at most two XORs of literals. Subsequently, we present an algorithm which converts Boolean polynomials efficiently from their Algebraic Normal Form (ANF) to formulas in 2-XNF. Experiments with the cipher ASCON-128 show that cryptographic problems, which by design are based strongly on XOR-operations, can be represented using far fewer variables and clauses in 2-XNF than in CNF. In order to take advantage of this compact representation, new SAT solvers based on input formulas in 2-XNF need to be designed. By taking inspiration from graph-based 2-CNF SAT solving, we devise a new DPLL-based SAT solver for formulas in 2-XNF. Among others, we present advanced pre- and in-processing techniques. Finally, we give timings for random 2-XNF instances and instances related to key recovery attacks on round reduced ASCON-128, where our solver outperforms state-of-the-art alternative solving approaches.}, subject = {-}, language = {en} } @article{Heinrich2024, author = {Heinrich, Horst-Alfred}, title = {Partizipationsvorstellungen von B{\"u}rger:innen: Eine explorative Anwendung der Draw\&Write-Technik als Survey-Instrument}, series = {Zeitschrift f{\"u}r Politikwissenschaft (ISSN: 2366-2638)}, volume = {34}, journal = {Zeitschrift f{\"u}r Politikwissenschaft (ISSN: 2366-2638)}, number = {3}, publisher = {Springer Fachmedien}, address = {Wiesbaden}, issn = {1430-6387}, doi = {10.1007/s41358-024-00378-6}, url = {http://nbn-resolving.de/urn:nbn:de:101:1-2412202107197.782688552245}, pages = {425 -- 445}, year = {2024}, abstract = {In einer bayernweiten postalischen Umfrage wurden unter Anwendung der Draw\&Write -Technik die Zielpersonen gebeten, ihre Vorstellung von Demokratie zu zeichnen. Eine Bildtypenanalyse ergab zwar, dass die Bilder im erhobenen Datensatz die große Bedeutung best{\"a}tigen, die der Wahl in der Demokratie zukommt. Doch f{\"u}hrt die in diesem Bereich neue Methode zu beachtlichen Differenzen verglichen mit den Ergebnissen standardisierter Umfragen. Der Mehrwert der Draw\&Write -Technik zeigt sich darin, dass das Datenmaterial nicht nur die bekannten Kategorien der repr{\"a}sentativen, direktdemokratischen, deliberativen oder demonstrativen Beteiligung spiegelt. Ein Teil der Zeichnungen wurde zwei weiteren Kategorien zugeordnet: 1) Klagen {\"u}ber empfundene Ohnmacht und Einflusslosigkeit angesichts eines repr{\"a}sentativen Herrschaftssystems sowie 2) Appelle an Konsensf{\"a}higkeit und die Bereitschaft zur Verantwortungs{\"u}bernahme als Bedingungen, die die B{\"u}rger:innen erf{\"u}llen m{\"u}ssen, wenn Beteiligung am politischen Prozess gelingen soll. Weiterhin ist das Ergebnis von großem Wert, weil das Zeichnen im Rahmen eines postalischen Surveys genutzt wurde. Ein Bias besteht lediglich hinsichtlich der Bildungsvariable, was aber auch bei der Anwendung offener Fragen zu erwarten w{\"a}re.}, subject = {-}, language = {de} } @article{Rieger2024, author = {Rieger, Eva}, title = {A Manchurian Candidate? The GOP's Discourse on the Russian War in Ukraine}, series = {Politische Vierteljahresschrift (ISSN: 1862-2860)}, volume = {66}, journal = {Politische Vierteljahresschrift (ISSN: 1862-2860)}, number = {1}, publisher = {Springer Fachmedien}, address = {Wiesbaden}, issn = {0032-3470}, doi = {10.1007/s11615-024-00558-7}, url = {http://nbn-resolving.de/urn:nbn:de:101:1-2411132119230.713822872360}, pages = {77 -- 99}, year = {2024}, abstract = {The United States has a longstanding tradition regarding its overall foreign policy, in the form of a bipartisan consensus. This includes—among other things—maintaining alliances and curbing the influence of rivals (e.g., Russia). Since this consensus has been in place, traditionally the Republican Party (GOP) has been especially intent on a less cooperative and more containing or deterring stance towards Russia. With former U.S. President Donald Trump, we can see a turning point in this behaviour by the GOP. Trump's obvious admiration for Russian president Putin and his statements about Putin being overly favourable, while simultaneously questioning NATO and the United States' commitment to defend Eastern European partners, show a distinctive shift in the GOP's discourse. This renunciation has subsequently been picked up by parts of the Republican Party, rendering the bipartisan consensus a contested issue. The full-scale Russian invasion of Ukraine in February 2022 now constitutes an important external shock influencing said discursive shift. By drawing on discourse-bound identity theory and discourse analysis, the GOP's discourse regarding Russia and NATO is expected to have (substantially) changed in a kind of Zeitenwende —back towards the bipartisan consensus. This article will, therefore, analyse the statements of prominent Republicans after the Russian invasion, compare them to Trump's positions on these issues, and identify whether the invasion serves as a formative event that creates an overall shift in rhetoric and positions.}, subject = {-}, language = {en} } @book{OPUS4-1906, title = {Data disclosure}, series = {Global and comparative data law (edited by Moritz Hennemann; Lea Katharina Kumkar; Linda Kuschel; Bj{\"o}rn Steinr{\"o}tter)}, volume = {2023}, journal = {Global and comparative data law (edited by Moritz Hennemann; Lea Katharina Kumkar; Linda Kuschel; Bj{\"o}rn Steinr{\"o}tter)}, number = {volume 2}, editor = {Hennemann, Moritz and Lewinski, Kai von and Wawra, Daniela and Widjaja, Thomas}, publisher = {Walter de Gruyter}, address = {Berlin/Boston}, doi = {10.1515/9783111010601-001}, url = {http://nbn-resolving.de/urn:nbn:de:101:1-2023031216403784842331}, publisher = {Universit{\"a}t Passau}, pages = {XI, 215 Seiten}, year = {2023}, subject = {Personenbezogene Daten}, language = {en} } @article{GoerigkKhosravi2024, author = {Goerigk, Marc and Khosravi, Mohammad}, title = {Robust combinatorial optimization problems under budgeted interdiction uncertainty}, series = {OR Spectrum (ISSN: 1436-6304)}, volume = {47}, journal = {OR Spectrum (ISSN: 1436-6304)}, number = {1}, publisher = {Springer}, address = {Berlin/Heidelberg}, issn = {0171-6468}, doi = {10.1007/s00291-024-00772-0}, url = {http://nbn-resolving.de/urn:nbn:de:101:1-2408131120370.349068848723}, pages = {255 -- 285}, year = {2024}, abstract = {In robust combinatorial optimization, we would like to find a solution that performs well under all realizations of an uncertainty set of possible parameter values. How we model this uncertainty set has a decisive influence on the complexity of the corresponding robust problem. For this reason, budgeted uncertainty sets are often studied, as they enable us to decompose the robust problem into easier subproblems. We propose a variant of discrete budgeted uncertainty for cardinality-based constraints or objectives, where a weight vector is applied to the budget constraint. We show that while the adversarial problem can be solved in linear time, the robust problem becomes NP-hard and not approximable. We discuss different possibilities to model the robust problem and show experimentally that despite the hardness result, some models scale relatively well in the problem size.}, subject = {-}, language = {en} } @article{BeurskensScherzinger2024, author = {Beurskens, Michael and Scherzinger, Stefanie}, title = {Legal Perspectives on Research Data Storage}, series = {Datenbank-Spektrum (ISSN: 1618-2162)}, volume = {24}, journal = {Datenbank-Spektrum (ISSN: 1618-2162)}, number = {2}, publisher = {Springer}, address = {Berlin/Heidelberg}, issn = {1618-2162}, doi = {10.1007/s13222-024-00478-1}, url = {http://nbn-resolving.de/urn:nbn:de:101:1-2410012125227.647518861484}, pages = {85 -- 95}, year = {2024}, abstract = {Responsibly managing research data has become increasingly important for researchers, especially within the database research community. Despite significant progress in best practices, the state-of-the-art in research data storage is lacking from a legal perspective. We introduce the stakeholders and the dynamic nature of their relationships (such as researchers changing affiliation) and observe that no existing infrastructure for research data storage fully meets their requirements. Therefore, we emphasize the need to design a comprehensive system architecture for research data storage that is aligned with legal considerations from the start, rather than as an afterthought.}, language = {en} } @article{Sinn2024, author = {Sinn, Johanna}, title = {Grenzen aufopfernder Pflege}, series = {Zeitschrift f{\"u}r Ethik und Moralphilosophie (ISSN: 2522-0071)}, volume = {7}, journal = {Zeitschrift f{\"u}r Ethik und Moralphilosophie (ISSN: 2522-0071)}, number = {1}, publisher = {Springer}, address = {Berlin/Heidelberg}, issn = {2522-0071}, doi = {10.1007/s42048-024-00173-6}, url = {http://nbn-resolving.de/urn:nbn:de:101:1-2408062121464.920156372049}, pages = {281 -- 284}, year = {2024}, language = {de} } @article{FrankeHeinrichReisch2024, author = {Franke, Jan and Heinrich, Florian and Reisch, Raven T.}, title = {Vision based process monitoring in wire arc additive manufacturing (WAAM)}, series = {Journal of Intelligent Manufacturing (ISSN: 1572-8145)}, volume = {36}, journal = {Journal of Intelligent Manufacturing (ISSN: 1572-8145)}, number = {3}, publisher = {Springer US}, address = {New York}, issn = {0956-5515}, doi = {10.1007/s10845-023-02287-x}, url = {http://nbn-resolving.de/urn:nbn:de:101:1-2405052141549.085870766506}, pages = {1711 -- 1721}, year = {2024}, abstract = {A stable welding process is crucial to obtain high quality parts in wire arc additive manufacturing. The complexity of the process makes it inherently unstable, which can cause various defects, resulting in poor geometric accuracy and material properties. This demands for in-process monitoring and control mechanisms to industrialize the technology. In this work, process monitoring algorithms based on welding camera image analysis are presented. A neural network for semantic segmentation of the welding wire is used to monitor the working distance as well as the horizontal position of the wire during welding and classic image processing techniques are applied to capture spatter formation. Using these algorithms, the process stability is evaluated in real time and the analysis results enable the direction independent closed-loop-control of the manufacturing process. This significantly improves geometric fidelity as well as mechanical properties of the fabricated part and allows the automated production of parts with complex deposition paths including weld bead crossings, curvatures and overhang structures.}, language = {en} } @article{AistleitnerFruehwirthProchno2024, author = {Aistleitner, Christoph and Fr{\"u}hwirth, Lorenz and Prochno, Joscha}, title = {Diophantine conditions in the law of the iterated logarithm for lacunary systems}, series = {Probability Theory and Related Fields (ISSN: 1432-2064)}, volume = {192}, journal = {Probability Theory and Related Fields (ISSN: 1432-2064)}, number = {1}, publisher = {Springer}, address = {Berlin/Heidelberg}, issn = {0178-8051}, doi = {10.1007/s00440-024-01272-6}, url = {http://nbn-resolving.de/urn:nbn:de:101:1-2406190937284.886045166092}, pages = {545 -- 574}, year = {2024}, abstract = {It is a classical observation that lacunary function systems exhibit many properties which are typical for systems of independent random variables. However, it had already been observed by Erdős and Fortet in the 1950s that probability theory's limit theorems may fail for lacunary sums (sum f(n_k x)) if the sequence ((n_k)_{k ge 1}) has a strong arithmetic "structure". The presence of such structure can be assessed in terms of the number of solutions k, l of two-term linear Diophantine equations (an_k - bn_l = c). As the first author proved with Berkes in 2010, saving an (arbitrarily small) unbounded factor for the number of solutions of such equations compared to the trivial upper bound, rules out pathological situations as in the Erdős-Fortet example, and guarantees that (sum f(n_k x)) satisfies the central limit theorem (CLT) in a form which is in accordance with true independence. In contrast, as shown by the first author, for the law of the iterated logarithm (LIL) the Diophantine condition which suffices to ensure "truly independent" behavior requires saving this factor of logarithmic order. In the present paper we show that, rather surprisingly, saving such a logarithmic factor is actually the optimal condition in the LIL case. This result reveals the remarkable fact that the arithmetic condition required of ((n_k)_{k ge 1}) to ensure that (sum f(n_k x)) shows "truly random" behavior is a different one at the level of the CLT than it is at the level of the LIL: the LIL requires a stronger arithmetic condition than the CLT does.}, language = {en} } @article{DonnerMeissnerBort2024, author = {Donner, Eva Katharina and Meißner, Annekatrin and Bort, Suleika}, title = {Moving from voluntary to mandatory sustainability reporting—Transparency in sustainable development goals (SDG) reporting: An analysis of Germany's largest MNCs}, series = {Business Ethics, the Environment \& Responsibility (ISSN: 2694-6424)}, volume = {34}, journal = {Business Ethics, the Environment \& Responsibility (ISSN: 2694-6424)}, number = {3}, publisher = {Wiley}, issn = {2694-6416}, doi = {10.1111/beer.12687}, url = {http://nbn-resolving.de/urn:nbn:de:bvb:739-opus4-16527}, pages = {900 -- 911}, year = {2024}, abstract = {A growing number of multinational companies (MNCs) report on their progress toward contributing to the Sustainable Development Goals (SDGs) in their annual reports, yet the amount and quality of the information they disclose varies significantly. The aim of this study is twofold: First, we investigate how transparent MNCs report on their SDG engagement and second, we study how the reported SDG engagement changed over time due to major shifts in sustainability reporting requirements. Using a dataset of the largest German MNCs, we analyze their disclosure of SDG contribution reporting practices. Our results show that, overall, between 2016 and 2021 all German MNCs increased their SDG reporting activity and that the MNCs adopted four different practices to report their SDG engagement. We also found that the largest MNCs were more transparent and systematic in their SDG reporting than smaller MNCs, whose reporting was more heterogeneous. Our study contributes to legitimacy research and the role of transparency in corporate reporting as well as the debates on the efficacy of sustainability reporting legislation in the context of SDG engagement. Our findings imply that regulations on environmental and social regulation increase the transparency of sustainability reporting.}, language = {en} } @article{NiedervandeVijverUssishkin2024, author = {Nieder, Jessica and van de Vijver, Ruben and Ussishkin, Adam}, title = {Emerging Roots: Investigating Early Access to Meaning in Maltese Auditory Word Recognition}, series = {Cognitive Science (ISSN: 1551-6709)}, volume = {48}, journal = {Cognitive Science (ISSN: 1551-6709)}, number = {11}, publisher = {Wiley}, issn = {0364-0213}, doi = {10.1111/cogs.70004}, url = {http://nbn-resolving.de/urn:nbn:de:bvb:739-opus4-17638}, pages = {36 Seiten}, year = {2024}, abstract = {In Semitic languages, the consonantal root is central to morphology, linking form and meaning. While psycholinguistic studies highlight its importance in language processing, the role of meaning in early lexical access and its representation remain unclear. This study investigates when meaning becomes accessible during the processing of Maltese verb forms, using a computational model based on the Discriminative Lexicon framework. Our model effectively comprehends and produces Maltese verbs, while also predicting response times in a masked auditory priming experiment. Results show that meaning is accessible early in lexical access and becomes more prominent after the target word is fully processed. This suggests that semantic information plays a critical role from the initial stages of lexical access, refining our understanding of real-time language comprehension. Our findings contribute to theories of lexical access and offer valuable insights for designing priming studies in psycholinguistics. Additionally, this study demonstrates the potential of computational models in investigating the relationship between form and meaning in language processing.}, language = {en} } @article{VishnuNampoothiriEntropAnnamalai2024, author = {Vishnu Nampoothiri, Madhavan and Entrop, Oliver and Annamalai, Thillai Rajan}, title = {Effect of mandatory sustainability performance disclosures on firm value: Evidence from listed European firms}, series = {Corporate Social Responsibility and Environmental Management (ISSN: 1535-3966)}, volume = {31}, journal = {Corporate Social Responsibility and Environmental Management (ISSN: 1535-3966)}, number = {6}, publisher = {John Wiley \& Sons, Inc.}, address = {Chichester, UK}, issn = {1535-3958}, doi = {10.1002/csr.2860}, url = {http://nbn-resolving.de/urn:nbn:de:bvb:739-opus4-17620}, pages = {5220 -- 5235}, year = {2024}, abstract = {Corporate Sustainability Performance (CSP) reporting is becoming increasingly important to investors who seek to identify and invest in companies that are managing their Environmental, Social and Governance (ESG) risks effectively. The European Union's Non-Financial Reporting Directive (NFRD), which was implemented in 2017, mandates that certain large companies must disclose their sustainability performance. This study examines the impact of the EU NFRD on the firm value of listed European firms using a difference-in-differences regression model. We find that the mandatory disclosure of corporate sustainability performance does not significantly affect firm value at an aggregate level. However, the results suggest minor inter-industry differences, which can be attributed to varying sustainability performance metrics across industries. These findings contribute not only to the nascent literature on mandatory sustainability disclosures but also to the deliberations of policymakers and regulators across the world who are devising and implementing mandatory corporate sustainability performance disclosure regulations.}, language = {en} } @article{DaschnerObermaier2024, author = {Daschner, Stefan and Obermaier, Robert}, title = {Do We Use Relatively Bad (Algorithmic) Advice? The Effects of Performance Feedback and Advice Representation on Advice Usage}, series = {Journal of Behavioral Decision Making (ISSN: 1099-0771)}, volume = {37}, journal = {Journal of Behavioral Decision Making (ISSN: 1099-0771)}, number = {5}, publisher = {Wiley}, issn = {0894-3257}, doi = {10.1002/bdm.70001}, url = {http://nbn-resolving.de/urn:nbn:de:bvb:739-opus4-17615}, pages = {18 Seiten}, year = {2024}, abstract = {Algorithms are capable of advising human decision-makers in an increasing number of management accounting tasks such as business forecasts. Due to expected potential of these (intelligent) algorithms, there are growing research efforts to explore ways how to boost algorithmic advice usage in forecasting tasks. However, algorithmic advice can also be erroneous. Yet, the risk of using relatively bad advice is largely ignored in this research stream. Therefore, we conduct two online experiments to examine this risk of using relatively bad advice in a forecasting task. In Experiment 1, we examine the influence of performance feedback (revealing previous relative advice quality) and source of advice on advice usage in business forecasts. The results indicate that the provision of performance feedback increases subsequent advice usage but also the usage of subsequent relatively bad advice. In Experiment 2, we investigate whether advice representation, that is, displaying forecast intervals instead of a point estimate, helps to calibrate advice usage towards relative advice quality. The results suggest that advice representation might be a potential countermeasure to the usage of relatively bad advice. However, the effect of this antidote weakens when forecast intervals become less informative.}, language = {en} } @article{RenderEisenbarthOxneretal.2024, author = {Render, Anna and Eisenbarth, Hedwig and Oxner, Matt and Jansen, Petra}, title = {Arousal, interindividual differences and temporal binding a psychophysiological study}, series = {Psychological Research (ISSN: 1430-2772)}, volume = {88}, journal = {Psychological Research (ISSN: 1430-2772)}, number = {5}, publisher = {Springer Berlin Heidelberg}, address = {Berlin/Heidelberg}, issn = {0340-0727}, doi = {10.1007/s00426-024-01976-3}, url = {http://nbn-resolving.de/urn:nbn:de:101:1-2410112103084.421385257281}, pages = {1653 -- 1677}, year = {2024}, abstract = {The sense of agency varies as a function of arousal in negative emotional contexts. As yet, it is unknown whether the same is true for positive affect, and how inter-individual characteristics might predict these effects. Temporal binding, an implicit measure of the sense of agency, was measured in 59 participants before and after watching either an emotionally neutral film clip or a positive film clip with high or low arousal. Analyses included participants' individual differences in subjective affective ratings, physiological arousal (pupillometry, skin conductance, heart rate), striatal dopamine levels via eye blink rates, and psychopathy. Linear mixed models showed that sexual arousal decreased temporal binding whereas calm pleasure had no facilitation effect on binding. Striatal dopamine levels were positively linked whereas subjective and physiological arousal may be negatively associated with binding towards actions. Psychopathic traits reduced the effect of high arousal on binding towards actions. These results provide evidence that individual differences influence the extent to which the temporal binding is affected by high arousing states with positive valence.}, language = {en} } @article{LenglerOprisSudholt2024, author = {Lengler, Johannes and Opris, Andre and Sudholt, Dirk}, title = {Analysing Equilibrium States for Population Diversity}, series = {Algorithmica (ISSN: 1432-0541)}, volume = {86}, journal = {Algorithmica (ISSN: 1432-0541)}, number = {7}, publisher = {Springer US}, address = {New York}, issn = {0178-4617}, doi = {10.1007/s00453-024-01226-3}, url = {http://nbn-resolving.de/urn:nbn:de:101:1-2406282100292.409184699704}, pages = {2317 -- 2351}, year = {2024}, abstract = {Population diversity is crucial in evolutionary algorithms as it helps with global exploration and facilitates the use of crossover. Despite many runtime analyses showing advantages of population diversity, we have no clear picture of how diversity evolves over time. We study how the population diversity of (μ+1)algorithms, measured by the sum of pairwise Hamming distances, evolves in a fitness-neutral environment. We give an exact formula for the drift of population diversity and show that it is driven towards an equilibrium state. Moreover, we bound the expected time for getting close to the equilibrium state. We find that these dynamics, including the location of the equilibrium, are unaffected by surprisingly many algorithmic choices. All unbiased mutation operators with the same expected number of bit flips have the same effect on the expected diversity. Many crossover operators have no effect at all, including all binary unbiased, respectful operators. We review crossover operators from the literature and identify crossovers that are neutral towards the evolution of diversity and crossovers that are not.}, language = {en} } @article{SchulteLedelHerbold2024, author = {Schulte, Lukas and Ledel, Benjamin and Herbold, Steffen}, title = {Studying the explanations for the automated prediction of bug and non-bug issues using LIME and SHAP}, series = {Empirical Software Engineering (ISSN: 1573-7616)}, volume = {29}, journal = {Empirical Software Engineering (ISSN: 1573-7616)}, number = {4}, publisher = {Springer US}, address = {New York}, issn = {1382-3256}, doi = {10.1007/s10664-024-10469-1}, url = {http://nbn-resolving.de/urn:nbn:de:101:1-2409232103207.812648424894}, pages = {29 Seiten}, year = {2024}, abstract = {Context The identification of bugs within issues reported to an issue tracking system is crucial for triage. Machine learning models have shown promising results for this task. However, we have only limited knowledge of how such models identify bugs. Explainable AI methods like LIME and SHAP can be used to increase this knowledge. Objective We want to understand if explainable AI provides explanations that are reasonable to us as humans and align with our assumptions about the model's decision-making. We also want to know if the quality of predictions is correlated with the quality of explanations. Methods We conduct a study where we rate LIME and SHAP explanations based on their quality of explaining the outcome of an issue type prediction model. For this, we rate the quality of the explanations, i.e., if they align with our expectations and help us understand the underlying machine learning model. Results We found that both LIME and SHAP give reasonable explanations and that correct predictions are well explained. Further, we found that SHAP outperforms LIME due to a lower ambiguity and a higher contextuality that can be attributed to the ability of the deep SHAP variant to capture sentence fragments. Conclusion We conclude that the model finds explainable signals for both bugs and non-bugs. Also, we recommend that research dealing with the quality of explanations for classification tasks reports and investigates rater agreement, since the rating of explanations is highly subjective.}, language = {en} } @misc{HikelKigathiKellermannetal.2025, author = {Hikel, Kerstin B. and Kigathi, Rose and Kellermann, Anna and Onyango, Steve and Schmitt, Christine B.}, title = {Seed catalogue of woody species from coastal Kenya}, doi = {10.15475/scuppu.2025}, url = {http://nbn-resolving.de/urn:nbn:de:bvb:739-opus4-19040}, pages = {VI, 77 Seiten}, year = {2025}, abstract = {Kenyan coastal forests harbor a high diversity of woody plants, comprising 88 families and 937 species. These species-rich forests are highly threatened by human disturbances, leading to forest degradation and habitat loss. To preserve this biodiversity, effective conservation strategies are essential. Conservation efforts may involve both site-based and species-based measures, including botanical surveys and seed collection for propagation in tree nurseries. The aim of this study was to develop a seed catalogue of woody species from coastal Kenya to support seed identification in the field and at various tree nurseries. So far, the catalogue characterizes seeds (and if available also fruits) of 69 woody species across 31 plant families. Each entry includes a brief description, size and weight measurements, and photographs to facilitate identification.}, language = {en} } @book{Benkel2021, author = {Benkel, Thorsten}, title = {Wissenssoziologie des Todes}, editor = {Benkel, Thorsten and Meitzler, Matthias}, edition = {1. Auflage}, publisher = {Beltz Juventa}, address = {Weinheim, Basel}, isbn = {978-3-7799-5277-0}, url = {http://nbn-resolving.de/urn:nbn:de:101:1-2021051822342509363561}, publisher = {Universit{\"a}t Passau}, pages = {328 Seiten}, year = {2021}, abstract = {Sterben, Tod und Trauer sind keine substanziellen Leiberfahrungen oder anthropologisch vordefinierten Verhaltensmechanismen. Tats{\"a}chlich handelt es sich um Wissensbest{\"a}nde und darauf bezogene Praktiken, die als bloß vermeintliche ›Natur des Menschen‹ verinnerlicht werden. Das Ende des Lebens ist weit mehr als der biologisch-reduktionistisch interpretierte Abschluss der Funktionst{\"u}chtigkeit des menschlichen K{\"o}rpers. Die entscheidenden Prozesse sind nicht unabh{\"a}ngig von Sinnsetzungen und Aushandlungen. Vielmehr muss das gesellschaftlich so verstandene Lebensende als je vorl{\"a}ufiges Ergebnis einer epistemologischen Debatte angesehen werden, die sich permanent im Wandel befindet. Was k{\"o}nnte Wissen {\"u}ber den Tod also anderes sein als das Resultat einer kulturabh{\"a}ngigen Standortbestimmung?}, subject = {Trauer}, language = {de} } @phdthesis{Zerhoudi2025, author = {Zerhoudi, Saber}, title = {User Simulation in Interactive Information Retrieval : methods and frameworks for simulating complex search behavior}, url = {http://nbn-resolving.de/urn:nbn:de:bvb:739-opus4-18936}, school = {Universit{\"a}t Passau}, pages = {xii, 196 Seiten}, year = {2025}, abstract = {Modern information retrieval (IR) systems, including web search engines and digital libraries, face challenges in simulating realistic user search behavior. Evolving interaction patterns and the integration of AI-powered interfaces make these challenges even harder. Traditional evaluation methods struggle to capture the dynamic nature of user interactions, particularly in complex search tasks and multi-stage information-seeking processes. User simulation offers a promising solution, providing a controlled environment for experimentation and allowing customization to model specific user behaviors and task contexts. This research develops advanced techniques for user simulation in IR, creating more realistic and dynamic models than were previously possible. Key contributions include new methods for representing query reformulation, modeling how information needs change, and measuring the impact of different search environments on simulated user behavior. Specifically, this work introduces contextual Markov models, cognitive state models, and embedding space alignment techniques to accurately represent interactive search behavior. Beyond model development, new evaluation methods and metrics are proposed for assessing the quality of simulated search sessions. These include statistical comparisons of session characteristics and classification-based approaches to distinguish between simulated and real user behavior. Additionally, this work leverages emerging technologies, such as large language models (LLMs) and retrieval-augmented generation, to improve the realism of user search behavior simulation. The practical outcome of this research is a modular and extensible simulation framework. This framework incorporates advanced techniques like user type-specific Markov models, advanced query generation using LLMs, and conversational user models.}, language = {en} } @article{GeschwindGrafLambsdorff2024, author = {Geschwind, Stephan and Graf Lambsdorff, Johann}, title = {Does scarcity induce hostility? An experimental investigation of common-pool resources}, series = {Ecological Economics (Online ISSN: 1873-6106)}, volume = {2025}, journal = {Ecological Economics (Online ISSN: 1873-6106)}, number = {227}, publisher = {Elsevier}, address = {Amsterdam}, doi = {10.1016/j.ecolecon.2024.108388}, url = {http://nbn-resolving.de/urn:nbn:de:bvb:739-opus4-18958}, pages = {17 Seiten}, year = {2024}, abstract = {Climate change is leading to an increased scarcity of resources such as freshwater, energy, arable land and wildlife. This is perceived as a major security threat. However, the literature remains unclear on whether scarcity mitigates or exacerbates conflict. We design a novel laboratory experiment to investigate hostile behavior under scarcity. Participants interact repeatedly in a dynamic common-pool resource (CPR) and a joy-of-destruction game. The experiment distinguishes between two types of scarcity: Endogenous scarcity in the form of a deliberate human choice to overexploit resources and exogenous scarcity in the form of adverse environmental conditions. Our results show that endogenous scarcity exacerbates hostility. We trace this to participants being guided by negative reciprocity while finding no support for inequality aversion. The results indicate that to avoid hostility, policy makers will have to reduce human-induced scarcity. However, our results also show that exogenous scarcity mitigates hostility. This is in line with a vast body of literature from psychology, anthropology and biology finding increased levels of cooperation for all forms of life under environmental distress. It suggests that managing perceptions around increasing scarcities could be a second potential avenue for policy action.}, language = {en} } @article{KinatederGurribChoudhury2024, author = {Kinateder, Harald and Gurrib, Ikhlaas and Choudhury, Tonmoy}, title = {Navigating crises: Gold's role as a safe haven for U.S. sectors}, series = {Finance Research Letters (Online ISSN: 1544-6131)}, volume = {2024}, journal = {Finance Research Letters (Online ISSN: 1544-6131)}, number = {69 B}, publisher = {Elsevier}, address = {Amsterdam}, doi = {10.1016/j.frl.2024.106210}, url = {http://nbn-resolving.de/urn:nbn:de:bvb:739-opus4-18974}, pages = {6 Seiten}, year = {2024}, abstract = {This paper investigates the correlation between U.S. sectors and gold, and whether gold can serve as a safe haven for investors in specific U.S. sectors during the global financial crisis, COVID-19, and the Russia-Ukraine war. We use data from the Standard \& Poor's Depository Receipts (SPDR) Select Sector Exchange Traded Fund (ETF) to capture the performance of the respective sectors. Our findings document that gold is a weak safe haven for most U.S. sectors. Gold is not a safe investment for energy, materials, utilities, and consumer staples. Gold does provide vital protection for financial, consumer discretionary, industrial, technology, and healthcare.}, language = {en} } @article{BiglerJanzen2024, author = {Bigler, Patrick and Janzen, Benedikt}, title = {Too hot to sleep}, series = {Journal of Environmental Economics and Management (Online ISSN: 1096-0449)}, volume = {2024}, journal = {Journal of Environmental Economics and Management (Online ISSN: 1096-0449)}, number = {128}, publisher = {Elsevier}, address = {Amsterdam}, doi = {10.1016/j.jeem.2024.103063}, url = {http://nbn-resolving.de/urn:nbn:de:bvb:739-opus4-18966}, pages = {17 Seiten}, year = {2024}, language = {en} } @article{HerkenhoffKrautheimSaure2024, author = {Herkenhoff, Philipp and Krautheim, Sebastian and Saur{\´e}, Philip}, title = {A simple model of buyer-seller networks in international trade}, series = {European Economic Review (Online ISSN: 1873-572X)}, volume = {2024}, journal = {European Economic Review (Online ISSN: 1873-572X)}, number = {170}, publisher = {Elsevier}, address = {Amsterdam}, doi = {10.1016/j.euroecorev.2024.104868}, url = {http://nbn-resolving.de/urn:nbn:de:bvb:739-opus4-18949}, pages = {29 Seiten}, year = {2024}, abstract = {The recent literature on firm-to-firm trade has documented salient empirical regularities of the buyer-seller network. We show that surprisingly many of these regularities emerge by superimposing the stochastic balls-and-bins structure of Armenter and Koren (2014) to firms in a classical Krugman (1980) model. Our approach amounts to a re-interpretation of Krugman (1980) and relies on randomized bundling of Krugman-varieties into heterogeneous firms, economically neutral 'sales units' that import foreign varieties but belong to local firms, and a statistical reporting threshold that applies to firm-to-firm transactions. We argue that our model provides an important benchmark for the assessment of theoretical models that aim to identify the determinants of firm-to-firm networks.}, language = {en} } @article{KleinePeschkeWagner2024, author = {Kleine, Jens and Peschke, Thomas and Wagner, Niklas}, title = {Beyond financial wealth: The experienced utility of collectibles}, series = {The Quarterly Review of Economics and Finance (Online ISSN: 1878-4259)}, volume = {2024}, journal = {The Quarterly Review of Economics and Finance (Online ISSN: 1878-4259)}, number = {97}, publisher = {Elsevier}, address = {Amsterdam}, doi = {10.1016/j.qref.2024.101865}, url = {http://nbn-resolving.de/urn:nbn:de:bvb:739-opus4-18808}, pages = {11 Seiten}, year = {2024}, abstract = {We argue that the utility of specific assets, in our case collectibles, is not only derived from the financial outcome, but also from the conditions that prevail until a financial outcome may be realized. Therefore, we derive a multi-attribute utility function that measures financial returns — using a mean-variance utility function — on the one hand, and non-financial returns — using an experienced utility function — on the other. We then reveal the trade-off between financial and non-financial utility by analyzing 363 owners of collectibles. We divide the owners into the group of collectors and the group of investors, based on their self-reported motivation. Our results suggest that collectors receive almost no utility from financial returns, but rather from experience. The opposite is the case for investors. Our findings help to explain the reported financial underperformance of collectibles and suggest to adjust existing models of utility.}, language = {en} } @article{FritschHauptSchnurbus2024, author = {Fritsch, Markus and Haupt, Harry and Schnurbus, Joachim}, title = {Efficiency of poll-based multi-period forecasting systems for German state elections}, series = {International Journal of Forecasting (Online ISSN: 1872-8200)}, volume = {41 (2025)}, journal = {International Journal of Forecasting (Online ISSN: 1872-8200)}, number = {2}, publisher = {Elsevier}, address = {Amsterdam}, doi = {10.1016/j.ijforecast.2024.04.008}, url = {http://nbn-resolving.de/urn:nbn:de:bvb:739-opus4-18793}, pages = {670 -- 688}, year = {2024}, abstract = {Election polls are frequently employed to reflect voter sentiment with respect to a particular election (or fixed-event). Despite their widespread use as forecasts and inputs for predictive algorithms, there is substantial uncertainty regarding their efficiency. This uncertainty is amplified by judgment in the form of pollsters applying unpublished weighting schemes to ensure the representativeness of the sampled voters for the underlying population. Efficient forecasting systems incorporate past information instantly, which renders a given fixed-event unpredictable based on past information. This results in all sequential adjustments of the fixed-event forecasts across adjacent time periods (or forecast revisions) being martingale differences. This paper illustrates the theoretical conditions related to weak efficiency of fixed-event forecasting systems based on traditional least squares loss and asymmetrically weighted least absolute deviations (or quantile) loss. Weak efficiency of poll-based multi-period forecasting systems for all German federal state elections since the year 2000 is investigated. The inefficiency of almost all considered forecasting systems is documented and alternative explanations for the findings are discussed.}, language = {en} } @article{KabluchkoProchnoSonnleitner2024, author = {Kabluchko, Zakhar and Prochno, Joscha and Sonnleitner, Mathias}, title = {A probabilistic approach to Lorentz balls l(^n)(q,1)}, series = {Journal of Functional Analysis (Online ISSN: 1096-0783)}, volume = {2025}, journal = {Journal of Functional Analysis (Online ISSN: 1096-0783)}, number = {288, 1}, publisher = {Elsevier}, address = {Amsterdam}, doi = {10.1016/j.jfa.2024.110682}, url = {http://nbn-resolving.de/urn:nbn:de:bvb:739-opus4-18878}, pages = {32 Seiten}, year = {2024}, abstract = {We develop a probabilistic approach to study the volumetric and geometric properties of unit balls |B(^n)(q,1) of finite-dimensional Lorentz sequence spaces l(^n)(q,1). More precisely, we show that the empirical distribution of a random vector X^(n) uniformly distributed on its volume normalized unit ball converges weakly to a compactly supported symmetric probability distribution with explicitly given density; as a consequence we obtain a weak Poincar{\´e}-Maxwell-Borel principle for any fixed number k in |N of coordinates of X^(n) as n grows infinitly. Moreover, we prove a central limit theorem for the largest coordinate of X^(n), demonstrating a quite different behavior than in the case of the l(^n)(q) balls, where a Gumbel distribution appears in the limit. Finally, we prove a Schechtman-Schmuckenschl{\"a}ger type result for the asymptotic volume of intersections of volume normalized l(^n)(q,1) and l(^n)(p) balls.}, language = {en} } @article{VorderobermeierAbelSailer2024, author = {Vorderobermeier, Andrea and Abel, Johannes and Sailer, Maximilian}, title = {Theoretical foundations and approaches in research on educational escape rooms : a systematic review}, series = {Educational Research Review (Online ISSN: 1878-0385)}, volume = {2024}, journal = {Educational Research Review (Online ISSN: 1878-0385)}, number = {44}, publisher = {Elsevier}, address = {Amsterdam}, doi = {10.1016/j.edurev.2024.100625}, url = {http://nbn-resolving.de/urn:nbn:de:bvb:739-opus4-18863}, pages = {16 Seiten}, year = {2024}, abstract = {Educational Escape Rooms (EER) as a new teaching tool gained significant attention in the research discourse - especially the last two years. So far, research focused on the practicality, feasibility or description of the development. To provide a more comprehensive understanding to mechanisms within this instructional approach, it is valuable to examine it through the lens of established and well-researched theories and approaches of teaching and learning. Therefore, we identified which theoretical foundations were used in research on Escape Rooms as learning tools and took a look at the extent to which and where they are represented. For this purpose, a systematic review was conducted, which resulted in the identification of 24 articles containing a total of nine theoretical foundations. It is presented how these approaches are applied in EERs and how they are interrelated. Furthermore, we developed six patterns that illustrate the integration of the found theories into the articles. The integration of these theoretical approaches ranges from general statements on theoretical grounding in EERs without connection to didactic considerations to theoretical grounding with empirical validation. Result of the systematic review is that the theoretical foundation in current research on EERs is weak. Therefore, it is argued that future research should focus more on the interweaving of theory, didactic instructions, and practice to gain a better understanding of mechanisms behind successful learning environments with EERs.}, language = {en} } @article{BauerHauptLinner2024, author = {Bauer, Ida and Haupt, Harry and Linner, Stefan}, title = {Pinball boosting of regression quantiles}, series = {Computational Statistics \& Data Analysis (Online ISSN: 1872-7352)}, volume = {2024}, journal = {Computational Statistics \& Data Analysis (Online ISSN: 1872-7352)}, number = {200}, publisher = {Elsevier}, address = {Amsterdam}, doi = {10.1016/j.csda.2024.108027}, url = {http://nbn-resolving.de/urn:nbn:de:bvb:739-opus4-18850}, pages = {12 Seiten}, year = {2024}, abstract = {An algorithm for boosting regression quantiles using asymmetric least absolute deviations, better known as pinball loss, is proposed. Existing approaches for boosting regression quantiles are essentially equal to least squares boosting of regression means with the single difference that their working residuals are based on pinball loss. All steps of our boosting algorithm are embedded in the well-established framework of quantile regression, and its main components - sequential base learning, fitting, and updating - are based on consistent scoring rules for regression quantiles. The Monte Carlo simulations performed indicate that the pinball boosting algorithm is competitive with existing approaches for boosting regression quantiles in terms of estimation accuracy and variable selection, and that its application to the study of regression quantiles of hedonic price functions allows the estimation of previously infeasible high-dimensional specifications.}, language = {en} } @article{GrimmSoubeigaWeber2024, author = {Grimm, Michael and Soubeiga, Sidiki and Weber, Michael}, title = {Supporting small firms in a fragile context : comparing matching and cash grants in Burkina Faso}, series = {Journal of Development Economics (Online ISSN: 1872-6089)}, volume = {2024}, journal = {Journal of Development Economics (Online ISSN: 1872-6089)}, number = {171}, publisher = {Elsevier}, address = {Amsterdam}, doi = {10.1016/j.jdeveco.2024.103344}, url = {http://nbn-resolving.de/urn:nbn:de:bvb:739-opus4-18848}, pages = {17 Seiten}, year = {2024}, abstract = {We used a randomized controlled trial to compare matching grants earmarked for technical training and consulting services with more flexible cash grants and with a control group. The experiment was implemented in a semi-urban and rural fragile setting where subsidizing innovative activities might be particularly important. Firms were selected on the basis of a business plan competition. After two years, beneficiaries of cash grants showed higher survival rates, improved business practices, a higher degree of formalization, and more activities for innovation relative to recipients of matching grants and the control group, but we saw no effects on profits, sales, and employment. Across all outcomes, beneficiaries of cash grants performed better than beneficiaries of matching grants, for them the treatment effects are smaller and often insignificant, though implementation costs were higher. Recipients of cash grants also increased their capital stock more and were more resilient to the COVID-19 crisis.}, language = {en} } @article{FritschPuaSchnurbus2024, author = {Fritsch, Markus and Pua, Andrew Adrian and Schnurbus, Joachim}, title = {Teaching advanced topics in econometrics using introductory textbooks : the case of dynamic panel data methods}, series = {International Review of Economics Education (Online ISSN: 2352-4421)}, volume = {2024}, journal = {International Review of Economics Education (Online ISSN: 2352-4421)}, number = {47}, publisher = {Elsevier}, address = {Amsterdam}, doi = {10.1016/j.iree.2024.100297}, url = {http://nbn-resolving.de/urn:nbn:de:bvb:739-opus4-18835}, pages = {19 Seiten}, year = {2024}, abstract = {We show how to use the introductory econometrics textbook by Stock and Watson (2019) as a starting point for teaching and studying dynamic panel data methods. The materials are intended for undergraduate students taking their second econometrics course, undergraduate students in seminar-type courses, independent study courses, capstone, or thesis projects, and beginning graduate students in a research methods course. First, we distill the methodological core necessary to understand dynamic panel data methods. Second, we design an empirical and a theoretical case study to highlight the capabilities, downsides, and hazards of the method. The empirical case study is based on the cigarette demand example in Stock and Watson (2019) and illustrates that economic and methodological issues are interrelated. The theoretical case study shows how to evaluate current empirical practices from a theoretical standpoint. We designed both case studies to boost students' confidence in working with technical material and to provide instructors with more opportunities to let students develop econometric thinking and to actively communicate with applied economists. Although we focus on Stock and Watson (2019) and the statistical software R, we also show how to modify the material for use with another introductory textbook by Wooldridge (2020) and Stata, and highlight some possible further pathways for instructors and students to reuse and extend our materials.}, language = {en} } @article{GruenerPostelSchumann2024, author = {Gr{\"u}ner, Alina and Postel, Lea and Schumann, Jan}, title = {Sharing is caring? The effect of negative peer-to-peer experiences on loyalty intentions in the sharing economy}, series = {Journal of Business Research (Online ISSN: 1873-7978)}, volume = {2024}, journal = {Journal of Business Research (Online ISSN: 1873-7978)}, number = {181}, publisher = {Elsevier}, address = {Amsterdam}, doi = {10.1016/j.jbusres.2024.114757}, url = {http://nbn-resolving.de/urn:nbn:de:bvb:739-opus4-18820}, pages = {14 Seiten}, year = {2024}, abstract = {Negative experiences with other users (i.e., negative peer-to-peer [P2P] experiences), are a highly prevalent problem of sharing economy business models with potentially negative consequences for the platform. This paper investigates the effect of negative P2P experiences on users' platform loyalty intentions. Based on trust transfer theory, we test a moderated serial mediation suggesting that negative P2P experiences negatively affect platform loyalty intentions via a decrease in peer trust and a subsequent decrease in platform trust. The results of an online scenario-experiment (n = 265) and an online survey (n = 237) in the home-sharing context support this notion by showing a negative peers-to-platform trust transfer effect. In addition, we identified the type of negative experience (outcome-related vs. process-related) and prior relationship satisfaction as contingency factors. This paper draws platform providers' attention to the potential threat stemming from negative experiences between users and provide advice on how to attenuate a negative spillover-effect on the platform.}, language = {en} } @article{MuellerGronbachYaroslavtseva2024, author = {M{\"u}ller-Gronbach, Thomas and Yaroslavtseva, Larisa}, title = {On the complexity of strong approximation of stochastic differential equations with a non-Lipschitz drift coefficient}, series = {Journal of Complexity (Online ISSN: 1090-2708)}, volume = {2024}, journal = {Journal of Complexity (Online ISSN: 1090-2708)}, number = {85}, publisher = {Elsevier}, address = {Amsterdam}, doi = {10.1016/j.jco.2024.101870}, url = {http://nbn-resolving.de/urn:nbn:de:bvb:739-opus4-18819}, pages = {17 Seiten}, year = {2024}, abstract = {We survey recent developments in the field of complexity of pathwise approximation in p-th mean of the solution of a stochastic differential equation at the final time based on finitely many evaluations of the driving Brownian motion. First, we briefly review the case of equations with globally Lipschitz continuous coefficients, for which an error rate of at least 1/2 in terms of the number of evaluations of the driving Brownian motion is always guaranteed by using the equidistant Euler-Maruyama scheme. Then we illustrate that giving up the global Lipschitz continuity of the coefficients may lead to a non-polynomial decay of the error for the Euler-Maruyama scheme or even to an arbitrary slow decay of the smallest possible error that can be achieved on the basis of finitely many evaluations of the driving Brownian motion. Finally, we turn to recent positive results for equations with a drift coefficient that is not globally Lipschitz continuous. Here we focus on scalar equations with a Lipschitz continuous diffusion coefficient and a drift coefficient that satisfies piecewise smoothness assumptions or has fractional Sobolev regularity and we present corresponding complexity results.}, language = {en} } @article{NagelHeidenreichSchumann2024, author = {Nagel, Christian and Heidenreich, Sven and Schumann, Jan}, title = {Enhancing adoption of sustainable product innovations : addressing reduced performance with risk-reducing product modifications}, series = {Journal of Business Research (Online ISSN: 1873-7978)}, volume = {2024}, journal = {Journal of Business Research (Online ISSN: 1873-7978)}, number = {179}, publisher = {Elsevier}, address = {Amsterdam}, doi = {10.1016/j.jbusres.2024.114684}, url = {http://nbn-resolving.de/urn:nbn:de:bvb:739-opus4-18788}, pages = {12 Seiten}, year = {2024}, abstract = {Past studies have shown that the probability of the successful diffusion of sustainable product innovations is strikingly low. A potentially promising marketing strategy to reduce negative consumer perceptions of sustainable product innovations is risk-reducing product modifications (RPMs), which account for behavioral adjustments and performance uncertainties by employing an additional component that uses established technology. This research strives to empirically test the potential positive effects of RPMs using two studies on electric vehicles with and without range extenders as prime examples of RPM: (1) an online survey of potential adopters and (2) a postadoption survey of early adopters. The results show that RPMs increase the adoption of sustainable product innovations. Consumers' tendency to overestimate their true needs and their need for insurance against insufficient performance explain the effectiveness of RPM.}, language = {en} } @article{OttoTilk2024, author = {Otto, Alena and Tilk, Christian}, title = {Intelligent design of sensor networks for data-driven sensor maintenance at railways}, series = {Omega (Online ISSN: 1873-5274)}, volume = {2024}, journal = {Omega (Online ISSN: 1873-5274)}, number = {127}, publisher = {Elsevier}, address = {Amsterdam}, doi = {10.1016/j.omega.2024.103094}, url = {http://nbn-resolving.de/urn:nbn:de:bvb:739-opus4-18771}, pages = {13 Seiten}, year = {2024}, abstract = {With rapid advances in digitization, many critical processes in transportation, industries, and our daily life rely on sensor measurements. With time, however, the measurements may get gradually biased and their precision deteriorates, leading to an enhanced risk of major disruptions caused by false sensor measurements. All single sensor measurements are uncertain and deviate from the true value. To detect malfunctioning sensors early on, a set of recent measurements of each sensor has to be constantly cross-checked against the measurements of a given number of other sensors, i.e., sensors should form a diagnosable network. In this article, we examine the intelligent positioning of safety-relevant sensors at railways such that the installed sensors can constantly cross-check each other and the number of the required sensors is minimized. The arising sensor positioning problem (SPP) belongs to the family of the coordinated set covering problems with two binary matrices: the choice of columns in one matrix implies the selection of specific columns and rows in the other matrix. We formulate an integer program, provide some formal analysis of the SPP and design a customized large neighborhood search metaheuristic RuM, which finds close-to-optimality solutions fast. In our computational experiments, we show that if we ignore the diagnosability requirement, the installed sensors cannot sufficiently cross-check each other in most cases. However, it costs only a few (or even no) additional sensors to ensure the diagnosability of the sensor network.}, language = {en} } @article{FruehwirthProchno2024, author = {Fr{\"u}hwirth, Lorenz and Prochno, Joscha}, title = {Sanov-type large deviations and conditional limit theorems for high-dimensional Orlicz balls}, series = {Journal of Mathematical Analysis and Applications (Online ISSN: 1096-0813)}, volume = {2024}, journal = {Journal of Mathematical Analysis and Applications (Online ISSN: 1096-0813)}, number = {536,1}, publisher = {Elsevier}, address = {Amsterdam}, doi = {10.1016/j.jmaa.2024.128169}, url = {http://nbn-resolving.de/urn:nbn:de:bvb:739-opus4-18723}, pages = {25 Seiten}, year = {2024}, abstract = {In this paper, we prove a Sanov-type large deviation principle for the sequence of empirical measures of vectors chosen uniformly at random from an Orlicz ball. From this level-2 large deviation result, in a combination with Gibbs conditioning, entropy maximization and an Orlicz version of the Poincar{\´e}-Maxwell-Borel lemma, we deduce a conditional limit theorem for high-dimensional Orlicz balls. In more geometric parlance, the latter shows that if V1 and V2 are Orlicz functions, then random points in the V1-Orlicz ball, conditioned on having a small V2-Orlicz radius, look like an appropriately scaled V2-Orlicz ball. In fact, we show that the limiting distribution in our Poincar{\´e}-Maxwell-Borel lemma, and thus the geometric interpretation, undergoes a phase transition depending on the magnitude of the V2-Orlicz radius.}, language = {en} } @article{SchmidPetriElschner2024, author = {Schmid-Petri, Hannah and Elschner, Sophie G.}, title = {Transitionalists, traditionalists or pioneers? How German municipal energy companies are responding to the national energy transition}, series = {Energy Research \& Social Science (Online ISSN: 2214-6326)}, volume = {2024}, journal = {Energy Research \& Social Science (Online ISSN: 2214-6326)}, number = {109}, publisher = {Elsevier}, address = {Amsterdam}, doi = {10.1016/j.erss.2024.103431}, url = {http://nbn-resolving.de/urn:nbn:de:bvb:739-opus4-18714}, pages = {15 Seiten}, year = {2024}, abstract = {The Renewable Energy Sources Act (EEG) in Germany aims to transition the country to a sustainable energy system. This has led to a decentralization of the energy market and a shift toward community-focused energy supply systems. Municipal energy companies (MECs), deeply rooted in their communities, are crucial in facilitating this transition and promoting innovative technologies. Websites serve as important communication tools, facilitating interaction between companies and consumers. In our study, we conducted a quantitative content analysis to examine how MECs communicate issues related to the energy transition on their web pages (N = 300). In general, our results show that the energy transition was rarely mentioned on landing pages, and while companies are improving their sustainable electricity products, renewable gas and heating tariffs have received little attention. Additionally, we identified three communication types of MECs: The transitionalists (45 \%), the traditionalists (35 \%), and the pioneers (20 \%), with the latter being the most innovative that emphasizes issues related to the energy transition. Overall, it can be said that the MECs have not yet fully exploited their potential to position themselves as pioneers of the energy transition in their website communications.}, language = {en} } @article{KreuzerWalsh2024, author = {Kreuzer, Martin and Walsh, Florian}, title = {Computing the binomial part of a polynomial ideal}, series = {Journal of Symbolic Computation (Online ISSN: 1095-855X)}, volume = {2024}, journal = {Journal of Symbolic Computation (Online ISSN: 1095-855X)}, number = {124}, publisher = {Elsevier}, address = {Amsterdam}, doi = {10.1016/j.jsc.2024.102298}, url = {http://nbn-resolving.de/urn:nbn:de:bvb:739-opus4-18708}, pages = {30 Seiten}, year = {2024}, abstract = {Given an ideal I in a polynomial ring K[x1,...,xn] over a field K, we present a complete algorithm to compute the binomial part of I, i.e., the subideal Bin(I) of I generated by all monomials and binomials in I. This is achieved step-by-step. First we collect and extend several algorithms for computing exponent lattices in different kinds of fields. Then we generalize them to compute exponent lattices of units in 0-dimensional K-algebras, where we have to generalize the computation of the separable part of an algebra to non-perfect fields in characteristic p. Next we examine the computation of unit lattices in finitely generated K-algebras, as well as their associated characters and lattice ideals. This allows us to calculate Bin(I) when I is saturated with respect to the indeterminates by reducing the task to the 0-dimensional case. Finally, we treat the computation of Bin(I) for general ideals by computing their cellular decomposition and dealing with finitely many special ideals called (s,t)-binomial parts. All algorithms have been implemented in SageMath.}, language = {en} }