Search NASA⌕ Search

SEARCH · Search NASA

Results for “Stochastic Sampling”

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 703 records · Page 39

A Multistage Stochastic Transmission Expansion Algorithm for Wide-Area Planning under Uncertainty

The overall objective for this project was to develop and demonstrate a set of methods for solving the transmission investment problem for a large network considering many possible scenarios of future conditions and multiple decision points when investments can be made. Project sub-objectives achieved this goal through a succession of extending the methods to apply to problems with increasing complexity or additional features, including the number of decision points, whether generation and transmission are co-optimized, and whether AC or DC power flow is used. A transmission model was developed for the Western Electric Coordinating Council (WECC) region, the high-voltage transmission system that serves the western third of the continental U.S. Using a dataset provided by WECC and by researchers from John Hopkins University, we have validated and demonstrated the model and used it to compare the new method for solving multi-stage stochastic transmission planning to several state-of-the-art techniques. The project has resulted in several key outcomes and achievements: The covariance-based method for choosing a small set of hours to represent short-term variability has superior performance in terms of accuracy to existing methods, including K-means clustering and Importance Sampling; The combined partitioning method for long-term uncertainty with the nested clustering approach for choosing representative hours for each long-term group has superior accuracy for equivalent computational effort compared with existing methods; Using the partitioning/clustering method combined with Sample Average Approximation provides both statistical bounds on the quality of the solution and at the same time, a complete investment plan for all contingencies in the full uncertainty set; no existing methods can provide both at the same time; The method is demonstrated to work well for choosing both transmission and generation investments; A variant on the method allows for both scenario selection and simultaneous correction for the error from the DC power flow approximation to provide a tractable method for AC power flow-based transmission planning under uncertainty; The method applied to the WECC case study demonstrates the additional value to the system operator and the consumer of identifying flexible investment options in the near-term decisions. In particular, the case study exhibits significant option value in postponing some transmission additions that appear useful but in some long-term system states create new congestion problems.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Stochastic modeling of the Fermi/LAT γ-ray blazar variability

We study the γ-ray variability of 13 blazars observed with the Fermi/Large Area Telescope (LAT). These blazars have the most complete light curves collected during the first four years of the Fermi sky survey. We model them with the Ornstein-Uhlenbeck (OU) process or a mixture of the OU processes. The OU process has power spectral density (PSD) proportional to 1/f {sup α} with α changing at a characteristic timescale, τ{sub 0}, from 0 (τ >> τ{sub 0}) to 2 (τ << τ{sub 0}). The PSD of the mixed OU process has two characteristic timescales and an additional intermediate region with 0 < α < 2. We show that the OU model provides a good description of the Fermi/LAT light curves of three blazars in our sample. For the first time, we constrain a characteristic γ-ray timescale of variability in two BL Lac sources, 3C 66A and PKS 2155-304 (τ{sub 0} ≅ 25 days and τ{sub 0} ≅ 43 days, respectively, in the observer's frame), which are longer than the soft X-ray timescales detected in blazars and Seyfert galaxies. We find that the mixed OU process approximates the light curves of the remaining 10 blazars better than the OU process. We derive limits on their long and short characteristic timescales, and infer that their Fermi/LAT PSD resemble power-law functions. We constrain the PSD slopes for all but one source in the sample. We find hints for sub-hour Fermi/LAT variability in four flat spectrum radio quasars. We discuss the implications of our results for theoretical models of blazar variability.

79 ASTRONOMY AND ASTROPHYSICS↗

Dynamic analysis of apoptosis using cyanine SYTO probes: From classical to microfluidic cytometry

Cell death is a stochastic process, often initiated and/or executed in a multi-pathway/multi-organelle fashion. Therefore, high-throughput single-cell analysis platforms are required to provide detailed characterization of kinetics and mechanisms of cell death in heterogeneous cell populations. However, there is still a largely unmet need for inert fluorescent probes, suitable for prolonged kinetic studies. Here, we compare the use of innovative adaptation of unsymmetrical SYTO dyes for dynamic real-time analysis of apoptosis in conventional as well as microfluidic chip-based systems. We show that cyanine SYTO probes allow non-invasive tracking of intracellular events over extended time. Easy handling and 'stain-no wash' protocols open up new opportunities for high-throughput analysis and live-cell sorting. Furthermore, SYTO probes are easily adaptable for detection of cell death using automated microfluidic chip-based cytometry. Overall, the combined use of SYTO probes and state-of-the-art Lab-on-a-Chip platform emerges as a cost effective solution for automated drug screening compared to conventional Annexin V or TUNEL assays. In particular, it should allow for dynamic analysis of samples where low cell number has so far been an obstacle, e.g. primary cancer stems cells or circulating minimal residual tumors.

60 APPLIED LIFE SCIENCES↗

Experimental and calculational investigation of laser-heated additive manufactured foams

Foam materials are starting to find application in laser-heated Hohlraums used to drive inertial confinement fusion implosions. Foams made using additive manufacturing (AM) techniques are now available and may have advantages over traditional chemical (aerogel) foams. Here, we present new experimental data on laser-heated AM foams. Samples of four different types of printed AM foams were heated using a single 527 nm laser beam at the Jupiter Laser Facility. The laser pulse was ∼180 J square pulse with an FWHM of 1.6 ns and a peak intensity of 3–4 × 1014 W/cm2. The foam densities ranged from 12 to 93 mg/cc (all supercritical for 527 nm light). We measured the backscattered light (power and spectrum), the transmitted light, side-on x-ray images, and the Ti K-shell emission that was used to infer the time-integrated temperature. The fraction of backscattered light was 6%–15% of the input laser energy. The pure carbon foam sample had less backscatter than a C8H9O3 foam of similar density, which was consistent with multi-fluid calculations that predicted less ion heating for the C8H9O3 foam. The level of backscatter and the thermal front speeds for the AM foams were similar to values measured for stochastic (aerogel) foams under similar conditions.

36 MATERIALS SCIENCE↗

Validation of the stochastic inversion algorithm for acoustic travel-time tomography: a large eddy simulation study

Acoustic tomography (AT) is explored as a remote sensing technique to obtain instantaneous snapshots of temperature and velocity fluctuations for wind energy applications. This study integrates Large Eddy Simulation (LES) with the Stochastic Inversion (SI) method to validate the algorithm’s capacity for accurate reconstruction of atmospheric fluctuations. The initial findings demonstrate the efficacy of the method in accurately capturing the predominant flow structures. Normalized L2 error evaluations further inform the algorithm’s precision, with errors accentuated in less sampled peripheral regions. The results underscore the method’s promise as a non-intrusive observational tool, with ongoing development poised to improve its precision and reliability.

17 WIND ENERGY↗

Precision check on the triviality of the {phi}{sup 4} theory by a new simulation method

We report precise simulations of {phi}{sup 4} theory in the Ising limit. A recent technique to stochastically evaluate the all-order strong coupling expansion is combined with exact identities in the closely related Aizenman random current representation. In this way estimates of the renormalized coupling close to the continuum limit become possible with unprecedented precision and yet low CPU cost. As a sample application we present results for the unbroken phase of the Ising model in dimensions 3, 4 and 5 and investigate the question of triviality by studying a finite size scaling continuum limit.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Fast and scalable quantum Monte Carlo simulations of electron-phonon models

We introduce methodologies for highly scalable quantum Monte Carlo simulations of electron-phonon models, and report benchmark results for the Holstein model on the square lattice. The determinant quantum Monte Carlo (DQMC) method is a widely used tool for simulating simple electron-phonon models at finite temperatures, but incurs a computational cost that scales cubically with system size. Alternatively, near-linear scaling with system size can be achieved with the hybrid Monte Carlo (HMC) method and an integral representation of the Fermion determinant. Here, we introduce a collection of methodologies that make such simulations even faster. To combat "stiffness" arising from the bosonic action, we review how Fourier acceleration can be combined with time-step splitting. To overcome phonon sampling barriers associated with strongly-bound bipolaron formation, we design global Monte Carlo updates that approximately respect particle-hole symmetry. To accelerate the iterative linear solver, we introduce a preconditioner that becomes exact in the adiabatic limit of infinite atomic mass. Finally, we demonstrate how stochastic measurements can be accelerated using fast Fourier transforms. Here, these methods are all complementary and, combined, may produce multiple orders of magnitude speedup, depending on model details.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Radionuclide stochastic distribution in the irradiated graphite - 15206

In France, about 17,000 tons of irradiated graphite waste will be produced from the decommissioning of the six gas-cooled nuclear reactors operated by Electricite De France (EDF). Radionuclide measurements in irradiated graphite exhibit very high discrepancies especially when corresponding to precursors at trace level which is often the case for nuclear grade graphite. As evidenced by numerous studies nuclear graphite is a very pure material, however, it cannot be considered from an analytical viewpoint as a typical homogeneous material. Geo-statistics do not give any notable results when the 3D neutron flux and power history are known. Without taking into account the very origin of the stochastic behavior of radionuclide, their properties may be assumed with the statistical properties which are used in the case of contaminated soils but which have no interest for irradiated graphite. At every scale, the huge discrepancy cannot be avoided but can be easily explained by Theory Of Sampling (TOS) of finely divided materials. The complexity of nuclear graphite is due to its high purity. (authors)

12 MANAGEMENT OF RADIOACTIVE AND NON-RADIOACTIVE W↗

Generative AI models for learning flow maps of stochastic dynamical systems in bounded domains

Simulating stochastic differential equations (SDEs) in bounded domains, presents significant computational challenges due to particle exit phenomena, which requires accurate modeling of interior stochastic dynamics and boundary interactions. Despite the success of machine learning-based methods in learning SDEs, existing learning methods are not applicable to SDEs in bounded domains because they cannot accurately capture the particle exit dynamics. We present a unified hybrid data-driven approach that combines a conditional diffusion model with an exit prediction neural network to capture both interior stochastic dynamics and boundary exit phenomena. Our ML model consists of two major components: a neural network that learns exit probabilities using binary cross-entropy loss with rigorous convergence guarantees, and a training-free diffusion model that generates state transitions for non-exiting particles using closed-form score functions. The two components are integrated through a probabilistic sampling algorithm that determines particle exit at each time step and generates appropriate state transitions. Here, the performance of the proposed approach is demonstrated via three test cases: a one-dimensional simplified problem for theoretical verification, a two-dimensional advection-diffusion problem in a bounded domain, and a three-dimensional problem of interest to magnetically confined fusion plasmas.

Bounded domains↗

Accelerating Hamiltonian Monte Carlo for Bayesian inference in neural networks and neural operators

Hamiltonian Monte Carlo (HMC) is a powerful and accurate method to sample from the posterior distribution in Bayesian inference. However, HMC techniques are computationally demanding for Bayesian neural networks due to the high dimensionality of the network’s parameter space and the non-convexity of their posterior distributions. Therefore, various approximation techniques, such as variational inference (VI) or stochastic gradient MCMC, are often employed to infer the posterior distribution of the network parameters. Such approximations introduce inaccuracies in the inferred distributions, resulting in unreliable uncertainty estimates. In this work, we propose a hybrid approach that combines inexpensive VI and accurate HMC methods to efficiently and accurately quantify uncertainties in neural networks and neural operators. The proposed approach leverages an initial VI training on the full network. We examine the influence of individual parameters on the prediction uncertainty, which shows that a large proportion of the parameters do not contribute substantially to uncertainty in the network predictions. This information is then used to significantly reduce the dimension of the parameter space, and HMC is performed only for the subset of network parameters that strongly influence prediction uncertainties. This yields a framework for accelerating the full batch HMC for posterior inference in neural networks. We demonstrate the efficiency and accuracy of the proposed framework on deep neural networks and operator networks, showing that inference can be performed for large networks with tens to hundreds of thousands of parameters. Finally, we show that this method can effectively learn surrogates for complex physical systems by modeling the operator that maps from upstream conditions to wall-pressure data on a cone in hypersonic flow.

Bayesian inference↗

Framework for an adaptive integrated observation system using a hierarchy of machine learning approaches

Focal Area(s): 1. Data acquisition enabled by machine learning, AI, and advanced methods including experimental/network design/optimization, and hardware-related efforts involving AI. 2. Insight gleaned from complex measurements using AI, big data analytics, and other advanced methods, including explainable AI and physics- or knowledge-guided AI Science Challenge and Rationale: Atmospheric processes are stochastic, occur at scales from the micrometer to many kilometers, and are constantly changing over time. Characterizing these interactions and associated environmental conditions using traditional measurement techniques is difficult and can take years to build statistics on atmospheric phenomena that occurs episodically. Developing new innovative approaches to modify sampling strategies in real-time would enable the routine collection of targeted measurements focused on a specific set of science questions.

54 ENVIRONMENTAL SCIENCES↗

A continuation multilevel Monte Carlo algorithm

Here, we propose a novel Continuation Multi Level Monte Carlo (CMLMC) algorithm for weak approximation of stochastic models. The CMLMC algorithm solves the given approximation problem for a sequence of decreasing tolerances, ending when the required error tolerance is satisfied. CMLMC assumes discretization hierarchies that are defined a priori for each level and are geometrically refined across levels. Moreover, the actual choice of computational work across levels is based on parametric models for the average cost per sample and the corresponding variance and weak error. These parameters are calibrated using Bayesian estimation, taking particular notice of the deepest levels of the discretization hierarchy, where only few realizations are available to produce the estimates. The resulting CMLMC estimator exhibits a non-trivial splitting between bias and statistical contributions. We also show the asymptotic normality of the statistical error in the MLMC estimator and justify in this way our error estimate that allows prescribing both required accuracy and confidence in the final result. Our numerical results substantiate the above results and illustrate the corresponding computational savings in examples that are described in terms of differential equations either driven by random measures or with random coefficients.

97 MATHEMATICS AND COMPUTING↗

Subsurface microbial communities as a tool for characterizing regional-scale groundwater flow

Subsurface microbial community distribution patterns are influenced by biogeochemical and groundwater fluxes and may inform hydraulic connections along groundwater-flow paths. This study examined the regional-scale microbial community of the Death Valley Regional Flow System and evaluated whether subsurface communities can be used to identify groundwater-flow paths between recharge and discharge areas. Samples were collected from 36 sites in three groundwater basins: Pahute Mesa–Oasis Valley (PMOV), Ash Meadows (AM), and Alkali Flat–Furnace Creek Ranch (AFFCR). Microbial diversity within and between communities varied by location, and communities were separated into two overall groups that affiliated with the AM and PMOV/AFFCR basins. Network analysis revealed patterns between clusters of common microbes that represented groundwaters with similar geochemical conditions and largely corroborated hydraulic connections between recharge and discharge areas. Null model analyses identified deterministic and stochastic ecological processes contributing to microbial community assemblages. Most communities were more different than expected and governed by dispersal limitation, geochemical differences, or undominating processes. However, certain communities from sites located within or near the Nevada National Security Site were more similar than expected and dominated by homogeneous dispersal or selection. Overall, the (dis)similarities between the microbial communities of DVRFS recharge and discharge areas supported previously documented hydraulic connections between: (1) Spring Mountains and Ash Meadows; (2) Frenchman and Yucca Flat and Amargosa Desert; and (3) Amargosa Desert and Death Valley. However, only a portion of the flow path between Pahute Mesa and Oasis Valley could be supported by microbial community analyses, likely due to well-associated artifacts in samples from the two Oasis Valley sites. This study demonstrates the utility of combining microbial data with hydrologic, geologic, and water-chemistry information to comprehensively characterize groundwater systems, highlighting both strengths and limitations of this approach.

54 ENVIRONMENTAL SCIENCES↗

Embedding Neural Thermal Scattering (NeTS) Modules in SERPENT for Higher Fidelity Advanced Reactor Analysis

When a neutron born in fission thermalizes to the order of $k$ $B$ $T$, it’s de-Broglie wavelength and energy approach the order of inter-atomic spacing and elementary lattice oscillations, respectively. $S$($a,β,t$) or the scattering law, uuantify these temperature-dependent crystallographic contributions to total cross section (or reaction rate). In a Monte Carlo analysis, cumulative distribution functions (CDFs) of $S$($a,β,t$) are loaded to memory from “A Compact ENDF” (ACE) files for stochastically selecting thermal scattered neutron trajectories. In this work, novel neural thermal scattering (NeTS) modules for $S$($a,β,t$) CDFs are designed, trained, serialized and embedded within SERPENT using Python’s limited C-API for on-the-fly deployment of crystalline graphite $S$($a,β,t$) sampling. Torchscript tracing and Numba just-in-time (JIT) compilation streamline neural inference on NVIDIA GPUs with CUDA libraries. Demonstrations of bare sphere thermalization of fast and thermal sources show excellent agreement between embedded NeTS in SERPENT and MCNP. With an explicit model of the reactor, NeTS can predict on-the-fly changes in TREAT neutron spectra as a function of local temperature, which can serve to improve transient and accident predictions in a multiphysics analysis framework. This framework can be further extended to account on-the-fly for changes in local graphitic microstructure to scattering cross sections, and outlines a novel coupling of modern machine learning with state-of-the-art reactor physics methods.

97 MATHEMATICS AND COMPUTING↗

CADIS and FW-CADIS Variance Reduction in Gamma Transport for Predicting Prompt Forensics Signatures

The goal of prompt nuclear forensics is to determine the characteristics of a nuclear detonation based on the signatures available almost immediately after the explosion. An important characteristic is the reaction time history (RTH), a measure of the device’s rate of neutron multiplication. The RTH can be estimated by observation of the gamma radiation emitted from the detonation, which can be detected directly or observed indirectly as Teller light. Gamma transport simulations used to predict these radiation fields are often modeled stochastically using the Monte Carlo N-Particle (MCNP) code, which can be a computationally demanding task due to the number of particle histories needed to achieve statistical convergence. In an attempt to improve the efficiency of these calculations, we evaluate two variance reduction techniques: Consistent Adjoint-Driven Importance Sampling (CADIS) and Forward-Weighted Consistent Adjoint-Driven Importance Sampling (FW-CADIS). These methods use a deterministically calculated adjoint flux to create weight windows and source biasing that guide MCNP sampling. We study the utility of CADIS and FW-CADIS for their use in MCNP gamma transport for nuclear forensics prediction simulations. Furthermore, the results demonstrate that both CADIS and FW-CADIS improve the accuracy for forensics-focused simulations, with CADIS being most beneficial in direct detection and FW-CADIS being ideal for computing a global Teller light source.

CADIS↗

Towards optimal sensor placement for inverse problems in spaces of measures

The objective of this work is to quantify the reconstruction error in sparse inverse problems with measures and stochastic noise, motivated by optimal sensor placement. To be useful in this context, the error quantities must be explicit in the sensor configuration and robust with respect to the source, yet relatively easy to compute in practice, compared to a direct evaluation of the error by a large number of samples. In particular, we consider the identification of a measure consisting of an unknown linear combination of point sources from a finite number of measurements contaminated by Gaussian noise. The statistical framework for recovery relies on two main ingredients: first, a convex but non-smooth variational Tikhonov point estimator over the space of Radon measures and, second, a suitable mean-squared error based on its Hellinger–Kantorovich distance to the ground truth. To quantify the error, we employ a non-degenerate source condition as well as careful linearization arguments to derive a computable upper bound. This leads to asymptotically sharp error estimates in expectation that are explicit in the sensor configuration. Thus they can be used to estimate the expected reconstruction error for a given sensor configuration and guide the placement of sensors in sparse inverse problems.

97 MATHEMATICS AND COMPUTING↗

Constructing rigorous and broad biosurveillance networks for detecting emerging zoonotic outbreaks

Determining optimal surveillance networks for an emerging pathogen is difficult since it is not known beforehand what the characteristics of a pathogen will be or where it will emerge. The resources for surveillance of infectious diseases in animals and wildlife are often limited and mathematical modeling can play a supporting role in examining a wide range of scenarios of pathogen spread. We demonstrate how a hierarchy of mathematical and statistical tools can be used in surveillance planning help guide successful surveillance and mitigation policies for a wide range of zoonotic pathogens. The model forecasts can help clarify the complexities of potential scenarios, and optimize biosurveillance programs for rapidly detecting infectious diseases. Using the highly pathogenic zoonotic H5N1 avian influenza 2006-2007 epidemic in Nigeria as an example, we determined the risk for infection for localized areas in an outbreak and designed biosurveillance stations that are effective for different pathogen strains and a range of possible outbreak locations. We created a general multi-scale, multi-host stochastic SEIR epidemiological network model, with both short and long-range movement, to simulate the spread of an infectious disease through Nigerian human, poultry, backyard duck, and wild bird populations. We chose parameter ranges specific to avian influenza (but not to a particular strain) and used a Latin hypercube sample experimental design to investigate epidemic predictions in a thousand simulations. We ranked the risk of local regions by the number of times they became infected in the ensemble of simulations. These spatial statistics were then complied into a potential risk map of infection. Finally, we validated the results with a known outbreak, using spatial analysis of all the simulation runs to show the progression matched closely with the observed location of the farms infected in the 2006-2007 epidemic.

59 BASIC BIOLOGICAL SCIENCES↗

A Machine Learning-Genetic Algorithm (ML-GA) Approach for Rapid Optimization Using High-Performance Computing

A Machine Learning-Genetic Algorithm (ML-GA) approach was developed to virtually discover optimum designs using training data generated from multi-dimensional simulations. Machine learning (ML) presents a pathway to transform complex physical processes that occur in a combustion engine into compact informational processes. In the present work, a total of over 2000 sector-mesh computational fluid dynamics (CFD) simulations of a heavy-duty engine were performed. These were run concurrently on a supercomputer to reduce overall turnaround time. The engine being optimized was run on a low-octane (RON70) gasoline fuel under partially premixed compression ignition (PPCI) mode. A total of nine input parameters were varied, and the CFD simulation cases were generated by randomly sampling points from this nine-dimensional input space. These input parameters included fuel injection strategy, injector design, and various in-cylinder flow and thermodynamic conditions at intake valve closure (IVC). The outputs (targets) of interest from these simulations included five metrics related to engine performance and emissions. Over 2000 samples generated from CFD were then used to train an ML model that could predict these five targets based on the nine input features. A robust super learner approach was employed to build the ML model, where results from a collection of different ML algorithms were pooled together. Thereafter, a stochastic global optimization genetic algorithm (GA) was used, with the ML model as the objective function, to optimize the input parameters based on a merit function so as to minimize fuel consumption while satisfying CO and NOx emissions constraints. The optimized configuration from ML-GA was found to be very close to that obtained from a sequentially performed CFD-GA approach, where a CFD simulation served as the objective function. In addition, the overall turnaround time was (at least) 75% lower with the ML-GA approach, as the training data was generated from concurrent CFD simulations and employing the ML model as the objective function significantly accelerated the GA optimization. Finally, this study demonstrates the potential of ML-GA and high-performance computing (HPC) to reduce the number of CFD simulations to be performed for optimization problems without loss in accuracy, thereby providing significant cost savings compared to traditional approaches.

97 MATHEMATICS AND COMPUTING↗