军队思想政治建设实现“三个确保”的路径探索

军队思想政治建设实现"三个确保",必须以强化中国特色社会主义理论体系武装为首要任务;以培育当代革命军人核心价值观为重要抓手;以全面提高完成多样化军事任务能力为实践平台;以加强各级党组织建设为关键环节;以改进创新思想政治工作为强大动力.     

推进军队党内民主建设的创新工程——学习《中国共产党军队各级代表大会代表任期制实施办法(试行)》

中央军委颁发实施的<党代表任期制实施办法(试行)>,具有很强的思想性、规范性和可操作性,是推进军队党内民主建设的重大举措.要充分认清重大意义,提高贯彻落实<党代表任期制实施办法>的自觉性;准确把握内容实质,增强贯彻落实的针对性;建立健全保障措施,确保贯彻落实的实效性.     

武器装备采办竞争与单一来源选择研究

在武器装备采办中对竞争与单一来源的选择应分析竞争的可行性与合意性。引入竞争必须要满足一些基本的必要条件,只有这样才会使竞争具有可行性。引入竞争还要分析竞争的合意性,即竞争是否值得,而这种合意与否的判断是建立在竞争的成本一收益分析基础之上的。只有同时满足“竞争可行”与“竞争合意”两个条件,武器装备采办才适宜引入竞争,否则应保持单一来源。     

军工企业安全标准体系建立初探

建立企业安全生产标准体系,是推动企业建立具有军工特色规范化和标准化的现代企业安全生产管理体系的有效途径。本文分析了军工企业安全生产标准体系建立必要性、原则和要求,阐述了体系结构层次及其建立方法,提出了正确处理与企业安全管理体系衔接和建立动态管理机制等要求。     

日本新型06式枪榴弹解析

日本06式枪榴弹采用新型材料,大幅降低了弹的质量和体积,提高了杀伤效能;采取分离一飞行方式,大大减小了后坐能量,增大了射程;运用弹头捕阱系统,减少了烟尘、碎屑等污染物,保证枪榴弹实弹发射时的安全。其设计思想和战术性能在步兵轻武器领域达到世界领先水平。     

A partial characterization of the optimal ordering/rationing policy for a periodic review system with two demand classes and backordering

We consider a finite horizon periodic review, single product inventory system with a fixed setup cost and two stochastic demand classes that differ in their backordering costs. In each period, one must decide whether and how much to order, and how much demand of the lower class should be satisfied. We show that the optimal ordering policy can be characterized as a state dependent (s,S) policy, and the rationing structure is partially obtained based on the subconvexity of the cost function. We then propose a simple heuristic rationing policy, which is easy to implement and close to optimal for intensive numerical examples. We further study the case when the first demand class is deterministic and must be satisfied immediately. We show the optimality of the state dependent (s,S) ordering policy, and obtain additional rationing structural properties. Based on these properties, the optimal ordering and rationing policy for any state can be generated by finding the optimal policy of only a finite set of states, and for each state in this set, the optimal policy is obtained simply by choosing a policy from at most two alternatives. An efficient algorithm is then proposed. © 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010     

有源诱饵弹对抗毫米波制导武器仿真分析

有源诱饵弹是对抗毫米波制导武器的一种重要手段。根据毫米波雷达制导导弹波束窄的特点,采用投放多枚诱饵弹以组成诱饵阵的对抗方法。初步建立了对抗过程仿真的数学模型,并通过该模型对对抗过程进行了仿真分析。分析表明,如果依据形势合理布放诱饵,将会对目标起到很好的保护作用。     

刍议GJB 1371与GJB 3837的关系

在新装备的研制过程中,需要有效地开展保障性分析工作,同时会产生大量的信息,GJB 3837便是为有效地存储这些信息而制定的标准。为明确GJB 3837与保障性分析工作之间的对应关系,本文对GJB 1371与GJB 3837进行了简要介绍,并对二者之间的对应关系展开研究,以期为GJB 1371和GJB 3837的工程化应用奠定基础。     

Supply chain coordination with product line design and a revenue sharing scheme

Many manufacturers sell their products through retailers and share the revenue with those retailers. Given this phenomenon, we build a stylized model to investigate the role of revenue sharing schemes in supply chain coordination and product variety decisions. In our model, a monopolistic manufacturer serves two segments of consumers, which are distinguished by their willingness to pay for quality. In the scenario with exogenous revenue sharing ratios, when the potential gain from serving the low segment is substantial (e.g., the low‐segment consumers' willingness to pay is high enough or the low segment takes a large enough proportion of the market), the retailer is better off abandoning the revenue sharing scheme. Moreover, when the potential gain from serving the low (high) segment is substantial enough, the manufacturer finds it profitable to offer a single product. Furthermore, when revenue sharing ratios are endogenous, we divide our analysis into two cases, depending on the methods of cooperation. When revenue sharing ratios are negotiated at the very beginning, the decentralized supply chain causes further distortion. This suggests that the central premise of revenue sharing—the coordination of supply chains—may be undermined if supply chain parties meticulously bargain over it.     

Single‐machine scheduling with deadlines to minimize the total weighted late work

We consider scheduling a set of jobs with deadlines to minimize the total weighted late work on a single machine, where the late work of a job is the amount of processing of the job that is scheduled after its due date and before its deadline. This is the first study on scheduling with the late work criterion under the deadline restriction. In this paper, we show that (i) the problem is unary NP‐hard even if all the jobs have a unit weight, (ii) the problem is binary NP‐hard and admits a pseudo‐polynomial‐time algorithm and a fully polynomial‐time approximation scheme if all the jobs have a common due date, and (iii) some special cases of the problem are polynomially solvable.