Fenton试剂降低采油污水CODCr的研究与应用

针对辽河油区超稠油采油污水的特点，采用Fenton试剂催化氧化，对采油污水处理进行研究。实验研究及现场应用结果表明，此方法对污水的CODCr具有良好的去除效果。处理后污水经过简单生化，进一步降解污染物，能够实现稳定迭标排放，且具有能耗低、运行成本低和操作简单等特点。     

油田污水处理及酸化缓蚀剂的应用

介绍了油田污水处理及酸化中的几类缓蚀剂,重点介绍了咪唑啉型缓蚀剂、膦系缓蚀剂、曼尼希碱、炔醇等四类目前使用较多的缓蚀剂。结合缓蚀剂的分子结构阐述了其作用机理,论述了污水用缓蚀剂和酸化用缓蚀剂分子结构的区别及原因,并探讨了今后研究和发展的方向。     

集输系统热回水管线腐蚀分析

中国石油天然气股份有限公司华北分公司第三采油厂油气集输系统热回水管线普遍存在着腐蚀问题,影响原油生产和集输的正常运行。介绍了腐蚀较严重的13个站点的水质普查、水质结垢倾向和腐蚀性情况,并在水质分析的基础上进行了热水管线腐蚀因素的试验研究,确定腐蚀主要因素为水中的溶解氧含量高,从而造成腐蚀。     

浅谈创建节约型油库

介绍了中国石化江苏盐城石油分公司新兴油库创建节约型油库活动的经验和取得的较好的经济效益。他们的做法是：高度重视，提高全员创建思想意识。充分发挥员工的积极作用；细化措施，努力挖掘降本增效空间；强化监控，建立健全长效管理机制。     

污水汽提系统的化学除臭清洗

文章简要介绍了化学除臭清洗剂JX-518的组成,并对采用该清洗剂对污水汽提系统进行化学除臭清洗的清洗过程及注意事项进行了详细介绍。实践证明,清洗后系统残液中硫化物及氨氮可降至很低,取得了很好的清洗效果。     

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

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

谈国际石油资源的利用

全球经济的迅猛发展使能源问题日益受到关注,而石油资源的紧缺已成为当前能源利用的首要问题,世界各国企业都加入了激烈的石油资源的竞争当中。根据目前世界石油资源的现状和中国石油资源的供需形势,结合石化企业的特点,对如何更好地利用国际石油资源提出了对策和建议。     

论四川盆地天然气勘探前景

中石油及其前身已在四川盆地从事天然气勘探开发工作50余年,截至2005年底累计探明天然气地质储量逾8400×10⁸m³,累计生产天然气超过2300×10⁸m³,年产量现已超过120×10⁸m³,已成为国内目前最大的产气区。对于该盆地进一步勘探前景如何的命题,从以下4个方面给予了论证：一是资源丰富、勘探成果持久不衰，近期仍有大发现；二是要辩证地认识盆地油气地质的复杂性，探索新规律，解放新领域；三是寻求地质认识和勘探技术进步是勘探突破的关键；四是继续以盆地两大地质体系（海相古隆起体系及陆相前陆盆地体系）和8套裂缝-孔隙性储集层（中上寒武统白云岩、石炭系白云岩、上二叠统长兴组生物礁白云岩、下三叠统飞仙关组鲕状白云岩、下三叠统嘉陵江组粒屑白云岩、中三叠统雷口坡组藻粒白云岩、上三叠统须家河组长石岩屑石英砂岩和中上侏罗统红层砂岩）为对象获取更多的天然气资源量及优质储量。据此得出结论：四川盆地天然气勘探前景是广阔的，但勘探难度会逐步加大。     

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.     

我国水权交易博弈定价决策机理

结合水权交易双方的效用函数，基于博弈原理及方法分别建立了水权交易准市场阶段和水市场阶段的水权交易博弈定价模型，并对水市场定价模型的纳什均衡解进行了探讨；基于定价相关要素间关系的探讨，解析了准市场阶段和水市场阶段水权交易定价决策机理，结果认为水权交易双方存在利益冲突，并且准市场阶段水权交易定价相对较低，水市场阶段水权交易定价相对较高。