Sentence examples for computation sequence from inspiring English sources

See Figure 14. Figure 14 The pipeline message computation sequence with forward (F), backward (B), and normalization (N) operations.

In IDCT computation sequence data is ordered in V k order then multiplied by coefficients in the next stage.

Open image in new window Fig. 1 Schematic representation of the computation sequence for particle in cell-Monte Carlo (PIC-MCC) method.

Note that although this tree contains an accepting computation sequence of length 4, its maximum depth of 5 still counts towards the determination of \ time_N(n) = \max \{\text{depth}(\mathcal{T}^N_{C_0 x)})\ :\ \lvert x\rvert = n\)}.

In this case, a finite or infinite sequence \(C_0,C_1,C_2, \ldots\) is said to be a computation sequence for \(N\) from the initial configuration \(C_0\) just in case for all \(i \geq 0\), \(C_{i+1}\) is among the configurations which are related by \ \Delta\) to \(C_i\) (and is similarly undefined if no such configuration exists).

Recall that for a deterministic machine \(T\), a computation sequence starting from an initial configuration \(C_0\) is a finite or infinite sequence of machine configurations \(C_0,C_1,C_2, \ldots\) Such a configuration consists of a specification of the contents of \(T\)'s tape, internal state, and head position.

We focus on properties relying on the number of occurrences of processes during computation sequences, such as mutual exclusion and non-exhaustion of resources.

For if \(x \in X\), some of \(N\)'s computation sequences starting from \(C_0 x)\) may still lead to rejecting states as long as it least one leads to an accepting state.

But what the foregoing definitions actually describe is a tree \(\mathcal{T}^N_{C_0}\) of all possible computation sequences starting from a given configuration \(C_0\) for a deterministic machine \(N\) (an example is depicted in Figure 1).

We used information in proteins from the non-reference species only for computation of sequence divergence (via ortholog multiple sequence alignments).

Motivation: In the analysis of homologous sequences, computation of multiple sequence alignments (MSAs) has become a bottleneck.