Search NASA⌕ Search

SEARCH · Search NASA

Results for “Optimal 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

Optimized matching conditions for self-guided laser wakefield accelerators

We revisit the matching conditions for self-guided laser pulse propagation in plasma and refine their formulation to maximize the energy of electrons produced via laser wakefield acceleration. Bayesian optimization, combined with particle-in-cell simulations carried out in a quasi-three-dimensional geometry and a Lorentz-boosted frame, is employed. The optimization identifies the maximum electron energy that a self-guided laser wakefield accelerator, driven by a laser of a given energy, can produce, together with the corresponding acceleration distance. Our results further demonstrate that electrons with energies close to the maximum value can be obtained across a relatively wide range of input parameters and without the need for their precise tuning. This provides substantial flexibility for experimental implementation and significantly relaxes the operational constraints associated with self-guided laser wakefield accelerators.

43 PARTICLE ACCELERATORS↗

Blood flow imaging by optimal matching of computational fluid dynamics to 4D-flow data

Three-dimensional, time-resolved blood flow measurement (4D-flow) is a powerful research and clinical tool, but improved resolution and scan times are needed. Therefore, this study aims to (1) present a postprocessing framework for optimization-driven simulation-based flow imaging, called 4D-flow High-resolution Imaging with a priori Knowledge Incorporating the Navier-Stokes equations and the discontinuous Galerkin method (4D-flow HIKING), (2) investigate the framework in synthetic tests, (3) perform phantom validation using laser particle imaging velocimetry, and (4) demonstrate the use of the framework in vivo. An optimizing computational fluid dynamics solver including adjoint-based optimization was developed to fit computational fluid dynamics solutions to 4D-flow data. Synthetic tests were performed in 2D, and phantom validation was performed with pulsatile flow. Reference velocity data were acquired using particle imaging velocimetry, and 4D-flow data were acquired at 1.5 T. In vivo testing was performed on intracranial arteries in a healthy volunteer at 7 T, with 2D flow as the reference. Results Synthetic tests showed low error (0.4%-0.7%). Phantom validation showed improved agreement with laser particle imaging velocimetry compared with input 4D-flow in the horizontal (mean -0.05 vs -1.11 cm/s, P < .001; SD 1.86 vs 4.26 cm/s, P < .001) and vertical directions (mean 0.05 vs -0.04 cm/s, P = .29; SD 1.36 vs 3.95 cm/s, P < .001). In vivo data show a reduction in flow rate error from 14% to 3.5%. Phantom and in vivo results from 4D-flow HIKING show promise for future applications with higher resolution, shorter scan times, and accurate quantification of physiological parameters.

4D-flow MRI↗

MONACO: accurate biological network alignment through optimal neighborhood matching between focal nodes

Motivation: Alignment of protein–protein interaction networks can be used for the unsupervised prediction of functional modules, such as protein complexes and signaling pathways, that are conserved across different species. To date, various algorithms have been proposed for biological network alignment, many of which attempt to incorporate topological similarity between the networks into the alignment process with the goal of constructing accurate and biologically meaningful alignments. Especially, random walk models have been shown to be effective for quantifying the global topological relatedness between nodes that belong to different networks by diffusing node-level similarity along the interaction edges. However, these schemes are not ideal for capturing the local topological similarity between nodes. Results: Here, we propose MONACO, a novel and versatile network alignment algorithm that finds highly accurate pairwise and multiple network alignments through the iterative optimal matching of ‘local’ neighborhoods around focal nodes. Extensive performance assessment based on real networks as well as synthetic networks, for which the ground truth is known, demonstrates that MONACO clearly and consistently outperforms all other state-of-the-art network alignment algorithms that we have tested, in terms of accuracy, coherence and topological quality of the aligned network regions. Furthermore, despite the sharply enhanced alignment accuracy, MONACO remains computationally efficient and it scales well with increasing size and number of networks.

97 MATHEMATICS AND COMPUTING↗

Tough Errors Are no Match (TEAM): Optimizing the Quantum Compiler for Noise Resilience

This report summarizes research performed under the Tough Errors Are no Match (TEAM) project. The primary focus of TEAM has been to research and develop a compilation toolbox leveraging techniques from quantum characterization and control, probabilistic programming, and approximate computing. Our goal was to develop robust protocols that can be integrated into quantum compilers to optimize and enhance the robustness of noisy computation. Here, we provide a summary of TEAM work focused on characterization and control of quantum systems.

97 MATHEMATICS AND COMPUTING↗

Tough Errors are no Match (TEAM): Optimizing the Quantum Compiler for Noise Resilience

This report summarizes our contributions to the Department of Energy’s Tough Errors are no Match (TEAM) project (DE-SC0020377) under Thrust 2: Quantum Programming and Compilation. The central outcomes of this work included a novel efficient quantum compiling algorithm which works without requiring the quantum computer to exactly invert its operations, answering a longstanding open problem in quantum compiling. Additional results include the implementation of zero-noise extrapolation error mitigation in collaboration with the Unitary Fund, as well as novel quantum algorithms for entanglement detection and pseudorandomness.

Bouland, Adam [Stanford Univ., CA (United States)]↗

Genetic Algorithm-Based Optimization to Match Asteroid Energy Deposition Curves

An asteroid entering Earth's atmosphere deposits energy along its path due to thermal ablation and dissipative forces that can be measured by ground-based and spaceborne instruments. Inference of pre-entry asteroid properties and characterization of the atmospheric breakup is facilitated by using an analytic fragment-cloud model (FCM) in conjunction with a Genetic Algorithm (GA). This optimization technique is used to inversely solve for the asteroid's entry properties, such as diameter, density, strength, velocity, entry angle, and strength scaling, from simulations using FCM. The previous parameters' fitness evaluation involves minimizing error to ascertain the best match between the physics-based calculated energy deposition and the observed meteors. This steady-state GA provided sets of solutions agreeing with literature, such as the meteor from Chelyabinsk, Russia in 2013 and Tagish Lake, Canada in 2000, which were used as case studies in order to validate the optimization routine. The assisted exploration and exploitation of this multi-dimensional search space enables inference and uncertainty analysis that can inform studies of near-Earth asteroids and consequently improve risk assessment.

Depositio↗

Near Optimality of Matched Filter Detection for Cyclic Prefix Direct Sequence Spread Spectrum

Abstract—Cyclic Prefix Direct Sequence Spread Spectrum -DSSS) has been presented as a potential solution for ultrareliable low latency communications (URLLC) and massive machine type communication (mMTC), where the CP-DSSS waveform would operate as a secondary network at the same frequencies as the primary network but at much lower SNR. In this paper, we show that when operating in the low SNR regime, CP-DSSS achieves near optimum performance when using a matched filter (MF) detector at the receiver. Time reversal (TR) precoding at the transmitter is also analyzed. These results also carry forward into multi-antenna scenarios where array gain is preserved. With nearly optimal performance of MF detection, CP-DSSS can be implemented with simple device transceiver structures, reducing per-unit cost for massively deployed networks.

5G and Beyond Communications↗

Tough Errors Are no Match (TEAM): Optimizing the quantum compiler for noise resilience

This report summarizes Unitary Fund’s contributions to the Department of Energy’s TEAM project (DE-SC0020266) under Thrust 2: Quantum Programming and Compilation. The central outcomes of this work have been the development of Mitiq, an open-source Python toolkit for applying quantum error mitigation (QEM) techniques to noisy quantum programs, and the invention, benchmarking and theoretical investigation of novel QEM techniques. Additional outcomes include the development of other open source software packages for the usage, simulation and control of quantum computers.

97 MATHEMATICS AND COMPUTING↗

Tough Errors are no Match (TEAM): Optimizing the Quantum Compiler for Noise Resilience

This project builds toward a comprehensive error-mitigating toolkit that makes quantum programming more robust and adaptive to the noisy, resource-limited nature of today’s quantum hardware. To that end, it integrates established error-mitigation methods — such as zero-noise extrapolation and dynamical decoupling — directly into compiler infrastructures. These techniques will be packaged as modules that can automatically adjust and combine based on performance analysis, enabling compilers to explore large design spaces and produce optimized, low-noise quantum programs with minimal manual intervention. In parallel, this project also explores new approaches to analog quantum programming or quantum simulation, and has developed the programming language SimuQ which treats quantum Hamiltonian evolution as the central object.

97 MATHEMATICS AND COMPUTING↗

Matching Crystal Structures Atom-to-Atom

Finding an optimal match between two different crystal structures underpins many important materials science problems, including describing solid-solid phase transitions and developing models for interface and grain boundary structures. Here, we formulate the matching of crystals as an optimization problem where the goal is to find the alignment and the atom-to-atom map that minimize a given cost function such as the Euclidean distance between the atoms. We construct an algorithm that directly solves this problem for large finite portions of the crystals and retrieves the periodicity of the match subsequently. We demonstrate its capacity to describe transformation pathways between known polymorphs and to reproduce experimentally realized structures of semi-coherent interfaces. Additionally, from our findings, we define a rigorous metric for measuring distances between crystal structures that can be used to properly quantify their geometric (Euclidean) closeness.

36 MATERIALS SCIENCE↗

Maximized gust loads for a nonlinear airplane using matched filter theory and constrained optimization

Two matched filter theory based schemes are described and illustrated for obtaining maximized and time correlated gust loads for a nonlinear aircraft. The first scheme is computationally fast because it uses a simple 1-D search procedure to obtain its answers. The second scheme is computationally slow because it uses a more complex multi-dimensional search procedure to obtain its answers, but it consistently provides slightly higher maximum loads than the first scheme. Both schemes are illustrated with numerical examples involving a nonlinear control system.

Scott, Robert C.↗

Machine-learning-assisted insight into spin ice Dy 2 Ti 2 O 7

Complex behavior poses challenges in extracting models from experiment. An example is spin liquid formation in frustrated magnets like Dy 2 Ti 2 O 7 . Understanding has been hindered by issues including disorder, glass formation, and interpretation of scattering data. Here, we use an automated capability to extract model Hamiltonians from data, and to identify different magnetic regimes. This involves training an autoencoder to learn a compressed representation of three-dimensional diffuse scattering, over a wide range of spin Hamiltonians. The autoencoder finds optimal matches according to scattering and heat capacity data and provides confidence intervals. Validation tests indicate that our optimal Hamiltonian accurately predicts temperature and field dependence of both magnetic structure and magnetization, as well as glass formation and irreversibility in Dy 2 Ti 2 O 7 . The autoencoder can also categorize different magnetic behaviors and eliminate background noise and artifacts in raw data. Our methodology is readily applicable to other materials and types of scattering problems.

36 MATERIALS SCIENCE↗

Absorption of charged particles in perfectly matched layers by optimal damping of the deposited current

Perfectly matched layers (PMLs) are widely used in particle-in-cell simulations, in order to absorb electromagnetic waves that propagate out of the simulation domain. However, when charged particles cross the interface between the simulation domain and the PMLs, a number of numerical artifacts can arise. Here, in order to mitigate these artifacts, we introduce a PML algorithm whereby the current deposited by the macroparticles in the PML is damped by an analytically derived optimal coefficient. The benefits of this algorithm are illustrated in practical simulations. In particular, it is shown that this algorithm is well suited for particles exiting the box in near-normal incidence, in the sense that the fields behave as if the exiting particle is propagating in an infinite vacuum.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

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.↗

Optimized thermodynamic properties of REE aqueous species (REE 3+ and REEOH 2+ ) and experimental database for modeling the solubility of REE phosphate minerals (monazite, xenotime, and rhabdophane) from 25 to 300 °C

Rare earth elements (REE) are critical elements found in monazite, xenotime, and hydrated REE phosphates which typically form in hydrothermal mineral deposits. Accurate predictions of the solubility of these REE phosphates and the speciation of REE in aqueous fluids are both key to understanding the controls on the transport, fractionation, and deposition of REE in natural systems. Previous monazite and xenotime solubility experiments indicate the presence of large discrepancies between experimentally derived solubility constants versus calculated solubilities by combining different data sources for the thermodynamic properties of minerals and aqueous species at hydrothermal conditions. In this study, these discrepancies were resolved by using the program GEMSFITS to optimize the standard partial molal Gibbs energy of formation (Δ f G° 298 ) of REE aqueous species (REE 3+ and REE hydroxyl complexes) at 298.15 K and 1 bar while keeping the thermodynamic properties fixed for the REE phosphates. A comprehensive experimental database was compiled using solubility data available between 25 and 300 °C. The latter permits conducting thermodynamic parameter optimization of Δ f G° 298 for REE aqueous species. Optimal matching of the rhabdophane solubility data between 25 and 100 °C requires modifying the Δ f G° 298 values of REE 3+ by 1–6 kJ/mol, whereas matching of the monazite solubility data between 100 and 300 °C requires modifying the Δ f G° 298 values of both REE 3+ and REEOH 2+ by ~15–31 kJ/mol and ~2–10 kJ/mol, respectively. For xenotime, adjustments of Δ f G° 298 values by 1–26 kJ/mol are only necessary for the REE 3+ species. The optimizations indicate that the solubility of monazite in acidic solutions is controlled by the light (L)REE 3+ species at <150 °C and the LREEOH 2+ species at >150 °C, whereas the solubility of xenotime is controlled by the heavy (H)REE 3+ species between 25 and 300 °C. Based on the optimization results, we conclude that the revised Helgeson-Kirkham-Flowers equation of state does not reliably predict the thermodynamic properties of REE 3+ , REEOH 2+ , and likely other REE hydroxyl species at hydrothermal conditions. We therefore provide an experimental database (ThermoExp_REE) as a basic framework for future updates, extensions with other ligands, and optimizations as new experimental REE data become available. As a result, the optimized thermodynamic properties of aqueous species and minerals are available open access to accurately predict the solubility of REE phosphates in fluid-rock systems.

58 GEOSCIENCES↗

The gravitational lensing imprints of DES Y3 superstructures on the CMB: a matched filtering approach

Low-density cosmic voids gravitationally lens the cosmic microwave background (CMB), leaving a negative imprint on the CMB convergence |$\kappa$|⁠. This effect provides insight into the distribution of matter within voids, and can also be used to study the growth of structure. We measure this lensing imprint by cross-correlating the Planck CMB lensing convergence map with voids identified in the Dark Energy Survey Year 3 (DES Y3) data set, covering approximately 4200 deg|$^2$| of the sky. We use two distinct void-finding algorithms: a 2D void-finder that operates on the projected galaxy density field in thin redshift shells, and a new code, Voxel, which operates on the full 3D map of galaxy positions. We employ an optimal matched filtering method for cross-correlation, using the Marenostrum Institut de Ciències de l’Espai N-body simulation both to establish the template for the matched filter and to calibrate detection significances. Using the DES Y3 photometric luminous red galaxy sample, we measure |$A_\kappa$|⁠, the amplitude of the observed lensing signal relative to the simulation template, obtaining |$A_\kappa = 1.03 \pm 0.22$| (⁠|$4.6\sigma$| significance) for Voxel and |$A_\kappa = 1.02 \pm 0.17$| (⁠|$5.9\sigma$| significance) for 2D voids, both consistent with Lambda cold dark matter expectations. We additionally invert the 2D void-finding process to identify superclusters in the projected density field, for which we measure |$A_\kappa = 0.87 \pm 0.15$| (⁠|$5.9\sigma$| significance). The leading source of noise in our measurements is Planck noise, implying that data from the Atacama Cosmology Telescope, South Pole Telescope and CMB-S4 will increase sensitivity and allow for more precise measurements.

79 ASTRONOMY AND ASTROPHYSICS↗

Understanding coarsening of a post-corrosion microstructure in a molten salt by combining phase-field modeling and in situ tomography

Alloys corroding in molten salt have been observed to form bicontinuous, nanoporous microstructures via dealloying, which subsequently undergo coarsening due to facile transport in high-temperature conditions. In this work, we describe a methodology to elucidate the underlying transport mechanisms during coarsening of a bicontinuous microstructure via quantitative comparisons between phase-field simulations and four-dimensional in situ experiments, in this case X-ray nanotomography of the coarsening of a dealloyed 80 wt% Ni-20 wt% Cr microwire in molten KCl-MgCl 2 at 800°C. We conduct phase-field simulations initialized from experimental data to model coarsening via three different transport mechanisms: surface diffusion, solid bulk diffusion, and liquid bulk diffusion. These simulations reproduce key features of the experiment, such as the densification of the outer layer of the dealloyed wire and the reduction in radius over time. We quantitatively compare different microstructural characteristics between the simulations and experiment and extract temporal scaling factors that optimally match the time scales of the simulations to that of the experiment. This allows us to evaluate morphological similarity between the simulations and experiment and relate the experimental coarsening kinetics to fundamental material properties. We find that surface diffusion is most likely to be the dominant coarsening mechanism, and its kinetics imply a surface diffusivity of D S = 8.9 x 10 -20 m 3 /s, which is within the range of reported values for Ni-vacuum interfaces at 800°C. However, the difference between the experiment and the surface diffusion simulation increases substantially at late times, suggesting that other mechanisms, such as the dissolution of residual Cr, may be at play.

36 MATERIALS SCIENCE↗