Sökning: "data set"

Visar resultat 6 - 10 av 3131 avhandlingar innehållade orden data set.

  1. 6. Open Government Data as a Reform and Ecosystem : A conceptual framework for evolution and health

    Författare :Jonathan Crusoe; Ulf Melin; Gustaf Juell-Skielse; Linköpings universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Open Government Data; Reform; Ecosystem; Health; Evolution; Impediment; Barrier; Risk; Enricher; User; Seeker; Provider; Publisher; Öppna data; ekosystem; reform; hälsa; evolution; hinder; barriär; risk; berikare; användare; sökare; medborgare; tillgängliggörare; publicerare;

    Sammanfattning : Introduction: This doctoral thesis in Information Systems disentangles the interplay of an OGD reform and an OGD ecosystem. Open government data (OGD) refers to data shared by public organizations, in the role of providers, following certain principles for anyone to reuse. LÄS MER

  3. 7. Scalable and Reliable Data Stream Processing

    Författare :Paris Carbone; Seif Haridi; Peter Pietzuch; KTH; []
    Nyckelord :TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; distributed systems; stream processing; data management; databases; distributed computing; data processing; fault tolerance; database optimisation; programming systems; data science; data analytics; computer science; Informations- och kommunikationsteknik; Information and Communication Technology;

    Sammanfattning : Data-stream management systems have for long been considered as a promising architecture for fast data management. The stream processing paradigm poses an attractive means of declaring persistent application logic coupled with state over evolving data. LÄS MER

  4. 8. 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

  5. 9. Set Constraints for Local Search

    Författare :Magnus Ågren; Pierre Flener; Justin Pearson; Gilles Pesant; Uppsala universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Computer science; combinatorial problems; constraint-based local search; constraint-directed search; constraint programming; incremental algorithms; monadic existential second-order logic; neighbourhoods; penalty; set variables; set constraints; variable conflicts; Computer science; Datavetenskap; Datavetenskap; Computer Science;

    Sammanfattning : Combinatorial problems are ubiquitous in our society and solving such problems efficiently is often crucial. One technique for solving combinatorial problems is constraint-based local search. Its compositional nature together with its efficiency on large problem instances have made this technique particularly attractive. LÄS MER

  7. 10. Synthetic data for visual machine learning : A data-centric approach

    Författare :Apostolia Tsirikoglou; Jonas Unger; Gabriel Eilertsen; Anders Ynnerman; Philipp Slusallek; Linköpings universitet; []
    Nyckelord :TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; Training data; Synthetic images; Computer graphics; Generative modeling; Natural images; Histopathology; Digital pathology; Machine learning; Deep learning;

    Sammanfattning : Deep learning allows computers to learn from observations, or else training data. Successful application development requires skills in neural network design, adequate computational resources, and a training data distribution that covers the application do-main. LÄS MER