铁血战将秦基伟

少年有志闹革命忠贞不移当红军秦基伟是湖北省红安县七里坪秦罗庄人,1914年11月16日出生在一个农民家庭。秦基伟幼年在本村学堂读过一年私塾。8岁丧母,9岁父亲离世,10岁兄长病逝,11岁嫂嫂改嫁、姐姐出嫁。因为家境破败．秦基伟从12岁起便独自生活,历尽了苦难。     

On efficiency of multistage channel with bargaining over wholesale prices

This article considers a multistage channel with deterministic price‐sensitive demand. Two systems for pricing decisions, that is, the bargaining system and the leader‐follower system, are compared. We characterize the necessary and sufficient conditions on the power structure, under which the solution of the bargaining system Pareto dominates that of the leader‐follower system. Also, under such conditions, we give a tight upper bound of channel efficiency of the bargaining system, which converges to 100% channel efficiency as the number of stages increases to infinity. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 449–459, 2016     

RTR技术在固体火箭发动机领域应用研究综述

综述了RTR技术在固体火箭发动机领域应用研究中的概况,总结了部分研究成果,指出了该技术存在的问题,提出运用RTR技术进一步开展SRM领域研究的若干设想。     

Preservation of stochastic orders for random minima and maxima,with applications

It is shown, in this note, that the right spread order and the increasing convex order are both preserved under the taking of random maxima, and the total time on test transform order and the increasing concave order are preserved under the taking of random minima. Some inequalities and preservation properties in reliability and economics are given as applications. © 2003 Wiley Periodicals, Inc. Naval Research Logistics, 2004.     

Al2O3催化氧化脱除GB染毒空气的研究

以浸渍法制备的10%V／Al2O3为催化剂,研究对GB染毒空气的脱除效果,考察接触时间、温度、温度和浓度等因素对GB染毒空气脱除效果的影响,用GC-MS和LC-MS对尾气组分进行了检测分析．     

Exact algorithms for integrated facility location and production planning problems

We consider a class of facility location problems with a time dimension, which requires assigning every customer to a supply facility in each of a finite number of periods. Each facility must meet all assigned customer demand in every period at a minimum cost via its production and inventory decisions. We provide exact branch‐and‐price algorithms for this class of problems and several important variants. The corresponding pricing problem takes the form of an interesting class of production planning and order selection problems. This problem class requires selecting a set of orders that maximizes profit, defined as the revenue from selected orders minus production‐planning‐related costs incurred in fulfilling the selected orders. We provide polynomial‐time dynamic programming algorithms for this class of pricing problems, as well as for generalizations thereof. Computational testing indicates the advantage of our branch‐and‐price algorithm over various approaches that use commercial software packages. These tests also highlight the significant cost savings possible from integrating location with production and inventory decisions and demonstrate that the problem is rather insensitive to forecast errors associated with the demand streams. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011