一种改进型自适应加权模糊均值滤波算法

针对原有的自适应加权模糊均值AWFM滤波器对局部噪声幅度估计不足的缺点。提出了一种新的改进型自适应加权模糊均值MAWFM滤波算法。该算法采用了一种新的模糊检测方法，可以同时检测各个像素点的正负向噪声幅度，从而能够建立一种新的自适应的模糊信号空间，以适应噪声在各个图像局部的变化。实验结果表明，MAWFM滤波器比以前的AWFM滤波器及传统的中值滤波器均有较优越的性能。     

马钢二烧结配料计算机控制系统

阐明了马钢二烧结配科计算机控制系统的目的、控制形式、控制原理；根据烧结配料控制对象的特点对信号采样和控制算法进行了探讨；提供了系统的主要硬件结构，软件功能和程序框图。     

A Least Squares Approach to Escalator Algorithms for Adaptive Filtering

In this paper, we introduce an escalator (ESC) algorithm based on the least squares (LS) criterion. The proposed algorithm is relatively insensitive to the eigenvalue spread ratio (ESR) of an input signal and has a faster convergence speed than the conventional ESC algorithms. This algorithm exploits the fast adaptation ability of least squares methods and the orthogonalization property of the ESC structure. From the simulation results, the proposed algorithm shows superior convergence performance.     

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

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

渤海湾盆地济阳——临清东部煤系烃源岩形成环境

钻井、地震、测井及测试资料综合研究认为:渤海湾盆地济阳—临清东部地区石炭—二叠系主要发育一套浅海碳酸盐岩台地相灰岩、障壁—潟湖、潮坪、沼泽及三角洲相陆源碎屑岩和煤层.从纵向发育的沉积特征来看,上石炭统本溪组发育浅海台地相碳酸盐岩和浅海陆棚相(陆表海)砂泥岩,太原组主要发育障壁—潟湖、潮坪、沼泽相碳酸盐岩、陆源碎屑岩和煤的混合沉积;二叠系山西组主要发育三角洲相和三角洲平原沼泽相砂泥岩及煤,下石盒子组和上石盒子组则以发育近海陆相碎屑岩沉积为主,局部有河流沼泽的泥炭和煤发育.沉积环境总体具有自下而上、由南向北由浅海相、海陆交互相逐步过渡为陆相的基本特点.成煤环境以晚石炭世—早二叠世太原、山西期潮坪、潟湖过渡带之潮坪沼泽环境及三角洲平原沼泽环境为最佳.      

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

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

取样式环空找水仪测井方法及效果评价

目前油田相当一部分产液井产液量相对较低,井下含水率高。这些特点给油井找水工作增加了很大难度,必然要求测试仪器具有适用于高含水率、低产液量的特点。取样式环空找水组合测井仪与常规过流式仪器相比,有着独特的优势,测量含水时不受井筒内流体的流速和抽油机冲程波动的影响。仪器含水测量精度可达到±5%以内,极大地提高了含水参数资料录取的准确性,对油田动态监测具有重要意义。     

RI/VI联用测定聚乙烯相对分子质量及其分布

150℃测试温度下，以1，2，4-三氯苯为溶剂，采用示差折光指数器，毛细管黏度计双检测器联用凝胶渗透色谱技术测定了聚乙烯的相对分子质量及其分布。与常规凝胶渗透色谱法对比，该方法不仅能直接得到聚乙烯较精确的相对分子质量和分布形态，同时可以得到聚乙烯的特性黏数分布。     

基于两层均匀媒质的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.