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.

SourceResearch connectionFrom yearThrough year

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 1,279 records · Page 71

All sources NASA NTRS DOE OSTI

NASA NTRS2008

Onboard Image Registration from Invariant Features

This paper describes a feature-based image registration technique that is potentially well-suited for onboard deployment. The overall goal is to provide a fast, robust method for dynamically combining observations from multiple platforms into sensors webs that respond quickly to short-lived events and provide rich observations of objects that evolve in space and time. The approach, which has enjoyed considerable success in mainstream computer vision applications, uses invariant SIFT descriptors extracted at image interest points together with the RANSAC algorithm to robustly estimate transformation parameters that relate one image to another. Experimental results for two satellite image registration tasks are presented: (1) automatic registration of images from the MODIS instrument on Terra to the MODIS instrument on Aqua and (2) automatic stabilization of a multi-day sequence of GOES-West images collected during the October 2007 Southern California wildfires.

descriptors↗

NASA NTRS2002

Automated Escape Guidance Algorithms for An Escape Vehicle

An escape vehicle was designed to provide an emergency evacuation for crew members living on a space station. For maximum escape capability, the escape vehicle needs to have the ability to safely evacuate a station in a contingency scenario such as an uncontrolled (e.g., tumbling) station. This emergency escape sequence will typically be divided into three events: The fust separation event (SEP1), the navigation reconstruction event, and the second separation event (SEP2). SEP1 is responsible for taking the spacecraft from its docking port to a distance greater than the maximum radius of the rotating station. The navigation reconstruction event takes place prior to the SEP2 event and establishes the orbital state to within the tolerance limits necessary for SEP2. The SEP2 event calculates and performs an avoidance burn to prevent station recontact during the next several orbits. This paper presents the tools and results for the whole separation sequence with an emphasis on the two separation events. The fust challenge includes collision avoidance during the escape sequence while the station is in an uncontrolled rotational state, with rotation rates of up to 2 degrees per second. The task of avoiding a collision may require the use of the Vehicle's de-orbit propulsion system for maximum thrust and minimum dwell time within the vicinity of the station vicinity. The thrust of the propulsion system is in a single direction, and can be controlled only by the attitude of the spacecraft. Escape algorithms based on a look-up table or analytical guidance can be implemented since the rotation rate and the angular momentum vector can be sensed onboard and a-priori knowledge of the position and relative orientation are available. In addition, crew intervention has been provided for in the event of unforeseen obstacles in the escape path. The purpose of the SEP2 burn is to avoid re-contact with the station over an extended period of time. Performing this maneuver properly requires knowledge of the orbital state, which is obtained during the navigation state reconstruction event. Since the direction of the delta-v of the SEPI maneuver is a random variable with respect to the Local Vertical Local Horizontal (LVLH) coordinate system, calculating the required SEP2 burn is a challenge. This problem was solved using a neural network as a model-free function approximation technique.

Flanary, Ronald↗

NASA NTRS1984

Maximum likelihood algorithm using an efficient scheme for computing sensitivities and parameter confidence intervals

Improved techniques for estimating airplane stability and control derivatives and their standard errors are presented. A maximum likelihood estimation algorithm is developed which relies on an optimization scheme referred to as a modified Newton-Raphson scheme with estimated sensitivities (MNRES). MNRES determines sensitivities by using slope information from local surface approximations of each output variable in parameter space. The fitted surface allows sensitivity information to be updated at each iteration with a significant reduction in computational effort compared to integrating the analytically-determined sensitivity equations or using a finite difference scheme. An aircraft estimation problem is solved using real flight data to compare MNRES with the commonly used modified Newton-Raphson technique; MNRES is found to be faster and more generally applicable. Parameter standard errors are determined using a random search technique. The confidence intervals obtained are compared with Cramer-Rao lower bounds at the same confidence level. It is observed that the nonlinearity of the cost function is an important factor in the relationship between Cramer-Rao bounds and the error bounds determined by the search technique.

Murphy, P. C.↗

NASA NTRS1995

Field lines and magnetic surfaces in a two-component slab/2D model of interplanetary magnetic fluctuations

A two-component model for the spectrum of interplanetary magnetic fluctuations was proposed on the basis of ISEE observations, and has found an intriguing level of application in other solar wind studies. The model fluctuations consist of a fraction of 'slab' fluctuations, varying only in the direction parallel to the locally uniform mean magnetic field B(0) and a complement of 2D (two-dimensional) fluctuations that vary in the directions transverse to B(0). We have developed an spectral method computational algorithm for computing the magnetic flux surfaces (flux tubes) associated with the composite model, based upon a precise analogy with equations for ideal transport of a passive scalar in planar two dimensional geometry. Visualization of various composite models will be presented, including the 80 percent 2D/ 20 percent slab model with delta B/B(0) approximately equals 1 and a minus 5/3 spectral law, that is thought to approximately represent a snapshot of solar wind turbulence. Characteristically, the visualizations show that flux tubes, even when defined as regular on some plane, shred and disperse rapidly as they are viewed along the parallel direction. This diffusive process, which generalizes the standard picture of field line random walk, will be discussed in detail. Evidently, the traditional picture that flux tubes randomize like strands of spaghetti with a uniform tangle along the axial direction is in need of modification.

Matthaeus, W. H.↗

NASA NTRS2007

Automated Knowledge Discovery From Simulators

A computational method, SimLearn, has been devised to facilitate efficient knowledge discovery from simulators. Simulators are complex computer programs used in science and engineering to model diverse phenomena such as fluid flow, gravitational interactions, coupled mechanical systems, and nuclear, chemical, and biological processes. SimLearn uses active-learning techniques to efficiently address the "landscape characterization problem." In particular, SimLearn tries to determine which regions in "input space" lead to a given output from the simulator, where "input space" refers to an abstraction of all the variables going into the simulator, e.g., initial conditions, parameters, and interaction equations. Landscape characterization can be viewed as an attempt to invert the forward mapping of the simulator and recover the inputs that produce a particular output. Given that a single simulation run can take days or weeks to complete even on a large computing cluster, SimLearn attempts to reduce costs by reducing the number of simulations needed to effect discoveries. Unlike conventional data-mining methods that are applied to static predefined datasets, SimLearn involves an iterative process in which a most informative dataset is constructed dynamically by using the simulator as an oracle. On each iteration, the algorithm models the knowledge it has gained through previous simulation trials and then chooses which simulation trials to run next. Running these trials through the simulator produces new data in the form of input-output pairs. The overall process is embodied in an algorithm that combines support vector machines (SVMs) with active learning. SVMs use learning from examples (the examples are the input-output pairs generated by running the simulator) and a principle called maximum margin to derive predictors that generalize well to new inputs. In SimLearn, the SVM plays the role of modeling the knowledge that has been gained through previous simulation trials. Active learning is used to determine which new input points would be most informative if their output were known. The selected input points are run through the simulator to generate new information that can be used to refine the SVM. The process is then repeated. SimLearn carefully balances exploration (semi-randomly searching around the input space) versus exploitation (using the current state of knowledge to conduct a tightly focused search). During each iteration, SimLearn uses not one, but an ensemble of SVMs. Each SVM in the ensemble is characterized by different hyper-parameters that control various aspects of the learned predictor - for example, whether the predictor is constrained to be very smooth (nearby points in input space lead to similar output predictions) or whether the predictor is allowed to be "bumpy." The various SVMs will have different preferences about which input points they would like to run through the simulator next. SimLearn includes a formal mechanism for balancing the ensemble SVM preferences so that a single choice can be made for the next set of trials.

Burl, Michael↗

DOE OSTI2020

Incorporating the Impacts of Climate Change on Hydrology in a Performance Assessment Model - 20403

The evidence of climate change is increasingly well-documented and impacts should be incorporated in performance assessment studies. The current climate literature provides both observational evidence and climate model projections of climate trends and/or climate change in the late 20. and early 21. centuries for North America and the northeast United States. Probabilistic modeling is a core requirement for quantifying uncertainty and evaluating its impacts. Not evaluating future climate states in a performance assessment because of the existence of uncertainty is contradictory to good modeling practices - the most uncertain issues and parameters require the most attention in effective probabilistic modeling. Excluding climate change limits development of modeling information that could aid in effective decision making. In this work we develop methods to use the output from hydrologic models and analysis of historical aerial imagery to quantify and implement the impacts of climate change on hydrologic processes at a nuclear waste site in West Valley, New York. Specifically, we used the HELP (Hydraulic Performance of Landfill Performance) model to characterize key hydrologic processes under both current and future climate conditions to assess the impacts of changing climate on hydrology. A suite of previous climatic models were reviewed and synthesized to produce a cohesive representation of the current state of knowledge of the impact of climate change on important model inputs such as precipitation. Output from the HELP simulations was coupled to the GoldSim model that was used to develop the Probabilistic Performance Assessment (PPA) approach through the application of a novel 'nearest neighbor' technique. First, several thousand realizations were generated from the HELP model using a Latin Hypercube experimental design to ensure adequate coverage of the parameter space of explanatory variables used to drive HELP. For example, porosity is a physical parameter that is used as an input to both HELP and the GoldSim PA model. We then ran sensitivity analysis (SA) algorithms on the output of HELP for each of the responses of interest. For each predictor, each time we build an SA model we get a different value for the sensitivity index (SI). From the collection of all the SA models, the average was computed among all of the SIs to represent the predictor within the context of the nearest neighbor approach. That is, we conduct SA on each HELP outcome for each scenario. This gives us parameter sensitivity indices for the outcomes. We average the parameter sensitivity indices across the outcomes to get the average SI for a scenario. For each realization that is generated from the Goldsim PA model, Goldsim generates random values for physical/empirical parameters that HELP uses as well. For each vector of physical/empirical parameters that Goldsim generates, the vector from the 5,000 HELP runs that is most 'similar' to the Goldsim vector is computed using the nearest neighbor approach. In this context 'similar' means minimization of the SA-weighted sum of the absolute differences among the 5,000 values computed for this statistic, where each value corresponds to a different HELP realization. In order to account for the impacts of climate change, this process was repeated using the spatially downscaled future climate projections. For each of the key parameters of interest, it was assumed that a linear change depicted the relationship between the values for the present day and those for 2100. In this way, the climatically-driven changes in key parameters used to inform the GoldSim model are quantified and incorporated into the PA model output for the future. (authors)

12 MANAGEMENT OF RADIOACTIVE AND NON-RADIOACTIVE W↗

DOE OSTI2023

BEYONDPLANCK IV. On end-to-end simulations in CMB analysis — Bayesian versus frequentist statistics

End-to-end simulations play a key role in the analysis of any high-sensitivity cosmic microwave background (CMB) experiment, providing high-fidelity systematic error propagation capabilities that are unmatched by any other means. In this paper, we address an important issue regarding such simulations, namely, how to define the inputs in terms of sky model and instrument parameters. These may either be taken as a constrained realization derived from the data or as a random realization independent from the data. We refer to these as posterior and prior simulations, respectively. We show that the two options lead to significantly different correlation structures, as prior simulations (contrary to posterior simulations) effectively include cosmic variance, but they exclude realization-specific correlations from non-linear degeneracies. Consequently, they quantify fundamentally different types of uncertainties. We argue that as a result, they also have different and complementary scientific uses, even if this dichotomy is not absolute. In particular, posterior simulations are in general more convenient for parameter estimation studies, while prior simulations are generally more convenient for model testing. Before BEYONDPLANCK, most pipelines used a mix of constrained and random inputs and applied the same hybrid simulations for all applications, even though the statistical justification for this is not always evident. BEYONDPLANCK represents the first end-to-end CMB simulation framework that is able to generate both types of simulations and these new capabilities have brought this topic to the forefront. The BEYONDPLANCK posterior simulations and their uses are described extensively in a suite of companion papers. In this work, we consider one important applications of the corresponding prior simulations, namely, code validation. Specifically, we generated a set of one-year LFI 30 GHz prior simulations with known inputs and we used these to validate the core low-level BEYONDPLANCK algorithms dealing with gain estimation, correlated noise estimation, and mapmaking.

79 ASTRONOMY AND ASTROPHYSICS↗

NASA NTRS2004

Examination of Surface Roughness on Light Scattering by Long Ice Columns by Use of a Two-Dimensional Finite-Difference Time-Domain Algorithm

Natural particles such as ice crystals in cirrus clouds generally are not pristine but have additional micro-roughness on their surfaces. A two-dimensional finite-difference time-domain (FDTD) program with a perfectly matched layer absorbing boundary condition is developed to calculate the effect of surface roughness on light scattering by long ice columns. When we use a spatial cell size of 1/120 incident wavelength for ice circular cylinders with size parameters of 6 and 24 at wavelengths of 0.55 and 10.8 mum, respectively, the errors in the FDTD results in the extinction, scattering, and absorption efficiencies are smaller than similar to 0.5%. The errors in the FDTD results in the asymmetry factor are smaller than similar to 0.05%. The errors in the FDTD results in the phase-matrix elements are smaller than similar to 5%. By adding a pseudorandom change as great as 10% of the radius of a cylinder, we calculate the scattering properties of randomly oriented rough-surfaced ice columns. We conclude that, although the effect of small surface roughness on light scattering is negligible, the scattering phase-matrix elements change significantly for particles with large surface roughness. The roughness on the particle surface can make the conventional phase function smooth. The most significant effect of the surface roughness is the decay of polarization of the scattered light.

Sun, W.↗

DOE OSTI2021

Deep Learning Estimation of Daily Ground–Level NO 2 Concentrations from Remote Sensing Data

The limited number of nitrogen dioxide (NO 2 ) surface measurements calls for the development of highly accurate approaches to estimating surface NO 2 concentrations. In this study, we leverage a new satellite instrument, the TROPOspheric Monitoring Instrument (TROPOMI), along with other predictor variables, to estimate daily surface NO 2 concentrations over Texas in 2019. We use the deep convolutional neural network (Deep-CNN), an advanced deep learning algorithm, to obtain estimates and achieve a correlation coefficient (R) of 0.91, an index of agreement (IOA) of 0.95, and a mean absolute bias (MAB) of 1.75 ppb in surface NO 2 estimation. Additionally, we leverage a novel approach, SHapley Additive exPlanations (SHAP), to describe how Deep-CNN understands each predictor variable. The SHAP results show that the Deep-CNN model has an advanced understanding of the dataset, revealing that TROPOMI closely captures levels of NO 2 . In addition, we show the superiority of our Deep-CNN model at estimating surface NO 2 over other well-known machine learning and regression models in the field, including the support vector machines (SVM), random forest (RF), and multiple linear regression (MLR). Although SVM and RF show strong capabilities at estimating surface NO 2 concentrations, their accuracy is inferior to that of the Deep-CNN model, ranking second and third in model accuracy in this study. The MLR, however, shows a poor ability at NO 2 estimation and ranks last among all models. Furthermore, testing the impact of sample size on model performance, we also show that, compared to other models, Deep-CNN needs more samples to trigger its strength at surface NO 2 estimation.

54 ENVIRONMENTAL SCIENCES↗

NASA NTRS2014

A New Hybrid Spatio-temporal Model for Estimating Daily Multi-year PM2.5 Concentrations Across Northeastern USA Using High Resolution Aerosol Optical Depth Data

The use of satellite-based aerosol optical depth (AOD) to estimate fine particulate matter PM(sub 2.5) for epidemiology studies has increased substantially over the past few years. These recent studies often report moderate predictive power, which can generate downward bias in effect estimates. In addition, AOD measurements have only moderate spatial resolution, and have substantial missing data. We make use of recent advances in MODIS satellite data processing algorithms (Multi-Angle Implementation of Atmospheric Correction (MAIAC), which allow us to use 1 km (versus currently available 10 km) resolution AOD data.We developed and cross validated models to predict daily PM(sub 2.5) at a 1X 1 km resolution across the northeastern USA (New England, New York and New Jersey) for the years 2003-2011, allowing us to better differentiate daily and long term exposure between urban, suburban, and rural areas. Additionally, we developed an approach that allows us to generate daily high-resolution 200 m localized predictions representing deviations from the area 1 X 1 km grid predictions. We used mixed models regressing PM(sub 2.5) measurements against day-specific random intercepts, and fixed and random AOD and temperature slopes. We then use generalized additive mixed models with spatial smoothing to generate grid cell predictions when AOD was missing. Finally, to get 200 m localized predictions, we regressed the residuals from the final model for each monitor against the local spatial and temporal variables at each monitoring site. Our model performance was excellent (mean out-of-sample R(sup 2) = 0.88). The spatial and temporal components of the out-of-sample results also presented very good fits to the withheld data (R(sup 2) = 0.87, R(sup)2 = 0.87). In addition, our results revealed very little bias in the predicted concentrations (Slope of predictions versus withheld observations = 0.99). Our daily model results show high predictive accuracy at high spatial resolutions and will be useful in reconstructing exposure histories for epidemiological studies across this region.

Air pollution↗

DOE OSTI2022

Fragmentation analysis of a bar with the Lip-field approach

The Lip-field approach was introduced in Moës and Chevaugeon (2021) as a new way to regularize softening material models. It was tested in 1D quasistatic in Moës and Chevaugeon (2021) and 2D quasistatic in Chevaugeon and Moës (2021): this paper extends it to 1D dynamics, on the challenging problem of dynamic fragmentation. The Lip-field approach formulates the mechanical problem to be solved as an optimization problem, where the incremental potential to be minimized is the non-regularized one. Spurious localization is prevented by imposing a Lipschitz constraint on the damage field. Here, the displacement and damage field at each time step are obtained by a staggered algorithm, that is the displacement field is computed for a fixed damage field, then the damage field is computed for a fixed displacement field. Indeed, these two problems are convex, which is not the case of the global problem where the displacement and damage fields are sought at the same time. The incremental potential is obtained by equivalence with a cohesive zone model, which makes material parameters calibration simple. A non-regularized local damage equivalent to a cohesive zone model is also proposed. It is used as a reference for the Lip-field approach, without the need to implement displacement jumps. These approaches are applied to the brittle fragmentation of a 1D bar with randomly perturbed material properties to accelerate spatial convergence. Both explicit and implicit dynamic implementations are compared. Favorable comparison to several analytical, numerical and experimental references serves to validate the modeling approach.

36 MATERIALS SCIENCE↗

DOE OSTI2024

Emulation and detection of physical faults and cyber-attacks on building energy systems through real-time hardware-in-the-loop experiments

The increasing use of remote or mobile access, integrated wearable technologies, data exchange, and cloud-based data analytics in modern smart buildings is steering the building industry towards open communication technologies. The increased connectivity and accessibility could lead to more cyber-attacks in smart buildings. On the other hand, physical faults (e.g., HVAC -heating, ventilation, and air-conditioning faults) may have similar adverse impacts as those from the cyber-attacks on building energy systems, such as occupant discomfort, energy wastage, and equipment downtime. However, current physical behavior-based anomaly detection methods fail to differentiate between cyber-attacks and physical faults in building energy systems. Moreover, the challenge in collecting real-world threat data with ground truth has led researchers to rely on numerical models with user-defined assumptions, which may not accurately reflect real-world conditions due to the lack of in-situ experimental datasets. To address these challenges and gaps, this paper presents a flexible hardware-in-the-loop (HIL) testbed for generating cyber-attack and physical fault datasets and demonstrating threat detection algorithms in a real building automation system (BAS) environment. This testbed combines hardware (i.e., real BAS with local HVAC controllers and a physical network) with software (i.e., high-fidelity models to represent behaviors of building envelope and HVAC energy systems), enabling emulations of realistic threats. Five HIL experiments, including one baseline without any threats, two with physical faults, and two with cyber-attacks, were conducted to generate datasets containing detailed network traffic and system states. A joint classification framework, incorporating a network analyzer and a physical HVAC fault detector, was proposed to automatically detect cyber-physical abnormalities on BAS at both the network and the physical HVAC levels. The network analyzer comprises a conditional random fields (CRF) based command validator and a statistics-based detection strategy. The fault detector employs a weather and schedule-based pattern matching and feature-based principal component analysis (WPM-FPCA) method. Evaluation of the classification using four metrics from the multi-class confusion matrix revealed an average accuracy of 90.2%, recall of 89.7%, precision of 88.5% and F1-score of 89.2%. Finally, these results demonstrate that the proposed joint classification framework can effectively differentiate between specific types of cyber-attacks (e.g., device reinitialization attack, network Denial-of-Service attack) and physical faults (e.g., air handling unit operational fault, cooling coil valve stuck) in real time for improved building energy management.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

NASA NTRS2003

Vertical Profiles of Latent Heat Release over the Global Tropics using TRMM Rainfall Products from December 1997 to November 2002

NASA Tropical Rainfall Measuring Mission (TRMM) precipitation radar (PR) derived rainfall information will be used to estimate the four-dimensional structure of global monthly latent heating and rainfall profiles over the global tropics from December 1997 to November 2000. Rainfall, latent heating and radar reflectivity structures between El Nino (DJF 1997-98) and La Nina (DJF 1998-99) will be examined and compared. The seasonal variation of heating over various geographic locations (i.e., oceanic vs continental, Indian ocean vs west Pacific, Africa vs. S. America ) will also be analyzed. In addition, the relationship between rainfall, latent heating (maximum heating level), radar reflectivity and SST is examined and will be presented in the meeting. The impact of random error and bias in stratiform percentage estimates from PR on latent heating profiles is studied and will also be presented in the meeting. The Goddard Cumulus Ensemble Model is being used to simulate various mesoscale convective systems that developed in different geographic locations. Specifically, the model estimated rainfall, radar reflectivity and latent heating profiles will be compared to observational data collected from TRMM field campaigns over the South China Sea in 1998 (SCSMEX), Brazil in 1999 (TRMM-LBA), and the central Pacific in 1999 (KWAJEX). Sounding diagnosed heating budgets and radar reflectivity from these experiments can provide the means to validate (heating product) as well as improve the GCE model. Review of other latent heating algorithms will be discussed in the workshop.

Tao, W.-K.↗

DOE OSTI2024

HamPerf: A Hamiltonian-Oriented Approach to Quantum Benchmarking

Quantum computing technologies are undergoing rapid development. The different qubit modalities being considered for quantum computing each have their strengths and weaknesses, making it challenging to compare their performance relative to each other and the state-of-the-art in classical high-performance computing. To better understand the utility of a given quantum processor and to assess when and how it will be able to advance the frontiers of computational science, researchers need a robust approach to quantum benchmarking. A variety of approaches have been proposed, many of which characterize the presence of noise in current quantum devices. These efforts include component-level performance metrics, such as randomized benchmarking and gate set tomography; high-level application-dependent metrics; and devicelevel metrics, such as the Quantum Volume. However, it remains unclear how low-level metrics, such as fidelities and decoherence times, and global device metrics, such as Quantum Volume, relate to the computational utility and practical limitations of quantum processors to solve useful problems. In this paper, we describe our Hamiltonian-oriented approach to quantum benchmarking called HamPerf. Where previous application-dependent approaches specify a suite of benchmarking circuits inspired by applications, we place the problem Hamiltonian at the center. Our strategy allows us to probe the computational performance of a quantum processor on standardized and relevant problem sets, agnostic of the algorithms and hardware used to solve them; it also provides fundamental insights into how device characteristics correlate with computational utility.

Butko, Anastasiia↗

DOE OSTI2024

Complexity-calibrated benchmarks for machine learning reveal when prediction algorithms succeed and mislead

Abstract Recurrent neural networks are used to forecast time series in finance, climate, language, and from many other domains. Reservoir computers are a particularly easily trainable form of recurrent neural network. Recently, a “next-generation” reservoir computer was introduced in which the memory trace involves only a finite number of previous symbols. We explore the inherent limitations of finite-past memory traces in this intriguing proposal. A lower bound from Fano’s inequality shows that, on highly non-Markovian processes generated by large probabilistic state machines, next-generation reservoir computers with reasonably long memory traces have an error probability that is at least $$\sim 60\%$$ ∼ 60 % higher than the minimal attainable error probability in predicting the next observation. More generally, it appears that popular recurrent neural networks fall far short of optimally predicting such complex processes. These results highlight the need for a new generation of optimized recurrent neural network architectures. Alongside this finding, we present concentration-of-measure results for randomly-generated but complex processes. One conclusion is that large probabilistic state machines—specifically, large $$\epsilon$$ ϵ -machines—are key to generating challenging and structurally-unbiased stimuli for ground-truthing recurrent neural network architectures.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2025

Efficient wind farm layout optimization with the FLOWERS AEP model and analytic gradients

Wind farm layout optimization (WFLO) studies often aim to maximize the annual energy production (AEP) of a wind farm by choosing an arrangement of turbines that minimizes wake interactions. One way to reduce the cost of WFLO studies is by using more computationally efficient AEP models. The cost of standard AEP modeling approaches, based on the numerical integration of low-fidelity engineering wake models, scales poorly with the number of simulated discrete wind conditions. A second way to reduce cost when using a gradient-based algorithm is to supply exact gradient information instead of finite-difference estimates. However, analytical functions for the derivatives of AEP with respect to turbine positions are not always available in the conventional modeling approach. FLOWERS is a computationally inexpensive, analytical model for wind farm AEP that is specifically developed for WFLO applications. In this paper, we analyze the performance of the FLOWERS AEP model with analytic gradients in a layout optimization study compared with a reference optimization framework across three wind farm case studies. We find that the FLOWERS-based approach reduces computation time by a factor of 50–4000 and improves optimal AEP by about 0.3% with less than half of the variability in AEP across instances with randomized initial conditions. We also find the optimal layouts to be insensitive to model parameter tuning, making FLOWERS-based layout optimization a streamlined, user-friendly approach.

17 WIND ENERGY↗

DOE OSTI2024

AGS-GNN: Attribute-guided Sampling for Graph Neural Networks

We propose AGS-GNN, a novel attribute-guided sampling algorithm for Graph Neural Networks (GNNs) that exploits node features and connectivity structure of a graph while simultaneously adapting for both homophily and heterophily in graphs. (In homophilic graphs vertices of the same class are more likely to be connected, and vertices of different classes tend to be linked in heterophilic graphs.) While GNNs have been successfully applied to homophilic graphs, their application to heterophilic graphs remains challenging. The best-performing GNNs for heterophilic graphs do not fit the sampling paradigm, suffer high computational costs, and are not inductive. We employ samplers based on feature-similarity and feature-diversity to select subsets of neighbors for a node, and adaptively capture information from homophilic and heterophilic neighborhoods using dual channels. Currently, AGS-GNN is the only algorithm that we know of that explicitly controls homophily in the sampled subgraph through similar and diverse neighborhood samples. For diverse neighborhood sampling, we employ submodularity, which was not used in this context prior to our work. The sampling distribution is pre-computed and highly parallel, achieving the desired scalability. Using an extensive dataset consisting of 35 small (<=100K nodes) and large (>100K nodes) homophilic and heterophilic graphs, we demonstrate the superiority of AGS-GNN compare to the current approaches in the literature. AGS-GNN achieves comparable test accuracy to the best-performing heterophilic GNNs, even outperforming methods using the entire graph for node classification. AGS-GNN also converges faster compared to methods that sample neighborhoods randomly, and can be incorporated into existing GNN models that employ node or graph sampling.

artificial intelligence↗

NASA NTRS1995

Nonsphericity of dust-like tropospheric aerosols: Implications for aerosol remote sensing and climate modeling

T-matrix computations of light scattering by polydispersions of randomly oriented nonspherical aerosols and Mie computations for equivalent spheres are compared. Findings show that even moderate nonsphericity results in suubstantial errors in the retrieved aerosol optical thickness if satellite reflectance measurements are analyzed using Mie theory. On the other hand, the use of Mie theory for nonspherical aerosols produces negligible errors in the computation of albedo and flux related quantities, provided that the aerosol size distribution and optical thickness are known beforehand. The first result can be explained by large nonspherical-spherical differences in scattering phase function, while the second result follows from small nonspherical-spherical differences in single-scattering albedo and asymmetry parameter. No cancellation of errors occurs if one consistently uses Mie theory in the retrieval algorithm and then in computing the albedo for the retrieved aerosol optical thickness.

Mishchenko, M. I.↗