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

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

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

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

注水吞吐开发低渗透裂缝油藏探讨

室内油层岩心驱替实验研究结果表明，注水吞吐采油技术可发挥油层毛管力吸水排油作用，实现水驱，能有效地补充地层能量，恢复地层压力。通过多周期的注水吞吐开发，逐渐扩大水驱波厦半径，提高驱替效率。油层润湿性和渗透率是影响注水吞吐开发效果的主要因素。该技术简单易行，在头台油田实施后，效果十分显著，对同类油藏的开发真有指导意义。     

储层应力敏感性影响因素研究

全面分析储层应力敏感性产生的机理认为，外部因素的改变会引起储层产生应力敏感性．而储层岩石物性等内部因素对应力敏感性的强弱起决定性作用。室内岩心应力敏感性评价时．仪器与设备的精度、加载与卸载方式、实验用流体类型以及各种人为因素等都会对评价结果产生影响，其中岩心密封套在高压、高温条件下的密闭性会对实验结果产生较大影响。所以储层应力敏感性不应该从孔隙度和渗透率的高低进行简单评价，中、高渗储层和低渗储层在生产过程也都可能表现出较强的应力敏感性现象。     

三重介质油藏干扰试井压力动态特征

在建立三重介质油藏试井解释模型的基础上，对该类油藏的干扰试井压力动态变化进行了研究；分析了井筒储存、表皮系数、窜流系数以及弹性储容比对观测井井底压力的影响。结果表明，表皮系数对观测井的井底压力没有影响，而井筒储存是否会对观测井井底压力造成影响取决于井筒储存系数的大小以及激动井和观测井之间的距离，窜流系数和弹性储容比对观测井井底压力的影响与单井试井的结果相类似。     

一种高精度的非平稳随机信号实时建模算法研究

针对传统的非平稳随机信号时变参数筹分模型算法的不足,论文把非平稳随机信号时变参数差分模型与一种带自适应遗忘因子的RLS算法结合起来,形成一种有效的非平稳随机信号实时建模算法,仿真分析表明该算法不仅能获得快的收敛速度而且能获得高的建模精度。     

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

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

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