1455414
A Comparison of the Two Traditions of Metadata Development
The two traditional methods of Metadata Development as describe in the article are bibliographic control approach and the data management approach. These two approaches have evolved over time due to the rise of digital information stored in cyberspace and help facilitate metadata standards which include the identification, location, retrieval, manipulation and use of the information. So what is metadata? From my understanding of what metadata is, metadata is simply defined as 'data about data'. And to a certain extent and depending on the perspective which you define what metadata is, 'data about data' is a legitimate and accurate definition. Soyeon Park (1999), define metadata as " structured data about data " whereas NISO Press, 2004 describes metadata as " data about data or information about information. " But according to Gill, 2000, " information about information " is often " incorrectly generalized " by the reader or author as the meaning of metadata, therefore, 'data about data' would be more concise and accurate for this paper. This begs the question of exactly the purpose of metadata and metadata standards. In theory, " metadata provides an effective mechanism for identifying and locating data that is relevant to a particular user. " elements within the metadata standards may be divided into two categories: intrinsic (related to resource identification and discovery) and extrinsic (related administration and other nonbibliographic data). While some metadata formats vary in terms of intrinsic and extrinsic elements, some elements are more suitable for resource description and identification whereas others may help resource access and navigation. However, the issue still remains as to which metadata format to use and whether a universal or unified " grand scheme " that is rich in attribute should be employed, eliminating the need in choosing a specific metadata format. In the past years, we have seen a rise of conflicting standards as an increasingly large amount of information becomes available electronically. This has become a growing problem as retrieving information becomes more complex. In an article by Jessica Milstead and Susan Feldman (1999), the author uses the term " Mercury " as an example of the documents the user would retrieve through the use of
42030145
Rutgers Interactive Track at TREC-5
The Interactive Track investigation at Rutgers concentrated primarily on three factors: the searchers' uses and understandings of relevance feedback and ranked output, and the utility of relevance feedback for the interactive track task; the searchers' understandings of the interactive track task; and performance differences based on topic characteristics and searcher and order effects. Our official results are for twelve searchers, each of whom did searches on six different topics
62719399
Usability, user preferences, effectiveness, and user behaviors when searching individual and integrated full-text databases: implications for digital libraries
This article addresses a crucial issue in the digital library environment: how to support effective interaction of users with heterogeneous and distributed information resources. In particular, this study compared usability, user preference, effectiveness, and searching behaviors in systems that implement interaction with multiple databases through a common interface, and with multiple databases as if they were one (integrated interaction) in an experiment in the Text REtrieval Conference (TREC) environment. Twenty-eight volunteers were recruited from the graduate students of the School of Communication, Information, & Library Studies at Rutgers University. Significantly more subjects preferred the common interface to the integrated interface, mainly because they could have more control over database selection. Subjects were also more satisfied with the results from the common interface, and performed better with the common interface than with the integrated interface. Overall, it appears that for this population, interacting with databases through a common interface, is preferable on all grounds to interacting with databases through an integrated interface. These results suggest that: (1) the general assumption of the information retrieval (IR) literature that an integrated interaction is best needs to be revisited; (2) it is important to allow for more user control in the distributed environment; (3) for digital library purposes, it is important to characterize different databases to support user choice for integration; and, (4) certain users prefer control over database selection while still opting for results to be merged.
1442053
User preferences when searching individual and integrated full-text databases
This paper addresses a crucial issue in the digital library environment: how to support effective interaction of users with heterogeneous and distributed information resources. We compared users' preference for systems which implement interaction with multiple databases through a common interface and with multiple databases as if they were one (integrated interaction) in an experiment in the Text REtrieval Conference (TREC) environment. Twenty-eight volunteers were recruited from the graduate students of School of Communication, Information, & Library Studies at Rutgers University. Significantly more subjects preferred the common interface (HERMES) to the integrated interface (HERA). For most of the subjects in this study, the greater control in HERMES outweighed the advantages of HERA such as convenience, efficiency, and ease of use. These results suggest that: (1) the general assumption of the information retrieval (IR) literature that an integrated interaction is best needs to be revisited; (2) it is important to allow for more user control in various ways in the distributed environment; and (3) for digital library purposes, it is important to characterize different databases to support user choice for integration.
34137561
Using Relevance Feedback and Ranking in Interactive Searching
We present results of a study in which 50 searchers, of varying degrees of experience in information retrieval (IR), each performed searches on two TREC-4 adhoc interactive track topics, using a simple interface to the INQUIRY retrieval engine. The foci of our study were : the relationships between the users'models and experience of IR, and their performance in the TREC-4 adhoc task while using a best-match IR system with relevance feedback ; the understanding, use and utility of relevance feedback and ranking in interactive IR ; and, the evaluation of interactive IR.
439941
Iterative exploration, design and evaluation of support for query reformulation in interactive information retrieval
We report on the progressive investigation of techniques for supporting interactive query reformulation in the TREC Interactive Track. Two major issues were explored over four successive years: methods of term suggestion; and, interface design to support different system functionalities. Each year's results led to the following year's investigation, with respect to both of these issues. This paper presents first the general motivation for the entire series of studies; then an overview of each year's investigation, its results, and how they influenced the next year's investigation. We discuss what has been learned through this series of investigations about effective term suggestion, usable and useful interface design, and the relationships between these two in support of the TREC Interactive Track task. We conclude with comments about the general methodology employed over this series of studies, and its relevance to the development and evaluation of interactive information retrieval systems.
9375021
Dynamic Data Grid Replication Strategy Based on Internet Hierarchy
In data grid, large quantity of data files is produced and data replication is applied to reduce data access time. Efficiently utilizing grid resources becomes important research issue since available resources in grid are limited while large number of workloads and large size of data files are produced. Dynamic replication in data grid aims to reduce data access time and to utilize network and storage resources efficiently. This paper proposes a novel dynamic replication strategy, called BHR, which reduces data access time by avoiding network congestions in a data grid network. With BHR strategy, we can take benefits from ‘network-level locality’ which represents that required file is located in the site which has broad bandwidth to the site of job execution. We evaluate BHR strategy by implementing it in an OptorSim, a data grid simulator initially developed by European Data Grid Projects. The simulation results show that BHR strategy can outperform other optimization techniques in terms of data access time when hierarchy of bandwidth appears in Internet. BHR extends current site-level replica optimization study to the network-level.
6873960
A scalable approach for reliable downstream data delivery in wireless sensor networks
There exist several applications of sensor networks wherere liability of data delivery can be critical. While the redundancy inherent in a sensor network might increase the degree of reliability, it by no means can provide any guaranteed reliability semantics. In this paper, we consider the problem of reliable sink-to-sensors data delivery. We first identify several fundamental challenges that need to be addressed, and are unique to a wireless sensor network environment. We then propose a scalable framework for reliable downstream data delivery that is specifically designed to both address and leverage the characteristics of a wireless sensor network, while achieving the reliability in an efficient manner. Through ns2 based simulations, we evaluate the proposed framework.
122654746
Facility location and the geometric minimum-diameter spanning tree
Let P be a set of n points in the plane. The geometric minimum-diameter spanning tree (MDST) of P is a tree that spans P and minimizes the Euclidean length of the longest path. It is known that there is always a mono- or a dipolar MDST, i.e., a MDST with one or two nodes of degree greater 1, respectively. The more difficult dipolar case can so far only be solved in slightly subcubic time.This paper has two aims. First, we present a solution to a new data structure for facility location, the minimum-sum dipolar spanning tree (MSST), that mediates between the minimum-diameter dipolar spanning tree and the discrete two-center problem (2CP) in the following sense: find two centers p and q in P that minimize the sum of their distance plus the distance of any other point (client) to the closer center. This is of interest if the two centers do not only serve their customers (as in the case of the 2CP), but frequently have to exchange goods or personnel between themselves. We show that this problem can be solved in O(n2 log n) time and that it yields a factor-4/3 approximation of the MDST.Second, we give two fast approximation schemes for the MDST, i.e., factor-(1 + e) approximation algorithms. One uses a grid and takes O*(E6-1/3 + n) time, where E = 1/e and the O*-notation hides terms of type O(logO(1) E). The other uses the well-separated pair decomposition and takes O(nE3 + En logn) time. A combination of the two approaches runs in O*(E5 + n) time. Both schemes can also be applied to MSST and 2CP.
15182689
Chameleon: a resource scheduler in a data grid environment
Grid computing is moving into two ways. The Computational Grid focuses on reducing execution time of applications that require a great number of computer processing cycles. The Data Grid provides the way to solve large scale data management problems. Data intensive applications such as High Energy Physics and Bioinformatics require both Computational and Data Grid features. Job scheduling in Grid has been mostly discussed from the perspective of computational Grid. However, scheduling on Data Grid is just a recent focus of Grid computing activities. In Data Grid environment, effective scheduling mechanism considering both computational and data storage resources must be provided for large scale data intensive applications. In this paper, we describe new scheduling model that considers both amount of computational resources and data availability in Data Grid environment. We implemented a scheduler, called Chameleon, based on the proposed application scheduling model. Chameleon shows performance improvements in data intensive applications that require both large number of processors and data replication mechanisms. The results achieved from Chameleon are presented.
3150650
Fault-Tolerant All-to-All Broadcasting in Hypercubes