基于模糊事件的入侵检测模型

对模糊入侵事件进行了描述,分析了模糊入侵事件间的相似性,提出了基于模糊ECA规则的入侵检测知识表示方法,并阐述了模糊ECA规则的分析过程,以解决入侵行为的不确定性。     

基于最大故障特征信息熵的测试点优化设计

为解决故障诊断和可测试性设计中普遍存在的测试点优化问题,以相关性矩阵模型为基础,建立了最大故障特征信息熵的优化准则,给出了相应的测试点优化设计方法。应用实例表明：该方法是可行的、正确的,能为武器装备的故障诊断和可测试性设计提供有力的支持。     

The effects of model parameter deviations on the variance of a linearly filtered time series

We consider a general linear filtering operation on an autoregressive moving average (ARMA) time series. The variance of the filter output, which is an important quantity in many applications, is not known with certainty because it depends on the true ARMA parameters. We derive an expression for the sensitivity (i.e., the partial derivative) of the output variance with respect to deviations in the model parameters. The results provide insight into the robustness of many common statistical methods that are based on linear filtering and also yield approximate confidence intervals for the output variance. We discuss applications to time series forecasting, statistical process control, and automatic feedback control of industrial processes. © 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010     

基于层间嵌入式多级支持向量机的特征选择

针对多故障样本一次性映射之后分类不理想,研究了多级层次式支持向量机,应用UCI数据仿真,结果表明该方法缩短了训练时间、提升了测试准确率、改善了样本的可分类性。由于误差积累,在此基础上,提出了层间嵌入式多级支持向量机,采用Abalone数据仿真,结果表明分类精度有所提高并减少了分类步骤。结合ReliefF算法,对制导设备的故障特征参数进行了选择。     

弹着时间可控的机动目标多弹协同制导律

针对机动目标的多导弹齐射攻击,运用最优控制和卡尔曼滤波理论探索机动目标下弹着时间可控制导律问题。设计了一种最优弹着时间可控的制导律,它由指定弹着时间和预计弹着时间的误差作为反馈信号与传统比例制导律结合推导得出,称之为弹着时间可控制导律（Impact-time-control Guidance Law,简称ITCG）,同时利用卡尔曼滤波估计了目标加速度。通过对作战模型情况的仿真,可以看出这种新型的制导律应用于引导多发导弹以指定时间同时攻击目标时的有效性和可行性。     

基于蚁群算法的火力分配寻优方法研究

火力分配的优化是最大限度的发挥火力单位效能,达到最大毁伤效果的基础和前提,将蚁群算法应用于火力分配的优化.研究了蚁群算法用于火力分配寻优的相关条件,给出了火力分配寻优的模型和算法.最后,结合一个应用实例,说明了蚁群算法用于解决火力分配问题有很好的应用价值.     

The building evacuation problem with shared information

In this article, the Building Evacuation Problem with Shared Information (BEPSI) is formulated as a mixed integer linear program, where the objective is to determine the set of routes along which to send evacuees (supply) from multiple locations throughout a building (sources) to the exits (sinks) such that the total time until all evacuees reach the exits is minimized. The formulation explicitly incorporates the constraints of shared information in providing online instructions to evacuees, ensuring that evacuees departing from an intermediate or source location at a mutual point in time receive common instructions. Arc travel time and capacity, as well as supply at the nodes, are permitted to vary with time and capacity is assumed to be recaptured over time. The BEPSI is shown to be NP‐hard. An exact technique based on Benders decomposition is proposed for its solution. Computational results from numerical experiments on a real‐world network representing a four‐story building are given. Results of experiments employing Benders cuts generated in solving a given problem instance as initial cuts in addressing an updated problem instance are also provided. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008     

车辆悬挂系统的主动优化控制器设计及仿真

基于特征结构配置参数化结果,提出了车辆悬挂系统的主动优化控制器设计方法。该方法直接基于车辆悬挂系统的参数矩阵,便于工程应用。车辆悬挂系统的仿真实例表明所提主动优化控制器设计方法简单且有效。     

多跑道机场最优瞄准点选择方法研究

在着重分析多跑道机场的基础上,指出在进行最优瞄准点选择计算时应将跑道离散化,然后应用"直接循环迭代法"进行最优瞄准点选择计算,并提出利用常规导弹武器对机场目标进行打击时每一枚导弹应选取一个最优瞄准点的选择方法.经计算验证,结果可信,军事应用价值较高.     

Periodic review inventory management with contingent use of two freight modes with fixed costs

We study a stochastic inventory model of a firm that periodically orders a product from a make‐to‐order manufacturer. Orders can be shipped by a combination of two freight modes that differ in lead‐times and costs, although orders are not allowed to cross. Placing an order as well as each use of each freight mode has a fixed and a quantity proportional cost. The decision of how to allocate units between the two freight modes utilizes information about demand during the completion of manufacturing. We derive the optimal freight mode allocation policy, and show that the optimal policy for placing orders is not an (s,S) policy in general. We provide tight bounds for the optimal policy that can be calculated by solving single period problems. Our analysis enables insights into the structure of the optimal policy specifying the conditions under which it simplifies to an (s,S) policy. We characterize the best (s,S) policy for our model, and through extensive numerical investigation show that its performance is comparable with the optimal policy in most cases. Our numerical study also sheds light on the benefits of the dual freight model over the single freight models. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011