平板显示控制器在便携式火炮测径窥膛仪中的应用

应用AVERLOGIC公司最新研制的平板显示控制器AL300,实现了便携式火炮测径窥膛仪的火炮直径数据采集、炮膛视频图像转换与显示系统设计。该系统以微处理器AT89C52为控制核心,利用AL300控制液晶显示屏,同时显示炮膛视频图像和直径测量数据。     

国外反卫星武器发展述评

从反卫星需求出发,对反卫星武器的定义、分类、优缺点、组成及其作战过程以及美、俄反卫星武器的发展现状进行了阐述,对重点研究的2种反卫星武器作了介绍。对反卫星武器发展特点及趋势作了分析。     

Adaptive random search for continuous simulation optimization

We present, analyze, and compare three random search methods for solving stochastic optimization problems with uncountable feasible regions. Our adaptive search with resampling (ASR) approach is a framework for designing provably convergent algorithms that are adaptive and may consequently involve local search. The deterministic and stochastic shrinking ball (DSB and SSB) approaches are also convergent, but they are based on pure random search with the only difference being the estimator of the optimal solution [the DSB method was originally proposed and analyzed by Baumert and Smith]. The three methods use different techniques to reduce the effects of noise in the estimated objective function values. Our ASR method achieves this goal through resampling of already sampled points, whereas the DSB and SSB approaches address it by averaging observations in balls that shrink with time. We present conditions under which the three methods are convergent, both in probability and almost surely, and provide a limited computational study aimed at comparing the methods. Although further investigation is needed, our numerical results suggest that the ASR approach is promising, especially for difficult problems where the probability of identifying good solutions using pure random search is small. © 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010     

A stochastic gradual cover location problem

Covering models assume that a point is covered if it is within a certain distance from a facility and not covered beyond that distance. In gradual cover models it is assumed that a point is fully covered within a given distance from a facility, then cover gradually declines, and the point is not covered beyond a larger distance. Gradual cover models address the discontinuity in cover which may not be the correct approach in many situations. In the stochastic gradual cover model presented in this article it is assumed that the short and long distances employed in gradual cover models are random variables. This refinement of gradual cover models provides yet a more realistic depiction of actual behavior in many situations. The maximal cover model based on the new concept is analyzed and the single facility location cover problem in the plane is solved. Computational results illustrating the effectiveness of the solution procedures are presented. © 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010     

浅析达尔富尔和平进程及其面临的挑战

达尔富尔危机始于2003年2月。这场危机主要是由北方的游牧民与南方的定居农民之间对生存资源的争夺而引发的国内冲突。在国际社会的斡旋下,苏丹政府已与几个反政府武装签署了和平协议,并同意部署联合国-非盟混合维和行动,达尔富尔地区的和平进程已步入正轨。由于苏丹国内的复杂形势和困难,达尔富尔地区的和平进程仍面临诸多挑战,和平与和解之路仍然漫长。     

基于更新过程的多阶段备件需求模型

正态分布、威布尔分布是常用的备件寿命模型,但是正态分布和威布尔分布的记忆性会导致多阶段需求量预测的相关性.利用更新过程理论,将叠加的更新过程分解和拼接,建立单阶段多项备件需求模型;通过将年龄转移到下个阶段,建立了多阶段不可修备件需求模型;采用加权平均法对多阶段需求模型进行了修正.仿真表明,这种模型能有效预测多阶段需求的波动.     

备件需求过程的MAP数据拟合算法研究

为了将备件需求过程表示为马尔可夫到达过程(Markovian arrival process, MAP)形式,设计了备件需求到达流的MAP拟合算法.首先,采用EM算法将备件需求到达间隔时间拟合成Hyper-Erlang分布形式,然后利用MAP性质和Bayes公式推导出生成元矩阵的计算公式;随后设计了一个完整的数据拟合流程,并通过实例对算法的效果和效率与已有研究进行了对比.结果表明,该算法在确保拟合效果的同时,能够有效提升拟合效率.     

考虑不完全维修的可修串联系统可用度模型

可用度是衡量系统可靠性、维修性水平的一个重要指标.提出一类基于gamma劣化过程的可修串联系统的可用度计算方法.该方法从构成系统部件的状态出发,用gamma过程刻画部件的退化失效规律,同时考虑系统维修效果的不完全性,在此基础上推导出系统可用度的表达式.最后用一个算例验证了研究模型的合理性.     

Quality control chart design under Jidoka

We consider design of control charts in the presence of machine stoppages that are exogenously imposed (as under jidoka practices). Each stoppage creates an opportunity for inspection/repair at reduced cost. We first model a single machine facing opportunities arriving according to a Poisson process, develop the expressions for its operating characteristics and construct the optimization problem for economic design of a control chart. We, then, consider the multiple machine setting where individual machine stoppages may create inspection/repair opportunities for other machines. We develop exact expressions for the cases when all machines are either opportunity‐takers or not. On the basis of an approximation for the all‐taker case, we then propose an approximate model for the mixed case. In a numerical study, we examine the opportunity taking behavior of machines in both single and multiple machine settings and the impact of such practices on the design of an X – Q C chart. Our findings indicate that incorporating inspection/repair opportunities into QC chart design may provide considerable cost savings. © 2009 Wiley Periodicals, Inc. Naval Research Logistics 2009     

Technical note: A computationally efficient algorithm for undiscounted Markov decision processes with restricted observations

We present a computationally efficient procedure to determine control policies for an infinite horizon Markov Decision process with restricted observations. The optimal policy for the system with restricted observations is a function of the observation process and not the unobservable states of the system. Thus, the policy is stationary with respect to the partitioned state space. The algorithm we propose addresses the undiscounted average cost case. The algorithm combines a local search with a modified version of Howard's (Dynamic programming and Markov processes, MIT Press, Cambridge, MA, 1960) policy iteration method. We demonstrate empirically that the algorithm finds the optimal deterministic policy for over 96% of the problem instances generated. For large scale problem instances, we demonstrate that the average cost associated with the local optimal policy is lower than the average cost associated with an integer rounded policy produced by the algorithm of Serin and Kulkarni Math Methods Oper Res 61 (2005) 311–328. © 2008 Wiley Periodicals, Inc. Naval Research Logistics 2009