基于熵最小化的LFM信号调频率估计算法

利用LFM信号频谱的熵随着调频率减小而降低的性质,提出了一种基于频谱熵最小化的LFM信号调频率的估计SEM方法。建立参数待估的相位补偿因子,通过搜索得到使得补偿后信号频谱熵全局最小的调频率估值。在搜索过程中,采用两级搜索策略,并引入牛顿迭代算法,有效降低了算法复杂度。理论推导和仿真结果证明,该算法为有偏算法,估计偏差量与初始频率相关,理论估计方差比较CR下界低12d B。对雷达实测回波信号进行验证,与离散多项式变换算法相比发现,提出算法估计的鲁棒性更好,并具有较高的测速精度,具有一定的应用价值。     

装备经济性分析中的结构制造复杂度参数建模

参数估算法是当前装备经济性分析的主要方法,TruePlanning软件为国际主流的装备经济性分析软件。基于TruePlanning软件,以制造复杂度(Manufacturing Complexity)为研究对象,通过对TrueH模块进行深度剖析,分析并确立了结构制造复杂度(Manufacturing Complexity for Structure)的建模思路和模型形式。通过一个实例分析,选取5个必要的输入参数,构建结构制造复杂度的初步模型,并进一步考虑附加参数的输入,对模型进行修正。结果显示了结构制造复杂度对各技术参数的不同响应形式和敏感程度,为开发国产费用估算模型提供了可行的思路。     

Priority queue with customer upgrades

This article is concerned with a general multi‐class multi‐server priority queueing system with customer priority upgrades. The queueing system has various applications in inventory control, call centers operations, and health care management. Through a novel design of Lyapunov functions, and using matrix‐analytic methods, sufficient conditions for the queueing system to be stable or instable are obtained. Bounds on the queue length process are obtained by a sample path method, with the help of an auxiliary queueing system. © 2012 Wiley Periodicals, Inc. Naval Research Logistics, 2012     

Coordinated pricing and inventory control problems with capacity constraints and fixed ordering cost

This article addresses a single‐item, finite‐horizon, periodic‐review coordinated decision model on pricing and inventory control with capacity constraints and fixed ordering cost. Demands in different periods are random and independent of each other, and their distributions depend on the price in the current period. Each period's stochastic demand function is the additive demand model. Pricing and ordering decisions are made at the beginning of each period, and all shortages are backlogged. The objective is to find an optimal policy that maximizes the total expected discounted profit. We show that the profit‐to‐go function is strongly CK‐concave, and the optimal policy has an (s,S,P) ‐like structure. © 2012 Wiley Periodicals, Inc. Naval Research Logistics, 2012     

太阳辐射作用下的飞机表面温场分布实验研究

提出一种通过缩比模型测试飞机在太阳辐射作用下的表面温度场分布,进而通过有限元方法实现太阳辐射温场的三维模拟显示的实验方法.该方法避免了外场测试条件中自然日光辐射强度不可控和环境温度变化的影响,为飞机在太阳辐射作用下的表面温场理论模型验证和实测提供一种有效的方法,对飞机红外特性、日历寿命等研究具有借鉴意义.     

毫米波制导武器及其防护

介绍了毫米波制导武器的特点以及国外已经装备或正在研制的毫米波制导武器。基于毫米波辐射及传输特点,讨论了对毫米波制导武器进行防护的方法。     

Production and transport logistics scheduling with two transport mode choices

This paper considers a new class of scheduling problems arising in logistics systems in which two different transportation modes are available at the stage of product delivery. The mode with the shorter transportation time charges a higher cost. Each job ordered by the customer is first processed in the manufacturing facility and then transported to the customer. There is a due date for each job to arrive to the customer. Our approach integrates the machine scheduling problem in the manufacturing stage with the transportation mode selection problem in the delivery stage to achieve the global maximum benefit. In addition to studying the NP‐hard special case in which no tardy job is allowed, we consider in detail the problem when minimizing the sum of the total transportation cost and the total weighted tardiness cost is the objective. We provide a branch and bound algorithm with two different lower bounds. The effectiveness of the two lower bounds is discussed and compared. We also provide a mathematical model that is solvable by CPLEX. Computational results show that our branch and bound algorithm is more efficient than CPLEX. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005     

战场态势估计的理论体系研究

态势估计是数据融合体系中的一个重要层次。战场态势估计在现代作战中发挥了越来越重要的作用,但到目前为止关于态势估计的理论体系还没有一种比较统一的看法。本文从态势估计在数据融合中的地位出发,以态势估计处理融合数据的具体流程为根据,建立了三个层次的态势估计层次结构,解决了关于态势估计具体需要研究的内容问题。     

Single machine parallel batch scheduling subject to precedence constraints

We consider the single machine parallel batch scheduling problems to minimize makespan and total completion time, respectively, under precedence relations. The complexities of these two problems are reported as open in the literature. In this paper, we settle these open questions by showing that both problems are strongly NP‐hard, even when the precedence relations are chains. When the processing times of jobs are directly agreeable or inversely agreeable with the precedence relations, there is an O(n²) time algorithm to minimize the makespan. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004