基于fMRI的静息状态脑功能复杂网络分析

分析静息状态下人脑中不同区域之间的功能连接模式对研究静息状态下人脑正常功能活动具有重要意义。基于复杂网络理论对脑功能网络进行建模,考察静息状态脑功能网络的结构和拓扑特性。结果显示,网络具有小世界性质和无标度特性。进一步引入一种概率混合模型分析网络社团结构,得到的10个子网络中包含视觉系统、听觉系统、运动系统、默认网络以及与执行和工作记忆相关的脑区。推测出静息状态脑功能网络是由这些相对独立又彼此关联的子网络组成,其中楔前叶和扣带回作为网络的关键节点,在信息调度和传递中占据重要地位。     

基于串联QFD神经网络的武器装备使用需求映射方法

针对传统优化方法不能对武器装备使用主体――部队的使用需求进行有效考虑,提出武器装备使用需求到性能指标映射的串联QFD神经网络方法.该方法综合利用了QFD方法采集信息准确快速、神经网络能够精确模拟多变量输入输出强非线性关系的优点,提高了映射精度与针对性,克服了传统需求分析侧重于推理而轻实践、侧重于"设计方"而轻"使用方"的弊端,集中体现了"用户"为主的思想.改进了传统BP网络训练算法,给出了武器装备使用需求映射适应度函数.最后,结合实例对方法及算法进行了可靠性验证.     

Optimal outbound dispatch policies: Modeling inventory and cargo capacity

In this paper, we present an optimization model for coordinating inventory and transportation decisions at an outbound distribution warehouse that serves a group of customers located in a given market area. For the practical problems which motivated this paper, the warehouse is operated by a third party logistics provider. However, the models developed here may be applicable in a more general context where outbound distribution is managed by another supply chain member, e.g., a manufacturer. We consider the case where the aggregate demand of the market area is constant and known per period (e.g., per day). Under an immediate delivery policy, an outbound shipment is released each time a demand is realized (e.g., on a daily basis). On the other hand, if these shipments are consolidated over time, then larger (hence more economical) outbound freight quantities can be dispatched. In this case, the physical inventory requirements at the third party warehouse (TPW) are determined by the consolidated freight quantities. Thus, stock replenishment and outbound shipment release policies should be coordinated. By optimizing inventory and freight consolidation decisions simultaneously, we compute the parameters of an integrated inventory/outbound transportation policy. These parameters determine: (i) how often to dispatch a truck so that transportation scale economies are realized and timely delivery requirements are met, and (ii) how often, and in what quantities, the stock should be replenished at the TPW. We prove that the optimal shipment release timing policy is nonstationary, and we present algorithms for computing the policy parameters for both the uncapacitated and finite cargo capacity problems. The model presented in this study is considerably different from the existing inventory/transportation models in the literature. The classical inventory literature assumes that demands should be satisfied as they arrive so that outbound shipment costs are sunk costs, or else these costs are covered by the customer. Hence, the classical literature does not model outbound transportation costs. However, if a freight consolidation policy is in place then the outbound transportation costs can no longer be ignored in optimization. Relying on this observation, this paper models outbound transportation costs, freight consolidation decisions, and cargo capacity constraints explicitly. © 2002 Wiley Periodicals, Inc. Naval Research Logistics 49: 531–556, 2002; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/nav.10030     

国外爆炸物检测技术综述（一）——痕量爆炸物检测技术

本文首先简要介绍了我国所面临的爆炸恐怖成胁，对现有的爆炸物检测技术进行了系统分类，详细论述了国外的痕量爆炸物检测技术，并对个别技术的优缺点进行了比较分析。对了解国外爆炸物检测技术有一定的参考价值。     

协同空战制导优势模型研究

为解决多机协同空战中对导弹制导权移交时的制导机选择问题,建立了一种新的制导优势模型。分析了空空条件下制导优势的影响因素,主要包括机载脉冲多普勒雷达对目标的探测能力、雷达制导链路能力和导弹回传链路能力;根据不同态势下目标的雷达截面积和地杂波,采用探测概率建立了雷达探测优势模型;根据制导链路和回传链路接收的功率,建立了不同态势下的制导链路优势模型和回传链路优势模型;将前述三者优势聚合为制导优势模型。仿真实验证明了模型的合理性与有效性。     

突袭敌方指挥所兵力需求仿真

甲方以特种部队突袭乙方师(旅)指挥所的行动是未来渡海登岛作战中的重要内容,能大大加快战役进程.战前通过侦察已知对方实力,通过作战模拟的方法确定规定时间内完成任务所需派遣特种部队的规模有决定性意义.采用指数-Lanchester理论模拟作战过程,在考虑气象、士气因素对作战过程影响的基础上,以甲方在消灭乙方50%有生力量后作战结束,通过MATLAB7 0仿真工具得出在一定的作战想定条件下甲方需要投入兵力的综合战斗力指数.     

基于组成要素的作战体系构建方法研究

针对当前作战体系构建理论研究中的若干问题,提出了基于组成要素的作战体系构建方法,对作战体系进行了模块分解和功能要求分析,得出了基于组成要素构建一般作战体系的框架图,可为同类作战体系构建提供参考。     

一种高效的显式模型检验方法

随着软硬件系统规模和功能的不断扩充,状态空间爆炸问题严重影响了模型检验的进一步发展与应用,成为验证大规模系统的瓶颈.在显式模型检验工具Murphi的基础上,针对其可达状态空间组织存在的问题进行改进,提出了基于整型指针与Fibonacci散列的可达状态空间组织方法,实现了一个高效的显式模型检验原型系统,在确保验证正确的同时有效缩短了验证时间,并能在系统规范不可满足的情况下给出反例,有助于系统设计人员快速定位错误.理论分析和实验结果表明了本方法的有效性.     

Exact algorithms for scheduling multiple families of jobs on parallel machines

In many practical manufacturing environments, jobs to be processed can be divided into different families such that a setup is required whenever there is a switch from processing a job of one family to another job of a different family. The time for setup could be sequence independent or sequence dependent. We consider two particular scheduling problems relevant to such situations. In both problems, we are given a set of jobs to be processed on a set of identical parallel machines. The objective of the first problem is to minimize total weighted completion time of jobs, and that of the second problem is to minimize weighted number of tardy jobs. We propose column generation based branch and bound exact solution algorithms for the problems. Computational experiments show that the algorithms are capable of solving both problems of medium size to optimality within reasonable computational time. © 2003 Wiley Periodicals, Inc. Naval Research Logistics 50: 823–840, 2003.     

New inequalities for finite and infinite group problems from approximate lifting

In this paper, we derive new families of facet‐defining inequalities for the finite group problem and extreme inequalities for the infinite group problem using approximate lifting. The new valid inequalities for the finite group problem include two‐ and three‐slope facet‐defining inequalities as well as the first family of four‐slope facet‐defining inequalities. The new valid inequalities for the infinite group problem include families of two‐ and three‐slope extreme inequalities. These new inequalities not only illustrate the diversity of strong inequalities for the finite and infinite group problems, but also provide a large variety of new cutting planes for solving integer and mixed‐integer programming problems. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008