Soviet military doctrine and the officer rank of the armed forces — 1984     

R. A. Woff 《Defense & Security Analysis》1985,1(3):173-185

  相似文献   

A Systems Theoretic Accident Model Applied to Biodefense     

Joseph R. Laracy 《Defense & Security Analysis》2006,22(3):301-310

  相似文献   

Soviet defense expenditures     

R. T. Maddock 《Defense & Security Analysis》1991,7(4):417-419

  相似文献   

The Sword of Damocles: An Everlasting Bio-Threat?     

Bart R. Smedts 《Defense & Security Analysis》2009,25(4):433-442

  相似文献   

    

Feng Yang  Bruce Ankenman  Barry L. Nelson 《海军后勤学研究》2007,54(1):78-93

A cycle time‐throughput (CT‐TH) curve, which quantifies the relationship of long‐run average cycle time to throughput rate, plays an important role in strategic planning for manufacturing systems. In this paper, a nonlinear regression metamodel supported by queueing theory is developed to represent the underlying CT‐TH curve implied by a manufacturing simulation model. To estimate the model efficiently, simulation experiments are built up sequentially using a multistage procedure. Extensive numerical experiments are presented to demonstrate the effectiveness of the proposed procedure. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2007  相似文献   

    

Jesus R. Artalejo  A. Gómez‐Corral 《海军后勤学研究》2007,54(5):524-529

We consider an M/G/1 retrial queue with finite capacity of the retrial group. First, we obtain equations governing the dynamic of the waiting time. Then, we focus on the numerical inversion of the density function and the computation of moments. These results are used to approximate the waiting time of the M/G/1 queue with infinite retrial group for which direct analysis seems intractable. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007  相似文献   

    

Antoon W.J. Kolen  Jan Karel Lenstra  Christos H. Papadimitriou  Frits C.R. Spieksma 《海军后勤学研究》2007,54(5):530-543

In interval scheduling, not only the processing times of the jobs but also their starting times are given. This article surveys the area of interval scheduling and presents proofs of results that have been known within the community for some time. We first review the complexity and approximability of different variants of interval scheduling problems. Next, we motivate the relevance of interval scheduling problems by providing an overview of applications that have appeared in literature. Finally, we focus on algorithmic results for two important variants of interval scheduling problems. In one variant we deal with nonidentical machines: instead of each machine being continuously available, there is a given interval for each machine in which it is available. In another variant, the machines are continuously available but they are ordered, and each job has a given “maximal” machine on which it can be processed. We investigate the complexity of these problems and describe algorithms for their solution. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007  相似文献   

    

S. zekici  R. Soyer 《海军后勤学研究》2001,48(8):747-763

We consider a software reliability model where the failure rate of each fault depends on the specific operation performed. The software is tested in a given sequence of test cases for fixed durations of time to collect data on failure times. We present a Bayesian analysis of software failure data by treating the initial number of faults as a random variable. Our analysis relies on the Markov Chain Monte Carlo methods and is used for developing optimal testing strategies in an adaptive manner. Two different models involving individual and common faults are analyzed. We illustrate an implementation of our approach by using some simulated failure data. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48:747–763, 2001  相似文献   

    

J. Harrald  J. Leotta  W. A. Wallace  R. E. Wendell 《海军后勤学研究》1978,25(4):733-739

After first formulating the problem of the Marine Environmental Protection program of the Coast Guard as a multiple-objective linear program, we investigate the applicability and limitations of goal programming. We point out how the preemptive goal-programming approach is incompatible with utility preferences. Then we observe the tendency of optimal solutions for standard linear goal programs to occur at extreme points. We also note problems of more general approaches, such as dealing with additively separable approximations to preferences.  相似文献   

    

Nancy R. Mann 《海军后勤学研究》1978,25(1):121-128

Given herein is an easily implemented method for obtaining, from complete or censored data, approximate tolerance intervals associated with the upper tail of a Weibull distribution. These approximate intervals are based on point estimators that make essentially most efficient use of sample data. They agree extremely well with exact intervals (obtained by Monte Carlo simulation procedures) for sample sizes of about 10 or larger when specified survival proportions are sufficiently small. Ranges over which the error in the approximation is within 2 percent are determined. The motivation for investigation of the methodology for obtaining the approximate tolerance intervals was provided by the new formulation of Lanchester Combat Theory by Grubbs and Shuford [3], which suggests a Weibull assumption for time-to-incapacitation of key targets. With the procedures investigated herein, one can use (censored) data from battle simulations to obtain confidence intervals on battle times associated with given low survivor proportions of key targets belonging to either specified side in a future battle. It is also possible to calculate confidence intervals on a survival proportion of key targets corresponding to a given battle duration time.  相似文献