参数化时频分析的匀加速旋转目标ISAR成像

对于机动目标,运动补偿后目标相对于雷达的转动不能近似为匀速转动,而是更接近于匀加速转动,此时传统的距离多普勒成像算法不能得到很好的成像结果.分析总结了几种针对非匀速转动的时频联合分析算法,提出了一种基于参数化时频分析-AGCD快速算法的匀加速旋转目标成像算法,仿真表明了该算法具有精度高、速度快且无交叉项的优点,比原有的一些算法有较大的改进.     

Optimal set partitioning,matchings and lagrangian duality

We formulate the set partitioning problem as a matching problem with simple side constraints. As a result we obtain a Lagrangian relaxation of the set partitioning problem in which the primal problem is a matching problem. To solve the Lagrangian dual we must solve a sequence of matching problems each with different edge-weights. We use the cyclic coordinate method to iterate the multipliers, which implies that successive matching problems differ in only two edge-weights. This enables us to use sensitivity analysis to modify one optimal matching to obtain the next one. We give theoretical and empirical comparisons of these dual bounds with the conventional linear programming ones.     

Many‐player rendezvous search: Stick together or split and meet?

Rendezvous search finds the strategies that players should use in order to find one another when they are separated in a region. Previous papers have concentrated on the case where there are two players searching for one another. This paper looks at the problem when there are more than two players and concentrates on what they should do if some but not all of them meet together. It looks at two strategies—the stick together one and the split up and meet again one. This paper shows that the former is optimal among the class of strategies which require no memory and are stationary, and it gives a method of calculating the expected rendezvous time under it. However, simulation results comparing both strategies suggest that in most situations the split up and meet again strategy which requires some memory leads to faster expected rendezvous times. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48:710–721, 2001     

基于FFT的自适应频率估计算法

为了解决FFT算法中因能量泄露和栅栏效应而导致的算法估计性能下降的问题,提出了一种基于FFT的自适应频率估计算法.分析了Rife算法,指出当信号频率位于量化频率附近时,由于插值方向错误,会导致频率估计性能下降;对于分段FFT相位差频率估计算法,当2段信号最大谱线处对应的相位相差比较大时,容易产生相位模糊,从而增大估计误差.基于FFT的自适应频率估计算法将2种算法进行了综合,既保留了2种算法的优点,又对算法性能有所改进.仿真结果表明:该算法的估计精度、稳定性和抗噪能力都有显著提高.     

An exact aggregation/disaggregation algorithm for large scale markov chains

Many Markov chain models have very large state spaces, making the computation of stationary probabilities very difficult. Often the structure and numerical properties of the Markov chain allows for more efficient computation through state aggregation and disaggregation. In this article we develop an efficient exact single pass aggregation/disaggregation algorithm which exploits structural properties of large finite irreducible mandatory set decomposable Markov chains. The required property of being of mandatory set decomposable structure is a generalization of several other Markov chain structures for which exact aggregation/disaggregation algorithms exist. © 1995 John Wiley & Sons, Inc.