基于马尔可夫过程的坦克火力随机对抗模型

根据小规模坦克火力对抗中所具有的马尔可夫性特点,将该过程视为离散状态、离散时间的马尔可夫随机过程(马尔可夫链),由此建立了坦克与反坦克武器系统之间一对一对抗的随机格斗模型,并给出双方获胜概率和平均对抗回合数的计算公式。最后通过实例验证了模型的有效性。该模型克服了轮流对抗不符合战场实际的缺点,为分队指挥员在射击策略的选择和分队火力运用上的快速决策提供了较为精确的量化依据。     

Threshold incentives over multiple periods and the sales hockey stick phenomenon

In this article, we study threshold‐based sales‐force incentives and their impact on a dealer's optimal effort. A phenomenon, observed in practice, is that the dealer exerts a large effort toward the end of the incentive period to boost sales and reach the threshold to make additional profits. In the literature, the resulting last‐period sales spike is sometimes called the hockey stick phenomenon (HSP). In this article, we show that the manufacturer's choice of the incentive parameters and the underlying demand uncertainty affect the dealer's optimal effort choice. This results in the sales HSP over multiple time periods even when there is a cost associated with waiting. We then show that, by linking the threshold to a correlated market signal, the HSP can be regulated. We also characterize the variance of the total sales across all the periods and demonstrate conditions under the sales variance can be reduced. © 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010     

Book reviews

Third World Military Expenditure: Determinants and Implications. By Robert McKinlay. Frances Pinter, London (1989)

The UK Defence Industrial Base: Development and Future Policy Options. By Trevor Taylor and Keith Hayward. Brassey's, London, for Royal United Services Institute (1989), ISBN 0-08-036713-5, £22.50

Mutiny. By Lawrence James. Buchan & Enright, London (1987), ISBN 0-907675-70-0, £12.95; Scapegoat! Famous Courts Martial. By John Harris. Severn House, London (1988), ISBN 0-7278-2103-2, £12.95; In Glass Houses. By Robert Boyes. Military Provost Staff Corps Association, Colchester (1986), ISBN 0-9513467-0-9, £6.50 (paperback)

The Nuclear Weapons World: Who, How and Where. Edited by Patrick Burke. Frances Pinter, London (1988), ISBN 086187-705-5, £50.00

Merchants of Treason—America's Secrets for Sale. By Thomas B. Allen and Norman Polmar. Robert Hale, London (1988), ISBN 0-7090-3543-8, £14.95 ($21.95); Intelligence and Intelligence Policy in a Democratic Society. Edited by Stephen J. Cimbala. Transnational Publishers, Dobbs Ferry, NY (1987), ISBN 0-941320-44-8, $37.50; Catching Spies—Principles and Practices of Counterespionage. By H. H. A. Cooper and Lawrence J. Redlinger. Paladin Press, Boulder, CO (1988), ISBN 0-87364-466-2, $24.95

The BattleshipRoyal Sovereignand Her Sister Ships. By Peter C. Smith. William Kimber, Wellingborough (1988), ISBN 0-7183-0704-6, £12.95; Air Power at Sea, 1945 to Today. By John Winton. Sidgwick & Jackson, London (1987), £9.95     

Book reviews

British Military History: a Supplement to Robin Higham's Guide to the Sources.. Edited by Gerald Jordan. Garland, New York (1988), xii + 586 pp., $75.00

Red Duster at War. By John Slader. William Kimber, London (1988), 352 pp., £15.50

Armed Services and Society. By Martin Edmonds. Leicester University Press, Leicester (1988), 226 pp., £25.00     

Closure properties of the relevation transform*

Sufficient conditions under which the relevation of two probability distributions is (i) NBU, (ii) IFRA, (iii) IFR are derived. The result for case (iii) corrects an error in a previous article by Baxter.     

One-facility location with rectilinear tour distances

This article concerns the location of a facility among n points where the points are serviced by “tours” taken from the facility. Tours include m points at a time and each group of m points may become active (may need a tour) with some known probability. Distances are assumed to be rectilinear. For m ≤ 3, it is proved that the objective function is separable in each dimension and an exact solution method is given that involves finding the median of numbers appropriately generated from the problem data. It is shown that the objective function becomes multimodal when some tours pass through four or more points. A bounded heuristic procedure is suggested for this latter case. This heuristic involves solving an auxiliary three-point tour location problem.     

On finding spanning eulerian subgraphs

In this article, we examine the problem of producing a spanning Eulerian subgraph in an undirected graph. After the ?-completeness of the general problem is established, we present polynomial-time algorithms for both the maximization and minimization versions where instances are defined on a restricted class of graphs referred to as series-parallel. Some novelties in the minimization case are discussed, as are heuristic ideas.