新中国60年人民军队思想政治教育制度化的历史与启示

加强制度化建设是人民军队思想政治教育创新发展的本质要求和必然趋势。中华人民共和国成立60年来,人民军队思想政治教育制度化的发展经历了社会主义革命与建设时期、改革开放和社会主义现代化建设时期两个阶段。其发展历程表明,思想政治教育制度化建设日益增强、愈加重要是一种趋势;思想政治教育制度化建设是保证思想政治教育科学化的重要途径;思想政治教育制度化建设必须顺应时代要求,体现时代特色。     

雷达引信地杂波建模与仿真

介绍了一种用零记忆非线性变换(ZMNL)模拟具高斯谱特性的相参相关Weibull分布地杂波的方法,详细阐述了Weibull分布杂波随机序列产生的流程.仿真结果表明,该法形成的地杂波信号与理论值吻合较好,适合雷达引信的实际应用.     

国防动员应急应战一体化协调联动机制探要

国防动员应急应战一体化协调联动机制,是国防动员协调处理平时、战时的各种紧急事件的规律性运作方式。新时期,国防动员应急应战一体化联动机制并未真正建立起来。必须深刻理解国防动员应急应战一体化协调联动机制的深刻内涵与构建的重要意义,并找出相应的对策和方法。     

武器装备研制三个被忽视问题的解析

我国高新武器装备陆续列装到基层部队,随着训练的展开,暴露出科研设计阶段没有考虑到的一些小的设计问题,本文列举了三种设计遗留问题,分别予以解释、分析,希望在以后的武器装备设计过程中得到体现。     

Properties of a mean residual life function arising from renewal theory

The present article discusses the properties of the mean residual life function in a renewal process. We examine the relationship this function has with the failure rate function and the conventional mean, variance and coefficient of variation of residual life. We also discuss some monotonicity properties of the mean residual life function. A partial order based on the renewal mean residual function is introduced along with its interrelationship with some existing stochastic orders. © 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010     

The effects of model parameter deviations on the variance of a linearly filtered time series

We consider a general linear filtering operation on an autoregressive moving average (ARMA) time series. The variance of the filter output, which is an important quantity in many applications, is not known with certainty because it depends on the true ARMA parameters. We derive an expression for the sensitivity (i.e., the partial derivative) of the output variance with respect to deviations in the model parameters. The results provide insight into the robustness of many common statistical methods that are based on linear filtering and also yield approximate confidence intervals for the output variance. We discuss applications to time series forecasting, statistical process control, and automatic feedback control of industrial processes. © 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010     

Threshold incentives over multiple periods and the sales hockey stick phenomenon

In this article, we study threshold‐based sales‐force incentives and their impact on a dealer's optimal effort. A phenomenon, observed in practice, is that the dealer exerts a large effort toward the end of the incentive period to boost sales and reach the threshold to make additional profits. In the literature, the resulting last‐period sales spike is sometimes called the hockey stick phenomenon (HSP). In this article, we show that the manufacturer's choice of the incentive parameters and the underlying demand uncertainty affect the dealer's optimal effort choice. This results in the sales HSP over multiple time periods even when there is a cost associated with waiting. We then show that, by linking the threshold to a correlated market signal, the HSP can be regulated. We also characterize the variance of the total sales across all the periods and demonstrate conditions under the sales variance can be reduced. © 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010     

An integer decomposition algorithm for solving a two‐stage facility location problem with second‐stage activation costs

We study a stochastic scenario‐based facility location problem arising in situations when facilities must first be located, then activated in a particular scenario before they can be used to satisfy scenario demands. Unlike typical facility location problems, fixed charges arise in the initial location of the facilities, and then in the activation of located facilities. The first‐stage variables in our problem are the traditional binary facility‐location variables, whereas the second‐stage variables involve a mix of binary facility‐activation variables and continuous flow variables. Benders decomposition is not applicable for these problems due to the presence of the second‐stage integer activation variables. Instead, we derive cutting planes tailored to the problem under investigation from recourse solution data. These cutting planes are derived by solving a series of specialized shortest path problems based on a modified residual graph from the recourse solution, and are tighter than the general cuts established by Laporte and Louveaux for two‐stage binary programming problems. We demonstrate the computational efficacy of our approach on a variety of randomly generated test problems. © 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010