提高CCD作探测器的传函仪测量精度的方法分析

对CCD作探测器的光学传函仪产生测量误差的主要原因进行分析 ,给出了每一种误差因素的消除方法。采用这些消除方法 ,可大大提高传递函数的测量精度     

微分算子插值样条解析性质的一种新证法

讨论带线性泛函约束的微分算子插值样条 ,在空间Wm2 中给出了由约束泛函和微分算子构造再生核的普遍方法 ,利用微分算子及其共轭微分算子零空间基底之间的关系得到了微分算子插值样条解析性质新的推导方法。     

The multivariate Polya distribution in combat modeling

This paper investigates the multivariate Polya distribution (MPD) for application in combat models for which enemy targets must be randomly assigned to fighting units. Six sets of actual combat data motivate the allocation model. Scenarios include air‐to‐air combat, tank, and submarine warfare. Goodness of fit tests are derived which verify the validity of the MPD, and reinforce the notion that multinomial allocation is too simplistic for such combat models. Simulations to determine optimal allocations for minimal combat cost are applied in order to illustrate the role of the MPD in combat modeling. © 2001 John Wiley & Sons,Inc. Naval Research Logistics 48: 1–17, 2001     

相对论带电粒子与电磁波包之间的相互作用

研究了相对论带电粒子与电磁波包之间的相互作用,给出了带电粒子运动方程的严格解,得出了粒子的位置、速度和能量的显示表达式。本文结果对基础等离子体物理、自由电子激光、高功率微波和粒子加速器等领域具有一定的参考意义。     

Solution algorithms for the parallel replacement problem under economy of scale

We consider the parallel replacement problem in which machine investment costs exhibit economy of scale which is modeled through associating both fixed and variable costs with machine investment costs. Both finite- and infinite-horizon cases are investigated. Under the three assumptions made in the literature on the problem parameters, we show that the finite-horizon problem with time-varying parameters is equivalent to a shortest path problem and hence can be solved very efficiently, and give a very simple and fast algorithm for the infinite-horizon problem with time-invariant parameters. For the general finite-horizon problem without any assumption on the problem parameters, we formulate it as a zero-one integer program and propose an algorithm for solving it exactly based on Benders' decomposition. Computational results show that this solution algorithm is efficient, i.e., it is capable of solving large scale problems within a reasonable cpu time, and robust, i.e., the number of iterations needed to solve a problem does not increase quickly with the problem size. © 1998 John Wiley & Sons, Inc. Naval Research Logistics 45: 279–295, 1998     

Single machine sequencing with linear models of release dates

The paper deals with a problem of scheduling a set of jobs on a single machine. Before a job is released for processing, it must undergo some preprocessing treatment that consumes resources. It is assumed that the release date of a job is a linear decreasing continuous function of the amount of a locally and globally constrained, continuously divisible resource (e.g., energy, catalyzer, financial outlay, gas). The problem is to find a sequence of jobs and a resource allocation that will minimize the maximum job completion time. Such a problem appears, for example, in the ingot preheating and hot-rolling process in steel mills. It is shown that the problem is strongly NP-hard. Some polynomially solvable cases of the problem and approximate algorithms with both experimental and worst-case analysis are presented. © 1998 John Wiley & Sons, Inc. Naval Research Logistics 45: 99–113, 1998     

Attrition models of the Ardennes campaign

This paper revisits the modeling by Bracken [3] of the Ardennes campaign of World War II using the Lanchester equations. It revises and extends that analysis in a number of ways: (1) It more accurately fits the model parameters using linear regression; (2) it considers the data from the entire campaign; and (3) it adds in air sortie data. In contrast to previous results, it concludes by showing that neither the Lanchester linear or Lanchester square laws fit the data. A new form of the Lanchester equations emerges with a physical interpretation. © 1998 John Wiley & Sons, Inc. Naval Research Logistics 45: 1–22, 1998     

用速度平差法求解目标运动要素的改进方法

用速度平差法求解目标运动要素是潜艇作战中常用的目标运动要素求解方法.通过全面分析该算法的原理和求解过程,运用典型数值分析、数学归纳等方法,论证了目前速度平差法应用中求解过程的不完整性及漏根的根源,结合潜艇鱼雷攻击实际,采用迭代法和数轴验根法,提出了新的求解办法,提高了目标运动要素解算的可靠性和效率.     

捷联惯导位置更新中的多子样算法

以地理坐标系作为导航坐标系,推导了捷联惯导位置更新中的位置增量算法;提出了基于曲线拟合的多子样(二、三、四子样)涡卷补偿算法和位置旋转补偿算法.仿真结果表明,二、三、四子样涡卷补偿算法和位置旋转补偿算法都能有效地计算出涡卷补偿和位置旋转补偿值,并且二、三、四子样涡卷补偿算法和位置旋转补偿算法的精度依次提高.     

平台式惯导系统初始对准最佳可观性分析

首先应用线性系统的奇异值分解理论对静基座初始对准的可观性及可观度进行了深入地分析.给出了不同奇异值下系统状态可观性状况的直方图,并且计算出不同状态组合时系统奇异值的大小及对可观性的影响.理论分析表明选取(△)N、(△)E、εE为不可观测时,系统的估计效果最好.其次采用卡尔曼滤波器对可观阵的秩为7的三种状态组合进行最优估计,仿真结果验证这种论断的正确性.最后从误差分析的角度阐述了这种论断的合理性.