Embedded systems are hardware and software based equipment. They are subject to many constraints and must run without stopping. To define the behavior of these systems, dataflow programming models are often used. On one hand, this choice is motivated by the fact that dataflow models allow the description of cyclic behavior, which is needed for embedded systems ; secondly because the analysis of...

In this work we present an algorithm to perform algorithmic differentiation in the context of quantum computing. We two versions algorithm, one which is fully and employees a classical step (hybrid approach). Since implementation elementary functions already possible on computers, scheme that propose can be easily applied. Moreover, since some steps (such as CNOT operator) (or will be) faster c...

Abstract Pulsar timing is a process of iteratively fitting pulse arrival times to constrain the spindown, astrometric, and possibly binary parameters pulsar, by enforcing integer numbers pulsar rotations between times. Phase connection unambiguously determining those rotation while solution. currently requires manual step-by-step phase performed individuals. In an effort quantify streamline thi...

This paper presents a high-level, algorithmic, single-assignment programming language and its optimizing compiler for reconfigurable systems. The compiler is capable of accepting our proposed instruction sets and generating a set of synthesizable VHDL codes. Simulated annealing algorithm at the heart of this compiler determines the design speed and resource needed on Field Programmable Gate Arr...

A new language, called constraint CNF, is proposed. It integrates propositional logic with constraints stemming from constraint programming. A family of algorithms is designed to solve problems expressed in constraint CNF. These algorithms build on techniques from both propositional satisfiability and constraint programming. The result is a uniform language and an algorithmic framework, which a...

We suggest a method using speech corpus elicitation for language preservation and literation projects. We present a simple algorithmic tool called Siblings-and-Cousins for deriving lexical information from a corpus of (possibly error-prone) transcriptions of informal conversations. The formal properties of the algorithm are discussed and exemplified in a 'staged experiment' using two well-descr...