把军队政治工作信息化理论研究不断引向深入

2010年10月召开的全军政治工作信息化建设理论研讨会,深入研究了军队政治工作信息化建设的特点规律,深化了对军队政治工作信息化建设科学发展的认识;剖析了军队政治工作信息化建设遇到的突出矛盾和问题,探讨了军队政治工作信息化建设发展的突破口;广泛探讨了"网络政工"普及应用的问题,提出了破解"网络政工"发展难题的新思路;全方位探讨了军队政治工作信息化的运用,特别是在完成多样化任务中如何运用信息化手段提升军队政治工作效能的问题.     

启蒙·救亡·重建——抗日战争时期党的文化选择的三重功效

抗日战争时期中国共产党的文化选择具有三重功效：对广大民众、尤其是农民的现代启蒙；在民族危难关头的一场民族救亡总动员；指明了中国未来文化的重建方向。     

中国特色国防研究30年·国防教育篇

国防教育作为社会主义中国的基本教育，是全民教育和社会主义精神文明建设大系统中不可缺少的组成部分，是国家安全、民族利益和科学文化教育的一个极为重要的方面，是我国国防建设中的一项最基本的思想建设，是巩固和加强国防，促进政治、经济、文化和社会建设的重要手段。改革开放以来，学术界对新时期如何开展国防教育进行了孜孜不倦的探索，颇有理论建树，极大地推动了国防教育的实践。     

刘少奇在中央苏区

1933年春,在上海从事工人运动的刘少奇根据中共中央的指示,进入中央苏区,先后担任中共中央政治局候补委员、中华全国总工会苏区中央执行局委员长、中共福建省委书记等职.他在中央苏区工作期间,为巩固和加强中央苏区的政权建设、发展工人运动和红军力量、领导中央苏区的反"围剿"斗争、领导苏区人民支援前线斗争等工作做出了重大贡献.在纪念刘少奇同志诞辰110周年之际,本文以翔实的史料,实录了刘少奇在中央苏区工作中的重要建树.     

美军车辆防护发展演变及启示

本文通过对HMMWV车型的装甲防护发展演变和美军装甲防护战略的分析,得出其对我军车辆防护发展的启示作用。     

从明清侠义小说中侠义英雄的创作看人性善恶二重性——以《绿牡丹全传》为例

人性善恶问题，一个千古争论的哲学命题。本文将以文学作为视角，分别从作品中英雄人物形象、作者文学创作动机两个方面，对这一问题作出较新的阐释。从而得出结论：在人的本质属性中，善与恶是对立统一的。但人类总可以避恶扬善，以谋求自身的存在和发展。     

RFID技术在枪支管理上的应用研究

本文首先介绍了RFID技术的概述及特点，分析了RFID技术在枪支管理系统上应用的可行性和必要性，针对目前我国枪支管理的实际情况，考虑到枪支管理的安全性、实用性、有效性，提出了基于RFID枪支管理系统的设计原则，借鉴RFID在其他领域的成功经验，在此基础上给出了枪支管理系统的系统结构，并对该系统的功能及工作流程进行了阐述。     

张之洞的军事改革思想与实践

张之洞的军事改革思想与实践,是晚清军制改革的重要组成部分.这场改革始于鸦片战争以后,中间经过洋务运动、19世纪70年代边疆危机、中法战争、中日甲午战争和戊戌维新,直到20世纪初清廷推行"新政"才趋于解决.     

Coordinated dynamic control of marketing and production

We study the dynamic profit maximization problem for a firm exercising control on both marketing and production. The firs marketing effort impacts the current‐period demand, which in turn affects future demand in a dissipating fashion. Under linear‐cost and zero‐leadtime assumptions, we show that the firm should follow base‐point rules for both marketing and production, whereas trends of the base points reflect a certain complementarity between marketing and production. We obtain comparable results when marketing costs are convex. Our computational study identifies conditions under which simple fixed‐marketing‐effort and fixed‐marketing‐target heuristics would perform well. © 2009 Wiley Periodicals, Inc. Naval Research Logistics 2009     

Approximation algorithms for general one‐warehouse multi‐retailer systems

Logistical planning problems are complicated in practice because planners have to deal with the challenges of demand planning and supply replenishment, while taking into account the issues of (i) inventory perishability and storage charges, (ii) management of backlog and/or lost sales, and (iii) cost saving opportunities due to economies of scale in order replenishment and transportation. It is therefore not surprising that many logistical planning problems are computationally difficult, and finding a good solution to these problems necessitates the development of many ad hoc algorithmic procedures to address various features of the planning problems. In this article, we identify simple conditions and structural properties associated with these logistical planning problems in which the warehouse is managed as a cross‐docking facility. Despite the nonlinear cost structures in the problems, we show that a solution that is within ε‐optimality can be obtained by solving a related piece‐wise linear concave cost multi‐commodity network flow problem. An immediate consequence of this result is that certain classes of logistical planning problems can be approximated by a factor of (1 + ε) in polynomial time. This significantly improves upon the results found in literature for these classes of problems. We also show that the piece‐wise linear concave cost network flow problem can be approximated to within a logarithmic factor via a large scale linear programming relaxation. We use polymatroidal constraints to capture the piece‐wise concavity feature of the cost functions. This gives rise to a unified and generic LP‐based approach for a large class of complicated logistical planning problems. © 2009 Wiley Periodicals, Inc. Naval Research Logistics, 2009