理学 >>> 信息科学与系统科学 >>> 信息科学与系统科学基础学科 系统学 控制理论 系统评估与可行性分析 系统工程方法论 系统工程 信息科学秘系统科学其他学科
搜索结果: 1-8 共查到信息科学与系统科学 L-functions相关记录8条 . 查询时间(0.134 秒)
It is shown that many system stability and robustness problems can be reduced to the question of when there is a quadratic Lyapunov function of a certain structure which establishes stability of dx/dt...
An automated procedure for optimization of proportional–integral–derivative (PID)-type controller parameters for single-input, single-output (SISO) plants with explicit model uncertainty is presente...
The search for a polynomial Lyapunov function proving delay-independent stability of multivariate nonlinear polynomial delay differential equations is approached using semidefinite programming. The fu...
Covering Numbers for Convex Functions     Covering Numbers  Convex Functions  Information Theory       font style='font-size:12px;'> 2012/4/17
In this paper we study the covering numbers of the space of convex and uniformly bounded functions in multi-dimension. We find optimal upper and lower bounds for the $\epsilon$-covering number of $\C(...
CREDIBLE SETS FOR SYSTEM PARAMETERS AND TRANSFER FUNCTIONS           font style='font-size:12px;'> 2007/8/7
The credible sets for system parameters and transfer functions are discussedin this paper. The derivations of the credible sets via the Bayesian statistical methods aregiven in various cases and the c...
In this paper, we give some equivalent conditions for generalized subconvexlike functions. A Farkas-Minkowski theorem for generalized subconvexlike functions is then proved. These results are used to ...
In [1] we proved a general result on the directional derivative of optimal value functions in mathematical programming problems. In this paper, we prove, in addition to the general theorem, several ot...
AN IMPROVEMENT ON ESTIMATE OF d_0/d~* FOR STARLIKE FUNCTIONS      Starlike function  radius of convexity          font style='font-size:12px;'> 2007/8/7
Let S~* be the class of starlike functions in unit disc. For f∈S~*, denote its radius of convexity by r_0 and let d_0=\[min_}{\|z\|=r_0}\]|f(z)|, d~*=inf{|β||f(z)≠β,|z|<1}. In this paper we prove d_0/...

中国研究生教育排行榜-

正在加载...

中国学术期刊排行榜-

正在加载...

世界大学科研机构排行榜-

正在加载...

中国大学排行榜-

正在加载...

人 物-

正在加载...

课 件-

正在加载...

视听资料-

正在加载...

研招资料 -

正在加载...

知识要闻-

正在加载...

国际动态-

正在加载...

会议中心-

正在加载...

学术指南-

正在加载...

学术站点-

正在加载...