坦克柴油机振动检测时提高振动信号信噪比的方法

研究了柴油机振动信号的时域同步平均方法,针对柴油机振动信号的循环波动性特点,提出了按曲轴转角进行角域同步平均的方法,减小循环波动性对信号分析的影响。利用多抽样率分析方法消除了同步平均时柴油机转速波动的影响。通过对坦克柴油机汽缸盖振动信号的处理结果表明,该方法可有效提高信噪比。     

基于摆动式单线激光雷达的障碍物检测算法

基于无急回摆动机构,实现了单线激光雷达对周围区域环境的实时感知与建图。为了准确地检测障碍物,在讨论了摆动机构的安装标定及扫描帧与角度编码器对准方法的基础上,采用了一种生成可通行性代价地图(costmap)的算法。该算法以2-D栅格模型方式,通过综合高程信息、测量值个数、扫描帧个数和测量时间等信息,得到各栅格单元的代价值,生成一张关于环境可通行性代价地图。实车验证结果表明:基于该算法得到的地图能够较好地描述环境的可通行性,实现了对环境的实时感知。     

成本分担定价方式的装备采购博弈研究

承包商的努力程度直接决定了装备的制造成本。为有效激励承包商降低装备制造成本,提高装备采购效益,基于里昂惕夫劳资博弈模型建立了成本分担定价方式的装备采购博弈模型。并在承包商边际效用非线性和定价方式多变量的假设基础上,分别对价格、成本、承包商努力程度和承包商效用之间的关系进行了研究,对原模型进行了拓展,为定价方式中参数的确定提供了量化方法。     

Rank‐Cluster‐and‐Prune: An algorithm for generating clusters in complex set partitioning problems

Clustering problems are often difficult to solve due to nonlinear cost functions and complicating constraints. Set partitioning formulations can help overcome these challenges, but at the cost of a very large number of variables. Therefore, techniques such as delayed column generation must be used to solve these large integer programs. The underlying pricing problem can suffer from the same challenges (non‐linear cost, complicating constraints) as the original problem, however, making a mathematical programming approach intractable. Motivated by a real‐world problem in printed circuit board (PCB) manufacturing, we develop a search‐based algorithm (Rank‐Cluster‐and‐Prune) as an alternative, present computational results for the PCB problem to demonstrate the tractability of our approach, and identify a broader class of clustering problems for which this approach can be used. © 2009 Wiley Periodicals, Inc. Naval Research Logistics 2009     

On the exponentially weighted moving variance

MacGregor and Harris (J Quality Technol 25 (1993) 106–118) proposed the exponentially weighted mean squared deviation (EWMS) and the exponentially weighted moving variance (EWMV) charts as ways of monitoring process variability. These two charts are particularly useful for individual observations where no estimate of variability is available from replicates. However, the control charts derived by using the approximate distributions of the EWMS and EWMV statistics are difficult to interpret in terms of the average run length (ARL). Furthermore, both control charting schemes are biased procedures. In this article, we propose two new control charts by applying a normal approximation to the distributions of the logarithms of the weighted sum of chi squared random variables, which are respectively functions of the EWMS and EWMV statistics. These new control charts are easy to interpret in terms of the ARL. On the basis of the simulation studies, we demonstrate that the proposed charts are superior to the EWMS and EWMV charts and they both are nearly unbiased for the commonly used smoothing constants. We also compare the performance of the proposed charts with that of the change point (CP) CUSUM chart of Acosta‐Mejia (1995). The design of the proposed control charts is discussed. An example is also given to illustrate the applicability of the proposed control charts. © 2009 Wiley Periodicals, Inc. Naval Research Logistics, 2009     

A branch‐and‐cut algorithm for the nonpreemptive swapping problem

In the Swapping Problem (SP), we are given a complete graph, a set of object types, and a vehicle of unit capacity. An initial state specifies the object type currently located at each vertex (at most one type per vertex). A final state describes where these object types must be repositioned. In general, there exist several identical objects for a given object type, yielding multiple possible destinations for each object. The SP consists of finding a shortest vehicle route starting and ending at an arbitrary vertex, in such a way that each object is repositioned in its final state. This article exhibits some structural properties of optimal solutions and proposes a branch‐and‐cut algorithm based on a 0‐1 formulation of the problem. Computational results on random instances containing up to 200 vertices and eight object types are reported. © 2009 Wiley Periodicals, Inc. Naval Research Logistics 2009     

自行火炮武器系统的寿命周期费用分析

随着技术的发展,寿命周期的研究正日益受到关注.评述了国内外寿命周期费用方面的研究现状,介绍了火炮寿命周期费用研究方法的内容及用途,探讨了费用估算的一般方法,在火炮寿命周期费用分解原则的基础上给出了火炮寿命周期费用分解结构,讨论了寿命周期费用研究方法急需解决的主要问题.     

武器装备LCC分析的基本原理

介绍了寿命周期费用(LCC)分析的基本概念及操作程序,给出了武器装备寿命周期费用的一般构成体系,讨论了LCC分析在武器装备应用中需要注意的问题,并对其未来发展方向作了展望.     

基于状态的检查与修理综合决策模型

分析了单部件系统退化过程的特点,建立了基于状态的检查与修理决策模型。该模型根据系统的当前状态来决定检查与修理,通过分析计算系统在一个更新周期内平均检查次数、预防性维修及修复性故障的概率,建立维修费用与检查问隔及预防性维修阈值的关系,以平均维修费用最小为目标,优化检查间隔及预防性维修阈值。最后运用Matlab对模型进行数值计算,结果表明,模型能有效地降低维修费用。     

基于博弈论的装备采办成本控制问题研究

从武器装备采办的理论需求出发,以博弈论为理论工具,对武器装备采办过程中的生产成本控制问题进行了分析;建立了基于激励的生产成本控制模型,并对成本控制模型的特点进行了分析和解释;针对军方在激励合同执行过程中有可能出现的2类错误,对成本控制模型进行了优化。在非对称信息条件下,优化后的成本控制模型不但能有效减少2类错误的发生,而且可提高军方装备采办效用,减少代理方合同风险。