浅析淮海战役中毛泽东的心理战艺术

在举世瞩目的淮海战役中,华东、中原野战军在543万人民群众及地方武装支援下,与南线国民党军主力浴血奋战66天,以伤亡13.6万人的代价,取得歼敌55.5万余人的伟大胜利,基本上解放了长江以北的华东、中原地区,使国民党政府首都南京处于人民解放军的直接威胁之下,蒋介石22年的反动统治陷入土崩瓦解的境地.     

军品科研项目设计质量评审的实效控制

设计质量评审是军品项目开发过程中的一项重要活动,本文以GJB 9001A-2001的要求为出发点,从产品设计质量评审的意义、产品设计阶段的划分及内容、目前设计评审中存在的问题及影响等方面探讨产品设计质量评审的控制要求,着重提出了加强设计质量评审的实效性控制措施;进一步提高军品科研项目设计质量评审效果。     

军队信息化建设的五大阶段

我军的信息化,应包括以下五个必经的阶段：实现信息化办公、完成自动化指挥系统的综合集成、完成兵器装备的数字化改造与研制、普及信息化管理、完成编制体制重组。其中信息化办公是军队信息化的基础工程,编制体制重组是信息化的最终阶段。     

Approximation schemes for single‐machine scheduling with a fixed maintenance activity to minimize the total amount of late work

We consider the problem of scheduling n independent and simultaneously available jobs without preemption on a single machine, where the machine has a fixed maintenance activity. The objective is to find the optimal job sequence to minimize the total amount of late work, where the late work of a job is the amount of processing of the job that is performed after its due date. We first discuss the approximability of the problem. We then develop two pseudo‐polynomial dynamic programming algorithms and a fully polynomial‐time approximation scheme for the problem. Finally, we conduct extensive numerical studies to evaluate the performance of the proposed algorithms. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 172–183, 2016     

Stochastic regret minimization for revenue management problems with nonstationary demands

We study an admission control model in revenue management with nonstationary and correlated demands over a finite discrete time horizon. The arrival probabilities are updated by current available information, that is, past customer arrivals and some other exogenous information. We develop a regret‐based framework, which measures the difference in revenue between a clairvoyant optimal policy that has access to all realizations of randomness a priori and a given feasible policy which does not have access to this future information. This regret minimization framework better spells out the trade‐offs of each accept/reject decision. We proceed using the lens of approximation algorithms to devise a conceptually simple regret‐parity policy. We show the proposed policy achieves 2‐approximation of the optimal policy in terms of total regret for a two‐class problem, and then extend our results to a multiclass problem with a fairness constraint. Our goal in this article is to make progress toward understanding the marriage between stochastic regret minimization and approximation algorithms in the realm of revenue management and dynamic resource allocation. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 433–448, 2016     

稀薄流高超声速飞行器气动加热耦合计算

针对稀薄流域高超声速飞行器的气动加热问题,开展耦合数值计算研究。通过引入牛顿冷却定律,将直接模拟蒙特卡洛数值模拟方法与结构传热计算方法相结合,设计一种可对全机外形进行气动热和结构传热计算的高效松耦合方法,实现飞行器防热层结构材料温度分布特性的数值模拟。在以钝锥外形为例对直接模拟蒙特卡洛数值模拟程序进行验证的基础上,采用该方法对X37B轨道飞行器外形长时加热与结构传热过程进行数值模拟,给出结构温度及热流密度随飞行时间的变化规律。研究结果表明,设计的耦合计算方法能够模拟稀薄流域高超声速飞行器的气动加热及结构传热耦合过程,可为该类飞行器的气动热分析及热防护设计提供技术支持。     

Analysis of a production system in a general configuration

We consider a production system comprising multiple stations (or workshops) such as an entry station, a set of work stations, a central station, and an exit station, which are arranged in a general configuration. A worker (or a vehicle tool) is assigned to each station, who sends a part from the station to the destination station according to the required process path of the part. Any part is allowed to visit a work station more than once if its process path requires. We propose a new control strategy with the push policy for instructing each worker to send a part and the kanban mechanism for controlling the work‐in‐process (WIP) in each work station. As all work stations have limited local buffers, the central station is used for storing blocked parts temporarily. Such a production system is modeled as an open queueing network in a general configuration with a Markovian part sending policy and a machine no blocking mechanism. The queueing network is analytically characterized. Some important performance measures are compared with other control strategies. A semi‐open decomposition approach is applied to the queueing network for computing the blocking probabilities when parts arrive at the work stations. An algorithm is developed based on the semi‐open decomposition approach. Numerical experiments show the quality of the solutions obtained by the algorithm as well as a property of a performance measure. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48: 128–143, 2001     

基于CORBA的分布式网管的实现

以某师的网管系统为例 ,介绍了基于 CORBA ORB通信总线结构网管软件的设计与实现。并对其中的若干技术问题 ,如网管信息模型的建立、网管软件的安全性及本系统的不足进行了深入讨论     

关于算子方程Tx=y扰动分析的一些结果

在Banach空间中给出了一种相容算子方程解的误差估计 ,推广了矩阵扰动分析中的相应结果 .此外 ,利用Hilbert空间中算子M -P广义逆与算子的约化极小模之间的关系 ,给出了一些估计式 ,这些估计式对于分析不相容算子方程Tx =y的极小范数最小二乘解的扰动误差是有用的     

积分方程法计算舰船感应磁场

积分方程法是取得舰船感应磁场的有效方法 ,且简便易行 .以某型舰船为算例 ,介绍了积分方程法在舰船感应磁场计算中的应用 ,给出了剖分方法 .算例结果与工程实际测量结果相吻合 ,可应用于工程实际 .