Now showing items 21-38 of 38

    • Phase Transition in a System of Random Sparse Boolean Equations 

      Schilling, Thorsten Ernst; Zajac, Pavol (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 Single-Flow Constraints 

      Haugland, Dag (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 Practical Adaptive Key Recovery Attack on the LGM (GSW-like) Cryptosystem 

      Fauzi, Prastudy; Hovd, Martha Norberg; Raddum, Håvard (Chapter, 2021)
      We present an adaptive key recovery attack on the leveled homomorphic encryption scheme suggested by Li, Galbraith and Ma (Provsec 2016), which itself is a modification of the GSW cryptosystem designed to resist key recovery ...
    • A Pretty Good Formatting Pipeline 

      Bagge, Anya Helene; Hasu, Tero (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 

      Hovland, Dag (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 ...
    • Separating Exceptional Concerns 

      Bagge, Anya Helene (IEEE conference proceedings, Chapter; Peer reviewed, 2012)
      Traditional error handling mechanisms, including exceptions, have several weaknesses that interfere with maintainability, flexibility and genericity in software: Error code is tangled with normal code; reporting is tangled ...
    • Similarity-based Exploded Views 

      Ruiz, Marc; Viola, Ivan; Boada, Imma; Bruckner, Stefan; Feixas, Miquel; Sbert, Mateu (Lecture Notes in Computer Science; 5166, Chapter; Peer reviewed, 2008)
      Exploded views are often used in illustration to overcome the problem of occlusion when depicting complex structures. In this paper, we propose a volume visualization technique inspired by exploded views that partitions ...
    • Solving Compressed Right Hand Side Equation Systems with Linear Absorption 

      Schilling, Thorsten Ernst; Raddum, Håvard (Chapter; Peer reviewed, 2012)
      In this paper we describe an approach for solving complex multivariate equation systems related to algebraic cryptanalysis. The work uses the newly introduced Compressed Right Hand Sides (CRHS) representation, where equations ...
    • Solving Equation Systems by Agreeing and Learning 

      Schilling, Thorsten Ernst; Raddum, Håvard (Chapter; Peer reviewed, 2010)
      We study sparse non-linear equation systems defined over a finite field. Representing the equations as symbols and using the Agreeing algorithm we show how to learn and store new knowledge about the system when a ...
    • Solving the pooling problem with LMI relaxations 

      Frimannslund, Lennart; El Ghami, Mohamed; Alfaki, Mohammed; Haugland, Dag (Chapter; Peer reviewed, 2012)
      We consider the standard pooling problem with a single quality parameter, which is a polynomial global optimization problem occurring among other places in the oil industry. In this paper, we show that if the feasible set ...
    • Statistical and Algebraic Properties of DES 

      Fauskanger, Stian; Semaev, Igor A. (Lecture Notes in Computer Science ; 9589, Chapter; Journal article, 2016)
      D. Davies and S. Murphy found that there are at most 660 different probability distributions on the output from any three adjacent S-boxes after 16 rounds of DES. In this paper it is shown that there are only 72 different ...
    • Strategic optimization of offshore wind farm installation 

      Backe, Stian; Haugland, Dag (Lecture Notes in Computer Science, Chapter; Peer reviewed; Journal article, 2017)
      This work describes logistical planning of offshore wind farm (OWF) installation through linear programming. A mixed integer linear programming (MILP) model is developed to analyze cost-effective port and vessel strategies ...
    • Towards a Spreadsheet-Based Language Workbench 

      Barash, Mikhail (Chapter, 2021)
      Spreadsheets are widely used across industries for various purposes, including for storing and manipulating data in a structured form. Such structured forms—expressed using tabular notation—have found their way in language ...
    • Towards Advanced Interactive Visualization for Virtual Atlases 

      Smit, Noeska Natasja; Bruckner, Stefan (Advances in Experimental Medicine and Biology, Chapter; Peer reviewed, 2019)
      An atlas is generally defined as a bound collection of tables, charts or illustrations describing a phenomenon. In an anatomical atlas for example, a collection of representative illustrations and text describes anatomy ...
    • Towards stronger Lagrangean bounds for stable spanning trees 

      Dias, Phillippe Samer Lallo; Haugland, Dag (Chapter, 2022)
      Given a graph G=(V,E) and a set C of unordered pairs of edges regarded as being in conflict, a stable spanning tree in G is a set of edges T inducing a spanning tree in G, such that for each {e_i, e_j} in C, at most one ...
    • A Type System for Usage of Software Components 

      Hovland, Dag (Lecture Notes in Computer Science, Chapter; Peer reviewed, 2009)
      The aim of this article is to support component-based software engineering by modelling exclusive and inclusive usage of software components. Truong and Bezem describe in several papers abstract languages for component ...
    • The unsuitable neighbourhood inequalities for the fixed cardinality stable set polytope 

      Lallo Dias, Phillippe Samer; Haugland, Dag (Chapter, 2021)
      Given an undirected graph G = (V, E) and an integer k∈{1,…,|V|} , we initiate the combinatorial study of stable sets of cardinality exactly k in G. Our aim is to instigate the polyhedral investigation of the convex hull ...
    • Walk Your Tree Any Way You Want 

      Bagge, Anya Helene; Lämmel, Ralf (Lecture Notes in Computer Science; 7909, Chapter; Peer reviewed, 2013)
      Software transformations in the Nuthatch style are described as walks over trees (possibly graphs) that proceed in programmerdefined steps which may observe join points of the walk, may observe and affect state associated ...