广义Liénard方程Poincaré分岔极限环的唯一性和不存在性

讨论了一类广义Linard方程x¨+f1(x)x.2+εf2(x)x.+g(x)=0的Poincar分岔极限环的唯一性和不存在性。将不对Abel积分进行分项,而是利用一阶Mel′nikov函数直接从整体上进行分析讨论,得出了若干判别准则和充分条件。     

Production planning with resources subject to congestion

A fundamental difficulty in developing effective production planning models has been accurately reflecting the nonlinear dependency between workload and lead times. We develop a mathematical programming model for production planning in multiproduct, single stage systems that captures the nonlinear dependency between workload and lead times. We then use outer linearization of this nonlinear model to obtain a linear programming formulation and extend it to multistage systems. Extensive computational experiments validate the approach and compare its results to conventional models that assume workload‐independent planning lead times. © 2009 Wiley Periodicals, Inc. Naval Research Logistics, 2009     

模糊理论与D-S理论在指控系统目标识别融合中的应用

多传感器信息融合技术已获得了普遍的关注和广泛的应用,其理论和方法已成为智能信息处理的一个重要领域,模糊理论与证据理论(D-S)是主要的技术之一.在某试飞指控系统中,为了获得可靠的识别结果需要目标识别的融合问题.系统的从实际出发提出了基于模糊理论与D-S理论的目标识别融合方法.仿真计算结果表明,该模型和方法具有方法简单、运算量小和识别结果可靠等优点,具有一定的理论意义和使用价值.     

舰船空调系统不同保障模式的效费分析

分析了舰船全寿命期和使用期的结构,在此基础上,借助于WSEIAC模型,分别对舰船空调系统在两种保障方式的全寿命使用期效能和费用的各个指标进行了建模,提出了指标计算的思路与计算方法.结合海军舰船特点,在对WSEIAC效能模型进行修改和完善的基础上,给出了计算示例,结果显示了海军舰船空调系统采用岸基保障方式的合理性和优越性.     

Nonpreemptive scheduling of independent tasks with prespecified processor allocations

In this article we study the problem of scheduling independent tasks, each of which requires the simultaneous availability of a set of prespecified processors, with the objective of minimizing the maximum completion time. We propose a graph-theoretical approach and identify a class of polynomial instances, corresponding to comparability graphs. We show that the scheduling problem is polynomially equivalent to the problem of extending a graph to a comparability graph whose maximum weighted clique has minimum weight. Using this formulation we show that in some cases it is possible to decompose the problem according to the canonical decomposition of the graph. Finally, a general solution procedure is given that includes a branch-and-bound algorithm for the solution of subproblems which can be neither decomposed nor solved in polynomial time. Some examples and computational results are presented. © 1994 John Wiley & Sons, Inc.     

Bayesian inference for a Lanchester type combat model

We undertake inference for a stochastic form of the Lanchester combat model. In particular, given battle data, we assess the type of battle that occurred and whether or not it makes any difference to the number of casualties if an army is attacking or defending. Our approach is Bayesian and we use modern computational techniques to fit the model. We illustrate our method using data from the Ardennes campaign. We compare our results with previous analyses of these data by Bracken and Fricker. Our conclusions are somewhat different to those of Bracken. Where he suggests that a linear law is appropriate, we show that the logarithmic or linear‐logarithmic laws fit better. We note however that the basic Lanchester modeling assumptions do not hold for the Ardennes data. Using Fricker's modified data, we show that although his “super‐logarithmic” law fits best, the linear, linear‐logarithmic, and logarithmic laws cannot be ruled out. We suggest that Bayesian methods can be used to make inference for battles in progress. We point out a number of advantages: Prior information from experts or previous battles can be incorporated; predictions of future casualties are easily made; more complex models can be analysed using stochastic simulation techniques. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 541–558, 2000     

Exploiting self‐canceling demand point aggregation error for some planar rectilinear median location problems

When solving location problems in practice it is quite common to aggregate demand points into centroids. Solving a location problem with aggregated demand data is computationally easier, but the aggregation process introduces error. We develop theory and algorithms for certain types of centroid aggregations for rectilinear 1‐median problems. The objective is to construct an aggregation that minimizes the maximum aggregation error. We focus on row‐column aggregations, and make use of aggregation results for 1‐median problems on the line to do aggregation for 1‐median problems in the plane. The aggregations developed for the 1‐median problem are then used to construct approximate n‐median problems. We test the theory computationally on n‐median problems (n ≥ 1) using both randomly generated, as well as real, data. Every error measure we consider can be well approximated by some power function in the number of aggregate demand points. Each such function exhibits decreasing returns to scale. © 2003 Wiley Periodicals, Inc. Naval Research Logistics 50: 614–637, 2003.     

Military Ethics and the Situationist Critique

Many contributors to military ethics from diverse locations and philosophical perspectives maintain that virtues are central to martial theory and practice. Yet several contemporary philosophers and psychologists have recently challenged the empirical adequacy of this perspective. Their challenge is known as the situationist critique, a version of which asserts that: (a) situational features rather than character traits such as virtues cause and explain human behavior, and (b) ethical theories and development programs are empirically inadequate to the extent that they incorporate virtues. In this paper, I assess the merit of this critique and consider some implications of my assessment for military practitioners and theorists.     

ADVANCING THE GOALS OF NPT ARTICLE VI

International technical cooperation on issues relevant to the challenges of nuclear disarmament can demonstrate commitment to obligations under Article VI of the Treaty on the Non-Proliferation of Nuclear Weapons, strengthen the security of fissile materials and weapons, and develop technical approaches to support more ambitious disarmament activities in the future. Including non-nuclear weapon states would ensure that their views are taken into account and would invest them in developing solutions to key challenges. This article discusses three areas for technical cooperation that would build on past activities and that could produce such benefits as improved protection, control, and accounting of nuclear weapons and fissile material; enhanced transparency for nuclear weapon complexes; and mechanisms for international management of sensitive civilian nuclear facilities. International cooperation in each of these areas could provide a technical basis for pursuing possible future disarmament negotiations and substantively demonstrate commitment to Article VI.     

一类平面系统极限环的不存在性

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