一种改进的跳频信号频率估计算法

信号的信噪比较低时,旋转不变信号参数估计技术（Estimated Signal Parametersvia Rotational Invariance Technique,ESPRIT）算法的频率估计性能明显下降,针对这一问题,提出了一种基于ESPRIT的改进算法。该改进算法在基于ESPRIT的噪声抑制（Noise Suppressed based on ESPRIT,NS—ESPRIT）算法的基础上,利用DFT谱中的,个局部最大值点,缩小基于互相关矩阵迹模值曲线的ESPRIT算法中口的选择区域,在降低计算复杂度的同时,也有效地减弱了噪声对信号频率估计的影响。理论分析和仿真结果证明了该改进算法的可行性和有效性。     

基于STAGE平台的模型扩展方法

STAGE(Scenario Toolkit And Generation Environment)是用于开发想定战场环境和武器系统验证的仿真软件。用户可根据需求利用自己开发的仿真模型取代STAGE的内置仿真模型,也可以将开发的仿真模型与STAGE中现有模型进行集成。针对STAGE 6.0仿真开发平台,研究了STAGE模型扩展中的关键技术,实现了用户开发模型与STAGE仿真引擎的集成,从而为快速构建用户自定义战场环境提供了一种新途径。     

Modeling the operation of multireservoir systems using decomposition and stochastic dynamic programming

Stochastic dynamic programming models are attractive for multireservoir control problems because they allow non‐linear features to be incorporated and changes in hydrological conditions to be modeled as Markov processes. However, with the exception of the simplest cases, these models are computationally intractable because of the high dimension of the state and action spaces involved. This paper proposes a new method of determining an operating policy for a multireservoir control problem that uses stochastic dynamic programming, but is practical for systems with many reservoirs. Decomposition is first used to reduce the problem to a number of independent subproblems. Each subproblem is formulated as a low‐dimensional stochastic dynamic program and solved to determine the operating policy for one of the reservoirs in the system. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2006     

巡航导弹强弱点分析及防御方法

巡航导弹具有突防能力强、命中精度高、灵活性强、技术上易于实现和造价低等优点而备受各个国家重视,已经发展成为现代战争的重要武器,是上世纪90年代以后的主要空中作战目标之一.对巡航导弹的强点与弱点进行了分析,并研究了防御巡航导弹的可行方法.     

结构振动系统的模态解耦控制

基于特征结构配置的参数化结果,给出了实现结构振动系统模态解耦的充要条件,导出了期望的反馈增益阵及闭环特征向量矩阵的全体参数化表示。该方法在实现模态解耦的同时,还提供了全部自由度,可用来实现系统设计中某些性能要求。该方法直接基于原系统的参数矩阵,便于工程应用。三级质量弹簧系统的实例表明该方法有效。     

Minimizing makespan on a single batch processing machine with nonidentical job sizes

We deal with the problem of minimizing makespan on a single batch processing machine. In this problem, each job has both processing time and size (capacity requirement). The batch processing machine can process a number of jobs simultaneously as long as the total size of these jobs being processed does not exceed the machine capacity. The processing time of a batch is just the processing time of the longest job in the batch. An approximation algorithm with worst‐case ratio 3/2 is given for the version where the processing times of large jobs (with sizes greater than 1/2) are not less than those of small jobs (with sizes not greater than 1/2). This result is the best possible unless P = NP. For the general case, we propose an approximation algorithm with worst‐case ratio 7/4. A number of heuristics by Uzosy are also analyzed and compared. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48: 226–240, 2001     

基于模糊数的防空C3I系统效能评估

根据模糊数适于量化模糊信息的特点,运用模糊集理论,提出了一种基于模糊数的模糊综合评估方法.通过计算被评估系统效能的模糊数,将问题转化为模糊数的排序问题,并给出了采用该方法对防空C3I系统效能评估的模型及实现步骤.该方法能对防空C3I系统的效能指标进行合理的量化处理,较好地解决了防空C3I系统效能评估问题,通过计算实例验证了该方法的正确性和实用性.     

The outfit planning problem: Production planning in shipbuilding

Shipbuilding as currently practiced in U.S. commercial shipyards employs little quantitative modeling or analysis in production planning. This paper presents a brief discussion of the shipbuilding process and focuses on one major component which is referred to as outfitting. The outfit planning problem is described in detail and then formally modeled as a generalization of the resource constrained project scheduling problem. The value of the approach as well as barriers to its adoption are also discussed.     

The continuous multiple-modular design problem

In this article we extend our previous work on the continuous single-module design problem to the multiple-module case. It is assumed that there is a fixed cost associated with each additional module used. The Kuhn–Tucker conditions characterize local optima among which there is a global optimum. Modules are associated with partitions and a special class, guillotine partitions, are characterized. Branch-and-bound, partial enumeration, and heuristic procedures for finding optimum or good guillotine partitions are discussed and illustrated with examples.