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

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

日本新型06式枪榴弹解析

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

Optimal outbound dispatch policies: Modeling inventory and cargo capacity

In this paper, we present an optimization model for coordinating inventory and transportation decisions at an outbound distribution warehouse that serves a group of customers located in a given market area. For the practical problems which motivated this paper, the warehouse is operated by a third party logistics provider. However, the models developed here may be applicable in a more general context where outbound distribution is managed by another supply chain member, e.g., a manufacturer. We consider the case where the aggregate demand of the market area is constant and known per period (e.g., per day). Under an immediate delivery policy, an outbound shipment is released each time a demand is realized (e.g., on a daily basis). On the other hand, if these shipments are consolidated over time, then larger (hence more economical) outbound freight quantities can be dispatched. In this case, the physical inventory requirements at the third party warehouse (TPW) are determined by the consolidated freight quantities. Thus, stock replenishment and outbound shipment release policies should be coordinated. By optimizing inventory and freight consolidation decisions simultaneously, we compute the parameters of an integrated inventory/outbound transportation policy. These parameters determine: (i) how often to dispatch a truck so that transportation scale economies are realized and timely delivery requirements are met, and (ii) how often, and in what quantities, the stock should be replenished at the TPW. We prove that the optimal shipment release timing policy is nonstationary, and we present algorithms for computing the policy parameters for both the uncapacitated and finite cargo capacity problems. The model presented in this study is considerably different from the existing inventory/transportation models in the literature. The classical inventory literature assumes that demands should be satisfied as they arrive so that outbound shipment costs are sunk costs, or else these costs are covered by the customer. Hence, the classical literature does not model outbound transportation costs. However, if a freight consolidation policy is in place then the outbound transportation costs can no longer be ignored in optimization. Relying on this observation, this paper models outbound transportation costs, freight consolidation decisions, and cargo capacity constraints explicitly. © 2002 Wiley Periodicals, Inc. Naval Research Logistics 49: 531–556, 2002; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/nav.10030     

论改革开放以来党的反腐倡廉理论的创新发展与启示

改革开放30年,党的反腐倡廉理论实现了三次重大发展。以党的发展着的反腐倡廉理论为指导,推动军队反腐倡廉建设持续深入发展,必须坚持思想指导上的与时俱进、坚持党对军队的绝对领导、坚持预防为主教育领先、坚持服务中心积极作为、坚持把预防权力腐败作为重点、坚持深化体制机制改革、坚持党要管党从严治党方针。     

New inequalities for finite and infinite group problems from approximate lifting

In this paper, we derive new families of facet‐defining inequalities for the finite group problem and extreme inequalities for the infinite group problem using approximate lifting. The new valid inequalities for the finite group problem include two‐ and three‐slope facet‐defining inequalities as well as the first family of four‐slope facet‐defining inequalities. The new valid inequalities for the infinite group problem include families of two‐ and three‐slope extreme inequalities. These new inequalities not only illustrate the diversity of strong inequalities for the finite and infinite group problems, but also provide a large variety of new cutting planes for solving integer and mixed‐integer programming problems. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008     

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     

Approximation results for min‐max path cover problems in vehicle routing

This article studies a min‐max path cover problem, which is to determine a set of paths for k capacitated vehicles to service all the customers in a given weighted graph so that the largest path cost is minimized. The problem has wide applications in vehicle routing, especially when the minimization of the latest service completion time is a critical performance measure. We have analyzed four typical variants of this problem, where the vehicles have either unlimited or limited capacities, and they start from either a given depot or any depot of a given depot set. We have developed approximation algorithms for these four variants, which achieve approximation ratios of max{3 ‐ 2/k,2}, 5, max{5 ‐ 2/k,4}, and 7, respectively. We have also analyzed the approximation hardness of these variants by showing that, unless P = NP , it is impossible for them to achieve approximation ratios less than 4/3, 3/2, 3/2, and 2, respectively. We have further extended the techniques and results developed for this problem to other min‐max vehicle routing problems.© 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010     

1943年秋日军发动鲁西细菌战述评

1943年8月下旬至10月下旬，在整个世界反法西斯战争节节胜利的大背景下，日本华北方面军第12军在以馆陶、临清为中心的鲁西、冀南地区实施了大规模的霍乱细菌战，以较小的代价给中国抗日军民造成重大杀伤。此次细菌战同以往日军进行的历次细菌战相比，有其发生的特殊原因，具备许多鲜明的特点，对日军以后的细菌战决策产生了重大影响。     

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

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

无人直升机辨识的一种新方法

针对无人直升机的辨识建模问题,提出了把频率响应辨识法和遗传算法相结合的一种新的辨识方法.该方法充分结合了频率响应辨识法抗噪声能力强、对输入信号通用性强、以及遗传算法的全局寻优特性的优点,极大地提高了辨识的准确性.与最小二乘法、Levy方法的对比仿真结果表明,这种方法辨识精度更高,具有重要的工程使用价值.