<?xml version="1.0" encoding="UTF-8"?>
<rss xmlns:taxo="http://purl.org/rss/1.0/modules/taxonomy/" xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xmlns:dc="http://purl.org/dc/elements/1.1/" version="2.0">
  <channel>
    <title>BORA Collection: Department of Informatics (Various)</title>
    <link>http://hdl.handle.net/1956/1031</link>
    <description />
    <textInput>
      <title>The Collection's search engine</title>
      <description>Search the Channel</description>
      <name>search</name>
      <link>http://bora.uib.no/simple-search</link>
    </textInput>
    <item>
      <title>Type Systems for Resource Use in Component Software</title>
      <link>http://hdl.handle.net/1956/2396</link>
      <description>Title: Type Systems for Resource Use in Component Software
&lt;br/&gt;
&lt;br/&gt;Authors: Hovland, Dag
&lt;br/&gt;
&lt;br/&gt;Abstract: In many situations a programmer must be concerned with resources which are&#xD;
not accounted and controlled completely by the programming language. These&#xD;
could be external physical resources, like a printer or a screen, it could be more&#xD;
abstract physical resources, like computing time, memory usage, or writing some&#xD;
file to disk or it could be other software components or programs. The resources&#xD;
can be used directly by the program, or indirectly, through the use of libraries&#xD;
or other software. An important property of these resources is their externally,&#xD;
often physically, enforced limits, which are independent of program execution.&#xD;
Finding maximum and minimum number of active or used instances of these&#xD;
resources at some point during execution can be difficult and demand time&#xD;
from both programmer and computer. But this can also be important for safe&#xD;
execution. As a silly example, a program which every minute allocates, but fails&#xD;
to deallocate, 1 byte of memory, will at some point fail, while runtime testing&#xD;
might not reveal this before it is run for a week. Many of the new mobile&#xD;
and low-cost devices (e.g. the hundred dollar laptop http://laptop.org ) would&#xD;
probably also benefit from provable upper limits on the usage of some resources,&#xD;
like writing to the disk or memory.&#xD;
Developing static systems for finding some of these limits, is the goal in which&#xD;
this thesis hopes to take part. With “static” I mean systems which analyse the&#xD;
source code, not the execution of the compiled program.</description>
      <pubDate>Sat, 29 Oct 2005 22:58:59 GMT</pubDate>
    </item>
    <item>
      <title>Development and application of methods for the analysis of microarray gene expression data</title>
      <link>http://hdl.handle.net/1956/2005</link>
      <description>Title: Development and application of methods for the analysis of microarray gene expression data
&lt;br/&gt;
&lt;br/&gt;Authors: Dysvik, Bjarte</description>
      <pubDate>Thu, 19 Oct 2006 22:58:59 GMT</pubDate>
    </item>
    <item>
      <title>Randomised Construction and Dynamic Decoding of LDPC Codes</title>
      <link>http://hdl.handle.net/1956/1946</link>
      <description>Title: Randomised Construction and Dynamic Decoding of LDPC Codes
&lt;br/&gt;
&lt;br/&gt;Authors: Knudsen, Joakim Grahl
&lt;br/&gt;
&lt;br/&gt;Description: Certain errors and misprints have been corrected in this updated&#xD;
edition of the thesis. Bergen, November 9, 2006.</description>
      <pubDate>Tue, 29 Nov 2005 22:58:59 GMT</pubDate>
    </item>
    <item>
      <title>Vulnerabilities in distributed computer systems</title>
      <link>http://hdl.handle.net/1956/1901</link>
      <description>Title: Vulnerabilities in distributed computer systems
&lt;br/&gt;
&lt;br/&gt;Authors: Moen, Vebjørn
&lt;br/&gt;
&lt;br/&gt;Abstract: The society relies more and more on interconnected computers systems and&#xD;
distributed applications. This dissertation considers security in such systems,&#xD;
focusing on how to break the security. Online banking, wireless systems with&#xD;
thin clients, and e-government are covered by the seven papers included in the&#xD;
thesis.</description>
      <pubDate>Tue, 03 Oct 2006 22:58:59 GMT</pubDate>
    </item>
    <item>
      <title>Lineær kompleksitet til produkter av maksimalsekvenser</title>
      <link>http://hdl.handle.net/1956/1803</link>
      <description>Title: Lineær kompleksitet til produkter av maksimalsekvenser
&lt;br/&gt;
&lt;br/&gt;Authors: Ovnerud, Torbjørn</description>
      <pubDate>Fri, 29 Oct 1999 22:58:59 GMT</pubDate>
    </item>
    <item>
      <title>How to cope with incorrect HTML</title>
      <link>http://hdl.handle.net/1956/1731</link>
      <description>Title: How to cope with incorrect HTML
&lt;br/&gt;
&lt;br/&gt;Authors: Parnas, Dagfinn</description>
      <pubDate>Sun, 29 Oct 2000 22:58:59 GMT</pubDate>
    </item>
    <item>
      <title>Inexact solution of the schur complement equation in a primal-dual interior-point method for semidefinite programming</title>
      <link>http://hdl.handle.net/1956/1706</link>
      <description>Title: Inexact solution of the schur complement equation in a primal-dual interior-point method for semidefinite programming
&lt;br/&gt;
&lt;br/&gt;Authors: Frimannslund, Lennart</description>
      <pubDate>Mon, 29 Oct 2001 22:58:59 GMT</pubDate>
    </item>
    <item>
      <title>Drum analysis</title>
      <link>http://hdl.handle.net/1956/1705</link>
      <description>Title: Drum analysis
&lt;br/&gt;
&lt;br/&gt;Authors: Riskedal, Espen
&lt;br/&gt;
&lt;br/&gt;Abstract: 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 are discussed and a measure for correctness is presented.</description>
      <pubDate>Mon, 29 Oct 2001 22:58:59 GMT</pubDate>
    </item>
  </channel>
</rss>

