空地支援多目标模型

本文研究空地支援优化问题。模型的构造是基于目标规划理论。首先建立基础模型,然后根据问题条件,建立多目标模型。     

浅淡军用飞机1553B数据总线网络验收

针对如何进行军用飞机1553B 总线网络的验收,对总线长度,绝缘试验,连续试验,阻抗试验,极性试验,输出电性能试验等诸多验收内容进行了必要的理论分析和探讨,并对具体的测试方法进行了系统的归纳和总结,对军用飞机1553B 数据总线网络的系统设计和综合有实用价值。     

后勤指挥管理自动化系统建设中突破口的选择方法

本文论述了后勤指挥管理自动化系统建设中突破口的3种选择方法,即ABC法、“瓶颈”法和效益扩展法,并且分析了这些方法的应用条件和注意事项。     

火炮技术状况综合评估的数学模型

本文通过对火炮技术状况指标体系的分析,根据专家提供的经验数据,运用Fuzzy 数学理论建立了评价火炮技术状况的数学模型,并以152mm 加榴炮为例,对模型进行了验证.     

A model in which component failure rates depend on the working set

We consider a multicomponent system in which the failure rate of a given component at any time depends on the set of working components at that time. Sufficient conditions are presented under which such a system has a life distribution of specified type. The Laplace transform of the time until all components are down is derived. When repair is allowed, conditions under which the resulting process is time reversible are presented.     

Some results of the queueing system E/M/c

This paper analyses the E/M/c queueing system and shows how to calculate the expected number in the system, both at a random epoch and immediately preceding an arrival. These expectations are expressed in terms of certain initial probabilities which are determined by linear equations. The advantages and disadvantages of this method are also discussed.     

Determining confidence bounds for highly reliable coherent systems based on a paucity of component failures

A computationally simple method for obtaining confidence bounds for highly reliable coherent systems, based on component tests which experience few or no failures, is given. Binomial and Type I censored exponential failure data are considered. Here unknown component unreliabilities are ordered by weighting factors, which are firstly presumed known then sensitivity of the confidence bounds to these assumed weights is examined and shown to be low.     

A heterogeneous arrival and service queueing loss model

Consider a single-server exponential queueing loss system in which the arrival and service rates alternate between the paris (γ₁, γ₁), and (γ₂, μ₂), spending an exponential amount of time with rate cμ_i in (γ_i, μ_i), i = 1.2. It is shown that if all arrivals finding the server busy are lost, then the percentage of arrivals lost is a decreasing function of c. This is in line with a general conjecture of Ross to the effect that the “more nonstationary” a Poisson arrival process is, the greater the average customer delay (in infinite capacity models) or the greater the precentage of lost customers (in finite capacity models). We also study the limiting cases when c approaches 0 or infinity.