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

Search for a critical point of strongly-interacting matter in central \(^{40}\)Ar + \(^{45}\)Sc collisions at 13 A–75 A GeV/c beam momentum

The critical point of strongly interacting matter is searched for at the CERN SPS by the NA61/SHINE experiment in central \(^{40}\)Ar + \(^{45}\)Sc collisions at 13 A, 19 A, 30 A, 40 A, and 75 A GeV/c. The dependence of the second-order scaled factorial moments of proton multiplicity distributions on the number of subdivisions in transverse momentum space is measured. The intermittency analysis uses statistically independent data sets for every subdivision in transverse and cumulative-transverse momentum variables. The results obtained do not indicate the searched intermittent pattern. An upper limit on the fraction of correlated protons and the intermittency index is obtained based on a comparison with the Power-law Model.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2021

The Cognitive Effects of Machine Learning Aid in Domain-Specific and Domain-General Tasks.

With machine learning (ML) technologies rapidly expanding to new applications and domains, users are collaborating with artificial intelligence-assisted diagnostic tools to a larger and larger extent. But what impact does ML aid have on cognitive performance, especially when the ML output is not always accurate? Here, we examined the cognitive effects of the presence of simulated ML assistance—including both accurate and inaccurate output—on two tasks (a domain-specific nuclear safeguards task and domain-general visual search task). Patterns of performance varied across the two tasks for both the presence of ML aid as well as the category of ML feedback (e.g., false alarm). These results indicate that differences such as domain could influence users’ performance with ML aid, and suggest the need to test the effects of ML output (and associated errors) in the specific context of use, especially when the stimuli of interest are vague or ill-defined

97 MATHEMATICS AND COMPUTING↗
NASA NTRS1983

Design considerations for a real-time ocular counterroll instrument

A real-time algorithm for measuring three-dimensional movement of the human eye, especially torsional movement, is presented. As its input, the system uses images of the eyeball taken at video rate. The amount of horizontal and vertical movement is extracted using a pupil tracking technique. The torsional movement is then measured by computing the discrete cross-correlation function between the circular samples of successive images of the iris patterns and searching for the position of the peak of the function. A local least square interpolation around the peak of the cross-correlation function is used to produce nearly unbiased estimates of torsion angle with accuracy of about 3-4 arcmin. Accuracies of better than 0.03 deg are achievable in torsional measurement with SNR higher than 36 dB. Horizontal and vertical rotations of up to + or - 13 deg can occur simultaneously with torsion without introducing any appreciable error in the counterrolling measurement process.

Hatamian, M.↗
NASA NTRS1990

PLAN-IT-2: The next generation planning and scheduling tool

PLAN-IT is a scheduling program which has been demonstrated and evaluated in a variety of scheduling domains. The capability enhancements being made for the next generation of PLAN-IT, called PLAN-IT-2 is discussed. PLAN-IT-2 represents a complete rewrite of the original PLAN-IT incorporating major changes as suggested by the application experiences with the original PLAN-IT. A few of the enhancements described are additional types of constraints, such as states and resettable-depletables (batteries), dependencies between constraints, multiple levels of activity planning during the scheduling process, pattern constraint searching for opportunities as opposed to just minimizing the amount of conflicts, additional customization construction features for display and handling of diverse multiple time systems, and reduction in both the size and the complexity for creating the knowledge-base to address the different problem domains.

Eggemeyer, William C.↗
NASA NTRS1990

Influence of convection on microstructure

The mechanism responsible for the difference in microstructure caused by solidifying the MnBi-Bi eutectic in space is sought. The objectives for the three year period are as follows: (1) completion of the following theoretical analyses - determination of the influence of the Soret effect on the average solid composition versus distance of off-eutectic mixtures directionally solidified in the absence of convection, determination of the influence of convection on the microstructure of off-eutectic mixtures using a linear velocity profile in the adjacent melt, determination of the influence of volumetric changes during solidification on microconvection near the freezing interface and on microstructure, and determination of the influence of convection on microstructure when the MnBi fibers project out in front of the bismuth matrix; (2) search for patterns in the effect of microgravity on different eutectics (for example, eutectic composition, eutectic temperature, usual microstructure, densities of pure constituents, and density changes upon solidification); and (3) determination of the Soret coefficient and the diffusion coefficient for Mn-Bi melts near the eutectic composition, both through laboratory experiements to be performed here and from data from Shuttle experiments.

Wilcox, William R.↗
NASA NTRS2010

Particle Swarm Optimization Toolbox

The Particle Swarm Optimization Toolbox is a library of evolutionary optimization tools developed in the MATLAB environment. The algorithms contained in the library include a genetic algorithm (GA), a single-objective particle swarm optimizer (SOPSO), and a multi-objective particle swarm optimizer (MOPSO). Development focused on both the SOPSO and MOPSO. A GA was included mainly for comparison purposes, and the particle swarm optimizers appeared to perform better for a wide variety of optimization problems. All algorithms are capable of performing unconstrained and constrained optimization. The particle swarm optimizers are capable of performing single and multi-objective optimization. The SOPSO and MOPSO algorithms are based on swarming theory and bird-flocking patterns to search the trade space for the optimal solution or optimal trade in competing objectives. The MOPSO generates Pareto fronts for objectives that are in competition. A GA, based on Darwin evolutionary theory, is also included in the library. The GA consists of individuals that form a population in the design space. The population mates to form offspring at new locations in the design space. These offspring contain traits from both of the parents. The algorithm is based on this combination of traits from parents to hopefully provide an improved solution than either of the original parents. As the algorithm progresses, individuals that hold these optimal traits will emerge as the optimal solutions. Due to the generic design of all optimization algorithms, each algorithm interfaces with a user-supplied objective function. This function serves as a "black-box" to the optimizers in which the only purpose of this function is to evaluate solutions provided by the optimizers. Hence, the user-supplied function can be numerical simulations, analytical functions, etc., since the specific detail of this function is of no concern to the optimizer. These algorithms were originally developed to support entry trajectory and guidance design for the Mars Science Laboratory mission but may be applied to any optimization problem.

Grant, Michael J.↗
NASA NTRS2009

The Kepler Project: Mission Update

Kepler is a Discovery-class mission designed to determine the frequency of Earth-size planets in and near the habitable zone of solar-like stars. The instrument consists of a 0.95 m aperture photometer designed to obtain high precision photometric measurement of > 100,000 stars to search for patterns of transits. The focal plane of the Schmidt-telescope contains 42 CCDs with at total of 95 mega pixels that cover 116 square degrees of sky. The photometer was launched into an Earth-trailing heliocentric orbit on March 6, 2009, finished its commissioning on May 12, and is now in the science operations mode. During the commissioning of the Kepler photometer, data were obtained at a 30 minute cadence for 53,000 stars for 9.7 days. Although the data have not yet been corrected for the presence of systematic errors and artifacts, the data show the presence of hundreds of eclipsing binary stars and variable stars of amazing variety. To provide some estimate of the capability of the photometer, a quick analysis of the photometric precision was made. Analysis of the commissioning data also show transits, occultations and light emitted from the known exoplanet HAT-P7b. The data show a smooth rise and fall of light: from the planet as it orbits its star, punctuated by a drop of 130 +/- 11 ppm in flux when the planet passes behind its star. We interpret this as the phase variation of the dayside thermal emission plus reflected light from the planet as it orbits its star and is occulted. The depth of the occultation is similar in amplitude to that expected from a transiting Earth-size planet and demonstrates that the Mission has the precision necessary to detect such planets.

Borucki, William J.↗
NASA NTRS2011

Cosmic Microwave Background Polarization and Inflation

Measurements of the cosmic microwave background (CMB) offer a means to explore the universe at a very early epoch. Specifically, if the universe went through a brief period of exponential expansion called inflation as current data suggest, gravitational waves from this period would polarize the CMB in a specific pattern. At GSFC, we are currently working towards two experiments that work in concert to measure this polarization pattern in search of evidence for inflation. The Cosmology Large Angular Scale Surveyor (CLASS) will measure the polarization at frequencies between 40 and 150 GHz from the Atacama Desert in Chile. The Primordial Inflation Polarization Explorer (PIPER) is a balloon-borne experiment that will make similar measurements at frequencies between 200 and 600 GHz.

Chuss, David T.↗
DOE OSTI2012

Hardware Architectures for Data-Intensive Computing Problems: A Case Study for String Matching

DNA analysis is an emerging application of high performance bioinformatic. Modern sequencing machinery are able to provide, in few hours, large input streams of data, which needs to be matched against exponentially growing databases of known fragments. The ability to recognize these patterns effectively and fastly may allow extending the scale and the reach of the investigations performed by biology scientists. Aho-Corasick is an exact, multiple pattern matching algorithm often at the base of this application. High performance systems are a promising platform to accelerate this algorithm, which is computationally intensive but also inherently parallel. Nowadays, high performance systems also include heterogeneous processing elements, such as Graphic Processing Units (GPUs), to further accelerate parallel algorithms. Unfortunately, the Aho-Corasick algorithm exhibits large performance variability, depending on the size of the input streams, on the number of patterns to search and on the number of matches, and poses significant challenges on current high performance software and hardware implementations. An adequate mapping of the algorithm on the target architecture, coping with the limit of the underlining hardware, is required to reach the desired high throughputs. In this paper, we discuss the implementation of the Aho-Corasick algorithm for GPU-accelerated high performance systems. We present an optimized implementation of Aho-Corasick for GPUs and discuss its tradeoffs on the Tesla T10 and he new Tesla T20 (codename Fermi) GPUs. We then integrate the optimized GPU code, respectively, in a MPI-based and in a pthreads-based load balancer to enable execution of the algorithm on clusters and large sharedmemory multiprocessors (SMPs) accelerated with multiple GPUs.

Tumeo, Antonino↗
DOE OSTI2013

Mining Large Heterogeneous Graphs using Cray s Urika

Pattern discovery and predictive modeling from seemingly related Big Data represented as massive, ad-hoc, heterogeneous networks (e.g., extremely large graphs with complex, possibly unknown structure) is an outstanding problem in many application domains. To address this problem, we are designing graph-mining algorithms capable of discovering relationship-patterns from such data and using those discovered patterns as features for classification and predictive modeling. Specifically, we are: (i) exploring statistical properties, mechanics and generative models of behavior patterns in heterogeneous information networks, (ii) developing novel, automated and scalable graph-pattern discovery algorithms and (iii) applying our relationship-analytics (data science + network science) expertise to domains spanning healthcare to homeland security.

fraud detection↗
DOE OSTI2019

Improved Accuracy for Automated Communication Pattern Characterization Using Communication Graphs and Aggressive Search Space Pruning

An understanding of a parallel application’s communication behavior is useful for a range of activities including debugging and optimization, job scheduling, target system selection, and system design. Because it can be challenging to understand communication behavior, especially for those who lack expertise or who are not familiar with the application, I and two colleagues recently developed an automated, search-based approach for recognizing and parameterizing application communication behavior using a library of common communication patterns. This initial approach was effective for characterizing the behavior of many workloads, but I identified some combinations of communication patterns for which the method was inefficient or would fail. In this paper, I discuss one such troublesome pattern combination and propose modifications to the recognition method to handle it. Specifically, I propose an alternative approach that uses communication graphs instead of traditional communication matrices to improve recognition accuracy for collective communication operations, and that uses a non-greedy recognition technique to avoid search space dead-ends that trap the original greedy recognition approach. My modified approach uses aggressive search space pruning and heuristics to control the potential for state explosion caused by its non-greedy pattern recognition method. I demonstrate the improved recognition accuracy and pruning efficacy of the modified approach using several synthetic and real-world communication pattern combinations.

Roth, Philip↗
DOE OSTI2020

Microbial macroecology: In search of mechanisms governing microbial biogeographic patterns

Abstract Introduction Rapidly advancing technologies and accumulating information about microbial communities across the globe allow the quantification of microbial properties and functions at a macro‐scale. These emerging microbial biogeographic patterns call for a practical macroecological approach to investigate their underlying mechanisms. Aims The primary aims of this paper are to review the advancements of microbial macroecology in seeking mechanisms governing microbial biogeographic patterns, and to further lay out a roadmap for microbial macroecology in 10 years. Methods We reviewed the progress of microbial macroecology and demonstrated the application of the microbial macroecological approach to microbial biogeographic patterns with three case studies. Results Microbial macroecology provides a platform for understanding microbial abundance, community structure, and functioning across space, time, and taxonomic hierarchy. It emphasizes the integral effects of environmental filtering, microbial responses, diversification, dispersal, and local extinction that drive the microbial biogeographic patterns. The microbial macroecological approach emphasizes the last two stages of the four‐stage scientific method applied to microbial ecology: (a) describing microbial traits across scales to reveal patterns, (b) mathematically representing these patterns, (c) developing and testing conceptual models to build a mechanistic understanding of these patterns from a macroecological perspective, (d) plugging the new knowledge into the theoretical advancements. Three case studies were used to demonstrate the microbial macroecological approach for understanding the global patterns of microbial biomass carbon, microbial composition (fungi : bacteria ratio), and microbial carbon use efficiency. Conclusions Microbial macroecology offers a platform for understanding the mechanisms that drive biogeographic patterns of microbial abundance, diversity and functions. It is likely that these patterns and mechanisms will be increasingly incorporated into predictive models that link climate, carbon dynamics, and biogeochemical processes. A roadmap is outlined for the growing microbial macroecology field; we expect significant progress will be made in five research directions over the next 10 years.

Xu, Xiaofeng↗
DOE OSTI2013

StreamWorks - A system for Dynamic Graph Search

Acting on time-critical events by processing ever growing social media, news or cyber data streams is a major technical challenge. Many of these data sources can be modeled as multi-relational graphs. Mining and searching for subgraph patterns in a continuous setting requires an efficient approach to incremental graph search. The goal of our work is to enable real-time search capabilities for graph databases. This demonstration will present a dynamic graph query system that leverages the structural and semantic characteristics of the underlying multi-relational graph.

graph search, graph query↗
NASA NTRS2015

The Pattern Across the Continental United States of Evapotranspiration Variability Associated with Water Availability

The spatial pattern across the continental United States of the interannual variance of warm season water-dependent evapotranspiration, a pattern of relevance to land-atmosphere feedback, cannot be measured directly. Alternative and indirect approaches to estimating the pattern, however, do exist, and given the uncertainty of each, we use several such approaches here. We first quantify the water dependent evapotranspiration variance pattern inherent in two derived evapotranspiration datasets available from the literature. We then search for the pattern in proxy geophysical variables (air temperature, stream flow, and NDVI) known to have strong ties to evapotranspiration. The variances inherent in all of the different (and mostly independent) data sources show some differences but are generally strongly consistent they all show a large variance signal down the center of the U.S., with lower variances toward the east and (for the most part) toward the west. The robustness of the pattern across the datasets suggests that it indeed represents the pattern operating in nature. Using Budykos hydroclimatic framework, we show that the pattern can largely be explained by the relative strength of water and energy controls on evapotranspiration across the continent.

Air Temperature↗
NASA NTRS1988

Expert system validation in prolog

An overview of the Expert System Validation Assistant (EVA) is being implemented in Prolog at the Lockheed AI Center. Prolog was chosen to facilitate rapid prototyping of the structure and logic checkers and since February 1987, we have implemented code to check for irrelevance, subsumption, duplication, deadends, unreachability, and cycles. The architecture chosen is extremely flexible and expansible, yet concise and complementary with the normal interactive style of Prolog. The foundation of the system is in the connection graph representation. Rules and facts are modeled as nodes in the graph and arcs indicate common patterns between rules. The basic activity of the validation system is then a traversal of the connection graph, searching for various patterns the system recognizes as erroneous. To aid in specifying these patterns, a metalanguage is developed, providing the user with the basic facilities required to reason about the expert system. Using the metalanguage, the user can, for example, give the Prolog inference engine the goal of finding inconsistent conclusions among the rules, and Prolog will search the graph intantiations which can match the definition of inconsistency. Examples of code for some of the checkers are provided and the algorithms explained. Technical highlights include automatic construction of a connection graph, demonstration of the use of metalanguage, the A* algorithm modified to detect all unique cycles, general-purpose stacks in Prolog, and a general-purpose database browser with pattern completion.

Stock, Todd↗
NASA NTRS2011

Improve Data Mining and Knowledge Discovery Through the Use of MatLab

Data mining is widely used to mine business, engineering, and scientific data. Data mining uses pattern based queries, searches, or other analyses of one or more electronic databases/datasets in order to discover or locate a predictive pattern or anomaly indicative of system failure, criminal or terrorist activity, etc. There are various algorithms, techniques and methods used to mine data; including neural networks, genetic algorithms, decision trees, nearest neighbor method, rule induction association analysis, slice and dice, segmentation, and clustering. These algorithms, techniques and methods used to detect patterns in a dataset, have been used in the development of numerous open source and commercially available products and technology for data mining. Data mining is best realized when latent information in a large quantity of data stored is discovered. No one technique solves all data mining problems; challenges are to select algorithms or methods appropriate to strengthen data/text mining and trending within given datasets. In recent years, throughout industry, academia and government agencies, thousands of data systems have been designed and tailored to serve specific engineering and business needs. Many of these systems use databases with relational algebra and structured query language to categorize and retrieve data. In these systems, data analyses are limited and require prior explicit knowledge of metadata and database relations; lacking exploratory data mining and discoveries of latent information. This presentation introduces MatLab(R) (MATrix LABoratory), an engineering and scientific data analyses tool to perform data mining. MatLab was originally intended to perform purely numerical calculations (a glorified calculator). Now, in addition to having hundreds of mathematical functions, it is a programming language with hundreds built in standard functions and numerous available toolboxes. MatLab's ease of data processing, visualization and its enormous availability of built in functionalities and toolboxes make it suitable to perform numerical computations and simulations as well as a data mining tool. Engineers and scientists can take advantage of the readily available functions/toolboxes to gain wider insight in their perspective data mining experiments.

Shaykhian, Gholam Ali↗
NASA NTRS2011

Improve Data Mining and Knowledge Discovery through the use of MatLab

Data mining is widely used to mine business, engineering, and scientific data. Data mining uses pattern based queries, searches, or other analyses of one or more electronic databases/datasets in order to discover or locate a predictive pattern or anomaly indicative of system failure, criminal or terrorist activity, etc. There are various algorithms, techniques and methods used to mine data; including neural networks, genetic algorithms, decision trees, nearest neighbor method, rule induction association analysis, slice and dice, segmentation, and clustering. These algorithms, techniques and methods used to detect patterns in a dataset, have been used in the development of numerous open source and commercially available products and technology for data mining. Data mining is best realized when latent information in a large quantity of data stored is discovered. No one technique solves all data mining problems; challenges are to select algorithms or methods appropriate to strengthen data/text mining and trending within given datasets. In recent years, throughout industry, academia and government agencies, thousands of data systems have been designed and tailored to serve specific engineering and business needs. Many of these systems use databases with relational algebra and structured query language to categorize and retrieve data. In these systems, data analyses are limited and require prior explicit knowledge of metadata and database relations; lacking exploratory data mining and discoveries of latent information. This presentation introduces MatLab(TradeMark)(MATrix LABoratory), an engineering and scientific data analyses tool to perform data mining. MatLab was originally intended to perform purely numerical calculations (a glorified calculator). Now, in addition to having hundreds of mathematical functions, it is a programming language with hundreds built in standard functions and numerous available toolboxes. MatLab's ease of data processing, visualization and its enormous availability of built in functionalities and toolboxes make it suitable to perform numerical computations and simulations as well as a data mining tool. Engineers and scientists can take advantage of the readily available functions/toolboxes to gain wider insight in their perspective data mining experiments.

Shaykahian, Gholan Ali↗