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 217 records · Page 12
All sourcesNASA NTRSDOE OSTI
DOE OSTI2023

Solvent Acts as the Referee in a Match‐Up Between Charged and Preorganized Receptors

The prevalence of anion-cation contacts in biomolecular recognition under aqueous conditions suggests that ionic interactions should dominate the binding of anions in solvents across both high and low polarities. Investigations of this idea using titrations in low polarity solvents are impaired by interferences from ion pairing that prevent a clear picture of binding. To address this limitation and test the impact of ion-ion interactions across multiple solvents, we quantified chloride binding to a cationic receptor after accounting for ion pairing. In these studies, we created a chelate receptor using aryl-triazole CH donors and a quinolinium unit that directs its cationic methyl inside the binding pocket. In low-polarity dichloromethane, the 1 : 1 complex (log K 1 : 1 ~ 7.3) is more stable than neutral chelates, but fortuitously comparable to a preorganized macrocycle (log K 1 : 1 ~ 6.9). Polar acetonitrile and DMSO diminish stabilities of the charged receptor (log K 1 : 1 ~ 3.7 and 1.9) but surprisingly 100-fold more than the macrocycle. While both receptors lose stability by dielectric screening of electrostatic stability, the cationic receptor also pays additional costs of organization. Thus even though the charged receptor has stronger binding in apolar solvents, the uncharged receptor has more anion affinity in polar solvents.

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

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

The Zintl Concept Applied to Intergrowth Structures: Electron‐Hole Matching, Stacking Preferences, and Chemical Pressures in Pd 5 InAs

Abstract Enumerating the potential stacking sequences of layers is a fundamental way to account for the structure diversity of solid state compounds. In many cases, these stacking variations represent polymorphs with only small energetic differences. Here, we examine a compound for which the preferred stacking pattern instead reveals key aspects about its chemical bonding: Pd 5 InAs. Its structure is based on the intergrowth of slabs of the AuCu 3 and PtHg 2 (or alternatively, fluorite) structure types. Two basic stacking arrangements are available to this compound, represented by the Pd 5 TlAs and HoCoGa 5 structure types. DFT total energy calculations reveal that the former outcompetes the latter by a staggering 0.65 eV/formula unit. Through a combination of DFT‐reversed approximation Molecular Orbital (DFT‐raMO) and DFT‐Chemical Pressure (DFT‐CP) analysis we trace this preference to two factors. First, with DFT‐raMO analysis, we derive a Zintl‐like bonding scheme of Pd 5 InAs. This scheme, along with the inspection of selected crystal orbitals, is then connected to preferred stacking through the coordination environments of the Pd atoms at the interface between the Pd−In and Pd−As layers. In the hypothetical HoCoGa 5 ‐type and observed Pd 5 InAs‐type structures, different Pd coordination environments arise at the interfaces. The hypothetical structure features square planar PdIn 2 As 2 units, in each of which the same 4d‐orbital serves in the Pd sublattice's role as both Lewis acid (for interactions with the As) and Lewis base (for interactions with the In). In the observed structure, tetrahedral PdIn 2 As 2 units occur instead, so that these contradictory roles are distributed to separate 4d‐orbitals, leading to more effective bonding. DFT‐CP analysis illustrates that this driving force for the Pd 5 TlAs‐type arrangement is supplemented by a favorable alignment of the packing tensions in the parent structures. Altogether, the resulting picture demonstrates how the reaction of simple intermetallic structures to form intergrowths can be guided by recognizable chemical interactions.

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

Renormalization and matching for the Collins-Soper kernel from lattice QCD

The Collins-Soper kernel, which governs the energy evolution of transverse- momentum dependent parton distribution functions (TMDPDFs), is required to accurately predict Drell-Yan like processes at small transverse momentum, and is a key ingredient for extracting TMDPDFs from experiment. Earlier we proposed a method to calculate this kernel from ratios of the so-called quasi-TMDPDFs determined with lattice QCD, which are defined as hadronic matrix elements of staple-shaped Euclidean Wilson line operators. Here we provide the one-loop renormalization of these operators in a regularization-independent momentum subtraction (RI'/MOM) scheme, as well as the conversion factor from the RI'/MOM-renormalized quasi-TMDPDF to the \( \overline{\mathrm{MS}} \) scheme. We also propose a procedure for calculating the Collins-Soper kernel directly from position space correlators, which simplifies the lattice determination.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2021

Generic one-loop matching conditions for rare meson decays

Leptonic and semileptonic meson decays that proceed via flavour-changing neutral currents provide excellent probes of physics of the standard model and beyond. We present explicit results for the Wilson coefficients of the weak effective Lagrangian for these decays in any perturbative model in which these processes proceed via one-loop contributions. We explicitly show that our results are finite and gauge independent, and provide Mathematica code that implements our results in an easily usable form.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2022

Delaunay walk for fast nearest neighbor: accelerating correspondence matching for ICP

Point set registration algorithms such as Iterative Closest Point (ICP) are commonly utilized in time-constrained environments like robotics. Finding the nearest neighbor of a point in a reference 3D point set is a common operation in ICP and frequently consumes at least 90% of the computation time. We introduce a novel approach to performing the distance-based nearest neighbor step based on Delaunay triangulation. This greedy algorithm finds the nearest neighbor of a query point by traversing the edges of the Delaunay triangulation created from a reference 3D point set. Our work integrates the Delaunay traversal into the correspondences search of ICP and exploits the iterative aspect of ICP by caching previous correspondences to expedite each iteration. An algorithmic analysis and comparison is conducted showing an order of magnitude speedup for both serial and vector processor implementation.

3d point cloud processing↗
DOE OSTI2020

A novel matching formulation for startup costs in unit commitment

Here we present a novel formulation for startup cost computation in the unit commitment problem (UC). Both our proposed formulation and existing formulations in the literature are placed in a formal, theoretical dominance hierarchy based on their respective linear programming relaxations. Our proposed formulation is tested empirically against existing formulations on large-scale UC instances drawn from real-world data. While requiring more variables than the current state-of-the-art formulation, our proposed formulation requires fewer constraints, and is empirically demonstrated to be as tight as a perfect formulation for startup costs. This tightening can reduce the computational burden in comparison to existing formulations, especially for UC instances with large reserve margins and high penetration levels of renewables.

97 MATHEMATICS AND COMPUTING↗