Sentence examples for maximal bound of from inspiring English sources

Using 800 or 900 Ma for the maximal bound of the crown bilaterian divergence further pushes back the estimated time of these two divergence points by another 60 100 Ma.

Using different methods and parameter settings, Peterson et al. (2008) obtained an estimate 643 733 Ma for the timing of the crown bilaterian divergence, which corresponded to a maximal bound of 671 870 Ma.

This constraint was based on the oldest salamander fossil known to exist, the salamandroid-like Iridotriton hechti (151 Ma) [ 54] and a proposed maximal bound for the origin of Caudata (170 Ma) [ 55].

Our estimate of the A. lucayanum– B. floridae divergence is insensitive to the choice of the maximal bound for the crown bilaterian divergence, suggesting that it is quite robust.

The latter are modified gradually over the subset of growth-associated reactions, starting from the minimal flux necessary for growth (as estimated over the subset of essential reactions, 'Materials and methods'), to the maximal bound in the model.

In case of non-zero poles on the imaginary axis, maximal admissible upper bound of the time-varying delay is given in terms of both the agent dynamic and network topology; otherwise, consensus can be achieved for the time-varying delay with arbitrarily large upper bound.

(iii) The lower bound of energy efficiency and its corresponding maximal delay are derived.

If the bound of the CI that reflects the maximal estimate for inferiority is less than the margin (does not 'cover' the margin), then it is concluded that the new treatment is non-inferior to EET.

Zuo et al. gave a non-ellipsoidal bound of a reachable set for linear time-delayed systems by the means of the maximal Lyapunov functionals and the Razumikhin method [24].

To meet the loss requirement and to ensure the delay bound of VoIP packets, we consider two scheduling algorithms that are channel-aware and flexible in the frame structure; maximal rate (MAX) algorithm and proportionally fair (PF) algorithm.

Up to now, the least upper bound of the number of limit cycles has been given for six cases of (1.5) except for case 4. By the result of [19], the maximal lower bound of the number of limit cycles for this case is five, therefore the least upper bound is more than or equal to five.