基于联合作战能力的武器装备体系需求研究

从基于联合作战能力的核心思想入手,分析了该思想在武器装备体系需求分析中的重要作用,探讨了基于联合作战能力的武器装备体系需求研究新模式,并提出了该需求研究中需要解决的问题．有关结论对于开展武器装备体系需求研究工作具有积极地指导意义．     

Batch scheduling with step‐deteriorating processing times to minimize flowtime

Both topics of batch scheduling and of scheduling deteriorating jobs have been very popular among researchers in the last two decades. In this article, we study a model combining these two topics. We consider a classical batch scheduling model with unit‐jobs and batch‐independent setup times, and a model of step‐deterioration of processing times. The objective function is minimum flowtime. The optimal solution of the relaxed version (allowing non‐integer batch sizes) is shown to have a unique structure consisting of two consecutive decreasing arithmetic sequences of batch sizes. We also introduce a simple and efficient rounding procedure that guarantees integer batch sizes. The entire solution procedure requires an effort of O(n) (where nis the number of jobs.) © 2012 Wiley Periodicals, Inc. Naval Research Logistics, 2012     

基于ePCANS模型的C2组织本体建模方法

指挥控制(C2)是战场的核心,现代C2组织既要能支持网络中心行动,还要能支持"计算战",因此建立C2组织的高层概念框架和一致的知识表达框架是C2组织研究的核心问题。对PCANS模型进行扩展,建立了C2组织高层概念模型——扩展PCANS(ePCANS),以ePCANS模型为基础,提出了C2组织本体的概念体系,并研究了C2组织本体建模方法。研究成果对C2组织的概念与应用研究具有重要的参考价值。     

粗集支持向量机的战斗机空战效能智能评估

根据现代空战特点,选取了战斗机的空战效能评估指标集,并采用粗糙集理论对指标体系进行约简,提取对空战效能影响起关键作用的特征参数,消除冗余信息,减少了支持向量的维数。支持向量机(SVM)具有结构简单、全局最优、泛化能力强的优点。根据所提取的特征参数,文中提出采用回归型支持向量机(SVR)建立空战效能智能评估模型。并通过实例与指数法和BP神经网络法计算结果进行了比较,验证了该模型的可行性和有效性。     

非线性组合序列的差分分析

针对非线性组合流密码的设计特点,结合明文编码与统计特性,分析了密文序列的差分性质,提出了攻击非线性组合序列的差分攻击算法。利用该算法,最后给出了攻击实例。     

基于联合对角化的远场相干信号波达方向估计

提出一种基于联合对角化的远场相干信号波达方向估计算法.利用阵元接收数据构造高阶累积量矩阵,通过矩阵联合对角化得到阵列广义流形矩阵的估计.利用阵列流形矩阵的矩阵特性及最小多项式的性质,消除联合对角化带来的顺序不确定性,得到波达方向的估计.该方法无需进行角度搜索,且能处理不同相干群内部分波达方向相同的情形.计算机仿真实验验...     

Minimizing makespan on a single batch processing machine with nonidentical job sizes

We deal with the problem of minimizing makespan on a single batch processing machine. In this problem, each job has both processing time and size (capacity requirement). The batch processing machine can process a number of jobs simultaneously as long as the total size of these jobs being processed does not exceed the machine capacity. The processing time of a batch is just the processing time of the longest job in the batch. An approximation algorithm with worst‐case ratio 3/2 is given for the version where the processing times of large jobs (with sizes greater than 1/2) are not less than those of small jobs (with sizes not greater than 1/2). This result is the best possible unless P = NP. For the general case, we propose an approximation algorithm with worst‐case ratio 7/4. A number of heuristics by Uzosy are also analyzed and compared. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48: 226–240, 2001     

协同空战的最小共享信息集

首先提出了最小共享信息集的概念。然后 ,提出了作战飞机的智能系统模型。从它入手 ,分析了协同空战的信息 ,提出了确定协同空战的最小共享信息集的事件法 ,并应用信息论证明了事件法的确能够减少通信的信息量。在上述基础上 ,确定了超视距空对空协同作战的最小共享信息集 ;仿真结果验证了它的合理性     

Case‐based reasoning and improved adaptive search for project scheduling

Most scheduling problems are notoriously intractable, so the majority of algorithms for them are heuristic in nature. Priority rule‐based methods still constitute the most important class of these heuristics. Of these, in turn, parametrized biased random sampling methods have attracted particular interest, due to the fact that they outperform all other priority rule‐based methods known. Yet, even the “best” such algorithms are unable to relate to the full range of instances of a problem: Usually there will exist instances on which other algorithms do better. We maintain that asking for the one best algorithm for a problem may be asking too much. The recently proposed concept of control schemes, which refers to algorithmic schemes allowing to steer parametrized algorithms, opens up ways to refine existing algorithms in this regard and improve their effectiveness considerably. We extend this approach by integrating heuristics and case‐based reasoning (CBR), an approach that has been successfully used in artificial intelligence applications. Using the resource‐constrained project scheduling problem as a vehicle, we describe how to devise such a CBR system, systematically analyzing the effect of several criteria on algorithmic performance. Extensive computational results validate the efficacy of our approach and reveal a performance similar or close to state‐of‐the‐art heuristics. In addition, the analysis undertaken provides new insight into the behaviour of a wide class of scheduling heuristics. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 201–222, 2000     

MLFMA在运动目标多普勒回波数值仿真中的应用

提出了一种应用准静态技术,结合快速多级子算法计算任意形状的运动目标多普勒信号的方法,对目标的几种典型的微动多普勒信号进行了仿真,并应用高分辨时频分析算法对仿真得到的微多普勒信号进行了分析,提取出了微多普勒瞬时频率,并与相应微动规律的点目标微多普勒瞬时频率进行对比。结果表明,二者具有相同的变化规律,从而证明本文提出的方法是有效的。