Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Randomized methods”

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 127 records · Page 7

Critical points of the random cluster model with Newman–Ziff sampling

Here, we present a method for computing transition points of the random cluster model using a generalization of the Newman–Ziff algorithm, a celebrated technique in numerical percolation, to the random cluster model. The new method is straightforward to implement and works for real cluster weight q > 0. Furthermore, results for an arbitrary number of values of q can be found at once within a single simulation. Because the algorithm used to sweep through bond configurations is identical to that of Newman and Ziff, which was conceived for percolation, the method loses accuracy for large lattices when q > 1. However, by sampling the critical polynomial, accurate estimates of critical points in two dimensions can be found using relatively small lattice sizes, which we demonstrate here by computing critical points for non-integer values of q on the square lattice, to compare with the exact solution, and on the unsolved non-planar square matching lattice. The latter results would be much more difficult to obtain using other techniques.

97 MATHEMATICS AND COMPUTING↗

Comparison of Machine Learning Algorithms for Natural Gas Identification with Mixed Potential Electrochemical Sensor Arrays

Mixed-potential electrochemical sensor arrays consisting of indium tin oxide (ITO), La 0.87 Sr 0.13 CrO 3 , Au, and Pt electrodes can detect the leaks from natural gas infrastructure. Algorithms are needed to correctly identify natural gas sources from background natural and anthropogenic sources such as wetlands or agriculture. We report for the first time a comparison of several machine learning methods for mixture identification in the context of natural gas emissions monitoring by mixed potential sensor arrays. Random Forest, Artificial Neural Network, and Nearest Neighbor methods successfully classified air mixtures containing only CH 4 , two types of natural gas simulants, and CH 4 +NH 3 with >98% identification accuracy. The model complexity of these methods were optimized and the degree of robustness against overfitting was determined. Finally, these methods are benchmarked on both desktop PC and single-board computer hardware to simulate their application in a portable internet-of-things sensor package. The combined results show that the random forest method is the preferred method for mixture identification with its high accuracy (>98%), robustness against overfitting with increasing model complexity, and had less than 10 ms training time and less than 0.1 ms inference time on single-board computer hardware.

03 NATURAL GAS↗

Multilevel Hierarchical Decomposition of Finite Element White Noise with Application to Multilevel Markov Chain Monte Carlo

In this work we develop a new hierarchical multilevel approach to generate Gaussian random field realizations in an algorithmically scalable manner that is well suited to incorporating into multilevel Markov chain Monte Carlo (MCMC) algorithms. This approach builds off of other partial differential equation (PDE) approaches for generating Gaussian random field realizations; in particular, a single field realization may be formed by solving a reaction-diffusion PDE with a spatial white noise source function as the right-hand side. While these approaches have been explored to accelerate forward uncertainty quantification tasks, e.g., multilevel Monte Carlo, the previous constructions are not directly applicable to multilevel MCMC frameworks which build fine-scale random fields in a hierarchical fashion from coarse-scale random fields. Our new hierarchical multilevel method relies on a hierarchical decomposition of the white noise source function in $L^2$ which allows us to form Gaussian random field realizations across multiple levels of discretization in a way that fits into multilevel MCMC algorithmic frameworks. After presenting our main theoretical results and numerical scaling results to showcase the utility of this new hierarchical PDE method for generating Gaussian random field realizations, this method is tested on a four-level MCMC algorithm to explore its feasibility.

algebraic multigrid↗

Novel pore size-controlled, susceptibility matched, 3D-printed MRI phantoms

We report the design concept and fabrication of MRI phantoms, containing blocks of aligned microcapillaires that can be stacked into larger arrays to construct diameter distribution phantoms or fractured, to create a “powder-averaged” emulsion of randomly oriented blocks for vetting or calibrating advanced MRI methods, that is, diffusion tensor imaging, AxCaliber MRI, MAP-MRI, and multiple pulsed field gradient or double diffusion-encoded microstructure imaging methods. The goal was to create a susceptibility-matched microscopically anisotropic but macroscopically isotropic phantom with a ground truth diameter that could be used to vet advanced diffusion methods for diameter determination in fibrous tissues. Two-photon polymerization, a novel three-dimensional printing method is used to fabricate blocks of capillaries. Double diffusion encoding methods were employed and analyzed to estimate the expected MRI diameter. Susceptibility-matched microcapillary blocks or modules that can be assembled into large-scale MRI phantoms have been fabricated and measured using advanced diffusion methods, resulting in microscopic anisotropy and random orientation. This phantom can vet and calibrate various advanced MRI methods and multiple pulsed field gradient or diffusion-encoded microstructure imaging methods. We demonstrated that two double diffusion encoding methods underestimated the ground truth diameter.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A Machine Learning-Based Vulnerability Analysis for Cascading Failures of Integrated Power-Gas Systems

This article proposes a cascading failure simulation (CFS) method and a hybrid machine learning method for vulnerability analysis of integrated power-gas systems (IPGSs). The CFS method is designed to study the propagating process of cascading failures between the two systems, generating data for machine learning with initial states randomly sampled. The proposed method considers generator and gas well ramping, transmission line and gas pipeline tripping, island issue handling and load shedding strategies. Then, a hybrid machine learning model with a combined random forest (RF) classification and regression algorithms is proposed to investigate the impact of random initial states on the vulnerability metrics of IPGSs. Extensive case studies are carried out on three test IPGSs to verify the proposed models and algorithms. Simulation results show that the proposed models and algorithms can achieve high accuracy for the vulnerability analysis of IPGSs.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Quasiparticle random-phase approximation calculations for M 1 transitions with the noniterative finite-amplitude method and application to neutron radiative capture cross sections

Here, we derive the equations of quasiparticle random-phase approximation (QRPA) based on the finite amplitude method with the Hartree-Fock+Bardeen–Cooper–Schrieffer (HF+BCS) single-particle states, and calculate the magnetic dipole (M⁢1) transition for deformed gadolinium isotopes. Our QRPA calculation shows both large spin-flip transitions in the 5 to 10 MeV excitation energy and the low energy orbital transition that would correspond to the M⁢1 scissors mode observed in nuclear experiments. Then, we calculate neutron capture reactions based on the statistical Hauser-Feshbach theory with the photoabsorption cross sections of even-even nuclei given by QRPA. We find that the capture cross section is enhanced due to the contribution from the low energy M⁢1 transition although the calculated capture cross section still underestimates the experimental data. This issue in the calculated capture cross section could be improved by uncertainties of the low energy E⁢1 transition neglected in our QRPA calculation.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

RanCompute: Computational Security in Embedded Devices via Random Input and Output Encodings

An embedded device in an insecure environment is subject to additional security risk through capture and reverse-engineering by a capable adversary. If this device contains a microchip performing sensitive computations, capture of the chip may leak functionality to an adversary. In this paper we propose a novel method in which we randomly encode the input operands and the outputs of a computation, thus not revealing the arithmetic operations being performed. The operations are sequenced in a graph representing the overall application. Once the initialization values are overwritten and lost, the results of these computations are indecipherable by the device performing the calculations as well as by any adversary. The result is transmitted back to a secure server which has stored the initialization values and so can decode the results which appear random to the adversary.

Embedded computing↗

Effect of dehydroepiandrosterone administration before in vitro fertilization on the live birth rate in poor ovarian responders according to the Bologna criteria: A randomised controlled trial

Abstract Objective To evaluate the effect of dehydroepiandrosterone (DHEA) pre‐treatment before in vitro fertilization and embryo transfer (IVF‐ET) on the live birth rate in infertile women with poor ovarian response (POR) defined according to the Bologna criteria. Design A randomized, double‐blind, placebo‐controlled trial. Setting Nine reproductive medical centers in China. Population A total of 821 participants with POR defined according to the Bologna criteria were enrolled in the study between April 2016 and December 2018. Methods Eligible participants were randomly assigned to receive either DHEA ( n = 410) or placebo ( n = 411) treatments for 4–12 weeks prior to IVF‐ET, in a 1:1 ratio. Main outcome measures Live birth rate after the first embryo transfer. Results Thirty‐six (8.8%) of 410 women in the DHEA group and 37 (9.0%) of 411 women in the placebo group had a live birth, with no significant difference observed between groups (relative risk, 0.98, 95% CI, 0.63–1.51; p = 0.911). There were no significant differences in the number of retrieved oocytes, and the rates of clinical pregnancy, pregnancy loss, and cumulative live births between the two groups. Conclusions DHEA administration prior to IVF‐ET had no beneficial effect on the live birth rate relative to placebo in women with POR defined according to the Bologna criteria. Tweetable Abstract No benefit was found in poor ovarian responders who received DHEA administration prior to IVF.

Wang, Ze↗

Stochastic Trust-Region Algorithm in Random Subspaces with Convergence and Expected Complexity Analyses

Here, this work proposes a framework for large-scale stochastic derivative-free optimization (DFO) by introducing STARS, a trust-region method based on iterative minimization in random subspaces. This framework is both an algorithmic and theoretical extension of a random subspace derivative-free optimization (RSDFO) framework, and an algorithm for stochastic optimization with random models (STORM). Moreover, like RSDFO, STARS achieves scalability by minimizing interpolation models that approximate the objective in low-dimensional affine subspaces, thus significantly reducing per-iteration costs in terms of function evaluations and yielding strong performance on largescale stochastic DFO problems. The user-determined dimension of these subspaces, when the latter are defined, for example, by the columns of so-called Johnson-Lindenstrauss transforms, turns out to be independent of the dimension of the problem. For convergence purposes, inspired by the analyses of RSDFO and STORM, both a particular quality of the subspace and the accuracies of random function estimates and models are required to hold with sufficiently high, but fixed, probabilities. Using martingale theory under the latter assumptions, an almost sure global convergence of STARS to a first-order stationary point is shown, and the expected number of iterations required to reach a desired first-order accuracy is proved to be similar to that of STORM and other stochastic DFO algorithms, up to constants.

97 MATHEMATICS AND COMPUTING↗

Propagation of partially spatially coherent laser beams in instantaneous Kerr media

The propagation of intense, partially spatially coherent laser beams in a medium with instantaneous third-order susceptibility is studied analytically and numerically. For sufficiently high power relative to that required for nonlinear self-focusing, the propagation initially proceeds in two stages. In the first stage, spatial coherence builds up, and in the second stage, the number of speckles reduces. Once the degree of coherence is sufficiently high, whole-beam self-focusing occurs. The beam power is mostly confined within the initial spot radius. Two analytical approaches for describing the evolution of the beam are presented. The method of moments leads to an analytical solution for the rms spot radius that is in excellent agreement with simulations. This method does not require any knowledge of the field statistics beyond the initial conditions and provides no information about the evolution of the individual speckles. The other approach employs a self-similar solution for the second-order coherence function of the field and assumes that the fourth-order coherence function is factorizable and obeys complex circular Gaussian random statistics. The latter method also leads to an analytical expression for the spot radius, but its predictions for the qualitative evolution of the speckles disagree with wave-optics simulations.

lasers↗

Randomized Preconditioned Solvers for Strong Constraint 4D-Var Data Assimilation

The Strong Constraint 4D Variational (SC-4DVAR) data assimilation method is widely used in climate and weather applications. SC-4DVAR involves solving a minimization problem to compute the maximum a posteriori estimate, which we tackle using the Gauss-Newton method. The computation of the descent direction is expensive since it involves the solution of a large-scale and potentially ill-conditioned linear system, solved using the preconditioned conjugate gradient (PCG) method. Here, to address this cost, we efficiently construct scalable preconditioners using three different randomization techniques, which all rely on a certain low-rank structure involving the Gauss-Newton Hessian. The proposed techniques come with theoretical guarantees on the condition number, and at the same time, are amenable to parallelization. We also develop an adaptive approach to estimate the sketch size and choose between the reuse or recomputation of the preconditioner. We demonstrate the performance and effectiveness of our methodology on two representative model problems—the Burgers and barotropic vorticity equation—showing a drastic reduction in both the number of PCG iterations and the number of Gauss-Newton Hessian products after including the preconditioner construction cost.

Gauss-Newton↗

Peridynamic Models for Random Media Found by Coarse Graining

Using coarse graining, the upscaled mechanical properties of a solid with small scale heterogeneities are derived. The method maps internal forces at the small scale onto peridynamic bond forces in the coarse grained mesh. These upscaled bond forces are used to calibrate a peridynamic material model with position-dependent parameters. These parameters incorporate mesoscale variations in the statistics of the small scale system. The upscaled peridynamic model can have a much coarser discretization than the original small scale model, allowing larger scale simulations to be performed efficiently. The convergence properties of the method are investigated for representative random microstructures. In conclusion, a bond breakage criterion for the upscaled peridynamic material model is also demonstrated.

36 MATERIALS SCIENCE↗

Designing an Intrusion Detection for an Adjustable Speed Drive System Controlling a Critical Process

In this article, we address the cyber-security problem of industrial control systems (ICSs) when their sensor measurements may be compromised due to an attacker who has intercepted those measurements via a network. We introduce a general-purpose method “Dynamic Watermarking (DW)” to detect potential cyber-intrusions on speed sensor measurements within industrial control systems, which deploy an adjustable speed drive (ASD) to control a critical process. The DW method is injecting a random private low-amplitude signal with a zero mean Gaussian distribution, “watermark”, into one of the input phase voltages powering the ASD system. The watermark signal propagates through the system including pulse width modulation (PWM) power conversion stage and motor, then ultimately appears in the speed sensor measurements. By deploying two statistical DW tests with two proper thresholds, the system can detect potential cyber-intrusions or unobservable cyber-attacks such as replay attacks and false data injection attacks (FDIA). The DW method tested on a laboratory-scale ASD system experimentally to protect the system against cyber-intrusions. This system, powered by a commercial PWM drive operating at 208 V, 3-phase, and 3.7 kW, served as our experimental platform.

42 ENGINEERING↗

Linear growth of circuit complexity from Brownian dynamics

How rapidly can a many-body quantum system generate randomness? Using path integral methods, we demonstrate that Brownian quantum systems have circuit complexity that grows linearly with time. In particular, we study Brownian clusters of N spins or fermions with time-dependent all-to-all interactions, and calculate the Frame Potential to characterize complexity growth in these models. In both cases the problem can be mapped to an effective statistical mechanics problem which we study using path integral methods. Within this framework it is straightforward to show that the kth Frame Potential comes within ϵ of the Haar value after a time of order t ~ kN + k log k + log ϵ –1 . Using a bound on the diamond norm, this implies that such circuits are capable of coming very close to a unitary k-design after a time of order t ~ kN. We also consider the same question for systems with a time-independent Hamiltonian and argue that a small amount of time-dependent randomness is sufficient to generate a k-design in linear time provided the underlying Hamiltonian is quantum chaotic. These models provide explicit examples of linear complexity growth that are analytically tractable and are directly applicable to practical applications calling for unitary k-designs.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

A novel data gaps filling method for solar PV output forecasting

This study proposes a modified gaps filling method, expanding the column mean imputation method and evaluated using randomly generated missing values comprising 5%, 10%, 15%, and 20% of the original data on power output. The XGBoost algorithm was implemented as a forecasting model using the original and processed datasets and two sources of solar radiation data, namely, Shortwave Radiation (SWR) from Advanced Himawari Imager 8 (AHI-8) and Surface Solar Radiation Downward (SSRD) from ERA5 global reanalysis data. Further, the accuracy of the two sets of forecasted power output was evaluated using Root Mean Square Error (RMSE) and Mean Absolute Error (MAE). Results show that by applying the proposed gap filling method and using SWR in forecasting solar photovoltaic (PV) output, the improvement in the RMSE and MAE values range from 12.52% to 24.30% and from 21.10% to 31.31%, respectively. Meanwhile, using SSRD, the improvement in the RMSE values range from 14.01% to 28.54% and MAE values from 22.39% to 35.53%. To further evaluate the accuracy of the proposed gap-filling method, the proposed method could be validated using different datasets and other forecasting methods. Future studies could also consider applying the said method to datasets with data gaps higher than 20%.

Energy & Fuels↗

Deep material network via a quilting strategy: visualization for explainability and recursive training for improved accuracy

Recent developments integrating micromechanics and neural networks offer promising paths for rapid predictions of the response of heterogeneous materials with similar accuracy as direct numerical simulations. The deep material network is one such approaches, featuring a multi-layer network and micromechanics building blocks trained on anisotropic linear elastic properties. Once trained, the network acts as a reduced-order model, which can extrapolate the material’s behavior to more general constitutive laws, including nonlinear behaviors, without the need to be retrained. However, current training methods initialize network parameters randomly, incurring inevitable training and calibration errors. Here, we introduce a way to visualize the network parameters as an analogous unit cell and use this visualization to “quilt” patches of shallower networks to initialize deeper networks for a recursive training strategy. The result is an improvement in the accuracy and calibration performance of the network and an intuitive visual representation of the network for better explainability.

97 MATHEMATICS AND COMPUTING↗

Multiscale modeling of solute diffusion in triblock copolymer membranes

We develop a multiscale simulation model for diffusion of solutes through porous triblock copolymer membranes. The approach combines two techniques: self-consistent field theory (SCFT) to predict the structure of the self-assembled, solvated membrane and on-lattice kinetic Monte Carlo (kMC) simulations to model diffusion of solutes. Solvation is simulated in SCFT by constraining the glassy membrane matrix while relaxing the brush-like membrane pore coating against the solvent. The kMC simulations capture the resulting solute spatial distribution and concentration-dependent local diffusivity in the polymer-coated pores; we parameterize the latter using particle-based simulations. We apply our approach to simulate solute diffusion through nonequilibrium morphologies of a model triblock copolymer, and we correlate diffusivity with structural descriptors of the morphologies. We also compare the model’s predictions to alternative approaches based on simple lattice random walks and find our multiscale model to be more robust and systematic to parameterize. Furthermore, our multiscale modeling approach is general and can be readily extended in the future to other chemistries, morphologies, and models for the local solute diffusivity and interactions with the membrane.

36 MATERIALS SCIENCE↗

Photoionization of Atomic Systems Using the Random-Phase Approximation Including Relativistic Interactions

Approximation methods are unavoidable in solving a many-electron problem. One of the most successful approximations is the random-phase approximation (RPA). Miron Amusia showed that it can be used successfully to describe atomic photoionization processes of many-electron atomic systems. In this article, the historical reasons behind the term “random-phase approximation” are revisited. A brief introduction to the relativistic RPA (RRPA) developed by Walter Johnson and colleagues is provided and some of its illustrative applications are presented.

74 ATOMIC AND MOLECULAR PHYSICS↗