面向网络延迟均衡性的片上网络交叉开关分配策略

针对路由器中的交叉开关分配,提出面向网络延迟均衡性的分配策略,旨在通过更加公平的交叉开关分配策略提升网络延迟均衡性,从而进一步提升系统性能。通过在全系统模拟器上运行SPEC CPU2006实验表明,与传统的分离式分配策略和最新的TS-Router分配策略相比,延迟标准差分别平均降低了13. 8%和3. 9%,而最大延迟分别平均降低了45. 6%和15. 1%。在系统性能方面,相比于TS-Router,所提分配策略在IPC上平均提升了0. 8%。在分离式分配器的基础上完成了硬件实现,并给出了速度、面积和功耗方面的开销评估。     

基于粒子群算法维修保障单元优化配置

针对维修保障单元配置过程中需权衡综合多因素问题,提出了一种基于粒子群算法的维修保障单元优化配置决策模型和方法。首先,以维修任务完成概率为设计目标、以维修保障单元总数量为约束,建立维修保障单元配置决策模型;其次,运用粒子群算法对维修保障单元配置问题进行优化求解。通过具体实例分析,证明了该方法的正确性和有效性。     

认知无线Mesh网络中资源节约的最小信道冲突值组播路由算法

认知无线Mesh网络中满足服务质量约束的多目标优化组播路由问题比单目标优化组播问题更加复杂,为了快速求解认知无线Mesh网络中满足服务质量约束的、以最小化资源消耗与最小化信道冲突值为目标的多目标优化组播路由问题,提出一种基于粒子群优化算法的问题求解框架,包括问题描述、粒子编码与粒子初始化、适应度函数、粒子飞行、粒子变异、粒子消环。粒子由表示节点之间连接关系的带权邻接矩阵表示,重新定义了用于粒子飞行的3种运算规则以及粒子飞行运算和粒子变异运算。仿真结果表明提出的算法能达到预定目标,资源消耗较低且能获得较低的信道冲突值。     

基于保障场的装备保障力量配置优化研究

根据电场的作用机理,提出保障场的概念,从场思维的角度构建装备保障力量配置分析的优化模型;并进一步定量分析与定性判断相结合,提出装备保障力量配置优化的流程,最后结合实例具体分析。研究结果对装备保障的部署决策具有一定参考价值和指导意义。     

A cooperative game in search theory

Search theory originates from the military research efforts of WWII. Most researchers of that period modeled their search games in noncooperative games, where players are enemies or compete against each other. In this article, we deal with a cooperative search game, where multiple searchers behave cooperatively. First we describe several search problems and discuss the possibility of a coalition or cooperation among searchers. For the cooperative search game, we define a function named quasi‐characteristic function, which gives us a criterion similar to the so‐called characteristic function in the general coalition game with transferable utility. The search operation includes a kind of randomness with respect to whether the searchers can detect a target and get the value of the target. We also propose a methodology to divide the obtained target value among members of the coalition taking account of the randomness. As a concrete problem of the cooperative search game, we take the so‐called search allocation game, where searchers distribute their searching resources to detect a target in a cooperative way and the target moves in a search space to evade the searchers. Lastly, we discuss the core of the cooperative search allocation game. © 2009 Wiley Periodicals, Inc. Naval Research Logistics, 2009     

A specially structured nonlinear integer resource allocation problem

We present an algorithm for solving a specially structured nonlinear integer resource allocation problem. This problem was motivated by a capacity planning study done at a large Health Maintenance Organization in Texas. Specifically, we focus on a class of nonlinear resource allocation problems that involve the minimization of a convex function over one general convex constraint, a set of block diagonal convex constraints, and bounds on the integer variables. The continuous variable problem is also considered. The continuous problem is solved by taking advantage of the structure of the Karush‐Kuhn‐Tucker (KKT) conditions. This method for solving the continuous problem is then incorporated in a branch and bound algorithm to solve the integer problem. Various reoptimization results, multiplier bounding results, and heuristics are used to improve the efficiency of the algorithms. We show how the algorithms can be extended to obtain a globally optimal solution to the nonconvex version of the problem. We further show that the methods can be applied to problems in production planning and financial optimization. Extensive computational testing of the algorithms is reported for a variety of applications on continuous problems with up to 1,000,000 variables and integer problems with up to 1000 variables. © 2003 Wiley Periodicals, Inc. Naval Research Logistics 50: 770–792, 2003.     

一种确定载荷识别分析频带宽度的方法

本文研究在载荷识别中确定载荷的分析处理频带宽度的方法。提出将载荷95％的能量对应的频率f_0,作为分析处理带宽。该方法具有一般性。     

布达拉宫古建筑灭火设施优化配置研究

为配合布达拉宫的消防工程改造，优化其建筑灭火设施的配置，针对现阶段布达拉宫建筑灭火设施现状，剖析了其存在的问题和缺陷，介绍了国外文物古建筑消防保护的理念，阐明了古建筑灭火设施优化配置应遵循的原则，通过对各类灭火设施保护宫殿的可行性和适用性分析，提出了布达拉宫古建筑灭火设施优化配置方案。     

一种面向分布式寄存器文件的VLIW调度新策略

新一代面向密集计算的高性能处理器普遍采用分布式寄存器文件来支撑ALU阵列,并通过VLIW开发指令级并行.面向分布式寄存器文件的编译成为新兴的研究热点,在斯坦福大学的kernelC编译器ISCD中最早提出了面向分布式寄存器的VLIW调度问题,在该领域处于领先水平,但是没有解决重负载下的分布式寄存器分配问题,使应用编程受到极大限制.在其基础上提出了一种新的VLIW调度策略,实验结果表明能够很好地解决重负载下的分布式寄存器分配问题.     

Optimal resource allocation and redistribution strategy in military conflicts with Lanchester square law attrition

We address the problem of optimal decision‐making in conflicts based on Lanchester square law attrition model where a defending force needs to be partitioned optimally, and allocated to two different attacking forces of differing strengths and capabilities. We consider a resource allocation scheme called the Time Zero Allocation with Redistribution (TZAR) strategy, where allocation is followed by redistribution of defending forces, on the occurrence of certain decisive events. Unlike previous work on Lanchester attrition model based tactical decision‐making, which propose time sequential tactics through an optimal control approach, the present article focuses on obtaining simpler resource allocation tactics based on a static optimization framework, and demonstrates that the results obtained are similar to those obtained by the more complex dynamic optimal control solution. Complete solution for this strategy is obtained for optimal partitioning of resources of the defending forces. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008