争议不断的M16/M4

据美联社报道,近来西方军事评论界又重新开始热炒争议不断的M16／M4系列步枪,原因是阿富汗战场上的M4,就如同它的前辈当年初上越南战场一样,杀伤力弱,故障频频,从而引发如潮恶评。一位军事评论家不无揶揄地说,M16／M4的优点几乎和缺点一样突出,几十年前如果说它还算得上是引领世界轻武器小口径化的潮流先锋,还可堪使用的话;那么现在是时候将它扫进历史的垃圾堆了。事实真是如此吗,接下来就让我们细勘其详。     

M120和M121式迫击炮系统

Ｍ１２０／Ｍ１２１式迫击炮系统是本世纪末美陆军兵力投送部队的主要装备。本文概述该系统的一些作战性能。     

部分服务台同步多重休假的GI/M/c稳态等待时间

在前期研究的基础上,利用概率计算的方法,研究了在经典GI/M/c排队系统中引入部分服务台同步多重休假策略后的稳态等待时间及其随机分解.     

部分服务台同步多重休假的GI/M/c稳态队长

在经典GI/M/c排队中引入部分服务台同步多重休假策略,利用拟单生过程和矩阵几何解的方法,求解系统的稳态队长分布及其条件随机分解。     

M/G/1(RVT,P(j))排队系统的另一分析方法及其应用

M/G/1(RVT,P(j))表示服务员具有随机长度休息时间(RVT)的、且一休息时间结束时有 j 个顾客等待的概率为 P(j)的、修正的 M/G/1 排队系统。我们用嵌入 Markov 链的技术已详细地分析过这一排队系统,这里提供另一分析方法。最后,应用这个排队系统的分析结果,对时隙 ALOHA 卫星公用信道的分组碰撞概率计算公式作了推导。     

核中坚法国M51潜射型洲际弹道导弹

M51潜射型洲际弹道导弹是法国正在研发的最新一代核导弹,其战斗部可以安装一枚或多枚分导式核弹头,预计2010年首先服役于第4艘凯旋级核潜艇——“可畏”号上。作为法国M系列核导弹的最新成员,M51导弹拥有更加灵活的机动性、更强的生存能力和突防能力,是法国力图保持其21世纪核武领先优势的重磅“撒手锏”。     

"M/M/1"在单火力单元射击多目标火力分配中的应用

在单服务台排队系统理论的基础上,建立了单火力单元对多个目标射击的系统仿真模型,对此模型进行了分析,给出了模型的适用范围,并通过在计算机上仿真运行实例,验证了该仿真模型的正确性.该方法是一种有益的尝试与探索,对局部作战指挥决策有一定的参考价值.     

用Excel演示大M单纯形法

大M单纯形法简称大M法。在大M法中,要求M足够大,通常,M作为符号参与运算。大M法单纯形中的数据均可表为aM＋b的形式,如果用有序数对〈a,b〉等价表示aM＋b,则大M法单纯形中的M被形式上消去,使得,大M法可用Excel演示。     

美国柯尔特SR15 M5狙击步枪

SR15是美国著名的柯尔特公司在M16枪族基础上改进的狙击步枪,据称是目前射速最快的狙击步枪。它采用了典型的M16步枪的机匣,有20英寸枪管的M5和16英寸枪管的M4两种型号,此外还有种采用20英寸重型枪管的专用比赛型。     

M1A2主战坦克:美国陆军数字化部队的先行者

M1A2“艾布拉姆斯”主战坦克与M2A2“布雷德利”步兵战斗车、RAH-66“科曼奇”侦察/攻击直升机、“十字军战士”火炮系统、数字化单兵武器系统五种主要装备一起,被视为美国数字化部队的“五大件”。而M1A2作为信息时代的第一个武器系统,又被视为美军数字化道路上的“先行者”,迄今为     

随机环境中的M/MY/1排队系统

文献［４］讨论了随机环境中的Ｍ／Ｍ／１排队模型，本文提出和讨论随机环境中的Ｍ／Ｍｙ／１排队模型，在统计平衡条件下给出了队长和等待队长的平稳分布以及平均队长和平均等待队长，得到了等待时间和逗留时间分布以及平均等待时间和平均逗留时间。     

Performance analysis of queue length monitoring of M/G/1 systems

This study investigates the statistical process control application for monitoring queue length data in M/G/1 systems. Specifically, we studied the average run length (ARL) characteristics of two different control charts for detecting changes in system utilization. First, the nL chart monitors the sums of successive queue length samples by subgrouping individual observations with sample size n. Next is the individual chart with a warning zone whose control scheme is specified by two pairs of parameters, (upper control limit, d_u) and (lower control limit, d_l), as proposed by Bhat and Rao (Oper Res 20 (1972) 955–966). We will present approaches to calculate ARL for the two types of control charts using the Markov chain formulation and also investigate the effects of parameters of the control charts to provide useful design guidelines for better performance. Extensive numerical results are included for illustration. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011     

基于复杂排队系统的TOC服务模型与性能分析

三值光学计算机的运算请求处理过程缺乏合理、系统的性能评价标准与体系。基于M/M/1、M/M/n、MX/M/1和M/MB/1构成的复杂排队系统,构建了三值光学计算机的四阶段服务模型,同时建立了立即调度和结束时调度两种不同策略与算法。基于不同排队系统讨论了运算请求的接收时间、预处理时间、运算时间和发送时间的计算方法,进而得到最终响应时间。最后,通过仿真实验对两种策略的模型进行验证,结果表明结束时调度策略明显优于立即调度策略。     

M/M/1 queues with interdependent arrival and service processes

We study via simulation an M/M/1 queueing system with the assumption that a customer's service time and the interarrival interval separating his arrival from that of his predecessor are correlated random variables having a bivariate exponential distribution. We show that positive correlation reduces the mean and variance of the total waiting time and that negative correlation has the opposite effect. By using spectral analysis and a nonparametric test applied to the sample power spectra associated with certain simulated waiting times we show the effect to be statistically significant.     

Customer delays in M/M/c repair systems with spares

A service center to which customers bring failed items for repair is considered. The items are exchangeable in the sense that a customer is ready to take in return for the failed item he brought to the center any good item of the same kind. This exchangeability feature makes it possible for the service center to possess spares. The focus of the article is on customer delay in the system—the time that elapses since the arrival of a customer with a failed item and his departure with a good one—when repaired items are given to waiting customers on a FIFO basis. An algorithm is developed for the computation of the delay distribution when the item repair system operates as an M/M/c queue.     

A queuing process with bilevel hysteretic service-rate control

The purpose of this paper is to analyze the effect of a particular control doctrine applied to the service mechanism of a queuing process. A bilevel hysteretic control based on queue length control levels is employed in an M/M/1 queuing system. Expressions are obtained for queue length probabilities, the first two factorial moments of queue length and two figures of merit for describing control performance under the assumption of statistical equilibrium. Computational examples illustrate the effects on queuing processes subject to this type of control. Several cost formulae are considered for comparison of costs when the queue control doctrine is varied. Situations in which hysteretic control is useful are discussed.     

Some properties of optimal control policies for entry to an M/M/1 queue

Customers served by an M/M/1 queueing system each receive a reward R but pay a holding cost of C per unit time (including service time) spent in the system. The decision of whether or not a customer joins the queue can be made on an individual basis or a social basis. The effect of increasing the arrival rate on the optimal policy parameters is examined. Some limiting results are also derived.     

An application of the reflection principle to the transient analysis of the M/M/1 queue

This paper applies the well-known reflection principle for random walks to the analysis of the transient M/M/1 queueing system. A closed-form solution is obtained for the probability that exactly i arrivals and j departures occur over an interval of length t in an M/M/1 queueing system that contains n users at the beginning of the interval. The derivation of this probability is based on the calculation of the number of paths between two points in a two-dimensional −y coordinate system that lie above the x axis and touch the x axis exactly r times. This calculation is readily performed through the application of the reflection principle.