Sentence examples for bound of the time from inspiring English sources

These conditions are expressed in the form of linear matrix inequalities, that depend on the maximum bound of the time delay and the desired decay rate of the system.

Unlike the studies in this area, we consider the "maximum duration" for the upper level of activities duration, whatever moving from normal time to compressed time caused more compressing cost, and whatever moving from normal time to presented upper bound of the time caused more saving of money.

Existing research results have addressed the time delay in networked systems from two aspects: one is to determine an admissible upper bound of the time delay for which a prescribed performance can be guaranteed; the other is to design filtering algorithm for a given time delay to meet certain performance requirements.

where Ξ ˆ i are the two vertices of Ξ ˆ [ h ( t ) ] with the bounds of h ( t ), that is, h M when i = 1 and h M when i = 2, and ϒ ˆ = A e 1 T + A d e 3 T − I n e 5 T + B e 9 T. Proof The new upper bound of the time derivative of (21) can be calculated as V ˙ ≤ ζ ˆ T ( t ) Ξ ˆ [ h ( t ) ] ζ ˆ ( t ), (23).

Finally, for each species, we averaged the rate of mutation of the loci presenting a significant difference between RST and FST to compute a rough lower bound of the time elapsed since the divergence of populations, and we used the average rate of mutation of the other loci to compute a rough upper bound of this time.

The robust controller, for his part, is then applied to adaptively estimate an unknown upper bound of the time-varying parametric uncertainties, external disturbances and approximation error of the neural network system.

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.

On one hand, a modified Lyapunov-Krasovskii functional is constructed which takes information of the lower bound of the time-varying delay into account.

In addition, when the lower bound of the time-varying delay is 0, a new delay-dependent (mathcal{H_{infty }}) state estimation condition is also obtained, which can provide a better performance than the existing results.

The results show that the calculated upper bound for the dwell time is close to the lower bound of the dwell time observed by simulations.

So, the function g gives an asymptotic upper bound of the running time f and, thus, an 'approximate' information of the running time of the algorithm.