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 73 records · Page 4
All sourcesNASA NTRSDOE OSTI
DOE OSTI2025

Mechanical sensors for ultraheavy dark matter searches via long-range forces

Dark matter candidates with masses around the Planck scale are theoretically well-motivated, and it has been suggested that it might be possible to search for dark matter solely via gravitational interactions in this mass range. In this work, we explore the pathway towards searching for dark matter candidates with masses around the Planck scale using mechanical sensors while considering realistic experimental constraints, and develop analysis techniques needed to conduct such searches. These dark matter particles are expected to leave tracks as their signature in mechanical sensor arrays, and we show that we can effectively search for such tracks using statistical approaches to track-finding. We analyze a range of possible experimental setups and compute sensitivity projections for searches for ultraheavy dark matter coupling to the Standard Model via long-range forces. We find that while a search for Planck-scale dark matter purely via gravitational couplings would be exceedingly difficult, requiring ∼80 dB of quantum noise reduction with a 100 3 array of devices, there is a wide range of currently unexplored dark matter candidates which can be searched for with already existing or near-term experimental platforms.

Qin, Juehang [Rice Univ., Houston, TX (United Stat↗
DOE OSTI2021

Optimizing FPGA-based Accelerator Design for Large-Scale Molecular Similarity Search (Special Session Paper)

Molecular similarity search has been widely used in drug discovery to rapidly identify structurally similar compounds from large molecular databases. With the increasing size of chemical libraries, there is growing interest in the efficient ac- celeration of large-scale similarity search. Existing works mainly focus on CPU and GPU to accelerate the computation of Tatimoto coefficient in measuring the pairwise similarity between different molecular fingerprints. In this paper, we propose and optimize an FPGA-based accelerator design on exhaustive and approximate search algorithms. On exhaustive search using BitBound & fold- ing, we analyze the similarity cutoff and folding level relationship with search speedup and accuracy, and propose a scalable on- the-fly query engine on FPGAs to reduce the resource utilization and pipeline interval. We achieve a 450 million compounds-per- second processing throughput for a single query engine. On approximate search using hierarchical navigable small world (HNSW), a popular algorithm with high recall and query speed, we propose an FPGA-based graph traversal engine to utilize high throughput register array based priority queue and fine- grained distance calculation engine to increase the processing capability. Experimental results show that the proposed FPGA- based HNSW implementation achieves a 35× speedup than existing works on CPU. To the best of our knowledge, our FPGA- based implementation is the first attempt to accelerate molecular similarity search on FPGA and has the highest performance among existing approaches.

Peng, Hongwu↗
DOE OSTI2021

An Indirect Search for Weakly Interacting Massive Particles in the Sun Using Upward-going Muons in NOvA

I present the first Dark Matter search results using the full data set collected with the upward-going muon trigger in NOvA. Weakly Interactive Massive Particles (WIMPs) are a theoretical non-baryonic form of Dark Matter. The nature of Dark Matter is one of the most exciting open questions in modern physics. Though its existence can be inferred by astrophysical evidence, its properties are not yet understood. If we assume that Dark Matter particles can produce Standard Model particles through their interactions, an indirect search can help shed light on this mystery.The NOvA collaboration has built a 14 kton, fine-grained, low-Z, total absorption tracking calorimeter at an off-axis angle to the NuMI neutrino beam. Even though the detector is optimized to observe electron neutrino appearance from a muon neutrino beam, it has a unique potential for more exotic searches given its excellent granularity and energy resolution and relatively low-energy neutrino thresholds. In fact, with an efficient upward-going muon trigger and sufficient background suppression offline, NOvA is capable of a competitive indirect Dark Matter search for low-mass WIMPs.The idea of the upward-going muon trigger is first to select high-quality muon tracks, then use the timing information of all of the hits of each track to estimate directionality. In this way, the background flux is suppressed by more than a factor of 10^5 at trigger level to a rate of approximately 1 Hz. To further optimize this search, we use only upward-going muons that point to the Sun, so our search occurs at night when the Sun is on the other side of the Earth. This strategy also allows us to use the time when the Sun is above the horizon as a control region to estimate the background. Ultimately, implementation of a cut based and maximum likelihood analysis provides a powerful tool for rejecting background and selecting a sample of neutrino-induced upward-going muons. The overall background rejection power achieved by the analysis is substantial and impressive. Starting with approximately 150,000 events per second, we reduced it to 40 events per year. Since no statistically significant excess was found, a 90\% C.L. upper limit on the expected muon flux of upward-going muons has been set using the upper limit on the number of events given the number of observed events in the signal region. Lastly, by assuming the theory behind the upward-going muon flux, a limit on the WIMP-nucleon spin-dependent cross-section in the Sun was estimated. Although the limits on the spin-dependent cross-section do not appear to be competitive with previous indirect Dark Matter searches, the upward-going muon flux limits are promising. The upward-going muon flux limits could extend these results to a broader class of models that are not specific to the dark matter theory but produce upward-going muons, leading to competitive results.

Principato, Cristiana↗
DOE OSTI2021

Searching for Interstellar Quantum Communications

The modern search for extraterrestrial intelligence began with the seminal publications of Cocconi & Morrison and Schwartz & Townes, who proposed searching for narrowband signals in the radio spectrum and optical laser pulses. Over the last six decades, more than 100 dedicated search programs have targeted these wavelengths, all with null results. All of these campaigns searched for classical communications, that is, for a significant number of photons above a noise threshold, with the assumption of a pattern encoded in time and/or frequency space. I argue that future searches should also target quantum communications. They are preferred over classical communications with regard to security and information efficiency, and they would have escaped detection in all previous searches. The measurement of Fock state photons or squeezed light would indicate the artificiality of a signal. I show that quantum coherence is feasible over interstellar distances and explain for the first time how astronomers can search for quantum transmissions sent by ETI to Earth using commercially available telescopes and receiver equipment.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2021

Searching for Dwarf Galaxies in Gaia DR2 Phase-space Data Using Wavelet Transforms

We present a wavelet-based algorithm to identify dwarf galaxies in the Milky Way in Gaia DR2 data. Our algorithm detects overdensities in 4D position–proper-motion space, making it the first search to explicitly use velocity information to search for dwarf galaxy candidates. We optimize our algorithm and quantify its performance by searching for mock dwarfs injected into Gaia DR2 data and for known Milky Way satellite galaxies. Comparing our results with previous photometric searches, we find that our search is sensitive to undiscovered systems at Galactic latitudes |b| > 20° and with half-light radii larger than the 50% detection efficiency threshold for Pan-STARRS1 (PS1) at (i) absolute magnitudes of –7 < M V < –3 and distances of 32 kpc < D < 64 kpc, and (ii) M V < –4 and 64 kpc < D < 128 kpc. Based on these results, we predict that our search is expected to discover 5 ± 2 new satellite galaxies: four in the PS1 footprint and one outside the Dark Energy Survey and PS1 footprints. We apply our algorithm to the Gaia DR2 data set and recover ~830 high-significance candidates, out of which we identify a "gold standard" list of ~200 candidates based on cross-matching with potential candidates identified in a preliminary search using Gaia EDR3 data. All of our candidate lists are publicly distributed for future follow-up studies. Here, we show that improvements in astrometric measurements provided by Gaia EDR3 increase the sensitivity of this technique; we plan to continue to refine our candidate list using future data releases.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2024

A Targeted Search for Variable Gravitationally Lensed Quasars

We present a pipeline to identify photometric variability within strong gravitationally lensing candidates, in the Dark Energy Spectroscopic Instrument Legacy Imaging Surveys. In our first paper, we laid out our pipeline and presented seven new gravitationally lensed supernovae candidates in a retrospective search. In this companion paper, we apply a modified version of that pipeline to search for gravitationally lensed quasars. From a sample of 5807 strong lenses, we have identified 13 new gravitationally lensed quasar candidates (three of them quadruply lensed). We note that our methodology differs from most lensed quasar search algorithms that solely rely on the morphology, location, and color of the candidate systems. By also accounting for the temporal photometric variability of the posited lensed images in our search via difference imaging, we have discovered new lensed quasar candidates. While variability searches using difference imaging algorithms have been done in the past, they are typically performed over vast swathes of the sky, whereas we specifically target strong gravitationally lensed candidates. We also have applied our pipeline to 655 known gravitationally lensed quasar candidates from past lensed quasar searches, of which we identified 13 that display significant variability (one of them quadruply lensed). This pipeline demonstrates a promising search strategy to discover gravitationally lensed quasars in other existing and upcoming surveys.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2025

Data release for A search for extremely-high-energy neutrinos and first constraints on the ultra-high-energy cosmic-ray proton fraction with IceCube

<h1 id="summary">Summary</h1> <p>Title: Data Release for A search for extremely-high-energy neutrinos and first constraints on the ultra-high-energy cosmic-ray proton fraction with IceCube</p> <p>The IceCube observatory analyzed 12.6 years of data in search of extremely-high-energy (EHE) neutrinos above 5 PeV. The resultant limit of the search (Fig 1), and the effective area of the event selection (Fig 7), are provided in this data release.</p> <h1 id="contents">Contents</h1> <ul> <li><p>README file: this file</p> </li> <li><p><code>differential_limit_and_sensitivity.csv</code>: a comma separated value file, giving the observed experimental differential limit, and sensitivity, of the search as a function of neutrino energy. This is the content of Fig 1 in the paper. The first column is the neutrino energy in GeV. The second column is the limit in units of GeV/cm2/s/sr. The third column is the sensitivity in units of GeV/cm2/s/sr.</p> </li> <li><p><code>effective_area.csv</code>: a comma separated value file, giving the effective area of the search as a function of energy. This is the content of Fig 7 in the paper. The first column is the neutrino energy in GeV. The second column is the total effective area of the search, summed across neutrino flavors, and averaged across neutrinos and antineutrinos, in meters-squared. The third column is the effective area of the search for the average of electron neutrino and electron antineutrinos in units of meters-squared. The fourth column is the same as the third, but for muon-flavor neutrinos. The fifth column is the same as the third and fourth, but for tau-flavor neutrinos.</p> </li> <li><p><code>demo.py</code>: a short python script to demonstrate how to read the files. Run like <code>python demo.py</code>. A standard base python installation is sufficient, as the only dependencies are numpy and matplotlib.</p> </li> </ul> <h1 id="contacts">Contacts</h1> <p>For any questions about this data release, please write to analysis@icecube.wisc.edu</p>

Astronomy and Astrophysics↗
NASA NTRS1981

Optimal searches for asteroids

Optimal searches for a fixed object are discussed, and the rigorous analytical results of discrete search theory are presented. The totally optimal, the uniformly optimal, the locally optimal, and the fastest searches are shown to be identical under not too restrictive assumptions. The mathematical formalism is illustrated by an Earth-approaching asteroid search and optimal searches for such objects are explicitly constructed. The approximation that Earth-approaching asteroids are fixed is equivalent to having a very high ( equiv 100 sq degs/hour) search rate. Generalizations to other types of astronomical search are briefly mentioned.

Taff, L. G.↗
NASA NTRS1984

Optimal searches for asteroids

Optimal searches for a fixed object are discussed, and the rigorous analytical results of discrete search theory are presented. The totally optimal, the uniformly optimal, the locally optimal, and the fastest searches are shown to be identical under not too restrictive assumptions. The mathematical formalism is illustrated by an earth-approaching asteroid search and optimal searches for such objects are explicitly constructed. The approximation that earth-approaching asteroids are fixed is equivalent to having a very high (equiv 100 sq degs/hour) search rate. Generalizations to other types of astronomical search are briefly mentioned. Previously announced in STAR as N83-34657

Taff, L. G.↗
NASA NTRS1985

'Meatball searching' - The adversarial approach to online information retrieval

It is proposed that the different styles of online searching can be described as either formal (highly precise) or informal with the needs of the client dictating which is most applicable at a particular moment. The background and personality of the searcher also come into play. Particular attention is focused on meatball searching which is a form of online searching characterized by deliberate vagueness. It requires generally comprehensive searches, often on unusual topics and with tight deadlines. It is most likely to occur in search centers serving many different disciplines and levels of client information sophistication. Various information needs are outlined as well as the laws of meatball searching and the adversarial approach. Traits and characteristics important to sucessful searching include: (1) concept analysis, (2) flexibility of thinking, (3) ability to think in synonyms and (4) anticipation of variant word forms and spellings.

Jack, R. F.↗
NASA NTRS1991

Display format, highlight validity, and highlight method: Their effects on search performance

Display format and highlight validity were shown to affect visual display search performance; however, these studies were conducted on small, artificial displays of alphanumeric stimuli. A study manipulating these variables was conducted using realistic, complex Space Shuttle information displays. A 2x2x3 within-subjects analysis of variance found that search times were faster for items in reformatted displays than for current displays. Responses to valid applications of highlight were significantly faster than responses to non or invalidly highlighted applications. The significant format by highlight validity interaction showed that there was little difference in response time to both current and reformatted displays when the highlight validity was applied; however, under the non or invalid highlight conditions, search times were faster with reformatted displays. A separate within-subject analysis of variance of display format, highlight validity, and several highlight methods did not reveal a main effect of highlight method. In addition, observed display search times were compared to search time predicted by Tullis' Display Analysis Program. Benefits of highlighting and reformatting displays to enhance search and the necessity to consider highlight validity and format characteristics in tandem for predicting search performance are discussed.

Donner, Kimberly A.↗
NASA NTRS1993

Methods and means used in programming intelligent searches of technical documents

In order to meet the data research requirements of the Safety, Reliability & Quality Assurance activities at Kennedy Space Center (KSC), a new computer search method for technical data documents was developed. By their very nature, technical documents are partially encrypted because of the author's use of acronyms, abbreviations, and shortcut notations. This problem of computerized searching is compounded at KSC by the volume of documentation that is produced during normal Space Shuttle operations. The Centralized Document Database (CDD) is designed to solve this problem. It provides a common interface to an unlimited number of files of various sizes, with the capability to perform any diversified types and levels of data searches. The heart of the CDD is the nature and capability of its search algorithms. The most complex form of search that the program uses is with the use of a domain-specific database of acronyms, abbreviations, synonyms, and word frequency tables. This database, along with basic sentence parsing, is used to convert a request for information into a relational network. This network is used as a filter on the original document file to determine the most likely locations for the data requested. This type of search will locate information that traditional techniques, (i.e., Boolean structured key-word searching), would not find.

Gross, David L.↗
NASA NTRS1997

Soft-Decision Decoding of Binary Linear Block Codes Based on an Iterative Search Algorithm

This correspondence presents a suboptimum soft-decision decoding scheme for binary linear block codes based on an iterative search algorithm. The scheme uses an algebraic decoder to iteratively generate a sequence of candidate codewords one at a time using a set of test error patterns that are constructed based on the reliability information of the received symbols. When a candidate codeword is generated, it is tested based on an optimality condition. If it satisfies the optimality condition, then it is the most likely (ML) codeword and the decoding stops. If it fails the optimality test, a search for the ML codeword is conducted in a region which contains the ML codeword. The search region is determined by the current candidate codeword and the reliability of the received symbols. The search is conducted through a purged trellis diagram for the given code using the Viterbi algorithm. If the search fails to find the ML codeword, a new candidate is generated using a new test error pattern, and the optimality test and search are renewed. The process of testing and search continues until either the MEL codeword is found or all the test error patterns are exhausted and the decoding process is terminated. Numerical results show that the proposed decoding scheme achieves either practically optimal performance or a performance only a fraction of a decibel away from the optimal maximum-likelihood decoding with a significant reduction in decoding complexity compared with the Viterbi decoding based on the full trellis diagram of the codes.

Lin, Shu↗
NASA NTRS1997

NASA Indexing Benchmarks: Evaluating Text Search Engines

The current proliferation of on-line information resources underscores the requirement for the ability to index collections of information and search and retrieve them in a convenient manner. This study develops criteria for analytically comparing the index and search engines and presents results for a number of freely available search engines. A product of this research is a toolkit capable of automatically indexing, searching, and extracting performance statistics from each of the focused search engines. This toolkit is highly configurable and has the ability to run these benchmark tests against other engines as well. Results demonstrate that the tested search engines can be grouped into two levels. Level one engines are efficient on small to medium sized data collections, but show weaknesses when used for collections 100MB or larger. Level two search engines are recommended for data collections up to and beyond 100MB.

Esler, Sandra L.↗
NASA NTRS2010

Fast and Flexible Multivariate Time Series Subsequence Search

Multivariate Time-Series (MTS) are ubiquitous, and are generated in areas as disparate as sensor recordings in aerospace systems, music and video streams, medical monitoring, and financial systems. Domain experts are often interested in searching for interesting multivariate patterns from these MTS databases which often contain several gigabytes of data. Surprisingly, research on MTS search is very limited. Most of the existing work only supports queries with the same length of data, or queries on a fixed set of variables. In this paper, we propose an efficient and flexible subsequence search framework for massive MTS databases, that, for the first time, enables querying on any subset of variables with arbitrary time delays between them. We propose two algorithms to solve this problem (1) a List Based Search (LBS) algorithm which uses sorted lists for indexing, and (2) a R*-tree Based Search (RBS) which uses Minimum Bounding Rectangles (MBR) to organize the subsequences. Both algorithms guarantee that all matching patterns within the specified thresholds will be returned (no false dismissals). The very few false alarms can be removed by a post-processing step. Since our framework is also capable of Univariate Time-Series (UTS) subsequence search, we first demonstrate the efficiency of our algorithms on several UTS datasets previously used in the literature. We follow this up with experiments using two large MTS databases from the aviation domain, each containing several millions of observations. Both these tests show that our algorithms have very high prune rates (>99%) thus needing actual disk access for only less than 1% of the observations. To the best of our knowledge, MTS subsequence search has never been attempted on datasets of the size we have used in this paper.

Bhaduri, Kanishka↗
NASA NTRS2001

Portfolios in Stochastic Local Search: Efficiently Computing Most Probable Explanations in Bayesian Networks

Portfolio methods support the combination of different algorithms and heuristics, including stochastic local search (SLS) heuristics, and have been identified as a promising approach to solve computationally hard problems. While successful in experiments, theoretical foundations and analytical results for portfolio-based SLS heuristics are less developed. This article aims to improve the understanding of the role of portfolios of heuristics in SLS. We emphasize the problem of computing most probable explanations (MPEs) in Bayesian networks (BNs). Algorithmically, we discuss a portfolio-based SLS algorithm for MPE computation, Stochastic Greedy Search (SGS). SGS supports the integration of different initialization operators (or initialization heuristics) and different search operators (greedy and noisy heuristics), thereby enabling new analytical and experimental results. Analytically, we introduce a novel Markov chain model tailored to portfolio-based SLS algorithms including SGS, thereby enabling us to analytically form expected hitting time results that explain empirical run time results. For a specific BN, we show the benefit of using a homogenous initialization portfolio. To further illustrate the portfolio approach, we consider novel additive search heuristics for handling determinism in the form of zero entries in conditional probability tables in BNs. Our additive approach adds rather than multiplies probabilities when computing the utility of an explanation. We motivate the additive measure by studying the dramatic impact of zero entries in conditional probability tables on the number of zero-probability explanations, which again complicates the search process. We consider the relationship between MAXSAT and MPE, and show that additive utility (or gain) is a generalization, to the probabilistic setting, of MAXSAT utility (or gain) used in the celebrated GSAT and WalkSAT algorithms and their descendants. Utilizing our Markov chain framework, we show that expected hitting time is a rational function - i.e. a ratio of two polynomials - of the probability of applying an additive search operator. Experimentally, we report on synthetically generated BNs as well as BNs from applications, and compare SGSs performance to that of Hugin, which performs BN inference by compilation to and propagation in clique trees. On synthetic networks, SGS speeds up computation by approximately two orders of magnitude compared to Hugin. In application networks, our approach is highly competitive in Bayesian networks with a high degree of determinism. In addition to showing that stochastic local search can be competitive with clique tree clustering, our empirical results provide an improved understanding of the circumstances under which portfolio-based SLS outperforms clique tree clustering and vice versa.

Mengshoel, Ole J.↗
NASA NTRS2012

All-Sky Search for Gravitational-Wave Bursts in the First Joint LIGO-GEO-Virgo Run

We present results from an aU-sky search for unmodeled gravitational-wave bursts in the data collected by the LIGO, GEO 600 and Virgo detectors between November 2006 and October 2007. The search is performed. by three different analysis algorithms over the frequency band 50 - 6000 Hz. Data are analyzed for times with at least two of the four LIGO-Virgo detectors in coincident operation, with a total live time of 266 days, No events produced by the search algorithms survive the selection cuts. We set a frequentist upper limit on the rate of gravitational-wave bursts impinging on our network of detectors. When combined with the previous LIGO search of the data collected between November 2005 and November 2006, the upper limit on the rate of detectable gra.vitational. wave bursts in the 64-2048 Hz band is 2,0 events per year at 90% confidence. We also present event rate versus strength exclusion plots for several types of plausible burst waveforms. The sensitivity of the combined search is expressed in terms of the root-sum-squared strain amplitude for a variety of simulated waveforms and lies in the range 6 X 10(exp -22) Hz(exp - 1/2) to 2 X 10(exp -20) Hz(exp -l/2). This is the first untriggered burst search to use data from the LIGO and Virgo detectors together, and the most sensitive untriggered burst search performed so far.

Camp, J. B.↗
NASA NTRS2014

JSC Search System Usability Case Study

The advanced nature of "search" has facilitated the movement from keyword match to the delivery of every conceivable information topic from career, commerce, entertainment, learning... the list is infinite. At NASA Johnson Space Center (JSC ) the Search interface is an important means of knowledge transfer. By indexing multiple sources between directorates and organizations, the system's potential is culture changing in that through search, knowledge of the unique accomplishments in engineering and science can be seamlessly passed between generations. This paper reports the findings of an initial survey, the first of a four part study to help determine user sentiment on the intranet, or local (JSC) enterprise search environment as well as the larger NASA enterprise. The survey is a means through which end users provide direction on the development and transfer of knowledge by way of the search experience. The ideal is to identify what is working and what needs to be improved from the users' vantage point by documenting: (1) Where users are satisfied/dissatisfied (2) Perceived value of interface components (3) Gaps which cause any disappointment in search experience. The near term goal is it to inform JSC search in order to improve users' ability to utilize existing services and infrastructure to perform tasks with a shortened life cycle. Continuing steps include an agency based focus with modified questions to accomplish a similar purpose

Meza, David↗