Engineering Papers⌕ Search

SEARCH · Engineering Papers

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 847 records · Page 47
All sourcesNASA NTRSDOE OSTI
NASA NTRS2014

Application of Machine Learning Algorithms to the Study of Noise Artifacts in Gravitational-Wave Data

The sensitivity of searches for astrophysical transients in data from the Laser Interferometer Gravitationalwave Observatory (LIGO) is generally limited by the presence of transient, non-Gaussian noise artifacts, which occur at a high-enough rate such that accidental coincidence across multiple detectors is non-negligible. Furthermore, non-Gaussian noise artifacts typically dominate over the background contributed from stationary noise. These "glitches" can easily be confused for transient gravitational-wave signals, and their robust identification and removal will help any search for astrophysical gravitational-waves. We apply Machine Learning Algorithms (MLAs) to the problem, using data from auxiliary channels within the LIGO detectors that monitor degrees of freedom unaffected by astrophysical signals. Terrestrial noise sources may manifest characteristic disturbances in these auxiliary channels, inducing non-trivial correlations with glitches in the gravitational-wave data. The number of auxiliary-channel parameters describing these disturbances may also be extremely large; high dimensionality is an area where MLAs are particularly well-suited. We demonstrate the feasibility and applicability of three very different MLAs: Artificial Neural Networks, Support Vector Machines, and Random Forests. These classifiers identify and remove a substantial fraction of the glitches present in two very different data sets: four weeks of LIGO's fourth science run and one week of LIGO's sixth science run. We observe that all three algorithms agree on which events are glitches to within 10% for the sixth science run data, and support this by showing that the different optimization criteria used by each classifier generate the same decision surface, based on a likelihood-ratio statistic. Furthermore, we find that all classifiers obtain similar limiting performance, suggesting that most of the useful information currently contained in the auxiliary channel parameters we extract is already being used. Future performance gains are thus likely to involve additional sources of information, rather than improvements in the MLAs themselves.

gravitational-wave data↗
DOE OSTI2020

A hybrid calibration approach to Hertz-type contact parameters for discrete element models

This study aims at providing a hybrid calibration framework to estimate Hertz-type contact parameters (particle-scale shear modulus and Poisson ratio) for both two-dimensional and three-dimensional discrete element modelling (DEM). On the basis of statistically isotropic granular packings, a set of analytical formulae between macroscopic material parameters (Young modulus and Poisson ratio) and particle-scale Hertz-type contact parameters for granular systems are derived under small-strain isotropic stress conditions. However, the derived analytical solutions are only estimated values for general models. By viewing each DEM modelling as an implicit mathematical function taking the particle-level parameters as independent variables and employing the derived analytical solutions as the initial input parameters, an automatic iterative scheme is proposed to obtain the calibrated parameters with higher accuracies. Considering highly nonlinear features and discontinuities of the macro-micro relationship in Hertz-based discrete element models, the adaptive moment estimation algorithm is adopted in this study because of its capacity of dealing with noise gradients of cost functions. Here, the proposed method is validated with several numerical cases including randomly distributed monodisperse and polydisperse packings. Noticeable improvements in terms of calibration efficiency and accuracy have been made.

Constitutive law↗
DOE OSTI2020

Stochastic Fault Detection

This entry describes the state-of-the-art and future perspectives on stochastic fault detection, namely, stochastic fault detection and diagnosis (FDD). Both model-based and data-driven FDD methods for stochastic signals and systems have been included, where the use of hypothesis testing, Kalman filtering, system estimation, principal component analysis (PCA), and stochastic distribution control has been discussed for the construction of effective FDD algorithms. Indeed, stochastic FDD constitute an important and integrated part in developing fault-tolerant controls (FTC) for guaranteed safe operation of control systems, of which increased penetration of random factors is inevitable nowadays.

Wang, Aiping↗
DOE OSTI2020

Stochastic AC optimal power flow: A data-driven approach

There is an emerging need for efficient solutions to stochastic AC Optimal Power Flow (AC-OPF) to ensure optimal and reliable grid operations in the presence of increasing demand and generation uncertainty. Herein this paper presents a highly scalable data-driven algorithm for stochastic AC-OPF that has extremely low sample requirement. The novelty behind the algorithm’s performance involves an iterative scenario design approach that merges information regarding constraint violations in the system with data-driven sparse regression. Compared to conventional methods with random scenario sampling, our approach is able to provide feasible operating points for realistic systems with much lower sample requirements. Furthermore, multiple sub-tasks in our approach can be easily paralleled and based on historical data to enhance its performance and application. We demonstrate the computational improvements of our approach through simulations on different test cases in the IEEE PES PGLib-OPF benchmark library.

42 ENGINEERING↗
DOE OSTI2023

Land surface dynamics and meteorological forcings modulate land surface temperature characteristics

This study examines the effect of land cover, vegetation health, climatic forcings, elevation heat loads, and terrain characteristics (LVCET) on land surface temperature (LST) distribution over West Africa (WA). We employ fourteen machine-learning models, which preserve nonlinear relationships, to downscale LST and other predictands while preserving the geographical variability of WA. Our results showed that the random forest model performs best in downscaling predictands. This is important for the sub-region since it has limited access to mainframes to power multiplex machine-learning algorithms. In contrast to the northern regions, the southern regions consistently exhibit healthy vegetation. Also, areas with unhealthy vegetation coincide with hot LST clusters. The positive Normalized Difference Vegetation Index (NDVI) trends in the Sahel underscore rainfall recovery and subsequent Sahelian greening. The southwesterly winds cause the upwelling of cold waters, lowering LST in southern WA and highlighting the cooling influence of water bodies on LST. Identifying regions with elevated LST is paramount for prioritizing greening initiatives, and our study underscores the importance of considering LVCET factors in urban planning. Topographic slope-facing angles, heat loads, and diurnal anisotropic heat all contribute to variations in LST, emphasizing the need for a holistic approach when designing resilient and sustainable landscapes.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2024

Simulating Z 2 lattice gauge theory on a quantum computer

The utility of quantum computers for simulating lattice gauge theories is currently limited by the noisiness of the physical hardware. Various quantum error mitigation strategies exist to reduce the statistical and systematic uncertainties in quantum simulations via improved algorithms and analysis strategies. We perform quantum simulations of Z 2 gauge theory with matter to study the efficacy and interplay of different error mitigation methods: readout error mitigation, randomized compiling, rescaling, and dynamical decoupling. We compute Minkowski correlation functions in this confining gauge theory and extract the mass of the lightest spin-1 state from fits to their time dependence. Quantum error mitigation extends the range of times over which our correlation function calculations are accurate by a factor of 6 and is therefore essential for obtaining reliable masses.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2021

A Machine Learning-based Reliability Evaluation Model for Integrated Power-Gas Systems

This article proposes a hybrid machine learning method for the reliability evaluation of integrated power-gas systems (IPGS) under the uncertain component failure probability distributions. The Random Forest (RF) method is designed to select important features to solve the insufficient quantity of data and the curse of dimensionality problems. The Extreme Gradient Boosting (XGBoost) regression algorithm is developed to quantify the relationship between the uncertain parameters and reliability metrics. Moreover, a ten-fold cross-validation method is employed to further improve the accuracy of the regression model. Simulation results on three test systems show that the proposed method can achieve high accuracy for the reliability evaluation.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2022

Provably efficient machine learning for quantum many-body problems

Classical machine learning (ML) provides a potentially powerful approach to solving challenging quantum many-body problems in physics and chemistry. However, the advantages of ML over traditional methods have not been firmly established. In this work, we prove that classical ML algorithms can efficiently predict ground-state properties of gapped Hamiltonians after learning from other Hamiltonians in the same quantum phase of matter. By contrast, under a widely accepted conjecture, classical algorithms that do not learn from data cannot achieve the same guarantee. We also prove that classical ML algorithms can efficiently classify a wide range of quantum phases. Extensive numerical experiments corroborate our theoretical results in a variety of scenarios, including Rydberg atom systems, two-dimensional random Heisenberg models, symmetry-protected topological phases, and topologically ordered phases.

Science & Technology - Other Topics↗
NASA NTRS1972

Orbit determination in the presence of unmodeled accelerations.

In the investigation discussed here, the unmodeled acceleration is approximated as a first-order stationary Gauss-Markov process which can be separated into a time wise correlated component and a purely random component. An extended form of the Kalman-Bucy filter is used to estimate the state and the unmodeled accelerations at each observation epoch. Applications of the estimation algorithm to simulated data and to tracking data obtained during the Apollo 10 and 11 missions indicate that a more accurate estimate of the state is obtained using the algorithm and that the estimated values of the unmodeled accelerations can be correlated with physical phenomena neglected by the mathematical model.

Tapley, B. D.↗
NASA NTRS1988

Robot path planning using a genetic algorithm

Robot path planning can refer either to a mobile vehicle such as a Mars Rover, or to an end effector on an arm moving through a cluttered workspace. In both instances there may exist many solutions, some of which are better than others, either in terms of distance traversed, energy expended, or joint angle or reach capabilities. A path planning program has been developed based upon a genetic algorithm. This program assumes global knowledge of the terrain or workspace, and provides a family of good paths between the initial and final points. Initially, a set of valid random paths are constructed. Successive generations of valid paths are obtained using one of several possible reproduction strategies similar to those found in biological communities. A fitness function is defined to describe the goodness of the path, in this case including length, slope, and obstacle avoidance considerations. It was found that with some reproduction strategies, the average value of the fitness function improved for successive generations, and that by saving the best paths of each generation, one could quite rapidly obtain a collection of good candidate solutions.

Cleghorn, Timothy F.↗
NASA NTRS1992

Atmospheric and surface temperatures and airborne dust amounts during late southern summer from Mariner 9 IRIS data

The temperature structure and dust loading of the Martian atmosphere are investigated using thermal emission spectra recorded in 1972 by the Mariner 9 infrared interferometer spectrometer (IRIS). The analysis focuses on a subset of data consisting of approximately 2400 spectra obtained near the end of the southern summer season (L(sub s) equal to 343 deg to 348 deg), after the global dust storm had largely abated and airborne dust amounts were subsiding to background values. Simultaneous retrieval of the vertical distribution of both atmospheric temperature and dust optical depth is accomplished through an iterative procedure which is performed on each individual spectrum. The atmospheric transmittances are calculated using a Voigt quasi-random band model, which includes absorption by CO2 and dust, but neglects the effects of multiple scattering. Vertical profiles of temperature and dust optical depth are obtained using modified algorithms. These profiles are used to construct global maps of temperature and dust optical depth as functions of latitude (+/- 90 deg), altitude (approximately 0-50 km), and local time of day.

Santee, M.↗
NASA NTRS1994

Solution and reasoning reuse in space planning and scheduling applications

In the space domain, as in other domains, the CSP (Constraint Satisfaction Problems) techniques are increasingly used to represent and solve planning and scheduling problems. But these techniques have been developed to solve CSP's which are composed of fixed sets of variables and constraints, whereas many planning and scheduling problems are dynamic. It is therefore important to develop methods which allow a new solution to be rapidly found, as close as possible to the previous one, when some variables or constraints are added or removed. After presenting some existing approaches, this paper proposes a simple and efficient method, which has been developed on the basis of the dynamic backtracking algorithm. This method allows previous solution and reasoning to be reused in the framework of a CSP which is close to the previous one. Some experimental results on general random CSPs and on operation scheduling problems for remote sensing satellites are given.

Verfaillie, Gerard↗
DOE OSTI2021

A Robust Approach to Sequential Information Theoretic Planning

In many sequential planning applications a natural approach to generating high quality plans is to maximize an information reward such as mutual information (MI). Unfortunately, MI lacks a closed form in all but trivial models, and so must be estimated. In applications where the cost of plan execution is expensive, one desires planning estimates which admit theoretical guarantees. Through the use of robust M-estimators we obtain bounds on absolute deviation of estimated MI. Moreover, we propose a sequential algorithm which integrates inference and planning by maximally reusing particles in each stage. We validate the utility of using robust estimators in the sequential approach on a Gaussian Markov Random Field wherein information measures have a closed form. Lastly, we demonstrate the benefits of our integrated approach in the context of sequential experiment design for inferring causal regulatory networks from gene expression levels. Here, our method shows improvements over a recent method which selects intervention experiments based on the same MI objective.

Zheng, Sue↗
NASA NTRS2002

Experimental Investigations of Non-Stationary Properties In Radiometer Receivers Using Measurements of Multiple Calibration References

Radiometers must be periodically calibrated because the receiver response fluctuates. Many techniques exist to correct for the time varying response of a radiometer receiver. An analytical technique has been developed that uses generalized least squares regression (LSR) to predict the performance of a wide variety of calibration algorithms. The total measurement uncertainty including the uncertainty of the calibration can be computed using LSR. The uncertainties of the calibration samples used in the regression are based upon treating the receiver fluctuations as non-stationary processes. Signals originating from the different sources of emission are treated as simultaneously existing random processes. Thus, the radiometer output is a series of samples obtained from these random processes. The samples are treated as random variables but because the underlying processes are non-stationary the statistics of the samples are treated as non-stationary. The statistics of the calibration samples depend upon the time for which the samples are to be applied. The statistics of the random variables are equated to the mean statistics of the non-stationary processes over the interval defined by the time of calibration sample and when it is applied. This analysis opens the opportunity for experimental investigation into the underlying properties of receiver non stationarity through the use of multiple calibration references. In this presentation we will discuss the application of LSR to the analysis of various calibration algorithms, requirements for experimental verification of the theory, and preliminary results from analyzing experiment measurements.

Racette, Paul↗
DOE OSTI2021

Data-driven Event Identification in the U.S. Power Systems Based on 2D-OLPP and RUSBoosting Trees

Accurate event identification is an essential part of situation awareness ability for power system operators. Therefore, this work proposes an integrated event identification algorithm for power systems. First, to obtain and filter suitable inputs for event identification, an event detection trigger based on the rate of change of frequency (RoCoF) is presented. Then, the wave arrival time difference-based triangulation method considering the anisotropy of wave propagation speed is utilized to estimate the location of the detected event. Next, the two-dimensional orthogonal locality preserving projection (2D-OLPP)-based method, which is suitable for multiple types of measured data, is employed to achieve higher effectiveness in extracting the event features compared with traditional one-dimensional projection and principle component analysis (PCA). Finally, the random undersampling boosted (RUSBoosted) trees-based classifier, which can mitigate the data sample imbalance issue, is utilized to identify the type of the detected event. Furthermore, the proposed approach is demonstrated using the actual measurement data of U.S. power systems from FNET/GridEye. Comparison results show that the proposed event identification algorithm can achieve better performance than existing approaches.

24 POWER TRANSMISSION AND DISTRIBUTION↗
NASA NTRS2003

Using a Genetic Algorithm to Design Nuclear Electric Spacecraft

The basic approach to to design nuclear electric spacecraft is to generate a group of candidate designs, see how "fit" the design are, and carry best design forward to the next generation. Some designs eliminated, some randomly modified and carried forward.

Pannell, William P.↗
NASA NTRS1997

Retrieval of Soil Moisture and Roughness from the Polarimetric Radar Response

The main objective of this investigation was the characterization of soil moisture using imaging radars. In order to accomplish this task, a number of intermediate steps had to be undertaken. In this proposal, the theoretical, numerical, and experimental aspects of electromagnetic scattering from natural surfaces was considered with emphasis on remote sensing of soil moisture. In the general case, the microwave backscatter from natural surfaces is mainly influenced by three major factors: (1) the roughness statistics of the soil surface, (2) soil moisture content, and (3) soil surface cover. First the scattering problem from bare-soil surfaces was considered and a hybrid model that relates the radar backscattering coefficient to soil moisture and surface roughness was developed. This model is based on extensive experimental measurements of the radar polarimetric backscatter response of bare soil surfaces at microwave frequencies over a wide range of moisture conditions and roughness scales in conjunction with existing theoretical surface scattering models in limiting cases (small perturbation, physical optics, and geometrical optics models). Also a simple inversion algorithm capable of providing accurate estimates of soil moisture content and surface rms height from single-frequency multi-polarization radar observations was developed. The accuracy of the model and its inversion algorithm is demonstrated using independent data sets. Next the hybrid model for bare-soil surfaces is made fully polarimetric by incorporating the parameters of the co- and cross-polarized phase difference into the model. Experimental data in conjunction with numerical simulations are used to relate the soil moisture content and surface roughness to the phase difference statistics. For this purpose, a novel numerical scattering simulation for inhomogeneous dielectric random surfaces was developed. Finally the scattering problem of short vegetation cover above a rough soil surface was considered. A general scattering model for grass-blades of arbitrary cross section was developed and incorporated in a first order random media model. The vegetation model and the bare-soil model are combined and the accuracy of the combined model is evaluated against experimental observations from a wheat field over the entire growing season. A complete set of ground-truth data and polarimetric backscatter data were collected. Also an inversion algorithm for estimating soil moisture and surface roughness from multi-polarized multi-frequency observations of vegetation-covered ground is developed.

Sarabandi, Kamal↗
DOE OSTI2025

Superspin renormalization and slow relaxation in random spin systems

We develop an excited-state real-space renormalization group (RSRG-X) formalism to describe the dynamics of conserved densities in randomly interacting spin-12 systems. Our formalism is suitable for systems with U(1) and Z2 symmetries, and we apply it to chains of randomly positioned spins with dipolar XX+YY interactions, as arise in Rydberg quantum simulators and other platforms. The formalism generates a sequence of effective Hamiltonians that provide approximate descriptions for dynamics on successively smaller energy scales. These effective Hamiltonians involve “superspins”: two-level collective degrees of freedom constructed from (anti)aligned microscopic spins. Conserved densities can then be understood as relaxing via coherent collective spin flips. For the well-studied simpler case of randomly interacting nearest-neighbor XX+YY chains, the superspins reduce to single spins. Our formalism also leads to a numerical method capable of simulating the dynamics up to an otherwise inaccessible combination of large system size and late time. Focusing on disorder-averaged infinite-temperature autocorrelation functions, in particular the spin survival probability Sp¯(t), we demonstrate quantitative agreement between our algorithm and exact diagonalization (ED) at low but nonzero frequencies. Such agreement holds for chains with nearest-neighbor, next-nearest-neighbor, and long-range dipolar interactions. Our results indicate decay of Sp¯(t) slower than any power law and feature no significant deviation from the ∼1/ln2(t) asymptote expected from the infinite-randomness fixed-point of the nearest-neighbor model. We also apply the RSRG-X formalism to two-dimensional long-range systems of moderate size and find slow late-time decay of Sp¯(t).

Zhao, Yi J↗