SEARCH · Search NASA

Results for “sparse data set”

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 235 records · Page 13

All sources NASA NTRS DOE OSTI

DOE OSTI2025

Continuous surface-to-distributed acoustic sensor snapshots explain reactivation of individual natural fractures during an unconventional reservoir stimulation

ABSTRACT Fiber-optic sensing technologies allow petroleum engineering teams to detect hydraulic fracture interaction with boreholes during unconventional reservoir stimulation. In combination with high-repeatability seismic sources, the same distributed acoustic sensors (DASs) enable vertical seismic profiling (VSP) of the fracture evolution away from the boreholes. We discovered clear signatures of seismic scattering on activated fractures during nine days of continuous seismic monitoring of the fracturing stages at the Austin Chalk/Eagle Ford Field Laboratory. The present study applies a novel approach for quantitative analysis of the scattering events in terms of the evolution of the geometry and elastic stiffness of individual fractures. Our characterization strategy sequentially refines the fracture models: from a stack of 1D soft layers to 3D rectangular inclusions. First, we estimate the number of fracture locations and reflectivity using a modified sparse-spike deconvolution of the stacked VSP traces. The fracture set consists of five fractures spaced by 15–30 m with a reflectivity of approximately 1%. Then, we develop a scattering integral method to refine these estimates along with an inversion of the fracture top and bottom for each monitoring vintage. We find that, initially, some of the fractures are located above the monitoring fiber with the height of approximately 100 m. Then we integrate the seismic interpretation with the low-frequency DAS and pressure and microseismic monitoring to reconstruct the activation process of the fractures. Most likely, some of the natural fractures slowly grew downward to the monitoring fiber as a result of fluid injections in the stimulated well. This led to bright strain anomalies but did not trigger seismicity. The top of the fractures remained almost constant and were limited by a lithologic boundary/stress barrier. To our knowledge, this is the first time VSP data enabled tracking of the fracture evolution with such high spatial and temporal resolution, which was previously only available for crosswell surveys and at a much smaller scale.

Glubokovskikh, Stanislav↗

DOE OSTI2022

Exploring the Use of Novel Spatial Accelerators in Scientific Applications

Driven by the need to find alternative accelerators which can viably replace GPUs in next-generation Supercomputing systems, this paper proposes a methodology to enable agile application/hardware co-design. The application-first methodology provides the ability to come up with design of accelerators while working with real-world workloads, available accelerators, and system software. The iterative design process targets a set of kernels in a workload for performance estimates that can prune the design space for later phases of detailed architectural evaluations. To this effect, in this paper, a novel data-parallel device model is introduced that simulates the latency of performance-sensitive operations in an accelerator including data transfers and kernel computation using multi-core CPUs. The use of off-the-shelf simulators, such as pre-RTL simulator Aladdin or multiple tools available for exploring the design of deep neural network accelerators (e.g., Timeloop) is demonstrated for evaluation of various accelerator designs using applications with realistic inputs. Examples of multiple device configurations that are instantiable in a system are explored to evaluate the performance benefit of deploying novel accelerators. The proposed device is integrated with a programming model and system software to potentially explore the impacts of high-level programming languages/compilers and low-level effects such as task scheduling on multiple accelerators. We analyze our methodology for a set of applications that represent high-performance computing (HPC) and graph analytics. The applications include a computational chemistry kernel realized using tensor contractions, triangle counting, GraphSAGE and Breadth-first Search. These applications include kernels such as dense matrix-dense matrix multiplication, sparse matrix-spare matrix multiplication, and sparse matrix-dense vector multiplication. Our results indicate potential performance benefits and insights for system design by including accelerators that realize these kernels along-side general purpose accelerators.

AI, codesign, Accelerated Computing, Modeling and ↗

DOE OSTI2024

Extreme sparsification of physics-augmented neural networks for interpretable model discovery in mechanics

Data-driven constitutive modeling with neural networks has received increased interest in recent years due to its ability to easily incorporate physical and mechanistic constraints and to overcome the challenging and time-consuming task of formulating phenomenological constitutive laws that can accurately capture the observed material response. However, even though neural network-based constitutive laws have been shown to generalize proficiently, the generated representations are not easily interpretable due to their high number of trainable parameters. Sparse regression approaches exist that allow for obtaining interpretable expressions, but the user is tasked with creating a library of model forms which by construction limits their expressiveness to the functional forms provided in the libraries. Here, in this work, we propose to train regularized physics-augmented neural network-based constitutive models utilizing a smoothed version of $L^0$-regularization. This aims to maintain the trustworthiness inherited by the physical constraints, but also enables interpretability which has not been possible thus far on any type of machine learning-based constitutive model where model forms were not assumed a priori but were actually discovered. During the training process, the network simultaneously fits the training data and penalizes the number of active parameters, while also ensuring constitutive constraints such as thermodynamic consistency. We show that the method can reliably obtain interpretable and trustworthy constitutive models for compressible and incompressible hyperelasticity, yield functions, and hardening models for elastoplasticity, using synthetic and experimental data. This work aims to set a new paradigm for interpretable machine learning models in the broad area of solid mechanics where low and limited data is available along with prior knowledge of physical constraints that the learned maps need to obey. This paradigm can potentially be extended to a broader spectrum of scientific exploration.

Data-driven constitutive models↗

DOE OSTI2020

Long short-term memory embedded nudging schemes for nonlinear data assimilation of geophysical flows

Reduced rank nonlinear filters are increasingly utilized in data assimilation of geophysical flows, but often require a set of ensemble forward simulations to estimate forecast covariance. On the other hand, predictor-corrector type nudging approaches are still attractive due to their simplicity of implementation when more complex methods need to be avoided. However, optimal estimate of nudging gain matrix might be cumbersome. In this paper, we put forth a fully nonintrusive recurrent neural network approach based on a long short-term memory (LSTM) embedding architecture to estimate the nudging term, which plays a role not only to force the state trajectories to the observations but also acts as a stabilizer. Furthermore, our approach relies on the power of archival data and the trained model can be retrained effectively due to power of transfer learning in any neural network applications. In order to verify the feasibility of the proposed approach, we perform twin experiments using Lorenz 96 system. Our results demonstrate that the proposed LSTM nudging approach yields more accurate estimates than both extended Kalman filter (EKF) and ensemble Kalman filter (EnKF) when only sparse observations are available. With the availability of emerging AI-friendly and modular hardware technologies and heterogeneous computing platforms, we articulate that our simplistic nudging framework turns out to be computationally more efficient than either the EKF or EnKF approaches.

42 ENGINEERING↗

DOE OSTI2022

Probing eddy size and its effective mixing length in stably stratified roughness sublayer flows

Stably stratified roughness sublayer flows are ubiquitous yet remain difficult to represent in models and to interpret using field experiments. Here, continuous high-frequency potential temperature profiles from the forest floor up to 6.5 times the canopy height observed with distributed temperature sensing (DTS) are used to link eddy topology to roughness sublayer stability correction functions and coupling between air layers within and above the canopy. The experiments are conducted at two forest stands classified as hydrodynamically sparse and dense. Near-continuous profiles of eddy sizes (length scales) and effective mixing lengths for heat are derived from the observed profiles using a novel conditional sampling approach. The approach utilizes potential temperature isoline fluctuations from a statically stable background state. The transport of potential temperature by an observed eddy is assumed to be conserved (adiabatic movement) and we assume that irreversible heat exchange between the eddy and the surrounding background occurs along the (vertical) periphery of the eddy. This assumption is analogous to Prandtl's mixing-length concept, where momentum is transported rapidly vertically and then equilibrated with the local mean velocity gradient. A distinct dependence of the derived length scales on background stratification, height above ground, and canopy characteristics emerges from the observed profiles. Implications of these findings for (1) the failure of Monin–Obukhov similarity in the roughness sublayer and (2) above-canopy flow coupling to the forest floor are examined. The findings have practical applications in terms of analysing similar DTS data sets with the proposed approach, modelling roughness sublayer flows, and interpreting nocturnal eddy covariance measurements above tall forested canopies.

54 ENVIRONMENTAL SCIENCES↗

DOE OSTI2025

Dataset for "A Microfluidic Spore Chamber for Long-Term Imaging of Single-Spore Hyphal Development"

Understanding the life cycle of fungal spores is essential for elucidating their roles in pathogenesis, dispersal, and survival. However, studying spore development under controlled, spatially defined conditions remains challenging. Here, we present the Spore Chamber, a custom-built microfluidic platform engineered for parallel trapping and long-term imaging of individual spores under defined media conditions, enabling real-time visualization of hyphal development. Using Aspergillus fumigatus as a model organism, we demonstrate that sparse trapping of individual spores within size-matched trap geometries enables long-term time-lapse imaging of key developmental stages, including germination, polarized hyphal elongation, branching, and conidiophore formation. To assess the device’s capacity to resolve morphogenetic responses to exogenous signals, we introduced lipochitooligosaccharides (LCOs) and short-chain chitooligosaccharides (COs). Rhizobium-derived, non-sulfated LCO (nsLCO) mixtures induced enhanced secondary branching (hyperbranching), a response not previously reported in A. fumigatus under these signal conditions, to our knowledge, whereas sulfated LCOs and CO4 did not significantly alter branching patterns. In addition, long-term confinement and imaging revealed rare developmental morphologies previously described primarily in mutant strains, including split conidiophore formation, elongated phialides, microcyclic conidiation, and chlamydospore development. Together, these results establish the Spore Chamber as a targeted microfluidic platform for single-spore phenotyping and long-term developmental analysis, with applications in fungal biology, chemical signaling studies, and host–microbe interaction research. Videos of the observed phenomena are included in this data set.

59 BASIC BIOLOGICAL SCIENCES↗

DOE OSTI2026

Detector alignment for X-ray crystallography using Millepede-II

I describe a method for accurately refining the geometrical parameters of segmented X-ray area detectors on the basis of serial crystallography data, using 'Millepede' – an algorithm created for a very similar problem in high-energy physics. The Millepede method for serial crystallography builds on the approach of Brewster et al. [Acta Cryst. (2018), D74, 877–894], in which the detector parameters are refined simultaneously with the parameters for each individual crystal. This accounts for the mutual dependency between the parameters and thereby avoids the bias and slow convergence problems that have afflicted older approaches in which the deviations between observed and calculated Bragg peak positions were taken directly as the updates for the detector panel positions. The Millepede method uses the special structure of the least-squares normal equations to reduce them to a much smaller form that can be solved very quickly, even compared with the sparse matrix methods used previously. This makes it practical to refine the detector geometry frequently and thereby maintain accurate calibration without specialized alignment campaigns. Tilts of detector panels out of the plane can be reliably refined, as can the overall distance of the detector in the beam direction. With a simulated test case, the new method produced panel shifts within 7% of the correct values with only one iteration, and produced almost exactly correct shifts after a second iteration. A simulated out-of-plane panel rotation was correctly determined to within 0.001°. Applied to experimental data from an X-ray free-electron laser, the method increased the indexable fraction of frames from 30% to 91% in a single iteration, and to 96% after two further iterations. Computing the geometry updates on the basis of 2060 crystals took only 0.819 s on desktop computing hardware, including the time taken to read the required data from disk. The scaling was found to be very close to linear for up to 100 980 sets of crystal parameters, which took only 78.2 s to process under the same conditions. The method has been applied as part of a real-time feedback system at a synchrotron radiation beamline, in which an out-of-plane detector tilt of 0.04° was detected and corrected. Possible further applications are also described here.

Millepede-II↗

DOE OSTI2023

Sparse regression for plasma physics

Many scientific problems can be formulated as sparse regression, i.e., regression onto a set of parameters when there is a desire or expectation that some of the parameters are exactly zero or do not substantially contribute. This includes many problems in signal and image processing, system identification, optimization, and parameter estimation methods such as Gaussian process regression. Sparsity facilitates exploring high-dimensional spaces while finding parsimonious and interpretable solutions. In the present work, we illustrate some of the important ways in which sparse regression appears in plasma physics and point out recent contributions and remaining challenges to solving these problems in this field. Further, a brief review is provided for the optimization problem and the state-of-the-art solvers, especially for constrained and high-dimensional sparse regression.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

DOE OSTI2020

Scalable line and plane relaxation in a parallel structured multigrid solver

The efficient solution of sparse, linear systems that arise through the discretization of partial differential equations remains a key challenge for a range of high performance scientific simulations. One approach for reducing data movement and improving performance is by exposing and exploiting structure in a problem through the use of robust structured multilevel solvers. By choosing coarsening that preserves the structure of the problem, these methods maintain efficient structured computation and communication throughout the multigrid hierarchy. However, when coarsening is not permitted to be dependent on the operator, anisotropy must be addressed by the smoother — producing error compatible for coarse-grid correction with structured coarsening. Here, the components required in a scalable parallel structured solver are described with a focus on memory and communication efficiency of robust smoothers. While the implementation of communication and memory reduction techniques in smoothers integrated in a complete 3D solver present a significant engineering challenge, a novel approach is proposed that addresses these challenges systematically through a change to the solver’s execution model. Enabled by user-level threading paired with a set of data and communication abstractions, this approach permits seamless aggregation of communication in plane smoothers — directly reusing code for a 2D distributed multilevel cycle. Results show an effective reduction in communication costs for coarse-grid problems, and result in a speedup of 8.7x in smoothing routines shown in Fig. 12 using this approach. This produces a significant improvement to strong scalability while maintaining favorable weak scaling behavior. Finally, a parallel scaling study using a series of refined meshes is included that demonstrates the effectiveness of this approach in an application of interest.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2025

The imprint of cosmic voids from the DESI Legacy Survey DR9 Luminous Red Galaxies in the Planck 2018 lensing map through spectroscopically calibrated mocks

The cross-correlation of cosmic voids with the lensing convergence (κ) map of the Cosmic Microwave Background (CMB) fluctuations provides a powerful tool to refine our understanding of the current cosmological model. However, several studies have reported a moderate tension (up to ∼2σ) between the lensing imprint of cosmic voids on the observed CMB and the ΛCDM signal predicted by simulations. To address this “lensing-is-low” tension and to obtain new, precise measurements of the signal, we exploit the large DESI Legacy Survey Luminous Red Galaxy (LRG) data set, covering approximately 19 500 deg 2 of the sky and including about 10 million LRGs at z < 1.05. Our ΛCDM template was created using the Buzzard mocks, which we specifically calibrated to match the clustering properties of the observed galaxy sample by exploiting more than one million DESI spectra. We identified our catalogs of 3D voids in the range 0.35 < z < 0.95 and cross-correlated them through a stacking methodology, dividing the sample into bins according to the redshift and λv values of the voids. For the full void sample, we report a 14σ detection of the lensing signal, with A κ = 1.016 ± 0.054, which increases to 17σ when considering the void-in-void (A κ = 0.944 ± 0.064) and the void-in-cloud (A κ = 0.975 ± 0.060) populations individually, the highest detection significance for studies of this kind. We observe a full agreement between observations and ΛCDM mocks across all redshift bins, sky regions, and void populations considered. In addition to these findings, our analysis highlights the importance of accurately matching sparseness and redshift error distributions between mocks and observations, as well as the role of λ v in enhancing the signal-to-noise ratio through void population discrimination.

79 ASTRONOMY AND ASTROPHYSICS↗

DOE OSTI2022

Source scaling comparison and validation in Central Italy: data intensive direct S waves versus the sparse data coda envelope methodology

SUMMARY Robustness of source parameter estimates is a fundamental issue in understanding the relationships between small and large events; however, it is difficult to assess how much of the variability of the source parameters can be attributed to the physical source characteristics or to the uncertainties of the methods and data used to estimate the values. In this study, we apply the coda method by Mayeda et al. using the coda calibration tool (CCT), a freely available Java-based code (https://github.com/LLNL/coda-calibration-tool) to obtain a regional calibration for Central Italy for estimating stable source parameters. We demonstrate the power of the coda technique in this region and show that it provides the same robustness in source parameter estimation as a data-driven methodology [generalized inversion technique (GIT)], but with much fewer calibration events and stations. The Central Italy region is ideal for both GIT and coda approaches as it is characterized by high-quality data, including recent well-recorded seismic sequences such as L'Aquila (2009) and Amatrice–Norcia–Visso (2016–2017). This allows us to apply data-driven methods such as GIT and coda-based methods that require few, but high-quality data. The data set for GIT analysis includes ∼5000 earthquakes and more than 600 stations, while for coda analysis we used a small subset of 39 events spanning 3.5 < Mw < 6.33 and 14 well-distributed broad-band stations. For the common calibration events, as well as an additional 247 events (∼1.7 < Mw < ∼5.0) not used in either calibration, we find excellent agreement between GIT-derived and CCT-derived source spectra. This confirms the ability of the coda approach to obtain stable source parameters even with few calibration events and stations. Even reducing the coda calibration data set by 75 per cent, we found no appreciable degradation in performance. This validation of the coda calibration approach over a broad range of event size demonstrates that this procedure, once extended to other regions, represents a powerful tool for future routine applications to homogeneously evaluate robust source parameters on a national scale. Furthermore, the coda calibration procedure can homogenize the Mw estimates for small and large events without the necessity of introducing any conversion scale between narrow-band measures such as local magnitude (ML) and Mw, which has been shown to introduce significant bias.

Morasca, Paola (ORCID:0000000265254867)↗

DOE OSTI2023

Joint Inversion of Surface Electrical Resistivity Tomography and Seismic Refraction Data between the 200 Areas

Geologic stratigraphy on the Hanford Site influences groundwater and contaminant migration through the aquifer system and the vadose zone. The current geologic framework model (GFM) relies heavily on a sparse distribution of borehole data in some locations to map geologic contacts and hydrologic properties in the subsurface. Non-invasive geophysical methods such as electrical resistivity tomography (ERT), transient electromagnetic surveying, and seismic imaging are being used at Hanford to map subsurface structure in areas with limited well observations. This is to develop and mature the capability of geophysical methods to aid in GFM refinement, to identify regions of subsurface complexity, and for optimal well siting. A joint inversion of co-located seismic refraction and ERT data was carried out for data collected on a ~2.3-km profile between the 200 Areas on the Hanford Site. While ERT and seismic refraction images have sensitivity to overlapping physical properties (porosity, moisture content, lithology), the resolution and physics used to acquire each of these datasets are different and therefore information can be different or mutually complementary. Performing a joint inversion provides a reasonable option for a coherent, coupled interpretation for mutually complementary datasets. Between the 200 Areas, there are few boreholes to interpret the geologic framework model, and these data sets were obtained to provide a first line of evidence toward identifying stratigraphic structure. The seismic refraction and ERT data were independently inverted during fiscal year 2022 and broadly showed a two-layer structure with a trough-like feature that is ~1 km wide and upwards of 150 m deep. The depth of the trough feature was greater in the ERT image compared to the seismic image, which indicated a maximum depth of approximately 110 m. The objective of the joint inversion described in this report was to invert the seismic refraction and ERT data together while constraining the ERT image to be structurally similar to the seismic refraction image. The approach was applied using the geophysical inverse modeling program E4D, which has the capability to invert first-arrival times from seismic refraction data and ERT resistances using a “cross-gradient” constraint. The application of cross-gradient constraints with different weights produces ERT models that show a high degree of similarity within the upper 100 m (above ~120 m elevation). None of the ERT models show an improved structural similarity to the seismic result; therefore, it is recommended that further attempts to jointly interpret these models focus on petrophysics and image resolution. Petrophysical measurements of core samples would improve knowledge of what drives the ERT response in this region and, along with downhole geophysical measurements, could be used to “ground truth” the surface-based geophysical results. Image resolution studies would provide insight into which regions of the inverted images are reliable and which regions are poorly constrained.

58 GEOSCIENCES↗

DOE OSTI2022

Scaled Vecchia Approximation for Fast Computer-Model Emulation

Many scientific phenomena are studied using computer experiments consisting of multiple runs of a computer model while varying the input settings. Gaussian processes (GPs) are a popular tool for the analysis of computer experiments, enabling interpolation between input settings, but direct GP inference is computationally infeasible for large datasets. We adapt and extend a powerful class of GP methods from spatial statistics to enable the scalable analysis and emulation of large computer experiments. Specifically, we apply Vecchia’s ordered conditional approximation in a transformed input space, with each input scaled according to how strongly it relates to the computer-model response. The scaling is learned from the data by estimating parameters in the GP covariance function using Fisher scoring. Our methods are highly scalable, enabling estimation, joint prediction, and simulation in near-linear time in the number of model runs. In several numerical examples, our approach substantially outperformed existing methods.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2023

Implementing and Benchmarking the Locally Competitive Algorithm on the Loihi 2 Neuromorphic Processor

Neuromorphic processors have garnered considerable interest in recent years for their potential in enabling energy-efficient and high-speed computing. The Locally Competative Algorithm (LCA) has been utilized for power efficient sparse coding on neuromophic processors, including the first Loihi processor \cite{appletospikes, loihi1}. With the Loihi 2 processor enabling custom neuron models and graded spike communication, more complex implementations of LCA are possible \cite{loihi2}. We present a new implementation of LCA designed for the Loihi 2 processor and perform an initial set of benchmarks comparing it to LCA on CPU and GPU devices. In these experiments LCA on Loihi 2 is faster and orders of magnitude more efficient, while maintaining similar reconstruction quality. We find this performance improvement increases as the LCA parameters are tuned towards greater representation sparsity. Our study highlights the potential of neuromorphic processors, particularly Loihi 2, in enabling intelligent,autonomous, real-time processing on small robots, satellite where there are strict SWaP (small, lightweighr, and low-power) requirement. By demonstrating the superior performance of LCA on Loihi 2 compared to conventional computing device, our study suggests that Loihi 2 could be a valuable tool in advancing these types of applications. Overall, our study highlights the potential of neuromorphic processors for efficient and accurate data processing on resource-constrained devices.

Parpart, Gavin G.↗

DOE OSTI2020

Sparse Matrix-Based HPC Tomography

Tomographic imaging has benefited from advances in X-ray sources, detectors and optics to enable novel observations in science, engineering and medicine. These advances have come with a dramatic increase of input data in the form of faster frame rates, larger fields of view or higher resolution, so high performance solutions are currently widely used for analysis. Tomographic instruments can vary significantly from one to another, including the hardware employed for reconstruction: from single CPU workstations to large scale hybrid CPU/GPU supercomputers. Furthermore, flexibility on the software interfaces and reconstruction engines are also highly valued to allow for easy development and prototyping. This paper presents a novel software framework for tomographic analysis that tackles all aforementioned requirements. The proposed solution capitalizes on the increased performance of sparse matrix-vector multiplication and exploits multi-CPU and GPU reconstruction over MPI. Furthermore, the solution is implemented in Python and relies on CuPy for fast GPU operators and CUDA kernel integration, and on SciPy for CPU sparse matrix computation. As opposed to previous tomography solutions that are tailor-made for specific use cases or hardware, the proposed software is designed to provide flexible, portable and high-performance operators that can be used for continuous integration at different production environments, but also for prototyping new experimental settings or for algorithmic development. The experimental results demonstrate how our implementation can even outperform state-of-the-art software packages used at advanced X-ray sources worldwide.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2020

LA17-V-InverseRadTransportProblem-PD2Kb. Final Project Report

In the inverse radiation transport problem, a radiation signal emanating from an unknown object is used to reconstruct geometric and material parameters of the object , e.g., the mass of special nuclear material (SNM), the isotopic composition of the SNM (e.g., the enrichment of 235U), the thickness of shielding, etc. The inverse radiation transport problem is one of the most fundamental and important in the emergency response mission, and has been addressed in previous NA-22 and NA-42/84 investments by using derivative-free optimization methods. Our project was aimed at (i) consolidating previous work by applying polynomial chaos expansion (PCE) for reducing significantly the number of forward model simulations required by derivative-free optimization methods; (ii) developing a general-purpose framework and stand-alone software for solving the inverse radiation transport problem by applying a new “predictive modeling” methodology (predictive modeling of coupled multi-physics systems, PM_CMPS) which enables the fusing of experimental and computational information; and (iii) developing several benchmarks (for unscattered gamma rays) for demonstrating the quantification of non-Gaussian features (e.g., skewness and kurtosis, which characterize asymmetries and long tails) of response distributions by deterministically and efficiently propagating parameter uncertainties (covariances and higher-order moments, where available) using high-order sensitivities computed by the recently developed comprehensive adjoint sensitivity analysis methodology (C-ASAM). With regard to (i), application of PCE, the most significant accomplishment of this project was an implementation of PCE into INVERSE that significantly reduced computation time for the DiffeRential Evolution Adaptive Metropolis (DREAM) and Differential Evolution (DE) methods. For inverse transport problems with measurements of neutron leakage, neutron multiplication, and neutron-induced gamma-rays, the solution times for the DREAM and DE methods were reduced by factors of 30-300, reducing run times from hours to minutes while maintaining the same accuracy as the standard (non-PCE) DREAM and DE. Speedups were further improved by exploring sparse grid quadrature sets using the Toolkit for Adaptive Stochastic Modeling and Non-Intrusive ApproximatioN (Tasmanian) toolset. An initial exploration of sparse grids indicated that further speedups factors of 5-10 are obtainable. The implementation of PCE in INVERSE is not in a form that users can easily access. With regard to (ii), solving the inverse problem using a predictive modeling paradigm, the most significant accomplishment of this project were the derivation and implementation of adjoint-based second derivatives in neutron and photon transport theory. There are two codes that compute these derivatives. SENSPG computes them for uncollided gamma rays and SENSMG computes them for neutron leakage. SENSMG is open-source code available on github. Other significant accomplishments included a stand-alone code, MULTI-PRED, that implements the predictive modeling paradigm, along with a detailed manual. The code was implemented in the existing INVERSE code for inverse problems, but a head-to-head comparison of inverse methods was not achieved. We also derived and implemented the capability to compute sensitivities for multiplicity measurements into the SENSMG code, and this capability was used in a data assimilation application, but it was not used for solving inverse problems. With regard to (iii), developing benchmarks to demonstrate the importance of high-order sensitivity and uncertainty analysis, the most significant accomplishment of this project were two test problems that showed how important second-order sensitivities are.

07 ISOTOPE AND RADIATION SOURCES↗

DOE OSTI2022

Volumetric Rendering on Wavelet-Based Adaptive Grid

Numerical modeling of physical phenomena frequently involves processes across a wide range of spatial and temporal scales. In the last two decades, the advancements in wavelet-based numerical methodologies to solve partial differential equations, combined with the unique properties of wavelet analysis to resolve localized structures of the solution on dynamically adaptive computational meshes, make it feasible to perform large-scale numerical simulations of a variety of physical systems on a dynamically adaptive computational mesh that changes both in space and time. Volumetric visualization of the solution is an essential part of scientific computing, yet the existing volumetric visualization techniques do not take full advantage of multi-resolution wavelet analysis and are not fully tailored for visualization of a compressed solution on the wavelet-based adaptive computational mesh. Our objective is to explore the alternatives for the visualization of time-dependent data on space-time varying adaptive mesh using volume rendering while capitalizing on the available sparse data representation. Two alternative formulations are explored. The first one is based on volumetric ray casting of multi-scale datasets in wavelet space. Rather than working with the wavelets at the finest possible resolution, a partial inverse wavelet transform is performed as a preprocessing step to obtain scaling functions on a uniform grid at a user-prescribed resolution. As a result, a solution in physical space is represented by a superposition of scaling functions on a coarse regular grid and wavelets on an adaptive mesh. An efficient and accurate ray casting algorithm is based just on these coarse scaling functions. Additional details are added during the ray tracing by taking an appropriate number of wavelets into account based on support overlap with the interpolation point, wavelet coefficient magnitude, and other characteristics, such as opacity accumulation (front to back ordering) and deviation from frontal viewing direction. The second approach is based on complementing of wavelet-based adaptive mesh to the traditional Adaptive Mesh Refinement (AMR) mesh. Both algorithms are illustrated and compared to the existing volume visualization software for Rayleigh-Benard thermal convection and electron density data sets in terms of rendering time and visual quality for different data compression of both wavelet-based and AMR adaptive meshes.

Vezolainen, Alexei V.↗

DOE OSTI2024

AEPF: Attention-Enabled Point Fusion for 3D Object Detection

Current state-of-the-art (SOTA) LiDAR-only detectors perform well for 3D object detection tasks, but point cloud data are typically sparse and lacks semantic information. Detailed semantic information obtained from camera images can be added with existing LiDAR-based detectors to create a robust 3D detection pipeline. With two different data types, a major challenge in developing multi-modal sensor fusion networks is to achieve effective data fusion while managing computational resources. With separate 2D and 3D feature extraction backbones, feature fusion can become more challenging as these modes generate different gradients, leading to gradient conflicts and suboptimal convergence during network optimization. To this end, we propose a 3D object detection method, Attention-Enabled Point Fusion (AEPF). AEPF uses images and voxelized point cloud data as inputs and estimates the 3D bounding boxes of object locations as outputs. An attention mechanism is introduced to an existing feature fusion strategy to improve 3D detection accuracy and two variants are proposed. These two variants, AEPF-Small and AEPF-Large, address different needs. AEPF-Small, with a lightweight attention module and fewer parameters, offers fast inference. AEPF-Large, with a more complex attention module and increased parameters, provides higher accuracy than baseline models. Experimental results on the KITTI validation set show that AEPF-Small maintains SOTA 3D detection accuracy while inferencing at higher speeds. AEPF-Large achieves mean average precision scores of 91.13, 79.06, and 76.15 for the car class’s easy, medium, and hard targets, respectively, in the KITTI validation set. Results from ablation experiments are also presented to support the choice of model architecture.

Chemistry↗