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 847 records · Page 47

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.↗

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↗

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.↗

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↗

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.↗

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.↗

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↗

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↗

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↗

Movable geometry and eigenvalue search capability in the MC21 Monte Carlo code

A description of a robust and flexible movable geometry implementation in the Monte Carlo code MC21 is described along with a search algorithm that can be used in conjunction with the movable geometry capability to perform eigenvalue searches based on the position of some geometric component. The natural use of the combined movement and search capability is searching to critical through variation of control rod (or control drum) position. The movable geometry discussion provides the mathematical framework for moving surfaces in the MC21 combinatorial solid geometry description. A discussion of the interface between the movable geometry system and the user is also described, particularly the ability to create a hierarchy of movable groups. Combined with the hierarchical geometry description in MC21 the movable group framework provides a very powerful system for inline geometry modification. The eigenvalue search algorithm implemented in MC21 is also described. The foundations of this algorithm are a regula falsi search though several considerations are made in an effort to increase the efficiency of the algorithm for use with Monte Carlo. Specifically, criteria are developed to determine after each batch whether the Monte Carlo calculation should be continued, the search iteration can be rejected, or the search iteration has converged. These criteria seek to minimize the amount of time spent per iteration. Results for the regula falsi method are shown, illustrating that the method as implemented is indeed convergent and that the optimizations made ultimately reduce the total computational expense. (authors)

97 MATHEMATICS AND COMPUTING↗

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↗

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 ↗

Search for dark matter in events with a hadronically decaying vector boson and missing transverse momentum in pp collisions at $\sqrt{s}=13$ TeV with the ATLAS detector

A search for dark matter (DM) particles produced in association with a hadronically decaying vector boson is performed using pp collision data at a centre-of-mass energy of s√=13 TeV corresponding to an integrated luminosity of 36.1 fb -1 , recorded by the ATLAS detector at the Large Hadron Collider. This analysis improves on previous searches for processes with hadronic decays of W and Z bosons in association with large missing transverse momentum (mono-W/Z searches) due to the larger dataset and further optimization of the event selection and signal region definitions. In addition to the mono-W/Z search, the as yet unexplored hypothesis of a new vector boson Z' produced in association with dark matter is considered (mono-Z' search). No significant excess over the Standard Model prediction is observed. The results of the mono-W/Z search are interpreted in terms of limits on invisible Higgs boson decays into dark matter particles, constraints on the parameter space of the simplified vector-mediator model and generic upper limits on the visible cross sections for W/Z+DM production. The results of the mono-Z' search are shown in the framework of several simplified-model scenarios involving DM production in association with the Z' boson.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Development of a Versatile, Full-featured Search Functionality for Indico

Indico, CERN’s popular open-source tool for event management, is in widespread use among facilities that make up the HEP community. It is extensible through a robust plugin architecture that provides features such as search and video conferencing integration. In 2018, Indico version 2 was released with many notable improvements, but without a full-featured search functionality that could be implemented easily outside of CERN. At both Fermi and Brookhaven National Laboratories, the user community viewed the lack of this popular feature as a significant impediment to deployment of the new software. In the meantime, CERN embarked upon a major redesign of their core search service, one that would also necessitate a rewrite of the Indico search interface. Seeing this pressing need, the two US labs decided to collaborate, with assistance from the CERN development team, on a project to develop the requisite search functionality for the larger user community. The resulting design exploits the simplified schema defined in the new CERN Search micro-service, based on Invenio and Elasticsearch, while still providing a flexible path to implementation for alternative backend search services. It is intended to provide a software package that can be installed easily and used out of the box, by anyone at any site. This paper will discuss the design choices and architectural challenges, and provide an overview of the deployment and use of these new plugins.

Constanta, Penelope↗

TIME-INTEGRATED SEARCHES FOR POINT-LIKE SOURCES OF NEUTRINOS WITH THE 40-STRING IceCube DETECTOR

We present the results of time-integrated searches for astrophysical neutrino sources in both the northern and southern skies. Data were collected using the partially completed IceCube detector in the 40-string configuration recorded between 2008 April 5 and 2009 May 20, totaling 375.5 days livetime. An unbinned maximum likelihood ratio method is used to search for astrophysical signals. The data sample contains 36,900 events: 14,121 from the northern sky, mostly muons induced by atmospheric neutrinos, and 22,779 from the southern sky, mostly high-energy atmospheric muons. The analysis includes searches for individual point sources and stacked searches for sources in a common class, sometimes including a spatial extent. While this analysis is sensitive to TeV-PeV energy neutrinos in the northern sky, it is primarily sensitive to neutrinos with energy greater than about 1 PeV in the southern sky. No evidence for a signal is found in any of the searches. Limits are set for neutrino fluxes from astrophysical sources over the entire sky and compared to predictions. The sensitivity is at least a factor of two better than previous searches (depending on declination), with 90% confidence level muon neutrino flux upper limits being between E {sup 2} d{Phi}/dE {approx} 2-200 x 10{sup -12} TeV cm{sup -2} s{sup -1} in the northern sky and between 3-700 x 10{sup -12} TeV cm{sup -2} s{sup -1} in the southern sky. The stacked source searches provide the best limits to specific source classes. The full IceCube detector is expected to improve the sensitivity to d{Phi}/dE{proportional_to}E {sup -2} sources by another factor of two in the first year of operation.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

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↗

Generalized Jaynes-Cummings model as a quantum search algorithm

We propose a continuous time quantum search algorithm using a generalization of the Jaynes-Cummings model. In this model the states of the atom are the elements among which the algorithm realizes the search, exciting resonances between the initial and the searched states. This algorithm behaves like Grover's algorithm; the optimal search time is proportional to the square root of the size of the search set and the probability to find the searched state oscillates periodically in time. In this frame, it is possible to reinterpret the usual Jaynes-Cummings model as a trivial case of the quantum search algorithm.

74 ATOMIC AND MOLECULAR PHYSICS↗

All-sky search for gravitational-wave bursts in the first joint LIGO-GEO-Virgo run

We present results from an all-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 gravitational-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 6x10{sup -22} Hz{sup -1/2} to 2x10{sup -20} Hz{sup -1/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.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗