乙烯、丙烯中微量水含量的分析

采用便携式微量水分析仪和库仑法微量水分析仪测定了乙烯、丙烯试样中的微量水含量,对试样的传输系统、进样量的控制、液体试样的气化和水标准气体的制备方法进行了改进,优化了测试条件。以低吸附惰性管线和小死体积单进单出的不锈钢减压器为试样传输系统,缩短了测试时间。采用液态烃闪蒸气化取样进样器气化液体试样并准确控制试样的进样量,可避免液体试样渐次气化对水含量测定结果的影响及对采样钢瓶大小的限制。采用渗透管发生器制备水标准气体,可验证分析结果的准确度。采用库仑法微量水分析仪测定水含量时,试样流量选择600 m L/min较适宜,开封保存15 d之内的卡尔·费休试剂对测定结果无影响。采用便携式微量水分析仪测定水含量时,选择试样流量在400~800 m L/min之间较适宜。两种仪器的测量结果相近,稳定性好,准确度高,回收率在102%~107%之间,相对偏差小于10%。     

Stereo matching cost computation based on nonsubsampled contourlet transform

A new matching cost computation method based on nonsubsampled contourlet transform (NSCT) for stereo image matching is proposed in this paper. Firstly, stereo image is decomposed into high frequency sub-band images at different scales and along different directions by NSCT. Secondly, by utilizing coefficients in high frequency domain and grayscales in RGB color space, the computation model of weighted matching cost between two pixels is designed based on the gestalt laws. Lastly, two types of experiments are carried out with standard stereopairs in the Middlebury benchmark. One of the experiments is to confirm optimum values of NSCT scale and direction parameters, and the other is to compare proposed matching cost with nine known matching costs. Experimental results show that the optimum values of scale and direction parameters are respectively 2 and 3, and the matching accuracy of the proposed matching cost is twice higher than that of traditional NCC cost.     

以一种新的距离度量作为反馈的相关跟踪方法

基于相关的模板匹配方法在图像跟踪中得到了广泛的应用,但是这种方法的主要缺点是对图像噪声非常敏感,而且由这种方法得出的相关曲面比较平坦。为了有效抑制噪声和局部遮挡对图像的影响,提出用鲁棒统计中的一个值代替相关值作为距离度量。它不是计算两幅图像的对应像素差值,而是计算两幅图像中差别不大的对应像素对的个数。实验证明这样得到的曲面相对　　收稿日期:2003 08 31;　修订日期:2003 10 28作者简介:张桂林(1944 ),男,天津人,教授,博士生导师,主要研究方向为自动识别、人体生物统计特征识别、图像处理算法与系统性能评估等。　　　　　　　要尖锐得多。当上述的距离度量应用于跟踪过程中时,模板的合理更新对跟踪非常重要。基于上述的距离度量方法,提出了一种新的模板更新策略。利用两幅图像中近似像素在整修匹配模板像素中所占的比例大小决定加权系数。这种加权策略可以自适应地根据图像序列的变化选择更新相关模板,同时在一定程度上减小模板漂移的危险。     

地震平衡技术及其在地震反演中的应用

地震平衡技术是一种在地震反演中改善井震关系的新技术。它通过单井对比、空间分形建模以及平衡处理的手段 ,克服地震反演中子波空变的影响 ,使得经过地震平衡技术处理的地震剖面井震关系得到较好改善 ,从而可以用统一的子波对研究区的地震资料进行反演     

Bandpass filters using periodically loaded combline resonators

A novel combline filter is proposed for cellular‐radio base stations. The Q‐factor is significantly improved. The eigenvalue equation is expressed with the single‐team approximation in the gap region of the combline resonator. A two‐pole combline filter is designed. The calculation, simulation, and experiment results are presented and are in good agreement. © 2005 Wiley Periodicals, Inc. Int J RF and Microwave CAE, 2006.     

三维施工中SN388炮点表的设置

本文提供了SN388在三维施工中炮点表的几种设置方法，并进行了相应的对比说明，最后给出了改进炮点表设置的有关设想。     

冷轧带肋钢筋直径与拉丝机卷筒直径的匹配

采用被动式工艺生产冷轧带肋钢筋须经过减径、成型两台轧机连续轧制．要求钢材的秒流量相等，否则将造成断线停产或线材在拉丝机卷筒上打滑，致使卷筒严重磨损．用双层卷筒拉丝机提供动力生产冷轧带肋钢筋时，线材直径与卷筒直径的匹配是在一个小的调整范围，通过轧机拉力控制在一定范围变化，可保证成品尺寸符合公差要求而不产生打滑，从而避免了卷筒严重磨损．     

Empirical comparison of image retrieval color similarity methods with human judgment

It is important to verify assumptions and methods of image retrieval against actual human behavior. A study was conducted to compare similarity methods of color histograms against human assessment of similarity. The similarity methods tested include basic histogram intersection, center histogram matching, locality histogram matching, and size-weighted histogram matching. 161 subjects participated in the empirical study. The findings, based on Spearman correlation analysis, showed that both the basic histogram intersection method and size-weighted histogram are very close to human assessment of similarity (Spearman correlation coefficient of 0.915). The other two are not close to human judgment on similarity. This study illustrates an alternative approach to evaluating matching algorithms. Unlike the usual measures of recall and precision, this approach emphasizes human validation. Fewer images are required with the use of statistical testing.     

A simple approximation algorithm for the weighted matching problem

We present a linear time approximation algorithm with a performance ratio of 1/2 for finding a maximum weight matching in an arbitrary graph. Such a result is already known and is due to Preis [STACS'99, Lecture Notes in Comput. Sci., Vol. 1563, 1999, pp. 259-269]. Our algorithm uses a new approach which is much simpler than the one given by Preis and needs no amortized analysis for its running time.     

Shift-or string matching with super-alphabets

Given a text T[1…n] and a pattern P[1…m] over some alphabet Σ of size σ, we want to find all the (exact) occurrences of P in T. The well-known shift-or algorithm solves this problem in time O(n⌈m/w⌉), where w is the number of bits in machine word, using bit-parallelism. We show how to extend the bit-parallelism in another direction, using super-alphabets. This gives a speed-up by a factor s, where s is the number of characters processed simultaneously. The algorithm is implemented, and we show that it works well in practice too. The result is the fastest known algorithm for exact string matching for short patterns and small alphabets.