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 1,225 records · Page 68
All sourcesNASA NTRSDOE OSTI
NASA NTRS2009

Lossless Astronomical Image Compression and the Effects of Random Noise

In this paper we compare a variety of modern image compression methods on a large sample of astronomical images. We begin by demonstrating from first principles how the amount of noise in the image pixel values sets a theoretical upper limit on the lossless compression ratio of the image. We derive simple procedures for measuring the amount of noise in an image and for quantitatively predicting how much compression will be possible. We then compare the traditional technique of using the GZIP utility to externally compress the image, with a newer technique of dividing the image into tiles, and then compressing and storing each tile in a FITS binary table structure. This tiled-image compression technique offers a choice of other compression algorithms besides GZIP, some of which are much better suited to compressing astronomical images. Our tests on a large sample of images show that the Rice algorithm provides the best combination of speed and compression efficiency. In particular, Rice typically produces 1.5 times greater compression and provides much faster compression speed than GZIP. Floating point images generally contain too much noise to be effectively compressed with any lossless algorithm. We have developed a compression technique which discards some of the useless noise bits by quantizing the pixel values as scaled integers. The integer images can then be compressed by a factor of 4 or more. Our image compression and uncompression utilities (called fpack and funpack) that were used in this study are publicly available from the HEASARC web site.Users may run these stand-alone programs to compress and uncompress their own images.

Pence, William↗
DOE OSTI2023

A bi-level data-driven framework for fault-detection and diagnosis of HVAC systems

Long-term operation of heating, ventilation, and air conditioning (HVAC) systems will eventually lead to a range of HVAC system failures, resulting in excessive energy consumption and maintenance costs. Here, to avoid HVAC malfunctioning, fault detection diagnostic (FDD) is utilized as a common practice. Machine learning methods have lately received considerable interest for FDD analysis of HVAC systems due to their high detection accuracy. Meanwhile, HVAC malfunctions are regarded as rare occurrences, hence normal operating data samples are much more accessible than data samples in faulty and malfunctioning conditions. The dominating frequency of normal operation in HVAC datasets has also led to heavily biased classification algorithms within the literature. Moreover, the focus of previous literature has been on increasing the accuracy of the models which leads to a high number of false positives (misleading alarms) in the system. In order to enhance the performance of diagnostic procedures and fill the mentioned gaps, this study proposes a novel data-driven framework. A bi-level machine learning framework is developed for diagnosing faults in air handling units (AHUs) and rooftop units (RTUs) based on principal component analysis (PCA), time series anomaly detection, and random forest (RF). It is shown that PCA can reduce the dataset dimension with one principal component accounting for 95% of data variance. Also, the random forest could classify the faults with 89% precision for single-zone AHU, 85% precision for RTU, and 79% for multi-zone AHU. By proposing this framework, three persistent challenges are addressed: (I) minimizing false positives; (II) accounting for data imbalance; and (III) normal condition monitoring of equipment.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗
NASA NTRS1983

On obtaining the forward phase functions of Saturn ring features from radio occultation observations

It is noted that the near-forward scattering functions of particles in Saturn ring features are related to 3.6 cm radio occultation power spectra by a Fredholm integral equation of the first kind. The equation reduces to an algebraic system of equation whose solution by usual inversion techniques (that is, least mean squares) is ruled out by the near singularity of the forward transformation matrix. A combination of constrained linear inversion and a filtering algorithm based on eigenvector decomposition of the matrix reduces the instabilities; this yields derived phase functions valid over the range of zero to about 12 mrad. It is noted that these functions represent the collective forward diffraction lobe of particles greater than about 1 m in radius. Since multiple scattering of the signal is a significant effect, the measured phase functions must be adjusted to obtain the singly scattered component. This single-scattering correction is examined for two physical models, namely the monolayer and the classical discrete random slab; in addition, the fraction of opacity in submeter particles for each model for particular ring features is estimated.

Zebker, H. A.↗
DOE OSTI2023

Analytic Theory for the Dynamics of Wide Quantum Neural Networks

Here, parametrized quantum circuits can be used as quantum neural networks and have the potential to outperform their classical counterparts when trained for addressing learning problems. To date, much of the results on their performance on practical problems are heuristic in nature. In particular, the convergence rate for the training of quantum neural networks is not fully understood. Here, we analyze the dynamics of gradient descent for the training error of a class of variational quantum machine learning models. We define wide quantum neural networks as parametrized quantum circuits in the limit of a large number of qubits and variational parameters. Then, we find a simple analytic formula that captures the average behavior of their loss function and discuss the consequences of our findings. For example, for random quantum circuits, we predict and characterize an exponential decay of the residual training error as a function of the parameters of the system. Finally, we validate our analytic results with numerical experiments.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2025

From pixels to patterns: Coupling Optical Coherence Tomography and machine learning for monitoring coastal wetland root systems

Coastal wetlands are crucial in shoreline stabilization, carbon sequestration, and storm protection. Yet, due to limitations in traditional destructive sampling techniques, the belowground biomass (live root mass) and necromass (dead and decaying roots) remain difficult to assess in coastal wetlands, limiting our understanding on coastal resilience, nutrient cycling, and soil structure. This study employs Optical Coherence Tomography (OCT) as a high-resolution imaging technique to analyze root biomass and necromass in the Terrebonne Basin, Louisiana. A Random Forest (RF) model was developed to classify root health states based on OCT-derived features, achieving an accuracy of 70% in distinguishing live from dead root segments. The results demonstrate that OCT, combined with ML, offers a promising novel approach to root analysis, providing fine-scale insights into root morphology and decay patterns that are not easily captured by conventional methods. This research lays the foundation for future integration of OCT with complementary imaging modalities such as X-ray Computed Tomography (XCT) and advanced ML algorithms to enhance classification accuracy and scalability. Future work aims to expand the dataset diversity across different wetland types and apply the methodology for large-scale, repeatable assessments of root biomass turnover and accumulation, with important implications for wetland monitoring, conservation, and restoration under changing environmental conditions.

AI/ML↗
DOE OSTI2020

A Bayesian Approach for Estimating Uncertainty in Stochastic Economic Dispatch considering Wind Power Penetration

The increasing penetration of renewable energy resources in power systems, represented as random processes, converts the traditional deterministic economic dispatch problem into a stochastic one. To estimate the uncertainty in this stochastic economic dispatch problem for forecasting purposes, the conventional Monte-Carlo method is prohibitively time-consuming for practical applications. To overcome this problem, here we propose a novel Gaussian-process-emulator-based approach to quantify the uncertainty in the stochastic economic dispatch considering wind power penetration. Facing high-dimensional real-world data representing the correlated uncertainties from wind generation, a manifold-learning-based Isomap algorithm is proposed to efficiently represent the low-dimensional hidden probabilistic structure of the data. In this low-dimensional latent space, with Latin hypercube sampling as the computer experimental design, a Gaussian-process emulator is used, for the first time, to serve as a nonparametric, surrogate model for the original complicated stochastic economic dispatch model. This reduced-order representative allows us to evaluate the economic dispatch solver at sampled values with a negligible computational cost while maintaining a desirable accuracy. Simulation results conducted on the IEEE 118-bus test system reveal the impressive performance of the proposed method.

17 WIND ENERGY↗
DOE OSTI2023

Projective Hedging Algorithms for Multistage Stochastic Programming, Supporting Distributed and Asynchronous Implementation

Here we propose a decomposition algorithm for multistage stochastic programming that resembles the progressive hedging method of Rockafellar and Wets but is provably capable of several forms of asynchronous operation. We derive the method from a class of projective operator splitting methods fairly recently proposed by Combettes and Eckstein, significantly expanding the known applications of those methods. Our derivation assures convergence for convex problems whose feasible set is compact, subject to some standard regularity conditions and a mild “fairness” condition on subproblem selection. The method’s convergence guarantees are deterministic and do not require randomization, in contrast to other proposed asynchronous variations of progressive hedging. Computational experiments described in an online appendix show the method to outperform progressive hedging on large-scale problems in a highly parallel computing environment.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS1984

Non-Gaussian approach for parametric random vibration of non-linear structures

The dynamic response of a nonlinear, single degree of freedom structural system subjected to a physically white noise parametric excitation is investigated. The Ito stochastic calculus is employed to derive a general differential equation for the moments of the response coordinates. The differential equations of moments of any order are found to be coupled with higher order moments. A non-Gaussian closure scheme is developed to truncate the moment equations up to fourth order. The statistical of the stationary response are computed numerically and compared with analytical solutions predicted by a Gaussian closure scheme and the stochastic averaging method. It is found that the computed results exhibit the jump phenomenon which is typical of the characteristics of deterministic nonlinear systems. In addition, the numerical algorithm leads to multiple solutions all of which give positive mean squares. However, two of these solutions are found to violate the properties of high order moments. One solution preserves the moments properties and demonstrates that the system achieves a stationary response.

Ibrahim, R. A.↗
DOE OSTI2020

Generating realistic building electrical load profiles through the Generative Adversarial Network (GAN)

Building electrical load profiles can improve understanding of building energy efficiency, demand flexibility, and building-grid interactions. Current approaches to generating load profiles are time-consuming and not capable of reflecting the dynamic and stochastic behaviors of real buildings; some approaches also trigger data privacy concerns. In this study, we proposed a novel approach for generating realistic electrical load profiles of buildings through the Generative Adversarial Network (GAN), a machine learning technique that is capable of revealing an unknown probability distribution purely from data. The proposed approach has three main steps: (1) normalizing the daily 24-hour load profiles, (2) clustering the daily load profiles with the k-means algorithm, and (3) using GAN to generate daily load profiles for each cluster. The approach was tested with an open-source database – the Building Data Genome Project. We validated the proposed method by comparing the mean, standard deviation, and distribution of key parameters of the generated load profiles with those of the real ones. The KL divergence of the generated and real load profiles are within 0.3 for majority of parameters and clusters. Additionally, results showed the load profiles generated by GAN can capture not only the general trend but also the random variations of the actual electrical loads in buildings. We report the proposed GAN approach can be used to generate building electrical load profiles, verify other load profile generation models, detect changes to load profiles, and more importantly, anonymize smart meter data for sharing, to support research and applications of grid-interactive efficient buildings.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗
NASA NTRS1972

Development and optimization of a nonlinear multiparameter model for the human operator

A systematic method is proposed for the development, optimization, and comparison of controller-models for the human operator. This is suitable for any designed model, even multiparameter systems. A random search technique is chosen for the parameter optimization. As valuation criteria for the quality of the model development the criterion function - the comparison between the input and output functions of the human operator and those of the model - and the most important characteristic values and functions of the statistical signal theory are used. A nonlinear multiparameter model for the human operator is being designed which considers the complex input information rate per time in a single display. The nonlinear features of the model are effected by a modified threshold element and a decision algorithm. Different display-configurations as well as various transfer functions of the controlled element are explained by different optimized parameter-combinations.

Johannsen, G.↗
NASA NTRS1994

The ground-truth problem for satellite estimates of rain rate

In this paper a scheme is proposed to use a point raingage to compare contemporaneous measurements of rain rate from a single-field-of-view (FOV) estimate based on a satellite remote sensor such as a microwave radiometer. Even in the ideal case the measurements are different because one is at a point and the other is an area average over the field of view. Also the point gage will be located randomly inside the field of view on different overpasses. A space-time spectral formalism is combined with a simple stochastic rain field to find the mean-square deviations between the two systems. It is found that by combining about 60 visits of the satellite to the ground-truth site, the expected error can be reduced to about 10% of the standard deviation of the fluctuations of the systems alone. This seems to be a useful level of tolerance in terms of isolating and evaluating typical biases that might be contaminating retrieval algorithms.

North, Gerald R.↗
DOE OSTI2023

Quantum circuit fidelity estimation using machine learning

The computational power of real-world quantum computers is limited by errors. When using quantum computers to perform algorithms which cannot be efficiently simulated classically, it is important to quantify the accuracy with which the computation has been performed. In this work, we introduce a machine learning-based technique to estimate the fidelity between the state produced by a noisy quantum circuit and the target state corresponding to ideal noise-free computation. Our machine learning model is trained in a supervised manner, using smaller or simpler circuits for which the fidelity can be estimated using other techniques like direct fidelity estimation and quantum state tomography. Here we demonstrate that, for simulated random quantum circuits with a realistic noise model, the trained model can predict the fidelities of more complicated circuits for which such methods are infeasible. In particular, we show that the trained model may make predictions for circuits with higher degrees of entanglement than were available in the training set and that the model may make predictions for non-Clifford circuits even when the training set included only Clifford-reducible circuits. This empirical demonstration suggests classical machine learning may be useful for making predictions about beyond-classical quantum circuits for some non-trivial problems.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS1979

On the distribution of computation for sequential decoding using the stack algorithm

A method is developed for estimating the computational distribution for the stack algorithm for sequential decoding, that is, the probability that the computation required to decode the first branch of the tree is greater than or equal to N, for small N. The analysis relies heavily on the theory of multitype branching processes. A step in the analysis is the determination of the distribution of the minimum of the cumulative metrics along the transmitted path in the code tree. This is used to obtain the distribution of the number of computations made by the decoder in order to decode the first branch in the tree, and this random variable serves as an approximation of the average number of computations per decoded branch. At information rates below the cutoff rate, the calculated computational performance is virtually identical to that obtained by time-consuming simulations.

Johannesson, R.↗
NASA NTRS1997

The Influence of Correlated Crustal Signals in Modelling the Main Geomagnetic Field

Algorithms used in geomagnetic main-field modelling have for the most part treated the noise in the field measurements as if it were white. A major component of the noise consists of the field due to magnetization in the crust and it has been realized for some time that such signals are highly correlated at satellite altitude. Hence approximation by white noise, while of undoubted utility, is of unknown validity. In this paper we study two plausible statistical models for the crustal magnetization, in which the magnetization is a realization of a stationary, isotropic, random process. At a typical satellite altitude the associated fields exhibit significant correlation over ranges as great as 15 deg. or more, which introduces off-diagonal elements into the covariance matrix, elements that have usually been neglected in modelling procedures. Dealing with a full covariance matrix for a large data set would present a formidable computational challenge, but fortunately most of the entries in the covariance matrix are so small that they can be replaced by zeros. The resultant matrix comprises only about 3 per cent non-zero entries and thus we can take advantage of efficient sparse matrix techniques to solve the numerical system. We construct several main-field models based on vertical-component data from a selected 5 deg. by 5 deg. data set derived from the Magsat mission. Models with and without off-diagonal terms are compared.

Rygaard-Hjalsted, C.↗
NASA NTRS2002

Measurements of Turbulence Attenuation by a Dilute Dispersion of Solid Particles in Homogeneous Isotropic Turbulence

This research addresses turbulent gas flows laden with fine solid particles at sufficiently large mass loading that strong two-way coupling occurs. By two-way coupling we mean that the particle motion is governed largely by the flow, while the particles affect the gas-phase mean flow and the turbulence properties. Our main interest is in understanding how the particles affect the turbulence. Computational techniques have been developed which can accurately predict flows carrying particles that are much smaller than the smallest scales of turbulence. Also, advanced computational techniques and burgeoning computer resources make it feasible to fully resolve very large particles moving through turbulent flows. However, flows with particle diameters of the same order as the Kolmogorov scale of the turbulence are notoriously difficult to predict. Some simple flows show strong turbulence attenuation with reductions in the turbulent kinetic energy by up to a factor of five. On the other hand, some seemingly similar flows show almost no modification. No model has been proposed that allows prediction of when the strong attenuation will occur. Unfortunately, many technological and natural two-phase flows fall into this regime, so there is a strong need for new physical understanding and modeling capability. Our objective is to study the simplest possible turbulent particle-laden flow, namely homogeneous, isotropic turbulence with a uniform dispersion of monodisperse particles. We chose such a simple flow for two reasons. First, the simplicity allows us to probe the interaction in more detail and offers analytical simplicity in interpreting the results. Secondly, this flow can be addressed by numerical simulation, and many research groups are already working on calculating the flow. Our detailed data can help guide some of these efforts. By using microgravity, we can further simplify the flow to the case of no mean velocity for either the turbulence or the particles. In fact the addition of gravity as a variable parameter may help us to better understand the physics of turbulence attenuation. The experiments are conducted in a turbulence chamber capable of producing stationary or decaying isotropic turbulence with nearly zero mean flow and Taylor microscale Reynolds numbers up to nearly 500. The chamber is a 410 mm cubic box with the corners cut off to make it approximately spherical. Synthetic jet turbulence generators are mounted in each of the eight corners of the box. Each generator consists of a loudspeaker forcing a plenum and producing a pulsed jet through a 20 mm diameter orifice. These synthetic jets are directed into ejector tubes pointing towards the chamber center. The ejector tubes increase the jet mass flow and decrease the velocity. The jets then pass through a turbulence grid. Each of the eight loudspeakers is forced with a random phase and frequency. The resulting turbulence is highly Isotropic and matches typical behavior of grid turbulence. Measurements of both phases are acquired using particle image velocimetry (PIV). The gas is seeded with approximately 1 micron diameter seeding particles while the solid phase is typically 150 micron diameter spherical glass particles. A double-pulsed YAG laser and a Kodak ES-1.0 10-bit PIV camera provide the PIV images. Custom software is used to separate the images into individual images containing either gas-phase tracers or large particles. Modern high-resolution PIV algorithms are then used to calculate the velocity field. A large set of image pairs are acquired for each case, then the results are averaged both spatially and over the ensemble of acquired images. The entire apparatus is mounted in two racks which are carried aboard NASA's KC-135 Flying Microgravity Laboratory. The rack containing the turbulence chamber, the laser head, and the camera floats freely in the airplane cabin (constrained by competent NASA personnel) to minimize g-jitter.

Eaton, John↗
DOE OSTI2023

Adaptive, problem-tailored variational quantum eigensolver mitigates rough parameter landscapes and barren plateaus

Abstract Variational quantum eigensolvers (VQEs) represent a powerful class of hybrid quantum-classical algorithms for computing molecular energies. Various numerical issues exist for these methods, however, including barren plateaus and large numbers of local minima. In this work, we consider the Adaptive, Problem-Tailored Variational Quantum Eiegensolver (ADAPT-VQE) ansätze, and examine how they are impacted by these local minima. We find that while ADAPT-VQE does not remove local minima, the gradient-informed, one-operator-at-a-time circuit construction accomplishes two things: First, it provides an initialization strategy that can yield solutions with over an order of magnitude smaller error compared to random initialization, and which is applicable in situations where chemical intuition cannot help with initialization, i.e., when Hartree-Fock is a poor approximation to the ground state. Second, even if an ADAPT-VQE iteration converges to a local trap at one step, it can still “burrow” toward the exact solution by adding more operators, which preferentially deepens the occupied trap. This same mechanism helps highlight a surprising feature of ADAPT-VQE: It should not suffer optimization problems due to barren plateaus and random initialization. Even if such barren plateaus appear in the parameter landscape, our analysis suggests that ADAPT-VQE avoids such regions by design.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
NASA NTRS1986

A methodology for airplane parameter estimation and confidence interval determination in nonlinear estimation problems

An algorithm for maximum likelihood (ML) estimation is developed with an efficient method for approximating the sensitivities. The ML algorithm relies on a new optimization method referred to as a modified Newton-Raphson with estimated sensitivities (MNRES). MNRES determines sensitivities by using slope information from local surface approximations of each output variable in parameter space. With the fitted surface, sensitivity information can be updated at each iteration with less computational effort than that required by either a finite-difference method or integration of the analytically determined sensitivity equations. MNRES eliminates the need to derive sensitivity equations for each new model, and thus provides flexibility to use model equations in any convenient format. A random search technique for determining the confidence limits of ML parameter estimates is applied to nonlinear estimation problems for airplanes. The confidence intervals obtained by the search are compared with Cramer-Rao (CR) bounds at the same confidence level. The degree of nonlinearity in the estimation problem is an important factor in the relationship between CR bounds and the error bounds determined by the search technique. Beale's measure of nonlinearity is developed in this study for airplane identification problems; it is used to empirically correct confidence levels and to predict the degree of agreement between CR bounds and search estimates.

Murphy, P. C.↗
DOE OSTI2020

The Completed SDSS-IV extended Baryon Oscillation Spectroscopic Survey: Large-scale structure catalogues for cosmological analysis

ABSTRACT We present large-scale structure catalogues from the completed extended Baryon Oscillation Spectroscopic Survey (eBOSS). Derived from Sloan Digital Sky Survey (SDSS) IV Data Release 16 (DR16), these catalogues provide the data samples, corrected for observational systematics, and random positions sampling the survey selection function. Combined, they allow large-scale clustering measurements suitable for testing cosmological models. We describe the methods used to create these catalogues for the eBOSS DR16 Luminous Red Galaxy (LRG) and Quasar samples. The quasar catalogue contains 343 708 redshifts with 0.8 < z < 2.2 over 4808 deg2. We combine 174 816 eBOSS LRG redshifts over 4242 deg2 in the redshift interval 0.6 < z < 1.0 with SDSS-III BOSS LRGs in the same redshift range to produce a combined sample of 377 458 galaxy redshifts distributed over 9493 deg2. Improved algorithms for estimating redshifts allow that 98 per cent of LRG observations result in a successful redshift, with less than one per cent catastrophic failures (Δz > 1000 km s−1). For quasars, these rates are 95 and 2 per cent (with Δz > 3000 km s−1). We apply corrections for trends between the number densities of our samples and the properties of the imaging and spectroscopic data. For example, the quasar catalogue obtains a χ2/DoF = 776/10 for a null test against imaging depth before corrections and a χ2/DoF= 6/8 after. The catalogues, combined with careful consideration of the details of their construction found here-in, allow companion papers to present cosmological results with negligible impact from observational systematic uncertainties.

79 ASTRONOMY AND ASTROPHYSICS↗