现代信息检索理论架构研究

信息作为一种新的资源,对当代经济和社会的发展起着非常重要的作用,如何高效快捷地利用现代信息是当前我国信息检索领域研究的重要问题。阐述了现代信息检索理论架构研究的前提,分析了当前主要的信息检索理论,探讨了网络信息检索的主要方法。     

一种基于用户偏好和反馈的页面排序技术

传统的排名方法没有考虑用户的喜好、反馈和用户兴趣,很难满足用户的个性化需求.针对这个问题,提出一种新的网页排名方法,将网页的相似度、链接结构信息、用户偏好及用户反馈相结合进行页面排名.实验结果表明,改进的排序算法在一定程度上帮助用户提高检索网页的质量,最大限度地满足用户的需求.     

导航系统视觉快速跟踪方法

提出了一种图象搜索的方法 ,适用于变化的环境 ,通过灰度值偏移校正二维阈值化和噪声滤波的方法能有效排除由于光源所引起的各种干扰 .本方法处理速度快 ,满足自引导车实时跟踪和导航的需要     

电子超市易用性评估及链接结构优化模型

用无权有向图来描述网站结构，提出以网站是否方便顾问访问相关商品网页为标准的网站评估方法，建立了一种网站结构优化的数学模型，并采用禁忌搜索算法（TS）对问题进行求解，通过一个随机网站结构的例子，说明更新算法比布尔矩阵乘法以及重复调用广度优先算法进行TS领域搜索具有更高的效率，实例研究表明所述方法可以帮助网站设计者通过减少量的链接得到更加方便顾客使用的网站结构。     

Subset threshold autoregression

We develop in this paper an efficient way to select the best subset threshold autoregressive model. The proposed method uses a stochastic search idea. Differing from most conventional approaches, our method does not require us to fix the delay or the threshold parameters in advance. By adopting the Markov chain Monte Carlo techniques, we can identify the best subset model from a very large of number of possible models, and at the same time estimate the unknown parameters. A simulation experiment shows that the method is very effective. In its application to the US unemployment rate, the stochastic search method successfully selects lag one as the time delay and five best models from more than 4000 choices. Copyright © 2003 John Wiley & Sons, Ltd.     

包含式完全正则(T*3(1/2))是相对可乘的

本文讨论包含式完全正则空间（T31/2^＊）关于相对积拓扑的可乘性问题．     

障碍可越路线规划的符号图方法

本文给出２—Ｄ路线规划问题在障碍可越情况下的启发式符号方法．这一方法利用推理规则在由图像信息导出的连通图知识结构上进行启发式符号Ａ搜索以对空间关系进行分析和分类，以符号描述形式给出两声间路线规划方案．     

On Vector Quasi-Variational Inequality Problems in H-Space

The purpose to this paper is to study the existence problem of solutions to the vector quasi-variational inequality for vector-valued functions in H-space.     

Distributed and Parallel Component Library

Software component library is the essential part of reuse-based software development. It is shown that making use of a single component library to store all kinds of components and from which components are searched is very inefficient. We construct multi-libraries to support software reuse and use PVM as development environments to imitate Iargescale computer, which is expected to fulfill distributed storage and parallel search of components efficiently and improve software reuse.