Browsing Department of Informatics by Issue Date
Now showing items 2140 of 260

Software modeling of the propagation of electromagnetic beams through different media
(The University of Bergen and Bergen University College, 20140602)Propagation and focusing of electromagnetic beams through layered anisotropic medium is of interest in the field of optical data storage, where thin layers are mounted on glass substrates, display technology, where polarised ... 
On the feasibility of distributed systems for interactive visual analysis of omics data
(The University of Bergen, 20140602)The purpose of this thesis is to discuss the feasibility of developing a distributed interactive visual analysis omics system demonstrating how selected modules from the standalone JExpress Modularized application ... 
Fast methods to solve the pooling problem
(The University of Bergen, 20140531)In pipeline transportation of natural gas, simple network flow problems are replaced by hard ones when bounds on the flow quality are imposed. The sources, typically represented by gas wells, provide flow of unequal ... 
Linear dependencies between nonuniform distributions in DES
(The University of Bergen, 20140530)Davies and Murphy explained some nonuniform distributions of the output from pairs and triplets of Sboxes in DES, and how they are completely dependent on some key bits. There are linear dependencies between these ... 
So you've got IPv6 address space. Can you defend it?
(The University of Bergen, 20140529)Internet Protocol version 6 (IPv6) is the successor of Internet Protocol version 4 (IPv4). IPv6 will become the next standard networking protocol on the Internet. It brings with it a great increase in address space, changes ... 
Perceptually Uniform Motion Space
(IEEE, 20140507)Flow data is often visualized by animated particles inserted into a flow field. The velocity of a particle on the screen is typically linearly scaled by the velocities in the data. However, the perception of velocity ... 
Continuous LevelsofDetail and Visual Abstraction for Seamless Molecular Visualization
(Wiley, 20140506)Molecular visualization is often challenged with rendering of large molecular structures in real time. We introduce a novel approach that enables us to show even large protein complexes. Our method is based on the ... 
On cutwidth parameterized by vertex cover
(Springer, 201404)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 ... 
FreeContact: fast and free software for protein contact prediction from residue coevolution
(BioMed Central, 20140326)Background: 20 years of improved technology and growing sequences now renders residueresidue contact constraints in large protein families through correlated mutations accurate enough to drive de novo predictions of protein ... 
Data clustering optimization with visualization
(The University of Bergen, 20140320)This thesis study the possible applications of Particle Swarm Optimization in Kernel Clustering, Dynamic modeling and Artificial Neural Network. 
Substation Location in Offshore Wind Farms  A Planar MultiFacility LocationRouting Problem
(The University of Bergen, 20140314)In offshore wind farms, two important parts of the design are to determine locations for substations and a cabling layout that connects every turbine to a substation. These problems are interconnected, as the cable layout ... 
Exploring Subexponential Parameterized Complexity of Completion Problems
(Schloss Dagstuhl  LeibnizZentrum fuer Informatik, 20140219)Let F be a family of graphs. In the FCompletion problem, we are given an nvertex graph G and an integer k as input, and asked whether at most k edges can be added to G so that the resulting graph does not contain a ... 
Throughput and robustness of bioinformatics pipelines for genomescale data analysis
(The University of Bergen, 20140219)The postgenomic era has been heavily influenced by the rapid development of highthroughput molecularscreening technologies, which has enabled genomewide analysis approaches on an unprecedented scale. The constantly ... 
BioHackathon series in 2011 and 2012: penetration of ontology and linked data in life science domains
(BioMed Central, 20140205)Abstract The application of semantic technologies to the integration of biological data and the interoperability of bioinformatics analysis and visualization tools has been the common theme of a series of annual ... 
Parameterized complexity of Eulerian deletion problems
(Springer, 201401)We study a family of problems where the goal is to make a graph Eulerian, i.e., connected and with all the vertices having even degrees, by a minimum number of deletions. We completely classify the parameterized complexity ... 
Molecular mechanisms of adaptation emerging from the physics and evolution of nucleic acids and proteins
(Oxford University Press, 2014)DNA, RNA and proteins are major biological macromolecules that coevolve and adapt to environments as components of one highly interconnected system. We explore here sequence/structure determinants of mechanisms of adaptation ... 
Parsing in a Broad Sense
(Springer, 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, ... 
Reflections on Courses for Software Language Engineering
(2014)Software Language Engineering (SLE) has emerged as a field in computer science research and software engineering, but it has yet to become entrenched as part of the standard curriculum at universities. Many places have a ... 
A Model of Type Theory in Cubical Sets
(Schloss Dagstuhl  LeibnizZentrum für Informatik, 2014)We present a model of type theory with dependent product, sum, and identity, in cubical sets. We describe a universe and explain how to transform an equivalence between two types into an equality. We also explain how to ... 
Improving Parallel Sparse Matrixvector Multiplication
(The University of Bergen, 20131219)Sparse Matrixvector 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 ...