一种有价值的预防维修策略

当前,在系统的维修性方面,有许多概念是模糊的;许多行为是盲目的,至少是经验主义的。本文针对这些情况,提出了完整的科学维修的概念。以一个有使用价值的预防性维修策略为例,通过讨论,使这种科学维修的概念具体化,并且给出了系统的首翻期、维修周期以及更换期的严格定义和确定方法。     

北斗系统星载原子钟周期性波动的频谱分析校正方法

在建立卫星导航系统星座自主守时时间基准时,必须消除星载原子钟钟差数据中包含的周期性波动,以免将其引入系统时间。针对这一问题,基于国际卫星导航服务组织(International GNSS Service, IGS)提供的北斗系统星载原子钟钟差产品,提出了一种基于频谱分析的星载原子钟周期性波动校正方法。通过比较校正前后钟差数据的频率稳定度性能差异,确认该方法能够消除由环境因素引起的钟差数据周期性波动。北斗系统各类卫星星载原子钟的性能在校正后都得到了提升。地球同步轨道卫星星载原子钟的万秒频率稳定度提升50%左右,中轨道地球卫星星载原子钟的万秒频率稳定度提升23%左右,倾斜地球同步轨道卫星星载原子钟的万秒频率稳定度提升15%左右。经过校正,北斗二号和北斗三号系统中的星载原子钟普遍达到了地面站铯钟的频率稳定度性能,为完全基于星载原子钟的星座自主守时提供了基础。     

地方高校图书馆主动服务对军校图书馆的启示——对全国15所重点高校图书馆网站的调查与分析

从图书馆主动服务的理念入手,探讨利用网络开展主动服务的可能性,并结合对全国15所重点高校图书馆网站和实践开展的多种主动服务方式进行调查统计,分析总结其特点,由此得出对军校图书馆开展主动服务的启示。     

Zadoff-Chu序列的内插算法

脉冲压缩体制斜向短波信道探测主要利用Zadoff-Chu序列良好的周期自相关特性进行相关检测。为使Zadoff-Chu序列的频谱特性与信道探测收发信机的要求相匹配,提出一种适合Zadoff-Chu序列的FDI内插算法,以改善其频谱特性,并与一般内插算法内插后的序列频谱进行比较。仿真结果表明:采用FDI内插算法插值后序列的频谱滚降更快,且几乎没有旁瓣,能量十分集中,确认了FDI内插算法的优越性;在接收端,通过理论推导给出了一种实现采用FDI算法内插后的序列最佳抽取的方法。计算和仿真结果验证了该方法的有效性。     

Optimal inventory control policy for periodic‐review inventory systems with inventory‐level‐dependent demand

We consider a setting in which inventory plays both promotional and service roles; that is, higher inventories not only improve service levels but also stimulate demand by serving as a promotional tool (e.g., as the result of advertising effect by the enhanced product visibility). Specifically, we study the periodic‐review inventory systems in which the demand in each period is uncertain but increases with the inventory level. We investigate the multiperiod model with normal and expediting orders in each period, that is, any shortage will be met through emergency replenishment. Such a model takes the lost sales model as a special case. For the cases without and with fixed order costs, the optimal inventory replenishment policy is shown to be of the base‐stock type and of the (s,S) type, respectively. © 2012 Wiley Periodicals, Inc. Naval Research Logistics, 2012     

Formulations for dynamic lot sizing with service levels

In this article, we study deterministic dynamic lot‐sizing problems with a service‐level constraint on the total number of periods in which backlogs can occur over a finite planning horizon. We give a natural mixed integer programming formulation for the single item problem (LS‐SL‐I) and study the structure of its solution. We show that an optimal solution to this problem can be found in \begin{align*}\mathcal O(n^2\kappa)\end{align*} time, where n is the planning horizon and \begin{align*}\kappa=\mathcal O(n)\end{align*} is the maximum number of periods in which demand can be backlogged. Using the proposed shortest path algorithms, we develop alternative tight extended formulations for LS‐SL‐I and one of its relaxations, which we refer to as uncapacitated lot sizing with setups for stocks and backlogs. {We show that this relaxation also appears as a substructure in a lot‐sizing problem which limits the total amount of a period's demand met from a later period, across all periods.} We report computational results that compare the natural and extended formulations on multi‐item service‐level constrained instances. © 2013 Wiley Periodicals, Inc. Naval Research Logistics, 2013     

基于锁相环的GNSS授时接收机钟差校准算法

GNSS(全球卫星导航系统)授时接收机利用卫星导航信号获取钟差并校准本地时钟,从而与GNSS系统时间同步。提出了全新的基于锁相环的GNSS授时接收机钟差校准算法,将钟差校准过程等效为传统的锁相环模型,鉴相器的功能由PVT(位置、速度与时间)解算实现,压控振荡器的功能由本地时间调整接口实现,环路将本地秒相位与GNSS系统的秒相位锁定。分析了环路总误差的组成,以及环路参数与各误差项的关系,给出了误差最小的环路优化设计准则。在北斗二号卫星导航接收机平台上进行了对比实验,验证了算法的有效性。     

Using a birth‐and‐death process to estimate the steady‐state distribution of a periodic queue

If the number of customers in a queueing system as a function of time has a proper limiting steady‐state distribution, then that steady‐state distribution can be estimated from system data by fitting a general stationary birth‐and‐death (BD) process model to the data and solving for its steady‐state distribution using the familiar local‐balance steady‐state equation for BD processes, even if the actual process is not a BD process. We show that this indirect way to estimate the steady‐state distribution can be effective for periodic queues, because the fitted birth and death rates often have special structure allowing them to be estimated efficiently by fitting parametric functions with only a few parameters, for example, 2. We focus on the multiserver M_t/GI/s queue with a nonhomogeneous Poisson arrival process having a periodic time‐varying rate function. We establish properties of its steady‐state distribution and fitted BD rates. We also show that the fitted BD rates can be a useful diagnostic tool to see if an M_t/GI/s model is appropriate for a complex queueing system. © 2015 Wiley Periodicals, Inc. Naval Research Logistics 62: 664–685, 2015     

Optimal FCFS allocation rules for periodic‐review assemble‐to‐order systems

In Assemble‐To‐Order (ATO) systems, situations may arise in which customer demand must be backlogged due to a shortage of some components, leaving available stock of other components unused. Such unused component stock is called remnant stock. Remnant stock is a consequence of both component ordering decisions and decisions regarding allocation of components to end‐product demand. In this article, we examine periodic‐review ATO systems under linear holding and backlogging costs with a component installation stock policy and a First‐Come‐First‐Served (FCFS) allocation policy. We show that the FCFS allocation policy decouples the problem of optimal component allocation over time into deterministic period‐by‐period optimal component allocation problems. We denote the optimal allocation of components to end‐product demand as multimatching. We solve the multi‐matching problem by an iterative algorithm. In addition, an approximation scheme for the joint replenishment and allocation optimization problem with both upper and lower bounds is proposed. Numerical experiments for base‐stock component replenishment policies show that under optimal base‐stock policies and optimal allocation, remnant stock holding costs must be taken into account. Finally, joint optimization incorporating optimal FCFS component allocation is valuable because it provides a benchmark against which heuristic methods can be compared. © 2015 Wiley Periodicals, Inc. Naval Research Logistics 62: 158–169, 2015     

基于可组合服务的陆军作战仿真模型集成＊

陆军仿真模型体系的复杂性决定了其建模与集成的复杂度,基于模型组件化技术,设计了模型组件库、对象库,通过逻辑组合实现了基本库和作战单元库,并以可组合的模型服务实现不同分辨率、异构模型的聚合集成目标,使得陆军作战仿真模型具备模块化、可复用、可扩展和可控制等应用特点和技战术性能。