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

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

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

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

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     

一种多通道武器控制台的可靠性预计分析

对设计的一种多通道武器控制台的可靠性进行了预估分析.采用元器件计数法和元器件应力分析法,得出了模块级的失效率.按照系统串联结构的可靠性框图,计算出系统的失效率、平均无故障工作时间等可靠性指标.结果表明,预计值满足了系统规定的使用要求.     

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     

超高斯随机振动环境的疲劳强化机理

针对可靠性强化试验的全轴随机振动环境的超高斯幅值分布特性开展其疲劳强化机理研究。首先通过理论分析表明RS机振动激励下试件应力仍保持超高斯分布,然后证明了同等量级下的超高斯分布比高斯分布随机应力具有更高的疲劳强化效能,从而揭示RS机全轴随机振动环境超高斯幅值分布特性的疲劳强化机理。     

可靠度限制下相控阵雷达天线阵面T/R单元维修模型

为了描述维修活动对相控阵雷达天线阵面系统的影响,构建了以可靠度为基础的“修旧不如新”定期维修优化模型。对相控阵雷达T/R单元失效下的天线性能参数进行分析,根据指标确定系统不能正常工作的失效T/R单元阈值; 针对大部分维修活动都难以使T/R单元修复如新的事实,引入失效率递增因子,在系统一定的可靠度水平上,以相控阵雷达系统的使用可用度和维修费用率为优化决策参数,建立了系统的维修优化模型,并运用边际效能算法对系统的最佳预防换件维修周期和换件维修组数量进行求解。实例运算结果表明,该模型突破了已有模型“修旧如新”的限制条件,更符合实际,能为维修策略的制定提供理论依据。     

Pairwise model discrimination with applications in lifetime distributions and degradation processes

Reliability data obtained from life tests and degradation tests have been extensively used for purposes such as estimating product reliability and predicting warranty costs. When there is more than one candidate model, an important task is to discriminate between the models. In the literature, the model discrimination was often treated as a hypothesis test and a pairwise model discrimination procedure was carried out. Because the null distribution of the test statistic is unavailable in most cases, the large sample approximation and the bootstrap were frequently used to find the acceptance region of the test. Although these two methods are asymptotically accurate, their performance in terms of size and power is not satisfactory in small sample size. To enhance the small‐sample performance, we propose a new method to approximate the null distribution, which builds on the idea of generalized pivots. Conventionally, the generalized pivots were often used for interval estimation of a certain parameter or function of parameters in presence of nuisance parameters. In this study, we further extend the idea of generalized pivots to find the acceptance region of the model discrimination test. Through extensive simulations, we show that the proposed method performs better than the existing methods in discriminating between two lifetime distributions or two degradation models over a wide range of sample sizes. Two real examples are used to illustrate the proposed methods.