Volterra级数频谱非线性系统故障诊断方法

介绍了故障诊断技术的基本概念,重点阐述了非线性系统Volterra级数模型的原理及其在故障检测中的应用,并基于这一方法设计了飞机刹车系统惯性传感器故障检测设备.在这一应用系统中,被测系统的故障特征是广义频率响应函数GFRF(Generalized Frequency Response Functions)谱特征.简要介绍了故障诊断的方法,在工程应用实现中设计了相关的硬件电路,实验结果说明了此诊断方法是有效可行的.     

BAT子弹药对二维声目标的角跟踪

针对BAT(Brainpower Antitank)智能子弹药声探测系统不能定距问题,提出一种在仅有方向角信息条件下对地面机动声目标跟踪算法.首先分析了BAT声探测系统做三维运动时的定向算法;然后结合弹体运动特点,给出一种仅利用目标方向信息对地面机动目标跟踪算法,分别推导了目标静止、匀速、匀加速以及更高阶次运动时的角跟踪公式,并指出了定向误差存在的前提下其成立的充分条件;最后,给出了一个该算法的精确度函数,可以量化评估算法的精度,优化跟踪轨迹.理论分析表明BAT不需要在水平方向上做出比机动目标更高阶次的运动即可实现对目标的角跟踪.     

集对分析联系度聚类方法在信息分类中的应用

常见的各种聚类方法在遭遇稀疏数据信息的状况下是无法使用的.提出了一种基于集对分析联系度的聚类方法.它借用集对分析的联系度,对稀疏数据矩阵进行同异反特征分类,给出了符合一定概率分布的同异反特征数,并由此给出了同异反距离的计算方法.求出距离矩阵后根据距离聚类方法给出聚类结果.最后给出了该方法在信息分类中的实际应用,证实了方法的可行性、合理性和应用性.     

一类随机非单调二元算子的随机不动点定理

利用Mann迭代技巧,讨论了不具有紧性条件的随机非单调二元算子方程随机不动点的存在唯一性,并给出了迭代序列收敛于解的误差估计,所得结果是某些已知结果的本质改进和推广。     

飞机的红外隐身技术

目前采取的红外隐身措施主要是冷却、屏蔽、遮挡和红外隐身涂料等手段,降低或改变目标的红外辐射特征,实现对目标的低可探测性。概述了红外隐身技术的基本原理,通过对飞机红外隐身发展现状的分析,研究了飞机红外隐身技术所采取的措施。     

舰船总体性能可靠性建模方法研究

分析了舰船总体性能可靠性问题的产生原因,将其分为2类.对于舰载设备本身存在可靠性问题而造成的,以航速可靠性为例,在舰船总体可靠性的背景下,借助相关数学工具进行了建模方法分析;对于外界随机因素影响而造成的,如横稳性的可靠性问题,则从分析外界随机因素与船体设计参数之间关系入手.初步建立了一套研究舰船总体性能可靠性问题的建模方法.实例计算表明,将所建模型用于分析舰船总体性能比常规方法具有明显的优越性.     

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.     

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.