SEARCH · Engineering Papers

Results for “space computing”

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 271 records · Page 15

All sources NASA NTRS DOE OSTI

DOE OSTI2022

Modeling quantum state transport with SQMS devices

To scale up the Hilbert space of architectures for quantum computation involving microwave cavities, we need to control more and more photons states. A big step forward in this direction would be to connect two different cavities from a quantum mechanics point of view. In this report, we will discuss which experimental approach would be feasible to transfer a quantum state from one cavity to another. To perform this task, we will take advantage of the secondary modes of the cavities, discussing how a variable coupling between the cavity modes could help us in this process. In the end, we will see how we can create entanglement between the cavities from this procedure.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

DOE OSTI2025

Evaluating Variable-Impedance Magnetically-Insulated Transmission Lines as a Risk-Mitigation Measure for Next-Generation Pulsed Power

This project has produced the first detailed characterizations of power flow resulting from applying the “variable-impedance MITL” concept to real-life systems in Sandia’s pulsed power program (Z and next-generation pulsed power (NGPP)). We present simulation results and analyses for constant-impedance versions of both Z and NGPP and survey the operational viability of several variable-impedance re-designs in the parameter space of linear tapers. Circuit modeling (SCREAMER/Bertha) was used to pinpoint promising candidate designs, and EM-PIC (Empire) simulations were used to evaluate these candidates more rigorously. This approach was particularly successful in the Z regime which resulted in the identification of several viable variable-impedance MITL designs for each level. The approach was more challenged in the operating space NGPP occupies, producing data points that speak to a more restrictive design space due to anode plasma turn-on. In the end, we were able to converge on one viable variable-impedance design for the highest inductance line (level “F”) and one for the highest current line (level “A”). Altogether, the body of simulation evidence presented in this report suggest there does exist flexibility in operating space for magnetically-insulated transmission lines (MITLs) having variable geometric impedance to be a potential enabling technology for safely increasing current delivery (and potentially lowering stack voltage) in pulsed-power drivers by manipulating electron losses; however, operating points for a particular design must be carefully screened. Circuit and EM-PIC modeling provided consistent verdicts in safe operating regimes for operational viability, but additional physics such as anode plasma turn-on which is included in Empire but not in SCREAMER/Bertha was found to be a critical factor affecting power flow that lead to different assessments between the codes. It is not always the case that the occurrence of anode plasma caused a design to fail (some designs turned on anode plasma yet still delivered load currents meeting design targets); the details matter such as how early in the pulse anode surfaces break down (and how large a region). However, in every case that it did fail it was found that the feedback from anode plasma was the cause (i.e., turning off the anode plasma model in Empire restored agreement with the circuit model prediction). As circuit simulations represent an efficient and practical means of surveying design space compared to more computationally-expensive approaches such as EM-PIC, it could be prudent to invest in the research and development of models to include the effects of anode plasma such as ion emission in circuit codes. The variable-impedance MITL design is a new concept that enables controlled manipulation of the initial electron losses in the outer MITL and can be tested on Z today. We encourage follow-on work to explore further optimization (including alternative variable-impedance profiles, e.g., having constant dZ/dR), and to confirm the major findings presented in this report by fielding test hardware on actual Z shots.

24 POWER TRANSMISSION AND DISTRIBUTION↗

DOE OSTI2022

On the Rapid Calculation of Binding Affinities for Antigen and Antibody Design and Affinity Maturation Simulations

The accurate and efficient calculation of protein-protein binding affinities is an essential component in antibody and antigen design and optimization, and in computer modeling of antibody affinity maturation. Such calculations remain challenging despite advances in computer hardware and algorithms, primarily because proteins are flexible molecules, and thus, require explicit or implicit incorporation of multiple conformational states into the computational procedure. The astronomical size of the amino acid sequence space further compounds the challenge by requiring predictions to be computed within a short time so that many sequence variants can be tested. In this study, we compare three classes of methods for antibody/antigen (Ab/Ag) binding affinity calculations: (i) a method that relies on the physical separation of the Ab/Ag complex in equilibrium molecular dynamics (MD) simulations, (ii) a collection of 18 scoring functions that act on an ensemble of structures created using homology modeling software, and (iii) methods based on the molecular mechanics-generalized Born surface area (MM-GBSA) energy decomposition, in which the individual contributions of the energy terms are scaled to optimize agreement with the experiment. When applied to a set of 49 antibody mutations in two Ab/HIV gp120 complexes, all of the methods are found to have modest accuracy, with the highest Pearson correlations reaching about 0.6. In particular, the most computationally intensive method, i.e., MD simulation, did not outperform several scoring functions. The optimized energy decomposition methods provided marginally higher accuracy, but at the expense of requiring experimental data for parametrization. Within each method class, we examined the effect of the number of independent computational replicates, i.e., modeled structures or reinitialized MD simulations, on the prediction accuracy. We suggest using about ten modeled structures for scoring methods, and about five simulation replicates for MD simulations as a rule of thumb for obtaining reasonable convergence. We anticipate that our study will be a useful resource for practitioners working to incorporate binding affinity calculations within their protein design and optimization process.

59 BASIC BIOLOGICAL SCIENCES↗

DOE OSTI2021

Adaptive Machine Learning for Robust Diagnostics and Control of Time-Varying Particle Accelerator Components and Beams

Machine learning (ML) is growing in popularity for various particle accelerator applications including anomaly detection such as faulty beam position monitor or RF fault identification, for non-invasive diagnostics, and for creating surrogate models. ML methods such as neural networks (NN) are useful because they can learn input-output relationships in large complex systems based on large data sets. Once they are trained, methods such as NNs give instant predictions of complex phenomenon, which makes their use as surrogate models especially appealing for speeding up large parameter space searches which otherwise require computationally expensive simulations. However, quickly time varying systems are challenging for ML-based approaches because the actual system dynamics quickly drifts away from the description provided by any fixed data set, degrading the predictive power of any ML method, and limits their applicability for real time feedback control of quickly time-varying accelerator components and beams. In contrast to ML methods, adaptive model-independent feedback algorithms are by design robust to un-modeled changes and disturbances in dynamic systems, but are usually local in nature and susceptible to local extrema. In this work, we propose that the combination of adaptive feedback and machine learning, adaptive machine learning (AML), is a way to combine the global feature learning power of ML methods such as deep neural networks with the robustness of model-independent control. We present an overview of several ML and adaptive control methods, their strengths and limitations, and an overview of AML approaches.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2020

Discovery of a Gamma-Ray Black Widow Pulsar by GPU-accelerated Einstein@Home

We report the discovery of 1.97 ms period gamma-ray pulsations from the 75 minute orbital-period binary pulsar now named PSR J1653-0158. The associated Fermi Large Area Telescope gamma-ray source 4FGL J1653.6-0158 has long been expected to harbor a binary millisecond pulsar. Despite the pulsar-like gamma-ray spectrum and candidate optical/X-ray associations—whose periodic brightness modulations suggested an orbit—no radio pulsations had been found in many searches. The pulsar was discovered by directly searching the gamma-ray data using the GPU-accelerated Einstein@Home distributed volunteer computing system. The multidimensional parameter space was bounded by positional and orbital constraints obtained from the optical counterpart. More sensitive analyses of archival and new radio data using knowledge of the pulsar timing solution yield very stringent upper limits on radio emission. Any radio emission is thus either exceptionally weak, or eclipsed for a large fraction of the time. The pulsar has one of the three lowest inferred surface magnetic-field strengths of any known pulsar with B surf ≈ 4 × 10 7 G. The resulting mass function, combined with models of the companion star's optical light curve and spectra, suggests a pulsar mass gsim 2 M ⊙ . The companion is lightweight with mass ~0.01 M ⊙ , and the orbital period is the shortest known for any rotation-powered binary pulsar. This discovery demonstrates the Fermi Large Area Telescope's potential to discover extreme pulsars that would otherwise remain undetected.

79 ASTRONOMY AND ASTROPHYSICS↗

DOE OSTI2022

Thermal feedback coupling in a transient Monte Carlo high-order/low-order scheme

Transient simulations of nuclear systems face the computational challenge of resolving both space and time during reactivity changes. A common strategy for tackling this issue is to split the neutron flux into shape and amplitude functions. This split can be solved with high- order/low-order methods. While this multi-fidelity approach has traditionally been reserved for deterministic methods, it is also possible to implement in Monte Carlo as an efficient alternative to Dynamic Monte Carlo. This work implements the frequency transform method with thermal feedback in high-order/low-order Monte Carlo by blending static coupling methods such as single-batch Monte Carlo, with a simple thermal-fluids calculation. While previous work focused solely on prescribed transients, the addition of time-dependent thermal-fluids allows transients to be self-propagating. Tests were run in a fluids-initiated transient to showcase the basic functionalities of this methodology. Preliminary results behave as expected, paving the way for studying more sophisticated thermal-fluids coupling methods. (authors)

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

DOE OSTI2025

A Synthesis Methodology for Intelligent Memory Interfaces in Accelerator Systems

Domain-specific systems improve the performance of a specific set of applications compared to general-purpose processing systems by deploying custom hardware accelerators. These hardware accelerators are generated using high-level synthesis (HLS) tools. The HLS tools enable a comprehensive design space exploration to optimize the compute performance of the generated accelerators. However, they often ignore the challenges of implementing the accelerators in a system-on-chip, particularly how the accelerators access memory. Our work introduces a buffering system design that improves accelerators' memory accesses by intelligently employing burst transactions to prefetch useful data from external memory to on-chip local buffers. Our design is dynamic, parametric, and transparent to the accelerators generated by HLS tools. We derive the buffering system parameters using appropriate compiler-based analysis passes and memory channel latency constraints. The proposed buffering system design results in, on average, 8.8x performance improvements while lowering memory channel utilization on average by 53.2% for a set of PolyBench kernels.

Limaye, Ankur M. (ORCID:0000000194062584)↗

DOE OSTI2024

Quantum discriminator for binary classification

Abstract Quantum computers have the unique ability to operate relatively quickly in high-dimensional spaces—this is sought to give them a competitive advantage over classical computers. In this work, we propose a novel quantum machine learning model called the Quantum Discriminator, which leverages the ability of quantum computers to operate in the high-dimensional spaces. The quantum discriminator is trained using a quantum-classical hybrid algorithm in $$\mathcal {O}(N\log N)$$ O ( N log N ) time, and inferencing is performed on a universal quantum computer in $$\mathcal {O}(N)$$ O ( N ) time. The quantum discriminator takes as input the binary features extracted from a given datum along with a prediction qubit, and outputs the predicted label. We analyze its performance on the Iris and Bars and Stripes data sets, and show that it can attain 99% accuracy in simulation.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2020

On‐site surrogates for large‐scale calibration

Abstract Motivated by a computer model calibration problem from the oil and gas industry, involving the design of a honeycomb seal, we develop a new Bayesian methodology to cope with limitations in the canonical apparatus stemming from several factors. We propose a new strategy of on‐site design and surrogate modeling for a computer simulator acting on a high‐dimensional input space that, although relatively speedy, is prone to numerical instabilities, missing data, and nonstationary dynamics. Our aim is to strike a balance between data‐faithful modeling and computational tractability in a calibration framework—tailoring the computer model to a limited field experiment. Situating our on‐site surrogates within the canonical calibration apparatus requires updates to that framework. We describe a novel yet intuitive Bayesian setup that carefully decomposes otherwise prohibitively large matrices by exploiting the sparse blockwise structure. Empirical illustrations demonstrate that this approach performs well on toy data and our motivating honeycomb example.

Huang, Jiangeng↗

DOE OSTI2021

Computational Complexity of Neuromorphic Algorithms

Neuromorphic computing has several characteristics that make it an extremely compelling computing paradigm for post Moore computation. Some of these characteristics include intrinsic parallelism, inherent scalability, collocated processing and memory, and event-driven computation. While these characteristics impart energy efficiency to neuromorphic systems, they do come with their own set of challenges. One of the biggest challenges in neuromorphic computing is to establish the theoretical underpinnings of the computational complexity of neuromorphic algorithms. In this paper, we take the first steps towards defining the space and time complexity of neuromorphic algorithms. Specifically, we describe a model of neuromorphic computation and state the assumptions that govern the computational complexity of neuromorphic algorithms. Next, we present a theoretical framework to define the computational complexity of a neuromorphic algorithm. We explicitly define what space and time complexities mean in the context of neuromorphic algorithms based on our model of neuromorphic computation. Finally, we leverage our approach and define the computational complexities of six neuromorphic algorithms: constant function, successor function, predecessor function, projection function, neuromorphic sorting algorithm and neighborhood subgraph extraction algorithm.

Date, Prasanna↗

DOE OSTI2021

Probabilistic Data Association for Orbital-Element Estimation Using Multistage Expectation–Maximization

Tracking space objects is important for managing space traffic and predicting collisions, but is difficult in part due to data association and orbit model uncertainty. Expectation–maximization (EM) is a commonly used tracking method that has not been widely considered for tracking space objects. The technique consists of iteratively computing data association probabilities with a set of current element estimates, and updating estimates of the elements by solving a nonlinear weighted least-squares regression problem where the weights are the data association probabilities. In this paper, we demonstrate the use of EM for probabilistic data association and orbital-element estimation by applying the technique to simulated data from two angles-only tracking scenarios. In both scenarios, EM provides correct data associations and accurate maximum likelihood estimates of orbital elements. One scenario considers tracking a single object in clutter and quantifies the improvement of the orbital-element estimates and data associations as the detection probability increases. However, standard application of EM requires knowing the number of objects or may fail when a large number of objects are present. To address these issues, this paper employs a multistage version of EM that is applicable when there are a large and possibly unknown number of objects.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2023

Decorated TQFTs and their Hilbert spaces

We discuss topological quantum field theories that compute topological invariants which depend on additional structures (or decorations) on three-manifolds. The q-series invariant $\hat{Z}$(q) proposed by Gukov, Pei, Putrov, and Vafa is an example of such an invariant. We describe how to obtain these decorated invariants by cutting and gluing and make a proposal for Hilbert spaces that are assigned to two-dimensional surfaces in the $\hat{Z}$-TQFT.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

DOE OSTI2023

Renormalization of the Standard Model Effective Field Theory from geometry

S-matrix elements are invariant under field redefinitions of the Lagrangian. They are determined by geometric quantities such as the curvature of the field-space manifold of scalar and gauge fields. We present a formalism where scalar and gauge fields are treated together, with a metric on the combined space of both types of fields. Scalar and gauge scattering amplitudes are given by the Riemann curvature Rijkl of this combined space, with indices i, j, k, l chosen to be scalar or gauge indices depending on the type of external particle. One-loop divergences can also be computed in terms of geometric invariants of the combined space, which greatly simplifies the computation of renormalization group equations. We apply our formalism to the Standard Model Effective Field Theory (SMEFT), and compute the renormalization group equations for even-parity bosonic operators to mass dimension eight.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

DOE OSTI2024

Position Papers for the 2024 ASCR Workshop on Analog Computing for Science

Analog computing capabilities have existed since the dawn of science, but modern techniques potentially allow for the construction, verification, and characterization of complicated analog computing systems in a wide variety of contexts, from high-performance computational accelerators to nanorobotics and synthetic biology. In short, advances in analog computing can enable the creation of physical systems with complex behaviors that meet sophisticated requirements. Meeting our nation's needs, from needs in computing and modeling, to needs for advanced materials and energy technologies, continues to motivate pursuing novel kinds of complex systems, and thus analog computing techniques, in all of these spaces.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2020

A machine learning approach for increased throughput of density functional theory substitutional alloy studies

In this study, a machine learning-based technique is developed to reduce the computational cost required to explore large design spaces of substitutional alloys. The first advancement is based on a neural network (NN) approach to predict the initial position of minority and majority ions prior to DFT relaxation. The second advancement is to allow the NN to predict the total energy for every possibility minority ion position and select the most stable configuration in the absence of relaxing each trial minority configuration. A bismuth oxide materials system, (Bi x La y Yb z ) 2 MoO 6 , was used as the model system to demonstrate the developed methods and quantify the resulting computational speedup. Compared to a brute force method that requires the calculation of every permutation of minority configuration and subsequent DFT relaxation, a 1.3× speedup was realized if the NN predicted the initial configuration of ions prior to relaxation. Implementation of the second advancement allowed the NN to predict the total energy for all possible trial configurations and downselect the most stable configurations prior to relaxation, resulting in a speedup of approximately 37×. Validation was done by comparing position and energy between the NN and DFT predictions. A maximum position vector mean squared error (MSE) of 1.6 × 10 -2 and a maximum energy MSE of 2.3 × 10 -7 was predicted for the worst case configuration. This method demonstrates a significant computational speedup, which has the potential for even greater computational savings for larger compositional design spaces.

36 MATERIALS SCIENCE↗

DOE OSTI2024

Position-space renormalization schemes for four-quark operators in HQET

Abstract X-space schemes are gauge-invariant, regulator-independent renormalization schemes that are defined by requiring position-space correlation functions of gauge-invariant operators to be equal to their noninteracting values at particular kinematic points. These schemes can be used to nonperturbatively renormalize composite operators in Lattice Quantum Chromodynamics (LQCD), and by computing matching coefficients between theX-space scheme and$$ \overline{\textrm{MS}} $$ MS ¯ in the dimensionally-regulated continuum, matrix elements calculated with LQCD can be converted to$$ \overline{\textrm{MS}} $$ MS ¯ -renormalized matrix elements. UsingX-space schemes for Heavy Quark Effective Theory (HQET) operators has the additional benefit that appropriate ratios of position-space correlation functions cancel the power-divergent static-quark self-energy of Lattice HQET nonperturbatively. This work presents theO(α S ) matching coefficients betweenX-space renormalized four-quark flavor-nonsinglet HQET operators relevant for the lifetimes of charm- and bottom-hadrons, and four-quark HQET operators relevant for mixing between neutral mesons containing a heavy quark, such asB−$$ \overline{B} $$ B ¯ mixing.

Physics↗

DOE OSTI2025

Operator origin of anomalous dimensions in de Sitter space

The late-time limit of the power spectrum for heavy (principal series) fields in de Sitter (dS) space yields a series of polynomial terms with complex scaling dimensions. Such scaling behavior is expected to result from an associated operator with a complex dimension. In a free theory, these complex dimensions are known to match the constraints imposed by unitarity on the space of states. Yet, perturbative corrections to the scaling behavior of operators are naively inconsistent with unitary evolution of the quantum fields in dS space. This paper demonstrates how to compute one-loop corrections to the scaling dimensions that appear in the two-point function from the field theory description in terms of local operators. We first show how to evaluate these anomalous dimensions using Mellin space, which has the feature that it naturally accommodates a scaleless regulator. We then explore the consequences for the soft de Sitter effective theory (SdSET) description that emerges in the long wavelength limit. Carefully matching between the UV and SdSET descriptions requires the introduction of novel nondynamical “operators” in the effective theory. This is not only necessary to reproduce results extracted from the Källén-Lehmann representation (that use the space of unitary states directly), but it is also required by general arguments that invoke positivity. Published by the American Physical Society 2025

Cohen, Timothy↗

DOE OSTI2023

Aerodynamic Sensitivity of a Novel Data-Driven Airfoil Shape Representation Framework

We explore the aerodynamic implications of a novel data-driven separable shape tensor framework used to represent discrete airfoil shapes. In this study, we construct a data-driven parameter space defined by separable shape tensors and informed by tens of thousands of distinct airfoils. We use this design space to generate new airfoil designs to study parametric sensitivities with respect to various aerodynamic responses. We use a HAM2D RANS solver to approximate the lift, drag, and moment coefficients for the generated airfoils at two different angles-of-attack. We analyze the robustness and sensitivities of using the separable shape tensor design space by examining the coverage of the aerodynamic response space, uncovering low-dimensional polynomial ridge approximations, and computing various sensitivity metrics. The results show that the data-driven design space produce significant variation in target aerodynamic quantities and facilitate highly accurate approximations (R^2 > 0.96) of one- and two-dimensional structures in each aerodynamic response. This further reduces the effective dimension to enable simplified design and optimization tasks.

aerodynamics↗