高分辨率UAV SAR的三维运动误差分离与补偿

在基于SAR回波的数据处理中,多普勒调频率具有很高的估计精度且对场景的依赖性很小,可以更广泛地用于自聚焦处理。基于多普勒调频率参数估计,针对回波包络及相位分别提出了误差提取模型,并通过包络误差校正和相位误差补偿两个步骤实现了高精度的运动补偿处理。实测数据表明,本文方法可以在低精度导航信息情况下获取高分辨率雷达图像。     

ISAR雷达欺骗式干扰信号生成算法

宽带ISAR雷达能够从目标回波中计算得出众多目标特征,对ISAR雷达的干扰信号必须高逼真地模拟目标的电磁散射特性和运动特性。从弹头目标电磁散射机理出发,分析了干扰信号生成流程,提出二维成像干扰的实现方案。针对虚假目标特性模拟问题,提出基于一维距离像模板合成欺骗干扰信号的算法。算法采用距离像模板与实际宽带ISAR信号的卷积调制处理,生成的干扰信号能较好地反映目标的电磁特性。通过多个脉冲的模拟,生成的干扰信号也能够准确反映目标的运动特性。仿真实验对暗室测量数据和HRRP模板数据进行成像效果对比,验证了算法的有效性。该算法对二维成像干扰机的工程设计具有指导意义。     

一种快速确定GPS整周模糊度的方法

GPS初始整周模糊度的求解是利用载波相位进行测量时的关键问题,采用了对系数矩阵进行QR分解的方法,用以降低矩阵的维数。模糊度搜索时,针对Z变换可能会引入多余误差,采用了对称三角分解法对协方差矩阵进行去相关处理。实验与仿真结果表明,定位误差在0.5 cm以内,方位角和仰角误差在0.1°以内。     

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     

Counterinsurgency American style: Considering David Petraeus and twenty-first century irregular war

This article examines the complex legacy of David Petraeus who was a key figure in the emergence of the US military shift towards counterinsurgency doctrine in the years after 2006. Although Petraeus has been perceived by critics as a publicity seeker, he can be credited with laying the foundations for a more serious commitment to COIN involving in particular in integrating conventional and Special Forces in arenas like village stability operations. The article looks a Petraeus's role in both Iraq and Afghanistan: it concludes that, in the case of Afghanistan, it is too early to assess whether counterinsurgency has had a decisive impact of the outcome of the war against the Taliban.     

基于旋量方法的高超声速飞行器三维非线性伪最优制导律设计

针对高超声速飞行器制导过程中的通道耦合问题,设计一种基于旋量方法的三维非线性伪最优制导律。引入角度矢量、视线旋量、视线旋量速度等概念,通过等价性证明,得出视线旋量、视线旋量速度控制分别与视线方位、视线角速度控制具有一致性的结论,从而将制导问题转化为视线旋量和旋量速度的控制问题;基于旋量方法构建弹目视线旋量、视线旋量速度模型,构建得到飞行器制导的三维非线性模型;为避免直接求解Riccati微分方程过程的复杂性,引入伪控制变量,将三维非线性制导模型转化为线性制导模型;分别针对无终端约束和有终端约束情况,基于二次型最优方法得到三维非线性伪最优制导律。该制导律避免了通道解耦,其制导参数又满足一定物理意义下的最优性。仿真结果验证了所设计制导律的有效性。     

考虑弹体动态特性的机动效率约束导引律

针对考虑交会角和过载约束导引律在大机动时能量损失大的问题,提出一种考虑导弹机动效率的多约束制导律。应用最优二次型原理推导出考虑一阶弹体延迟的时变导引系数闭环次优制导形式,将导弹机动时刻阻力系数引入时变权系数,并通过迭代确定机动效率约束边界。将时变约束表示成剩余时间与弹体延迟时间的函数,代入制导指令,进行弹道仿真。结果表明,对于常值与机动目标,文中制导律与过载约束导引律同只考虑交会角约束的导引律相比,对目标均能实现末端弹道成型要求,而考虑机动效率的制导指令分配更为合理,在避免指令加速度饱和的同时有效降低了拦截末端速度损耗,提高制导精度与毁伤效果。且该制导律中时变权系数无须配平求解,在保证精度的同时极大地提高了迭代速度。     

高效因特网密钥交换协议(IKE)的研究与实现

IKE协议是因特网安全协议IPSec的重要组件,它的高效实现是IPSec的关键所在。在分析了IKE协议的基础上,给出了一种设计结构,并进行了性能评价和分析。基于实时嵌入式操作系统VxWorks环境的测试表明这是一种高效的实现方案。     

弹道导弹滚动飞行稳定仿真

弹道导弹在助推段需要滚动突防,减少强激光照射的驻留时间,可以有效地对抗激光反导,但姿态稳定的实现则有很大的不同。利用经典控制理论和多变量频域理论设计了导弹的自动驾驶仪,仿真结果表明,对静不稳定导弹的一级助推段可以实现低滚速下的稳定飞行。     

A search game on a cyclic graph

There is a finite cyclic graph. The hider chooses one of all nodes except the specified one, and he hides an (immobile) object there. At the beginning the seeker is at the specified node. After the seeker chooses an ordering of the nodes except the specified one, he examines each nodes in that order until he finds the object, traveling along edges. It costs an amount when he moves from a node to an adjacent one and also when he checks a node. While the hider wishes to maximize the sum of the traveling costs and the examination costs which are required to find the object, the seeker wishes to minimize it. The problem is modeled as a two‐person zero‐sum game. We solve the game when unit costs (traveling cost + examination cost) have geometrical relations depending on nodes. Then we give properties of optimal strategies of both players. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004.