期刊文献+
共找到3篇文章
< 1 >
每页显示 20 50 100
Robust stabilitv of neutral stochastic interval svstems 被引量:2
1
作者 YuminZHANG YiSHEN XiaoXinLIAO 《控制理论与应用(英文版)》 EI 2004年第1期82-84,共3页
Although interval systems have received a great deal of attention, so far there is few work on neutral stochastic interval systems (NSIS) . The purpose of this paper is to initiate the study of NSIS. Using R^umikhin-t... Although interval systems have received a great deal of attention, so far there is few work on neutral stochastic interval systems (NSIS) . The purpose of this paper is to initiate the study of NSIS. Using R^umikhin-type technique, a sufficient condition of exponential stability on NSIS is given. It is interesting that the NSIS changes into general stochastic interval system when the neutral item disappeared. So the results in this paper generalize some conclusions existed. 展开更多
关键词 Stochastic interval systems Exponential stability Razumikhin-type theorem
下载PDF
Exponential stability for networked control systems based on the model of nonlinear discrete-time system with time-varying delay 被引量:1
2
作者 HUANGJian GUANZhihong WANGZhongdong 《Journal of Chongqing University》 CAS 2004年第1期30-33,共4页
An uncertain nonlinear discrete-time system model with time-varying input delays for networked control systems (NCSs) is presented. The problem of exponential stability for the system is considered and some new criter... An uncertain nonlinear discrete-time system model with time-varying input delays for networked control systems (NCSs) is presented. The problem of exponential stability for the system is considered and some new criteria of exponential stability are obtained based on norm inequality methods. A numerical example is given todemonstrate that those criteria are useful to analyzing the stability of nonlinear NCSs. 展开更多
关键词 networked control systems nonlinear discrete-time system time-varying delay exponential stability
下载PDF
The Incidence Coloring Number of Complete k-Partite Graph 被引量:1
3
作者 刘西奎 李艳 《Journal of China University of Mining and Technology》 2001年第1期87-89,共3页
The concept of the incidence chromatic number of a graph was introduced by Brualdi and Massey. They conjectured that every graph G can be incidence colored with Δ (G) +2 colors. In this paper, the trueness of this co... The concept of the incidence chromatic number of a graph was introduced by Brualdi and Massey. They conjectured that every graph G can be incidence colored with Δ (G) +2 colors. In this paper, the trueness of this conjecture for complete k partite graph was proved, and the incidence chromatic number of complete k partite graphs was calculated. 展开更多
关键词 incidence set incidence coloring incidence chromatic number
下载PDF
上一页 1 下一页 到第
使用帮助 返回顶部