A new reverse reduce-error ensemble pruning algorithm

Although greedy algorithms possess high efficiency, they often receive suboptimal solutions of the ensemble pruning problem, since their exploration areas are limited in large extent. And another marked defect of almost all the currently existing ensemble pruning algorithms, including greedy ones, consists in: they simply abandon all of the classifiers which fail in the competition of ensemble selection, causing a considerable waste of useful resources and information. Inspired by these observations, an interesting greedy Reverse Reduce-Error (RRE) pruning algorithm incorporated with the operation of subtraction is proposed in this work. The RRE algorithm makes the best of the defeated candidate networks in a way that, the Worst Single Model (WSM) is chosen, and then, its votes are subtracted from the votes made by those selected components within the pruned ensemble. The reason is because, for most cases, the WSM might make mistakes in its estimation for the test samples. And, different from the classical RE, the near-optimal solution is produced based on the pruned error of all the available sequential subensembles. Besides, the backfitting step of RE algorithm is replaced with the selection step of a WSM in RRE. Moreover, the problem of ties might be solved more naturally with RRE. Finally, soft voting approach is employed in the testing to RRE algorithm. The performances of RE and RRE algorithms, and two baseline methods, i.e., the method which selects the Best Single Model (BSM) in the initial ensemble, and the method which retains all member networks of the initial ensemble (ALL), are evaluated on seven benchmark classification tasks under different initial ensemble setups. The results of the empirical investigation show the superiority of RRE over the other three ensemble pruning algorithms.     

Acquisition and pattern recognition of spectrum information of welding metal transfer

With the creation of a pattern recognition system for metal transfer mode, this article has collected five kinds of spectrum signals in gas metal arc welding (MIG, MAG and CO₂) and take them as training samples. These samples have been pretreated by computer, several key characteristic parameters of the spectrum signal have been creatively extracted, and a corresponding recognition function and a minimum-distance-classifier have been constructed. The results show that the pattern recognition of several kinds of metal transfer modes for the metal gas arc welding can be done successfully, and relative important parameters in welding process, such as the frequency of droplet transfer and the approximate diameter of each droplet, can also be obtained.     

薄板坯连铸工艺液芯压下的有限元分析

简要介绍世界几种主要薄板坯连铸工艺。着重叙述应用大型通用商业软件MSC.MARC。模拟液芯压下时铸坯的变形，确定最佳压下方案的有限元分析，液芯压下应该在结晶器出口处及二冷区扇形段开始部分进行，这样能减小铸坯的应变。     

Pattern expressions and pattern automata

We define the pattern expressions as an extension of both regular expressions and patterns. We prove several properties of the new family of languages, similar to those of extended regex languages [Câmpeanu et al., Int. J. Found. Comput. Sci. 14 (6) (2003) 1007-1018]. We also define an automata system that recognizes these languages. Differences between regex and pattern expressions are also discussed.     

红外化学遥感数字信号处理算法的研究进展

介绍了几种为远距离红外蒸汽信号监测开发的分类器设计，频域数字滤波，时域数字滤波等数字信号处理技术。对线性分类器，分段线性分类器和神经网络分类器等在红外化学遥感系统中的应用做了初步的探讨。对背景扣除技术，频域数字滤波技术，数字滤波的切趾方法等做了简要的描述。阐述了时域滤波技术的基本原理及实际应用。展望了红外化学遥感数字信号处理算法的研究前景。     

地震资料精细处理和解释在徐家围子油田的应用

以地震资料精细处理和解释在大庆长垣外围徐家围子油田开发中的成功应用为例，论述了地震地质综合描述技术在地质情况复杂的低、特低渗透油田开发中的应用效果。     

语音识别算法的确定与实现

在语音识别的实验中，对几种算法方案进行了比较、分析和择优淘劣，标准是在一定词汇量的条件下，权衡占用机器的内存空间、（正确）识别率和响应速度。力争使与话者有关的单词语音识别系统的设计达到优化，取得满意的结果。本文即是此项实验的总结。     

A pattern recognition-based approach for phylogenetic network construction with constrained recombination

The tree representation of evolutionary relationship oversimplifies the view of the process of evolution as it cannot take into account the events such as horizontal gene transfer, hybridization, homoplasy and genetic recombination. Several algorithms exist for constructing phylogenetic networks which result from events such as horizontal gene transfer, hybridization and homoplasy. Very little work has been published on the algorithmic detail of phylogenetic networks with constrained recombination. The problem of minimizing the number of recombinations in a phylogenetic network, constructed using binary DNA sequences, is NP-hard. In this paper, we propose a pattern recognition-based O(n²) time approach for constructing the phylogenetic network, where n is the number of nodes or sequences in the input data. The network is constructed with the restriction that no two cycles in the network share a common node.     

Orientation-based unique representation for planar curves and shapes

This paper presents an orientation-based representation for planar curves and shapes. The new representation can uniquely represent all types, of planar shapes, be it convex, nonconvex, polygonal, smoothly curved, or piecewise smooth shapes. It is based on a new parameterization, theabsolute integral orientation. This representation is invariant under translation and rotation. The absolute integral orientation is a parameter invariant under scaling. As a result, matching of similar shapes (i.e., determination of the relative orientation and the scaling factor) using the absolute integral orientation as the parameter is easier than using the arclength as the parameter. In addition, the new representation has the feature of adaptive sampling, making it more compact and efficient than arc-length-based representations.     

微机传真系统

本文介绍了集传真技术、通信技术、微型计算机技术于一体的微机传真系统，提出了微机传真系统在硬件接口及报表识别上的实现方法。