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 37 records · Page 2
All sourcesNASA NTRSDOE OSTI
DOE OSTI2022

Pair Invariant Mass to Isolate Background in the Search for the Chiral Magnetic Effect in Au+Au Collisions at √sNN = 200 GeV

Quark interactions with topological gluon configurations can induce local chirality imbalance and parity violation in quantum chromodynamics, which can lead to the chiral magnetic effect (CME)-an electric charge separation along the strong magnetic field in relativistic heavy-ion collisions. The CME-sensitive azimuthal correlator observable (Delta gamma) is contaminated by background arising, in part, from resonance decays coupled with elliptic anisotropy (v(2)). We report here differential measurements of the correlator as a function of the pair invariant mass (m(inv)) in 20-50% centrality Au + Au collisions at root s(NN) = 200 GeV by the STAR experiment at the BNL Relativistic Heavy Ion Collider. Strong resonance background contributions to Delta gamma. are observed. At large m(inv) where this background is significantly reduced, the Delta gamma. value is found to be significantly smaller. An event-shape-engineering technique is deployed to determine the v(2) background shape as a function of m(inv). We extract a v(2)-independent and m(inv)-averaged signal Delta gamma(sig) = (0.03 +/- 0.06 +/- 0.08) x 10(-4), or (2 +/- 4 +/- 5)% of the inclusive Delta gamma (m(inv) > 0.4 GeV/c(2)) = (1.58 +/- 0.02 +/- 0.02) x 10(-4), within pion p(T) = 0.2-0.8 GeV/c and averaged over pseudorapidity ranges of -1 < eta < -0.05 and 0.05 < eta < 1. This represents an upper limit of 0.23 x 10(-4), or 15% of the inclusive result, at 95% confidence level for the m(inv)-integrated CME contribution.

Adam, J.↗
DOE OSTI2022

Search for lightly ionizing particles in superCDMS and simulation of neutron backgrounds

The Super Cryogenic Dark Matter Search (SuperCDMS) is a direct-detection dark matter search experiment that primarily aims to search for Weakly Interacting Massive Particles (WIMPs) using state-of-the-art solid-state detection technology. During its operation at the Soudan underground laboratory, germanium detectors were operated with high bias voltage mode known as the CDMS low ionization threshold experiment (CDMSlite) to achieve below-keV thresholds. CDMSlite, for being able to measure small energy depositions in detectors, also provides sensitivity to Lightly Ionizing Particles (LIPs) with very small fractional charges. This thesis will discuss an analysis to search LIPs with the data acquired in CDMSlite mode. An important component for LIPs search is the expected energy-deposition distributions for LIPs falling on the CDMSlite detector. In this thesis, a simulation framework to calculate the energy-deposition distributions is developed. This thesis presents first direct-detection limits on the intensity of cosmogenic LIPs with electric charges smaller than e/(3 × 105) as well as the strongest limits for charges ≤ e/160, with a minimum intensity of 1.36 × 10-7 cm-2s-1sr-1 at charge e/160.In any rare-event search experiment, understanding background is crucial. Neutrons capable of mimicking dark matter signals are a major background for any dark matter search experiment. A simulationmore » study to estimate the neutron background for an India based dark matter search experiment at Jaduguda Underground Science Laboratory (JUSL) is performed. The experiment at JUSL will be the first phase of a proposed Dark matter search at India-based Neutrino Observatory (DINO). It will be a direct detection experiment with primary aims to search for WIMPs as dark matter candidates. In this thesis, we discuss the methodology of estimating neutron flux at JUSL and report the results. The total neutron flux reaching the laboratory above 1 MeV energy threshold is found to be 5.76(±0.69) × 10-6 cm-2s-1. The impact of neutron background on the sensitivity of the experiment to detect dark matter at JUSL is also discussed. The thesis is organized as follows. Chapter 1 provides a brief introduction to the Lightly Ionizing Particle (LIPs). The analysis to search LIPs in SuperCDMS is briefly outlined in the chapter. This chapter also discusses the importance of neutron background estimates in a dark matter search experiment, more specifically, in the context of a proposed India-based dark matter search experiment at Jaduguda Underground Science Laboratory. In Chapter 2, the SuperCDMS experiment is introduced. In Chapter 3, the framework developed to perform simulations for Lightly Ionizing Particles is presented. In Chapter 4, the LIPs search analysis with the CDMSlite data and the results are discussed. In Chapter 5, the simulation of neutron background and the feasibility of dark-matter search at JUSL is discussed. Finally, conclusions from all the results discussed in this thesis are presented in Chapter 6.« less

Banik, Samir↗
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↗
DOE OSTI2024

Neural architecture search via similarity adaptive guidance

Evolutionary neural network architecture search (ENAS) has attracted the attention of many experts due to its global optimization capabilities to automatically search for convolutional neural network architectures based on the target task. The current search space for ENAS is not to design a fully structured network, but to search for smaller cell architectures to reduce search costs. However, blind search strategies do not effectively utilize the potential experience of the population. In order to utilize the potential experience learned by the current population to guide the evolutionary search of the population, we propose a similarity guided neural network architecture search algorithm based on cell architecture, which utilizes the similarity between pairwise architectures in the population as empirical knowledge learned by the population. Our proposed algorithm provides a novel method for calculating architecture similarity, which calculates architecture similarity separately from the cell and macro-structure. Then we decouple the connections and operations in the cell and calculate connection and operation similarity separately. In addition, we propose adaptive similarity selection and binary tournament selection strategies to enhance the algorithm’s global and local search capabilities and effectively explore the search space. Finally, we design an improved single-point crossover operator to enhance the local search ability of the evolutionary operator. The experimental results show that SAGNAS is a competitive algorithm that achieves 97.44% and 81.60% in CIFAR10 and CIFAR100 with only 1.9 GPU-days spent.

97 MATHEMATICS AND COMPUTING↗
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↗
DOE OSTI2024

The Influence of the Number of Tree Searches on Maximum Likelihood Inference in Phylogenomics

Maximum likelihood (ML) phylogenetic inference is widely used in phylogenomics. As heuristic searches most likely find suboptimal trees, it is recommended to conduct multiple (e.g., 10) tree searches in phylogenetic analyses. However, beyond its positive role, how and to what extent multiple tree searches aid ML phylogenetic inference remains poorly explored. Here, we found that a random starting tree was not as effective as the BioNJ and parsimony starting trees in inferring the ML gene tree and that RAxML-NG and PhyML were less sensitive to different starting trees than IQ-TREE. We then examined the effect of the number of tree searches on ML tree inference with IQ-TREE and RAxML-NG, by running 100 tree searches on 19,414 gene alignments from 15 animal, plant, and fungal phylogenomic datasets. We found that the number of tree searches substantially impacted the recovery of the best-of-100 ML gene tree topology among 100 searches for a given ML program. In addition, all of the concatenation-based trees were topologically identical if the number of tree searches was ≥10. Quartet-based ASTRAL trees inferred from 1 to 80 tree searches differed topologically from those inferred from 100 tree searches for 6/15 phylogenomic datasets. Lastly, our simulations showed that gene alignments with lower difficulty scores had a higher chance of finding the best-of-100 gene tree topology and were more likely to yield the correct trees.

59 BASIC BIOLOGICAL SCIENCES↗
NASA NTRS1992

ISE: An Integrated Search Environment. The manual

Integrated Search Environment (ISE), a software package that implements hierarchical searches with meta-control, is described in this manual. ISE is a collection of problem-independent routines to support solving searches. Mainly, these routines are core routines for solving a search problem and they handle the control of searches and maintain the statistics related to searches. By separating the problem-dependent and problem-independent components in ISE, new search methods based on a combination of existing methods can be developed by coding a single master control program. Further, new applications solved by searches can be developed by coding the problem-dependent parts and reusing the problem-independent parts already developed. Potential users of ISE are designers of new application solvers and new search algorithms, and users of experimental application solvers and search algorithms. The ISE is designed to be user-friendly and information rich. In this manual, the organization of ISE is described and several experiments carried out on ISE are also described.

Chu, Lon-Chan↗
NASA NTRS2012

Time-Dependent Searches for Point Sources of Neutrinos with the 40-String and 22-String Configurations of IceCube

This paper presents four searches for flaring sources of neutrinos using the IceCube neutrino telescope. For the first time, a search is performed over the entire parameter space of energy, direction and time with sensitivity to neutrino flares lasting between 20 microseconds and a year duration from astrophysical sources. Searches which integrate over time are less sensitive to flares because they are affected by a larger background of atmospheric neutrinos and muons that can be reduced by the use of additional timing information. Flaring sources considered here, such as active galactic nuclei, soft gamma ray repeaters and gamma-ray bursts, are promising candidate neutrino emitters. Two searches are untriggered in the sense that they look for any possible flare in the entire sky and from a predefined catalog of sources from which photon flares have been recorded. The other two searches are triggered by multi-wavelength information on flares from blazars and from a soft gamma-ray repeater. One triggered search uses lightcurves from Fermi-LAT which provides continuous monitoring. A second triggered search uses information where the flux states have been measured only for short periods of time near the flares. The untriggered searches use data taken by 40 strings of IceCube between Apr 5, 2008 and May 20, 2009. The triggered searches also use data taken by the 22-string configuration of IceCube operating between May 31, 2007 and Apr 5, 2008. The results from all four searches are compatible with a fluctuation of the background.

Stamatikos, M.↗
NASA NTRS2012

Time-Dependent Searches for Point Sources of Neutrinos with the 4O-String and 22-String Configurations of IceCube

This paper presents four searches for flaring sources of neutrinos using the IceCube neutrino telescope. For the first time, a search is performed over the entire parameter space of energy, direction, and time with sensitivity to neutrino flares lasting between 20 micro-s and a year duration from astrophysical sources. Searches that integrate over time are less sensitive to flares because they are affected by a larger background of atmospheric neutrinos and muons that can be reduced by the use of additional timing information. Flaring sources considered here, such as active galactic nuclei, soft gamma-ray repeaters, and gamma-ray bursts, are promising candidate neutrino emitters. Two searches are "untriggered" in the sense that they look for any possible flare in the entire sky and from a predefined catalog of sources from which photon flares have been recorded. The other two searches are triggered by multi-wavelength information on flares from blazars and from a soft gamma-ray repeater. One triggered search uses lightcurves from Fermi-LAT which provides continuous monitoring. A second triggered search uses information where the flux states have been measured only for short periods of time near the flares. The untriggered searches use data taken by 40 strings of IceCube between 2008 April 5 and 2009 May 20. The triggered searches also use data taken by the 22-string configuration of IceCube operating between 2007 May 31 and 2008 April 5. The results from all four searches are compatible with a fluctuation of the background.

Abbasi, R.↗
NASA NTRS2013

Methods and Results of a Search for Gravitational Waves Associated with Gamma-Ray Bursts Using the GEO 600, LIGO, and Virgo Detectors

In this paper we report on a search for short-duration gravitational wave bursts in the frequency range 64 Hz-1792 Hz associated with gamma-ray bursts (GRBs), using data from GEO600 and one of the LIGO or Virgo detectors. We introduce the method of a linear search grid to analyze GRB events with large sky localization uncertainties such as the localizations provided by the Fermi Gamma-ray Burst Monitor (GBM). Coherent searches for gravitational waves (GWs) can be computationally intensive when the GRB sky position is not well-localized, due to the corrections required for the difference in arrival time between detectors. Using a linear search grid we are able to reduce the computational cost of the analysis by a factor of O(10) for GBM events. Furthermore, we demonstrate that our analysis pipeline can improve upon the sky localization of GRBs detected by the GBM, if a high-frequency GW signal is observed in coincidence. We use the linear search grid method in a search for GWs associated with 129 GRBs observed satellite-based gamma-ray experiments between 2006 and 2011. The GRBs in our sample had not been previously analyzed for GW counterparts. A fraction of our GRB events are analyzed using data from GEO600 while the detector was using squeezed-light states to improve its sensitivity; this is the first search for GWs using data from a squeezed-light interferometric observatory. We find no evidence for GW signals, either with any individual GRB in this sample or with the population as a whole. For each GRB we place lower bounds on the distance to the progenitor, assuming a fixed GW emission energy of 10(exp -2)Stellar Mass sq c, with a median exclusion distance of 0.8 Mpc for emission at 500 Hz and 0.3 Mpc at 1 kHz. The reduced computational cost associated with a linear search grid will enable rapid searches for GWs associated with Fermi GBM events in the Advanced detector era.

methods↗
NASA NTRS2019

All-Sky Search for Short Gravitational-Wave Bursts in the Second Advanced LIGO and Advanced Virgo Run

We present the results of a search for short-duration gravitational-wave transients in the data from the second observing run of Advanced LIGO and Advanced Virgo. We search for gravitational-wave transients with a duration of milliseconds to approximately one second in the 32–4096 Hz frequency band with minimal assumptions about the signal properties, thus targeting a wide variety of sources. We also perform a matched-filter search for gravitational-wave transients from cosmic string cusps for which the waveform is well modeled. The unmodeled search detected gravitational waves from several binary black hole mergers which have been identified by previous analyses. No other significant events have been found by either the unmodeled search or the cosmic string search. We thus present the search sensitivities for a variety of signal waveforms and report upper limits on the source rate density as a function of the characteristic frequency of the signal. These upper limits are a factor of 3 lower than the first observing run, with a 50% detection probability for gravitational-wave emissions with energies of ∼10−9 𝑀⊙⁢𝑐2 at 153 Hz. For the search dedicated to cosmic string cusps we consider several loop distribution models, and present updated constraints from the same search done in the first observing run.

B P Abbott↗