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 163 records · Page 9

Simulating a Direction-Finder Search for an ELT

A computer program simulates the operation of direction-finding equipment engaged in a search for an emergency locator transmitter (ELT) aboard an aircraft that has crashed. The simulated equipment is patterned after the equipment used by the Civil Air Patrol to search for missing aircraft. The program is designed to be used for training in radio direction-finding and/or searching for missing aircraft without incurring the expense and risk of using real aircraft and ground search resources. The program places a hidden ELT on a map and enables the user to search for the location of the ELT by moving a 14 NASA Tech Briefs, March 2005 small aircraft image around the map while observing signal-strength and direction readings on a simulated direction- finding locator instrument. As the simulated aircraft is turned and moved on the map, the program updates the readings on the direction-finding instrument to reflect the current position and heading of the aircraft relative to the location of the ELT. The software is distributed in a zip file that contains an installation program. The software runs on the Microsoft Windows 9x, NT, and XP operating systems.

Bream, Bruce↗

Quantum Search in Hilbert Space

A proposed quantum-computing algorithm would perform a search for an item of information in a database stored in a Hilbert-space memory structure. The algorithm is intended to make it possible to search relatively quickly through a large database under conditions in which available computing resources would otherwise be considered inadequate to perform such a task. The algorithm would apply, more specifically, to a relational database in which information would be stored in a set of N complex orthonormal vectors, each of N dimensions (where N can be exponentially large). Each vector would constitute one row of a unitary matrix, from which one would derive the Hamiltonian operator (and hence the evolutionary operator) of a quantum system. In other words, all the stored information would be mapped onto a unitary operator acting on a quantum state that would represent the item of information to be retrieved. Then one could exploit quantum parallelism: one could pose all search queries simultaneously by performing a quantum measurement on the system. In so doing, one would effectively solve the search problem in one computational step. One could exploit the direct- and inner-product decomposability of the unitary matrix to make the dimensionality of the memory space exponentially large by use of only linear resources. However, inasmuch as the necessary preprocessing (the mapping of the stored information into a Hilbert space) could be exponentially expensive, the proposed algorithm would likely be most beneficial in applications in which the resources available for preprocessing were much greater than those available for searching.

Zak, Michail↗

The Search for Life on Mars - Current Knowledge, Earth Analogues, and Principal Issues

For centuries, the planet Mars has been imagined as a possible abode for life. Serious searches for life's signatures began in the 19th century via ground-based visual astronomy that stimulated a vibrant fantasy literature but little lasting scientific knowledge. Modern scientific inquiry has emphasized the search for chemical signatures of life in the soil and rocks at the planet's surface, and via biomarker gases in the atmosphere. Today, investigations are based on high-resolution spectroscopy at Earth's largest telescopes along with planet orbiting and landed space missions. Methane has assumed central importance in these searches. Living systems produce more than 900/0 of Earth's atmospheric methane; the balance is of geochemical origin. Abundant methane is not expected in an oxidizing atmosphere such as Mars', and its presence would imply recent release - whether biological or geochemical. F or that reason, the quest for methane on Mars has been a continuing thread in the fabric of searches conducted since 1969. I will review aspects of the discovery and distribution of methane on Mars, and will mention ongoing extended searches for clues to its origin and destruction. On Earth, hydrogen (generated via serpentinization or radiolysis of water) provides an important 'fuel' for carbonate-reducing and sulphate-reducing biota (CH4 and H2S producers, respectively). Several such communities are known to reside at depth in continental domains (e.g., Lidy Hot Springs, Idaho; Witwatersrand Basin, S. Africa). If similar conditions exist in favourable locations on Mars, organisms similar to these could likely prosper there. Geologic (abiotic) production will also be mentioned, especially abiotic methane production associated with low-temperature serpentinization (e.g., terrestrial ophiolites). It is vitally important to pursue evidence for geochemical and biological production with equal vigour and intellectual weight lest unwanted and unintended bias contaminate the results. Finally, I will touch upon unresolved questions and issues posed by the methane detections.

Mumma, Michael J.↗

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

A new regression model search algorithm was developed that may be applied to both general multivariate experimental data sets and wind tunnel strain-gage balance calibration data. The algorithm is a simplified version of a more complex algorithm that was originally developed for the NASA Ames Balance Calibration Laboratory. The new algorithm performs regression model term reduction to prevent overfitting of data. It has the advantage that it needs only about one tenth of the original algorithm's CPU time for the completion of a regression model 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 model. Therefore, the simplified algorithm is not intended to replace the original algorithm. Instead, it may be used to generate an alternate optimized regression model of experimental data whenever the application of the original search algorithm 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 search algorithm.

Ulbrich, Norbert M.↗

Search for a Correlation Between Very-High-Energy Gamma Rays and Giant Radio Pulses in the Crab Pulsar

We present the results of a joint observational campaign between the Green Bank radio telescope and the VERITAS gamma-ray telescope, which searched for a correlation between the emission of very-high-energy (VHE) gamma rays ( E(sub Gamma) > 150 GeV) and giant radio pulses (GRPs) from the Crab pulsar at 8.9 GHz. A total of 15,366 GRPs were recorded during 11.6 hr of simultaneous observations, which were made across four nights in 2008 December and in 2009 November and December. We searched for an enhancement of the pulsed gamma-ray emission within time windows placed around the arrival time of the GRP events. In total, eight different time windows with durations ranging from 0.033 ms to 72 s were positioned at three different locations relative to the GRP to search for enhanced gamma-ray emission which lagged, led, or was concurrent with, the GRP event. Furthermore, we performed separate searches on main pulse GRPs and interpulse GRPs and on the most energetic GRPs in our data sample. No significant enhancement of pulsed VHE emission was found in any of the preformed searches. We set upper limits of 5-10 times the average VHE flux of the Crab pulsar on the flux simultaneous with interpulse GRPs on single-rotation-period timescales. On approx. 8 s timescales around interpulse GRPs, we set an upper limit of 2-3 times the average VHE flux. Within the framework of recent models for pulsed VHE emission from the Crab pulsar, the expected VHE-GRP emission correlations are below the derived limits.

RADIO↗

Moon Search Algorithms for NASA's Dawn Mission to Asteroid Vesta

A moon or natural satellite is a celestial body that orbits a planetary body such as a planet, dwarf planet, or an asteroid. Scientists seek understanding the origin and evolution of our solar system by studying moons of these bodies. Additionally, searches for satellites of planetary bodies can be important to protect the safety of a spacecraft as it approaches or orbits a planetary body. If a satellite of a celestial body is found, the mass of that body can also be calculated once its orbit is determined. Ensuring the Dawn spacecraft's safety on its mission to the asteroid Vesta primarily motivated the work of Dawn's Satellite Working Group (SWG) in summer of 2011. Dawn mission scientists and engineers utilized various computational tools and techniques for Vesta's satellite search. The objectives of this paper are to 1) introduce the natural satellite search problem, 2) present the computational challenges, approaches, and tools used when addressing this problem, and 3) describe applications of various image processing and computational algorithms for performing satellite searches to the electronic imaging and computer science community. Furthermore, we hope that this communication would enable Dawn mission scientists to improve their satellite search algorithms and tools and be better prepared for performing the same investigation in 2015, when the spacecraft is scheduled to approach and orbit the dwarf planet Ceres.

planetary sciences↗

Application of a Hough Search for Continuous Gravitational Waves on Data from the Fifth LIGO Science Run

We report on an all-sky search for periodic gravitational waves in the frequency range 50-1000 Hertz with the first derivative of frequency in the range −8.9 × 10(exp −10) Hertz per second to zero in two years of data collected during LIGO's fifth science run. Our results employ a Hough transform technique, introducing a chi(sup 2) test and analysis of coincidences between the signal levels in years 1 and 2 of observations that offers a significant improvement in the product of strain sensitivity with compute cycles per data sample compared to previously published searches. Since our search yields no surviving candidates, we present results taking the form of frequency dependent, 95% confidence upper limits on the strain amplitude h(sub 0). The most stringent upper limit from year 1 is 1.0 × 10(exp −24) in the 158.00-158.25 Hertz band. In year 2, the most stringent upper limit is 8.9 × 10(exp −25) in the 146.50-146.75 Hertz band. This improved detection pipeline, which is computationally efficient by at least two orders of magnitude better than our flagship Einstein@Home search, will be important for 'quicklook' searches in the Advanced LIGO and Virgo detector era.

neutron stars↗

A Fermi Gamma-Ray Burst Monitor Search for Electromagnetic Signals Coincident with Gravitational-Wave Candidates in Advanced LIGOs First Observing Run

We present a search for prompt gamma-ray counterparts to compact binary coalescence gravitational wave (GW)candidates from Advanced LIGO's first observing run (O1). As demonstrated by the multimessenger observations ofGW170817/GRB 170817A, electromagnetic and GW observations provide complementary information about theastrophysical source, and in the case of weaker candidates, may strengthen the case for an astrophysical origin. Here weinvestigate low-significance GWcandidates from the O1 compact binary coalescence searches using the Fermi Gamma-Ray Burst Monitor (GBM), leveraging its all sky and broad energy coverage. Candidates are ranked and compared tobackground to measure the significance. Those with false alarm rates (FARs) of less than 105 Hz (about one per day,yielding a total of 81 candidates) are used as the search sample for gamma-ray follow-up. No GW candidates werefound to be coincident with gamma-ray transients independently identified by blind searches of the GBM data. Inaddition, GW candidate event times were followed up by a separate targeted search of GBM data. Among the resultingGBM events, the two with the lowest FARs were the gamma-ray transient GW150914-GBM presented in Connaughtonet al. and a solar flare in chance coincidence with a GW candidate.

Burns, E.↗

Kepler Data Validation II–Transit Model Fitting and Multiple-Planet Search

This paper discusses the transit model-fitting and multiple-planet search algorithms and performance of the Kepler Science Data Processing Pipeline, developed by the Kepler Science Operations Center (SOC). Threshold crossing events (TCEs), which are transit candidate events, are generated by the Transiting Planet Search (TPS) component of the pipeline and subsequently processed in the data validation (DV) component. The transit model is used in DV to fit TCEs to characterize planetary candidates and to derive parameters that are used in various diagnostic tests to classify them. After the signature associated with the TCE is removed from the light curve of the target star, the residual light curve goes through TPS again to search for additional TCEs. The iterative process of transit model fitting and multiple-planet search continues until no TCE is generated from the residual light curve or an upper limit is reached. The transit model-fitting and multiple-planet search performance of the final release (9.3, 2016January) of the pipeline is demonstrated with the results of the processing of four years (17 quarters) of flight data from the primary Kepler Mission. The transit model-fitting results are accessible from the NASA Exoplanet Archive. The final version of the SOC codebase is available through GitHub.

Threshold crossing events (TCEs↗

Dawn Mission's Search for Satellites of Ceres: Intact Protoplanets Don't Have Satellites

Upon its approach to orbit the dwarf planet Ceres in early 2015, optical navigation and dedicated satellite search images were acquired with the Dawn mission's framing camera 2. A team of searchers individually processed and examined the images for evidence of objects moving with Ceres. Completeness of search with respect to the space searched was calculated as a function of distance to Ceres and found to be complete down to 15 Ceres radii (Ceres' mean radius is 470 kilometers). Upper limits of detectable magnitude were determined for each observed set of images and an upper limit in size was calculated assuming for the putative objects, Ceres' geometric albedo of 0.11. Nothing was found associated with Ceres down to a radius of 12 meters for the most sensitive search, and down to a radius of 323m for the least sensitive search circumstances. Examination of the physical properties of the 41 largest and most massive main belt asteroids suggests that large asteroids without satellites are intact and their interiors have internal strength. This is consistent with results from the Dawn mission at both Vesta and Ceres. Ceres' volatile-rich composition also is a likely contributor to both the absence of satellites at Ceres and of Ceres meteorites at Earth. These results suggest that collisional disruption creating rubble pile structure is a necessary condition for formation of satellites around main belt asteroids.

McFadden, Lucy A.↗

Search for Eccentric Binary Black Hole Mergers with Advanced LIGO and Advanced Virgo during Their First and Second Observing Runs

When formed through dynamical interactions, stellar-mass binary black holes (BBHs) may retain eccentric orbits (e > 0.1 at 10 Hz) detectable by ground-based gravitational-wave detectors. Eccentricity can therefore be used to differentiate dynamically formed binaries from isolated BBH mergers. Current template-based gravitational-wave searches do not use waveform models associated with eccentric orbits, rendering the search less efficient for eccentric binary systems. Here we present the results of a search for BBH mergers that inspiral in eccentric orbits using data from the first and second observing runs (O1 and O2) of Advanced LIGO and Advanced Virgo. We carried out the search with the coherent WaveBurst algorithm, which uses minimal assumptions on the signal morphology and does not rely on binary waveform templates. We show that it is sensitive to binary mergers with a detection range that is weakly dependent on eccentricity for all bound systems. Our search did not identify any new binary merger candidates. We interpret these results in light of eccentric binary formation models. We rule out formation channels with rates ≳100 Gpc−3 yr−1 for e > 0.1, assuming a black hole mass spectrum with a power-law index ≲2.

B. P. Abbott↗

Application of a Dataset-Publication Knowledge Graph for Improving Earth Science Data Search

Finding a dataset at a NASA data center that is the best fit for the researcher’s application presents a challenge, not only for a novice user but for an experienced one, due to the data complexity and a multitude of choices of the existing data. Users often search for the data based on the application they are interested in, their research domain, phenomena, research topic, etc. As existing dataset metadata may not cover these search terms, the user may not obtain the most relevant results for their purpose. This problem was addressed by leveraging the content of the titles and abstracts of the research papers that utilize NASA datasets. For this, features from the paper titles and abstracts were extracted, and then a knowledge graph (KG) was used to link these features to the datasets used in that paper. The search for the datasets was tested by querying this knowledge graph through various terms extracted from Earth Science ontologies such as Semantic Web for Earth and Environment Technology (SWEET), and it was shown that this KG search outperforms the existing search that exclusively queries the dataset metadata.

Kristina Stoyanova↗

Integrating the Science Opportunity Analyzer with a Reusable Opportunity Search Framework

In our interactions with the Science Opportunity Analyzer (SOA) software, we recognized how its ability to search for geometric events in space is a need for robotic space missions in general. To satisfy this need, we propose the Tychonis framework, which is built upon the principles of: (1) separations of concerns, (2) extensibility, (3) reusability, and (4) independent verification and validation. Tychonis’ separation of concerns results in the availability of different constructs to model geometric events and search for them. These constructs can be extended by users as needed and reused across missions without changes. Given the low coupling between concerns, and the fact Tychonis can be augmented in isolation, its constructs can be validated independently from other pieces of software. This paper elaborates on these topics and presents an integration case study between Tychonis and SOA that relies on the concept of dynamic integration. Dynamic integration entails that augmentations of the framework are reflected automatically in the host application without any changes to the host application’s code. The SOA-Tychonis integration case study can be extrapolated to other tools that need to search for geometric events as the pattern repeats across implementations: (i) the manipulation of a user interface to model opportunities, (ii) the execution of algorithms to search for opportunities, and (iii) the presentation of search results to users. Overall, Tychonis’ is a story about how the application of proven software principles and good design choices can reduce risk and cost to space missions

Soria, Manel↗

Search for Low mass Higgs Portal Scalars at the MicroBooNE Detector in the NuMI Beam

The MicroBooNE experiment exploits Liquid Argon Time Projection Chamber (LArTPC) technology to detect neutrinos from two beams at Fermilab, Chicago: on-axis Booster Neutrino Beam (BNB) and the off-axis Neutrinos at the Main Injector (NuMI) beam. While the aim of the experiment is to study the low-energy excess of electron neutrino events observed by the MiniBooNE experiment, to search for eV-scale sterile neutrinos and to characterise neutrino interactions on argon, it could also be exploited to probe Beyond Standard Model (BSM) Physics. This thesis presents a BSM search for low-mass Higgs Portal Scalars at MicroBooNE in the NuMI beam using data collected during the Run 1 and Run 3 data-taking periods with a total exposure corresponding to $7.01 \times 10^{20}$ protons on target (POT). The Higgs Portal Model is an extension to the Standard Model in which a dark-sector scalar, $S$, mixes with the Higgs boson with mixing angle $\theta$ and acquires a coupling to the Standard Model fermions via the Higgs Yukawa coupling. We search for low-mass Higgs Portal scalars, in the mass range $100-200$ MeV, at MicroBooNE via the production channel $K \rightarrow \pi + S$, where scalars are produced from kaons decaying at rest in the NuMI target and beam dump, as well as kaons decaying in flight in the decay pipe of the NuMI beam. In the MicroBooNE detector, we search for the decay channel $S \rightarrow e^+e^-$, which is the only decay channel available to the scalars in the mass range of our search. The results are expressed as limits, at the 95\% confidence level, on the scalar-Higgs mixing angle $\theta$ for scalars in the mass range $100-200$ MeV.Date of Award1 Aug 2023Original languageEnglishAwarding InstitutionThe University of ManchesterSupervisorStefan Soldner-Rembold (Supervisor) & Justin Evans (Supervisor)

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Exact and Fixed-Point Grover Search with Qudits

Grover's algorithm provides a quadratic speedup for searching unstructured databases and is traditionally implemented with qubits in Hilbert spaces whose dimensions are powers of two. With the advent of quantum platforms utilizing qudits---quantum systems with more than two levels---there is a need to generalize Grover search to these architectures, including heterogeneous systems with qudits of varying dimensions. Here, we present a unified framework for qudit-based Grover search, detailing the construction of oracles and diffusion operators with and without ancilla qubits and generalizing deterministic and fixed-point search variants that ensure exact or bounded success probabilities. We analyze phase-matching techniques and provide explicit circuit decompositions suitable for diverse hardware platforms. We also compare the corresponding trajectories on the Bloch sphere to provide an intuitive visualization of how the different phase choices amplify the target state. These results facilitate flexible, hardware-oriented protocols for implementing Grover search on qudit processors, potentially reducing circuit depth and enhancing success probabilities, thereby offering a practical toolkit for quantum computation and sensing applications leveraging multilevel quantum systems.

Roy, Tanay [Fermilab] (ORCID:000000019442862X)↗

Translation-Invariant Quantum Algorithms for Ordered Search are Optimal

Ordered search is the task of finding an item in an ordered list using comparison queries. The best exact classical algorithm for this fundamental problem uses [log 2 n] queries for a list of length n. Quantum computers can achieve a constant-factor speedup, but the best possible coefficient of log 2 n for exact quantum algorithms is only known to lie between (ln2)/π ≈ 0.221 and 4/log 2 605 ≈ 0.4333. We consider a special class of translation-invariant algorithms with no workspace, introduced by Farhi, Goldstone, Gutmann, and Sipser, that has been used to find the best known upper bounds. First, we show that any bounded-error, k-query quantum algorithm for ordered search can be implemented by a k-query algorithm in this special class. Second, we use linear programming to show that the best exact 5-query quantum algorithm can search a list of length 7265, giving an ordered search algorithm that asymptotically uses 5 log 7265 n ≈ 0.390 log 2 n quantum queries.

Translation-invariant quantum algorithms↗

Heuristics for Relevancy Ranking of Earth Dataset Search Results

As the Variety of Earth science datasets increases, science researchers find it more challenging to discover and select the datasets that best fit their needs. The most common way of search providers to address this problem is to rank the datasets returned for a query by their likely relevance to the user. Large web page search engines typically use text matching supplemented with reverse link counts, semantic annotations and user intent modeling. However, this produces uneven results when applied to dataset metadata records simply externalized as a web page. Fortunately, data and search provides have decades of experience in serving data user communities, allowing them to form heuristics that leverage the structure in the metadata together with knowledge about the user community. Some of these heuristics include specific ways of matching the user input to the essential measurements in the dataset and determining overlaps of time range and spatial areas. Heuristics based on the novelty of the datasets can prioritize later, better versions of data over similar predecessors. And knowledge of how different user types and communities use data can be brought to bear in cases where characteristics of the user (discipline, expertise) or their intent (applications, research) can be divined. The Earth Observing System Data and Information System has begun implementing some of these heuristics in the relevancy algorithm of its Common Metadata Repository search engine.

science data management↗

Relevancy Ranking of Satellite Dataset Search Results

As the Variety of Earth science datasets increases, science researchers find it more challenging to discover and select the datasets that best fit their needs. The most common way of search providers to address this problem is to rank the datasets returned for a query by their likely relevance to the user. Large web page search engines typically use text matching supplemented with reverse link counts, semantic annotations and user intent modeling. However, this produces uneven results when applied to dataset metadata records simply externalized as a web page. Fortunately, data and search provides have decades of experience in serving data user communities, allowing them to form heuristics that leverage the structure in the metadata together with knowledge about the user community. Some of these heuristics include specific ways of matching the user input to the essential measurements in the dataset and determining overlaps of time range and spatial areas. Heuristics based on the novelty of the datasets can prioritize later, better versions of data over similar predecessors. And knowledge of how different user types and communities use data can be brought to bear in cases where characteristics of the user (discipline, expertise) or their intent (applications, research) can be divined. The Earth Observing System Data and Information System has begun implementing some of these heuristics in the relevancy algorithm of its Common Metadata Repository search engine.

science data management↗