抗辐照MRAM研究进展

针对传统分块方法根据经验划分子块导致变量特征信息无法充分利用,其单一的建模方式忽略局部信息以及离线模型无法适应时变特性的问题,提出了一种KL (Kullback-Leibler) 散度多模块滑动窗口慢特征分析方法。在正常工况数据集中,利用KL散度来度量变量间的距离,同时引入最小误差平方和准则进行聚类,分成两个距离最小的子模块;在此基础上利用慢特征分析方法对每个子模块进行建模,结合滑动窗口对每次采样的数据进行更新,得到最优模型,分别计算监测统计信息,利用支持向量数据描述对故障监测结果进行融合,实现故障诊断。并将该方法应用于田纳西伊斯曼过程的监控中,得到了较高的故障检测率和较低的虚警率,验证了该方法的可行性和有效性。     

基于DSP的运动目标检测算法优化

本文针对视频图像运动目标检测算法数据量多、处理速度慢的缺点,提出了对运动目标检测算法的优化方法,使用基于TMS320C64X系列DSP的程序优化方法对运动目标检测代码进行优化,采用了编译器选项、内联函数与宏定义、查找表、软件流水等优化方法,最后综合分析了相关优化方法对于时间性能的改进情况,实验结果证明了优化方法的有效性。     

Monitoring poisson count data with probability control limits when sample sizes are time varying

This article considers the problem of monitoring Poisson count data when sample sizes are time varying without assuming a priori knowledge of sample sizes. Traditional control charts, whose control limits are often determined before the control charts are activated, are constructed based on perfect knowledge of sample sizes. In practice, however, future sample sizes are often unknown. Making an inappropriate assumption of the distribution function could lead to unexpected performance of the control charts, for example, excessive false alarms in the early runs of the control charts, which would in turn hurt an operator's confidence in valid alarms. To overcome this problem, we propose the use of probability control limits, which are determined based on the realization of sample sizes online. The conditional probability that the charting statistic exceeds the control limit at present given that there has not been a single alarm before can be guaranteed to meet a specified false alarm rate. Simulation studies show that our proposed control chart is able to deliver satisfactory run length performance for any time‐varying sample sizes. The idea presented in this article can be applied to any effective control charts such as the exponentially weighted moving average or cumulative sum chart. © 2013 Wiley Periodicals, Inc. Naval Research Logistics 60: 625–636, 2013     

变质心再入飞行器自抗扰控制器设计(英文)

再入飞行器采用变质心控制不但可以保持较好的气动外形,还町以增大机动能力,但变质心控制较强的非线性和耦合性大大增加了控制系统设计难度,使控制器设计和实施的代价较高。针对这一问题,基于自抗扰控制技术,设计了变质心再入飞行器双通道解耦控制器。通过构造连续光滑扩张状态观测器,不加区分飞行器的各类干扰与耦合,对其统一进行估计:利用非线性状态反馈控制律,并自适应调节控制参数对其进行补偿,实现对飞行器姿态的解耦控制。仿真结果表明:该方法大大降低了对系统模型精度的要求与控制器设计实施代价,对变质心再入飞行器非线性、耦合性以及参数摄动具有较强的鲁棒性。     

发动机运动件质量对燃油消耗率影响的分析

发展了一个发动机运动件质量对燃油消耗率影响的分析公式,进行了实例计算。在发动机设计阶段和发动机实际使用中,可以应用这个公式,估计运动件质量变化所引起的比油耗的相对变化。     

平面杆系结构内力包络图仿真优化与编程

讨论受任意集中力、集中力偶和线性分布力等复杂移动荷载作用下的平面杆系结构内力包络图仿真优化技术。借助平面杆系结构分析软件Vsap2011,分析了单元截面离散方式和荷载移动步长对内力包络图求解精度的影响。研究表明:为了获得较高的内力包络图求解精度,对于移动荷载经过的单元,截面必须按步细分;对于活载任意布置的单元,截面必须在荷载作用点之间再插入足够多的分点;对于不受荷载的单元,两端刚结的必须按距离细分,而含有一个以上铰结点的不必细分。此外,在步长接近或相差不大的情况下,如果步长既能整除荷载队列的间距,又能整除载荷载通过单元的长度,那么就可以提高内力包络图的求解精度。如果将单元长度和荷载队列间距的最大公约数作为步长,既可获得较高的内力包络图求解精度,又可大大节省计算机时。     

基于视频的运动目标检测算法的比较与分析

帧差法和背景差分法是目前常用的基于视频的运动目标检测方法。首先从帧差法和背景差分法中选取了几种具有代表性的算法;然后针对典型场景条件对这些方法进行了实验测试,并利用实验结果对算法进行了定性和定量的比较和分析。实验结果表明,ViBe算法、码本模型、混合高斯模型、自适应混合高斯模型、中值滤波和自适应背景建模具有较好的检测效果,但任何一种方法都有其局限性。     

基于一维距离像的导弹目标运动特征提取方法

根据导弹目标运动方式及其回波特点,提出了一种基于一维距离像的运动目标特征提取方法。在对回波进行全去斜率处理后获得目标一维像。通过观测一维像序列的长度变化周期,提取目标的章动频率;根据距离像在成像窗口中的位置,获取雷达和目标的径向距离;利用相邻距离像相关方法,获取距离像平移位置,从而推出雷达—目标的径向速度。进行了相应的仿真实验,结果表明了该方法的有效性。     

H_∞滤波混合优化RBF在SINS动基座传递对准中的应用

为解决SINS动基座传递对准的快速精确问题,将混合优化的RBF神经网络应用于此。首先运用递阶遗传算法优化RBF神经网络的拓扑结构,并对网络其余参数进行全局粗调;在此基础上运用H∞滤波算法对网络其余参数进行在线自适应精调。其计算机仿真结果与扩展卡尔曼滤波比较表明:该算法在精度、实时性方面与扩展卡尔曼滤波相比提高了将近50%。     

Optimal search for a moving target with the option to wait

We investigate the problem in which an agent has to find an object that moves between two locations according to a discrete Markov process (Pollock, Operat Res 18 (1970) 883–903). At every period, the agent has three options: searching left, searching right, and waiting. We assume that waiting is costless whereas searching is costly. Moreover, when the agent searches the location that contains the object, he finds it with probability 1 (i.e. there is no overlooking). Waiting can be useful because it could induce a more favorable probability distribution over the two locations next period. We find an essentially unique (nearly) optimal strategy, and prove that it is characterized by two thresholds (as conjectured by Weber, J Appl Probab 23 (1986) 708–717). We show, moreover, that it can never be optimal to search the location with the lower probability of containing the object. The latter result is far from obvious and is in clear contrast with the example in Ross (1983) for the model without waiting. © 2009 Wiley Periodicals, Inc. Naval Research Logistics 2009