The value of information sharing in a two‐stage supply chain with production capacity constraints

We consider a simple two‐stage supply chain with a single retailer facing i.i.d. demand and a single manufacturer with finite production capacity. We analyze the value of information sharing between the retailer and the manufacturer over a finite time horizon. In our model, the manufacturer receives demand information from the retailer even during time periods in which the retailer does not order. To analyze the impact of information sharing, we consider the following three strategies: (1) the retailer does not share demand information with the manufacturer; (2) the retailer does share demand information with the manufacturer and the manufacturer uses the optimal policy to schedule production; (3) the retailer shares demand information with the manufacturer and the manufacturer uses a greedy policy to schedule production. These strategies allow us to study the impact of information sharing on the manufacturer as a function of the production capacity, and the frequency and timing in which demand information is shared. © 2003 Wiley Periodicals, Inc. Naval Research Logistics, 2003     

Optimal stopping in software testing

In this paper we address the problem of how to decide when to terminate the testing/modification process and to release the software during the development phase. We present a Bayesian decision theoretic approach by formulating the optimal release problem as a sequential decision problem. By using a non‐Gaussian Kalman filter type model, proposed by Chen and Singpurwalla (1994), to track software reliability, we are able to obtain tractable expressions for inference and determine a one‐stage look ahead stopping rule under reasonable conditions and a class of loss functions. © 2002 Wiley Periodicals, Inc. Naval Research Logistics, 2003     

蚁群算法在光电载荷标校中的应用

针对空中平台光电载荷安装误差的梗准问题,提出了一种利用蚁群算法实现动态标校的方法.通过光电裁荷测量得到的目标方位角、俯仰角和平台导航信息,结合GPs转化得到的方位角、俯仰角真值,建立了基于最优估计理论的目标函数,并利用蚁群算法求得了系统的安装误差.通过蒙特卡洛模拟仿真,验证了该方法能够较为准确地标定出安装误差;通过校准,有效避免了由安装误差引起的结果有偏,使得目标跟踪结果收敛至真值附近.     

扭力矩对曲折槽保险机构动力学响应影响分析

在考虑扭力矩作用的基础上,建立曲折槽保险机构的动力学模型,以某机构为计算实例,与传统的动力学模型进行比较。数值计算结果表明：引信跌落到硬质地面时,扭力矩的影响作用不明显,而跌落到松软地面上时扭力矩使惯性简的位移响应明显增大,不能忽略。其结论为判断长储引信勤务处理意外跌落的安全状态提供了理论参考。     

基于个体行为差异的CGF岗位模型

当前,对作战仿真在广度和深度上提出了更高层次的需求,即在扩大仿真规模的同时,更加注重仿真精度的提高。通过分析传统平台级CGF（Computer Generated Forces）模型在满足仿真需求方面的不足,建立了基于战斗岗位的武器平台CGF模型结构,研究了作战过程中影响战斗人员决策与操作行为的主要行为因素及其影响机制,并将其引入到岗位模型。最后,实现了考虑个体行为因素的坦克CGF炮长岗位模型,并对所建立的坦克炮长岗位模型在某作战仿真系统中的应用效果进行了分析。     

随机动态规划的混合算法研究

针对随机条件下动态规划模型的主要特点,运用智能算法混合编程理论,设计了一种探索多阶段决策问题的智能混合算法.该算法首先将问题转化成一族同类型的一步决策子问题,然后利用随机模拟和遗传算法,依据训练样本形成的训练神经元网络,在单步决策中寻求最优策略和最优目标值,逐个求解,再据初始状态逆序求出最优策略序列和最优目标值.仿真结果表明,该算法具有一定的通用性,初始设计点可以随机产生,其计算精度不因函数的非线性强弱而受影响,对目标和约束的限制较少,可应用于多种形式的随机多阶段决策优化问题,较好地满足了随机动态规划模型求解和优化的要求.     

一种基于AMDF和ACF的基音周期提取算法研究

文中提出一种基于短时平均幅度差分函数(AMDF)和短时自相关函数(ACF)的基音周期提取算法。首先,将每帧语音信号通过AMDF算法进行计算,然后把得到的AMDF数值再通过ACF算法进行计算,得出每帧信号的基音周期,最后运用动态平滑技术计算出最终语音信号的基音周期。通过仿真实现该算法,并同基于MAMDF和ACF的基音周期提取算法进行比较。     

Two‐machine flow shop scheduling with common due window to minimize weighted number of early and tardy jobs

This article studies two due window scheduling problems to minimize the weighted number of early and tardy jobs in a two‐machine flow shop, where the window size is externally determined. These new scheduling models have many practical applications in real life. However, results on these problems have rarely appeared in the literature because of a lack of structural and optimality properties for solving them. In this article, we derive several dominance properties and theorems, including elimination rules and sequencing rules based on Johnsos order, lower bounds on the penalty, and upper bounds on the window location, which help to significantly trim the search space for the problems. We further show that the problems are NP‐hard in the ordinary sense only. We finally develop efficient pseudopolynomial dynamic programming algorithms for solving the problems. © 2009 Wiley Periodicals, Inc. Naval Research Logistics, 2009     

What you should know about approximate dynamic programming

Approximate dynamic programming (ADP) is a broad umbrella for a modeling and algorithmic strategy for solving problems that are sometimes large and complex, and are usually (but not always) stochastic. It is most often presented as a method for overcoming the classic curse of dimensionality that is well‐known to plague the use of Bellman's equation. For many problems, there are actually up to three curses of dimensionality. But the richer message of approximate dynamic programming is learning what to learn, and how to learn it, to make better decisions over time. This article provides a brief review of approximate dynamic programming, without intending to be a complete tutorial. Instead, our goal is to provide a broader perspective of ADP and how it should be approached from the perspective of different problem classes. © 2009 Wiley Periodicals, Inc. Naval Research Logistics 2009     

从行为思维到知性思维：草原核心文化的思维图式

从逻辑运思来看,草原核心文化演绎著从行为思维到概念思维再到知性思维的历史图景。也正是在这个思维的自我否定的历史进程中,草原核心文化明证了其“是其所是”、“是其然是”和“是其应是”的内在机理,获得了原初性、革新性和旗帜性的生活表征。