基于多层循环并行化的负载平衡优化

负载平衡是并行处理中的一个重要概念。参与一个程序执行的各处理机所承担的工作量是否均衡直接影响该程序的并行性能。本文对面向MPP系统程序循环级并行化中负载平衡的优化进行了探讨,提出了优化策略及其实施算法。     

解析方法与数值模拟相结合求解炸药在容器内部爆炸产生的壁面载荷

本文采用总变差递减（TVD）数值方法与强爆炸解析解相结合的手段,求解了炸药在爆炸容器内部产生的作用载荷。计算结果与实验值在几个典型位置进行了比较,二者有良好的符合。与单纯的数值方法相比,本文所探索的方法能有效地克服对称轴附近的数值振荡,不失为确定爆炸载荷的一种新途径。     

拉压异性材料厚壁圆筒和厚壁球壳的极限载荷分析

本文利用库仑屈服准则,研究了拉压异性材料厚壁圆筒和厚壁球壳的弹性极限载荷和塑性极限载荷,得出了新的结果和结论。计算结果表明,考虑了材料的拉压异性之后,厚壁圆筒和厚壁球壳的极限载荷均有明显提高。     

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

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

坦克柴油机比油耗实车测试的研究

针对实车检测坦克柴油机比油耗的原理和方法作了探讨,对12150L柴油机进行了实车比油耗测试,认为用无负荷方法实车测定柴油机有效功率,同时用涡轮流量计测量燃油消耗量是实车测量发动机比油耗可行的方法。     

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

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

一种面向分布式寄存器文件的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     

Equitable bandwidth allocation in content distribution networks

Applications for content distribution over networks, such as Video‐on‐Demand (VOD), are expected to grow significantly over time. Effective bandwidth allocation schemes that can be repeatedly executed must be deployed since new programs are often installed at various servers while other are deleted. We present a model for bandwidth allocation in a content distribution network that consists of multiple trees, where the root of each tree has a server that broadcasts multiple programs throughout the tree. Each network link has limited capacity and may be used by one or more of these trees. The model is formulated as an equitable resource allocation problem with a lexicographic maximin objective function that attempts to provide equitable service performance for all requested programs at the various nodes. The constraints include link capacity constraints and tree‐like ordering constraints imposed on each of the programs. We present an algorithm that provides an equitable solution in polynomial time for certain performance functions. At each iteration, the algorithm solves single‐link maximin optimization problems while relaxing the ordering constraints. The algorithm selects a bottleneck link, fixes various variables at their lexicographic optimal solution while enforcing the ordering constraints, and proceeds with the next iteration. © 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010     

Models for production planning under power interruptions

We present a robust optimization model for production planning under the assumption that electricity supply is subject to uncertain interruptions caused by participation in interruptible load contracts (ILCs). The objective is to minimize the cost of electricity used for production while providing a robust production plan which ensures demand satisfaction under all possible interruption scenarios. The combinatorial size of the set of interruption scenarios makes this a challenging problem. Furthermore, we assume that no probabilistic information is known about the supply uncertainty: we only use the information given in the ILC to identify an uncertainty set that captures the possible scenarios. We construct a general robust framework to handle this uncertainty and present a heuristic to compute a good feasible solution of the robust model. We provide computational experiments on a real‐world example and compare the performance of an exact solver applied to the robust model with that of the heuristic procedure. Finally, we include the operational impact of interruptions such as “recovery modes” in the definition of the uncertainty set. © 2013 Wiley Periodicals, Inc. Naval Research Logistics, 2013