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     

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

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

耐久性及其在装备研制中的应用

机械产品在武器装备中占有较大的比例,机械产品的故障,有很多是由于疲劳、磨损、腐蚀、老化等渐变性的耗损过程造成的,寿命是机械产品可靠性中的重要问题。耐久性的提出为解决机械产品与寿命有关的问题提供了方法和工具。通过探讨耐久性的定义、极限状态、耐久性参数、耐久性分配与预计等有关耐久性的基本问题,给出了耐久性分配与预计的工程实例。     

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     

Revenue management with aircraft reassignment flexibility

A well‐studied problem in airline revenue management is the optimal allocation of seat inventory among different fare‐classes, given a capacity for the flight and a demand distribution for each class. In practice, capacity on a flight does not have to be fixed; airlines can exercise some flexibility on the supply side by swapping aircraft of different capacities between flights as partial booking information is gathered. This provides the airline with the capability to more effectively match their supply and demand. In this paper, we study the seat inventory control problem considering the aircraft swapping option. For theoretical and practical purposes, we restrict our attention to the class of booking limit policies. Our analytical results demonstrate that booking limits considering the swapping option can be considerably different from those under fixed capacity. We also show that principles on the relationship between the optimal booking limits and demand characteristics (size and risk) developed for the fixed‐capacity problem no longer hold when swapping is an option. We develop new principles and insights on how demand characteristics affect the optimal booking limits under the swapping possibility. We also develop an easy to implement heuristic for determining the booking limits under the swapping option and show, through a numerical study, that the heuristic generates revenues close to those under the optimal booking limits. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011     

虚拟PDM环境下基于特征增长的协同设计

协同设计目前已经成为解决复杂产品设计问题的关键技术之一.在分析了现有协同设计问题的基础上,提出通过构建虚拟PDM(VPDM,Virtual PDM),应用交换特征增长数据的方法,来解决企业间异构PDM、CAD应用系统的协同设计问题.给出了虚拟PDM的定义,并介绍了基于虚拟PDM进行协同设计的基本原理.建立了基于虚拟PD...     

协同通信中的基于信道统计信息的联合中继选择的功率分配

分析Rayleigh信道下分集/无分集的AF( Amplify and Forward)和DF( Decode and Forward)模式单中继传输的平均中断概率,给出解析表达式.在总功率约束下推导了4种模式下的统计最优功率分配的解析表达式来最小化系统的平均中断概率,并提出通过最佳中继选择进一步降低系统的平均中断概率...     

改进合同网协议的Agent动态任务分配

针对导弹作战任务规划中的动态任务分配问题,研究了MAS框架下任务分配的形式化描述和数学模型,对动态任务分配的特点进行了分析,运用合同网理论,提出了基于改进合同网协议的Agent动态任务分配算法,实现了对不确定开放环境中动态变化的任务分配方法。算例表明算法是有效的。     

商贸城消防安全管理存在问题及对策

针对贵州省商贸城商业用房的消防安全管理工作现状的分析,提出以＂防火墙＂工作建设为契机,加大对商贸城商业用房的消防安全管理力度,使此项重而难的工作逐步走向良好轨道,避免出现重大火灾事故,为构建和谐社会奠定良好基础。     

Bounded flexibility in days‐on and days‐off scheduling

This article presents a flexible days‐on and days‐off scheduling problem and develops an exact branch and price (B&P) algorithm to find solutions. The main objective is to minimize the size of the total workforce required to cover time‐varying demand over a planning horizon that may extend up to 12 weeks. A new aspect of the problem is the general restriction that the number of consecutive days on and the number of consecutive days off must each fall within a predefined range. Moreover, the total assignment of working days in the planning horizon cannot exceed some maximum value. In the B&P framework, the master problem is stated as a set covering‐type problem whose columns are generated iteratively by solving one of three different subproblems. The first is an implicit model, the second is a resource constrained shortest path problem, and the third is a dynamic program. Computational experiments using both real‐word and randomly generated data show that workforce reductions up to 66% are possible with highly flexible days‐on and days‐off patterns. When evaluating the performance of the three subproblems, it was found that each yielded equivalent solutions but the dynamic program proved to be significantly more efficient. © 2013 Wiley Periodicals, Inc. Naval Research Logistics 60: 678–701, 2013