雷达干扰资源一对多分配方法

在对雷达干扰资源分配的一般优化模型和求解算法进行分析的基础上,从提高资源利用效率的角度出发,提出了目标雷达分群思想,并建立了一种新的基于一对多策略的雷达干扰资源分配模型,通过对目标雷达群的一对一分配实现对单部雷达的一对多分配.最后,对该模型中一些关键性问题进行了探讨,如任务整合、新任务参数确定、任务优先级排序、干扰机位置部署以及单目标雷达群干扰效益评估等.     

基于干涉仪测向的电子侦察卫星单星定位精度分析

针对信息化战场面临的复杂电磁环境,研究基于二维干涉仪测向方法的电子侦察卫星单星定位体制。分析了电子侦察卫星单星定位原理及定位算法,提出了电子侦察卫星单星测向定位精度GDOP算法,通过仿真定量计算卫星测角误差、卫星姿态误差和卫星位置误差对卫星定位精度的影响程度。结果表明电子侦察卫星测角精度、姿态控制精度和位置测量精度越高,单星定位精度越高。     

基于改进平方根UKF双向滤波的单站无源定位算法

针对单站无源定位可观测性弱、观测噪声大而导致的定位精度低、稳定性差和收敛速度慢等问题,在结合平方根无迹卡尔曼滤波(Square-Root Unscented Kalman Filter,SRUKF)以及后向平滑思想的基础上,提出了一种改进SRUKF的双向滤波算法。该算法采用Q-R分解的形式,使用误差协方差的平方根代替协方差参与递推运算,提高了算法的稳定性与运算效率。同时,该算法对状态向量进行扩维,将过程噪声与观测噪声通过非线性系统传播,降低了噪声对滤波精度的影响,并利用当前时刻滤波结果通过Rauch-Tung-Striebel(RTS)后向平滑得到再次前向滤波更高精度的起始值,提高了算法的定位精度与收敛速度。仿真结果表明,新算法在保证实时性的基础上改善了单站无源定位的性能。     

对雷达的全极化欺骗干扰技术研究

分析了3种针对单极化假目标的鉴别算法，针对单极化干扰的缺陷，提出并分析了一种干扰极化测量雷达的新技术——全极化干扰，介绍了全极化干扰技术的工作原理，并详细分析了全极化干扰机关键部件的设计。     

虚拟环境中坦克射击训练仿真系统

在作战仿真系统中,坦克是一种重要的武器仿真实体,其火力模拟常成为研究的重点.结合科研实践,采用计算机仿真技术和部分坦克实装相结合的方式,对坦克炮长在虚拟环境中的射击训练进行仿真,着重从系统设计原理、系统软件和硬件的设计与实现等方面进行系列研究.实践证明,单片机技术和汇编编程的组合运用,不仅使系统数据的采集和传输更加实时准确,而且大大提高了系统的效能比,取得较高的军事效益和经济效益.     

基于PIC系列单片机的迫弹电子时间引信控制系统设计

介绍了迫弹电子时间引信控制系统的电路组成、工作原理及其功能,并以PIC16F873A型单片机作为控制器核心,对引信的工作过程进行控制,提高了引信的安全性和可靠性。     

Demand forecasting by temporal aggregation

Demand forecasting performance is subject to the uncertainty underlying the time series an organization is dealing with. There are many approaches that may be used to reduce uncertainty and thus to improve forecasting performance. One intuitively appealing such approach is to aggregate demand in lower‐frequency “time buckets.” The approach under concern is termed to as temporal aggregation, and in this article, we investigate its impact on forecasting performance. We assume that the nonaggregated demand follows either a moving average process of order one or a first‐order autoregressive process and a single exponential smoothing (SES) procedure is used to forecast demand. These demand processes are often encountered in practice and SES is one of the standard estimators used in industry. Theoretical mean‐squared error expressions are derived for the aggregated and nonaggregated demand to contrast the relevant forecasting performances. The theoretical analysis is supported by an extensive numerical investigation and experimentation with an empirical dataset. The results indicate that performance improvements achieved through the aggregation approach are a function of the aggregation level, the smoothing constant, and the process parameters. Valuable insights are offered to practitioners and the article closes with an agenda for further research in this area. © 2013 Wiley Periodicals, Inc. Naval Research Logistics 60: 479–498, 2013     

Halo轨道的航天器编队构型设计

针对不同干涉基线约束下的最优Halo轨道编队构型设计方法展开研究。以Richardson关于Halo轨道的三阶近似解析解为基础建立同一轨道上两航天器编队的相对运动学模型;以平动点为质心的旋转坐标系为基准构造与编队主航天器和观测目标相关的旋转坐标系,并在此坐标系中给出不同于二体问题的干涉基线计算方法;以满足基线约束下观测时间最长为目标给出最优编队构型设计方法。最后,以绕日-地L2点的Halo轨道为例对上述编队构型设计方法的有效性进行了仿真验证。     

面向大型机构的统一身份管理方法

通过借鉴自由联盟组织提出的Liberty框架,并针对该框架的结构以及身份提供者之间信任关系的建立模式进行改造,提出一种面向大型机构的新型身份管理联盟。新型的身份管理联盟比Liberty框架更加适用于具有分布性、自治性、全局性和协同性的大型机构。新型的身份管理联盟在物理结构上可看作由多个身份提供者节点组成的一棵树,其中每个身份提供者节点必须并且只能与其父节点和子节点建立信任关系,这与现实中各个大型机构的树状层级结构是完全相符的。在系统实现过程中,依托新型身份管理联盟的树状结构,并采用LDAP实现了用户认证数据的分级存储。此外还通过安全认证网关在网络层对用户的接入进行控制,从而能够同时支持B/S和C/S两类应用系统的单点登录。     

Single machine just‐in‐time scheduling problems with two competing agents

In scheduling problems with two competing agents, each one of the agents has his own set of jobs to be processed and his own objective function, and both share a common processor. In the single‐machine problem studied in this article, the goal is to find a joint schedule that minimizes the total deviation of the job completion times of the first agent from a common due‐date, subject to an upper bound on the maximum deviation of job completion times of the second agent. The problem is shown to be NP‐hard even for a nonrestrictive due‐date, and a pseudopolynomial dynamic program is introduced and tested numerically. For the case of a restrictive due‐date (a sufficiently small due‐date that may restrict the number of early jobs), a faster pseudopolynomial dynamic program is presented. We also study the multiagent case, which is proved to be strongly NP‐hard. A simple heuristic for this case is introduced, which is tested numerically against a lower bound, obtained by extending the dynamic programming algorithm. © 2013 Wiley Periodicals, Inc. Naval Research Logistics 61: 1–16, 2014