Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “RANDOM NOISE”

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.

At least 19 records
All sourcesNASA NTRSDOE OSTI
DOE OSTI2024

Three-point Analysis for Butler-Volmer Electrochemical Kinetics

This file contains a spreadsheet and equations that evaluate corrosion test data. The data (which can be inserted by the user) is current vs voltage data. This spreadsheet will be part of the supplemental information of a journal article that is under review. Specifically, the spreadsheet evaluates the classical Butler Volmer equation in the presence of several different forms of noise found in electrochemical systems. The forms of noise are: 1) solution resistance, 2) random noise in the current, 3) drift of the open circuit potential voltage.

Cho, Seongkoo [Lawrence Livermore National Laborat↗
DOE OSTI2026

X-ray and γ-ray beam interstellar communication and implications for SETI

The possibility of detecting artificial signals transmitted by alien civilizations via collimated X-ray or gamma-ray beams is investigated. The prospect of using such beams for human communication within the solar system and beyond is also discussed. Detector responses were simulated for input signals and analyzed using relative entropy. For simplicity, all signals were assumed to use on-off keying (OOK) modulation. “Real” signals were generated by taking digital files and sequentially feeding their raw binary data to the detector simulator, the resulting normalized information content of the detector signals was plotted and compared to random noise signals. Since jpeg files contain compressed information, these served as a proxy for artificial alien signals. This showed that there is a clear difference in measured information content between natural and artificial signals, even with relatively poor time resolution in the detector causing the signals to be smeared (dead-time/rise-time intervals many times longer than the duration between signal pulses). It was found that so long as the signal lasts for at least several rise-time/dead-time intervals, the distinction between random and artificial signals is obvious. A space-telescope with high time resolution for searching for such signals is briefly described and its basic requirements are outlined.

43 PARTICLE ACCELERATORS↗
DOE OSTI2024

Self‐Potential Tomography Preconditioned by Particle Swarm Optimization—Application to Monitoring Hyporheic Exchange in a Bedrock River

Abstract A self‐potential (SP) data‐inversion algorithm was developed and tested on an analytical model of electrical‐potential profile data attributed to single and multiple polarized electrical sources. The developed algorithm was then validated by an application to SP‐monitoring field data measured on the floodplain of East Fork Poplar Creek, Oak Ridge, Tennessee, to image electrical sources in areas conducive to preferential flow into the flood plain from the bedrock‐lined riverbed. The algorithm combined stochastic source‐localization by particle‐swarm‐optimization (PSO) of electrical sources characterized by simplified geometries with source tomography by regularized weighted least‐squares minimization of a quadratic objective function. Prior information was incorporated by preconditioning the tomography algorithm by PSO results. Variable percentages of random noise were added to analytical‐model data to evaluate the algorithm performance. Results indicated that true parameters of single‐source models were inverted and approximated with small residual error, whereas inversion of analytical‐model data representing multiple electrical sources accurately approximated the locations of the sources but miscalculated some parameters because of the non‐uniqueness of the inverse‐model solution. Source tomography applied to analytical model data during testing produced a spatially continuous parameter field that identified the locations of point‐scale synthetic dipole sources of electrical current flow with varying degrees of accuracy depending on the prior information incorporated into the tomography. When applied to SP‐monitoring field data, the algorithm imaged electrical sources within a known fault that intersects the bedrock riverbed and flood plain of East Fork Poplar Creek and depicted dynamic electrical conditions attributed to hyporheic exchange.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2025

Identification Uncertainty in Inverse Material Model Parameter Determination: A Sensitivity‐Based Decision Process for Load Path Selection

This research proposes a sensitivity-based framework for selecting the optimal prescribed loading path for a biaxial cruciform specimen. Optimality here is determined by the direction and magnitude of the prescribed displacement that minimizes the influence of random noise on the material model parameter identification. Using simulated experimental data based on finite element simulation, in this work, we identify the material model parameters of a Ludwik hardening model and plane stress implementation of the Hill-48 yield criterion using finite element model updating (FEMU). Our analysis reveals that the identification (or estimator) uncertainty of model parameters depends on the displacement boundary conditions (i.e., loading sequence) and the ground-truth value of the individual parameters. Optimal experimental design (OED) criteria based on the Fisher information matrix were investigated to mitigate indecision in the choice of optimal load path when the identification uncertainty of different material model parameters optimized at different load paths. The determinant of the Fisher information matrix was chosen here as the more useful metric due to its ability to capture uncertainty of the most influential material model parameters. The proposed framework demonstrates potential for real-time automated load step selection using scalar criteria derived prior to mechanical loading. The framework can be generalized to other geometries, boundary conditions and material models, allowing this procedure to be utilized for different experimental configurations and materials.

Fayad, Samuel S. [University of Illinois at Urbana↗
DOE OSTI2026

CaloTrilogy: Toward a Breakthrough in One-Step, End-to-End, Physics-Guided Shower Generation for Modern Calorimeters

High-precision calorimeter simulation at current and future colliders imposes rapidly growing computational demands, motivating the development of machine-learning surrogates for traditional Monte Carlo tools such as Geant4. Flow matching and diffusion-based generative models have become leading approaches for high-dimensional fast simulation because of their sample quality, but typically require ${\cal O}(100)$ function evaluations at inference and often rely on auxiliary networks to constrain global observables, compromising streamlined end-to-end generation. We introduce a unified framework that improves the balance between speed, shower quality, and physics fidelity. The method combines: (i) an average velocity field integrator that enables sampling in one or a few evaluations; (ii) a learned generative prior in shower space, constructed from data rather than random noise; and (iii) physics-guided loss terms that impose inductive biases on key observables during training. These elements are training time regularizers, preserving end-to-end inference with no additional cost. With only one or a few evaluation steps, the model achieves shower quality competitive with state-of-the-art flow and diffusion approaches, tested on several public high granularity calorimeter datasets. The results demonstrate inter-layer shower structure consistent with the underlying physics, providing a strong candidate for future fast simulation workflows.

Jiang, Cheng [Edinburgh U.]↗
DOE OSTI2024

The Impact of Bias Row Noise to Photometric Accuracy: Case Study Based on a Scientific CMOS Detector

Abstract We tested a new model of CMOS detector manufactured by the Gpixel Inc, for potential space astronomical application. In laboratory, we obtain some bias images under the typical application environment. In these bias images, clear random row noise pattern is observed. The row noise also contains some characteristic spatial frequencies. We quantitatively estimated the impact of this feature to photometric measurements, by making simulated images. We compared different bias noise types under strict parameter control. The result shows the row noise will significantly deteriorate the photometric accuracy. It effectively increases the readout noise by a factor of 2–10. However, if it is properly removed, the image quality and photometric accuracy will be significantly improved.

Astronomy & Astrophysics↗
DOE OSTI2025

Seismicity-constrained fault detection and characterization with a multitask machine learning model

Geological fault detection and characterization are crucial for understanding subsurface dynamics across scales. While methods for fault delineation based on either seismicity location analysis or seismic image reflector discontinuity are well-established, a systematic approach that integrates both data types remains absent. We develop a novel machine learning model that unifies seismic reflector images and seismicity location information to automatically identify geological faults and characterize their geometrical properties. The model encodes a seismic image and a seismicity location image separately, and fuses the encoded features with a spatial-channel attention fusion module to improve the learning of important features in both inputs. We design an automated strategy to generate high-quality synthetic training data and labels. To improve the realism of the seismicity location image, we include random seismicity noise and missing seismicity location associated with some of the faults. We validate the model’s efficacy and accuracy using synthetic data examples and two field data examples. Moreover, we show that fine-tuning the trained model with a small, domain-specific dataset enhances its fidelity for field data applications. The results demonstrate that integrating seismicity location and seismic images into a unified framework allows the end-to-end neural network to achieve higher fidelity and accuracy in delineating subsurface faults and their geometrical properties compared with image-only fault detection methods. Our approach offers an adaptive data-driven tool for geological fault characterization and seismic hazard mitigation, bridging the gap between seismicity location and image-based fault detection methods.

58 GEOSCIENCES↗
DOE OSTI2025

Boosting H I -Galaxy Cross-Clustering Signal through Higher-Order Cross-Correlations

After reionization, neutral hydrogen (${\rm H\, \small {I}}$) traces the large-scale structure (LSS) of the Universe, enabling ${\rm H\, \small {I}}$ intensity mapping (IM) to capture the LSS in 3D and constrain key cosmological parameters. We present a new framework utilizing higher-order cross-correlations to study ${\rm H\, \small {I}}$ clustering around galaxies, tested using real-space data from the IllustrisTNG300 simulation. This approach computes the joint distributions of k-nearest neighbor (kNN) optical galaxies and the ${\rm H\, \small {I}}$ brightness temperature field smoothed at relevant scales (the kNN-field framework), providing sensitivity to all higher-order cross-correlations, unlike two-point statistics. To simulate ${\rm H\, \small {I}}$ data from actual surveys, we add random thermal noise and apply a simple foreground cleaning model, filtering out Fourier modes of the brightness temperature field with k ∥ < k min,∥ . Under current levels of thermal noise and foreground cleaning, typical of a Canadian Hydrogen Intensity Mapping Experiment (CHIME)-like survey, the ${\rm H\, \small {I}}$-galaxy cross-correlation signal in our simulations, using the kNN-field framework, is detectable at >30σ across r = [3, 12] h –1 Mpc. In contrast, the detectability of the standard two-point correlation function (2PCF) over the same scales depends strongly on the foreground filter: a sharp k ∥ filter can spuriously boost detection to 8σ due to position-space ringing, whereas a less sharp filter yields no detection. Nonetheless, we conclude that kNN-field cross-correlations are robustly detectable across a broad range of foreground filtering and thermal noise conditions, suggesting their potential for enhanced constraining power over 2PCFs.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2024

Comparative Assessment of U-Net-Based Deep Learning Models for Segmenting Microfractures and Pore Spaces in Digital Rocks

Segmentation of high-resolution X-ray microcomputed tomography (µCT) images is crucial in digital rock physics (DRP), affecting the characterization and analysis of microscale phenomena in the porous media. The complexity of geological structures and nonideal scanning conditions pose significant challenges to conventional image segmentation approaches. Motivated by the recent increasing popularity of deep learning (DL) techniques in image processing, this work undertakes a comparative study of DL models, specifically U-Net and its variants, for segmenting multiple targets with distinguished features in digital rocks, including discrete fracture networks (DFNs), pore spaces, and solid rock. Particularly, DFNs have a smaller volumetric fraction over others, bringing in a substantial challenge of imbalanced segmentation. The primary focus is to evaluate the architecture and feature enhancement strategies of various DL models, including U-Net, attention U-Net, residual U-Net, U-Net++, and residual U-Net++. The models were designed as 2.5D, utilizing a central 2D image and its two adjacent upper and lower 2D images as input to provide a pseudo-3D context. In addition, because the ground truth of segmentation was unknown for real-world digital rocks, we created a benchmark data set following the inverse operations of segmentation. The data synthesis started from the label images (i.e., solid rock, pore spaces, and DFNs), followed by simulating partial volume blurring, adding random background noise, and introducing ring artifacts to mimic real raw X-ray µCT images. The data set, which included various rock types (i.e., sandstone and artificial data), scanning resolution, and magnitudes of noise and artifacts, was divided into training and testing data sets with a 90% and 10% ratio, respectively. Moreover, in addition to the conventional pixel-wise evaluation metrics, the physics-based metric of the lattice-Boltzmann method (LBM) simulated permeability provided more comprehensive assessments. The results demonstrated that the residual connections, nested architectures, and redesigned skip connections contribute to the model performance and give the residual U-Net++ the highest accuracy. The improvements were mainly on the boundaries and small targets, especially the DFNs, which dominate the interconnectivity and therefore affect the permeability greatly. This study also rigorously evaluated the efficiency and generalization of each model, demonstrating that the sophisticated architectures achieved excellent practicability and maintained robust performance on completely unseen data, ensuring their suitability for diverse and challenging DRP applications.

58 GEOSCIENCES↗
DOE OSTI2025

A Privacy First Path Analysis using Clickstream Data

In the modern digital economy, data-driven decision making is crucial for effectively meeting the ever-evolving demands of consumer engagement and satisfaction. Clickstream data has become invaluable for understanding customer behavior, yet concerns over privacy and security persist, especially with some internet service providers profiting from its sale. This article introduces an innovative methodology that blends experiential learning with advanced cryptographic techniques, including differential privacy and graph analytics. The core objective of this methodology is to estimate Customer Lifetime Value (CLV) by analyzing clickstream data, achieving an average prediction accuracy of 92.4% in user engagement levels while ensuring user anonymity through Recency, Frequency, and Monetary (RFM) analysis. Our study introduces the concept of a “data depositor” and a privacy manager, employing the composition theorem to merge non-adaptive queries effectively. Privacy budgets (? = 1.0, d = 10-5), sensitivity-specific techniques, and data partitioning were applied. Randomization and noise addition protect data integrity, with special handling for categorical values. This approach, differing from prior studies, offers a 12.6% improvement in privacy-preserving targeting accuracy while maintaining strict confidentiality, presenting a novel path forward in data-driven decision-making.

Frequency and Monetary (RFM) analysis↗
DOE OSTI2025

Enhancing Gaussian Process Surrogates for Optimization and Posterior Approximation via Random Exploration

This paper proposes novel noise-free Bayesian optimization strategies that rely on a random exploration step to enhance the accuracy of Gaussian process surrogate models. The new algorithms retain the ease of implementation of the classical GP-UCB algorithm, but the additional random exploration step accelerates their convergence, nearly achieving the optimal convergence rate. Furthermore, to facilitate Bayesian inference with intractable likelihoods, we propose to utilize optimization iterates for maximum a posteriori estimation to build a Gaussian process surrogate model for the unnormalized log-posterior density. We provide bounds for the Hellinger distance between the true and the approximate posterior distributions in terms of the number of design points. We demonstrate the effectiveness of our Bayesian optimization algorithms in nonconvex benchmark objective functions, in a machine learning hyperparameter tuning problem, and in a black-box engineering design problem. The effectiveness of our posterior approximation approach is demonstrated in two Bayesian inference problems for parameters of dynamical systems.

Bayesian inference↗
DOE OSTI2024

Universal Spreading of Conditional Mutual Information in Noisy Random Circuits

For this work, we study the evolution of conditional mutual information (CMI) in generic open quantum systems, focusing on one-dimensional random circuits with interspersed local noise. Unlike in noiseless circuits, where CMI spreads linearly while being bounded by the light cone, we find that noisy random circuits with an error rate 𝑝 exhibit superlinear propagation of CMI, which diverges far beyond the light cone at a critical circuit depth 𝑡 𝑐 ∝ 𝑝 −1 . We demonstrate that the underlying mechanism for such rapid spreading is the combined effect of local noise and a scrambling unitary, which selectively removes short-range correlations while preserving long-range correlations. To analytically capture the dynamics of CMI in noisy random circuits, we introduce a coarse-graining method, and we validate our theoretical results through numerical simulations. Furthermore, we identify a universal scaling law governing the spreading of CMI.

decoherence↗
DOE OSTI2025

Implementation of Johnson Noise Thermometry into Radiation Hardened Electronics

The random motion of charge carriers in an electrical conductor is a function of its temperature. This phenomenon generates an electrical signal, referred to as Johnson noise, that is present in all analog signals. Conversely, the temperature dependence of the Johnson noise spectrum also enables a direct measurement of absolute temperature, which can provide a secondary measurement of temperature when quantified using sensors such as resistive temperature devices (RTDs) in a process called Johnson noise thermometry (JNT). For nuclear environments, this is of particular interest in correcting for RTDs signal drift caused by accumulation, transmutation, and displacement damage caused by neutron and gamma irradiation.

42 ENGINEERING↗
DOE OSTI2025

Analysis Background & Noise in Stretched Wire Alignment Technique Measurements

The Stretched-Wire Alignment Technique (SWAT) is one method of magnet alignment for linear induction accelerators. The applications of SWAT have been implemented for aligning solenoid magnets on the Scorpius linear induction accelerator which will be sited at the Nevada National Security Site and the Flash X-Ray (FXR) linear induction accelerator at Lawrence Livermore National Laboratory’s Contained Firing Facility. This article describes both systematic (repeatable) and random sources of background and noise as well as practical ways to eliminate or reduce them to acceptable levels. Systematic sources include reflections from wire ends, rapid sag due to ohmic heating of the wire, magnetic materials, and shot rate. Random sources include air currents, vibration of nearby equipment, mechanical stability of test equipment, and the instruments used to measure the wire motion. Mitigations include curve fitting and adaptive noise signal cancellation, and mechanical damping. Finite Element Analysis (FEA) was used to identify and resolve a repeatable wire vibration frequency interfering with the signal resolution. Two stretched wire alignment technique set ups from Sandia National Labs and Lawrence Livermore National Lab have shown background noise sources and ways of mitigating them by either analysis methods or change of mechanical configuration. Conclusions that were drawn included the severe sensitivity of the deflection to even small external interferences of the SWAT wire such that it requires attention to detail in mechanical set up and analysis.

Linear Inductive Accelerator↗
DOE OSTI2025

TRIM: AI Guided Random Number Generation for Resource-Constrained IoT Systems

Random numbers often serve as the backbone for many security solutions in diverse domains such as cryptography, side channel leakage prevention, and moving target defense. However, generating true random numbers requires a physical source of entropy (e.g. hardware, quantum, environmental phenomenon) making it difficult to realize at a large scale and at a low cost. On the flip side, pseudorandom number generators (easy to implement) following a specific distribution (e.g. Gaussian) can be easily compromised given a sufficient amount of traces. In this work, we have developed a machine learning-guided generative approach that can be used to create portable, resource-efficient, and cost-effective random number generators with high throughput and true randomness characteristics. We implement the proposed approach as a highly parameterized framework and perform extensive evaluation for different settings. The framework was able to learn from true random sources such as irrational numbers and environmental audio noise and imitate those sources towards generating new good quality random numbers on demand. We have generated more than 1 billion bits and observed robust performance in terms of true randomness metrics obtained from NIST SP 800-22 and FIPS 140-1 randomness test suites achieving a throughput of up to 142.85 Mbps. Compared to the state-of-the-art (SOTA) technique, the iso-cost setup of our framework can achieve more than 500 Mbps in a distributed setting. We have evaluated the efficacy of running the true randomness imitation AI models on target edge devices such as Raspberry Pi 4 (Model B), Nvidia Jetson Nano, Nvidia Jetson Orin Nano and Nvidia Jetson Xavier. We have also looked at the security of the TRIM framework itself against different adversarial threat models.

Cybersecurity↗
DOE OSTI2025

Data-Driven Closures and Assimilation for Stiff Multiscale Random Dynamics

Here, we introduce a data-driven and physics-informed framework for propagating uncertainty in stiff, multiscale random ordinary differential equations (RODEs) driven by correlated (colored) noise. Unlike systems subjected to Gaussian white noise, a deterministic equation for the joint probability density function (PDF) of RODE state variables does not exist in closed form. Moreover, such an equation would require as many phase-space variables as there are states in the RODE system. To alleviate this curse of dimensionality, we instead derive exact, albeit unclosed, reduced-order PDF (RoPDF) equations for low-dimensional observables/quantities of interest. The unclosed terms take the form of state-dependent conditional expectations, which are directly estimated from data at sparse observation times. However, for systems exhibiting stiff, multiscale dynamics, data sparsity introduces regression discrepancies that compound during RoPDF evolution. This is overcome by introducing a kinetic-like defect term to the RoPDF equation, which is learned by assimilating in sparse, low-fidelity RoPDF estimates. Two assimilation methods are considered, namely nudging and deep neural networks, which are successfully tested against Monte Carlo simulations.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Differentially Private Map Matching (DPMM) v1.0

Human mobility trajectories provide valuable information for developing mobility applications, as they contain diverse and rich information about the users. User mobility data is valuable for various applications such as intelligent transportation systems (ITS), commercial business models, and disease-spread models. However, such spatio-temporal traces may pose a threat to user privacy. GPS trajectories in their raw form are not suitable for transportation studies, as they require matching locations with nearest road links — a process called map-matching. This software implements a differential privacy (DP)-based map-matching algorithm, called DPMM, that generates link-level location trajectories in a privacy-preserving manner to protect users' origin destinations (OD) and travel paths. OD privacy is achieved by injecting Planar Laplace noise to the user OD GPS points. Travel-path privacy is provided with randomized travel path construction using exponential DP mechanism. The injected noise level is selected adaptively, by considering the link density of the location and the functional category of the localized links. For path privacy, our mechanism samples waypoints and selects candidate paths between waypoints. DPMM provides privacy effectively with respect to link density instead of other trajectory samples in the database compared to other privacy mechanisms. Compared to the different baseline models our DP-based privacy model offers closer query responses to the raw data in terms of individual and aggregate trajectory-level statistics with an average at absolute deviation from the baseline for individual statistics on ϵ = 1.0. Beyond individual trajectory statistics, the DPMM outperforms the other benchmark DP-based mechanisms on different aggregate statistics with up to 8x improvement in utility.

Peisert, Sean [Lawrence Berkeley National Laborato↗
DOE OSTI2025

Attention to quantum complexity

The imminent era of error-corrected quantum computing demands robust methods to characterize quantum state complexity from limited, noisy measurements. We introduce the Quantum Attention Network (QuAN), a classical artificial intelligence (AI) framework leveraging attention mechanisms tailored for learning quantum complexity. Inspired by large language models, QuAN treats measurement snapshots as tokens while respecting permutation invariance. Combined with our parameter-efficient miniset self-attention block, this enables QuAN to access high-order moments of bit-string distributions and preferentially attend to less noisy snapshots. We test QuAN across three quantum simulation settings: driven hard-core Bose-Hubbard model, random quantum circuits, and toric code under coherent and incoherent noise. QuAN directly learns entanglement and state complexity growth from experimental computational basis measurements, including complexity growth in random circuits from noisy data. In regimes inaccessible to existing theory, QuAN unveils the complete phase diagram for noisy toric code data as a function of both noise types, highlighting AI’s transformative potential for assisting quantum hardware.

Kim, Hyejin [Cornell Univ., Ithaca, NY (United Sta↗