Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “search”

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
All sourcesNASA NTRSDOE OSTI
NASA NTRS2001

Searching the ASRS Database Using QUORUM Keyword Search, Phrase Search, Phrase Generation, and Phrase Discovery

To support Search Requests and Quick Responses at the Aviation Safety Reporting System (ASRS), four new QUORUM methods have been developed: keyword search, phrase search, phrase generation, and phrase discovery. These methods build upon the core QUORUM methods of text analysis, modeling, and relevance-ranking. QUORUM keyword search retrieves ASRS incident narratives that contain one or more user-specified keywords in typical or selected contexts, and ranks the narratives on their relevance to the keywords in context. QUORUM phrase search retrieves narratives that contain one or more user-specified phrases, and ranks the narratives on their relevance to the phrases. QUORUM phrase generation produces a list of phrases from the ASRS database that contain a user-specified word or phrase. QUORUM phrase discovery finds phrases that are related to topics of interest. Phrase generation and phrase discovery are particularly useful for finding query phrases for input to QUORUM phrase search. The presentation of the new QUORUM methods includes: a brief review of the underlying core QUORUM methods; an overview of the new methods; numerous, concrete examples of ASRS database searches using the new methods; discussion of related methods; and, in the appendices, detailed descriptions of the new methods.

McGreevy, Michael W.↗
NASA NTRS2000

Analytic Guided-Search Model of Human Performance Accuracy in Target- Localization Search Tasks

Current models of human visual search have extended the traditional serial/parallel search dichotomy. Two successful models for predicting human visual search are the Guided Search model and the Signal Detection Theory model. Although these models are inherently different, it has been difficult to compare them because the Guided Search model is designed to predict response time, while Signal Detection Theory models are designed to predict performance accuracy. Moreover, current implementations of the Guided Search model require the use of Monte-Carlo simulations, a method that makes fitting the model's performance quantitatively to human data more computationally time consuming. We have extended the Guided Search model to predict human accuracy in target-localization search tasks. We have also developed analytic expressions that simplify simulation of the model to the evaluation of a small set of equations using only three free parameters. This new implementation and extension of the Guided Search model will enable direct quantitative comparisons with human performance in target-localization search experiments and with the predictions of Signal Detection Theory and other search accuracy models.

Eckstein, Miguel P.↗
DOE OSTI2024

Searching for Strongly-Interacting Dark Matter with the Heavy Photon Search Experiment

The Heavy Photon Search Experiment (HPS) is a fixed-target experiment at Jefferson Lab’s Hall B, designed to explore a hidden sector (HS) of particles containing dark matter and a new force mediator known as the “heavy photon” (A'). The A' is a massive spin-1 gauge boson associated with a new U (1)D symmetry in the HS that kinetically mixes with the Standard Model () photon with a weak coupling strength parameterized by ¿, with ¿2 ~ 10-2 -10-10. HPS utilizes a high-intensity electron beam on a thin tungsten target to produce heavy photons in the MeV-GeV mass range via “dark bremsstrahlung,” a process analogous to SM bremsstrahlung but suppressed by ¿2. The A' can decay resonantly to SM leptons, allowing HPS to conduct both mass resonance searches for prompt decays (large ¿) and displaced vertex searches for long-lived particles (small ¿). In addition to the minimal A' model, HPS probes more complex extensions such as the QCD-like strongly-interacting massive particles (SIMPs) HS containing “dark” pions (pD) and vector mesons (VD), with pD as dark matter candidates. These particles introduce new thermal dark matter freeze- out scenarios and visible signals through long-lived VD decays to SM leptons, which are accessible to HPS. This analysis conducted a displaced vertex search for VD ¿ e-e+ in the mass range 30 MeV to 124 MeV and ¿ between 10-6 < ¿ < 10-2 using data from the 2016 Engineering Run (10.753 nb-1) at 2.3 GeV. Unlike the minimal A' search, SIMP signal kinematics required new approaches to signal normalization and SM background rejection. The strongest signal evidence was a local p-value of 0.01317 for mVD = 119 MeV, corresponding to a global significance of 0.9s. Although no signal was found, this search excluded a region of the SIMP parameter space at 90 % confidence. This work demonstrates HPS’s competitive capability to probe SIMP sectors within cosmologically significant parameters and introduces a new method for HPS displaced vertex searches using track vertical impact parameter cuts

Spellman, Alic [Univ. of California, Santa Cruz, C↗
DOE OSTI2026

SEARCHING FOR MESONIC DARK MATTER WITH THE HEAVY PHOTON SEARCH EXPERIMENT

Several highly-sensitive astrophysical experiments over the past couple of decades have demonstrated that the current abundance of visible Standard Model matter cannot explain galactic rotation curves, the expansion history of the Universe, or the apparent warping of light in empty space. Instead, one finds strong agreement with this body of experimental results upon positing the existence of an invisible particulate field, dark matter. Namely, a cold, weakly interacting dark matter component can explain all these phenomena. A number of accelerator-based experiments have been developed to search for the weak couplings/interactions of these particles, many of them concentrating on particle models with masses of tens to thousands of GeV. A relatively new, well-motivated model is a dark sector coupled to the Standard Model via a dark photon. The current abundance of dark matter can be obtained if one assumes that dark matter is coupled to light by a MeV to GeV particle with a U(1) symmetry. The parameter space of these models remains largely unexplored because they are difficult to probe experimentally. In this thesis, I analyze data from the Heavy Photon Search (HPS) detector, whose two detector halves closely surround the electron beam, providing acceptance to far-forward boosted interactions. This forward acceptance to highly boosted particles yields unprecedented sensitivity to MeV-scale invariant masses. I exhaustively optimize the offline reconstruction of the HPS detector. Each reconstruction object, from Silicon Vertex Tracker hits to tracks, is studied to maximize acceptance of dark matter events. I then use the 2021 run data to search for one model of dark-photon-mediated matter, the Strongly Interacting Massive Particle (SIMP). SIMP models provide self-interacting dark matter candidates that can form bound states resembling dark mesons. HPS can detect SIMPs through the decay of a dark vector boson (either a dark ¿ or ¿) into e+e- pairs. I obtain exclusion contours for SIMPs using both an optimized cuts-based selection and a machine-learning-based selection, advancing our knowledge of the nature of dark matter.

O'Dwyer, Rory [Stanford Univ., CA (United States).↗
NASA NTRS1980

A search strategy for SETI - The search for extraterrestrial intelligence

A search strategy is proposed for the detection of signals of extraterrestrial intelligent origin. It constitutes an exploration of a well defined volume of search space in the microwave region of the spectrum and envisages the use of a combination of sky survey and targeted star approaches. It is predicated on the use of existing antennas equipped with sophisticated multichannel spectrum analyzers and signal processing systems operating in the digital mode. The entire sky would be surveyed between 1 and 10 GHz with resolution bin widths down to 32 Hz. More than 700 nearby solar type stars and other selected interesting directions would be searched between 1 GHz and 3 GHz with bin widths down to 1 Hz. Particular emphasis would be placed on those solar type stars that are within 20 light years of earth.

Billingham, J.↗
NASA NTRS2000

Generalizing Backtrack-Free Search: A Framework for Search-Free Constraint Satisfaction

Tractable classes of constraint satisfaction problems are of great importance in artificial intelligence. Identifying and taking advantage of such classes can significantly speed up constraint problem solving. In addition, tractable classes are utilized in applications where strict worst-case performance guarantees are required, such as constraint-based plan execution. In this work, we present a formal framework for search-free (backtrack-free) constraint satisfaction. The framework is based on general procedures, rather than specific propagation techniques, and thus generalizes existing techniques in this area. We also relate search-free problem solving to the notion of decision sets and use the result to provide a constructive criterion that is sufficient to guarantee search-free problem solving.

Jonsson, Ari K.↗
NASA NTRS1994

BATSE gamma-ray burst line search. 1: Search for narrow lines in spectroscopy detector data

Analysis of data from the Spectroscopy Detectors (SDs) of the Burst and Transient Source Experiment (BATSE) on the Compton Gamma Ray Observatory (GRO) has found no convincing line features in the spectra of gamma-ray bursts (GRBs) in almost 3 years of operation, in contrast to expectations based on results from other experiments. In this Letter we discuss the visual search for narrow lines in the SD data. The search has examined 192 bursts, of which approximately 18 were intense enough that lines similar to those seen by instruments on the Ginga satellite would have been visible between approximately 20 and approximately 100 keV. A simplified calculation shows that the BATSE and Ginga results are consistent at the 13% level.

Palmer, David M.↗
NASA NTRS2020

Search Tree Pruning for Progressive Neural Architecture Search

Our neural architecture search algorithm progressively searches a tree of neural network architectures. Child nodes are created by inserting new layers determined by a transition graph into a parent network up to a maximum depth and pruned when performance is worse than its parent. This increases efficiency but makes the algorithm greedy. Simpler networks are successfully found before more complex ones that can achieve benchmark performance similar to other top-performing networks.

Deanna Flynn↗
NASA NTRS1985

SETI - The microwave search problem and the targeted search approach

The targeted search component of the NASA SETI program is limited to time sharing in the usual fashion on existing large radio telescopes. Unless the consequences of this restriction are compensated by increased capability in the SETI electronic systems, an undesirable loss in sensitivity must be accepted in order to prevent a more costly and humanly unattractive lengthening of the projected five-year observing program to a duration of some decades.

Seeger, C. L.↗
NASA NTRS2002

In search of new worlds: NASA's astronomical search for origins

This paper describes the missions, the scientific endeavors, and the network of technology investments that are the Navigator Program, and which are at the heart of the Astronomical Search for Origins.

origins navigator program exo-planets planet findi↗
NASA NTRS2016

Earthdata Search Client: Usability Review Process, Results, and Implemented Changes, Using Earthdata Search Client as a Case Study

User experience and visual design are greatly improved when usability testing is performed on a periodic basis. Design decisions should be tested by real users so that application owners can understand the effectiveness of each decision and identify areas for improvement. It is important that applications be tested not just once, but as a part of a continuing process that looks to build upon previous tests. NASA's Earthdata Search Client has undergone a usability study to ensure its users' needs are being met and that users understand how to use the tool efficiently and effectively. This poster will highlight the process followed for usability study, the results of the study, and what has been implemented in light of the results to improve the application's interface.

design↗
NASA NTRS2006

NASA Taxonomies for Searching Problem Reports and FMEAs

Many types of hazard and risk analyses are used during the life cycle of complex systems, including Failure Modes and Effects Analysis (FMEA), Hazard Analysis, Fault Tree and Event Tree Analysis, Probabilistic Risk Assessment, Reliability Analysis and analysis of Problem Reporting and Corrective Action (PRACA) databases. The success of these methods depends on the availability of input data and the analysts knowledge. Standard nomenclature can increase the reusability of hazard, risk and problem data. When nomenclature in the source texts is not standard, taxonomies with mapping words (sets of rough synonyms) can be combined with semantic search to identify items and tag them with metadata based on a rich standard nomenclature. Semantic search uses word meanings in the context of parsed phrases to find matches. The NASA taxonomies provide the word meanings. Spacecraft taxonomies and ontologies (generalization hierarchies with attributes and relationships, based on terms meanings) are being developed for types of subsystems, functions, entities, hazards and failures. The ontologies are broad and general, covering hardware, software and human systems. Semantic search of Space Station texts was used to validate and extend the taxonomies. The taxonomies have also been used to extract system connectivity (interaction) models and functions from requirements text. Now the Reconciler semantic search tool and the taxonomies are being applied to improve search in the Space Shuttle PRACA database, to discover recurring patterns of failure. Usual methods of string search and keyword search fall short because the entries are terse and have numerous shortcuts (irregular abbreviations, nonstandard acronyms, cryptic codes) and modifier words cannot be used in sentence context to refine the search. The limited and fixed FMEA categories associated with the entries do not make the fine distinctions needed in the search. The approach assigns PRACA report titles to problem classes in the taxonomy. Each ontology class includes mapping words - near-synonyms naming different manifestations of that problem class. The mapping words for Problems, Entities and Functions are converted to a canonical form plus any of a small set of modifier words (e.g. non-uniformity NOT + UNIFORM.) The report titles are parsed as sentences if possible, or treated as a flat sequence of word tokens if parsing fails. When canonical forms in the title match mapping words, the PRACA entry is associated with the corresponding Problem, Entity or Function in the ontology. The user can search for types of failures associated with types of equipment, clustering by type of problem (e.g., all bearings found with problems of being uneven: rough, irregular, gritty ). The results could also be used for tagging PRACA report entries with rich metadata. This approach could also be applied to searching and tagging failure modes, failure effects and mitigations in FMEAs. In the pilot work, parsing 52K+ truncated titles (the test cases that were available), has resulted in identification of both a type of equipment and type of problem in about 75% of the cases. The results are displayed in a manner analogous to Google search results. The effort has also led to the enrichment of the taxonomy, adding some new categories and many new mapping words. Further work would make enhancements that have been identified for improving the clustering and further reducing the false alarm rate. (In searching for recurring problems, good clustering is more important than reducing false alarms). Searching complete PRACA reports should lead to immediate improvement.

Malin, Jane T.↗
NASA NTRSDate not supplied

Search Enhancements using Natural Language Processing Techniques

NASA Goddard Earth Sciences Data and Information Services Center (GESDISC) is one of the 12 NASA Science Mission Directorate Data Centers. The main goal of GESDISC is to provide earth science data, information, and services to the earth science data community. Consequently, data discovery is at the center of our mission and our search engine is the primary tool for our users to interact, find, and access our data. Existing search approaches are largely focused on hard-matching of keywords in the search query with dataset metadata. Here we propose to expand the search by introducing a complementary natural language processing (NLP) search. At the heart of our proposed NLP search, we trained a joint embedding using scientific text corpus and a curated set of dataset metadata. The embedding learns the association between words in our dataset metadata and those of the scientific text corpus. This enables us to go beyond simple hard-matching of a query and data set metadata and have a notion of “similarity” between the search query and the datasets. We further integrated our NLP search into the Elastic Search (ES) framework leveraging similarity search capabilities offered through the “dense_vector” field type. Our preliminary evaluations show that our proposed NLP search has the potential to be utilized to complement the existing search engine and serve as a base for a dataset recommendation system.

Armin Mehrabian↗
NASA NTRS2012

A Search Model for Imperfectly Detected Targets

Under the assumptions that 1) the search region can be divided up into N non-overlapping sub-regions that are searched sequentially, 2) the probability of detection is unity if a sub-region is selected, and 3) no information is available to guide the search, there are two extreme case models. The search can be done perfectly, leading to a uniform distribution over the number of searches required, or the search can be done with no memory, leading to a geometric distribution for the number of searches required with a success probability of 1/N. If the probability of detection P is less than unity, but the search is done otherwise perfectly, the searcher will have to search the N regions repeatedly until detection occurs. The number of searches is thus the sum two random variables. One is N times the number of full searches (a geometric distribution with success probability P) and the other is the uniform distribution over the integers 1 to N. The first three moments of this distribution were computed, giving the mean, standard deviation, and the kurtosis of the distribution as a function of the two parameters. The model was fit to the data presented last year (Ahumada, Billington, & Kaiwi, 2 required to find a single pixel target on a simulated horizon. The model gave a good fit to the three moments for all three observers.

Ahumada, Albert↗