There are various kinds of practical implementation issues for the HMM. The use of scaling factor is the main issue in HMM implementation. The scaling factor is used for obtaining smoothened probabilities. The proposed technique called Modified Forward-Backward Re-estimation algorithm used to recognize speech patterns. The proposed algorithm has shown very good recognition accuracy as compared ...

An extended feed-forward algorithm for recurrent connectionist networks is presented. This algorithm, which works locally in time, is derived both for discrete-in-time networks and for continuous networks. Several standard gradient descent algorithms for connectionist networks (e.g. [48], [30], [28] [15], [34]), especially the backpropagation algorithm [36], are mathematically derived as a spec...

To date, a number of numerical methods, including the popular Finite-Difference Time Domain (FDTD) technique, have been proposed to simulate Ground-Penetrating Radar (GPR) responses. Despite having a number of advantages, the finite-difference method also has pitfalls such as being very time consuming in simulating the most common case of media with high dielectric permittivity, causing the for...

This note considers optimal control problems for a class of hybrid systems motivated by the structure of manufacturing environments that integrate process and operations control. We derive a new property of the optimal state trajectory structure which holds under a modified condition on the cost function. This allows us to develop a low-complexity, scalable algorithm for explicitly determining ...

This article introduces a novel Monte Carlo type algorithm, which we call the Metropolized Forward Chaining (MFC) algorithm, to find a stable model of a general propositional logic program P if P has a stable model or to find a maximal subprogram P ′ of P and stable model M ′ of P ′ if P does not have a stable model. Our algorithm combines the forward chaining algorithm of Marek, Nerode, and Re...

The paper extends the notion of oscillations in the sense of Yakubovich to hybrid dynamics. Several sufficient stability and instability conditions for a forward invariant set are presented. The consideration is motivated by analysis of a model of two-link compass-gait biped robot.

Wireless Sensor Networks has been an active research area over past few years. The diversity in the applications used in wireless sensor networks represents its great success. There are different characteristics of the topologies used in routing method. Energy and communication ability is important during designing of a routing protocol for wireless sensor networks so that sensing data can be t...

In the guessing secrets problem defined by Chung, Graham and Leighton [9], player B has to unveil a set of k > 1 secrets that player A has chosen from a pool of N secrets. To discover the secrets, player B is allowed to ask a series of boolean questions. For each question asked, A can adversarially choose one of the secrets but once he has made his choice he must answer truthfully. In this pape...

Near-optimal gossiping algorithms are given for two-dimensional and higher dimensional tori, assuming the full-port store-and-forward communication model. For two-dimensional tori, a previous algorithm achieved optimality in an intricate way, with an adaptive routing pattern. In contrast, the processing units in our algorithm forward the received packets always in the same way. We thus achieve ...