按优先级分层网络路由算法

讨论了 C3I通信子网的路由算法。在提出了通信延迟量概念基础上 ,考虑到 C3I通信子网各站点的通信重要度不同 ,提出了一种路由算法。从军事指挥体制及区域划分出发 ,文中还给出通信子网采用分层管理的路由计算方法。本算法对C3I通信子网的管理设计有参考价值     

Scheduling for parallel dedicated machines with a single server

This paper examines scheduling problems in which the setup phase of each operation needs to be attended by a single server, common for all jobs and different from the processing machines. The objective in each situation is to minimize the makespan. For the processing system consisting of two parallel dedicated machines we prove that the problem of finding an optimal schedule is N P‐hard in the strong sense even if all setup times are equal or if all processing times are equal. For the case of m parallel dedicated machines, a simple greedy algorithm is shown to create a schedule with the makespan that is at most twice the optimum value. For the two machine case, an improved heuristic guarantees a tight worst‐case ratio of 3/2. We also describe several polynomially solvable cases of the later problem. The two‐machine flow shop and the open shop problems with a single server are also shown to be N P‐hard in the strong sense. However, we reduce the two‐machine flow shop no‐wait problem with a single server to the Gilmore—Gomory traveling salesman problem and solve it in polynomial time. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 304–328, 2000     

Note: On the two‐machine no‐idle flowshop problem

In this short note we study a two‐machine flowshop scheduling problem with the additional no‐idle feasibility constraint and the total completion time criterion function. We show that one of the few papers which deal with this special problem contains incorrect claims and suggest a way how these claims can be rectified. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47:353–358, 2000     

基于信息神经网络的内燃机故障诊断方法

在统计概率基础上建立了信息神经网络 ,探讨了利用该网络诊断内燃机故障的方法 ;并在 1 2 1 50L内燃机上进行了模拟故障的诊断试验。试验结果表明 ,该方法是可行的。     

面向Agent的海军军械勤务辅助支持系统的逻辑构建

结合分布式人工智能中的Agent技术和军械勤务辅助支持系统的特点 ,研究了面向A gent的军械勤务辅助支持结构。结合该系统介绍了Agent和多Agent系统的概念 ,讨论了A gent的通信机制     

Local search methods for the discrete time/resource trade-off problem in project networks

In this paper we consider the discrete time/resource trade-off problem in project networks. Given a project network consisting of nodes (activities) and arcs (technological precedence relations), in which the duration of the activities is a discrete, nonincreasing function of the amount of a single renewable resource committed to it, the discrete time/resource trade-off problem minimizes the project makespan subject to precedence constraints and a single renewable resource constraint. For each activity, a work content is specified such that all execution modes (duration/resource requirement pairs) for performing the activity are allowed as long as the product of the duration and the resource requirement is at least as large as the specified work content. We present a tabu search procedure which is based on a decomposition of the problem into a mode assignment phase and a resource-constrained project scheduling phase with fixed mode assignments. Extensive computational experience, including a comparison with other local search methods, is reported. © 1998 John Wiley & Sons, Inc. Naval Research Logistics 45: 553–578, 1998     

Scheduling to minimize the total compression and late costs

We consider a single-machine scheduling model in which the job processing times are controllable variables with linear costs. The objective is to minimize the sum of the cost incurred in compressing job processing times and the cost associated with the number of late jobs. The problem is shown to be NP-hard even when the due dates of all jobs are identical. We present a dynamic programming solution algorithm and a fully polynomial approximation scheme for the problem. Several efficient heuristics are proposed for solving the problem. Computational experiments demonstrate that the heuristics are capable of producing near-optimal solutions quickly. © 1998 John Wiley & Sons, Inc. Naval Research Logistics 45: 67–82, 1998     

混沌信号处理

描述了混沌特征参量 ,包括Lyapunov指数和分形维 ;讨论了信号相空间重构和Takens嵌入定理 ,以及嵌入维数、时间延迟等参数。还阐述应用神经网络进行混沌信号非线性处理     

基于OPNET的战场IPV6通信网络拓扑设计及仿真

为了对IPv6与IPv4共存期间进行可靠通信提供技术上的参考,基于OPNET仿真平台,设计了几种不同的战场IPv6通信网络拓扑,强调了其特点和关键技术,突出了其仿真的主要参数配置,并通过分析仿真数据,对网络的有效性、实时性、可靠性等性能参数进行了评估,从而验证了所设计拓扑的可行性.