TY - JOUR A1 - Kinateder, Harald A1 - Gurrib, Ikhlaas A1 - Choudhury, Tonmoy T1 - Navigating crises: Gold's role as a safe haven for U.S. sectors JF - Finance Research Letters (Online ISSN: 1544-6131) N2 - 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. KW - DCC-GARCH KW - Exchange-traded funds KW - Safe haven KW - U.S. sectors KW - COVID-19 KW - Global Financial Crisis KW - Russia-Ukraine war Y1 - 2024 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:bvb:739-opus4-18974 VL - 2024 IS - 69 B PB - Elsevier CY - Amsterdam ER - TY - BOOK A1 - Benkel, Thorsten ED - Benkel, Thorsten ED - Meitzler, Matthias T1 - Wissenssoziologie des Todes N2 - Sterben, Tod und Trauer sind keine substanziellen Leiberfahrungen oder anthropologisch vordefinierten Verhaltensmechanismen. Tatsächlich handelt es sich um Wissensbestä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üchtigkeit des menschlichen Körpers. Die entscheidenden Prozesse sind nicht unabhängig von Sinnsetzungen und Aushandlungen. Vielmehr muss das gesellschaftlich so verstandene Lebensende als je vorläufiges Ergebnis einer epistemologischen Debatte angesehen werden, die sich permanent im Wandel befindet. Was könnte Wissen über den Tod also anderes sein als das Resultat einer kulturabhängigen Standortbestimmung? KW - Trauer KW - Sozialer Wandel KW - Soziologie Y1 - 2021 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:101:1-2021051822342509363561 SN - 978-3-7799-5277-0 PB - Beltz Juventa CY - Weinheim, Basel ET - 1. Auflage ER - TY - JOUR A1 - Töpfl, Florian A1 - Kravets, Daria A1 - Ryzhova, Anna A1 - Beseler, Arista T1 - Who are the plotters behind the pandemic? BT - Comparing Covid-19 conspiracy theories in Google search results across five key target countries of Russia’s foreign communication JF - Information, Communication & Society N2 - 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. KW - Search engines KW - algorithms KW - misinformation KW - disinformation KW - conspiracy theories KW - Russia Y1 - 2022 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:bvb:739-opus4-19119 VL - 26 (2023) IS - 10 SP - 2033 EP - 2051 PB - Taylor & Francis CY - London ER - TY - JOUR A1 - Fekih Hassen, Wiem A1 - Schoppik, Luis A1 - Schiegg, Sascha A1 - Gerl, Armin T1 - Power management approach of hybrid energy storage system for electric vehicle charging stations JF - Smart Cities N2 - 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. KW - HESS KW - RFB KW - lithium battery KW - power distribution KW - OpenEMS KW - real load dataset Y1 - 2024 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:bvb:m347-opus-6045 SN - 2624-6511 VL - 7 (2024) IS - 6 SP - 4025 EP - 4051 PB - MDPI CY - Basel ER - TY - JOUR A1 - Beseler, Arista A1 - Toepfl, Florian T1 - Conduits of the Kremlin’s Informational Influence Abroad? How German-Language Alternative Media Outlets Are Connected to Russia’s Ruling Elites JF - The International Journal of Press/Politics (ISSN: 1940-1620) N2 - 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. KW - - KW - propaganda KW - alternative media KW - active measures KW - case study KW - Russia KW - influence Y1 - 2024 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:bvb:739-opus4-16755 SN - 1940-1612 SN - 1940-1620 VL - 30 IS - 3 SP - 659 EP - 678 PB - SAGE Publications CY - Los Angeles, CA ER - TY - JOUR A1 - Epperlein, Jeremias A1 - Wirth, Fabian T1 - The joint spectral radius is pointwise Hölder continuous JF - Linear Algebra and its Applications N2 - We show that the joint spectral radius is pointwise Hölder continuous. In addition, the joint spectral radius is locally Hölder continuous for ε-inflations. In the two-dimensional case, local Hölder continuity holds on the matrix sets with positive joint spectral radius. KW - Joint spectral radius KW - Hölder continuity KW - Extremal norm Y1 - 2024 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:bvb:739-opus4-19140 SN - 1873-1856 VL - 2025 IS - 704 SP - 92 EP - 122 PB - Elsevier CY - Amsterdam ER - TY - JOUR A1 - Daschner, Stefan A1 - Obermaier, Robert T1 - Algorithm aversion? On the influence of advice accuracy on trust in algorithmic advice JF - Journal of Decision Systems N2 - 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. KW - Algorithm appreciation KW - cognitive trust KW - initial trust KW - Perfect Automation Scheme KW - trusting beliefs KW - Advice Accuracy KW - Forecasting Y1 - 2022 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:bvb:739-opus4-19120 VL - 31 (2022) IS - S1 SP - 77 EP - 97 PB - Taylor & Francis CY - London ER - TY - JOUR A1 - Hackl, Veronika A1 - Müller, Alexandra Elena A1 - Granitzer, Michael A1 - Sailer, Maximilian T1 - Is GPT-4 a reliable rater? Evaluating consistency in GPT-4's text ratings JF - Frontiers in Education N2 - 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. KW - artificial intelligence KW - GPT-4 KW - large language model KW - prompt engineering KW - feedback KW - higher education Y1 - 2023 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:bvb:739-opus4-18348 SN - 2504-284X VL - 2023 IS - 8 PB - Frontiers CY - Lausanne ER - TY - THES A1 - Fellicious, Christofer T1 - Bridging the gap: Applying machine learning techniques in digital forensics N2 - 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. KW - semantic gap KW - virtual machine introspection KW - forensic memory analysis Y1 - 2025 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:bvb:739-opus4-18473 ER - TY - GEN A1 - Hikel, Kerstin B. A1 - Kigathi, Rose A1 - Kellermann, Anna A1 - Onyango, Steve A1 - Schmitt, Christine B. T1 - Seed catalogue of woody species from coastal Kenya N2 - 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. Y1 - 2025 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:bvb:739-opus4-19040 ER - TY - JOUR A1 - Glock, Stefan A1 - Munhá Correia, David A1 - Sudakov, Benny T1 - Hamilton cycles in pseudorandom graphs JF - Advances in Mathematics N2 - 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ó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ász. They can also be used to improve a result of Alon and Bourgain on additive patterns in multiplicative subgroups. KW - Hamilton cycle KW - Hamiltonicity KW - Pseudorandom graph KW - Expander graph Y1 - 2024 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:bvb:739-opus4-19151 VL - 2024 IS - 458 B PB - Elsevier CY - Amsterdam ER - TY - JOUR A1 - Stoffels, Dominik A1 - Faltermaier, Stefan A1 - Strunk, Kim Simon A1 - Fiedler, Marina T1 - Guiding computationally intensive theory development with explainable artificial intelligence: The case of shapley additive explanations JF - Journal of Information Technology (ISSN: 1466-4437) N2 - 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). KW - - KW - computationally intensive theory development KW - next-generation theory development KW - machine learning patterns KW - IS research methods KW - explainable AI KW - black-box algorithms Y1 - 2024 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:bvb:739-opus4-16762 SN - 0268-3962 SN - 1466-4437 VL - 40 IS - 2 SP - 180 EP - 213 PB - SAGE Publications CY - London, England ER - TY - JOUR A1 - Zubaer, Abdullah Al A1 - Granitzer, Michael A1 - Mitrović, Jelena T1 - Performance analysis of large language models in the domain of legal argument mining JF - Frontiers in Artificial Intelligence N2 - 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. KW - natural language processing (NLP) KW - argument mining KW - legal data KW - European Court of Human Rights (ECHR) KW - sequence classification KW - GPT-4 KW - ChatGPT KW - large language models Y1 - 2023 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:bvb:739-opus4-18326 SN - 2624-8212 VL - 2023 IS - 6 PB - Frontiers CY - Lausanne ER - TY - JOUR A1 - Kehle, Laura A1 - Urhahne, Detlef T1 - Testing the CONIC model: The interplay of conscientiousness and interest in predicting academic effort JF - Learning and Instruction N2 - Background This report comprises two studies that more closely examined the Conscientiousness × Interest Compensation (CONIC) model by Trautwein, Nagengast, Roberts, and Lü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. KW - Conscientiousness KW - Effort KW - Interest KW - Academic achievement KW - CONIC model Y1 - 2024 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:bvb:739-opus4-19214 SN - 1873-3263 VL - 2025 IS - 95 PB - Elsevier CY - Amsterdam ER - TY - JOUR A1 - Kreuzer, Martin A1 - Linh, Tran N. K. A1 - Long, Le N. T1 - Differential theory of zero-dimensional schemes JF - Journal of Pure and Applied Algebra N2 - To study a 0-dimensional scheme |X in |P^n over a perfect field K, we use the module of Kähler differentials (Omega)(^1)(_{R/K}) of its homogeneous coordinate ring R and its exterior powers, the higher modules of Kä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ä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ähler differentials. As a further application, we characterize uniformity conditions on |X using the Hilbert functions of the Kähler differential modules of |X and its subschemes. KW - Kähler differential module KW - Zero-dimensional scheme KW - Regularity index KW - Hilbert function KW - Curvilinear scheme KW - Fat point scheme Y1 - 2024 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:bvb:739-opus4-19130 SN - 1873-1376 VL - 229 (2025) IS - 1 PB - Elsevier CY - Amsterdam ER - TY - JOUR A1 - Kreuzer, Martin A1 - Miasnikov, Alexei A1 - Walsh, Florian T1 - Decomposing finite Z-algebras JF - Journal of Algebra N2 - 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. KW - Algebra decomposition KW - Directly indecomposable factor KW - Bilinear map KW - Maximal ring of scalars KW - Primitive idempotent KW - Lie ring Y1 - 2024 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:bvb:739-opus4-19184 SN - 1090-266X VL - 2025 IS - 664 B SP - 206 EP - 246 PB - Elsevier CY - Amsterdam ER - TY - JOUR A1 - Drescher, Katharina A1 - Janzen, Benedikt T1 - When weather wounds workers : the impact of temperature on workplace accidents JF - Journal of Public Economics N2 - 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. KW - Occupational health KW - Labor supply KW - Climate change Y1 - 2024 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:bvb:739-opus4-19241 VL - 2025 IS - 241 PB - Elsevier CY - Amsterdam ER -