基于主成分的改进马氏距离TOPSIS方法

针对指标变量线性相关,导致变量协方差矩阵行列式(广义样本方差)为零无法应用马氏距离的情况,采用主成分分析法对指标变量进行线性组合,在不减少信息量的同时,得到少数几个不相关的主成分,由主成分构成的协方差矩阵行列式不再为零。依据降维后的主成分变量,采用基于马氏距离的逼近理想解法对五种预警机探测引导能力进行了排序,经检验其结果与实际情况相符。     

基于差分进化算法的铁磁物体磁化率优化方法

针对工程中铁磁物体磁化率难以确定的问题,以单元表面积分铁磁物体感应磁场模型为基础,利用磁场测量值建立了多维磁化率数学优化模型,并运用具有全局多维寻优能力的进化差分算法对多维磁化率数学模型进行了求解,进而确定了铁磁物体的感应磁场分布。最后,设计了空心圆筒磁测实验,实验结果表明:该方法能有效获取铁磁物质多维磁化率,还能精确计算铁磁物体的感应磁场分布。     

自适应控制中的Hartley块算法及实验

针对小波包自适应控制子频带内包含大量卷积和相关运算导致算法收敛速度慢的问题,提出基于Hartley块的小波包滤波最小均方算法。将快速Hartley变换引入块算法,实现频域内快速卷积和相关运算;在子频带内应用Hartley块算法生成控制信号,通过重叠保留法提出基于Hartley块的小波包滤波最小均方算法;通过仿真和实验研究了定频和扫频两种工况下的隔振性能和控制效果。结果表明,基于Hartley块的小波包滤波最小均方算法不仅可以大幅缩短收敛时间,还能显著提高控制精度,且鲁棒性和稳定性良好,能够很好地应用在工程实际中。     

有限维修能力下多级保障系统装备时变可用度评估及保障方案优化

备件库存和站点维修能力是影响备件维修周转的重要因素,制约着装备的使用效果。针对备件需求随任务阶段动态变化时装备保障方案的评估和优化问题,考虑站点维修能力对备件维修过程的影响,结合METRIC建模方法和动态排队理论,建立了有限维修能力下多级保障系统装备时变可用度评估模型。在评估模型基础之上,以保障费用为优化目标、装备可用度为约束条件,建立任务期内多级保障系统保障方案优化模型。以任务期内的最低可用度所对应的备件短缺数为观测值,分析各项资源的边际效益值,采用边际优化算法对各项资源进行优化计算。算例分析表明,评估模型能够计算多级保障系统任务期内各阶段装备可用度;保障方案优化模型和方法能够得到各项保障资源的优化配置方案。提出的模型和优化方法能够为装备保障人员制订合理的保障方案提供决策支持。     

基于T-S模型的非线性系统主从控制器设计

针对同时具有输出和输入非线性的系统,通过中间虚拟控制量的设置,转化为两个非线性子系统的串联,从而简化系统结构并解决最终控制量不宜直接获取的问题。针对无人水面艇的航迹和横摇控制,设计了基于反演控制的从控制器,实现了输入非线性中虚拟控制量到舵角的映射,通过T-S模型将输出非线性系统,转化为线性时变系统,并考虑舵机的角度与角速度约束,设计了广义预测主控制器。该方法不仅简化了系统结构,同时仿真结果表明,所设计的主从控制器可以获得较好的控制效果。     

线性调频连续波雷达低空小目标长时间相参积累方法

针对小型无人机目标雷达回波弱、目标检测难的问题,研究了在线性调频连续波(linear frequency modulation continuous wave, LFMCW)体制雷达下的长时间相参积累方法。通过推导LFMCW雷达回波表达式,提出了基于时域差频信号线性调频-Z变换的拉东-傅里叶变换实现方法。评估了该方法的运算量,并与频域实现的方法进行对比。经过仿真和实测数据验证了本文算法对LFMCW雷达下的弱目标相参积累的有效性。     

飞机电磁弹射系统发展及其关键技术

总结论述了美国和英法国家的飞机电磁弹系统工程化应用研制的发展状况,综述了电磁弹射用直线电机的方案选型设计、仿真技术、性能优化和控制方法等方面的关键技术和研究现状,针对电磁弹射技术的发展前景和应用给出了相关建议,为国内电磁弹射相关技术的发展提供了借鉴。     

侧贴碳纤维布加固连续梁非线性有限元分析

为研究不同初始荷载作用下侧贴碳纤维布及侧贴预应力碳纤维布加固钢筋混凝土连续梁的加固效果,采用有限元分析软件ABAQUS对其进行数值模拟,并将有限元分析结果与试验结果对比。有限元分析表明：钢筋混凝土连续梁的加固效果受初始荷载的影响,初始荷载越小,加固效果越好;对纵向侧贴碳纤维布施加预应力,能够大幅提高钢筋混凝土连续梁的抗弯承载力,与未加固梁相比其抗弯承载力提高了65%以上;有限元计算结果与试验结果的荷载-挠度曲线吻合较好,两者的抗弯承载力相差不超过10%。所得结果可以为类似加固设计和试验提供参考。     

A novel gradient approach for optimal design and sensitivity analysis of EWMA control charts

Conventional control charts are often designed to optimize out‐of‐control average run length (ARL), while constraining in‐control ARL to a desired value. The widely employed grid search approach in statistical process control (SPC) is time‐consuming with unsatisfactory accuracy. Although the simulation‐based ARL gradient estimators proposed by Fu and Hu [Manag Sci 45 (1999), 395–413] can alleviate this issue, it still requires a large number of simulation runs to significantly reduce the variance of gradient estimators. This article proposes a novel ARL gradient estimation approach based on integral equation for efficient analysis and design of control charts. Although this article compares with the results of Fu and Hu [Manag Sci 45 (1999), 395–413] based on the exponentially weighted moving average (EWMA) control chart, the proposed approach has wide applicability as it can generally fit into any control chart with Markovian property under any distributions. It is shown that the proposed method is able to provide a fast, accurate, and easy‐to‐implement algorithm for the design and analysis of EWMA charts, as compared to the simulation‐based gradient estimation method. Moreover, the proposed gradient estimation method facilitates the computation of high‐order derivatives that are valuable in sensitivity analysis. The code is written in Matlab, which is available on request. © 2014 Wiley Periodicals, Inc. Naval Research Logistics 61: 223–237, 2014     

A branch‐and‐price approach for the stochastic generalized assignment problem

In this article, we address a stochastic generalized assignment machine scheduling problem in which the processing times of jobs are assumed to be random variables. We develop a branch‐and‐price (B&P) approach for solving this problem wherein the pricing problem is separable with respect to each machine, and has the structure of a multidimensional knapsack problem. In addition, we explore two other extensions of this method—one that utilizes a dual‐stabilization technique and another that incorporates an advanced‐start procedure to obtain an initial feasible solution. We compare the performance of these methods with that of the branch‐and‐cut (B&C) method within CPLEX. Our results show that all B&P‐based approaches perform better than the B&C method, with the best performance obtained for the B&P procedure that includes both the extensions aforementioned. We also utilize a Monte Carlo method within the B&P scheme, which affords the use of a small subset of scenarios at a time to estimate the “true” optimal objective function value. Our experimental investigation reveals that this approach readily yields solutions lying within 5% of optimality, while providing more than a 10‐fold savings in CPU times in comparison with the best of the other proposed B&P procedures. © 2014 Wiley Periodicals, Inc. Naval Research Logistics 61: 131–143, 2014