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ð
A pragmatic strength and conditioning intervention for firefighters : Feasibility of the Tactical Athlete Resilience Program (TARP)
(2023-02) Sharp, Paul; Caperchione, Cristina M.; Brown, Georgia A.; Stadnyk, Antony; Marin, Elizabeth; Hulin, Billy; Wade, Jarrod; Mott, Brendan; Gabriel, Mark; Impellizzeri, Franco; Fullagar, Hugh H.K.; Department of Sport Science
Issue Addressed: Firefighting is physically and mentally taxing and recruits are expected to have optimal health and fitness. However, physical fitness tends to decline following initial training, placing firefighters at an increased risk for stress and injury. Efforts are needed to engage and support firefighters in maintaining adequate health and fitness to withstand the rigorous demands of their occupation. This study examined the feasibility of TARP, a pragmatic strength and conditioning intervention for metropolitan-based firefighters, delivered in collaboration with a professional National Rugby League club. Methods: A mixed-methods approach was utilised to examine program implementation, recruitment and sample characteristics, intervention satisfaction and acceptability, and participants' response to the intervention. Evaluation measures included field notes taken during steering committee meetings, participant flow data, baseline and follow-up outcome measures, self-report questionnaires, and telephone interviews with a sample of participants. Results: Participants (N = 113) were predominantly men (82%) with a mean age of 43 ± 9.3 years and BMI of 26.6 ± 2.9 kg/m2. Program satisfaction was high (95% very satisfied or somewhat satisfied) among program completers (42% retention). Key strengths of the program included delivery through the professional sports club, quality of facilities and equipment, and scheduling flexibility. Future programs should consider incorporating education or training to support behaviour change maintenance and strategies to retain participants at follow-up. Conclusions: Results provide valuable insights into the design and delivery of interventions for firefighters and demonstrate the importance of strong partnerships between community stakeholders.
Comparing Interactive Retrieval Approaches at the Lifelog Search Challenge 2021
(2023) Tran, Ly Duyen; Nguyen, Manh Duy; Dang-Nguyen, Duc Tien; Heller, Silvan; Spiess, Florian; Lokoc, Jakub; Peska, Ladislav; Nguyen, Thao Nhu; Khan, Omar Shahbaz; Duane, Aaron; Jónsson, Björn Þór; Rossetto, Luca; Yen, An Zi; Alateeq, Ahmed; Alam, Naushad; Tran, Minh Triet; Healy, Graham; Schoeffmann, Klaus; Gurrin, Cathal; Department of Computer Science
The Lifelog Search Challenge (LSC) is an interactive benchmarking evaluation workshop for lifelog retrieval systems. The challenge was first organised in 2018 aiming to find the system that can quickly retrieve relevant lifelog images for a given semantic query. This paper provides an analysis of the performance of all 17 systems participating in the 4th LSC workshop held at the 2021 Annual ACM International Conference on Multimedia Retrieval (ICMR). LSC'21 was the largest effort at comparing different approaches to interactive lifelog retrieval systems seen thus far. Findings from the challenge suggest that many different interactive factors contribute to the success (or otherwise) of participating teams. In this paper, we provide an overview of the LSC'21 challenge, introduce each team's approach and explore these factors in depth and offer clues on how to develop a high-performing interactive lifelog search engine.
Fast All-Digital Clock Frequency Adaptation Circuit for Voltage Droop Tolerance
(2022-08-01) Fugger, Matthias; Kinali, Attila; Lenzen, Christoph; Wiederhake, Ben; Department of Computer Science
In classical synchronous designs, supply voltage droops can be handled by accounting for them in clock margins. However, this results in a significant performance hit even if droops are rare. In contrast, adaptive strategies detect such potentially hazardous events and either initiate a rollback to a previous state or proactively reduce clock speed in order to prevent timing violations. The performance of such solutions critically depends on a very fast response to droops. State-of-the-art solutions incur synchronization delays in the order of several clock cycles to avoid, with sufficient probability, that the clock signal is affected by metastability. We present an all-digital circuit that can respond to droops within a fraction of a clock cycle. This is achieved by using potentially metastable measurement values to delay clock signals while they undergo synchronization, instead of after they are synchronized. The challenge is to ensure that this strategy does not lead to harmful glitches or metastable upsets within the circuit. To this end, we verify our solution by formally proving correctness. We complement our findings by simulations of a 65-nm ASIC design confirming the results of our analysis.
Optimal Clock Synchronization with Signatures
(Association for Computing Machinery, 2022-07-21) Lenzen, Christoph; Loss, Julian; Department of Computer Science
Cryptographic signatures can be used to increase the resilience of distributed systems against adversarial attacks, by increasing the number of faulty parties that can be tolerated. While this is well-studied for consensus, it has been underexplored in the context of fault-tolerant clock synchronization, even in fully connected systems. Here, the honest parties of an n-node system are required to compute output clocks of small skew (i.e., phase offset) despite local clock rates varying between 1 and ' > 1, end-to-end communication delays varying between d - u and d, and the interference from malicious parties. Known algorithms with (trivially optimal) resilience of [n/2] - 1 improve over the tight bound of [n/3] - 1 holding without signatures for any skew bound [6, 18], but incur skew d [1] or ω(n(u + ( ' - 1)d)) [14]. Since typically d >> u and ' - 1 « 1, this is far from the lower bound of u + ( ' - 1)d that applies even in the fault-free case [3].
Brief Announcement : (1+)-Approximate Shortest Paths in Dynamic Streams.
(Association for Computing Machinery, 2022-07-21) Elkin, Michael; Trehan, Chhaya; Department of Computer Science
Computing approximate shortest paths in the dynamic streaming setting is a fundamental challenge that has been intensively studied. Currently existing solutions for this problem either build a sparse multiplicative spanner of the input graph and compute shortest paths in the spanner offline, or compute an exact single source BFS tree. Solutions of the first type are doomed to incur a stretch-space tradeoff of 2k - 1 versus n1+1/k , for an integer parameter k. (In fact, existing solutions also incur an extra factor of 1+ in the stretch for weighted graphs, and an additional factor of logO(1) n in the space.) The only existing solution of the second type uses n1/2-O(1/k) passes over the stream (for space O(n1+1/k )), and applies only to unweighted graphs.
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