Search NASA⌕ Search

SEARCH · Search NASA

Results for “pattern 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 55 records · Page 3
All sourcesNASA NTRSDOE OSTI
NASA NTRS2002

Spatial learning and memory is preserved in rats after early development in a microgravity environment

This study evaluated the cognitive mapping abilities of rats that spent part of their early development in a microgravity environment. Litters of male and female Sprague-Dawley rat pups were launched into space aboard the National Aeronautics and Space Administration space shuttle Columbia on postnatal day 8 or 14 and remained in space for 16 days. These animals were designated as FLT groups. Two age-matched control groups remained on Earth: those in standard vivarium housing (VIV) and those in housing identical to that aboard the shuttle (AGC). On return to Earth, animals were tested in three different tasks that measure spatial learning ability, the Morris water maze (MWM), and a modified version of the radial arm maze (RAM). Animals were also tested in an open field apparatus to measure general activity and exploratory activity. Performance and search strategies were evaluated in each of these tasks using an automated tracking system. Despite the dramatic differences in early experience, there were remarkably few differences between the FLT groups and their Earth-bound controls in these tasks. FLT animals learned the MWM and RAM as quickly as did controls. Evaluation of search patterns suggested subtle differences in patterns of exploration and in the strategies used to solve the tasks during the first few days of testing, but these differences normalized rapidly. Together, these data suggest that development in an environment without gravity has minimal long-term impact on spatial learning and memory abilities. Any differences due to development in microgravity are quickly reversed after return to earth normal gravity.

NASA Discipline Neuroscience↗
NASA NTRS1996

Optimization of Operations Resources via Discrete Event Simulation Modeling

The resource levels required for operation and support of reusable launch vehicles are typically defined through discrete event simulation modeling. Minimizing these resources constitutes an optimization problem involving discrete variables and simulation. Conventional approaches to solve such optimization problems involving integer valued decision variables are the pattern search and statistical methods. However, in a simulation environment that is characterized by search spaces of unknown topology and stochastic measures, these optimization approaches often prove inadequate. In this paper, we have explored the applicability of genetic algorithms to the simulation domain. Genetic algorithms provide a robust search strategy that does not require continuity and differentiability of the problem domain. The genetic algorithm successfully minimized the operation and support activities for a space vehicle, through a discrete event simulation model. The practical issues associated with simulation optimization, such as stochastic variables and constraints, were also taken into consideration.

Joshi, B.↗
NASA NTRS2011

Investigating Intrinsic and Extrinsic Variables During Simulated Internet Search

Using an eye tracker we examined decision-making processes during an internet search task. Twenty experienced homebuyers and twenty-five undergraduates from Old Dominion University viewed homes on a simulated real estate website. Several of the homes included physical properties that had the potential to negatively impact individual perceptions. These negative externalities were either easy to change (Level 1) or impossible to change (Level 2). Eye movements were analyzed to examine the relationship between participants' "stated preferences"[verbalized preferences], "revealed preferences" [actual decisions[, and experience. Dwell times, fixation durations/counts, and saccade counts/amplitudes were analyzed. Results revealed that experienced homebuyers demonstrated a more refined search pattern than novice searchers. Experienced homebuyers were also less impacted by negative externalities. Furthermore, stated preferences were discrepant from revealed preferences; although participants initially stated they liked/disliked a graphic, their eye movement patterns did not reflect this trend. These results have important implications for design of user-friendly web interfaces.

Liechty, Molly M.↗
DOE OSTI2016

Comparison of Fuel Loading Pattern Optimization Results using Exhaustive Search for Fresh Fuels and Local Search for Burned Fuels

Fuel loading pattern optimization is a combinatorial optimization problem from the mathematical point of view. However, exhaustive search is impractical because enormous computational cost is necessary due to huge search space. For this reason, various optimization methods have been developed so far, but no methods are able to guarantee to reach the optimum solution. In the present study, search space is divided into subspaces using key parameters that well represent characteristics of a loading pattern and then promising subspaces are extensively searched. In the present method, balance between division of a search space into subspaces and a search method used in a subspace is essential. For example, when the number of division is set to be one, it is equivalent to the exhaustive search thus is impractical. Similarly, when the division to subspaces is too coarse, an optimum (or near optimum) solution cannot be found through local search in each subspace since design space of a subspace is still too large. Contrary, if division to subspaces is too fine, number of subspaces becomes to large thus promising subspaces cannot be found. In the present study, search space is divided focusing on the location of fresh fuel assemblies with gadolinia since it has significant impact on core characteristics. Number of possible loading patterns of gadolinia bearing fresh fuel assemblies is not very large thus exhaustive search is possible. Local fine search is executed by considering location of burned fuels for each loading pattern of gadolinia bearing fresh fuel assembly. If the same solution is obtained by multiple local searches starting from different initial burnt fuel locations (but the same loading patterns for gadolinia bearing fresh fuel assemblies), the obtained solution is highly likely the optimum in the subspace. In more general, the present method is based on the 'divide and conquer' approach, which is familiar in the optimization field. Namely, after division of search space into subspaces and then promising subspace is searched. Once the promising subspace is found, the subspace is further subdivided into subspaces and repeat the above procedures. This method would be efficient when appropriate balance between search space division method and performance of local search is achieved. The previous works utilizes the similar approach. In reference [1], exhaustive search in small region in a core is carried out focusing on loading patterns of gadolinia bearing fresh fuel assemblies. In reference [2], rough exhaustive search based on the 'batch-wise' loading pattern is performed with the assist of the linear programming. By contrast, in the present study, exhaustive search is carried out for loading patterns of gadolinia bearing fresh fuel assemblies. The random Multi-start Local Search (MSLS) with the direct search or the exhaustive binary swap is used to find out optimal solutions in a subspace, which consists of loading patterns having the same arrangement of gadolinia bearing fresh fuel assemblies. (authors)

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗
DOE OSTI2021

An optimized FM-index library for nucleotide and amino acid search

Abstract Background Pattern matching is a key step in a variety of biological sequence analysis pipelines. The FM-index is a compressed data structure for pattern matching, with search run time that is independent of the length of the database text. Implementation of the FM-index is reasonably complicated, so that increased adoption will be aided by the availability of a fast and flexible FM-index library. Results We present AvxWindowedFMindex (AWFM-index), a lightweight, open-source, thread-parallel FM-index library written in C that is optimized for indexing nucleotide and amino acid sequences. AWFM-index introduces a new approach to storing FM-index data in a strided bit-vector format that enables extremely efficient computation of the FM-index occurrence function via AVX2 bitwise instructions, and combines this with optional on-disk storage of the index’s suffix array and a cache-efficient lookup table for partial k-mer searches. The AWFM-index performs exact match count and locate queries faster than SeqAn3’s FM-index implementation across a range of comparable memory footprints. When optimized for speed, AWFM-index is $$\sim $$ ∼ 2–4x faster than SeqAn3 for nucleotide search, and $$\sim $$ ∼ 2–6x faster for amino acid search; it is also $$\sim $$ ∼ 4x faster with similar memory footprint when storing the suffix array in on-disk SSD storage. Conclusions AWFM-index is easy to incorporate into bioinformatics software, offers run-time performance parameterization, and provides clients with FM-index functionality at both a high-level (count or locate all instances of a query string) and low-level (step-wise control of the FM-index backward-search process). The open-source library is available for download at https://github.com/TravisWheelerLab/AvxWindowFmIndex.

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2021

A quantum algorithm for string matching

Algorithms that search for a pattern within a larger data-set appear ubiquitously in text and image processing. Here, we present an explicit, circuit-level implementation of a quantum pattern-matching algorithm that matches a search string (pattern) of length M inside a longer text of length N. Our algorithm has a time complexity of $\tildeO$($\sqrt{N}$), while the space complexity remains modest at O(N+ M). We report the quantum gate counts relevant for both pre-fault-tolerant and fault-tolerant regimes.

Physics↗
DOE OSTI2024

Search for Soft Unclustered Energy Patterns in Proton-Proton Collisions at 13 TeV

The first search for soft unclustered energy patterns (SUEPs) is performed using an integrated luminosity of 138 fb −1 of proton-proton collision data at $\sqrt{𝑠}$ = 13 TeV, collected in 2016–2018 by the CMS detector at the LHC. Such SUEPs are predicted by hidden valley models with a new, confining force with a large ’t Hooft coupling. In events with boosted topologies, selected by high-threshold hadronic triggers, the multiplicity and sphericity of clustered tracks are used to reject the background from standard model quantum chromodynamics. With no observed excess of events over the standard model expectation, limits are set on the cross section for production via gluon fusion of a scalar mediator with SUEP-like decays.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2014

Searching for pulsars using image pattern recognition

In the modern era of big data, many fields of astronomy are generating huge volumes of data, the analysis of which can sometimes be the limiting factor in research. Fortunately, computer scientists have developed powerful data-mining techniques that can be applied to various fields. In this paper, we present a novel artificial intelligence (AI) program that identifies pulsars from recent surveys by using image pattern recognition with deep neural nets—the PICS (Pulsar Image-based Classification System) AI. The AI mimics human experts and distinguishes pulsars from noise and interference by looking for patterns from candidate plots. Different from other pulsar selection programs that search for expected patterns, the PICS AI is taught the salient features of different pulsars from a set of human-labeled candidates through machine learning. The training candidates are collected from the Pulsar Arecibo L-band Feed Array (PALFA) survey. The information from each pulsar candidate is synthesized in four diagnostic plots, which consist of image data with up to thousands of pixels. The AI takes these data from each candidate as its input and uses thousands of such candidates to train its ∼9000 neurons. The deep neural networks in this AI system grant it superior ability to recognize various types of pulsars as well as their harmonic signals. The trained AI's performance has been validated with a large set of candidates from a different pulsar survey, the Green Bank North Celestial Cap survey. In this completely independent test, the PICS ranked 264 out of 277 pulsar-related candidates, including all 56 previously known pulsars and 208 of their harmonics, in the top 961 (1%) of 90,008 test candidates, missing only 13 harmonics. The first non-pulsar candidate appears at rank 187, following 45 pulsars and 141 harmonics. In other words, 100% of the pulsars were ranked in the top 1% of all candidates, while 80% were ranked higher than any noise or interference. The performance of this system can be improved over time as more training data are accumulated. This AI system has been integrated into the PALFA survey pipeline and has discovered six new pulsars to date.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2012

All Source Sensor Analysis

ASSA is a software application that processes binary data into summarized index tables that can be used to organize features contained within the data. ASSA's index tables can also be used to search for user specified features. ASSA is designed to organize and search for patterns in unstructured binary data streams or archives, such as video, images, audio, and network traffic. ASSA is basically a very general search engine used to search for any pattern in any binary data stream. It has uses in video analytics, image analysis, audio analysis, searching hard-drives, monitoring network traffic, etc.

Trease, Harold↗
DOE OSTI2026

Search for soft unclustered energy patterns produced in association with a W or Z boson in proton-proton collisions at $\sqrt{s}$ = 13 TeV

A search for a Higgs boson produced in association with a W or Z boson and decaying via a soft unclustered energy pattern (SUEP) is presented. The analysis is based on proton-proton collision data corresponding to an integrated luminosity of 138 fb −1 collected between 2016 and 2018 at the LHC. Final states with a leptonic W or Z boson decay associated with a high multiplicity of low-momentum charged particles are explored for the first time. The results show no significant excess over the standard model background expectation. Limits are set on the production cross section of a Higgs boson that decays to a SUEP, for a range of parameters of the SUEP model. Material is provided to facilitate further interpretation of the results.

CMS↗
DOE OSTI2014

HERCULES: Strong Patterns towards More Intelligent Predictive Modeling, In: 2014 43rd International Conference on Parallel Processing

Recent work has shown that program analysis techniques to select meaningful code features of programs are important in the task of deciding the best compiler optimizations. Although, there are many successful state-of-the-art program analysis techniques, they often do not provide a simple method to extract the most expressive information about loops, especially when a target program is computationally intensive with complex loops and data dependencies. In this paper, we introduce a static technique to characterize a program using a pattern-driven system named HERCULES. This characterization technique not only helps a user to understand programs by searching pattern-of-interests, but also can be used for a predictive model that effectively selects the proper compiler optimizations. We formulated 35 loop patterns, then evaluated our characterization technique by comparing the predictive models constructed using HERCULES to three other state-of-the-art characterization methods. We show that our models outperform three state-of-the-art program characterization techniques on two multicore systems in selecting the best optimization combination from a given loop transformation space. We achieved up to 67% of the best possible speedup achievable with the optimization search space we evaluated.

Computer Science↗
NASA NTRS1974

Microstrip antenna study for Pioneer Saturn/Uranus atmosphere entry probe

The design parameters of a microstrip antenna were studied to determine its performance characteristics as affected by an atmospheric entry probe environment. The technical literature was reviewed to identify the known design and performance characteristics. These data were used to evaluate the expected effects of mission environments on the microstrip antenna design proposed for the Saturn/Uranus Atmospheric Entry Probe (SAEP). Radiation patterns and VSWR measurements were made to evaluate the performance in the SAEP thermal environment. Results of the literature search and pattern tests confirm that the microstrip antenna is a good choice as a transmitting antenna on the SAEP. The microstrip antenna is efficient, compact, and well suited to a space environment. The pattern can be controlled with a minimum beamwidth of 60 degrees (air substrate; e.g., honeycomb structure) and a maximum on the order of 100 degrees with higher dielectric constant substrates. The power handling capacity is good and can be improved by covering the antenna with a dielectric cover.

Kuhlman, E. A.↗
NASA NTRS2018

On the Natural Structure of Amino Acid Patterns in Families of Protein Sequences

All known terrestrial proteins are coded as continuous strings of ≈20 amino acids. The patterns formed by the repetitions of elements in groups of finite sequences describes the natural architectures of protein families. We present a method to search for patterns and groupings of patterns in protein sequences using a mathematically precise definition for “repetition”, an efficient algorithmic implementation and a robust scoring system with no adjustable parameters. We show that the sequence patterns can be well-separated into disjoint classes according to their recurrence in nested structures. The statistics of the occurrences of patterns indicate that short repetitions are sufficient to account for the differences between natural families and randomized groups of sequences by more than 10 standard deviations, while contiguous sequence patterns shorter than 5 residues are effectively random in their occurrences. A small subset of patterns is sufficient to account for a robust ”familiarity” definition between arbitrary sets of sequences.

Pablo Turjanski↗
DOE OSTI2025

Search for New Physics in Jet Multiplicity Patterns of Multilepton Events at $\sqrt{s}$ = 13 TeV

A first search for beyond the standard model physics in jet multiplicity patterns of multilepton events is presented, using a data sample corresponding to an integrated luminosity of 138 fb −1 of 13 TeV proton-proton collisions recorded by the CMS detector at the LHC. The search uses observed jet multiplicity distributions in one-, two-, and four-lepton events to explore possible enhancements in jet production rate in three-lepton events with and without bottom quarks. The data are found to be consistent with the standard model expectation. The results are interpreted in terms of supersymmetric production of electroweak chargino-neutralino superpartners with cascade decays terminating in prompt hadronic 𝑅-parity violating interactions.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2015

A computational approach for the annotation of hydrogen-bonded base interactions in crystallographic structures of the ribozymes

A fundamental understanding of the atomic level interactions in ribonucleic acid (RNA) and how they contribute towards RNA architecture is an important knowledge platform to develop through the discovery of motifs from simple arrangements base pairs, to more complex arrangements such as triples and larger patterns involving non-standard interactions. The network of hydrogen bond interactions is important in connecting bases to form potential tertiary motifs. Therefore, there is an urgent need for the development of automated methods for annotating RNA 3D structures based on hydrogen bond interactions. COnnection tables Graphs for Nucleic ACids (COGNAC) is automated annotation system using graph theoretical approaches that has been developed for the identification of RNA 3D motifs. This program searches for patterns in the unbroken networks of hydrogen bonds for RNA structures and capable of annotating base pairs and higher-order base interactions, which ranges from triples to sextuples. COGNAC was able to discover 22 out of 32 quadruples occurrences of the Haloarcula marismortui large ribosomal subunit (PDB ID: 1FFK) and two out of three occurrences of quintuple interaction reported by the non-canonical interactions in RNA (NCIR) database. These and several other interactions of interest will be discussed in this paper. These examples demonstrate that the COGNAC program can serve as an automated annotation system that can be used to annotate conserved base-base interactions and could be added as additional information to established RNA secondary structure prediction methods.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2022

Inferring plant–plant interactions using remote sensing

Rapid technological advancements and increasing data availability have improved the capacity to monitor and evaluate Earth's ecology via remote sensing. However, remote sensing is notoriously ‘blind’ to fine-scale ecological processes such as interactions among plants, which encompass a central topic in ecology. Here, we discuss how remote sensing technologies can help infer plant–plant interactions and their roles in shaping plant-based systems at individual, community and landscape levels. At each of these levels, we outline the key attributes of ecosystems that emerge as a product of plant–plant interactions and could possibly be detected by remote sensing data. We review the theoretical bases, approaches and prospects of how inference of plant–plant interactions can be assessed remotely. At the individual level, we illustrate how close-range remote sensing tools can help to infer plant–plant interactions, especially in experimental settings. At the community level, we use forests to illustrate how remotely sensed community structure can be used to infer dominant interactions as a fundamental force in shaping plant communities. At the landscape level, we highlight how remotely sensed attributes of vegetation states and spatial vegetation patterns can be used to assess the role of local plant–plant interactions in shaping landscape ecological systems. Synthesis . Remote sensing extends the domain of plant ecology to broader and finer spatial scales, assisting to scale ecological patterns and search for generic rules. Robust remote sensing approaches are likely to extend our understanding of how plant–plant interactions shape ecological processes across scales—from individuals to landscapes. Combining these approaches with theories, models, experiments, data-driven approaches and data analysis algorithms will firmly embed remote sensing techniques into ecological context and open new pathways to better understand biotic interactions.

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2020

A data analytical approach for assessing the efficacy of Operational Technology active defenses against insider threats

In recent years, the need for Operational Technology (OT) defenses has been recognized, serving as an additional line of defense when Information Technology (IT) defenses are bypassed. This is no longer considered an uncommon possibility when dealing with advanced persistent threat (APT) actors expected to be state-sponsored and receiving insider assistance. In these extreme adversarial situations, OT defenses aim to provide another layer of defense for the system, introduced directly at the physical process level, as described by the sensors data, the system model, and control actions. Just like IT defenses, two schools of thought, i.e., passive and active defenses, have emerged to address this challenge. In active defenses, representing the focus of this paper, known signatures, synthesized based on the system's unique characteristics, are inserted into the system. In contradistinction, passive methods rely solely on observing system behavior in search of patterns of normal behavior with deviations thereof representing abnormal behavior. In their most sophisticated implementations, both passive and active defenses rely on the use of data analytics to identify the patterns and synthesize the observed and/or inserted signatures. Past research has shown that passive defenses may be bypassed by APT actors relying on data analytics and their intimate knowledge of the system to evade detection by respecting the patterns identified by the defenders. Here this manuscript explores the use of active defenses under the assumption that the attacker has privileged access to the system, including access to the system's model and sensors data. Specifically, this manuscript assesses the ability of active defenses to remain invisible to the attackers, and discusses the associated challenges that must be addressed to ensure their resiliency against APT actors.

98 NUCLEAR DISARMAMENT, SAFEGUARDS, AND PHYSICAL P↗