Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 20 of 577 for “"automaton"”.

  1. Practical Automaton proofs in PVS

    This thesis is about an approach to modeling, validating and verifying com- puter-based systems. The kinds of systems we examine happen to be em- bedded systems, for the most part, but our approach is generally applicable to computer-based systems. Since veri?cation is essential to the production …

    radboud Repository record for Practical Automaton proofs in PVS (opens in a new tab) Download PDF for Practical Automaton proofs in PVS (opens in a new tab)

  2. Audio browsing of automaton-based hypertext

    With the wide-spread adoption of hypermedia systems and the World Wide Web (WWW) in particular, these systems have evolved from simple systems with only textual content to those that incorporate a large content base, which consists of a wide variety of document types. Also, with the increase in the …

    tamu Repository record for Audio browsing of automaton-based hypertext (opens in a new tab)

  3. EVALUATION OF PERFORMA – THE PERFECT FORMS AUTOMATON

    … enterprise and developers. The Perfect Forms Automaton or Performa under development at CrimsonLogic Pte Ltd aims to become a commercial-standard Web forms development framework. The entire framework is based on XML and its derivative standards. It stresses on the sound principle of separation …

    nus Repository record for EVALUATION OF PERFORMA – THE PERFECT FORMS AUTOMATON (opens in a new tab) Download file for EVALUATION OF PERFORMA – THE PERFECT FORMS AUTOMATON (opens in a new tab)

  4. An Automaton-Theoretic View of Algebraic Specifications

    … We prove that every specification using an automaton can be converted into an algebraic specification describing the same abstract data type. This conversion utilises a set of canonical words, representing states in the automaton. We next consider varieties of monoids as a heuristic for …

    waterloo Repository record for An Automaton-Theoretic View of Algebraic Specifications (opens in a new tab)

  5. The Victorian Automaton: Technology, Agency, and Fiction

    … attends to the complex figure of the automaton in Victorian fiction. The metaphorical potency of this figure is based upon its conceptual instability; as either a machine that imitates the movements of a living being or a living being behaving mechanically, the automaton is an …

    toronto-retro Repository record for The Victorian Automaton: Technology, Agency, and Fiction (opens in a new tab)

  6. Evaluating Performance of Automaton University Checking Algorithms

    NFA universality is an important problem in formal verification, since it is an effective proxy for complementation of NFAs - a key operation that underlies most verification algorithms. However, because complemented automata are extremely large, many modern tools use symbolic representations to …

    rice Repository record for Evaluating Performance of Automaton University Checking Algorithms (opens in a new tab)

  7. Learning via automaton minimization and matrix factorization

    <p>This thesis focuses on weighted-automaton learning and minimization, matrix factorization, and the relationships between these areas.</p> <p>The first part of the thesis studies minimization and learning of weighted automata with weights in a field, focusing on tree automata as representations …

    oxford Repository record for Learning via automaton minimization and matrix factorization (opens in a new tab)

  8. Characterisation Theorems for Weighted Tree Automaton Models

    … the last class can be considered as a weighted automaton model, we refer to page 188 of the thesis. We will now summarise the main contributions of the thesis. In Chapter 3, we focus on the determinisation of weighted tree automata and present our determinisation framework, called …

    qucosa-diss

  9. Automaton and competence aspects of Piagetian logical concepts

    … obtained of (a) the Ss ' level of attainment on automaton variables (foresight and hindsight abilities and size of computing space) theoretically presumed to be necessary to the attainment of logical structures, and (b) the Ss' level of attainment in logical tasks belonging to the same conceptual …

    ubc Repository record for Automaton and competence aspects of Piagetian logical concepts (opens in a new tab) Download PDF for Automaton and competence aspects of Piagetian logical concepts (opens in a new tab)

  10. Cellular Automaton Based Algorithms for Wireless Sensor Networks

    … underwater sensor networks. We design cellular automaton based local algorithms for these problems. The cellular automaton is a bioinspired model used to model different physical systems including wireless sensor networks. One of the main advantages of using cellular automaton based algorithms …

    queens Repository record for Cellular Automaton Based Algorithms for Wireless Sensor Networks (opens in a new tab)

  11. Design and implementation of photovoltaic energy harvesting automaton

    … our design of a photovoltaic energy harvesting automaton - "IziBu". We have aimed our design objectives to be autonomy and scalability. Our design includes dual-axis Sun tracking and sensory data acquisition and processing. We have made our system to be powered solely by an attached photovoltaic …

    njit Repository record for Design and implementation of photovoltaic energy harvesting automaton (opens in a new tab)

  12. A Lattice Gas Cellular Automaton with Tomographic Dynamics

    We study the tomographic effect in lattice gas cellular automata, which are simple discrete models for hydrodynamics. The tomographic effect is predicted in two-dimensional Fermi liquids whenever head-on scattering dominates, leading to inefficient angular relaxation due to Pauli blocking. As a …

    chalmers Repository record for A Lattice Gas Cellular Automaton with Tomographic Dynamics (opens in a new tab)

  13. Ab initio derivation of the cascaded lattice Boltzmann automaton

    In this thesis, an executable cellular automaton model for athermal fluids is <br>derived from first principles. The time evolution of a fluid is described by <br>deterministic streaming of particles and their collisions. It is shown that the <br>assumption of a symmetric equilibrium and the …

    freiburg-diss Repository record for Ab initio derivation of the cascaded lattice Boltzmann automaton (opens in a new tab)

  14. Integration and optimization of isotachophoresis on a programmable microfluidics automaton

    We present a programmable microfluidic array (PMA) to perform fully automated isotachophoresis (ITP) for multiple analytes simultaneously. Although conventional ITP can be time efficient for pre-concentration of a single analyte, it becomes lengthy in time to pre-concentrate multiple analytes …

    ttu Repository record for Integration and optimization of isotachophoresis on a programmable microfluidics automaton (opens in a new tab)

  15. New metrics for finite automaton complexity and subregular language hierarchies

    … width of an NFA or a DFA (deterministic finite automaton). It is well known that acyclic NFAs define exactly the class of finite languages. We consider less restrictive conditions that define the class of nearly acyclic NFAs. An NFA is nearly acyclic if it does not have two cycles where one can …

    queens Repository record for New metrics for finite automaton complexity and subregular language hierarchies (opens in a new tab)

  16. A Modernism Against Maestros: Horacio Quiroga and the Transnational Automaton

    … I will focus my inquiry on the image of the automaton--an artificial or constructed human being that appears throughout Western literature, but becomes especially prevalent in modernist literature. By examining parallel treatments of the automaton by European authors Sigmund Freud and Karel …

    clemson Repository record for A Modernism Against Maestros: Horacio Quiroga and the Transnational Automaton (opens in a new tab)

  17. Complexity Properties of the Cellular Automaton <i>Game of Life</i>

    … of Life is probably the most famous cellular automaton. Life shows all the characteristics of Wolfram's complex Class IV cellular automata: long-lived transients, static and propagating local structures, and the ability to support universal computation. We examine in this thesis questions …

    portland-state Repository record for Complexity Properties of the Cellular Automaton <i>Game of Life</i> (opens in a new tab)

Page 1 of 29