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 37 records · Page 2

Clustering-Based Predictive Analytics to Improve Scientific Data Discovery

Given the sheer volume of scientific data archived within the data-intensive projects at the US Department of Energy's Oak Ridge National Laboratory, finding precisely what data we are looking for may not be a trivial task; conversely, we may also miss a more prominent data product. To address such issues, we propose improving the data discovery system and using data analytics methods to comprehend what specific users might be interested in based on their physiological state, search patterns, and past data usage history. This work's primary goal is to prune the complexity, increase the visibility of popular data products, and direct users toward the data that best meet their needs. The proposed algorithm constructs a user profile based on the user's explicit or implicit interactions with the system, such as items they are currently looking at on-site and the key metadata mappings related to the data set. The pattern is then used to build a training data set, which will help find relevant data to recommend to the user.

Devarakonda, Ranjeet↗

Distributed Solution Approach for a Stackelberg Pricing Game of Aggregated Demand Response

Demand-side management is a fundamental up-to-date strategy that transforms the traditional power grid to a modern smart grid where the flexible pricing mechanisms play a critical role in its successful implementation. In this paper, the pricing-demand response between a distribution system operator (DSO) and load aggregators (LAs) is modeled as a Stackelberg game, where the DSO is the price maker that adjusts its strategy based on observed responses from LAs. With the concerns of computational cost and privacy protection, two distributed solution approaches, particle swarm optimization and pattern search algorithm, are conducted and compared with the classical centralized backward induction approach. Numerical results on a small case study demonstrate the effectiveness of the proposed distributed solution approaches in leveraging flexible demand response potential.

Chen, Yang↗

Modeling sequential context effects in diagnostic interpretation of screening mammograms

Prior research has shown that physicians’ medical decisions can be influenced by sequential context, particularly in cases where successive stimuli exhibit similar characteristics when analyzing medical images. This type of systematic error is known to psychophysicists as sequential context effect as it indicates that judgments are influenced by features of and decisions about the preceding case in the sequence of examined cases, rather than being based solely on the peculiarities unique to the present case. We determine if radiologists experience some form of context bias, using screening mammography as the use case. To this end, we explore correlations between previous perceptual behavior and diagnostic decisions and current decisions. We hypothesize that a radiologist’s visual search pattern and diagnostic decisions in previous cases are predictive of the radiologist’s current diagnostic decisions. To test our hypothesis, we tasked 10 radiologists of varied experience to conduct blind reviews of 100 four-view screening mammograms. Eye-tracking data and diagnostic decisions were collected from each radiologist under conditions mimicking clinical practice. Perceptual behavior was quantified using the fractal dimension of gaze scanpath, which was computed using the Minkowski–Bouligand box-counting method. To test the effect of previous behavior and decisions, we conducted a multifactor fixed-effects ANOVA. Further, to examine the predictive value of previous perceptual behavior and decisions, we trained and evaluated a predictive model for radiologists’ current diagnostic decisions. ANOVA tests showed that previous visual behavior, characterized by fractal analysis, previous diagnostic decisions, and image characteristics of previous cases are significant predictors of current diagnostic decisions. Additionally, predictive modeling of diagnostic decisions showed an overall improvement in prediction error when the model is trained on additional information about previous perceptual behavior and diagnostic decisions.

60 APPLIED LIFE SCIENCES↗

Distributed Acoustic Sensing (DAS) Data for Periodic Hydraulic Tests: Hydraulic Data

Hydraulic responses from periodic hydraulic tests conducted at the Mirror Lake Fractured Rock Research Site, during the summer of 2015. These hydraulic responses were measured also using distributed acoustic sensing (DAS) which is cataloged in a different submission under this grant number. The tests are explained in detail in Matthew Cole's MS Thesis which is cataloged here. The injection and drawdown data and the codes used to analyze the data. Sinusoidal Data is a Matlab data file containing a data table for each period-length test. Within each table is a column labeled: time (seconds since beginning of pumping), Inj_m3pm (formation injection in cubic meters per minute), and head for each observation well (meters). The three Matlab script files (*.m) were used to analyze hydraulic responses from the data file above. High-Pass Sinusoid is a routine for filtering the data, computing the FFT, and extracting phase and amplitude values. Borestore is a routine which contains the borehole storage analytic solution and compares modeled amplitude and phase from this solution to computed amplitude and phase from the data. Patsearch Borestore is a routine containing the built-in pattern search optimization method. This minimizes the total error between modeled and actual amplitude and phase in Borestore. Comments within the script files contain more specific instructions for their use.

15 GEOTHERMAL ENERGY↗

INSPIRE and SPIRES Log File Analysis

SPIRES, an aging high-energy physics publication data base, is in the process of being replaced by INSPIRE. In order to ease the transition from SPIRES to INSPIRE it is important to understand user behavior and the drivers for adoption. The goal of this project was to address some questions in regards to the presumed two-thirds of the users still using SPIRES. These questions are answered through analysis of the log files from both websites. A series of scripts were developed to collect and interpret the data contained in the log files. The common search patterns and usage comparisons are made between INSPIRE and SPIRES, and a method for detecting user frustration is presented. The analysis reveals a more even split than originally thought as well as the expected trend of user transition to INSPIRE.

99 GENERAL AND MISCELLANEOUS↗

Papers from the SLAC DOE Science Undergraduate Laboratory Internship Program (SULI 2011)

SPIRES, an aging high-energy physics publication data base, is in the process of being replaced by INSPIRE. In order to ease the transition from SPIRES to INSPIRE it is important to understand user behavior and the drivers for adoption. The goal of this project was to address some questions in regards to the presumed two-thirds of the users still using SPIRES. These questions are answered through analysis of the log files from both websites. A series of scripts were developed to collect and interpret the data contained in the log files. The common search patterns and usage comparisons are made between INSPIRE and SPIRES, and a method for detecting user frustration is presented. The analysis reveals a more even split than originally thought as well as the expected trend of user transition to INSPIRE.

ACCPHY↗

Spread Spectrum Time Domain Reflectivity for String Monitoring in PV Power Plants (Final Technical Report)

This final report describes the methods and results of applying Spread Spectrum Time Domain Reflectivity (SSTDR) for String Monitoring in PV Power Plants for DE-EE0008169. The project created a new system for both detecting and locating electrical faults in photovoltaic systems. In this work, we address photovoltaic electric faults that are both common and costly. Based on interviews with photovoltaic power plant owners, operators, and maintainers, three types of faults are common and of significant interest: disconnects, ground faults, and arc faults. Disconnects can originate from many sources. They are often due to everyday events, such as lawnmowing (accidentally running over a cable), animals eating through the cables, or degradation that occurs over time due to corrosion or general degradation. Ground faults occur when the cables (for example, due to frayed insolation) connect to the ground, relaying current into the ground. These faults are particularly problematic since the ground faults are often intermittent. That is, ground faults commonly appear during rain storms due to a change in soil conductivity and then disappear when the rain ends. This makes the ground fault difficult to find because while current systems can detect the overall change in voltage and current associated with a ground fault, technicians are necessary to locate the fault. As a result, ground faults may disappear before the technician arrives at the power plant. Hence, locating and fixing ground faults often require multiple trips. We also study arc faults, which can result when nearby conductors create an arc of electrical current through the air. While less common, arc faults can be extremely dangerous. The energetic electrical arc can cause fires and destroy equipment, costing significant damage. Overall all three types of faults cost owners and operators money, either from the destruction of equipment or from technician time. Furthermore, while devices exist for detecting ground faults (ground fault circuit interrupters) and arc faults (arc fault circuit interrupter), these systems only search patterns of electrical current that correspond to each fault. This information cannot be used to locate the fault. In addition, these protection systems experience nuisance trips due to nearby electromagnetic interference, such as from a lawn mower or other motors that produce significant amounts of electromagnetic radiation. Hence, the overall goal of this project is to create an SSTDR tool that provides photovoltaic power plants with more reliable fault detection in addition to the localization of faults. SSTDR works by transmitting electrical signals into the photovoltaic string. Those signals reflect from impedance discontinuities (i.e., disconnects, ground faults, and arc faults). These faults are then detected by measuring the presence of a reflection at the SSTDR and can be located by identifying the location of that reflection in time. In addition, unlike current protection systems, these systems do not experience nuisance trips since their low amplitude, high frequency, and coded signal can by analyzed without interference from the regular operational voltage on the photovoltaic string.

14 SOLAR ENERGY↗

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↗

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↗

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↗

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↗

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↗

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↗

Searching for modified growth patterns with tomographic surveys

In alternative theories of gravity, designed to produce cosmic acceleration at the current epoch, the growth of large scale structure can be modified. We study the potential of upcoming and future tomographic surveys such as Dark Energy Survey (DES) and Large Synoptic Survey Telescope (LSST), with the aid of cosmic microwave background (CMB) and supernovae data, to detect departures from the growth of cosmic structure expected within general relativity. We employ parametric forms to quantify the potential time- and scale-dependent variation of the effective gravitational constant and the differences between the two Newtonian potentials. We then apply the Fisher matrix technique to forecast the errors on the modified growth parameters from galaxy clustering, weak lensing, CMB, and their cross correlations across multiple photometric redshift bins. We find that even with conservative assumptions about the data, DES will produce nontrivial constraints on modified growth and that LSST will do significantly better.

79 ASTRONOMY AND ASTROPHYSICS↗

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↗

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↗

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↗

A CATALOG OF MORPHOLOGICALLY IDENTIFIED MERGING GALAXIES

We present a new catalog and images of interacting and merging galaxies obtained with morphological identification from Canada-France-Hawaii Telescope observations. We first used a morphological pattern recognition searching routine to select possible candidates, and then visually inspected the images of these candidates to identify true merging/interacting sources. We discover 15,147 new pairs of merging galaxies within 422 deg{sup 2} of Red Sequence Cluster Survey 2. Furthermore, we also find nine new candidates of galaxy clusters by searching for regions with significant density enhancements of merging galaxies. This catalog has the largest number of morphologically identified interacting and merging galaxies based on consistent searching criteria. These sources provide a uniform sample of merging galaxies for further photometric and spectroscopic studies of galaxy evolutio000.

79 ASTRONOMY AND ASTROPHYSICS↗