Models and analysis of vocal emissions for biomedical applications.

We describe a new algorithm for finding the hypothesis in a recognition lattice that is expected to minimize the word error rate (WER). Our approach thus overcomes the mismatch between the word-based performance metric and the standard MAP scoring paradigm that is sentence-based, and that can lead to sub-optimal recognition results. To this end we first find a complete alignment of all words in...

In this paper, a model of self-organizing spiking neural networks is introduced and applied to mobile robot environment representation and path planning problem. A network of spike-response-model neurons with a recurrent architecture is used to create robot’s internal representation from surrounding environment. The overall activity of network simulates a self-organizing system with unsupervise...

We consider the task of summarizing a cluster of related sentences with a short sentence which we call multi-sentence compression and present a simple approach based on shortest paths in word graphs. The advantage and the novelty of the proposed method is that it is syntaxlean and requires little more than a tokenizer and a tagger. Despite its simplicity, it is capable of generating grammatical...

The patient with word-finding difficulty presents a common and challenging clinical problem. The complaint of 'word-finding difficulty' covers a wide range of clinical phenomena and may signify any of a number of distinct pathophysiological processes. Although it occurs in a variety of clinical contexts, word-finding difficulty generally presents a diagnostic conundrum when it occurs as a leadi...

Integration of system process information obtained through an image processing system with an evolving knowledge database to improve the accuracy and predictability of wear particle analysis is the main focus of the paper. The objective is to automate intelligently the analysis process of wear particle using classification via self organizing maps. This is achieved using relationship measuremen...

This article describes the four systems sent by the author to the SENSEVAL-3 contest, the English lexical sample task. The best recognition rate obtained by one of these systems was 72.9% (fine grain score) .

It was conjectured by Černý in 1964 that a synchronizing DFA on n states always has a shortest synchronizing word of length at most (n− 1), and he gave a sequence of DFAs for which this bound is reached. In 2006 Trahtman conjectured that apart from Černý’s sequence only 8 DFAs exist attaining the bound. He gave an investigation of all DFAs up to certain size for which the bound is reached, and ...

A repetition in a word is a subword with the period of at most half of the subword length. We study maximal repetitions occurring in , that is those for which any extended subword of has a bigger period. The set of such repetitions represents in a compact way all repetitions in . We first prove a combinatorial result asserting that the sum of exponents of all maximal repetitions of a word of le...

The current methods of predictive controllers are utilized for those processes in which the rate of output variations is not high. For such processes, therefore, stability can be achieved by implementing the constrained predictive controller or applying infinite prediction horizon. When the rate of the output growth is high (e.g. for unstable nonminimum phase process) the stabilization seems to...