Sökning: "programming primitives"

Visar resultat 1 - 5 av 6 uppsatser innehållade orden programming primitives.

  1. 1. An Arrow Metalanguage for Partially Invertible Computation

    Master-uppsats, KTH/Skolan för elektroteknik och datavetenskap (EECS)

    Författare :Anders Ågren Thuné; [2023]
    Nyckelord :Reversible computation; Domain-specific languages; Arrows; Partial invertibility; Reversibel beräkning; Domänspecifika språk; Arrows; Partiell inverterbarhet;

    Sammanfattning : Programming languages traditionally describe computations going one way: a program might compute a hash value from a string, or an encrypted message from a plaintext. However, sometimes it is also of interest to go the other way around: for encryption, we not only want to encrypt messages but also to decrypt them, and to be sure that the decryption correctly reproduces the original message. LÄS MER

  3. 2. Learning Robotic Reactive Behaviour from Demonstration via Dynamic Tree

    Master-uppsats, KTH/Skolan för elektroteknik och datavetenskap (EECS)

    Författare :Mayank Yadav; [2020]
    Nyckelord :Learning from Demonstration; Sensor-motor coupling; Reactive tree; Behaviour hierarchy; Robotics; Lärande av demonstration; sensor-motorkoppling; reaktivt träd; beteendeshierarki; robotik;

    Sammanfattning : Programming a complex robot is difficult, time-consuming and expensive. Learning from Demonstration (LfD) is a methodology where a teacher demonst--rates a task and the robot learns to execute the task. LÄS MER

  4. 3. Implementation of Data Parallel Primitives on MIMD Shared Memory Systems

    Kandidat-uppsats, Mälardalens högskola/Akademin för innovation, design och teknik

    Författare :Christian Mortensen; [2019]
    Nyckelord :Data parallel; data parallelism; Shared memory; MIMD; primitives;

    Sammanfattning : This thesis presents an implementation of a multi-threaded C library for performing data parallel computations on MIMD shared memory systems, with support for user defined operators and one-dimensional sparse arrays. Multi-threaded parallel execution was achieved by the use of the POSIX threads, and the library exposes several functions for performing data parallel computations directly on arrays. LÄS MER

  5. 4. Online Whole-Body Control using Hierarchical Quadratic Programming : Implementation and Evaluation of the HiQP Control Framework

    Master-uppsats, Linköpings universitet/Artificiell intelligens och integrerade datorsystem

    Författare :Marcus Johansson; [2016]
    Nyckelord :;

    Sammanfattning : The application of local optimal control is a promising paradigm for manipulative robot motion generation.In practice this involves instantaneous formulations of convex optimization problems depending on the current joint configuration of the robot and the environment. LÄS MER

  7. 5. Compositional Decompilation using LLVM IR

    Kandidat-uppsats, Uppsala universitet/Institutionen för informationsteknologi

    Författare :Robin Eklind; [2015]
    Nyckelord :binary analysis; composition; compositional; control flow analysis; decompilation; decompiler; golang; intermediate representation; LLVM IR; post-processing;

    Sammanfattning : Decompilation or reverse compilation is the process of translating low-level machine-readable code into high-level human-readable code. The problem is non-trivial due to the amount of information lost during compilation, but it can be divided into several smaller problems which may be solved independently. LÄS MER