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ð
E-PhishGEN : Unlocking Novel Research in Phishing Email Detection
(Association for Computing Machinery, Inc, 2025-12-30) Pajola, Luca; Caripoti, Eugenio; Banzer, Stefan; Pizzi, Simeone; Conti, Mauro; Apruzzese, Giovanni; Department of Computer Science
Every day, our inboxes are flooded with unsolicited emails, ranging between annoying spam to more subtle phishing scams. Unfortunately, despite abundant prior efforts proposing solutions achieving near-perfect accuracy, the reality is that countering malicious emails still remains an unsolved dilemma. This "open problem"paper carries out a critical assessment of scientific works in the context of phishing email detection. First, we focus on the benchmark datasets that have been used to assess the methods proposed in research. We find that most prior work relied on datasets containing emails that - we argue - are not representative of current trends, and mostly encompass the English language. Based on this finding, we then re-implement and re-assess a variety of detection methods reliant on machine learning (ML), including large-language models (LLM), and release all of our codebase - an (unfortunately) uncommon practice in related research. We show that most such methods achieve near-perfect performance when trained and tested on the same dataset - a result which intrinsically hinders development (how can future research outperform methods that are already near perfect?). To foster the creation of "more challenging benchmarks"that reflect current phishing trends, we propose E-PhishGEN, an LLM-based (and privacy-savvy) framework to generate novel phishing-email datasets. We use our E-PhishGEN to create E-PhishLLM, a novel phishing-email detection dataset containing 16616 emails in three languages. We use E-PhishLLM to test the detectors we considered, showing a much lower performance than that achieved on existing benchmarks - indicating a larger room for improvement. We also validate the quality of E-PhishLLM with a user study (n=30). To sum up, we show that phishing email detection is still an open problem - and provide the means to tackle such a problem by future research.
Dynamic Current Distribution in the Electrodes of Submerged Arc Furnace Using Scalar and Vector Potentials
(Springer Verlag, 2018) Tesfahunegn, Yonatan Afework; Magnusson, Thordur; Tangstad, Merete; Saevarsdottir, Gudrun; Krzhizhanovskaya, Valeria V.; Lees, Michael Harold; Sloot, Peter M.; Dongarra, Jack; Shi, Yong; Tian, Yingjie; Fu, Haohuan; Department of Engineering
This work presents computations of electric current distributions inside an industrial submerged arc furnace. A 3D model has been developed in ANSYS Fluent that solves Maxwell’s equations based on scalar and vector potentials approach that are treated as transport equations. In this paper, the approach is described in detail and numerical simulations are performed on an industrial three-phase submerged arc furnace. The current distributions within electrodes due to skin and proximity effects are presented. The results show that the proposed method adequately models these phenomena.
Distributed large independent sets in one round on bounded-independence graphs
(Springer Verlag, 2015) Halldórsson, Magnús M.; Konrad, Christian; Moses, Yoram; Department of Computer Science
We present a randomized one-round, single-bit messages, distributed algorithm for the maximum independent set problem in polynomially bounded-independence graphs with poly-logarithmic approximation factor. Bounded-independence graphs capture various models of wireless networks such as the unit disc graphs model and the quasi unit disc graphs model. For instance, on unit disc graphs, our achieved approximation ratio is (Formula presented.). A starting point of our work is an extension of Turán’s bound for independent sets by Caro and Wei which states that every graph G = (V,E) contains an independent set of size at least (Formula presented.), where degG(v) denotes the degree of v in G. Alon and Spencer’s proof of the Caro-Wei bound in [1] suggests a randomized distributed oneround algorithm that outputs an independent set of expected size equal to β(G), using messages of sizes O(log n), where n is the number of vertices of the input graph. To achieve our main result, we show that β(G) gives poly-logarithmic approximation ratios for polynomially boundedindependence graphs. Then, for O(1)-claw free graphs (which include graphs of bounded-independence), we show that using a different algorithm, an independent set of expected size Θ(β(G)) can be computed in one round using single bit messages, thus reducing the communication cost to an absolute minimum. Last, in general graphs, β(G) may only give an Ω(n)-approximation. We show, however, that this is best possible for one-round algorithms: We show that each such distributed algorithm (possibly randomized) has an approximation ratio of Ω(n) on general graphs.
Harnessing Selective State Space Models to Enhance Semianalytical Design of Fabrication-Ready Multilayered Huygens' Metasurfaces : Part I - Field-based Semianalytical Synthesis
(2026-03-04) Marcus, Sherman W.; Nissan, Natanel; Killamsetty, Vinay K.; Yadav, Ravi; Raviv, Dan; Giryes, Raja; Epstein, Ariel; Verkfræðideild
Planar metasurfaces can profoundly control electromagnetic scattering. At microwave frequencies, such devices are typically implemented using multilayer cascades of patterned metallic sheets, whose design often requires time-consuming full-wave optimization. Here, we extend analytical models originally developed for sparse loaded-wire metagratings to accurately describe densely packed Jerusalem-cross meta-atoms embedded in standard printed circuit board (PCB) dielectric stacks. The model captures both near- and far-field coupling within and between layers, enabling efficient prediction of the dual-polarized response. Using this framework, we identify highly transmissive meta-atoms whose phase is controlled by the leg lengths of the Jerusalem crosses (microscopic design stage). This (phase)-(leg-length) "lookup table" allows rapid synthesis of Huygens' metasurfaces (macroscopic design stage), demonstrated through a full-wave-validated metalens exhibiting low-reflection beam manipulation. Notably, we implement a judicious scaling method to further extend the model to predict wideband meta-atom responses. In the companion paper (Part II), a hybrid machine-learning approach leverages this semianalytical framework to enhance accuracy without requiring the conventional exhaustive full-wave training, enabling ultrafast inverse design across the full parameter space. Overall, the presented methodology -- the standalone semianlytical scheme (Part I) and the machine-learning enhanced version (Part II) -- establishes an effective open-source toolkit for versatile, rapid, and highly accurate synthesis of fabrication-ready dual-polarized transmissive Huygens' meta-atoms and metasurfaces.
“Are Crowdsourcing Platforms Reliable for Video Game-related Research?” A Case Study on Amazon Mechanical Turk
(Association for Computing Machinery, Inc, 2024-10-14) Eisele, Linus; Apruzzese, Giovanni; Department of Computer Science
Video games are becoming increasingly popular in research, and abundant prior work has investigated this domain by means of user studies. However, carrying out user studies whose population encompasses a large and diverse set of participants is challenging. Crowdsourcing platforms, such as Amazon Mechanical Turk (AMT), represent a cost-effective solution to address this problem. Yet, prior efforts scrutinizing the data-quality (unrelated to gaming) collected via AMT raises a concern: is AMT reliable for game studies? In this paper, we are the first to tackle this question. We carry out three user studies (n=302) through which we evaluate the overall validity of the responses—pertaining to 14 popular video games—we received via AMT. We adopt strict verification mechanisms, which are trivial to “bypass” by real gamers, but costly for non-gamers. We found that the percentage of valid responses ranges from 5% (for WoW) to 28% (for PUBG). We hence advocate future research to carefully scrutinize the validity of responses collected via AMT.
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