Application of Union of Fuzzy Automata on Target Tracking

For better applications of fuzzy automata on target tracking, this paper presents an associated method of fuzzy automata by discussing the relation between fuzzy automata. The equivalence is mainly discussed regarding these fuzzy automata. The target tracking based on the associated method of fuzzy automata is given. Moreover, the simulation result shows that the associated method is better than single fuzzy automaton relatively. The development of these researches in this paper in turn can quicken the applications of the fuzzy automata in various fields.

Network selection policy in multi-radio access environment using stochastic control theory

Network selection is crucial in improving the performance of heterogeneous wireless access systems. Most of previous work on network selection or radio resource allocation concentrates on the capability of each available network and ignores the time-varying nature of wireless media due to channel fading. However, the channel condition determines the state of each wireless network and plays a vital role in ensuring quality of service in multi-radio access environment. In this article, we propose a network selection policy using stochastic control theory considering the time-varying and stochastic character of wireless channels. The proposed scheme selects one network among different alternatives in each decision epoch according to the channel state of each network, which is modeled as finite-state Markov channel, with the objectives of increasing the data-rate, decreasing the bit error rate and minishing the delay. The procedure of network selection is formulated as a stochastic control problem, which can be solved using linear programming and primal-dual index heuristic algorithm. Simulation results are presented to show that network selection has great impact on the system performance, and the proposed scheme can improve the performance significantly.

Robust multi-path routing for dynamic topology in wireless sensor networks

Wirreless sensor networks are being widely researched and are expected to be used in several scenarios. On the leading edge of treads, on-demand, high-reliability, and low-latency routing protocol is desirable for indoor environment applications. This article proposes a routing scheme called robust multi-path routing that establishes and uses multiple node-disjoint routes. Providing multiple routes helps to reduce the route recovery process and control the message overhead. The performance comparison of this protocol with dynamic source routing （DSR） by OPNET simulations shows that this protocol is able to achieve a remarkable improvement in the packet delivery ratio and average end-to-end delay.

Clustering of behavioral phases in FSMs and its applications to VLSI test

This paper presents a new level of description between behavioral and state descriptions of a finite-state machine (FSM). The description is termed behavioral phase clustering description. New concepts of behavioral phase and clustering of behavioral phases in an FSM are introduced. The new description simplifies functional analysis, verification and test of FSM designs. If an FSM is described at low level, some states can be clustered into behavioral phases directly. If it is described at behavioral level, behavioral phases can be extracted from the behavioral description, and clustering of behavioral phases can be performed through easy functional analysis. As one application of behavioral phase clustering descriptions, a new technique employed in a test generation system, ATCLUB, at Register Transfer (RT)-level based on a behavioral phase transition fault model is introduced in this paper. In ATCLUB, test generation process is accelerated through clustering of behavioral phases. Experimental results show that ATCLUB generates test sequence efficiently, with a sharp decrease in vector count at the penalty of a slightly decrease in fault coverage comparing to other ATPC tools.

Intelligent Knee Prostheses: A Systematic Review of Control Strategies

The intelligent knee prosthesis is capable of human-like bionic lower limb control through advanced control systems and artificial intelligence algorithms that will potentially minimize gait limitations for above-knee amputees and facilitate their reintegration into society.In this paper,we sum up the control strategies corresponding to the prevailing control objectives(position and impedance)of the current intelligent knee prosthesis.Although these control strategies have been successfully implemented and validated in relevant experiments,the existing deficiencies still fail to achieve optimal performance of the controllers,which complicates the definition of a standard control method.Before a mature control system can be developed,it is more important to realize the full potential for the control strategy,which requires upgrading and refining the relevant key technologies based on the existing control methods.For this reason,we discuss potential areas for improvement of the prosthetic control system based on the summarized control strategies,including intent recognition,sensor system,prosthetic evaluation,and parameter optimization algorithms,providing future directions toward optimizing control strategies for the next generation of intelligent knee prostheses.

High throughput relay policy in wireless cooperative relaying networks based on stochastic control theory

This paper proposes a distributed relay and modulation and coding scheme （MCS） selection in wireless cooperative relaying networks where the adaptive modulation and coding （AMC） scheme is applied. First-order finite-state Markov channels （FSMCs） are used to model the wireless channels and make prediction. The objective of the relay policy is to select one relay and MCS among different alternatives in each time-slot according to their channel state information （CSI） with the goal of maximizing the throughput of the whole transmission period. The procedure of relay and MCS selection can be formulated as a discounted Markov decision chain, and the relay policy can be obtained with recent advances in stochastic control algorithms. Simulation results are presented to show the effectiveness of the proposed scheme.

Static Analysis-Based Behavior Model Building for Trusted Computing Dynamic Verification

Current trusted computing platform only verifies application＇s static Hash value, it could not prevent application from being dynamic attacked. This paper gives one static analysis-based behavior model building method for trusted computing dynamic verification, including control flow graph （CFG） building, finite state automata （FSA） constructing, e run cycle removing, e transition removing, deterministic finite state （DFA） constructing, trivial FSA removing, and global push down automata （PDA） constructing. According to experiment, this model built is a reduced model for dynamic verification and covers all possible paths, because it is based on binary file static analysis.

Code design for run-length control in visible lightcommunication

Run-length limited(RLL)codes can facilitate reliable data transmission and provide flicker-free illumination in visible light communication(VLC)systems.We propose novel high-rate RLL codes,which can improve error performance and mitigate flicker.Two RLL coding schemes are developed by designing the finite-state machine to further enhance the coding gain by improving the minimum Hamming distance and using the state-splitting method to realize small state numbers.In our RLL code design,the construction of the codeword set is critical.This codeword set is designed considering the set-partitioning algorithm criterion.The flicker control and minimum Hamming distance of the various proposed RLL codes are described in detail,and the flicker performances of different codes are compared based on histograms.Simulations are conducted to evaluate the proposed RLL codes in on-off keying modulation VLC systems.Simulation results demonstrate that the proposed RLL codes achieve superior error performance to the existing RLL codes.

Conformance testing of FMI calling sequence for simulation environments

Exchanging simulation models is currently of utmost importance.To improve interoperability between suppliers and original equipment manufacturers(OEMs),the functional mock-up interface(FMI)is exchanged in a standard format called functional mock-up unit(FMU).Since its first release,many simulation tools took the initiative to support FMI.However,since then,there have been many complaints stating that exchanging models via FMI does not work as stable as expected.The reason usually turned out to be the implementation of tool vendors that sometimes fail to comply with the standard fully.This paper introduces a methodology for testing FMI compliance of importing simulation tools using a set of reference FMUs.The standard defines the implementation of FMI functions calling sequence in a state machine.Therefore,conformance testing(also called fault detection)from automata theory is utilized to produce reference FMUs based on the FMI state-machine.

Fuzzy Syntactic Congruence and Rational Fuzzy Languages

In this paper the notion of rational fuzzy language is introduced, and a theorem is obtained: a fuzzy subset of Σ* is recognizable if and only if it′s rational. The result connects the rational fuzzy language with fuzzy finite-state automaton language.