文中提出了一个基于角色的 OA系统访问控制模型 RBACOA(role- based access control of office automation) .给出了数据、操作、权限、角色、用户、约束和角色继承等模型要素及其相互关系的形式化描述 ,并且提供了基本的操作和规则 ....文中提出了一个基于角色的 OA系统访问控制模型 RBACOA(role- based access control of office automation) .给出了数据、操作、权限、角色、用户、约束和角色继承等模型要素及其相互关系的形式化描述 ,并且提供了基本的操作和规则 .文中简述了 RBACOA模型在 Domino/Notes平台上的设计与实现 ,通过设计与实现的 OA应用实例说明了该模型在访问控制方面的优点 .展开更多
There has been a growing interest in mathematical models to character the evolutionary algorithms. The best-known one of such models is the axiomatic model colled the abstract evolutionary algorithm. In this paper, we...There has been a growing interest in mathematical models to character the evolutionary algorithms. The best-known one of such models is the axiomatic model colled the abstract evolutionary algorithm. In this paper, we first introduce the definitions of the abhstract selection and evolution operators, and that of the abstract evolutionary algorithm, which describes the evolution as an abstract stochastic process composed of these two fundamental abstract operators. In particular, a kind of abstract evolutionary algorithms based on a special selection mechansim is discussed. According to the sorting for the state space, the properties of the single step transition matrix for the algorithm are anaylzed. In the end, we prove that the limit probability distribution of the Markov chains exists. The present work provides a big step toward the establishment of a unified theory of evolutionary computation.展开更多
基金Supported by the National Science Foundation of China(60133010)Supported by the Science Foundation of Henan Province(2000110019)
文摘There has been a growing interest in mathematical models to character the evolutionary algorithms. The best-known one of such models is the axiomatic model colled the abstract evolutionary algorithm. In this paper, we first introduce the definitions of the abhstract selection and evolution operators, and that of the abstract evolutionary algorithm, which describes the evolution as an abstract stochastic process composed of these two fundamental abstract operators. In particular, a kind of abstract evolutionary algorithms based on a special selection mechansim is discussed. According to the sorting for the state space, the properties of the single step transition matrix for the algorithm are anaylzed. In the end, we prove that the limit probability distribution of the Markov chains exists. The present work provides a big step toward the establishment of a unified theory of evolutionary computation.