采用8031作主控器的时域FIR数字滤波器

长期以来，ＦＩＲ数字滤波器大多是在频域上实现。因为，在时域上实现ＦＩＲ数字滤波所遇到的首要问题，是输入信号序列与冲激响应序列的卷积运算速度难以提高。然而，随着超大规模集成电路的飞速发展，硬件集成度与运算速度获得极大的改观，在时域上实现ＦＩＲ数字滤波已成为可能。ＩＭＳＡ１００是高速、高精度３２级数字信号处理器，是完成卷积运算的理想器件。本文论证了用ＩＭＳＡ１００实现时域ＦＩＲ数字滤波器的可行性和硬件设计中的一些问题，并给出了应用举例。在设计中选用８０３１单片机做主控器，大大提高了性能价格比，使这一设计具有很高的实用价值。     

Classification of hand postures against complex backgrounds using elastic graph matching

A system for person-independent classification of hand postures against complex backgrounds in video images is presented. The system employs elastic graph matching, which has already been successfully applied for object and face recognition. We use the bunch graph technique to model variance in hand posture appearance between different subjects and variance in backgrounds. Our system does not need a separate segmentation stage but closely integrates finding the object boundaries with posture classification.     

武山铜矿主井系统延深改造及效果浅析

武山铜矿主井延深时根据新的采、选工艺要求，在前期工程的基础上，对其箕斗提升系统进行改造，增设坑内破碎。针对该矿特粘的矿石性质和前期工程遗留问题，在具体设计和实施过程中采取特别措施保证系统通畅和安全并注意节省投资。同时对尚存在的问题也提出了新的思考。     

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.     

一种联合信源信道匹配的视频传输方法

介绍了一种实现联合信源-信道编码的通用的新方法—联合信源-信道匹配。该方法思想巧妙,通过将有限的通信系统资源在信源和信道编码器之间进行巧妙合理的分配,从而获得最优的系统整体传输性能。并且,该方法并不仅局限于特定的信源-信道编码器对,可适用于任何一种信源-信道编码器对共享有限系统资源的情况,具有很好的通用性。仿真实验证明了JSCM通用视频传输系统能获得比传统的固定码率分配系统更高的整体性能增益。     

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

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

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.