尾流自导鱼雷射击诸元解算模型研究

通过对舰船尾流和尾流自导鱼雷导引机制的研究,讨论了尾流自导鱼雷射击瞄点选择的依据和方法,分析原有模型的不足,建立了新的尾流自导鱼雷攻击解算模型。新模型修正了原有模型因简化和近似而造成的误差,使计算结果更加精确,并首次采用迭代的方法进行求解,通过实例验证了模型及解算方法的正确性。     

外军新型巡航导弹数据链系统体系架构研究

在分析未来作战中新型巡航导弹数据链系统需求和现有巡航导弹数据链局限性的基础上,并将面向服务的"智能信息网络(IIN)"理论引入新系统网络体系架构设计中,提出了设计模型和实现方案,并对其在性能、可靠性、QoS等方面的提高进行了重点分析,为未来新型巡航导弹数据链系统的实现提供了思路。     

Scheduling parallel dedicated machines with the speeding‐up resource

We consider a problem of scheduling jobs on m parallel machines. The machines are dedicated, i.e., for each job the processing machine is known in advance. We mainly concentrate on the model in which at any time there is one unit of an additional resource. Any job may be assigned the resource and this reduces its processing time. A job that is given the resource uses it at each time of its processing. No two jobs are allowed to use the resource simultaneously. The objective is to minimize the makespan. We prove that the two‐machine problem is NP‐hard in the ordinary sense, describe a pseudopolynomial dynamic programming algorithm and convert it into an FPTAS. For the problem with an arbitrary number of machines we present an algorithm with a worst‐case ratio close to 3/2, and close to 3, if a job can be given several units of the resource. For the problem with a fixed number of machines we give a PTAS. Virtually all algorithms rely on a certain variant of the linear knapsack problem (maximization, minimization, multiple‐choice, bicriteria). © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008     

Scheduling and due‐date quotation in a make‐to‐order supply chain

We consider a manufacturer, served by a single supplier, who has to quote due dates to arriving customers in a make‐to‐order production environment. The manufacturer is penalized for long lead times and for missing due dates. To meet due dates, the manufacturer has to obtain components from a supplier. We model this manufacturer and supplier as a two‐machine flow shop, consider several variations of this problem, and design effective due‐date quotation and scheduling algorithms for centralized and decentralized versions of the model. We perform extensive computational testing to assess the effectiveness of our algorithms and to compare the centralized and decentralized models to quantify the value of centralized control in a make‐to‐order supply chain. Since complete information exchange and centralized control is not always practical or cost‐effective, we explore the value of partial information exchange for this system. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008     

DEA models for two‐stage processes: Game approach and efficiency decomposition

Data envelopment analysis (DEA) is a method for measuring the efficiency of peer decision making units (DMUs). This tool has been utilized by a number of authors to examine two‐stage processes, where all the outputs from the first stage are the only inputs to the second stage. The current article examines and extends these models using game theory concepts. The resulting models are linear, and imply an efficiency decomposition where the overall efficiency of the two‐stage process is a product of the efficiencies of the two individual stages. When there is only one intermediate measure connecting the two stages, both the noncooperative and centralized models yield the same results as applying the standard DEA model to the two stages separately. As a result, the efficiency decomposition is unique. While the noncooperative approach yields a unique efficiency decomposition under multiple intermediate measures, the centralized approach is likely to yield multiple decompositions. Models are developed to test whether the efficiency decomposition arising from the centralized approach is unique. The relations among the noncooperative, centralized, and standard DEA approaches are investigated. Two real world data sets and a randomly generated data set are used to demonstrate the models and verify our findings. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008     

JPEG2000遥感图像实时压缩系统中基于并行机制的“零时间”数据搬移策略

为了满足JPEG2000遥感图像实时压缩设备的实时性要求,提出了一种基于并行机制的“零时间”数据搬移策略。通过对EBC算法结构进行拆分,并采用EDMA方式进行数据搬移,使得算法运算与数据搬移过程完全并行,搬移时间等效为零。实验结果表明,采用新的数据搬移策略后,编码效率可以提升到100％,EBC算法实现的总时间可缩短46％以上。该搬移机制已成功应用于JPEG2000星载遥感图像实时压缩系统中,系统的实时性达到了设计要求。     

雷达与红外数据融合评述

雷达和红外数据融合由于能够实现信息互补 ,改善对目标的跟踪、识别以及提高系统的生存能力 ,因而引起了广泛的注意。对基于雷达和红外传感器的数据融合算法进行了综述 ,并介绍了一些关键课题。     

多传感器多目标定位与跟踪技术研究

针对炮兵打击目标的特性和获取目标信息所采用的侦察设施 ,研究了多传感器多目标定位和跟踪问题。在闭圆和聚类概念的基础上 ,提出了一种多传感器多目标融合算法 ,并给出了状态估计的最优解。仿真结果证明了这种算法的有效性。这一模型的物理实现正在进一步研究之中。     

单平台多传感器数据融合系统的设计与实现

从工程应用观点出发研究单平台多传感器数据融合系统 (Data Fusion System ,DFS)设计和实现。首先通过分析此类型 DFS的功能需求 ,提出一种具有一定可伸缩性的系统结构 ;然后运用面向对象的方法 ,进行系统设计 ,以确保系统本身的可扩充性及系统中所采用的算法和模块的可移植性 ;同时也给出了一种确保系统实时性的多线程实现方案。     

多目标数据关联的神经网络方法

数据关联是多目标跟踪的关键问题。基于 Hopfield神经网络的 JPDA是解决这一关键问题的有效方法之一 ,但此方法的难点在于优化系数的整定。提出一种改进算法 ,用于解决优化系数在线自适应整定问题。首先重新构造了李雅普诺夫能量函数 ,接着引入变化的优化系数因子 ,并给出了优化系数求解的迭代公式 ;最后对已有和改进的算法进行了仿真研究。结果表明改进的方法和原有的方法相比 ,一方面具有在线整定优化系数的功能 ,另一方面可以获得和原有算法非常接近的估计误差。