Sökning: "data types"

Visar resultat 1 - 5 av 2998 avhandlingar innehållade orden data types.

1. 1. Data Stream Mining and Analysis : Clustering Evolving Data

   Författare :Christian Nordahl; Håkan Grahn; Veselka Boeva; Marie Netz; Plamen Angelov; Blekinge Tekniska Högskola; []
   Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Data Stream Mining; Clustering; Data Streams; Data Mining; Computer Science; Datavetenskap;

   Sammanfattning : Streaming data is becoming more prevalent in our society every day. With the increasing use of technologies such as the Internet of Things (IoT) and 5G networks, the number of possible data sources steadily increases. Therefore, there is a need to develop algorithms that can handle the massive amount of data we now generate. LÄS MER

3. 2. Learning from Complex Medical Data Sources

   Författare :Jonathan Rebane; Panagiotis Papapetrou; Isak Samsten; Myra Spiliopoulou; Stockholms universitet; []
   Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Machine Learning; Data Science; Healthcare; Complex Data; Explainable AI; Deep Learning; data- och systemvetenskap; Computer and Systems Sciences;

   Sammanfattning : Large, varied, and time-evolving data sources can be observed across many domains and present a unique challenge for classification problems, in which traditional machine learning approaches must be adapted to accommodate for the complex nature of such data. Across most domains, there is also a need for machine learning models that are both well-performing and interpretable, to help provide explanations of a model's decisions that stakeholders can trust and take appropriate actions with. 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. Throughput and energy efficiency of lock-free data structures: Execution Models and Analyses

   Författare :Aras Atalar; Chalmers tekniska högskola; []
   Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; NATURVETENSKAP; NATURAL SCIENCES; NATURVETENSKAP; NATURAL SCIENCES; Modeling; Data Structures; Throughput; Concurrency; Energy Efficiency; Parallel Computing; Analysis; Performance; Lock-free;

   Sammanfattning : Concurrent data structures are key program components to harness the available parallelism in multi-core processors. Lock-free algorithmic implementations of concurrent data structures offer high scalability and possess desirable properties such as immunity to deadlocks, convoying and priority inversion. LÄS MER

7. 5. Types for Crash Preventionn

   Författare :Lars Pareto; Chalmers tekniska högskola; []
   Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; reliability; dependability; concurrent programming; denotational semantics; real-time systems and embedded systems; data-flow; dynamic storage management; applicative functional programming languages ; type systems;

   Sammanfattning : This thesis seeks to strengthen the capabilities of static polymorphic type-checking (as known from typed lambda calculus and functional programming) to allow a larger class of programming errors to be caught at compile time: the goal is to not only prevent illegal uses of data, but to also errors that lead to busy-loops, deadlocks, stack-overflows and heap-overflows. The thesis exploits that, for recursive programs, many correctness properties (including freedom from errors leading to busy-loops, etc. LÄS MER