Sökning: "higher order programming"

Visar resultat 21 - 25 av 54 avhandlingar innehållade orden higher order programming.

1. 21. On Speech-to-Text Alignment, Phonetic Labeling, and Recursive Signal Processing

   Författare :Åke Andersson; Chalmers tekniska högskola; []
   Nyckelord :TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; phonetic labeling; recursive algorithms; adaptive algorithms; speech-to-text alignment; dynamic programming; time-varying systems; subspace tracking; time-alignment; parameter estimation; time-warping;

   Sammanfattning : Speech data-bases are an important issue in the study of speech communication. In particular, time-aligned and phonetically labeled speech data-bases are useful during the design of applications such as speech recognizers. The time-alignment and labeling of the speech data is traditionally done manually. LÄS MER

3. 22. Optimization using discrete event simulation and mixed integer programming: application on haulage systems for deep underground mines

   Författare :Abubakary Salama; Sunniva Haugen; Luleå tekniska universitet; []
   Nyckelord :TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; Mining and Rock Engineering; Gruv- och berganläggningsteknik;

   Sammanfattning : The application of discrete event simulation for the optimization of the haulage methods of underground operations at great depth is presented. The discrete event simulation was carried out to evaluate four haulage methods for the improvement of the overall mine production and a minimizing of the operating costs. LÄS MER

4. 23. A framework for reasoning about Erlang code

   Författare :Lars-Åke Fredlund; RISE; []
   Nyckelord :NATURVETENSKAP; NATURAL SCIENCES;

   Sammanfattning : We present a framework for formal reasoning about the behaviour of software written in Erlang, a functional programming language with prominent support for process based concurrency, message passing communication and distribution. The framework contains the following key ingredients: a specification language based on the mu-calculus and first-order predicate logic, a hierarchical small-step structural operational semantics of Erlang, a judgement format allowing parameterised behavioural assertions, and a Gentzen style proof system for proving validity of such assertions. LÄS MER

5. 24. On Modelling and Analysing Concurrent Systems

   Författare :Karol Ostrovsky; Chalmers tekniska högskola; []
   Nyckelord :NATURVETENSKAP; NATURAL SCIENCES;

   Sammanfattning : In order to verify program correctness one needs an appropriate programming language, a specification of the program correctness, and some methods to prove the program correct. We examine two of these aspects: a language for writing a particular kind of concurrent programs, that is modelling concurrent systems, and methods to prove certain correctness properties of concurrent programs, that is analysing concurrent systems. LÄS MER

7. 25. Time- and size-efficient supercompilation

   Författare :Peter A. Jonsson; Taha Walid; Luleå tekniska universitet; []
   Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Dependable Communication and Computation Systems; Kommunikations- och beräkningssystem;

   Sammanfattning : Intermediate structures such as lists and higher-order functions are very common in most styles of functional programming. While allowing the programmer to write clear and concise programs, the creation and destruction of these structures impose a run time overhead which is not negligible. LÄS MER