故障类别的模糊聚类分析

本文通过故障状态-特征的模糊聚类分析,按故障间的相似性对故障进行分类,然后按类别实施故障诊断,可在最少监测点的条件下,获得最多的设备运行故障信息。从而简化故障诊断过程,提高诊断速度和精度。     

身管内弹道性能改变量的静态标定研究

目前国内外静态标定火炮身管内弹道性能改变量的方法,都存在着原理和精度不高的缺陷。采用多特征截面的标定方法可取得满意的精度,本文论述了其理论基础、精度及应用领域。     

浅析炮车比

本文以坦克发射时车体的角振幅和乘员所受加速度不超过一定值为基础,推导了炮车比极限值的理论公式;并对影响炮车比极值的因素进行了分析,最后,以59式坦克为例得出炮车比不超过1.71,该结论具有普遍意义.     

用配点法求解四边搁支板的弯曲问题

根据弹性薄板微分方程的一般解和边界条件的配点法来求四边搁支板的弯曲问题,并以对称荷载作用下的正方形板为例进行了分析计算。     

一体化联合作战指挥信息流通体系逻辑结构分析

针对协同性联合作战向一体化联合作战转变对作战指挥产生的影响,在正确定位指挥信息流通体系的基础上,从一体化联合作战的本质特征及对指挥信息流通体系的影响出发,设计了基本作战单元指挥信息输入、输出模型,并通过将作战体系区分为四类模块,得出了指挥信息流通体系的逻辑结构.     

A nonparametric Bayes approach to decide system burn-in time

Burn-in is the preconditioning of assemblies and the accelerated power-on tests performed on equipment subject to temperature, vibration, voltage, radiation, load, corrosion, and humidity. Burn-in techniques are widely applied to integrated circuits (IC) to enhance the component and system reliability. However, reliability prediction by burn-in at the component level, such as the one using the military (e.g., MIL-STD-280A, 756B, 217E [23–25]) and the industrial standards (e.g., the JEDEC standards), is usually not consistent with the field observations. Here, we propose system burn-in, which can remove many of the residual defects left from component and subsystem burn-in (Chien and Kuo [6]). A nonparametric model is considered because 1) the system configuration is usually very complicated, 2) the components in the system have different failure mechanisms, and 3) there is no good model for modeling incompatibility among components and subsystems (Chien and Kuo [5]; Kuo [16]). Since the cost of testing a system is high and, thus, only small samples are available, a Bayesian nonparametric approach is proposed to determine the system burn-in time. A case study using the proposed approach on MCM ASIC's shows that our model can be applied in the cases where 1) the tests and the samples are expensive, and 2) the records of previous generation of the products can provide information on the failure rate of the system under investigation. © 1997 John Wiley & Sons, Inc. Naval Research Logistics 44: 655–671, 1997     

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     

基于ADV212的探空火箭图像采集与压缩系统

针对探空火箭遥测带宽低、图像监控通路多、系统小型化等设计难点,本文提出了一种基于ADV212的图像采集与压缩系统设计方案。采用可以同时支持无损和高压缩比有损压缩的JPEG2000图像压缩标准,提出适用于箭上图像采集特点的通道切换和中断处理策略,并以“乒乓”操作的流水线作业方式实现多路图像通道数据吞吐,通过两个实时发送通道和一个缓存发送通道向火箭遥测链路发送图像数据。提出了一种具有动态帧频和压缩比的图像压缩方案,解决了探空火箭遥测带宽有限这一问题。本设计以Virtex-4系列FPGA作为系统控制核心,采用ADV7182和ADV212分别完成图像的采集和压缩,分别采用SRAM和SDRAM实现图像的实时传输和缓存传输。通过比较图像间的PSNR值,试验并分析了适用于CCD图像的压缩滤波器和小波变换级数,得到了较为满意的图像质量。设计较好地满足了本次空间环境垂直探测探空火箭的图像采集任务。