战争复杂性与军事系统工程——军事系统工程专业委员会第十六届学术年会研讨成果综述

“战争复杂性与军事系统工程”是军事系统工程专业委员会第十六届学术年会的主题。复杂性是战争系统的本质属性,信息化加剧了战争的复杂性。军事科学与系统科学相结合应当成为研究战争复杂性问题的主要途径,而这就是要构建具有我军特色的作战实验体系。与此相应的就必须构建适应未来作战实验的模型体系。其成功的关键在于建立起新型的战争模拟理论,使战争模拟适应复杂性的要求,并加强模型一致性和有效性研究。战争的复杂性对指挥自动化系统的标准化、规范化建设提出了更高的要求,实现人脑和电脑的合理分工,发挥各自特长,是提高指挥控制系统效益的关键。     

卡尔曼滤波框架下优化增益异类噪声处理方法及其应用

针对基于卡尔曼滤波框架算法只能处理已知高斯噪声系统的局限性,设计能够同时处理含有异类噪声系统的改进算法.将不确定系统受到的干扰分成高斯噪声和未知有界噪声,对噪声特点进行分析,并将其加入状态方程和观测方程;在吸收集员滤波优点的基础上,对标准卡尔曼滤波进行改进,通过计算包含两种异类噪声系统状态的最小均方误差,得到该条件下滤...     

基于扩展时空距离度量的连续k近邻查询方法

针对基于TPR树索引的连续k近邻查询,引入了一种新的时空距离度量最小最大距离函数作为TPR树索引搜索时节点剪枝上界。提出了一种采用最优优先策略的基于扩展时空距离度量的连续k近邻查询STM-CNN算法,利用最小距离函数进行TPR树索引节点搜索时访问排序,并使用最小最大距离函数对TPR树索引进行剪枝界定。     

一种时空数据流中范围聚集查询共享策略

根据查询谓词的相似性来实现计算共享是数据流查询优化的主要策略之一,主要针对时空数据流中基于滑动窗口的范围聚集问题进行查询优化,采用时间片段和空间片段分别描述滑动窗口之间和空间范围谓词之间的重叠。提出基于时空分片技术将时空数据流元组分成互不重叠的时空片段。范围聚集查询首先基于时空片段生成中间结果,然后根据查询条件与时空片段的映射关系生成查询结果。实验表明,提出的时空分片策略能大大提高时空数据流中范围聚集查询的性能。     

消防部队处置炭疽芽孢杆菌袭击事件技术方案探讨

对消防部队处置炭疽芽孢杆菌袭击事件的防护技术、现场侦查方法、警戒隔离、样品采集、快速检测技术、洗消技术及其注意事项进行了论述,对消防部队处置此类及类似事故具有一定的指导意义。     

论新疆区内初中班的创办对少数民族基础教育发展的创新

新疆举办区内初中班是促进少数民族基础教育事业发展的必需。区内初中班的创办具有重要意义,它是党和国家、自治区为新疆培养人才、缩小中西部教育差距的民心工程;同时,区内初中班的创办又是对少数民族基础教育的创新。     

基于ISM的油库安全事故成因分析

分析油库安全事故成因,划分事故成因类型,对于有效控制事故发生、保障油库运行安全是极其重要的。运用系统工程思想,对油库安全事故成因要素的相互关系进行分析,建立了油库安全事故成因多层递阶解释结构模型（ISM）。分析和计算结果表明：油库安全事故成因大致可分为根本原因、直接原因和间接原因三个类型（层次）。针对不同层次结构的事故成因,可以制定相应的预防和控制措施,为军用油库抓住安全管理重点、有效防止事故发生提供理论依据。     

A two‐echelon inventory‐location problem with service considerations

We study the problem of designing a two‐echelon spare parts inventory system consisting of a central plant and a number of service centers each serving a set of customers with stochastic demand. Processing and storage capacities at both levels of facilities are limited. The manufacturing process is modeled as a queuing system at the plant. The goal is to optimize the base‐stock levels at both echelons, the location of service centers, and the allocation of customers to centers simultaneously, subject to service constraints. A mixed integer nonlinear programming model (MINLP) is formulated to minimize the total expected cost of the system. The problem is NP‐hard and a Lagrangian heuristic is proposed. We present computational results and discuss the trade‐off between cost and service. © 2009 Wiley Periodicals, Inc. Naval Research Logistics 2009     

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     

基于共享Cache多核处理器的Radix聚集连接优化

基于目前主流的多核处理器,研究了数据库Radix-Join算法中的聚集连接优化.针对多线程聚集连接执行时,线程Cache访问缺失严重的问题,采用预读线程预先将聚集连接线程需要访问的聚集对从内存读入L2-Cache,提高了线程的Cache访问性能.并根据聚集连接执行时的代价模型,优化了聚集连接执行框架和各种线程参数.在实验中,基于内存数据库EaseDB实现了本文提出了算法,实验结果表明,聚集连接性能得到较大提高.