Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “sampling algorithm”

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 505 records · Page 28

Optimality of Gradient-MUSIC for Spectral Estimation

We introduce the Gradient-MUSIC algorithm for estimating the unknown frequencies and amplitudes of a nonharmonic signal from noisy time samples. While the classical MUSIC algorithm performs a computationally expensive search over a fine grid, Gradient-MUSIC is significantly more efficient and eliminates the need for discretization over a fine grid by using optimization techniques. It coarsely scans the 1D landscape to find initialization simultaneously for all frequencies followed by parallelizable local refinement via gradient descent. We also analyze its performance when the noise level is sufficiently small and the signal frequencies are separated by at least 8π/m, where π/m is the standard resolution of this problem. Even though the 1D landscape is nonconvex, we prove a global convergence result for Gradient-MUSIC: coarse scanning provably finds suitable initialization and gradient descent converges at a linear rate. In addition to convergence results, we also upper bound the error between the true signal frequencies and amplitudes with those found by Gradient-MUSIC. For example, if the noise has $\ell^\infty$ norm at most ϵ, then the frequencies and amplitudes are recovered up to error at most Cϵ/m and Cϵ respectively, which are minimax optimal in m and ϵ. Our theory can also handle stochastic noise with performance guarantees under nonstationary independent Gaussian noise. Our main approach is a comprehensive geometric analysis of the landscape, a perspective that has not been explored before.

97 MATHEMATICS AND COMPUTING↗

Accelerated Dimension-Independent Adaptive Metropolis

This work describes improvements from algorithmic and architectural means to black-box Bayesian inference over high-dimensional parameter spaces. The well-known adaptive Metropolis (AM) algorithm [33] is extended herein to scale asymptotically uniformly with respect to the underlying parameter dimension for Gaussian targets, by respecting the variance of the target. The resulting algorithm, referred to as the dimension-independent adaptive Metropolis (DIAM) algorithm, also shows improved performance with respect to adaptive Metropolis on non-Gaussian targets. This algorithm is further improved, and the possibility of probing high-dimensional (with dimension d 1000) targets is enabled, via GPU-accelerated numerical libraries and periodically synchronized concurrent chains (justi ed a posteriori). Asymptotically in dimension, this GPU implementation exhibits a factor of four improvement versus a competitive CPU-based Intel MKL parallel version alone. Strong scaling to concurrent chains is exhibited, through a combination of longer time per sample batch (weak scaling) and yet fewer necessary samples to convergence. The algorithm performance is illustrated on several Gaussian and non-Gaussian target examples, in which the dimension may be in excess of one thousand.

97 MATHEMATICS AND COMPUTING↗

Sub-10 second fly-scan nano-tomography using machine learning

Abstract X-ray computed tomography is a versatile technique for 3D structure characterization. However, conventional reconstruction algorithms require that the sample not change throughout the scan, and the timescale of sample dynamics must be longer than the data acquisition time to fulfill the stable sample requirement. Meanwhile, concerns about X-ray-induced parasite reaction and sample damage have driven research efforts to reduce beam dosage. Here, we report a machine-learning-based image processing method that can significantly reduce data acquisition time and X-ray dose, outperforming conventional approaches like Filtered-Back Projection, maximum-likelihood, and model-based maximum-a-posteriori probability. Applying machine learning, we achieve ultrafast nano-tomography with sub-10 second data acquisition time and sub-50 nm pixel resolution in a transmission X-ray microscope. We apply our algorithm to study dynamic morphology changes in a lithium-ion battery cathode under a heating rate of 50 o C min −1 , revealing crack self-healing during thermal annealing. The proposed method can be applied to various tomography modalities.

36 MATERIALS SCIENCE↗

The free energy of the metastable supersaturated vapor via restricted ensemble simulations. III. An extension to the Corti and Debenedetti subcell constraint algorithm

In order to improve the sampling of restricted microstates in our previous work [C. Nie, J. Geng, and W. H. Marlow, J. Chem. Phys. 127, 154505 (2007); 128, 234310 (2008)] and quantitatively predict thermal properties of supersaturated vapors, an extension is made to the Corti and Debenedetti subcell constraint algorithm [D. S. Corti and P. Debenedetti, Chem. Eng. Sci. 49, 2717 (1994)], which restricts the maximum allowed local density at any point in a simulation box. The maximum allowed local density at a point in a simulation box is defined by the maximum number of particles N{sub m} allowed to appear inside a sphere of radius R, with this point as the center of the sphere. Both N{sub m} and R serve as extra thermodynamic variables for maintaining a certain degree of spatial homogeneity in a supersaturated system. In a restricted canonical ensemble, at a given temperature and an overall density, series of local minima on the Helmholtz free energy surface F(N{sub m}, R) are found subject to different (N{sub m}, R) pairs. The true equilibrium metastable state is identified through the analysis of the formation free energies of Stillinger clusters of various sizes obtained from these restricted states. The simulation results of a supersaturated Lennard-Jones vapor at reduced temperature 0.7 including the vapor pressure isotherm, formation free energies of critical nuclei, and chemical potential differences are presented and analyzed. In addition, with slight modifications, the current algorithm can be applied to computing thermal properties of superheated liquids.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Remote Sensing of Volcanic Clouds: Sulfur Gases and Plume Top Topography

New absorption line parameters for H2S were published and submitted to the Gestion et Etude des Informations Spectroscopiques Atmospheriques (GEISA) and high resolution transmission molecular absorption (HITRAN) databases. These new absorption line parameters will make it possible to use observations from the future Tropospheric Emission Spectrometer (TES) instrument [Earth Observing System (EOS) Chemistry Mission (CHEM) platform] to make more accurate H2S measurements if it observes an H2S-rich volcanic cloud. H2S is the second most abundant volcanic sulfur gas, and like SO2, it also converts to H2SO4 aerosols and can have a climate impact. A paper on the Moderate-resolution Imaging-Spectroradiometer (MODIS) SO2 alert is being revised. New aspects in the revision include verification of the SO2 alert during the EOS mission; factors affecting SO2 detection at thermal infrared, ultraviolet, and microwave wavelengths; radiative transfer tests; more description of satellite instruments; and thermal surface alert installed for MODIS. Her research involves the use of remote sensing to generate maps of plume top altitude. This parameter is important for models of volcanic eruption, aircraft hazards, and climate impact. The topographic shape of the top surface of a volcanic plume can provide information necessary to understand the physics controlling the injection and dispersal of a volcanic plume in the atmosphere. Glaze et al. describe the application of a photoclinometric technique to volcanic plumes. The software algorithm has been improved to account for more general plume and illumination geometries and for easily extracting position information directly from Advanced Very High-Resolution Radiometer (AVHRR) level 1B data. Testing of the algorithm has focused on acquiring AVHRR data for a variety of volcanic plumes in an effort to identify problems with the software as well as model sensitivities. The plumes chosen were erupted from volcanoes at a variety of latitudes, at different times of day, and in different seasons. Another important issue that is being investigated is the importance of plume opacity. A diagram illustrates the method for deriving phi, the angle a wind-blown plume makes with the horizontal, in the direction perpendicular to the remote sensing scan. A figure shows a sample output of the algorithm, a wire mesh map of plume top topography. Additional information is contained in the original.

Crisp, Joy A.↗

CATS: The Hubble Constant from Standardized TRGB and Type Ia Supernova Measurements

The tip of the red giant branch (TRGB) provides a luminous standard candle for constructing distance ladders to measure the Hubble constant. In practice, its measurements via edge-detection response (EDR) are complicated by the apparent fuzziness of the tip and the multipeak landscape of the EDR. Previously, we optimized an unsupervised algorithm, Comparative Analysis of TRGBs, to minimize the variance among multiple halo fields per host without relying on individualized choices, achieving state-of-the-art ~<0.05 mag distance measures for optimal data. Here we apply this algorithm to an expanded sample of SN Ia hosts to standardize these to multiple fields in the geometric anchor, NGC 4258. In concert with the Pantheon+ SN Ia sample, this analysis produces a (baseline) result of H 0 = 73.22 ± 2.06 km s -1 Mpc -1 . The largest difference in H 0 between this and similar studies employing the TRGB derives from corrections for SN survey differences and local flows used in the most recent SN Ia compilations that were absent in earlier studies. The SN-related differences total ~2.0 km s -1 Mpc -1 . A smaller share, ~1.4 km s -1 Mpc -1 , results from the inhomogeneity of the TRGB calibration across the distance ladder. We employ a grid of 108 variants around the optimal TRGB algorithm and find that the median of the variants is 72.94 ± 1.98 km s -1 Mpc -1 with an additional uncertainty due to algorithm choices of 0.83 km s -1 Mpc -1 . None of these TRGB variants result in an H 0 of less than 71.6 km s -1 Mpc -1 .

79 ASTRONOMY AND ASTROPHYSICS↗

Greedy emulators for nuclear two-body scattering

Applications of reduced basis method emulators are increasing in low-energy nuclear physics because they enable fast and accurate sampling of high-fidelity calculations, enabling robust uncertainty quantification. Here, in this paper, we develop, implement, and test two model-driven emulators based on the (Petrov-)Galerkin projection using the prototypical test case of two-body scattering with the Minnesota potential and a more realistic local chiral potential. The high-fidelity scattering equations are solved with the matrix Numerov method, a reformulation of the popular Numerov recurrence relation for solving special second-order differential equations as a linear system of coupled equations. A novel error estimator based on reduced-space residuals is applied to an active learning approach (a greedy algorithm) to choosing training samples (“snapshots”) for the emulator and contrasted with a proper orthogonal decomposition (POD) approach. Both approaches allow for computationally efficient offline-online decompositions, but the greedy approach requires many fewer snapshot calculations. These developments set the groundwork for emulating scattering observables based on chiral nucleon-nucleon and three-nucleon interactions and optical models, where computational speed-ups are necessary for Bayesian uncertainty quantification. Our emulators and error estimators are widely applicable to linear systems.

Bayesian methods↗

Estimation of distributions via multilevel Monte Carlo with stratified sampling

We design and implement a novel algorithm for computing a multilevel Monte Carlo (MLMC) estimator of the joint cumulative distribution function (CDF) of a vector-valued quantity of interest in problems with random input parameters and initial conditions. Our approach combines MLMC with stratified sampling of the input sample space by replacing standard Monte Carlo at each level with stratified Monte Carlo initialized with proportionally allocated samples. We show that the resulting stratified MLMC (sMLMC) algorithm is more efficient than its standard MLMC counterpart due to the additional variance reduction provided by the stratification of the random parameter's domain, especially at the coarsest levels. Additional computational cost savings are obtained by smoothing the indicator function with a Gaussian kernel, which proves to be an efficient and robust alternative to recently developed polynomial-based techniques.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

ON THE ESTIMATION OF RANDOM UNCERTAINTIES OF STAR FORMATION HISTORIES

The standard technique for measurement of random uncertainties of star formation histories (SFHs) is the bootstrap Monte Carlo, in which the color-magnitude diagram (CMD) is repeatedly resampled. The variation in SFHs measured from the resampled CMDs is assumed to represent the random uncertainty in the SFH measured from the original data. However, this technique systematically and significantly underestimates the uncertainties for times in which the measured star formation rate is low or zero, leading to overly (and incorrectly) high confidence in that measurement. This study proposes an alternative technique, the Markov Chain Monte Carlo (MCMC), which samples the probability distribution of the parameters used in the original solution to directly estimate confidence intervals. While the most commonly used MCMC algorithms are incapable of adequately sampling a probability distribution that can involve thousands of highly correlated dimensions, the Hybrid Monte Carlo algorithm is shown to be extremely effective and efficient for this particular task. Several implementation details, such as the handling of implicit priors created by parameterization of the SFH, are discussed in detail.

79 ASTRONOMY AND ASTROPHYSICS↗

Advanced modeling of field enhanced thermionic emission

Shaped emitters are of interest to a broad range of applications in vacuum electronic devices. In particular, thermionic energy converters (TECs) take advantage of shaped emitters to increase the local surface field, thereby extracting more current for a given cathode temperature and applied voltage. However, modeling these devices is challenging; Warp [J.-L. Vay, D. P. Grote, R. H. Cohen, and A. Friedman, Comput. Sci. Discov. 5, 014019 (2012)] is a fully 3D particle-in-cell code capable of handling a wide range of physics problems and is well suited to modeling TECs. Additionally, recent improvements to Warp have enabled the accurate modeling of emitters with arbitrary curved surfaces. Specifically, the inclusion of subgrid resolution for computing the electrostatic potential and the ability to apply mesh refinement for specific areas of interest allow for a more accurate solution to the fields on these surfaces. These improvements coupled with Warp’s ability to handle variable particle weights make it an ideal candidate for simulating these complex devices. In this paper, the authors study the applicability of different subgrid configurations for simulating shaped emission surfaces and field convergence for different mesh-refinement techniques. They then implement a custom weighting algorithm that allows for uniform sampling of emission surfaces with a large variation in the surface electric field. They then use this algorithm to study emission for curved emitters in both the field-enhancement regime and the space-charge regime.

Edelen, Jonathan P. (ORCID:0000000215180652)↗

Self-supervised physics-informed generative networks for phase retrieval from a single X-ray hologram

X-ray phase contrast imaging significantly improves the visualization of structures with weak or uniform absorption, broadening its applications across a wide range of scientific disciplines. Propagation-based phase contrast is particularly suitable for time- or dose-critical in vivo/in situ/operando (tomography) experiments because it requires only a single intensity measurement. However, the phase information of the wave field is lost during the measurement and must be recovered. Conventional algebraic and iterative methods often rely on specific approximations or boundary conditions that may not be met by many samples or experimental setups. In addition, they require manual tuning of reconstruction parameters by experts, making them less adaptable for complex or variable conditions. Here we present a self-learning approach for solving the inverse problem of phase retrieval in the near-field regime of Fresnel theory using a single intensity measurement (hologram). A physics-informed generative adversarial network is employed to reconstruct both the phase and absorbance of the unpropagated wave field in the sample plane from a single hologram. Unlike most state-of-the-art deep learning approaches for phase retrieval, our approach does not require paired, unpaired, or simulated training data. This significantly broadens the applicability of our approach, as acquiring or generating suitable training data remains a major challenge due to the wide variability in sample types and experimental configurations. The algorithm demonstrates robust and consistent performance across diverse imaging conditions and sample types, delivering quantitative, high-quality reconstructions for both simulated data and experimental datasets acquired at beamline P05 at PETRA III (DESY, Hamburg), operated by Helmholtz-Zentrum Hereon. Furthermore, it enables the simultaneous retrieval of both phase and absorption information.

36 MATERIALS SCIENCE↗

Determining the Bayesian optimal sampling strategy in a hierarchical system.

Consider a classic hierarchy tree as a basic model of a 'system-of-systems' network, where each node represents a component system (which may itself consist of a set of sub-systems). For this general composite system, we present a technique for computing the optimal testing strategy, which is based on Bayesian decision analysis. In previous work, we developed a Bayesian approach for computing the distribution of the reliability of a system-of-systems structure that uses test data and prior information. This allows for the determination of both an estimate of the reliability and a quantification of confidence in the estimate. Improving the accuracy of the reliability estimate and increasing the corresponding confidence require the collection of additional data. However, testing all possible sub-systems may not be cost-effective, feasible, or even necessary to achieve an improvement in the reliability estimate. To address this sampling issue, we formulate a Bayesian methodology that systematically determines the optimal sampling strategy under specified constraints and costs that will maximally improve the reliability estimate of the composite system, e.g., by reducing the variance of the reliability distribution. This methodology involves calculating the 'Bayes risk of a decision rule' for each available sampling strategy, where risk quantifies the relative effect that each sampling strategy could have on the reliability estimate. A general numerical algorithm is developed and tested using an example multicomponent system. The results show that the procedure scales linearly with the number of components available for testing.

99 GENERAL AND MISCELLANEOUS↗

Recovering magnetization distributions from their noisy diffraction data

We study, using simulated experiments inspired by thin-film magnetic domain patterns, the feasibility of phase retrieval in x-ray diffractive imaging in the presence of intrinsic charge scattering given only photon-shot-noise limited diffraction data. We detail a reconstruction algorithm to recover the sample's magnetization distribution under such conditions and compare its performance with that of Fourier transform holography. Concerning the design of future experiments, we also chart out the reconstruction limits of diffractive imaging when photon-shot-noise and the intensity of charge scattering noise are independently varied. This work is directly relevant to the time-resolved imaging of magnetic dynamics using coherent and ultrafast radiation from x-ray free-electron lasers and also to broader classes of diffractive imaging experiments which suffer noisy data, missing data, or both.

36 MATERIALS SCIENCE↗

Analytic treatment of source photon emission times to reduce noise in implicit Monte Carlo calculations

Statistical uncertainty is inherent to any Monte Carlo simulation of radiation transport problems. In space-angle-frequency independent radiative transfer calculations, the uncertainty in the solution is entirely due to random sampling of source photon emission times. We have developed a modification to the Implicit Monte Carlo algorithm that eliminates noise due to sampling of the emission time of source photons. In problems that are independent of space, angle, and energy, the new algorithm generates a smooth solution, while a standard implicit Monte Carlo solution is noisy. For space- and angle-dependent problems, the new algorithm exhibits reduced noise relative to standard implicit Monte Carlo in some cases, and comparable noise in all other cases. In conclusion, the improvements are limited to short time scales; over long time scales, noise due to random sampling of spatial and angular variables tends to dominate the noise reduction from the new algorithm.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Experimental and Phenomenological Investigations of the MiniBooNE Anomaly

This thesis covers a range of experimental and theoretical efforts to elucidate the origin of the $4.8\sigma$ MiniBooNE low energy excess (LEE). We begin with the follow-up MicroBooNE experiment, which took data along the BNB from 2016 to 2021. This thesis specifically presents MicroBooNE's search for $\nu_e$ charged-current quasi-elastic (CCQE) interactions consistent with two-body scattering. The two-body CCQE analysis uses a novel reconstruction process, including a number of deep-learning-based algorithms, to isolate a sample of $\nu_e$ CCQE interaction candidates with $75\%$ purity. The analysis rules out an entirely $\nu_e$-based explanation of the MiniBooNE excess at the $2.4\sigma$ confidence level. We next perform a combined fit of MicroBooNE and MiniBooNE data to the popular $3+1$ model; even after the MicroBooNE results, allowed regions in $\Delta m^2$-$\sin^2 2_{\theta_{\mu e}}$ parameter space exist at the $3\sigma$ confidence level. This thesis also demonstrates that the MicroBooNE data are consistent with a $\overline{\nu}_e$-based explanation of the MiniBooNE LEE at the $<2\sigma$ confidence level. Next, we investigate a phenomenological explanation of the MiniBooNE excess combining the $3+1$ model with a dipole-coupled heavy neutral lepton (HNL). It is shown that a 500 MeV HNL can accommodate the energy and angular distributions of the LEE at the $2\sigma$ confidence level while avoiding stringent constraints derived from MINER$\nu$A elastic scattering data. Finally, we discuss the Coherent CAPTAIN-Mills experiment--a 10-ton light-based liquid argon detector at Los Alamos National Laboratory. The background rejection achieved from a novel Cherenkov-based reconstruction algorithm will enable world-leading sensitivity to a number of beyond-the-Standard Model physics scenarios, including dipole-coupled HNLs.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Bayesian high-redshift quasar classification from optical and MID-IR photometry

We identify 885,503 type 1 quasar candidates to i≲22 using the combination of optical and mid-IR photometry. Optical photometry is taken from the Sloan Digital Sky Survey-III: Baryon Oscillation Spectroscopic Survey (SDSS-III/BOSS), while mid-IR photometry comes from a combination of data from the Wide-field Infrared Survey Explorer (WISE) “AllWISE” data release and several large-area Spitzer Space Telescope fields. Selection is based on a Bayesian kernel density algorithm with a training sample of 157,701 spectroscopically confirmed type 1 quasars with both optical and mid-IR data. Of the quasar candidates, 733,713 lack spectroscopic confirmation (and 305,623 are objects that we have not previously classified as photometric quasar candidates). These candidates include 7874 objects targeted as high-probability potential quasars with 3.5 3.5 than the traditional mid-IR selection “wedges” and to 2.2 3. This catalog paves the way for luminosity-dependent clustering investigations of large numbers of faint, high-redshift quasars and for further machine-learning quasar selection using Spitzer and WISE data combined with other large-area optical imaging surveys.

79 ASTRONOMY AND ASTROPHYSICS↗

Accurate Characterization of Real Networks from Inaccurate Measurements

Our nation's dependence on information networks makes it vital to anticipate disruptions or find weaknesses in these networks. But networks like the Internet are vast, distributed, and there is no mechanism to completely collect their structure. We are restricted to specific data collection schemes (like traceroute samples from router interfaces) that examine tiny portions of such a network. It has been empirically documented and theoretically proven that these measurements have significant biases, and direct inferences from them will be wrong. But these data collection mechanisms have limited flexibility and cannot be easily modified. Moreover, in many applications there are limits on how much data can be collected. How do we make accurate inferences of network properties with biased and limited measurements? The general problem this report deals with is how to work with incompletely observed networks. We will present several different approaches to this problem. First we will present an approach to estimate the degree distribution of a graph by sampling only a small portion of the vertices. This algorithm provides provably accurate results with sublinear samples. An alternative approach would be to try to enhance the information in the by selective collecting new information by probing for neighbors of a vertex or presence of individual edges. A different setting for working with incomplete arises when we have full access to local information, but do not have any global version of the graph. Can we still identify critical nodes in such a graph? We present an approach to identify such nodes efficiently. Finally, how can we put these ideas together to identify the structure of a network? We present an approach that can complement the existing approaches for network mapping. We start with an estimate of network structure based on existing network mapping methods. Then we find a critical router in the network, use the traffic through this network to selectively collect new data to enhance our prediction.

97 MATHEMATICS AND COMPUTING↗

Deep reinforcement learning for class imbalance fault diagnosis of equipment in nuclear power plants

In equipment fault diagnosis in nuclear power plants, there may be far more samples in one class (e.g., a health state) than in another class (e.g., a fault state). The distribution of data in each class is highly skewed. Most machine learning algorithms are suitable for balanced training datasets. When faced with imbalanced samples, these algorithms tend to provide good identification for the majority classes and bias for the minority classes. However, the misclassification of minority classes can lead to high costs. To address the above problem, this paper develops a deep reinforcement learning-based diagnosis method that models fault diagnosis as a sequential decision-making process. At each time step, the agent receives the state of the environment represented by the training samples and then takes a diagnosis action guided by a policy. If the action is correct/incorrect, the agent receives a positive/negative reward. The reward for minority classes is higher than that for majority classes. The agent’s goal is to obtain as many cumulative rewards as possible in the process, i.e., to identify the sample as correctly as possible. Six demonstration scenarios are constructed, depending on the selected fault datasets and the designed model structures. Experiments show that the proposed method achieves a higher weighted-averaged F1 score than the classical supervised learning method in most cases of class imbalance. Finally, the proposed method has potential applications in the field of class imbalance fault diagnosis of equipment in nuclear power plants.

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗