高超声速飞行器低可探测性滑翔弹道优化方法

为进一步提高高超声速飞行器的突防性能,提出高超声速飞行器低可探测性滑翔弹道优化方法。考虑飞行器180°×360°方向的雷达散射截面,针对原数据尖峰多、收敛难的难题,运用高斯滤波法对其进行预处理,既不改变原数据趋势又加以平滑,提高优化问题收敛性能。为使计算所用雷达散射截面数据具备较强的保真性,采用三次样条插值方法调用离散数据计算实时雷达散射截面。完成了高超声速飞行器低可探测性滑翔弹道优化问题的建模,以探测概率为目标函数,运用hp自适应Radau伪谱法优化求解,采用逐步计算策略进一步提高优化效率和收敛性能。与传统最短飞行时间弹道对比表明,该方法有效降低了飞行器被雷达发现的概率。     

电子对抗对空侦察雷达阵地配置优化研究

针对电子对抗对空侦察雷达阵地优化配置问题,通过分析雷达站的侦察范围与定位条件,提出双机定位和三机定位的最优配置模式,分别建立双机定位和三机定位的最优站距、定位纵深、配置间隔、阵地高度等相关参数的计算模型。通过对电子对抗对空侦察雷达阵地优化配置问题进行实例计算,表明模型实用、有效。     

应用Isight的复合材料桁架结构优化设计

轻质复合材料及其结构以其优异的力学性能在航天航空飞行器上得到了广泛应用。考察玻璃纤维/环氧复合材料方形截面桁架在典型弯曲载荷工况条件下的非线性结构承载性能。采用Isight集成平台对桁架结构进行多参数优化设计,获得满足结构刚度和承载性能要求的最轻质桁架结构的几何参数,并分析最优化结构在载荷作用下的结构非线性响应行为。结果表明采用Isight平台对桁架结构进行多参数优化设计具有较高的效率和可信度。     

改进的SIR宽阻带微带带通滤波器设计

利用一种改进SIR谐振器设计交叉耦合微带带通滤波器,实现对滤波器谐波响应的进一步抑制。在此谐振器内部引入SIR谐波抑制结构,并给出了宽阻带滤波器的仿真结果。该滤波器具有较宽的阻带特性,从f0到2.8f0间的抑制约为30 dB以上;从2.8f0到5.3f0间的抑制约为20 dB以上。这种简单的谐波抑制结构既不改变原有滤波器的结构,又不需要更高精度的制作工艺,具有较强的实用性。     

基于改进遗传算法的防空火力优化分配方法

结合地空导弹部队防空作战的特点,提出了基于改进遗传算法的防空火力优化分配模型,给出了模型求解的方法和步骤,详细阐述了改进遗传算法在防空火力分配中的应用,通过在计算机上仿真运行实例得出了火力分配方案,通过仿真证明本方法运算速度较快,结果精度较高,对地面防空火力分配决策研究具有一定的参考价值。     

基于遗传算法的涡轮增压器叶轮优化设计

提出了一种基于遗传优化理论的涡轮增压器叶轮的优化设计方法,论述了以涡轮增压器叶轮能量损失最小为目标函数,以叶轮叶片进口角、进口直径、进口宽度、出口直径、叶片数、出口角为设计变量的涡轮增压器叶轮的优化设计模型及优化计算的方法,数值计算表明,这种算法可以方便地求得具有最小涡轮损失的涡轮叶形参数.     

多级可修备件库存的生灭过程建模与优化

针对VARI-METRIC模型在低可用度下结果不准确的问题,建立基于生灭过程的任意等级、任意层级可修件库存优化模型。通过对各级站点、各类备件需求率与到达率的预测,对每个部件建立其生灭过程模型,并提出基于生灭过程的装备可用度计算方法。以整个保障系统的装备可用度为约束指标,以备件总购置费最低为目标,利用边际算法得到最优备件配置方案,并建立仿真模型对所得优化方案进行评估与调整。结合算例,以仿真结果作为检验标准,选取权威的VMETRIC软件与该解析模型在优化性能、计算精度及适用性上进行对比和说明。结果表明,无论是解析模型还是VMETRIC软件,均存在一定的适用范围,而采用解析与仿真相结合的方法无疑具有更强的适应性。     

Optimal service and arrival rates in Jackson queueing networks

In this paper we present an algorithm for solving a class of queueing network design problems. Specifically, we focus on determining both service and arrival rates in an open Jackson network of queueing stations. This class of problems has been widely studied and used in a variety of applications, but not well solved due to the difficulty of the resulting optimization problems. As an example, consider the classic application in computer network design which involves determining the minimum cost line capacities and flow assignments while satisfying a queueing performance measure such as an upper limit on transmission delay. Other application areas requiring the selection of both service and arrival rates in a network of queues include the design of communication, manufacturing, and health care systems. These applications yield optimization problems that are difficult to solve because typically they are nonconvex, which means they may have many locally optimal solutions that are not necessarily globally optimal. Therefore, to obtain a globally optimal solution, we develop an efficient branch and bound algorithm that takes advantage of the problem structure. Computational testing on randomly generated problems and actual problems from a health care organization indicate that the algorithm is able to solve realistic sized problems in reasonable computing time on a laptop computer. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 1–17, 2000     

Optimal (τ, T) opportunistic maintenance of a k‐out‐of‐n:G system with imperfect PM and partial failure

The opportunistic maintenance of a k‐out‐of‐n:G system with imperfect preventive maintenance (PM) is studied in this paper, where partial failure is allowed. In many applications, the optimal maintenance actions for one component often depend on the states of the other components and system reliability requirements. Two new (τ, T) opportunistic maintenance models with the consideration of reliability requirements are proposed. In these two models, only minimal repairs are performed on failed components before time τ and the corrective maintenance (CM) of all failed components are combined with PM of all functioning but deteriorated components after τ; if the system survives to time T without perfect maintenance, it will be subject to PM at time T. Considering maintenance time, asymptotic system cost rate and availability are derived. The results obtained generalize and unify some previous research in this area. Application to aircraft engine maintenance is presented. © 2000 John Wiley & Sons;, Inc. Naval Research Logistics 47: 223–239, 2000     

用于DDR3访存优化的数据缓冲机制

为提高DDR3控制器访存效率,设计了基于DDR3存储器预取访问数据长度的数据缓冲机制,将访存请求分为三种基本类型并分别排队处理,降低数据丢弃和实际动态随机访问存储器访问发生次数。针对图像和视频类应用程序的实验结果表明,相对于传统先到先服务的DDR3访存控制器,该机制取得了平均21.3%、最好51.3%的性能提升,硬件开销在可接受范围内。