设备故障诊断技术的现状与发展

设备故障诊断技术已发展为一门独立的跨学科的综合信息处理技术,是目前研究领域的热点之一。该论文集中介绍了目前设备故障诊断的几种重要技术与方法,如故障树分析法、小波分析、神经网络识别和基于复合知识库的专家系统等。通过分析指出,把传统方法与现代理论相结合、把现代理论与先进技术相结合、把设备故障的诊断与修复相结合、把理论方法与应用效率相结合是今后的发展方向。     

从配送中心角度考虑后勤仓库建设

现代物流技术的发展使物资配送的效率越来越高,配送中心建设的方法论也日趋成熟。从后勤仓库与配送中心的相似性出发,从配送中心的角度来考虑后勤仓库的建设,通过外部环境论证、内部力量分析和地址选定三个方面来系统确定后勤仓库建设的诸方面,最终目的是提高物资保障效率。     

基于极化特征识别的地貌识别策略

为满足其近感测量精度,需对探测范围内的地貌环境进行有效识别。提出一种基于最优投影的地貌识别算法,为现代空域近感平台提供必要的地貌识别能力。定义了利用目标散射矩阵特征值构成的特征参数,且该参数与探测信号强度、角度等参数均无关,仅相关于探测区域内的地形结构特征。并结合Krogager关于目标散射矩阵分解的相关思想,建立带参数的标准散射体旋转不变矩阵,将探测区域内的地貌极化散射矩阵投影至标准体,得到目标散射矩阵在每一标准体的权值,并通过最优化投影进一步判定该地貌属性,从而达到识别的目的。     

基于经济绩效的国防工业市场最优集中度研究

以满足企业利润最大化和社会福利最大化双重效率标准的思想为基础,通过拟合我国国防支出需求函数和国防工业企业的成本函数,对我国国防工业市场最优集中度进行了理论研究,得出最优企业数量的一般表达式,并以我国航空工业上市公司为例,对其市场集中度展开了系统性估算。研究结果表明,我国国防工业产业的最优企业数量可以根据相关数据与拟合出的参数得到一个明确的数值,并且我国国防工业产业的最优市场集中度表现为适度集中,而在特殊情况下表现为完全集中。我国航空工业上市公司的最优企业数量为14家时,能够满足企业利润最大化与市场出清的双重标准,市场集中度达到最优。     

军工项目组织质量管理体系自我评价

本文提出了适合我国军工项目组织质量管理体系自我评价的模型、方案,阐述了质量管理体系评价的成熟度等级以及军工项目组织质量管理体系自我评价的实施要点。     

Approximation algorithms for general one‐warehouse multi‐retailer systems

Logistical planning problems are complicated in practice because planners have to deal with the challenges of demand planning and supply replenishment, while taking into account the issues of (i) inventory perishability and storage charges, (ii) management of backlog and/or lost sales, and (iii) cost saving opportunities due to economies of scale in order replenishment and transportation. It is therefore not surprising that many logistical planning problems are computationally difficult, and finding a good solution to these problems necessitates the development of many ad hoc algorithmic procedures to address various features of the planning problems. In this article, we identify simple conditions and structural properties associated with these logistical planning problems in which the warehouse is managed as a cross‐docking facility. Despite the nonlinear cost structures in the problems, we show that a solution that is within ε‐optimality can be obtained by solving a related piece‐wise linear concave cost multi‐commodity network flow problem. An immediate consequence of this result is that certain classes of logistical planning problems can be approximated by a factor of (1 + ε) in polynomial time. This significantly improves upon the results found in literature for these classes of problems. We also show that the piece‐wise linear concave cost network flow problem can be approximated to within a logarithmic factor via a large scale linear programming relaxation. We use polymatroidal constraints to capture the piece‐wise concavity feature of the cost functions. This gives rise to a unified and generic LP‐based approach for a large class of complicated logistical planning problems. © 2009 Wiley Periodicals, Inc. Naval Research Logistics, 2009     

努力抓好机关的执行力建设

培养和提高机关干部的执行力,直接关系到党委和首长决策指示的贯彻落实.提高机关的执行力,想干事是前提,会干事是关键,能共事是保证,干成事是根本.     

作战系统MAS中的作战行动域与实际组元逻辑关系分析

建立作战系统多Agent系统(Multi-Agent System,MAS)组织,必须首先建立由作战系统实际组元到Agent的映射。围绕作战系统MAS的建立,在提出由作战系统实际组元到Agent的映射过程与方法的基础上,提出了作战系统领域概念视图、作战行动域及其各层次概念、实际组元逻辑关系分析的基本方法,为实现基于多Agent的作战系统建模与仿真奠定基础。在基于多Agent的信息化战场多传感器仿真演示系统中,证明了该方法的可行性与有效性。     

The probability of the existence of a feasible flow in a stochastic transportation network

Stochastic transportation networks arise in various real world applications, for which the probability of the existence of a feasible flow is regarded as an important performance measure. Although the necessary and sufficient condition for the existence of a feasible flow represented by an exponential number of inequalities is a well‐known result in the literature, the computation of the probability of all such inequalities being satisfied jointly is a daunting challenge. The state‐of‐the‐art approach of Prékopa and Boros, Operat Res 39 (1991) 119–129 approximates this probability by giving its lower and upper bounds using a two‐part procedure. The first part eliminates all redundant inequalities and the second gives the lower and upper bounds of the probability by solving two well‐defined linear programs with the inputs obtained from the first part. Unfortunately, the first part may still leave many non‐redundant inequalities. In this case, it would be very time consuming to compute the inputs for the second part even for small‐sized networks. In this paper, we first present a model that can be used to eliminate all redundant inequalities and give the corresponding computational results for the same numerical examples used in Prékopa and Boros, Operat Res 39 (1991) 119–129. We also show how to improve the lower and upper bounds of the probability using the multitree and hypermultitree, respectively. Furthermore, we propose an exact solution approach based on the state space decomposition to compute the probability. We derive a feasible state from a state space and then decompose the space into several disjoint subspaces iteratively. The probability is equal to the sum of the probabilities in these subspaces. We use the 8‐node and 15‐node network examples in Prékopa and Boros, Operat Res 39 (1991) 119–129 and the Sioux‐Falls network with 24 nodes to show that the space decomposition algorithm can obtain the exact probability of these classical examples efficiently. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 479–491, 2016     

浅谈智能化的单兵系统

单兵系统是现代战争中数字化战场上的关键因素,而智能化的单兵系统又是未来发展的趋势。本文首先阐述了人机智能结合的必要条件,并说明单兵系统中的人机交互作用,最后对人机交互智能化在单兵系统中的应用进行了探讨和研究。