双速制声自导鱼雷主动开机时机研究

鱼雷主动声自导寻的信号是潜艇探测来袭鱼雷的主要信息源之一,主动声自导开机时机是鱼雷发射时需要设定的重要参数,它直接影响鱼雷攻击的隐蔽性。通过分析双速制鱼雷辐射噪声对潜艇鱼雷报警距离的影响,提出了一种双速制鱼雷直航搜索阶段的变速策略,在此基础上建立了鱼雷主动声自导开机时机解算模型,仿真结果表明,此方法简单高效,结论详实可信,对双速制鱼雷发射诸元解算具有一定的实用价值。     

受压带肋圆柱壳体固有振动频率和稳定性计算

论述了丧失舱段总稳定性是潜艇耐压壳体在深潜时的主要破坏模式 .并将振动屈曲理论应用于潜艇耐压壳体稳定性的研究 ,在 Donell公式的基础上 ,导出了带肋圆柱壳体的整体固有振动频率与壳体所受外界水压之间的关系表达式 ,据此解出带肋圆柱壳体整体失稳的理论压力值 .最后 ,将公式的计算结果、实验结果和有限元法的计算结果进行比较 ,得出几点结论 .     

关于军用装备软件质量的认识和思考

高科技的军用装备,已经越来越多地依赖于软件,软件质量事关重大,因此我们更应该正确认识军用装备软件的质量。本文将从军代表的视角阐述软件质量的概念及软件质量监督的难点,分析运用软件工程方法的现状和制约因素,提出运用软件工程手段保证软件质量应注意的问题,以及如何正确认识“软件三库”的作用和定位。     

新型自控式动活性检测仪特点分析

介绍了一种新型的自控式动活性检测仪,指出了该检测仪的结构和工作原理,分析了它的试验影响因素,同时探讨了其未来研究方向。     

精益六西格玛在美军装备LCC管理中的应用及启示

精益六西格玛是精益思想与六西格玛管理方法的有机结合。本文简要介绍了精益六西格玛理论,在分析了美各兵种运用精益六西格玛提高装备使用可用度、降低装备寿命周期费用所取得成功经验基础上,提出了对我军运用精益六西格玛的对策与建议。     

Online process mean estimation using L1 norm exponential smoothing

A basic assumption in process mean estimation is that all process data are clean. However, many sensor system measurements are often corrupted with outliers. Outliers are observations that do not follow the statistical distribution of the bulk of the data and consequently may lead to erroneous results with respect to statistical analysis and process control. Robust estimators of the current process mean are crucial to outlier detection, data cleaning, process monitoring, and other process features. This article proposes an outlier‐resistant mean estimator based on the L₁ norm exponential smoothing (L₁‐ES) method. The L₁‐ES statistic is essentially model‐free and demonstrably superior to existing estimators. It has the following advantages: (1) it captures process dynamics (e.g., autocorrelation), (2) it is resistant to outliers, and (3) it is easy to implement. © 2009 Wiley Periodicals, Inc. Naval Research Logistics 2009     

复杂电磁环境下火力指挥控制分析

复杂电磁环境下火力的指挥控制是战役研究的核心问题,运用信息战原理,在信息与火力分析平台上,对舰载导弹防空系统信息与火力联合作战能力的初步试验表明:复杂电磁环境的电子攻击可以使该系统拦截入侵飞机的数量下降达606.45%,幅度与电子攻击强度和导弹击毁概率相关,当导弹击毁概率为0.9时,可以获得最优信息与火力联合作战能力.因此,合理提高舰载导弹防空系统的抗电子攻击能力,优化配置导弹资源,不仅可以提高舰载导弹防空系统信息与火力联合作战能力,还可以开发出基于信息战原理的新战法,为信息与火力装备的投资制定科学决策.     

Mathematical formulation and heuristic algorithm for the block relocation and loading problem

This study considers the block relocation and loading problem in container terminals. The optimal loading sequence and relocation location are simultaneously decided on the basis of the desired ship‐bay and initial yard space configuration. An integer linear programming model is developed to minimize the number of relocations in the yard space on the basis of no shifts in the ship bay. The accuracy of the model is tested on small‐scale scenarios by using CPLEX. Considering the problem size in the real world, we present a rule‐based heuristic method that is combined with a mathematical model for the removal, loading, and relocation operations. The influence of rules on algorithm performance is also analyzed, and the heuristic algorithm is compared with different types of algorithms in the literature. The extensive numerical experiments show the efficiency of the proposed heuristic algorithm.     

DEA models for two‐stage processes: Game approach and efficiency decomposition

Data envelopment analysis (DEA) is a method for measuring the efficiency of peer decision making units (DMUs). This tool has been utilized by a number of authors to examine two‐stage processes, where all the outputs from the first stage are the only inputs to the second stage. The current article examines and extends these models using game theory concepts. The resulting models are linear, and imply an efficiency decomposition where the overall efficiency of the two‐stage process is a product of the efficiencies of the two individual stages. When there is only one intermediate measure connecting the two stages, both the noncooperative and centralized models yield the same results as applying the standard DEA model to the two stages separately. As a result, the efficiency decomposition is unique. While the noncooperative approach yields a unique efficiency decomposition under multiple intermediate measures, the centralized approach is likely to yield multiple decompositions. Models are developed to test whether the efficiency decomposition arising from the centralized approach is unique. The relations among the noncooperative, centralized, and standard DEA approaches are investigated. Two real world data sets and a randomly generated data set are used to demonstrate the models and verify our findings. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008     

New purification algorithms for linear programming

Two new algorithms are presented for solving linear programs which employ the opposite-sign property defined for a set of vectors in m space. The first algorithm begins with a strictly positive feasible solution and purifies it to a basic feasible solution having objective function value no less under maximization. If this solution is not optimal, then it is drawn back into the interior with the same objective function value, and a restart begins. The second algorithm can begin with any arbitrary feasible point. If necessary this point is purified to a basic feasible solution by dual-feasibility–seeking directions. Should dual feasibility be attained, then a duality value interval is available for estimating the unknown objective function value. If at this juncture the working basis is not primal feasible, then further purification steps are taken tending to increase the current objective function value, while simultaneously seeking another dual feasible solution. Both algorithms terminate with an optimal basic solution in a finite number of steps.