On stability delay bounds of simple input-delayed linear and non-linear systems: Computational results

This paper deals with the problem of delay size stability analysis of single input-delayed linear and nonlinear systems. Conventional reduction, reduction linked by sliding mode, and linear memoryless control approaches are used for simple input-delayed systems to obtain the stability conditions. Several first order examples are investigated systematically to demonstrate the capabilities and limitations of the advanced stability analysis techniques including Lyapunov-Krasovskii functionals, Newton-Leibniz formula, and a newly addressed Lagrange mean value theorem. Numerical comparative results show the usefulness and effectiveness of the advanced delay size analysis techniques proposed in this paper.     

突变理论在堤防安全综合评价中的应用

堤防工程安全受洪水、地震、堤身土质及堤基结构等多种因素影响,且其作用机理复杂,一旦失事危害巨大.将突变理论引入堤防工程安全评价中,根据突变评价原理,建立了堤防工程安全综合评价指标体系,参照大坝安全评价标准,结合堤防工程特点,建立了堤防工程安全等级划分标准,利用突变评价的归一公式计算了北江大堤石角堤段设计洪水情况的安全评价指标值,根据等级划分标准,从计算结果分析得知该段堤防在设计洪水工况下安全性较高,为堤防工程安全管理提供科学依据.     

知识的属性扰动规律的不等式关系

知识的属性扰动引起知识规律的变化,这些变化的规律称为扰动规律.利用单向S-粗集和单向S-粗集对偶,给出属性扰动的知识规律的上规律.下规律的概念,并对知识规律与属性扰动的知识规律进行了讨论,提出了属性扰动知识规律(上规律,下规律)的不等式定理.     

S-粗集与数据挖掘单位圆特征

给出单向S-粗集(one direction singular rough sets)、单向S-粗集对偶(dual of one direction singular rough sets)的结构。单向S-粗集与单向S-粗集对偶是改进Z.Pawlak粗集得到的,单向S-粗集与单向S-粗集对偶具有动态特性。给出单向S-粗集、单向S-粗集对偶与Z.Pawlak粗集的关系。S-粗集具有三类形式:单向S-粗集、单向S-粗集对偶、双向S-粗集,利用单向S-粗集、单向S-粗集对偶,给出数据内挖掘、数据外挖掘概念,给出数据内挖掘的外同心圆定理、数据外挖掘的内同心圆定理,并给出其应用。S-粗集是粗集理论与应用研究的新分支。     

Automatic Construction and Verification of Isotopy Invariants

We extend our previous study of the automatic construction of isomorphic classification theorems for algebraic domains by considering the isotopy equivalence relation. Isotopism is an important generalisation of isomorphism, and is studied by mathematicians in domains such as loop theory. This extension was not straightforward, and we had to solve two major technical problems, namely, generating and verifying isotopy invariants. Concentrating on the domain of loop theory, we have developed three novel techniques for generating isotopic invariants, by using the notion of universal identities and by using constructions based on subblocks. In addition, given the complexity of the theorems that verify that a conjunction of the invariants form an isotopy class, we have developed ways of simplifying the problem of proving these theorems. Our techniques employ an interplay of computer algebra, model generation, theorem proving, and satisfiability-solving methods. To demonstrate the power of the approach, we generate isotopic classification theorems for loops of size 6 and 7, which extend the previously known enumeration results. This work was previously beyond the capabilities of automated reasoning techniques. The author’s work was supported by EPSRC MathFIT grant GR/S31099.     

A generalization of the Curtis–Hedlund theorem

Let A be a set and let G be a group, and equip A^G with its prodiscrete uniform structure. Let τ:A^G→A^G be a map. We prove that τ is a cellular automaton if and only if τ is uniformly continuous and G-equivariant. We also give an example showing that a continuous and G-equivariant map τ:A^G→A^G may fail to be a cellular automaton when the alphabet set A is infinite.     

Classification of face images using local iterated function systems

There has been an increasing interest in face recognition in recent years. Many recognition methods have been developed so far, some very encouraging. A key remaining issue is the existence of variations in the input face image. Today, methods exist that can handle specific image variations. But we are yet to see methods that can be used more effectively in unconstrained situations. This paper presents a method that can handle partial translation, rotation, or scale variations in the input face image. The principal is to automatically identify objects within images using their partial self-similarities. The paper presents two recognition methods which can be used to recognise objects within images. A face recognition system is then presented that is insensitive to limited translation, rotation, or scale variations in the input face image. The performance of the system is evaluated through four experiments. The results show that the system achieves higher recognition rates than those of a number of existing approaches. The author would like to thank the Australian Research Council (ARC) which supports this research with a Discovery Grant.     

基于角色的访问控制中职责分离的设计与实现

职责分离是基于角色的访问控制技术中保障实现最小特权原理的关键因素。基于实际项目开发经验,详细阐述了基于角色的访问控制技术中职责分离实现的目的、原理、实现逻辑以及具体的实现方法。     

RAZUMIKHIN-TYPE THEOREMS OF NEUTRAL STOCHASTIC FUNCTIONAL DIFFERENTIAL EQUATIONS

The stability of stochastic functional differential equation with Markovian switching was studied by several authors,but there was almost no work on the stability of the neutral stochastic functional differential equations with Markovian switching.The aim of this article is to close this gap.The authors establish Razumikhin-type theorem of the neutral stochastic functional differential equations with Markovian switching,and those without Markovian switching.     

■ukasiewicz命题逻辑系统中有限命题集的约简理论

在n值■ukasiewicz命题逻辑中提出了命题集Γ的约简理论,引入由命题集Γ所诱导的形式背景的概念,从Γ及其子集的关系出发给出了n值命题逻辑中有限命题集Γ约简的判定定理以及求Γ约简的方法。说明了无穷值■ukasiewicz命题逻辑中命题集Γ的约简可转化为n值情形。