量子计算的研究现状和发展动向

作为未来高性能计算研究的重要方向,量子计算受到了全世界的高度重视。文章简单介绍了量子计算的基本原理和研究现状,并对量子计算的未来发展作了分析与思考。     

Optimal control of noncollaborative servers in two‐stage tandem queueing systems

We consider two‐stage tandem queueing systems with dedicated servers in each station and a flexible server that is trained to serve both stations. We assume no arrivals, exponential service times, and linear holding costs for jobs present in the system. We study the optimal dynamic assignment of servers to jobs assuming a noncollaborative work discipline with idling and preemptions allowed. For larger holding costs in the first station, we show that (i) nonidling policies are optimal and (ii) if the flexible server is not faster than the dedicated servers, the optimal server allocation strategy has a threshold‐type structure. For all other cases, we provide numerical results that support the optimality of threshold‐type policies. Our numerical experiments also indicate that when the flexible server is faster than the dedicated server of the second station, the optimal policy may have counterintuitive properties, which is not the case when a collaborative service discipline is assumed. © 2014 Wiley Periodicals, Inc. Naval Research Logistics 61: 435–446, 2014     

Optimal patrol to uncover threats in time when detection is imperfect

Consider a patrol problem, where a patroller traverses a graph through edges to detect potential attacks at nodes. An attack takes a random amount of time to complete. The patroller takes one time unit to move to and inspect an adjacent node, and will detect an ongoing attack with some probability. If an attack completes before it is detected, a cost is incurred. The attack time distribution, the cost due to a successful attack, and the detection probability all depend on the attack node. The patroller seeks a patrol policy that minimizes the expected cost incurred when, and if, an attack eventually happens. We consider two cases. A random attacker chooses where to attack according to predetermined probabilities, while a strategic attacker chooses where to attack to incur the maximal expected cost. In each case, computing the optimal solution, although possible, quickly becomes intractable for problems of practical sizes. Our main contribution is to develop efficient index policies—based on Lagrangian relaxation methodology, and also on approximate dynamic programming—which typically achieve within 1% of optimality with computation time orders of magnitude less than what is required to compute the optimal policy for problems of practical sizes. © 2014 Wiley Periodicals, Inc. Naval Research Logistics, 61: 557–576, 2014     

盖板式陶瓷热防护系统的传热性能优化

针对高超声速飞行器对盖板式陶瓷热防护系统的迫切需求,建立了热防护系统结构瞬态传热模型;并研究了防隔热层的物性参数,厚度尺寸,相变层的种类、位置等因素对热防护系统结构传热性能的影响。结果表明,隔热层物性参数及厚度尺寸对热防护系统结构传热性能具有决定性影响,而防热层的物性参数及厚度尺寸几乎不产生影响。相变材料的引入能够明显改善热防护系统结构的传热性能。调整和优化相变层位置是改善热防护系统结构传热性能、降低结构厚度的一个有效途径。隔热层厚度的优化结果可为热防护系统结构设计提供一定的参考和依据。     

具有模糊系数约束的多目标线性规划

研究了一类具有模糊系数约束的多目标线性规划问题.根据各目标函数的梯度方向来量化目标之间的冲突程度,以此提出了一种确定目标权重的新方法,然后基于惩罚函数运用梯度上升算法求问题的有效解.最后给出了一个数值例子.     

线性规划的一种并行修正松弛算法

对求解线性规划问题的松弛算法进行了修正,在此基础上提出了一种基于cluster结构的并行算法,分析了算法的性能;基于曙光3000大规模并行计算机,给出了算法用于求解线性规划问题实例的实验结果.理论分析和实验结果表明,修正算法改进了松弛算法的实际性能,同时具有较好的并行性和稳定性,可用于求解此类大规模科学与工程规划问题的高性能计算.     

给定人员情况下最小化开发时间和成本的软件项目调度

给出了一种软件项目的随机调度模型.它明确地把调度策略作为输入,一旦调度策略确定,模型就可以输出关于项目的完成时间或成本的一个概率分布.利用随机最优化技术,能够计算出软件项目的一个调度策略,它使得项目在人员给定的情况下开发时间和成本最小.     

Concave envelopes of monomial functions over rectangles

The construction of convex and concave envelopes of real‐valued functions has been of interest in mathematical programming for over 3 decades. Much of this interest stems from the fact that convex and concave envelopes can play important roles in algorithms for solving various discrete and continuous global optimization problems. In this article, we use a simplicial subdivision tool to present and validate the formula for the concave envelope of a monomial function over a rectangle. Potential algorithmic applications of this formula are briefly indicated. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004     

A sequential dynamic pricing model and its applications

Consider a sequential dynamic pricing model where a seller sells a given stock to a random number of customers. Arriving one at a time, each customer will purchase one item if the product price is lower than her personal reservation price. The seller's objective is to post a potentially different price for each customer in order to maximize the expected total revenue. We formulate the seller's problem as a stochastic dynamic programming model, and develop an algorithm to compute the optimal policy. We then apply the results from this sequential dynamic pricing model to the case where customers arrive according to a continuous‐time point process. In particular, we derive tight bounds for the optimal expected revenue, and develop an asymptotically optimal heuristic policy. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004.     

Reformulating linear programs with transportation constraints—With applications to workforce scheduling

We study linear programming models that contain transportation constraints in their formulation. Typically, these models have a multistage nature and the transportation constraints together with the associated flow variables are used to achieve consistency between consecutive stages. We describe how to reformulate these models by projecting out the flow variables. The reformulation can be more desirable since it has fewer variables and can be solved faster. We apply these ideas to reformulate two well‐known workforce staffing and scheduling problems: the shift scheduling problem and the tour scheduling problem. We also present computational results. © 2003 Wiley Periodicals, Inc. Naval Research Logistics, 2004.