Opin vísindi
Opin vísindi er varðveislusafn vísindaefnis og doktorsritgerða í opnum aðgangi á vegum íslenskra háskóla og Landsbókasafns Íslands - Háskólabókasafns.
Opinn aðgangur að rannsóknaniðurstöðum er í samræmi við 10. gr. laga nr. 3/2003 um opinberan stuðning við vísindarannsóknir sem og kröfur innlendra og erlendra rannsóknasjóða. Markmiðið með opnum aðgangi er að niðurstöður rannsókna séu aðgengilegar sem flestum óhindrað og án endurgjalds á rafrænu formi. Vistun í varðveislusafninu er varanleg og ætlað að tryggja aðgang að vísindaefni íslenskra háskóla í opnum aðgangi um ókomna tíð. Varðveislusafnið Opin vísindi er tengt við rannsóknagáttina IRIS og rannsóknaniðurstöður í opnum aðgangi sem eru skráðar í IRIS eru um leið vistaðar og gerðar aðgengilegar til framtíðar í varðveislusafninu. Með því að safna þessu efni saman í eitt safn verður aðgangur að því einfaldur og þægilegur fyrir alla sem vilja kynna sér það og geta þannig notið þess öfluga vísindastarfs sem fram fer í háskólum landsins.
Varðveislusafnið er OpenAIRE / OpenAIREplus samhæft og samrýmist kröfum sem gerðar eru um birtingu rannsóknaniðurstaðna úr verkefnum sem styrkt eru úr evrópsku rannsóknaáætlununum FP7 og H2020.
Varðveislusafnið notar opna hugbúnaðinn DSpace.
Opinn aðgangur að rannsóknaniðurstöðum er í samræmi við 10. gr. laga nr. 3/2003 um opinberan stuðning við vísindarannsóknir sem og kröfur innlendra og erlendra rannsóknasjóða. Markmiðið með opnum aðgangi er að niðurstöður rannsókna séu aðgengilegar sem flestum óhindrað og án endurgjalds á rafrænu formi. Vistun í varðveislusafninu er varanleg og ætlað að tryggja aðgang að vísindaefni íslenskra háskóla í opnum aðgangi um ókomna tíð. Varðveislusafnið Opin vísindi er tengt við rannsóknagáttina IRIS og rannsóknaniðurstöður í opnum aðgangi sem eru skráðar í IRIS eru um leið vistaðar og gerðar aðgengilegar til framtíðar í varðveislusafninu. Með því að safna þessu efni saman í eitt safn verður aðgangur að því einfaldur og þægilegur fyrir alla sem vilja kynna sér það og geta þannig notið þess öfluga vísindastarfs sem fram fer í háskólum landsins.
Varðveislusafnið er OpenAIRE / OpenAIREplus samhæft og samrýmist kröfum sem gerðar eru um birtingu rannsóknaniðurstaðna úr verkefnum sem styrkt eru úr evrópsku rannsóknaáætlununum FP7 og H2020.
Varðveislusafnið notar opna hugbúnaðinn DSpace.
Nýlega bætt við
Monoid Structures on Indexed Containers
(2025) De Pascalis, Michele; Uustalu, Tarmo; Veltrì, Niccolò; Department of Computer Science
Containers represent a wide class of type constructions that are relevant for functional programming and (co)inductive reasoning. Indexed containers generalize this notion to better fit the scope of dependently typed programming. When interpreting types to be sets, a container describes an endo functoron the category of sets while an I-indexed container describes an endo functor on the category SetI of I-indexed families of sets. We consider the monoidal structure on the category of I-indexed containers whose tensor product of containers describes the composition of the respective induced endofunctors. We then give a combinatorial characterization of monoids in this monoidal category, and we show how these monoids correspond precisely to monads on the induced endofunctors on SetI. Lastly, we conclude by presenting some examples of monads on SetI that fall under our characterization, including the product of two monads, indexed variants of the state and the writer monads and an example of a free monad. The technical results of this work are accompanied by a formalization in the proof assistant Cubical Agda.
Introduction to Inclusive and Responsible Entrepreneurship in a Turbulent Era
(Edward Elgar Publishing Ltd., 2025-01-01) Durst, Susanne; Department of Business and Economics
Inclusive and Responsible Entrepreneurship in a Turbulent Era
(Edward Elgar Publishing Ltd., 2025-01-01) Durst, Susanne; Mbena, Jacques Yana; Viala, Céline; Department of Business and Economics
This incisive book uses real-world examples and historical insights to shed light on how inclusive and responsible entrepreneurship can lead to stronger economies and communities. Combining inclusivity, responsibility, crisis management and other related concepts, authors Susanne Durst, Jacques Yana Mbena and Céline Viala adopt a holistic approach to examining the practical benefits of inclusive and responsible entrepreneurship. The book highlights the crucial role that entrepreneurship plays in developing and implementing sustainable solutions in turbulent times and emphasises that contemporary entrepreneurship is more than just making money, but is about inclusion and equity in all entrepreneurial activities. The authors provide a variety of historical insights and examples to demonstrate the ways in which inclusive and responsible entrepreneurship can be a tool for social justice, economic equality and societal sustainability. Inclusive and Responsible Entrepreneurship in a Turbulent Era identifies barriers to incorporating inclusive and responsible entrepreneurship and presents practical and effective solutions to address them. Inclusive and Responsible Entrepreneurship in a Turbulent Era is an essential resource for scholars of entrepreneurship and business, as well as students of sustainable business development, business ethics and other related subjects in the social sciences. Entrepreneurs, policymakers and organisations wishing to support this form of entrepreneurship will also benefit from the book’‘s insights.
New Distributed Interactive Proofs for Planarity : A Matter of Left and Right
(Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 2025) Gil, Yuval; Parter, Merav; Kowalski, Dariusz R.
We provide new distributed interactive proofs (DIP) for planarity and related graph families. The notion of a distributed interactive proof (DIP) was introduced by Kol, Oshman, and Saxena (PODC 2018). In this setting, the verifier consists of n nodes connected by a communication graph G. The prover is a single entity that communicates with all nodes by short messages. The goal is to verify that the graph G satisfies a certain property (e.g., planarity) in a small number of rounds, and with a small communication bound, denoted as the proof size. Prior work by Naor, Parter and Yogev (SODA 2020) presented a DIP for planarity that uses three interaction rounds and a proof size of O(log n). Feuilloley et al. (PODC 2020) showed that the same can be achieved with a single interaction round and without randomization, by providing a proof labeling scheme with a proof size of O(log n). In a subsequent work, Bousquet, Feuilloley, and Pierron (OPODIS 2021) achieved the same bound for related graph families such as outerplanarity, series-parallel graphs, and graphs of treewidth at most 2. In this work, we design new DIPs that use exponentially shorter proofs compared to the state-of-the-art bounds. Our main results are: There is a 5-round protocol with O(log log n) proof size for outerplanarity. There is a 5-round protocol with O(log log n) proof size for verifying embedded planarity and O(log log n + log ∆) proof size for general planar graphs, where ∆ is the maximum degree in the graph. In the former setting, it is assumed that an embedding of the graph is given (e.g., each node holds a clockwise orientation of its neighbors) and the goal is to verify that it is a valid planar embedding. The latter result should be compared with the non-interactive setting for which there is lower bound of Ω(log n) bits for graphs with ∆ = O(1) by Feuilloley et al. (PODC 2020). The non-interactive deterministic lower bound of Ω(log n) bits by Feuilloley et al. (PODC 2020) can be extended to hold even if the verifier is randomized. Moreover, the lower bound holds even with the assumption that the verifier’s randomness comes in the form of an unbounded random string shared among the nodes. We also show that our DIPs can be extended to protocols with similar bounds for verifying series-parallel graphs and graphs with tree-width at most 2. Perhaps surprisingly, our results demonstrate that the key technical barrier for obtaining o(log log n) labels for all our problems is a basic sorting verification task in which all nodes are embedded on an oriented path P ⊆ G and it is desired for each node to distinguish between its left and right G-neighbors.
Generative artificial intelligence (GenAI) use and dependence : an approach from behavioral economics
(2025) Robayo-Pinzon, Oscar; Rojas-Berrio, Sandra; Camargo, Jorge E.; Foxall, Gordon R.; Department of Business and Economics
Objective: This study aims to explore the perceived dependence on Generative Artificial Intelligence (GenAI) tools among young adults and examine the relative reinforcing value of AI chatbots use compared to monetary rewards, applying a behavioral economics approach. Participants/methods: A total of 420 university students from Bogotá, Colombia, participated in an online survey. The study employed a Multiple Choice Procedure (MCP) to assess the relative reinforcement between different durations of GenAI use (1, 2, and 4 weeks) and monetary rewards, which varied in amount and delay. Additionally, an adapted AI Dependence Scale evaluated levels of dependence on AI tools. Data analysis included repeated measures ANOVA to examine the effects of reward magnitude and delay on choices, and correlations to assess the relationship between perceived dependence and reinforcement values. Results: Participants reported low average dependence on AI tools (mean AI Dependence Scale score = 65.6), with no significant gender differences. MCP findings indicated significant differences in crossover points across varying durations or delays for AI chatbots use, suggesting a higher relative value of use for the option to use AI chatbots immediately. The average reinforcement value for AI use versus monetary rewards did significantly vary with reward magnitude. On the other hand, significant differences were found in the levels of perceived dependence on AI, according to the average daily time of AI tool use. Conclusion: The results suggest that young adults exhibit low perceived dependence on GenAI tools but show differential reinforcement values based on usage duration or delay conditions. This behavioral economics approach provides novel insights into decision-making patterns related to AI chatbots use, emphasizing the need for further research to understand the psychological and social factors influencing dependence on AI technologies.
Flokkar í Opnum vísindum
Veldu flokk til að skoða.
- University of Iceland
- University of Akureyri
- Bifröst University
- Hólar University College
- IRIS
- Agricultural University of Iceland
- National and University Library of Iceland
- Iceland University of the Arts