查询词典 matching problem

In this paper, we have proposed a flexible encryption blocks selection buyer-seller watermarking protocol integrated the RSA asymmetric encryption system and homomorphism mechanism to protect the ownership of digital contents and fit real life. And consider the secondhand transaction in the real life. We also propose a buyer-reseller watermarking protocol based on the flexible encrypt blocks selection buyer-seller watermarking protocol to offer a solution of secondhand transaction. In our scheme, it's more light data transport requirement than other schemes. All roles in protocol will benefit by their participation. Our scheme can overcome various of the known attacks and security problems in the buyer-seller watermark protocol, such as buyer's right problem, unbinding problem, piracy tracing problem, conspiracy problem, buyer's participation in the dispute resolution problem, man-in-the-middle attack problem and anonymous problem. Furthermore, the seller and arbiter can verify the buyer's watermark without decrypting it in our scheme.

本文除应用RSA非对称式加密与秘密同态机制，提出了一个符合现实生活中买卖交易行为、可弹性调整加密范围数位内容买卖浮水印协定，强化了目前研究中对於数位内容买-卖浮水印协定的安全性，并进一步的考量二手商品交易行为，在可弹性调整加密范围数位内容买卖浮水印协定基础上，提出一个结合数位内容二手买卖与盗版追踪的二手数位内容买卖浮水印协定，达到让参予买卖的角色可以在安全的情形下完成二手数位内容所有权的移转并从中获取相对应利益的目标的数位内容转卖浮水印协定来增强了目前数位内容买卖浮水印协定研究中对於二手交易欠缺之处，解决了数位内容买卖浮水印协定中所可能遭遇的重要安全性议题，如：买方权益、盗版追踪、资讯不连结、共谋、买方需要参与仲裁、中间者攻击及匿名性问题。

By combining the correspondence problem and the position and orientation estimation problem together to perform bundle optimization, the matching of the light-spot image points and the spatial light-emitting-spots of the light-probe could be completed, respectively, in order to achieve the stereo matching of the light-spot image points in the left and right images.

通过将对应匹配和位姿估计融合在一起，进行捆绑迭代寻优，分别完成左右两幅图像中光斑图像点与空间光笔光斑的对应匹配，从而实现了左右两幅图像中对应光斑图像点的立体匹配。

We transform the redundant via insertion problem into a mixed bipartite-conflict graph matching problem, and present a novel heuristic minimum weighted matching algorithm to solve it.

我们把插入多余贯穿点的问题转换成混合二部碰撞图形的匹配问题，并提出一个新颖的启发式最小加权匹配演算法去解决此问题。

Based on periodic Daubechies wavelet coefficients feature of the description function, the global matching problem and the local matching problem of the contour curve are discussed.

摘要利用形心点和Aggarwal的形殊点，定义了轮廓形状的描述函数和起始点，并运用描述函数的Daubechies周期小波系数特征，讨论了闭合轮廓曲线的整体匹配和局部匹配问题。

A novel hybrid algorithm, which combines predictor-corrector primal-dual interior point method and genetic algorithm, is presented for dynamic and static reactive optimization in this dissertation. The algorithm fully make use of the advantage of interior point method in solving successive optimization problem and the advantage of genetic algorithm in solving discrete optimization problem. The original problem is divided into three parts: total successive problem, discrete problem and successive problem.

结合内点法和遗传算法，本文提出了一种新颖的混合算法用于求解动、静态无功优化问题，算法充分利用了内点法易于求解连续优化问题和遗传算法易于求解离散优化问题的优势，将原优化问题分解为初步的连续优化问题、离散变量优化问题、连续变量优化问题这三个子问题分别求解。

After a further analysis based on the empirical results,a trial probe on the cognitiveprocessing mechanism of the problem representation of the word problem in two types of MLDwas made by the author.The MRD performed much poorer than the MLD only in the mostdifficult equation listing of word problem and the medium and most difficult problemrepresentation of word problem,which showed no difference in computation and comprehensionof simple meaning of the problem,but the gap between two types of MLD became wide as afunction of difficulty and cognitive loading.It indicated that the MLD only had some advantage over MRD for they used more cognitive skills to solve the problem.

基于以上实验的结果，对两类数学困难小学生的应用题问题表征的认知机制作如下推断：混合型数学困难学生仅在高难度水平的应用题列式成绩和中高难度水平应用题问题表征水平上比单纯型数学困难学生得分显著低下，表明两类数学困难小学生在计算能力与理解简单题意的能力上并无差异，但随着难度提高，认知负荷加重，两类数学困难学生在应用题解题上的差异得以突显，表明当需要运用更多的认知能力解决问题时，单纯型数学困难学生比混合型困难学生更具优势。

The proposed algorithm does not need complex hash operation, and the matching pointer does not need backdate during matching. Theoretic analysis and experimental results demonstrate that the proposed algorithm efficiently solves the space expansion problem, and process mixed Chinese and English text correctly and efficiently with lower time and space complexity.

理论分析与实验结果表明，所提出的算法在匹配中无需复杂的哈希运算，不需要回溯匹配指针，在中英文混合环境下能够进行正确、高效的匹配，而且不存在空间膨胀问题，具有较低的空间与时间复杂度，有较大理论与应用价值。

An improved Boolean matching algorithm based on transforming the mapping between Boolean variables into the problem of perfect matching of bipartite graph is presented.

引 言布尔匹配的概念最初是由Mailhot和 de Micheli提出的[1] ，它主要用于集成电路设计中的工艺映射阶段。

Though it can not avoid the problem of image ergodicity, it can decrease the image matching calculation and reduce the computation time of the matching algorithm.

可以通过"子模板"的匹配实现对图像目标的识别与跟踪，虽然同样存在图像匹配遍历问题，但可大大减少图像匹配的计算量，减少图像匹配的计算时间。

It is difficult to resolve the problem of address name diversity by traditional method of character words matching and dictionary or gazetteer matching.

传统的特征字匹配和字典匹配方法，难以解决地址要素命名的多样性问题。

The system can be widely used in belt weighing and batching process control,etc.

介绍了基于智能模糊控制的嵌入式配料系统的设计方法，对模糊PID控制过程和系统调零作了重点的讨论，同时给出了PID控制的程序流程图和系统定长调零子程序。

"I dunno," she answered,"but if you show me aroun', I'll recognize it from the lighthouse just outside the porthole."

"我不知道，"她回答说，"如果你能带我转转，我能认出来的，因为灯塔就在舷窗外。"