一类不确定模糊脉冲切换系统的H∞控制

研究了一类参数不确定的模糊脉冲切换系统在任意切换下的H_∞控制问题.利用Lyapunov稳定性理论与线性矩阵不等式方法,给出了连续的脉冲切换系统满足H_∞性能的充分条件,并把这个条件转化为一个线性矩阵不等式,便于实现.     

一类切换线性系统的动态输出反馈H_∞控制:LMIs方法

研究一类由任意有限多个线性子系统组成的切换系统的动态输出反馈H∞控制问题.利用共同Lyapunov函数方法和凸组合技术,给出由矩阵不等式表示的控制器存在的充分条件,并设计了相应的子控制器和切换规则.采用消元法,将该矩阵不等式转化为一组线性矩阵不等式(LMIs).最后给出一个数值仿真实例证明结论的有效性.     

时滞非线性连续切换系统观测器设计

针对非线性时滞切换系统进行了观测器设计.通过构造李雅普诺夫Krasovskii泛函、利用线性矩阵不等式与平均驻留时间的策略,提出切换系统的增益矩阵设计,讨论了在切换系统无扰动的情况下误差切换系统指数渐近稳定的充分条件.在此基础之上进一步研究了具有扰动影响时,误差切换系统具有H_∞性能指标的线性矩阵不等式条件.其次把结果推广到误差切换系统有共同Lyapunov函数的情况,也进一步简化为没有时延的情况.最后给出仿真例子,显示切换系统的观测器设计是行之有效的.     

一类不确定线性切换系统二次鲁棒稳定性的充分条件

本文研究了一类不确定线性切换系统的二次鲁棒稳定性问题.首先利用矩阵集的严格完备性设计切换律,导出了二次鲁棒稳定的充分条件.同时得到了在任意切换策略下,当矩阵集的所有矩阵为负定时保证切换系统二次鲁棒稳定性.在适当的假设下,这些条件可以表示为矩阵不等式.最后,用数值例子对所得结果加以阐明,说明了文中结果的正确性.     

一类离散的时滞脉冲切换系统的H_∞二次稳定性

研究了一类离散的时滞脉冲切换系统的H_∞控制问题,利用Lyapunov稳定性理论和线性矩阵不等式方法,给出了离散脉冲切换系统具有性能指标γ的充分条件.     

非线性离散开关系统的鲁棒镇定问题

利用切换Lypunov函数方法,把非线性离散开关系统的鲁棒镇定问题转化成一个矩阵不等式的最优解问题,给出了在任意切换下具有非线性扰动的线性开关系统的可鲁棒镇定的充分条件,并进一步讨论了同类时滞开关系统的鲁棒镇定问提.最后把以上结论推广到广义开关系统,由于结果均以矩阵不等式形式给出,便于验证和实现.     

若干类时滞切换系统的稳定性问题

主要研究了镇定切换系统的鲁棒稳定性问题.用切换lyapunov函数方法,通过定义指标函数,讨论了基于切换lyapunov函数的若干类时滞切换系统的稳定性问题,用矩阵不等式研究了时滞,时滞摄动和不确定时滞的切换系统的鲁棒稳定性.     

不确定变时滞Lurie切换系统的H_∞记忆输出反馈控制

在基于Lyapunov-Krasovskii泛函、Schur补引理及矩阵不等式方法下,讨论了一类具有变时滞不确定性Lurie切换系统,在切换状态输出反馈策略下,得到了鲁棒H_∞控制性能要求下可行解存在的充分性判据,为系统的综合提供了可行性判据.设计了有记忆的输出反馈控制器以及切换规则,且有记忆控制器的设计,为系统的稳定性分析及控制器的综合提供了更多的自由度,最后的结果转化为线性矩阵不等式给出,通过数值仿真,验证了定理的有效性和实用性.     

具有非对称通信时滞和切换拓扑的高阶多智能体系统的一致性

研究具有切换有向拓扑和非对称时变时滞的高阶多智能体系统的一致性问题.通过引入正交线性变换和Lyapunov-Krasovskii泛函方法,依据线性矩阵不等式给出了系统解决一致性问题的充分条件以及可容许时变时滞的上界估计.其主要贡献是基于Lyapunov方程和代数不等式建立了协议参数的显性设计,该参数设计形式简单且易于计算,并保证了所给充分条件中线性矩阵不等式的可解性,使得高阶多智能体系统的一致性在切换有向拓扑下对非对称时变时滞是鲁棒的.     

异步切换下一类带有时变时滞非线性切换系统的指数镇定

研究了在异步切换下一类带有时变时滞非线性切换系统指数镇定问题,其中控制器的切换时刻滞后于系统的切换时刻.构造了与参数相关的LyapunovKrasovskii函数,且在控制器与子系统不匹配区间内增加.利用矩阵不等式和平均驻留时间相结合的方法,建立了时变时滞非线性切换系统在异步切换下指数镇定的充分条件.另外,在异步切换下通过矩阵的特殊变形,最终设计出控制器.最后给出仿真算例验证了所得结果的有效性.     

两类带有确定潜伏期的SEIS传染病模型的分析

通过研究两类带有确定潜伏期的SEIS传染病模型,发现对种群的常数输入和指数输入会使疾病的传播过程产生本质的差异．对于带有常数输入的情形,找到了地方病平衡点存在及局部渐近稳定的阈值,证明了地方病平衡点存在时一定局部渐近稳定,并且疾病一致持续存在．对于带有指数输入的情形,发现地方病平衡点当潜伏期充分小时是局部渐近稳定的,当潜伏期充分大时是不稳定的．     

Strongly Regular Rings and SF-rings

in this paper, new characteristic properties of strongly regular rings are' given.Relations between certain generalizations of duo rings are also considered. The followingconditions are shown to be equivalent: (1) R is a strongly regular ring; (2) R is a left SFring such that every product of two independent closed left ideals of R is zero; (3) R is aright SF-ring such that every product of two independent closed left ideals of R is zero; (4)R is a left SF-ring whose every special left annihilator is a quasi-ideal; (5) R is a right SFring whose every special left annihilator is a quasi-ideal; (6) R is a left SF-ring whose everymaximal left ideal is a quasi-ideal; (7) R is a right SF-ring whose every maximal left ideal isa quasi-ideal; (8) R is a left SF-ring such that the set N(R) of all nilpotent elements of R isa quasi-ideal; (9) R is a right SF-ring such that N(R) is a quasi-ideal.     

Milnor方图中的w-凝聚性

整环R称为ω-凝聚整环,是指R的每个有限型理想是有限表现型的.本文证明了ω-凝聚整环是v-凝聚整环,且若(RDTF,M)是Milnor方图,则在Ⅰ型情形,R是ω-凝聚整环当且仅当D和T都是ω-整环,且T_M是赋值环;对于Ⅱ-型情形,R是ω-凝聚整环当且仅当D是域,[F:D]<∞,M是R的有限型理想,T是ω-凝聚整环,且R_M是凝聚整环.     

Polynomial-time algorithms for regular set-covering and threshold synthesis

A set-covering problem is called regular if a cover always remains a cover when any column in it is replaced by an earlier column. From the input of the problem - the coefficient matrix of the set-covering inequalities - it is possible to check in polynomial time whether the problem is regular or can be made regular by permuting the columns. If it is, then all the minimal covers are generated in polynomial time, and one of them is an optimal solution. The algorithm also yields an explicit bound for the number of minimal covers. These results can be used to check in polynomial time whether a given set-covering problem is equivalent to some knapsack problem without additional variables, or equivalently to recognize positive threshold functions in polynomial time. However, the problem of recognizing when an arbitrary Boolean function is threshold is NP-complete. It is also shown that the list of maximal non-covers is essentially the most compact input possible, even if it is known in advance that the problem is regular.     

Detection of multivariate outliers with location slippage or scale inflation in left orthogonally invariant or elliptically contoured distributions

This paper is concerned with two kinds of multiple outlier problems in multivariate regression. One is a multiple location-slippage problem and the other is a multiple scale-inflation problem. A multi-decision rule is proposed. Its optimality is shown for the first problem in a class of left orthogonally invariant distributions and is also shown for the second problem in a class of elliptically contoured distributions. Thus the decision rule is robust against departures from normality. Further the null robustness of the decision statistic which the rule is based on is pointed out in each problem.     

Compromise solutions and estimation of the noninferior set

A general framework is presented in which the relation of the set of noninferior points and the set of compromise solutions is studied. It is shown that the set of compromise solutions is dense in the set of noninferior points and that each compromise solution is properly noninferior. Also, under convexity of the criteria space, a characterization of the properly noninferior points in terms of the compromise solutions is presented. In this characterization, the compromise solutions depend continuously on the weights. Use of the maximum norm is studied also. It is shown that a subset of these max-norm solutions, obtained by taking certain limits of compromise solutions, is dense and contained in the closure of the set of noninferior points.     

递推阻尼最小二乘法的收敛性与稳定性

递推最小二乘法是参数辨识中最常用的方法,但容易产生参数爆发现象,因此对一种更稳定的辨识方法－－递推阻尼最小二乘法进行了收敛特性的分析,在使用算法之前先旭一化测量向量,结果表明,参数化距离收敛于一个零均值随机变量并且在持续激励条件下,适应增益矩阵的条件数有界。参数化距离的方差有 。     

弱空间式Locale

空间式locale范畴SLoc是locale范畴Loc的余反射满子范畴,但对locale乘积不封闭．本文引入弱空间式locale,证明弱空间式locale范畴WSloc为范畴Loc的余反射满子范畴,且对locale秉积封闭．还证明了一个locale A是空间式的当且仅当它的枝映射localeN(A)是弱空间式的;一个空问式locale的每一个子locale都是空间式的当且仅当它的每一个子locale是弱空间式的．最后,证明了弱空间式性在定向函子下保持不变．     

Robustness of one-sided cross-validation to autocorrelation

The effects of moderate levels of serial correlation on one-sided and ordinary cross-validation in the context of local linear and kernel smoothing is investigated. It is shown both theoretically and by simulation that one-sided cross-validation is much less adversely affected by correlation than is ordinary cross-validation. The former method is a reliable means of window width selection in the presence of moderate levels of serial correlation, while the latter is not. It is also shown that ordinary cross-validation is less robust to correlation when applied to Gasser-Müller kernel estimators than to local linear ones.     

Borel measures in consonant spaces

A topology on a set X is called consonant if the Scott topology of the lattice is compactly generated; equivalently, if the upper Kuratowski topology and the co-compact topology on closed sets of X coincide. It is proved that every completely regular consonant space is a Prohorov space, and that every first countable regular consonant space is hereditarily Baire. If X is metrizable separable and co-analytic, then X is consonant if and only if X is Polish. Finally, we prove that every pseudocompact topological group which is consonant is compact. Several problems of Dolecki, Greco and Lechicki, of Nogura and Shakmatov, are solved.