Browsing Department of Informatics by Issue Date
Now showing items 120 of 320

Algorithms for Linearly Ordered Boolean Formulas
(The University of Bergen, 20160630)This thesis considers a class of propositional boolean formulas on which various problems related to satisfiability are efficiently solvable by a dynamic programming algorithm. It mainly consists of two larger parts: the ...Master thesis 
Towards Correct Modelling and Model Transformation in DPF
(The University of Bergen, 20160614)Modeldriven engineering (MDE) is a modelcentric software development methodology. It promotes models as firstclass entities in software de velopment. Models are used to represent software along software devel opment ...Doctoral thesis 
Using Smart Cards to Mitigate Security Threats on Mobile Devices
(The University of Bergen, 20160531)This master thesis developed and tested the idea that smart cards are able to help mitigate security threats on mobile devices that are handling sensitive data. Investigating the limitations of smart cards is a fundamental ...Master thesis 
MultiPath TCPcommunication (in NorNet Core)
(The University of Bergen, 20160531)Technology is constantly evolving, and we are currently witnessing a digital revolution with a tremendous growth of interconnected devices. The scale of the Internet and the amount of transported data is constantly ...Master thesis 
Incompleteness of the Inference System BNeg
(The University of Bergen, 20160531)Any propositional discourse can be represented as a propositional theory in a specific form in such a way that the theory is inconsistent if and only if the discourse is paradoxical. Propositional theories in this form ...Master thesis 
SelGenes: a tool for selecting marker genes in heterogeneous samples
(The University of Bergen, 20160531)SelGenes is a tool for selecting marker genes for the dominating cell type in heterogeneous samples. Based on a framework from an existing algorithm, SelGenes selects celltype specific marker genes for the dominating ...Master thesis 
A 43k Kernel for Planar Dominating Set using ComputerAided Reduction Rule Discovery
(The University of Bergen, 20160215)In this thesis we explore the technique of Region Decomposition for finding kernels for Planar Dominating Set. We redefine some concepts used in earlier work, fixing some ambiguities on the way. From those concepts we ...Master thesis 
OutputSensitive Filtering of Streaming Volume Data
(John Wiley & Sons Ltd, 201602)Realtime volume data acquisition poses substantial challenges for the traditional visualization pipeline where data enhancement is typically seen as a preprocessing step. In the case of 4D ultrasound data, for instance, ...Journal article 
Case Studies in Constructive Mathematics
(The University of Bergen, 20160122)The common theme in this thesis is the study of constructive provability: in particular we investigate aspects of ﬁnite sets and Kan simplicial sets from a constructive perspective. There are numerous deﬁnitions of ...Doctoral thesis 
Statistical and Algebraic Properties of DES
(Springer, 2016)D. Davies and S. Murphy found that there are at most 660 different probability distributions on the output from any three adjacent Sboxes after 16 rounds of DES. In this paper it is shown that there are only 72 different ...Chapter 
Parameterized Graph Modification Algorithms
(The University of Bergen, 20151210)Graph modification problems form an important class of algorithmic problems in computer science. In this thesis, we study edge modification problems towards classes related to chordal graphs, with the main focus on trivially ...Doctoral thesis 
Independent Set on P5free graphs, an empirical study
(The University of Bergen, 20151120)We implement the recent polynomial time algorithm for the independent set problem on P5free graphs, and study the performance of this algorithm on graphs of size up to 50. Our empirical results show that the algorithm ...Master thesis 
Efforts towards accessible and reliable bioinformatics
(The University of Bergen, 20151119)The aim of the presented work was contributing to making scientific computing more accessible, reliable, and thus more efficient for researchers, primarily computational biologists and molecular biologists. Many approaches ...Doctoral thesis 
Generating software for MUB complementary sequence constructions
(The University of Bergen, 20151118)This master thesis has been performed at the Department of Informatics, University of Bergen between February and November 2015. The work has been supervised by Professor Matthew G. Parker as a part of the research interest ...Master thesis 
Towards a Secure Framework for mHealth. A Case Study in Mobile Data Collection Systems
(The University of Bergen, 20151105)The rapid growth in the mobile communications technology and wide cellular coverage created an opportunity to satisfy the demand for lowcost health care solutions. Mobile Health (a.k.a. mHealth) is a promising health ...Doctoral thesis 
Additive Schwarz preconditioner for the finite volume element discretization of symmetric elliptic problems
(Springer Netherlands, 20150925)A symmetric and a nonsymmetric variant of the additive Schwarz preconditioner are proposed for the solution of a class of finite volume element discretization of the symmetric elliptic problem in two dimensions, with large ...Journal article 
Security in cloud computing and virtual environments
(The University of Bergen, 20150914)Cloud computing is a big buzzwords today. Just watch the commercials on TV and I can promise that you will hear the word cloud service at least once. With the growth of cloud technology steadily rising, and everything ...Master thesis 
Choice of parameter for DPbased FPT algorithms: four case studies
(The University of Bergen, 20150907)This thesis studies dynamic programming algorithms and structural parameters used when solving computationally hard problems. In particular, we look at algorithms that make use of structural decompositions to overcome ...Doctoral thesis 
Largest chordal and interval subgraphs faster than 2n
(Springer, 20150822)We prove that in a graph with n vertices, induced chordal and interval subgraphs with the maximum number of vertices can be found in time O(2λn) for some λ< 1. These are the first algorithms breaking the trivial 2nnO(1) ...Journal article 
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 ...Master thesis