时域基音同步叠加(TD-PSOLA)算法研究

针对TD-PSOLA算法的合成语音容易出现相位不连续的问题,提出了一种改进的平移综合方法。仿真结果显示,改进的算法能够提高合成语音的质量。     

The effects of information on a queue with balking and phase‐type service times

This article generalizes the models in Guo and Zipkin, who focus on exponential service times, to systems with phase‐type service times. Each arriving customer decides whether to stay or balk based on his expected waiting cost, conditional on the information provided. We show how to compute the throughput and customers' average utility in each case. We then obtain some analytical and numerical results to assess the effect of more or less information. We also show that service‐time variability degrades the system's performance. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008     

基于先验信息的分布式星载单基线SAR/ATI方法

在综述了分布式星载SAP/ATI技术的基础上,阐述了单基线SAP/ATI技术的原理和杂波、噪声对检测、测速性能的影响,给出了一种基于先验信息的单基线SAR/ATI检测和测速方法,最后基于多功能的天基雷达仿真系统进行了仿真实验和性能分析.     

连续波DF/HF化学激光器喷管中氟原子复合计算

氟原子是连续波DF/HF化学激光器泵浦反应的重要参与者,其浓度分布尤其直接影响冷反应型激光器的泵浦效率及激射强度.在参与反应之前,氟原子将受到三体复合和壁面复合因素的影响而部分复合为氟分子.研究该因素对氟原子浓度的影响对激光器的分析优化是十分重要的.已有一定的实验方法可对其浓度进行测量研究,并建立了理论模型描述.将其与计算流体力学方法相结合对氟原子分布进行计算,研究了该方法的有效性,并对不同收缩段型面下氟原子复合进行了计算研究.     

Contractual agreements for coordination and vendor‐managed delivery under explicit transportation considerations

We consider the coordination problem between a vendor and a buyer operating under generalized replenishment costs that include fixed costs as well as stepwise freight costs. We study the stochastic demand, single‐period setting where the buyer must decide on the order quantity to satisfy random demand for a single item with a short product life cycle. The full order for the cycle is placed before the cycle begins and no additional orders are accepted by the vendor. Due to the nonrecurring nature of the problem, the vendor's replenishment quantity is determined by the buyer's order quantity. Consequently, by using an appropriate pricing schedule to influence the buyer's ordering behavior, there is an opportunity for the vendor to achieve substantial savings from transportation expenses, which are represented in the generalized replenishment cost function. For the problem of interest, we prove that the vendor's expected profit is not increasing in buyer's order quantity. Therefore, unlike the earlier work in the area, it is not necessarily profitable for the vendor to encourage larger order quantities. Using this nontraditional result, we demonstrate that the concept of economies of scale may or may not work by identifying the cases where the vendor can increase his/her profits either by increasing or decreasing the buyer's order quantity. We prove useful properties of the expected profit functions in the centralized and decentralized models of the problem, and we utilize these properties to develop alternative incentive schemes for win–win solutions. Our analysis allows us to quantify the value of coordination and, hence, to identify additional opportunities for the vendor to improve his/her profits by potentially turning a nonprofitable transaction into a profitable one through the use of an appropriate tariff schedule or a vendor‐managed delivery contract. We demonstrate that financial gain associated with these opportunities is truly tangible under a vendor‐managed delivery arrangement that potentially improves the centralized solution. Although we take the viewpoint of supply chain coordination and our goal is to provide insights about the effect of transportation considerations on the channel coordination objective and contractual agreements, the paper also contributes to the literature by analyzing and developing efficient approaches for solving the centralized problem with stepwise freight costs in the single‐period setting. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2006     

任务空间概念模型VV&A研究

任务空间概念模型是现实世界军事知识的第一层抽象,是仿真系统开发的业务基础。所以任务空间概念模型的质量直接影响到仿真系统的质量,任务空间概念模型自身的VV&A是一个非常值得关注的问题。任务空间概念建模本质上看是军事领域的知识表示或者需求描述,定性描述占主要,定量成分非常少。因此,传统的通过分析输出数据的方法不能适应任务空间概念模型的特点。概要介绍了任务空间概念模型建模,并且提出了从专家法、静态校核机制、概念执行机制三个角度来考察模型质量的思路。     

云模型及其在指挥控制系统可靠性分析中的应用

根据指挥控制系统的特点及作战应用的具体情况,从指挥控制系统的可靠性出发,提出了适合指控系统可靠性分析的云模型。通过拟定性能评价指标,导出各指标的云模型及其多维加权综合云的重心,应用云重心评价方法进行分析;并通过案例,运用基于PC-L INM AP的云重心评价方法,以影响指挥控制系统可靠性的两个重要性能指标为依据,分析了未来联合作战中指挥控制系统的可靠性,比较贴近作战实际,可信度较高。     

纳米颗粒和非晶相复合刷镀层n-Al2O3／Ni-P的制备

采用纳米电刷镀技术在钢基体表面制备了n-Al2O3/Ni-P复合刷镀层,研究了复合刷镀液中纳米颗粒含量、刷镀电压和刷镀笔移动速度对复合刷镀层中P和Al2O3含量的影响.优化后的工艺参数范围为刷镀液中n-Al2O3颗粒含量20～30 g/L、刷镀电压8～12 V、刷镀笔移动速度5～10 m/min.制备的n-Al2O3/Ni-P复合刷镀层组织致密,含有纳米颗粒和非晶相.     

Optimal pricing and inventory control policy in periodic‐review systems with fixed ordering cost and lost sales

This paper studies a periodic‐review pricing and inventory control problem for a retailer, which faces stochastic price‐sensitive demand, under quite general modeling assumptions. Any unsatisfied demand is lost, and any leftover inventory at the end of the finite selling horizon has a salvage value. The cost component for the retailer includes holding, shortage, and both variable and fixed ordering costs. The retailer's objective is to maximize its discounted expected profit over the selling horizon by dynamically deciding on the optimal pricing and replenishment policy for each period. We show that, under a mild assumption on the additive demand function, at the beginning of each period an (s,S) policy is optimal for replenishment, and the value of the optimal price depends on the inventory level after the replenishment decision has been done. Our numerical study also suggests that for a sufficiently long selling horizon, the optimal policy is almost stationary. Furthermore, the fixed ordering cost (K) plays a significant role in our modeling framework. Specifically, any increase in K results in lower s and higher S. On the other hand, the profit impact of dynamically changing the retail price, contrasted with a single fixed price throughout the selling horizon, also increases with K. We demonstrate that using the optimal policy values from a model with backordering of unmet demands as approximations in our model might result in significant profit penalty. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2006     

Algorithms for the multi‐item multi‐vehicles dynamic lot sizing problem

We consider a two‐stage supply chain, in which multi‐items are shipped from a manufacturing facility or a central warehouse to a downstream retailer that faces deterministic external demand for each of the items over a finite planning horizon. The items are shipped through identical capacitated vehicles, each incurring a fixed cost per trip. In addition, there exist item‐dependent variable shipping costs and inventory holding costs at the retailer for items stored at the end of the period; these costs are constant over time. The sum of all costs must be minimized while satisfying the external demand without backlogging. In this paper we develop a search algorithm to solve the problem optimally. Our search algorithm, although exponential in the worst case, is very efficient empirically due to new properties of the optimal solution that we found, which allow us to restrict the number of solutions examined. Second, we perform a computational study that compares the empirical running time of our search methods to other available exact solution methods to the problem. Finally, we characterize the conditions under which each of the solution methods is likely to be faster than the others and suggest efficient heuristic solutions that we recommend using when the problem is large in all dimensions. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2006.