Search NASA⌕ Search

SEARCH · Search NASA

Results for “algorithm selection”

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,135 records · Page 63
All sourcesNASA NTRSDOE OSTI
NASA NTRS2015

Aeroelastic Tailoring Study of N+2 Low Boom Supersonic Commerical Transport Aircraft

The Lockheed Martin N+2 Low - boom Supersonic Commercial Transport (LSCT) aircraft was optimized in this study through the use of a multidisciplinary design optimization tool developed at the National Aeronautics and S pace Administration Armstrong Flight Research Center. A total of 111 design variables we re used in the first optimization run. Total structural weight was the objective function in this optimization run. Design requirements for strength, buckling, and flutter we re selected as constraint functions during the first optimization run. The MSC Nastran code was used to obtain the modal, strength, and buckling characteristics. Flutter and trim analyses we re based on ZAERO code, and landing and ground control loads were computed using an in - house code. The w eight penalty to satisfy all the design requirement s during the first optimization run was 31,367 lb, a 9.4% increase from the baseline configuration. The second optimization run was prepared and based on the big-bang big-crunch algorithm. Six composite ply angles for the second and fourth composite layers were selected as discrete design variables for the second optimization run. Composite ply angle changes can't improve the weight configuration of the N+2 LSCT aircraft. However, this second optimization run can create more tolerance for the active and near active strength constraint values for future weight optimization runs.

low boom supersonic civil transport↗
DOE OSTI2026

Machine Learning–Augmented Laser-Induced Breakdown Spectroscopy for Spectral Discrimination of Iron Oxalates

Enhanced characterization and phase identification of post-PUREX Pu Oxalates (PuOXA) are pivotal for nonproliferation and pre-detonation nuclear forensics. Despite significant advances in the characterization of PuO 2 samples, little is known about the impact of both the chemical structure and oxidation states of PuOXA (i.e., Pu(III) and Pu(IV)) have on optical emission signatures. Here, we demonstrate the analytical capabilities of laser-induced breakdown spectroscopy (LIBS) applied to Fe(II) and Fe(III) oxalate samples as surrogates for PuOXA, highlighting the discriminating features in the LIBS emission spectra arising from differences in the oxidation states within mixed FeOXA samples. We report the enhancement of spectral feature selection using Principal Component Analysis (PCA), which enables the analytical superiority of machine learning algorithms such as Linear Discriminant Analysis (LDA), Quadratic Discriminant Analysis (QDA), Partial Least Squares Regression (PLSR), Support Vector Regression (SVR), and Random Forest Regression (RFR) over conventional univariate techniques for phase discrimination and chemometric analysis. Cluster analysis revealed how both matrix effects and laser ablation influence cluster separability by introducing spectral artifacts that misdirect the maximization of variance. PCA-selected emission lines were used in the regression models, demonstrating that both univariate and multivariate linear regression models (i.e., PLSR and SVR) can achieve acceptable performance, with machine learning models outperforming conventional calibration regressions. Furthermore, the application of non-linearly activated PCA-selected emission lines illustrates how simplifying the data while retaining captured variance enables the use of less complex and more computationally efficient models. Furthermore, this is particularly evident in the underperformance of RFR, which suffers from increased computational costs and overfitting owing to its high complexity.

Oxalates↗
DOE OSTI2025

MetaHeuristic Feature Selection for Energy Group Optimization and Analysis

Energy discretization is a crucial component of deterministic neutron transport simulations. Metaheuristic (MH) optimizers are effective algorithms to determine group structures that maximize both solution accuracy and computational efficiency. This project establishes a framework for optimizing group structures for PARTISN simulations using the Python library MEALPY. Group structure optimization is formulated as a binary feature selection problem, and results are investigated with permutation and material importance techniques to determine physically relevant energy bounds. We conclude that MH optimizers find group structures that drastically improve flux calculations while preserving k-effective accuracy. Further, we find that individual energy bounds are not necessarily physically relevant, but rather specific energy ranges are.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
NASA NTRS1993

Convergence acceleration of implicit schemes in the presence of high aspect ratio grid cells

The performance of Navier-Stokes codes are influenced by several phenomena. For example, the robustness of the code may be compromised by the lack of grid resolution, by a need for more precise initial conditions or because all or part of the flowfield lies outside the flow regime in which the algorithm converges efficiently. A primary example of the latter effect is the presence of extended low Mach number and/or low Reynolds number regions which cause convergence deterioration of time marching algorithms. Recent research into this problem by several workers including the present authors has largely negated this difficulty through the introduction of time-derivative preconditioning. In the present paper, we employ the preconditioned algorithm to address convergence difficulties arising from sensitivity to grid stretching and high aspect ratio grid cells. Strong grid stretching is particularly characteristic of turbulent flow calculations where the grid must be refined very tightly in the dimension normal to the wall, without a similar refinement in the tangential direction. High aspect ratio grid cells also arise in problems that involve high aspect ratio domains such as combustor coolant channels. In both situations, the high aspect ratio cells can lead to extreme deterioration in convergence. It is the purpose of the present paper to address the reasons for this adverse response to grid stretching and to suggest methods for enhancing convergence under such circumstances. Numerical algorithms typically possess a maximum allowable or optimum value for the time step size, expressed in non-dimensional terms as a CFL number or vonNeumann number (VNN). In the presence of high aspect ratio cells, the smallest dimension of the grid cell controls the time step size causing it to be extremely small, which in turn results in the deterioration of convergence behavior. For explicit schemes, this time step limitation cannot be exceeded without violating stability restrictions of the scheme. On the other hand, for implicit schemes, which are typically unconditionally stable, there appears to be room for improvement through careful tailoring of the time step definition based on results of linear stability analyses. In the present paper, we focus on the central-differenced alternating direction implicit (ADI) scheme. The understanding garnered from this analyses can then be applied to other implicit schemes. In order to systematically study the effects of aspect ratio and the methods of mitigating the associated problems, we use a two pronged approach. We use stability analyses as a tool for predicting numerical convergence behavior and numerical experiments on simple model problems to verify predicted trends. Based on these analyses, we determine that efficient convergence may be obtained at all aspect ratios by getting a combination of things right. Primary among these are the proper definition of the time step size, proper selection of viscous preconditioner and the precise treatment of boundary conditions. These algorithmic improvements are then applied to a variety of test cases to demonstrate uniform convergence at all aspect ratios.

Buelow, B. E. O.↗
DOE OSTI2022

Using machine learning to identify extragalactic globular cluster candidates from ground-based photometric surveys of M87

Globular clusters (GCs) have been at the heart of many longstanding questions in many sub-fields of astronomy and, as such, systematic identification of GCs in external galaxies has immense impacts. In this study, we take advantage of M87’s well-studied GC system to implement supervised machine learning (ML) classification algorithms – specifically random forest and neural networks – to identify GCs from foreground stars and background galaxies, using ground-based photometry from the Canada–France–Hawaii Telescope (CFHT). We compare these two ML classification methods to studies of ‘human-selected’ GCs and find that the best-performing random forest model can reselect 61.2 per cent ± 8.0 per cent of GCs selected from HST data (ACSVCS) and the best-performing neural network model reselects 95.0 per cent ± 3.4 per cent. When compared to human-classified GCs and contaminants selected from CFHT data – independent of our training data – the best-performing random forest model can correctly classify 91.0 per cent ± 1.2 per cent and the best-performing neural network model can correctly classify 57.3 per cent ± 1.1 per cent. ML methods in astronomy have been receiving much interest as Vera C. Rubin Observatory prepares for first light. The observables in this study are selected to be directly comparable to early Rubin Observatory data and the prospects for running ML algorithms on the upcoming data set yields promising results.

79 ASTRONOMY AND ASTROPHYSICS↗
NASA NTRS2016

MERRA-2 Input Observations: Summary and Assessment

The Modern-Era Retrospective Analysis for Research and Applications, Version 2 (MERRA-2) is an atmospheric reanalysis, spanning 1980 through near-realtime, that uses state-of-the-art processing of observations from the continually evolving global observing system. The effectiveness of any reanalysis is a function not only of the input observations themselves, but also of how the observations are handled in the assimilation procedure. Relevant issues to consider include, but are not limited to, data selection, data preprocessing, quality control, bias correction procedures, and blacklisting. As the assimilation algorithm and earth system models are fundamentally fixed in a reanalysis, it is often a change in the character of the observations, and their feedbacks on the system, that cause changes in the character of the reanalysis. It is therefore important to provide documentation of the observing system so that its discontinuities and transitions can be readily linked to discontinuities seen in the gridded atmospheric fields of the reanalysis. With this in mind, this document provides an exhaustive list of the input observations, the context under which they are assimilated, and an initial assessment of selected core observations fundamental to the reanalysis.

Satellite Observations↗
DOE OSTI2020

Learning-Based Load Control to Support Resilient Networked Microgrid Operations

Microgrids have proven to be an effective option for increasing the resiliency of critical end-use loads during extreme events. Building on past operational experiences, some microgrid operators are examining the potential to network microgrids to further improve resiliency. However, the frequency deviations experienced on isolated microgrids during transient events, such as switching operations, step increases in load, and loss of generation, are significantly larger than those typically seen on bulk transmission systems. The larger frequency deviations can cause a loss of inverter-connected assets, resulting in a loss of power to critical end-use loads. This paper presents a method of mitigating the impact of transient events by engaging end-use loads using Grid-Friendly Appliance TM (GFA) controllers. An online, i.e., real-time, device-level algorithm is presented, which adjusts individual GFA controller frequency set-points based on the operational characteristics of each end-use load, and on the changing grid dynamic characteristics. The presented method improves the dynamic stability of the networked microgrid operations while minimizing the interruptions to end-use loads. The presented work is validated with dynamic simulations using a modified version of the IEEE 123-node test system with three microgrids, using the GridLAB-D TM simulation environment.

Radhakrishnan, Nikitha↗
DOE OSTI2020

Randomized Projection for Rank-Revealing Matrix Factorizations and Low-Rank Approximations

Rank-revealing matrix decompositions provide an essential tool in spectral analysis of matrices, including the Singular Value Decomposition (SVD) and related low-rank approximation techniques. QR with Column Pivoting (QRCP) is usually suitable for these purposes, but it can be much slower than the unpivoted QR algorithm. For large matrices, the difference in performance is due to increased communication between the processor and slow memory, which QRCP needs in order to choose pivots during decomposition. Our main algorithm, Randomized QR with Column Pivoting (RQRCP), uses randomized projection to make pivot decisions from a much smaller sample matrix, which we can construct to reside in a faster level of memory than the original matrix. This technique may be understood as trading vastly reduced communication for a controlled increase in uncertainty during the decision process. Furthermore, for rank-revealing purposes, the selection mechanism in RQRCP produces results that are the same quality as the standard algorithm, but with performance near that of unpivoted QR (often an order of magnitude faster for large matrices). Additionally, we also propose two formulas that facilitate further performance improvements. The first efficiently updates sample matrices to avoid computing new randomized projections. The second avoids large trailing updates during the decomposition in truncated low-rank approximations. Our truncated version of RQRCP also provides a key initial step in our truncated SVD approximation, TUXV. These advances open up a new performance domain for large matrix factorizations that will support efficient problem-solving techniques for challenging applications in science, engineering, and data analysis.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Minijet clustering algorithm using transverse-momentum seeds in high-energy nuclear collisions

We propose an algorithm to detect mini-jet clusters in high-energy nuclear collisions, by selecting a high-transverse-momentum (pT) particle as a seed and assigning a clustering radius (R) in the pseudorapidity and azimuthal-angle space. Our PYTHIA simulations for p+p collisions show that a scheme with a seeding p T of around 0.5 GeV/c and R of approximately 0.6 satisfactorily identifies mini-jet clusters. The correlation between clusters obtained in PYTHIA calculations using the algorithm exhibits the proper behavior of hard-scattering-like processes, suggesting its usefulness in isolating mini-jet-like clusters from non-hard-scattering soft processes when applied to actual nuclear-collision data, thereby allowing a closer examination of both the mini-jet and the soft mechanisms.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2020

Finite-Temperature Structures of Supported Subnanometer Catalysts Inferred via Statistical Learning and Genetic Algorithm-Based Optimization

Single-atom catalysts (SACs) minimize noble metal utilization and can alter the activity and selectivity of supported metal nanoparticles. However, the morphology of active centers, including single atoms and subnanometer clusters of a few atoms, remains elusive due to experimental challenges. The computational cost to describe numerous cluster shapes and sizes makes direct first-principles calculations impractical. We present a computational framework to enable structure determination for single-atom and subnanometer cluster catalysts. As a case study, we obtained the low energy structures of Pd n (n = 1-21) clusters supported on CeO 2 (111), which are critical components of automobile three-way catalysts. Trained on density functional theory data, a three-dimensional cluster expansion is established using statistical learning to describe the Hamiltonian and predict energies of supported Pdn clusters of any structure. Low energy stable and metastable structures are identified using a Metropolis Monte Carlo-based genetic algorithm in the canonical ensemble at 300 K. We observe that supported single atoms sinter to form bilayer clusters and large cluster isomers share similarities in both shape and energy, and elucidate the significance of the support and microstructure on cluster stability. We discovered a simple surrogate structure-energy model, where the energy per atom scales with the square root of the average first coordination number, which can be used to estimate energies and compare the stability of clusters. Our framework, applicable to any metal/support system, fills an important methodological gap to predict the stability of supported metal catalysts in the subnanometer regime.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2025

Faster solutions to the interdiction defense problem using suboptimal solutions

The interdiction defense (ID) problem solves a defender-attacker-defender model where the defender and attacker share the same set of components to harden and target. Here, we build upon the best response intersection (BRI) algorithm by developing the BRI with suboptimal solutions (BRI-SS) algorithm to solve the ID problem. The BRI-SS algorithm utilizes off-the-shelf optimization solvers that return suboptimal solutions at no additional computation cost. We derive novel cuts from suboptimal solutions, reducing the number of iterations required for the algorithm to converge while maintaining optimality guarantees. We also present a heuristic that utilizes all obtained suboptimal solutions to select the next defense to evaluate at each iteration. We perform computational experiments applied to power grid interdiction on standard test cases. Our results demonstrate that the BRI-SS algorithm consistently outperforms the BRI algorithm across all test cases.

Computer science↗
DOE OSTI2023

Measuring photometric redshifts for high-redshift radio source surveys

With the advent of deep, all-sky radio surveys, the need for ancillary data to make the most of the new, high-quality radio data from surveys like the Evolutionary Map of the Universe (EMU), GaLactic and Extragalactic All-sky Murchison Widefield Array survey eXtended, Very Large Array Sky Survey, and LOFAR Two-metre Sky Survey is growing rapidly. Radio surveys produce significant numbers of Active Galactic Nuclei (AGNs) and have a significantly higher average redshift when compared with optical and infrared all-sky surveys. Thus, traditional methods of estimating redshift are challenged, with spectroscopic surveys not reaching the redshift depth of radio surveys, and AGNs making it difficult for template fitting methods to accurately model the source. Machine Learning (ML) methods have been used, but efforts have typically been directed towards optically selected samples, or samples at significantly lower redshift than expected from upcoming radio surveys. This work compiles and homogenises a radio-selected dataset from both the northern hemisphere (making use of Sloan Digital Sky Survey optical photometry) and southern hemisphere (making use of Dark Energy Survey optical photometry). We then test commonly used ML algorithms such as k-Nearest Neighbours (kNN), Random Forest, ANNz, and GPz on this monolithic radio-selected sample. We show that kNN has the lowest percentage of catastrophic outliers, providing the best match for the majority of science cases in the EMU survey. We note that the wider redshift range of the combined dataset used allows for estimation of sources up to z = 3 before random scatter begins to dominate. When binning the data into redshift bins and treating the problem as a classification problem, we are able to correctly identify ≈ 76% of the highest redshift sources—sources at redshift z > 2.51 —as being in either the highest bin (z > 2.51) or second highest (z = 2.25).

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2020

Tunable assembly of hybrid colloids induced by regioselective depletion

Assembling colloidal particles using site-selective directional interactions into predetermined colloidal superlattices with desired properties is broadly sought-after, but challenging to achieve. Here in this paper, we exploit regioselective depletion interactions to engineer the directional bonding and assembly of non-spherical colloidal hybrid microparticles. We report that the crystallization of a binary colloidal mixture can be regulated by tuning the depletion conditions. Subsequently, we fabricate triblock biphasic colloids with controlled aspect ratios to achieve regioselective bonding. Without any surface treatment, these biphasic colloids assemble into various colloidal superstructures and superlattices featuring optimized pole-to-pole or center-to-center interactions. Additionally, we observe polymorphic crystallization, quantify the abundancy of each form using algorithms we developed, and investigate the crystallization process in real time. We demonstrate selective control of attractive interactions between specific regions on an anisotropic colloid with no need of site-specific surface functionalization, leading to a general method for achieving colloidal structures with yet unforeseen arrangements and properties.

36 MATERIALS SCIENCE↗
NASA NTRS1985

Multiprocessor sparse L/U decomposition with controlled fill-in

Generation of the maximal compatibles of pivot elements for a class of small sparse matrices is studied. The algorithm involves a binary tree search and has a complexity exponential in the order of the matrix. Different strategies for selection of a set of compatible pivots based on the Markowitz criterion are investigated. The competing issues of parallelism and fill-in generation are studied and results are provided. A technque for obtaining an ordered compatible set directly from the ordered incompatible table is given. This technique generates a set of compatible pivots with the property of generating few fills. A new hueristic algorithm is then proposed that combines the idea of an ordered compatible set with a limited binary tree search to generate several sets of compatible pivots in linear time. Finally, an elimination set to reduce the matrix is selected. Parameters are suggested to obtain a balance between parallelism and fill-ins. Results of applying the proposed algorithms on several large application matrices are presented and analyzed.

Alaghband, G.↗
DOE OSTI2021

Performance Results for Sensor Assignment Problem as Solved on a Multi-Node Cluster

An earlier report described a procedure for optimal sensor set selection and its implementation on a computational cluster. This new and innovative capability was developed to facilitate a reduction in operations staffing levels to improve plant economics. By automating surveillance and maintenance tasks through early detection of degrading sensors and equipment, staff can be more efficiently deployed. The method uses automated reasoning and domain knowledge in the form of the conservation equations to infer from plant measurements the state of equipment health. Inclusion of domain knowledge addresses the problem that exists with pure data-driven methods that there are no rigorous guidelines for determining what constitutes an adequate sensor set. Formalizing the procedure for sensor set selection as we have done results in a more reliable and explainable diagnosis of plant equipment health. Importantly, from the standpoint of the plant owner, personnel are provided with an early and explicit diagnosis of an equipment problem. That in principle automates the process and eliminates having to send personnel into the plant to find the cause as typically occurs when a data-driven method detects an anomaly. In this report we describe first results obtained using a computational cluster to solve the sensor set selection problem as framed above. The case described addresses the problem of equipment health monitoring in the high-pressure (HP) feedwater system of a pressurized light water reactor as seen through the eyes of our collaborating utility partner. Maintenance of this system can amount to millions of dollars per year if equipment health issues go undiagnosed and lead to loss of function. On examining the potential that is inherent in the installed sensor set for diagnosing equipment health degradation, it was found that greater fault resolution capability can be achieved using a sensor set that is 20 percent fewer in number. The take-away is that compared to the installed sensor set there exists a more strategic assignment of sensors that will furnish better health monitoring capability and with fewer sensors. Where the problem defies solution by manual inspection, as is the case here, one can be found by an algorithm. The solution was obtained in four hours using 30 computational cores. The HP feedwater problem as posed above illustrates the added value of approaching the sensor selection problem as one amenable to algorithmic solution. This problem is of interest to advanced reactor designers and to utilities that are setting up remote monitoring and diagnostic centers.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗
DOE OSTI2023

Small bimetallic clusters Agn-1M (M = Au, Co, Cu, Ni, Pd, Pt; n = 3, 9, 15): Density functional theory and genetic algorithm

We investigated the effect of size and composition on the properties of bimetallic nanoclusters. The geometric structures, stabilities, and electronic properties of size-selected Ag n-1 M (M = Au, Co, Cu, Ni, Pd, Pt; n = 3, 9, 15) bimetallic nanoclusters are systematically analyzed using spin-polarized density functional theory (DFT) within the generalized gradient approximation (GGA). We determine the most stable geometries for these clusters using a genetic algorithm (GA) in combination with DFT. Our results show that doping pure silver clusters with an M atom (transition metal), referred to as a “guest atom”, increases the stability as compared to pure Ag n (n = 3, 9, 15) clusters. The results for various properties including formation energy per atom, electronic structure, magnetic moments, and vibrational density of states (VDOS) are evaluated as a function of both size and composition of the system. The adsorption of selected bimetallic clusters on hydroxylated alumina substrate shows weak binding and minor changes in geometric properties except for Ag 8 Pt.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2023

Sensitivity analysis of an automated fault detection algorithm for residential air-conditioning systems

The state of the art of fault detection and diagnosis (FDD) for residential air-conditioning systems is expensive and not yet amenable to widespread implementation. FDD for homes can significantly reduce utility costs, and increase the lifespan of the equipment. The cost barriers currently, however, make FDD for homes economically unviable for large scale implementation. In prior work, we offered a solution to reduce FDD costs by proposing an automated fault detection algorithm to serve as a screening step before more expensive FDD tests can be conducted. The algorithm uses only the home thermostat and local weather information to identify thermodynamic parameters and detect high-impact air-conditioning faults, including those that occur during equipment installation. We had tested the algorithm on a single EnergyPlus™ model of a home in Orlando, Florida. The thermodynamic parameter identification process is highly nonconvex involving several local optimal solutions. In this paper we propose a novel method to select the best model for fault detection from among the list of local optimal solutions to make the algorithm more robust to homes of different construction, without which the fault detection process would be infeasible. Another unique contribution of the paper is implementing the solution on real-world data. We also bring the algorithm closer to market by testing it on real-world data. We implement the algorithm on data obtained from experiments conducted by the Florida Solar Energy Center (FSEC) on a laboratory home equipped with a heat pump where faults were intentionally added for a period of seven months. The algorithm successfully detected an undercharge fault with 70.6% accuracy, concurrent duct leakage and undercharge faults with 85.2% accuracy, and duct leakage faults with 69.1% accuracy. A sensitivity analysis is also performed on EnergyPlus models of nine types of homes that vary in construction to demonstrate the robustness of the algorithm. Finally, the algorithm achieves an average accuracy of 71% for no-fault condition, 77% for 40% undercharge fault, and 76% for duct-leak fault.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗
NASA NTRS1999

Dimensionality Reduction Through Classifier Ensembles

In data mining, one often needs to analyze datasets with a very large number of attributes. Performing machine learning directly on such data sets is often impractical because of extensive run times, excessive complexity of the fitted model (often leading to overfitting), and the well-known "curse of dimensionality." In practice, to avoid such problems, feature selection and/or extraction are often used to reduce data dimensionality prior to the learning step. However, existing feature selection/extraction algorithms either evaluate features by their effectiveness across the entire data set or simply disregard class information altogether (e.g., principal component analysis). Furthermore, feature extraction algorithms such as principal components analysis create new features that are often meaningless to human users. In this article, we present input decimation, a method that provides "feature subsets" that are selected for their ability to discriminate among the classes. These features are subsequently used in ensembles of classifiers, yielding results superior to single classifiers, ensembles that use the full set of features, and ensembles based on principal component analysis on both real and synthetic datasets.

Oza, Nikunj C.↗