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 127 records · Page 7

All sources NASA NTRS DOE OSTI

DOE OSTI2022

Deep Learning for Simultaneous Inference of Hydraulic and Transport Properties

Abstract Identification of a heterogeneous conductivity field and reconstruction of a contaminant release history are key aspects of subsurface remediation. These two goals are achieved by combining model predictions with sparse and noisy hydraulic head and concentration measurements. Solution of this inverse problem is notoriously difficult due to, in part, high dimensionality of the parameter space and high computational cost of repeated forward solves. We use a convolutional adversarial autoencoder (CAAE) to parameterize a heterogeneous non‐Gaussian conductivity field via a low‐dimensional latent representation. A three‐dimensional dense convolutional encoder‐decoder (DenseED) network serves as a forward surrogate of the flow and transport model. The CAAE‐DenseED surrogate is fed into the ensemble smoother with multiple data assimilation (ESMDA) algorithm to sample from the Bayesian posterior distribution of the unknown parameters, forming a CAAE‐DenseED‐ESMDA inversion framework. The resulting CAAE‐DenseED‐ESMDA inversion strategy is used to identify a three‐dimensional contaminant source and conductivity field. A comparison of the inversion results from CAAE‐ESMDA with physical flow and transport simulator and from CAAE‐DenseED‐ESMDA shows that the latter yields accurate reconstruction results at the fraction of the computational cost of the former.

Zhou, Zitong↗

DOE OSTI2021

Accelerated optimization of pure metal and ligand compositions for light-driven hydrogen production

Photocatalytic hydrogen production is a promising alternative to traditional hydrogen production. To implement photocatalytic hydrogen production the development of efficient, sustainable, and stable catalysts is necessary, and overcoming the current challenges surrounding high dimensional search spaces requires both computational and experimental efforts. Utilizing photo driven processes, stable colloidal metal catalysts can be formed in situ for efficient hydrogen production from water. When considering colloidal catalysts, stability is typically a concern solved through the addition of supports or ligands. In this work, poly(ethylene glycol) methyl ether thiol acts as a stabilizing ligand eliminating the need for catalyst supports while providing stable and active nanoparticle catalysts for more than 45 hours of reaction time and illumination. These systems utilize molecular photosensitizers, water reduction catalysts, stabilizing ligands, water, a sacrificial reductant, and organic solvents, posing new challenges pertaining to the optimization of multi-variable systems. Design of experiments (DOE) is applied to accelerate the understanding of variable interactions and is used as a tool to rapidly optimize the compositions of Au, Cu, Ni, and Fe containing systems. Through a collaboration leveraging computation and experimentation (both high throughput and characterizations), optimized performance peaks were obtained for each of these metals alongside distinct mapping of expected activity associated with photosensitizer, metal, and ligand concentration variations. With the highly digitized workflow, this study allowed for comparative generalizations to be made regarding photo driven hydrogen production for all four metals.

08 HYDROGEN↗

DOE OSTI2023

Electronic transport in copper–graphene composites

In this work, we investigate electronic transport properties of copper–graphene (Cu–G) composites using a density-functional theory (DFT) framework. Conduction in composites is studied by varying the interfacial distance of copper/graphene/copper (Cu/G/Cu) interface models. Electronic conductivity of the models computed using the Kubo–Greenwood formula shows that the conductivity increases with decreasing Cu–G distance and saturates below a threshold Cu–G distance. The DFT-based Bader charge analysis indicates increasing charge transfer between Cu atoms at the interfacial layers and the graphene with decreasing Cu–G distance. The electronic density of states reveals increasing contributions from both copper and carbon atoms near the Fermi level with decreasing Cu–G interfacial distance. By computing the space-projected conductivity of the Cu/G/Cu models, we show that the graphene forms a bridge to the electronic conduction at small Cu–G distances, thereby enhancing the conductivity.

36 MATERIALS SCIENCE↗

DOE OSTI2022

Engineering magnetic topological insulators in Eu 5 M 2 X 6 Zintl compounds

Magnetic topological insulators provide a prominent material platform for quantum anomalous Hall physics and axion electrodynamics. However, the lack of material realizations with cleanly gapped surfaces hinders technological utilization of these exotic quantum phenomena. Here, using the Zintl concept and the properties of nonsymmorphic space groups, we computationally engineer magnetic topological insulators. Specifically, we explore Eu 5 M 2 X 6 (M=metal, X=pnictide) Zintl compounds and find that Eu 5 Ga 2 Sb 6 , Eu 5 Tl 2 Sb 6 , and Eu 5 In 2 Bi 6 form stable structures with nontrivial Z 2 indices. We also show that epitaxial and uniaxial strain can be used to control the Z 2 index and the bulk energy gap. Lastly, we discuss experimental progress towards the synthesis of the proposed candidates and provide insights that can be used in the search for robust magnetic topological insulators in Zintl compounds.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

DOE OSTI2022

Autoregressive Neural Network for Simulating Open Quantum Systems via a Probabilistic Formulation

The theory of open quantum systems lays the foundation for a substantial part of modern research in quantum science and engineering. Rooted in the dimensionality of their extended Hilbert spaces, the high computational complexity of simulating open quantum systems calls for the development of strategies to approximate their dynamics. In this Letter, we present an approach for tackling open quantum system dynamics. Using an exact probabilistic formulation of quantum physics based on positive operator-valued measure, we compactly represent quantum states with autoregressive neural networks; such networks bring significant algorithmic flexibility due to efficient exact sampling and tractable density. We further introduce the concept of string states to partially restore the symmetry of the autoregressive neural network and improve the description of local correlations. Efficient algorithms have been developed to simulate the dynamics of the Liouvillian superoperator using a forward-backward trapezoid method and find the steady state via a variational formulation. Our approach is benchmarked on prototypical one-dimensional and two-dimensional systems, finding results which closely track the exact solution and achieve higher accuracy than alternative approaches based on using Markov chain Monte Carlo method to sample restricted Boltzmann machines. Our Letter provides general methods for understanding quantum dynamics in various contexts, as well as techniques for solving high-dimensional probabilistic differential equations in classical setups.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

DOE OSTI2021

Co-design of Advanced Architectures for Graph Analytics using Machine Learning

A graph is an excellent way of representing relationships among entities. We can use graph analytics to synthesize and analyze such relational data, and extract relevant features that are useful for various tasks such as machine learning. Considering the crucial role of graph analytics in various domains, it is important and timely to investigate the right hardware configurations that can achieve optimal performance for graph workloads on future high-performance computing systems. Design space exploration studies facilitate the selection of appropriate configurations (e.g. memory) to achieve a desired system performance. Recently, the approach of accelerating graph analytics using persistent non-volatile memory has gained a lot of attention. Traditional system simulators such as Gem5 and NVMain can be used to explore the design space of these advanced memory architectures for graph workloads. However, these simulators are slow in execution thus limiting the efficiency of design space exploration studies. To overcome this challenge, we proposed a machine learning based approach to co-design advanced memory architectures for graph workloads. We tested our approach with DRAM, non-volatile memory, and hybrid memory (DRAM+NVM) using a breadth first search benchmark algorithm. Our results showed the applicability of the proposed machine learning based approach to the co-design of the advanced memory architectures. In this paper, we provide recommendations on selecting advanced memory architectures to achieve desired performance for graph workloads. We also discuss the performances of different machine learning models that were considered in this study.

Kurte, Kuldeep↗

DOE OSTI2026

Make the Fastest Faster: Importance Mask Synthesis for Interactive Volume Visualization using Reconstruction Neural Networks

Visualizing a large-scale volumetric dataset with high resolution is challenging due to the substantial computational time and space complexity. Recent deep learning-based image inpainting methods significantly improve rendering latency by reconstructing a high-resolution image for visualization in constant time on GPU from a partially rendered image where only a portion of pixels go through the expensive rendering pipeline. However, existing solutions need to render every pixel of either a predefined regular sampling pattern or an irregular sample pattern predicted from a low-resolution image rendering. Both methods require a significant amount of expensive pixel-level rendering. In this work, we provide Importance Mask Learning (IML) and Synthesis (IMS) networks, which are the first attempts to directly synthesize important regions of the regular sampling pattern from the user’s view parameters, to further minimize the number of pixels to render by jointly considering the dataset, user behavior, and the downstream reconstruction neural network. Our solution is a unified framework to handle various types of inpainting methods through the proposed differentiable compaction/decompaction layers. Experiments show our method can further improve the overall rendering latency of state-of-the-art volume visualization methods using reconstruction neural network for free when rendering scientific volumetric datasets. Our method can also directly optimize the off-the-shelf pre-trained reconstruction neural networks without elongated retraining.

Large-scale data↗

DOE OSTI2024

Rotational Millimeter-Wave Shoe Scanner Using the Discrete Fourier Transform for Backprojection-Based Image Reconstruction

An active 3D microwave / millimeter-wave shoe scanner was previously developed at the Pacific Northwest National Laboratory (PNNL) using two linear arrays scanned over a rectilinear aperture. The radar system chirps a frequency sweep from 10-40 GHz. These frequencies allow imaging through optically opaque material such as leather, rubber, plastics, and other dielectrics. The system was designed to detect concealed items in the soles of shoes while allowing people to leave their shoes on through a security checkpoint. To shrink the footprint of the system, a new iteration of the design has been developed that scans the two linear arrays over a circular aperture. This new footprint opens the possibility of it being installed in the floor of a cylindrical millimeter-wave body scanner. The backprojection-based multilayer dielectric image reconstruction developed at PNNL can easily handle arbitrary spatial sampling, accommodating the new rotational shoe scanner design. Commonly, the fast Fourier transform (FFT) is used to efficiently compute the range response from the data collected by the system as a preprocessing step to the backprojection algorithm. It was found that converting to range using the discrete Fourier transform (DFT) directly has some advantages over the FFT. For example, nonlinear and non-uniform frequency sweeps can easily be compensated for during the computation of the DFT and only the range bins of interest need to be computed and their spacing can be chosen arbitrarily. Because the range conversion step of the image reconstruction is the fastest part of the process there is very little speed penalty for using the DFT over the FFT and it can even increase the speed of image reconstruction when the ranges of interest are fewer than the total span that is calculated in the FFT.

Millimeter-wave imaging, microwave imaging, shoe s↗

DOE OSTI2025

Sparse measurement medical CT reconstruction using multi-fused block matching denoising priors

A major challenge for medical X-ray CT imaging is reducing the number of X-ray projections to lower radiation dosage and reduce scan times without compromising image quality. However these under-determined inverse imaging problems rely on the formulation of an expressive prior model to constrain the solution space while remaining computationally tractable. Traditional analytical reconstruction methods like Filtered Back Projection (FBP) often fail with sparse measurements, producing artifacts due to their reliance on the Shannon-Nyquist Sampling Theorem. Consensus Equilibrium, which is a generalization of Plug and Play, is a recent advancement in Model-Based Iterative Reconstruction (MBIR), has facilitated the use of multiple denoisers are prior models in an optimization free framework to capture complex, non-linear prior information. However, 3D prior modelling in a Plug and Play approach for volumetric image reconstruction requires long processing time due to high computing requirement. Instead of directly using a 3D prior, this work proposes a BM3D Multi Slice Fusion (BM3D-MSF) prior that uses multiple 2D image denoisers fused to act as a fully 3D prior model in Plug and Play reconstruction approach. Our approach does not require training and are thus able to circumvent ethical issues related with patient training data and are readily deployable in varying noise and measurement sparsity levels. In addition, reconstruction with the BM3D-MSF prior achieves similar reconstruction image quality as fully 3D image priors, but with significantly reduced computational complexity. We test our method on clinical CT data and demonstrate that our approach improves reconstructed image quality.

Hossain, Maliha [ORNL]↗

DOE OSTI2022

Anomalous And Normal High Performance Computing Datacenter Activities

This code provides annotation and an interface to 10+ hours of video activities in a high performance datacenter with 20+ different types of anomalous activities. The purpose is to enable machine learning for video surveillance systems in high performance computing centers. This is the first code of this type addressing the space of high performance computing datacenters.

Anderson, Matthew↗

DOE OSTI2022

On-the-fly response function generation method for composite coarse mesh

The hybrid stochastic deterministic transport code COMET, based on the incident response expansion theory, is used to model reactor cores with high fidelity and formidable computational speed. COMET models a reactor core using a library of incident flux response expansion coefficients that are pre computed for all the unique lattice cells (e.g., fuel assemblies, reflector blocks, etc.) in the core. In order to further improve its computational efficiency in pre-calculating the response library a new response function generation method is developed to compute the response functions for the composite coarse meshes made of a smaller set of unique lattices on the fly within the COMET's deterministic transport core sweep. The efficiency is achieved by eliminating a number of unique lattices that can be made up from the reduced set of unique meshes on the fly. The numerical process consists of the following steps. First, the boundary condition on composite coarse mesh boundaries is projected onto the expansion basis to compute the incident flux moments on external surfaces of all the basic (reduced set of unique) coarse meshes. Secondly, the deterministic sweeping solver in COMET is used to converge on the outgoing/incoming flux expansion moments crossing interfaces between the basic coarse meshes. Thirdly, the response functions for the composite coarse meshes are constructed as a superposition on the fly. The new response function generation method was tested on 88 composite coarse meshes consisting of CANDU fuel bundles and moderator blocks. It was found that response functions generated by the new method agree very well with those generated by direct Monte Carlo calculations. The average and maximum relative differences in the surface-to-surface response coefficients computed by the two methods are 0.10% and 0.20%, respectively. Similarly, the average and maximum relative differences in the response fission densities are 0.13% and 0.43%, respectively. These discrepancies are within one standard deviation of the stochastic uncertainties. The new method is five times faster than the original direct Monte Carlo method. The size of the response function library for the new method is five times smaller than that for the original method, leading to significantly less requirement for the computer hard drive space and memory. (authors)

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗

DOE OSTI2021

Navigator function for the conformal bootstrap

Current numerical conformal bootstrap techniques carve out islands in theory space by repeatedly checking whether points are allowed or excluded. We propose a new method for searching theory space that replaces the binary information "allowed"/"excluded" with a continuous "navigator" function that is negative in the allowed region and positive in the excluded region. Such a navigator function allows one to efficiently explore high-dimensional parameter spaces and smoothly sail towards any islands they may contain. The specific functions we introduce have several attractive features: they are well-defined in large regions of parameter space, can be computed with standard methods, and evaluation of their gradient is immediate due to an SDP gradient formula that we provide. The latter property allows for the use of efficient quasi-Newton optimization methods, which we illustrate by navigating towards the 3d Ising island.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

DOE OSTI2025

An Image-Plane Approach to Gravitational Lens Modeling of Interferometric Data

Strong gravitational lensing acts as a cosmic telescope, enabling the study of the high-redshift universe. Astronomical interferometers, such as the Atacama Large Millimeter/submillimeter Array (ALMA), have provided high-resolution images of strongly lensed sources at millimeter and submillimeter wavelengths. To model the mass and light distributions of lensing and source galaxies from strongly lensed images, strong lens modeling for interferometric observations is conventionally performed in the visibility space, which is computationally expensive. In this paper, we implement an image-plane lens modeling methodology for interferometric dirty images by accounting for noise correlations. We show that the image-plane likelihood function produces accurate model values when tested on simulated ALMA observations with an ensemble of noise realizations. We also apply our technique to ALMA observations of two sources selected from the South Pole Telescope survey, comparing our results with previous visibility-based models. Our model results are consistent with previous models for both parametric and pixelated source-plane reconstructions. We implement this methodology for interferometric lens modeling in the open-source software package lenstronomy.

Zhang, Nan [Illinois U., Urbana (main)] (ORCID:000↗

DOE OSTI2024

A new framework for higher loop Witten diagrams

The differential representation is a novel formalism for studying boundary correlators in (d + 1)-dimensional anti-de Sitter space. In this letter, we generalize the differential representation beyond tree level using the notion of operator-valued integrals. We use the differential representation to compute three-point bubble and triangle Witten diagrams with external states of conformal dimension ∆ = d. We compare the former to a position space computation.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

DOE OSTI2024

DATA-DRIVEN DISCOVERY OF DYNAMICS FROM TIME-RESOLVED COHERENT SCATTERING

This software implements a data-driven framework to uncover mechanistic models of dynamics directly from time-resolved coherent X-ray scattering measurements. It employs neural differential equations to parameterize unknown real-space dynamics and incorporates a computational scattering forward model to relate real-space predictions to reciprocal-space observations.

Zhou, Tao↗

DOE OSTI2023

Quantum simulations in effective model spaces: Hamiltonian-learning variational quantum eigensolver using digital quantum computers and application to the Lipkin-Meshkov-Glick model

Quantum simulations offer the potential to predict the structure and dynamics of nuclear many-body systems that are beyond the capabilities of classical computing. Generally, preparing the ground state of strongly-interacting many-body systems relevant to nuclear physics is however inefficient, even using ideal quantum computers. In addition, currently available NISQ-era quantum devices possess modest numbers of qubits, limiting the size of quantum many-body systems that can be simulated. In this context, a reformulation of the quantum many-body problems using truncated model spaces and Hamiltonians is desirable to make them more amenable to near-term quantum computers. The importance of symmetries in low-energy theories, including effective field theories (EFTs), lattice quantum chromodynamics (QCD), and effective model spaces for nuclear systems, in particular their interplay with the reduction of active Hilbert spaces, is well known. Lesser known is the fact that the non-commutivity of some symmetries and truncations of the model space can be profitably combined with variational calculations to rearrange the entanglement into localized structures and enable more efficient simulations. Here, the goal of the present study is to explore and utilize the non-commutivity of symmetries and model-space truncations of quantum many-body systems important to nuclear physics, particularly in combination with variational algorithms for quantum simulations and effective Hamiltonian learning. We introduce an iterative hybrid classical-quantum algorithm, Hamiltonian learning variational quantum eigensolver (HL-VQE), that simultaneously optimizes an effective Hamiltonian, thereby rearranging entanglement into the effective model space, and the associated ground-state wavefunction. Quantum simulations, using classical computers and IBM's superconducting-qubit quantum computers, are performed to demonstrate the HL-VQE algorithm, in the context of the Lipkin-Meshkov-Glick (LMG) model of interacting fermions, where the Hamiltonian transformation corresponds to an orbital rotation. We use a mapping where the number of qubits scales with the $\log$ of the size of the effective model space, rather than the particle number. HL-VQE is found to provide an exponential improvement in LMG-model calculations of the ground-state energy and wavefunction, compared to naive truncations without Hamiltonian learning, throughout a significant fraction of the Hilbert space. In the context of EFT, this corresponds to counterterms scaling exponentially with the cut-off as opposed to power law. Implementations on IBM's QExperience quantum computers and simulators for 1- and 2-qubit effective model spaces are shown to provide accurate and precise results, reproducing classical predictions. For a range of parameters defining the LMG model, the HL-VQE algorithm is found to have better scaling of quantum resources requirements than previously explored algorithms. In particular, the HL-VQE scales efficiently over a large fraction of the model space, in contrast to VQE alone. This work constitutes a step in the development of entanglement-driven quantum algorithms for descriptions of nuclear many-body systems. This, in part, leverages the potential of noisy intermediate-scale quantum (NISQ) devices. The exponential scaling of counterterms observed in this study suggests the possibility of more general applicability to other non-perturbative EFTs.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

DOE OSTI2020

Koopman–von Neumann approach to quantum simulation of nonlinear classical dynamics

Quantum computers can be used to simulate nonlinear non-Hamiltonian classical dynamics on phase space by using the generalized Koopman–von Neumann formulation of classical mechanics. The Koopman–von Neumann formulation implies that the conservation of the probability distribution function on phase space, as expressed by the Liouville equation, can be recast as an equivalent Schrödinger equation on Hilbert space with a Hermitian Hamiltonian operator and a unitary propagator. This Schrödinger equation is linear in the momenta because it derives from a constrained Hamiltonian system with twice the classical phase-space dimension. A quantum computer with finite resources can be used to simulate a finite-dimensional approximation of this unitary evolution operator. Quantum simulation of classical dynamics is exponentially more efficient than a deterministic Eulerian discretization of the Liouville equation if the Koopman–von Neumann Hamiltonian is sparse. Utilizing quantum walk techniques for state preparation and amplitude estimation for the calculation of observables leads to a quadratic improvement over classical probabilistic Monte Carlo algorithms.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

DOE OSTI2020

Detailed space–time variations of the seismic response of the shallow crust to small earthquakes from analysis of dense array data

SUMMARY We compute high-resolution space–time variations of subsurface seismic properties from autocorrelation functions (ACF’s) of noise and local earthquakes, recorded by the Sage Brush Flat dense array deployed around the Clark branch of the San Jacinto fault. The resolved temporal changes are referred to as apparent velocity changes because they reflect both nonlinear response and variations of material properties such as cracking and damage. Apparent velocity changes are estimated at four frequency bands (10–15, 10–20, 15–30 and 20–40 Hz) for two local earthquake data sets. In one analysis, ACF’s from P- and S-wave windows of 31 small events with magnitudes below 3.1 are used to compute the apparent velocity variations with respect to the mean ACF of each phase, and we also use the mean ACF of noise data as reference to estimate the changes. In a further analysis, the temporal evolution of properties is computed using moving time windows in continuous waveform over one-hour long data with noise and earthquake signals. The apparent velocity changes and recovery times are frequency dependent and present a strong spatial variability across the array. The resolved changes are larger and recovery time shorter with data associated with higher frequencies. At frequencies larger than 15 Hz, and using the mean ACF of noise data as a reference, the apparent average velocity changes across the array during the passage of the P and S waves from the small local events are 2.5 per cent and 6 per cent, respectively. The apparent velocity changes decrease by one order of magnitude when the earthquake data are used as a reference. The relatively large changes in response to very low ground motion have important implications on nonlinear processes involving degradation and healing of the subsurface material during common earthquake shaking.

Geochemistry & Geophysics↗