SEARCH · Engineering Papers

Results for “sparse”

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 667 records · Page 37

All sources NASA NTRS DOE OSTI

DOE OSTI2022

The cosine-sine decomposition with different-orbitals-for-different-spins determinants

We report the spin decomposition of a spin-contaminated different-orbitals-for-different-spins (DODS) wave function is formulated in terms of the Krylov space of the $\hat{S}^2$ ||operator. The number of determinants that contribute to the various projected spin eigenfunctions vertical | $\psi ; S, M \rangle$ depends on the sparsity of the orbital overlap matrix X between the α and β spatial orbitals. The cosine-sine decomposition (CSD) procedure may be applied to this overlap matrix, and the resulting redundant orbital transformations may be applied to the α and β spatial orbitals. This produces a sparse X' matrix in the transformed basis in which each row or column has either one or two nonzero elements. This sparse X' matrix simplifies the spin-decomposition procedure in three ways:1) it reduces the number of contributing determinants within the Krylov basis functions and within the projected spin functions, 2) it reduces the effective orbital dimension through elimination of the frozen core and frozen virtual orbitals, and 3) it simplifies the spin-decomposition procedure in both the original and transformed bases by limiting the Krylov space dimension. These simplifications all reduce the computational effort for the spin-decomposition process. This procedure is implemented within a string-based DODS determinant formulation and applied to spin projection of unrestricted Hartree-Fock determinants.

unrestricted Hartree-Fock↗

DOE OSTI2025

Development and Demonstration of a Prototype Molten Salt Sampling System

Molten salt reactors (MSRs) offer potential operability and safety advantages when compared to commercial light water reactors (LWRs). However, operating experience with MSRs is sparse in comparison to what exists for LWRs. Further, the chemical and isotopic composition of the fuel and/or coolant salt is dynamic and difficult to characterize continuously, posing potential safety, operability, and safeguards unknowns that need to be addressed. A molten salt sampling system (MSSS) is regarded as a necessary subsystem within first generation MSRs used to obtain samples of salt for chemical and isotopic analysis in support of the need to monitor and control salt composition during operation. The MSSS is being developed using the Safety-in-Design (SiD) methodology, which incorporates incremental integration of safety analysis into the design process. The MSSS conceptual design emerging from the application of the early stages of the SiD methodology consists of a sample collection system and its housing, a freeze port, and inert gas control and delivery systems. This article describes the prototypes developed to test the functions of these MSSS subsystems, presents the results of testing in both dry and molten salt environments (including reliability data collection performed in accordance with the principles of SiD and the development of a semiquantitative fault tree model), and summarizes the opportunities for future design and testing enhancements based on the results of prototype testing.

molten salt reactor↗

DOE OSTI2020

Development of an MEMS ultrasonic microphone array system and its application to compressed wavefield imaging of concrete

Abstract Although contactless ultrasonic wavefield imaging shows potential for effective nondestructive inspection of various engineering materials, it has been rarely applied to concrete materials owing to technical challenges including low signal-to-noise ratio (SNR) caused by inherent heterogeneity of concrete. This paper presents development of a multi-channel MEMS ultrasonic microphone array system and its application to compressed wavefield imaging of concrete materials. The developed multi-channel MEMS ultrasonic microphone array system contains eight MEMS ultrasonic microphone elements and a signal conditioning circuit that enables measurements of ultrasonic signals with high SNR. A compressed sensing approach, based on the multiple measurement vector (MMV) concept, is applied to reconstruct a full dense ultrasonic wavefield data from sparsely sampled ultrasonic wavefield data. Experiments are carried out on a laboratory concrete sample to verify the performance of the developed MEMS microphone array system and proposed compressed sensing approach and then large-scale concrete samples to demonstrate practical application. The experimental results demonstrate that the developed MEMS microphone array system provides high-quality (SNR > 20 dB) ultrasonic data collected from concrete elements; furthermore, the proposed compressed sensing approach provides accurate reconstruction of dense wavefield data, as determined by peak signal-to-noise ratio (PSNR), from sparsely measured wavefield data with compression ratios up to 85% and PSNR above 25 dB in data collected form realistic large-scale concrete samples. By combining the MEMS array system and compressed sensing approach, the total ultrasonic data acquisition time needed to produce dense wavefield data can be significantly reduced.

Instruments & Instrumentation↗

DOE OSTI2023

Greedy permanent magnet optimization

Abstract A number of scientific fields rely on placing permanent magnets in order to produce a desired magnetic field. We have shown in recent work that the placement process can be formulated as sparse regression. However, binary, grid-aligned solutions are desired for realistic engineering designs. We now show that the binary permanent magnet problem can be formulated as a quadratic program with quadratic equality constraints, the binary, grid-aligned problem is equivalent to the quadratic knapsack problem with multiple knapsack constraints, and the single-orientation-only problem is equivalent to the unconstrained quadratic binary problem. We then provide a set of simple greedy algorithms for solving variants of permanent magnet optimization, and demonstrate their capabilities by designing magnets for stellarator plasmas. The algorithms can a-priori produce sparse, grid-aligned, binary solutions. Despite its simple design and greedy nature, we provide an algorithm that compares with or even outperforms the state-of-the-art algorithms while being substantially faster, more flexible, and easier to use.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

DOE OSTI2022

Cosmic ray muon clustering for the MicroBooNE liquid argon time projection chamber using sMask-RCNN

In this article, we describe a modified implementation of Mask Region-based Convolutional Neural Networks (Mask-RCNN) for cosmic ray muon clustering in a liquid argon TPC and applied to MicroBooNE neutrino data. Our implementation of this network, called sMask-RCNN, uses sparse submanifold convolutions to increase processing speed on sparse datasets, and is compared to the original dense version in several metrics. The networks are trained to use wire readout images from the MicroBooNE liquid argon time projection chamber as input and produce individually labeled particle interactions within the image. These outputs are identified as either cosmic ray muon or electron neutrino interactions. We find that sMask-RCNN has an average pixel clustering efficiency of 85.9% compared to the dense network's average pixel clustering efficiency of 89.1%. We demonstrate the ability of sMask-RCNN used in conjunction with MicroBooNE's state-of-the-art Wire-Cell cosmic tagger to veto events containing only cosmic ray muons. The addition of sMask-RCNN to the Wire-Cell cosmic tagger removes 70% of the remaining cosmic ray muon background events at the same electron neutrino event signal efficiency. Furthermore, this event veto can provide 99.7% rejection of cosmic ray-only background events while maintaining an electron neutrino event-level signal efficiency of 80.1%. In addition to cosmic ray muon identification, sMask-RCNN could be used to extract features and identify different particle interaction types in other 3D-tracking detectors.

47 OTHER INSTRUMENTATION↗

DOE OSTI2023

Recipes for when physics fails: recovering robust learning of physics informed neural networks

Abstract Physics-informed neural networks (PINNs) have been shown to be effective in solving partial differential equations by capturing the physics induced constraints as a part of the training loss function. This paper shows that a PINN can be sensitive to errors in training data and overfit itself in dynamically propagating these errors over the domain of the solution of the PDE. It also shows how physical regularizations based on continuity criteria and conservation laws fail to address this issue and rather introduce problems of their own causing the deep network to converge to a physics-obeying local minimum instead of the global minimum. We introduce Gaussian process (GP) based smoothing that recovers the performance of a PINN and promises a robust architecture against noise/errors in measurements. Additionally, we illustrate an inexpensive method of quantifying the evolution of uncertainty based on the variance estimation of GPs on boundary data. Robust PINN performance is also shown to be achievable by choice of sparse sets of inducing points based on sparsely induced GPs. We demonstrate the performance of our proposed methods and compare the results from existing benchmark models in literature for time-dependent Schrödinger and Burgers’ equations.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2020

Towards real-time monitoring: data assimilated time-lapse full waveform inversion for seismic velocity and uncertainty estimation

SUMMARY Rapid development of time-lapse seismic monitoring instrumentations has made it possible to collect dense time-lapse data for tomographically retrieving time-lapse (even continuous) images of subsurface changes. While traditional time-lapse full waveform inversion (TLFWI) algorithms are designed for sparse time-lapse surveys, they lack of effective temporal constraint on time-lapse data, and, more importantly, lack of the uncertainty estimation of the TLFWI results that is critical for further interpretation. Here, we propose a new data assimilation TLFWI method, using hierarchical matrix powered extended Kalman filter (HiEKF) to quantify the image uncertainty. Compared to existing Kalman filter algorithms, HiEKF allows to store and update a data-sparse representation of the cross-covariance matrices and propagate model errors without expensive operations involving covariance matrices. Hence, HiEKF is computationally efficient and applicable to 3-D TLFWI problems. Then, we reformulate TLFWI in the framework of HiEKF (termed hereafter as TLFWI-HiEKF) to predict time-lapse images of subsurface spatiotemporal velocity changes and simultaneously quantify the uncertainty of the inverted velocity changes over time. We demonstrate the validity and applicability of TLFWI–HiEKF with two realistic CO2 monitoring models derived from Frio-II and Cranfield CO2 injection sites, respectively. In both 2-D and 3-D examples, the inverted high-resolution time-lapse velocity results clearly reveal a continuous velocity reduction due to the injection of CO2. Moreover, the accuracy of the model is increasing over time by assimilating more time-lapse data while the standard deviation is decreasing over lapsed time. We expect TLFWI-HiEKF to be equipped with real-time seismic monitoring systems for continuously imaging the distribution of subsurface gas and fluids in the future large-scale CO2 sequestration experiments and reservoir management.

58 GEOSCIENCES↗

DOE OSTI2021

Phase-weighted slant stacking for surface wave dispersion measurement

SUMMARY Surface wave retrieval from ambient noise records using seismic interferometry techniques has been widely used for multiscale shear wave velocity (Vs) imaging. One key step during Vs imaging is the generation of dispersion spectra and the extraction of a reliable dispersion curve from the retrieved surface waves. However, the sparse array geometry usually affects the ability for high-frequency (>1 Hz) seismic signals’ acquisition. Dispersion measurements are degraded by array response due to sparse sampling and often present smeared dispersion spectra with sidelobe artefacts. Previous studies usually focus on interferograms’ domain (e.g. cross-correlation function) and attempt to enhance coherent signals before dispersion measurement. We propose an alternative technique to explicitly deblur dispersion spectra through use of a phase-weighted slant-stacking algorithm. Numerical examples demonstrate the strength of the proposed technique to attenuate array responses as well as incoherent noise. Three different field examples prove the flexibility and superiority of the proposed technique: the first data set consists of ambient noise records acquired using a nodal seismometer array; the second data set utilizes distributed acoustic sensing (DAS) and a marine fibre-optic cable to acquire a similar ambient noise data set; the last data set is a vibrator-based active-source surface wave data. The enhanced dispersion measurements provide cleaner and higher-resolution spectra without distortions which will assist both human interpreters as well as ML algorithms in efficiently picking curves for subsequent Vs inversion.

58 GEOSCIENCES↗

DOE OSTI2023

Reproduction drives changes in space use and habitat selection in a highly adaptable invasive mammal

Abstract For ungulates, it is not well understood how the interaction between habitat and reproduction affects movement behavior, space use, and habitat selection. We used known parturition (farrowing) data to validate First Passage Time (FPT) movement analysis to identify wild pig (Sus scrofa) parturition events from data collected with GPS collars. We examined home range and habitat selection during three physiologically distinct time periods in the reproductive cycle: late-gestation; farrowing; and neonate-care period. Sows exhibited a behavioral change 1-2 days prior to farrowing, suggesting FPT analysis can reliably identify parturition events for wide-ranging species that have a focused birthing area. Home range was smallest during the farrowing period, likely reflective of nest building, parturition, and protection of neonates. Home range size during the neonate-care period was intermediate between the late-gestation and farrowing periods, indicative of offspring care that may restrict maternal movement. Across all periods, sows avoided developed areas that have sparse canopy and ground cover and are associated with human activities. During late-gestation, sows avoided pine forests that have an open understory and less vegetative cover. During late-gestation and neonate-care, sows selected bottomland hardwood forests, habitat associated with ample food, cover, and water. During farrowing and neonate-care periods, sows selected upland hardwood forests, habitat with high quality food and cover for neonates. The physiological requirements of reproduction drive female habitat selection and spatial scale of movement patterns associated with parturition. Our study contributes to delineation of the appropriate scale at which to analyze movement data to provide insight about where individuals chose to place their home range, how much space to use, and how they use resources on the landscape to maximize reproductive success and fitness.

Zoology↗

DOE OSTI2024

The 3D Lyman- α forest power spectrum from eBOSS DR16

We measure the three-dimensional power spectrum (P3D) of the transmitted flux in the Lyman-α (Ly α) forest using the complete extended Baryon Oscillation Spectroscopic Survey data release 16 (eBOSS DR16). This sample consists of ~205 000 quasar spectra in the redshift range 2 ≤ z ≤ 4 at an effective redshift z = 2.334. We propose a pair-count spectral estimator in configuration space, weighting each pair by exp( i k ∙ r), for wave vector k and pixel pair separation r, effectively measuring the anisotropic power spectrum without the need for fast Fourier transforms. This accounts for the window matrix in a tractable way, avoiding artefacts found in Fourier-transform based power spectrum estimators due to the sparse sampling transverse to the line of sight of Ly α skewers. We extensively test our pipeline on two sets of mocks: (i) idealized Gaussian random fields with a sparse sampling of Ly α skewers, and (ii) log-normal LyaCoLoRe mocks including realistic noise levels, the eBOSS survey geometry and contaminants. On eBOSS DR16 data, the Kaiser formula with a non-linear correction term obtained from hydrodynamic simulations yields a good fit to the power spectrum data in the range $(0.02 ≤ k ≤ 0.35)$ h Mpc -1 at the 1–2σ level with a covariance matrix derived from LyaCoLoRe mocks. We demonstrate a promising new approach for full-shape cosmological analyses of Ly α forest data from cosmological surveys such as eBOSS, the currently observing Dark Energy Spectroscopic Instrument and future surveys such as the Prime Focus Spectrograph, WEAVE-QSO, and 4MOST.

79 ASTRONOMY AND ASTROPHYSICS↗

DOE OSTI2024

Maximum a posteriori Ly α estimator (MAPLE): band power and covariance estimation of the 3D Ly α forest power spectrum

We present a novel maximum a posteriori estimator to jointly estimate band powers and the covariance of the three-dimensional power spectrum (P3D) of Ly $\alpha$ forest flux fluctuations, called MAPLE. Our Wiener-filter based algorithm reconstructs a window-deconvolved P3D in the presence of complex survey geometries typical for Ly $\alpha$ surveys that are sparsely sampled transverse to and densely sampled along the line of sight. We demonstrate our method on idealized Gaussian random fields with two selection functions: (i) a sparse sampling of 30 background sources per square degree designed to emulate the current Dark Energy Spectroscopic Instrument; (ii) a dense sampling of 900 background sources per square degree emulating the upcoming Prime Focus Spectrograph Galaxy Evolution Survey. Our proof-of-principle shows promise, especially since the algorithm can be extended to marginalize jointly over nuisance parameters and contaminants, i.e. offsets introduced by continuum fitting. Our code is implemented in JAX and is publicly available on GitHub.

79 ASTRONOMY AND ASTROPHYSICS↗

DOE OSTI2020

Forward sensitivity approach for estimating eddy viscosity closures in nonlinear model reduction

In this paper, we propose a variational approach to estimate eddy viscosity using forward sensitivity method (FSM) for closure modeling in nonlinear reduced order models. FSM is a data assimilation technique that blends model's predictions with noisy observations to correct initial state and/or model parameters. We apply this approach on a projection based reduced order model (ROM) of the one-dimensional viscous Burgers equation with a square wave defining a moving shock, and the two-dimensional vorticity transport equation formulating a decay of Kraichnan turbulence. We investigate the capability of the approach to approximate an optimal value for eddy viscosity with different measurement configurations. Specifically, we show that our approach can sufficiently assimilate information either through full field or sparse noisy measurements to estimate eddy viscosity closure to cure standard Galerkin reduced order model (GROM) predictions. Therefore, our approach provides a modular framework to correct forecasting error from a sparse observational network on a latent space. We highlight that the proposed GROM-FSM framework is promising for emerging digital twin applications, where real-time sensor measurements can be used to update and optimize surrogate model's parameters.

42 ENGINEERING↗

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

Sparsity dependence of Krylov state complexity in the SYK model

We study the Krylov state complexity of the Sachdev-Ye-Kitaev (SYK) model for 𝑁 ≤28 Majorana fermions with 𝑞-body fermion interaction with 𝑞 =4, 6, 8 for a range of sparse parameter 𝑘 that controls the number of remaining terms in the original SYK model after sparsification. The critical value of 𝑘 below which the model ceases to be holographic, denoted 𝑘 𝑐 , has been subject of several recent investigations. Using Krylov complexity as a probe, we find that the peak value of complexity does not change as we increase 𝑘 beyond 𝑘 ≥ 𝑘 min at large temperatures. We argue that this behavior is related to the change in the holographic nature of the Hamiltonian in the sparse SYK-type models such that the model is holographic for all 𝑘 ≥ 𝑘 min ≈ 𝑘 𝑐 . Our results provide a novel way to determine 𝑘 𝑐 in SYK-type models.

gauge-gravity dualitites↗

DOE OSTI2024

DLSIA: Deep Learning for Scientific Image Analysis

DLSIA (Deep Learning for Scientific Image Analysis) is a Python-based machine learning library that empowers scientists and researchers across diverse scientific domains with a range of customizable convolutional neural network (CNN) architectures for a wide variety of tasks in image analysis to be used in downstream data processing. DLSIA features easy-to-use architectures, such as autoencoders, tunable U-Nets and parameter-lean mixed-scale dense networks (MSDNets). Additionally, this article introduces sparse mixed-scale networks (SMSNets), generated using random graphs, sparse connections and dilated convolutions connecting different length scales. For verification, several DLSIA-instantiated networks and training scripts are employed in multiple applications, including inpainting for X-ray scattering data using U-Nets and MSDNets, segmenting 3D fibers in X-ray tomographic reconstructions of concrete using an ensemble of SMSNets, and leveraging autoencoder latent spaces for data compression and clustering. As experimental data continue to grow in scale and complexity, DLSIA provides accessible CNN construction and abstracts CNN complexities, allowing scientists to tailor their machine learning approaches, accelerate discoveries, foster interdisciplinary collaboration and advance research in scientific image analysis.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2023

Fast Parallel Tensor Times Same Vector for Hypergraphs

Hypergraphs are a popular paradigm to rep- resent complex real-world networks exhibiting multi-way relationships of varying sizes. Mining centrality in hyper- graphs via symmetric adjacency tensors has only recently become computationally feasible for large and complex datasets. To enable scalable computation of these and related hypergraph analytics, here we focus on the Sparse Symmetric Tensor Times Same Vector (S3TTVC) oper- ation. We introduce the Compound Compressed Sparse Symmetric (CCSS) format, an extension of the compact CSS format for hypergraphs of varying hyperedge sizes and present a shared-memory parallel algorithm to compute S3TTVC. We experimentally show S3TTVC computation using the CCSS format achieves better performance than the naive baseline, and is subsequently more performant for hypergraph H-eigenvector centrality.

Shivakumar, Shruti↗

DOE OSTI2026

Cross-Modal Guidance for Fast Diffusion-Based Computed Tomography

Diffusion models have emerged as powerful priors for solving inverse problems in computed tomography (CT). In certain applications, such as neutron CT, it can be expensive to collect large amounts of measurements even for a single scan leading to sparse data sets from which it is challenging to obtain high quality reconstructions even with diffusion models. One strategy to mitigate this challenge is to leverage a complementary, easily available imaging modality; however, such approaches typically require retraining the diffusion model with large datasets. In this work, we propose incorporating an additional modality without retraining the diffusion prior, enabling accelerated imaging of costly modalities. We further examine the impact of imperfect side modalities on cross-modal guidance. Our method is evaluated on sparse-view neutron computed tomography, where reconstruction quality is substantially improved by incorporating X-ray computed tomography of the same samples.

Efimov, Timofey [ORNL] (ORCID:000900090098471X)↗

DOE OSTI2026

Regularizing INR with Diffusion Prior for Self-Supervised 3D Reconstruction OF Neutron Computed Tomography Data

Recently, generative diffusion priors have made huge strides as inverse problem solvers, including the ability to be adapted for inference on out-of-distribution data. Concurrently, implicit neural representations (INRs) have emerged as fast and lightweight inverse imaging solvers that are amenable to hybrid approaches that combine learned priors with traditional inverse problem formulations. In this paper, we present a diffusive computed tomography (CT) inversion framework for regularizing INRs called Diffusive INR (DINR), designed to enable high-quality reconstruction from sparse-view neutron CT. Pretrained purely on synthetic data, DINR is evaluated on simulated and experimentally obtained observations of concrete microstructures, where traditional reconstruction methods suffer substantial degradation when the number of views is reduced. Our approach delivers superior performance, reduces reconstruction artifacts, and achieves gains in PSNR and SSIM, enabling accurate micro-structural characterization even under extreme data limitations compared to state-of-the-art sparse-view reconstruction techniques.

Hossain, Maliha [ORNL]↗