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.     

Optimal policies for stochastic clearing systems with time-dependent delay penalties

We study stochastic clearing systems with a discrete-time Markovian input process, and an output mechanism that intermittently and instantaneously clears the system partially or completely. The decision to clear the system depends on both quantities and delays of outstanding inputs. Clearing the system incurs a fixed cost, and outstanding inputs are charged a delay penalty, which is a general increasing function of the quantities and delays of individual inputs. By recording the quantities and delays of outstanding inputs in a sequence, we model the clearing system as a tree-structured Markov decision process over both a finite and infinite horizon. We show that the optimal clearing policies, under realistic conditions, are of the on-off type or the threshold type. Based on the characterization of the optimal policies, we develop efficient algorithms to compute parameters of the optimal policies for such complex clearing systems for the first time. We conduct a numerical analysis on the impact of the nonlinear delay penalty cost function, the comparison of the optimal policy and the classical hybrid policy (ie, quantity and age thresholds), and the impact of the state of the input process. Our experiments demonstrate that (a) the classical linear approximation of the cost function can lead to significant performance differences; (b) the classical hybrid policy may perform poorly (as compared to the optimal policies); and (c) the consideration of the state of the input process makes significant improvement in system performance.     

一类时滞微分方程正周期解的存在性

讨论了一类生物模型正周期解的存在性问题,利用Mawhin延拓定理得到了系统存在正周期解的一个充分条件。而且,当系统为无穷时滞时,结论也是成立的。     

Equilibrium customer strategies and social–profit maximization in the single‐server constant retrial queue

We consider the single‐server constant retrial queue with a Poisson arrival process and exponential service and retrial times. This system has not waiting space, so the customers that find the server busy are forced to abandon the system, but they can leave their contact details. Hence, after a service completion, the server seeks for a customer among those that have unsuccessfully applied for service but left their contact details, at a constant retrial rate. We assume that the arriving customers that find the server busy decide whether to leave their contact details or to balk based on a natural reward‐cost structure, which incorporates their desire for service as well as their unwillingness to wait. We examine the customers' behavior, and we identify the Nash equilibrium joining strategies. We also study the corresponding social and profit maximization problems. We consider separately the observable case where the customers get informed about the number of customers waiting for service and the unobservable case where they do not receive this information. Several extensions of the model are also discussed. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011     

一类具有阶段结构和潜伏期时滞的SEI模型的全局动力学性态

研究一类具有潜伏期时滞、阶段结构和标准发生率的SEI模型,利用比较定理和单调迭代的方法,分别得到无病平衡点和地方病平衡点全局吸引的充分条件．     

一种简易高效的加速措施——移位常数

本文介绍在不增加硬件额外开销的情况下,提高巨型机“取操作数”速度的一种基于直接数指令的移位常数方法。     

基于通信延迟误差补偿的协同导航算法

多自主水下航行器(MAUV)协同导航技术是解决水下定位的重要手段。主从式多AUV协同导航系统利用水声通信方式实现数据共享,但由于声速在水中传播较慢,使得接收到的量测信息具有通信延迟。因此,针对通信延迟问题提出了一种新息重建的状态估计补偿方法,通过对从AUV进行状态递推,获得在有无量测延迟两种情况下的状态误差,将此误差作为重建的新息补偿到状态估计中。仿真结果验证了该方法能够有效地补偿协同导航中由于通信延迟造成的定位误差,提高从AUV的定位精度。     

IDRP：行星际DTN路由协议

为解决星际网络场景下的数据传输问题,提出了一种星际容延迟网络路由协议:利用节点的历史连接信息来预测该节点与其各个邻居节点的连接恢复时间;当两个位于同一个域的节点互相连接时,交换彼此的连接时间预测表,并据此决定是否需要使用对方作为中继节点;深空节点的存储资源常常受限,在进行路由选择时将节点的存储区消耗情况也纳入决策。使用NS2进行地-火通信场景仿真,使用一种改进的泛洪路由和一种仅选择网关节点作为下一跳选择的路由策略作对比。仿真结果表明相比其他两种协议,提高了14%的投递成功率并减少了50%的平均传输延迟,并更有效的利用了节点存储资源。     

基于VFD滤波器的导航信道模拟器动态时延模拟方法*

针对卫星导航信道模拟器信号仿真中,传统伪距多普勒模拟方法瞬时控制精度差、滤波器资源占用较大的不足,提出了基于拉格朗日插值延迟滤波器及Farrow结构实现的伪距多普勒模拟方法。在分析信道模拟器系统架构的基础上,建立了多普勒模拟方法的模型,包括延时计算模块和可变延迟滤波器两部分。与多速率采样数字延迟滤波器方法比较,该方法滤波器系数个数约为后者的0.2%,并且改变时延特性时,仅需更新1个参数。信道模拟器实测数据结果表明使用该方法伪码多普勒模拟精度可以达到0.1mHz。     

一类非线性时滞系统的时滞相关稳定性分析

针对一类非线性时变时滞系统,基于T-S模糊模型,采用自由权矩阵的方法,研究了该系统的稳定性问题。设计了一个与系统状态变量的导数有关的模糊控制器,推导出该控制器使闭环系统渐近稳定的充分条件,该条件等价于一类线性矩阵不等式（LMI）的可解性,并以仿真算例证明了控制器的有效性。