Sentence examples for the pair of elements from inspiring English sources

This algorithm finds the pair of elements that result in smaller node coverage requiring O(n3) distance calculations on the number of elements in a node.

For every a 1, a 2 ∈ A, by the definition of upward directed sets, the pair of elements F ˜ ( a 1 ) and F ˜ ( a 2 ) has an upper bound in C S. Hence there exists a 3 ∈ A such that F ˜ ( a 1 ) ⊆ F ˜ ( a 3 ) and F ˜ ( a 2 ) ⊆ F ˜ ( a 3 ).

The correlation coefficient matrix is normally used to measure the degree of correlation between logarithms of the elemental concentrations [ 70], and this matrix for the heavy metals of paddy showed highly significant positive correlations between the pairs of elements of soil samples Cd-Pb (0.65), Cr-Pb (0.95), Zn-Pb (0.96), Cd-Cr (0.83), Cd-Zn (0.69), and Cr-Zn (0.98) (Table 5(a)).

Before presenting the premises (in the reasoning condition) or the pairs of elements (in the memory condition) to be remembered, a short instruction appeared, and also before the answering part of the experiment a short instruction was presented, each instruction lasted 5 s.

It is natural question to ask whether the mapping T, considered above, has a fixed point if the contraction condition holds for those pair of elements that form edges of the graph as defined by Jachymski [8].

According to the range method: fleft( {b_{i},b_{j} } right) = a_{ij} = a_{b}^{{frac{{b_{i} - b_{j} }}{B}}}, (5 where (varvec{A} = left( {a_{ij} } right)) constitutes the consistency judgment matrix; a b is the given relative importance of the pair of range elements, based on a certain standard, and always generally assigned a constant value of a b  = 9 [35].

Using Euclidian distance, the closest pair node of the next-gene representation element in the kth level is found and inserted into the corresponding node if the weight of the node is less than 4. Otherwise, it will find the closest pair of elements in the subsequent levels and insert the node here.

Being zero, the next pair of elements reveals that the intermediate node 2 is not used in the route.

This policy was proposed due to the hypothesis that it is possible to get smaller overlap by distributing the set of elements ∈S with regard to the pair of most dissimilar elements in this set.

Motivated by the work of Jachymski, in this paper we extend and improve the result of Ma et al. by proving a fixed point theorem for self-mappings on (C^ -valued metriC^ -valuedatisfying the contractive condition for those pairs of elemetricfrom the metric spaceswhich form edgesatisfyingph in the metricontractive

These results evidenced that a putative chromosomal inversion of a very large region (+/- 687 kb) occurred in CH34 by recombination between the pair of IS Rme3 elements.