Fitting Lanchester equations to the battles of Kursk and Ardennes

Lanchester equations and their extensions are widely used to calculate attrition in models of warfare. This paper examines how Lanchester models fit detailed daily data on the battles of Kursk and Ardennes. The data on Kursk, often called the greatest tank battle in history, was only recently made available. A new approach is used to find the optimal parameter values and gain an understanding of how well various parameter combinations explain the battles. It turns out that a variety of Lanchester models fit the data about as well. This explains why previous studies on Ardennes, using different minimization techniques and data formulations, have found disparate optimal fits. We also find that none of the basic Lanchester laws (i.e., square, linear, and logarithmic) fit the data particularly well or consistently perform better than the others. This means that it does not matter which of these laws you use, for with the right coefficients you will get about the same result. Furthermore, no constant attrition coefficient Lanchester law fits very well. The failure to find a good‐fitting Lanchester model suggests that it may be beneficial to look for new ways to model highly aggregated attrition. © 2003 Wiley Periodicals, Inc. Naval Research Logistics, 2004.     

一类微分方程组极限环的不存在性

在系统奇点唯一的条件下,研究了一类微分方程组不存在极限环的的充分条件,运用和发展了以往的结果。     

一类非线性脉冲时滞抛物型偏微分方程组解的振动性

讨论了一类含脉冲的时滞抛物型方程组非零解的振动性,利用了Green定理以及Jensen不等式,得出了该方程在Robin边界条件下非零解振动的若干准则。     

Irreducibility of joint inventory positions in an assemble‐to‐order system under (r,nQ) policies

In a typical assemble‐to‐order system, a customer order may request multiple items, and the order may not be filled if any of the requested items are out of stock. A key customer service measure when unfilled orders are backordered is the order‐based backorder level. To evaluate this crucial performance measure, a fundamental question is whether the stationary joint inventory positions follow an independent and uniform distribution. In this context, this is equivalent to the irreducibility of the Markov chain formed by the joint inventory positions. This article presents a necessary and sufficient condition for the irreducibility of such a Markov chain through a set of simultaneous Diophantine equations. This result also leads to sufficient conditions that are more general than those in the published reports. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011     

Lanchester for cyber: The mixed epidemic‐combat model

Future conflict between armed forces will occur both in the physical domain as well as the information domain. The linkage of these domains is not yet fully understood. We study the dynamics of a force subject to kinetic effects as well as a specific network effect–spreading malware. In the course of our study, we unify two well‐studied models: the Lanchester model of armed conflict and deterministic models of epidemiology. We develop basic results, including a rule for determining when explicit modeling of network propagation is required. We then generalize the model to a force subdivided by both physical and network topology, and demonstrate the specific case where the force is divided between front‐ and rear‐echelons. © 2013 Wiley Periodicals, Inc. Naval Research Logistics, 2013     

基于渐进性的线性方程组教学设计的研究

针对线性方程组传统教学中的一些问题,给出了引入线性方程组、解线性方程组、分析解结构的渐进性三步教学设计,同时给出了maple求解线性方程组的两种方法,将理论与实践初步结合了起来,丰富了教学手段,激发了学生的学习兴趣。     

一类广义Liénard方程极限环的不存在性

利用Cauchy问题解的唯一性,研究了一类二阶非线性微分方程极限环的不存在性,得到了在奇点唯一的条件下极限环的不存在的充分条件,所得结果运用和发展了以往的方法。