15000m~3钢板贴壁油罐建设静态投资分析

以部队某保障基地油库军用柴油扩容工程采用钢板贴壁工艺新建的1座15 000 m3地下水封油池为例,从技术经济学角度对钢板贴壁油罐作了静态投资分析。该钢板贴壁油罐静态总投资1 756.95万元,其中占总投资比例最高者为地下工程建设,达到53.76%,库容投资1 171.30元/m3。结果表明:钢板贴壁油罐较地下水封石洞油罐整体经济效益明显;投资定额可供编制预算参考。     

系统可靠性分配的研究进展

系统可靠性分配是可靠性设计的重要任务之一,其主要作用是为可靠性设计提供辅助决策。给出了可靠性分配流程,研究了可靠性分配模型的发展状况,重点介绍了可靠性分配问题的求解算法,指出了各类算法在分配中的应用及其需进一步解决的问题,同时分析了国内外典型的分配软件,总结了各软件中可靠性分配的主要功能,最后对可靠性分配提出了进一步的研究展望。     

一种航天侦察任务-资源匹配的负载均衡方法

当前航天侦察任务预处理方法一般仅从任务需求的角度考虑资源分配问题,容易导致负载不均衡,对此提出了一种综合考虑任务需求与资源负载的任务-资源匹配方法.分析了资源负载均衡需要考虑的任务要素以及相应的描述方法,提出用任务执行概率度量卫星资源负载状况,基于任务流模型给出了单任务执行概率的估算公式,并给出了一种简易的多任务执行概...     

论国外开发落后地区的财政金融政策──兼谈对我国西部大开发的借鉴

国外在开发落后地区的政策方面已经积累了许多成功的经验和失败的教训。财政政策上涉及转移支付、财政补助、政府赠款、政府采购、税收优惠等。金融政策上涉及优惠贷款、贷款担保、资金跨区流动、投资基金等。这些对我国西部大开发都有着一定的借鉴意义。     

多UCAV协同控制中的任务分配模型及算法

任务分配是多UCAV协同控制的核心和有效保证。分析了影响目标价值毁伤、UCAV损耗、任务消耗时间等三项关键战技指标的因素,综合考虑实战中多UCAV同时攻击同一目标和使用软杀伤武器这两种典型情况对UCAV执行任务的影响,建立了针对攻击任务的多UCAV协同任务分配模型,并应用粒子群算法求解。仿真结果验证了模型的合理性和算法的有效性。     

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.     

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

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

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