Sökning: "minimum data set"

Visar resultat 1 - 5 av 97 avhandlingar innehållade orden minimum data set.

1. 1. Approximation Algorithms for Geometric Networks

   Författare :Mattias Andersson; Data Vetenskap; []
   Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; NATURVETENSKAP; NATURAL SCIENCES; control; systems; numerical analysis; Computer science; Geometric Networks; Computational Geometry; Approximation Algorithms; Datalogi; numerisk analys; system; kontroll; Systems engineering; computer technology; Data- och systemvetenskap;

   Sammanfattning : The main contribution of this thesis is approximation algorithms for several computational geometry problems. The underlying structure for most of the problems studied is a geometric network. LÄS MER

3. 2. ICELANDIC NURSING HOME RESIDENTS: THEIR MORTALITY, HEALTH, FUNCTIONAL PROFILE, AND CARE QUALITY, USING THE MINIMUM DATA SET OVER TIME

   Författare :Ingibjörg Hjaltadottir; Institutionen för hälsovetenskaper; []
   Nyckelord :MEDICIN OCH HÄLSOVETENSKAP; MEDICAL AND HEALTH SCIENCES; geriatric nursing; quality indicators; Minimum Data Set; nursing homes; health needs assessment; Older people;

   Sammanfattning : The overall aim of this thesis was to investigate trends over time in residents’ health status, functional profile and predictors of mortality at admission to Icelandic nursing homes and in addition to determine upper and lower thresholds for Minimum Data Set (MDS) Quality Indicators, to investigate the prevalence of quality indicators over time and their association with the health status and functional profile of residents in Icelandic nursing homes. Studies I and II included 2,206 persons assessed over 11 years (1996-2006). LÄS MER

4. 3. Modeling Width in Spatial Optimization in Raster Space

   Författare :Lindsi Seegmiller; Takeshi Shirabe; Lars Harrie; KTH; []
   Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; raster-based geographic information system; spatial optimization; region selection; width; optimal routing; raster data modeling; distortion; corridor; rasterbaserat geografiskt informationssystem; rumslig optimering; regionval; bredd; optimal routing; rasterdatamodellering; distorsion; korridor; Geoinformatik; Geoinformatics;

   Sammanfattning : Given a grid of cells, each of which is assigned a numerical value quantifying its utility (or cost) for a certain use, a popular type of problem in geographic information science is raster-based spatial optimization. Such problems commonly seek to find a set of cells that maximizes (or minimizes) that utility (or cost) while adhering to a given set of constraints. LÄS MER

5. 4. Towards Unifying Stream Processing over Central and Near-the-Edge Data Centers

   Författare :Hooman Peiro Sajjad; Vladimir Vlassov; Johan Tordsson; KTH; []
   Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; geo-distributed stream processing; geo-distributed infrastructure; edge computing; edge-based analytics; Informations- och kommunikationsteknik; Information and Communication Technology;

   Sammanfattning : In this thesis, our goal is to enable and achieve effective and efficient real-time stream processing in a geo-distributed infrastructure, by combining the power of central data centers and micro data centers. Our research focus is to address the challenges of distributing the stream processing applications and placing them closer to data sources and sinks. LÄS MER

7. 5. New Results on Combinatorial Algorithms

   Författare :Anders Dessmark; Data Vetenskap; []
   Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Sorting; Subgraph isomorphism; Partial k-trees; computer technology; Time complexity; Parallel computation; Data- och systemvetenskap; Convex layers; Systems engineering; Broadcasting;

   Sammanfattning : In this thesis improved upper bounds for several important combinatorial problems are provided. Below is a list of the main results showed in the thesis. The problem of determining whether a k-connected partial k-tree is isomorphic to subgraph of another partial k-tree is shown to be solvable in time O(nk+2). LÄS MER