风险管理方法在美军基层军事训练管理中的应用

风险管理通过识别、评价和控制与军事任务相关的风险因素,以减少损失,更好地完成军事目标。只有在军事训练中实行以任务为导向的风险管理,才能有效地实现战时目标。随着现代战争样式的更新和武器装备的现代化程度不断提高,美军对于基层军事训练中的风险管理日益重视,强调将风险分析纳入整个军事行动管理全过程,并形成了一套较为规范的做法和程序,文章旨在对此作出简要阐述和分析。     

美国征兵广告特点与启示

征兵是一个永恒不变的军事主题,征兵广告则是推动征兵工作进展的一个有力因素,世界各军事强国都在征兵广告上动了不少脑筋。美国征兵广告对于保障社会向部队提供充足的兵员,发挥了重要作用。探讨美国征兵广告的特点,可以对完善我国征兵制度提供有益的借鉴。     

论双拥工作的基本历史经验

双拥工作积累了丰富的历史经验:坚持党的领导,引领双拥工作的正确方向;紧贴中心任务,规范双拥工作的基本内容;发挥军地优势,增强双拥工作的生机活力;健全组织网络,保证双拥工作的有序运行;加强团结和谐,实现双拥工作的价值追求。     

Diffusion approximation to the G/G/R machine repair problem with warm standby spares

The G/G/R machine repair problem with M operating machines, S warm standby spares, and R repairmen is studied as a diffusion process. The steady-state equations are formulated as diffusion equations subject to two reflecting barriers. The approximate diffusion parameters of the diffusion equations are obtained (1) under the assumption that the input characteristics of the problem are defined only by their first two moments rather than their probability distribution function, (2) under the assumption of heavy traffic approximation, that is, when queues of failed machines in the repair stage are almost always nonempty, and (3) using well-known asymptotic results from renewal theory. Expressions for the probability density functions of the number of failed machines in the system are obtained. A study of the derived approximate results, compared to some of the exact results, suggests that the diffusion approach provides a useful method for solving complex machine-repair problems.     

样条函数在图像处理和传输中的应用

样条函数由于其计算简单,便于数字计算机进行数值计算而在各个工程领域内广泛地得到应用。在连续图像的离散化数字处理中,由于图像数据量非常巨大,使用样条函数进行内插和平滑可以得到计算简化的好处。本文初步讨论这方面应用的可能性。本文所述及的范围还比较小,只是试论用样条函数来估计图像离散化和再现过程中的误差;用样条函数进行数据压缩的一种简便方法;和用样条函数对图像随机噪声进行平滑处理等几个方面。     

An improved algorithm for the dynamic lot-sizing problem with learning effect in setups

The dynamic lot-sizing problem with learning in setups is a variation of the Wagner-Whitin lot-sizing problem where the setup costs are a concave, nondecreasing function of the cumulative number of setups. This problem has been a subject of some recent research. We extend the previously studied model to include nonstationary production costs and present an O(T²) algorithm to solve this problem. The worst-case complexity of our algorithm improves the worst-case behavior of the algorithms presently known in the literature. © 1993 John Wiley & Sons, Inc.     

空间电磁环境计算机仿真

本文在建立了地面雷达数据库的基础上,对空间平台所处的雷达信号环境进行了仿真研究。文中给出了部分仿真数学模型和仿真软件模块结构,并利用仿真软件对空间平台位置处的雷达信号功率流密度和各种分布特性等进行了仿真试验研究,给出了有意义的仿真试验结果     

Dynamic pricing in a trade-in program with replacement and new customers

Trade-in programs have been widely adopted to enhance repeat purchase from replacement customers. Considering that a market consists of replacement and new segments, we study the joint and dynamic decisions on the selling price of new product (hereafter, “selling price”) and the trade-in price involved in the program. By adopting a vertical product differentiation choice model, we investigate two scenarios in this paper. In the base model, the manufacturer has sufficiently large production capacity to fulfill the customer demand. We characterize the structural properties of the joint pricing decisions and compare them with the optimal pricing policy under regular selling. We further propose a semi-dynamic trade-in program, under which the new product is sold at a fixed price and the trade-in price can be adjusted dynamically. Numerical experiments are conducted to evaluate the performance of the dynamic and semi-dynamic trade-in programs. In an extended model, we consider the scenario in which the manufacturer stocks a batch of new products in the beginning of the selling horizon and the inventory cannot be replenished. Following a revenue management framework, we characterize the structural properties with respect to time period and inventory level of new products.     

Inventory transshipment game with limited supply: Trap or treat

Inventory transshipment is generally shown to be beneficial to retailers by matching their excess demand with surplus inventory. We investigate an inventory transshipment game with two newsvendor-type retailers under limited total supply and check whether the retailers are better off than the case without transshipment. We derive the ordering strategies for the retailers and show that unlike the unlimited supply case, a pure Nash equilibrium only exists under certain conditions. Furthermore, contrary to the conventional wisdom, we show that inventory transshipment may not always benefit both retailers. Although one of the retailers is guaranteed to be better off, the other could be worse off. The decision criteria are then provided for the retailers to determine if they will benefit from the exercise of inventory transshipment. Numerical study indicates that the carefully chosen transshipment prices play an important role in keeping inventory transshipment beneficial to both retailers. Subsequently, a coordinating mechanism is designed for the retailers to negotiate transshipment prices that maximize the total profit of the two retailers while keeping each of them in a beneficial position.     

A bicriterion approach to common flow allowances due window assignment and scheduling with controllable processing times

We investigate a single‐machine scheduling problem for which both the job processing times and due windows are decision variables to be determined by the decision maker. The job processing times are controllable as a linear or convex function of the amount of a common continuously divisible resource allocated to the jobs, where the resource allocated to the jobs can be used in discrete or continuous quantities. We use the common flow allowances due window assignment method to assign due windows to the jobs. We consider two performance criteria: (i) the total weighted number of early and tardy jobs plus the weighted due window assignment cost, and (ii) the resource consumption cost. For each resource consumption function, the objective is to minimize the first criterion, while keeping the value of the second criterion no greater than a given limit. We analyze the computational complexity, devise pseudo‐polynomial dynamic programming solution algorithms, and provide fully polynomial‐time approximation schemes and an enhanced volume algorithm to find high‐quality solutions quickly for the considered problems. We conduct extensive numerical studies to assess the performance of the algorithms. The computational results show that the proposed algorithms are very efficient in finding optimal or near‐optimal solutions. © 2017 Wiley Periodicals, Inc. Naval Research Logistics, 64: 41–63, 2017