基于进化策略的抽题算法设计

基于进化算法的工作原理，设计了智能试题库系统中的抽题算法，提出了基于进化策略的抽题系统的数学模型，分析了算法的设计方案，该算法在全局寻优过程中收敛速度快，效率较高，具有良好的用户适用性，测试结果表明该系统能根据用户期望进行智能抽题。     

具有子串检索功能的可扩展分布式数据结构

EH*S是可扩展分布式数据结构EH*的一个改进，增加了子串检索功能。通过对子串和关键字计算描述符向量，为EH*文件中的每个桶添加一个桶描述符向量，然后把子串描述符向量分别与关键字和桶的描述符向量进行比较，得到包含子串的关键字集。     

用边缘金字塔结构实现Hausdorff距离匹配

为了快速准确地在海量图像中搜索模板的所有实例，提出运用边缘金字塔结构来实现Hausdorff距离匹配．根据模板的边缘自适应地确定边缘金字塔分解次数和抽取模式，然后通过金字塔结构的引导搜索策略实现快速匹配．对以水平和垂直边缘为主的集成电路显微图像，文中算法体现出优越的匹配性能．在集成电路显微图像和一般图像上分别测试的实验结果表明：文中算法在获得良好的匹配效果的同时，大幅减少了匹配时间．     

铅锌烧结过程智能集成优化控制技术

针对复杂的铅锌烧结过程。提出了基于神经网络和模糊专家规则模型的自学习模糊专家控制方法进行状态参数优化，基于神经网络模型的模糊C均值聚类搜索混沌遗传算法进行综合指标参数优化．智能集成优化控制技术具有高效性和实用性，有效地抑制了工况波动，提高了烧结矿产量和质量，取得了较好的工业控制效果．     

自然语言理解与智能检索

智能信息处理是中文信息处理中的重要课题,尤以智能检索和信息获取为重要.而自然语言处理和理解技术是智能信息处理的核心.本文讨论了自然语言理解应用于智能检索和信息获取的若干问题,阐述了标注!完善基于词典的知识库的处理手段.     

基于递进制编码的遗传算法研究

首先分析了编码的进制数对遗传算法收敛速度的影响．分析结果表明，当种群不稳定时，高进制编码较低进制编码具有更快地搜索至最优区域的能力，当种群较为稳定时，低进制编码较高进制编码具有更快地逼近最优点的能力．然后提出了基于递进制的遗传算法，该算法能提高优化问题的收敛速度，在优化参数较多时，与单一进制编码的遗传算法相比具有明显的优势．仿真实例也验证了这一结论．     

一种快速的字符串匹配算法

字符串匹配技术在许多领域里广泛应用，本文在分析了BF、BM算法以及一些重要的改进算法的基础上，提出了一种新的改进算法——BMH2C，该算法利用两个字符计算右移量并保存在二维数组里，使右移量增大，比较次数减少，有效地提高了匹配速度．最后本文还给出了几种匹配算法的测试结果。     

移动焊接机器人的坡口自寻迹及算法实现

介绍了具有自寻迹功能的移动焊接机器人的系统组成，在分析移动机器人运动学模型的基础上，讨论了机器人坡口自寻迹的算法以及实现过程，最后重点分析了自寻迹过程中的轨迹规划．试验结果表明：研制的移动焊接机器人能成功地完成焊前的自寻迹任务，误差精度可控制在±1.5mm左右，满足实际焊接工程需要．     

A Conjecture on Wiener Indices in Combinatorial Chemistry

Drugs and other chemical compounds are often modeled as polygonal shapes, where each vertex represents an atom of the molecule, and covalent bonds between atoms are represented by edges between the corresponding vertices. This polygonal shape derived from a chemical compound is often called its molecular graph, and can be a path, a tree, or in general a graph. An indicator defined over this molecular graph, the Wiener index, has been shown to be strongly correlated to various chemical properties of the compound. The Wiener index conjecture for trees states that for any integer n (except for a finite set), one can find a tree with Wiener index n. This conjecture has been open for quite some time, and many authors have presented incremental progress on this problem. In this paper we present further progress towards proving this conjecture—through the design of efficient algorithms, we show that enumerating all possible trees to verify this conjecture (as done by all the previous approaches) is not necessary, but instead searching in a small special family of trees suffices, thus achieving the first polynomial (in n) time algorithm to verify the conjecture up to integer n. More precisely, we (i) present an infinite family of trees and prove various properties of these trees, (ii) show that a large number of integers, up to at least 10⁸ (compared with the previous best 10⁴) are representable as Wiener indices of trees in this succinct family, (iii) provide several efficient algorithms for computing trees with given Wiener indices, and (iv) implement our algorithms and experimentally show that their performance is asymptotically much better than their theoretical worst-case upper bound.     

Answering similarity queries in peer-to-peer networks

A variety of peer-to-peer (P2P) systems for sharing digital information are currently available and most of them perform searching by exact key matching. In this paper we focus on similarity searching and describe FuzzyPeer, a generic broadcast-based P2P system which supports a wide range of fuzzy queries. As a case study we present an image retrieval application implemented on top of FuzzyPeer. Users provide sample images whose sets of features are propagated through the peers. The answer consists of the top-k most similar images within the query horizon. In our system the participation of peers is ad hoc and dynamic, their functionality is symmetric and there is no centralized index.