回转对称非球面光学零件磁流变成形抛光的驻留时间算法

介绍了一种基于代数算法的回转对称非球面计算机控制表面成形的驻留时间算法。该算法将驻留时间转化为工件自转的整数圈数,并且将抛光模对工件的材料去除效率体现到材料去除矩阵上进行计算。利用非负最小二乘法求解驻留时间向量。最后,利用该算法在自研的磁流变抛光实验装置上对一回转对称光学零件进行3次迭代加工,使其面形精度从8μm提高到0.5μm以内。     

Revenue management under randomly evolving economic conditions

We consider a dynamic pricing model in which the instantaneous rate of the demand arrival process is dependent on not only the current price charged by the concerned firm, but also the present state of the world. While reflecting the current economic condition, the state evolves in a Markovian fashion. This model represents the real‐life situation in which the sales season is relatively long compared to the fast pace at which the outside environment changes. We establish the value of being better informed on the state of the world. When reasonable monotonicity conditions are met, we show that better present economic conditions will lead to higher prices. Our computational study is partially calibrated with real data. It demonstrates that the benefit of heeding varying economic conditions is on par with the value of embracing randomness in the demand process. © 2015 Wiley Periodicals, Inc. Naval Research Logistics 66:73–89,2019     

双基地雷达系统时间同步方案研究

针对双基地雷达系统中时间同步方案,结合双向时间比对法对站点依赖性小,不易受外界环境影响和具备较高的精度等优势,分析了三种典型的双向时间比对法,给出了原理框图,推导了比对公式,分析了各自方案的误差来源。并作了方案之间的对比,得出基于对流层散射信道的双向时间比对法,更适合于目前的双基地雷达体系。为实现双基地雷达系统之间的时间同步提供一定的参考。     

引入电流变化率的电源分布网络最差噪声分析算法

随着时钟频率的增加以及电源电压的降低,电源完整性问题日益凸显。将电流变化率加入到最差噪声算法的电流约束中,能够在任意电流变化率的情况下分析电源分布网络的最差噪声,从而获得更加真实的最差噪声。另外,利用改进的Knuth-Yao四边形不等式法对基于动态规划的最差噪声算法进行加速,加速后算法的时间复杂度从O(n~2m)降为O(mnlogn)。     

Inventory cost impact of order processing priorities based on demand uncertainty

We evaluate an approach to decrease inventory costs at retail inventory locations that share a production facility. The retail locations sell the same product but differ in the variance of retail demand. Inventory policies at retail locations generate replenishment orders for the production facility. The production facility carries no finished goods inventory. Thus, production lead time for an order is the sojourn time in a single server queueing system. This lead time affects inventory costs at retail locations. We examine the impact of moving from a First Come First Served (FCFS) production rule for orders arriving at the production facility to a rule in which we provide non‐preemptive priority (PR) to orders from retail locations with higher demand uncertainty. We provide three approximations for the ratio of inventory costs under PR and FCFS and use them to identify conditions under which PR decreases retail inventory costs over FCFS. We then use a Direct Approach to establish conditions when PR decreases retail inventory costs over FCFS. We extend the results to orders from locations that differ in the mean and variance of demand uncertainty. The analysis suggests that tailoring lead times to product demand characteristics may decrease system inventory costs. © 2002 Wiley Periodicals, Inc. Naval Research Logistics 49: 376–390, 2002; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/nav.10016     

基于TDOA的双基无源定位方案

多站时差定位是一种较精确的定位方法,通过处理3个或3个以上测量站采集的信号到达时间来对辐射源定位.论述了多站时差无源定位的基本原理,提出了一种基于陆空平台相结合的TDOA(Time Difference Of Arrival)双基无源定位方案.主要论述了时差双基无源定位的基本原理,以及观测站与空中目标的同步、地面观测站的选择、误差校正等主要问题的实现方案,并给出了参与对目标视察定位的地面观测站的选择算法.此方案定位算法及定位精度仍在研究阶段.     

ATS:一种基于通告时间戳的BGP收敛性改进机制

研究BGP收敛性改进问题,考虑网络运行状况,提出一种新的机制,称为通告时间戳机制ATS(advertisement time stamp)。在该机制中,BGP路由器在向对等体发送路由通告报文时,将相应的路由前缀打上时间戳。当通告报文准备好时,通过查看相应前缀的时间戳来判断报文是否可以立即发送还是应该等待。该机制充分融合了每对等体每目的网络速率限制定时器和每对等体速率限制定时器各自的优点,克服各自缺点。分析表明,该机制可以较大地减少Tup、Tlong及Tshort事件的收敛延迟。     

Production scheduling with history‐dependent setup times

We consider a parallel‐machine scheduling problem with jobs that require setups. The duration of a setup does not depend only on the job just completed but on a number of preceding jobs. These setup times are referred to as history‐dependent. Such a scheduling problem is often encountered in the food processing industry as well as in other process industries. In our model, we consider two types of setup times—a regular setup time and a major setup time that becomes necessary after several “hard‐to‐clean” jobs have been processed on the same machine. We consider multiple objectives, including facility utilization, flexibility, number of major setups, and tardiness. We solve several special cases assuming predetermined job sequences and propose strongly polynomial time algorithms to determine the optimal timing of the major setups for given job sequences. We also extend our analysis to develop pseudopolynomial time algorithms for cases with additional objectives, including the total weighted completion time, the total weighted tardiness, and the weighted number of tardy jobs. © 2012 Wiley Periodicals, Inc. Naval Research Logistics, 2012     

论闲暇教育

随着社会的发展,个人所掌握的闲暇时间越来越多,闲暇教育也越来越为人重视。其实追溯历史,闲暇教育思想源远流长,梳理前人对闲暇教育的认识能使我们更好地理解闲暇教育。     

纯时滞三种群捕食系统持续生存与全局吸引性

研究了具有HollingⅡ功能性反应的纯时滞的两捕食者、一食饵生物系统,通过构造合理的Lyapunov函数讨论了系统的全局吸引性,并得到系统持续生存的充分条件。