Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “distributed 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,585 records · Page 88
All sourcesNASA NTRSDOE OSTI
NASA NTRS2014

A-Train Aerosol Observations Preliminary Comparisons with AeroCom Models and Pathways to Observationally Based All-Sky Estimates

We have developed a technique for combining CALIOP aerosol backscatter, MODIS spectral AOD (aerosol optical depth), and OMI AAOD (absorption aerosol optical depth) retrievals for the purpose of estimating full spectral sets of aerosol radiative properties, and ultimately for calculating the 3-D distribution of direct aerosol radiative forcing. We present results using one year of data collected in 2007 and show comparisons of the aerosol radiative property estimates to collocated AERONET retrievals. Use of the recently released MODIS Collection 6 data for aerosol optical depths derived with the dark target and deep blue algorithms has extended the coverage of the multi-sensor estimates towards higher latitudes. We compare the spatio-temporal distribution of our multi-sensor aerosol retrievals and calculations of seasonal clear-sky aerosol radiative forcing based on the aerosol retrievals to values derived from four models that participated in the latest AeroCom model intercomparison initiative. We find significant inter-model differences, in particular for the aerosol single scattering albedo, which can be evaluated using the multi-sensor A-Train retrievals. We discuss the major challenges that exist in extending our clear-sky results to all-sky conditions. On the basis of comparisons to suborbital measurements, we present some of the limitations of the MODIS and CALIOP retrievals in the presence of adjacent or underlying clouds. Strategies for meeting these challenges are discussed.

Aerosol↗
DOE OSTI2024

A Solution Method for the Filtered Lifting Line Theory

The filtered lifting line theory presents a continuous form of the inviscid momentum equations of flow over a lifting device, such as a wing or rotor blade, using body forces without mathematical singularities. This theory is also consistent with an actuator line representation of a lifting device. In this work, we present a reformulation of the equations in terms of the local flow angle along the line, which allows solving the stand-alone equations using multivariate root-finding algorithms. This approach can be used to obtain a fast, computationally inexpensive solution of the loading distribution along a wing without the need to perform computational fluid dynamic simulations. We study the requirements in terms of resolution in the spanwise direction and establish the criteria for spacing and minimum amount of points required along the blade to obtain converged solutions. The solutions are compared to results from large-eddy simulations, and we observed excellent agreement with less than a percent difference in quantities along the blade between the methods.

17 WIND ENERGY↗
DOE OSTI2022

A dictionary learning algorithm for compression and reconstruction of streaming data in preset order

There has been an emerging interest in developing and applying dictionary learning (DL) to process massive datasets in the last decade. Many of these efforts, however, focus on employing DL to compress and extract a set of important features from data, while considering restoring the original data from this set a secondary goal. On the other hand, although several methods are able to process streaming data by updating the dictionary incrementally as new snapshots pass by, most of those algorithms are designed for the setting where the snapshots are randomly drawn from a probability distribution. In this paper, we present a new DL approach to compress and denoise massive dataset in real time, in which the data are streamed through in a preset order (instances are videos and temporal experimental data), so at any time, we can only observe a biased sample set of the whole data. Here, our approach incrementally builds up the dictionary in a relatively simple manner: if the new snapshot is adequately explained by the current dictionary, we perform a sparse coding to find its sparse representation; otherwise, we add the new snapshot to the dictionary, with a Gram-Schmidt process to maintain the orthogonality. To compress and denoise noisy datasets, we apply the denoising to the snapshot directly before sparse coding, which deviates from traditional dictionary learning approach that achieves denoising via sparse coding. Compared to full-batch matrix decomposition methods, where the whole data is kept in memory, and other mini-batch approaches, where unbiased sampling is often assumed, our approach has minimal requirement in data sampling and storage: i) each snapshot is only seen once then discarded, and ii) the snapshots are drawn in a preset order, so can be highly biased. Through experiments on climate simulations and scanning transmission electron microscopy (STEM) data, we demonstrate that the proposed approach performs competitively to those methods in data reconstruction and denoising.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS1979

Compensation for atmospheric effects in LANDSAT data

Preprocessing algorithms were developed to remove or reduce the variations in multispectral data caused by variations in Sun angle and by changes in the atmospheric aerosol and water vapor levels. The two most significant algorithms developed by using mathematical models to define interrelations between the required multiplicative and additive correction factors so that just a few statistical characteristics of a LANDSAT distribution model would be sufficient to drive the mathematical model and to calculate the preprocessing corrections are examined. These are the atmospheric correction (ATCOR) computer program and the XSTAR haze correction algorithm. Neither the ATCOR nor the XSTAR algorithm provides an explicit compensation for the effects of changing LANDSAT view angle. Development efforts are underway to address this aspect of the preprocessing problem.

Lambeck, P. F.↗
NASA NTRS1994

A passive microwave technique for estimating rainfall and vertical structure information from space. Part 1: Algorithm description

This paper describes a multichannel physical approach for retrieving rainfall and vertical structure information from satellite-based passive microwave observations. The algorithm makes use of statistical inversion techniques based upon theoretically calculated relations between rainfall rates and brightness temperatures. Potential errors introduced into the theoretical calculations by the unknown vertical distribution of hydrometeors are overcome by explicity accounting for diverse hydrometeor profiles. This is accomplished by allowing for a number of different vertical distributions in the theoretical brightness temperature calculations and requiring consistency between the observed and calculated brightness temperatures. This paper will focus primarily on the theoretical aspects of the retrieval algorithm, which includes a procedure used to account for inhomogeneities of the rainfall within the satellite field of view as well as a detailed description of the algorithm as it is applied over both ocean and land surfaces. The residual error between observed and calculated brightness temperatures is found to be an important quantity in assessing the uniqueness of the solution. It is further found that the residual error is a meaningful quantity that can be used to derive expected accuracies from this retrieval technique. Examples comparing the retrieved results as well as the detailed analysis of the algorithm performance under various circumstances are the subject of a companion paper.

Kummerow, Christian↗
NASA NTRS2012

Assessment of a Bidirectional Reflectance Distribution Correction of Above-Water and Satellite Water-Leaving Radiance in Coastal Waters

Water-leaving radiances, retrieved from in situ or satellite measurements, need to be corrected for the bidirectional properties of the measured light in order to standardize the data and make them comparable with each other. The current operational algorithm for the correction of bidirectional effects from the satellite ocean color data is optimized for typical oceanic waters. However, versions of bidirectional reflectance correction algorithms specifically tuned for typical coastal waters and other case 2 conditions are particularly needed to improve the overall quality of those data. In order to analyze the bidirectional reflectance distribution function (BRDF) of case 2 waters, a dataset of typical remote sensing reflectances was generated through radiative transfer simulations for a large range of viewing and illumination geometries. Based on this simulated dataset, a case 2 water focused remote sensing reflectance model is proposed to correct above-water and satellite water-leaving radiance data for bidirectional effects. The proposed model is first validated with a one year time series of in situ above-water measurements acquired by collocated multispectral and hyperspectral radiometers, which have different viewing geometries installed at the Long Island Sound Coastal Observatory (LISCO). Match-ups and intercomparisons performed on these concurrent measurements show that the proposed algorithm outperforms the algorithm currently in use at all wavelengths, with average improvement of 2.4% over the spectral range. LISCO's time series data have also been used to evaluate improvements in match-up comparisons of Moderate Resolution Imaging Spectroradiometer satellite data when the proposed BRDF correction is used in lieu of the current algorithm. It is shown that the discrepancies between coincident in-situ sea-based and satellite data decreased by 3.15% with the use of the proposed algorithm.

LISCO(LONG ISLAND SOUND COASTAL OBSERVATORY)↗
DOE OSTI2020

Machine-learning prediction for quasiparton distribution function matrix elements

There have been rapid developments in the direct calculation in lattice QCD (LQCD) of the Bjorken-x dependence of hadron structure through large-momentum effective theory (LaMET). LaMET overcomes the previous limitation of LQCD to moments (that is, integrals over Bjorken x) of hadron structure, allowing LQCD to directly provide the kinematic regions where the experimental values are least known. LaMET requires large-momentum hadron states to minimize its systematics and allow us to reach small- x reliably. This means that very fine lattice spacing to minimize lattice artifacts at order $(P_za)^n$ will become crucial for next-generation LaMET-like structure calculations. Furthermore, such calculations require operators with long Wilson-link displacements, especially in finer lattice units, increasing the communication costs relative to that of the propagator inversion. In this work, we explore whether machine-learning algorithms can make predictions of correlators to reduce the computational cost of these LQCD calculations. We consider two algorithms, gradient-boosting decision tree and linear models, applied to LaMET data, the matrix elements needed to determine the kaon and $η_s$ unpolarized parton distribution functions (PDFs), meson distribution amplitude (DA), and the nucleon gluon PDF. We find that both algorithms can reliably predict the target observables with different prediction accuracy and systematic errors. The predictions from smaller displacement z to larger ones work better than those for momentum p due to the higher correlation among the data.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
NASA NTRS1977

On signal design by the R/0/ criterion for non-white Gaussian noise channels

The use of the cut-off rate criterion for modulation system design is investigated for channels with non-white Gaussian noise. A signal space representation of the waveform channel is developed, and the cut-off rate for vector channels with additive non-white Gaussian noise and unquantized demodulation is derived. When the signal input to the channel is a continuous random vector, maximization of the cut-off rate with constrained average signal energy leads to a water-filling interpretation of optimal energy distribution in signal space. The necessary condition for a finite signal set to maximize the cut-off rate with constrained energy and an equally likely probability assignment of signal vectors is presented, and an algorithm is outlined for numerically computing the optimum signal set. As an example, the rectangular signal set which has the water-filling average energy distribution and the optimum rectangular set are compared.

Bordelon, D. L.↗
NASA NTRS2000

Volcanic Signatures in Estimates of Stratospheric Aerosol Size, Distribution Width, Surface Area, and Volume Deduced from Global Satellite-Based Observations

Volcanic signatures in the stratospheric aerosol layer are revealed by two independent techniques which retrieve aerosol information from global satellite-based observations of particulate extinction. Both techniques combine the 4-wavelength Stratospheric Aerosol and Gas Experiment (SAGE) II extinction measurements (0.385 <= lambda <= 1.02 microns) with the 7.96 micron and 12.82 micron extinction measurements from the Cryogenic Limb Array Etalon Spectrometer (CLAES) instrument. The algorithms use the SAGE II/CLAES composite extinction spectra in month-latitude-altitude bins to retrieve values and uncertainties of particle effective radius R(sub eff), surface area S, volume V and size distribution width sigma(sub R). The first technique is a multi-wavelength Look-Up-Table (LUT) algorithm which retrieves values and uncertainties of R(sub eff) by comparing ratios of extinctions from SAGE II and CLAES (e.g., E(sub lambda)/E(sub 1.02) to pre-computed extinction ratios which are based on a range of unimodal lognormal size distributions. The pre-computed ratios are presented as a function of R(sub eff) for a given sigma(sub g); thus the comparisons establish the range of R(sub eff) consistent with the measured spectra for that sigma(sub g). The fact that no solutions are found for certain sigma(sub g) values provides information on the acceptable range of sigma(sub g), which is found to evolve in response to volcanic injections and removal periods. Analogous comparisons using absolute extinction spectra and error bars establish the range of S and V. The second technique is a Parameter Search Technique (PST) which estimates R(sub eff) and sigma(sub g) within a month-latitude-altitude bin by minimizing the chi-squared values obtained by comparing the SAGE II/CLAES extinction spectra and error bars with spectra calculated by varying the lognormal fitting parameters: R(sub eff), sigma(sub g), and the total number of particles N(sub 0). For both techniques, possible biases in retrieved-parameters caused by assuming a unimodal functional form are removed using correction factors computed from representative in situ measurements of bimodal size distributions. Some interesting features revealed by the LUT and PST retrievals include: (1) Increases in S and V (but not R(sub eff)) after the Ruiz and Kelut injections, (2) Increases in S, V, R(sub eff) after Pinatubo, (3) Post-Pinatubo increases in S, V, and R(sub eff) that are more rapid in the tropics than elsewhere, (4) Mid-latitude post-Pinatubo increases in R(sub eff) that lag increases in S and V, (5) S and V returning to pre-Pinatubo values sooner than R(sub eff) does, (6) Sharp increases in sigma(sub g), after Pinatubo and slight increases in sigma(sub g) after Ruiz, Etna, Kelut, Spurr and Rabaul, and (7) Gradual declines in the heights at which R(sub eff), S and V peak after Pinatubo.

Bauman, J. J.↗
DOE OSTI2025

Communication Lower Bounds and Optimal Algorithms for Symmetric Matrix Computations

In this article, we focus on the communication costs of three symmetric matrix computations: (i) multiplying a matrix with its transpose, known as a symmetric rank-k update (SYRK) (ii) adding the result of the multiplication of a matrix with the transpose of another matrix and the transpose of that result, known as a symmetric rank-2k update (SYR2K) (iii) performing matrix multiplication with a symmetric input matrix (SYMM). All three computations appear in the Level 3 Basic Linear Algebra Subroutines (BLAS) and have wide use in applications involving symmetric matrices. We establish communication lower bounds for these kernels using sequential and distributed-memory parallel computational models, and we show that our bounds are tight by presenting communication-optimal algorithms for each setting. Our lower bound proofs rely on applying a geometric inequality for symmetric computations and analytically solving constrained nonlinear optimization problems. As a result, the symmetric matrix and its corresponding computations are accessed and performed according to a triangular block partitioning scheme in the optimal algorithms.

Al Daas, Hussam [Rutherford Appleton Laboratory, D↗
DOE OSTI2020

K-space algorithmic reconstruction (KAREN): a robust statistical methodology to separate Bragg and diffuse scattering

Diffuse scattering occurring in the Bragg diffraction pattern of a long-range-ordered structure represents local deviation from the governing regular lattice. However, interpreting the real-space structure from the diffraction pattern presents a significant challenge because of the dramatic difference in intensity between the Bragg and diffuse components of the total scattering function. In contrast to the sharp Bragg diffraction, the diffuse signal has generally been considered to be a weak expansive or continuous background signal. In this paper, using 1D and 2D models, it is demonstrated that diffuse scattering in fact consists of a complex array of high-frequency features that must not be averaged into a low-frequency background signal. To evaluate the actual diffuse scattering effectively, an algorithm has been developed that uses robust statistics and traditional signal processing techniques to identify Bragg peaks as signal outliers which can be removed from the overall scattering data and then replaced by statistically valid fill values. This method, described as a 'K-space algorithmic reconstruction' (KAREN), can identify Bragg reflections independent of prior knowledge of a system's unit cell. KAREN does not alter any data other than that in the immediate vicinity of the Bragg reflections, and reconstructs the diffuse component surrounding the Bragg peaks without introducing discontinuities which induce Fourier ripples or artifacts from underfilling `punched' voids. The KAREN algorithm for reconstructing diffuse scattering provides demonstrably better resolution than can be obtained from previously described punch-and-fill methods. The superior structural resolution obtained using the KAREN method is demonstrated by evaluating the complex ordered diffuse scattering observed from the neutron diffraction of a single plastic crystal of CBr 4 using pair distribution function analysis.

36 MATERIALS SCIENCE↗
DOE OSTI2021

Attention Enabled Multi-Agent DRL for Decentralized Volt-VAR Control of Active Distribution System Using PV Inverters and SVCs

This paper proposes attention enabled multi-agent deep reinforcement learning (MADRL) framework for active distribution network decentralized Volt-VAR control. Using the unsupervised clustering, the whole distribution system can be decomposed into several sub-networks according to the voltage and reactive power sensitivity relationships. Then, the distributed control problem of each sub-network is modeled as Markov games and solved by the improved MADRL algorithm, where each sub-network is modeled as an adaptive agent. An attention mechanism is developed to help each agent focus on specific information that is mostly related to the reward. All agents are centrally trained offline to learn the optimal coordinated Volt-VAR control strategy and executed in a decentralized manner to make online decisions with only local information. Compared with other distributed control approaches, the proposed method can effectively deal with uncertainties, achieve fast decision makings, and significantly reduce the communication requirements. Comparison results with model-based and other data-driven methods on IEEE 33-bus and 123-bus systems demonstrate the benefits of the proposed approach.

distribution network↗
NASA NTRSDate not supplied

Probabilistic Calibration of Expensive Models using Efficiently Trained Surrogates

Calibration of computational models in the presence of uncertainty is often cast as a Bayesian inference problem and solved via sampling methods, e.g., Markov chain Monte Carlo. When the computational model is expensive, this task becomes intractable due to the large number of samples required to accurately estimate the posterior distribution of the calibration parameters. A popular solution to this problem is to use machine learning to develop a faster-to-evaluate, lower-fidelity substitute for the original model to serve as a surrogate while solving the inference problem. Although considered an offline cost, generating training data to construct this surrogate model can still be an expensive task in practice. An active learning algorithm is presented that focuses training on improving surrogate accuracy specifically in and around the bulk of the posterior distribution, as this is where the model is exercised during calibration. Candidate samples are drawn from families of distributions related to an approximation of the posterior. The sample maximizing predictive variance is then selected for evaluation by the original computational model, yielding a label for the training point. Iterating this approach increases efficiency relative to space filling designs (e.g., Latin hypercube sampling) by avoiding low probability points. Practical considerations are discussed, including the benefits of using a sequential Monte Carlo sampling approach, convergence heuristics, and the importance of both exploration and exploitation given that the true posterior is unknown a priori.

uncertainty quantification↗
NASA NTRS1996

Optimum Transonic Airfoils Based on the Euler Equations

We solve the problem of determining airfoils that approximate, in a least square sense, given surface pressure distributions in transonic flight regimes. The flow is modeled by means of the Euler equations and the solution procedure is an adjoint- based minimization algorithm that makes use of the inverse Theodorsen transform in order to parameterize the airfoil. Fast convergence to the optimal solution is obtained by means of the pseudo-time method. Results are obtained using three different pressure distributions for several free stream conditions. The airfoils obtained have given a trailing edge angle.

Iollo, Angelo↗
DOE OSTI2021

Numerical Evidence for Many-Body Localization in Two and Three Dimensions

Disorder and interactions can lead to the breakdown of statistical mechanics in certain quantum systems, a phenomenon known as many-body localization (MBL). Much of the phenomenology of MBL emerges from the existence of localized-bits, or l-bits, a set of conserved quantities that are spatially localized and binary (i.e., possess only ±1 eigenvalues). While MBL and l-bits are known to exist in one-dimensional systems, their existence in dimensions greater than one is a key open question. To tackle this question, we develop an algorithm that can find approximate binary l-bits in arbitrary dimensions by adaptively generating a basis of operators in which to represent the l-bit. We use the algorithm to study four models: the one-, two-, and three-dimensional disordered Heisenberg models and the two-dimensional disordered hard-core Bose-Hubbard model. For all four of the models studied, our algorithm finds high-quality l-bits at large disorder strength and rapid qualitative changes in the distributions of l-bits in particular ranges of disorder strengths, suggesting the existence of MBL transitions. Furthermore, these transitions in the one-dimensional Heisenberg model and two-dimensional Bose-Hubbard model coincide well with past estimates of the critical disorder strengths in these models which further validates the evidence of MBL-like behavior in the other two and three-dimensional models we examine. In addition to finding MBL-like behavior in higher dimensions, our algorithm can be used to probe MBL in various geometries and dimensionality.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
DOE OSTI2024

Reconstruction of the 4D beam matrix

The widely used transverse parameters characterizing particle beams are the Twiss parameters. These parameters can be measured experimentally but they do not fully characterize the beam since they do not account for possible correlations in particle distribution between two transverse coordinates. These correlations may occur due to uncompensated magnetic field at the cathode or misalignment of focusing quadrupoles in the transport beamline. We test a novel diagnostic for diagnosing full 4D beam matrix which may be used to identify such imperfections. The diagnostic is based on transporting the beam through the beamline which includes a quadrupole and a skew quadrupole magnets and measuring the resulting 2D beam distribution at the screen downstream. Such a measurement can be viewed as measuring a 2D projection of the 4D distribution. Different settings of the quads provide measurements of different slices of the phase space. The reconstruction of the original beam matrix from a number of measurements is done using machine learning algorithm, which provides a fast and reliable way of reconstruction for an arbitrary configuration of the scanning beamline. In August 2024, we set up the diagnostic beamline to perform a quadrupole scan of the beam. The setup includes a skew quadrupole, a regular quadrupole, and a screen. The images on the screen were post-processed to remove experimental artifacts and enhance contrast by eliminating background noise outside the core of the distribution=. The rms parameters of the distribution were then calculated and used as inputs for the reconstruction algorithm. This algorithm attempts to determine the initial beam matrix that produces expected images on the screen closely matching the observed images across all quadrupole settings. The algorithm found a solution in which the expected rms parameters closely align with the observations. Validation of the results is planned for FY25.

43 PARTICLE ACCELERATORS↗
NASA NTRS1982

Merging LANDSAT Derived Land Covers into Quad-referenced Geographic Information Systems

An approach for merging multiscene LANDSAT data bases into existing geographic information systems having 5-second or smaller cells is described. The approach uses the output from the State of Maryland's UNIVAC 1180-based LANDSAT classification program ASTEP (Algorithm Simulation Test and Evaluation) developed by NASA. The structure of the technique was designed to address the problems that emerged as part of the LANDSAT classification of the 64,000 square mile Chesapeake water shed involving twelve scenes. The removal of overlap among adjacent scenes, the crossreferencing of ground control points, and the isolation of the appropriate pixels from the LANDSAT data base for subsequent positioning into a file containing ancillary data referenced to a specific USGS 7 1/2 minute quadrangle sheet are described. Examples illustrate the clustering of classified LANDSAT pixels to define the dominant land use for each of 8,100 cells within a series of quadrangle sheets distributed over the State of Maryland. The approach uses a hard copy terminal tied to an ASTEP algorithm through telephone lines. A coordinate digitizing board for inputing the position of ground control points is also valuable, although manual measurements are possible. The approach is quite efficient and should be especially attractive for use on regional scale studies.

White, J. M.↗