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 883 records · Page 49

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

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

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

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

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↗

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

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

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↗

Search for Gravitational Waves Associated with Gamma-Ray Bursts Detected by the Interplanetary Network

We present the results of a search for gravitational waves associated with 223 gamma ray bursts (GRBs) detected by the InterPlanetary Network (IPN) in 2005-2010 during LIGO's fifth and sixth science runs and Virgo's first, second, and third science runs. The IPN satellites provide accurate times of the bursts and sky localizations that vary significantly from degree scale to hundreds of square degrees. We search for both a well-modeled binary coalescence signal, the favored progenitor model for short GRBs, and for generic, unmodeled gravitational wave bursts. Both searches use the event time and sky localization to improve the gravitational wave search sensitivity as compared to corresponding all-time, all-sky searches. We find no evidence of a gravitational wave signal associated with any of the IPN GRBs in the sample, nor do we find evidence for a population of weak gravitational wave signals associated with the GRBs. For all IPN-detected GRBs, for which a sufficient duration of quality gravitational wave data are available, we place lower bounds on the distance to the source in accordance with an optimistic assumption of gravitational wave emission energy of 10(exp−2) solar mass c(exp 2) at 150 Hz, and find a median of 13 Mpc. For the 27 short-hard GRBs we place 90% confidence exclusion distances to two source models: a binary neutron star coalescence, with a median distance of 12 Mpc, or the coalescence of a neutron star and black hole, with a median distance of 22 Mpc. Finally, we combine this search with previously published results to provide a population statement for GRB searches in first-generation LIGO and Virgo gravitational wave detectors and a resulting examination of prospects for the advanced gravitational wave detectors.

gravitational wave detectors↗

Search for Beyond the Standard Model Physics at D0

The standard model (SM) of particle physics has been remarkably successful at predicting the outcomes of particle physics experiments, but there are reasons to expect new physics at the electroweak scale. Over the last several years, there have been a number of searches for beyond the standard model (BSM) physics at D0. Here, we limit our focus to three: searches for diphoton events with large missing transverse energy (E{sub T}), searches for leptonic jets and E{sub T}, and searches for single vector-like quarks. We have discussed three recent searches at D0. There are many more, including limits on heavy neutral gauge boson in the ee channel, a search for scalar top quarks, a search for quirks, and limits on a new resonance decaying to WW or WZ.

43 PARTICLE ACCELERATORS↗

Criticality and axial offset searches based on the integrated neutron balance approach

Criticality and axial offset (AO) searches are key features in the simulation of plant operation procedures. Typically, the dedicated algorithms consist of either a Newton method or a secant method that features the successive computation of difference quotients to be used as derivatives. Within this context, computational robustness and efficiency are of paramount importance. This applies in particular to when the variations imposed during the search are spatially heterogeneous, such as in the case of tuning control rod positions for achieving target AO. In order to optimize this kind of search capability in AREVA NP's reactor code ARTEMIS in accordance with this design principle, a generalized approach has been implemented that harmonizes very well numerically with the overall multi-physics iterative solution process. As embedded in the latter, the new neutronic integral re-balancing approach is defined through periodic whole-core space-energy integrations of the principal terms in the core-integrated process-rate balance terms (i.e. neutron absorption, production and leakage). This procedure yields sequences of single zero-dimensional equations from which the chosen tuning parameters can be solved directly in dependence of the imposed (and systematically fixed) values for the response quantities k{sub eff} and/or AO. The converged result of the iteration sequence of successively obtained search parameter values is final in terms of being fully consistent with the entire set of multi-physics equations while enabling the accurate fulfillment of the target response value. The k etc and AO searches can be pursued simultaneously. Judging from the results of pursued verifications, the neutronic integral re-balancing approach fulfils the above-mentioned expectations convincingly. Specific verification examples are presented, such as the determination of the insertion depth of a critical control bank, a double search on target criticality and target AO by adjusting the boron concentration and the position of a control bank, and a critical power search during reactor cycle stretch out. (authors)

97 MATHEMATICS AND COMPUTING↗

Guided Text Search Using Adaptive Visual Analytics (Final Report)

This research demonstrates the promise of augmenting interactive visualizations with semi- supervised machine learning techniques to improve the discovery of significant associations and insights in the search and analysis of textual information. More specifically, we have developed a system called Gryffin that hosts a unique collection of techniques that facilitate individualized investigative search pertaining to an ever-changing set of analytical questions over an indexed collection of open-source documents related to critical national infrastructure. The Gryffin client hosts dynamic displays of the search results via focus+context record listings, temporal timelines, term-frequency views, and multiple coordinate views. Furthermore, as the analyst interacts with the display, the interactions are recorded and used to label the search records. These labeled records are then used to drive semi-supervised machine learning algorithms that re-rank the unlabeled search records such that potentially relevant records are moved to the top of the record listing. Gryffin is described in the context of the daily tasks encountered at the US Department of Homeland Security s Fusion Center, with whom we are collaborating in its development. The resulting system is capable of addressing the analysts information overload that can be directly attributed to the deluge of information that must be addressed in the search and investigative analysis of textual information.

machine learning↗

A Search for Pulsars around Sgr A* in the First Event Horizon Telescope Data Set

In 2017 the Event Horizon Telescope (EHT) observed the supermassive black hole at the center of the Milky Way, Sagittarius A* (Sgr A*), at a frequency of 228.1 GHz (λ = 1.3 mm). The fundamental physics tests that even a single pulsar orbiting Sgr A* would enable motivate searching for pulsars in EHT data sets. The high observing frequency means that pulsars—which typically exhibit steep emission spectra—are expected to be very faint. However, it also negates pulse scattering, an effect that could hinder pulsar detections in the Galactic center. Additionally, magnetars or a secondary inverse Compton emission could be stronger at millimeter wavelengths than at lower frequencies. We present a search for pulsars close to Sgr A* using the data from the three most sensitive stations in the EHT 2017 campaign: the Atacama Large Millimeter/submillimeter Array, the Large Millimeter Telescope, and the IRAM 30 m Telescope. We apply three detection methods based on Fourier-domain analysis, the fast folding algorithm, and single-pulse searches targeting both pulsars and burst-like transient emission. We use the simultaneity of the observations to confirm potential candidates. No new pulsars or significant bursts were found. Being the first pulsar search ever carried out at such high radio frequencies, we detail our analysis methods and give a detailed estimation of the sensitivity of the search. We conclude that the EHT 2017 observations are only sensitive to a small fraction (≲2.2%) of the pulsars that may exist close to Sgr A*, motivating further searches for fainter pulsars in the region.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Searches for supersymmetry using the M$_{T2}$ variable in hadronic events produced in pp collisions at 8 TeV

Searches for supersymmetry (SUSY) are performed using a sample of hadronic events produced in 8 TeV pp collisions at the CERN LHC. The searches are based on the M$_{T2}$ variable, which is a measure of the transverse momentum imbalance in an event. The data were collected with the CMS detector and correspond to an integrated luminosity of 19.5 fb 1 . Two related searches are performed. The first is an inclusive search based on signal regions defined by the value of the M$_{T2}$ variable, the hadronic energy in the event, the jet multiplicity, and the number of jets identified as originating from bottom quarks. The second is a search for a mass peak corresponding to a Higgs boson decaying to a bottom quark-antiquark pair, where the Higgs boson is produced as a decay product of a SUSY particle. For both searches, the principal backgrounds are evaluated with data control samples. No significant excess over the expected number of background events is observed, and exclusion limits on various SUSY models are derived.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Charged Higgs search in 2HDM

In this paper, we present a comprehensive study of the collider search limits on the charged Higgses in the four types of Two Higgs Double Models (2HDM). In addition to constraints from flavor physics measurements, we include both the LEP charged Higgs search channels, as well as the LHC search results on the light and heavy charged Higgses. We consider both the conventional charged Higgs search channels of H ± → τν, cs, cb, tb, and the latest search results on the exotic decay channels H ± → AW ± /HW ± . We find that H ± → AW ± /HW ± are complementary to the conventional fermionic channels for m H ± < m t . For heavy H ± , H ± → AW ± /HW ± extend the reach of tan β beyond that of H ± → tb in the Type-L 2HDM. We also present the combined reach of all the neutral and charged Higgs searches.

2HDM↗

Search for the nonresonant and resonant production of a Higgs boson in association with an additional scalar boson in the $γγττ$ final state in proton-proton collisions at $\sqrt{s}=13$ TeV

The results of a search for the production of two scalar bosons in final states with two photons and two tau leptons are presented. The search considers both nonresonant production of a Higgs boson pair, HH, and resonant production via a new boson X which decays either to HH or to H and a new scalar Y. The analysis uses up to 138 fb −1 of proton-proton collision data, recorded between 2016 and 2018 by the CMS experiment at the LHC at a center-of-mass energy of 13 TeV. No evidence for signal is found in the data. For the nonresonant production, the observed (expected) upper limit at 95% confidence level (CL) on the HH production cross section is set at 930 (740) fb, corresponding to 33 (26) times the standard model prediction. At 95% CL, HH production is observed (expected) to be excluded for values of κ λ outside the range between −12 (−9.4) and 17 (15). Observed (expected) upper limits at 95% CL for the X → HH cross section are found to be within 160 to 2200 (200 to 1800) fb, depending on the mass of X. In the X → Y(ττ)H(γγ) search, the observed (expected) upper limits on the product of the production cross section and decay branching fractions vary between 0.059–1.2 fb (0.087–0.68 fb). For the X → Y(γγ)H(ττ) search the observed (expected) upper limits on the product of the production cross section and Y → γγ branching fraction vary between 0.69–15 fb (0.73–8.3 fb) in the low Y mass search, tightening constraints on the next-to-minimal supersymmetric standard model, and between 0.64–10 fb (0.70–7.6 fb) in the high Y mass search.

Beyond Standard Model↗

Dark sector searches with the CMS experiment

Astrophysical observations provide compelling evidence for gravitationally interacting dark matter in the universe that cannot be explained by the standard model of particle physics. The extraordinary amount of data from the CERN LHC presents a unique opportunity to shed light on the nature of dark matter at unprecedented collision energies. This Report comprehensively reviews the most recent searches with the CMS experiment for particles and interactions belonging to a dark sector and for dark-sector mediators. Models with invisible massive particles are probed by searches for signatures of missing transverse momentum recoiling against visible standard model particles. Searches for mediators are also conducted via fully visible final states. The results of these searches are compared with those obtained from direct-detection experiments. Searches for alternative scenarios predicting more complex dark sectors with multiple new particles and new forces are also presented. Many of these models include long-lived particles, which could manifest themselves with striking unconventional signatures with relatively small amounts of background. Searches for such particles are discussed and their impact on dark-sector scenarios is evaluated. Many results and interpretations have been newly obtained for this Report.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗