Search for dissertations about: "Compositional data"

Showing result 1 - 5 of 74 swedish dissertations containing the words Compositional data.

  2. 1. Representation of Compositional Relational Programs

    Author : Görkem Paçacı; Andreas Hamfelt; Alberto Pettorossi; Uppsala universitet; []
    Keywords : NATURVETENSKAP; NATURAL SCIENCES; NATURVETENSKAP; NATURAL SCIENCES; Programming; Syntax; Logic Programming; Combilog; CombInduce; Prolog; Variable-free; Point-free; Tacit; Compositional Relational Programming; Combinatory Logic; Predicate-Functor Logic; Program Synthesis; Meta-interpreters; Meta-interpretative Synthesis; Decompositional Synthesis; Inductive Synthesis; Inductive Logic Programming; Usability; Cognitive Dimensions of Notations; Visual Variables; Usability testing; Programming Language usability; Empirical evidence; Informationssystem; Information Systems;

    Abstract : Usability aspects of programming languages are often overlooked, yet have a substantial effect on programmer productivity. These issues are even more acute in the field of Inductive Synthesis, where programs are automatically generated from sample expected input and output data, and the programmer needs to be able to comprehend, and confirm or reject the suggested programs. READ MORE

  4. 2. A Programming Language for Data Privacy with Accuracy Estimations

    Author : Elisabet Lobo Vesga; Chalmers tekniska högskola; []
    Keywords : NATURVETENSKAP; NATURAL SCIENCES; NATURVETENSKAP; NATURAL SCIENCES; NATURVETENSKAP; NATURAL SCIENCES; TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; Differential Privacy; Functional Programming; Databases; Haskell; Accuracy; Concentration Bounds;

    Abstract : Differential privacy offers a formal framework for reasoning about the privacy and accuracy of computations on private data. It also offers a rich set of building blocks for constructing private data analyses. READ MORE

  5. 3. Obsidian: GPU Kernel Programming in Haskell

    Author : Joel Bo Svensson; Chalmers tekniska högskola; []
    Keywords : NATURVETENSKAP; NATURAL SCIENCES; NATURVETENSKAP; NATURAL SCIENCES; Haskell; data-parallelism; GPGPU; DSL; CUDA; parallelism; Obsidian; GPU; NVIDIA; Language design; ; EDSL;

    Abstract : Graphics Processing Units (GPUs) are evolving into powerful general purpose computing platforms. At first, GPU performance was driven by the requirements of 3D graphics computer games. To fit this workload, a GPU is a many-core processor suitable for the data-parallel programming paradigm. READ MORE

  6. 4. Graphic Representation and Visualisation as Modelling Support for the Knowledge Acquisition Process

    Author : Anne Håkansson; Andreas Hamfelt; Harald Kjellin; Uppsala universitet; []
    Keywords : NATURVETENSKAP; NATURAL SCIENCES; Datavetenskap; Artficial Intelligence; Knowledge-Based Systems; Knowledge Acquisition; Graphic Representation; Visualisation; Unified Modelling Language; Modelling Rule-based Systems; Visual programming; Declarative Programming; Information Networks; User-Centered Design; Knowledge Interface; Datavetenskap; Computer science; Datavetenskap; datalogi; Computer Science;

    Abstract : The thesis describes steps taken towards using graphic representation and visual modelling support for the knowledge acquisition process in knowledge-based systems – a process commonly regarded as difficult. The performance of the systems depends on the quality of the embedded knowledge, which makes the knowledge acquisition phase particularly significant. READ MORE

  7. 5. On Compositional Supervisor Synthesis for Discrete Event Systems

    Author : Sahar Mohajerani; Chalmers tekniska högskola; []
    Keywords : TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; NATURVETENSKAP; NATURAL SCIENCES; abstraction; supervisory control theory.; synthesis; Finite-state automata;

    Abstract : Over the past decades, human dependability on technical devices has rapidlyincreased. Many activities of such devices can be described by sequences ofevents, where the occurrence of an event causes the system to go from onestate to another. This is elegantly modeled by automata. READ MORE