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.

SourceResearch connectionFrom yearThrough year

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

At least 631 records · Page 35

All sources NASA NTRS DOE OSTI

NASA NTRS2009

Fully Automated Detection of Cloud and Aerosol Layers in the CALIPSO Lidar Measurements

Accurate knowledge of the vertical and horizontal extent of clouds and aerosols in the earth s atmosphere is critical in assessing the planet s radiation budget and for advancing human understanding of climate change issues. To retrieve this fundamental information from the elastic backscatter lidar data acquired during the Cloud-Aerosol Lidar and Infrared Pathfinder Satellite Observations (CALIPSO) mission, a selective, iterated boundary location (SIBYL) algorithm has been developed and deployed. SIBYL accomplishes its goals by integrating an adaptive context-sensitive profile scanner into an iterated multiresolution spatial averaging scheme. This paper provides an in-depth overview of the architecture and performance of the SIBYL algorithm. It begins with a brief review of the theory of target detection in noise-contaminated signals, and an enumeration of the practical constraints levied on the retrieval scheme by the design of the lidar hardware, the geometry of a space-based remote sensing platform, and the spatial variability of the measurement targets. Detailed descriptions are then provided for both the adaptive threshold algorithm used to detect features of interest within individual lidar profiles and the fully automated multiresolution averaging engine within which this profile scanner functions. The resulting fusion of profile scanner and averaging engine is specifically designed to optimize the trade-offs between the widely varying signal-to-noise ratio of the measurements and the disparate spatial resolutions of the detection targets. Throughout the paper, specific algorithm performance details are illustrated using examples drawn from the existing CALIPSO dataset. Overall performance is established by comparisons to existing layer height distributions obtained by other airborne and space-based lidars.

Vaughan, Mark A.↗

NASA NTRS2003

Updated Integrated Mission Program

Integrated Mission Program (IMP) is a computer program for simulating spacecraft missions around the Earth, Moon, Mars, and/or other large bodies. IMP solves the differential equations of motion by use of a Runge-Kutta numerical-integration algorithm. Users control missions through selection from a large menu of events and maneuvers. Mission profiles, time lines, propellant requirements, feasibility analyses, and perturbation analyses can be computed quickly and accurately. A prior version of IMP, written in FORTRAN 77, was reported in Program Simulates Spacecraft Missions (MFS-28606), NASA Tech Briefs, Vol. 17, No. 4 (April 1993), page 60. The present version, written in double-precision Lahey FORTRAN 90, incorporates a number of improvements over the prior version. Some of the improvements modernize the code to take advantage of today's greater central-processing-unit speeds. Other improvements render the code more modular; provide additional input, output, and debugging capabilities; and add to the variety of maneuvers, events, and means of propulsion that can be simulated. The IMP user manuals (of which there are now ten, each addressing a different aspect of the code and its use) have been updated accordingly.

Dauro, Vincent A., Sr.↗

NASA NTRS2009

Recent Electric Propulsion Development Activities for NASA Science Missions

(The primary source of electric propulsion development throughout NASA is managed by the In-Space Propulsion Technology Project at the NASA Glenn Research Center for the Science Mission Directorate. The objective of the Electric Propulsion project area is to develop near-term electric propulsion technology to enhance or enable science missions while minimizing risk and cost to the end user. Major hardware tasks include developing NASA s Evolutionary Xenon Thruster (NEXT), developing a long-life High Voltage Hall Accelerator (HIVHAC), developing an advanced feed system, and developing cross-platform components. The objective of the NEXT task is to advance next generation ion propulsion technology readiness. The baseline NEXT system consists of a high-performance, 7-kW ion thruster; a high-efficiency, 7-kW power processor unit (PPU); a highly flexible advanced xenon propellant management system (PMS); a lightweight engine gimbal; and key elements of a digital control interface unit (DCIU) including software algorithms. This design approach was selected to provide future NASA science missions with the greatest value in mission performance benefit at a low total development cost. The objective of the HIVHAC task is to advance the Hall thruster technology readiness for science mission applications. The task seeks to increase specific impulse, throttle-ability and lifetime to make Hall propulsion systems applicable to deep space science missions. The primary application focus for the resulting Hall propulsion system would be cost-capped missions, such as competitively selected, Discovery-class missions. The objective of the advanced xenon feed system task is to demonstrate novel manufacturing techniques that will significantly reduce mass, volume, and footprint size of xenon feed systems over conventional feed systems. This task has focused on the development of a flow control module, which consists of a three-channel flow system based on a piezo-electrically actuated valve concept, as well as a pressure control module, which will regulate pressure from the propellant tank. Cross-platform component standardization and simplification are being investigated through the Standard Architecture task to reduce first user costs for implementing electric propulsion systems. Progress on current hardware development, recent test activities and future plans are discussed.

Pencil, Eric J.↗

NASA NTRS2017

Image Navigation and Registration Performance Assessment Evaluation Tools for GOES-R ABI and GLM

The GOES-R Flight Project has developed an Image Navigation and Registration (INR) Performance Assessment Tool Set (IPATS) for measuring Advanced Baseline Imager (ABI) and Geostationary Lightning Mapper (GLM) INR performance metrics in the post-launch period for performance evaluation and long term monitoring. IPATS utilizes a modular algorithmic design to allow user selection of data processing sequences optimized for generation of each INR metric. This novel modular approach minimizes duplication of common processing elements, thereby maximizing code efficiency and speed. Fast processing is essential given the large number of sub-image registrations required to generate INR metrics for the many images produced over a 24 hour evaluation period. This paper describes the software design and implementation of IPATS and provides preliminary test results.

Image registration↗

NASA NTRS2017

Image Navigation and Registration Performance Assessment Evaluation Tools for GOES-R ABI and GLM

image registration↗

NASA NTRS2019

Cluster Analysis of IRIS Spectroscopic Line Profiles and SDO/AIA EUV Emission in Observations and RMHD Simulations of the Solar Atmosphere

Spatially-resolved observations from the IRIS and SDO/AIA satellites, especially when coupled with realistic 3D RMHD simulations, are a powerful tool for analysis of processes in the solar chromosphere, transition region, and corona. However, the complexity of the data makes understanding the observations and modeling results difficult. In this work, we apply unsupervised clustering algorithms for analysis of observational and synthetic chromospheric Mg II h&k 2796Å&2803Å and transition region C II 1334Å&1335Å line profiles observed by IRIS, and extreme ultraviolet (EUV) emission observed by SDO/AIA, for various types of problems. The synthetic line profiles are computed for simulations of the quiescent solar atmosphere (using the StellarBox and RH1.5 codes). The K-Means clustering algorithm is applied, and the selection of an optimal number of clusters is supported by the average silhouette width technique. We discuss applications of the line profile clustering method to 1) visualization of computational and observational spectroscopic imaging data; 2) understanding of evolutionary trends and behavior patterns of quiet Sun emission and during solar flares; and 3) recognition of heating events and shock waves.

Sadykov, Viacheslav↗

DOE OSTI2023

Faster approximate subgraph counts with privacy

One of the most common problems studied in the context of differential privacy for graph data is counting the number of non-induced embeddings of a subgraph in a given graph. These counts have very high global sensitivity. Therefore, adding noise based on powerful alternative techniques, such as smooth sensitivity and higher-order local sensitivity have been shown to give significantly better accuracy. However, all these alternatives to global sensitivity become computationally very expensive, and to date efficient polynomial time algorithms are known only for few selected subgraphs, such as triangles, k-triangles, and k-stars. In this paper, we show that good approximations to these sensitivity metrics can be still used to get private algorithms. Using this approach, we much faster algorithms for privately counting the number of triangles in real-world social networks, which can be easily parallelized. We also give a private polynomial time algorithm for counting any constant size subgraph using less noise than the global sensitivity; we show this can be improved significantly for counting paths in special classes of graphs

Nguyen, Dung↗

NASA NTRSDate not supplied

Feature Selection in High-Dimensional Space with Applications to Gene Expression Data

Recent years have seen rapid growth in high-dimensional datasets. Most existing machine learning (ML) algorithms fail in high-dimensional settings where many features could be redundant. A critical process of feature selection is thus applied in such a setting that helps in identifying the most relevant features while removing redundant ones. With the increase in high dimensionality, one is also faced with problems of efficiency and interpretation in performing such selection methods. Therefore, this paper proposes a “novel” feature selection framework that uses an ensemble of interpretable ML algorithms to perform feature selection and the ranking of final features. Finally, this framework is applied to a gene expression dataset obtained through collaboration with the National Aeronautics and Space Administration (NASA)’s Biological and Physical Sciences (BPS) team and helps identify important and relevant genes contributing to specific target attributes through classification tasks.

Nishan Pantha↗

DOE OSTI2019

Intelligent load pattern modeling and denoising using improved variational mode decomposition for various calendar periods

This paper proposes a novel approach to identify the load patterns considering calendar impact and denoising process, which advances the state of art of load identification and load forecasting to a more flexible and adaptive extent by revealing the correlation between load profile and the substantial influence factors. With the rapid development and the promising application of energy intemet and grid modernization, the accurate load modeling and forecasting especially by load pattern modeling (LPM) have become more and more critical to observe and estimate load profile so as to optimize the operation efficiency of the power grid. Traditional methods mostly focus on the static LPM itself which are unable to account the non-linear and highly dynamic load fluctuations in order to balance the demand of the power grid during various calendar period (VCP) scheduling. In this paper, a load pattern modeling method for power grid considering the impact of typical calendar effects is proposed using a combination of improved variational mode decomposition (IVMD) and deep belief network (DBN) algorithm. Firstly, an index of load curve curvature (LCC) is proposed to improve the selection of value K in the conventional VMD algorithm. The value K of the intrinsic modality is determined by adopting LCC to better quantify the average instantaneous frequency of the modal decomposition of the VMD and to reduce the elevated stochasticity of k. Secondly, an optimization formulation is developed based on adaptive segmented loop decomposition of the typical correlation coefficient to suppress the edge effect in VMD decomposition, which would enable the reconstructed curve to incorporate the variabilities from the initial data. Finally, the IVMD and DBN algorithms are jointly implemented to optimize the accuracy of VCP load pattern modeling curve regression. Numerical examples have been performed with the results proving that the proposed method significantly outperforms the state-of-art in reducing the modeling error of VCP load curve, improving the overall forecasting accuracy, and reducing load dispatching cost.

deep belief network↗

NASA NTRS1993

Automatic Detection of Seizures with Applications

There are an estimated two million people with epilepsy in the United States. Many of these people do not respond to anti-epileptic drug therapy. Two devices can be developed to assist in the treatment of epilepsy. The first is a microcomputer-based system designed to process massive amounts of electroencephalogram (EEG) data collected during long-term monitoring of patients for the purpose of diagnosing seizures, assessing the effectiveness of medical therapy, or selecting patients for epilepsy surgery. Such a device would select and display important EEG events. Currently many such events are missed. A second device could be implanted and would detect seizures and initiate therapy. Both of these devices require a reliable seizure detection algorithm. A new algorithm is described. It is believed to represent an improvement over existing seizure detection algorithms because better signal features were selected and better standardization methods were used.

Olsen, Dale E.↗

NASA NTRS1993

Linear and nonlinear pattern selection in Rayleigh-Benard stability problems

A new algorithm is introduced to compute finite-amplitude states using primitive variables for Rayleigh-Benard convection on relatively coarse meshes. The algorithm is based on a finite-difference matrix-splitting approach that separates all physical and dimensional effects into one-dimensional subsets. The nonlinear pattern selection process for steady convection in an air-filled square cavity with insulated side walls is investigated for Rayleigh numbers up to 20,000. The internalization of disturbances that evolve into coherent patterns is investigated and transient solutions from linear perturbation theory are compared with and contrasted to the full numerical simulations.

Davis, Sanford S.↗

NASA NTRS1976

Stimulation of a turbofan engine for evaluation of multivariable optimal control concepts

The development of control systems for jet engines requires a real-time computer simulation. The simulation provides an effective tool for evaluating control concepts and problem areas prior to actual engine testing. The development and use of a real-time simulation of the Pratt and Whitney F100-PW100 turbofan engine is described. The simulation was used in a multi-variable optimal controls research program using linear quadratic regulator theory. The simulation is used to generate linear engine models at selected operating points and evaluate the control algorithm. To reduce the complexity of the design, it is desirable to reduce the order of the linear model. A technique to reduce the order of the model; is discussed. Selected results between high and low order models are compared. The LQR control algorithms can be programmed on digital computer. This computer will control the engine simulation over the desired flight envelope.

Seldner, K.↗

DOE OSTI2019

Measurement of the splashback feature around SZ-selected Galaxy clusters with DES, SPT, and ACT

We present a detection of the splashback feature around galaxy clusters selected using the Sunyaev-Zel'dovich (SZ) signal. Recent measurements of the splashback feature around optically selected galaxy clusters have found that the splashback radius, rsp, is smaller than predicted by N-body simulations. A possible explanation for this discrepancy is that rsp inferred from the observed radial distribution of galaxies is affected by selection effects related to the optical cluster-finding algorithms. We test this possibility by measuring the splashback feature in clusters selected via the SZ effect in data from the South Pole Telescope SZ survey and the Atacama Cosmology Telescope Polarimeter survey. The measurement is accomplished by correlating these cluster samples with galaxies detected in the Dark Energy Survey Year 3 data. The SZ observable used to select clusters in this analysis is expected to have a tighter correlation with halo mass and to be more immune to projection effects and aperture-induced biases, potentially ameliorating causes of systematic error for optically selected clusters. We find that the measured r sp for SZ-selected clusters is consistent with the expectations from simulations, although the small number of SZ-selected clusters makes a precise comparison difficult. In agreement with previous work, when using optically selected redMaPPer clusters with similar mass and redshift distributions, r sp is ~2σ smaller than in the simulations. These results motivate detailed investigations of selection biases in optically selected cluster catalogues and exploration of the splashback feature around larger samples of SZ-selected clusters. Additionally, we investigate trends in the galaxy profile and splashback feature as a function of galaxy colour, finding that blue galaxies have profiles close to a power law with no discernible splashback feature, which is consistent with them being on their first infall into the cluster.

Shin, T.↗

NASA NTRS2019

Measurement of the Splashback Feature Around SZ-Selected Galaxy Clusters With DES, SPT, and ACT

We present a detection of the splashback feature around galaxy clusters selected using the Sunyaev–Zel’dovich (SZ) signal. Recent measurements of the splashback feature around optically selected galaxy clusters have found that the splashback radius, rsp, is smaller than predicted by N-body simulations. A possible explanation for this discrepancy is that rsp inferred from the observed radial distribution of galaxies is affected by selection effects related to the optical cluster-finding algorithms. We test this possibility by measuring the splashback feature in clusters selected via the SZ effect in data from the South Pole Telescope SZ survey and the Atacama Cosmology Telescope Polarimeter survey. The measurement is accomplished by correlating these cluster samples with galaxies detected in the Dark Energy Survey Year 3data. The SZ observable used to select clusters in this analysis is expected to have a tighter correlation with halo mass and to be more immune to projection effects and aperture-induced biases, potentially ameliorating causes of systematic error for optically selected clusters. We find that the measured rsp for SZ-selected clusters is consistent with the expectations from simulations, although the small number of SZ-selected clusters makes a precise comparison difficult. In agreement with previous work, when using optically selected red MaPPer clusters with similar mass and redshift distributions,rspis∼2σsmaller than in the simulations. These results motivate detailed investigations of selection biases in optically selected cluster catalogues and exploration of the splashback feature around larger samples of SZ-selected clusters. Additionally, we investigate trends in the galaxy profile and splashback feature as a function of galaxy colour, finding that blue galaxies have profiles close to a power law with no discernible splashback feature, which is consistent with them being on their first in fall into the cluster.

T Shin↗

NASA NTRSDate not supplied

Total Variation Majorization Minimization (TV-MM) Approach to Radiometer Brightness Temperature Gridding and Reconstruction

This paper presents the implementation of an algorithm to enhance the image resolution of the Earth's surface brightness temperature (T B ) data measured by radiometers such as the one onboard of the Soil Moisture Active Passive (SMAP) mission. A key step in radiometer T B processing is the conversion of the swath-based calibrated antenna temperature (T A ) measurements to the Level 3 Earth-centered grid. The simplest algorithm to transform this data from swath to gridded format is called drop-in-the-bucket which simply averages surrounding noisy T A samples to form a T B value at the gridded location. This method reduces noise, however produces low resolution products. To obtain a higher resolution product, SMAP uses other techniques such the Backus-Gilbert (BG) algorithm, which is the conventional method used in microwave radiometry. Although this method performs the required interpolation, it is not effective in denoising and removing blurring effects due to antenna filtering of the radiometer image data. Our motivation for this development is to further improve the resolution through post-processing of the radiometer T B image, a highly cost-effective method of image enhancement. The approach adapted in this work is based on the minimization of the Total Variation (TV) regularized objective function that is used extensively in solving general ill-posed linear inverse problems in image processing. Since the TV-based objective function is convex but not everywhere differentiable, there exists many numerical algorithms that can estimate the solution and the one selected for this work is called Majorization- Minimization (MM). By applying this algorithm, simulation experiments were performed based on synthetic data from the Geophysical model as well as real SMAP data to demonstrate the effectiveness of the technique. Results were then compared against the BG method.

Wing Lee↗

NASA NTRS1980

A new algorithm for horizontal capture trajectories

An algorithm which transfers an aircraft from an initial position and heading to a final position and heading was developed for onboard synthesis of horizontal flight paths. The algorithm finds all solutions possible, and selects the one with minimum path length. Degenerate conditions in which one or more of the basic segments is missing are handled without difficulty. The solution to this problem is derived, and a FORTRAN listing of the algorithm is provided.

Mclean, J. D.↗

DOE OSTI2024

Machine learning-guided discovery of polymer membranes for CO 2 separation with genetic algorithm

Designing polymer membranes with high gas permeability and selectivity is a difficult multi-task constrained problem due to the trade-off between these two properties. In this work, we present a machine learning (ML) driven genetic algorithm to tackle the design problem of polymer membranes for CO 2 separation from N 2 and O 2 . Using literature data of permeability for three gases, we constructed multiple ML models with different fingerprinting featurization schemes to predict gas permeabilities. Then, we employed a genetic algorithm to design new polymers and evaluated their performance using our ML models. We were able to identify new polymer membranes that are promising for both CO 2 /N 2 and CO 2 /O 2 separations. Further, the top discovered polymers are predicted to have high glass transition temperatures. Similarly, the pyridine functionality was found in ≈20% of the predicted polymers. This framework can be used to design polymers for any application involving constrained optimization. Finally, we outlined the challenges and opportunities with using ML guided data-driven inverse design of polymers.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

NASA NTRS2022

MLtool: Universal Supervised Machine Learning Tool to Model Tabulated Data

Machine Learning (ML) is a subfield of Artificial Intelligence that gives computers the ability to learn from past data without being explicitly programmed. The predictive capabilities of ML models have already been used to facilitate several scientific breakthroughs. However, the practical application of ML is often limited due to the gaps in technical knowledge of its users. The common issue faced by many scientific researchers is the inability to choose the appropriate ML pipelines that are needed to treat real-world data, which is often sparse and noisy. To solve this problem, we have developed an automated Machine Learning tool (MLtool) that includes a set of ML algorithms and approaches to aid scientific researchers. The current version of MLtool is implemented as an object-oriented Python code that is easily extensible. It includes 44 different regression algorithms used to model data. MLtool helps users select the best model for their data, based on the scoring metrics used. Besides regression algorithms, MLtool also includes a suite of pre- and post-processing techniques such as missing value imputation, categorical variable encoding, input feature normalization, uncertainty quantification, exploratory data analysis (EDA), etc. MLtool was tested on several publicly available multi-dimensional data sets and was found capable of making accurate predictions.

Machine learning↗