Various constraints have been used to recover 3D structures from 2D images. They are classi ed into two categories: explicit constraints and implicit ones. In stereo matching algorithms, smoothness constraint is an example of explicit constraints, because it explicitly speci es which binocular pairs are compatible and it forces, for example, to nd a planar surface from a pair of random-dot ster...

A measurement of the polarization of W bosons in semi-leptonically decaying W pairs produced at 189 GeV is presented. Rates of longitudinally and transversely polarized W bosons and correlation between two W bosons are studied. The spin properties of the leptonically decaying W boson in the W pairs was used to measure the CP-violating trilinear gauge boson couplings. These results are compared ...

the wiener index w(g) of a connected graph g is defined as the sum of the distances betweenall unordered pairs of vertices of g. the eccentricity of a vertex v in g is the distance to avertex farthest from v. in this paper we obtain the wiener index of a graph in terms ofeccentricities. further we extend these results to the self-centered graphs.

the computer simulation program of a practical scale reverse electrodialysis process has been developed based on the program for saline water electrodialysis. the program is applied to compute the performance of an industrial-scale reverse electrodialysis stack (effective membrane area s = 1 m × 1 m = 1 m2, cell pair number n = 300 pairs). the stack operatingconditions are optimized. seawater a...

A pair of non-empty subsets (W,W?) in an abelian group G is additive complement if W+W?=G. The set W? said to be minimal W W+(W??{w?})?G,?w??W?. In general, given arbitrary subset a group, the existence complement(s) depends on its structure. dual problem asks that such set, it some subset. Additive complements have been studied context representations integers since time Erd?s, Hanani, Lorentz...

The Wiener index W(G) of a connected graph G is defined as the sum of the distances between all unordered pairs of vertices of G. The eccentricity of a vertex v in G is the distance to a vertex farthest from v. In this paper we obtain the Wiener index of a graph in terms of eccentricities. Further we extend these results to the self-centered graphs.

In this paper, several experiments on F0 transformation within the voice conversion framework are presented. The conversion system is based on a probabilistic transformation of line spectral frequencies and residual prediction. Three probabilistic methods of instantaneous F0 transformation are described and compared. Moreover, a new modification of inter-speaker residual prediction is proposed ...

The sites that arouse skepticism in the parsimony method are the ones with the greatest number of changes. Compatibility is a technique related to parsimony, and is well suited to trees for which parsimony would produce frequent changes between states. Unfortunately, however, compatibility also treats small noise artifacts as significant. Definition 18.1: A site is compatible with a tree if and...