It is widely observed that seismic sources occurring very close to each other can share very similar waveforms. Using this property, an adaptive, automatic phase-picking and epicenter-locating program based on waveform cross-correlation has been developed and applied to process daily seismic data of New Mexico. The core of this program is a reference seismic event database, from which the phase...

This article analyses Locating Adverbials (LAs) such as un peu plus tard, ce matin, deux kilomètres plus loin (‘a little later’, ‘this morning’, ‘two kilometers further’) when they are dislocated to the left of the sentence (IP Adjuncts cases). Although not discourse connectives, in such a position, they seem to play an important part in structuring discourse. It is this contribution of LAs to ...

This paper describes a robust method for extracting visual speech information from the shape of lips to be used for an automatic speechreading (lipreading) systems. Lip deformation is modelled by a statistically based deformable contour model which learns typical lip deformation from a training set. The main difficulty in locating and tracking lips consists of finding dominant image features fo...

The purpose of this work was to find a method for locating redundant information between chapters of the same manual, by using the translation memory Transit provided by STAR group. A filter for comparing the similarity of sentences, Fuzzy filter, was set to assemble sentences with >50% recemblance and the results were saved. Concordance search—based on the result from the previous step and the...

Locating and Total Dominating Sets in Trees by Jamie Marie Howard A set S of vertices in a graph G = (V,E) is a total dominating set of G if every vertex of V is adjacent to some vertex in S. In this thesis, we consider total dominating sets of minimum cardinality which have the additional property that distinct vertices of V are totally dominated by distinct subsets of the total dominating set.

Locating the rainbow connection number of graphs is a new mathematical concept that combines concepts vertex coloring and partition dimension. In this research, we determine lower upper bounds locating graph provide characterization with equal to its restrict graph. We also found trees regular bipartite graphs. The method used in study deductive begins literature related relevant previous resea...

Let G be a connected graph. Let f be a proper k -coloring of G and Π = (R_1, R_2, . . . , R_k) bean ordered partition of V (G) into color classes. For any vertex v of G, define the color code c_Π(v) of v with respect to Π to be a k -tuple (d(v, R_1), d(v, R_2), . . . , d(v, R_k)), where d(v, R_i) is the min{d(v, x)|x ∈ R_i}. If distinct vertices have distinct color codes, then we call f a locat...