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 37 for “"Finite state machine"”.

  1. Finite state machine representation of digital signal processing systems

    … Instead, the filter must be represented as a finite state machine and then implemented using sequential logic circuit synthesis techniques. The logic complexity is found to depend - amongst other considerations - on the so called state (code) assignment. Some preliminary results on this …

    cambridge Repository record for Finite state machine representation of digital signal processing systems (opens in a new tab)

  2. FiniteFuzz : Finite State Machine Fuzzer For Industrial Control IoT Devices

    … the most prevalent approaches. However, fuzzing Finite State Machines (FSMs) poses a significant challenge due to state and input dependency, resulting in exponential exploration time required to unlock the Finite State Machine. To address this issue, we present a novel approach in this research …

    vt Repository record for FiniteFuzz : Finite State Machine Fuzzer For Industrial Control IoT Devices (opens in a new tab)

  3. On Controlling a Pediatric Lower-Limb Exoskeleton Using Finite-State Machine and Electroencephalography

    … this need, the Laboratory for Non-Invasive Brain-Machine Interface Systems at the University of Houston in collaboration with Center for Wearable Exoskeletons at TIRR Memorial Hermann has developed a Pediatric Lower-Extremity Gait System (P-LEGS). This dissertation aims at building a control …

    houston Repository record for On Controlling a Pediatric Lower-Limb Exoskeleton Using Finite-State Machine and Electroencephalography (opens in a new tab)

  4. A finite state machine framework for robust analysis and control of hybrid systems

    … and certification of systems with discrete, finite-valued actuation and sensing. This approach is inspired by classical robust control, and is based on the use of finite state machines as nominal models of the hybrid systems. The development does not assume a particular algebraic or …

    mit Repository record for A finite state machine framework for robust analysis and control of hybrid systems (opens in a new tab)

  5. Print preview using finite state machine emulation of an IBM 3812 page printer

    A methodology and prototype has been developed which enables users of GML and SCRIPT on an IBM 3090 to preview documents on a locally attached personal computer before printing. Currently, no utility exists to accomplish this activity. This new preview process is graphical in nature and provides an …

    vt Repository record for Print preview using finite state machine emulation of an IBM 3812 page printer (opens in a new tab)

  6. Dancing cheek to cheek : haptic communication between partner dancers and swing as a finite state machine

    … the dance domain. Swing dance choreography is a finite state machine, with moves that transition between a small number of poses. Two automated choreographers are presented. One uses an optimization and randomization scheme to compose dances by a sequence of shortest path problems, with edge …

    mit Repository record for Dancing cheek to cheek : haptic communication between partner dancers and swing as a finite state machine (opens in a new tab)

  7. Search-based software engineering: A search-based approach for testing from extended finite state machine (EFSM) models

    The extended finite state machine (EFSM) is a powerful modelling approach that has been applied to represent a wide range of systems. Despite its popularity, testing from an EFSM is a substantial problem for two main reasons: path feasibility and path test case generation. The path feasibility …

    brunel Repository record for Search-based software engineering: A search-based approach for testing from extended finite state machine (EFSM) models (opens in a new tab)

  8. Simulation and mathematical notation of alarms unit for computer assisted resuscitation algorithm

    … high and low blood pressure. Using the alarms finite state machine already provided simulation of the alarms unit was done. The alarms finite state machine was constructed by using the requirements [2] provided by WRAIR [Walter Reed Army Institute of Research]. A mathematical specification was …

    njit Repository record for Simulation and mathematical notation of alarms unit for computer assisted resuscitation algorithm (opens in a new tab)

  9. Optimal state assignment of sequential circuits using a genetic local search with flexible cost functions

    In this dissertation, we solve the finite state machine (FSM) state assignment problem using an implementation of a genetic local search algorithm (GLS) that selectively targets design goals with the use of flexible cost functions. Our GLS quickly converges toward a globally optimal state encoding, …

    uiuc Repository record for Optimal state assignment of sequential circuits using a genetic local search with flexible cost functions (opens in a new tab)

  10. Development of the detector control system for the ATLAS Level-1 trigger and measurement of the single top production cross section

    … has been developed for archiving this data. A Finite State Machine (FSM) has also been developed to offer remote access to the L1 Trigger hardware from the ATLAS Control Room. This Thesis also discusses the discovery potential for electroweak single top production during early running. Using …

    birmingham Repository record for Development of the detector control system for the ATLAS Level-1 trigger and measurement of the single top production cross section (opens in a new tab)

  11. Construction of a random signal with a specific Psd and a uniform Pdf

    … colored random signal is implemented using a finite state machine (FSM) and Linear Feedback Shift Registers (LFSRs).

    unlv Repository record for Construction of a random signal with a specific Psd and a uniform Pdf (opens in a new tab)

  12. Following recipes with a cooking robot

    … The system was first implemented as a static finite state machine, which was tested through 27 baking attempts, 16 of which successfully resulted in edible cookies. The system was then implemented as a dynamic state machine, in which the robot estimated the world state and planned sequences of …

    mit Repository record for Following recipes with a cooking robot (opens in a new tab)

  13. An Analysis of FSM Mutation Operators

    … is extensively used for the comparison of state-based testing methods that work from a finite state machine (FSM); In this thesis, we report on results from an experiment during which we compared different mutation operators used to generate FSM mutants. We randomly generated multiple …

    carleton Repository record for An Analysis of FSM Mutation Operators (opens in a new tab)

  14. A variable compliance controller for cooperative vision guided robotic assembly

    … contact forces that arise from different contact states between the peg and hole during assembly. Typically, a position or force controlled robotic insertion system is fitted with a specialized mechanically compliant wrist, known as a remote center compliance (RCC) device, to allow the system to …

    unm Repository record for A variable compliance controller for cooperative vision guided robotic assembly (opens in a new tab)

  15. Modeling reconfiguration algorithms for regular architecture

    … Model (TAM), each cell determines its next state based on its state and its neighbors' states, and communicates its state information to its neighbors. In the Interconnected Finite State Machine Model (IFS:MM:), each cell determines its next state and outputs based on its state and its …

    vt Repository record for Modeling reconfiguration algorithms for regular architecture (opens in a new tab)

  16. Interface conversion between CCITT recommendations X.21 and V.24

    … in detail using the OSI layered approach. Finite state machine (FSM) terminology is defined and the concept of an interface machine introduced. CCITT recommendation V.24 is described in terms of the physical layer of the OSI model. Only those aspects of V.24 relevant to the subject of this …

    cape-town Repository record for Interface conversion between CCITT recommendations X.21 and V.24 (opens in a new tab)

  17. Mechanistic Interpretability for Progress Towards Quantitative AI Safety

    … Python code. By transforming an RNN into a finite state machine and applying symbolic regression, MIPS successfully addresses 32 out of 62 algorithmic tasks, outperforming GPT-4 in 13 unique challenges. The work intends to take a step forward in enhancing the interpretability and reliability …

    mit Repository record for Mechanistic Interpretability for Progress Towards Quantitative AI Safety (opens in a new tab)

  18. Towards Accurate and Reliable Industrial Intrusion Detection Systems Using Shadow Replicas

    … The shadow replica is augmented with a Finite State Machine (FSM) to compute the anticipated states of both the SCADA system and connected devices. Isolated from the operational network, it is protected from direct front-end attacks. When the SCADA system becomes compromised, even …

    vt Repository record for Towards Accurate and Reliable Industrial Intrusion Detection Systems Using Shadow Replicas (opens in a new tab)

  19. Content-based Digital Video Processing. Digital Videos Segmentation, Retrieval and Interpretation.

    … detection using content-based rules and FSM (finite state machine). Thirdly, the shot detection is implemented using local and global indicators. Fourthly, a context awareness approach is proposed to detect shot boundaries. Fifthly, a fuzzy logic method is implemented for shot detection. …

    bradford Repository record for Content-based Digital Video Processing. Digital Videos Segmentation, Retrieval and Interpretation. (opens in a new tab)

  20. Pattern synthesis and perturbation in tessellation automata

    … Next, computational equivalence of Turing Machines and tessellation automata is demonstrated. This shows the powerful nature of tessellation automata. Following this, the existence of cyclic patterns with unique subpatterns is proven. These results are relied upon heavily for the remainder …

    vt Repository record for Pattern synthesis and perturbation in tessellation automata (opens in a new tab)

Page 1 of 2