反坦克导弹的气动参数辨识

本文运用极大似然法进行激光驾束制导反坦克导弹气动参数的辨识。在辨识的迭代寻优过程中,采用变步长搜索提高辨识准度;在辨识算法的具体计算处理上,采用了模型分解法,大大减少了计算时间,保证了气动参数的辨识精度。同时给出辨识仿真验证结果.     

顾及噪声影响的GNSS高程序列预测Prophet方法

全球导航卫星系统(global navigation satellite system, GNSS)高程时间序列具有非平稳、非线性、含噪声等特点,在深入研究Prophet预测模型的基础上,针对Prophet预测模型对于趋势信号和周期信号有良好预测效果这一特性,提出一种引入经验模态分解(empirical mode decomposition, EMD)的“降噪—分解—预测”组合GNSS高程时间序列预测方法。该方法先将原始时间序列进行EMD降噪,再对降噪后的序列进行分解预测,最后重构各分量预测信号为最终预测序列。通过对实测高程数据进行研究,实验结果表明：降噪后信号的平均信噪比为10.30dB,能量百分比平均为88.75%;利用所构建的短期预测方法,GNSS高程时间序列预测结果的均方根误差分别平均提升26.41%和14.88%;平均百分比误差分别平均提升18.92%和7.91%,验证了组合预测方法的有效性及实用性。     

结合振动特征优选和GWOA-XGBoost的电机轴承故障诊断

为解决电机轴承故障状态难以识别,从而造成诊断精度不高的情况,提出了一种基于信号特征提取与极限梯度提升算法(extreme gradient boosting, XGBoost)结合的电机轴承故障诊断模型。使用优化的变分模态分解获得振动信号的固有模态函数(intrinsic mode function, IMF)分量,再基于多尺度熵理论计算各IMF分量的多尺度熵值进行特征重构。在鲸鱼优化算法(whale optimization algorithm, WOA)中引入遗传算法的选择、交叉、变异操作对WOA进行改进。用改进的WOA算法对XGBoost的超参数进行寻优,获得了帮助XGBoost取得最优分类效果的超参数组合,将7种不同故障类型的振动信号进行重构后输入优化的XGBoost模型进行故障诊断。实验结果表明,所提GWOA-XGBoost模型的电机轴承故障诊断精度能够达到97.14%,相较于传统诊断方法,性能提升效果显著。     

基于EMD和神经网络的气阀机构故障诊断研究

运用经验模态分解(EMD)对柴油机缸盖振动信号进行分析,求得各内禀模态函数(IMF)的能量百分比;将能量百分比作为神经网络的输入进行网络训练和故障识别,实现了气阀机构的故障诊断,取得了较好的效果。     

有向无环图决策支持向量机和经验模式分解在轴承故障诊断中的应用

当旋转机械发生故障时,其振动信号常常表现出较为复杂的调制形式,经验模式分解能根据信号的真实物理意义完成自适应分解。支持向量机由于其出色的学习性能和良好的推广能力,使其在包括故障诊断在内的众多领域得到较为广泛的应用。利用经验模式分解结果提取频带能量特征向量,采用有向无环图决策支持向量机实现对轴承状态的判别,并基于留一法优化支持向量机的模型参数。最终的应用结果表明,基于EMD和有向无环图决策支持向量机方法可以有效实现对轴承的状态判别。     

流域变换的串行与并行策略研究

流域变换是数字形态学中用于图像分割的一种经典方法,其并行化问题成为近年来研究的重点。首先给出了流域变换的数学模型,并归纳列举了几种离散情况下的形式化定义;其次分类总结了近年来流域变换串行算法研究的新进展,从而在此基础上重点讨论了相应的并行化策略。详细分析了设计并行流域算法需要考虑的几个问题;并比较评价了现有并行算法的性能特点,得出了一些结论;最后提出了有待进一步研究的问题。     

A multi‐stage stochastic programming approach for network capacity expansion with multiple sources of capacity

In networks, there are often more than one sources of capacity. The capacities can be permanently or temporarily owned by the decision maker. Depending on the nature of sources, we identify the permanent capacity, spot market capacity, and contract capacity. We use a scenario tree to model the uncertainty, and build a multi‐stage stochastic integer program that can incorporate multiple sources and multiple types of capacities in a general network. We propose two solution methodologies for the problem. Firstly, we design an asymptotically convergent approximation algorithm. Secondly, we design a cutting plane algorithm based on Benders decomposition to find tight bounds for the problem. The numerical experiments show superb performance of the proposed algorithms compared with commercial software. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 600–614, 2017     

Military expenditure and income distribution in South Korea

This paper attempts to investigate the long-run and the causal relationship between military expenditure and income distribution in South Korea for the period 1965–2011. Applying the bounds test approach to cointegration, we found a long-run relationship between military expenditure and the Gini coefficient with military expenditure having a positive and a statistically significant impact on income inequality. A 1% rise in military expenditure increased the Gini coefficient by 0.38%. Application of the lag-augmented causality test also reveals a unidirectional causality running from military expenditure to income inequality. The evidence seems to suggest that devoting more resources to the military sector may further worsen income inequality in South Korea.     

面向癫痫脑电的简化深度学习模型

针对脑电信号随机性强、动态变化迅速等特点,提出了一种简化深度学习模型研究癫痫脑电识别问题。提出的模型以一维卷积神经网络为基础,在结构方面简化了卷积层、池化层等以提高模型效率,在整体框架方面应用了Keras框架,在训练优化算法方面采用RMSProp算法作为模型优化算法,通过预定义的目标函数来进行损失估计,模型设计上加入了批标准化层和全局均值池化层。基于所提模型,从三个方面研究了癫痫脑电识别问题,即:利用经验模态分解,分别选取前三阶、前五阶、前七阶、前八阶的本征模态函数分量,在简化模型上进行对比分析;利用提出模型所具备的深度学习特点,直接识别原始脑电信号而无须特征提取环节;增加了三种不同方法分别提取7类特征,对相同的脑电数据进行对比分析。性能分析结果表明:对于五类不同的脑电信号,前三阶的本征模态函数分量的识别率达到92.1%,比其他几种处理方式识别率高;前八阶的本征模态分量识别率不及原始信号,表明人工数据处理时会给数据带来噪声; 所提出的简化深度学习模型能高效处理癫痫脑电识别问题,具备较高效率和较好性能。     

An integer decomposition algorithm for solving a two‐stage facility location problem with second‐stage activation costs

We study a stochastic scenario‐based facility location problem arising in situations when facilities must first be located, then activated in a particular scenario before they can be used to satisfy scenario demands. Unlike typical facility location problems, fixed charges arise in the initial location of the facilities, and then in the activation of located facilities. The first‐stage variables in our problem are the traditional binary facility‐location variables, whereas the second‐stage variables involve a mix of binary facility‐activation variables and continuous flow variables. Benders decomposition is not applicable for these problems due to the presence of the second‐stage integer activation variables. Instead, we derive cutting planes tailored to the problem under investigation from recourse solution data. These cutting planes are derived by solving a series of specialized shortest path problems based on a modified residual graph from the recourse solution, and are tighter than the general cuts established by Laporte and Louveaux for two‐stage binary programming problems. We demonstrate the computational efficacy of our approach on a variety of randomly generated test problems. © 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010