Browsing Department of Informatics by Document Types "Chapter"
Now showing items 120 of 31

Analysis of Trivium Using Compressed Right Hand Side Equations
(Chapter; Peer reviewed, 2012)We study a new representation of nonlinear 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
(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 ... 
A Comparative Analysis of Feature Selection Methods for Biomarker Discovery in Study of ToxicantTreated Atlantic Cod (Gadus Morhua) Liver
(Chapter; Conference object; 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
(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 branchandbound ... 
Differential Fault Analysis of Trivium
(Lecture Notes in Computer Science; 5086, Chapter; Peer reviewed, 2008)Trivium is a hardwareoriented 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 ... 
An Ensemble Feature Selection Framework Integrating Stability
(Chapter; Conference object; 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
(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
(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, ... 
The Inclusion Problem for Regular Expressions
(Lecture Notes in Computer Science, Chapter; Peer reviewed, 2010)This paper presents a new polynomialtime 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
(Lecture Notes in Computer Science; 8208, Chapter; Peer reviewed, 2013)Permissionbased 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 Multiaspect Visualization of 3D Fluid Flows
(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. ... 
Measures in Visualization Space
(Chapter, 2020)Measurement is an integral part of modern science, providing the fundamental means for evaluation, comparison, and prediction. In the context of visualization, several different types of measures have been proposed, ranging ... 
The mersenne low hamming combination search problem can be reduced to an ILP problem
(Lecture Notes in Computer Science, Chapter; Peer reviewed; Journal article, 2019)In 2017, Aggarwal, Joux, Prakash, and Santha proposed an innovative NTRUlike publickey cryptosystem that was believed to be quantum resistant, based on Mersenne prime numbers q=2N−1 . After a successful attack designed ... 
On Isotopic Shift Construction for Planar Functions
(Chapter; Conference object; Peer reviewed, 2019)CCZequivalence 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 KDEbased brushing in scatterplots and how it compares to CNNbased brushing
(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 ... 
Parsing in a Broad Sense
(Lecture Notes in Computer Science: 8767, Chapter; Peer reviewed, 2014)Having multiple representations of the same instance is common in software language engineering: models can be visualised as graphs, edited as text, serialised as XML. When mappings between such representations are considered, ... 
Phase Transition in a System of Random Sparse Boolean Equations
(Chapter; Peer reviewed, 2012)Many problems, including algebraic cryptanalysis, can be transformed to a problem of solving a (large) system of sparse Boolean equations. In this article we study 2 algorithms that can be used to remove some redundancy ... 
Pooling Problems with SingleFlow Constraints
(Chapter; Conference object; Peer reviewed, 2019)The pooling problem is a frequently studied extension of the traditional minimum cost flow problem, in which the composition of the flow is subject to restrictions. In a network consisting of three layers of nodes, the ... 
A Pretty Good Formatting Pipeline
(Lecture Notes in Computer Science; 8225, Chapter; Peer reviewed, 2013)Proper formatting makes the structure of a program apparent and aids program comprehension. The need to format code arises in code generation and transformation, as well as in normal reading and editing situations. Commonly ... 
Regular Expressions with Numerical Constraints and Automata with Counters
(Lecture Notes in Computer Science, Chapter; Peer reviewed, 2009)Regular expressions with numerical constraints are an extension of regular expressions, allowing to bound numerically the number of times that a subexpression should be matched. Expressions in this extension describe the ...