Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Graphs”

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 1,243 records · Page 69
All sourcesNASA NTRSDOE OSTI
DOE OSTI2026

Search for the pair production of long-lived supersymmetric partners of the tau lepton in proton-proton collisions at $\sqrt{s}=13$ TeV

Gauge-mediated supersymmetry-breaking models provide a strong motivation to search for a supersymmetric partner of the tau lepton (stau) with a macroscopic lifetime. Long-lived stau decays produce tau leptons that are displaced from the primary proton-proton interaction vertex, leading to an unconventional signature. This paper presents a search for the direct production of long-lived staus decaying within the CMS tracker volume in proton-proton collisions at $\sqrt{s}=13$ TeV, performed for the first time with an identification algorithm based on a graph neural network dedicated to displaced tau leptons. The data sample, corresponding to an integrated luminosity of 138 fb −1 , was recorded with the CMS experiment at the CERN LHC between 2016 and 2018. This search excludes, at 95% confidence level, stau masses, m~ τ , in the 126–260 (90–425) GeV range for a proper decay length of 50 mm in the maximally mixed (mass-degenerate) scenario, while for m~ τ = 200 GeV, stau proper decay lengths are excluded in the range 21–94 (6–333) mm. These results improve the exclusion limits compared to previous searches, and extend the parameter space explored in the context of supersymmetry.

Hadron-Hadron Scattering↗
DOE OSTI2022

The holographic entropy cone from marginal independence

The holographic entropy cone characterizes the relations between entanglement entropies for a spatial partitioning of the boundary spacetime of a holographic CFT in any state describing a classical bulk geometry. We argue that the holographic entropy cone, for an arbitrary number of parties, can be reconstructed from more fundamental data determined solely by subadditivity of quantum entropy. We formulate certain conjectures about graph models of holographic entanglement, for which we provide strong evidence, and rigorously prove that they all imply that such a reconstruction is possible. Our conjectures (except only for the weakest) further imply that the necessary data is remarkably simple. In essence, all one needs to know to reconstruct the holographic entropy cone, is a certain subset of the extreme rays of this simpler “subadditivity cone”, namely those which can be realized in holography. This recasting of the bewildering entanglement structure of geometric states into primal building blocks paves the way to distilling the essence of holography for the emergence of a classical bulk spacetime.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2020

Building bases of loop integrands

We describe a systematic approach to the construction of loop-integrand bases at arbitrary loop-order, sufficient for the representation of general quantum field theories. We provide a graph-theoretic definition of ‘power-counting’ for multi-loop integrands beyond the planar limit, and show how this can be used to organize bases according to ultraviolet behavior. This allows amplitude integrands to be constructed iteratively. We illustrate these ideas with concrete applications. In particular, we describe complete integrand bases at two loops sufficient to represent arbitrary-multiplicity amplitudes in four (or fewer) dimensions in any massless quantum field theory with the ultraviolet behavior of the Standard Model or better. We also comment on possible extensions of our framework to arbitrary (including regulated) numbers of dimensions, and to theories with arbitrary mass spectra and charges. At three loops, we describe a basis sufficient to capture all ‘leading-(transcendental-)weight’ contributions of any four-dimensional quantum theory; for maximally supersymmetric Yang-Mills theory, this basis should be sufficient to represent all scattering amplitude integrands in the theory — for generic helicities and arbitrary multiplicity.

1/NExpansion↗
DOE OSTI2021

Extracting Einstein from the loop-level double-copy

The naive double-copy of (multi) loop amplitudes involving massive matter coupled to gauge theories will generically produce amplitudes in a gravitational theory that contains additional contributions from propagating antisymmetric tensor and dilaton states even at tree-level. We present a graph-based approach that combines the method of maximal cuts with double-copy construction to offer a systematic framework to isolate the pure Einstein-Hilbert gravitational contributions through loop level. Indeed this allows for a bootstrap of pure-gravitational results from the double-copy of massive scalar-QCD. We apply this to construct the novel result of the D-dimensional one-loop five-point QFT integrand relevant in the classical limit to generating observables associated with the radiative effects of massive black-hole scattering via pure Einstein-Hilbert gravity.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2022

Brill-Noether-general limit root bundles: absence of vector-like exotics in F-theory Standard Models

Root bundles appear prominently in studies of vector-like spectra of 4d F-theory compactifications. Of particular importance to phenomenology are the Quadrillion F-theory Standard Models (F-theory QSMs). In this work, we analyze a superset of the physical root bundles whose cohomologies encode the vector-like spectra for the matter representations ($3$, $2$) 1/6 , ($\overline{3}$, $1$) -2/3 and ($1$, $1$) 1 . For the family B 3 (Δ$^{°}_{4}$) consisting of $\mathcal{O}$(10 11 ) F-theory QSM geometries, we argue that more than 99.995% of the roots in this superset have no vector-like exotics. This indicates that absence of vector-like exotics in those representations is a very likely scenario in the O(10 11 ) QSM geometries B 3 (Δ$^{°}_{4}$). The QSM geometries come in families of toric 3-folds B 3 (Δ°) obtained from triangulations of certain 3-dimensional polytopes Δ°. The matter curves in X Σ $\large{ϵ}$ B 3 (Δ°) can be deformed to nodal curves which are the same for all spaces in B 3 (Δ°). Therefore, one can probe the vector-like spectra on the entire family B 3 (Δ°) from studies of a few nodal curves. We compute the cohomologies of all limit roots on these nodal curves. In our applications, for the majority of limit roots the cohomologies are determined by line bundle cohomology on rational tree-like curves. For this, we present a computer algorithm. The remaining limit roots, corresponding to circuit-like graphs, are handled by hand. The cohomologies are independent of the relative position of the nodes, except for a few circuits. On these jumping circuits, line bundle cohomologies can jump if nodes are specially aligned. This mirrors classical Brill-Noether jumps. B 3 (Δ°) admits a jumping circuit, but the root bundle constraints pick the canonical bundle and no jump happens.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2021

One-loop matrix elements of effective superstring interactions: α' -expanding loop integrands

In the low-energy effective action of string theories, non-abelian gauge interactions and supergravity are augmented by infinite towers of higher-mass-dimension operators. We propose a new method to construct one-loop matrix elements with insertions of operators D 2k F n and D 2k R n in the tree-level effective action of type-I and type-II superstrings. Inspired by ambitwistor string theories, our method is based on forward limits of moduli-space integrals using string tree-level amplitudes with two extra points, expanded in powers of the inverse string tension α'. Similar to one-loop ambitwistor computations, intermediate steps feature non-standard linearized Feynman propagators which eventually recombine to conventional quadratic propagators. With linearized propagators the loop integrand of the matrix elements obey one-loop versions of the monodromy and KLT relations. We express a variety of four- and five-point examples in terms of quadratic propagators and formulate a criterion on the underlying genus-one correlation functions that should make this recombination possible at all orders in α'. The ultraviolet divergences of the one-loop matrix elements are crosschecked against the non-separating degeneration of genus-one integrals in string amplitudes. Conversely, our results can be used as a constructive method to determine degenerations of elliptic multiple zeta values and modular graph forms at arbitrary weight.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2025

Renormalizing two-fermion operators in the SMEFT via supergeometry

We extend the geometric framework of field-space covariance for loop computations, thereby unifying the treatment of scalars, fermions, and gauge bosons in effective field theories. This allows us to derive a manifestly covariant formula for one-loop UV divergences that includes contributions from mixed boson-fermion graphs. The result is expressed in terms of geometric invariants of the field-space supermanifold. As a demonstration of this formula, we compute the renormalization group equations for two-fermion operators at the dimension-eight level in the Standard Model Effective Field Theory.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2021

MFNets: data efficient all-at-once learning of multifidelity surrogates as directed networks of information sources

We present an approach for constructing a surrogate from ensembles of information sources of varying cost and accuracy. The multifidelity surrogate encodes connections between information sources as a directed acyclic graph, and is trained via gradient-based minimization of a nonlinear least squares objective. While the vast majority of state-of-the-art assumes hierarchical connections between information sources, our approach works with flexibly structured information sources that may not admit a strict hierarchy. The formulation has two advantages: (1) increased data efficiency due to parsimonious multifidelity networks that can be tailored to the application; and (2) no constraints on the training data—we can combine noisy, non-nested evaluations of the information sources. Finally, numerical examples ranging from synthetic to physics-based computational mechanics simulations indicate the error in our approach can be orders-of-magnitude smaller, particularly in the low-data regime, than single-fidelity and hierarchical multifidelity approaches.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Integrated data-driven and experimental approaches to accelerate lead optimization targeting SARS-CoV- 2 main protease

Identification of potential therapeutic candidates can be expedited by integrating computational modeling with domain aware machine learning (ML) approaches followed by experimental validation. Generative deep learning models have been recently developed that can generate thousands of new candidates, but their physiochemical properties are typically not optimized. Using our deep learning models and a scaffold as a starting point, we generated tens of thousands of compounds for SARS-CoV-2 M pro that preserve the core scaffold. Here we utilized and implemented several computational tools such as structural alert and toxicity analysis, high throughput virtual screening, ML-based 3D quantitative structure–activity relationships, multi-parameter optimization, and graph neural networks on libraries of generated candidates to predict biological activity and binding affinity a priori. From these collective computational results, eight promising candidates were identified and tested experimentally using Native Mass Spectrometry (MS) and FRET-based functional assays. Two compounds, with quinazoline-2-thiol and acetylpiperidine core moiety showed IC 50 values in the low micromolar range: 2.95±0.0017 µM and 3.41±0.0015 µM, respectively. The molecular dynamics simulations further highlight that binding of these compounds results in allosteric modulations in the chain B and the interface domains of the M pro . The key fragments from these top hits can be used as input for closed loop lead optimization in the integrated pipeline.

60 APPLIED LIFE SCIENCES↗
DOE OSTI2021

Lower bounds on circuit depth of the quantum approximate optimization algorithm

The quantum approximate optimization algorithm (QAOA) is a method of approximately solving combinatorial optimization problems. While QAOA is developed to solve a broad class of combinatorial optimization problems, it is not clear which classes of problems are best suited for it. One factor in demonstrating quantum advantage is the relationship between a problem instance and the circuit depth required to implement the QAOA method. As errors in noisy intermediate-scale quantum (NISQ) devices increase exponentially with circuit depth, identifying lower bounds on circuit depth can provide insights into when quantum advantage could be feasible. In this work, we identify how the structure of problem instances can be used to identify lower bounds for circuit depth for each iteration of QAOA and examine the relationship between problem structure and the circuit depth for a variety of combinatorial optimization problems including MaxCut and MaxIndSet. Specifically, we show how to derive a graph, G, that describes a general combinatorial optimization problem and show that the depth of circuit is at least the chromatic index of G. By looking at the scaling of circuit depth, we argue that MaxCut, MaxIndSet, and some instances of vertex covering and Boolean satisfiability problems are suitable for QAOA approaches while knapsack and traveling salesperson problems are not.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Decomposition Algorithms for Solving NP-hard Problems on a Quantum Annealer

NP-hard problems such as the maximum clique or minimum vertex cover problems, two of Karp’s 21 NP-hard problems, have several applications in computational chemistry, biochemistry and computer network security. Adiabatic quantum annealers can search for the optimum value of such NP-hard optimization problems, given the problem can be embedded on their hardware. However, this is often not possible due to certain limitations of the hardware connectivity structure of the annealer. This paper studies a general framework for a decomposition algorithm for NP-hard graph problems aiming to identify an optimal set of vertices. Our generic algorithm allows us to recursively divide an instance until the generated subproblems can be embedded on the quantum annealer hardware and subsequently solved. Furthermore, the framework is applied to the maximum clique and minimum vertex cover problems, and we propose several pruning and reduction techniques to speed up the recursive decomposition. The performance of both algorithms is assessed in a detailed simulation study.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Optimizing power system restoration with damaged communications

Utility procedures for power system blackstart and restoration typically assume that energization decisions can be reliably communicated across the grid. In reality, the communications and control network would likely also be affected in power outages, such as those caused by extreme weather events or cyber-attacks. This paper studies the effect of damage to the power system communications and control infrastructure on restoration operations following a blackout. We model the communications infrastructure as a graph, overlaying the power grid, and imposing the requirement that every energized element in the power grid be observable from a control center. We expand on a specialized branch-and-bound algorithm from the literature to optimize the restoration process and devise an initialization heuristic and a rounding heuristic to improve solution speed. We perform numerical experiments on synthetic systems for Illinois and Texas with outages based on a solar flare or hurricane. We compare the results of our specialized branch-and-bound algorithm to the results from (i) the initialization heuristic alone, (ii) a variation of this heuristic that we use as a baseline, and (iii) the restoration optimization for the power system without communications constraints. Here, we find that damage to the communications infrastructure significantly increases the time required to re-energize the grid. Moreover, by simultaneously optimizing communications repairs and grid energization decisions, we are able to re-energize the grid significantly faster than if communications repairs and energization decisions were made independently or with partial coordination, motivating improvements to current industry practice.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Emerging Tools to Support DILI Assessment in Clinical Trials with Abnormal Baseline Serum Liver Tests or Pre-existing Liver Diseases

Abstract Based on the late Dr. Hyman Zimmerman’s observation that hepatocellular drug-induced liver injury (DILI) leading to jaundice carries a ≥ 10% fatality risk (coined as Hy’s law by others), evaluation of Drug-Induced Serious Hepatotoxicity (eDISH) continues to play a central role in the assessment of a study drug’s liability for acute hepatocellular DILI. The eDISH identifies drugs in clinical trials with DILI fatality (death or transplant) risk that may be unacceptable in a post-market setting. As a two-dimensional graph that plots peak total bilirubin (TB) versus peak serum aminotransferase levels for each patient during study drug or comparator treatment, eDISH identifies potential cases of acute, modest, and serious hepatocellular DILI for in-depth analysis of liver tests (LT) and clinical course so that the likelihood of causal association with the study drug can be determined. Unfortunately, the generalizable utility of this tool only pertains to trials enrolling patients with normal or near normal (NNN) baseline (BL) serum LTs. The eDISH does not necessarily apply to trials of patients with abnormal baseline (ABN-BL) LTs that often coincide with underlying liver disorders. Because drug development programs being reviewed by the FDA increasingly target liver disorders, we are often challenged to evaluate DILI risk in trials of patients with ABN-BL LTs. Also, the high background prevalence of metabolic dysfunction associated steatotic liver disease (MASLD) means patients with LTs above NNN may need to be enrolled in trials treating non-liver disorders to reflect the target population. Such study populations create challenges for industry and regulators because eDISH may not reliably categorize or identify potential cases of DILI for further analysis, as it so efficiently does in NNN-BL trials. We describe the main functionalities of eDISH in NNN-BL trials to understand what should be emulated by new tools or eDISH modifications. We then discuss non-eDISH–based plots that may be useful in ABN-BL trials.

Amirzadegan, Jasmine↗
DOE OSTI2022

The Evolution of the Peridynamics Co-Authorship Network

We report peridynamics is a relatively new field in continuum mechanics that has developed over the past 20 years. This paper studies the evolution of collaborations in the field of peridynamics since its inception using social network analysis. For this purpose, we construct a network for each year from 2000 to 2019 describing co-authorship between scientists in peridynamics. In these networks, each node represents a scientist and each link connects two co-authoring scientists with a link weight representing the frequency and strength of their collaboration; each network as a whole can be thought of as a graph representation of the peridynamics community for the given year. By constructing a network for each year, we are able to analyze the evolution of the network in time and discuss the implications of this evolution for the peridynamics community. Our study demonstrates that the peridynamics community has been growing exponentially in size in recent years. Centrality metrics are also used to identify the most collaborative scientists in the community. Moreover, we compute link recommendations based on both elevating a scientist’s position in the network with respect to certain centrality metrics or closing structural holes in the network identified with persistent homology. We further extend the analysis to higher-order networks whose nodes represent groups of scientists in the community and whose links connect collaborating groups. In some sense, our work studies the past, present, and future of the peridynamics community.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Robust implementation of generative modeling with parametrized quantum circuits

Although the performance of hybrid quantum-classical algorithms is highly dependent on the selection of the classical optimizer and the circuit ansätze, a robust and thorough assessment on-hardware of such features has been missing to date. From the optimizer perspective, the primary challenge lies in the solver’s stochastic nature, and their significant variance over the random initialization. Therefore, a robust comparison requires one to perform several training curves for each solver before one can reach conclusions about their typical performance. Since each of the training curves requires the execution of thousands of quantum circuits in the quantum computer, such a robust study remained a steep challenge for most hybrid platforms available today. In this work, we leverage on Rigetti’s Quantum Cloud Services (QCS™) to overcome this implementation barrier, and we study the on-hardware performance of the data-driven quantum circuit learning (DDQCL) for three different state-of-the-art classical solvers, and on two-different circuit ansätze associated to different entangling connectivity graphs for the same task. Additionally, we assess the gains in performance from varying circuit depths. To evaluate the typical performance associated with each of these settings in this benchmark study, we use at least five independent runs of DDQCL towards the generation of quantum generative models capable of capturing the patterns of the canonical Bars and Stripes dataset. In this experimental benchmarking, the gradient-free optimization algorithms show an outstanding performance compared to the gradient-based solver. In particular, one of them had better performance when handling the unavoidable noisy objective function to be minimized under experimental conditions.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Quantum-assisted associative adversarial network: applying quantum annealing in deep learning

Abstract Generative models have the capacity to model and generate new examples from a dataset and have an increasingly diverse set of applications driven by commercial and academic interest. In this work, we present an algorithm for learning a latent variable generative model via generative adversarial learning where the canonical uniform noise input is replaced by samples from a graphical model. This graphical model is learned by a Boltzmann machine which learns low-dimensional feature representation of data extracted by the discriminator. A quantum processor can be used to sample from the model to train the Boltzmann machine. This novel hybrid quantum-classical algorithm joins a growing family of algorithms that use a quantum processor sampling subroutine in deep learning, and provides a scalable framework to test the advantages of quantum-assisted learning. For the latent space model, fully connected, symmetric bipartite and Chimera graph topologies are compared on a reduced stochastically binarized MNIST dataset, for both classical and quantum sampling methods. The quantum-assisted associative adversarial network successfully learns a generative model of the MNIST dataset for all topologies. Evaluated using the Fréchet inception distance and inception score, the quantum and classical versions of the algorithm are found to have equivalent performance for learning an implicit generative model of the MNIST dataset. Classical sampling is used to demonstrate the algorithm on the LSUN bedrooms dataset, indicating scalability to larger and color datasets. Though the quantum processor used here is a quantum annealer, the algorithm is general enough such that any quantum processor, such as gate model quantum computers, may be substituted as a sampler.

Wilson, Max (ORCID:0000000207983391)↗
DOE OSTI2024

Scheduling and Performance of Asynchronous Tasks in Fortran 2018 with FEATS

Most parallel scientific programs contain compiler directives (pragmas) such as those from OpenMP (Hermanns in Parallel programming in Fortran 95 using openMP, 2002. School of Aeronautical Engineering, Universidad Politécnica de Madrid, España, 2011), explicit calls to runtime library procedures such as those implementing the Message Passing Interface (MPI) (in A message-passing interface standard version 4.0, 2021. https://www.mpi-forum.org/docs/mpi-4.0/mpi40-report.pdf), or compiler-specific language extensions such as those provided by CUDA (Ruetsch and Fatica in CUDA Fortran for scientists and engineers: best practices for efficient CUDA Fortran programming, Elsevier, 2013). By contrast, the recent Fortran standards empower developers to express parallel algorithms without directly referencing lower-level parallel programming models (Numrich in Parallel programming with co-arrays, CRC Press, 2018, and Curcic in Modern Fortran: building efficient parallel applications, Manning Publications, 2020). Fortran’s parallel features place the language within the Partitioned Global Address Space (PGAS) class of programming models. When writing programs that exploit data parallelism, application developers often find it straightforward to develop custom parallel algorithms. Problems involving complex, heterogeneous, staged calculations, however, pose much greater challenges. Such applications require careful coordination of tasks in a manner that respects dependencies prescribed by a directed acyclic graph. When rolling one’s own solution proves difficult, extending a customizable framework becomes attractive. Further, the paper presents the design, implementation, and use of the Framework for Extensible Asynchronous Task Scheduling (FEATS), which we believe to be the first task scheduling tool written in modern Fortran. We describe the benefits and compromises associated with choosing Fortran as the implementation language, and we propose ways in which future Fortran standards can best support the use case in this paper.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

An integrated approach to optimizing concentration shock wave electrodialysis using 2D multicell simulation and response surface models

Shock wave electrodialysis (SWED) is a highly promising technique for energy-efficient ion separation in the context of a circular economy. This paper presents a approach way of modeling and improving SWED using a two-dimensional multicell model combined with the COMSOL program and response surface methodology. The model integrates the Nernst-Planck equation, Darcy's law, and first-order electroosmosis to examine the local concentration, flux of ionic species, distribution of current, and velocity of flow in SWED cells under various operating conditions. We first illustrate the clear depiction of concentration, velocity, and electric potential distribution through contours which aids in identifying optimal operating conditions and designing scalable SWED systems. The results emphasize the significance of surface charge density and voltage in influencing the features of shock waves for obtaining effective ion separation while optimizing energy consumption and improving current efficiency by controlling the retention time of feed flow. Here, this study defines two crucial characteristics of shock waves, namely the length of the flat depletion zone of a fully developed shock wave (shock wave height) and the distance of shock wave propagation (shock wave length). These properties significantly impact separation performance, as determined by the simulation results. Additionally, the response surface methodology is incorporated with the COMSOL models to develop predictive models and graph responses, enabling a more comprehensive understanding of the interactions between parameters and performance indicators, such as removal ratio, energy consumption, and water recovery. Finally, this work suggests design tactics for expanding SWED processes and outlines potential areas for further research. This research provides valuable insights into the prospective applications, design optimization, and scalability of SWED in the field of electrokinetic separation technologies for green chemistry and a circular economy.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗