外军新型巡航导弹数据链系统体系架构研究

在分析未来作战中新型巡航导弹数据链系统需求和现有巡航导弹数据链局限性的基础上,并将面向服务的"智能信息网络(IIN)"理论引入新系统网络体系架构设计中,提出了设计模型和实现方案,并对其在性能、可靠性、QoS等方面的提高进行了重点分析,为未来新型巡航导弹数据链系统的实现提供了思路。     

Discrete‐time analysis of MAP/PH/1 multiclass general preemptive priority queue

We use the matrix‐geometric method to study the MAP/PH/1 general preemptive priority queue with a multiple class of jobs. A procedure for obtaining the block matrices representing the transition matrix P is presented. We show that the special upper triangular structure of the matrix R obtained by Miller [Computation of steady‐state probabilities for M/M/1 priority queues, Oper Res 29(5) (1981), 945–958] can be extended to an upper triangular block structure. Moreover, the subblock matrices of matrix R also have such a structure. With this special structure, we develop a procedure to compute the matrix R. After obtaining the stationary distribution of the system, we study two primary performance indices, namely, the distributions of the number of jobs of each type in the system and their waiting times. Although most of our analysis is carried out for the case of K = 3, the developed approach is general enough to study the other cases (K ≥ 4). © 2003 Wiley Periodicals, Inc. Naval Research Logistics 50: 662–682, 2003.     

Scheduling patients in an ambulatory surgical center

This paper presents a deterministic approach to schedule patients in an ambulatory surgical center (ASC) such that the number of postanesthesia care unit nurses at the center is minimized. We formulate the patient scheduling problem as new variants of the no‐wait, two‐stage process shop scheduling problem and present computational complexity results for the new scheduling models. Also, we develop a tabu search‐based heuristic algorithm to solve the patient scheduling problem. Our algorithm is shown to be very effective in finding near optimal schedules on a set of real data from a university hospital's ASC. © 2003 Wiley Periodicals, Inc. Naval Research Logistics, 2003     

作业名层次化聚类算法预测作业运行时间

预测作业的运行时间有益于提升系统的调度性能,而聚类有助于训练出更好的预测模型。传统的聚类算法很难将相似的作业名聚类,为了将相似的作业更好地聚类,通过分析其组成成分的语义重要性,构建字母-结构-数字的作业名层次化聚类算法。以两台超级计算机的真实数据为例,实验结果发现,应用此算法聚类后的数据训练模型的预测精度相较传统方法有一定的提升,整体预测精度为70%～80%。     

基于区间灰关联的雷达辐射源识别新方法

在现代密集信号环境中,接收机测得的和辐射源数据库中的雷达特征参数具有不确定性,一般用区间值表示.针对区间类型的特征参数的雷达辐射源识别,提出了一种新的基于区间灰关联度的雷达辐射源融合识别方法.该方法首先运用区间灰关联度得到基本概率赋值,然后运用证据组合与决策实现目标识别.仿真结果表明,这种识别方法是有效的.     

基于VD-AiNet聚类算法的空袭目标类型识别

针对防空反导作战中空袭目标类型识别问题,在分析空袭目标的主要类型、识别指标及其识别原则的基础上,将人工免疫算法中矢量距人工免疫网络聚类算法应用于抗体样本训练模块,并建立了抗体训练和目标识别的并行决策模型.最后进行了算例验证,结果表明了算法和模型的可行性和有效性.     

基于活动方法的武器装备型号论证需求分析

为了适应信息化战争以及基于能力的装备建设需要,武器装备型号论证不能局限于该型号装备承担的基本作战任务,必须面向体系结构展开需求分析。探讨了武器装备型号论证需求分析内涵及本质,给出了理论依据和指导;明确了基于活动方法的原理,对方法的应用提出了要求和规范;借鉴美军体系结构有关技术,从作战任务和装备系统2个方面展开需求分析,提出了作战、装备和能力需求之间的追溯关系矩阵,构建了基于活动方法展开武器装备型号论证需求分析的具体步骤。为武器装备型号论证需求分析提供了有力的方法支撑,有助于需求分析的工程化。     

Using real options analysis to value reoptimization options in the shifting bottleneck heuristic

The reoptimization procedure within the shifting bottleneck (SB) involves reevaluation of all previously scheduled toolgroup subproblems at each iteration of the SB heuristic. A real options analysis (ROA) model is developed to value the option to reoptimize in the SB heuristic, such that reoptimization only occurs when it is most likely to lead to a schedule with a lower objective function. To date, all ROA models have sought to value options financially (i.e., in terms of monetary value). The ROA model developed in this paper is completely original in that it has absolutely no monetary basis. The ROA methodologies presented are shown to greatly outperform both full and no reoptimization approaches with respect to both computation time and total weighted tardiness. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2006     

拓扑度理论之近期发展

这是一篇综述文章,介绍了拓扑度理论近十年来的主要成果。     

链块倒角对链式超越离合器工作效率的影响

分析了链式超越离合器的摩擦阻力放大链（FRAC──Friction－typeRests－tanceAmplifyingChain）的受力,从改善链式超越离合器工作效率角度出发,重点分析了链块倒角对放大链工作效率的影响．