故障传播有向图在地面电源故障诊断的应用

基于图论的故障诊断方法能够有效地缩小故障源的搜索范围,在最短的时间内找到真正产生故障的部件。采用故障传播有向图的方法对某飞行器地面电源故障诊断算法进行了研究,针对该飞行器地面电源的物理结构及相关的电气特性得到其故障传播有向图,并经过一些运算后将有向图进行了分层重构,最后利用故障定位算法模拟了故障定位的过程,得到了很好的效果。     

基于滤波与BP神经网络的水下探测信号检测算法

针对水下探测系统探测船舶磁场信号时信噪比较低的问题,首先根据磁异常信号的频域特征,设计了约束最小二乘FIR滤波器,通过对含噪信号进行带通滤波,滤除高频噪声;再采用BP神经网络对低频分量进行学习,提取船舶目标特征信号。将该算法应用于船模实测实验,结果表明:该算法可以显著提高信噪比,增强对船舶磁场信号的检测能力。     

基于信息熵的多属性群决策通指装备效能评估算法

基于通指装备效能评价指标的多样性和描述语言的模糊性,首先将对通指装备评价属性的定量、定性描述指标统一转化为三角模糊数,实现定量指标与定性指标的规范化处理,在此基础上提出一种基于信息熵排序的模糊多属性群决策算法,实现对通指装备的综合评价．最后,通过通指装备效能评估实例分析并证明了算法的可行性和有效性．     

50000m~3油罐壁厚设计比较与分析

油罐的壁厚设计关系到油罐的经济性和可靠性,如何把握两者的辩证关系对油罐的设计与建设具有十分重要的意义。传统上大型油罐壁厚设计采用的是变点法;以可靠度理论为基础,以可靠性分析模型为核心,提出利用可靠度法求解大型油罐壁厚的新方法。以50 000 m3油罐为例,编程分析并计算以2种方法设计的壁厚。变点法设计的底圈罐壁厚度与圈数无关;以中心点可靠度法求解壁厚,可靠性指标一定时,底圈罐壁厚度同样与圈数无关。探讨可靠度法求解壁厚的可行性,验证变点法设计壁厚的可靠性。     

夺占小型岛屿作战综合登陆舰编队展开点选择优化模型

针对综合登陆舰编队夺占小型岛屿作战中的威胁特点,确定了岸基航空兵对综合登陆舰的有效掩护区,建立了综合登陆舰展开点选择的优化模型,并给出了简单方便的图上作业法,为合理确定综合登陆舰的展开点提供了方法和依据。     

Random disambiguation paths for traversing a mapped hazard field

We consider the problem of safely and swiftly navigating through a spatial arrangement of potential hazard detections in which each detection has associated with it a probability that the detection is indeed a true hazard. When in close proximity to a detection, we assume the ability—for a cost—to determine whether or not the hazard is real. Our approach to this problem involves a new object, the random disambiguation path (RDP), which is a curve‐valued random variable parametrized by a binary tree with particular properties. We prove an admissibility result showing that there is positive probability that the use of an RDP reduces the expected traversal length compared to the conventional shortest zero‐risk path, and we introduce a practically computable additive‐constant approximation to the optimal RDP. The theoretical considerations are complemented by simulation and example. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005     

Production and transport logistics scheduling with two transport mode choices

This paper considers a new class of scheduling problems arising in logistics systems in which two different transportation modes are available at the stage of product delivery. The mode with the shorter transportation time charges a higher cost. Each job ordered by the customer is first processed in the manufacturing facility and then transported to the customer. There is a due date for each job to arrive to the customer. Our approach integrates the machine scheduling problem in the manufacturing stage with the transportation mode selection problem in the delivery stage to achieve the global maximum benefit. In addition to studying the NP‐hard special case in which no tardy job is allowed, we consider in detail the problem when minimizing the sum of the total transportation cost and the total weighted tardiness cost is the objective. We provide a branch and bound algorithm with two different lower bounds. The effectiveness of the two lower bounds is discussed and compared. We also provide a mathematical model that is solvable by CPLEX. Computational results show that our branch and bound algorithm is more efficient than CPLEX. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005     

基于LDA算法的一维距离像特征提取

在线性分辨分析(LDA)基础上,通过遗传算法寻找Fisher准则下最优的线性映射中心和相应的最优映射,使不同模式在特征空间内具有最大的可分离性,并将该算法用于雷达目标一维距离像特征提取与识别中。实验表明,和原算法相比,新算法在特征提取性能和目标正确识别率上有较大提高,说明了算法的有效性。     

基于自适应遗传算法的目标优化分配方法

提出了基于自适应遗传算法的目标优化分配模型,阐述了自适应遗传算法在目标优化分配中的应用,通过在计算机上仿真运行实例得出了目标优化分配方案。本方法对地面防空目标优化分配决策研究具有一定的参考价值。     

一种针对基因识别的GHMM简化算法

广义隐Markov模型是计算机基因识别的一种重要模型,它克服了传统隐Markov模型的状态段长成几何分布的缺陷,更加适合于计算机基因识别。其缺点在于计算量大,需要采用有效的简化算法。利用基因的结构特点,在不附加额外限制条件的情况下,提出了一种新的简化算法,其计算复杂度是序列长度的线性函数。对实际生物序列数据的测试结果表明了此简化算法的有效性。