不匹配

Targeted at maximizing the market surplus, we established both a fixed merchandise combination model and an uncertain merchandise combination auction model. A "queue list" method is put forward to solve the fixed merchandise combination vector's auction model, and discussed the pricing methods of different final prices. Additionally, we discussed the auction contract-matching algorithm of the unit combinations vector.

以市场盈余最大为目标建立常商品组合向量的拍卖模型和不确定商品组合向量的拍卖模型，提出"队列表"法求解常商品组合向量的拍卖模型，讨论不同成交价的定价方法，并对只有两种商品组合的不确定商品组合向量的拍卖进行拍卖合同的匹配分析，讨论了单位商品组合向量的拍卖的合同匹配算法。

Filter-based matching algorithm uses a bank of Gabor filters to capture both local and global details in a fingerprint as a compact fixed length Feature Vector. Invariant-moment matching algorithm is used to overcome the deformation in fingerprint.

用一组Gabor滤波器获取指纹图像的局部信息和全局信息，并表示成简洁的指纹滤波特征向量，用于滤波特征匹配；针对指纹图像中存在的三种形变，采用图像的不变矩算法进行不变矩的匹配。

This algorithm only need to ransack all pixels in the matching window one time,and the calculating process is simplified with no change to the matching accuracy.

该算法不仅只需遍历待匹配窗口和模板的像素一次，而且在不改变匹配精度的同时简化了计算过程。

At every step only one subpattern is used to perform pattern matching, and a part of reference patterns which have less distances to the unknown pattern are retained to match further in the next step.

这样使匹配过程加快三倍以上。文中给出了在语言识别方面的实验结果。采用二种淘汰办法，它们在前三级上的淘汰率分别是：3/4，1/2，1/2；9/10，1/2，1/2。这二种办法所需的图样匹配时间分别是0.359T_0和0.294T_0，T_0——是完整的匹配过程所需的时间，而正确率几乎不下降。

In this algorithm, the strongest corner points is adaptively detected with Harris operator and (2n+1)×(2n+1) feature windows is selected for originally mutual gray correlative matching. Continental distance ratio invariant criterion is proposed, and consistency of motion vector is improved by eliminating error matching points with median filter. 9 pairs right points is preserved, 4 pairs composing 1 group, and 5 groups is random distributed to uncoil the motion vector equations. Last, stabilization precision is improved by averaging the 5 groups' solutions.

该方法用Harris算子自适应检测出最强壮的角点，开辟(2n+1)×(2n+1)特征窗进行灰度互相关初匹配；提出欧式距离之比不变准则，通过中值滤波剔除误匹配点，确保运动矢量较高的一致性；最后保留若干正确的匹配点对，分成多组解运动矢量方程，将多组解的平均值作为全局运动矢量以提高稳像精度。

Continental distance ratio invariant criterion is proposed,and consistency of motion vector is improved by eliminating error matching points with median filter.9 pairs right points is preserved,4 pairs composing 1 group,and 5 groups is random distributed to uncoil the motion vector equations.Last,stabilization precision is improved by averaging the 5 groups′ solutions.

该方法用Harris算子自适应检测出最强壮的角点，开辟(2n+1)×(2n+1)特征窗进行灰度互相关初匹配；提出欧式距离之比不变准则，通过中值滤波剔除误匹配点，确保运动矢量较高的一致性；最后保留若干正确的匹配点对，分成多组解运动矢量方程，将多组解的平均值作为全局运动矢量以提高稳像精度。

But because of undistinguishable feature region or no feature region, the matching will be defeated. Then we design another method to find out the based point. It is taken as matching template.

一旦因为特征不明显而造成特征匹配失败，接着就进行基于点的匹配，通过采样到的基本点作为模板来完成图像间的匹配过程。

Based on the analysis of video retrieval issues among different time scales, such as retrieval between re-edit video (speed forward or slow-motion) or original video and different frame rate videos,this paper proposed a novel dynamic time warping optimal matching algorithm.

针对不同时间尺度视频间的匹配问题，如人为再编辑视频与原始视频间的匹配以及不同帧率视频间的检索等，提出了一种基于动态时间规划的最优匹配算法。

Traditional page clustering algorithm based on DOM tree edit distance is not suitable for the complex Document Object Model tree structure pages created from dynamic templates. In this paper, an improved Web page clustering algorithm was proposed based on partial tag tree matching. In the proposed algorithm, the appropriate weights were assigned to the nodes according to their effects on the layout of Web pages and the level difference between template nodes and non-template nodes.

传统的基于DOM树编辑距离的网页聚类算法不适合文档对象模型树结构复杂的动态模板网页，提出了一种基于局部标签树匹配的改进网页聚类算法，利用标签树中模板节点和非模板节点的层次差异性，根据节点对布局影响的大小赋予节点不同的匹配权值，使用局部树匹配完成对网页结构相似性的有效计算。

Because of the false star existence, the biggest polygon is not necessarily the optimum match, this study introduced the concept of voting algorithm to the stars of the matched star triangles, the star polygon who takes stars with high match rate as a right identification, thus removed the false star disturbance.

因为有伪星的存在，此时的最大多边形不一定是最佳匹配，本研究引入了投票算法的理念，对组成星三角的导航星进行匹配率统计，选取匹配率高的星多边形作为正确识别，从而排除了伪星的干扰。

Do you know, i need you to come back

你知道吗，我需要你回来

Yang yinshu、Wang xiangsheng、Li decang,The first discovery of haemaphysalis conicinna.

1〕 杨银书，王祥生，李德昌。安徽省首次发现嗜群血蜱。