考虑压敏效应的低渗透油藏CO2辅助重力驱合理配产方法

高倾角低渗透油藏在进行水驱开发时,在油藏高部位存在大量剩余油,采收率较低,采用CO2辅助重力驱,可以充分利用高倾角的地质特征,有效提高该类油藏的采出程度。但是由于CO2对原油物性影响要远大于水对原油物性的影响,CO2驱替过程中流体的渗流过程更加复杂,因此有必要对低渗透油藏CO2重力驱合理配产优化进行研究。首先,依据油藏中任意一点压力与最小混相压力的关系,分别建立了考虑压敏效应的低渗透油藏CO2重力驱混相和非混相模型;其次,运用Python对模型进行求解,同时分析了压敏系数、地层倾角、注采井距和注气速度对油藏配产的影响;最后,结合现有工作制度法和增产倍数法,对比本模型计算结果,运用tNavigtor软件对三种方法进行采收率预测。研究结果表明：运用本文方法对油藏进行合理配产具有较好的开发效果,油藏采收率相对较高,研究成果对该类低渗油藏的开发具有较好的借鉴意义。     

采动覆岩注浆离层力学结构模型及稳定性预测方法： 以张集煤矿为例

煤矿开采引发地表岩土层移动变形,进而导致建筑倒塌、生态环境破坏等问题,离层注浆是减缓地表沉降的重要手段之一。为了研究淮南矿区倾斜地层采动离层的发育和稳定性,基于关键层理论,建立由主关键层、注浆阻隔层、亚关键层组成的采动覆岩注浆离层力学结构模型,提出注浆离层稳定性力学判据。采用离散元数值模拟分别建立水平和倾斜地层模型,模拟煤层开采过程中裂隙演化规律及可注浆离层发育情况。结果表明,水平和倾斜地层导水裂隙均未贯通注浆阻隔层,主关键层底部均发育可注浆离层,水平地层可注浆离层开度比倾斜地层的开度更大。数值模拟证明采动覆岩注浆力学结构模型可以对采动离层稳定性进行有效预测。     

关于物元可拓集的若干性质

推广了原有物元可拓集的定义,刻划了物元可拓集与事物集×特征集上的二元可拓关系之间的联系,给出了物元变换及其可拓域与稳定域的若干性质。     

混合控制系统的广义Pet ri 网建模与设计

提出一类混合系统的Ｐｅｔｒｉ网模型,强调连续与离散动态在同一层次的直接交互,连续与离散动态的分布式并发演化。给出基于混合Ｐｅｔｒｉ网的混合控制器设计方法。     

多重运输调度问题的模拟退火算法

提出了多重运输调度问题的模拟退火算法,实际运算表明,该算法具有较快的收敛速度,是一个较实用的算法。     

线性定常模糊随机系统的响应分析

证明了线性定常模糊随机系统的输出在均方意义下的收敛性,并给出了系统响应的模糊概率特征关系方程。     

Novel cued search strategy based on information gain for phased array radar

A search strategy based on the maximal information gain principle is presented for the cued search of phased array radars. First, the method for the determination of the cued search region, arrangement of beam positions, and the calculation of the prior probability distribution of each beam position is discussed. And then, two search algorithms based on information gain are proposed using Shannon entropy and Kullback-Leibler entropy, respectively. With the proposed strategy, the information gain of each beam position is predicted before the radar detection, and the observation is made in the beam position with the maximal information gain. Compared with the conventional method of sequential search and confirm search, simulation results show that the proposed search strategy can distinctly improve the search performance and save radar time resources with the same given detection probability.     

Range walk and array rotation in space-time adaptive processing: effects and compensations

This paper proposes a unified clutter model incorporating the effects of range walk and array rotation for space-time adaptive processing (STAP) in airborne multi-channel early-warning radar. Based on this clutter model, STAP performance is then analyzed from the perspective of covariance matrix tapering (CMT). For STAP performance degradation due to array rotation, a determinate compensation method is proposed based on the CMT method. Numerical examples are provided to verify the analysis and the proposed compensation method.     

Fast motion estimation algorithm for H.264/AVC based on centered prediction

H.264/AVC video coding standard can achieve roughly half of the bit-savings over MPEG2 and MPEG4 for a given quality. However, this comes at a cost in considerably increased complexity at the encoder and thus increases the difficulty in hardware implementation. The high redundancy that exists between the successive frames of a video sequence makes it possible to achieve a high data compression ratio. Motion estimation (ME) plays an important role in motion compensated video coding. A fast motion estimation algorithm for H.264/AVC is proposed based on centered prediction, called centered prediction based fast mixed search algorithm (CPFMS). It makes use of the spatial and temporal correlation in motion vector (MV) fields and feature of all-zero blocks to accelerate the searching process. With the initialized searching point prediction, adaptive search window changing and searching direction decision, CPFMS is provided to reduce computation in block-matching process. The experimental results show that the speed of CPFMS is nearly 12 times of FS with a negligible peak signal-noise ratio (PSNR) loss. Also, the efficiency of CPFMS outperforms some popular fast algorithms such as hybrid unsymmetrical cross multi-hexagongrid search and a novel multidirectional gradient descent search evidently.     

An equivalency condition of nonsingularity in nonlinear semidefinite programming

<正> In this paper,an equivalency condition of nonsingularity in nonlinear semidefinite programming,which can be viewed as a generalization of the equivalency condition of nonsingularity for linearsemidefinite programming,is established under certain conditions of convexity.