MEMS磁力线聚集和垂动调制磁场传感器

针对巨磁阻和磁隧道结等磁阻元件的1/f噪声,提出一种采用微机电系统的磁力线聚集和垂动调制磁场传感器。通过将被测磁场从低频转移到几kHz,实现对磁场的DC/AC转化,从而减小了磁阻元件的1/f噪声。基于该方案采用多层膜巨磁阻元件AA002制作了磁场传感器样品,并进行了实验测试,结果表明:磁传感器样品的调制效率达到了19.3%,超过了已有的其他各种调制方案,同时低频磁场的探测能力达到槡120pT/Hz,相比巨磁阻元件AA002提高了40多倍。     

基于变结构神经网络的L1自适应控制

针对传统模型参考自适应控制存在的鲁棒性问题和神经网络结构庞大因而计算量膨胀的问题,提出了一种变结构神经网络L1自适应控制方法,其中变结构神经网络用于在线辨识系统存在的未知非线性函数,该网络通过对节点进行唤醒与催眠以动态调节结构,以最少的节点数进行有效的逼近,降低计算复杂度;L1自适应控制用于网络权值学习与系统非线性补偿,反馈回路中设有一个低通滤波器,只要满足L1增益条件,就能确保系统的输入输出信号的瞬态响应和稳态跟踪性能与一个期望的线性时不变系统的响应保持一致。通过对四旋翼飞行器进行仿真,验证了该方法的有效性。     

灰色神经网络的鱼雷经济寿命预测

为减少军费开支、降低鱼雷全寿命费用,从经济性角度提出了鱼雷最佳服役年限模型。利用灰色等维新息GM(1,1)模型对鱼雷年度使用维修费用进行预测;采用分组的思想将原始数据分为多组,采用神经网络对灰色模型的预测残差进行修正,以提高预测精度。通过实际算例预测了鱼雷经济寿命,从而证明了模型的实际应用价值。     

对流层散射信道传递时间信号的抖动抑制模型

对流层散射信道传递时间同步信号过程中,信道的多径效应及噪声会引起信号抖动。为抑制抖动、提高时间同步精度,引入经验模态分解和小波阈值组合的抖动抑制模型。组合抖动抑制模型中,首先根据经验模态分解原理对原始信号进行分解,然后利用小波阈值对分解得到的各分量进行处理,最终利用处理结果重构信号。为提高组合模型的抖动抑制效果和原始信号的保持能力,利用连续性好、柔和度高的阈值函数对小波阈值中的传统阈值函数进行改进。利用实测数据验证模型的结果表明,在抖动抑制和信号保留方面,组合模型较单一模型以及常用的Kalman模型优势明显。     

两段探测目标的传感器任务调度问题0-1规划模型及算法

为解决指挥系统控制中的调度困难,研究了一类特殊的传感器资源调度问。主要分析了跟踪目标的探测次数、时间间隔和传感器资源等约束条件。用跟踪目标的重要程度之和作为目标函数,建立了一个0-1规划的数学模型,再利用变换将其转化为0-1线性整数规划模型。利用割平面法求解得出最优调度策略,其能在工作量饱和的情况下合理调度传感器资源。为提高求解速度,提出了对应的模拟退火算法。通过对一些不同规模实例的求解,在资源利用率和算法的求解速度等指标上,与割平面法及遗传算法进行对比分析,验证了模型的有效性和模拟退火算法求解的高效性。     

求解整数规划问题的一个搜索方法

本文整数规划问题给出一种搜索方法,它类似于求解连续变量优化问题的迭代方法,从一个好的初始可行解出发,寻找一个搜索方向,沿着这个方向求出改进的可行解,然后又开始下一次迭代。此方法简单易行,可以求出问题的最优解或近似最优解,对于整数线性规划问题和整数非线性规划问题的求解都适用,并且容易推广到求解大规校整数线性规划问题。文中附有计算例子,说明方法是有效的。     

Heuristics for the multi‐resource generalized assignment problem

The well‐known generalized assignment problem (GAP) involves the identification of a minimum‐cost assignment of tasks to agents when each agent is constrained by a resource in limited supply. The multi‐resource generalized assignment problem (MRGAP) is the generalization of the GAP in which there are a number of different potentially constraining resources associated with each agent. This paper explores heuristic procedures for the MRGAP. We first define a three‐phase heuristic which seeks to construct a feasible solution to MRGAP and then systematically attempts to improve the solution. We then propose a modification of the heuristic for the MRGAP defined previously by Gavish and Pirkul. The third procedure is a hybrid heuristic that combines the first two heuristics, thus capturing their relative strengths. We discuss extensive computational experience with the heuristics. The hybrid procedure is seen to be extremely effective in solving MRGAPs, generating feasible solutions to more than 99% of the test problems and consistently producing near‐optimal solutions. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48: 468–483, 2001     

基于Petri网的指挥控制系统仿真

指挥控制系统是一个具有分布、并发、异步等特性的复杂系统,Petri网是描述具有此类特征系统的有效工具.提出了基于Petri网的指挥控制系统仿真平台的具体设计方案.介绍了仿真平台的实现方法和程序的设计思路,实现了对普通Petri网、X1系统的建模,进行了功能和结构上的分析,并对分析结果的现实意义作了进一步的讨论.     

关于半鞅的可料表示性

利用鞅空间H1的泛函表示定理、泛函分析中的Hahn-Banach定理、半鞅向量随机积分的Girsanov定理,获得了半鞅可料表示性的特征。由于使用的是半鞅的向量随机积分,它推广了经典的结论。     

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