基于非对称逆布局表示的图像周长计算方法

The non-symmetry anti-packing image representation （NAIR） uses a sequence of the instances of some predefined prototypes to represent an image. While significantly reducing the instances required to represent an image in contrary to the quadtree and the linear quadtree, however, NAIR has lost the explicit space relationship among these instances and hence made some geometric operations such as perimeter computation hard to be implemented. In this paper, longitude and latitude grid （L^2G）, a data structure which can restore lost space relationship from the NAIR is first presented, and then a novel algorithm to compute the perimeters of the images represented by the NAIR is presented. The experimental results show that the new algorithm has saved at least 90% of the running time comparing with that based on the quadtree.     

树形层次化组织机构中的分级访问控制模型

在BLP模型基础上提出一个新的分级访问控制模型,模型中建立部门之间的层次关系,提出岗位这一新的概念,简化了安全标记指派这一烦琐工作.通过为岗位指派多个安全标记,实现上下级及平级部门之间的互相沟通,在树形层次中靠得越近的部门,其职员之间可交流的客体密级越高.定义3个层次的访问矩阵,实现多种粒度的灵活的自主访问控制.模型在增加灵活性和实用性的同时保证信息的流动始终处于系统的控制之下,继承了BLP模型最突出的优点,并通过形式化证明的方式对模型进行了验证.