Limit laws in the best of 2n - 1 bernoulli trials

A series of independent Bernoulli trials is considered in which either an outcome of type A or type B occurs at each trial. The series terminates when n outcomes of one type have occurred. Two observable random variables of interest are the total number of outcomes in the series and the number of outcomes of the “losing kind.” Two methods of approximation of the expectations of these random variables for large n are obtained and compared. The limiting distribution of the number of outcomes of the “losing kind” is considered when a beta distribution is assigned to p.     

On the (S − 1, S) lost sales inventory model with priority demand classes

In this paper an inventory model with several demand classes, prioritised according to importance, is analysed. We consider a lot‐for‐lot or (S ? 1, S) inventory model with lost sales. For each demand class there is a critical stock level at and below which demand from that class is not satisfied from stock on hand. In this way stock is retained to meet demand from higher priority demand classes. A set of such critical levels determines the stocking policy. For Poisson demand and a generally distributed lead time, we derive expressions for the service levels for each demand class and the average total cost per unit time. Efficient solution methods for obtaining optimal policies, with and without service level constraints, are presented. Numerical experiments in which the solution methods are tested demonstrate that significant cost reductions can be achieved by distinguishing between demand classes. © 2002 Wiley Periodicals, Inc. Naval Research Logistics 49: 593–610, 2002; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/nav.10032     

On a ruckle problem in discrete games of ambush

The following zero-sum game is considered. Red chooses in integer interval [1, n] two integer intervals consisting of k and m points where k + m < n, and Blue chooses an integer point in [1, n]. The payoff to Red equals 1 if the point chosen by Blue is at least in one of the intervals chosen by Red, and 0 otherwise. This work complements the results obtained by Ruckle, Baston and Bostock, and Lee. © 1997 John Wiley & Sons, Inc. Naval Research Logistics 44: 353–364, 1997     

关于具有给定极点的有理函数导数的不等式

给出了一类具有给定极点的有理函数的导数在Lp 尺度下的Varma型和Turán型不等式,从而推广了有关文献中关于多项式的著名不等式.     

Optimal (τ, T) opportunistic maintenance of a k‐out‐of‐n:G system with imperfect PM and partial failure

The opportunistic maintenance of a k‐out‐of‐n:G system with imperfect preventive maintenance (PM) is studied in this paper, where partial failure is allowed. In many applications, the optimal maintenance actions for one component often depend on the states of the other components and system reliability requirements. Two new (τ, T) opportunistic maintenance models with the consideration of reliability requirements are proposed. In these two models, only minimal repairs are performed on failed components before time τ and the corrective maintenance (CM) of all failed components are combined with PM of all functioning but deteriorated components after τ; if the system survives to time T without perfect maintenance, it will be subject to PM at time T. Considering maintenance time, asymptotic system cost rate and availability are derived. The results obtained generalize and unify some previous research in this area. Application to aircraft engine maintenance is presented. © 2000 John Wiley & Sons;, Inc. Naval Research Logistics 47: 223–239, 2000     

J. Baik,D.N.P. Murthy,N. Jack, “Two‐dimensional failure modeling with minimal repair,” Naval Research Logistics(2004) 51(3) 345–362

The original article to which this erratum refers was published in Naval Research Logistics Naval Res Logist(2004)51 (345–362     

Reliability of a 2‐dimensional k‐within‐consecutive‐r × s‐out‐of‐m × n:F system

A 2‐dimensional rectangular (cylindrical) k‐within‐consecutive‐r × s‐out‐of‐m × n:F system is the rectangular (cylindrical) m × n‐system if the system fails whenever k components in a r × s‐submatrix fail. This paper proposes a recursive algorithm for the reliability of the 2‐dimensional k‐within‐consecutive‐r × s‐out‐m × n:F system, in the rectangular case and the cylindrical case. This algorithm requires min ( O (mk^r(n?s)), O (nk^s(m?r))), and O (mk^rn) computing time in the rectangular case and the cylindrical case, respectively. The proposed algorithm will be demonstrated and some numerical examples will be shown. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48: 625–637, 2001.     

A lost sales (S — 1, S) perishable inventory system with renewal demand

This article analyzes a one-to-one ordering perishable inventory model with renewal demands and exponential lifetimes. The leadtimes are independently and exponentially distributed and the demands that occur during stock out periods are lost. Although the items are assumed to decay at a constant rate, the output process is not renewal and the Markov renewal techniques are successfully employed to obtain the operating characteristics. The problem of minimizing the long run expected cost rate is discussed and numerical values of optimal stock level are also provided. © 1996 John Wiley & Sons, Inc.     

基于遗传算法的(n,n-1,m)卷积码盲识别

针对信息截获领域中(n,n-1,m)卷积码盲识别问题,提出基于遗传算法的盲识别方法。该方法在矩阵分析得到编码参数之后,利用遗传算法的全局搜索能力实现对基本校验多项式矩阵的精确识别,进而实现对基本生成多项式矩阵的识别。仿真表明:该方法能够在高误码条件下实现对(n,n-1,m)卷积码的盲识别,且运算量相对于以往的高容错识别方法得到降低。     

Explicit solution of partitioning problems over a 1‐dimensional parameter space

We consider a class of partitioning problems where the partitioned set is a finite set of real numbers and the objective function of a partition is a function of the vector whose coordinates are the sums of the elements in each part of the given partition (the number of such parts is assumed given). We obtain an explicit solution of such partitioning problem with polynomial complexity bounds. © John Wiley & Sons, Inc. Naval Research Logistics 47: 531–540, 2000     

On the set of (perfect) equilibria of a bimatrix game

This article provides a new approach to the set of (perfect) equilibria. With the help of an equivalence relation on the strategy space of each player. Nash sets and Selten sets are introduced. The number of these sets is finite and each of these sets is a polytope. As a consequence the set of (perfect) equilibria is a finite union of polytopes. © 1994 John Wiley & Sons. Inc.     

“又＋动1＋又＋动2”格式之考察

本文对收集到的＂又＋动1＋又＋动2＂格式的语料进行了定量、定性分析,从它的构成形式、语义特点、位序特点、语法功能四个方面概括了这一格式的特点,并比较分析了这一格式与＂又＋形1＋又＋形2＂格式的相同点和不同点,以及与其它并列格式的区别。以期对＂又A又B＂格式的特点有个更全面、准确地把握。     

汉乐府名篇教学探析

乐府是汉代文学的重要部分,对五言诗歌的成熟起了极为重要的作用。在古代文学的教学过程中,将汉乐府和先秦时期的诗经、楚辞进行比较,从思想内容、叙事艺术、人物形象等方面解读汉乐府中的名篇,可以让学生更好地理解掌握汉代文学的特点。     

4-羟甲基-2,6,7-三氧杂二环(2.2.2)辛烷的合成

介绍了双环原酸酯个4-羟甲基-2,6,7-二氧杂二环（2．2．2）辛烷的合成方法,并提供了一条简单可行的合成途径．     

On estimating the reliability of a component subject to several different stresses (strengths)

This paper is concerned with estimating p = P(X₁ < Y …, X_n < Y) or q =P (X < Y₁, …, X < Y_n) where the X's and Y's are all independent random variables. Applications to estimation of the reliability p from stress-strength relationships are considered where a component is subject to several stresses X₁, X₂, …, X_N whereas its strength, Y, is a single random variable. Similarly, the reliability q is of interest where a component is made of several parts all with their individual strengths Y₁, Y₂ …, Y_N and a single stress X is applied to the component. When the X's and Y's are independent and normal, maximum likelihood estimates of p and q have been obtained. For the case N = 2 and in some special cases, minimum variance unbiased estimates have been given. When the Y's are all exponential and the X is normal with known variance, but unknown mean (or uniform between 0 and θ, θ being unknown) the minimum variance unbiased estimate of q is established in this paper.     

Nonrobustness of the normal approximation of lead‐time demand in a (Q,R) system

For computing an optimal (Q, R) or kindred inventory policy, the current literature provides mixed signals on whether or when it is safe to approximate a nonnormal lead‐time‐demand (“LTD”) distribution by a normal distribution. The first part of this paper examines this literature critically to justify why the issue warrants further investigations, while the second part presents reliable evidence showing that the system‐cost penalty for using the normal approximation can be quite serious even when the LTD‐distribution's coefficient of variation is quite low—contrary to the prevalent view of the literature. We also identify situations that will most likely lead to large system‐cost penalty. Our results indicate that, given today's technology, it is worthwhile to estimate an LTD‐distribution's shape more accurately and to compute optimal inventory policies using statistical distributions that more accurately reflect the LTD‐distributions' actual shapes. © 2003 Wiley Periodicals, Inc. Naval Research Logistics, 2003     

刑法修正案（五）新增军事犯罪的罪名探析

对《刑法修正案(五)》第三条增设的过失军事犯罪的具体罪名,刑法学界和司法实务界存在分歧。通过对用词的分析,根据罪名的确定原则,认为最佳选择的罪名是"过失损坏武器装备、军事设施、军事通信罪"。     

新时期武器装备动员体系研究(一)

现代战争是体系与体系的对抗,战争节奏明显加快,战争消耗特别是武器装备消耗不断增大,部队的现有装备远远不能满足战争的需求,武器装备动员是国家为满足战争对武器装备的需求,有计划、有组织地提高武器装备研制能力、战时生产能力和保障能力的活动,在战争准备中的地位逐渐突出起来。战争消耗带来武器装备体系结构的变化,在体系与体系对抗的高技术战争中,科学合理的武器装备体系,并在战争中维持这种良好的状态,使之保持动态的平衡,是获得战争胜利的关键。换言之,只有在战争的过程中,不断地对消耗的武器装备进行补充,才能维持武器装备体系结构…     

Optimal policies for M/M/m queue with two different kinds of (N,T)‐policies

In this paper, two different kinds of (N, T)‐policies for an M/M/m queueing system are studied. The system operates only intermittently and is shut down when no customers are present any more. A fixed setup cost of K > 0 is incurred each time the system is reopened. Also, a holding cost of h > 0 per unit time is incurred for each customer present. The two (N, T)‐policies studied for this queueing system with cost structures are as follows: (1) The system is reactivated as soon as N customers are present or the waiting time of the leading customer reaches a predefined time T, and (2) the system is reactivated as soon as N customers are present or the time units after the end of the last busy period reaches a predefined time T. The equations satisfied by the optimal policy (N*, T*) for minimizing the long‐run average cost per unit time in both cases are obtained. Particularly, we obtain the explicit optimal joint policy (N*, T*) and optimal objective value for the case of a single server, the explicit optimal policy N* and optimal objective value for the case of multiple servers when only predefined customers number N is measured, and the explicit optimal policy T* and optimal objective value for the case of multiple servers when only predefined time units T is measured, respectively. These results partly extend (1) the classic N or T policy to a more practical (N, T)‐policy and (2) the conclusions obtained for single server system to a system consisting of m (m ≥ 1) servers. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 240–258, 2000