基于小波分析的油料信息安全传输平台框架研究

通过对IPSec实现VPN隧道这种网络安全技术和基于小波分析的信息图像伪装算法的深入研究,将这两种技术有机结合,在应用层对信息进行伪装,在网络层实现VPN 隧道传输,并据此构建一个可解决公用的信道上述问题的信息安全传输平台模型,从而为军队油料信息安全传输提供一种较好的解决方法。     

基于HLA的舰载多传感器信息融合系统仿真

建立具有舰载多传感器信息融合系统功能的C3I系统是目前和未来C3I系统的首要发展方向.应用HLA仿真技术进行舰载多传感器信息融合系统试验仿真,对于增强系统的通用性、灵活性、重用性和互操作性,实现复杂C3I系统集成具有重要的现实意义.首先提出了基于高层体系结构(HLA)的舰载信息融合系统的设计框架,其次阐述了系统设计思想和舰载多传感器信息融合仿真系统组成及功能,并针对作战想定背景进行了对象类和交互类的开发,最后给出了联邦仿真流程,实现功能模型和物理模型的建模.     

基于HLA的军事信息系统网仿真体系架构研究

分布式仿真系统的体系架构对于整个系统的功能实现和运行性能起着决定性的影响,为能充分利用仿真系统测试和评估军事信息系统网的性能,该文首先介绍了军事信息系统网(Military Information System Network:MISN)的组成和特点,并在分析基于数据库的仿真系统和基于HLA(高层体系架构)单联邦仿真系统局限性的基础上,得到了基于HLA的军事信息系统网分布式仿真多联邦体系框架,实现了联邦间功能转换所需的桥接联邦.该体系框架较好地完成了多通信网系的分布式交互仿真.     

舰载指火控系统人机界面信息显示研究

阐述了现海军舰载指火控系统信息显示界面的不足,列举了界面信息显示的普遍原则.以对海作战为例对舰载指火控系统进行作战的分层显示以及编队、联合和协同作战的显示内容进行了研究.针对现海军舰载指火控系统信息显示界面的不足,提出了以虚拟环境为主页面,从舰载指火控系统的的操作信息、状态信息和过程信息三个方面对信息显示进行了充分的描述.最后呼应不足,提出了11条舰载指火控系统信息显示的原则.     

航空核辐射侦察信息更新率分析

分析了航空核辐射侦察信息的时序关系,结合相关测量设备的发展现状,认为更新率应以水平定位信息为准。分析了侦察过程中定位设备的各种工作状态,指出了其最优工作状态。最后在此工作状态下依据现实可用的定位设备给出了信息更新率。     

核辐射监测技术的形势与发展

从军事社会需求与相关应用技术进展两个角度分析了当前核辐射监测技术面临的新形势．在此基础上,展望了核辐射监测技术各个领域的发展方向与趋势,指出核辐射监测技术标准化与国际化是技术发展的必然要求。     

Machine scheduling with pickup and delivery

The coordination of production, supply, and distribution is an important issue in logistics and operations management. This paper develops and analyzes a single‐machine scheduling model that incorporates the scheduling of jobs and the pickup and delivery arrangements of the materials and finished jobs. In this model, there is a capacitated pickup and delivery vehicle that travels between the machine and the storage area, and the objective is to minimize the makespan of the schedule. The problem is strongly NP‐hard in general but is solvable in polynomial time when the job processing sequence is predetermined. An efficient heuristic is developed for the general problem. The effectiveness of the heuristic is studied both analytically and computationally. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005.     

Attrition through a partially coordinated area defense

An area defense consists of several groups that act independently, i.e., do not communicate with each other. Each group has a fixed number of defenders and a controller that allocates these defenders optimally against the individual attackers comprising an attack. We analyze the effectiveness of this partially coordinated defense against a simultaneous attack of known size in which all attackers are considered to be equally lethal. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2005.     

A logistics scheduling model: Inventory cost reduction by batching

Logistics scheduling refers to the problems where the decisions of job scheduling and transportation are integrated in a single framework. In this paper, we discuss a logistics scheduling model where the raw material is delivered to the shop in batches. By making the batching and scheduling decisions simultaneously, the total inventory and batch setup cost can be reduced. We study different models on this issue, present complexity analysis and optimal algorithms, and conduct computational experiments. Some managerial insights are observed. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005.     

Scheduling a production–distribution system to optimize the tradeoff between delivery tardiness and distribution cost

We consider a make‐to‐order production–distribution system with one supplier and one or more customers. A set of orders with due dates needs to be processed by the supplier and delivered to the customers upon completion. The supplier can process one order at a time without preemption. Each customer is at a distinct location and only orders from the same customer can be batched together for delivery. Each delivery shipment has a capacity limit and incurs a distribution cost. The problem is to find a joint schedule of order processing at the supplier and order delivery from the supplier to the customers that optimizes an objective function involving the maximum delivery tardiness and the total distribution cost. We first study the solvability of various cases of the problem by either providing an efficient algorithm or proving the intractability of the problem. We then develop a fast heuristic for the general problem. We show that the heuristic is asymptotically optimal as the number of orders goes to infinity. We also evaluate the performance of the heuristic computationally by using lower bounds obtained by a column generation approach. Our results indicate that the heuristic is capable of generating near optimal solutions quickly. Finally, we study the value of production–distribution integration by comparing our integrated approach with two sequential approaches where scheduling decisions for order processing are made first, followed by order delivery decisions, with no or only partial integration of the two decisions. We show that in many cases, the integrated approach performs significantly better than the sequential approaches. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005