激波诱导异质气体界面失稳的数值模拟

基于二维N-S方程,利用有限差分数值离散方法,对激波诱导异质气体界面失稳的现象进行了数值模拟,与文献中实验结果和计算结果进行了定性比较,并进一步分析了整个流动的非定常动态变化特性和非线性特征.研究表明,本文数值模拟的非定常流场图谱与文献中的实验结果和数值结果吻合较好;数值结果捕捉到了六氟化硫界面的演变过程及流场中复杂的波系结构.     

一种基于0-1整数规划的全局数据分布优化方法

数据分布是影响并行程序在分布主存多处理机上执行性能的重要因素.针对分布主存多处理机中的数据分布问题,提出了一种基于0-1整数规划、利用数据变换技术进行有效数据分布的方法.该方法通过数据变换技术改变数据的存储布局,以使得数据能被有效地分布,并且该方法还利用数据分布图描述程序被并行的情况及其所含数组被访问的情况,并将全局数据分布优化问题转换为求解数据分布图中最优路径的问题,从而可用0-1整数规划求解最优路径问题.该方法能对多个嵌套循环中具有仿射数组下标的任意维数组进行有效的数据分布,并且也能使嵌套循环的并行度尽可能地大.另外,该方法也考虑了偏移常量的对准问题,从而能使数据通信量尽量地小.实验结果验证了该方法的有效性.     

Supply chain coordination with product line design and a revenue sharing scheme

Many manufacturers sell their products through retailers and share the revenue with those retailers. Given this phenomenon, we build a stylized model to investigate the role of revenue sharing schemes in supply chain coordination and product variety decisions. In our model, a monopolistic manufacturer serves two segments of consumers, which are distinguished by their willingness to pay for quality. In the scenario with exogenous revenue sharing ratios, when the potential gain from serving the low segment is substantial (e.g., the low‐segment consumers' willingness to pay is high enough or the low segment takes a large enough proportion of the market), the retailer is better off abandoning the revenue sharing scheme. Moreover, when the potential gain from serving the low (high) segment is substantial enough, the manufacturer finds it profitable to offer a single product. Furthermore, when revenue sharing ratios are endogenous, we divide our analysis into two cases, depending on the methods of cooperation. When revenue sharing ratios are negotiated at the very beginning, the decentralized supply chain causes further distortion. This suggests that the central premise of revenue sharing—the coordination of supply chains—may be undermined if supply chain parties meticulously bargain over it.     

Single‐machine scheduling with deadlines to minimize the total weighted late work

We consider scheduling a set of jobs with deadlines to minimize the total weighted late work on a single machine, where the late work of a job is the amount of processing of the job that is scheduled after its due date and before its deadline. This is the first study on scheduling with the late work criterion under the deadline restriction. In this paper, we show that (i) the problem is unary NP‐hard even if all the jobs have a unit weight, (ii) the problem is binary NP‐hard and admits a pseudo‐polynomial‐time algorithm and a fully polynomial‐time approximation scheme if all the jobs have a common due date, and (iii) some special cases of the problem are polynomially solvable.     

光学波导中原子干涉的加速度测量

提出一种水平方向、光学波导中原子干涉的加速度测量方案.详细介绍了光路结构、原子团制备以及光学波导的绝热装载等.通过实验手段对测量方案进行验证,首先将87 Rb原子团冷却至50 nK的玻色爱因斯坦凝聚态,随后对超冷原子团施加布拉格光进行分束、合束,完成原子干涉过程.实验结果显示,所提干涉测量系统能够实现单轴加速度测量,对...     

The building evacuation problem with shared information

In this article, the Building Evacuation Problem with Shared Information (BEPSI) is formulated as a mixed integer linear program, where the objective is to determine the set of routes along which to send evacuees (supply) from multiple locations throughout a building (sources) to the exits (sinks) such that the total time until all evacuees reach the exits is minimized. The formulation explicitly incorporates the constraints of shared information in providing online instructions to evacuees, ensuring that evacuees departing from an intermediate or source location at a mutual point in time receive common instructions. Arc travel time and capacity, as well as supply at the nodes, are permitted to vary with time and capacity is assumed to be recaptured over time. The BEPSI is shown to be NP‐hard. An exact technique based on Benders decomposition is proposed for its solution. Computational results from numerical experiments on a real‐world network representing a four‐story building are given. Results of experiments employing Benders cuts generated in solving a given problem instance as initial cuts in addressing an updated problem instance are also provided. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008     

Dynamic inventory management with cash flow constraints

In this article, we consider a classic dynamic inventory control problem of a self‐financing retailer who periodically replenishes its stock from a supplier and sells it to the market. The replenishment decisions of the retailer are constrained by cash flow, which is updated periodically following purchasing and sales in each period. Excess demand in each period is lost when insufficient inventory is in stock. The retailer's objective is to maximize its expected terminal wealth at the end of the planning horizon. We characterize the optimal inventory control policy and present a simple algorithm for computing the optimal policies for each period. Conditions are identified under which the optimal control policies are identical across periods. We also present comparative statics results on the optimal control policy. © 2008 Wiley Periodicals, Inc. Naval Research Logistics 2008     

基于Erasure Code的分割文件P2P存储结构设计

在充分考虑P2P存储特点的前提下,设计了一种新颖的基于Erasure Code的分割文件P2P存储方案,构建Chord协议上的P2P文件存储结构.通过设计有效的文件存储、访问和更新功能,克服传统Erasure Code冗余文件存储方案的不足,使存储文件具有一定的数据修改能力和结构伸缩能力.理论分析和实验仿真验证了设计方案在P2P存储系统中的可行性和有效性.     

LFM脉冲雷达距离维快速搜索处理算法

针对脉冲雷达近距离目标遮挡问题,从理论上分析了雷达最小作用距离不受限于脉冲宽度.在此基础上,以Chirp脉冲为例,提出了一种适合远近距离全程目标的快速搜索处理算法.该算法只需发射一种宽脉冲波形,而不必根据距离的变化改变脉宽,从而有效缩短了搜索时间,大大提高了搜索效率.仿真结果表明了理论分析的正确性和算法的有效性.     

一类三角结构非线性系统状态参考反演变结构控制

针对一类三角结构非匹配不确定性非线性系统,结合参考状态、反演设计和变结构控制方法,研究了其在非匹配不确定性和未知干扰下的跟踪控制问题,提出了状态参考反演变结构控制策略,设计的状态参考反演变结构控制器实现鲁棒输出跟踪,闭环系统在有限时间进入滑动模态.仿真算例证实了理论研究成果的正确性和可行性.