槽头式野战管线水击波速测量研究

液体管道的水击波速受流体压力、温度、分子结构、含气量及管线几何尺寸、管材等因素的影响,准确地确定管线的水击波速是一个相当困难的问题,通过实验测量水击波速是一个常用方法。管线水击波速的常用测量方法有波前法和周期法。综合运用波前法和周期法,设计了实验测量野战管线的水击波速,并将实验结果与笔者先前提出的水击波速计算公式的计算结果作了对比,验证了公式的有效性。     

Optimizing natural gas pipeline transmission with nonuniform elevation: A new initialization approach

In this paper, we develop an iterative piecewise linear approximation approach with a novel initialization method to solve natural gas pipeline transmission problems with the nonuniform network elevation. Previous approaches, such as energy minimization methods, cannot be applied to solve problems with the nonuniform network elevation because they exclude pressure range constraints, and thus provide solutions far from optimum. We propose a new initialization model that considers pressure range constraints and improves the optimality of the solutions and the computational efficiency. Furthermore, we extend the energy minimization methods and provide the necessary conditions under which the extended methods operate in networks with the nonuniform elevation. We test the performances of the methods with previously reported pipeline networks from the literature, with the open data set GasLib, and with our industrial collaborator. The initialization approach is shown to be more efficient than the method with fixed initial breakpoints. The newly proposed initialization approach generates solutions with a higher accuracy than the extended energy minimization methods, especially in large‐size networks. The proposed method has been applied to natural gas transmission planning by the China National Petroleum Corporation and has brought a direct profit increase of 330 million U.S. dollars in 2015‐2017.     

固体火箭发动机复合材料壳体裙黏接性能分析

采用数值计算方法研究复合材料壳体裙连接结构的黏接性能。通过建立纤维缠绕壳体的有限元模型,采用内聚力模型定义裙黏接面的接触关系,引入黏接界面的损伤失效准则,模拟黏接界面的脱黏行为,以此预测裙连接结构的极限承载。同时,研究壳体的轴向和环向应变及黏接面上的剪应力分布情况,以及弹性层的弹性模量与黏接长度对黏接性能的影响。数值算例表明,计算结果与实验数据相吻合,验证了该方法的正确性。所提方法可用于裙连接结构的优化设计中。     

定性定量相结合的军队建设模型研究

随着军队武器装备的现代化,尤其是高科技在军事上的应用,军队建设问题变得更加复杂。军队建设问题论证模型,主要从定量分析的角度,论证说明军队建设决策优化问题。本文就军事人员规划和管理、军费需求估计与合理分配、政治工作综合评估等问题的建模思路给予简要论述。     

雷达天线俯仰控制及威力显示系统的设计

介绍现有雷达天线俯仰控制及显示系统的缺点 ,提出采用单片机控制、液晶显示威力图的方式改造天线俯仰系统。同时给出了系统硬件设计和软件设计。     

中国新诗发展述略

从1917年胡适的《白话诗八首》开始,新诗已走过近百年的历程,在近一个世纪的发展中,一代代诗人的努力使新诗形成了迥异于旧体诗的独特形式和创新品格,并在探索中形成了散文化倾向、扩充新意象、不断创新探索等特色。     

有关交簇超图的两个结论

本文结合超图中著名的EKR定理,充分利用补超图这一有力工具,论证了在限定条件下交簇超图的两个结论,从而推广了EKR定理。     

基于辐照度标准传递的辐亮度校准系统

介绍了一种新型辐亮度校准系统,通过溯源至国家辐照度标准,构建了军用光辐射校准平台。对系统的测量不确定度分析表明,该系统可以满足装备计量保障对测试不确定度比的通用要求,适用于装备专用检测设备的辐亮度校准。     

A two‐echelon inventory‐location problem with service considerations

We study the problem of designing a two‐echelon spare parts inventory system consisting of a central plant and a number of service centers each serving a set of customers with stochastic demand. Processing and storage capacities at both levels of facilities are limited. The manufacturing process is modeled as a queuing system at the plant. The goal is to optimize the base‐stock levels at both echelons, the location of service centers, and the allocation of customers to centers simultaneously, subject to service constraints. A mixed integer nonlinear programming model (MINLP) is formulated to minimize the total expected cost of the system. The problem is NP‐hard and a Lagrangian heuristic is proposed. We present computational results and discuss the trade‐off between cost and service. © 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