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

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

不同级配对微表处混和料性能的影响

微表处技术是一种性能优良的路面养护技术。首先检验了微表处用原材料的技术指标,在满足规范的要求下选择了三种不同级配,并对三种不同级配的微表处混和料的使用性能进行了比较。     

低勘探程度区域油气资源评价方法

目前中国油气资源勘探和开发面临后备可采储量不足，低勘探程度区域受到重视。为了提高低勘探程度区域的资源评价精度，在前人评价的基础上，通过研究并利用勘探程度较高区域的资源评价结果，求准低勘探程度区域的油气聚集量，进而模拟求出其烃排聚系数、储量密度系数、单储系数和单生系数等关键参数，提出了利用练台地质推断法对低勘探程度区域进行评价，并对该方法评价的风险进行了分析。综合地质推断法的成果更能准确反映一个盆地、坳（凹）陷或区带的油气潜力及其分布特征。     

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

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

岩性指示曲线重构及其在储层预测中的应用

大牛地上古生界岩性气藏主要发育在三角洲分流河道沉积的下石盒子组、海陆交互沉积的山西组及以潮坪相沉积为主的太原组,储层是储集性能较差的致密砂岩,平均孔隙度小于10％,渗透率小于1×10-2μm2,储层单层厚度一般小于10 m,砂体横向连通性较差。由于低孔、低渗特征导致储层与围岩的波阻抗差异微弱,用地震资料进行储层预测困难。为此,针对大牛地石板太工区优质储层的岩性特征和测井响应特征进行了测井综合分析,利用对岩性粒度敏感的自然伽马曲线,以及对岩性粒度响应频率较低,且与波阻抗有较好对应关系的中子曲线重构了岩性指示曲线。岩性指示曲线不仅可以有效地识别优质砂体,划分不同岩性,为地震、测井信息结合的岩性反演建立桥梁,同时也为反演结果识别气层打下了基础。利用岩性指示曲线、波阻抗和电阻率曲线进行的地震、测井联合反演技术在石板太工区取得了较好的效果,同时,对石板太工区下石盒子组盒2段、山2段进行了储层和含气性预测,划分了有利含气区带,部署的2口开发井和1口探井有2口井见气,其中1口井获高产气流。     

基于两层均匀媒质的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算法的安全性。     

一种基于无理数加密算法的数字签名方案

为了提高现代网络信息传输的安全性,利用无理数小数点后数字的无穷性、无规律性、分布均匀性,提出一种全新的加密算法,并用它所产生的密钥流进行数字签名,实现身份验证不可抵赖、信息传输无篡改,确保信息传输的完整性、真实性,达到提高加密效率、相互认证的效果。