入侵检测中频繁模式的有效挖掘算法

在基于数据挖掘的入侵检测系统中,为了在海量审计记录中有效地提取出相关规则,需要通过利用与入侵检测相关的特定领域知识。首先对关联规则挖掘问题中的相关概念给出几个规范化定义,介绍了基本的关联规则和情节规则挖掘算法,然后结合审计记录的特点,考虑其轴属性和参照属性以及规则兴趣度,对基本挖掘算法中的候选项目集产生函数进行了改进。分析结果表明,利用规则兴趣度能够大大减小候选项目集的大小,有效提高频繁模式挖掘算法的效率。     

信息管理误失灰色补偿方法

在信息采集、信息管理、信息传递过程中,数据链出现空穴、误传或丢失等情况时,将影响信息采集传递的安全性与信息管理的有效性,是信息管理与使用中一个值得关注的问题,如何对数据列进行有效补偿则是解决该问题的关键.运用灰色理论与正交试验设计方法建立了信息链缺失补偿模型并给出了信息链空穴补偿优化准则.所给出的具体的补偿实例说明信息链空穴灰色生成与正交试验设计生成是一种极为有效的信息缺失补偿方法.     

基于数据仓库的数据挖掘技术在指挥控制系统中的应用

介绍了数据仓库和数据挖掘的概念、数据挖掘的过程和方法,简单分析了现代战争中信息处理的特点和需求,阐述了数据挖掘在军事指挥控制系统中的应用必要性,提出了军事应用中数据挖掘系统的层次体系结构,并针对该层次体系结构进一步提出了指挥控制系统中数据挖掘技术的应用模型.     

Probabilistic analysis of an asymptotically optimal solution for the completion time variance problem

Scheduling a set of n jobs on a single machine so as to minimize the completion time variance is a well‐known NP‐hard problem. In this paper, we propose a sequence, which can be constructed in O(n log n) time, as a solution for the problem. Our primary concern is to establish the asymptotical optimality of the sequence within the framework of probabilistic analysis. Our main result is that, when the processing times are randomly and independently drawn from the same uniform distribution, the sequence is asymptotically optimal in the sense that its relative error converges to zero in probability as n increases. Other theoretical results are also derived, including: (i) When the processing times follow a symmetric structure, the problem has 2^{⌊(n−1)/2⌋} optimal sequences, which include our proposed sequence and other heuristic sequences suggested in the literature; and (ii) when these 2^{⌊(n−1)/2⌋} sequences are used as approximate solutions for a general problem, our proposed sequence yields the best approximation (in an average sense) while another sequence, which is commonly believed to be a good approximation in the literature, is interestingly the worst. © 1999 John Wiley & Sons, Inc. Naval Research Logistics 46: 373–398, 1999     

Minimizing total completion time in two-processor task systems with prespecified processor allocations

We consider the problem of scheduling multiprocessor tasks with prespecified processor allocations to minimize the total completion time. The complexity of both preemptive and nonpreemptive cases of the two-processor problem are studied. We show that the preemptive case is solvable in O(n log n) time. In the nonpreemptive case, we prove that the problem is NP-hard in the strong sense, which answers an open question mentioned in Hoogeveen, van de Velde, and Veltman (1994). An efficient heuristic is also developed for this case. The relative error of this heuristic is at most 100%. © 1998 John Wiley & Sons, Inc. Naval Research Logistics 45: 231–242, 1998     

Scheduling deteriorating jobs to minimize makespan

We consider a single-machine problem of scheduling n independent jobs to minimize makespan, in which the processing time of job J_j grows by w_j with each time unit its start is delayed beyond a given common critical date d. This processing time is p_j if J_j starts by d. We show that this problem is NP-hard, give a pseudopolynomial algorithm that runs in time and O(nd) space, and develop a branch-and-bound algorithm that solves instances with up to 100 jobs in a reasonable amount of time. We also introduce the case of bounded deterioration, where the processing time of a job grows no further if the job starts after a common maximum deterioration date D > d. For this case, we give two pseudopolynomial time algorithms: one runs in O(n²d(D − d) time and O(nd(D − d)) space, the other runs in p_j)²) time and p_j) space. © 1998 John Wiley & Sons, Inc. Naval Research Logistics 45: 511–523, 1998     

融合跟踪系统性能的综合评估

首先通过分析融合跟踪系统的性能评估需求,并结合已有性能评估指标,制定出一组相对完备的评估指标.使用时间加权平均的方法,详细描述了各指标的定义及其计算方法;其次,基于该组指标提出了系统性能的模糊综合评价方法,说明了该评价方法的原理及其在融合跟踪系统性能评估中的具体实现.对融合跟踪系统的测试实验表明,指标体系设置合理,评估方法可操作性强.     

C4ISR仿真系统分析和设计

分析了指挥、控制、通讯、计算机、信息、监视和侦察(C4ISR)系统的复杂性特点,指出C4ISR系统在应用过程中,需要仿真系统对系统操作员和指挥员进行训练.研究了C4ISR仿真系统及其各子系统的实现模型,最后以舰艇C4ISR为例进行设计,通过分布式交互仿真协议(DIS)实现各子系统信息的互连.仿真结果表明,系统也可以为检测各种实际系统提供仿真环境和数据.     

维度汇总性问题及其对策

在联机分析处理中,为了提高查询的响应速度,预聚合是一种常用的方法,但在已有的研究中,关于维度汇总性的研究还相当少。从维度汇总性的基本概念及其分类出发,对维度汇总性的判断方法进行了研究,最后还给出了处理维度汇总性问题时的一些对策。     

基于镜像的高可用数据对象布局算法

镜像是提高数据可用性的流行方法。借鉴RAID的方法,在算法一级实现数据的冗余分布,提出基于镜像的高可用数据对象布局算法。在数据对象和存储节点失效时,利用冗余数据重构数据对象和存储节点,有效保证存储系统的高可用性。采用马尔可夫激励模型对存储系统进行定量的可用性分析,计算结果表明该方法是有效的。