基于个体行为差异的CGF岗位模型

当前,对作战仿真在广度和深度上提出了更高层次的需求,即在扩大仿真规模的同时,更加注重仿真精度的提高。通过分析传统平台级CGF（Computer Generated Forces）模型在满足仿真需求方面的不足,建立了基于战斗岗位的武器平台CGF模型结构,研究了作战过程中影响战斗人员决策与操作行为的主要行为因素及其影响机制,并将其引入到岗位模型。最后,实现了考虑个体行为因素的坦克CGF炮长岗位模型,并对所建立的坦克炮长岗位模型在某作战仿真系统中的应用效果进行了分析。     

基于人工神经网络的特征压缩方法及应用

分析了人工神经网络特征提取方法用于特征压缩的原理,研究了多层网络的隐层提取模型、Oja网络模型和基于Sanger算法的网络模型,以坦克柴油机燃油系统典型故障的特征处理为例,采用Sanger算法对特征参数进行了压缩,实现了特征空间的约简。该方法有利于简化分类器的设计,对于解决复杂设备的状态检测与故障诊断问题具有重要意义。     

基于Petri网的指挥流程建模与优化

鉴于Petri网在企业业务流程优化与重组方面的成功运用,遂将Petri网原理应用于作战指挥流程的建模与优化,以期获得最优作战指挥流程.文中首先阐述Petri网基本原理,然后介绍指挥流程建模的Petri网模型,最后给出指挥流程优化的原则及基本模型,并利用Petri网对指挥流程进行建模和优化,结果表明Petri网理论能够明显优化作战指挥流程.提高作战指挥效率.     

基于EGK/EGD的VxWorks图形界面开发技术

为了解决嵌入式系统下图形界面开发困难的问题,讨论了在VxWorks下利用EGK/EGD进行窗口图形界面开发的方法.分析了其工作原理及开发流程,并给出了具体的应用实例.工程应用表明,EGK/EGD功能强大、使用方便,是一套理想的嵌入式人机界面解决方案.     

信息化条件装备战场维修资源保障问题研究

战场维修资源是实施战场抢修最重要的物质条件,借鉴美军装备"精确保障"理念思想,对信息化条件下装备战场维修资源保障问题进行了研究.通过分析信息、资源、效能三者关联关系和维修资源保障指挥管理过程,确定装备保障指挥管理系统功能模型.最后对支持战场维修资源保障系统的关键技术和相应建设对策展开探讨.     

基于DHGF法的数字化装甲团指挥控制系统效能评估

根据数字化装甲团指挥控制分系统的结构和功能特点,建立了指挥控制分系统效能评估指标体系,利用集成了德尔菲法、层次分析法、灰色理论和模糊理论的DHGF法建立了效能评估模型,在一定的初始条件下对数字化装甲团指挥控制分系统进行了效能评估,分析了各因素对系统整体效能的影响,对提高系统效能具有重要的定量参考价值.     

装甲装备体系对抗影响图建模与仿真方法研究

针对装甲装备体系对抗作战建模与仿真的现实问题,提出采用影响图建模理论与方法加以解决.首先论述了影响图理论的基本概念,在此基础上,给出了利用影响图理论进行体系对抗建模与仿真的主要步骤.最后,以一个典型陆军体系对抗作战为应用背景,通过对其交战过程进行建模和仿真,表明了该方法的适用性和有效性.     

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实现了本文提出了算法,实验结果表明,聚集连接性能得到较大提高.