Browsing Department of Informatics by Title
Now showing items 131150 of 256

Maximum number of edges in graph classes under degree and matching constraints
(The University of Bergen, 20150512)In extremal graph theory, we ask how large or small a property of a graph can be, when the graph has to satisfy certain constraints. In this thesis, we ask how many edges a graph can have with restrictions on its degree ... 
Methods for analysing 2D electrophoretic gel images
(The University of Bergen, 2002) 
Minimizing Fillin Size and Elimination Tree Height in Parallel Cholesky Factorization
(The University of Bergen, 1992) 
Modelling migration patterns of fish using depth and temperature preferences
(The University of Bergen, 20120427)Time series of depth and temperature derived from electronic tagging of fish have been used to construct a stochastic model that aims at capturing main characteristics of the observations. Mixed OrnsteinUhlenbeck process ... 
Models and Solution Methods for the Pooling Problem
(The University of Bergen, 20120618)Pipeline transportation of natural gas is largely affected by restrictions regarding gas quality imposed by the market and the actual quality of the gas produced at sources. From the sources, gas flow streams of unequal ... 
Modulation of Transcriptional and Inflammatory Responses in Murine Macrophages by the Mycobacterium tuberculosis Mammalian Cell Entry (Mce) 1 Complex
(Public Library of Science, 20111024)The outcome of many infections depends on the initial interactions between agent and host. Aiming at elucidating the effect of the M. tuberculosis Mce1 protein complex on host transcriptional and immunological responses ... 
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 ... 
Monte Carlo Study of the Formation and Conformational Properties of Dimers of Aβ42 Variants
(Elsevier, 2011)Small soluble oligomers, and dimers in particular, of the amyloid βpeptide (Aβ) are believed to play an important pathological role in Alzheimer's disease. Here, we investigate the spontaneous dimerization of Aβ42, with ... 
A Multilevel scheme for the Travelling Salesman Problem
(The University of Bergen, 2002) 
Multimedia i dynamisk presentasjons generator 2.0
(The University of Bergen, 20081001)Oppgaven omhandler en ny implementasjon av innholdshåndteringssystemet Dynamic Presetation Generator DPG, hvor hovedvekten av oppgaven tar for seg integrering av multimediafunksjonalitet i systemet. 
Naturlige nettverk
(The University of Bergen, 2008)En innføring i naturlige nettverk. Vi forklarer og diskuterer begrepet naturlige nettverk og vurderer hvilke nettverk som bør kalles naturlige. Vi ser på forskjeller og likheter mellom tilfeldige, planlagte og naturlige ... 
Network coding in Bluetooth networks
(The University of Bergen, 20091001)This thesis discusses the possibility to apply network coding to a Bluetooth piconet. A protocol is proposed. This protocol is based on using deterministic linear network coding. The proposed alphabet size is binary, and ... 
A New Generating Set Search Algorithm for Partially Separable Functions
(IARIA, 2010)A new derivativefree optimization method for unconstrained optimization of partially separable functions is presented. Using average curvature information computed from sampled function values the method generates an ... 
New Results on Minimal Triangulations
(The University of Bergen, 20060425) 
New Width Parameters of Graphs
(The University of Bergen, 20120903)The main focus of this thesis is on using the divide and conquer technique to efficiently solve graph problems that are in general intractable. We work in the field of parameterized algorithms, using width parameters of ... 
A Note on Exact Algorithms for Vertex Ordering Problems on Graphs
(Springer, 20110121)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 ... 
Novice Difficulties with Language Constructs
(The University of Bergen, 20130801)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 ... 
Nye øvre skranker på ytelsen til adaptiv koding og modulasjon i OFDMba serte trådløse nettverk
(The University of Bergen, 2004) 
Obscurancebased Volume Rendering Framework
(The Eurographics Association, 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 opensource front end to the Ontology Lookup Service
(BioMed Central, 20100117)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. ...