نتایج جستجو برای: maximum admissible upper bound
تعداد نتایج: 643747 فیلتر نتایج به سال:
In this paper, we propose a deterministic approach to the robust filtering problem for a class of uncertain nonlinear systems. Based on polynomial Lyapunov functions and a relaxation technique, we derive linear matrix inequalities conditions that minimize an upper-bound on the finite horizon 2-norm of the estimation error for all admissible uncertainty and input signals (including disturbances ...
Abstract: The problem of state observation, based on sampled output measurements, is addressed for a class of nonlinear state-affine systems. The difficulty lies in the fact that the state equation involve the undisturbed output with unknown parameters. A hybrid adaptive observer is designed and formally analysed. Sufficient conditions are established for the observer to be exponentially conver...
The problem of H∞ output feedback for uncertain linear discrete-time systems with state-delay and parameter uncertainties is considered. The objective is to design a linear output feedback controller such that, for the unknown state time-delay and all admissible norm-bounded parameter uncertainties, the feedback system remains robustly stable and the transfer function from the exogenous disturb...
A new model of the regular black hole in ( 2 + 1 ) − $(2+1)-$ dimensions is introduced by considering an appropriate matter field as energy-momentum tensor. First, we propose a novel d-dimensional energy density that leads to existence upper bound on radius event horizon and lower mass which are motivated features astrophysical holes. According these bounds, introduce admissible domain for radi...
We derive upper and lower bounds for the efficiency of an isothermal molecular machine operating at maximum power. The upper bound is reached when the activated state is close to the fueling or reactant state (Eyring-like), while the lower bound is reached when the activated state is close to the product state (Kramers-like).
Let G = (V + s, E) be a 2-edge-connected graph with a designated vertex s. A pair of edges rs, st is called admissible if splitting off these edges (replacing rs and st by rt) preserves the local edge-connectivity (the maximum number of pairwise edge disjoint paths) between each pair of vertices in V. The operation splitting off is very useful in graph theory, it is especially powerful in the s...
calculation of lateral earth pressure on retaining walls is one of the main issues in geotechnics. the upper and lower bound theorems of plasticity are used to analyze the stability of geotechnical structures include bearing capacity of foundations, lateral earth pressure on retaining walls and factor of safety of slopes. in this paper formulation of finite element limit analysis is introduced ...
This paper studies the problem of rank aggregation under the Plackett-Luce model. The goal is to infer a global ranking and related scores of the items, based on partial rankings provided by multiple users over multiple subsets of items. A question of particular interest is how to optimally assign items to users for ranking and how many item assignments are needed to achieve a target estimation...
Tunnels are commonly constructed in water-bearing zones, which necessitates stability analyses of saturated tunnels based on the upper bound plastic theory. Previous kinematical approaches have following drawbacks: (1) using an empirical approach to estimate pore-water pressure distributions; (2) failure mechanisms that not rigorously kinematically admissible. To overcome these shortcomings, we...
BACKGROUND Many randomized trials involve missing binary outcomes. Although many previous adjustments for missing binary outcomes have been proposed, none of these makes explicit use of randomization to bound the bias when the data are not missing at random. METHODS We propose a novel approach that uses the randomization distribution to compute the anticipated maximum bias when missing at ran...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید