红外光谱法用于快速测定车用柴油酸度等性质的研究

针对车用柴油酸度等性质测定过程繁琐，采用衰减全反射样品池测定车用柴油的红外光谱，用偏最小二乘法（PLS）建立红外光谱测定车用柴油酸度、密度、闪点和凝点的4个校正模型，验证标准误差分别为0.46 mg/(100 mL),0.77kg/m3,2.60 ℃,2.77 ℃，该方法符合标准方法再现性要求。与标准方法相比，该方法具有无需预处理、操作简单、测量快速、重复性好等优点。     

蜡晶形态结构对原油降凝的影响

 采用偏光显微镜观察了不同条件下蜡晶的形态变化，对蜡结晶过程中的结构、分布状态和生长规律进行了深入的研究，采用气相色谱分析了用52#、62#、80#蜡配制的模拟油中蜡的碳数分布，考察了凝点与蜡含量之间的变化规律，以及沥青质、胶质和大分子降凝剂(PPD)对模拟油降凝、降粘的影响，为改善原油流动性提供理论依据。实验结果表明，蜡晶的微观形态结构、蜡在油中的溶解性能以及降凝剂的降凝作用与模拟油中蜡的碳数分布密切相关，只有当降凝剂分子结构与油中蜡的结构匹配时，才能达到理想的降凝效果。通过实验确定了模拟油降凝时的临界蜡含量为40%（质量分数），大于该临界值后，凝点随着蜡含量的变化幅度将大大降低。     

USB数据传输中CRC校验码的并行算法实现

文章介绍了用于USB总线数据传输的CRC校验的原理和算法，并且采用并行电路实现USB2．0中的CRC产生和CRC校验，与传统的串行电路实现相比，并行电路实现方法虽然在芯片面积上大于串行电路实现，但由于降低了时钟频率，电路更容易综合实现，并且大大降低了功耗，有利于低功耗电路设计。     

基于进化算法的常减压装置模拟

提出了基于优选优生进化算法（Select—best and prepotency evolution algorithm，SPEA）的常减压装置模拟方法。以各塔的温度分布为目标，基于生产过程和分析数据，采用SPEA确定各塔板Murphree效率，从而精确描述各塔板平衡偏离程度。在实际应用中，获得具有良好精度的常减压装置模型。系统分析了SPEA算法的关键参数——优选领域大小与计算复杂性及寻优性能之间的关系，结果显示其取值为群体规模的10％最为合适。     

VRDS装置增加上流式反应器的技术分析

介绍了世界上第1套上流式反应器技术(UFR)在胜利炼油厂渣油加氢脱硫(VRDS)装置的生产运行情况。结果表明:UFR技术可以极大地优化VRDS装置的运转,减少装置运转的苛刻度,有效地延长装置运转周期,提高装置的经济效益。     

XMAC纵波时差高分辨率处理方法

在充分调研阵列声波测井分波提取方法的基础上，针对阿特拉斯公司的交叉多极子阵列声波测井（XMACⅡ）提供的单极波形信息，研究纵波时差提取及高分辨率处理方法。首先利用相关-互功谱法高精度地提取纵波时差，然后针对XMACⅡ仪器的接收阵列，研究组合子阵列的方法，形成共发射子阵列和共接收子阵列，最后利用子阵列对提取的纵波时差做高分辨率处理。处理现场实际测井资料，并将高分辨率处理成果与引进的eXpress软件处理成果、实测的国产高分辨率声波（纵波）测井曲线及岩心纵波时差对比分析，表明该方法提取的纵波时差曲线的纵向分辨率有很大提高，时差计算准确可靠，提取的单极纵波时差与国产高分辨率声波时差及岩心纵波时差的平均相对误差均小于7%。该方法具有较高的实用价值和广阔的应用前景。     

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

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

基于两层均匀媒质的GPEN SAR地下目标成像方法及其性能分析

地表穿透合成孔径雷达(Ground PENetration SAR,GPEN SAR)为了探测掩埋在地下的目标,通常工作在多层媒质的环境中。传统成像模型是建立在同一均匀媒质的假设上,不再适合于GPEN SAR的实际情况。本文首先建立了两层分区均匀媒质中的成像模型,然后利用后向投影(BP)算法定量分析了成像几何参数、土壤参数等对成像的影响,进而提出了一种修正的后向投影(MBP)算法。MBP算法不仅能够校正两层分区均匀媒质对成像定位的影响,还能估计目标的掩埋深度,提供目标三维位置坐标。仿真结果验证了MBP算法在不同信噪比环境下,对多目标的三维定位精度能满足实际的需要。     

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.     

个性化公开密钥系统的设计

论文提出利用用户提供的个性化信息来随机产生关联大素数,保证了素数选取的随机化、个性化,提高了RSA算法的安全性。