Now showing items 372-391 of 649

    • Norwegian e-Infrastructure for Life Sciences (NeLS) 

      Tekle, Kidane M; Gundersen, Sveinung; Klepper, Kjetil; Bongo, Lars Ailo; Raknes, Inge Alexander; Li, Xiaxi; Zhang, Wei; Andreetta, Christian; Mulugeta, Teshome Dagne; Kalaš, Matúš; Rye, Morten Beck; Hjerde, Erik; Antony Samy, Jeevan Karloss; Fornous, Ghislain; Azab, Abdulrahman; Våge, Dag Inge; Hovig, Eivind; Willassen, Nils Peder; Drabløs, Finn; Nygård, Ståle; Petersen, Kjell; Jonassen, Inge (Peer reviewed; Journal article, 2018)
      The Norwegian e-Infrastructure for Life Sciences (NeLS) has been developed by ELIXIR Norway to provide its users with a system enabling data storage, sharing, and analysis in a project-oriented fashion. The system is ...
    • A Note on Exact Algorithms for Vertex Ordering Problems on Graphs 

      Bodlaender, Hans L.; Fomin, Fedor; Koster, Arie M.C.A.; Kratsch, Dieter; Thilikos, Dimitrios M. (Peer reviewed; Journal article, 2011-01-21)
      In this note, we give a proof that several vertex ordering problems can be solved in O ∗(2 n ) time and O ∗(2 n ) space, or in O ∗(4 n ) time and polynomial space. The algorithms generalize algorithms for the Travelling ...
    • A note on some algebraic trapdoors for block ciphers 

      Calderini, Marco (Peer reviewed; Journal article, 2018)
      We provide sufficient conditions to guarantee that a translation based cipher is not vulnerable with respect to the partition-based trapdoor. This trapdoor has been introduced, recently, by Bannier et al. (2016) and it ...
    • A novel CCA attack using decryption errors against LAC 

      Guo, Qian; Johansson, Thomas; Yang, Jing (Peer reviewed; Journal article, 2019)
      Cryptosystems based on Learning with Errors or related problems are central topics in recent cryptographic research. One main witness to this is the NIST Post-Quantum Cryptography Standardization effort. Many submitted ...
    • A novel collaboration platform: Structuring books as networks 

      Steensen, Ole Eskild (Master thesis, 2018-08-21)
      Ever since Gutenberg introduced the art of printing in Europe in the mid 1400s, the way we consume and author books has remained somewhat static. In spite of several technological advances since that time, the very structure ...
    • Novice Difficulties with Language Constructs 

      Rosbach, Alexander Hoem (Master thesis, 2013-08-01)
      Programming is a difficult skill to learn, and programming courses have high dropout rates. In this thesis we study the problems that students have during their first introductory programming course at The University of ...
    • NP-scout: Machine learning approach for the quantification and visualization of the natural product-likeness of small molecules 

      Chen, Ya; Stork, Conrad; Hirte, Steffen; Kirchmair, Johannes (Peer reviewed; Journal article, 2019)
      Natural products (NPs) remain the most prolific resource for the development of small-molecule drugs. Here we report a new machine learning approach that allows the identification of natural products with high accuracy. ...
    • Obscurance-based Volume Rendering Framework 

      Ruiz, Marc; Boada, Imma; Viola, Ivan; Bruckner, Stefan; Feixas, Miquel; Sbert, Mateu (Proceedings of Volume Graphics 2008., Conference object; Peer reviewed, 2008)
      lighting effects in a faster way than global illumination. Its application in volume visualization is of special interest since it permits us to generate a high quality rendering at a low cost. In this paper, we propose ...
    • OLS Dialog: An open-source front end to the Ontology Lookup Service 

      Barsnes, Harald; Côté, Richard G.; Eidhammer, Ingvar; Martens, Lennart (Peer reviewed; Journal article, 2010-01-17)
      Background: With the growing amount of biomedical data available in public databases it has become increasingly important to annotate data in a consistent way in order to allow easy access to this rich source of information. ...
    • On a New Method for Derivative Free Optimization 

      Frimannslund, Lennart; Steihaug, Trond (Peer reviewed; Journal article, 2011)
      A new derivative-free optimization method for unconstrained optimization of partially separable functions is presented. Using average curvature information computed from sampled function values the method generates an ...
    • On Classification and Some Properties of APN Functions 

      Sun, Bo (Doctoral thesis, 2018-06-22)
      Boolean functions optimal with respect to different cryptographic properties (such as APN, AB, bent functions, etc.) are crucial to the design of secure cryptosystems. Investigating the properties and construction of these ...
    • On Connections Between Graphs, Codes, Quantum States, and Boolean Functions 

      Danielsen, Lars Eirik (Doctoral thesis, 2008-05-28)
      We study objects that can be represented as graphs, error-correcting codes, quantum states, or Boolean functions. It is known that self-dual additive codes, which can also be interpreted as quantum states, can be represented ...
    • On Curvature and Separability in Unconstrained Optimisation 

      Frimannslund, Lennart (Doctoral thesis, 2006-06-16)
    • On cutwidth parameterized by vertex cover 

      Cygan, Marek; Lokshtanov, Daniel; Pilipczuk, Marcin; Pilipczuk, Michal Pawel; Saurabh, Saket (Peer reviewed; Journal article, 2014-04)
      We study the CUTWIDTH problem, where the input is a graph G, and the objective is find a linear layout of the vertices that minimizes the maximum number of edges intersected by any vertical line inserted between two ...
    • On decoding additive generalized twisted Gabidulin codes 

      Kadir, Wrya; Li, Chunlei (Journal article; Peer reviewed, 2020)
      In this paper, we consider an interpolation-based decoding algorithm for a large family of maximum rank distance codes, known as the additive generalized twisted Gabidulin codes, over the finite field Fqn for any prime ...
    • On equivalence between known families of quadratic APN functions 

      Budaghyan, Lilya; Calderini, Marco; Villa, Irene (Journal article; Peer reviewed, 2020)
      This paper is dedicated to a question whether the currently known families of quadratic APN polynomials are pairwise different up to CCZ-equivalence. We reduce the list of these families to those CCZ-inequivalent to each ...
    • On Isotopic Shift Construction for Planar Functions 

      Budaghyan, Lilya; Calderini, Marco; Carlet, Claude; Coulter, Robert; Villa, Irene (Chapter; Conference object; Peer reviewed, 2019)
      CCZ-equivalence is the most general currently known equivalence relation for functions over finite fields preserving planarity and APN properties. However, for the particular case of quadratic planar functions isotopic ...
    • On iterative decoding of high-density parity-check codes using edge-local complementation 

      Knudsen, Joakim Grahl (Doctoral thesis, 2010-11-24)
      The overall topic of this work is a graph operation known as edgelocal complementation (ELC) and its applications to iterative decoding of classical codes. Although these legacy codes are arguably not well-suited for ...
    • On KDE-based brushing in scatterplots and how it compares to CNN-based brushing 

      Fan, Chaoran; Hauser, Helwig (Chapter, 2019)
      In this paper, we investigate to which degree the human should be involved into the model design and how good the empirical model can be with more careful design. To find out, we extended our previously published Mahalanobis ...