时间序列法在军械装备故障预测中的应用

运用时间序列的方法对军械装备使用中的故障进行预测,并以火炮射击的距离偏差、火炮轮胎下沉量为例进行定量的分析和计算,阐述了预测原理和使用方法。     

基于燃油压力波的柴油机高压喷射系故障信息的研究

本文从柴油机燃油压力波的特征出发,建立ARI(Auto—Regressive Integra—ted)时序参数模型.通过对不同故障下的燃油压力波基于ARI时序参数的现代谱分析,说明ARI时序参数模型较好地揭示了燃油压力波蕴含的故障信息.通过燃油压力波的ARI时序参数构造故障诊断模式向量,根据几何距离与信息距离的测度来诊断故障,具有一定的实践意义.     

吊放声纳非探测时间的计算公式

使用吊放声纳探测潜艇是直升机反潜的主要样式。在评价直升机跟踪潜艇和潜艇规避其跟踪的方法中,吊放声纳非探测时间是最主要的参数。此外给出了计算非探测时间的公式。     

内可逆卡诺热泵的生态学优化性能

本文导出了内可逆卡诺热泵的供热量、供热率和供热系数的耗散量,以反映热泵供热率π与其耗散φ_cT_Lσ,即热泵熵产率σ、低温热源温度T_L和可逆供热系数φ_c乘积之间最佳折衷的“生态学”性能E=π-φ_cT_Lσ为目标,基于牛顿和线性唯象传热定律,研究内可逆卡诺热泵的优化问题,得到最大E性能时的供热系数界限及相应的供热率和熵产率。     

Q∝T~n时不可逆卡诺热泵的最优性能

非线性传热条件下的内可逆卡诺热机最优性能有了一些讨论,本文将导出不可逆卡诺热泵工作于非线性传热 Q■条件下,最佳供热系数д与泵热率π的关系。据此可确定任意泵热率时所对应的供热系数界限。最后,讨论了这一关系的一些应用,所得结果包含了经典热力学及内可逆线性传热情况下的有关结论,为实际热泵设计提供新的理论依据。     

Minimizing makespan in a multimode multiprocessor shop scheduling problem

We study the problem of multimode scheduling tasks on dedicated processors, with the objective of minimizing the maximum completion time. Each task can be undertaken in one among a set of predefined alternative modes, where each mode specifies a required set of dedicated processors and a processing time. At any time each processor can be used by a single task at most. General precedence constraints exist among tasks, and task preemption is not allowed. The problem consists of assigning a mode and a starting time to each task, respecting processor and precedence constraints, to minimize the time required to complete all tasks. The problem is NP-hard in several particular cases. In previous works, we studied algorithms in which a solution was obtained by means of an iterative procedure that combines mode assignment and sequencing phases separately. In this paper, we present some new heuristics where the decision on the mode assignment is taken on the basis of a partial schedule. Then, for each task, the mode selection and the starting time are chosen simultaneously considering the current processor usage. Different lower bounds are derived from a mathematical formulation of the problem and from a graph representation of a particular relaxed version of the problem. Heuristic solutions and lower bounds are evaluated on randomly generated test problems. © 1999 John Wiley & Sons, Inc. Naval Research Logistics 46: 893–911, 1999     

Designing a degradation experiment

Degradation experiments are widely used to assess the reliability of highly reliable products which are not likely to fail under the traditional life tests. In order to conduct a degradation experiment efficiently, several factors, such as the inspection frequency, the sample size, and the termination time, need to be considered carefully. These factors not only affect the experimental cost, but also affect the precision of the estimate of a product's lifetime. In this paper, we deal with the optimal design of a degradation experiment. Under the constraint that the total experimental cost does not exceed a predetermined budget, the optimal decision variables are solved by minimizing the variance of the estimated 100pth percentile of the lifetime distribution of the product. An example is provided to illustrate the proposed method. Finally, a simulation study is conducted to investigate the robustness of this proposed method. © 1999 John Wiley & Sons, Inc. Naval Research Logistics 46: 689–706, 1999     

基于多目标决策理论武器装备效能综合评估方法

探讨一种适用范围较大的武器装备效能评估方法。基于多目标决策理论的方法,将武器系统效能评估的量化标尺评价法、模糊评价法、矩阵相乘法(ADC法)和专家评价法等方法结合起来,利用解析的形式,对武器装备的效能评估进行研究,给出了一个综合评价值,能够有效地评估武器装备的效能。这种研究是对量化标尺度量法的扩充。     

Algorithms for computing waiting time distributions under different queue disciplines for the D-BMAP/PH/1

A queueing system characterized by the discrete batch Markovian arrival process (D-BMAP) and a probability of phase type distribution for the service time is one that arises frequently in the area of telecommunications. Under this arrival process and service time distribution we derive the waiting time distribution for three queue disciplines: first in first out (FIFO), last in first out (LIFO), and service in random order (SIRO). We also outline efficient algorithmic procedures for computing the waiting time distributions under each discipline. © 1997 John Wiley & Sons, Inc. Naval Research Logistics 44: 559–576, 1997     

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