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

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

表格驱动程序设计方法

本文提出了一种具有广泛应用前景的程序设计方法——表格驱动(Formdriven)程序设计方法(以下简称表格驱动法)。文中首先描述了表格驱动法的基本思想、解的结构;分析了这种方法的特点与适用性;剖析了基于表格驱动法的办公自动化软件ALL-IN-1的设计思想,并指出表格驱动法特别适合于设计软件开发工具。     

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

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

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

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

高能电磁脉冲武器对计算机系统的毁伤及防护措施

探讨了国外军事强国在高能电磁脉冲武器毁伤计算机系统及计算机防护的研究领域的发展状况,介绍了近年来高能电磁脉冲武器毁伤计算机系统的作用机理、破坏作用,尤其是对C4I计算机系统的破坏,对计算机抗毁防护技术做了详尽的介绍.建议我国应该进入相关研究领域,并持续跟踪、研究各国先进技术,以引起我国对此项研究的重视,为加强抗毁伤技术提供信息.     

A nonparametric Bayes approach to decide system burn-in time

Burn-in is the preconditioning of assemblies and the accelerated power-on tests performed on equipment subject to temperature, vibration, voltage, radiation, load, corrosion, and humidity. Burn-in techniques are widely applied to integrated circuits (IC) to enhance the component and system reliability. However, reliability prediction by burn-in at the component level, such as the one using the military (e.g., MIL-STD-280A, 756B, 217E [23–25]) and the industrial standards (e.g., the JEDEC standards), is usually not consistent with the field observations. Here, we propose system burn-in, which can remove many of the residual defects left from component and subsystem burn-in (Chien and Kuo [6]). A nonparametric model is considered because 1) the system configuration is usually very complicated, 2) the components in the system have different failure mechanisms, and 3) there is no good model for modeling incompatibility among components and subsystems (Chien and Kuo [5]; Kuo [16]). Since the cost of testing a system is high and, thus, only small samples are available, a Bayesian nonparametric approach is proposed to determine the system burn-in time. A case study using the proposed approach on MCM ASIC's shows that our model can be applied in the cases where 1) the tests and the samples are expensive, and 2) the records of previous generation of the products can provide information on the failure rate of the system under investigation. © 1997 John Wiley & Sons, Inc. Naval Research Logistics 44: 655–671, 1997     

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     

Locating a target from directional data

Statistical estimation plays an important role in locating a target in space, a task that has important applications in many areas. However, theoretical measures on the quality of various estimators reported in the literature have been difficult to obtain because of mathematical complications. As a result, choice of estimator in practice has been largely arbitrary. In this paper, we present a systematic study on major target estimators reported in the literature. Focus is on comparisons between the traditional angle method, the line method, and a recently developed line-to-point transformation method. Insights gained from the study directly lead to the development of a novel two-stage angle method that not only produces highly accurate target estimation among all known estimators but is also computationally efficient. © 1998 John Wiley & Sons, Inc. Naval Research Logistics 45: 353–364, 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