Browsing Department of Informatics by Title
Now showing items 860-879 of 922
-
A Type System for Usage of Software Components
(Lecture Notes in Computer Science, Chapter; Peer reviewed, 2009)The aim of this article is to support component-based software engineering by modelling exclusive and inclusive usage of software components. Truong and Bezem describe in several papers abstract languages for component ... -
Type Systems for Guaranteeing Resource Bounds of Component Software
(Doctoral thesis, 2006-05-15)Since the early days of the development of programming languages, people have been developing various methods to reduce the runtime errors of software programs. These methods range from static analysis, testing to runtime ... -
Type Systems for Resource Use in Component Software
(Master thesis, 2006)In many situations a programmer must be concerned with resources which are not accounted and controlled completely by the programming language. These could be external physical resources, like a printer or a screen, it ... -
Type theoretical databases
(Journal article; Peer reviewed, 2020)We show how the display-map category of finite (symmetric) simplicial complexes can be seen as representing the totality of database schemas and instances in a single mathematical structure. We give a sound interpretation ... -
Typical Sequences Revisited - Computing Width Parameters of Graphs
(Journal article; Peer reviewed, 2021)In this work, we give a structural lemma on merges of typical sequences, a notion that was introduced in 1991 [Lagergren and Arnborg, Bodlaender and Kloks, both ICALP 1991] to obtain constructive linear time parameterized ... -
Typical Sequences Revisited – Computing Width Parameters of Graphs
(Journal article; Peer reviewed, 2020)In this work, we give a structural lemma on merges of typical sequences, a notion that was introduced in 1991 [Lagergren and Arnborg, Bodlaender and Kloks, both ICALP 1991] to obtain constructive linear time parameterized ... -
The Ultimate GUI Framework: Are We There Yet?
(Journal article; Peer reviewed, 2023)The programming community seems to be forever searching for the ultimate user interface programming approach and the accompanying framework. We describe the landscape of recent efforts in this quest through describing ... -
A Unifying Framework for Characterizing and Computing Width Measures
(Journal article; Peer reviewed, 2022)Algorithms for computing or approximating optimal decompositions for decompositional parameters such as treewidth or clique-width have so far traditionally been tailored to specific width parameters. Moreover, for mim-width, ... -
Unitary Branching Programs: Learnability and Lower Bounds
(Journal article; Peer reviewed, 2021)Bounded width branching programs are a formalism that can be used to capture the notion of non-uniform constant-space computation. In this work, we study a generalized version of bounded width branching programs where ... -
The unsuitable neighbourhood inequalities for the fixed cardinality stable set polytope
(Chapter, 2021)Given an undirected graph G = (V, E) and an integer k∈{1,…,|V|} , we initiate the combinatorial study of stable sets of cardinality exactly k in G. Our aim is to instigate the polyhedral investigation of the convex hull ... -
User-configurable, high-level transformations with CodeBoost
(Master thesis, 2003)Scalable design of large applications requires domain-specific, high-level abstraction. Classically, there has been a tension between abstraction and good performance. We demonstrate how to overcome this tension by augmenting ... -
Using 3D functionality available in current web-browsers to create and visualize geological models.
(Master thesis, 2017-07-11)This thesis investigates the possibility of using modern web technologies to develop accessible applications for interactive covisualization of geological data such as topography, seismic slices and measurements from wells. ... -
Using Heat and Ceilometer to create an elastic OpenStack grid
(Master thesis, 2017-06-21)Grid computing is a term for connecting computing resources together to solve large computational problems. Computational grids are used for a lot of computations within the high energy physics domain, where the amount of ... -
Using Natural Language Processing with Deep Learning to Explore Clinical Notes
(Master thesis, 2021-06-02)In recent years, the deep learning community and technology have grown substantially, both in terms of research and applications. However, some application areas have lagged behind. The medical domain is an example of a ... -
Using registries to integrate bioinformatics tools and services into workbench environments
(Peer reviewed; Journal article, 2015)The diversity and complexity of bioinformatics resources presents significant challenges to their localisation, deployment and use, creating a need for reliable systems that address these issues. Meanwhile, users demand ... -
Using Smart Cards to Mitigate Security Threats on Mobile Devices
(Master thesis, 2016-05-31)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 ... -
Utilizing the HTM algorithms for weather forecasting and anomaly detection
(Master thesis, 2016-11-17)Various studies have utilized different artificial neural networks (ANN) for weather forecasting. This thesis examines how well the official implementation of a novel online ANN called the Hierarchical Temporal Memory (HTM) ... -
Utvidelse og formell sikkerhetsanalyse av Dynamic Presentation Generator
(Master thesis, 2013-05-02)Oppgaven omhandler sikkerhetsproblematikk i Dynamic Presentation Generator og undersøker muligheten for å bruke en single-sign-on via Mi side. -
Utvikling og portering av Java ME applikasjoner
(Master thesis, 2008-06-02)Ved utvikling av mobilapplikasjoner i Java ME møter man anderledes utfordringer enn ved mer tradisjonell utvikling av skrivebordsapplikasjoner og/eller webbaserte applikasjoner. Denne oppgaven tar for seg disse forskjellene ... -
Variants of plane diameter completion
(Peer reviewed; Journal article, 2015)The Plane Diameter Completion problem asks, given a plane graph G and a positive integer d, if it is a spanning subgraph of a plane graph H that has diameter at most d. We examine two variants of this problem where the ...