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

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 
Projective Simulation compared to reinforcement learning
(The University of Bergen, 20150601)This thesis explores the model of projective simulation (PS), a novel approach for an artificial intelligence (AI) agent. The model of PS learns by interacting with the environment it is situated in, and allows for ...Master thesis 
A Survey of LinearProgramming Guided Branching Parameterized Algorithms for Vertex Cover, with Experimental Results
(The University of Bergen, 20150601)A survey of FPT algorithms for Vertex Cover, parameterized by an above guarantee parameter.Master thesis 
Localizing Cell Towers from Crowdsourced Measurements
(The University of Bergen, 20150601)Today, several internet sites exist that aim to provide the locations and number of cellular network antennas worldwide. For example [1],[2] and [3]. What makes this task difficult to accomplish is the lack of information ...Master thesis 
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 
Maximum number of objects in graph classes.
(The University of Bergen, 20150531)The focus of this thesis is the study and implementation of two exact exponential time algorihms. These algorihms finds and lists the number of minimal dominating sets and the number of minimal subset feedback vertex ...Master thesis 
SMS OneTime Passwords, Security in TwoFactor Authentication
(The University of Bergen, 20150529)In the past decade, the low price and ease of generating and sending large amounts of SMS have made it possible for many online services to create strong and affordable authentication systems. With the growth of smartphones ...Master thesis 
Implementasjon av attributtbasert tilgangskontroll i elektroniske helsesystemer
(The University of Bergen, 20150528)Tilgangskontroll er et av de viktigste temaene innenfor informasjonssikkerhet[10]. Sensitiv data bør bare kunne aksesseres av autoriserte brukere eller programmer. Denne oppgaven har som hovedmål å undersøke den nåværende ...Master thesis 
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 ...Master thesis 
Skaping av meirverdi gjennom opne data om kollektivtrafikk
(The University of Bergen, 20150504)Tema i denne oppgåva er opne data, med ei avgrensing mot kollektivtrafikkdata. Djupnestudien er retta mot verksemda til Skyss, det fylkeskommunale kollektivtrafikkselskapet i Hordaland. Omgrepet opne data" inneber ...Master thesis 
Community Detection in Social Networks
(The University of Bergen, 20150501)Social networks usually display a hierarchy of communities and it is the task of community detection algorithms to detect these communities and preferably also their hierarchical relationships. One common class of ...Master thesis 
Efficient CRISPRCas9mediated generation of knockin human pluripotent stem cells lacking undesired mutations at the targeted locus
(Elsevier, 201505)The CRISPRCas9 system has the potential to revolutionize genome editing in human pluripotent stem cells (hPSCs), but its advantages and pitfalls are still poorly understood. We systematically tested the ability of CRISPRCas9 ...Journal article 
Fast Method for MaximumFlow Problem with MinimumLot Sizes
(The University of Bergen, 20150303)In transportation networks, such as pipeline networks for transporting natural gas, it is often impractical to send across amounts of flow below a certain threshold. Such lower threshold is referred as the minimumlot size. ...Master thesis 
Axis patterning by BMPs: cnidarian network reveals evolutionary constraints
(Elsevier, 201503)BMP signaling plays a crucial role in the establishment of the dorsoventral body axis in bilaterally symmetric animals. However, the topologies of the bone morphogenetic protein (BMP) signaling networks vary drastically ...Journal article 
Investigating Streamless Sets
(Dagstuhl Publishing, 2015)In this paper we look at streamless sets, recently investigated by Coquand and Spiwack. A set is streamless if every stream over that set contain a duplicate. It is an open question in constructive mathematics whether the ...Conference object 
Highperformance design patterns for modern Fortran
(Hindawi, 2015)This paper presents ideas for using coordinatefree numerics in modern Fortran to achieve code flexibility in the partial differential equation (PDE) domain. We also show how Fortran, over the last few decades, has changed ...Journal article 
Bchromatic number: Beyond NPhardness
(Dagstuhl Publishing, 2015)The bchromatic number of a graph G, chi_b(G), is the largest integer k such that G has a kvertex coloring with the property that each color class has a vertex which is adjacent to at least one vertex in each of the other ...Conference object 
NonConstructivity in Kan Simplicial Sets
(Dagstuhl Publishing, 2015)We give an analysis of the nonconstructivity of the following basic result: if X and Y are simplicial sets and Y has the Kan extension property, then Y X also has the Kan extension property. By means of Kripke countermodels ...Conference object