Recent Submissions

  • Fundamentals of Norwegian CS1 

    Bolland, Sondre Sæther; Popov, Aleksandr; Eide, Tyra Fosheim; Kordts, Robert; Strømme, Torstein J. F. (Journal article; Peer reviewed, 2024)
    The introductory programming course, known as CS1, has evolved considerably since its inception, with diverse opinions on the essential concepts that should be included. This study aims to identify the fundamental concepts ...
  • EquinorQA: Large Language Models for Question Answering Over Proprietary Data 

    Garigliotti, Dario; Johansen, Bjarte; Kallestad, Jakob Vigerust; Cho, Seong-Eun; Ferri, Cesar (Chapter, 2024)
    Large Language Models (LLMs) have become the state-of-the-art technology in a variety of language understanding tasks. Accordingly, many commercial organizations have been increasingly trying to integrate LLMs in multiple ...
  • On the vector subspaces of \(\mathbb {F}_{2^n}\) over which the multiplicative inverse function sums to zero 

    Carlet, Claude Michael (Journal article; Peer reviewed, 2024)
    We study the behavior of the multiplicative inverse function (which plays an important role in cryptography and in the study of finite fields), with respect to a recently introduced generalization of almost perfect ...
  • Super domination: Graph classes, products and enumeration 

    Ghanbari, Nima; Jäger, Gerold; Lehtilä, Tuomo (Journal article; Peer reviewed, 2024)
    The dominating set problem (DSP) is one of the most famous problems in combinatorial optimization. It is defined as follows. For a given graph G = (V , E), a dominating set of G is a subset S ⊆ V such that every vertex in ...
  • Characterising Modal Formulas with Examples 

    Ten Cate, Balder; Koudijs, Raoul (Journal article; Peer reviewed, 2024)
    We study the existence of finite characterisations for modal formulas. A finite characterisation of a modal formula φ is a finite collection of positive and negative examples that distinguishes φ from every other, ...
  • Optimal Robust Simplifications for Explaining Time Series Classifications 

    Telle, Jan Arne; Håvardstun, Brigt Arve Toppe; Ferri, Cesar (Journal article; Peer reviewed, 2024)
    Given a Time Series Classifier (TSC) and three parameters that balance between error, simplicity and robustness, we define an optimization problem over all possible ways of simplifying a given time series ts into straight-line ...
  • Arithmetization-oriented APN permutations 

    Budaghyan, Lilya; Pal, Mohit (Journal article; Peer reviewed, 2024)
    Recently, many cryptographic primitives such as homomorphic encryption (HE), multi-party computation (MPC) and zero-knowledge (ZK) protocols have been proposed in the literature which operate on the prime field \({\mathbb ...
  • On the Square Root Computation in Liber Abaci and De Practica Geometrie by Fibonacci 

    Steihaug, Trond (Journal article; Peer reviewed, 2024)
    We study the square root computation by Leonardo Fibonacci (or Leonardo of Pisa) in his MSS Liber Abaci from c1202 and c1228 and De Practica Geometrie from c1220. In this MSS, Fibonacci systematically describes finding the ...
  • Angle-Agnostic Radio Frequency Sensing Integrated into 5G-NR 

    Salami, Dariush; Hasibi, Ramin; Savazzi, Stefano; Michoel, Tom; Sigg, Stephan (Journal article; Peer reviewed, 2024)
    The fusion of radio frequency (RF) sensing with cellular communication networks presents a revolutionary paradigm, enabling networks to seamlessly integrate communication and perception capabilities. Leveraging electromagnetic ...
  • A Survey on Complexity Measures for Pseudo-Random Sequences 

    Li, Chunlei (Journal article; Peer reviewed, 2024)
    Since the introduction of the Kolmogorov complexity of binary sequences in the 1960s, there have been significant advancements on the topic of complexity measures for randomness assessment, which are of fundamental importance ...
  • State Canonization and Early Pruning in Width-Based Automated Theorem Proving 

    De Oliveira Oliveira, Mateus; Vadiee, Farhad (Journal article; Peer reviewed, 2024)
    Width-based automated theorem proving is a framework where counter-examples for graph theoretic conjectures are searched width-wise relative to some graph width measure, such as treewidth or pathwidth. In a recent work it ...
  • Visual Support for the Loop Grafting Workflow on Proteins 

    Opálený, Filip; Ulbrich, Pavol; Planas-Iglesias, Joan; Byska, Jan; Stourac, Jan; Bednar, David; Furmanová, Katarína; Kozlíková, Barbora (Journal article; Peer reviewed, 2025)
    In understanding and redesigning the function of proteins in modern biochemistry, protein engineers are increasingly focusing on exploring regions in proteins called loops. Analyzing various characteristics of these regions ...
  • ReGaTE: Registration of galaxy tools in Elixir 

    Doppelt-Azeroual, Olivia; Mareuil, Fabien; Deveaud, Eric; Kalaš, Matúš; Soranzo, Nicole; van den Beek, Marius; Grüning, Björn; Ison, Jon; Ménager, Hervé (Journal article, 2017)
    Background: Bioinformaticians routinely use multiple software tools and data sources in their day-to-day work and have been guided in their choices by a number of cataloguing initiatives. The ELIXIR Tools and Data Services ...
  • On coresets for fair clustering in metric and Euclidean spaces and their applications 

    Bandyapadhyay, Sayan; Fomin, Fedor; Simonov, Kirill (Journal article; Peer reviewed, 2024)
    Fair clustering is a constrained clustering problem where we need to partition a set of colored points. The fraction of points of each color in every cluster should be more or less equal to the fraction of points of this ...
  • Prediction of causal genes at GWAS loci with pleiotropic gene regulatory effects using sets of correlated instrumental variables 

    Khan, Mariyam; Ludl, Adriaan-Alexander; Bankier, Sean; Björkegren, Johan L.M.; Michoel, Tom (Journal article; Peer reviewed, 2024)
    Multivariate Mendelian randomization (MVMR) is a statistical technique that uses sets of genetic instruments to estimate the direct causal effects of multiple exposures on an outcome of interest. At genomic loci with ...
  • Deciphering the impact of PROM1 alternative splicing on human photoreceptor development and maturation 

    Moya-Molina, Marina; Dorgau, Birthe; Flood, Emily; Letteboer, Stef J F; Lorentzen, Esben; Coxhead, Jonathan; Smith, Graham; Roepman, Ronald; Grellscheid, Sushma Nagaraja; Armstrong, Lyle; Lako, Majlinda (Journal article; Peer reviewed, 2024)
    Alternative splicing (AS) is a crucial mechanism contributing to proteomic diversity, which is highly regulated in tissue- and development-specific patterns. Retinal tissue exhibits one of the highest levels of AS. In ...
  • Trajectory-based fish event classification through pre-training with diffusion models 

    Canovi, Noemi; Ellis, Benjamin A.; Sørdalen, Tonje Knutsen; Allken, Vaneeda; Halvorsen, Kim Aleksander Tallaksen; Malde, Ketil; Beyan, Cigdem (Journal article; Peer reviewed, 2024)
    This study contributes to advancing the field of automatic fish event recognition in natural underwater videos, addressing the current gap in studying fish interaction and competition, including predator-prey relationships ...
  • Efficient Preprocessing and Algorithm for Bicluster Editing with Vertex Splitting 

    Haugen, Erlend (Master thesis, 2025-03-13)
    Bicluster editing, a cousin to the well-known cluster editing problem, is gaining interest due to its applications in domains such as social network analysis, recommendation, biology, and markets. This thesis introduces ...
  • MPCC: strong stability of weakly nondegenerate S-stationary points 

    Günzel, Harald; Hernández Escobar, Daniel; Rückmann, Jan-Joachim (Journal article; Peer reviewed, 2024)
    In this paper, we consider the class of mathematical programmes with complementarity constraints (MPCC). Specifically, we focus on strong stability of M- and S-stationary points for MPCC. Kojima introduced this concept for ...
  • TØIRoads: A Road Data Model Generation Tool 

    Wesenberg, Grunde Haraldsson; Ozaki Rivera Castillo, Ana (Journal article; Peer reviewed, 2024)
    We describe road data models which can represent high level features of a road network such as population, points of interest, and road length/cost and capacity, while abstracting from time and geographic location. Such ...

View more