Now showing items 1-20 of 494

    • Experimental Study on One-Time Password used in Authentication within Norwegian Banking 

      Naguleswaran, Sivanja (The University of Bergen, 2020-06-26)
      Authentication is a vital part of this fast-growing, digitalized world. Fundamentally, today’s society is more reliant on computer technology and digitalization than ever before. Therefore, the use of dynamic one-time ...
      Master thesis
    • Exploiting graph structures for computational efficiency 

      Strømme, Torstein Jarl Fagerbakke (The University of Bergen, 2020-05-07)
      Coping with NP-hard graph problems by doing better than simply brute force is a field of significant practical importance, and which have also sparked wide theoretical interest. One route to cope with such hard graph ...
      Doctoral thesis
    • Hard Mathematical Problems in Cryptography and Coding Theory 

      Varadharajan, Srimathi (The University of Bergen, 2020-04-28)
      In this thesis, we are concerned with certain interesting computationally hard problems and the complexities of their associated algorithms. All of these problems share a common feature in that they all arise from, or have ...
      Doctoral thesis
    • In silico design and analysis of targeted genome editing with CRISPR 

      Labun, Kornel (The University of Bergen, 2020-01-27)
      CRISPR/Cas systems have become a tool of choice for targeted genome engineering in recent years. Scientists around the world want to accelerate their research with the use of CRISPR/Cas systems, but are being slowed down ...
      Doctoral thesis
    • Vis-a-Vis: Visual Exploration of Visualization Source Code Evolution 

      Bolte, Fabian; Bruckner, Stefan (IEEE, 2020)
      Developing an algorithm for a visualization prototype often involves the direct comparison of different development stages and design decisions, and even minor modifications may dramatically affect the results. While ...
      Journal article
    • On relations between CCZ- and EA-equivalences 

      Villa, Irene; Calderini, Marco; Budaghyan, Lilya (Springer, 2020)
      In the present paper we introduce some sufficient conditions and a procedure for checking whether, for a given function, CCZ-equivalence is more general than EA-equivalence together with taking inverses of permutations. ...
      Journal article
    • SplitStreams: A Visual Metaphor for Evolving Hierarchies 

      Bolte, Fabian; Nourani, Mahsan; Ragan, Eric; Bruckner, Stefan (IEEE, 2020)
      The visualization of hierarchically structured data over time is an ongoing challenge and several approaches exist trying to solve it. Techniques such as animated or juxtaposed tree visualizations are not capable of providing ...
      Journal article
    • Mim-Width II. The Feedback Vertex Set Problem 

      Jaffke, Lars; Kwon, O-Joung; Telle, Jan Arne (Springer, 2020)
      We give a first polynomial-time algorithm for (WEIGHTED) FEEDBACK VERTEX SET on graphs of bounded maximum induced matching width (mim-width). Explicitly, given a branch decomposition of mim-width w, we give an nO(w)-time ...
      Journal article
    • Computational science in the eighteenth century. Test cases for the methods of Newton, Raphson, and Halley: 1685 to 1745 

      Steihaug, Trond (Elsevier, 2020)
      This is an overview of examples and problems posed in the late 1600s up to the mid 1700s for the purpose of testing or explaining the two different implementations of the Newton-Raphson method, Newton’s method as described ...
      Journal article
    • Optimization of reliable cyclic cable layouts in offshore wind farms 

      Klein, Arne; Haugland, Dag (Taylor & Francis, 2020)
      A novel approach for optimizing reliable cable layouts in offshore wind farms is presented. While optimization models traditionally are designed to suggest acyclic cable routes, those developed in this work recognize that ...
      Journal article
    • Sufficiently overdetermined random polynomial systems behave like semiregular ones 

      Tenti, Andrea (The University of Bergen, 2019-12-18)
      Solving systems of polynomial equations over finite fields is a fundamental problem in several areas of pure and applied mathematics. Gröbner basis methods is a family of techniques to computationally solve such systems ...
      Doctoral thesis
    • FPT Algorithms for Diverse Collections of Hitting Sets 

      Baste, Julien; Jaffke, Lars; Masařík, Tomáš; Philip, Geevarghese; Rote, Günter (MDPI, 2019-11-27)
      In this work, we study the d-Hitting Set and Feedback Vertex Set problems through the paradigm of finding diverse collections of r solutions of size at most k each, which has recently been introduced to the field of ...
      Journal article
    • Prototyping and Evaluation of an Event-Driven Microservice Architecture for Tunnel Control Systems 

      Follo, Øystein Hegglid (The University of Bergen, 2019-11-20)
      Group thesisMaster thesis
    • Comparison of RNA-folding structures, in-vivo, in-vitro and in-silico 

      Roodashty, Hanieh (The University of Bergen, 2019-10-31)
      The main objective of the work has been to develop the understanding of the difference between RNA structure probing approaches; in vivo, in vitro and in silico. Similarities and differences between three libraries of data ...
      Master thesis
    • Insights into translational regulation from ribosome profiling data 

      Chyżyńska, Katarzyna Anna (The University of Bergen, 2019-10-15)
      Ribosomes carry out protein synthesis from mRNA templates by a highly regulated process called translation. Within the four phases of translation - initiation, elongation, termination and recycling - the focus of translation ...
      Doctoral thesis
    • Solving LPN Using Covering Codes 

      Guo, Qian; Johansson, Thomas; Löndahl, Carl (Springer, 2019-10-15)
      We present a new algorithm for solving the LPN problem. The algorithm has a similar form as some previous methods, but includes a new key step that makes use of approximations of random words to a nearest codeword in a ...
      Journal article
    • Developing Appiducks - an app for learning Python 

      Raddum, Solveig Kristine (The University of Bergen, 2019-09-18)
      Master thesis
    • Optimization Problems in Communication Networks and Multi-Agent Path Finding 

      Ivanova, Marika (The University of Bergen, 2019-09-13)
      This dissertation is a compilation of six research papers that are focused on three dif- ferent topics summarized in the text. The first three papers address NP-hard problems arising in ad-hoc wireless com- munication ...
      Doctoral thesis
    • Going Far From Degeneracy 

      Fomin, Fedor; Golovach, Petr; Lokshtanov, Daniel; Panolan, Fahad; Saurabh, Saket; Zehavi, Meirav (Schloss Dagstuhl, 2019-09-06)
      An undirected graph G is d-degenerate if every subgraph of G has a vertex of degree at most d. By the classical theorem of Erd\H{o}s and Gallai from 1959, every graph of degeneracy d>1 contains a cycle of length at least ...
      Journal article
    • Predicting Loss of Inference Accuracy in Bounded Tree-Width Bayesian Networks 

      Rosland, Kristian (The University of Bergen, 2019-09-04)
      A Bayesian network (BN) is a compact way to represent a joint probability distribution graphically. The BN consists of a structure in the form of a directed acyclic graph (DAG) and a set of parameters. The nodes of the DAG ...
      Master thesis