Search NASA⌕ Search

SEARCH · Search NASA

Results for “randomized 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 523 records · Page 29

Neural Algorithms for Low Power Implementation of Partial Differential Equations

The rise of low-power neuromorphic hardware has the potential to change high-performance computing; however much of the focus on brain-inspired hardware has been on machine learning applications. A low-power solution for solving partial differential equations could radically change how we approach large-scale computing in the future. The random walk is a fundamental stochastic process that underlies many numerical tasks in scientific computing applications. We consider here two neural algorithms that can be used to efficiently implement random walks on spiking neuromorphic hardware. The first method tracks the positions of individual walkers independently by using a modular code inspired by grid cells in the brain. The second method tracks the densities of random walkers at each spatial location directly. We present the scaling complexity of each of these methods and illustrate their ability to model random walkers under different probabilistic conditions. Finally, we present implementations of these algorithms on neuromorphic hardware.

97 MATHEMATICS AND COMPUTING↗

Technical note: Uncertainties in eddy covariance CO 2 fluxes in a semiarid sagebrush ecosystem caused by gap-filling approaches

Abstract. Gap-filling eddy covariance CO2 fluxes is challenging at dryland sites due to small CO2 fluxes. Here, four machine learning (ML) algorithms including artificial neural network (ANN), k-nearest neighbors (KNNs), random forest (RF), and support vector machine (SVM) are employed and evaluated for gap-filling CO2 fluxes over a semiarid sagebrush ecosystem with different lengths of artificial gaps. The ANN and RF algorithms outperform the KNN and SVM in filling gaps ranging from hours to days, with the RF being more time efficient than the ANN. Performances of the ANN and RF are largely degraded for extremely long gaps of 2 months. In addition, our results suggest that there is no need to fill the daytime and nighttime net ecosystem exchange (NEE) gaps separately when using the ANN and RF. With the ANN and RF, the gap-filling-induced uncertainties in the annual NEE at this site are estimated to be within 16 g C m−2, whereas the uncertainties by the KNN and SVM can be as large as 27 g C m−2. To better fill extremely long gaps of a few months, we test a two-layer gap-filling framework based on the RF. With this framework, the model performance is improved significantly, especially for the nighttime data. Therefore, this approach provides an alternative in filling extremely long gaps to characterize annual carbon budgets and interannual variability in dryland ecosystems.

Yao, Jingyu↗

Note: Fully integrated 3.2 Gbps quantum random number generator with real-time extraction

We present a real-time and fully integrated quantum random number generator (QRNG) by measuring laser phase fluctuations. The QRNG scheme based on laser phase fluctuations is featured for its capability of generating ultra-high-speed random numbers. However, the speed bottleneck of a practical QRNG lies on the limited speed of randomness extraction. To close the gap between the fast randomness generation and the slow post-processing, we propose a pipeline extraction algorithm based on Toeplitz matrix hashing and implement it in a high-speed field-programmable gate array. Further, all the QRNG components are integrated into a module, including a compact and actively stabilized interferometer, high-speed data acquisition, and real-time data post-processing and transmission. The final generation rate of the QRNG module with real-time extraction can reach 3.2 Gbps.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Emergence of randomness and arrow of time in quantum walks

Quantum walks are powerful tools not only for constructing the quantum speedup algorithms but also for describing specific models in physical processes. Furthermore, the discrete time quantum walk has been experimentally realized in various setups. We apply the concept of the quantum walk to the problems in quantum foundations. We show that randomness and the arrow of time in the quantum walk gradually emerge by periodic projective measurements from the mathematically obtained limit distribution under the time-scale transformation.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

The generation of random variates from a relativistic Maxwellian distribution

A procedure for generating random variates from a relativistic Maxwellian distribution with arbitrary temperature and drift velocity is presented. The algorithm is based on the rejection method and can be used to initialize particle velocities in kinetic simulations of plasmas and gases.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Linear-scaling implementation of the direct random-phase approximation

We report the linear-scaling implementation of the direct random-phase approximation (dRPA) for closed-shell molecular systems. As a bonus, linear-scaling algorithms are also presented for the second-order screened exchange extension of dRPA as well as for the second-order Møller–Plesset (MP2) method and its spin-scaled variants. Our approach is based on an incremental scheme which is an extension of our previous local correlation method [Rolik et al., J. Chem. Phys. 139, 094105 (2013)]. The approach extensively uses local natural orbitals to reduce the size of the molecular orbital basis of local correlation domains. In addition, we also demonstrate that using natural auxiliary functions [M. Kállay, J. Chem. Phys. 141, 244113 (2014)], the size of the auxiliary basis of the domains and thus that of the three-center Coulomb integral lists can be reduced by an order of magnitude, which results in significant savings in computation time. The new approach is validated by extensive test calculations for energies and energy differences. Our benchmark calculations also demonstrate that the new method enables dRPA calculations for molecules with more than 1000 atoms and 10 000 basis functions on a single processor.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Photometric redshift estimation of BASS DR3 quasars by machine learning

ABSTRACT Correlating Beijing–Arizona Sky Survey (BASS) data release 3 (DR3) catalogue with the ALLWISE data base, the data from optical and infrared information are obtained. The quasars from Sloan Digital Sky Survey are taken as training and test samples while those from LAMOST are considered as external test sample. We propose two schemes to construct the redshift estimation models with XGBoost, CatBoost, and Random Forest. One scheme (namely one-step model) is to predict photometric redshifts directly based on the optimal models created by these three algorithms; the other scheme (namely two-step model) is to first classify the data into low- and high-redshift data sets, and then predict photometric redshifts of these two data sets separately. For one-step model, the performance of these three algorithms on photometric redshift estimation is compared with different training samples, and CatBoost is superior to XGBoost and Random Forest. For two-step model, the performances of these three algorithms on the classification of low and high redshift subsamples are compared, and CatBoost still shows the best performance. Therefore, CatBoost is regarded as the core algorithm of classification and regression in two-step model. In contrast to one-step model, two-step model is optimal when predicting photometric redshift of quasars, especially for high-redshift quasars. Finally, the two models are applied to predict photometric redshifts of all quasar candidates of BASS DR3. The number of high-redshift quasar candidates is 3938 (redshift ≥3.5) and 121 (redshift ≥4.5) by two-step model. The predicted result will be helpful for quasar research and follow-up observation of high-redshift quasars.

79 ASTRONOMY AND ASTROPHYSICS↗

Sensitivity estimation in time-of-flight list-mode positron emission tomography

Purpose: An accurate quantification of the images in positron emission tomography (PET) requires knowing the actual sensitivity at each voxel, which represents the probability that a positron emitted in that voxel is finally detected as a coincidence of two gamma rays in a pair of detectors in the PET scanner. This sensitivity depends on the characteristics of the acquisition, as it is affected by the attenuation of the annihilation gamma rays in the body, and possible variations of the sensitivity of the scanner detectors. In this work, the authors propose a new approach to handle time-of-flight (TOF) list-mode PET data, which allows performing either or both, a self-attenuation correction, and self-normalization correction based on emission data only. Methods: The authors derive the theory using a fully Bayesian statistical model of complete data. The authors perform an initial evaluation of algorithms derived from that theory and proposed in this work using numerical 2D list-mode simulations with different TOF resolutions and total number of detected coincidences. Effects of randoms and scatter are not simulated. Results: The authors found that proposed algorithms successfully correct for unknown attenuation and scanner normalization for simulated 2D list-mode TOF-PET data. Conclusions: A new method is presented that can be used for corrections for attenuation and normalization (sensitivity) using TOF list-mode data.

60 APPLIED LIFE SCIENCES↗

Data-Driven Security Assessment of Power Grids Based on Machine Learning Approach: Preprint

Data-driven security assessment provides key indicators on power system stability using simulations on scheduling models, as opposed to dynamic simulations that are more time-consuming. This paper investigates data-driven security assessment of power grids based on machine learning. Multivariate random forest regression is used as the machine learning algorithm due to its high robustness to the input data. Three stability issues are analyzed using the proposed machine learning tool, including transient stability, frequency stability and small signal stability. The estimation values from machine learning tool are compared with those from dynamic simulations. Results show that the proposed machine learning tool can effectively predict the stability margins for the three stability metrics.

14 SOLAR ENERGY↗

Fouling modeling and prediction approach for heat exchangers using deep learning

In this article, we develop a generalized and scalable statistical model for accurate prediction of fouling resistance using commonly measured parameters of industrial heat exchangers. This prediction model is based on deep learning where a scalable algorithmic architecture learns non-linear functional relationships between a set of target and predictor variables from large number of training samples. Here, the efficacy of this modeling approach is demonstrated for predicting fouling in an analytically modeled cross-flow heat exchanger, designed for waste heat recovery from flue-gas using room temperature water. The performance results of the trained models demonstrate that the mean absolute prediction errors are under 10 –4 KW –1 for flue-gas side, water side and overall fouling resistances. The coefficients of determination (R 2 ), which characterize the goodness of fit between the predictions and observed data, are over 99%. Even under varying levels of measurement noise in the inputs, we demonstrate that predictions over an ensemble of multiple neural networks achieves better accuracy and robustness to noise. We find that the proposed deep-learning fouling prediction framework learns to follow heat exchanger flow and heat transfer physics, which we confirm using locally interpretable model agnostic explanations around randomly selected operating points. Overall, we provide a robust algorithmic framework for fouling prediction that can be generalized and scaled to various types of industrial heat exchangers.

42 ENGINEERING↗

Particle-image Velocimetry Sensitivity through Automatic Differentiation

A commonly encountered difficulty in modern experimental fluid dynamics experiments is the need for full-flow visualization and measurement; traditional techniques such as hot-wire probes and laser Doppler velocimetry cannot provide such information without difficult scanning procedures. Particle-image velocimetry (PIV) is a measurement technique which can overcome this spatial limitation to provide real-time three-dimensional fluid velocity vectors for an entire plane within the flow, as opposed to a single point that is provided by other measurement techniques. To accomplish this, a PIV system seeds the fluid flow with tracer particles; these must have nearly the same density as that of the fluid and a high drag coefficient to ensure that they follow the fluid flow without deviation. A laser is sent through optics to expand its beam into a sheet which illuminates the plane of interest in the fluid. The particles reflect more light than the fluid, and their image is recorded using a high speed camera. Due to limitations in bandwidth, video cannot be taken fast enough to be useful, and instead pairs of images are captured with a known separation in time. The illuminated particles will move between the two images taken by the camera, and their relative motion can be used to compute the fluid velocity at that point. When a single camera is used, only two-dimensional velocity vectors can be computed, but with the addition of another camera this can be improved to full three-dimensional vectors. The flow's time evolution can be measured by taking series of image pairs and processing each pair to get the velocity field at the time between each image pair. Only the two-dimensional version will be considered in this work. To compute the velocity vectors of the flow, the images are broken up into interrogation regions, usually in a uniform grid. In the most basic PIV algorithm, corresponding regions in the image pairs are cross-correlated to compute the most likely displacement from one image to the next. This is used since the cross correlation will achieve a maximum value when the two interrogation regions line up the best. The location of the peak in the correlation map and scaling information for the optical setup is used to compute the particle displacement from one image to the next. This process is similar to holding two semi-transparent images and moving one until they match as well as possible. Sub-pixel displacements between images can be obtained by fitting a Gaussian function to the correlation peak. Knowing the displacement vector for each set of interrogation regions in the image pair, it is a simple matter to divide by the time gap between the two images to compute the fluid velocity at the point in time and space. Since there are many interrogation regions in each image pair, the velocity field for a sheet is sampled according to the arrangement of the interrogation regions. The sensitivity of the final computed vector to the input images is difficult to compute, and has led most considerations of uncertainty in the PIV field to apply Monte Carlo methods and correlations to quantify the systematic and random errors which result from application of various PIV algorithms. In this work, automatic differentiation (AD) has been used to trace the dependence of velocity vectors computed using the correlation-peak PIV algorithm back to the input values given to an artificial image generator. These initial results form the foundation for continued work in the application of AD to algorithms in PIV. They demonstrate that AD methods can be successfully applied to PIV algorithms without undue complexity. The derivatives of each individual vector with regard to the coefficients of the velocity field used to create the artificial images can be computed and the statistics of them considered collectively, or correlated between each other to quantify the effectiveness of a PIV algorithm. With the initial implementation complete, adding extra algorithms is relatively simple and considerable data can be generated for analysis. It is hoped that application of these methods can lead to improved PIV algorithms which demonstrate better sensitivity to small variations in particle displacement. While these methods can be used as an analysis tool for refinement of new algorithms, computation of actual resultant vector sensitivities to input images' individual pixels is the next logical step of this work. Such information will be analyzed with experimental data to produce a better understanding of how output vectors' uncertainty relates to the actual image pairs, and lead to automatic bad vector removal. (authors)

42 ENGINEERING↗

Stochastic many-body perturbation theory for anharmonic molecular vibrations

A new quantum Monte Carlo (QMC) method for anharmonic vibrational zero-point energies and transition frequencies is developed, which combines the diagrammatic vibrational many-body perturbation theory based on the Dyson equation with Monte Carlo integration. The infinite sums of the diagrammatic and thus size-consistent first- and second-order anharmonic corrections to the energy and self-energy are expressed as sums of a few m- or 2m-dimensional integrals of wave functions and a potential energy surface (PES) (m is the vibrational degrees of freedom). Each of these integrals is computed as the integrand (including the value of the PES) divided by the value of a judiciously chosen weight function evaluated on demand at geometries distributed randomly but according to the weight function via the Metropolis algorithm. In this way, the method completely avoids cumbersome evaluation and storage of high-order force constants necessary in the original formulation of the vibrational perturbation theory; it furthermore allows even higher-order force constants essentially up to an infinite order to be taken into account in a scalable, memory-efficient algorithm. The diagrammatic contributions to the frequency-dependent self-energies that are stochastically evaluated at discrete frequencies can be reliably interpolated, allowing the self-consistent solutions to the Dyson equation to be obtained. This method, therefore, can compute directly and stochastically the transition frequencies of fundamentals and overtones as well as their relative intensities as pole strengths, without fixed-node errors that plague some QMC. It is shown that, for an identical PES, the new method reproduces the correct deterministic values of the energies and frequencies within a few cm{sup −1} and pole strengths within a few thousandths. With the values of a PES evaluated on the fly at random geometries, the new method captures a noticeably greater proportion of anharmonic effects.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Machine Learning Classification of Molten Salt Heat Exchanger Channel Plugging using Synthetic Data

This report addresses the requirements of Milestone M3.4 AI capability to identify and predict maintenance events. Development of digital twins (DT) for molten salt reactor (MSR) components is crucial for reducing operating and maintenance costs (O&M) and ensuring commercial viability of these reactors. Our focus is on development of DT for MSR primary system heat exchanger (HX), a critical component, the fault in which can reduce operating efficiency and force reactor shutdown. We are investigating the feasibility of a conceptual DT of HX consisting of internal distributed temperature sensing with fiber optics and machine learning (ML) algorithms to detect and localize faults. To determine the optimal approach to detection and localization of channel plugging, we benchmark seven different ML models: Logistic Regression, K-Nearest Neighbors (KNN), Gaussian Naïve Bayes, Support Vector Machines (SVM), Decision Tree Classifier, Random Forest Tree Classifier, and Feed-Forward Neural Network. ML algorithms are benchmarked using synthetic HX plugging data generated with computational fluid dynamics COMSOL software, with added brown noise to represent experimental noise. We show that the best performance is obtained with the Decision Tree classifier.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Random walk particle tracking simulations of non-Fickian transport in heterogeneous media

Derivations of continuum nonlocal models of non-Fickian (anomalous) transport require assumptions that might limit their applicability. We present a particle-based algorithm, which obviates the need for many of these assumptions by allowing stochastic processes that represent spatial and temporal random increments to be correlated in space and time, be stationary or non-stationary, and to have arbitrary distributions. The approach treats a particle trajectory as a subordinated stochastic process that is described by a set of Langevin equations, which represent a continuous time random walk (CTRW). Convolution-based particle tracking (CBPT) is used to increase the computational efficiency and accuracy of these particle-based simulations. The combined CTRW-CBPT approach enables one to convert any particle tracking legacy code into a simulator capable of handling non-Fickian transport.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Adiabatic condition and the quantum hitting time of Markov chains

We present an adiabatic quantum algorithm for the abstract problem of searching marked vertices in a graph, or spatial search. Given a random walk (or Markov chain) P on a graph with a set of unknown marked vertices, one can define a related absorbing walk P{sup '} where outgoing transitions from marked vertices are replaced by self-loops. We build a Hamiltonian H(s) from the interpolated Markov chain P(s)=(1-s)P+sP{sup '} and use it in an adiabatic quantum algorithm to drive an initial superposition over all vertices to a superposition over marked vertices. The adiabatic condition implies that, for any reversible Markov chain and any set of marked vertices, the running time of the adiabatic algorithm is given by the square root of the classical hitting time. This algorithm therefore demonstrates a novel connection between the adiabatic condition and the classical notion of hitting time of a random walk. It also significantly extends the scope of previous quantum algorithms for this problem, which could only obtain a full quadratic speedup for state-transitive reversible Markov chains with a unique marked vertex.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Post-extreme-event restoration using linear topological constraints and DER scheduling to enhance distribution system resilience

In this paper, a post-extreme-event restoration (PEER) algorithm is proposed to improve distribution system resilience. Linear topological constraints are proposed to ensure radial topology after N-k contingencies, possibly in multiple islands. The approach is made comprehensive by considering dispatchable distributed energy resources (DERs), non-dispatchable DERs, and demand responses, as well as on-load tap changers (OLTCs) and shunt capacitors. The goal is to minimize the accumulative expense caused by load reduction payment or penalty, as well as DER operation cost. As a result, the overall system will survive longer with higher resilience during an extreme event. To verify the effectiveness of the PEER algorithm, we proposed a resilience evaluation algorithm using Monte Carlo simulation (MCS) with reduced scenarios. This is based on a probabilistic model for generating random scenarios which consider the uncertainty of line faults and solar irradiance. Combined with the proposed PEER algorithm, this reduced-scenario MCS can evaluate the expected energy not served (EENS) which is an essential index for distribution system resilience. Case studies of the IEEE 33-bus and 123-bus test systems validate the proposed algorithm in reducing EENS.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Modeling and Simulation of High Dimensional Stochastic Multiscale PDE Systems at the Exascale

The thrust of the proposal was to exploit modern data-mining tools in a way that will create a systematic, computer-assisted approach to the representation of random media -- and also to the representation of the solutions of an array of important physicochemical processes that take place in/on such media. A parsimonious representation/parametrization of the random media links directly (via uncertainty quantification tools) to good sampling of the distribution of random media realizations. It also links directly to modern multiscale computational algorithms (like the equation-free approach that has been developed in our group) and plays a crucial role in accelerating the scientific computation of solutions of nonlinear PDE models (deterministic or stochastic) in such media – both solutions in particular realizations of the random media, and estimation of the statistics of the solutions over multiple realizations (e.g. expectations).

97 MATHEMATICS AND COMPUTING↗

Finding diverse ways to improve algebraic connectivity through multi-start optimization

The algebraic connectivity, also known as the Fiedler value, is a spectral measure of network connectivity that can be increased through edge addition. We present an algorithm for producing many diverse ways to add a fixed number of edges to a network to achieve a near optimal Fiedler value. Previous Fielder value optimization algorithms (i.e. the greedy algorithm) output only one solution. Obtaining a single solution is rarely good enough for real-world network redesign problems, as practical constraints (political, physical or financial) may prevent implementation. Our algorithm takes a multi-start optimization approach, adding a random initial edge and then applies a greedy heuristic to improve the Fiedler value. The random choice moves us to a new region of the search space, enabling discovery of diverse solutions. Additionally, we present a Determinantal Point Process framework for quantifying diversity. We then apply a Markov chain Monte Carlo technique to sift through the large number of output solutions and locate a smaller, more manageable collection of highly diverse solutions that can be presented to network redesign engineers. We demonstrate the effectiveness of our algorithm on real-world graphs with varied structures.

97 MATHEMATICS AND COMPUTING↗