Sentence examples for sequences associated to from inspiring English sources

For any iterative process, { x n } n = 0 ∞ and { u n } n = 0 ∞ denote iterative sequences associated to T and T ˜, respectively.

This variability in the cross-correlation behavior of the sequences may affect the performance of the CDMA system, when the spreading sequences associated to each user are chosen randomly from the whole set; it will be discussed in the following, with reference to the case of span n = 5 sequences.

Definition 2.6 Under the assumptions of Lemma 2.1, any sequence { x n } ⊂ A 0 satisfying (2.1) is called a proximal Picard sequence associated to a ∈ A 0. For every a ∈ A 0, we denote by P P ( a ) the set of all proximal Picard sequences associated to a.

FISH for chromosome mapping of sequences associated to the retrotransposon Nikita and/or to the microsatellite (CT 9G showed these to be widely distributed throughout all rye chromosomes, with preferential localization in major heterochromatic domains, suggesting that chromatin condensation plays an important role in polyploid evolution.

Among the ESTs exclusively isolated from sporulating cells, we collected sequences associated to membrane transport, such as syntaxin 71.

Therefore, we supposed that this motif was a newly identified signature sequences associated to the plant PTR family.

which occur in the long exact homology sequence associated to the short exact sequence of cochain complexes by Lemma 12.12.12.

Let ({t_{n}} subset[0,1]) be the sequence associated to the Mann iteration process defined by (3.1).

Let { x n } ∈ P P ( x 0 ) be a proximal Picard sequence associated to x 0 ∈ A 0. So, we have d ( x n + 1, T x n ) = d ( A, B ), ∀ n ∈ N. (4.1).

In particular, during the proof, we needed the Sturm sequence associated to a univariate polynomial, say p, in order to find the number of roots in intervals ( c, d ]. This can be obtained in Maple by sturm ( sturmseq ( p, c, d ) ). or in Maxima by nroot ( p, c, d ), both making use of exact (rational) arithmetic.

If a path is found to the next unique node, then the sequence associated to the path and the sequence of the destination node are appended to the starting node.