Engineering Papers⌕ Search

SEARCH · Engineering Papers

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 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 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 OSTI2021

Scalable Pattern Matching in Metadata Graphs via Constraint Checking

Pattern matching is a fundamental tool for answering complex graph queries. Unfortunately, existing solutions have limited capabilities: They do not scale to process large graphs and/or support only a restricted set of search templates or usage scenarios. Moreover, the algorithms at the core of the existing techniques are not suitable for today’s graph processing infrastructures relying on horizontal scalability and shared-nothing clusters, as most of these algorithms are inherently sequential and difficult to parallelize. In this article we present an algorithmic pipeline that bases pattern matching on constraint checking. The key intuition is that each vertex and edge participating in a match has to meet a set of constraints implicitly specified by the search template. These constraints can be verified independently and typically are less expensive to compute than searching the full template. The pipeline we propose generates these constraints and iterates over them to eliminate all the vertices and edges that do not participate in any match, thus reducing the background graph to a subgraph that is the union of all template matches—the complete set of all vertices and edges that participate in at least one match. Additional analysis can be performed on this annotated, reduced graph, such as full match enumeration, match counting, or computing vertex/edge centrality. Furthermore, a vertex-centric formulation for constraint checking algorithms exists, and this makes it possible to harness existing high-performance, vertex-centric graph processing frameworks. This technique (i) enables highly scalable pattern matching in metadata (labeled) graphs; (ii) supports arbitrary patterns with 100% precision; (iii) enables tradeoffs between precision and time-to-solution, while always selects all vertices and edges that participate in matches, thus offering 100% recall; and (iv) supports a set of popular data analytics scenarios. We implement our approach on top of HavoqGT, an open-source asynchronous graph processing framework, and demonstrate its advantages through strong and weak scaling experiments on massive scale real-world (up to 257 billion edges) and synthetic (up to 4.4 trillion edges) labeled graphs, respectively, and at scales (1,024 nodes / 36,864 cores), orders of magnitude larger than used in the past for similar problems. This article serves two purposes: First, it synthesises the knowledge accumulated during a long-term project. Second, it presents new system features, usage scenarios, optimizations, and comparisons with related work that strengthen the confidence that pattern matching based on iterative pruning via constraint checking is an effective and scalable approach in practice. The new contributions include the following: (i) We demonstrate the ability of the constraint checking approach to efficiently support two additional search scenarios that often emerge in practice, interactive incremental search and exploratory search. (ii) We empirically compare our solution with two additional state-of-the-art systems, Arabsque and TriAD. (iii) We show the ability of our solution to accommodate a more diverse range of datasets with varying properties, e.g., scale, skewness, label distribution, and match frequency. (iv) We introduce or extend a number of system features (e.g., work aggregation, load balancing, and the ability to cap the generated traffic) and design optimizations and demonstrate their advantages with respect to improving performance and scalability. (v) We present bottleneck analysis and insights into artifacts that influence performance. (vi) We present a theoretical complexity argument that motivates the performance gains we observe.

97 MATHEMATICS AND COMPUTING↗
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↗
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↗
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 OSTI2020

Reinforcement learning based automated history matching for improved hydrocarbon production forecast

History matching aims to find a numerical reservoir model that can be used to predict the reservoir performance. An engineer and model calibration (data inversion) method are required to adjust various parameters/properties of the numerical model in order to match the reservoir production history. In this study, we develop deep neural networks within the reinforcement learning framework to achieve automated history matching that will reduce engineers’ efforts, human bias, automatically and intelligently explore the parameter space, and remove the need of large set of labeled training data. To that end, a fast-marching-based reservoir simulator is encapsulated as an environment for the proposed reinforcement learning. The deep neural-network-based learning agent interacts with the reservoir simulator within reinforcement learning framework to achieve the automated history matching. Reinforcement learning techniques, such as discrete Deep Q Network and continuous Deep Deterministic Policy Gradients, are used toth, used to train the learning agents. The continuous actions enable the Deep Deterministic Policy Gradients to explore more states at each iteration in a a learning episode; consequently, a better history matching is achieved using this algorithm as compared to Deep Q Network. For simplified dual-target composite reservoir models, the best history-matching performances of the discrete and continuous learning methods in terms of normalized root mean square errors are 0.0447 and 0.0038, respectively. Furthermore, our study shows that continuous action space achieved by the deep deterministic policy gradient drastically outperforms deep Q network.

42 ENGINEERING↗
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↗
DOE OSTI2023

Face‐on Orientation Matches Vertical Organic Electrochemical Transistors for High Transconductance and Superior Non‐Volatility

Abstract The recently developed vertical structure of organic electrochemical transistors (OECTs) can integrate volatile and non‐volatile functions into one reconfigurable device, making it highly promising. However, comparing with the conventional planar OECT (c‐OECT), the understanding of vertical OECT (v‐OECT) working principles and device engineering strategies is still lacking, impeding rational optimization. Since a major difference between c‐ and v‐OECTs is their charge transport directionality, which is highly influenced by crystallite orientations, the orientation–device structure match thus becomes an important yet outstanding topic for OECTs. Herein, using ann‐type small molecule IDIC‐MEG, investigate how much impact such match can have on OECT performance. The IDIC‐MEG c‐OECT fails to work due to the seriously hindered in‐plane electron transport by face‐on orientation. Surprisingly, simply changing the device structure from planar to vertical allows the resultant v‐OECT to exhibit the highest reported transconductance (46.3 mS) among all small‐molecule OECTs, thanks to the match between face‐on orientation and the vertical structure. Such match also leads to excellent non‐volatility, including highly predictable programmability and good operational stability. This work, for the first time, explicitly demonstrates the significance of orientation–device structure match for OECT optimization, establishing new guidelines for achieving high‐performance volatile and non‐volatile OECTs.

Chemistry↗
DOE OSTI2021

Six-dimensional matching of intense beam with linear accelerating structure

Beam matching is a common technique that is routinely employed in accelerator design with the aim of minimizing beam losses and preservation of beam brightness. Despite being widely used, a full theoretical understanding of beam matching in 6D remains elusive. In this work, we present an analytical treatment of 6D beam matching of a high-intensity beam onto an RF structure. We begin our analysis within the framework of a linear model, and apply the averaging method to a set of 3D beam envelope equations. Accordingly, we obtain a matched solution that is comprised of smoothed envelopes and periodic terms, describing envelope oscillations with the period of the focusing structure. We then consider the nonlinear regime, where the beam size is comparable with the separatrix size. Stating with a Hamiltonian analysis in 6D phase space, we attain a self-consistent beam profile and show that it is significantly different from the commonly used ellipsoidal shape. Subsequently, we analyze the special case of an equilibrium with equal space charge depression between all degrees of freedom. Comparison of beam dynamics for equipartitioned, equal space charge depression, and equal emittances beams is given. Finally, we present experimental results on beam matching in the LANSCE linac.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗
DOE OSTI2020

Modeling of resistive plasma response in toroidal geometry using an asymptotic matching approach

The method of solving the linear resistive plasma response, based on the asymptotic matching approach, is developed for full toroidal tokamaks by upgrading the resistive DCON code [A. H. Glasser, Z. R. Wang, and J.-K. Park, Phys. Plasmas 23, 112506 (2016)]. The derived matching matrix, asymptotically matching the outer and inner regions, indicates that the applied three dimension (3-D) magnetic perturbations contribute additional small solutions at each resonant surface due to the toroidal coupling of poloidal modes. In contrast, the resonant harmonic only affects the corresponding resonant surface in the cylindrical plasma. Additionally, the solution of the ideal outer region is critical to the asymptotic matching and is challenging in toroidal geometry due to the singular power series solution at the resonant surfaces. Thus, a systematic verification of the outer region Δ' matrix is made by reproducing the well-known analytical Δ' result in Furth et al. [Phys. Fluids 16, 1054–1063 (1073)] and by making a quantitative benchmark with the PEST3 code [A. Pletzer and R. L. Dewar, J. Plasma Phys. 45, 427–451 (1991)]. Finally, the reconstructed numerical solution of the resistive plasma response from the toroidal matching matrix is presented. Compared with the ideal plasma response, the global structure of the response can be affected by the small finite island at the resonant surfaces.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2024

Relevance of one-loop SMEFT matching in the 2HDM

The two-Higgs doublet model (2HDM) is a well understood alternative to the Standard Model of particle physics. If the new particles included in the 2HDM are at an energy scale much greater than the weak scale, the theory can be matched to the Standard Model effective field theory (SMEFT). We compute for the first time the complete one-loop matching at dimension-6. We compare its numerical impact with that of tree-level matching at dimension-8 by performing a global fit to single Higgs and precision electroweak measurements, and we emphasize the importance of comparing one-loop SMEFT results with corresponding one-loop results in the full 2HDM model. In the SMEFT, we consider the relative importance of both one-loop matching and the inclusion of renormalization group evolution. Our results demonstrate the necessity of studying the impact of various expansions to quantify the uncertainties of the SMEFT matching. Published by the American Physical Society 2024

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗