Now showing items 41-60 of 1130

    • Inferring Gene Expression Values In Causal Directed Acyclic Graphs Using Graph Neural Networks 

      Solevåg, Bendik Akselsen (Master thesis, 2023-08-21)
      Inferring gene expression values is helpful in determining important characteristics about an individual. Existing methods in gene expression inference mostly rely on linear meth- ods creating separate models for each gene. ...
    • A faster algorithm for computing c-closure 

      Kvalsøren, Tuva Ulveseth (Master thesis, 2023-06-13)
      Exploiting the structure of graphs is a well-known strategy for solving hard problems on complex graphs. In our studies we consider structural characteristics of social network graphs, in particular ways to exploit the ...
    • Thickness Distribution of Boolean Functions in 4 and 5 Variables 

      Hopp, Mathias Ludvig Presterud (Master thesis, 2020-05-12)
      This thesis explores the distribution of algebraic thickness of Boolean functions in four and five variables, that is, the minimum number of terms in the ANF of the functions in the orbit of a Boolean function, through all ...
    • Automatic Model Repair Using Machine Learning 

      Marthinsen, Magnus (Master thesis, 2020-06-03)
    • Mobility Index Algorithm: A construction of a mathematical based mobility measurement algorithm based on dynamic data with a design science research approach 

      Fuglestein, Mikal (Master thesis, 2020-06-16)
      To have good mobility regarding public transport and to nearby facilities such as schools and shops is essential for reducing the use of private cars. One can only say how good mobility is for a given point by measure it. ...
    • Batch Queue Interface for the JAliEn Grid Middleware 

      Reme-Ness, Haakon André (Master thesis, 2020-06-16)
    • Software to locate avalanche transceivers using drone 

      Arnesen, Kevin (Master thesis, 2020-06-08)
      Avalanches are dangerous events that can be lethal to victims caught by its devastating impacts. The survival chance of the victims decreases drastically with time, where after 10 minutes the chance for survival is slim. ...
    • Implementing a Marker-less application for Kristkirken using Vuforia SDK 

      Solatian, Arezoo (Master thesis, 2019-11-20)
    • Graph Algebras and Derived Graph Operations 

      Wolter, Uwe; Truong, Tam T. (Journal article, 2023)
      We revise our former definition of graph operations and correspondingly adapt the construction of graph term algebras. As a first contribution to a prospective research field, Universal Graph Algebra, we generalize some ...
    • Finding haplotypic signatures in proteins 

      Vasicek, Jakub; Skiadopoulou, Dafni; Kuznetsova, Ksenia; Wen, Bo; Johansson, Stefan; Njølstad, Pål Rasmus; Bruckner, Stefan; Käll, Lukas; Vaudel, Marc (Journal article; Peer reviewed, 2023)
      Background The nonrandom distribution of alleles of common genomic variants produces haplotypes, which are fundamental in medical and population genetic studies. Consequently, protein-coding genes with different ...
    • A Novel Evolutionary Solution Approach for Many-objective Reliability-Redundancy Allocation Problem Based on Objective Prioritization and Constraint Optimization 

      Nath, Rahul (Journal article; Peer reviewed, 2024)
      The reliability redundancy allocation problem (RRAP) has been mostly solved either as a single or as a multi-objective optimization problem. However, this problem also has numerous important constraints which play prominent ...
    • Measuring Adversarial Robustness using a Voronoi-Epsilon Adversary 

      Kim, Hyeongji; Parviainen, Pekka; Malde, Ketil (Journal article; Peer reviewed, 2023)
      Previous studies on robustness have argued that there is a tradeoff between accuracy and adversarial accuracy. The tradeoff can be inevitable even when we neglect generalization. We argue that the tradeoff is inherent to ...
    • Further investigations on permutation based constructions of bent functions 

      Li, Kangquan; Li, Chunlei; Helleseth, Tor; Qu, Longjiang (Journal article; Peer reviewed, 2023)
      Constructing bent functions by composing a Boolean function with a permutation was introduced by Hou and Langevin in 1997. The approach appears simple but heavily depends on the construction of desirable permutations. In ...
    • FAIR+E pathogen data for surveillance and research: lessons from COVID-19 

      Neves, Aitana; Cuesta, Isabel; Hjerde, Erik; Klemetsen, Terje; Salgado, David; van Helden, Jacques; Rahman, Nadim; Fatima, Nazeefa; Karathanasis, Nestoras; Zmora, Pawel; Åkerström, Wolmar Nyberg; Grellscheid, Sushma Nagaraja; Waheed, Zahra; Blomberg, Niklas (Journal article; Peer reviewed, 2023)
      The COVID-19 pandemic has exemplified the importance of interoperable and equitable data sharing for global surveillance and to support research. While many challenges could be overcome, at least in some countries, many ...
    • Order Reconfiguration under Width Constraints 

      Arrighi, Emmanuel Jean Paul Pierre; Fernau, Henning; De Oliveira Oliveira, Mateus; Wolf, Petra Henrike Karola (Journal article; Peer reviewed, 2023)
      In this work, we consider the following order reconfiguration problem: Given a graph G together with linear orders ω and ω′ of the vertices of G, can one transform ω into ω′ by a sequence of swaps of adjacent elements in ...
    • Learning from positive and negative examples: New proof for binary alphabets 

      Lingg, Jonas; De Oliveira Oliveira, Mateus; Wolf, Petra Henrike Karola (Journal article; Peer reviewed, 2024)
      One of the most fundamental problems in computational learning theory is the problem of learning a finite automaton A consistent with a finite set P of positive examples and with a finite set N of negative examples. By ...
    • Treewidth is NP-Complete on Cubic Graphs 

      Bodlaender, Hans L.; Bonnet, Édouard; Jaffke, Lars; Knop, Dusan; Lima, Paloma Thome de; Milanič, Martin; Ordyniak, Sebastian; Pandey, Sukanya; Suchy, Ondrey (Journal article; Peer reviewed, 2023)
      In this paper, we show that Treewidth is NP-complete for cubic graphs, thereby improving the result by Bodlaender and Thilikos from 1997 that Treewidth is NP-complete on graphs with maximum degree at most 9. We add a new ...
    • Fine-grained parameterized complexity analysis of graph coloring problems 

      Jaffke, Lars; Jansen, Bart Maarten Paul (Journal article; Peer reviewed, 2023)
      The q-Coloring problem asks whether the vertices of a graph can be properly colored with q colors. In this paper we perform a fine-grained analysis of the complexity of q- Coloring with respect to a hierarchy of structural ...
    • b-Coloring Parameterized by Clique-Width 

      Jaffke, Lars; Lima, Paloma T.; Lokshtanov, Daniel (Journal article; Peer reviewed, 2023)
      We provide a polynomial-time algorithm for b- Coloring on graphs of constant clique-width. This unifies and extends nearly all previously known polynomial time results on graph classes, and answers open questions posed by ...
    • Guarding the First Order: The Rise of AES Maskings 

      Askeland, Amund; Dhooghe, S.; Petkova-Nikova, Svetla Iordanova; Rijmen, Vincent Stefaan; Zhang, Zhenda (Journal article; Peer reviewed, 2023)
      We provide three first-order hardware maskings of the AES, each allowing for a different trade-off between the number of shares and the number of register stages. All maskings use a generalization of the changing of the ...