The purpose of this study is to apply an integrated algorithm for knowledge structure analysis. The integrated algorithm includes Item Response Theory (IRT) and Fuzzy Structural Modeling (FSM). The authors use the psychometric model IRT for calculation the ability of task-takers. Based on original response data and item-concept matrix, the individualized fuzzy subordinate matrix is acquired. FS...

A target structure for implementing fast on-line testable control units for data-dominated applications is presented. In many cases, the proposed controller structure leads to a performance improvement of more than 30% for a standard benchmark set whereas the area overhead is less than 15% compared with conventional on-line testable finite state machines (FSM). The proposed approach is compatib...

In this paper, we consider how to hide information into finite state machine (FSM), one of the popular computation models. The key advantage of hiding information in FSM is that the hidden information becomes inexpensive to retrieve, yet still hard to remove or delete. This is due to the fact that verifying certain FSM properties is easy, but changing them requires efforts equivalent to redoing...

With data increasing continually, data of XML are queried complexly. Several years, there are several algorithms, for example, TJFast which is by scanning repeatedly and make a lot of middle routes in the process of merging; the XML datasets are too uncertain to impose the efficiency of the query well by filtering. In our article, a new efficient index structure—FSM is proposed, which can avoid...

We propose a methodology for validating microarchitecture specifications. We view microarchitecture features as specific operations on entries of various buffers in the processor. Our validation approach is to determine the functionality of a buffer type, model its operations at the microarchitecture level using abstract finite state machine (FSM) models, and rigorously generate instruction seq...

tics. For example, the co-design finite state machines We implement a finite state machine (FSM) domain for specifying and simulating control functionality of a system within the Ptolemy software environment. The FSM domain is successfully integrated with synchronous dataflow (SDF) and discrete-event (DE) concurrency domains in Ptolemy. In this heterogeneous combination, the semantics of FSM, c...

We propose a methodology for validating microarchitecture speciications. We view microarchitecture features as speciic operations on entries of various buuers in the processor. Our validation approach is to determine the functionality of a buuer type, model its operations at the microarchitecture level using abstract nite state machine (FSM) models, and rigorously generate instruction sequences...

A dual mover yokeless multi-tooth (DMYMT) permanent magnet flux switching motor (PM-FSM) design is presented in this article for ropeless elevator applications. The excitation sources, including a field winding and magnet, are on the short proposed structure, whereas stator simple slotted iron core, thus reducing vertical transportation system cost. operational principle of DMYMT PM-FSM introdu...

Finite State Machine (FSM) models are widely used to specify the operations of computer systems. Since the basic FSM model is timeless, it is not possible to model within the basic FSM framework system properties that are dependent on the progression of real time, such as the duration of computations or the limited temporal validity of real-time data. To overcome these limitations, efforts have...

Strain CCMM B554, also known as FSM-MA, is a soil dwelling and nodule forming, nitrogen-fixing bacterium isolated from the nodules of the legume Medicago arborea L. in the Maamora Forest, Morocco. The strain forms effective nitrogen fixing nodules on species of the Medicago, Melilotus and Trigonella genera and is exceptional because it is a highly effective symbiotic partner of the two most wid...