Browsing Department of Informatics by Title
Now showing items 5372 of 260

Direct data transfer between SOAP web services in Orchestration
(ACM, 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 ... 
Directed graph representation of halfrate additive codes over GF(4)
(Springer, 2010)We show that (n, 2n) additive codes over GF(4) can be represented as directed graphs. This generalizes earlier results on selfdual additive codes over GF(4), which correspond to undirected graphs. Graph representation ... 
Discrete event simulation in Java with applications in rodent navigation
(The University of Bergen, 2002) 
DomainSpecific Languages for Composable Editor Plugins
(Elsevier, 20100917)Modern IDEs increase developer productivity by incorporating many different kinds of editor services. These can be purely syntactic, such as syntax highlighting, code folding, and an outline for navigation; or they can be ... 
Drum Analysis
(The University of Bergen, 2002)This thesis studies drumloops, and the possibility to separate the different drumsounds from each other. Drum onsets and the detection of these are thoroughly discussed. Different approaches for detection and separation ... 
Dynamic Content Manage for ELearning
(The University of Bergen, 20081118) 
Dynamic Content Manager for ELearning
(The University of Bergen, 20081118)Dynamic content manager for ELearning project is developed as the partial fulfillment of master studies under the supervision of yngve lamo Ph.D and Khalid Azim Mughal Ph.D. 
Dynamic Presentation Generator 2.0 Utvikling av ny dynamisk presentasjonsgenerator og presentasjonsmønsterspesifikasjon.
(The University of Bergen, 20081013)Denne masteroppgaven er en del av JAva FjernUndervisningsprosjektet (JAFU) på Institutt for Informatikk ved Universitetet i Bergen. Formålet med dette prosjektet er først og fremst å kunne tilby nettbasert undervisning ... 
Efficiently Locating Schema Incompatibilities in an eXtensible Markup Language
(The University of Bergen, 2003) 
Elastic Grid Resources using Cloud Technologies
(The University of Bergen, 20140602)A Large Ion Collider Experiment (ALICE) is one of four experiments at the Large Hadron Collider (LHC) at CERN. The detectors in the ALICE experiment produce data at a rate of 4 GB/s after being filtered and compressed ... 
En studie av meshtraverseringsmønstre for Sophusbiblioteket og kjøretids variasjoner på SGI Origin
(The University of Bergen, 2002) 
En visuell tilnærming til simulering av købaserte modeller i Java
(The University of Bergen, 2004) 
Energyscale Aware Feature Extraction for Flow Visualization
(Blackwell Publishing Ltd., 2011)In the visualization of flow simulation data, feature detectors often tend to result in overly rich response, making some sort of filtering or simplification necessary to convey meaningful images. In this paper we present ... 
Enhancing Content Management in DPG
(The University of Bergen, 20131120)This thesis analyzes the usability aspects of PCE and implements a new Single Page Application that attempts to solve this issues 
Error Detection and Correction for Symmetric and Asymmetric Channels
(The University of Bergen, 20070827)When a message is sent over a channel errors can occur due to noise during the transmission. So it is very important to know the error correction and detection capability of the code, which is used to encode the ... 
Exact algorithms for MAX2SAT and MAX3SAT via multidimensional matrix multiplication
(The University of Bergen, 20150601)In this thesis it is showed how an $O(n^{4\epsilon})$ algorithm for the cube multiplication problem (that is defined in the thesis) would imply a faster than naive $O^{*}(2^{n(1\frac{\epsilon}{4})})$ algorithm for the ... 
Exact algorithms for treewidth and minimum fillin
(SIAM Journals, 2006) 
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 ... 
Exploring the evolution of protein function in Archaea
(BioMed Central, 20120530)Background: Despite recent progress in studies of the evolution of protein function, the questions what were the first functional protein domains and what were their basic building blocks remain unresolved. Previously, we ... 
Exponential time algorithms: Structures, measures, and bounds
(The University of Bergen, 20081205)This thesis studies exponential time algorithms, more precisely, algorithms exactly solving problems for which no polynomial time algorithm is known and likely to exist. Interested in worst–case upper bounds on the running ...