SEARCH · Engineering Papers

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.

SourceResearch connectionFrom yearThrough year

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 145 records · Page 8

All sources NASA NTRS DOE OSTI

NASA NTRS1992

Hierarchical model of matching

The issue of matching two fuzzy sets becomes an essential design aspect of many algorithms including fuzzy controllers, pattern classifiers, knowledge-based systems, etc. This paper introduces a new model of matching. Its principal features involve the following: (1) matching carried out with respect to the grades of membership of fuzzy sets as well as some functionals defined on them (like energy, entropy,transom); (2) concepts of hierarchies in the matching model leading to a straightforward distinction between 'local' and 'global' levels of matching; and (3) a distributed character of the model realized as a logic-based neural network.

Pedrycz, Witold↗

NASA NTRS1993

A robust line extraction and matching algorithm

This paper presents an algorithm for extracting straight lines from intensity mages and describes a line matching algorithm for solving the line correspondence problem. The line extraction process begins by detecting edges in the intensity image. Next, line support regions are formed where image points (pixels) have similar gradient orientation. A line fitting algorithm is then used to fit a line to the points in the line support region based on a least means square fitting algorithm. Finally, line segments are linked together to form the final lines by using an adaptive line linking method; this results in much stronger lines and a smaller set of lines to be considered. Once the lines are detected in a sequence of images, a line matching algorithm is used to match lines in one image to the lines in the other image. The images are either from a motion or stereo sequence. The matched lines may then be used with the sensor position and orientation data to estimate range to objects corresponding to the lines. We present results based on applying the line extraction and line matching algorithms to a synthetic image and an outdoor scene captured by a camera on a helicopter.

Hussien, B.↗

NASA NTRS1995

Stereo-Based Region-Growing using String Matching

We present a novel stereo algorithm based on a coarse texture segmentation preprocessing phase. Matching is performed using a string comparison. Matching sub-strings correspond to matching sequences of textures. Inter-scanline clustering of matching sub-strings yields regions of matching texture. The shape of these regions yield information concerning object's height, width and azimuthal position relative to the camera pair. Hence, rather than the standard dense depth map, the output of this algorithm is a segmentation of objects in the scene. Such a format is useful for the integration of stereo with other sensor modalities on a mobile robotic platform. It is also useful for localization; the height and width of a detected object may be used for landmark recognition, while depth and relative azimuthal location determine pose. The algorithm does not rely on the monotonicity of order of image primitives. Occlusions, exposures, and foreshortening effects are not problematic. The algorithm can deal with certain types of transparencies. It is computationally efficient, and very amenable to parallel implementation. Further, the epipolar constraints may be relaxed to some small but significant degree. A version of the algorithm has been implemented and tested on various types of images. It performs best on random dot stereograms, on images with easily filtered backgrounds (as in synthetic images), and on real scenes with uncontrived backgrounds.

Mandelbaum, Robert↗

NASA NTRS2004

Termination Proofs for String Rewriting Systems via Inverse Match-Bounds

Annotating a letter by a number, one can record information about its history during a reduction. A string rewriting system is called match-bounded if there is a global upper bound to these numbers. In earlier papers we established match-boundedness as a strong sufficient criterion for both termination and preservation of regular languages. We show now that the string rewriting system whose inverse (left and right hand sides exchanged) is match-bounded, also have exceptional properties, but slightly different ones. Inverse match-bounded systems effectively preserve context-free languages; their sets of normalized strings and their sets of immortal strings are effectively regular. These sets of strings can be used to decide the normalization, the termination and the uniform termination problems of inverse match-bounded systems. We also show that the termination problem is decidable in linear time, and that a certain strong reachability problem is deciable, thus solving two open problems of McNaughton's.

Butler, Ricky↗

DOE OSTI2015

Matching into the Helical Bunch Coalescing Channel for a High Luminosity Muon Collider

For high luminosity in a muon collider, muon bunches that have been cooled in the six-dimensional helical cooling channel (HCC) must be merged into a single bunch and further cooled in preparation for acceleration and transport to the collider ring. The helical bunch coalescing channel has been previously simulated and provides the most natural match from helical upstream and downstream subsystems. This work focuses on the matching from the exit of the multiple bunch HCC into the start of the helical bunch coalescing channel. The simulated helical matching section simultaneously matches the helical spatial period lambda in addition to providing the necessary acceleration for efficient bunch coalescing. Previous studies assumed that the acceleration of muon bunches from p=209.15 MeV/c to 286.816 MeV/c and matching of lambda from 0.5 m to 1.0 m could be accomplished with zero particle losses and zero emittance growth in the individual bunches. This study demonstrates nonzero values for both particle loss and emittance growth, and provides considerations for reducing these adverse effects to best preserve high luminosity.

43 PARTICLE ACCELERATORS↗

DOE OSTI2019

Multistage matching network and related techniques

Multistage matching networks and analytical frameworks for improving and/or optimizing the networks is provided. In one example, a framework relaxes the resistive constraint on the input and load impedances of the stages of a multistage matching network and allows them to be complex. Based on this framework, the design of multistage matching networks can be improved or optimized, such as using a method of Lagrange multipliers. A design optimization approach, for example, can be used to predict an optimum distribution of gains and impedance characteristics among the stages of a multistage matching network. The efficiency of matching networks designed using this example approach is compared with a conventional design approach, and it is shown that significant efficiency improvements are possible.

42 ENGINEERING↗

DOE OSTI2019

Comparison of Leakage Magnetic Field from Matched and Mismatched Double-D Coil based Wireless Charging System for Electric Vehicles

In this paper, a magnetic shield design is proposed for a matched and mismatched coil based high-power wireless charging system (WCS). The high-power WCS are highly prone to exceed the safety limits of both the electric and magnetic field leakage. The leakage magnetic field from the mismatched pads are higher than the matched pads. In a mismatched system, the receiver is usually made much smaller than the transmitter, which requires higher amp-turns in the coils to transfer the same amount of power. In addition, coupling factor is lower in mismatched systems. Therefore, the electromagnetic field (EMF) emission is higher for a mismatched system, compared to matched system where both the transmitter and receiver are similar and large. This phenomenon applies for both the nonpolarized-circular and DD pads. In this paper, the leakage magnetic field is compared for the matched-DD and mismatched-DD coil-based WCS. The leakage field is evaluated through finite element analysis (FEA) and verified experimentally through an 11 kW mismatched DD system. The results show that, the leakage magnetic field is much higher for a mismatched WCS, compared to a matched WCS.

Mostak, Mostak Mohammad↗

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 OSTI2014

On Parallel Push-Relabel based Algorithms for Bipartite Maximum Matching

We study multithreaded push-relabel based algorithms for computing maximum cardinality matching in bipartite graphs. Matching is a fundamental combinatorial (graph) problem with applications in a wide variety of problems in science and engineering. We are motivated by its use in the context of sparse linear solvers for computing maximum transversal of a matrix. We implement and test our algorithms on several multi-socket multicore systems and compare their performance to state-of-the-art augmenting path-based serial and parallel algorithms using a testset comprised of a wide range of real-world instances. Building on several heuristics for enhancing performance, we demonstrate good scaling for the parallel push-relabel algorithm. We show that it is comparable to the best augmenting path-based algorithms for bipartite matching. To the best of our knowledge, this is the first extensive study of multithreaded push-relabel based algorithms. In addition to a direct impact on the applications using matching, the proposed algorithmic techniques can be extended to preflow-push based algorithms for computing maximum flow in graphs.

Push-relabel, matching, bipartite↗

DOE OSTI2024

Maximum Entropy Theory of Multiscale Coarse-Graining via Matching Thermodynamic Forces: Application to a Molecular Crystal (TATB)

The MSCG/FM (multiscale coarse-graining via force-matching) approach is an efficient supervised machine learning method to develop microscopically informed coarse-grained (CG) models. Here we present a theory based on the principle of maximum entropy (PME) enveloping the existing MSCG/FM approaches. This theory views the MSCG/FM method as a special case of matching the thermodynamic forces from the extended ensemble described by the set of thermodynamic (relevant) system coordinates. This set may include CG coordinates, the stress tensor, applied external fields, and so forth, and may be characterized by nonequilibrium conditions. Following the presentation of the theory, we discuss the consistent matching of both bonded and nonbonded interactions. The proposed PME formulation is used as a starting point to extend the MSCG/FM method to the constant strain ensemble, which together with the explicit matching of the bonded forces is better suited for coarse-graining anisotropic media at a submolecular resolution. The theory is demonstrated by performing the fine coarse-graining of crystalline 1,3,5-triamino-2,4,6-trinitrobenzene (TATB), a well-known insensitive molecular energetic material, which exhibits highly anisotropic mechanical properties.

1,3,5-triamino-2,4,6-trinitrobenzene↗

DOE OSTI2015

Optimizing Approximate Weighted Matching on Nvidia Kepler K40

Matching is a fundamental graph problem with numerous applications in science and engineering. While algorithms for computing optimal matchings are difficult to parallelize, approximation algorithms on the other hand generally compute high quality solutions and are amenable to parallelization. In this paper, we present efficient implementations of the current best algorithm for half-approximate weighted matching, the Suitor algorithm, on Nvidia Kepler K-40 platform. We develop four variants of the algorithm that exploit hardware features to address key challenges for a GPU implementation. We also experiment with different combinations of work assigned to a warp. Using an exhaustive set of $269$ inputs, we demonstrate that the new implementation outperforms the previous best GPU algorithm by $10$ to $100\times$ for over $100$ instances, and from $100$ to $1000\times$ for $15$ instances. We also demonstrate up to $20\times$ speedup relative to $2$ threads, and up to $5\times$ relative to $16$ threads on Intel Xeon platform with $16$ cores for the same algorithm. The new algorithms and implementations provided in this paper will have a direct impact on several applications that repeatedly use matching as a key compute kernel. Further, algorithm designs and insights provided in this paper will benefit other researchers implementing graph algorithms on modern GPU architectures.

GPU↗

DOE OSTI2014

New Effective Multithreaded Matching Algorithms

Matching is an important combinatorial problem with a number of applications in areas such as community detection, sparse linear algebra, and network alignment. Since computing optimal matchings can be very time consuming, several fast approximation algorithms, both sequential and parallel, have been suggested. Common to the algorithms giving the best solutions is that they tend to be sequential by nature, while algorithms more suitable for parallel computation give solutions of less quality. We present a new simple 1 2 -approximation algorithm for the weighted matching problem. This algorithm is both faster than any other suggested sequential 1 2 -approximation algorithm on almost all inputs and also scales better than previous multithreaded algorithms. We further extend this to a general scalable multithreaded algorithm that computes matchings of weight comparable with the best sequential algorithms. The performance of the suggested algorithms is documented through extensive experiments on different multithreaded architectures.

matching, parallel algorithms↗

DOE OSTI2016

Computing Maximum Cardinality Matchings in Parallel on Bipartite Graphs via Tree-Grafting

It is difficult to obtain high performance when computing matchings on parallel processors because matching algorithms explicitly or implicitly search for paths in the graph, and when these paths become long, there is little concurrency. In spite of this limitation, we present a new algorithm and its shared-memory parallelization that achieves good performance and scalability in computing maximum cardinality matchings in bipartite graphs. This algorithm searches for augmenting paths via specialized breadth-first searches (BFS) from multiple source vertices, hence creating more parallelism than single source algorithms. Algorithms that employ multiple-source searches cannot discard a search tree once no augmenting path is discovered from the tree, unlike algorithms that rely on single-source searches. We describe a novel tree-grafting method that eliminates most of the redundant edge traversals resulting from this property of multiple-source searches. We also employ the recent direction-optimizing BFS algorithm as a subroutine to discover augmenting paths faster. Our algorithm compares favorably with the current best algorithms in terms of the number of edges traversed, the average augmenting path length, and the number of iterations. Here, we provide a proof of correctness for our algorithm. Our NUMA-aware implementation is scalable to 80 threads of an Intel multiprocessor and to 240 threads on an Intel Knights Corner coprocessor. On average, our parallel algorithm runs an order of magnitude faster than the fastest algorithms available. The performance improvement is more significant on graphs with small matching number.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2016

On Stable Marriages and Greedy Matchings

Research on stable marriage problems has a long and mathematically rigorous history, while that of exploiting greedy matchings in combinatorial scientific computing is a younger and less developed research field. In this paper we consider the relationships between these two areas. In particular we show that several problems related to computing greedy matchings can be formulated as stable marriage problems and as a consequence several recently proposed algorithms for computing greedy matchings are in fact special cases of well known algorithms for the stable marriage problem. However, in terms of implementations and practical scalable solutions on modern hardware, the greedy matching community has made considerable progress. We show that due to the strong relationship between these two fields many of these results are also applicable for solving stable marriage problems.

matching↗

DOE OSTI2023

Exploring Benchmarks for Self-Driving Labs using Color Matching

Self Driving Labs (SDLs) that combine automation of experimental procedures with autonomous decision making are gaining popularity as a means of increasing the throughput of scientific workflows. The task of identifying quantities of supplied colored pigments that match a target color, the color matching problem, provides a simple and flexible SDL test case, as it requires experiment proposal, sample creation, and sample analysis, three common components in autonomous discovery applications. We present a robotic solution to the color matching problem that allows for fully autonomous execution of a color matching protocol. Our solution leverages the WEI science factory platform to enable portability across different robotic hardware, the use of alternative optimization methods for continuous refinement, and automated publication of results for experiment tracking and post-hoc analysis.

Artificial intelligence↗

DOE OSTI2021

The Modeled Performance of the ORNL Matched Filter Detector for Seismic Signatures of Multi-Axle Tractor Trailers

The MINOS program seeks methods to passively monitor the transfer of special materials, which are reproducible and quantitatively defensible. To date, we have demonstrated that short-period seismometers deployed near vehicle tracks can detect and monitor signatures of multi-axle tractor trailers impacting small road obstacles as means to detect and identify some transfer activities. In this report, we model the seismic velocity signal output from a tractor-trailer impacting a small obstacle (a template waveform) to parameterize a matched filter that identifies signals with similar shapes buried in noise, and that indicate repeating events (target waveforms). We then use this model to perform thousands of synthetic experiments, in which we apply our detector to identify noisy waveforms output from a similarly modeled vehicle data set; we process all data in the same manner as we process real data collected from the Oak Ridge National Laboratory (ORNL) seismic network. Our experiments, while limited, reveal that the matched filter shows a high discrimination capability, and at very low SNR values (at visibility thresholds). This means that template waveforms can match target waveforms that are sourced by models that share the same vehicle speed (target vehicles), and have a low probability of mis-identification. In particular, a matched filter designed to detect a five-axle tractor-trailer will reliably identify that target vehicle down to an SNR of 11.25 dB, and within ±0.1 km/hr, while successfully screening target vehicles with three axles.

42 ENGINEERING↗

DOE OSTI2024

Void-Engineered Metamaterial Delay Line with Built-In Impedance Matching for Ultrasonic Applications

Metamaterials exhibit unique ultrasonic properties that are not always achievable with traditional materials. However, the structures and geometries needed to achieve such properties are often complex and difficult to obtain using common fabrication techniques. In the present research work, we report a novel metamaterial acoustic delay line with built-in impedance matching that is fabricated using a common 3D printer. Delay lines are commonly used in ultrasonic inspection when signals need to be separated in time for improved sensitivity. However, if the impedance of the delay line is not perfectly matched with those of both the sensor and the target medium, a strong standing wave develops in the delay line, leading to a lower energy transmission. The presented metamaterial delay line was designed to match the acoustic impedance at both the sensor and target medium interfaces. This was achieved by introducing graded engineered voids with different densities at both ends of the delay line. The measured impedances of the designed metamaterial samples show a good match with the theoretical predictions. The experimental test results with concrete samples show that the acoustic energy transmission is increased by 120% and the standing wave in the delay line is reduced by over a factor of 2 compared to a commercial delay line.

36 MATERIALS SCIENCE↗