石化企业实时数据管理引擎设计与实现

实时数据管理系统是流程企业控制信息网络与管理信息网络平滑集成的基础，为两者的数据通讯提供桥梁。介绍了笔者在炼油化工C企业IMS建设中的实时数据管理引擎设计与开发，具有其先进性与实用性。     

销售企业客户服务体系建设的几点建议

在阐述客户服务意义的基础上，提出对中国石化成品油销售企业客户服务体系建设的建议，即建立以客户为尊的服务理念；建设特色企业文化；完善员工服务体系；注重细节，提高服务质量；整合现有客户体系资源，拓展服务功能。     

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

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

加油站电气设备引发着火爆炸事故原因分析及对策

通过对加油站电气设备引发着火爆炸事故的作业环节、发生部位、点火源和对事故原因的综合定性定量分析。指出电气设备不防爆和电气线路安装不符合防爆要求，以及规章制度不健全，管理不到位是引发着火爆炸的主要原因，提出了要提高思想认识，做好加油站防爆电气设备的全面普查摸底。要搞好新建加油站或改建项目的竣工验收和落实责任，加强防爆电气的使用管理等措施。     

应用API 581对输气站场进行定量风险评价

目前专门针对输气站场的风险评价方法还不多，现有的手段也只是根据国家法律法规得出定性的评价结果，然后按照评价结果对照得出整改方案。为此，对输气站场的定量风险评价工作提出了一套新方法，得到了定量的和更加客观的风险排序，为管道站场的完整性管理工作提供了有力的支持；并以陕京输气管道榆林压气站为例，应用美国石油学会标准API 581（基于风险检测的基本源文件）对站内设施进行了风险评价，计算了站内设备和管线的失效后果、失效概率，得到了定量风险值，进而分析了风险值产生差异的原因。最后，针对我国输气管道风险评估工作提出了看法和建议。     

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.     

Analysis of Distributed DDQ for QoS Router

In a packet switching network, congestion is unavoidable and affects the quality of real‐time traffic with such problems as delay and packet loss. Packet fair queuing (PFQ) algorithms are well‐known solutions for quality‐of‐service (QoS) guarantee by packet scheduling. Our approach is different from previous algorithms in that it uses hardware time achieved by sampling a counter triggered by a periodic clock signal. This clock signal can be provided to all the modules of a routing system to get synchronization. In this architecture, a variant of the PFQ algorithm, called digitized delay queuing (DDQ), can be distributed on many line interface modules. We derive the delay bounds in a single processor system and in a distributed architecture. The definition of traffic contribution improves the simplicity of the mathematical models. The effect of different time between modules in a distributed architecture is the key idea for understanding the delay behavior of a routing system. The number of bins required for the DDQ algorithm is also derived to make the system configuration clear. The analytical models developed in this paper form the basis of improvement and application to a combined input and output queuing (CIOQ) router architecture for a higher speed QoS network.     

江阴长江公路大桥钢箱梁体受力分析

介绍了对大桥的风向、风力和交通流量的测试依据和内容，分析了风向、风力的测试结果以及梁体在风力及交通流量等作用下的受力情况，指出钢箱梁体主要受到的力是风力。     

贴片设备的选择

随着电子工业的飞速发展,贴片设备已被广泛应用于大规模电子组装生产上。文章就贴片机选型时应注意的几个关键技术问题作简单介绍,希望对企业选择贴装设备有一定的帮助。     

基于服务器端会话追踪的Web查询服务的研究

在探讨了Web查询服务的典型模型后,论文阐述了服务器端会话追踪机制的实现方式,设计了基于服务器端会话追踪的Web查询服务的典型解决方案。该设计方案可以较为安全地保存和维护客户的上下文信息,可靠地跟踪用户查询所处的状态,有效地实现有状态的Web查询服务。