kcenter_search

"This paper details a way to extend classic information architecture for web-based applications. The goal is to enhance traditional user experiences, mainly based on navigation or search, to new ones (also relevant for stakeholders' requirements). "

"Library data has been designed to be read and interpreted by librarians and users. Although there are some controlled data fields, most of what is in the library catalog entry is text. The machine as user has not gotten a great deal of attention in the library cataloging environment. Now there's yet another potential user of library data, and that user is the Web and services that function on the Web. (...) This issue of Library Technology Reports provides an explanation, using concrete models and real-world examples, of how to facilitate this transformation."

"Randomly selected undergraduates at Brigham Young University, Brigham Young University-Idaho, and Brigham Young University-Hawaii, all private universities sponsored by The Church of Jesus Christ of Latter-day Saints, participated in a study that investigated four questions regarding federated searching: (1) Does it save time? (2) Do undergraduates prefer it? (3) Are undergraduates satisfied with the results they get from it? (4) Does it yield higher-quality results than nonfederated searching? Federated searching was, on average, 11 percent faster than nonfederated searching. Undergraduates rated their satisfaction with the citations gathered by federated searching 17 percent higher than their satisfaction using nonfederated search methods. A majority of undergraduates, 70 percent, preferred federated searching to the alternative. This study could not ultimately determine which of the two search methods yielded higher citation quality. The study does shed light on assumptions about federated searching and will interest librarians in different types of academic institutions, given the diversity of the three institutions studied."

"Three hosted federated search tools, Follett One Search, Gale PowerSearch Plus, and WebFeat Express, were configured and implemented in a school library. Databases from five vendors and the OPAC were systematically searched. Federated search results were compared with each other and to the results of the same searches in the database's native interface to disclose differences in handling query syntax, searching, retrieval, browsing results, etc. Each product was easily configured, but none were capable of searching every database desired. Simpler Boolean queries are the most successful queries because of the underlying structure and differences of the databases, and the capabilities of certain products. Federated search products succeed in simplifying access to multiple database resources at school, but searching remains different from the familiar Web search engines in many ways. To become more Google-like, federated searching must be done against indexes built in advance instead of the current real-time searching method."

"(...) Les pages qui suivent, issues d'un travail d'étude mené au SCD de l'IUFM de Lyon 1, veulent tenter d'apporter quelques premiers éclairages aux collègues confrontés à ces questions. Dans ce dessein, ces lignes reviendront d'abord rapidement sur ce qu'est un ENT avant de préciser quelles raisons plaident pour que les bibliothèques s'intègrent dans un ENT. L'importante question organisationnelle sera ensuite évoquée, avant qu'une proposition de phasage n'ouvre des horizons plus concrets."

"Vingt ans après l'observation des usages des catalogues informatisés menée par Joëlle Le Marec à la Bibliothèque publique d'information 1, les administrateurs du portail documentaire actuel, accompagnés par le service Études et recherche, ont souhaité évaluer la réception et la compréhension de cet outil par ses utilisateurs. La méthode des tests scénarisés, très utilisée en ergonomie informatique, a été retenue dans le but de recueillir des données fines concernant les difficultés et points de blocages rencontrés au cours de la consultation. Cette démarche d'évaluation, riche d'enseignement, ouvre à la BPI de nouvelles perspectives en matière de développement et d'évolution de ses interfaces de recherche."

"Le Northern Ireland Science Park vient de décerner le prix de l'année aux chercheurs de l'Université d'Ulster pour le développement de SOPHIA, un outil de recherche réalisé en collaboration avec l'Université de St Petersbourg en Russie. La recherche initiale du projet a été effectuée au Northern Ireland Knowledge Engineering Lab (NIKEL), qui fait partie de la University's School of Computing and Mathematics. Le but de cet outil de recherche est de donner des résultats qui sont fondés sur le sens des mots-clés et non pas sur les mots eux-mêmes. SOPHIA, pour SOPHisticated Information Analysis, analyse et traite chaque document comme s'il était composé de centaines de milliers de documents. Elle structure chaque partie du document en l'associant à un thème. Les documents sont reliés entre eux en se fondant sur des thèmes communs. Les différents thèmes sont détectés automatiquement sans aucune intervention humaine. Avec ce système, la réponse à une requête peut ne contenir aucun des mots clés de la requête mais uniquement des documents sur le même sujet."

"Traditional on-line search services such as Dialog, DataStar and Lexis provide a wide range of search features (boolean and proximity operators, truncation, etc). This paper discusses the use of these features for effective searching, and argues that these features are required, regardless of advances in search engine technology. The literature on on-line searching is reviewed, identifying features that searchers find desirable for effective searching. A selective survey of current digital libraries available on the Web was undertaken, identifying which search features are present. The survey indicates that current digital libraries do not implement a wide range of search features. For instance: under half of the examples included controlled vocabulary, under half had proximity searching, only one enabled browsing of term indexes, and none of the digital libraries enable searchers to refine an initial search. Suggestions are made for enhancing the search effectiveness of digital libraries; for instance, by providing a full range of search operators, enabling browsing of search terms, enhancement of records with controlled vocabulary, enabling the refining of initial searches, etc."

"There are several kinds of conceptual models for information seeking and retrieval (IS&R). The paper suggests that some models are of a summary type and others more analytic. Such models serve different research purposes. The purpose of this paper is to discuss the functions of conceptual models in scientific research, in IS&R research in particular. What kind of models are there and in what ways may they help the investigators? What kinds of models are needed for various purposes? In particular, we are looking for models that provide guidance in setting research questions, and formulation of hypotheses. As a example, the paper discusses [at length] one analytical model of task-based information seeking and its contribution to the development of the research area."

"In this paper we propose a multi-agent Selective Dissemination of Information service to improve the research community's access to digital library resources. The service also provides a new recommendation approach to satisfy researchers' specific information requirements." "Semantic Web technologies and fuzzy linguistic modelling provide the means to develop value-added services for digital libraries, which improve users' access to resources of interest to them. Furthermore, the recommendation approach here proposed allows researchers to satisfy specific information needs not covered by traditional recommender systems."

"Metasearch, parallel search, federated search, broadcast search, cross-database search, search portal are a familiar part of the information community's vocabulary. They speak to the need for search and retrieval to span multiple databases, sources, platforms, protocols, and vendors at one time. Metasearch services rely on a variety of approaches to search and retrieval including open standards (such as NISO's Z39.50), proprietary API's, and screen scraping. However, the absence of widely supported standards, best practices, and tools makes the metasearch environment less efficient for the system provider, the content provider, and ultimately the end-user. "

"SRU (Search/Retrieve via URL) et SRW (Search/Retrieve Web service) sont deux protocoles qui, succédant à Z3950, en constituent une évolution, et ce vers les technologies web, via les webservices. Maintenus par la Bibliothèque du Congrès, et destinés à faciliter la recherche sur Internet, ils se fondent sur le langage CQL (Common Query Language, standard de syntaxe de requête), qui présente l'avantage d'une (relative) lisibilité. SRU/SRW spécifient tout à la fois la syntaxe des requêtes, et celle des réponses données à ces requêtes. SRU/SRW permettent d'interroger simplement, via le protocole http du web, des bases de données jusqu'alors cachées ou plus difficilement accessibles. La version 1.1 de SRU a été publiée en février 2004, et devrait être suivie d'une version 1.2 actuellement en cours de développement. "

"Ce billet est l'émanation d'une 'synthèse bibliographique' menée dans le cadre d'un travail de groupe de : Daniel B, Pascal K, et David S. Le rapport finalisé arrive bientôt sur vos écrans…"

"Méta-catalogue qui permet de lancer une recherche simultanée dans les principaux catalogues de bibliothèques suisses."

"Cool search box turn your web application impressive and good search box can make it more organised and well structured. Today, I have collected 14 search boxes for your inspiration which may be implemented in your upcoming web application."

"L'inspiration Machine utilise des interfaces de programmation Web, telles que celles utilisées sous Flickr, YouTube, eBay afin d'organiser les résultats de la recherche en fonction de leur créativité dans le navigateur de l'utilisateur en utilisant des technologies Rich Internet."

"Le concept des Swickis, plus ancien que les outils vus précédemment, est identique à celui de ses principaux concurrents avec une interface permettant de créer de façon très complète son propre moteur de recherche vertical (voir encadré page 14). A noter que, en mode simple en mode avancé chez Eurekster, les possibilités de configuration sont excellentes : liste d'url à inclure ou à exclure, thématiques générales, mots clés, filtre sur les contenus adultes, recherches multimédia, ajout de nuages de requêtes, etc. La technologie de recherche utilisée est celle de Yahoo! (Yahoo! Search Technology)."

A sandbox for collecting search examples, patterns, and anti-patterns. Using our group pool (http://www.flickr.com/groups/searchpatterns/), you can also talk about search and discovery; and even add new examples and patterns.

"Jumper 2.0 is a revolution in enterprise search. One that delivers personalized, specialized, and trusted search directly to the knowledge workers who need it most. Jumper is light-weight, web-based, license-free, and quickly deployed to smaller groups of users. Easily customized and adaptable it meets the unique needs of departments and divisions, research groups and project teams. Making it a point solution search approach that is highly flexible and very dynamic. Jumper 2.0 is commercial open source software for universal search and knowledge management powered by an enterprise bookmarking engine. Jumper uses peer and social-networking principles to tag and link distributed content, media, or data regardless of format or location - including databases, flat files, fileshares, content systems, blogs and wikis, even people - through one simple search box."

"What we are about to get is a Social Relevancy Rank. Whenever you search streams of activity, the results will be ordered not chronologically but by how relevant each is to you based on your social graph. That is, people who matter more to you will bubble up. How does this work? Well, there will be a formula, just as there is a formula for Page Rank."