Narrow Results

The gesture segmentation is a method that distinguishes meaningful gestures from unintentional movements. Gesture segmentation is a prerequisite stage to continuous gesture recognition which locates the start and end points of a gesture in an input sequence. Yet, this is an extremely difficult task due to both the multitude of possible gesture variations in spatio-temporal space and the co-articulation/movement epenthesis of successive gestures. In this paper, we focus our attention on coping with this problem associated with continuous gesture recognition. This requires gesture spotting that distinguishes meaningful gestures from co-articulation and unintentional movements. In our method, we first segment the input video stream by detecting gesture boundaries at which the hand pauses for a while during gesturing. Next, every segment is checked for movement epenthesis and co-articulation via finite state machine (FSM) matching or by using hand motion information. Thus, movement epenthesis phases are detected and eliminated from the sequence and we are left with a set of isolated gestures. Finally, we apply different recognition schemes to identify each individual gesture in the sequence. Our experimental results show that the proposed scheme is suitable for recognition of continuous gestures having different spatio-temporal behavior.

State encoding problem assigns binary codes to given symbolic states such that a specific objective function such as power dissipation can be optimized in the final implementation. In this paper, we present a novel encoding technique to minimize the switching activity of any given FSMs for low power design. The experiments with standard benchmarks show that the proposed algorithm is a significant improvement over previous ones.

This paper presents a formal and model driven design approach for a high speed data transmission channel. The formal process algebra communicating sequential processes (CSP) was used to specify the system functionality. Automated model checking established, beyond reasonable doubt, important system properties, such as freedom from deadlock and livelock. Once these properties were established, the functionality was translated into an implementation which realizes high speed data transmission between two independent IC chips. Normal and failure case testing ensured that the implementation complies with the specification. This work shows how formal and model driven design methodologies speed up the process of turning ideas into physical problem solutions. More specifically, formal modeling gave us firm understanding and deep insight of the system functionality which enabled us to implement and to select correct system components.

This work is focused on the problem of designing efficient reconfigurable multiplexer banks for RAM-based implementations of reconfigurable state machines. We propose a new architecture (called combination-based reconfigurable multiplexer bank, CRMUX) that use multiplexers simpler than that of the state-of-the-art architecture (called variation-based reconfigurable multiplexer bank, VRMUX). The performance (in terms of speed, area and reconfiguration cost) of both architectures is compared. Experimental results from MCNC finite state machine (FSM) benchmarks show that CRMUX is faster and more area-efficient than VRMUX. The reconfiguration cost of both multiplexer banks is studied using a behavioral model of a reconfigurable state machine. The results show that the reconfiguration cost of CRMUX is lower than that of VRMUX in most cases.

This work introduces a concept of integrating clock gating and power gating in finite state machines (FSMs) to reduce the overall power dissipation. The theory of the proposed power gating technique is to shut down the power supply during periods of inactivity of the FSM. The inactive period is identified by the occurrence of self-loops within the FSM or an unchanged FSM output between successive clock pulses. Clock gating on the other hand disables the clock signal to the sequential blocks of the FSM during this inactive/idle periods. The proposed approach introduces the concept of gating into both the state logic (DGS) and output logic (DGO) in FSM separately and can be implemented in general to all FSMs. The control logic for gating automatically extracts information from the state description of the FSM. An efficient method of partitioning of the FSM is also proposed in this paper to effectively implement the gating techniques. The dual gating approach has been introduced in 10 standard benchmark FSM circuits for DGS technique and later extended to four FSMs for implementing “DGS$+$DGO.” Then the circuits are simulated and synthesized in CADENCE analog and digital design tools. Simulation results show a maximum power reduction of 62.17% in DGS technique and 73% total power savings after implementing “DGS$+$DGO.” The average area overhead in DGS technique is 12.9% whereas in DGS$+$DGO, the area increases by 22.6%. The area overhead and the delay tend to reduce as the size of the FSM increases.

Hazard and operability (HAZOP) analysis technique is used to identify and analyze hazards and operational concerns of a system. It provides a structured framework that can be used to perform a step-by-step safety analysis of a system. This paper details how to apply this method to safety-related scientific software. In this paper, we have developed (1) a nomenclature that singles out 30 primary concepts (2) a canonic set of abstractions of software programming constructs as a function of the primary concepts; (3) a process of translation from an existing design representation to the target design representation in the form of finite state machines; (4) HAZOP templates for each canonical form; and (5) an input variable prioritization method. We also developed a computational tool that can be used to perform HAZOP analysis of scientific software. Its results are compared with those obtained during manual HAZOP analysis by calculating the value of Shannon entropy, correctness, and the time required to perform each analysis. Overall, this method helps identify useful information about the impact of variables in the code that can then be utilized to develop robust code for making safety-critical decisions.

In recent times, enterprise environments such as E-banking, E-commerce, etc., are greatly affected by the evolution of web services and their associated attacks. The process of web service composition gives rise to security issues due to the incompatibility standards of the Simple Object Access Protocol (SOAP) and representational state transfer (REST) features and the compromising service-level agreement (SLA) between the end parties which has not been considered yet. Also, the security assessment process needs to cooperate with good security standards and web services. In case of heterogeneous web services, assessment done using machine learning technologies makes use of pattern analysis where this does not work with the evolving trend behind the web service environment. Hence, there is a need for a security assessment model which will incorporate finite state machine (FSM) in its assessment process to keep track of the various WS-attacks that arise in the web application via web services in heterogeneous environments. The proposed model does the web service composition by compromising all the security conflicts that arise due to the usage of dissimilar web services. We experimented the concept by testing several web services and observed that the performance of the proposed framework in attack detection is accurate and automatic thereby achieving traceability and computability metrics.

Humanity’s efforts are manifested in the creation of novel solutions to complex problems in diverse fields. Traditional mathematical methods fail to solve real-world problems due to their complexity. Researchers have come up with new mathematical theories like fuzzy set theory and rough set theory to help them figure out how to model the uncertainty in these fields. Soft set theory is a novel approach to real-world problem solving that does not require the membership function to be specified. This aids in the resolution of a wide range of issues, and significant progress has recently been made. After Jun et al. came up with a hybrid system that combined fuzzy and soft set concepts, many people came up with hybrid ideas in different algebraic structures. In this paper, we introduce the concepts of subsystem and strong subsystem of a hybrid finite state machine (HFSM) and investigate a portion of their significant properties. We also provide an example that shows that every subsystem does not need to be a strong subsystem. Additionally, we study the cyclic subsystem of HFSMs and also obtain their equivalent results and examples. Finally, we define the notions of homomorphism of subsystems and strong subsystems of HFSMs.

In this study, we present a robust bottom-up Arabic parser that investigates the correctness of Arabic sentences by passing them through a set of predetermined states relying on their individual words. The major benefit of our approach is the reduced number of backup states tested when determining the grammatical structure of a given sentence. The proposed approach is optimized to tokenize the input sentences correctly since accurate tokenization is the essential step of the parser; this process also reduces the parsing time. Our proposed parser is extendable; hence, it allows new words to be added to the lexicon, i.e. the lexicon is built dynamically. Experimental results have demonstrated the effectiveness of our approach in checking correctly numerable sentences with different lengths. The accuracy was 85.88% when tested on a sample of 170 Arabic sentences taken from an existing Arabic text taught in k-12 grade levels.

In this study, applicability of verification and correct-by-design hybrid systems modeling and reachability-based controllers for vehicular automation are investigated. Two perspectives in hybrid systems modeling will be introduced, and then reachability analysis techniques will be developed to compute exact reachable sets from a specified unsafe set. Using level set methods, a Hamilton–Jacobi–Isaacs equation is derived whose solutions describe the boundaries of the finite time backward reachable set, which will be manipulated to design a safe controller that guarantees the safety of a given system. An automated longitudinal controller with a fully integrated collision avoidance functionality will be designed as a hybrid system and validated through simulations with a number of different scenarios in order to illustrate the potential of verification methods in automated vehicles.

To address the problems of customized design, unclear functional interfaces between modules, and complex process control logic in the autonomous operation process control of power robots, this chapter proposes a standardized job file based on XML format for power robot operation task process control, From the perspective of general generality and top-level unified management, a universally applicable control method for the operation process of electric robots was studied. Through hierarchical design, job tasks are subdivided into task items, job items, action items, and other subcategories in standardized format, which improves the flexibility of job sequence configuration and forms job files with complete task information. Corresponding to the hierarchy of job files, a multi-layer finite state machine software framework is designed, combined with job file information, to achieve clear interactive scheduling management of upstream and downstream multi-modules in the job process. This method solves the problems of weak adaptability, low flexibility, and complex control logic in the task flow control components and methods of power robots, and improves the reusability and portability of software functional modules. The application analysis of the autonomous operation of transmission line inspection robots shows that compared with conventional methods, this method can effectively improve the efficiency of operation process control and has good generalization ability for different types of job tasks.

Each year thousands of people suffer from lower limb amputation, mainly due to three causes: wars, accidents and vascular diseases. The development of lower limb prosthesis is crucial to restore people’s mobility, improving the quality of life of millions of people. This contribution presents a gait events detector algorithm capable of detecting all the events of the human walking. Results show the correct transition between phases during several gait cycles for a human model walking in flat terrain.