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ð
Emergence of multiple topological spin textures in an all-magnetic van der Waals heterostructure
(American Physical Society, 2026-03-11) Goerzen, Moritz A.; Drevelow, Tim; Schrautzer, Hendrik; Haldar, Soumyajyoti; Heinze, Stefan; Li, Dongzhe; Faculty of Physical Sciences (UI); Raunvísindadeild (HÍ); School of Engineering and Natural Sciences (UI); Verkfræði- og náttúruvísindasvið (HÍ)
Magnetic solitons such as skyrmions and bimerons show great promise for both fundamental research and spintronic applications. Stabilizing and controlling topological spin textures in atomically thin van der Waals (vdW) materials has gained tremendous attention due to high tunability, enhanced functionality, and miniaturization. Here, we present an efficient spin-spiral approach based on first-principles, a method for mapping magnetic interactions from collective models onto arbitrary lattice symmetries, such as hexagonal and honeycomb lattices. Using atomistic spin models parametrized from first-principles, we predict the emergence of multiple topological spin textures in an all-magnetic vdW heterostructure Fe3GeTe2/Cr2Ge2Te6 (FGT/CGT) – an experimentally feasible system. Interestingly, the FGT layer favors out-of-plane magnetization, whereas the CGT layer prefers in-plane magnetocrystalline anisotropy. Neel-type nanoscale skyrmions are formed at zero ´ field in the FGT layer due to interfacial Dzyaloshinskii-Moriya interaction (DMI), while nanoscale bimerons and antibimerons can co-exist in the CGT layer by the interplay between exchange frustration and DMI. Using the collective approach we apply, we reveal significant discretization effects in hexagonal and honeycomb geometries. In particular, we demonstrate that the lifting of geometric exchange frustration on the honeycomb significantly affects soliton barriers and pinning energetics. These fundamental results not only highlight the importance of spin simulations in discrete models for topological magnetism, especially in 2D materials, but may also help to pave the way for solitonic devices based on atomically thin vdW heterostructures.
Identification of mechanisms of magnetic transitions using an efficient method for converging on first-order saddle points
(American Physical Society, 2025-09-24) Schrautzer, Hendrik; Sallermann, Moritz; Bessarab, Pavel F.; Jónsson, Hannes; Faculty of Physical Sciences (UI); Raunvísindadeild (HÍ); School of Engineering and Natural Sciences (UI); Verkfræði- og náttúruvísindasvið (HÍ)
An efficient and scalable implementation of a method for locating first-order saddle points on the energy surface of a magnetic system is presented, along with several applications in which the mechanisms of various magnetic transitions are identified. The starting point for the iterative search algorithm can be anywhere, even close to a local energy minimum representing an initial state of the system, and the final state need not be specified. Convergence on a saddle point is obtained by inverting the component of the gradient along the minimum mode, thereby effectively transforming the neighborhood of the saddle point to that of a local minimum. The method requires only the lowest two eigenvalues and corresponding eigenvectors of the Hessian of the system’s energy and they are found using a quasi-Newton limited-memory Broyden-Fletcher-Goldfarb-Shanno solver for the minimization of the Rayleigh quotient without explicit evaluation of the Hessian. The method is applicable to large systems, as it does not introduce additional scaling overhead to the computational complexity determined by the interactions present in the system. Applications are presented to transitions in systems that reveal significant complexity of coexisting magnetic states, such as skyrmions, skyrmion bags, skyrmion tubes, chiral bobbers, and globules. The identification of new metastable three-dimensional (3D) textures, such as magnetic bobbers with extended equilibrium distance between the base and the terminating Bloch point, and magnetic globules appearing as isolated states in 3D due to magnetostatic interactions, demonstrates the usefulness of the method for the characterization of complex energy surfaces of magnetic systems. When combined with rate theory within the harmonic approximation, the method can be used for simulations of the long timescale dynamics of complex magnetic systems characterized by multiple metastable states.
Electric vehicles roll-out in Europe: Towards an improved regulatory regime
(2019-10) Lazarczyk Carlson, Ewa; Baldursson, Friðrik Már; von der Fehr, Nils Henrik M.; Department of Business and Economics
Self-stabilising Byzantine clock synchronisation is almost as easy as consensus
(2019-09) Lenzen, Christoph; Rybicki, Joel; Department of Computer Science
We give fault-tolerant algorithms for establishing synchrony in distributed systems in which each of the n nodes has its own clock. Our algorithms operate in a very strong fault model: we require self-stabilisation, i.e., the initial state of the system may be arbitrary, and there can be up to f < n/3 ongoing Byzantine faults, i.e., nodes that deviate from the protocol in an arbitrary manner. Furthermore, we assume that the local clocks of the nodes may progress at different speeds (clock drift) and communication has bounded delay. In this model, we study the pulse synchronisation problem, where the task is to guarantee that eventually all correct nodes generate well-separated local pulse events (i.e., unlabelled logical clock ticks) in a synchronised manner. Compared to prior work, we achieve exponential improvements in stabilisation time and the number of communicated bits, and give the first sublinear-time algorithm for the problem: • In the deterministic setting, the state-of-the-art solutions stabilise in time Θ(f ) and have each node broadcast Θ(f log f ) bits per time unit. We exponentially reduce the number of bits broadcasted per time unit to Θ(log f ) while retaining the same stabilisation time. • In the randomised setting, the state-of-the-art solutions stabilise in time Θ(f ) and have each node broadcast O(1) bits per time unit. We exponentially reduce the stabilisation time to polylog f while each node broadcasts polylog f bits per time unit. These results are obtained by means of a recursive approach reducing the above task of self-stabilising pulse synchronisation in the bounded-delay model to non-self-stabilising binary consensus in the synchronous model. In general, our approach introduces at most logarithmic overheads in terms of stabilisation time and broadcasted bits over the underlying consensus routine.
Near-optimal self-stabilising counting and firing squads
(2019-08-01) Lenzen, Christoph; Rybicki, Joel; Department of Computer Science
Consider a fully-connected synchronous distributed system consisting of n nodes, where up to f nodes may be faulty and every node starts in an arbitrary initial state. In the synchronous C-counting problem, all nodes need to eventually agree on a counter that is increased by one modulo C in each round for given C> 1. In the self-stabilising firing squad problem, the task is to eventually guarantee that all non-faulty nodes have simultaneous responses to external inputs: if a subset of the correct nodes receive an external “go” signal as input, then all correct nodes should agree on a round (in the not-too-distant future) in which to jointly output a “fire” signal. Moreover, no node should generate a “fire” signal without some correct node having previously received a “go” signal as input. We present a framework reducing both tasks to binary consensus at very small cost. For example, we obtain a deterministic algorithm for self-stabilising Byzantine firing squads with optimal resilience f< n/ 3 , asymptotically optimal stabilisation and response time O(f), and message size O(log f). As our framework does not restrict the type of consensus routines used, we also obtain efficient randomised solutions.
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