The paper presents a new and different approach to the design and realisation of Digital Signal Processing @SP) systems by utilising Finite State Machines (FSM). The DSP system is modelled by mapping all its potential states into an FSM, whose complexity is usually very high. The FSM mirrors the complete functionality of the system and thus describes its behaviour in full detail. Examples for F...

The equation solving problem is to derive the behavior of the unknown component X knowing the joint behavior of the other components (or the context) C and the specification of the overall system S. The component X can be derived by solving the Finite State Machine (FSM) equation C ◊ X ∼ S, where ◊ is the parallel composition operator and ∼ is the trace equivalence or the trace reduction relati...

The paper addresses the problem of designing a component that combined with a known part of a system, called the context FSM, is a reduction of a given specification FSM. We study compositionally progressive solutions of synchronous FSM equations. Such solutions, when combined with the context, do not block any input that may occur in the specification, so they are of practical use. We show tha...

Finite-State Machine (FSM) applications are important for many domains. But FSM computation is inherently sequential, making such applications notoriously difficult to parallelize. Most prior methods address the problem through speculations on simple heuristics, offering limited applicability and inconsistent speedups. This paper provides some principled understanding of FSM parallelization, an...

one of the serious problems of iran’s watersheds is soil erosion and can be considered as one of the main obstacles to achieve sustainable agricultural development and natural resources. in most countries of the world, because of absence of accurate data for the sediment erosion, deposition utilizing models to estimate erosion is inevitable. in order to apply effective management in natural res...

In this protocol we describe the use of Fluorescent Speckle Microscopy (FSM) to capture high-resolution images of actin dynamics in PtK1 cells. A unique advantage of FSM is its ability to capture the movement and turnover kinetics (assembly/disassembly) of the F-actin network within living cells. This technique is particularly useful in deriving quantitative measurements of F-actin dynamics whe...

The crystal growth kinetics and interfacial properties of titanium (Ti) are studied using molecular dynamics computer simulation. interactions between the Ti atoms modeled via an embedded atom method potential. First, free solidification (FSM) is used to determine melting temperature Tm at zero pressure where transition from liquid body-centered cubic occurs. From simulations with FSM, kinetic ...

In this paper we introduce a new class of adap-tive nonlinear predictors by allowing the parameters of the L-predictor to be selected according to the transitions in a Finite State Machine context modeller. A procedure for the adaptive design of the general un-constrained FSM-context L-predictor is proposed and compared with the classical design techniques for some particular FSM-L predictors. ...

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...

In this work, we study the convergence of an efficient iterative method, the fast sweeping method (FSM), for numerically solving static convex Hamilton–Jacobi equations. First, we show the convergence of the FSM on arbitrary meshes. Then we illustrate that the combination of a contraction property of monotone upwind schemes with proper orderings can provide fast convergence for iterative method...