C~3l系统软件质量保障技术研究

针对C~3I 软件系统设计实现中所存在的问题,文章重点对软件质量保障方法进行了分析研究,同时提出一种简化任务评审阶段的软件质量综合保障建议。对从事C~3I 系统工程软件质量保障的人员可供参考。     

系统状态方程的信流图描述

本文从基本概念出发,结合两个具体电路讨论如何用信流图建立系统标准状态方程的方法。     

C~3I系统中的哨所通讯网

本文提供了在C~3I系统中哨所通讯网的可行组网方案,从理论上分析了组网实践过程的各种因素。介绍了用信息机实现莫尔斯报务通讯中的困难和解决方法,并对如何提高报传通讯速率提出了探讨性意见。     

微波雷达目标信号模拟器及其应用

本文为在野战条件下检测雷达测距系统的性能提供一种新型微波目标信号模拟器,闸述其工作原理及功能。除在检测雷达测距系统性能上已得到实际应用外,还论述了可以进一步开发的应用项目,因为不受场地和气候条件的限制,从而获得较好的效能、效率和效益。     

基于Matlab神经网络的水下目标识别

为了实现对水下目标的识别,在现有特征提取方法的基础上,提出了目标像素灰度分布特征提取方法,并针对水下光信号衰减的情况,采用了色彩"补偿"的解决方案.对图像矩阵通过奇异值分解得到了目标有效维特征向量,分类器设计采用了Matlab环境下的BP神经网络,识别结果是令人满意的.这对猎雷具装备的发展具有一定的参考价值.     

空中目标战术意图层次推理框架及实现

以提高对空态势感知能力为目的,着眼于构建以专家系统为特征的目标意图推理决策支持系统,首先根据目标意图的含义从意图、行动和状态三个层次进行了层次表示,并简要分析了实现意图推理的六种途径.根据空中目标的作战使用等领域知识将其意图从属性类型、战术类型、威胁类型和任务类型四个层次进行了分解.基于意图推理输入信息的分布性特征以及意图的层次分解建立了基于判定树的意图层次推理框架以及数据驱动的推理控制机制.该框架为建立空中目标战术意图的推理实现方法提供了重要的依据.     

Solution algorithms for the parallel replacement problem under economy of scale

We consider the parallel replacement problem in which machine investment costs exhibit economy of scale which is modeled through associating both fixed and variable costs with machine investment costs. Both finite- and infinite-horizon cases are investigated. Under the three assumptions made in the literature on the problem parameters, we show that the finite-horizon problem with time-varying parameters is equivalent to a shortest path problem and hence can be solved very efficiently, and give a very simple and fast algorithm for the infinite-horizon problem with time-invariant parameters. For the general finite-horizon problem without any assumption on the problem parameters, we formulate it as a zero-one integer program and propose an algorithm for solving it exactly based on Benders' decomposition. Computational results show that this solution algorithm is efficient, i.e., it is capable of solving large scale problems within a reasonable cpu time, and robust, i.e., the number of iterations needed to solve a problem does not increase quickly with the problem size. © 1998 John Wiley & Sons, Inc. Naval Research Logistics 45: 279–295, 1998     

Single machine sequencing with linear models of release dates

The paper deals with a problem of scheduling a set of jobs on a single machine. Before a job is released for processing, it must undergo some preprocessing treatment that consumes resources. It is assumed that the release date of a job is a linear decreasing continuous function of the amount of a locally and globally constrained, continuously divisible resource (e.g., energy, catalyzer, financial outlay, gas). The problem is to find a sequence of jobs and a resource allocation that will minimize the maximum job completion time. Such a problem appears, for example, in the ingot preheating and hot-rolling process in steel mills. It is shown that the problem is strongly NP-hard. Some polynomially solvable cases of the problem and approximate algorithms with both experimental and worst-case analysis are presented. © 1998 John Wiley & Sons, Inc. Naval Research Logistics 45: 99–113, 1998     

Attrition models of the Ardennes campaign

This paper revisits the modeling by Bracken [3] of the Ardennes campaign of World War II using the Lanchester equations. It revises and extends that analysis in a number of ways: (1) It more accurately fits the model parameters using linear regression; (2) it considers the data from the entire campaign; and (3) it adds in air sortie data. In contrast to previous results, it concludes by showing that neither the Lanchester linear or Lanchester square laws fit the data. A new form of the Lanchester equations emerges with a physical interpretation. © 1998 John Wiley & Sons, Inc. Naval Research Logistics 45: 1–22, 1998     

Coordinated replenishments from multiple suppliers with price discounts

In this study we present an integer programming model for determining an optimal inbound consolidation strategy for a purchasing manager who receives items from several suppliers. The model considers multiple suppliers with limited capacity, transportation economies, and quantity discounts. We propose an integrated branch and bound procedure for solving the model. This procedure, applied to a Lagrangean dual at every node of the search tree, combines the subgradient method with a primal heuristic that interact to change the Lagrangean multipliers and tighten the upper and lower bounds. An enhancement to the branch and bound procedure is developed using surrogate constraints, which is found to be beneficial for solving large problems. We report computational results for a variety of problems, with as many as 70,200 variables and 3665 constraints. Computational testing indicates that our procedure is significantly faster than the general purpose integer programming code OSL. A regression analysis is performed to determine the most significant parameters of our model. © 1998 John Wiley & Sons, Inc. Naval Research Logistics 45: 579–598, 1998