Multi-level structural damage characterization using sparse acoustic sensor networks and knowledge transferred deep learning
Not Available
36 MATERIALS SCIENCE↗
SEARCH · Search NASA
Results for “sparse data”
Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.
Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.
Differentially Private Adaptive Noise Injection (DP-ANI) v1.0
Location data is collected from users continuously to understand their mobility patterns. Releasing the user trajectories may compromise user privacy. Therefore, the general practice is to release aggregated location datasets. However, private information may still be inferred from an aggregated version of location trajectories. Differential privacy (DP) protects the query output against inference attacks regardless of background knowledge. This software implements a differential privacy-based privacy model that protects the user's origins and destinations from being inferred from aggregated mobility datasets. This is achieved by injecting Planar Laplace noise to the user origin and destination GPS points. The noisy GPS points are then transformed into a link representation using a link-matching algorithm. Finally, the link trajectories form an aggregated mobility network. The injected noise level is selected using the Sparse Vector Mechanism. This DP selection mechanism considers the link density of the location and the functional category of the localized links. Compared to the different baseline models, including a k-anonymity method, our differential privacy-based aggregation model offers query responses that are close to the raw data in terms of aggregate statistics at both the network and trajectory-levels with maximum 9% deviation from the baseline in terms of network length.
Peisert, Sean [Lawrence Berkeley National Laborato↗
A dynamic likelihood approach to filtering transport processes: advection-diffusion dynamics
A Bayesian data assimilation scheme is formulated for advection-dominated advective and diffusive evolutionary problems, based upon the Dynamic Likelihood (DLF) approach to filtering. The DLF was developed specifically for hyperbolic problems –waves–, and in this paper, it is extended via a split step formulation, to handle advection-diffusion problems. In the dynamic likelihood approach, observations and their statistics are used to propagate probabilities along characteristics, evolving the likelihood in time. The estimate posterior thus inherits phase information. For advection-diffusion the advective part of the time evolution is handled on the basis of observations alone, while the diffusive part is informed through the model as well as observations. We expect, and indeed show here, that in advection-dominated problems, the DLF approach produces better estimates than other assimilation approaches, particularly when the observations are sparse and have low uncertainty. The added computational expense of the method is cubic in the total number of observations over time, which is on the same order of magnitude as a standard Kalman filter and can be mitigated by bounding the number of forward propagated observations, discarding the least informative data.
97 MATHEMATICS AND COMPUTING↗
ARCH: Large-scale knowledge graph via aggregated narrative codified health records analysis
Objective: Electronic health record (EHR) systems contain a wealth of clinical data stored as both codified data and free-text narrative notes (NLP). The complexity of EHR presents challenges in feature representation, information extraction, and uncertainty quantification. Here, to address these challenges, we proposed an efficient Aggregated naRrative Codified Health (ARCH) records analysis to generate a large-scale knowledge graph (KG) for a comprehensive set of EHR codified and narrative features. Methods: Using data from 12.5 million Veterans Affairs patients, ARCH first derives embedding vectors and generates similarities along with associated p-values to measure the strength of relatedness between clinical features with statistical certainty quantification. Next, ARCH performs a sparse embedding regression to remove indirect linkage between features to build a sparse KG. Finally, ARCH was validated on various clinical tasks, including detecting known relationships between entity pairs, predicting drug side effects, disease phenotyping, as well as sub-typing Alzheimer’s disease patients. Results: ARCH produces high-quality clinical embeddings and KG for over 60,000 codified and narrative EHR concepts. The KG and embeddings are visualized in the R-shiny powered web-API.3 ARCH achieved high accuracy in detecting EHR concept relationships, with AUCs of 0.926 (codified) and 0.861 (NLP) for similar EHR concepts, and 0.810 (codified) and 0.843 (NLP) for related pairs. It detected drug side effects with a 0.723 AUC, which improved to 0.826 after fine-tuning. Using both codified and NLP features, the detection power increased significantly. Compared to other methods, ARCH has superior accuracy and enhances weakly supervised phenotyping algorithms’ performance. Notably, it successfully categorized Alzheimer’s patients into two subgroups with varying mortality rates. Conclusion: The proposed ARCH algorithm generates large-scale high-quality semantic representations and knowledge graph for both codified and NLP EHR features, useful for a wide range of predictive modeling tasks.
Electronic health records↗
Irrigation Infrastructure and Modernization – Setting a Baseline: Estimates of Irrigation Water Conveyance Infrastructure Extents and Composition and the Potential Water, Energy, and Economic Benefits of Modernization in the Western U.S.
In the Western United States (U.S.), water delivery for irrigation is still largely managed using century-old equipment and designs. Modernization of this vital water conveyance infrastructure, such as piping of earthen canals, is known to improve water availability and water quality for farmers, while saving energy and enabling new hydropower. However, there is sparse information about the extent of irrigation water delivery infrastructure, which makes it challenging to estimate the cost of upgrades at scale and the potential benefits of accelerating modernization work. This report estimates a variety of previously unquantified data points related to irrigation water delivery infrastructure in the Western U.S. to support stakeholders interested in nationwide modernization planning. The findings should be considered approximations, useful for understanding the scale, range, or variability of these indicators. Taken together, the findings of this report illustrate some of the challenges and opportunities involved in modernizing the agricultural water delivery infrastructure in the Western U.S. Accelerating the pace of modernization could strengthen the long-term resilience of U.S. food systems while providing significant economic, energy, water, and environmental benefits.
13 HYDRO ENERGY↗
SBND Shower Reconstruction with SPINE
The Short-Baseline Near Detector (SBND) is a liquid argon time projection chamber (LArTPC) neutrino detector in the Short-Baseline Neutrino (SBN) program at Fermilab. SBND is designed to investigate the Low-Energy Excess (LEE), an unexplained excess of electron-like events observed by previous short-baseline neutrino experiments that may point to physics beyond the Standard Model. In LArTPC detectors, precise shower reconstruction is essential for distinguishing electrons from photons, a key requirement for testing possible explanations of the LEE and improving $\nu_e$ event selection. In this poster, the reconstruction studies using the Scalable Particle Imaging with Neural Embeddings (SPINE), a machine learning based reconstruction framework for particle imaging detectors will be presented. SPINE combines sparse convolutional neural networks (CNN) and graph neural networks (GNN) to enable detailed reconstruction and characterization of neutrino interactions in LArTPC detectors. Shower calorimetry and kinematic reconstruction are performed in dedicated post-processing stages. Strong agreement between data and Monte Carlo simulation will be demonstrated, indicating high-precision detector calibration and reconstruction performance. The agreement between reconstructed and true electron shower energy will also be discussed, emphasizing the robustness of the shower reconstruction performance. These results demonstrate the unprecedented precision achievable with SPINE in SBND, highlighting their potential for future high-resolution neutrino measurements.
Fan, Castaly [Florida U.; Fermilab] (ORCID:0000000↗
Machine Learning for DUNE Supernova Trigger
One of the major scientific goals of the Deep Underground Neutrino Experiment (DUNE) is to detect and measure the neutrino flux originating from galactic core-collapse supernovae. These neutrinos provide an opportunity to study the end of life evolution of massive stars, and reveal information about the structure of core-collapse that is not visible in observations of the electromagnetic spectrum. Because of the rarity of these events, it is crucial that DUNE is able to detect supernova neutrino interactions when they occur. However, this will require sifting through a large quantity of data, motivating the development of a trigger algorithm to identify significant events and discard irrelevant data. Machine learning provides a potential approach to building this trigger. This project generates ADC and ground truth images of simulated neutrino interactions in a LArTPC detector to be used for machine learning, and uses them to train a sparse Convolutional Neural Network (C NN). The performance of this model when applied to the task of pixel classification based on interaction type is examined. This project found that the sparse CNN approach has the potential to have high accuracy in pixel classification, meaning it may be highly relevant to the development of a supernova neutrino trigger for the DUNE far detector.
Damish, S.↗
Weak-Form Latent Space Dynamics Identification
This software showcases the enhanced capabilities of the Latent Space Dynamics Identification (LaSDI) algorithm through the application of the weak form, resulting in WLaSDI. WLaSDI first compresses the data, then projects it onto test functions, and subsequently learns the local latent space models. Notably, WLaSDI demonstrates significantly improved robustness to noise. Using weak-form equation learning techniques, WLaSDI achieves local latent space modeling. Compared to the standard sparse identification of nonlinear dynamics (SINDy) used in LaSDI, the variance reduction of the weak form ensures robust and precise latent space recovery, enabling fast, robust, and accurate simulations. We demonstrate the efficacy of WLaSDI against LaSDI using several common benchmark examples, including viscid and inviscid Burgers', radial advection, and heat conduction. For instance, in 1D inviscid Burgers' simulations with up to 100% Gaussian white noise, WLaSDI maintains relative errors consistently below 6%, whereas LaSDI errors can exceed 10,000%. Similarly, in radial advection simulations, WLaSDI keeps relative errors below 16%, compared to potential errors of up to 10,000% with LaSDI. Additionally, WLaSDI achieves significant speedups, such as a 140X speedup in 1D Burgers' simulations compared to the corresponding full order model.
Choi, Youngsoo↗
High-resolution modeling of indoor radon exposure with uncertainty quantification in Utah
Indoor radon accounts for 37% of population-level exposure to ionizing radiation in the United States. However, radon metrics are typically reported at coarse spatial scales, potentially obscuring meaningful local variation. We developed a high-resolution modeling framework to estimate indoor radon concentrations across Utah while explicitly quantifying predictive uncertainty. A total of 19,497 residential radon measurements collected between 2006 and 2017 were combined with environmental and housing characteristics and analyzed using a geospatial neural network that accommodates spatial dependence and nonlinear associations. Predictions were generated on a uniform hexagonal grid at 0.73 km2 resolution (H3 level 8). Out-of-sample predictions aggregated to the H3 level 8 grid showed good agreement with observed concentrations (Pearson r=0.64), while household-level predictions exhibited more moderate agreement (r=0.45). The model produced well-calibrated uncertainty estimates, with 24.1% of held-out observations exceeding the predicted 75th-percentile threshold. Maps of predicted radon concentrations and the probability of exceeding the U.S. EPA action level of 148 Bq/m3 (4 pCi/L) revealed substantial fine-scale spatial heterogeneity that was not apparent in conventional coarse-resolution summaries, with greater local variability observed in densely monitored urban counties than in sparsely sampled regions. High-resolution radon models that explicitly quantify uncertainty provide a useful framework for characterizing the spatial distribution of indoor radon and identifying areas of elevated exceedance risk. These findings highlight the value of fine-scale monitoring data and uncertainty-aware modeling approaches for radon exposure assessment, environmental risk characterization, and radon-related health research.
Wu, Yunhan [ORNL] (ORCID:0000000178842994)↗
ChatMPI: LLM-Driven MPI Code Generation for HPC Workloads
The Message Passing Interface (MPI) standard plays a crucial role in enabling scientific applications for parallel computing and is an essential component in high-performance computing (HPC). However, implementing MPI code manually—especially applying a proper domain decomposition and communication pattern—is a challenging and error-prone task. We present ChatMPI, an AI assistant for MPI parallelization of sequential C codes. In our analysis, we focus on testing six essential HPC workloads, which are based on Basic Linear Algebra Subprograms levels 1, 2, and 3 as well as sparse, stencil, and iterative operations. We analyze the process of creating ChatMPI by using the ChatHPC library. This lightweight large language model (LLM)–based infrastructure enables HPC experts to efficiently create and supervise trustworthy AI capabilities for critical HPC software tasks. We study the data required for training (fine-tuning) ChatMPI to generate parallel codes that not only use MPI syntax correctly but also apply HPC techniques to reduce memory communication and maximize performance by using proper work decomposition. With a relatively small training dataset composed of a few dozen prompts and fewer than 15 minutes of fine-tuning on one node equipped with two NVIDIA H100 GPUs, ChatMPI elevates trustworthiness for MPI code generation of current LLMs (e.g., Code Llama, ChatGPT-4o and ChatGPT 5). Additionally, we evaluate the performance of the MPI codes generated by ChatMPI in comparison with the ones generated by ChatGPT-4o and ChatGPT-5. The codes generated by ChatMPI provide up to a 4 × boost in performance by using better problem decomposition, communication patterns, and HPC techniques (e.g., communication avoiding).
Valero Lara, Pedro [ORNL] (ORCID:0000000214794310)↗
DS-GL: Advancing Graph Learning via Harnessing the Power of Nature within Dynamic Systems
With the rapid digitization of the world, an increasing number of real-world applications are turning to nonEuclidean data, modeled as graphs. Due to their intrinsic high complexity and irregularity, learning from graph data demands tremendous computational power. Recently, CMOS-compatible Ising machines, i.e., dynamic systems composed of CMOS components, have emerged as a new approach that harnesses the inherent power of natural annealing within dynamic systems to efficiently resolve binary optimization problems and have been adopted for traditional graph computation, such as max-cut. However, when performing complex Graph Learning (GL) tasks, Ising machines face significant hurdles: (i) they are inherently binary and thus ill-suited for real-valued problems; (ii) their expensive all-to-all coupling network that guarantees effective natural annealing poses daunting scalability concerns. To address these challenges, this paper proposes a nature-powered graph learning framework dubbed DS-GL, which is the first effort to transform the process of solving graph learning problems into the natural annealing process within a parameterized dynamic system embodied as a CMOS chip. To tackle the two major hurdles, DS-GL first augments the Ising machine architecture to modify the self-reaction term of its Hamiltonian function from linear to quadratic, effectively serving as an energy regulator. This adjustment maintains the system’s original physical interpretation while enabling it to process continuous, real-valued data. Second, to address the scaling issue, DS-GL further upgrades the real-valued dense Ising machine by decomposing it into a mesh-based multi-PE dynamic system that supports efficient distributed spatial-temporal co-annealing across different PEs through sparse interconnects. By exploiting the inherent sparsity and component structures in real-world graphs, DS-GL is able to map complex graph learning tasks onto the scalable dynamic system while maintaining high accuracy. Evaluations with three diverse GL applications across six real-world datasets, including traffic flow and COVID-19 prediction, show that DS-GL can deliver from 102× to 106× speedups and 500× energy reduction over Graph Neural Networks on GPUs, with 5% - 20% accuracy enhancement.
Song, Ruibing↗
Active operator learning with predictive uncertainty quantification for partial differential equations
With the increased prevalence of neural operators being used to provide rapid solutions to partial differential equations (PDEs), understanding the accuracy of model predictions and the associated error levels is necessary for deploying reliable surrogate models in scientific applications. Existing uncertainty quantification (UQ) frameworks employ ensembles or Bayesian methods, which can incur substantial computational costs during both training and inference. Here, we propose a lightweight predictive UQ method tailored for Deep operator networks (DeepONets) that also generalizes to other operator networks. Numerical experiments on linear and nonlinear PDEs demonstrate that the framework’s uncertainty estimates are unbiased and provide accurate out-of-distribution uncertainty predictions with a sufficiently large training dataset. Our framework provides fast inference and uncertainty estimates that can efficiently drive outer-loop analyses that would be prohibitively expensive with conventional solvers. We demonstrate how predictive uncertainties can be used in the context of Bayesian optimization and active learning problems to yield improvements in accuracy and data-efficiency for outer-loop optimization procedures. In the active learning setup, we extend the framework to Fourier Neural Operators (FNO) and describe a generalized method for other operator networks. To enable real-time deployment, we introduce an inference strategy based on precomputed trunk outputs and a sparse placement matrix, reducing evaluation time by more than a factor of five. Our method provides a practical route to uncertainty-aware operator learning in time-sensitive settings.
97 MATHEMATICS AND COMPUTING↗
A bi-channel aided stitching of atomic force microscopy images
Microscopy is an essential tool in scientific research, enabling the visualization of structures at micro- and nanoscale resolutions. However, the field of microscopy often encounters limitations in field-of-view (FOV), restricting the amount of sample that can be imaged in a single capture. To overcome this limitation, image stitching techniques have been developed to seamlessly merge multiple overlapping images into a single, high-resolution composite. The images collected from microscope need to be optimally stitched before accurate physical information can be extracted from post analysis. However, the existing stitching tools either struggle to stitch images together when the microscopy images are feature sparse or cannot address all the transformations of images when performing image stitching. To address these issues, we propose a bi-channel aided feature-based image stitching method and demonstrate its use on Atomic Force Microscopy (AFM) generated Pantoea sp. YR343 biofilm and PTO thin film sample images as experimental data. The topographical channel image of AFM data captures the morphological details of the sample, and a stitched topographical image is desired for researchers. We utilize the amplitude and phase channels of AFM data to maximize the matching features and to estimate the position of the original topographical images and show that the proposed bi-channel aided stitching method outperforms the traditional direct stitching approach in AFM topographical image stitching task. Here, we demonstrated the application on AFM, but similar approaches could be employed of optical microscopy with brightfield and fluorescence channels. We believe this proposed workflow can serve as a valuable augmentation strategy for microscopy image stitching tasks and will benefit the experimentalist to avoid erroneous analysis and discovery due to incorrect stitching.
Atomic force microscopy↗
Artificial Intelligence-Driven Management of Sustainable Energy Resources: Visibility, Operation, and Control
The rapid global transition toward sustainable energy resources (SERs) is reshaping how modern power systems are observed, optimized, and controlled. While SERs have significantly advanced decarbonization, their weather dependence, variability, and inverter-dominated characteristics challenge traditional, centralized, and deterministic grid operation. At the same time, the proliferation of high-resolution data from inverters, smart meters, and sensors offers unprecedented visibility into system dynamics. Yet, it also exceeds the analytical capability of conventional model-based approaches. Artificial intelligence (AI) provides a new foundation for addressing these challenges by bridging physical laws with data-driven learning, enabling accurate state awareness, adaptive operation, and coordinated control across distributed assets. This article examines how AI transforms the management of SER-rich power systems along three critical dimensions: 1) enhancing visibility by inferring behind-the-meter (BTM) activities, assessing SER flexibility, and reconstructing system states from sparse or noisy measurements; 2) improving operation through AI-enhanced SER service provision, volt/var control (VVC), and dynamic operating envelopes (DOE) for efficiency and security; and 3) advancing control by embedding learning-based intelligence into inverter coordination, voltage and frequency regulation, and long-term dispatch. Together, these developments reveal how AI can convert the variability of SERs from an operational challenge into a source of flexibility, resilience, and intelligence, paving the way toward sustainable, adaptive, and self-optimizing power systems.
24 POWER TRANSMISSION AND DISTRIBUTION↗
Block encoding of the three-dimensional heterogeneous Poisson equation with application to fracture flow
Quantum linear system (QLS) algorithms offer the potential to solve large-scale linear systems exponentially faster than classical methods. However, applying QLS algorithms to real-world problems remains challenging due to issues such as state preparation, data loading, and efficient information extraction. In this work, we study the feasibility of applying QLS algorithms to solve discretized three-dimensional (3D) heterogeneous Poisson equations, with specific examples relating to groundwater flow through geologic fracture networks. We explicitly construct a block encoding for the 3D heterogeneous Poisson matrix by leveraging the sparse local structure of the discretized operator. While classical solvers benefit from preconditioning, we show that block encoding the system matrix and preconditioner separately does not improve the effective condition number that dominates the QLS run-time. This differs from classical approaches where the preconditioner and the system matrix can often be implemented independently. Nevertheless, due to the structure of the problem in three dimensions, the quantum algorithm achieves a run-time of 𝑂(𝑁 2/3 polylog 𝑁 ⋅log (1/𝜖)), outperforming the best classical methods (with run times of 𝑂(𝑁log 𝑁 ⋅log (1/𝜖))) and offering exponential memory savings. These results highlight both the promise and limitations of QLS algorithms for practical scientific computing, and point to effective condition-number reduction as a key barrier in achieving quantum advantages.
58 GEOSCIENCES↗
Metabolic skinflint or spendthrift? Insights into ground sloth integument and thermophysiology revealed by biophysical modeling and clumped isotope paleothermometry
Abstract Remains of megatheres have been known since the 18th -century and were among the first megafaunal vertebrates to be studied. While several examples of preserved integument show a thick coverage of fur for smaller ground sloths living in cold climates such as Mylodon and Nothrotheriops , comparatively very little is known about megathere skin. Assuming a typical placental mammal metabolism, it was previously hypothesized that megatheres would have had little-to-no fur as they achieved giant body sizes. Here the “hairless model of integument” is tested using geochemical analyses to estimate body temperature to generate novel models of ground sloth metabolism, fur coverage, and paleoclimate with Niche Mapper software. The simulations assuming metabolic activity akin to those of modern xenarthrans suggest that sparse fur coverage would have resulted in cold stress across most latitudinal ranges inhabited by extinct ground sloths. Specifically, Eremotherium predominantly required dense 10 mm fur with implications for seasonal changes of coat depth in northernmost latitudes and sparse fur in the tropics; Megatherium required dense 30 mm fur year-round in its exclusive range of cooler, drier climates; Mylodon and Nothrotheriops required dense 10–50 mm fur to avoid thermal stress, matching the integument remains of both genera, and further implying the use of behavioral thermoregulation. Moreover, clumped isotope paleothermometry data from the preserved teeth of four genera of ground sloth yielded reconstructed body temperatures lower than those previously reported for large terrestrial mammals (29 ± 2°–32 ± 3° C). This combination of low metabolisms and thick fur allowed ground sloths to inhabit various environments.
Deak, Michael D.↗
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↗
Status of the International Criticality Safety Benchmark Evaluation Project
The International Criticality Safety Benchmark Evaluation Project (ICSBEP) has continued its work generating evaluations of new and historical benchmark experiments since the last update to the nuclear criticality safety (NCS) community at the 12th International Conference on Nuclear Criticality Conference held in 2023. One additional version of the ICSBEP Handbook has been published since that update, and the Technical Review Group (TRG) held two in-person meetings to review and approve additional benchmarks. The 2022 and 2023 editions of the handbook were combined into one release (published in November 2024) and contained 13 new evaluations with 46 different configurations and two major revisions to existing evaluations. The 2024 version of the handbook, currently under publication review, will contain two new evaluations with 15 new configurations and one major revision to HEU-MET-FAST-028, the evaluation of Flattop with a uranium core. The ICSBEP TRG met again in person in April 2025 to review benchmarks for the 2025 ICSBEP Handbook and final comment resolution is currently ongoing. Many of the new benchmarks represent contemporaneous experiments that have been specifically optimized to provide validation cases relevant to the NCS community. One major area of focus for new critical experiments is to target the sparsely populated intermediate energy (or resonance) region. Another focus of many of the new benchmarks is to provide experiments sensitive to different materials, such as chlorine, hafnium, tantalum, titanium, molybdenum, chromium, and polymethyl methacrylate (PMMA, or Lucite). The ICSBEP continues to deliver high-quality, peer reviewed evaluations of integral experiments relevant to the nuclear data community.
HEU-MET-FAST-028↗