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ð
Regulatory Trust in EU Free Movement Law : Adopting the Level of Protection of the Other?
(2016) Groussot, Xavier; Petursson, Gunnar Thor; Wenander, Henrik; Department of Law
The principles of mutual trust and mutual recognition are well established features of EU law. On a technical level, it is clear that the principles may require adoption of foreign levels of protection in individual cases as well as in legislation. At a closer look, however, the principles through “the rule of reason” also may imply quite the opposite: the imposing of domestic requirements on foreign goods, services etc. The CJEU case law following the Cassis judgement may be seen as striking a balance between cooperation and Member State self-determination, or between trust and distrust, in different fields. This contribution aims at looking into the regulatory function of the legal principle of trust in EU law. Taking this wider regulatory perspective, the mutual recognition regimes of EU must be seen from a holistic perspective. Rather than dwelling upon harmonized and non-harmonized fields separately, we will approach mutual trust as one, albeit multi-faceted, concept, where harmonization, proportionality assessments and Member State actions in various fields of law form part of the same wider picture. In this regulatory perspective, the law on mutual trust and mutual recognition may be seen as a balancing between the regulatory interests of the EU (promoting free movement and cooperation) and the various Member St(promoting their interests of, alleged, protection of safety of various kinds). Through this perspective, we will be able to address the tension between regulation and deregulation, between integration and disintegration, and between unity and diversity present in EU law on a very general level. The first section of this contribution will look at the constitutional life of mutual trust within the CJEU case law:looking at its origins and main logic. The second section will attempt to clarify why the principle of mutual trust is mostly invisible in the free movement jurisprudence. This section also argues for understanding mutual recognition in terms of Regulatory Trust. The last section focuses on the thorny issue of the levels of protection and attempts to understand which are the key factors used by the CJEU in reviewing the (host) States measures that restrict free movement law and thus may constitute a break to the application of the principles of mutual trust and mutual recognition.
Beyond geometry : Towards fully realistic wireless models
(Association for Computing Machinery, 2014-07-15) Bodlaender, Marijke H.L.; Halldórsson, Magnús M.
Signal-strength models of wireless communications capture the gradual fading of signals and the additivity of interference. As such, they are closer to reality than other models. However, nearly all theoretic work in the SINR model depends on the assumption of smooth geometric decay, one that is true in free space but is far off in actual environments. The challenge is to model realistic environments, including walls, obstacles, reflections and anisotropic antennas, without making the models algorithmically impractical or analytically intractable. We present a simple solution that allows the modeling of arbitrary static situations by moving from geometry to arbitrary decay spaces. The complexity of a setting is captured by a metricity parameter ζ that indicates how far the decay space is from satisfying the triangular inequality. All results that hold in the SINR model in general metrics carry over to decay spaces, with the resulting time complexity and approximation depending on ζ in the same way that the original results depends on the path loss term α. For distributed algorithms, that to date have appeared to necessarily depend on the planarity, we indicate how they can be adapted to arbitrary decay spaces at a cost in time complexity that depends on a fading parameter of the decay space. In particular, for decay spaces that are doubling, the parameter is constant-bounded. Finally, we explore the dependence on ζ in the approximability of core problems. In particular, we observe that the capacity maximization problem has exponential upper and lower bounds in terms of ζ in general decay spaces. In Euclidean metrics and related growth-bounded decay spaces, the performance depends on the exact metricity definition, with a polynomial upper bound in terms of ζ but an exponential lower bound in terms of a variant parameter φ. The upper bound result is the first approximation of a capacity-type SINR problem that is subexponential in α.
Connectivity and aggregation in multihop wireless networks
(Association for Computing Machinery, 2013-07-22) Bodlaender, Marijke H.L.; Halldórsson, Magnús M.; Mitra, Pradipta; Department of Computer Science
We present randomized distributed algorithms for connectivity and aggregation in multi-hop wireless networks under the SINR model. The connectivity problem asks for a set of links that strongly connect a given set of wireless nodes, along with an efficient schedule. Aggregation asks for a spanning in-arborescence (converge-cast tree), along with a schedule that additionally obeys the partial order defined by the tree. Here we treat the multi-hop case, where nodes have limited power that restricts the links they can potentially form. We show that connectivity is possible for any set of n nodes in O(log n) slots, which matches the best centralized bound known, and that aggregation is possible in O(D +log n) time (D being the maximum hop-distance), which is optimal.
Online set packing and competitive scheduling of multi-part tasks
(Association for Computing Machinery (ACM), 2010-07-25) Emek, Yuval; Halldórsson, Magnús M.; Mansour, Yishay; Patt-Shamir, Boaz; Radhakrishnan, Jaikumar; Rawitz, Dror; Department of Computer Science
We consider a scenario where large data frames are broken into a few packets and transmitted over the network. Our focus is on a bottleneck router: the model assumes that in each time step, a set of packets (a burst) arrives, from which only one packet can be served, and all other packets are lost. A data frame is considered useful only if none of its constituent packets is lost, and otherwise it is worthless. We abstract the problem as a new type of online set packing, present a randomized distributed algorithm and a matching lower bound on the competitive ratio for any randomized online algorithm. Our bounds are expressed in terms of the maximal burst size and the maximal number of packets per frame. We also present refined bounds that depend on the uniformity of these parameters.
Prevalence of autism in an urban population of adults with severe intellectual disabilities - a preliminary study
(2010) Saemundsen, E.; Juliusson, H.; Hjaltested, S.; Gunnarsdottir, T.; Halldorsdottir, T.; Hreidarsson, S.; Magnusson, P.
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