Search NASA⌕ Search

SEARCH · Search NASA

Results for “matching”

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

A Computational Framework to design 3D stiffness gradient acoustic metamaterials for impedance matching

Acoustic waves play a crucial role in various applications, including medical imaging, non-destructive testing, and sonar systems. One of the significant challenges in these applications is impedance matching, which is essential for minimizing reflections and maximizing the transfer of acoustic energy between different media. Acoustic metamaterials offer a promising solution to this challenge. In addition to impedance control, gradient stiffness can enhance structural efficiency and enable spatial control of wave propagation, making it a valuable feature in acoustic metamaterial design. In this pa- per, we present our developed computational method to design 3D stiffness gradient acoustic metamaterials for impedance matching. The key steps in our approach include generating initial designs using a periodic covariance function to provide unit cells that are both periodic on the boundaries and randomly formed inside the unit cell. Furthermore, we integrated manufacturing constraints into the design process, ensuring that the structures are interconnected for fabrication. We propose two computational optimization algorithms: GenUnit, based on a non-dominated sorting genetic algorithm (NSGA-II), and MLMatch, which leverages differentiable machine learning. The two approaches are not separate contributions but complementary com- ponents of a unified framework. GenUnit requires no training data and directly interfaces with physics-based simulations, making it highly accurate but slower for large-scale exploration. In contrast, MLMatch is data-hungry during training but, once trained, enables near-instantaneous inference and broad design-space coverage. Together, they form a hybrid strategy: ML- Match rapidly explores the global design space, and GenUnit provides local refinement with high-fidelity accuracy. This balance between training cost, inference time, and precision is the motivation for including both methods in the same study. We applied this dual-algorithm framework to generate two metallic-based metamaterial designs that match the acoustic impedance of water while exhibiting a controlled gradient in stiffness (from stiff to soft). The stiffness gradient is particularly advantageous in applications where one side of the structure must interface with soft or sensitive surfaces, such as human tissue or delicate components. Here, this work paves the way for improved materials in various acoustic applications, particularly in ultrasound devices, by providing better impedance.

Metamaterial↗
DOE OSTI2025

Co-design of a wave energy converter through bi-conjugate impedance matching

As with other oscillatory power conversion systems, the design of wave energy converters can be understood as an impedance matching problem. By representing the wave energy converter as a multi-port network, two separate but related impedance matching conditions can be established. Satisfying these conditions maximizes power transfer to the load. In practice, these impedance matching conditions may be used to influence the design of the system (including the hull, power take-off, controller, mooring, etc.). To this end, this paper considers some example applications of wave energy converter design with the help of the impedance matching framework.

WEC↗
DOE OSTI2025

Automatic Image Point Matching

Sparse Image Point Matching (SIPM) is a foundational technology for photo triangulation, structure from motion (SfM), Simultaneous Location and Mapping (SLAM), and data fusion. The goal of the matching is to automatically generate sets of image coordinates that identify the same feature across images. Ideally, the process should be robust to lighting, scale, perspective, and modality changes. The scope of the image matching topic in the field of remote sensing (RS) is enormous because of the variety of collection platforms, modalities, sensor types, applications, and subjects. In this work, we report the history of and assess the state of the art of visible-spectrum (panchromatic and color) image matching of the Earth’s surface. Work specific to large-format images (LFI) (e.g., metric aerial cameras and Earth-observing satellites) will be highlighted. However, the state of the art in this century will mostly be traced through machine vision research and benchmarks because research specific to LFI is rare.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Enhancing predictive understanding and accuracy in geological carbon dioxide storage monitoring: Simulation and history matching of tracer transport dynamics

Co-injection of conservative tracers with carbon dioxide (CO 2 ) is a viable tool for monitoring subsurface processes during geological CO 2 storage (GCS). This research investigates the simulation and history-matching of a gas tracer (sulfur hexafluoride, SF 6 ) during CO 2 flooding, employing a core flooding result in Berea sandstone. Four extensively used saturation functions are assessed for their efficacy in history matching of CO 2 /SF 6 injection at the core scale. The history-matching process incorporates particle swarm optimization (PSO) to fine-tune constitutive relationships parameters. Next, employing transport models at the aquifer scale, we interrogate the impact on tracer transport and mixing of saturation function uncertainties, arising from the non-uniqueness of constitutive relationships parameters and saturation function types. To assess the effects of geological heterogeneity on behavior of tracer breakthrough curves (BTCs), we employ two normalized parameters assessing the degree of mixing and SF 6 breakthrough time. The aquifer-scale investigation encompasses both homogeneous and heterogeneous systems with and without capillary heterogeneity effects. Our findings underscore the critical importance of addressing saturation function uncertainties, emphasizing the significance of auxiliary experiments and innovative methodologies to enhance predictive accuracy. The findings highlight significant disparities in arrival times, BTC peaks, tails, and mixing levels, even under optimal conditions. Heterogeneity, with or without capillary heterogeneity, plays a crucial role in shaping BTC variations, resulting in accelerated SF 6 breakthrough times and reduced BTC peaks. Evaluation of monitoring points distant from the injector reveals a dampening effect on the SF6 BTC peak, particularly in heterogeneous systems with capillary heterogeneity, where the peak is halved. These insights underscore the challenges associated with tracer monitoring and the necessity for enhanced methodologies to improve predictive accuracy in subsurface processes during GCS.

58 GEOSCIENCES↗
DOE OSTI2025

GMFOLD: Subgraph matching for high-throughput DNA-aptamer secondary structure classification and machine learning interpretability

Aptamers are oligonucleotide receptors that bind to their targets with high affinity. Here, we consider aptamers comprised of single-stranded DNA that undergo target-binding-induced conformational changes, giving rise to unique secondary and tertiary structures. Given a specific aptamer primary sequence, there are well-established computational tools (notably mfold) to predict the secondary structure via free energy minimization algorithms. While mfold generates secondary structures for individual sequences, there is a need for a high-throughput process whereby thousands of DNA structures can be predicted in real-time for use in an interactive setting, when combined with aptamer selections that generate candidate pools that are too large to be experimentally interrogated. We developed a new Python code for high-throughput aptamer secondary structure determination (GMfold). GMfold uses subgraph matching methods to group aptamer candidates by secondary structure similarities. We also improve an open-source code, SeqFold, to incorporate subgraph matching concepts. We represent each secondary structure as a lowest-energy bipartite subgraph matching of the DNA graph to itself. These new tools enable thousands of DNA sequences to be compared based on their secondary structures, using machine-learning algorithms. This process is advantageous when analyzing sequences that arise from aptamer selections via systematic evolution of ligands by exponential enrichment (SELEX). This work is a building block for future machine-learning-informed DNA-aptamer selection processes to identify aptamers with improved target affinity and selectivity and advance aptamer biosensors and therapeutics.

Aptamer↗
DOE OSTI2026

An–imidophosphorane (An = U–Pu) bond covalency and proton-coupled electron transfer thermodynamics driven by orbital energy matching

A series of mid-actinide (An = U–Pu) tetrahomoleptic complexes supported by highly electron-donating imidophosphorane ligands, NPC ([NP t Bu(pyrr) 2 ] − , where t Bu = C(CH 3 ) 3 ; pyrr = pyrrolidinyl = N(C 4 H 8 )), are systematically investigated computationally and experimentally to elucidate the nature of actinide–ligand (An–L) covalency across the An 3+/4+/5+ oxidation states. Trends in An–L bonding and redox properties for these complexes, together with their protonated counterparts, are examined using orbital-, electron density-, and energy-decomposition-based methods. This integrated approach reveals progressively improved energy matching between α-spin An 5f and N im 2p orbitals with increasing atomic number and oxidation state, becoming particularly pronounced in the ligand-dominant π-bonding orbitals of An 4+ and An 5+ . In contrast to the An 3+ species, the enhanced An 5f π contributions in the higher-valent counterparts drive the increase in An–N im covalency for later An, thereby inverting the covalency trend to U < Np < Pu. Redistribution of electron density towards the An and N im atomic basins due to the growing energy-matching assisted covalency correlates with higher pKa values and increased N im –H bond dissociation free energies in protonated An 4+ complexes. Electron density at Nim in An 4+ shows a linear correlation with the p K a values calculated via the Bordwell equation. Calculations predict a cathodic shift of 0.84–1.00 V in the redox couples upon protonation, a trend validated when experimentally accessible. These findings demonstrate an increasing role of covalency driven by orbital energy matching from U to Pu in tuning the thermodynamic driving force for proton-coupled electron transfer in the An 5+ species.

38 RADIATION CHEMISTRY, RADIOCHEMISTRY, AND NUCLEA↗
DOE OSTI2025

Coupling Approaches with Non-matching Grids for Classical Linear Elasticity and Bond-based Peridynamic Models in 1D

Local-nonlocal coupling approaches provide a means to combine the computational efficiency of local models and the accuracy of nonlocal models. To facilitate the coupling of the two models, non-matching grids are often desirable as nonlocal grids usually require a finer resolution than local grids. In that case, it is often convenient to resort to interpolation operators so that models can exchange information in the overlap regions when nodes from the two grids do not coincide. This paper studies three existing coupling approaches, namely 1) a method that enforces matching displacements in an overlap region, 2) a variant that enforces a constraint on the stresses instead, and 3) a method that considers a variable horizon in the vicinity of the interfaces. Further, the effect of the interpolation order and of the grid ratio on the performance of the three coupling methods with non-matching grids is carefully studied on one-dimensional examples using polynomial manufactured solutions. The numerical results show that the degree of the interpolants should be chosen with care to avoid introducing additional modeling errors, or simply minimize these errors, in the coupling approach.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Atomic Orbital Energy Matching vs Overlap in Actinide-Ligand Dative Bonding

Prebonding conditions and dative bond formation in actinide(IV)hexachloride complexes with U, Np, and Pu are studied by density functional theory (DFT) calculations, focusing on the interplay of atomic orbital (AO) overlap and AO energy matching in the formation of molecular orbitals (MOs) and the subsequent identification of dative bonds. The extent of donation is tracked via population analysis, MO localization, and bond-order criteria. DFT Fock matrices are used to setup models in which varying numbers of valence AOs interact to form dative bonds. The results confirm, among other effects, a contribution to metal−ligand covalency from the actinide (An) 6p shell. Better matching of An(5f) and Cl(3p) energies occurs as the An(5f) level stabilizes with increasing An effective nuclear charge. A near-degeneracy occurs in the case of the α-spin orbitals of the Pu system, but it is inconsequential. Altogether, better AO energy matching for An(5f) and Cl(3p) along the series U, Np, Pu is counter-balanced by decreasing AO overlap and decreasing availability of 5f acceptor orbitals, leading to similar bond orders and extents of donation in the three systems.

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

Flow matching meets biology and life science: a survey

Over the past decade, advances in generative modeling, such as generative adversarial networks, masked autoencoders, and diffusion models, have significantly transformed biological research and discovery, enabling breakthroughs in molecule design, protein generation, catalysis discovery, drug discovery, and beyond. At the same time, biological applications have served as valuable testbeds for evaluating the capabilities of generative models. Recently, flow matching has emerged as a powerful and efficient alternative to diffusion-based generative modeling, with growing interest in its application to problems in biology and life sciences. This paper presents the first comprehensive survey of recent developments in flow matching and its applications in biological domains. We begin by systematically reviewing the foundations and variants of flow matching, and then categorize its applications into three major areas: biological sequence modeling, molecule generation and design, and peptide and protein generation. For each, we provide an in-depth review of recent progress. We also summarize commonly used datasets and software tools, and conclude with a discussion of potential future directions.

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2024

Emittance preservation for the electron arm in a single PWFA-LC stage using quasi-adiabatic plasma density ramp matching sections

Plasma-based acceleration (PBA) is being considered for a next generation linear collider (LC). In some PBA-LC designs for the electron arm, the extreme beam parameters are expected to trigger background ion motion within the witness beam, which can lead to longitudinally varying nonlinear focusing forces and result in an unacceptable emittance growth of the beam. To mitigate this, we propose to use quasi-adiabatic plasma density ramps as matching sections at the entrance and exit of each stage. We match the witness electron beam to the low density plasma entrance, where the beam initially has a large matched spot size so the ion motion effects are relatively small. As the beam propagates in the plasma density upramp, it is quasi-adiabatically focused, and its distribution maintains a non-Gaussian equilibrium distribution in each longitudinal slice throughout the process, even when severe ion collapse has occurred. This only causes small amounts of slice emittance growth. The phase mixing between slices with different betatron frequencies leads to additional projected emittance growth within the acceleration stage. A density downramp at the exit of an acceleration section can eliminate much of the slice and projected emittance growth as the beam and ion motion adiabatically defocuses and decreases, respectively. Simulation results from QuickPIC with Azimuthal Decomposition show that within a single acceleration stage with a 25 GeV energy gain, this concept can limit the projected emittance growth to only ∼2% for a 25 GeV, 100 nm emittance witness beam and ∼20% for a 100 GeV, 100 nm normalized emittance witness beam. The trade-off between the adiabaticity of the plasma density ramp and the initial ion motion at the entrance for a given length of the plasma density ramp is also discussed.

Physics↗
DOE OSTI2024

2D Polyhedral Template Matching for Atomic Resolution Microscopy

SAND2024-13879O The 2D Polyhedral Template Matching for Atomic Resolution Microscopy is a suite of functions for analyzing atomic resolution electron microscopy images using the 2D polyhedral template matching (2D-PTM) method. This software analyzes atomic resolution microscopy data from electron microscopic imaging or scanning probe microscopies. The primary application is for identifying different crystal phases, crystal orientations, and defect structures obtained in such atomic resolution images. Written in MATLAB and starting from an atomic resolution image, the code identifies the positions of atomic intensity peaks. It then matches predefined structural templates to the local atomic environments. Outputs include the local structural identification, the template scaling factor and rotation angle, root-mean-squared deviation (RMSD), and centrosymmetry parameter.

Medlin, Douglas↗
DOE OSTI2025

Differentially Private Map Matching (DPMM) v1.0

Human mobility trajectories provide valuable information for developing mobility applications, as they contain diverse and rich information about the users. User mobility data is valuable for various applications such as intelligent transportation systems (ITS), commercial business models, and disease-spread models. However, such spatio-temporal traces may pose a threat to user privacy. GPS trajectories in their raw form are not suitable for transportation studies, as they require matching locations with nearest road links — a process called map-matching. This software implements a differential privacy (DP)-based map-matching algorithm, called DPMM, that generates link-level location trajectories in a privacy-preserving manner to protect users' origin destinations (OD) and travel paths. OD privacy is achieved by injecting Planar Laplace noise to the user OD GPS points. Travel-path privacy is provided with randomized travel path construction using exponential DP mechanism. The injected noise level is selected adaptively, by considering the link density of the location and the functional category of the localized links. For path privacy, our mechanism samples waypoints and selects candidate paths between waypoints. DPMM provides privacy effectively with respect to link density instead of other trajectory samples in the database compared to other privacy mechanisms. Compared to the different baseline models our DP-based privacy model offers closer query responses to the raw data in terms of individual and aggregate trajectory-level statistics with an average at absolute deviation from the baseline for individual statistics on ϵ = 1.0. Beyond individual trajectory statistics, the DPMM outperforms the other benchmark DP-based mechanisms on different aggregate statistics with up to 8x improvement in utility.

Peisert, Sean [Lawrence Berkeley National Laborato↗
DOE OSTI2025

Improved high-resolution mapping of phase-matching conditions in second-order nonlinear crystals via imaging

Large-aperture nonlinear crystals for frequency conversion and parametric amplification exhibit spatial variations in phase-matching conditions, which affect the performance of high-power laser systems. We demonstrate significant improvements in speed and resolution to a technique that spatially maps these phase-matching conditions using imaging of the beam resulting from detuned second-harmonic generation. The phase-matching conditions at the pyramidal sector boundary of partially deuterated potassium dihydrogen phosphate (DKDP) are mapped with sub-0.1-mm resolution. We examine the effect of further increases in scan rate on the precision of the technique and demonstrate a scan rate of 0.8 cm 2 per minute at the aforementioned resolution.

Wampler, R. [Univ. of Rochester, NY (United States↗
DOE OSTI2025

Multivariate Analysis as a Tool for Validating Tester Matching

A method of applying Principal Component Analysis, Soft Independent Modeling of Class Analysis, and statistical analysis is described that can be applied to many types of testers to ascertain how well matched the performance of the testers in the analysis are to one another or how well matched a tester is to itself at a later time. This method is most useful for situations for which the same units have not been run across the testers being analyzed for matched performance.

Multari, Rosalie A [Sandia National Laboratories (↗