Estimating the lead-time demand distribution for an autocorrelated demand by the pearson system and a normal approximation

The exact first four moments of lead-time demand L are derived for an AR(1) and a MA(1) demand structures where the arbitrary lead-time distribution is assumed to be independent of the demand structure. These moments then form a basis for the Pearson curve-fitting procedure for estimating the distribution of L. A normal approximation to L, a version of the central limit theorem, is obtained under some general conditions. Reorder points (ROPs) of an inventory system are then estimated based on the Pearson system and a normal approximation. Their performances are evaluated. Numerical investigation shows that the Pearson system performs extremely well. The normal approximation, however, is good only for some limited cases, and is sensitive to the choice of the lead-time distribution. A possible improvement is noted.     

超宽带雷达的欺骗式干扰技术研究

根据超宽带雷达的工作方式和成像特点,提出基于DRFM与DDS技术对超宽带雷达实施假目标干扰的方法.通过分析超宽带雷达距离维成像的基本原理,提出利用DDS技术对转发信号实施移频调制,并根据需要产生不同特征的假目标干扰.在理论分析的基础上进行了仿真实验,仿真结果证明了这种方法的可行性.该方法可对一维和二维雷达成像进行干扰.     

推进党内民主建设 增强党的团结统一

胡锦涛同志在党的十七大报告中,将"发展党内民主"提升到了"党内民主建设"的战略高度,并对推进党内民主建设明确了目标任务和有效方略。深入学习领会、准确把握讲话的这一精神,对于开创党内民主建设新局面具有重大而深远的意义。     

Clustered coverage orienteering problem of unmanned surface vehicles for water sampling

This study investigates a clustered coverage orienteering problem (CCOP), which is a generalization of the classical orienteering problem. The problem is widely motivated by the emerging unmanned techniques (eg, unmanned surface vehicles and drones) applied to environmental monitoring. Specifically, the unmanned surface vehicles (USVs) are used to monitor reservoir water quality by collecting samples. In the CCOP, the water sampling sites (ie, the nodes) are grouped into clusters, and a minimum number of nodes must be visited in each cluster. With each node representing a certain coverage area of the water, the objective of the CCOP is to monitor as much as possible the total coverage area in one tour of the USV, considering that overlapping areas provide no additional information. An integer programming model is first formulated through a linearization procedure that captures the overlapping feature. A two-stage exact algorithm is proposed to obtain an optimal solution to the problem. The efficiency and effectiveness of the two-stage exact algorithm are demonstrated through experiments on randomly generated instances. The algorithm can effectively solve instances with up to 60 sampling sites.     

Optimal production ramp-up in the smartphone manufacturing industry

Motivated by challenges in the smartphone manufacturing industry, we develop a dynamic production ramp-up model that can be applied to economically satisfy nonstationary demand for short-life-cycle products by high-tech companies. Due to shorter life cycles and more rapid evolution of smartphones, production ramp-up has been increasingly critical to the success of a new smartphone. In the production ramp-up, the key challenge is to match the increasing capacity to nonstationary demand. The high-tech smartphone manufacturers are urged to jointly consider the effect of increasing capacity and decreasing demand. We study the production planning problem using a high-dimensional Markov decision process (MDP) model to characterize the production ramp-up. To address the curse of dimensionality, we refine Monte Carlo tree search (MCTS) algorithm and theoretically analyze its convergence and computational complexity. In a real case study, we find that the MDP model achieves revenue improvement by stopping producing the existing product earlier than the benchmark policy. In synthetic instances, we validate that the proposed MCTS algorithm saves computation time without loss of solution quality compared with traditional value iteration algorithm. As part of the Lenovo production solution, our MDP model enables high-tech smartphone manufacturers to better plan the production ramp-up.     

Revenue maximization in two-station tandem queueing systems

We study optimal pricing for tandem queueing systems with finite buffers. The service provider dynamically quotes prices to incoming price sensitive customers to maximize the long-run average revenue. We present a Markov decision process model for the optimization problem. For systems with two stations, general-sized buffers, and two or more prices, we describe the structure of the optimal dynamic pricing policy and develop tailored policy iteration algorithms to find an optimal pricing policy. For systems with two stations but no intermediate buffer, we characterize conditions under which quoting either a high or a low price to all customers is optimal and provide an easy-to-implement algorithm to solve the problem. Numerical experiments are conducted to compare the developed algorithms with the regular policy iteration algorithm. The work also discusses possible extensions of the obtained results to both three-station systems and two-station systems with price and congestion sensitive customers using numerical analysis.     

基于APOS理论的小学数学概念教学研究---以《轴对称图形》教学为例

小学数学概念教学是小学数学教学的关键,基于APOS理论,小学数学概念的教学应包括操作(Actions)、过程(Process)、对象(Object)和图式(Scheme)四个阶段.文章基于名师的课例,解读和分析了上述四个阶段在概念教学中的渗透,并且指出数学概念教学应注重情景引入、过程展示与分析、学生的积极参与和主动建构、从现实应用的视角完善学生的概念图式.     

基于AOS包业务模型的最优帧长与吞吐量性能

分析了影响AOS包业务吞吐量性能的因素及帧长度对系统吞吐量性能的影响,建立了包复用效率及差错信道下吞吐量的数学模型,通过仿真验证数学模型的可靠性。并进一步得出差错信道下使系统吞吐量性能最大的最优帧长度配置。研究结果为以吞吐量性能为指标,通过信道状态自适应调节帧长来优化AOS协议提供了理论依据。     

基于双向映射的非网格型全向图展开插值方法

原始的全向图存在严重的同心圆环状变形,通常需展开为更适合人眼观察的柱面全景图像。结合折反射全向成像特点,提出一种基于双向映射的全向图展开为柱面全景图像的插值方法,通过光路跟踪得到图像间的坐标映射关系,将所要生成的柱面全景图中每一点正向映射到原始的全向图中,确定插值邻域点;将这些邻域点逆向投影到柱面全景图中,针对邻域点在柱面全景图中呈非网格型分布的特点,采用非均匀二维插值算法进行图像插值运算。该方法既准确地定位插值邻域点,又避免了全向图的非线性畸变对邻域点权重计算的不利影响。实验证明该方法能有效提高插值精度和展开后图像的质量。     

基于信号处理的齿轮箱状态监测与故障诊断

针对工程上齿轮箱实时监测和故障诊断的需要,对JZQ 250型齿轮箱展开研究,提出了状态监测特征值和故障特征向量相结合的分级诊断方法。通过时域参数分析提取监测特征值作为一级诊断,利用能量比重谱的方法,提取故障特征向量作为神经网络的输入向量进行故障诊断为二级诊断。实验结果表明,该方法不仅满足工程上实时在线诊断的要求,而且能够准确进行齿轮箱故障定位。