Sökning: "range data"

Visar resultat 1 - 5 av 2716 avhandlingar innehållade orden range data.

  1. 1. Kretslopp av data : Miljö, befolkning, förvaltning och den tidiga digitaliseringens kulturtekniker

    Författare :Johan Fredrikzon; Staffan Bergwik; Thomas Götselius; Anders Ekström; Stockholms universitet; []
    Nyckelord :HUMANIORA; HUMANITIES; archive; digital; data; cartography; census; cultural technique; cybernetics; delete; ecology; environment; erase; infrastructure; linking; magnetic; modelling; monitoring; office; paper; recycling; reuse; surveillance; system; tape; UNEP; waste; arkiv; databas; datahantering; datalag; datasäkerhet; Earthwatch; ekologi; Forrester; Foucault; integritet; kontor; länkning; materialitet; modellering; Odum; ordbehandling; radera; SCB; skräp; statskontoret; tidsgeografi; återanvändning; övervakning; History of Ideas; idéhistoria;

    Sammanfattning : This dissertation explores the early digitalization in Sweden. As host to the first summit on the environment in Stockholm 1972 (UNCHE), as leading procurer of computer equipment as well as initiator to the world's first national Data Act of 1973, Sweden pioneered domains that have since emerged as critical to our age: environmental challenges and digital technology. LÄS MER

  3. 2. Lock-free Concurrent Search

    Författare :Bapi Chatterjee; Chalmers tekniska högskola; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; NATURVETENSKAP; NATURAL SCIENCES; NATURVETENSKAP; NATURAL SCIENCES; NATURVETENSKAP; NATURAL SCIENCES; NATURVETENSKAP; NATURAL SCIENCES; TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; NATURVETENSKAP; NATURAL SCIENCES; Wait-free; Help-aware; Non-blocking; Concurrency; Linearizability; Lock-based; Lock-free-kD-tree; Amortized Complexity; Data Structure; Binary Search Tree; Blocking; Search; Concurrent; kD-tree; Linked-list; Lock-free; Range Search; Language-portable; Help-optimal; Nearest Neighbour Search; Linearizable; Synchronization;

    Sammanfattning : The contemporary computers typically consist of multiple computing cores with high compute power. Such computers make excellent concurrent asynchronous shared memory system. LÄS MER

  4. 3. Dynamic Adaptations of Synchronization Granularity in Concurrent Data Structures

    Författare :Kjell Winblad; Konstantinos Sagonas; Erez Petrank; Uppsala universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; NATURVETENSKAP; NATURAL SCIENCES; NATURVETENSKAP; NATURAL SCIENCES; concurrent data structures; contention adapting; range queries; lock-freedom; adaptivity; linearizability; ordered sets; maps; key-value stores; concurrent priority queues; relaxed concurrent data structures; locks; delegation locking; Computer Science; Datavetenskap;

    Sammanfattning : The multicore revolution means that programmers have many cores at their disposal in everything from phones to large server systems. Concurrent data structures are needed to make good use of all the cores. Designing a concurrent data structure that performs well across many different scenarios is a difficult task. LÄS MER

  5. 4. Image Based Visualization Methods for Meteorological Data

    Författare :Björn Olsson; Anders Ynnerman; Reiner Lenz; Anders Hast; Linköpings universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Visualization; Meteorological Data; Artificial Neural Networks; High-Dynamic-Range images; Satellite Data; Classification; Computer science; Datavetenskap;

    Sammanfattning : Visualization is the process of constructing methods, which are able to synthesize interesting and informative images from data sets, to simplify the process of interpreting the data. In this thesis a new approach to construct meteorological visualization methods using neural network technology is described. LÄS MER

  7. 5. Studies in Applied Data Structures

    Författare :Kurt Swanson; Institutionen för datavetenskap; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Systems engineering; Sparse Matrix; Suffix Tree; Roundness; Range searching; Data- och systemvetenskap; computer technology;

    Sammanfattning : The design of efficient data structures is of primary importance in creation of theoretical algorithms as well their more tangible descendants, computer programs. In this dissertation we study computational aspects of data structures and their respective algorithms from a theoretical viewpoint, which are however of direct importance in the implementation of solutions for real-world problems. LÄS MER