In this paper we propose a simple fast-search VQ of the LSF’s to be used on top of the split VQ, that is, in each of the sub-vector domains. The main trait of the proposed method is that no suboptimal codebooks are used and there is no further reduction in performance. In each sub-vector domain, a full-size optimally trained codebook, typically of size 1024, is searched using a fastsearch algor...

This article applies tools and concepts of Frame Analysis Conversation to a database audio-recorded transcribed paediatric surgical visits, collected for the purpose study, conduct linguistic analysis their communicative challenges. The used is composed almost one hundred divided into first visits check-up visits. It was decided focus on due complex patterns interactions. turn taking, adjacency...

This paper considers the NP-hard problem of reconstructing binary matrices satisfying exactly-1-4-adjacency constraint from its row and column projections. This problem is formulated into a maximization problem. The objective function gives a measure of adjacency constraint for the binary matrices. The maximization problem is solved by the simulated annealing algorithm and experimental results ...

Detailed information about the weight distribution of a convolutional code is given by the adjacency matrix of the state diagram associated with a controller canonical form of the code. We will show that this matrix is an invariant of the code. Moreover, it will be proven that codes with the same adjacency matrix have the same dimension and the same Forney indices and finally that for one-dimen...

The traditional adjacency matrix of a mixed graph is not symmetric in general, hence its eigenvalues may be real. To overcome this obstacle, several authors have recently defined and studied various Hermitian matrices digraphs or graphs. In work we unify previous offer new perspective on the subject by introducing concept monographs. Moreover, consider questions cospectrality.