机动目标一维距离像RAT法线性化补偿

研究了机动目标宽带线性调频脉冲回波全去斜率信号模型,根据速度和加速度的调频频谱展宽特点,提出了机动目标宽带一维距离像线性化调频回波模型,给出了Radon模糊图转换(RAT)法线性参数估计与运动补偿方法,并进一步分析了测速和测距误差.仿真实验验证了RAT法一维距离像线性化参数估计与补偿,表明该方法很好地解决了运动参数未知情况下机动目标的一维距离像频谱展宽问题.     

A partial characterization of the optimal ordering/rationing policy for a periodic review system with two demand classes and backordering

We consider a finite horizon periodic review, single product inventory system with a fixed setup cost and two stochastic demand classes that differ in their backordering costs. In each period, one must decide whether and how much to order, and how much demand of the lower class should be satisfied. We show that the optimal ordering policy can be characterized as a state dependent (s,S) policy, and the rationing structure is partially obtained based on the subconvexity of the cost function. We then propose a simple heuristic rationing policy, which is easy to implement and close to optimal for intensive numerical examples. We further study the case when the first demand class is deterministic and must be satisfied immediately. We show the optimality of the state dependent (s,S) ordering policy, and obtain additional rationing structural properties. Based on these properties, the optimal ordering and rationing policy for any state can be generated by finding the optimal policy of only a finite set of states, and for each state in this set, the optimal policy is obtained simply by choosing a policy from at most two alternatives. An efficient algorithm is then proposed. © 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010     

基于无线双工通信系统分组数据传输的探讨

分析了军用无线双工通信系统数据传输资源,指出了存在的问题及改进办法;利用话音、报文、传真、数据电路交换信令的工作模式标示,提出了基于无线双工通信系统的数据传输TCP/IP结构体系及协议栈,并探讨了网络适配和实现与军用公共数据网、地域通信网（电路交换网、分组交换网）、数字化部队单工无线电数据网互联的关键技术。     

飞机反区速度矢量不稳定及其控制的机理

在信号流图的基础上,提出多回路分析的方法,并用于研究反区时速度矢量不稳定及其稳定控制的机理。建立了纵向动力学的信号流图,并证明了一个回路的收敛性定理。在此基础上,通过理论分析得出了速度矢量不稳定在不同层面上的原因,也得出了速度和轨迹的发散度表达式等,并表明阻力-速度曲线、轨迹角-速度曲线、极曲线、阻力系数曲线等存在相互对应的反区和正区,并且阻力-速度曲线和轨迹角-速度曲线在斜率上成比例。研究得出进场动力补偿系统下速度矢量的稳定临界条件、收敛度、稳定机理等,理论分析和仿真比较了速度恒定进场动力补偿系统和迎角恒定进场动力补偿系统在控制性能上的差异。     

基于分形的地图自动综合方法

为了较好地解决根据已知比例尺的地图通过自动综合生成满足不同比例尺需求的地图，利用地图边界所具有的分形特征及分形维数的不变性，提出了一种地图边界自动综合的方法——MADP。该方法不仅很好地保持了地图的形状特征和细节，而且较好地解决了公共边界的综合问题。实验表明，该方法具有较高的效率和公共边界综合能力。     

横向效应增强型弹垂直侵彻薄靶的轴向剩余速度理论分析

为了得到横向效应增强型弹（Penetration with Enhanced Lateral Efficiency projectile, PELE）对金属薄靶垂直侵彻后的弹体轴向剩余速度，运用平面冲击波理论，对PELE的侵彻机理进行分析。参照平头弹体对靶板的侵彻模型，将PELE侵彻过程中的能量损失划分为以下几个部分：外壳体和内芯撞靶区域对应的环形塞块获得的能量、冲击波作用下弹体的内能增量以及剪切耗能等。然后根据能量守恒原理，得到PELE垂直侵彻金属薄靶后的PELE弹体轴向剩余速度的理论模型。为了验证该模型的合理性和准确性，设计相应的试验进行验证。结果表明，不同条件下得到的试验结果和理论模型得到的计算结果均吻合得较好。因此，得到的PELE垂直侵彻薄靶的轴向剩余速度理论模型可为工程应用提供指导和参考。     

内置频率对Duffing振子微弱二进制相移键控信号盲检测影响

采用Duffing振子实现对微弱二进制相移键控（Binary Phase Shift Keying, BPSK）信号的盲检测时，Duffing系统输出的周期态和混沌态转换之间存在过渡带。针对这一问题，推导出过渡带时长和Duffing系统内置频率之间的关系表达式；指出内置频率越高，过渡带时间越短；仿真实验给出时间频率响应曲线。内置频率的提高，会降低系统检测微弱信号的灵敏度。针对这一问题，推导出周期态下Duffing系统输出幅度作为因变量、内置频率作为自变量的表达式；仿真实验给出幅频响应曲线。针对微弱BPSK信号盲检测，建立变尺度方法和检测阵列相结合的基于S变换提取Duffing系统输出幅度包络的微弱BPSK信号盲检测模型，仿真实验验证了模型方法的有效性。     

一种改进方位向非线性CS大斜视角SAR成像算法

大斜视角SAR成像时存在严重的距离走动现象,慢时域的距离走动校正在解决这一问题同时导致了聚焦深度问题.分析了二维频域解耦合后残余相位误差以及时域走动校正后的多普勒调频率误差,提出一种改进的方位向非线性CS算法,校正了三次以上距离迁徙带来的相位误差,同时采用改进非线性CS扰动方程补偿了随方位偏移量线性变化的调频率误差.仿真结果表明,改进算法的大斜视角大场景成像性能优于传统的高分辨大斜视角成像算法.     

LFM脉冲雷达距离维快速搜索处理算法

针对脉冲雷达近距离目标遮挡问题,从理论上分析了雷达最小作用距离不受限于脉冲宽度.在此基础上,以Chirp脉冲为例,提出了一种适合远近距离全程目标的快速搜索处理算法.该算法只需发射一种宽脉冲波形,而不必根据距离的变化改变脉宽,从而有效缩短了搜索时间,大大提高了搜索效率.仿真结果表明了理论分析的正确性和算法的有效性.     

Dynamic server assignment policies for assembly‐type queues with flexible servers

We seek dynamic server assignment policies in finite‐capacity queueing systems with flexible and collaborative servers, which involve an assembly and/or a disassembly operation. The objective is to maximize the steady‐state throughput. We completely characterize the optimal policy for a Markovian system with two servers, two feeder stations, and instantaneous assembly and disassembly operations. This optimal policy allocates one server per station unless one of the stations is blocked, in which case both servers work at the unblocked station. For Markovian systems with three stations and instantaneous assembly and/or disassembly operations, we consider similar policies that move a server away from his/her “primary” station only when that station is blocked or starving. We determine the optimal assignment of each server whose primary station is blocked or starving in systems with three stations and zero buffers, by formulating the problem as a Markov decision process. Using this optimal assignment, we develop heuristic policies for systems with three or more stations and positive buffers, and show by means of a numerical study that these policies provide near‐optimal throughput. Furthermore, our numerical study shows that these policies developed for assembly‐type systems also work well in tandem systems. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008