基于小波变换的探地雷达随机RFI抑制方法

针对探地雷达(Ground Penetrating Radar, GPR)与移动通信系统终端存在的频谱共用的电磁兼容性问题,着重分析了GPR接收中随机性射频干扰(Radio Frequency Interference, RFI)的性质,以及该类RFI与GPR目标回波信号在小波多尺度分解中分布的差异性,并基于此分析,提出了基于小波变换域的GPR随机RFI抑制算法,利用两种实测实验数据进行验证,结果表明,该方法能较好地抑制GPR的随机性RFI.     

抗美援朝战争政治动员评析及启示

在抗美援朝战争中,新中国不仅在军事上创造了奇迹,而且展现了应对国际霸权的政治动员能力.抗美援朝战争政治动员的成功是多种因素促成的.分析研究抗美援朝战争政治动员的成功经验,可以得出许多有益的启示.     

试析新中国成立初期人民解放军学习苏军活动

新中国成立初期,人民解放军展开了学苏军活动。这次学苏军活动,经历了全面学习、有分析有批判地学习以及确立“以我为主”方针等三个历史阶段。通过学习、借鉴苏军经验,人民解放军技战术水平和协同作战能力有了很大提高,正规化现代化革命化建设取得显著成绩,同时也积累了许多值得借鉴的经验教训。     

新中国成立后毛泽东国防科技思想的发展及其启示

从1949年新中国成立到1976年,毛泽东国防科技思想经历了3个发展阶段.认真研究毛泽东国防科技思想的发展,对于新世纪新阶段的国防和军队建设具有重要的理论意义和现实意义.     

清朝后期国防思想刍议

清朝后期,侵略者接连不断的海上入侵和边防蚕食致使中国边疆动荡不安,直接刺激着清朝后期国防思想的大变革、大发展,形成了以"师夷长技以制夷"为主体的反侵略思想,由海防战略思想、海岸和海港建设思想、海军建设思想共同支撑的海防思想和以"中外之防"的治边思想、内外兼顾的陆防思想为主要内容的边防思想.这些思想影响了一系列清朝后期的反侵略战争与军事变革,较之传统国防思想有一定的进步意义.但是,由于其本质上的被动性、不彻底性,就其理论水平而言仍存在着诸多缺失与不足.     

罗炳辉与军事统一战线

作为中国人民解放军36位军事家之一的罗炳辉,被赞颂为传奇式英雄、智勇双全的人物①.罗炳辉的传奇军旅生涯不仅表现在,他指挥军队在与敌军兵戎相见的战场上.     

一种变结构导引律及其在垂直命中制导中的应用

基于变结构控制理论 ,提出了一种垂直命中目标的导引律。该导引律在引入理想的视线角基础上 ,所设计的切换函数不仅保证脱靶量为零 ,而且能同时达到垂直命中目标的目的。数字仿真表明 ,该导引律与最优垂直命中导引律相比 ,不仅适用范围广 ,而且具有良好的鲁棒性能。     

大型电动力鱼雷动力电池管外激活发射对初始弹道的影响

通过对大型电动力鱼雷初始弹道的仿真结果与试验数据的对比 ,表明仿真基本反映了实际情况 .在此基础上 ,通过对大型电动力鱼雷一次动力电池不同激活时间的管外激活发射初始弹道的仿真 ,证明了将现用设定参数进行合理调整并提高动力电池性能 ,实现动力电池管外激活发射是可行的 .     

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     

Dynamic inventory management with cash flow constraints

In this article, we consider a classic dynamic inventory control problem of a self‐financing retailer who periodically replenishes its stock from a supplier and sells it to the market. The replenishment decisions of the retailer are constrained by cash flow, which is updated periodically following purchasing and sales in each period. Excess demand in each period is lost when insufficient inventory is in stock. The retailer's objective is to maximize its expected terminal wealth at the end of the planning horizon. We characterize the optimal inventory control policy and present a simple algorithm for computing the optimal policies for each period. Conditions are identified under which the optimal control policies are identical across periods. We also present comparative statics results on the optimal control policy. © 2008 Wiley Periodicals, Inc. Naval Research Logistics 2008