It mainly introduced some basic conceptions such as the maritime search and rescue . and it also enucleated the research sense of the new search and rescue system on the changjiang river . in this part , the dissertation ascertained the dissertation ' s technical route 主要介绍水上搜救的基本慨念和水上救助的基本形式，阐明长江水上搜救的目的和重要意义，明确论文的研究方向和总体思路。
Because of inablity of the handling dead end state , ff does not perform ideally in some planning problem domains such as gripper . in this paper , a new searching method enforced hill - climbing with backtracks is used , and a new method of helpful action ordering is presented 但是, ff规划算法所采用的搜索方法和规划图的使用上都存在很大不足,使得ff规划算法在某些规划问题域中,特别是含有死点状态的问题域中表现不够理想。
The classifiers of nearest feature line and nearest feature plane share the same drawback in terms of the computation complexity under large data sample size and high dimensionality . therefore , a new search strategy based on locally nearest ne . . 针对最近特征线nfl与最近特征平面nfp分类器在大数据样本量与高维数时计算复杂度大的问题，依据局部最近邻准则，提出了一种新的搜索策略，使这两种分类器在保持较高识别率的同时，提高了算法的实时性能。
In this paper , two important modifications in dct - based coding algorithm are suggested after making deep study on the generally used scheme of h . 263 coder . first , we find plenty of invalid computation in the transformation part of the h . 263 coder and an improved scheme based on the pre - transform decision to avoid invalid computation is proposed . second , in the motion estimation part of the coder , we find that normal search algorithms are not effective , which neglects different levels of motion in image sequences , and we suggest a new search algorithm which has variable search region based on the difference of motion level . combining the pre - transform decision scheme with variable search region method in motion estimation , a global decision coding scheme is provided , which greatly increases the coding speed of h . 263 coder 本文对h . 263编码算法的现有实现方法作了深入的分析，首先发现变换部分存在大量无效运算，提出了在变换前加判决的前变换判决的编码方案，以压缩无效的变换运算；其次发现运动估计部分由于忽略了图像场景的分级运动而存在一定的无效搜索运算，提出了基于分级运动的可变搜索域法来压缩无效的搜索运算；最后将前变换判决方案与运动估计的可变搜索域法有机地结合在一起，提出了全局判决编码方案，从而比较全面地改进了现有实现方法，因而能大幅度地提高编码器的编码速度
One is combined with the maximum average error criterion and the mean square error criterion , and the other is combined with the absolute value average error criterion and the mean square error criterion . theory analysis shows that the two new search methods have less computational complexity than that of the non - optimal method 提出了两种替换原有均方误差最小准测的方法,分别是最大平均误差与均方误差最小准则相结合的搜索标准,以及绝对值平均误差与均方误差最小准则相结合的搜索标准。
This thesis contrasts and analyses the different calculation - method , and improves the genetic algorithm in the parameter inversion of the rock and soil engineering . the strategies are mainly in the following three aspects : 1 , new searching way is compositely searching genetic algorithm which is made up of the acceleration method and genetic algorithm when it partially calculates in the later time ; 2 , index function is inducted in gengetic operators , at the same time repeated select and double exchange pool are used ; 3 , splicing crossover , which reserves some new evolution factions , improves authority function accaunting the capabilities and kinds 本文对优化算法中不同求解方法进行对比分析，针对遗传算法在岩土工程参数反演运算中进行了改进，改进的策略主要集中于三个方面： 1 、提出了在遗传算法中融入形加速法的改进方法? ?复合遗传搜索法； 2 、针对遗传算子的选择策略，引入指数适值方法，设置双交换池，提出了重复筛选法； 3 、加强对劣势种群的内部优良信息的遗传功能的改进，引入权函数，扩大可交叉算子的种类，保留各算子的进化功能，提出了融合交叉运算法。
Based on this theory , a new searching algorithm is designed . in order to realize fast searching , the algorithm makes full use of the transform properties and necessary conditions of the perfect binary array pairs and quasi - perfect binary array pairs , exclude the array pairs of transform equivalence , so that reduced the searching space and amount , and improved the searching speed 为了实现快速搜索，本算法充分利用最佳二进阵列偶、准最佳二进阵列偶的变换性质和存在的必要条件，排除变换等价的阵列偶，从而缩减了搜索空间，减少了搜索数量，以达到提高搜索速度的目的。
The algorithm applies a simple clique finding and weighted coloring to determine lower and upper bounds , and actives exactly one new search tree node at each branching stage which using the information obtained in the weighted coloring to choose a branching vertex , and uses backtracking method to obtain optimum solution 该算法用团的简单启发式算法提供下界；用加权着色的启发式算法提供上界；在分支阶段，每次只产生一个新的子问题，并利用着色信息来选择分支顶点；最后利用回溯法来检验整体最优性。
This paper analyzes the system structure of traditional search engine . after research most of search engine , we promote a new frame structure to realize this system . it improves all the modules of search engine , forms a new search engine structure and try to add self learning function to make it more intelligent 本文首先分析了当前搜索引擎的系统结构,在对目前大部分搜索引擎技术研究的基础上,我们综合其设计思路,给出了一套新的信息检索系统的框架原型,它在现有搜索引擎的基础上进行了模块优化,形成了一套新的搜索引擎结构,并在传统搜索引擎的基础上增加了自学习功能。
