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.

SourceResearch connectionFrom yearThrough year

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

At least 55 records · Page 3

All sources NASA NTRS DOE OSTI

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↗

DOE OSTI2023

Differentiable Neural Architecture, Mixed Precision and Accelerator Co-Search

Quantization, effective Neural Network architecture, and efficient accelerator hardware are three important design paradigms to maximize accuracy and efficiency. Mixed Precision Quantization is a process of assigning different precision to different Neural Network layers for optimized inference. Neural Architecture Search (NAS) is a process of automatically designing the neural network for a task and can also be extended to search for the precision of each weight and activation matrix. In this paper, we develop the following three methods: (i) Fast Differentiable Hardware-aware Mixed Precision Quantization Search method to find optimal precision, (ii) Joint Differentiable hardware-aware Architecture and Mixed Precision Quantization Co-search, (iii) Joint Accelerator, Architecture, and Precision triple co-search to find best possibilities in all the three worlds. We demonstrate the effectiveness of our proposed methods targeting Bitfusion accelerator by searching mixed precision models on MobilenetV2. We achieve better accuracy-latency trade-off models than the manually designed and previously proposed search methods.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2024

A First Search for Argon-Bound Neutron-Antineutron Oscillation using the MicroBooNE LArTPC

The use of Liquid Argon Time Projection Chambers (LArTPCs) as a detector technology in neutrino experiments has grown considerably over the past two decades. The excellent spatial and calorimetric resolution offered by LArTPCs enable precise neutrino oscillation measurements as well as beyond-Standard Model searches. One such search, which is the focus of this note, is the search for nucleus-bound neutron-antineutron (n ₋ n̄) oscillation. The n ₋ n̄ oscillation process is a baryon number violating process that produces a unique, star-like topology as a result of multiple final state pions. This unique signature is a key feature that may be used to search for this signal process. This note describes a machine learning-based analysis of MicroBooNE data, making use of a sparse convolutional neural network to search for n ₋ n̄ oscillation-like signals in MicroBooNE. While the future DUNE LArTPC can search for this signature with high sensitivity, existing MicroBooNE data can be used to demonstrate and validate methodologies that can be used as part of the DUNE search. This document presents the first-ever search for n ₋ n̄ oscillation in a LArTPC, using MicroBooNE off-beam data (data collected when the neutrino beam was not running).

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

DOE OSTI2024

A first search for argon-bound neutron-antineutron oscillation using the MicroBooNE LArTPC

The use of Liquid Argon Time Projection Chambers (LArTPCs) as a detector technology in neutrino experiments has grown considerably over the past two decades. The excellent spatial and calorimetric resolution offered by LArTPCs enable precise neutrino oscillation measurements as well as beyond-Standard Model searches. One such search, which is the focus of this note, is the search for nucleus-bound neutron-antineutron (n – n̄) oscillation. The n – n̄ oscillation process is a baryon number violating process that produces a unique, star-like topology as a result of multiple final state pions. This unique signature is a key feature that may be used to search for this signal process. This note describes a machine learning-based analysis of MicroBooNE data, making use of a sparse convolutional neural network to search for n – n̄ oscillation-like signals in MicroBooNE. While the future DUNE LArTPC can search for this signature with high sensitivity, existing MicroBooNE data can be used to demonstrate and validate methodologies that can be used as part of the DUNE search. This document presents the first-ever search for n – n̄ oscillation in a LArTPC, using MicroBooNE off-beam data (data collected when the neutrino beam was not running).

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

DOE OSTI2024

Search for New Physics with the Compact Muon Solenoid Experiment and QIS-enabled Technology

Understanding the fundamental nature of dark matter (DM)---its cosmological origin, constituents, and interactions---is one of the most important questions in fundamental science today. In this thesis, I present two novel and highly complementary approaches to cover the gaps in sensitivity of current DM searches. The searches are enabled by a first-of-its-kind reconstruction technique to search for hidden-sector particles using the Compact Muon Solenoid (CMS) and by new advances in quantum sensing technology to search for axions and hidden-sector DM. In the first part of this thesis, I present a search for long-lived hidden sector particles, predicted by many extensions of the SM, using a novel technique to reconstruct decays of long-lived particles (LLPs) in the CMS muon detector. The innovative LLP reconstruction technique is sensitive to a broad range of LLP decays and to LLP masses below GeV. The search yields competitive sensitivity for proper lifetime 0.1--1000 m with the full Run 2 dataset recorded at the LHC between 2016--2018 at $\sqrt{s} = 13~$TeV. To extend the physics reach of this novel muon detector shower (MDS) signature, I present the model-independence of MDS and the reinterpretation of the search to a large number of LLP models, demonstrating its complementarity with proposed and existing dedicated LLP experiments. Finally, I present a new dedicated MDS trigger that improves the trigger efficiency by at least an order of magnitude and was deployed in 2022, at the start of Run 3 of the LHC operations. In the second part of the thesis, I present for the first time, the use of a novel quantum sensor, the low-noise and single-photon sensitive superconducting nanowire single photon detectors (SNSPDs), to directly detect dark matter. The low detection threshold and ultra-low dark count rate of SNSPDs can close the gap in DM discovery reach due to the current limitations in detector sensitivity. I will present my work on the development and characterization of SNSPDs for two entirely new experiments to directly detect axions via absorption and hidden-sector DM via electron scattering. The search for axions employs a novel broadband reflector technique with the Broadband Reflector Experiment for Axion Detection (BREAD). A unique parabolic mirror is then used to focus axion-converted photons to the SNSPDs, extending the reach to axion masses of 0.04--1 eV. On the other hand, by coupling the SNSPDs with gallium arsenide, a bright cryogenic scintillator well matched to SNSPD detection, a prototype sensing system can be built as a basis of new direct DM detection experiments capable of extending the discovery to DM masses as low as 1 MeV.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

NASA NTRS1977

Antenna concepts for interstellar search systems

An evaluation is made of microwave receiving systems designed to search for signals from extraterrestrial intelligence. Specific design concepts are analyzed parametrically to determine whether the optimum antenna system location is on earth, in space, or on the moon. Parameters considered include the hypothesized number of transmitting civilizations, the number of stars that must be searched to give any desired probability of receiving a signal, the antenna collecting area, the search time, the search range, and the cost. This analysis suggests that (1) search systems based on the moon are not cost-competitive, (2) if the search is extended only a few hundred light years from the earth, a Cyclops-type array on earth may be the most cost-effective system, (3) for a search extending to 500 light years or more, a substantial cost and search-time advantage can be achieved with a large spherical reflector in space with multiple feeds, (4) radio frequency interference shields can be provided for space systems, and (5) cost can range from a few hundred million to tens of billions of dollars, depending on the parameter values assumed.

Basler, R. P.↗

NASA NTRS1991

NASA-SETI microwave observing project: Targeted Search Element (TSE)

The Targeted Search Element (TSE) performs one of two complimentary search strategies of the NASA-SETI Microwave Observing Project (MOP): the targeted search. The principle objective of the targeted search strategy is to scan the microwave window between the frequencies of one and three gigahertz for narrowband microwave emissions eminating from the direction of 773 specifically targeted stars. The scanning process is accomplished at a minimum resolution of one or two Hertz at very high sensitivity. Detectable signals will be of a continuous wave or pulsed form and may also drift in frequency. The TSE will possess extensive radio frequency interference (RFI) mitigation and verification capability as the majority of signals detected by the TSE will be of local origin. Any signal passing through RFI classification and classifiable as an extraterrestrial intelligence (ETI) candidate will be further validated at non-MOP observatories using established protocol. The targeted search will be conducted using the capability provided by the TSE. The TSE provides six Targeted Search Systems (TSS) which independently or cooperatively perform automated collection, analysis, storage, and archive of signal data. Data is collected in 10 megahertz chunks and signal processing is performed at a rate of 160 megabits per second. Signal data is obtained utilizing the largest radio telescopes available for the Targeted Search such as those at Arecibo and Nancay or at the dedicated NASA-SETI facility. This latter facility will allow continuous collection of data. The TSE also provides for TSS utilization planning, logistics, remote operation, and for off-line data analysis and permanent archive of both the Targeted Search and Sky Survey data.

Webster, L. D.↗

NASA NTRS1997

When Gravity Fails: Local Search Topology

Local search algorithms for combinatorial search problems frequently encounter a sequence of states in which it is impossible to improve the value of the objective function; moves through these regions, called {\em plateau moves), dominate the time spent in local search. We analyze and characterize {\em plateaus) for three different classes of randomly generated Boolean Satisfiability problems. We identify several interesting features of plateaus that impact the performance of local search algorithms. We show that local minima tend to be small but occasionally may be very large. We also show that local minima can be escaped without unsatisfying a large number of clauses, but that systematically searching for an escape route may be computationally expensive if the local minimum is large. We show that plateaus with exits, called benches, tend to be much larger than minima, and that some benches have very few exit states which local search can use to escape. We show that the solutions (i.e. global minima) of randomly generated problem instances form clusters, which behave similarly to local minima. We revisit several enhancements of local search algorithms and explain their performance in light of our results. Finally we discuss strategies for creating the next generation of local search algorithms.

Frank, Jeremy↗

NASA NTRS2006

Controlled Vocabularies Boost International Participation and Normalization of Searches

The Global Change Master Directory's (GCMD) science staff set out to document Earth science data and provide a mechanism for it's discovery in fulfillment of a commitment to NASA's Earth Science progam and to the Committee on Earth Observation Satellites' (CEOS) International Directory Network (IDN.) At the time, whether to offer a controlled vocabulary search or a free-text search was resolved with a decision to support both. The feedback from the user community indicated that being asked to independently determine the appropriate 'English" words through a free-text search would be very difficult. The preference was to be 'prompted' for relevant keywords through the use of a hierarchy of well-designed science keywords. The controlled keywords serve to 'normalize' the search through knowledgeable input by metadata providers. Earth science keyword taxonomies were developed, rules for additions, deletions, and modifications were created. Secondary sets of controlled vocabularies for related descriptors such as projects, data centers, instruments, platforms, related data set link types, and locations, along with free-text searches assist users in further refining their search results. Through this robust 'search and refine' capability in the GCMD users are directed to the data and services they seek. The next step in guiding users more directly to the resources they desire is to build a 'reasoning' capability for search through the use of ontologies. Incorporating twelve sets of Earth science keyword taxonomies has boosted the GCMD S ability to help users define and more directly retrieve data of choice.

Olsen, Lola M.↗

NASA NTRS2008

Mirador: A Simple, Fast Search Interface for Remote Sensing Data

A major challenge for remote sensing science researchers is searching and acquiring relevant data files for their research projects based on content, space and time constraints. Several structured query (SQ) and hierarchical navigation (HN) search interfaces have been develop ed to satisfy this requirement, yet the dominant search engines in th e general domain are based on free-text search. The Goddard Earth Sci ences Data and Information Services Center has developed a free-text search interface named Mirador that supports space-time queries, inc luding a gazetteer and geophysical event gazetteer. In order to compe nsate for a slightly reduced search precision relative to SQ and HN t echniques, Mirador uses several search optimizations to return result s quickly. The quick response enables a more iterative search strateg y than is available with many SQ and HN techniques.

Lynnes, Christopher↗

NASA NTRS2010

World Wide Web Metaphors for Search Mission Data

A software program that searches and browses mission data emulates a Web browser, containing standard meta - phors for Web browsing. By taking advantage of back-end URLs, users may save and share search states. Also, since a Web interface is familiar to users, training time is reduced. Familiar back and forward buttons move through a local search history. A refresh/reload button regenerates a query, and loads in any new data. URLs can be constructed to save search results. Adding context to the current search is also handled through a familiar Web metaphor. The query is constructed by clicking on hyperlinks that represent new components to the search query. The selection of a link appears to the user as a page change; the choice of links changes to represent the updated search and the results are filtered by the new criteria. Selecting a navigation link changes the current query and also the URL that is associated with it. The back button can be used to return to the previous search state. This software is part of the MSLICE release, which was written in Java. It will run on any current Windows, Macintosh, or Linux system.

Norris, Jeffrey S.↗

NASA NTRS2010

Initialization and Restart in Stochastic Local Search: Computing a Most Probable Explanation in Bayesian Networks

For hard computational problems, stochastic local search has proven to be a competitive approach to finding optimal or approximately optimal problem solutions. Two key research questions for stochastic local search algorithms are: Which algorithms are effective for initialization? When should the search process be restarted? In the present work we investigate these research questions in the context of approximate computation of most probable explanations (MPEs) in Bayesian networks (BNs). We introduce a novel approach, based on the Viterbi algorithm, to explanation initialization in BNs. While the Viterbi algorithm works on sequences and trees, our approach works on BNs with arbitrary topologies. We also give a novel formalization of stochastic local search, with focus on initialization and restart, using probability theory and mixture models. Experimentally, we apply our methods to the problem of MPE computation, using a stochastic local search algorithm known as Stochastic Greedy Search. By carefully optimizing both initialization and restart, we reduce the MPE search time for application BNs by several orders of magnitude compared to using uniform at random initialization without restart. On several BNs from applications, the performance of Stochastic Greedy Search is competitive with clique tree clustering, a state-of-the-art exact algorithm used for MPE computation in BNs.

Mengshoel, Ole J.↗

NASA NTRS2013

Analysis of Multivariate Experimental Data Using A Simplified Regression Model Search Algorithm

A new regression model search algorithm was developed in 2011 that may be used to analyze both general multivariate experimental data sets and wind tunnel strain-gage balance calibration data. The new algorithm is a simplified version of a more complex search algorithm that was originally developed at the NASA Ames Balance Calibration Laboratory. The new algorithm has the advantage that it needs only about one tenth of the original algorithm's CPU time for the completion of a search. In addition, extensive testing showed that the prediction accuracy of math models obtained from the simplified algorithm is similar to the prediction accuracy of math models obtained from the original algorithm. The simplified algorithm, however, cannot guarantee that search constraints related to a set of statistical quality requirements are always satisfied in the optimized regression models. Therefore, the simplified search algorithm is not intended to replace the original search algorithm. Instead, it may be used to generate an alternate optimized regression model of experimental data whenever the application of the original search algorithm either fails or requires too much CPU time. Data from a machine calibration of NASA's MK40 force balance is used to illustrate the application of the new regression model search algorithm.

multivariate experimental data↗

NASA NTRS2021

A Uniform Search for Nearby Planetary Companions to Hot Jupiters in TESS Data Reveals Hot Jupiters Are Still Lonely

We present the results of a uniform search for additional planets around all stars with confirmed hot Jupiters observed by the Transiting Exoplanet Survey Satellite (TESS) in its Cycle 1 survey of the southern ecliptic hemisphere. Our search comprises 184 total planetary systems with confirmed hot Jupiters with Rp > 8 R⊕ and orbital period <10 days. The Transit Least Squares algorithm was utilized to search for periodic signals that may have been missed by other planet search pipelines. While we recovered 169 of these confirmed hot Jupiters, our search yielded no new statistically validated planetary candidates in the parameter space searched (P < 14 days). A lack of planet candidates nearby hot Jupiters in the TESS data supports results from previous transit searches of each individual system, now down to the photometric precision of TESS. This is consistent with expectations from a high-eccentricity migration formation scenario, but additional formation indicators are needed for definitive confirmation. We injected transit signals into the light curves of the hot Jupiter sample to probe the pipeline's sensitivity to the target parameter space, finding a dependence proportional to ${R}_{p}^{2.32}{P}^{-0.88}$ for planets within 0.3 ≤ Rp ≤ 4 R⊕ and 1 ≤ P ≤ 14 days. A statistical analysis accounting for this sensitivity provides a median and 90% confidence interval of ${7.3}_{-7.3}^{+15.2} \% $ for the rate of hot Jupiters with nearby companions in this target parameter space. This study demonstrates how TESS uniquely enables comprehensive searches for nearby planetary companions to nearly all the known hot Jupiters.

Benjamin J Hord↗

DOE OSTI2022

Search for Lepton Flavor Violation in Two Body Muon and Pion Decay at Rest

The ability of the Mu2e experiment to probe, or discover beyond the Standard Model physics in direct Charged Lepton Flavor Violation $\mu^+$ and $\pi^+$ decay modes is estimated. These direct modes are searched for simultaneously with proposed Mu2e detector validation runs, and are complementary to the Mu2e main search goal, an indirect search for $\mu^- \to e^-$ conversion at the sensitivity level of $\sim 10^{-17}$. The $\mu^+$ validation run will operate at 50% nominal magnetic field and reduced proton beam intensity to less than 1/100th nominal, in order to observe the e+ spectrum from $\mu^+$ decay, at and below the Michel edge Ee . 53 MeV. The $\pi^+$ validation run, based on measuring the mono-energetic e+ emission in the decay $\pi^+ \to e+\nu$, at 76% of nominal magnetic field and reduced beam intensity less than 1/5th nominal. Both of these runs can be used to fix the momentum scale for the Mu2e conversion search. In addition the muon validation dataset can be used to correct for systematic errors in the detector response by mapping the well known to O(\u03B13) corrected theoretical Michel spectrum, to the observed spectrum. One direct search is for two-body Charged Lepton Flavor Violation $\mu^+ \to e^+X$ decay, where $X$ is a light new physics particle. This allows Mu2e to explore well motivated models including axion like particles with flavor violating couplings and massive $Z^0$ bosons with more sensitivity then present astrophysical and laboratory constraints. In two weeks of data-taking, Mu2e can achieve direct mode 90% confidence level branching ratio limits of $10^{-7}$ over the mass range $20 \le m_X \le 50$ MeV, improving the current experimental limit at $10^{-5}$ by two orders of magnitude. In the mass range $m_X \le 20$ MeV, assuming systematic error corrections can be made by correcting the Monte Carlo mapping, the achievable search sensitivity is found to be $2.3\times 10^{-7}$ for $m_X =0$, an order of magnitude improvement over the current best limit at $2.6\times 10^{-6}$, when assuming $V+A$ or isotropic coupling. The $\pi^+$ validation run, allows searching for $\pi^+ \to e^+N$ decay, where $N$ is a heavy neutral lepton such as a heavy sterile neutrino, in the mass region $20 \le m_N \le 65$ MeV. A branching ratio limit at 90% confidence level of $3\times 10^{-8}$ can be achieved in two weeks, an improvement of the current search sensitivity limit by an order of magnitude.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

DOE OSTI2024

Searches for Higgs boson production through decays of heavy resonances

The discovery of the Higgs boson has led to new possible signatures for heavy resonance searches at the LHC. Since then, search channels including at least one Higgs boson plus another particle have formed an important part of the program of new physics searches. In this report, the status of these searches by the CMS Collaboration is reviewed. Searches are discussed for resonances decaying to two Higgs bosons, a Higgs and a vector boson, or a Higgs boson and another new resonance. All analyses use proton–proton collision data collected at $\sqrt{s} = 13$ TeV in the years 2016–2018. A combination of the results of these searches is presented together with constraints on different beyond-the-standard model scenarios, including scenarios with extended Higgs sectors, heavy vector bosons and extra dimensions. Studies are shown for the first time by CMS on the validity of the narrow-width approximation in searches for the resonant production of a pair of Higgs bosons. The potential for a discovery at the High Luminosity LHC is also discussed.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

DOE OSTI2026

RCSB protein data Bank: Next‐generation advanced search for exploration of experimental structures and computed structure models

Abstract The Protein Data Bank (PDB), established in 1971, is the primary global, open‐access archive for experimentally determined 3D macromolecular structures (proteins, RNA, DNA). The research‐focused RCSB.org web‐portal provides access to these data alongside more than one million machine‐learning‐predicted structure models, greatly expanding the available structural landscape. Rapid growth of both experimental and computational structures has increased the need for powerful yet accessible search tools that serve a broad and diverse scientific community. Herein, we describe a redesigned RCSB Protein Data Bank RCSB.org Advanced Search capability that supports intuitive discovery of 3D structures through a unified interface. This interface integrates annotation‐, sequence‐, and 3D structure‐based searches, embeds an interactive 3D viewer, and incorporates curated biological knowledge, such as catalytic site definitions from Mechanism and Catalytic Site Atlas and ligand‐guided structural motifs, for constructing geometry‐driven queries. A new Chemical Search tool allows definition of chemical queries via an integrated drawing tool or standard identifiers, seamlessly combining them with annotation filters. By allowing query definition directly within spatial and chemical contexts, these search interfaces reduce the need for detailed knowledge of residue numbering, chain identifiers, or external cheminformatics software. This capability enables efficient exploration of structures, chemical diversity, and structure–function relationships across all life domains. The redesigned interfaces can be accessed directly at rcsb.org/search/advanced for Advanced Search and rcsb.org/search/chemical for Chemical Search.

Rose, Yana [Research Collaboratory for Structural ↗