Sentence examples for entry of vector from inspiring English sources

where x ZP, i ″ is the i th entry of vector X ZP ″.

where k=(n−1 N+1 denotes the kth entry of vector.

is the th entry of vector, and is the th entry of matrix.

This iterative procedure is repeated until every entry of vector I is equal to 0, which means every node has no more information to pass on.

where (x_{i} k-l), {tilde w}_{i}(k+1) in mathbb {R}) denote the ith entry of vectors (mathbf {x_{i} k-ltilde {tildef {w}}(k+1) in mathbb {R}^{N+1}), respectively.

where A ir (resp. B jr and C kr ) denote the entries of vector a r (resp. b r and c r ).

Suppose we wish to enlarge X LR to a kN sized vector X HR using the following steps: We put k−1 zeros between any two successive entries of vector X LR.

0N×M denotes the matrix of size N×M with all zero entries, I N the identity matrix of size N, tr(X) the trace of matrix X, det(X) the determinant of matrix X, vec(X) the vectorization of X, ∥X∥ the Frobenius norm of X, [X]n,m the entry on row n and column m of X, [X]·,m the m th column of X, and diag(x) the diagonal matrix with the entries of vector x on the diagonal.

with x k =[x 1,k,…,x P,k ] T, w k =[w 1,k,…,w P,k ] T, C k =D [c 1,k,…,c P,k ]), where D u) is the diagonal matrix with the entries of vector u on its diagonal and F is the P×L matrix with the (p,l th entry defined as (exp left (-jfrac {2pi,n_{p} l-1)} l-1ight), p=1, ldots, P, l=1, hdots, L).

Using the descriptors described above, we can now represent an LC-MS map as a vector where each entry of this vector represents one of the quality descriptor described above.

Each OMIM record is then represented by binary vectors where each entry of the vector corresponds to the existence of a term in that record.