ca油田稠油油藏系统保护油气层研究

针对ca油田多层状砂泥薄互层稠油油藏的特点,开展了热采和非热采条件下储层变化特征研究、钻井和固井过程入井液的研究、采油工艺技术等系统保护油气层研究,了解各种变化的作用过程和原因,有效地预防现场施工中可能发生的储层伤害,从而达到储层保护、提高采收率的目的。     

塔北地区储层敏感性综合预测

综合分析地质、地震及测井资料，可以准确地预测储层的敏感性。以地质分析及敏感性实验资料为基础，以测井资料为标定手段，以地震信息为横向预测导向，综合处理各种信息，从而实现对区域储层的敏感性预测。其中，利用测井资料预测储层敏感性是关键，须采用多参数相关系数法进行单井储层敏感性分析。以塔北地区侏罗系为例，综合各类信息进行了储层敏感性处理，分析结果表明，该区储层速敏弱，水敏、盐敏、碱敏和酸敏程度中等，与其储层敏感性实验结果基本吻合。     

横泉水库供水发电洞工程地质分析与评价

通过大量野外工程地质勘察与测试工作，在此基础上给出了横泉水库供水发电洞的工程地质分析与评价，从而使该水库的施工有了充分的理论依据。     

王庄油田粘土矿物转化对储层的影响

王庄油田是水敏性稠油油藏的典型代表，其水敏性在热采过程中的变化直接关系到油田开发方式的选择。针对这一问题，从直接影响水敏性变化的储层粘土矿物入手，在模拟地层环境的基础上通过室内高温高压静态和动态物模实验，并结合X衍射、扫描电镜、元素分析、粒度检测等多种分析测试手段，研究了粘土矿物在100-300℃之间的变化过程，从而找到水敏性的变化规律，进而从机理上解释了渗透率的变化原因，为数值模拟和开发方案制定提供室内研究依据。     

移动通信系统中功率控制研究

在阐述功率控制在移动通信系统中的发展过程的基础上，着重研究了WCDMA系统的功率控制，最后对功率控制未来的研究方向做了简要的分析。     

稳压并抑制谐波的新型电源

由于电网谐波污染严重，对谐波的抑制已成为供电部门的重要任务。文章介绍一种既能稳压又能抑制谐波的新型电源，它采用串联型有源电力滤波的方法，通过瞬态电压补偿后可得到纯净的三相正弦平衡电压。     

储层应力敏感性影响因素研究

全面分析储层应力敏感性产生的机理认为，外部因素的改变会引起储层产生应力敏感性．而储层岩石物性等内部因素对应力敏感性的强弱起决定性作用。室内岩心应力敏感性评价时．仪器与设备的精度、加载与卸载方式、实验用流体类型以及各种人为因素等都会对评价结果产生影响，其中岩心密封套在高压、高温条件下的密闭性会对实验结果产生较大影响。所以储层应力敏感性不应该从孔隙度和渗透率的高低进行简单评价，中、高渗储层和低渗储层在生产过程也都可能表现出较强的应力敏感性现象。     

丙烯酸/α-甲基丙烯酸/丙烯酰胺共聚物智能水凝胶的合成及评价

由丙烯酸（AA）、α-甲基丙烯酸（MAA）和丙烯酰胺（AM）合成了具有很好DH敏感性和一定温度敏感性的智能水凝胶，考察了合成温度、丙烯酰胺、交联剂和引发剂用量对制备的水凝胶溶胀性能的影响。结果表明，在60℃下，单体从和MAA用量分别为100mmol和75mmol时，单体AM、交联剂和引发剂用量分别为反应物总质量的32．8％、0．2％和0．4％时，制备的水凝胶溶胀性能最好。考察了介质的离子浓度、pH值和温度对水凝胶溶胀比的影响，结果表明，离子浓度越大，水凝胶的溶胀比越小；水凝胶具有一定的DH可逆性。     

FF现场总线的网段负载能力的设计及计算

从生产安全运行的管理要求；电压压降和电流的限制及信号的衰减；网络运行时间的要求；系统设计的影响；备用能力的考虑等各个方面，结合上海赛科聚苯乙烯项目的具体设计，分析隔爆条件下FF现场总线的H1网段负载能力的设计，以供大家探讨。     

Range Assignment for Biconnectivity and k-Edge Connectivity in Wireless Ad Hoc Networks

Depending on whether bidirectional links or unidirectional links are used for communications, the network topology under a given range assignment is either an undirected graph referred to as the bidirectional topology, or a directed graph referred to as the unidirectional topology. The Min-Power Bidirectional (resp., Unidirectional) k-Node Connectivity problem seeks a range assignment of minimum total power subject to the constraint that the produced bidirectional (resp. unidirectional) topology is k-vertex connected. Similarly, the Min-Power Bidirectional (resp., Unidirectional) k-Edge Connectivity problem seeks a range assignment of minimum total power subject to the constraint the produced bidirectional (resp., unidirectional) topology is k-edge connected. The Min-Power Bidirectional Biconnectivity problem and the Min-Power Bidirectional Edge-Biconnectivity problem have been studied by Lloyd et al. [23]. They show that range assignment based the approximation algorithm of Khuller and Raghavachari [18], which we refer to as Algorithm KR, has an approximation ratio of at most 2(2 – 2/n)(2 + 1/n) for Min-Power Bidirectional Biconnectivity, and range assignment based on the approximation algorithm of Khuller and Vishkin [19], which we refer to as Algorithm KV, has an approximation ratio of at most 8(1 – 1/n) for Min-Power Bidirectional Edge-Biconnectivity. In this paper, we first establish the NP-hardness of Min-Power Bidirectional (Edge-) Biconnectivity. Then we show that Algorithm KR has an approximation ratio of at most 4 for both Min-Power Bidirectional Biconnectivity and Min-Power Unidirectional Biconnectivity, and Algorithm KV has an approximation ratio of at most 2k for both Min-Power Bidirectional k-Edge Connectivity and Min-Power Unidirectional k-Edge Connectivity. We also propose a new simple constant-approximation algorithm for both Min-Power Bidirectional Biconnectivity and Min-Power Unidirectional Biconnectivity. This new algorithm applies only to Euclidean instances, but is best suited for distributed implementation. A preliminary version of this work appeared in the proceedings of the 2nd International Conference on AD-HOC Network and Wireless (Adhoc-Now 2003). Research performed in part while visiting the Max-Plank-Institut fur Informatik. Gruia Calinescu is an Assistant Professor of Computer Science at the Illinois Institute of Technology since 2000. He held postdoc or visiting researcher positions at DIMACS, University of Waterloo, and Max-Plank Institut fur Informatik. Gruia has a Diploma from University of Bucharest and a Ph.D. from Georgia Insitute of Technology. His research interests are in the area of algorithms. Peng-Jun Wan has joined the Computer Science Department at Illinois Institute of Technology in 1997 and has been an Associate Professor since 2004. He received his Ph.D. in Computer Science from University of Minnesota in 1997, M.S. in Operations Research and Control Theory from Chinese Academy of Science in 1993, and B.S. in Applied Mathematics from Tsinghua University in 1990. His research interests include optical networks and wireless networks.