Sentence examples for bounding parameters from inspiring English sources

The bounding parameters of the model approximation error and the external disturbance are all regarded as unknown constants in this paper, and adaptive laws for them are devised for tracking purpose.

The GDM attempts to make inference from observed retention patterns about the mechanisms of duplicate retention by bounding parameters to ranges which are indicative of specific retention patterns.

Sufficient conditions, which include a delay-dependent matrix inequality and a delay-dependent stability criterion involving some bounding parameters for the uncertainty in the system, are presented and a class of robust feedback controls are designed to guarantee a prescribed stability property for the class of implicit systems.

As it is analyzed later in this paper (Appendix A), the existence of these bounding parameters restricts a user's ability to self-optimize their QoS performance over a time-varying wireless environment, due to the potentially bad channel conditions or lack of available system radio resources.

A bounding parameter adaptive law is used to obtain this bounding control.

In order to overcome the controller singularity problem and relax the requirement of bounding parameter values, a second modified fuzzy adaptive output feedback controller is proposed by using a regularized inverse and a robustifying control term.

The use of multiple imputation, the role of heteroscedasticity and the possibility of bounding parameter estimates in the presence of non-classical differential measurement error all provide interesting avenues for further research.

For bounded parameters we have the following result.

Indeed, the designed observer can be used for different class of systems, mainly linear systems, LPV systems with known and bounded parameters, and nonlinear Lipschitz systems.

This Letter considers the robust adaptive tracking control problem of a class of uncertain chaotic systems with time-varying unknown but bounded parameters.

For this class of highly regular graphs, we obtain a worst-case running time of O vlogv+O(1)) for bounded parameters t, k, λ.