Now showing items 21-40 of 323

• #### Projective Simulation compared to reinforcement learning ﻿

(The University of Bergen, 2015-06-01)
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 Linear-Programming Guided Branching Parameterized Algorithms for Vertex Cover, with Experimental Results ﻿

(The University of Bergen, 2015-06-01)
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, 2015-06-01)
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 MAX-2SAT and MAX-3SAT via multidimensional matrix multiplication ﻿

(The University of Bergen, 2015-06-01)
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, 2015-05-31)
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 One-Time Passwords, Security in Two-Factor Authentication ﻿

(The University of Bergen, 2015-05-29)
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, 2015-05-28)
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, 2015-05-12)
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, 2015-05-04)
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, 2015-05-01)
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 CRISPR-Cas9-mediated generation of knockin human pluripotent stem cells lacking undesired mutations at the targeted locus ﻿

(Elsevier, 2015-05)
The CRISPR-Cas9 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 CRISPR-Cas9 ...
Journal article
• #### Fast Method for Maximum-Flow Problem with Minimum-Lot Sizes ﻿

(The University of Bergen, 2015-03-03)
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 minimum-lot size. ...
Master thesis
• #### Axis patterning by BMPs: cnidarian network reveals evolutionary constraints ﻿

(Elsevier, 2015-03)
BMP signaling plays a crucial role in the establishment of the dorso-ventral 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
• #### High-performance design patterns for modern Fortran ﻿

(Hindawi, 2015)
This paper presents ideas for using coordinate-free 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
• #### B-chromatic number: Beyond NP-hardness ﻿

(Dagstuhl Publishing, 2015)
The b-chromatic number of a graph G, chi_b(G), is the largest integer k such that G has a k-vertex 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
• #### Non-Constructivity in Kan Simplicial Sets ﻿

(Dagstuhl Publishing, 2015)
We give an analysis of the non-constructivity 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
• #### Finding even subgraphs even faster ﻿

(Dagstuhl Publishing, 2015)
Problems of the following kind have been the focus of much recent research in the realm of parameterized complexity: Given an input graph (digraph) on n vertices and a positive integer parameter k, find if there exist k ...
Conference object
• #### Maximum matching width: New characterizations and a fast algorithm for dominating set ﻿

(Dagstuhl Publishing, 2015)
We give alternative definitions for maximum matching width, e.g., a graph G has mmw(G) <= k if and only if it is a subgraph of a chordal graph H and for every maximal clique X of H there exists A,B,C \subseteq X with A ...
Conference object
• #### Parameterized complexity of secluded connectivity problems ﻿

(Dagstuhl Publishing, 2015)
The Secluded Path problem introduced by Chechik et al. in [ESA 2013] models a situation where a sensitive information has to be transmitted between a pair of nodes along a path in a network. The measure of the quality of ...
Conference object