• Analysis of Trivium Using Compressed Right Hand Side Equations 

      Schilling, Thorsten Ernst; Raddum, Håvard (Chapter; Peer reviewed, 2012)
      We study a new representation of non-linear multivariate equations for algebraic cryptanalysis. Using a combination of multiple right hand side equations and binary decision diagrams, our new representation allows a very ...
    • Classifying and Measuring Student Problems and Misconceptions 

      Rosbach, Alexander Hoem; Bagge, Anya Helene (Norsk informatikkonferanse, Chapter; Peer reviewed, 2013)
      In this paper we report on an attempt to classify student problems and mistakes, and measuring the frequency of particular problems in a firstsemester programming course. We also propose a scheme for annotating student ...
    • Colluding Tags Attack on the ECC-based Grouping Proofs for Rfids 

      Abyaneh, Mohammad Reza Sohizadeh (Chapter, 2012)
      Recently, a new privacy-preserving elliptic curve based grouping proof protocol with colluding tag prevention( CTP) has been proposed. The CTP protocol is claimed to be resistant against colluding tags attacks in which the ...
    • Community Detection on the GPU 

      Naim, Md.; Manne, Fredrik; Halappanavar, Mahantesh; Tumeo, Antonino (Chapter; Peer reviewed, 2017)
      We present and evaluate a new GPU algorithm based on the Louvain method for community detection. Our algorithm is the first for this problem that parallelizes the access to individual edges. In this way we can fine tune ...
    • A Comparative Analysis of Feature Selection Methods for Biomarker Discovery in Study of Toxicant-Treated Atlantic Cod (Gadus Morhua) Liver 

      Zhang, Xiaokang; Jonassen, Inge (Communications in Computer and Information Science; 1056, Chapter; Peer reviewed, 2019)
      Univariate and multivariate feature selection methods can be used for biomarker discovery in analysis of toxicant exposure. Among the univariate methods, differential expression analysis (DEA) is often applied for its ...
    • Comparison of Discrete and Continuous Models for the Pooling Problem 

      Alfaki, Mohammed; Haugland, Dag (Chapter; Peer reviewed, 2011)
      The pooling problem is an important global optimization problem which is encountered in many industrial settings. It is traditionally modeled as a bilinear, nonconvex optimization problem, and solved by branch-and-bound ...
    • Computational Science in the 17th Century. Numerical Solution of Algebraic Equations: Digit–by–Digit Computation 

      Steihaug, Trond (Chapter, 2022)
      In this paper we give a complete overview of test–problems by Viète from 1600, Harriot from 1631 and Oughtred from 1647. The original material is not easily accessible due to archaic language and lack of conciseness. Viéte’s ...
    • Det regionale i det internasjonale - en internasjonaliseringsstrategi for høyskolene på Vestlandet 

      Olsen, Kai (Chapter, 2018)
      Fra å starte som rene undervisningsinstitusjoner har høyskolene nå fått krav om å være relevante i en forskningssammenheng. Spørsmålet er da – hvordan kan små institusjoner i utkanten av verden operere internasjonalt? Mitt ...
    • Differential Fault Analysis of Trivium 

      Hojsík, Michal; Rudolf, Bohuslav (Lecture Notes in Computer Science; 5086, Chapter; Peer reviewed, 2008)
      Trivium is a hardware-oriented stream cipher designed in 2005 by de Canni`ere and Preneel for the European project eStream, and it has successfully passed the first and the second phase of this project. Its design has a ...
    • Direct data transfer between SOAP web services in Orchestration 

      Subramanian, Sattanathan; Sztromwasser, Paweł; Puntervoll, Pål; Petersen, Kjell (Chapter; Peer reviewed, 2012)
      In scientific data analysis, workflows are used to integrate and coordinate resources such as databases and tools. Workflows are normally executed by an orchestrator that invokes component services and mediates data transport ...
    • An Ensemble Feature Selection Framework Integrating Stability 

      Zhang, Xiaokang; Jonassen, Inge (Chapter; Peer reviewed, 2019)
      Ensemble feature selection has drawn more and more attention in recent years. There are mainly two strategies for ensemble feature selection, namely data perturbation and function perturbation. Data perturbation performs ...
    • Finite and Confident Teaching in Expectation: Sampling from Infinite Concept Classes 

      Hernández-Orallo, José; Telle, Jan Arne (Frontiers in Artificial Intelligence and Applications;325, Chapter, 2020)
      We investigate the teaching of infinite concept classes through the effect of the learning prior (which is used by the learner to derive posteriors giving preference of some concepts over others and by the teacher to devise ...
    • Floating Fault Analysis of Trivium 

      Hojsík, Michal; Rudolf, Bohuslav (Lecture Notes in Computer Science; 5365, Chapter; Peer reviewed, 2008)
      One of the eSTREAM final portfolio ciphers is the hardwareoriented stream cipher Trivium. It is based on 3 nonlinear feedback shift registers with a linear output function. Although Trivium has attached a lot of interest, ...
    • A General Methodology for Internalising Multi-level Model Typing 

      König, Harald; Wolter, Uwe Egbert (Chapter, 2021)
      Multilevel Modelling approaches allow for an arbitrary number of abstraction levels in typing chains. In this paper, a transformation of a multi-level typing chain into a single all-covering representing model is proposed. ...
    • Honeycomb Plots: Visual Enhancements for Hexagonal Maps 

      Trautner, Thomas Bernhard; Sbardellati, Maximilian; Stoppel, Sergej; Bruckner, Stefan (Chapter, 2022)
      Aggregation through binning is a commonly used technique for visualizing large, dense, and overplotted two-dimensional data sets. However, aggregation can hide nuanced data-distribution features and complicates the display ...
    • 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 ...
    • 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 ...
    • Integrated Multi-aspect Visualization of 3D Fluid Flows 

      Brambilla, Andrea; Andreassen, Øyvind; Hauser, Helwig (Chapter; Peer reviewed, 2013)
      The motion of a fluid is affected by several intertwined flow aspects. Analyzing one aspect at a time can only yield partial information about the flow behavior. More details can be revealed by studying their interactions. ...
    • Interactive Visualization of Streaming Data with Kernel Density Estimation 

      Lampe, Ove Daae; Hauser, Helwig (Chapter; Peer reviewed, 2011)
      In this paper, we discuss the extension and integration of the statistical concept of Kernel Density Estimation (KDE) in a scatterplotlike visualization for dynamic data at interactive rates. We present a line kernel for ...
    • Investigating the Limitations of Java Annotations for Input Validation 

      Mancini, Federico; Hovland, Dag; Mughal, Khalid A. (Chapter; Peer reviewed, 2010)
      Recently Java annotations have received a lot of attention as a possible way to simplify the usage of various frameworks, ranging from persistence and verification to security. In this paper we discuss our experiences in ...