无线通信设备故障诊断知识系统的设计及实现

通过分析无线通信设备的故障特点,按照面向对象的方法,设计了针对无线通信设备故障特点的基于知识的故障诊断模型,为了扩展和维护知识的方便,以及实现知识的重用,根据CommonKADS思想,对故障诊断模型按照领域知识、推理知识和任务知识进行建模。最后以VC＋＋6．0为开发工具和SQLServer2005为后台数据库,实现了原型系统的开发。     

基于“当前”统计模型的机动目标自适应跟踪算法

针对"当前"统计模型对加速度极值及机动频率需人为设定的缺陷,提出了一种基于滤波残差的高斯型隶属度函数改进算法,该法在跟踪过程中对加速度极值进行自适应调整。引入一种基于残差的Sigmoid二次型隶属度函数,通过自适应改变机动频率,使模型趋于目标真实状态。理论分析和仿真结果表明,改进的模型避免了人为引入误差,提高了机动目标的跟踪精度,算法简单,易于工程实现。     

无动力运载器出水过程误差分析

无动力运载器在出水过程中受海浪的扰动作用,运动参数会产生一定的偏差。针对海浪随机性的特点,应用波能谱理论,在P-M谱基础上构建了随机海浪模型,并使用四元数法建立运载器水弹道数学模型,解决了运载器垂直出水姿态角存在的奇异性问题,通过采用二元切片法给出波浪力的计算公式。最终在Matlab/Simulink仿真工具箱下建立了运载器仿真模型,就不同海况与主浪向角影响下运载器出水的运动参数偏差进行了仿真计算,分析了其变化规律。仿真结果表明,运载器在4级海况以下各项运动参数都满足出水要求,对运载器的设计与使用具有一定的参考意义。     

基于DoDAF的预警卫星系统作战体系结构建模

预警卫星系统在弹道导弹防御系统中处在最前沿,在战争中起着其他装备无法替代的作用。首先分析了Do DAF作战体系结构产品的内容和相互关系,提出了作战体系结构具体的设计步骤。依据预警卫星系统的作战流程,建立了部分作战体系结构模型,从不同侧面描述了预警卫星系统节点及节点间的信息关系。最后,对模型进行了语法和语义一致性验证,结果表明,建立的模型是正确的。     

潜艇自航模系统可靠性优化设计

针对潜艇自航模系统可靠性设计问题,提出了有针对性的可靠性优化设计方法;在构建矩阵式任务剖面的基础上,应用多阶段任务系统可靠性建模理论建立系统可靠性模型并开展预计;根据FMEA分析结果提出技术改进措施,以体积、重量、成本为约束构建可靠性冗余优化模型并利用微粒群算法求解.案例证明了该优化设计的有效性及可行性.     

深 V 型船艉扰流板减阻模型试验及数值分析

为深入研究深 V 型船艉扰流板减阻机理,首先进行了深 V 型船艉扰流板系列减阻模型试验研究,获得了模型阻力减少4％左右的艉扰流板设计方案,该方案扰流板深度与艉板宽度之比为0．0094;其次,采用RANS 方程以及计及航态影响的数值计算方法,逐段分析了船体微段阻力变化规律。结果表明：扰流板减阻的主要原因在于其改善了船体航态,从而减少了压差阻力。     

装备分布式虚拟维修训练仿真负载平衡研究

基于HLA的装备分布式虚拟维修训练过程极易产生仿真节点负载失衡,以往的负载平衡研究多关注资源利用率,仿真运行过程中可能会因节点负载的不均衡进行频繁的负载调度,影响仿真运行效率.针对此问题,以保证仿真节点的高效运行为首要目的,将负载平衡定义为不存在超载节点即为平衡,提出了一种动静结合的复合式负载平衡调度方法.研究了复合式负载平衡系统的体系结构,采用最小连接调度法实现了节点静态负载的粗粒度平衡,引入仿真运行比率分量参数表征负载量值,进而设计了动态负载平衡算法对仿真运行过程进行实时监控和调度.实验结果表明,改进后仿真平衡调度频率明显下降,实现了资源利用率和仿真效率的平衡兼顾,取得了良好的效果.     

量子计算的研究现状和发展动向

作为未来高性能计算研究的重要方向,量子计算受到了全世界的高度重视。文章简单介绍了量子计算的基本原理和研究现状,并对量子计算的未来发展作了分析与思考。     

Optimal control of noncollaborative servers in two‐stage tandem queueing systems

We consider two‐stage tandem queueing systems with dedicated servers in each station and a flexible server that is trained to serve both stations. We assume no arrivals, exponential service times, and linear holding costs for jobs present in the system. We study the optimal dynamic assignment of servers to jobs assuming a noncollaborative work discipline with idling and preemptions allowed. For larger holding costs in the first station, we show that (i) nonidling policies are optimal and (ii) if the flexible server is not faster than the dedicated servers, the optimal server allocation strategy has a threshold‐type structure. For all other cases, we provide numerical results that support the optimality of threshold‐type policies. Our numerical experiments also indicate that when the flexible server is faster than the dedicated server of the second station, the optimal policy may have counterintuitive properties, which is not the case when a collaborative service discipline is assumed. © 2014 Wiley Periodicals, Inc. Naval Research Logistics 61: 435–446, 2014     

Optimal patrol to uncover threats in time when detection is imperfect

Consider a patrol problem, where a patroller traverses a graph through edges to detect potential attacks at nodes. An attack takes a random amount of time to complete. The patroller takes one time unit to move to and inspect an adjacent node, and will detect an ongoing attack with some probability. If an attack completes before it is detected, a cost is incurred. The attack time distribution, the cost due to a successful attack, and the detection probability all depend on the attack node. The patroller seeks a patrol policy that minimizes the expected cost incurred when, and if, an attack eventually happens. We consider two cases. A random attacker chooses where to attack according to predetermined probabilities, while a strategic attacker chooses where to attack to incur the maximal expected cost. In each case, computing the optimal solution, although possible, quickly becomes intractable for problems of practical sizes. Our main contribution is to develop efficient index policies—based on Lagrangian relaxation methodology, and also on approximate dynamic programming—which typically achieve within 1% of optimality with computation time orders of magnitude less than what is required to compute the optimal policy for problems of practical sizes. © 2014 Wiley Periodicals, Inc. Naval Research Logistics, 61: 557–576, 2014