Search NASA⌕ Search

SEARCH · Search NASA

Results for “INFORMATION RETRIEVAL”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 19 records

Latent morpho-semantic analysis : multilingual information retrieval with character n-grams and mutual information.

We describe an entirely statistics-based, unsupervised, and language-independent approach to multilingual information retrieval, which we call Latent Morpho-Semantic Analysis (LMSA). LMSA overcomes some of the shortcomings of related previous approaches such as Latent Semantic Analysis (LSA). LMSA has an important theoretical advantage over LSA: it combines well-known techniques in a novel way to break the terms of LSA down into units which correspond more closely to morphemes. Thus, it has a particular appeal for use with morphologically complex languages such as Arabic. We show through empirical results that the theoretical advantages of LMSA can translate into significant gains in precision in multilingual information retrieval tests. These gains are not matched either when a standard stemmer is used with LSA, or when terms are indiscriminately broken down into n-grams.

99 GENERAL AND MISCELLANEOUS↗

Improved parallel data partitioning by nested dissection with applications to information retrieval.

The computational work in many information retrieval and analysis algorithms is based on sparse linear algebra. Sparse matrix-vector multiplication is a common kernel in many of these computations. Thus, an important related combinatorial problem in parallel computing is how to distribute the matrix and the vectors among processors so as to minimize the communication cost. We focus on minimizing the total communication volume while keeping the computation balanced across processes. In [1], the first two authors presented a new 2D partitioning method, the nested dissection partitioning algorithm. In this paper, we improve on that algorithm and show that it is a good option for data partitioning in information retrieval. We also show partitioning time can be substantially reduced by using the SCOTCH software, and quality improves in some cases, too.

99 GENERAL AND MISCELLANEOUS↗

Next-Generation Search Engines for Information Retrieval

In the recent years, there have been significant advancements in the areas of scientific data management and retrieval techniques, particularly in terms of standards and protocols for archiving data and metadata. Scientific data is rich, and spread across different places. In order to integrate these pieces together, a data archive and associated metadata should be generated. Data should be stored in a format that can be retrievable and more importantly it should be in a format that will continue to be accessible as technology changes, such as XML. While general-purpose search engines (such as Google or Bing) are useful for finding many things on the Internet, they are often of limited usefulness for locating Earth Science data relevant (for example) to a specific spatiotemporal extent. By contrast, tools that search repositories of structured metadata can locate relevant datasets with fairly high precision, but the search is limited to that particular repository. Federated searches (such as Z39.50) have been used, but can be slow and the comprehensiveness can be limited by downtime in any search partner. An alternative approach to improve comprehensiveness is for a repository to harvest metadata from other repositories, possibly with limits based on subject matter or access permissions. Searches through harvested metadata can be extremely responsive, and the search tool can be customized with semantic augmentation appropriate to the community of practice being served. One such system, Mercury, a metadata harvesting, data discovery, and access system, built for researchers to search to, share and obtain spatiotemporal data used across a range of climate and ecological sciences. Mercury is open-source toolset, backend built on Java and search capability is supported by the some popular open source search libraries such as SOLR and LUCENE. Mercury harvests the structured metadata and key data from several data providing servers around the world and builds a centralized index. The harvested files are indexed against SOLR search API consistently, so that it can render search capabilities such as simple, fielded, spatial and temporal searches across a span of projects ranging from land, atmosphere, and ocean ecology. Mercury also provides data sharing capabilities using Open Archive Initiatives Protocol for Metadata Handling (OAI-PMH). In this paper we will discuss about the best practices for archiving data and metadata, new searching techniques, efficient ways of data retrieval and information display.

99 GENERAL AND MISCELLANEOUS↗

Secure quantum private information retrieval using phase-encoded queries

We propose a quantum solution to the classical private information retrieval (PIR) problem, which allows one to query a database in a private manner. The protocol offers privacy thresholds and allows the user to obtain information from a database in a way that offers the potential adversary, in this model the database owner, no possibility of deterministically establishing the query contents. This protocol may also be viewed as a solution to the symmetrically private information retrieval problem in that it can offer database security (inability for a querying user to steal its contents). Compared to classical solutions, the protocol offers substantial improvement in terms of communication complexity. In comparison with the recent quantum private queries [Phys. Rev. Lett. 100, 230502 (2008)] protocol, it is more efficient in terms of communication complexity and the number of rounds, while offering a clear privacy parameter. We discuss the security of the protocol and analyze its strengths and conclude that using this technique makes it challenging to obtain the unconditional (in the information-theoretic sense) privacy degree; nevertheless, in addition to being simple, the protocol still offers a privacy level. The oracle used in the protocol is inspired both by the classical computational PIR solutions as well as the Deutsch-Jozsa oracle.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Method and system for information retrieval and aggregation from inferred user reasoning

The visual analytic system enables information retrieval within large text collections. Typically, users have to directly and explicitly query information to retrieve it. With this system and process, the reasoning of the user is inferred from the user interaction they perform in a visual analytic tool, and the appropriate information to query, process, and visualize is systematically determined.

96 KNOWLEDGE MANAGEMENT AND PRESERVATION↗

Rapid automatic keyword extraction for information retrieval and analysis

Methods and systems for rapid automatic keyword extraction for information retrieval and analysis. Embodiments can include parsing words in an individual document by delimiters, stop words, or both in order to identify candidate keywords. Word scores for each word within the candidate keywords are then calculated based on a function of co-occurrence degree, co-occurrence frequency, or both. Based on a function of the word scores for words within the candidate keyword, a keyword score is calculated for each of the candidate keywords. A portion of the candidate keywords are then extracted as keywords based, at least in part, on the candidate keywords having the highest keyword scores.

96 KNOWLEDGE MANAGEMENT AND PRESERVATION↗

Automatic generation of stop word lists for information retrieval and analysis

Methods and systems for automatically generating lists of stop words for information retrieval and analysis. Generation of the stop words can include providing a corpus of documents and a plurality of keywords. From the corpus of documents, a term list of all terms is constructed and both a keyword adjacency frequency and a keyword frequency are determined. If a ratio of the keyword adjacency frequency to the keyword frequency for a particular term on the term list is less than a predetermined value, then that term is excluded from the term list. The resulting term list is truncated based on predetermined criteria to form a stop word list.

96 KNOWLEDGE MANAGEMENT AND PRESERVATION↗

VisIRR: A Visual Analytics System for Information Retrieval and Recommendation for Large-Scale Document Data

In this paper, we present an interactive visual information retrieval and recommendation system, called VisIRR, for large-scale document discovery. VisIRR effectively combines the paradigms of (1) a passive pull through query processes for retrieval and (2) an active push that recommends items of potential interest to users based on their preferences. Equipped with an efficient dynamic query interface against a large-scale corpus, VisIRR organizes the retrieved documents into high-level topics and visualizes them in a 2D space, representing the relationships among the topics along with their keyword summary. In addition, based on interactive personalized preference feedback with regard to documents, VisIRR provides document recommendations from the entire corpus, which are beyond the retrieved sets. Such recommended documents are visualized in the same space as the retrieved documents, so that users can seamlessly analyze both existing and newly recommended ones. This article presents novel computational methods, which make these integrated representations and fast interactions possible for a large-scale document corpus. We illustrate how the system works by providing detailed usage scenarios. Finally, we present preliminary user study results for evaluating the effectiveness of the system.

96 KNOWLEDGE MANAGEMENT AND PRESERVATION↗

An extended vector space model for information retrieval with generalized similarity measures: theory and applications

We present an Extended Vector Space Model (EVSM) for information retrieval, endowed with a new set of similarity functions. Our model considers records as multisets of tokens. A token weight function maps records into a real vectors. Using this vector representation we define a p -norm of a record and pairwise conjunction and disjunction operations on records. These oper ations prompt consistent extensions of published set-based similarity functions and yield new $\ell$ p distance-based similarities. We demonstrate that some well-known similarities form a subset of the new functions resulting from particular choices of token weights and p -values.

Paskaleva, Biliana Stefanova↗

Data Aggregation System: A system for information retrieval on demand over relational and non-relational distributed data sources

We present the Data Aggregation System, a system for information retrieval and aggregation from heterogenous sources of relational and non-relational data for the Compact Muon Solenoid experiment on the CERN Large Hadron Collider. The experiment currently has a number of organically-developed data sources, including front-ends to a number of different relational databases and non-database data services which do not share common data structures or APIs (Application Programming Interfaces), and cannot at this stage be readily converged. DAS provides a single interface for querying all these services, a caching layer to speed up access to expensive underlying calls and the ability to merge records from different data services pertaining to a single primary key.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Technique for information retrieval using enhanced latent semantic analysis generating rank approximation matrix by factorizing the weighted morpheme-by-document matrix

A technique for information retrieval includes parsing a corpus to identify a number of wordform instances within each document of the corpus. A weighted morpheme-by-document matrix is generated based at least in part on the number of wordform instances within each document of the corpus and based at least in part on a weighting function. The weighted morpheme-by-document matrix separately enumerates instances of stems and affixes. Additionally or alternatively, a term-by-term alignment matrix may be generated based at least in part on the number of wordform instances within each document of the corpus. At least one lower rank approximation matrix is generated by factorizing the weighted morpheme-by-document matrix and/or the term-by-term alignment matrix.

97 MATHEMATICS AND COMPUTING↗

Speech information retrieval: a review

Audio is an information-rich component of multimedia. Information can be extracted from audio in a number of different ways, and thus there are several established audio signal analysis research fields. These fields include speech recognition, speaker recognition, audio segmentation and classification, and audio finger-printing. The information that can be extracted from tools and methods developed in these fields can greatly enhance multimedia systems. In this paper, we present the current state of research in each of the major audio analysis fields. The goal is to introduce enough back-ground for someone new in the field to quickly gain high-level understanding and to provide direction for further study.

Hafen, Ryan P↗

Replica wormhole and information retrieval in the SYK model coupled to Majorana chains

Motivated by recent studies of the information paradox in (1+1)-D anti-de Sitter spacetime with a bath described by a (1+1)-D conformal field theory, we study the dynamics of second Ŕenyi entropy of the Sachdev-Ye-Kitaev (SYK) model (χ) coupled to a Majorana chain bath (ψ). The system is prepared in the thermofield double (TFD) state and then evolved by HL + HR. For small system-bath coupling, we find that the second Rényi entropy $S^(2)_{χL,χR}$ of the SYK model undergoes a first order transition during the evolution. In the sense of holographic duality, the long-time solution corresponds to a “replica wormhole”. The transition time corresponds to the Page time of a black hole coupled to a thermal bath. We further study the information scrambling and retrieval by introducing a classical control bit, which controls whether or not we add a perturbation in the SYK system. The mutual information between the bath and the control bit shows a positive jump at the Page time, indicating that the entanglement wedge of the bath includes an island in the holographic bulk.

1/N Expansion↗

Patient geometry-driven information retrieval for IMRT treatment plan quality control

Purpose: Intensity modulated radiation therapy (IMRT) treatment plan quality depends on the planner's level of experience and the amount of time the planner invests in developing the plan. Planners often unwittingly accept plans when further sparing of the organs at risk (OARs) is possible. The authors propose a method of IMRT treatment plan quality control that helps planners to evaluate the doses of the OARs upon completion of a new plan. Methods: It is achieved by comparing the geometric configurations of the OARs and targets of a new patient with those of prior patients, whose plans are maintained in a database. They introduce the concept of a shape relationship descriptor and, specifically, the overlap volume histogram (OVH) to describe the spatial configuration of an OAR with respect to a target. The OVH provides a way to infer the likely DVHs of the OARs by comparing the relative spatial configurations between patients. A database of prior patients is built to serve as an external reference. At the conclusion of a new plan, planners search through the database and identify related patients by comparing the OAR-target geometric relationships of the new patient with those of prior patients. The treatment plans of these related patients are retrieved from the database and guide planners in determining whether lower doses delivered to the OARs in the new plan are feasible. Results: Preliminary evaluation is promising. In this evaluation, they applied the analysis to the parotid DVHs of 32 prior head-and-neck patients, whose plans are maintained in a database. Each parotid was queried against the other 63 parotids to determine whether a lower dose was possible. The 17 parotids that promised the greatest reduction in D{sub 50} (DVH dose at 50% volume) were flagged. These 17 parotids came from 13 patients. The method also indicated that the doses of the other nine parotids of the 13 patients could not be reduced, so they were included in the replanning process as controls. Replanning with an effort to reduce D{sub 50} was conducted on these 26 parotids. After replanning, the average reductions for D{sub 50} of the 17 flagged parotids and nine unflagged parotids were 6.6 and 1.9 Gy, respectively. These results demonstrate that the quality control method has accurately identified not only the parotids that require dose reductions but also those for which dose reductions are marginal. Originally, 11 of out the 17 flagged parotids did not meet the Radiation Therapy Oncology Group sparing goal of V(30 Gy)<50%. Replanning reduced them to three. Additionally, PTV coverage and OAR sparing of the original plans were compared to those of the replans by using pairwise Wilcoxon p test. The statistical comparisons show that replanning compromised neither PTV coverage nor OAR sparing. Conclusions: This method provides an effective quality control mechanism for evaluating the DVHs of the OARs. Adoption of such a method will advance the quality of current IMRT planning, providing better treatment plan consistency.

62 RADIOLOGY AND NUCLEAR MEDICINE↗