二维虚拟ESPRIT算法的改进

对二维虚拟ESPRIT算法进行了改进 ,在保持原算法计算量小这一优点的基础上 ,提高了阵元利用率 ,或者减小了对阵列结构的要求     

A branch and bound algorithm for computing optimal replacement policies in consecutive k‐out‐of‐n‐systems

This paper presents a branch and bound algorithm for computing optimal replacement policies in a discrete‐time, infinite‐horizon, dynamic programming model of a binary coherent system with n statistically independent components, and then specializes the algorithm to consecutive k‐out‐of‐n systems. The objective is to minimize the long‐run expected average undiscounted cost per period. (Costs arise when the system fails and when failed components are replaced.) An earlier paper established the optimality of following a critical component policy (CCP), i.e., a policy specified by a critical component set and the rule: Replace a component if and only if it is failed and in the critical component set. Computing an optimal CCP is a optimization problem with n binary variables and a nonlinear objective function. Our branch and bound algorithm for solving this problem has memory storage requirement O(n) for consecutive k‐out‐of‐n systems. Extensive computational experiments on such systems involving over 350,000 test problems with n ranging from 10 to 150 find this algorithm to be effective when n ≤ 40 or k is near n. © 2002 Wiley Periodicals, Inc. Naval Research Logistics 49: 288–302, 2002; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/nav.10017     

二元混压式超声速进气道性能预估及优化设计

建立了具有一定精度的、简洁的二元混压式超声速进气道总压恢复、流量系数、附加阻力系数、唇口波阻系数和有效动能效率等性能预估模型 ;并分析了进气道的压缩板角、进口高度、进口高宽比等几何参数对其性能的影响。对所建立的各优化设计模型 ,利用模拟退火算法进行寻优计算。     

基于图像处理技术的舰载武器系统对准方法

针对目前舰载武器系统对准方法在实际应用中局限性大的问题,提出了一种基于图像处理技术、利用差分算法的舰载武器系统对准方法,并给出了实现该方法的图像处理算法和程序设计流程以及图像比较基准坐标系的建立方法,使得武器系统的对准工作变得更加方便、快捷和精密.该方法适用于舰载武器系统的对准联调和类似的民用设备.     

When to commit in a serial supply chain with forecast updating

Negotiations between an end product manufacturer and a parts supplier often revolve around two main issues: the supplier's price and the length of time the manufacturer is contractually held to its order quantity, commonly termed the “commitment time frame.” Because actual demand is unknown, the specification of the commitment time frame determines how the demand risk is shared among the members of the supply chain. Casual observation indicates that most manufacturers prefer to delay commitments as long as possible while suppliers prefer early commitments. In this paper, we investigate whether these goals are always in the firm's best interest. In particular, we find that the manufacturer may sometimes be better off with a contract that requires an early commitment to its order quantity, before the supplier commits resources and the supplier may sometimes be better off with a delayed commitment. We also find that the preferred commitment time frame depends upon which member of the supply chain has the power to set their exchange price. © 2003 Wiley Periodicals, Inc. Naval Research Logistics, 2003     

The value of information sharing in a two‐stage supply chain with production capacity constraints

We consider a simple two‐stage supply chain with a single retailer facing i.i.d. demand and a single manufacturer with finite production capacity. We analyze the value of information sharing between the retailer and the manufacturer over a finite time horizon. In our model, the manufacturer receives demand information from the retailer even during time periods in which the retailer does not order. To analyze the impact of information sharing, we consider the following three strategies: (1) the retailer does not share demand information with the manufacturer; (2) the retailer does share demand information with the manufacturer and the manufacturer uses the optimal policy to schedule production; (3) the retailer shares demand information with the manufacturer and the manufacturer uses a greedy policy to schedule production. These strategies allow us to study the impact of information sharing on the manufacturer as a function of the production capacity, and the frequency and timing in which demand information is shared. © 2003 Wiley Periodicals, Inc. Naval Research Logistics, 2003     

飞机编队数传系统对火控传感器的备份算法

作战飞机的火控系统是武器发射的重要设备,火控系统能否正常工作关系到能否杀敌、也关系到自身的安全.而火控系统正常控制武器发射需要诸多火控传感器的支持,如传感器出现故障,则火控系统无法正常解算.提出了一种火控传感器备份算法,特别是机载雷达出现故障的情况下获得正确信息的算法,即利用飞机编队内部的数据传输系统来实现某一火控传感器或火控计算机故障时火控系统的正常功能,并对有关算法进行了实例计算,得出相应算法的误差结论.此功能可以作为火控系统的补充功能,提高火控系统的工作可靠性和作战效能.     

同时强镇定的一个充分条件

一个稳定的控制器可同时镇定n个对象(同时强镇定)等价于一个控制嚣(不一定稳定)同时镇定n+1个对象(同时镇定).两个以上对象的同时强镇定和三个以上对象的同时镇定是线性系统中一个亟待解决的公开问题.文中所作的基本假定是所有的对象具有相同的简单不稳定零点,在此条件下给出了n个对象同时强镇定的一个充分条件.此条件仅需确定n个对象的不稳定零点并且判定由不稳定零点导出一个相应矩阵是正定的,就能判定n个对象同时强镇定,因此是一个易于检验的充分条件.同时给出了n个对象同时强镇定的算法.丰富了同时强镇定的条件和算法.     

基于磁流变阻尼器的车辆悬挂二自由度模型控制算法

将磁流变(MRF)新型阻尼减振器用于车辆悬挂减振系统中,用以实现变阻尼式履带车辆悬挂系统半主动控制。在基于线性二次型最优控制理论(LQR法)的基础上,对车辆悬挂系统的半主动控制算法进行了深入研究,建立了二自由度1/4车体的动力学模型,并对其控制效果进行了仿真,结果表明这种半主动控制算法对车辆悬挂系统的半主动有着很好的效果。     

可变等效孔径直接数据域方法

针对直接数据域(DDD)算法具有孔径损失的局限,提出了一种孔径扩展算法.新算法首先利用单快拍数据在不同阵元间的相位关系构造一个循环矩阵,然后通过不同的截取方式获得不同的孔径扩展效果.仿真计算表明,扩展后的孔径介于阵列原始孔径的2/3～1之间.