控制室格栅形屏蔽设计的计算

以抗雷击电磁脉冲干扰为例，按下列2种情况讨论控制室格栅形大空间屏蔽的设计计算：已知屏蔽网格，求磁场强度的衰减是否符合控制系统的脉冲磁场抗扰度；已知控制系统的脉冲磁场抗扰度，求屏蔽网格的宽度W等参数。     

石化装置仪表控制系统供电的可靠性设计

介绍了仪表控制系统的供电原则及仪表控制系统的负荷分配方案。包括冗余供电仪表控制系统的电源配置、冗余型24VDC电源装置的电源配置、非冗余供电的控制系统及仪表的电源配置方案。     

新氢压缩机投用Hydro COM系统对生产及工艺过程控制的影响

中国石油化工股份有限公司燕山分公司中压加氢裂化装置新氢压缩机投用了Hydro COM无级调量系统,其优点主要有三个:新氢压缩机没有了氢气返回,节省了大量电能;机组的运行稳定性有了明显改善;优化了反应系统的压力控制方案,使反应系统压力控制相对平稳.     

施工过程中腐蚀隐患的控制

通过分析石化装置施工过程中常见的现象,分析产生由这些现象加重腐蚀的原因和机理, 指出应加强施工过程中的控制,而达到预期的防腐蚀效果,消除腐蚀隐患。     

工业稳定剂间歇过程计算机控制系统

介绍了1套由AB公司的第5代PLC——RSLogix5000和工业PC组成的工业稳定剂间歇过程计算机控制系统。较详细地介绍系统硬件、软件的构成，ControlNet现场总线网络通信的特点，OPC数据传输的优点。同时阐述了在系统硬件设计上如何保证硬件的安全性和抗干扰问题。运行结果表明。该控制系统具有维护简单、运行可靠性高、抗干扰能力强、传输数据速度快的特点。     

石化装置蒸汽发生系统的仪表工程设计

主要探讨了某石化装置蒸汽发生系统的仪表工程设计，提出了复杂控制方案、联锁方案设计，同时也详述了影响系统设计的因素，如测量补偿和迁移等。     

反凝析现象对雅克拉凝析气处理工艺的影响

雅克拉凝析气田位于塔里木盆地北部，地处新疆维吾尔自治区阿克苏地区境内，它是中国石化集团公司西北分公司探明并投入开发的最大凝析气田，采用衰竭式开采。通过对井口物流的相态研究，认识了凝析气的反凝析规律，采取了提高凝析气中C^＋₃收率的方法，以确保外输干气的烃露点达到管输要求，并提高该气田开发的经济效益。在工艺方案设计过程中，通过多种工艺方案比选，确定选用膨胀机进口压力为6.0 MPa的膨胀机制冷工艺， C^＋₃收率达到92％以上，外输干气烃露点满足管输要求。     

廊固凹陷大兴断层对油气分布的控制研究

廊固凹陷断裂系统复杂，其中大兴断层是中西部的控盆边界断层，它通过对凹陷的构造样式、沉积特征的控制进而影响整个凹陷的油气分布。从区域构造背景和盆地的沉积演化角度，按不同段落断裂展布的方向、产状的陡缓、对沉积的控制作用以及不同层段物质组份的差异，将大兴断层划分为4段：北段、中北段、中南段和南段，各段又可进一步分为上下不同的两段。各段断层的结构、形态、伴生构造、活动时间等都存在较明显差异，通过控制物源而控制沉积相的展布、储层物性和生储盖组合。相应的伴生构造和沉积物发育特征导致构造、构造-岩性组合控制了油气的分布：北段下段、中北段下段近湖一侧是廊固凹陷中西部有利的油气聚集带；中北段上段发育的生物气藏具有一定的勘探前景。     

井喷失控预警的远距离自动调焦控制研究

井喷失控是石油及天然气钻井、完井过程可能出现的灾难性事故，给人类生命财产造成严重伤害，污染环境，破坏地下资源以及在城市火灾、森林火灾、环境变化等监测工作中常需要远距离目标监测，为了获得高清晰的实时图像数据，需要实时自动调焦。通过系统分析远距离相机离焦的原因，建立了一个实时调焦数学模型，并以此为基础研制了一种新的对应距离和温度变化的离焦补偿控制系统。该系统采用微型步进电机实现智能控制，通过监测目标距离确定监测相机的初始焦距，以及环境温度变化的实时反馈实现焦距的实时控制，使相机可以在－40～125 ℃范围内获得清晰、稳定的远距离图像。该系统适用于井喷失控石油及天然气火灾、城市火灾、森林火灾、环境变化等远距离目标的实时监测。     

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.