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ð
Efficient, sparse biological network determination
(2009-02-23) August, Elias; Papachristodoulou, Antonis; Department of Engineering
Background: Determining the interaction topology of biological systems is a topic that currently attracts significant research interest. Typical models for such systems take the form of differential equations that involve polynomial and rational functions. Such nonlinear models make the problem of determining the connectivity of biochemical networks from time-series experimental data much harder. The use of linear dynamics and linearization techniques that have been proposed in the past can circumvent this, but the general problem of developing efficient algorithms for models that provide more accurate system descriptions remains open. Results: We present a network determination algorithm that can treat model descriptions with polynomial and rational functions and which does not make use of linearization. For this purpose, we make use of the observation that biochemical networks are in general 'sparse' and minimize the 1-norm of the decision variables (sum of weighted network connections) while constraints keep the error between data and the network dynamics small. The emphasis of our methodology is on determining the interconnection topology rather than the specific reaction constants and it takes into account the necessary properties that a chemical reaction network should have - something that techniques based on linearization can not. The problem can be formulated as a Linear Program, a convex optimization problem, for which efficient algorithms are available that can treat large data sets efficiently and uncertainties in data or model parameters. Conclusion: The presented methodology is able to predict with accuracy and efficiency the connectivity structure of a chemical reaction network with mass action kinetics and of a gene regulatory network from simulation data even if the dynamics of these systems are non-polynomial (rational) and uncertainties in the data are taken into account. It also produces a network structure that can explain the real experimental data of L. lactis and is similar to the one found in the literature. Numerical methods based on Linear Programming can therefore help determine efficiently the network structure of biological systems from large data sets. The overall objective of this work is to provide methods to increase our understanding of complex biochemical systems, particularly through their interconnection and their non-equilibrium behavior.
Predictability of cortico-cortical connections in the mammalian brain
(2024) Molnár, F.; Horvát, S.; Gomes, A.R.R.; Armas, J.M.; Molnár, B.; Ercsey-Ravasz, M.; Knoblauch, K.; Kennedy, H.; Toroczkai, Z.; Department of Computer Science
Mining Association Rules From a Multimodal Dataset of a Digital Therapeutics Application for Sleep Improvement Through a Healthy Lifestyle : Quantitative Study
(2026) Biedebach, Luka; Friðgeirsdóttir, Katrín Ýr; Carpinelli, Camilla; Isberg, Ari Páll; Helgadóttir, Halla; Arnardóttir, Erna Sif; Saavedra, Jose M.; Islind, Anna Sigridur; Department of Engineering; Department of Sport Science; Department of Computer Science
Background: The demand for sleep interventions is high and steadily growing. Digital therapeutics (DTx) can help individuals improve their sleep remotely, over an extended period, and with less effort from medical professionals. Obstructive sleep apnea (OSA), one of the most prevalent and consequential sleep disorders, can be treated with health-supporting behavior changes, such as physical exercise and weight loss, and, therefore, acts as a promising application for DTx. Objective: The study aimed to analyze a digital intervention from both medical and technological perspectives by moving beyond clinical markers and exploring more deeply how the DTx application was used. This study aimed to propose a novel way in which association rules can function as an exploratory tool to analyze the sleep, behavior, and engagement of participants with the DTx application on a day-to-day level. Methods: A lifestyle intervention study (N=192) targeted at adults with mild-to-moderate OSA aimed to reduce their OSA severity using a DTx application and an exercise program over a study period of 12 weeks. The participants’ OSA severity was assessed through polysomnography at the beginning and at the end of the study period, and the participants tracked their sleep with a digital sleep diary and a smartwatch over the course of the entire study. The DTx application provided data on when and how the participants pursued the proposed lifestyle interventions. These heterogeneous data sources were combined into one multimodal dataset, which was explored through descriptive statistics. Ultimately, the data were turned into a transaction-based format, and association rules were derived using the Apriori algorithm. Results: Analyzing the participants’ interaction with the application revealed the lifestyle interventions they pursued and how their behavior and sleep patterns changed over time. The Apriori algorithm generated a set of association rules with lift and confidence scores that were significantly higher than those for the co-occurrence of items through random chance. The rules show co-occurrence of missions and items from the sleep diary, as well as items derived from the watch measurements. Conclusions: The study showed the richness of the various data sources provided by a digital intervention using wearables and how they can be used to get an in-depth understanding of the study. The generated association rules showed the presence of significant co-occurrences across the different data modalities and highlighted their effectiveness as an exploratory tool for multimodal health data.
Making Software Development More Diverse and Inclusive : Key Themes, Challenges, and Future Directions
(2025-05-27) Hyrynsalmi, Sonja M.; Baltes, Sebastian; Brown, Chris; Prikladnicki, Rafael; Rodriguez-Perez, Gema; Serebrenik, Alexander; Simmonds, Jocelyn; Trinkenreich, Bianca; Wang, Yi; Liebel, Grischa; Department of Computer Science
Introduction: Digital products increasingly reshape industries, influencing human behavior and decision-making. However, the software development teams developing these systems often lack diversity, which may lead to designs that overlook the needs, equal treatment or safety of diverse user groups. These risks highlight the need for fostering diversity and inclusion in software development to create safer, more equitable technology. Method: This research is based on insights from an academic meeting in June 2023 involving 23 software engineering researchers and practitioners. We used the collaborative discussion method 1-2-4-ALL as a systematic research approach and identified six themes around the theme “challenges and opportunities to improve Software Developer Diversity and Inclusion (SDDI).” We identified benefits, harms, and future research directions for the four main themes. Then, we discuss the remaining two themes, AI & SDDI and AI & Computer Science education, which have a cross-cutting effect on the other themes. Results: This research explores the key challenges and research opportunities for promoting SDDI, providing a roadmap to guide both researchers and practitioners. We underline that research around SDDI requires a constant focus on maximizing benefits while minimizing harms, especially to vulnerable groups. As a research community, we must strike this balance in a responsible way.
Low-degree graph partitioning via local search with applications to constraint satisfaction, max cut, and coloring
(1997) Halldórsson, Magnús M.; Lau, Hoong Chuin; Department of Computer Science
We present practical algorithms for constructing partitions of graphs into a fixed number of vertex-disjoint subgraphs that satisfy particular degree constraints. We use this in particular to find k-cuts of graphs of maximum degree △ that cut at least a k-1/k (1 + 1/2△+k-1) fraction of the edges, improving previous bounds known. The partitions also apply to constraint networks, for which we give a tight analysis of natural local search heuristics for the maximum constraint satisfaction problem. These partitions also imply efficient approximations for several problems on weighted bounded-degree graphs. In particular, we improve the best performance ratio for the weighted independent set problem to 3/△+2, and obtain an efficient algorithm for coloring 3-colorable graphs with at most 3△+2/4 colors.
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