When is greedy module assembly optimal?

Many coherent systems are configurations of identically structured modules, each consisting of a number of different components. The objective is to assemble the modules out of a collection of available components, and to install the modules in the system in a way that maximizes reliability. The greedy assembly rule builds one module out of the best available components, another out of the best remaining components, and so on. This article shows that greedy assembly is optimal whenever the modules have a series structure, no matter what the structure of the system in which the modules will be used might be, provided that the modules, once assembled, are installed in the system in an optimal way. The article also demonstrates that series modules are unique in this regard.     

一种基于证据理论的陆战场机动平台情报关联方法

针对陆战场情报来源对象不明的问题,提出了一种采用证据聚类技术对陆战场机动平台情报进行分类以实现目标关联的方法。该方法针对陆战场机动平台的特点,建立描述该类情报的证据理论模型;并将各情报之间的矛盾量化成冲突因子,推导分类优化函数;然后采用平均场模拟退火算法进行情报分类。     

The frequency assignment problem: A solution via nonlinear programming

This paper gives a mathematical programming model for the problem of assigning frequencies to nodes in a communications network. The objective is to select a frequency assignment which minimizes both cochannel and adjacent-channel interference. In addition, a design engineer has the option to designate key links in which the avoidance of jamming due to self interference is given a higher priority. The model has a nonconvex quadratic objective function, generalized upper-bounding constraints, and binary decision variables. We developed a special heuristic algorithm and software for this model and tested it on five test problems which were modifications of a real-world problem. Even though most of the test problems had over 600 binary variables, we were able to obtain a near optimum in less than 12 seconds of CPU time on a CDC Cyber-875.     

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     

低散热柴油机研究综述

低散热柴油机是对燃烧室等主要受热零部件采取隔热措施处理的发动机。发动机工作时,通过燃烧室表面向冷却水的传热减少,可以显著减小坦克发动机冷却系统的整体尺寸。介绍了低散热柴油机的研究和发展情况,分析了隔热技术研究存在的问题,提出了坦克装甲车辆柴油机应用隔热技术研究的方向,指出隔热技术应用于柴油机成功与否的关键是隔热部件或涂层材料的可靠性,应用隔热技术后,应该进行燃烧系统优化及车辆冷却系统的整体性能的研究。     

一种北斗／CDMA导航系统数据融合的联邦卡尔曼滤波算法

北斗卫星与CDMA无线网络定位相结合的组合导航系统可以广泛应用于军事和民用领域,而有效进行数据融合是提高北斗/CDMA组合导航系统定位精度的关键.针对北斗/CDMA组合导航系统的特点,提出了一种基于联邦卡尔曼滤波的北斗/CDMA导航数据融合算法.算法采用机动目标的"当前"统计模型,分别建立了北斗定位系统和CDMA定位系统的状态方程,通过对相应定位参数进行滤波处理,提高了北斗/CDMA导航系统的定位精度.     

Approximation algorithms for general one‐warehouse multi‐retailer systems

Logistical planning problems are complicated in practice because planners have to deal with the challenges of demand planning and supply replenishment, while taking into account the issues of (i) inventory perishability and storage charges, (ii) management of backlog and/or lost sales, and (iii) cost saving opportunities due to economies of scale in order replenishment and transportation. It is therefore not surprising that many logistical planning problems are computationally difficult, and finding a good solution to these problems necessitates the development of many ad hoc algorithmic procedures to address various features of the planning problems. In this article, we identify simple conditions and structural properties associated with these logistical planning problems in which the warehouse is managed as a cross‐docking facility. Despite the nonlinear cost structures in the problems, we show that a solution that is within ε‐optimality can be obtained by solving a related piece‐wise linear concave cost multi‐commodity network flow problem. An immediate consequence of this result is that certain classes of logistical planning problems can be approximated by a factor of (1 + ε) in polynomial time. This significantly improves upon the results found in literature for these classes of problems. We also show that the piece‐wise linear concave cost network flow problem can be approximated to within a logarithmic factor via a large scale linear programming relaxation. We use polymatroidal constraints to capture the piece‐wise concavity feature of the cost functions. This gives rise to a unified and generic LP‐based approach for a large class of complicated logistical planning problems. © 2009 Wiley Periodicals, Inc. Naval Research Logistics, 2009     

把握现代心理战的致伤效能构筑全方位心理防护体系

文章分析了现代心理战的致伤效能,提出了适应信息化条件下战争形态和作战样式的变化,树立预防、主动反应的心理防护理念,构筑全方位心理防护体系的思考。