基于蚁群算法的攻击图分析

分析攻击图分析中求解攻击图最小关键集的方法和作用。在研究蚁群算法的基础上,将其引入对攻击图的最小关键集的求解中,对Cincotti等人提出的针对权值最小碰集问题的蚁群算法进行改进,并用实验验证了算法的可行性。     

基于模糊支持向量机的步态识别

提出基于模糊支持向量机（FSVM）的步态识别方法,以人体步态的宽度向量作为特征,探讨直接取值法和模糊C均值2种模糊隶属度确定方法对FSVM步态分类效果的影响。实验结果表明,模糊C均值法的识别率均略好于SVM,直接取值法的识别率甚至低于SVM,因此,选取正确的模糊隶属度确定方法是FSVM能否成功应用于步态识别的关键。     

基于C—V模型的目标检测与提取

在目标检测与提取中,传统的蛇模型和基于活动轮廓的局部区域检测方法受到初始条件或者自身的收敛性约束的影响,不仅时间花费多,而且不具备鲁棒性。本文提出一种基于C V模型的变分水平集的目标检测与提取方法,通过大量实验验证,在花费时间和鲁棒性上得到了显著的改善。     

Reachability determination in acyclic Petri nets by cell enumeration approach

Reachability is one of the most important behavioral properties of Petri nets. We propose in this paper a novel approach for solving the fundamental equation in the reachability analysis of acyclic Petri nets, which has been known to be NP-complete. More specifically, by adopting a revised version of the cell enumeration method for an arrangement of hyperplanes in discrete geometry, we develop an efficient solution scheme to identify firing count vector solution(s) to the fundamental equation on a bounded integer set, with a complexity bound of O((nu)^n−m), where n is the number of transitions, m is the number of places and u is the upper bound of the number of firings for all individual transitions.     

On the estimation of adequate test set size using fault failure rates

Test set size in terms of the number of test cases is an important consideration when testing software systems. Using too few test cases might result in poor fault detection and using too many might be very expensive and suffer from redundancy. We define the failure rate of a program as the fraction of test cases in an available test pool that result in execution failure on that program. This paper investigates the relationship between failure rates and the number of test cases required to detect the faults. Our experiments based on 11 sets of C programs suggest that an accurate estimation of failure rates of potential fault(s) in a program can provide a reliable estimate of adequate test set size with respect to fault detection and should therefore be one of the factors kept in mind during test set construction. Furthermore, the model proposed herein is fairly robust to incorrect estimations in failure rates and can still provide good predictive quality. Experiments are also performed to observe the relationship between multiple faults present in the same program using the concept of a failure rate. When predicting the effectiveness against a program with multiple faults, results indicate that not knowing the number of faults in the program is not a significant concern, as the predictive quality is typically not affected adversely.     

Guarding a set of line segments in the plane

We consider the following problem: Given a finite set of straight line segments in the plane, find a set of points of minimum size, so that every segment contains at least one point in the set. This problem can be interpreted as looking for a minimum number of locations of policemen, guards, cameras or other sensors, that can observe a network of streets, corridors, tunnels, tubes, etc. We show that the problem is strongly NP-complete even for a set of segments with a cubic graph structure, but in P for tree structures.     

模糊系统逼近理论：现状与展望

近年来,各类模糊系统已被证明是万能函数逼 近器,它们能实现任意的非线性连续控制规律和动态模型．本文综述与分析了模糊系统逼近 理论研究的最新成果,并指出了进一步研究工作的方向．     

服务器容错与磁盘阵列技术的集成

介绍了 2种常用的服务器容错技术 ,详细阐述了RAID技术的基本原理 ,最后给出了一个工程集成实例     

基于资源优化的QoS路径选择模糊算法

文中讨论了在ＩＰ网络中支持ＱｏＳ路径时优化网络资源的模糊方法,对ＱｏＳ路径选择中出现的多目标路径费用函数进行了合理的描述。该方法综合考虑了径路中的带宽、时延和路径条数,从初选出来的若干条路径中选择更安全,又节约网络资源的路径。仿真结果表明,模糊算法既兼容普通方法,又比普通方法更合理。同时,模糊方法计算简单迅速,用ＶＬＳＩ（ｖｅｒｙ ｌａｒｇｅ ｓｃａｌｅ ｉｎｔｅｇｒａｔｉｏｎ）硬件很容易实现。