Engineering Papers⌕ Search

SEARCH · Engineering Papers

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 433 records · Page 24

Assessments of epistemic uncertainty using Gaussian stochastic weight averaging for fluid-flow regression

Here, we use Gaussian stochastic weight averaging (SWAG) to assess the epistemic uncertainty associated with neural-network-based function approximation relevant to fluid flows. SWAG approximates a posterior Gaussian distribution of each weight, given training data, and a constant learning rate. Having access to this distribution, it is able to create multiple models with various combinations of sampled weights, which can be used to obtain ensemble predictions. The average of such an ensemble can be regarded as the 'mean estimation', whereas its standard deviation can be used to construct 'confidence intervals', which enable us to perform uncertainty quantification (UQ) with regard to the training process of neural networks. We utilize representative neural-network-based function approximation tasks for the following cases: (i) a two-dimensional circular-cylinder wake; (ii) the DayMET dataset (maximum daily temperature in North America); (iii) a three-dimensional square-cylinder wake; and (iv) urban flow, to assess the generalizability of the present idea for a wide range of complex datasets. SWAG-based UQ can be applied regardless of the network architecture, and therefore, we demonstrate the applicability of the method for two types of neural networks: (i) global field reconstruction from sparse sensors by combining convolutional neural network (CNN) and multi-layer perceptron (MLP); and (ii) far-field state estimation from sectional data with two-dimensional CNN. We find that SWAG can obtain physically-interpretable confidence-interval estimates from the perspective of epistemic uncertainty. This capability supports its use for a wide range of problems in science and engineering.

97 MATHEMATICS AND COMPUTING↗

Comparison of Attila Transport Code with MCNP in the Analysis of Small Modular Reactor Shielding

Of great importance in the design of a nuclear power plant is the evaluation of shielding from the ionizing radiation produced in the core of the nuclear reactor. This requires simulation software to predict the dose rates in the areas of interest. These problems are referred to as deep penetration problems, as they involve the reduction of a radiation field by two or three orders of magnitude or more. This makes accurate analyses difficult for Monte Carlo based solutions that rely on enough particles being sampled in an area of interest. Comparing the simulation of the same modeled system with more than one computer application, especially one that uses a different algorithmic approach, is a way to gain confidence in the results. In this research, two models were created, one in Monte Carlo N Particle (MCNP) which uses a stochastic algorithmic approach, and the other in Attila, which uses a deterministic algorithmic approach to test the validity of the model and to estimate the dose rates in the area of interest. Successful comparison of the two models is a way we can validate the model used for that estimation.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Distributed Stochastic Optimization of a Neural Representation Network for Time-Space Tomography Reconstruction

4D time-space reconstruction of dynamic events or deforming objects using X-ray computed tomography (CT) is an important inverse problem in non-destructive evaluation. Conventional back-projection based reconstruction methods assume that the object remains static for the duration of several tens or hundreds of X-ray projection measurement images (reconstruction of consecutive limited-angle CT scans). However, this is an unrealistic assumption for many in-situ experiments that causes spurious artifacts and inaccurate morphological reconstructions of the object. To solve this problem, we propose to perform a 4D time-space reconstruction using a distributed implicit neural representation (DINR) network that is trained using a novel distributed stochastic training algorithm. Our DINR network learns to reconstruct the object at its output by iterative optimization of its network parameters such that the measured projection images best match the output of the CT forward measurement model. Here, we use a forward measurement model that is a function of the DINR outputs at a sparsely sampled set of continuous valued 4D object coordinates. Unlike previous neural representation architectures that forward and back propagate through dense voxel grids that sample the object's entire time-space coordinates, we only propagate through the DINR at a small subset of object coordinates in each iteration resulting in an order-of-magnitude reduction in memory and compute for training. DINR leverages distributed computation across several compute nodes and GPUs to produce high-fidelity 4D time-space reconstructions. We use both simulated parallel-beam and experimental cone-beam X-ray CT datasets to demonstrate the superior performance of our approach.

36 MATERIALS SCIENCE↗

Stochastic Evolutionary Algorithms for Planning Robot Paths

A computer program implements stochastic evolutionary algorithms for planning and optimizing collision-free paths for robots and their jointed limbs. Stochastic evolutionary algorithms can be made to produce acceptably close approximations to exact, optimal solutions for path-planning problems while often demanding much less computation than do exhaustive-search and deterministic inverse-kinematics algorithms that have been used previously for this purpose. Hence, the present software is better suited for application aboard robots having limited computing capabilities (see figure). The stochastic aspect lies in the use of simulated annealing to (1) prevent trapping of an optimization algorithm in local minima of an energy-like error measure by which the fitness of a trial solution is evaluated while (2) ensuring that the entire multidimensional configuration and parameter space of the path-planning problem is sampled efficiently with respect to both robot joint angles and computation time. Simulated annealing is an established technique for avoiding local minima in multidimensional optimization problems, but has not, until now, been applied to planning collision-free robot paths by use of low-power computers.

Fink, Wolfgang↗

Probabilistic Look-ahead Contingency Analysis Integration with Commercial Tool and Practical Data

This paper presents an initial effort of integrating a smart sampling-based probabilistic look-ahead contingency analysis algorithm with General Electric (GE) Grid Solutions’ commercial energy management system (EMS) tool as a proof-of-concept for a seamless research tool integration using real world large-scale grid data. With the increasing impact of random forces such as variable generation and load, their stochastic behaviors cannot be ignored. However, the current practices are still dominated by deterministic tools. They are becoming increasingly inadequate for the future grid. The developed look-ahead contingency analysis algorithm incorporates forecast errors of variable energy and load to address the challenges brought by the increasing uncertainty of power system. The algorithm can reveal the potential violations caused by the variance of variable energy and load that are not normally detected by traditional deterministic approaches. To test its performance under practical environments ( real data with real commercial tool), significant efforts have been made to prepare test cases, modify GE EMS tool, and adapt an extreme value distribution algorithm to analyze the GE EMS’s violation-only outputs. The test results clearly demonstrate the effectiveness of the developed algorithm as new transformer violations that were not previously detected have been identified. This performance provides better situational awareness to engineers for their decision-making process under uncertainty. Moreover, with the discussion of computational performance and future work, this paper has shown a clear path for integrating the probabilistic algorithm with commercial tools to make us better equipped for the changing power system.

Modeling and simulation of power systems, constrai↗

Probing the PeV region in the astrophysical neutrino spectrum using 𝜈 𝜇 from the Southern sky

IceCube has observed a diffuse astrophysical neutrino flux over the energy region from a few TeV to a few PeV. At PeV energies, the spectral shape is not yet well measured due to the low statistics of the data. This analysis probes the gap between 1 and 10 PeV by using high-energy downgoing muon neutrinos. Here, to reject the large atmospheric muon background, two complementary techniques are combined. The first technique selects events with high stochasticity to reject atmospheric muon bundles whose stochastic energy losses are smoothed due to high muon multiplicity. The second technique vetoes atmospheric muons with the IceTop surface array. Using 9 yrs of data, we found two neutrino candidate events in the signal region, consistent with expectation from background, each with relatively high signal probabilities. A joint maximum likelihood estimation is performed using this sample and an independent 9.5-yr sample of tracks to measure the neutrino spectrum. A likelihood ratio test is done to compare the single power-law (SPL) vs SPL+cutoff hypothesis; the SPL+cutoff model is not significantly better than the SPL. High-energy astrophysical objects from four source catalogs are also checked around the direction of the two events. No significant coincidence was found.

Abbasi, R. [Loyola University Chicago] (ORCID:0000↗

Moving the needle: Employing deep reinforcement learning to push the boundaries of coarse-grained vaccine models

Highly mutable infectious disease pathogens (hm-IDPs) such as HIV and influenza evolve faster than the human immune system can contain them, allowing them to circumvent traditional vaccination approaches and causing over one million deaths annually. Agent-based models can be used to simulate the complex interactions that occur between immune cells and hm-IDP-like proteins (antigens) during affinity maturation—the process by which antibodies evolve. Compared to existing experimental approaches, agent-based models offer a safe, low-cost, and rapid route to study the immune response to vaccines spanning a wide range of design variables. However, the highly stochastic nature of affinity maturation and vast sequence space of hm-IDPs render brute force searches intractable for exploring all pertinent vaccine design variables and the subset of immunization protocols encompassed therein. To address this challenge, we employed deep reinforcement learning to drive a recently developed agent-based model of affinity maturation to focus sampling on immunization protocols with greater potential to improve the chosen metrics of protection, namely the broadly neutralizing antibody (bnAb) titers or fraction of bnAbs produced. Using this approach, we were able to coarse-grain a wide range of vaccine design variables and explore the relevant design space. Our work offers new testable insights into how vaccines should be formulated to maximize protective immune responses to hm-IDPs and how they can be minimally tailored to account for major sources of heterogeneity in human immune responses and various socioeconomic factors. Our results indicate that the first 3 to 5 immunizations, depending on the metric of protection, should be specially tailored to achieve a robust protective immune response, but that beyond this point further immunizations require only subtle changes in formulation to sustain a durable bnAb response.

60 APPLIED LIFE SCIENCES↗

Expected Thrust Fraction: Resilient Trajectory Design Applied to the Earth Return Orbiter

Electric propulsion is an enabling technology for NASA’s Mars Sample Return mission that affords an order of magnitude reduction in fuel. Unfortunately, elec- tric propulsion’s low-thrust capabilities require long thrusting arcs that make space- craft susceptible to disturbances resulting in missed thrust events. One method for designing trajectories resilient to such missed thrust events is expected thrust frac- tion, which embeds their stochastic nature into a time-varying duty cycle. This paper investigates the application of expected thrust fraction to the Earth Return Orbiter’s outbound Earth-to-Mars trajectory and compares it with trajectories de- signed using traditional methods to mitigate missed thrust events. Through the use of expected thrust fraction, a trajectory with a baseline 65.4% success rate is im- proved to an 86.6% success rate at the cost of only a 12 kg reduction in delivered mass. Additionally, when expected thrust fraction is used in conjunction with a terminal coast, a 96.0% success rate is achieved, which is higher than any single mitigation technique.

Laipert, Frank↗

A data based random number generator for a multivariate distribution (using stochastic interpolation)

Let X be a K-dimensional random variable serving as input for a system with output Y (not necessarily of dimension k). given X, an outcome Y or a distribution of outcomes G(Y/X) may be obtained either explicitly or implicity. The situation is considered in which there is a real world data set X sub j sub = 1 (n) and a means of simulating an outcome Y. A method for empirical random number generation based on the sample of observations of the random variable X without estimating the underlying density is discussed.

Thompson, J. R.↗

A test of gravity with Pulsar Timing Arrays

Abstract A successful measurement of the Stochastic Gravitational Wave Background (SGWB) in Pulsar Timing Arrays (PTAs) would open up a new window through which to test the predictions of General Relativity (GR). We consider how these measurements might reveal deviations from GR by studying the overlap reduction function — the quantity that in GR is approximated by the Hellings-Downs curve — in some sample modifications of gravity, focusing on the generic prediction of a modified dispersion relation for gravitational waves. We find a distinct signature of such modifications to GR — a shift in the minimum angle of the angular distribution — and demonstrate that this shift is quantitatively sensitive to any change in the phase velocity. In a given modification of gravity, this result can be used, in some regions of parameter space, to distinguish the effect of a modified dispersion relation from that due to the presence of extra polarization modes.

Astronomy & Astrophysics↗

A high speed implementation of the random decrement algorithm

The algorithm is useful for measuring net system damping levels in stochastic processes and for the development of equivalent linearized system response models. The algorithm works by summing together all subrecords which occur after predefined threshold level is crossed. The random decrement signature is normally developed by scanning stored data and adding subrecords together. The high speed implementation of the random decrement algorithm exploits the digital character of sampled data and uses fixed record lengths of 2(n) samples to greatly speed up the process. The contributions to the random decrement signature of each data point was calculated only once and in the same sequence as the data were taken. A hardware implementation of the algorithm using random logic is diagrammed and the process is shown to be limited only by the record size and the threshold crossing frequency of the sampled data. With a hardware cycle time of 200 ns and 1024 point signature, a threshold crossing frequency of 5000 Hertz can be processed and a stably averaged signature presented in real time.

Kiraly, L. J.↗

A high-speed implementation of the random decrement algorithm

The algorithm is useful for measuring net system damping levels in stochastic processes and for the development of equivalent linearized system response models. The algorithm works by summing together all subrecords which occur after predefined threshold level is crossed. The random decrement signature is normally developed by scanning stored data and adding subrecords together. The high speed implementation of the random decrement algorithm exploits the digital character of sampled data and uses fixed record lengths of 2(n) samples to greatly speed up the process. The contributions to the random decrement signature of each data point was calculated only once and in the same sequence as the data were taken. A hardware implementation of the algorithm using random logic is diagrammed and the process is shown to be limited only by the record size and the threshold crossing frequency of the sampled data. With a hardware cycle time of 200 ns and 1024 point signature, a threshold crossing frequency of 5000 Hertz can be processed and a stably averaged signature presented in real time.

Kiraly, L. J.↗

Geostatistical Approaches for Spatial Estimation of Vegetation Quantities Using Ground and Image Data

A major challenge in the study of the earth system is the mapping of vegetation quantities over large regions. Geostatistical methods, such as cokriging and stochastic simulation, have the potential to exploit more fully both remotely sensed data and ground information and improve the spatial estimation of vegetation variables over traditional regression methods. A synthetic example constructed from imaging spectrometer data allows a useful comparison among regression, cokriging and a simple probability-field method. A range of linear relationships between direct (sampled) and ancillary images is used. The lowest root-mean-square-error is achieved with cokriging until the correlation between direct and ancillary data exceeds .89, at which point regression is the superior estimator. Probability-field simulation gives a range of possible realizations, most more precise than those from regression. The relationship between ground measurements and image data is thus demonstrated to be one of the critical factors in the choice of a spatial estimation method.

Dungan, Jennifer L.↗

Probabilistic Residual Strength Model Developed for Life Prediction of Ceramic Matrix Composites

For the next generation of reusable launch vehicles, NASA is investigating introducing ceramic matrix composites (CMCs) in place of current superalloys for structural propulsion applications (e.g., nozzles, vanes, combustors, and heat exchangers). The higher use temperatures of CMCs will reduce vehicle weight by eliminating and/or reducing cooling system requirements. The increased strength-to-weight ratio of CMCs relative to superalloys further enhances their weight savings potential. However, in order to provide safe designs for components made of these new materials, a comprehensive life prediction methodology for CMC structures needs to be developed. A robust methodology for lifing composite structures has yet to be adopted by the engineering community. Current industry design practice continues to utilize deterministic empirically based models borrowed from metals design for predicting material life capabilities. The deterministic nature of these models inadequately addresses the stochastic character of brittle composites, and their empirical reliance makes predictions beyond the experimental test conditions a risky extrapolation. A team of engineers at the NASA Glenn Research Center has been developing a new life prediction engineering model. The Probabilistic Residual Strength (PRS) model uses the residual strength of the composite as its damage metric. Expected life and material strength are both considered probabilistically to account for the observed stochastic material response. Extensive experimental testing has been carried out on C/SiC (a candidate aerospace CMC material system) in a controlled 1000 ppm O2/argon environment at elevated temperatures of 800 and 1200 C. The test matrix was established to allow observation of the material behavior, characterization of the model, and validation of the model's predictive capabilities. Sample results of the validation study are illustrated in the graphs.

Thomas, David J.↗

A Comprehensive Assessment of Biologicals Contained Within Commercial Airliner Cabin Air

Both culture-based and culture-independent, biomarker-targeted microbial enumeration and identification technologies were employed to estimate total microbial and viral burden and diversity within the cabin air of commercial airliners. Samples from each of twenty flights spanning three commercial carriers were collected via air-impingement. When the total viable microbial population was estimated by assaying relative concentrations of the universal energy carrier ATP, values ranged from below detection limits (BDL) to 4.1 x 106 cells/cubic m of air. The total viable microbial population was extremely low in both of Airline A (approximately 10% samples) and C (approximately 18% samples) compared to the samples collected aboard flights on Airline A and B (approximately 70% samples). When samples were collected as a function of time over the course of flights, a gradual accumulation of microbes was observed from the time of passenger boarding through mid-flight, followed by a sharp decline in microbial abundance and viability from the initiation of descent through landing. It is concluded in this study that only 10% of the viable microbes of the cabin air were cultivable and suggested a need to employ state-of-the art molecular assay that measures both cultivable and viable-but-non-cultivable microbes. Among the cultivable bacteria, colonies of Acinetobacter sp. were by far the most profuse in Phase I, and Gram-positive bacteria of the genera Staphylococcus and Bacillus were the most abundant during Phase II. The isolation of the human pathogens Acinetobacter johnsonii, A. calcoaceticus, Janibacter melonis, Microbacterium trichotecenolyticum, Massilia timonae, Staphylococcus saprophyticus, Corynebacterium lipophiloflavum is concerning, as these bacteria can cause meningitis, septicemia, and a handful of sometimes fatal diseases and infections. Molecular microbial community analyses exhibited presence of the alpha-, beta-, gamma-, and delta- proteobacteria, as well as Gram-positive bacteria, Fusobacteria, Cyanobacteria, Deinococci, Bacterioidetes, Spirochetes, and Planctomyces in varying abundance. Neisseria meningitidis rDNA sequences were retrieved in great abundance from Airline A followed by Streptococcus oralis/mitis sequences. Pseudomonas synxantha sequences dominated Airline B clone libraries, followed by those of N. meningitidis and S. oralis/mitis. In Phase II, Airline C, sequences representative of more than 113 species, enveloping 12 classes of bacteria, were retrieved. Proteobacterial sequences were retrieved in greatest frequency (58% of all clone sequences), followed in short order by those stemming from Gram-positives bacteria (31% of all clone sequences). As for overall phylogenetic breadth, Gram-positive and alpha-proteobacteria seem to have a higher affinity for international flights, whereas beta-and gamma-proteobacteria are far more common about domestic cabin air parcels in Airline C samples. Ultimately, the majority of microbial species circulating throughout the cabin airs of commercial airliners are commensal, infrequently pathogenic normal flora of the human nasopharynx and respiratory system. Many of these microbes likely originate from the oral and nasal cavities, and lungs of passengers and flight crew and are disseminated unknowingly via routine conversation, coughing, sneezing, and stochastic passing of fomites. The data documented in this study will be useful to generate a baseline microbial population database and can be utilized to develop biosensor instrumentation for monitoring microbial quality of cabin or urban air.

microbial diversity↗

Coherent-phase or random-phase acceleration of electron beams in solar flares

Time structures of electron beam signatures at radio wavelengths are investigated to probe correlated versus random behavior in solar flares. In particular we address the issue whether acceleration and injection of electron beams is coherently modulated by a single source, or whether the injection is driven by a stochastic (possibly spatially fragmented) process. We analyze a total of approximately = 6000 type III bursts observed by Ikarus (Zurich) in the frequency range of 100-500 MHz, during 359 solar flares with simultaneous greater than or = 25 keV hard X-ray emission, in the years 1890-1983. In 155 flares we find a total of 260 continuous type III groups, with an average number of 13 +/- 9 bursts per group, a mean duration of D = 12 +/- 14 s, a mean period of P = 2.0 +/- 1.2 s, with the highest burst rate at a frequency of nu = 310 +/- 120 MHz. Pulse periods have been measured between 0.5 and 10 s, and can be described by an exponential distribution, i.e., N(P) varies as e (exp -P/1.0s). The period shows a frequency dependence of P(nu)=46(exp-0.6)(sub MHz)s for different flares, but is invariant during a particular flare. We measure the mean period P and its standard deviation sigma (sub p) in each type III group, and quantify the degree of periodicity (or phase-coherence) by the dimensionless parameter sigma (sub p)P. The representative sample of 260 type III burst groups shows a mean periodicity of sigma (sub p/P) = 0.37 +/- 0.12, while Monte Carlo simulations of an equivalent set of truly random time series show a distinctly different value of sigma (sub p)P = 0.93 +/- 0.26. This result indicates that the injection of electron beams is coherently modulated by a particle acceleration source which is either compact or has a global organization on a timescale of seconds, in contrast to an incoherent acceleration source, which is stochastic either in time or space. We discuss the constraints on the size of the acceleration region resulting from electron beam propagation delays and from Alfvenic synchronization during a pulse period. We discuss two periodic preocesses in flares, which potentially control quasi-periodic particle acceleration: (1) MHD oscillations, and (2) current sheets with oscillatory dynamics.

Aschwanden, Markus J.↗

Projection pursuit adaptation on polynomial chaos expansions

Here, the present work addresses the issue of accurate stochastic approximations in high-dimensional parametric space using tools from uncertainty quantification (UQ). The basis adaptation method and its accelerated algorithm in polynomial chaos expansions (PCE) were recently proposed to construct low-dimensional approximations adapted to specific quantities of interest (QoI). The present paper addresses one difficulty with these adaptations, namely their reliance on quadrature point sampling, which limits the reusability of potentially expensive samples. Projection pursuit (PP) is a statistical tool to find the “interesting” projections in high-dimensional data and thus bypass the curse-of-dimensionality. In the present work, we combine the fundamental ideas of basis adaptation and projection pursuit regression (PPR) to propose a novel method to simultaneously learn the optimal low-dimensional spaces and PCE representation from given data. While this projection pursuit adaptation (PPA) can be entirely data-driven, the constructed approximation exhibits mean-square convergence to the solution of an underlying governing equation and thus captures the supports and probability distributions associated with the physics constraints. The proposed approach is demonstrated on a borehole problem and a structural dynamics problem, demonstrating the versatility of the method and its ability to discover low-dimensional manifolds with high accuracy with limited data. In addition, the method can learn surrogate models for different quantities of interest while reusing the same data set.

97 MATHEMATICS AND COMPUTING↗

Conveyor-belt magneto-optical trapping of molecules

Abstract Laser cooling is used to produce ultracold atoms and molecules for quantum science and precision measurement applications. Molecules are more challenging to cool than atoms due to their vibrational and rotational internal degrees of freedom. Molecular rotations lead to the use of type-II transitions ( F ⩾ F ′ ) for magneto-optical trapping (MOT). When typical red detuned light frequencies are applied to these transitions, sub-Doppler heating is induced, resulting in higher temperatures and larger molecular cloud sizes than realized with the type-I MOTs most often used with atoms. To improve type-II MOTs, Jarvis et al (2018 Phys. Rev. Lett. 120 083201) proposed a blue-detuned MOT to be applied after initial cooling and capture with a red-detuned MOT. This was successfully implemented (Burau et al 2023 Phys. Rev. Lett. 130 193401; Jorapur et al 2024 Phys. Rev. Lett. 132 163403; Li et al 2024 Phys. Rev. Lett. 132 233402), realizing colder and denser molecular samples. Very recently, Hallas et al (2024 arXiv:2404.03636) demonstrated a blue-detuned MOT with a ‘1+2’ configuration that resulted in even stronger compression of the molecular cloud. Here, we describe and characterize theoretically the conveyor-belt mechanism that underlies this observed enhanced compression. We perform numerical simulations of the conveyor-belt mechanism using both stochastic Schrödinger equation and optical Bloch equation approaches. We investigate the conveyor-belt MOT characteristics in relation to laser parameters, g -factors and the structure of the molecule, and find that conveyor-belt trapping should be applicable to a wide range of laser-coolable molecules.

Li, Grace K. (ORCID:0000000277223355)↗