基于复杂网络理论的C2组织网络拓扑结构研究

根据C 2组织结构的特点,基于复杂网络理论和网络中心战思想,将C 2组织中的各作战单元、指控节点等作为节点,它们之间的信息流动作为边,构建C 2组织的网络拓扑结构。经过仿真分析,推出其内部具有无标度性、小世界性等复杂网络特性,这对于进一步将复杂网络理论应用于C 2组织的研究提供了理论依据并具有积极的意义。     

阻化烟煤堆非稳态温度场计算

依据实验测得的干、水湿和阻化烟煤氧化反应的动力学参数 ,引入了氧传质模型和水蒸气平衡模型 ,利用计算机编程对干、水湿和阻化烟煤堆内的一维非稳态自热过程的模型分别进行差分计算 ,求得相应煤堆内的非稳态温度场。结果表明 ,采用简化的一维自热过程的非稳态数学模型计算 ,可以剖析氧传递、水蒸气平衡和阻化处理对煤堆自热的影响 ,可以评价实际煤堆的自热危险性和判断烟煤堆的阻化处理效果     

关于小尺寸装药用炸药薄膜的研究

利用真空蒸镀技术对太安炸药薄膜及其在小尺寸装药上的应用进行了研究。实验表明利用真空蒸镀技术可以研制出性能优良的炸药薄膜 ;红外光谱分析证明太安在蒸镀前后没有发生质的变化 ;扫描电镜分析得出了太安薄膜的微观结构 ;太安炸药薄膜在小尺寸装药上的应用表明了该装药具有可靠的传爆功能。     

基于邻域灰度分布的IR弱小目标检测

图像中邻域内灰度起伏程度越大 ,各点灰度值占邻域内总灰度值的比率的平方和越大 ,由此提出了一种基于邻域灰度分布的弱小目标检测方法。同时考虑到复杂自然背景 ,特别是背景中含有大量边缘和高频点的情况 ,提出了目标检测的改进方法。最后 ,利用邻域判决法实现运动目标的进一步分离。实验表明该方法能够极大地减少候选目标点数 ,准确有效地检测复杂自然背景中的红外运动弱小目标 ,适合于实时和多目标的检测     

现代小城镇消防监督管理探析

通过分析目前涌现出的现代化小城镇存在的消防安全问题 ,提出政府重视、建立合理的消防监督管理模式、加强消防宣传等措施 ,改善消防安全环境。     

理想气体绝热过程的微观实质

从分子动理论出发,建立理想气体绝热过程的微观模型,用麦克斯韦速度分布函数导出其过程方程.     

Hopfield神经网络的防空火力最优分配问题

火力的最优分配是作战计划的重要内容,它包含火力单位特性、目标单位特性、最优准则、射击条件四个方面的内容。简要介绍了Hopfield神经网络的基础知识,建立了防空自动化指挥系统中火力分配的Hopfield神经网络算法一般模型,在此基础上,阐述了利用该算法在火力分配中的一般应用,并通过在计算机上借助C语言编程实现了这一模型,得出了一种比较合理可行的火力分配方案。     

Scheduling of depalletizing and truck loading operations in a food distribution system

This paper studies a scheduling problem arising in a beef distribution system where pallets of various types of beef products in the warehouse are first depalletized and then individual cases are loaded via conveyors to the trucks which deliver beef products to various customers. Given each customer's demand for each type of beef, the problem is to find a depalletizing and truck loading schedule that fills all the demands at a minimum total cost. We first show that the general problem where there are multiple trucks and each truck covers multiple customers is strongly NP‐hard. Then we propose polynomial‐time algorithms for the case where there are multiple trucks, each covering only one customer, and the case where there is only one truck covering multiple customers. We also develop an optimal dynamic programming algorithm and a heuristic for solving the general problem. By comparing to the optimal solutions generated by the dynamic programming algorithm, the heuristic is shown to be capable of generating near optimal solutions quickly. © 2003 Wiley Periodicals, Inc. Naval Research Logistics, 2003     

Analysis of a machine repair problem with an unreliable server and phase type repairs and services

In this paper we study a machine repair problem in which a single unreliable server maintains N identical machines. The breakdown times of the machines are assumed to follow an exponential distribution. The server is subject to failure and the failure times are exponentially distributed. The repair times of the machine and the service times of the repairman are assumed to be of phase type. Using matrix‐analytic methods, we perform steady state analysis of this model. The time spent by a failed machine in service and the total time in the repair facility are shown to be of phase type. Several performance measures are evaluated. An optimization problem to determine the number of machines to be assigned to the server that will maximize the expected total profit per unit time is discussed. An illustrative numerical example is presented. © 2003 Wiley Periodicals, Inc. Naval Research Logistics 50: 462–480, 2003     

A bidirectional heuristic for maximizing the net present value of large‐scale projects subject to limited resources

We consider the scheduling of large‐scale projects to maximize the project net present value given temporal and resource constraints. The net present value objective emphasizes the financial aspects of project management. Temporal constraints between the start times of activities make it possible to handle practical problem assumptions. Scarce resources are an expression of rising cost. Since optimization techniques are not expedient to solve such problems and most heuristic methods known from literature cannot deal with general temporal constraints, we propose a new bidirectional priority‐rule based method. Scheduling activities with positive cash flows as early and activities with negative cash flows as late as possible results in a method which is completed by unscheduling techniques to cope with scarce resources. In a computational experiment, we compare the well‐known serial generation scheme where all activities are scheduled as early as possible with the proposed bidirectional approach. On the basis of a comprehensive data set known from literature containing instances with up to 1002 activities, the efficiency of the new approach is demonstrated. © 2003 Wiley Periodicals, Inc. Naval Research Logistics, 2003