一种针对有机分子的新式子结构匹配法——树状结构数据匹配

提出一种针对有机分子的新的子结构匹配方法 ,子结构采用树状结构数据表示 ,方法简单灵活 ,匹配快速准确。     

音乐数据库的基于内容检索及一种基于ICA算法的按调查询系统的提出

目前音频数据库的研究相对于图象处于滞后,文中侧重音乐角度,结合MPEG标准和基于内容检索的应用,综述了音频检索的研究现状,分析了音频方面研究的特殊性和相关应用中的问题;并提出基于独立分量分析（ICA）的按调查询（QBH）的系统,较好地解决了特征提取中的鸡尾酒会效应问题。系统的查询结果置于三维声效环境中加速了查询。     

On Similarity Measures for Multimedia Database Applications

A multimedia database query consists of a set of fuzzy and boolean (or crisp) predicates, constants, variables, and conjunction, disjunction, and negation operators. The fuzzy predicates are evaluated based on different media criteria, such as color, shape, layout, keyword. Since media-based evaluation yields similarity values, results to such a query is defined as an ordered set. Since many multimedia applications require partial matches, query results also include tuples which do not satisfy all predicates. Hence, any fuzzy semantics which extends the boolean semantics of conjunction in a straight forward manner may not be desirable for multimedia databases. In this paper, we focus on the problem of ‘given a multimedia query which consists of multiple fuzzy and crisp predicates, how to provide the user with a meaningful overall ranking.’ More specifically, we study the problem of merging similarity values in queries with multiple fuzzy predicates. We describe the essential multimedia retrieval semantics, compare these with the known approaches, and propose a semantics which captures the retrieval requirements in multimedia databases. Received 13 August 1999 / Revised 13 May 2000 / Accepted in revised form 26 July 2000     

Finding a minimal cover for binary images: An optimal parallel algorithm

Given a black-and-white image, represented by an array of n × n binary-valued pixels, we wish to cover the black pixels with aminimal set of (possibly overlapping) maximal squares. It was recently shown that obtaining aminimum square cover for a polygonal binary image with holes is NP-hard. We derive an optimal parallel algorithm for theminimal square cover problem, which for any desired computation timeT in [logn,n] runs on an EREW-PRAM with (n/T) processors. The cornerstone of our algorithm is a novel data structure, the cover graph, which compactly represents the covering relationships between the maximal squares of the image. The size of the cover graph is linear in the number of pixels. This algorithm has applications to problems in VLSI mask generation, incremental update of raster displays, and image compression.The research reported here forms part of the author's doctoral dissertion, submitted to Cornell University in May 1989. This work was partially supported by NSF Grant DC1-86-02256, IBM Agreement 12060043, and ONR Contract N00014-83-K-0640. A preliminary version of this paper was presented at the 26th Annual Allerton Conference on Communications, Control, and Computing, Monticello, IL, September 28–30, 1988.     

基于模糊核聚类的鲁棒性基础矩阵估计算法

提出一种基于模糊核聚类的鲁棒性基础矩阵估计算法。算法提取匹配点的余差作为特征,利用核函数将一维非线性可分特征映射到高维可分空间,在高维特征空间利用模糊均值分类将匹配点分为内点集和外点集;用高斯函数分别对已分类的内点集和外点集进行建模,定义并计算两类高斯分布的可分性判定值;判断该判定值是否收敛,如未收敛则以内点集作为初始值重新迭代计算。模拟数据和真实数据的基础矩阵估计实验表明,本文算法在计算效率和精度上均优于经典的随机抽样一致性算法。     

基于功率匹配的水平定向钻节能控制系统研究

以节能为出发点,通过对水平定向钻功率匹配的分析,研究了将液压泵的最大功率曲线设定在发动机的输出功率曲线之上的功率匹配原理.控制系统检测外负载的变化,输出控制信号调节液压泵的排量,使液压泵在外负载大幅变化时仍可以完全吸收发动机输出的功率,确保发动机维持在设定的转速下运行,实现了充分发挥发动机功率和节能的目的.建立了水平定向钻AMESim仿真模型,研究了PID控制器在节能控制系统上的应用.仿真及试验结果表明,发动机转速波动均控制在50 r.min-1内,有效地减少了功率损失.     

基于网络心理挖掘的个性化推荐系统

传统的电子商务推荐系统挖掘时效性较差,客户信息浪费较多;为应对这些问题,提出了基于网络心理挖掘的商品推荐系统.该系统通过网站内的商品属性心理特征挖掘和客户心理行为进行挖掘,并结合客户浏览行为对客户的需求和决策进行量化与预测;最终以上述信息为依据,从系统的数据库中提取推荐商品与客户信息.实验表明,该系统能够较好地挖掘客户消费心理,提高商品推荐的精准性和有效性.     

关联规则挖掘在乒乓球比赛技战术分析中的应用

介绍关联规则挖掘技术在乒乓球比赛技战术分析中的应用.以世界排名前6位的王皓和柳承敏比赛的技战术数据为挖掘对象,采用脚本描述方法对比赛技战术数据进行采集,利用关联规则挖掘中的Apriori算法,寻找比赛中技战术之间的关联关系,从而为教练员的指导和决策提供科学依据.     

超长PN码的延迟–等待直接捕获方法

提出了一种新的直序扩频体制卫星导航定位系统中超长PN码序列的快速直接捕获方法，即通过估计本地与卫星时间偏差来确定延迟时间，从而预置本地伪码的“延迟一等待”捕获法。文章深入分析了该方案实现的主要技术细节和捕获性能。     

金融信用风险评估系统的实现和探讨

介绍了一种基于案例推理和规则推理机制的金融机构信用风险评估系统，结合了2种推理方法的优点，实现了企业信用风险的评估，讲解了该系统中CBR的研究、案例匹配相似度算法，提出了改进的最短距离算法和最短距离算法，介绍了CBR的维护方法——施加控制案例的添加和折半案例的删除方法，指出了该系统中存在的问题和进一步的研究方向。