Search NASA⌕ Search

SEARCH · Search NASA

Results for “Matched”

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 19 records
All sourcesNASA NTRSDOE OSTI
DOE OSTI2021

History Matching and Performance Prediction of a Polymer Flood Pilot in Heavy Oil Reservoir on Alaska North Slope

The first-ever polymer flood pilot to enhance heavy oil recovery on Alaska North Slope (ANS) is ongoing. After more than 2.5 years of polymer injection, significant benefit has been observed from the decrease in water cut from 65% to less than 15% in the project producers. The primary objective of this study is to develop a robust history-matched reservoir simulation model capable of predicting future polymer flood performance. In this work, the reservoir simulation model has been developed based on the geological model and available reservoir and fluid data. In particular, four high transmissibility strips were introduced to connect the injector-producer well pairs, simulating short-circuiting flow behavior that can be explained by viscous fingering and reproducing the water cut history. The strip transmissibilities were manually tuned to improve the history matching results during the waterflooding and polymer flooding periods, respectively. It has been found that higher strip transmissibilities match the sharp water cut increase very well in the waterflooding period. Then the strip transmissibilities need to be reduced with time to match the significant water cut reduction. The viscous fingering effect in the reservoir during waterflooding and the restoration of injection conformance during polymer flooding have been effectively represented. Based on the validated simulation model, numerical simulation tests have been conducted to investigate the oil recovery performance under different development strategies, with consideration for sensitivity to polymer parameter uncertainties. The oil recovery factor with polymer flooding can reach about 39% in 30 years, twice as much as forecasted with continued waterflooding. Besides, the updated reservoir model has been successfully employed to forecast polymer utilization, a valuable parameter to evaluate the pilot test’s economic efficiency. All the investigated development strategies indicate polymer utilization lower than 3.5 lbs/bbl in 30 years, which is economically attractive.

Wang, Xindan↗
DOE OSTI2022

Matching Complexes of Trees and Applications of the Matching Tree Algorithm

A matching complex of a simple graph G is a simplicial complex with faces given by the matchings of G. The topology of matching complexes is mysterious; there are few graphs for which the homotopy type is known. Marietti and Testa showed that matching complexes of forests are contractible or homotopy equivalent to a wedge of spheres. We study two specific families of trees. For caterpillar graphs, we give explicit formulas for the number of spheres in each dimension and for perfect binary trees we find a strict connectivity bound. We also use a tool from discrete Morse theory called the Matching Tree Algorithm to study the connectivity of honeycomb graphs, partially answering a question raised by Jonsson.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Towards Automatically Matching Security Advisories to CPEs: String Similarity-based Vendor Matching

When a vulnerability is reported by the National Vulnerability Database (NVD), affected products are listed in the structured Common Platform Enumeration (CPE) format. Unfortunately, if the vulnerability is in a software library (e.g., Log4j), it will not include CPEs for each product containing that library. In these cases, security operators need to manually read the vendor's or third-party security advisories to see if their product is affected. However, these advisories do not report affected products in a structured format, which prevents automated processing, This paper makes the first effort towards automatically constructing structured CPEs for the vulnerable products in a non-NVD security advisory from the unstructured data in the advisory. Since this is a very challenging problem, this paper specifically focuses on the initial but key step of matching the un-structured vendor names in security advisories to the structured vendor representations in the standard CPE format. We explore the feasibility of using string similarity to solve the problem. The basic idea is to compare a vendor name from the non-NVD advisory with each vendor in the official CPE dictionary. The CPE vendor with the highest similarity score to the advisory's vendor will be considered as the match. We first conduct an experimental, comparative study of multiple mainstream string similarity metrics for this matching problem. To improve the performance, we then design a new string similarity metric that is adapted from an existing metric by weighing different tokens in the advisory's vendor name differently.

McClanahan, Kylie↗
DOE OSTI2021

A machine-learning inverse model framework for rapid forecasting and history matching in unconventional reservoirs

Model-based optimization for real-time forecasting in unconventional reser-voirs requires novel methods and work?ows since the strategies and work?ows used in conventional reservoirs are either inapplicable, or prohibitively expen-sive and time-consuming. Insu?cient site data and computational expense of high-?delity simulations mean that work?ows with high-?delity simulations are not ideal for usage in comprehensive uncertainty quanti?cation stud-ies that require 1000s of forward model runs. We present an alternative, novel work?ow for unconventional reservoirs, based on the interplay between reduced-order models and machine-learning. Our physics-informed machine-learning (PIML) work?ow addresses the challenges to real-time reservoir management in uncoventionals, namely lack of data (the time-frame for which the wells have been producing), and computational expense of high-?delity modeling. We use the machine-learning paradigm of transfer-learning to bind together fast but less accurate reduced-order models with slow, but accurate high-?delity models and circumvent the di?culties inherent in the current state-of-the-art for unconventionals. Such a PIML work?ow, grounded in physics, is a viable candidate for real-time history matching and production forecasting in a fractured shale gas reservoir. The signi?cance of our approach is that while it is developed for a particu-lar well and site in the Marcelus Shale gas reservoir of the Appalachian basin (MSEEL), it is not wedded to it. We expect the same work?ow can be ap-plied to other shale formations (e.g., Woodford, Barnett, Utica, EagleFord) should site-data become available, using the same set of machine-learning techniques from transfer learning. Some ?ne-tuning (or minimal retraining of the neural networks) will be required to transfer knowledge across shale gas sites/formations but it is a clearly superior alternative to developing a new machine-learning model altogether when considering a di?erent site.

Srinivasan, Shriram↗
DOE OSTI2024

Moving toward automated µFTIR spectra matching for microplastic identification: addressing false identifications and improving accuracy

Abstract Infrared spectroscopy is a widely used tool for studying microplastics and identifying microparticles. Researchers rely on spectral libraries to differentiate between synthetic and natural materials. Unfortunately, spectral library matching is not perfect, and best practices require researchers to use time consuming, manual peak matching to assess spectral matches. Moving toward automated matching requires increased confidence in the matching process. Using spectra matching software may increase the efficiency of particle identification, however some matching strategies may confuse natural materials such as cotton, silk, and plant matter with common classes of synthetics such as polyesters and polyamides. In this experiment, we prepared 22 pristine sample materials from natural and synthetic sources and measured micro-Fourier transform infrared (µFTIR) spectra in transmission mode for each sample using a Thermo Nicolet iN10 MX instrument. The collected spectra were then input into two spectral library matching systems (Omnic Picta and Open Specy), using a total of five identification routines. Next, we placed a subset of four pristine microplastic materials in a biologically active river system for two weeks to simulate environmental samples. These simulated environmental samples were processed using 10% hydrogen peroxide for 24 h to remove organic contamination and then identified using the strongest performing library. We found that libraries with fewer sample spectra produced lower correlation matches and that using derivative correction greatly reduced the number of inaccuracies in identifying materials as either natural or synthetic. We also found that environmental fouling reduced the correlation value of library matches when compared to pristine particles, however the effect was not consistent across the four materials tested. Overall, we found that the accuracy of automated library matching in the tested systems and processing routines varied from 64.1 to 98.0% for distinguishing between natural and synthetic materials, and that a high Hit Quality Index (HQI) did not always correlate with accuracy. These results are important for the microplastic field, demonstrating a need to rigorously test spectral libraries and processing routines with known materials to ensure identification accuracy.

Kozloski, Rachel↗
NASA NTRS2004

A Review of the Match Technique as Applied to AASE-2/EASOE and SOLVE/THESEO 2000

We apply the GSFC trajectory model with a series of ozonesondes to derive ozone loss rates in the lower stratosphere for the AASE-2/EASOE mission (January - March 1992) and for the SOLVE/THESEO 2000 mission (January - March 2000) in an approach similar to Match. Ozone loss rates are computed by comparing the ozone concentrations provided by ozonesondes launched at the beginning and end of the trajectories connecting the launches. We investigate the sensitivity of the Match results on the various parameters used to reject potential matches in the original Match technique and conclude that only a filter based on potential vorticity changes along the calculated back trajectory seems necessary. Our study also demonstrates that calculated ozone loss rates can vary by up to a factor of two depending upon the precise trajectory paths calculated for each trajectory. As a result an additional systematic error might need to be added to the statistical uncertainties published with previous Match results. The sensitivity to the trajectory path is particularly pronounced in the month of January, the month during which the largest ozone loss rate discrepancies between photochemical models and Match are found. For most of the two study periods, our ozone loss rates agree with those previously published. Notable exceptions are found for January 1992 at 475 K and late February/early March 2000 at 450 K, both periods during which we find less loss than the previous studies. Integrated ozone loss rates in both years compare well with those found in numerous other studies and in a potential vorticity/potential temperature approach shown previously and in this paper. Finally, we suggest an alternate approach to Match using trajectory mapping that appears to more accurately reflect the true uncertainties associated with Match and reduces the dependence upon filters that may bias the results of Match through the rejection of greater than or equal to 80% of the matched sonde pairs and >99% of matched observations.

Morris, Gary A.↗
NASA NTRS2003

Match-bounded String Rewriting Systems

We introduce a new class of automated proof methods for the termination of rewriting systems on strings. The basis of all these methods is to show that rewriting preserves regular languages. To this end, letters are annotated with natural numbers, called match heights. If the minimal height of all positions in a redex is h+1 then every position in the reduct will get height h+1. In a match-bounded system, match heights are globally bounded. Using recent results on deleting systems, we prove that rewriting by a match-bounded system preserves regular languages. Hence it is decidable whether a given rewriting system has a given match bound. We also provide a sufficient criterion for the abence of a match-bound. The problem of existence of a match-bound is still open. Match-boundedness for all strings can be used as an automated criterion for termination, for match-bounded systems are terminating. This criterion can be strengthened by requiring match-boundedness only for a restricted set of strings, for instance the set of right hand sides of forward closures.

Geser, Alfons↗
NASA NTRS2021

Hybrid phenology matching model for robust crop phenological retrieval

Crop phenology regulates seasonal agroecosystem carbon, water, and energy exchanges, and is a key component in empirical and process-based crop models for simulating biogeochemical cycles of farmlands, assessing gross and net primary production, and forecasting the crop yield. The advances in phenology matching models provide a feasible means to monitor crop phenological progress using remote sensing observations, with a priori information of reference shapes and reference phenological transition dates. Yet the underlying geometrical scaling assumption of models, together with the challenge in defining phenological references, hinders the applicability of phenology matching in crop phenological studies. The objective of this study is to develop a novel hybrid phenology matching model to robustly retrieve a diverse spectrum of crop phenological stages using satellite time series. The devised hybrid model leverages the complementary strengths of phenometric extraction methods and phenology matching models. It relaxes the geometrical scaling assumption and can characterize key phenological stages of crop cycles, ranging from farming practice-relevant stages (e.g., planted and harvested) to crop development stages (e.g., emerged and mature). To systematically evaluate the influence of phenological references on phenology matching, four representative phenological reference scenarios under varying levels of phenological calibrations in terms of time and space are further designed with publicly accessible phenological information. The results indicate that the hybrid phenology matching model can achieve high accuracies for estimating corn and soybean phenological growth stages in Illinois, particularly with the year- and region-adjusted phenological reference (R-squared higher than 0.9 and RMSE less than 5 days for most phenological stages). The inter-annual and regional phenological patterns characterized by the hybrid model correspond well with those in the crop progress reports (CPRs) from the USDA National Agricultural Statistics Service (NASS). Compared to the benchmark phenology matching model, the hybrid model is more robust to the decreasing levels of phenological reference calibrations, and is particularly advantageous in retrieving crop early phenological stages (e.g., planted and emerged stages) when the phenological reference information is limited. This innovative hybrid phenology matching model, together with CPR-enabled phenological reference calibrations, holds 3 considerable promise in revealing spatio-temporal patterns of crop phenology over extended geographical regions.

Phenology↗
DOE OSTI2025

Dense Image Matching Uncertainty Estimation and Confidence Metrics

Dense stereo matching takes overlapping image pairs as input and outputs a disparity map which encodes pixel-by-pixel matches between the images. Recently, there has been an interest in ranking the quality, or even quantifying the accuracy, of disparity estimates. The proposed methods can be described as either uncertainty estimators or confidence metrics. Uncertainty estimators are a small minority of the research. However, they have the potential to be the most useful because they estimate disparity accuracy (in pixel units) that can be used to threshold matches or carried forward using error propagation. The majority of the research deals with confidence metrics which give an ordinal (or binary) ranking of a match’s quality relative to other matches. Confidence metrics do not have units and thus are useful primarily for thresholding matches from mismatches. The methods could also be described as handcrafted or deep-learning based. The majority of the research focused on outdoor driving scenes. Hence, our interest–application to a satellite semi-global matching pipeline–is a domain shift that may challenge deep-learning based methods. We conclude by recommending five handcrafted and two deep-learning based methods for evaluation in our pipeline.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS1987

Constraint-based stereo matching

The major difficulty in stereo vision is the correspondence problem that requires matching features in two stereo images. Researchers describe a constraint-based stereo matching technique using local geometric constraints among edge segments to limit the search space and to resolve matching ambiguity. Edge segments are used as image features for stereo matching. Epipolar constraint and individual edge properties are used to determine possible initial matches between edge segments in a stereo image pair. Local edge geometric attributes such as continuity, junction structure, and edge neighborhood relations are used as constraints to guide the stereo matching process. The result is a locally consistent set of edge segment correspondences between stereo images. These locally consistent matches are used to generate higher-level hypotheses on extended edge segments and junctions to form more global contexts to achieve global consistency.

Kuan, D. T.↗
NASA NTRS1991

A graph theoretic approach to scene matching

The ability to match two scenes is a fundamental requirement in a variety of computer vision tasks. A graph theoretic approach to inexact scene matching is presented which is useful in dealing with problems due to imperfect image segmentation. A scene is described by a set of graphs, with nodes representing objects and arcs representing relationships between objects. Each node has a set of values representing the relations between pairs of objects, such as angle, adjacency, or distance. With this method of scene representation, the task in scene matching is to match two sets of graphs. Because of segmentation errors, variations in camera angle, illumination, and other conditions, an exact match between the sets of observed and stored graphs is usually not possible. In the developed approach, the problem is represented as an association graph, in which each node represents a possible mapping of an observed region to a stored object, and each arc represents the compatibility of two mappings. Nodes and arcs have weights indicating the merit or a region-object mapping and the degree of compatibility between two mappings. A match between the two graphs corresponds to a clique, or fully connected subgraph, in the association graph. The task is to find the clique that represents the best match. Fuzzy relaxation is used to update the node weights using the contextual information contained in the arcs and neighboring nodes. This simplifies the evaluation of cliques. A method of handling oversegmentation and undersegmentation problems is also presented. The approach is tested with a set of realistic images which exhibit many types of sementation errors.

Ranganath, Heggere S.↗
NASA NTRS1997

Efficient algorithms for robust feature matching

One of the basic building blocks in any point-based registration scheme involves matching feature points that are extracted from the sensed image to their counterparts in the reference image. This leads to the fundamental problem of point matching: given two sets of points, find the affine transformation that transforms one point set so that its distance from the other point set is minimized. Because of measurement errors and the presence of outlying data points, it is important that the distance measure between two point sets be robust to these effects. We measure distances using the generalized Hausdorff distance. Point matching can be a computationally intensive task, and there have been a number of algorithms and approaches proposed for solving this problem both theoretical and applied. We present two approaches to the point matching problem, in an attempt to reduce the computational complexity of the problem, while still providing guarantees on the quality of the final match. Our first method is an approximation algorithm, which is loosely based on a branch-and-bound approach due to Huttenlocher and Rucklidge. We show that by varying the approximation error bounds, it is possible to achieve a tradeoff between the quality of the match and the running time of the algorithm. Our second method involves a Monte Carlo method for accelerating the search process used in the first algorithm. With high probability this method succeeds in finding an approximately optimal match. We establish the efficiency of our approaches empirically.

Mount, David M.↗
NASA NTRS2014

Processing of ICARTT Data Files Using Fuzzy Matching and Parser Combinators

In this paper, the task of parsing and matching inconsistent, poorly formed text data through the use of parser combinators and fuzzy matching is discussed. An object-oriented implementation of the parser combinator technique is used to allow for a relatively simple interface for adapting base parsers. For matching tasks, a fuzzy matching algorithm with Levenshtein distance calculations is implemented to match string pair, which are otherwise difficult to match due to the aforementioned irregularities and errors in one or both pair members. Used in concert, the two techniques allow parsing and matching operations to be performed which had previously only been done manually.

Rutherford, Matthew T.↗
DOE OSTI2024

Streaming Matching and Edge Cover in Practice

Graph algorithms with polynomial space and time requirements often become infeasible for massive graphs with billions of edges or more. State-of-the-art approaches therefore employ approximate serial, parallel, and distributed algorithms to tackle these challenges. However, such approaches require storing the entire graph in memory and thus need access to costly computing resources such as clusters and supercomputers. In this paper, we present practical streaming approaches for solving massive graph problems using limited memory for two prototypical graph problems: maximum weighted matching and minimum weighted edge cover. For matching, we conduct a thorough computational study on two of the semi-streaming algorithms including a recent breakthrough result that achieves a $1/(2+\varepsilon)$-approximation of the weight while using $O( n \log W /\epsilon)$ memory (here $n$ is the number of vertices and $W$ is the maximum edge weight), designed by Paz and Schwartzman [SODA, 2017]. Empirically, we show that the semi-streaming algorithms produce matchings whose weight is close to the best $1/2$-approximate offline algorithm while requiring less time and an order-of-magnitude less memory. For minimum weighted edge cover, we develop three novel semi-streaming algorithms. Two of these algorithms require a single pass through the input graph, require $O(n \log n)$ memory, and provide a 2-approximation guarantee on the objective. We also leverage a relationship between approximate maximum weighted matching and approximate minimum weighted edge cover to develop a two-pass $3/2+\epsilon$-approximate algorithm with the memory requirement of Paz and Schwartzman's semi-streaming matching algorithm. These streaming approaches are compared against the state-of-the-art 3/2-approximate offline algorithm. The semi-streaming matching and the novel edge cover algorithms proposed in this paper can process graphs with several billions of edges in under 30 minutes using 6 GB of memory, which is at least an order of magnitude improvement from the offline (non-streaming) algorithms. For the largest graph, the best alternative offline parallel approximation algorithm (GPA+ROMA) could not finish in three hours even while employing hundreds of processors and 1 TB of memory. We also demonstrate an application of the semi-streaming algorithm by computing a matching using linearly bounded memory on item intersection graphs derived from three machine learning datasets, whereas the existing offline algorithms could not complete on one of these datasets since their memory requirements exceeded 1TB.

Ferdous, S M.↗
DOE OSTI2023

AMG Preconditioners based on parallel hybrid coarsening and multi-objective graph matching

We describe preliminary results from a multi-objective graph matching algorithm, in the coarsening step of an aggregation-based Algebraic MultiGrid (AMG) preconditioner, for solving large and sparse linear systems of equations on high-end parallel computers. We have two objectives. First, we wish to improve the convergence behavior of the AMG method when applied to highly anisotropic problems. Second, we wish to extend the parallel package \texttt{PSCToolkit} to exploit multi-threaded parallelism at the node level on multi-core processors. Our matching proposal balances the need to simultaneously compute high weights and large cardinalities by a new formulation of the weighted matching problem combining both these objectives using a parameter $\lambda$. We compute the matching by a parallel $2/3-\varepsilon$-approximation algorithm for maximum weight matchings. Results with the new matching algorithm show that for a suitable choice of the parameter $\lambda$ we compute effective preconditioners in the presence of anisotropy, i.e., smaller solve times, setup times, iterations counts, and operator complexity.

D'Ambra, Pasqua↗
NASA NTRS1972

A Computer Aided Broad Band Impedance Matching Technique Using a Comparison Reflectometer

An improved broadband impedance matching technique was developed. The technique is capable of resolving points in the waveguide which generate reflected energy. A version of the comparison reflectometer was developed and fabricated to determine the mean amplitude of the reflection coefficient excited at points in the guide as a function of distance, and the complex reflection coefficient of a specific discontinuity in the guide as a function of frequency. An impedance matching computer program was developed which is capable of impedance matching the characteristics of each disturbance independent of other reflections in the guide. The characteristics of four standard matching elements were compiled, and their associated curves of reflection coefficient and shunt susceptance as a function of frequency are presented. It is concluded that an economical, fast, and reliable impedance matching technique has been established which can provide broadband impedance matches.

Gordy, R. S.↗
NASA NTRS2009

Micro-Horn Arrays for Ultrasonic Impedance Matching

Thin-layered structures containing arrays of micromachined horns, denoted solid micro-horn arrays (SMIHAs), have been conceived as improved means of matching acoustic impedances between ultrasonic transducers and the media with which the transducers are required to exchange acoustic energy. Typically, ultrasonic transducers (e.g., those used in medical imaging) are piezoelectric or similar devices, which produce small displacements at large stresses. However, larger displacements at smaller stresses are required in the target media (e.g., human tissues) with which acoustic energy is to be exchanged. Heretofore, efficiencies in transmission of acoustic energy between ultrasonic transducers and target media have been severely limited because substantial mismatches of acoustic impedances have remained, even when coupling material layers have been interposed between the transducers and the target media. In contrast, SMIHAs can, in principle, be designed to effect more nearly complete acoustic impedance matching, leading to power transmission efficiencies of 90 percent or even greater. The SMIHA concept is based on extension, into the higher-frequency/ lower-wavelength ultrasonic range, of the use of horns to match acoustic impedances in the audible and lower-frequency ultrasonic ranges. In matching acoustic impedance in transmission from a higher-impedance acoustic source (e.g., a piezoelectric transducer) and a lowerimpedance target medium (e.g., air or human tissue), a horn acts as a mechanical amplifier. The shape and size of the horn can be optimized for matching acoustic impedance in a specified frequency range. A typical SMIHA would consist of a base plate, a face plate, and an array of horns that would constitute pillars that connect the two plates (see figure). In use, the base plate would be connected to an ultrasonic transducer and the face plate would be placed in contact with the target medium. As at lower frequencies, the sizes and shapes of the pillars could be tailored for impedance matching in a specified ultrasonic frequency range. In a design that would be simplest to implement by micromachining, the horns would have constant cross-sectional areas as shown in the upper part of the figure. In this case, the dimensions of the horns could be chosen on the basis of a Mason equivalent-circuit model (a simplified model, well-known in the piezoelectric-transducer art, in which the electrical and mechanical dynamics, including electromechanical couplings, are expressed as electrical circuit elements that can include inductors, capacitors, and lumped-parameter complex impedances.) In a more complex, more nearly optimum design, the cross-sectional area of each horn would be either stepped or made to vary as a continuous function of through-the thickness position, as shown in the lower part of the figure.

Rao, Shanti↗