AHP和三角白化权函数的武器装备研制技术风险评估

提出了武器装备技术风险的评价体系,采用层次分析法给出了各指标对技术风险的权重;阐述了基于三角白化权函数的灰色理论,建立了武器装备研制项目技术风险的评估模型,详细给出了技术风险评估的过程和步骤。最后,结合一个航空项目实例说明了该方法的适用性和有效性。     

基于区间直觉模糊集的目标优先级求解方法

针对复杂防空作战环境下多目标优先级难以准确评估的问题,提出了基于区间直觉模糊集理论的目标优先级求解算法。首先系统分析了影响目标优先级的因素以及各影响因素与目标优先级之间的非线性关系。其次,对区间直觉模糊集的得分函数和精确函数进行了改进,考虑了犹豫度信息对决策结果的影响,并且提出了基于得分函数和精确函数的目标优先级求解算法。最后通过仿真算例验证了算法的有效性。     

对流层散射下MPLS重路由信号去噪研究

针对对流层散射信道MPLS重路由信号数据含有噪声的问题,分析了Facility重路由原理和MPLS标签转发过程,引入小波阈值去噪算法对含噪声标签信号数据进行处理。利用一种随分解层数变化的阈值和折中阈值函数规则,来解决传统算法中的阈值确定和阈值函数选取存在的问题,针对折中阈值函数规则中参数a的确定问题,利用模拟数据,以信噪比(SNR)为目标函数,采用定步长变a形式,从而得到去噪效果最好时对应的a值,并用实测数据加以验证。仿真结果表明,改进后的算法在信噪比上有1.5 d B~3.4 d B的提高,均方差(RMSE)下降约0.01~0.03,为路由修复信号的去噪提供一种可行的方案。     

大容量数据下基于DTN的链路中断优化传输技术

激光或GHz以上的高频链路的应用将导致DTN(Delay Tolerant Network)网络链路数据容量的增大,大容量数据链路的间歇性中断将严重影响数据的传输效率。针对DTN网络中大容量数据链路频繁中断和节点的剩余缓存空间剧烈变化的问题,提出在DTN路由算法上增加拥塞状态预测机制和易中断链路判定机制,根据节点的拥塞程度定义惩罚函数,缓解链路中断和节点资源受限导致的拥塞。仿真结果表明,该机制可以有效提高DTN网络的传输性能。     

基于通用扩张状态观测器的鲁棒飞行控制方法

针对参数不确定、外界干扰与测量噪声情况下飞行控制问题,提出一种基于通用扩张状态观测器的鲁棒飞行控制方法。基于状态相关的Riccati方程控制方法对飞行器俯仰通道非线性模型进行扩展线性化;引入基于通用扩张状态观测器的控制方法,设计干扰补偿增益,实现对外界干扰的估计与补偿;通过在线解算状态相关矩阵及代数黎卡提方程,得出状态反馈增益与干扰补偿增益,实现对飞行器期望攻角的跟踪控制。与已有方法对比表明,所提方法不仅对系统模型不确定性与外界干扰具有较强的鲁棒性,而且在较大测量噪声情况下,其依然能够保证良好的跟踪控制效果,具有较强的工程应用价值。     

基于子阵结构的相控阵MIMO雷达分辨能力分析

在阵元总数一定的情况下,不同的子阵划分方式和布阵间距对不同子阵发射正交波形,子阵内发射相干波形的相控阵-MIMO雷达系统的分辨力的影响,首先通过相控阵-MIMO雷达的信号模型推导出其广义模糊函数,然后以此分析子阵结构对距离、多普勒、方位三维分辨力的影响。仿真结果表明,在阵元总数一定的情况下,子阵越多,系统距离分辨力越高,子阵越大,多普勒分辨力越高,子阵间距满足一定条件才能有较好的系统分辨力。这些结论对相控阵-MIMO雷达子阵结构设计具有指导意义。     

永磁无刷直流电机调速系统的改进型IMC-PI控制

针对永磁无刷直流电机调速系统提出了一种改进的内模PI(Internal model control PI,IMC-PI)控制方法。根据内模控制原理设计出PI控制器,引入一种作用函数,将其与PI控制器串联构成改进的IMC-PI控制器。作用函数为偏差的微分表达式,其阶次的选择应保证系统开环传递函数严格真实。改进IMC-PI控制可使系统的调节过程分为作用函数趋近零和保持为零的两个阶段,从而保证系统偏差按照作用函数等于零确定的轨迹趋近于零。仿真和实验结果表明方法可有效提高控制系统的性能。     

Convolutions and generalization of logconcavity: Implications and applications

Additive convolution of unimodal and α‐unimodal random variables are known as an old classic problem which has attracted the attention of many authors in theory and applied fields. Another type of convolution, called multiplicative convolution, is rather younger. In this article, we first focus on this newer concept and obtain several useful results in which the most important ones is that if is logconcave then so are and for some suitable increasing functions ?. This result contains and as two more important special cases. Furthermore, one table including more applied distributions comparing logconcavity of f(x) and and two comprehensive implications charts are provided. Then, these fundamental results are applied to aging properties, existence of moments and several kinds of ordered random variables. Multiplicative strong unimodality in the discrete case is also introduced and its properties are investigated. In the second part of the article, some refinements are made for additive convolutions. A remaining open problem is completed and a conjecture concerning convolution of discrete α‐unimodal distributions is settled. Then, we shall show that an existing result regarding convolution of symmetric discrete unimodal distributions is not correct and an easy alternative proof is presented. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 109–123, 2016     

An integral equation for the second moment function of a geometric process and its numerical solution

In this article, an integral equation satisfied by the second moment function M₂(t) of a geometric process is obtained. The numerical method based on the trapezoidal integration rule proposed by Tang and Lam for the geometric function M(t) is adapted to solve this integral equation. To illustrate the numerical method, the first interarrival time is assumed to be one of four common lifetime distributions, namely, exponential, gamma, Weibull, and lognormal. In addition to this method, a power series expansion is derived using the integral equation for the second moment function M₂(t), when the first interarrival time has an exponential distribution.     

拦截弹推进及弹道参数的模糊优化研究

在拦截弹推进系统和弹道参数的设计中 ,引入多目标多约束的模糊优化方法 ,在约束条件一定的情况下 ,合理选择和分配几个重要的设计变量 ,使得拦截弹的总质量最小、拦截时间最短。