火炮射表数据处理方法评述

主要介绍火炮射表数据处理方法,对国内目前较为流行的两种射表逼近方法进行了全面、系统的分析与比较,指出了逐步回归射表逼近方法存在的缺陷和不足。对国外近几年采用的插值法文中也进行了比较详细的讨论,并指出了未来的研究问题。     

双机空战的仿真与分析

用矩阵博弈理论、计算机仿真的方法研究了空战过程,使双机的空中格斗阶段─目标的跟踪、射击、弹道计算及射击效果的评定连续化,并用ＦＯＲＴＲＡＮ─７７语言编程在计算机上进行了Ｆ＿Ａ、Ｆ＿Ｂ两种飞行的空战,仿真结果与实际情况基本一致。本程序具有通用性,可对不同种类的飞机及武器系统的性能作出定性和定量的分析和评估。     

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

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

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

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

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

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

Minimizing sums and products of linear fractional functions over a polytope

In this paper, we develop efficient deterministic algorithms for globally minimizing the sum and the product of several linear fractional functions over a polytope. We will show that an elaborate implementation of an outer approximation algorithm applied to the master problem generated by a parametric transformation of the objective function serves as an efficient method for calculating global minima of these nonconvex minimization problems if the number of linear fractional terms in the objective function is less than four or five. It will be shown that the Charnes–Cooper transformation plays an essential role in solving these problems. Also a simple bounding technique using linear multiplicative programming techniques has remarkable effects on structured problems. © 1999 John Wiley & Sons, Inc. Naval Research Logistics 46: 583–596, 1999     

舰载火箭子母弹最优火力分配

舰载火箭子母弹对岸上目标实施火力压制射击时,火力分配方式直接影响毁伤效果和火力支援任务的完成.针对舰载火箭子母弹的射击特点,首先分析了海上射击误差,然后探讨了集群目标的简化处理方法,最后给出了最优火力分配时表尺差计算公式,并进行了举例分析.利用最优火力分配方法来计算舰载火箭子母弹效力射表尺差,避免了指挥员战场射击指挥的盲目性,可以在相同弹药消耗量情况下取得最佳射击效果,对未来舰载火箭子母弹的火力运用具有较高的现实意义.     

Probabilistic analysis of an asymptotically optimal solution for the completion time variance problem

Scheduling a set of n jobs on a single machine so as to minimize the completion time variance is a well‐known NP‐hard problem. In this paper, we propose a sequence, which can be constructed in O(n log n) time, as a solution for the problem. Our primary concern is to establish the asymptotical optimality of the sequence within the framework of probabilistic analysis. Our main result is that, when the processing times are randomly and independently drawn from the same uniform distribution, the sequence is asymptotically optimal in the sense that its relative error converges to zero in probability as n increases. Other theoretical results are also derived, including: (i) When the processing times follow a symmetric structure, the problem has 2^{⌊(n−1)/2⌋} optimal sequences, which include our proposed sequence and other heuristic sequences suggested in the literature; and (ii) when these 2^{⌊(n−1)/2⌋} sequences are used as approximate solutions for a general problem, our proposed sequence yields the best approximation (in an average sense) while another sequence, which is commonly believed to be a good approximation in the literature, is interestingly the worst. © 1999 John Wiley & Sons, Inc. Naval Research Logistics 46: 373–398, 1999     

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