High Marks for SmartMarks (A New Bookmarks Organizer from Netscape)

Abstract

Smart Marks, a new software tool from Netscape, is marketed as “Web surfing for people with a life.” This reviewer agrees that it is very useful for those of us who have a hard time keeping track of our bookmarks in Netscape Navigator. SmartMarks allows you to organize your bookmarks into folders, allows you to label and assigri key words to both bookmarks and folders, and monitors your bookmarks for changes in content or location. This last feature makes it an especially useful tool for librarians who have taken on all or part of the responsibility for maintaining a library's home page.     

A Review of “Technology and Literacy: 21st Century Library Programming for Children and Teens”

ABSTRACT

Given the endless volume of information available today, searchers are forced to satisfice when searching. The first satisfactory alternative is chosen over the best. Digital library search services, however, do not support satisficing users. There is no single, simple, comprehensive search service available to end-users to meet their need to gather information on alternatives from all information repositories accessible through a digital library. Federated search services bridge the gap between satisficing searchers and today's digital libraries.     

The Accuracy and Thoroughness of a Federated Search Engine in the Health Sciences

SUMMARY

Research studies show that researchers need to access multiple resources to ensure a comprehensive search. In the health care field, health professionals' time is very limited, and they would benefit from being able to access multiple resources simultaneously. Health professionals must retrieve the most relevant and accurate information possible when applying clinical information to patient care. While a federated search engine may offer speedy search capabilities, do they offer the same accuracy and relevancy as directly searching the core health sciences databases? The purpose of this study is to describe, evaluate, and compare searching health sciences topics using a federated search engine versus searching five core health sciences databases directly. The following databases were selected for this study: WebFeat (federated search engine), MEDLINE, CINAHL, Science Citation Index, Biological Abstracts, and EMBASE. While WebFeat is convenient for searching multiple databases simultaneously, it does not offer the advanced search limits offered by directly searching some of the health sciences databases. The lack of limits available in the federated search engine means increased results that may not be relevant to the busy health care professional.     

Planning and Implementing a Federated Searching System: An Examination of the Crucial Roles of Technical,Functional, and Usability Testing

SUMMARY

Federated searching software offers much promise to users as a convenient way of accessing the wealth of electronic information resources libraries provide. But metasearching is not the same as Google searching; care must be taken in organizing and presenting search options and results so that they are comprehensible to users. From software installation to usability testing and creating documentation, most of the work of implementation is behind-the-scenes and hidden from most library staff and users; however, the decisions made during implementation greatly affect staff and user experiences with the product as well as its overall utility and usability. Systematic testing of the product is necessary to make informed and defensible decisions. This article details three layers of testing (technical, functional, and usability) recommended during implementation of a federated search product, based on best practices in the literature, metasearch standards, and the authors' own experiences with implementing a locally developed broadcast search system and the federated search system WebFeat.     

Researching Recent U.S. Legislation Using Free Sites on the Internet

Abstract

This study investigates the effects of gender, college status, and prior Internet experience on the use of Internet resources. The subjects were 96 patrons randomly selected from those using the Internet terminals at the University Library of the University at Albany, SUNY, during the first two months of 1995. We found that the majority of users shared the following characteristics: they are male undergraduates affiliated with the social sciences and are novice users who have less than six months experience. Respondents felt strongly that the Internet is useful, and has been an important resource for their research and assignments. Users have high expectations of searching capabilities, while they feel neutral or disappointed with browsing. Our findings indicate that libraries should provide access to the Internet. They also suggest that libraries should take the lead in developing searchable indexes and making info-bases better organized for the ease and effectiveness of browsing.     

P2P中一种基于小世界聚类的资源搜索模型

为有效解决P2P中不同资源的搜索和定位问题,设计了一种基于小世界聚类的资源搜索模型。以小世界模型为理论基础,构建具有局域聚集现象及短的路径的P2P网络模型,按照分级转发方式对资源进行全局搜索。仿真实验证明,这种基于小世界聚类的资源搜索模型具有较高的搜索成功率和较短的平均搜索路径。     

Monotony properties of connected visible graph searching

Search games are attractive for their correspondence with classical width parameters. For instance, the invisible search number (a.k.a. node search number) of a graph is equal to its pathwidth plus 1, and the visible search number of a graph is equal to its treewidth plus 1. The connected variants of these games ask for search strategies that are connected, i.e., at every step of the strategy, the searched part of the graph induces a connected subgraph. We focus on monotone search strategies, i.e., strategies for which every node is searched exactly once. The monotone connected visible search number of an n-node graph is at most O(logn) times its visible search number. First, we prove that this logarithmic bound is tight. Precisely, we prove that there is an infinite family of graphs for which the ratio monotone connected visible search number over visible search number is Ω(logn). Second, we prove that, as opposed to the non-connected variant of visible graph searching, “recontamination helps” for connected visible search. Precisely, we prove that, for any k4, there exists a graph with connected visible search number at most k, and monotone connected visible search number >k     

Web挖掘在电子商务货源搜索中的应用

在电子商务环境下,货源信息的质量将直接影响企业业务经营水平。该文对电子商务环境下的货源信息搜索问题进行分析,提出以万维网为信息源,采用Web挖掘和信息检索技术设计实现货源搜索机器人的方法。该机器人内置元搜索引擎,可以扩大搜索范围,通过对搜索信息进行分析处理,从中发现有价值的货源相关信息。     

串匹配算法的简单并行实现

结合BM模式匹配算法和并行计算的思想,提出了一种快速的串匹配并行实现策略,该策略将文本串划分成一定长度的子串,将子串分配到不同的处理器中,在各个处理器中分别并行执行BM模式匹配,即便是在最坏的情况下也能达到较好的时间复杂度。     

基于改进型最大匹配法的教学资源自然语义查询

中文智能信息检索中的关键是自然语言处理技术,汉语自动分词技术是中文自然语言处理的基础.基于机械匹配的分词方法简洁、实用,但该方法切分精度不高且无法有效克服切分歧义.针对机械匹配最大匹配算法的应用进行了改进,并将相似串应用于教学资源自然语义查询.