This paper is a part of a project concerning the finding of objective characteristics of susceptibility to voice strain. In that project, measurements were made of simultaneous recordings of microphone speech, oral flow, oral pressure and EGG. A comparison is made of parameters extracted from the inverse filtered waveforms of oral flow and speech pressure from these recordings, that is, with an...

In a sequence of recent results (PODC 2015 and PODC 2016), the running time of the fastest algorithm for the minimum spanning tree (MST) problem in the Congested Clique model was first improved to O(log log logn) from O(log logn) (Hegeman et al., PODC 2015) and then to O(log∗ n) (Ghaffari and Parter, PODC 2016). All of these algorithms use Θ(n2) messages independent of the number of edges in th...

We continue our earlier investigation of properties of linear codes generated by the rows of incidence matrices of k-regular connected graphs on n vertices. The notion of edge connectivity is used to show that, for a wide range of such graphs, the p-ary code, for all primes p, from an n × 12nk incidence matrix has dimension n or n− 1, minimum weight k, the minimum words are the scalar multiples...

In this paper a technique for increasing the convergence rate of fractionally spaced channel equalizer is proposed. Instead of symbol-spaced updating of the equalizer filter, a mechanism has been devised to update the filter at a higher rate. This ensures convergence of the equalizer filter at a higher rate and therefore less time-consuming. The proposed technique has been simulated and tested ...

This paper presents a new approach for human identification at a distance using gait recognition. Binarized silhouette of a motion object is represented by 1-D signals which are the basic image features called the distance vectors. The distance vectors are differences between the bounding box and silhouette, and extracted using four view directions to silhouette. Based on normalized correlation...

1. G0 = G; h = 0; 2. while Gh has more than 2 vertices do randomly pick an edge eh in Gh; Gh+1 = Gh/eh; h = h+ 1; 3. return all edges in Gn−2. As we have shown in section 1, the probability Pr[Eh | h−1 i=1 Ei] that, under the condition that the first (h − 1)-st iterations of the algorithm do not pick an edge in the min-cut C of G, the probability that the h-th iteration does not pick an edge in...

http://dx.doi.org/10.1016/j.displa.2014.11.003 0141-9382/ 2014 Elsevier B.V. All rights reserved. ⇑ Corresponding author at: Institut des Sciences du Mouvement, UMR CNRS 7287, Aix-Marseille Université, 163 avenue de Luminy, 13009 Marseille, France. Tel.: +33 491 17 04 55. E-mail address: [email protected] (R.J. Bootsma). Olivier Borg , Remy Casanova , Camille Coton , Charlie Barla , R...

That is the way Miriam Butt begins her book. Apparently, she felt that the quote fits her introduction to case theory within grammatical traditions (Latin grammar is one) and their relationship to various notions of case within modern theoretical linguistics. In her introduction to the book, Butt states “...several issues must be dealt with. One is the issue of what “case” really means and what...