• Improvements and extensions to the configuration tools of the TaskManager HLT software in the ALICE experiment at CERN 

      Haaland, Øystein Senneset (Master thesis, 2007)
      This thesis concerns work done to improve andextend software that is used to configure nodesand trigger software in HLT under the ALICEexperiment at CERN. HLT is a large computercluster that will be used to reduce data ...
    • Improvements on making BKW practical for solving LWE 

      Budroni, Alessandro; Guo, Qian; Johansson, Thomas; Mårtensson, Erik; Wagner, Paul Stankovski (Journal article; Peer reviewed, 2021)
      The learning with errors (LWE) problem is one of the main mathematical foundations of post-quantum cryptography. One of the main groups of algorithms for solving LWE is the Blum–Kalai–Wasserman (BKW) algorithm. This paper ...
    • Improving Efficiency in Parameter Estimation Using the Hamiltonian Monte Carlo Algorithm 

      Alfaki, Mohammed (Master thesis, 2008)
      This thesis investigates three approaches to improve the performance of the Hamiltonian Monte Carlo algorithm. The first approach enhances the Hamiltonian Monte Carlo by suppressing random walk in the Gibbs sampling using ...
    • Improving Interaction in Visual Analytics using Machine Learning 

      Fan, Chaoran (Doctoral thesis, 2021-11-05)
      Interaction is one of the most fundamental components in visual analytical systems, which transforms people from mere viewers to active participants in the process of analyzing and understanding data. Therefore, fast and ...
    • Improving Parallel Sparse Matrix-vector Multiplication 

      Tessem, Torbjørn Johnsen (Master thesis, 2013-12-19)
      Sparse Matrix-vector Multiplication (SMvM) is a mathematical technique encountered in many programs and computations and is often heavily used. Solving SMvM in parallel allows for bigger instances to be solved, and problems ...
    • Improving the Usability of Refactoring Tools for Software Change Tasks 

      Eilertsen, Anna Maria (Doctoral thesis, 2021-12-22)
      All successful software gets changed. Developers undertake software change tasks by editing the software’s source code to meet new demands. Often, the edits they make are aligned with refactorings and can be performed ...
    • In silico design and analysis of targeted genome editing with CRISPR 

      Labun, Kornel (Doctoral thesis, 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 ...
    • In Vitro Development of Human iPSC-Derived Functional Neuronal Networks on Laser-Fabricated 3D Scaffolds 

      Koroleva, Anastasia; Deiwick, Andrea; El-Tamer, Ayman; Koch, Lothar; Shi, Yichen; Estévez-Priego, Estefanía; Ludl, Adriaan-Alexander; Soriano, Jordi; Guseva, Daria; Ponimaskin, Evgeni; Chichkov, Boris (Journal article; Peer reviewed, 2021)
      Neural progenitor cells generated from human induced pluripotent stem cells (hiPSCs) are the forefront of ″brain-on-chip″ investigations. Viable and functional hiPSC-derived neuronal networks are shaping powerful in vitro ...
    • The Inclusion Problem for Regular Expressions 

      Hovland, Dag (Lecture Notes in Computer Science, Chapter; Peer reviewed, 2010)
      This paper presents a new polynomial-time algorithm for the inclusion problem for certain pairs of regular expressions. The algorithm is not based on construction of finite automata, and can therefore be faster than the ...
    • Incompleteness of the Inference System BNeg 

      Golid, Kjetil Midtgarden (Master thesis, 2016-05-31)
      Any propositional discourse can be represented as a propositional theory in a specific form in such a way that the theory is inconsistent if and only if the discourse is paradoxical. Propositional theories in this form can ...
    • Independent Set on P5-free graphs, an empirical study 

      Haug, Håvard Karim (Master thesis, 2015-11-20)
      We implement the recent polynomial time algorithm for the independent set problem on P5-free graphs, and study the performance of this algorithm on graphs of size up to 50. Our empirical results show that the algorithm is ...
    • The index tracking problem with a limit on portfolio size 

      Mutunge, Purity Kamene (Master thesis, 2014-11-19)
      For a passive fund manager tracking a benchmark, it is not uncommon to select some, and not all the assets in the index to his portfolio. In this thesis, we consider the problem of minimizing the tracking error under the ...
    • Indexed and Fibred Structures for Hoare Logic 

      Wolter, Uwe Egbert; Martini, Alfio; Haeusler, Edward Hermann (Journal article; Peer reviewed, 2020)
      Indexed and fibred categorical concepts are widely used in computer science as models of logical systems and type theories. Here we focus on Hoare logic and show that a comprehensive categorical analysis of its axiomatic ...
    • Indexed and fibered structures for partial and total correctness assertions 

      Wolter, Uwe Egbert; Martini, Alfio; Haeusler, Edward Hermann (Journal article; Peer reviewed, 2022)
      Hoare Logic has a long tradition in formal verification and has been continuously developed and used to verify a broad class of programs, including sequential, object-oriented, and concurrent programs. Here we focus on ...
    • Inferring Required Permissions for Statically Composed Programs 

      Hasu, Tero; Bagge, Anya Helene; Haveraaen, Magne (Lecture Notes in Computer Science; 8208, Chapter; Peer reviewed, 2013)
      Permission-based security models are common in smartphone operating systems. Such models implement access control for sensitive APIs, introducing an additional concern for application developers. It is important for the ...
    • An infinite family of 0-APN monomials with two parameters 

      Kaleyski, Nikolay Stoyanov; Nesheim, Kjetil Amundsen; Stănică, Pantelimon (Journal article; Peer reviewed, 2023)
      We consider an infinite family of exponents e(l, k) with two parameters, l and k, and derive sufficient conditions for e(l, k) to be 0-APN over F2n . These conditions allow us to generate, for each choice of l and k, an ...
    • Insights into translational regulation from ribosome profiling data 

      Chyżyńska, Katarzyna Anna (Doctoral thesis, 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 ...
    • Integer Programming Formulations for the Shared Multicast Tree Problem 

      Ivanova, Marika; Haugland, Dag (Peer reviewed; Journal article, 2019)
      We study the shared multicast tree (SMT) problem in wireless networks. To support a multicast session between a set of network nodes, SMT aims to establish a wireless connection between them, such that the total energy ...
    • Integral Cryptanalysis 

      Moen, Vebjørn (Master thesis, 2002)