Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “vertex”

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 325 records · Page 18
All sourcesNASA NTRSDOE OSTI
DOE OSTI2024

Multiparticle Factorization and the Rigidity of String Theory

Is string theory uniquely determined by self-consistency? Causality and unitarity seemingly permit a multitude of putative deformations, at least at the level of two-to-two scattering. Motivated by this question, we initiate a systematic exploration of the constraints on scattering from higher-point factorization, which imposes extraordinarily restrictive sum rules on the residues and spectra defined by a given amplitude. These bounds handily exclude several proposed deformations of the string: the simplest “bespoke” amplitudes with tunable masses and a family of modified string integrands from “binary geometry.” While the string itself passes all tests, our formalism directly extracts the three-point amplitudes for the low-lying string modes without the aid of worldsheet vertex operators. Published by the American Physical Society 2024

Physics↗
DOE OSTI2024

Enhanced Pair-Density-Wave Vertices in a Bilayer Hubbard Model at Half Filling

Motivated by the pair-density-wave (PDW) state found in the one-dimensional Kondo-Heisenberg chain, we report on a determinant quantum Monte Carlo study of pair fields for a two-dimensional half-filled Hubbard layer coupled to an itinerant, noninteracting layer with one electron per site. In a specific range of interlayer hopping, the pairing vertex associated with PDW order becomes more attractive than that for uniform d-wave pairing, although both remain subdominant to the leading antiferromagnetic correlations at half filling. In conclusion, our result sheds light on where one potentially may find a PDW state in such a model.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
DOE OSTI2024

Low-depth Clifford circuits approximately solve MaxCut

We introduce a quantum-inspired approximation algorithm for MaxCut based on low-depth Clifford circuits. We start by showing that the solution unitaries found by the adaptive quantum approximation optimization algorithm (ADAPT-QAOA) for the MaxCut problem on weighted fully connected graphs are (almost) Clifford circuits. Motivated by this observation, we devise an approximation algorithm for MaxCut, ADAPT-Clifford, that searches through the Clifford manifold by combining a minimal set of generating elements of the Clifford group. Our algorithm finds an approximate solution of MaxCut on an N -vertex graph by building a depth O ( N ) Clifford circuit. The algorithm has runtime complexity O ( N 2 ) and O ( N 3 ) for sparse and dense graphs, respectively, and space complexity O ( N 2 ) , with improved solution quality achieved at the expense of more demanding runtimes. We implement ADAPT-Clifford and characterize its performance on graphs with positive and signed weights. The case of signed weights is illustrated with the paradigmatic Sherrington-Kirkpatrick model, for which our algorithm finds solutions with ground-state mean energy density corresponding to ∼ 94 % of the Parisi value in the thermodynamic limit. The case of positive weights is investigated by comparing the cut found by ADAPT-Clifford with the cut found with the Goemans-Williamson (GW) algorithm. For both sparse and dense instances we provide copious evidence that, up to hundreds of nodes, ADAPT-Clifford finds cuts of lower energy than GW. Published by the American Physical Society 2024

Muñoz-Arias, Manuel H. (ORCID:000000025711029X)↗
DOE OSTI2025

Search for displaced leptons in $\sqrt{𝑠}$ =13 TeV and 13.6 TeV 𝑝⁢𝑝 collisions with the ATLAS detector

A search for leptons displaced from the primary vertex is performed with the ATLAS detector at the Large Hadron Collider. The search includes the full proton-proton collision dataset collected during Run 2 at $\sqrt{𝑠}$ = 13 TeV and a partial dataset collected during Run 3 in 2022–2023 at $\sqrt{𝑠}$ = 13.6 TeV, corresponding to integrated luminosities of 140 fb −1 and 56.3 fb −1 , respectively. Final states with displaced electrons or muons are considered, and novel triggers introduced in Run 3 are employed that use large impact parameter tracking to reconstruct displaced tracks with low momentum. In addition, photon reconstruction and multivariate techniques are employed to broaden the sensitivity to channels with large background rates or highly displaced electrons, respectively. The results are consistent with the Standard Model background expectations and are used to set model-independent limits on the production of displaced electrons and muons. The analysis is also interpreted in the context of a gauge-mediated supersymmetry breaking model with pair-produced long-lived sleptons and a dark sector model with pair-produced chargino-like states. The results include 95% confidence level exclusions of selectrons with lifetimes from 4 ps to 60 ns and a mass of 150 GeV, and exclusions of selectrons, smuons, and staus with a lifetime of 0.3 ns for masses up to 740, 830, and 440 GeV, respectively. Dark charginos with masses up to 380 GeV are excluded for a mass difference with the neutral state of 40 GeV, and mass differences down to 17 GeV are excluded for dark charginos with a 100 GeV mass.

supersymmetric models↗
DOE OSTI2022

Derivation of closed-form ellipsoidal X-ray mirror shapes from Fermat's principle

Ellipsoidal and plane-elliptical surfaces are widely used as reflective, point-to-point focusing elements in many optical systems, including X-ray optics. Here the classical optical path function approach of Fermat is applied to derive a closed-form expression for these surfaces that are uniquely described by the object and image distances and the angle of incidence at a point on a mirror surface. A compact description facilitates design, modeling, fabrication, and testing to arbitrary accuracy. Congruent surfaces in two useful coordinate systems — a system centered on the ellipsoid's axes of symmetry and a mirror-centered or `vertex' system with the surface tangent to the xy plane at the mirror's center — are presented. Expressions for the local slope and radii of curvature are derived from the result, and the first several terms of the Maclauren series expansion are provided about the mirror center.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2024

X-ray crystal structure of a designed rigidified imaging scaffold in the ligand-free conformation

Imaging scaffolds composed of designed protein cages fused to designed ankyrin repeat proteins (DARPins) have enabled the structure determination of small proteins by cryogenic electron microscopy (cryo-EM). One particularly well characterized scaffold type is a symmetric tetrahedral assembly composed of 24 subunits, 12 A and 12 B, which has three cargo-binding DARPins positioned on each vertex. Here, the X-ray crystal structure of a representative tetrahedral scaffold in the apo state is reported at 3.8 Å resolution. The X-ray crystal structure complements recent cryo-EM findings on a closely related scaffold, while also suggesting potential utility for crystallographic investigations. As observed in this crystal structure, one of the three DARPins, which serve as modular adaptors for binding diverse `cargo' proteins, present on each of the vertices is oriented towards a large solvent channel. The crystal lattice is unusually porous, suggesting that it may be possible to soak crystals of the scaffold with small (≤30 kDa) protein cargo ligands and subsequently determine cage–cargo structures via X-ray crystallography. The results suggest the possibility that cryo-EM scaffolds may be repurposed for structure determination by X-ray crystallography, thus extending the utility of electron-microscopy scaffold designs for alternative structural biology applications.

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2024

Picasso: Memory-Efficient Graph Coloring Using Palettes With Applications in Quantum Computing

A coloring of a graph is an assignment of colors to vertices such that no two neighboring vertices have the same color. The need for memory-efficient coloring algorithms is motivated by their application in computing clique partitions of graphs arising in quantum computations where the objective is to map a large set of Pauli strings into a compact set of unitaries. We present Picasso, a randomized memory-efficient iterative parallel graph coloring algorithm with theoretical sublinear space guarantees under practical assumptions. The parameters of our algorithm provide a trade-off between coloring quality and resource consumption. To assist the user, we also propose a machine learning model to predict the coloring algorithm’s parameters considering these trade-offs. We provide a sequential and a parallel implementation of the proposed algorithm. We perform an experimental evaluation on a 64-core AMD CPU equipped with 512 GB of memory and an Nvidia A100 GPU with 40GB of memory. For a small dataset where existing coloring algorithms can be executed within the 512 GB memory budget, we show up to 68× memory savings. On massive datasets we demonstrate that GPU-accelerated Picasso can process inputs with 49.5× more Pauli strings (vertex set in our graph) and 2,478× more edges than state-of-the-art parallel approaches.

artificial intelligence, quantum computing↗
DOE OSTI2020

Towards Feature-Preserving 2D and 3D Vector Field Compression

The objective of this work is to develop error-bounded lossy compression methods to preserve topological features in 2D and 3D vector fields. Specifically, we explore the preservation of critical points in piecewise linear vector fields. We define the preservation of critical points as, without any false positive, false negative, or false type change in the decompressed data, (1) keeping each critical point in its original cell and (2) retaining the type of each critical point (e.g., saddle and attracting node). The key to our method is to adapt a vertex-wise error bound for each grid point and to compress input data together with the error bound field using a modified lossy compressor. Our compression algorithm can be also embarrassingly parallelized for large data handling and in situ processing. We benchmark our method by comparing it with existing lossy compressors in terms of false positive/negative/type rates, compression ratio, and various vector field visualizations with several scientific applications.

critical points↗
DOE OSTI2021

True Load Balancing for Matricized Tensor Times Khatri-Rao Product

MTTKRP is the bottleneck operation in algorithms used to compute the CP tensor decomposition. For sparse tensors, utilizing the compressed sparse fibers (CSF) storage format and the CSF-oriented MTTKRP algorithms is important for both memory and computational efficiency on distributed-memory architectures. Existing intelligent tensor partitioning models assume the computational cost of MTTKRP to be proportional to the total number of nonzeros in the tensor. However, this is not the case for the CSF-oriented MTTKRP on distributed-memory architectures. We outline two deficiencies of nonzero-based intelligent partitioning models when CSF-oriented MTTKRP operations are performed locally: failure to encode processors' computational loads and increase in total computation due to fiber fragmentation. We focus on existing fine-grain hypergraph model and propose a novel vertex weighting scheme that enables this model encode correct computational loads of processors. We also propose to augment the fine-grain model by fiber nets for reducing the increase in total computational load via minimizing fiber fragmentation. In this way, the proposed model encodes minimizing the load of the bottleneck processor. In conclusion, parallel experiments with real-world sparse tensors on up to 1024 processors prove the validity of the outlined deficiencies and demonstrate the merit of our proposed improvements in terms of parallel runtimes.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2026

Simplex‐based model for nanoparticle grain identification in four‐dimensional scanning transmission electron microscopy data

Grain identification in polycrystalline nanoparticles, for example, determining which crystal phases are present at each spatial location, is fundamental to materials characterisation. This is particularly challenging when grains overlap extensively, as commonly occurs in four-dimensional scanning transmission electron microscopy (4D-STEM) datasets. We propose a simplex-based model (SBM) in which each simplex vertex represents the diffraction pattern (DP) of a pure grain, and the simplex edges and interior represent overlapping grains. Our SBM grain identification algorithm operates on the Bragg disk (BD) data matrix distilled from the 4D-STEM data to identify the grain membership at each scan position, together with a BD feature matrix whose columns represent the DPs for each constituent grain, which is important for identifying the crystal structure of each grain. We solve the model using a two-stage algorithm. In Stage 1, we adapt a linear mixing algorithm to estimate an initial BD feature matrix whose columns represent DPs of potentially overlapping grains. Our Stage 2 algorithm incorporates sparsity considerations to transform the initial BD feature matrix so that its columns represent DPs of pure grains. Using simulated datasets with various grain configurations, we demonstrate that SBM recovers both the BD feature matrix and membership maps more accurately than existing methods, even when a grain lacks any pure region and completely overlaps with other grains.

4D-STEM segmentation↗
DOE OSTI2020

Experimental and Numerical Analysis of Additively Manufactured Inconel 718 Coupons With Lattice Structure

Abstract In the present paper, two lattice geometries suitable for near surface and double wall cooling were developed and tested. The first type of unit cell consisted of six ligaments of 0.5 mm diameter joined at a common vertex near the middle. The second type of unit cell was derived from the first type by adding four mutually perpendicular ligaments in the middle plane. Two lattice configurations, referred to as L1 and L2, respectively, were obtained by repeating the corresponding unit cell in streamwise and spanwise directions in an inline fashion. Test coupons consisting of these lattice geometries embedded inside rectangular cooling channel with dimensions of 2.54 mm height, 38.07 mm width, and 38.1 mm in length were fabricated using Inconel 718 powder and selective laser sintering (SLS) process. The heat transfer and pressure drop performance was then evaluated using steady-state tests with constant wall temperature boundary condition and for channel Reynolds number ranging from 2800 to 15,000. The lattices depicted a higher heat transfer compared with a smooth channel and both the heat transfer and pressure drop increased with a decrease in the porosity from L1 to L2. Steady-state conjugate numerical results revealed formation of prominent vortical structures in the inter-unit cell spaces, which diverted the flow toward the top end wall and created an asymmetric heat transfer between the two end walls. In conclusion, these lattice structures provided an augmented heat transfer while favorably redistributing the coolant within channel.

Engineering↗
DOE OSTI2021

Maximum Size Intersecting Families of Bounded Minimum Positive Co-degree

Let $\mathcal{H}$ be an $r$-uniform hypergraph. The minimum positive co-degree of $\mathcal{H}$, denoted by $\delta_{r-1}^+(\mathcal{H})$, is the minimum $k$ such that if $S$ is an $(r-1)$-set contained in a hyperedge of $\mathcal{H}$, then $S$ is contained in at least $k$ hyperedges of $\mathcal{H}$. For $r\geq k$ fixed and $n$ sufficiently large, we determine the maximum possible size of an intersecting $r$-uniform $n$-vertex hypergraph with minimum positive co-degree $\delta_{r-1}^+(\mathcal{H}) \geq k$ and characterize the unique hypergraph attaining this maximum. This generalizes the Erd\Hos--Ko--Rado theorem which corresponds to the case $k=1$. Furthermore, our proof is based on the delta-system method.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2026

Discovery of Probabilistic Dirichlet-to-Neumann Maps on Graphs

Dirichlet-to-Neumann maps enable the coupling of multiphysics simulations across computational subdomains by ensuring continuity of state variables and fluxes at artificial interfaces. We present a novel method for learning Dirichlet-to-Neumann maps on graphs using Gaussian processes, specifically for problems where the data obey a conservation law arising from an underlying partial differential equation. Our approach combines discrete exterior calculus and nonlinear optimal recovery to infer relationships between vertex and edge values. This framework yields data-driven predictions with uncertainty quantification across the entire graph, even when observations are limited to a subset of vertices and edges. By minimizing the reproducing kernel Hilbert space norm while penalizing kernel complexity through maximum likelihood estimation, our method ensures that the resulting surrogate strictly enforces conservation laws without overfitting. We demonstrate our method on two representative applications: subsurface flow in fracture networks and arterial blood flow. Finally, the results demonstrate that the method maintains high accuracy and well-calibrated uncertainty estimates even under severe data scarcity, highlighting its potential for scientific applications where limited data and reliable uncertainty quantification are critical.

Dirichlet-to-Neumann map↗
DOE OSTI2021

Muon reconstruction and identification efficiency in ATLAS using the full Run 2 $pp$ collision data set at $\sqrt{s}=13$ TeV

This article documents the muon reconstruction and identification efficiency obtained by the ATLAS experiment for 139 fb$^{-1}$ of $pp$ collision data at $\sqrt{s}=13$ TeV collected between 2015 and 2018 during Run 2 of the LHC. The increased instantaneous luminosity delivered by the LHC over this period required a reoptimisation of the criteria for the identification of prompt muons. Improved and newly developed algorithms were deployed to preserve high muon identification efficiency with a low misidentification rate and good momentum resolution. The availability of large samples of $Z\to\mu\mu$ and $J/\psi\to\mu\mu$ decays, and the minimisation of systematic uncertainties, allows the efficiencies of criteria for muon identification, primary vertex association, and isolation to be measured with an accuracy at the per-mille level in the bulk of the phase space, and up to the percent level in complex kinematic configurations. Excellent performance is achieved over a range of transverse momenta from 3 GeV to several hundred GeV, and across the full muon detector acceptance of $|\eta|<2.7$.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2021

Configuration and performance of the ATLAS b -jet triggers in Run 2

Several improvements to the ATLAS triggers used to identify jets containing b-hadrons (b-jets) were implemented for data-taking during Run 2 of the Large Hadron Collider from 2016 to 2018. These changes include reconfiguring the b-jet trigger software to improve primary-vertex finding and allow more stable running in conditions with high pile-up, and the implementation of the functionality needed to run sophisticated taggers used by the offline reconstruction in an online environment. These improvements yielded an order of magnitude better light-flavour jet rejection for the same b-jet identification efficiency compared to the performance in Run 1 (2011–2012). The efficiency to identify b-jets in the trigger, and the conditional efficiency for b-jets that satisfy offline b-tagging requirements to pass the trigger are also measured. Correction factors are derived to calibrate the b-tagging efficiency in simulation to match that observed in data. The associated systematic uncertainties are substantially smaller than in previous measurements. In addition, b-jet triggers were operated for the first time during heavy-ion data-taking, using dedicated triggers that were developed to identify semileptonic b-hadron decays by selecting events with geometrically overlapping muons and jets.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2022

Search for long-lived particles decaying to leptons with large impact parameter in proton–proton collisions at $\sqrt{s} = 13\,\text {Te}\text {V}$

A search for new long-lived particles decaying to leptons using proton–proton collision data produced by the CERN LHC at √s = 13TeV is presented. Events are selected with two leptons (an electron and a muon, two electrons, or two muons) that both have transverse impact parameter values between 0.01 and 10cm and are not required to form a common vertex. Data used for the analysis were collected with the CMS detector in 2016, 2017, and 2018, and correspond to an integrated luminosity of 118 (113)fb -1 in the ee channel (eμ and μμ channels). The search is designed to be sensitive to a wide range of models with displaced eμ, ee, and μμ final states. The results constrain several well-motivated models involving new long-lived particles that decay to displaced leptons. For some areas of the available phase space, these are the most stringent constraints to date.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2023

Calibration of the light-flavour jet mistagging efficiency of the b -tagging algorithms with Z+jets events using 139 $\textrm{fb}^{-1}$ of ATLAS proton–proton collision data at $\sqrt{s} = 13$ TeV

The identification of b -jets, referred to as b -tagging, is an important part of many physics analyses in the ATLAS experiment at the Large Hadron Collider and an accurate calibration of its performance is essential for high-quality physics results. This publication describes the calibration of the light-flavour jet mistagging efficiency in a data sample of proton–proton collision events at $\sqrt{s} = 13$ TeV corresponding to an integrated luminosity of 139 fb -1 . The calibration is performed in a sample of Z bosons produced in association with jets. Due to the low mistagging efficiency for light-flavour jets, a method which uses modified versions of the b-tagging algorithms referred to as flip taggers is used in this work. A fit to the jet-flavour-sensitive secondary-vertex mass is performed to extract a scale factor from data, to correct the light-flavour jet mistagging efficiency in Monte Carlo simulations, while simultaneously correcting the b -jet efficiency. With this procedure, uncertainties coming from the modeling of jets from heavy-flavour hadrons are considerably lower than in previous calibrations of the mistagging scale factors, where they were dominant. The scale factors obtained in this calibration are consistent with unity within uncertainties.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2024

Measurement of the production cross section for a W boson in association with a charm quark in proton–proton collisions at $\sqrt{s} = 13\,\hbox {TeV}$

The strange quark content of the proton is probed through the measurement of the production cross section for a W boson and a charm (c) quark in proton–proton collisions at a center-of-mass energy of 13$\,\text {Te}\hspace{-.08em}\text {V}$. The analysis uses a data sample corresponding to a total integrated luminosity of 138$\,\text {fb}^{-1}$ collected with the CMS detector at the LHC. The W bosons are identified through their leptonic decays to an electron or a muon, and a neutrino. Charm jets are tagged using the presence of a muon or a secondary vertex inside the jet. The $\hbox {W}+\hbox {c}$ production cross section and the cross section ratio $R_\textrm{c}^{\pm }= \sigma ({\hbox {W}}^{+}+\bar{\text {c}})/\sigma (\hbox {W}^{-}+{\textrm{c}})$ are measured inclusively and differentially as functions of the transverse momentum and the pseudorapidity of the lepton originating from the W boson decay. The precision of the measurements is improved with respect to previous studies, reaching 1% in $R_\textrm{c}^{\pm }= 0.950 \pm 0.005\,\text {(stat)} \pm 0.010 \,\text {(syst)} $. The measurements are compared with theoretical predictions up to next-to-next-to-leading order in perturbative quantum chromodynamics.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗