主动防护系统分布式火控平台设计与仿真

为设计和验证主动防护系统的分布式火控原理和算法,设计了主动防护系统分布式火控验证平台。根据主动防护系统的攻击原理和功能要求,构造了完整的硬件结构和软件架构,给出了详细的仿真流程,并对系统中涉及的各关键技术进行了分析和建模。最后,整个系统采用面向对象的程序设计方法和虚拟现实技术,实现了数字化的主动防护系统分布式火控仿真系统平台。该平台能够在虚拟作战场景中模拟真实的作战场景,能够有效地再现主动防护系统对目标的打击过程,也为主动防护系统的分布式火控原理验证和功能测试提供了技术手段。     

美“海军一体化火力控制--制空”能力发展现状与启示

美“海军一体化火力控制－制空”（ NIFC－CA）是美军海上盾牌防御体系概念的重要组成部分。该体系经过多年的发展已初见成效。首先,对美“海军一体化火力控制———制空”的基本概念及内涵进行了阐述,对其主要组成CEC、E－2D预警机、宙斯盾系统及标准－6舰空导弹在防御体系中的功能进行了分析;然后,介绍了美NIFC－CA的6种主要指挥控制模式,并对其协同指挥决策模式进行了分析,得出了指挥决策分布处理的特点;最后,总结了美NIFC－CA发展对我海军海上防御力量发展建设的启示。     

网络中心战中舰艇编队的作战效能分析

在网络中心战条件下,舰艇编队通过互通、互联和互操作,可在编队范围内共享资源,进行跨平台的通道组织和实现武器共用,这种跨平台的资源共享充分发挥了作战资源的利用率,增强了编队作战系统的生命力。建立了在网络中心战条件下的舰艇编队作战效能计算数模,并进行了分析和计算,解释了在网络支持下编队作战效能提升的原理,分析和计算方法可用于网络兵力的兵力指数计算和作战效能评估。     

Linear compound algorithms for the partitioning problem

For a given set S of nonnegative integers the partitioning problem asks for a partition of S into two disjoint subsets S₁ and S₂ such that the sum of elements in S₁ is equal to the sum of elements in S₂. If additionally two elements (the kernels) r₁, r₂ ∈ S are given which must not be assigned to the same set S_i, we get the partitioning problem with kernels. For these NP‐complete problems the authors present two compound algorithms which consist both of three linear greedylike algorithms running independently. It is shown that the worst‐case performance of the heuristic for the ordinary partitioning problem is 12/11, while the second procedure for partitioning with kernels has a bound of 8/7. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 593–601, 2000     

基于RBAC的分布式数据库系统安全管理技术

分析了分布式数据库系统安全管理的必要性 ,引入了基于角色的访问控制模型 ,结合分布式数据库系统的开发实例 ,阐述了利用Delphi实现基于SQLServer的分布式数据库系统安全管理的技术。     

Multiple common due dates

Common due date problems have been extensively discussed in the scheduling literature. Initially, these problems discussed finding a common due date for a set of jobs on a single machine. These single machine problems were later extended to finding the common due date on a set of parallel machines. This paper further extends the single machine problem to finding multiple common due dates on a single machine. For a basic and important class of penalty functions, we show that this problem is comparable to the parallel machine problem. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48: 293–298, 2001     

仿真网格原型系统的设计与实现

进行仿真网格原型系统的研究是解决仿真网格关键技术的基础。SGE网格引擎是一个构建本地和集群级网格的工具,通过SGE构建基本的网格平台,根据HLA仿真任务的特点,对分布式仿真网格的原型系统进行了研究和设计。提出了仿真网格的双通道通信机制:一个通道负责仿真网格组件的通信,另一个通道负责HLA仿真任务之间的通信。提出了仿真任务在仿真网格中的三种调度模式:以进程为单位的调度、以联邦成员为单位的调度、以联邦为单位的调度等。通过研究初步实现了仿真网格的原型系统,并对HLA仿真任务的三种调度模式进行了简单的测试。     

A heuristic for the two‐machine no‐wait openshop scheduling problem

In this paper the problem of minimizing makespan in a two‐machine openshop is examined. A heuristic algorithm is proposed, and its worst case performance ratio and complexity are analyzed. The average case performance is evaluated using an empirical study. © 1999 John Wiley & Sons, Inc. Naval Research Logistics 46: 129–145, 1999     

Openshop scheduling under linear resources constraints

Consider n jobs (J₁, …, J_n), m working stations (M₁, …, M_m) and λ linear resources (R₁, …, R_λ). Job J_i consists of m operations (O_i1, …, O_im). Operation O_ij requires P_k(i, j) units of resource R_k to be realized in an M_j. The availability of resource R_k and the ability of the working station M_h to consume resource R_k, vary over time. An operation involving more than one resource consumes them in constant proportions equal to those in which they are required. The order in which operations are realized is immaterial. We seek an allocation of the resources such that the schedule length is minimized. In this paper, polynomial algorithms are developed for several problems, while NP-hardness is demonstrated for several others. © 1998 John Wiley & Sons, Inc. Naval Research Logistics 45: 51–66, 1998     

Open shop scheduling to minimize the number of late jobs

We develop polynomial algorithms for several cases of the NP-hard open shop scheduling problem of minimizing the number of late jobs by utilizing some recent results for the open shop makespan problem. For the two machine common due date problem, we assume that either the machines or the jobs are ordered. For the m machine common due date problem, we assume that one machine is maximal and impose a restriction on its load. © 1998 John Wiley & Sons, Inc. Naval Research Logistics 45: 525–532, 1998