高维数据环境下网络异常检测的改进否定选择算法

人工免疫中的否定选择算法目前已成功地应用于异常检测的低维数据集上,但在高维数据集上的效果不大理想。为了改善算法的性能,分析了现有否定选择算法在网络异常检测中的不足,对带变长检测器的否定选择算法进行了修改,提出了一种改进的否定选择算法,新算法中通过移动检测器控制检测器覆盖情况。仿真实验结果表明了改进算法在网络异常检测中高维数据集上的有效性,可以取得较高的检测率和较低的误报率。     

结合先天和适应性免疫的蠕虫检测免疫模型

现有的蠕虫检测方法大多通过关闭不安全的端口,切断感染主机与未感染主机之间通信等方法延缓蠕虫传播而达到将损害减少到最低程度的目的.实际上在实施这些方法时往往有许多障碍需要克服,其中的最大障碍就是存在错误检测率高的问题.现将免疫危险理论中的DCs(树突状细胞,Dendritic Cells)-T细胞协同机制用于蠕虫检测,其中DCs属于先天免疫系统细胞,T细胞属于适应性免疫系统细胞.本模型将蠕虫进程触发的系统调用序列当作抗原,将感染蠕虫导致的主机和网络异常当作危险信号.在该模型中,DCs负责危险信号的收集检测并提呈与该危险信号关联的抗原给T细胞检测器进行抗原结构检测.理论分析说明,这样的双重检测方法可以降低伪肯定率和伪否定率,并且记忆T细胞检测器的采用能使系统对类似蠕虫的再次感染反应更加迅速.     

A hybrid clustering and graph based algorithm for tagSNP selection

TagSNP selection, which aims to select a small subset of informative single nucleotide polymorphisms (SNPs) to represent the whole large SNP set, has played an important role in current genomic research. Not only can this cut down the cost of genotyping by filtering a large number of redundant SNPs, but also it can accelerate the study of genome-wide disease association. In this paper, we propose a new hybrid method called CMDStagger that combines the ideas of the clustering and the graph algorithm, to find the minimum set of tagSNPs. The proposed algorithm uses the information of the linkage disequilibrium association and the haplotype diversity to reduce the information loss in tagSNP selection, and has no limit of block partition. The approach is tested on eight benchmark datasets from Hapmap and chromosome 5q31. Experimental results show that the algorithm in this paper can reduce the selection time and obtain less tagSNPs with high prediction accuracy. It indicates that this method has better performance than previous ones.     

基于决策树及遗传算法的人工免疫入侵检测算法

针对传统的否定选择算法中生成大量无效抗体,并且抗体之间缺乏多样性的问题,设计了基于决策树及遗传算法的人工免疫入侵检测算法。将决策树和遗传算法引入传统的否定选择算法中,利用决策树计算抗原和抗体之间的亲和力,提出了新fitness的计算公式,并利用抗体浓度衡量抗体集的多样性,将低浓度抗体代替高浓度抗体,实现了抗体的多样性,确保了当抗体集的数量一定时尽可能覆盖最大的非自体集空间,以提高抗体集的性能。     

基于SQL的多条件选择智能实现算法

B/S架构的信息系统开发中,一般情况下,根据用户的选择,n个条件的输入组合数是2n个。但是,该文中提出的算法,其组合数仅为n到n(n+1)/2,大大简化了编程。     

嵌入式软件中一种修正QoS值的构件选择方法

CBSD(Component-Based Software Development)已经成为嵌入式软件开发的主流技术。在嵌入式环境下,有大量功能相似的构件,在开发过程中基于QoS的构件选择已成为研究热点。然而这些构件的QoS声明与提供者给出的往往并不一致。为此,提出一种基于修正QoS值的构件选择方法,该方法将QoS信任度作为权重,修正QoS值,再结合模糊逻辑,推理出该构件的综合服务能力。通过嵌入式VOD仿真实验,验证了算法的有效性,保证了构件选择的客观性和准确性。     

H.264帧内预测模式选择快速算法的研究

提出一种适用于H.264帧内预测的快速算法,利用相邻像素间的梯度筛选预测模式来避免不必要的预测模式计算。实验结果表明:用全I帧编码,该算法在图像质量和输出码率基本不变的情况下,编码时间大约节省了60%。     

信任感知的组合服务动态选择方法

把信任概念和信任度引入到服务组合中来,讨论了信任感知的服务组合选择问题,分别基于两种观点建立了其数学模型.并基于观点1,深入地研究了服务组合的动态选择问题,分别采用蚁群系统作为优化工具设计了两种动态选择方法:方法1针对服务在上限阈值的范围内提供优质服务,服务质量保持不变,超过阈值则拒绝服务的情况;方法2针对服务无限制地接受请求,但随着请求数量的增多,其服务质量下降的情况.通过对方法1和方法2的仿真实验结果分析表明,两种方法具有很好的效果.     

Creating change and driving innovation in highly automated and lean organizations: The Temporal Think Tank™ (T3™)

This paper introduces the concept of the temporal think tank™ (T3™), a temporary in-house research center, based on case studies with a highly automated global manufacturer and in various small-sized manufacture (SME's). The T3™ brings individuals from across the organization together in a team setting in which they are charged to look at the future, develop their decision-making skills, and use entrepreneurial thinking to incubate new processes and/or products. After an appropriate time in the temporal think tank™, the individuals are asked to return to their regular positions to implement the best practices and best ideas and doing so spur the organization forward. At intervals, the temporal think tanks™ can be reconvened, or reconstituted with new participants. This approach prepares technology champions for the SME, who can return to the organization with a fresh outlook and renewed energy to keep the enterprise at the peak of efficiency and effectiveness.