最长公共子序列算法的分析与实现

本文首先分析最长公共子序列的特点,利用动态规划法求出最长公共子序列的长度数组和状态数组并通过矩阵搜索求出所有有效的跳跃点,构造了求解所有最长公共子序列的算法并通过程序给予实现。算法能有效避免重复搜索,时间效率大大提高,特别适用于基因工程中的基因片段分析。     

Rank hash similarity for fast similarity search

The paper is concerned with similarity search at large scale, which efficiently and effectively finds similar data points for a query data point. An efficient way to accelerate similarity search is to learn hash functions. The existing approaches for learning hash functions aim to obtain low values of Hamming distances for the similar pairs. However, these methods ignore the ranking order of these Hamming distances. This leads to the poor accuracy about finding similar items for a query data point. In this paper, an algorithm is proposed, referred to top k RHS (Rank Hash Similarity), in which a ranking loss function is designed for learning a hash function. The hash function is hypothesized to be made up of l binary classifiers. The issue of learning a hash function can be formulated as a task of learning l binary classifiers. The algorithm runs l rounds and learns a binary classifier at each round. Compared with the existing approaches, the proposed method has the same order of computational complexity. Nevertheless, experiment results on three text datasets show that the proposed method obtains higher accuracy than the baselines.     

A study of results overlap and uniqueness among major Web search engines

The performance and capabilities of Web search engines is an important and significant area of research. Millions of people world wide use Web search engines very day. This paper reports the results of a major study examining the overlap among results retrieved by multiple Web search engines for a large set of more than 10,000 queries. Previous smaller studies have discussed a lack of overlap in results returned by Web search engines for the same queries. The goal of the current study was to conduct a large-scale study to measure the overlap of search results on the first result page (both non-sponsored and sponsored) across the four most popular Web search engines, at specific points in time using a large number of queries. The Web search engines included in the study were MSN Search, Google, Yahoo! and Ask Jeeves. Our study then compares these results with the first page results retrieved for the same queries by the metasearch engine Dogpile.com. Two sets of randomly selected user-entered queries, one set was 10,316 queries and the other 12,570 queries, from Infospace’s Dogpile.com search engine (the first set was from Dogpile, the second was from across the Infospace Network of search properties were submitted to the four single Web search engines). Findings show that the percent of total results unique to only one of the four Web search engines was 84.9%, shared by two of the three Web search engines was 11.4%, shared by three of the Web search engines was 2.6%, and shared by all four Web search engines was 1.1%. This small degree of overlap shows the significant difference in the way major Web search engines retrieve and rank results in response to given queries. Results point to the value of metasearch engines in Web retrieval to overcome the biases of individual search engines.     

基于XML的公交查询系统设计

XML技术作为一门新兴技术,在许多领域都得到了广泛的支持并有着广阔的应用前景。作为数据表示的一个开放标准,XML语言给Web应用乃至网络计算注入了新的活力,其与HTML、SGML以及关系数据库之间的关系也是值得探讨的。本文通过＂基于XML的公交查询系统设计＂这样一个实例的制作来具体详细地阐述XML在Web上的广泛具体的应用。     

LET THE IGNORANT CONSUMER BEWARE: CONSUMER INFORMATION AND EFFICIENCY OF CONSUMER DECISION MAKING IN THE USA

Although many of the institutions which make up the modern economy pour out data which they hope will be used by consumers in their decision on what to consume, consumers still are regarded by some commentators as ‘ignorant’ when they make those decisions. Two main reasons are postulated, involving the cost of search and requirements for efficient data management. The policy implications are then assessed and the need for leadership in consumer information policy expressed. Finally, the way higher education can help fill the policy gap is briefly explored.     

智能搜索引擎与数字图书馆个性化服务

智能搜索引擎基于知识(概念)层面实行信息检索，以较强的自然语言理解和知识处理能力，表现出良好的个性化信息服务特色。因此，智能搜索引擎应用于数字图书馆个性化服务体系，不仅有效发挥前者数据挖掘、知识发现的功能，同时能较大地加深后者的主动性、智能性优势。     

科技查新服务业变革优化的动力机制研究

通过对高校科技查新优化变革的动力基础分析,从宏观、微观、产品等层面挖掘其发展的新动力,构建其优化变革发展的动力系统,并从管理制度化、机制灵活化、方法多元化、行业监督、市场运行、品牌化运作等方面提出保障措施,以期促进高校科技查新转型发展。     

Exploring features for the automatic identification of user goals in web search

Queries submitted to search engines can be classified according to the user goals into three distinct categories: navigational, informational, and transactional. Such classification may be useful, for instance, as additional information for advertisement selection algorithms and for search engine ranking functions, among other possible applications. This paper presents a study about the impact of using several features extracted from the document collection and query logs on the task of automatically identifying the users’ goals behind their queries. We propose the use of new features not previously reported in literature and study their impact on the quality of the query classification task. Further, we study the impact of each feature on different web collections, showing that the choice of the best set of features may change according to the target collection.     

科技查新作用的延伸与扩展

科技查新在科研立项、成果鉴定、项目验收等方面起着至关重要的作用。然而,科技查新工作仍有巨大的发展潜力。本文在分析查新作用的基础上,论述了科技查新在定题跟踪服务、提供个性化信息服务等方面的伸延;以及在技术创新、竞争性情报服务、信息交流、成果转让等方面的扩展。     

不正常航班恢复模型的贪婪模拟退火算法研究

为解决不正常航班恢复对航空公司带来的严重影响,研究了不正常航班恢复模型及其优化算法,对现有不正常航班恢复优化模型提出适当改进,重点设计了一种贪婪模拟退火算法。算法融合了GRASP和模拟退火算法的特点,提高了领域解的选择效率并且降低了陷入局部最优解的概率。实例证明这种算法可以处理大规模的不正常航班恢复问题,并且能够达到时间代价与结果质量的均衡。