Stability and stabilization of Boolean networks

The stability of Boolean networks and the stabilization of Boolean control networks are investigated. Using semi‐tensor product of matrices and the matrix expression of logic, the dynamics of a Boolean (control) network can be converted to a discrete time linear (bilinear) dynamics, called the algebraic form of the Boolean (control) network. Then the stability can be revealed by analyzing the transition matrix of the corresponding discrete time system. Main results consist of two parts: (i) Using logic coordinate transformation, the known sufficient condition based on incidence matrix has been improved. It can also be used in stabilizer design. (ii) Based on algebraic form, necessary and sufficient conditions for stability and stabilization, respectively, are obtained. Copyright © 2010 John Wiley & Sons, Ltd.     

Absolute Stability of Nonlinear Systems with Two Additive Time-varying Delay Components

In this paper, we present a new sufficient condition for absolute stability of Lure system with two additive time-varying delay components. This criterion is expressed as a set of linear matrix inequalities (LMIs), which can be readily tested by using standard numerical software. We use this new criterion to stabilize a class of nonlinear time-delay systems. Some numerical examples are given to illustrate the applicability of the results using standard numerical software.     

Absolute stability of nonlinear systems with two additive time-varying delay components

In this paper, we present a new sufficient condition for absolute stability of Lure system with two additive time-varying delay components. This criterion is expressed as a set of linear matrix inequalities (LMIs), which can be readily tested by using standard numerical software. We use this new criterion to stabilize a class of nonlinear time-delay systems. Some numerical examples are given to illustrate the applicability of the results using standard numerical software.     

Stability analysis and output‐feedback stabilization of discrete‐time systems with a time‐varying state delay and nonlinear perturbation

This paper aims to derive stability conditions and an output‐feedback stabilization method for discrete‐time systems with a time‐varying state delay and nonlinear perturbation. With a new way of handling the Lyapunov stability criterion, linear matrix inequality conditions are obtained for estimating bounds on delay to ensure the asymptotic stability. Based on the conditions, a synthesis procedure is developed for finding stabilizing output‐feedback gains, which are formulated as direct design variables. Three numerical examples are employed to demonstrate the effectiveness and advantages of the proposed method. Copyright © 2010 John Wiley and Sons Asia Pte Ltd and Chinese Automatic Control Society     

面向主体脆弱性的权限控制安全分析模型

在网络攻击过程中脆弱性存在于节点的部件主体上,针对该问题,将攻击描述细化到网络部件级,在原权限控制模型中增加对部件间权限、连接关系、属性的描述及脆弱性重写规则,构造NCVTG模型,提出复杂度为多项式时间的NCVTG模型图权限转移闭包生成算法用以评估网络的动态变化,给出当前脆弱性状态下的所有攻击路径。实验结果证明,该模型可对网络安全性进行综合分析,预测所有可能的攻击。     

改进的TCP/RED模型的稳定性分析

TCP自同步特性可提高网络稳定性,TCP/RED拥塞控制模型忽略了TCP自同步特性。针对该问题,提出包含TCP自同步特性更接近实际网络的改进TCP/RED拥塞控制模型。应用Nyquist稳定性判据给出当改进模型在复平面上属于某一不包含-1+j0点的下半平面时的稳定性条件,得到比TCP/RED模型更宽松的RED参数设置范围。NS2仿真验证了该稳定性条件的有效性。     

基于邻居节点表更新的可变度分群算法

对移动Ad Hoe网络而言,当网络规模较大时一般采用分级结构来提高网络的可扩展性,如何合理地保障分群是移动AdHoe网络实现分群网络并进行分群路由的前提和核心环节.针对这个关键问题,在分析节点链路改变次数随节点平均移动速度变化的基础上,提出了一种基于邻居节点表更新的可变度分群算法.仿真分析表明,该算法生成的群在稳定性和负载平衡性方面均要优于经典的分群算法.     

包含SVC和非线性负荷的电力系统耗散实现与控制

采用Hamilton函数方法研究了包含静止无功补偿器(SVC)和非线性负荷的电力系统的反馈控制问题. 首先建立了系统的非线性微分代数方程模型, 通过预置状态反馈完成了耗散Hamilton实现. 然后利用该耗散实现结构,通过阻尼注入方式设计了基于能量的SVC非线性控制器. 本文所设计的控制器结构简单, 物理意义明确. 仿真结果表明该控制器能有效提高电力系统的暂态稳定性.     

球形对象族的最优鲁棒镇定

本文对球形对象族系统最优鲁棒镇定问题进行了研究.利用最小范数解方法求解球形对象族的可镇定性半径.可镇定性半径是系统稳定性半径的上界,最优控制器的稳定性半径等于镇定性半径.文中给出球形对象族最优鲁棒控制器的形式,并通过示例具体说明球形对象族最优鲁棒控制器的设计方法.     

含区间时变时滞的线性不确定系统鲁棒稳定性新判据

研究一类区间时变时滞线性不确定系统的鲁棒稳定性问题.通过引入增广Lyapunov泛函,结合积分不等式方法,导出了区间时变时滞线性系统的时滞相关鲁棒稳定性新判据.与现有方法不同,该方法不涉及自由权矩阵技术和任何模型变换,减少了理论和计算上的复杂性,而且在估计Lyapunov泛函导数的上界时没有忽略某些有用项.数值算例表明,所提出的判据是有效的,具有更低的保守性.