Sentence examples for example of maximum from inspiring English sources

Figure 1 shows an example of maximum intensity projection images obtained 10, 60 and 120 min after tracer injection.

Learning in this case consists of estimating the mean and covariance matrix of each class (an example of maximum likelihood estimation).

Fig. 1 From left to right, example of maximum intensity projections 10, 60 and 120 min post tracer injection showing 68Ga-NODAGA-RGDyK uptake distribution in major abdominal organs.

Finally, the example of maximum relative flexibility for the third W-pattern is shown in Figure 6 d).

Fig. 5 Example of maximum-capability RINA with three co-existing systems and nine subcarriers.

The output from this analysis for the 589 samples typed in this study is available as Additional file 3.> -wrap-foot> Dexamplesexamples of maximum likelihood analysis from samples NA12751 (7 copies), C0157 (9 copies) and NA12749 (5 copies) – see also Table  1.

The relevance of these results is discussed for an example of Probable Maximum Precipitation-Probable Maximum Flood (PMP-PMF) estimation for the high mountainous Mattmark dam catchment in the Swiss Alps.

(MPEG 1 MB) Additional file 3: Figure S3: Examples of maximum-intensity projection images created using automated software gating, gating+ signal combination, and phase offset (30 frames/s) processes.

The maximum spanning tree is presented in Fig. 6 e. Fig. 6 Example of the maximum spanning tree construction: FSM describing mode changes (a), the correponding undirectional graph (b), first (c), second (d) and third (e) step of the Prim-Jarník's algorithm.

An example of a maximum intensity projection (MIP) from a SPECT study at the 0.5-h time point showing the location of the calibration flask relative to the subject can be seen in Fig. 3.

Considering a tree with its own topology (either rooted or unrooted, and previously determined by means, for example, of neighbor joining, maximum likelihood, maximum parsimony, or Bayesian phylogenetics), the search space contains all the possible tree representations obtainable by node rotation.