开展军事理论课程教学的思考

军事理论课程教学,在武警部队“合训”院校课程设置中所处的位置越来越重要。如何在由培养工程技术类干部向指挥类干部“学历教育合训”为主的转变过程中,提高军事理论课程讲授的效益和质量,关键在于军事理论课程教学方法的选择与应用。     

基于三角模糊数的舰空导弹飞行可靠性评估

根据舰空导弹飞行可靠性的基本概念,研究了基于三角模糊数的舰空导弹飞行可靠性评估方法,构建了舰空导弹飞行可靠性评估模型;分别给出了导弹发射前检查可靠性、导弹发射可靠性、导弹制导飞行可靠性、导弹命中目标可靠性的三角模糊数评定方法;采用专家评定法,评定舰空导弹武器系统单个设备可靠性的三角模糊数。通过研究,可评定舰空导弹在作战使用环境下的飞行可靠性,为导弹飞行可靠性评估提供一种新的研究方法。应用实例证明了评估方法的可操作性。     

模糊多属性决策理论在防空兵作战能力评估中的应用

针对防空兵系统特点,运用模糊多属性决策理论探索防空兵作战能力评估问题。构建了模糊多属性评估算法,结合具体的数学工具建立了模糊多属性评估模型,经过三级模糊综合评估得出评估结论。经实例检验该方法在防空兵作战能力评估中具有较好的应用价值,另外该方法在其他领域也具有较好的推广价值。     

An inspection game: Taking account of fulfillment probabilities of players' aims

This paper deals with an inspection game of customs and a smuggler. The customs can take two options of assigning a patrol or not. The smuggler has two strategies of shipping its cargo of contraband or not. Two players have several opportunities to take actions during a limited number of days. When both players do, there are some possibilities that the customs captures the smuggler and, simultaneously, the smuggler possibly makes a success of the smuggling. If the smuggler is captured or there remain no days for playing the game, the game ends. In this paper, we formulate the problem into a multi‐stage two‐person zero‐sum stochastic game and investigate some characteristics of the equilibrium solution, some of which are given in a closed form in a special case. There have been some studies so far on the inspection game. However, some consider the case that the smuggler has only one opportunity of smuggling or the perfect‐capture case that the customs can certainly arrest the smuggler on patrol, and others think of a recursive game without the probabilities of fulfilling the players' purposes. In this paper, we consider the inspection game taking account of the fulfillment probabilities of the players' aims. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2006     

A new reformulation approach for the generalized partial covering problem

In this paper, we consider a situation in which a group of facilities must be constructed in order to serve a given set of customers, where the facilities might not be able to guarantee an absolute coverage to the different customers. We examine the problem of maximizing the total service reliability of the system subject to a budgetary constraint. We propose a new reformulation of this problem that facilitates the generation of tight lower and upper bounds. These bounding mechanisms are embedded within the framework of a branch‐and‐bound procedure. Computational results on problem instances ranging in size up to 100 facilities and 200 customers reveal the efficacy of the proposed exact and heuristic approaches. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2006     

改善机载前向阵雷达全程检测性能的研究

针对前向阵的杂波分布特性 ,给出了一种空时自适应处理 (STAP)结合多重中脉冲重复频率(MPRF)的处理方案 ,研究了重复频率的选择以改进系统性能 ,并分析计算了三路多普勒通道联合处理STAP方法在一组中脉冲重复频率下的改善因子和距离 /速度二维盲区分布图。理论分析与仿真结果表明 ,该方案可以大大改善机载前向阵雷达的全程检测性能     

三组元液体火箭发动机实现单级入轨的优化分析

建立了三组元液体火箭发动机性能计算模型、单级入轨可重复使用运载器质量模型和弹道模型,以起飞质量为目标函数,优化得到了实现单级入轨的发动机基本参数。结果显示:三组元发动机性能比氢氧发动机高10%。本研究是三组元发动机系统设计和分析的基础。     

用数域筛法分解大整数

随着Ｆｅｒｍａｔ数Ｆ７和Ｆ９被分解，一个新的算法被提了出来，那就是Ｊ．Ｐｏｌａｒｄ提出的“数域筛法”（ＮＦＳ）．Ａ．Ｋ．Ｌｅｎｓｔｒａ等人对数域筛法进行了深入的研究，已经使数域筛法从原来对一些特殊整数的分解发展到对一般整数的分解。本文试图对数域筛法理论及其运行作简要的论述。     

基于参数优化的SVM联合作战战场建设方案优选

联合作战战场建设方案优选可最大可能降低建设工程的损耗、提高整体建设效益。针对联合作战战场建设方案优选问题进行研究,首先梳理联合作战战场建设方案优选流程,然后构建包括作战保障工程、后勤保障工程、装备保障工程和战场基础信息数据库的指标体系,并提出基于网格搜索和交叉验证优化的改进SVM方法实施方案优选,仿真结果表明优化后参数的性能明显优于默认参数,更加适用于联合作战战场建设方案优选问题。     

A single‐period inventory placement problem for a serial supply chain

This article addresses the inventory placement problem in a serial supply chain facing a stochastic demand for a single planning period. All customer demand is served from stage 1, where the product is stored in its final form. If the demand exceeds the supply at stage 1, then stage 1 is resupplied from stocks held at the upstream stages 2 through N, where the product may be stored in finished form or as raw materials or subassemblies. All stocking decisions are made before the demand occurs. The demand is nonnegative and continuous with a known probability distribution, and the purchasing, holding, shipping, processing, and shortage costs are proportional. There are no fixed costs. All unsatisfied demand is lost. The objective is to select the stock quantities that should be placed different stages so as to maximize the expected profit. Under reasonable cost assumptions, this leads to a convex constrained optimization problem. We characterize the properties of the optimal solution and propose an effective algorithm for its computation. For the case of normal demands, the calculations can be done on a spreadsheet. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48:506–517, 2001