智能搜索引擎实例分析

通过实例认真分析了目前中文搜索引擎技术的状况，并对现有先进的信息检索手段，人工智能、中文自然语言处理等技术进行了有力的描述，在此基础之上，对提出的以有序的知识库对无序的知识库的一个全新智能搜索引擎进行了实例分析。     

基于特性关联网络模型的机械产品工程更改传播路径搜索方法

产品开发过程中的工程更改是不可避免的,工程更改的传播会导致开发过程复杂性增加、成本和风险增大。更改传播路径的研究将支持工程更改的决策和方案的优选,降低设计风险和成本。在梳理机械产品工程更改传播基本过程的基础上,分析工程更改与产品特性间的关系,确立基于特性关联网络模型实现更改传播路径搜索的研究路线;提出由更改影响传播路径搜索算法、更改路由路径搜索算法、可行路径方案评价和优选算法三部分组成的路径搜索方法。构建基于特性更改影响域分析的更改影响传播路径搜索算法;实现基于不同选择策略下可行路由分支选择的更改路由路径搜索;并依据更改传播范围、更改影响、更改代价等属性进行路径方案的评价和优选。通过离合器工程更改实例验证该方法的可行性。     

Longest-match string searching for ziv-lempel compression

Ziv-Lempel coding is currently one of the more practical data compression schemes. It operates by replacing a substring of a text with a pointer to its longest previous occurrence in the input, for each coding step. Decoding a compressed file is very fast, but encoding involves searching at each coding step to find the longest match for the next few characters. This paper presents eight data structures that can be used to accelerate the searching, including adaptations of four methods normally used for exact matching searching. The algorithms are evaluated analytically and empirically, indicating the trade-offs available between compression speed and memory consumption. Two of the algorithms are well-known methods of finding the longest match—the time-consuming linear search, and the storage-intensive trie (digital search tree). The trie is adapted along the lines of a PATRICIA tree to operate economically. Hashing, binary search trees, splay trees and the Boyer-Moore searching algorithm are traditionally used to search for exact matches, but we show how these can be adapted to find longest matches. In addition, two data structures specifically designed for the application are presented.     

分枝限界法的实现及改进方案

分枝限界算法是一种组合搜索的常用方法，本文以具体实例介绍了该方法的基本原理，并对其加以改进，使该算法的效率得到提高。     

一种改进的三维递归搜索视频去隔行算法

提出了一种改进的三维递归搜索（3DRS）视频去隔行算法，该算法使用双向参考运动估计，消除了原始算法中的误差传递现象，并采用多分辨率分析的思想，根据视频内容自适应的调节误差匹配块尺寸，提高了运动估计的准确度。实验结果表明，对于大多数测试序列，该算法在实验效果上取得了优于原始的3DRS算法的性能。     

Hash-bucket search: A fast technique for searching an english spelling dictionary

When a document is prepared using a computer system, it can be checked for spelling errors automatically and efficiently. This paper reviews and compares several methods for searching an English spelling dictionary. It also presents a new technique, hash-bucket search, for searching a static table in general, and a dictionary in particular. Analysis shows that with only a small amount of space beyond that required to store the keys, the hash-bucket search method has many advantages over existing methods. Experimental results with a sample dictionary using double hashing and the hash-bucket techniques are presented.     

基于一种SIFT优化算法的图像检索

提出了一种基于优化后的SIFT图像检索算法,该算法采用高斯核尺寸自适应的方法来构建金字塔影像,降低其计算复杂度,然后按照传统步骤进行提取特征。它将一幅图像转换成特征向量的集合,通过计算两幅图像特征向量间的欧氏距离来度量图像间的相似性,并且采用BBF搜索算法来提高检索速度。实验结果表明,该改良后的算法具有尺度、平移、旋转不变性,一定的仿射、光照不变性,以及对特定形状特征目标的检索,无论在时间还是效率上都具有相当的优越性。     

Analysis and visualization of rotation searching efficiency in two-round rotation based magnetic tracking

A magnetic sensor attaching on the moving object will have a maximum intensity measurement when the rotating magnetic field is pointing at it. Before solving the position and orientation, the magnetic field could be rotated in two orthogonal planes to find the maximal pointing direction. In order to realize a real-time tracking, efficient searching strategies for this maximum-oriented magnetic field rotation must be provided. This paper sets up a novel rotation searching efficiency model to quantitatively evaluate the relationship between the rotation searching time and the rotation axis in the two-round rotation based magnetic field measurement. Based on this model, two searching strategies are proposed. Simulation results suggest that both searching strategies can realize full space tracking without any latency larger than 30 ms. Corresponding system platform is under development.     

反潜直升机多段往返检查搜潜建模与仿真技术研究

潜艇因其隐身性,在水下很难被发现.本文根据反潜直升机利用吊放声呐搜潜的战术应用,对可疑区域进行快速有效地检查搜索.建立了应用于单机检查搜潜的多段往返搜潜模型.并结合水下潜艇的航行,对搜索过程进行仿真,分析了吊放声呐探测点间隔系数对模型搜潜概率的影响,为区域检查搜潜战术制定提供了参考.