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 433 records · Page 24

All sources NASA NTRS DOE OSTI

NASA NTRS2010

Automatic Identification of Solar X-Ray Bright Points in Hinode X-Ray Data

We have automated a method that is used to find point sources in Chandra X-ray telescope data, to identify solar bright points in Hinode X-ray data. This tool, called lextrct, first identifies candidate sources that are brighter than the surrounding background. The algorithm also allows selected pixels to be excluded from the source-finding, thus allowing saturated pixels (from flares and/or active regions) to be ignored. We then use lextrct to fit the sources to two-dimensional, elliptical Gaussians. The size and orientation give an approximation of the shape of the bright points. We are in the process of analyzing observations through the Al_poly filter with a four-second exposure time, to obtain a catalogue of bright points, which will include their sizes, lifetimes, intensities, and position on the solar disk

Adams, M. L.↗

NASA NTRS2011

A Methodology for Evaluating Artifacts Produced by a Formal Verification Process

The goal of this study is to produce a methodology for evaluating the claims and arguments employed in, and the evidence produced by formal verification activities. To illustrate the process, we conduct a full assessment of a representative case study for the Enabling Technology Development and Demonstration (ETDD) program. We assess the model checking and satisfiabilty solving techniques as applied to a suite of abstract models of fault tolerant algorithms which were selected to be deployed in Orion, namely the TTEthernet startup services specified and verified in the Symbolic Analysis Laboratory (SAL) by TTTech. To this end, we introduce the Modeling and Verification Evaluation Score (MVES), a metric that is intended to estimate the amount of trust that can be placed on the evidence that is obtained. The results of the evaluation process and the MVES can then be used by non-experts and evaluators in assessing the credibility of the verification results.

Siminiceanu, Radu I.↗

NASA NTRS2012

All-Sky Search for Gravitational-Wave Bursts in the First Joint LIGO-GEO-Virgo Run

We present results from an aU-sky search for unmodeled gravitational-wave bursts in the data collected by the LIGO, GEO 600 and Virgo detectors between November 2006 and October 2007. The search is performed. by three different analysis algorithms over the frequency band 50 - 6000 Hz. Data are analyzed for times with at least two of the four LIGO-Virgo detectors in coincident operation, with a total live time of 266 days, No events produced by the search algorithms survive the selection cuts. We set a frequentist upper limit on the rate of gravitational-wave bursts impinging on our network of detectors. When combined with the previous LIGO search of the data collected between November 2005 and November 2006, the upper limit on the rate of detectable gra.vitational. wave bursts in the 64-2048 Hz band is 2,0 events per year at 90% confidence. We also present event rate versus strength exclusion plots for several types of plausible burst waveforms. The sensitivity of the combined search is expressed in terms of the root-sum-squared strain amplitude for a variety of simulated waveforms and lies in the range 6 X 10(exp -22) Hz(exp - 1/2) to 2 X 10(exp -20) Hz(exp -l/2). This is the first untriggered burst search to use data from the LIGO and Virgo detectors together, and the most sensitive untriggered burst search performed so far.

Camp, J. B.↗

NASA NTRS2020

A Demonstration that Correcting for Completeness and Reliability Is Critical for Robust Occurrence Rates

A measurement of planetary occurrence rates based on a planet catalog should be robust against details of how initial detections were classified as planets or false positives. This is accomplished by supplying the catalog’s rate of missed planets (completeness) and rate of non-planets incorrectly called planets (reliability). The final Kepler data release (DR25) includes products that can be used with the DR25 planet candidate catalog to correct for completeness and reliability in occurrence rate estimates. This is made possible by the Kepler Robovetter, which algorithmically and uniformly selects planets based on a variety of metrics and thresholds. Completeness, reliability, and occurrence rates potentially depend on these Robovetter thresholds. We study the impact of varying these vetting thresholds using the techniques of Bryson et al. 2019 (arXiv:1906.03575). We explore sets of thresholds that result in more or fewer planets (trading off completeness for reliability), as well as thresholds tuned to pass DR25 false positives identified as possible planets by the Kepler False Positive Working Group. We find that when correcting only for completeness, and not reliability, the resulting occurrence rates have a strong dependence on these threshold sets. For example, the value of SAG13 eta-Earth varies by over a factor of 4 when not corrected for reliability. However, when correcting for both completeness and reliability, occurrence rates using our threshold sets are statistically indistinguishable, with differences being well inside 1-sigma error bars. We present occurrence rates integrated over several period-radius ranges. For example, SAG13 eta-Earth is consistent with 0.127 (+0.094)(-0.054) (from Bryson et al. 2019) for all the Robovetter threshold sets. This result emphasizes the importance of correcting occurrence rates for both completeness and reliability. This suggests that inconsistent completeness and reliability correction may be a significant contributor to the large variation of occurrence rates in recent literature. We plan to make the Robovetter results for our threshold sets available, and encourage the community to use them to examine whether other occurrence rate methods yield similarly robust results.

Bryson, S.↗

NASA NTRS1996

Evaluation of Star Identification Techniques

A number of different strategies are used or have been suggested for identifying star fields atitude determination in space. We offer a general classification of the existing techniques and select three representative algorithms for more comprehensive evaluation. In addition, we describe a software simulation environment we developed for the design, paramter determination, and evaluation of star identification algorithms. The identification rates and performance on the three algorithms are presented over a variety of noise conditions using two different sized onboard catalogs.

star↗

DOE OSTI2021

Optimized Dispatch of Distributed Energy Resources for Resiliency and Power Quality Improvements at the Grid-Edge

Distributed Energy Resources (DERs) installed on low-voltage distribution systems, both utility-owned and nonutility owned may be employed to make improvements to system resiliency and power quality, in addition to simply serving load demand. By selectively dispatching active and reactive power from these existing DERs, improvements in voltage profiles and service availability during adverse events may be achieved. Further benefits can be gained by optimally choosing which DERs to dispatch power from, and the distribution of power from those DERs. For a given operating condition, using Linear Programming methods, optimal power dispatch values for individual DERs can be determined, while considering variables such as voltage gains, losses in the lines and the DERs, and DER reserve capacities. One such optimization technique is developed in this paper, and results from a real-time simulation study on a modified IEEE 13-bus distribution system with three DERs, are being presented. The operation of the optimized DER selection and dispatch algorithm is shown during normal operation of the transmission system when the DERs operate in grid-connected mode. Similar analyses can drive decision making during transmission system failure when the DERs operate in grid-forming or islanded mode.

Chowdhury, Prithwiraj Roy↗

NASA NTRS1973

Search properties of some sequential decoding algorithms.

Sequential decoding procedures are studied in the context of selecting a path through a tree. Several algorithms are considered, and their properties are compared. It is shown that the stack algorithm introduced by Zigangirov (1966) and by Jelinek (1969) is essentially equivalent to the Fano algorithm with regard to the set of nodes examined and the path selected, although the description, implementation, and action of the two algorithms are quite different. A modified Fano algorithm is introduced, in which the quantizing parameter is eliminated. It can be inferred from limited simulation results that, at least in some applications, the new algorithm is computationally inferior to the old. However, it is of some theoretical interest since the conventional Fano algorithm may be considered to be a quantized version of it.

Geist, J. M.↗

DOE OSTI2025

Tomographic Sparse View Selection Using the View Covariance Loss

Standard computed tomography (CT) reconstruction algorithms such as filtered back projection (FBP) and Feldkamp-Davis-Kress (FDK) require many views for producing high-quality reconstructions, which can slow image acquisition and increase cost in non-destructive evaluation (NDE) applications. Over the past 20 years, a variety of methods have been developed for computing high-quality CT reconstructions from sparse views. However, the problem of how to select the best views for CT reconstruction remains open. In this paper, we present a novel view covariance loss (VCL) function that measures the joint information of a set of views by approximating the normalized mean squared error (NMSE) of the reconstruction. We present fast algorithms for computing the VCL along with an algorithm for selecting a subset of views that approximately minimizes its value. Our experiments on simulated and measured data indicate that for a fixed number of views our proposed view covariance loss selection (VCLS) algorithm results in reconstructions with lower NRMSE, fewer artifacts, and greater accuracy than current alternative approaches.

Lin, Jingsong [Purdue University]↗

DOE OSTI2024

Predictive analytics of selections of russet potatoes

We explore the application of machine learning algorithms specifically to enhance the selection process of Russet potato (Solanum tuberosum L.) clones in breeding trials by predicting their suitability for advancement. This study addresses the challenge of efficiently identifying high-yield, disease-resistant, and climate-resilient potato varieties that meet processing industry standards. Leveraging manually collected data from trials in the state of Oregon, we investigate the potential of a wide variety of state-of-the-art binary classification models. The dataset includes 1086 clones, with data on 38 attributes recorded for each clone, focusing on yield, size, appearance, and frying characteristics, with several control varieties planted consistently across four Oregon regions from 2013 to 2021. We conduct a comprehensive analysis of the dataset that includes preprocessing, feature engineering, and imputation to address missing values. We focus on several key metrics such as accuracy, F1-score, and Matthews correlation coefficient (MCC) for model evaluation. The top-performing models, namely a feedforward neural network classifier (Neural Net), a histogram-based gradient boosting classifier (HGBC), and a support vector machine classifier (SVM), demonstrate consistent and significant results. To further validate our findings, we conducted a simulation study using the aims, data-generating mechanisms, estimands, methods, and performance measures (ADEMP) framework, simulating different data-generating scenarios to assess model robustness and performance through true positive, true negative, false positive, and false negative distributions, area under the receiver operating characteristic curve (AUC-ROC) and MCC. The simulation results highlight that non-linear models like SVM and HGBC consistently show higher AUC-ROC and MCC than logistic regression, thus outperforming the traditional linear model across various distributions, and emphasizing the importance of model selection and tuning in agricultural trials. Variable selection further enhances model performance and identifies influential features in predicting trial outcomes. The findings emphasize the potential of machine learning in streamlining the selection process for potato varieties, offering benefits such as increased efficiency, substantial cost savings, and judicious resource utilization. Our study contributes insights into precision agriculture and showcases the relevance of advanced technologies for informed decision-making in breeding programs.

60 APPLIED LIFE SCIENCES↗

NASA NTRSDate not supplied

The TESS Mission Target Selection Procedure

We describe the target selection procedure by which stars are selected for 2 minute and 20 s observations by TESS. We first list the technical requirements of the TESS instrument and ground systems processing that limit the total number of target slots. We then describe algorithms used by the TESS Payload Operation Center (POC) to merge candidate targets requested by the various TESS mission elements (the Target Selection Working Group, TESS Asteroseismic Science Consortium, and Guest Investigator office). Lastly, we summarize the properties of the observed TESS targets over the two-year primary TESS mission. We find that the POC target selection algorithm results in 2.1–3.4 times as many observed targets as target slots allocated for each mission element. We also find that the sky distribution of observed targets is different from the sky distributions of candidate targets due to technical constraints that require a relatively even distribution of targets across the TESS fields of view. We caution researchers exploring statistical analyses of TESS planet-host stars that the population of observed targets cannot be characterized by any simple set of criteria applied to the properties of the input Candidate Target Lists.

Michael Fausnaugh↗

DOE OSTI2022

Active meta-learning for predicting and selecting perovskite crystallization experiments

Autonomous experimentation systems use algorithms and data from prior experiments to select and perform new experiments in order to meet a specified objective. In most experimental chemistry situations, there is a limited set of prior historical data available, and acquiring new data may be expensive and time consuming, which places constraints on machine learning methods. Active learning methods prioritize new experiment selection by using machine learning model uncertainty and predicted outcomes. Meta-learning methods attempt to construct models that can learn quickly with a limited set of data for a new task. Here in this paper, we applied the model-agnostic meta-learning (MAML) model and the Probabilistic LATent model for Incorporating Priors and Uncertainty in few-Shot learning (PLATIPUS) approach, which extends MAML to active learning, to the problem of halide perovskite growth by inverse temperature crystallization. Using a dataset of 1870 reactions conducted using 19 different organoammonium lead iodide systems, we determined the optimal strategies for incorporating historical data into active and meta-learning models to predict reaction compositions that result in crystals. We then evaluated the best three algorithms (PLATIPUS and active-learning k-nearest neighbor and decision tree algorithms) with four new chemical systems in experimental laboratory tests. With a fixed budget of 20 experiments, PLATIPUS makes superior predictions of reaction outcomes compared to other active-learning algorithms and a random baseline.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

NASA NTRS2010

Evaluation of Anomaly Detection Capability for Ground-Based Pre-Launch Shuttle Operations

This chapter will provide a thorough end-to-end description of the process for evaluation of three different data-driven algorithms for anomaly detection to select the best candidate for deployment as part of a suite of IVHM (Integrated Vehicle Health Management) technologies. These algorithms were deemed to be sufficiently mature enough to be considered viable candidates for deployment in support of the maiden launch of Ares I-X, the successor to the Space Shuttle for NASA's Constellation program. Data-driven algorithms are just one of three different types being deployed. The other two types of algorithms being deployed include a "nile-based" expert system, and a "model-based" system. Within these two categories, the deployable candidates have already been selected based upon qualitative factors such as flight heritage. For the rule-based system, SHINE (Spacecraft High-speed Inference Engine) has been selected for deployment, which is a component of BEAM (Beacon-based Exception Analysis for Multimissions), a patented technology developed at NASA's JPL (Jet Propulsion Laboratory) and serves to aid in the management and identification of operational modes. For the "model-based" system, a commercially available package developed by QSI (Qualtech Systems, Inc.), TEAMS (Testability Engineering and Maintenance System) has been selected for deployment to aid in diagnosis. In the context of this particular deployment, distinctions among the use of the terms "data-driven," "rule-based," and "model-based," can be found in. Although there are three different categories of algorithms that have been selected for deployment, our main focus in this chapter will be on the evaluation of three candidates for data-driven anomaly detection. These algorithms will be evaluated upon their capability for robustly detecting incipient faults or failures in the ground-based phase of pre-launch space shuttle operations, rather than based oil heritage as performed in previous studies. Robust detection will allow for the achievement of pre-specified minimum false alarm and/or missed detection rates in the selection of alert thresholds. All algorithms will also be optimized with respect to an aggregation of these same criteria. Our study relies upon the use of Shuttle data to act as was a proxy for and in preparation for application to Ares I-X data, which uses a very similar hardware platform for the subsystems that are being targeted (TVC - Thrust Vector Control subsystem for the SRB (Solid Rocket Booster)).

Martin, Rodney Alexander↗

NASA NTRS1983

Astronomical and statistical algorithms used in the Space Telescope guide star selection system

The construction of the Space Telescope Guide Star Catalog from digitized Schmidt survey plates covering the entire sky is described. In order to provide sufficient pointing information, the Guide Star Selection System has to contain a catalog of 20 million guide star candidates in the range of 9.0 to 14.5 visual magnitudes. An image inventory process extracts the relevant object data; after photometric and astrometric calibration the data are screened to arrive at suitable guide star candidates. The selection process for a given target takes into account geometric and photometric parameters of the field, scheduling information, and acquisition probabilities for each guide star pair.

Jenkner, H.↗

NASA NTRS2000

Ground Vibration Test Planning and Pre-Test Analysis for the X-33 Vehicle

This paper describes the results of the modal test planning and the pre-test analysis for the X-33 vehicle. The pre-test analysis included the selection of the target modes, selection of the sensor and shaker locations and the development of an accurate Test Analysis Model (TAM). For target mode selection, four techniques were considered, one based on the Modal Cost technique, one based on Balanced Singular Value technique, a technique known as the Root Sum Squared (RSS) method, and a Modal Kinetic Energy (MKE) approach. For selecting sensor locations, four techniques were also considered; one based on the Weighted Average Kinetic Energy (WAKE), one based on Guyan Reduction (GR), one emphasizing engineering judgment, and one based on an optimum sensor selection technique using Genetic Algorithm (GA) search technique combined with a criteria based on Hankel Singular Values (HSV's). For selecting shaker locations, four techniques were also considered; one based on the Weighted Average Driving Point Residue (WADPR), one based on engineering judgment and accessibility considerations, a frequency response method, and an optimum shaker location selection based on a GA search technique combined with a criteria based on HSV's. To evaluate the effectiveness of the proposed sensor and shaker locations for exciting the target modes, extensive numerical simulations were performed. Multivariate Mode Indicator Function (MMIF) was used to evaluate the effectiveness of each sensor & shaker set with respect to modal parameter identification. Several TAM reduction techniques were considered including, Guyan, IRS, Modal, and Hybrid. Based on a pre-test cross-orthogonality checks using various reduction techniques, a Hybrid TAM reduction technique was selected and was used for all three vehicle fuel level configurations.

Bedrossian, Herand↗

DOE OSTI2026

The Compilation and Validation of the Spectroscopic Redshift Catalogs for the DESI-COSMOS and DESI-XMM-LSS Fields

Over several dedicated programs that include targets beyond the main cosmological samples, the Dark Energy Spectroscopic Instrument collected spectra for 304,970 unique objects in two fields centered on the COSMOS and XMM-LSS fields. In this work, we develop spectroscopic redshift robustness criteria for those spectra, validate these criteria using visual inspection, and provide two custom value-added catalogs with our redshift characterizations. With these criteria, we reliably classify 212,935 galaxies below z < 1.6, 9713 quasars, and 35,222 stars. The resulting catalogs achieve a redshift purity exceeding 99.4% across all galaxy samples. As a critical element in characterizing the selection function, we provide the description of 70 different algorithms that were used to select these targets from imaging data. To facilitate joint imaging/spectroscopic analyses, we provide row-matched photometry from the Dark Energy Camera, Hyper-Suprime Cam, and public COSMOS2020 photometric catalogs. Finally, we demonstrate example applications of these large catalogs to photometric redshift estimation, cluster finding, and completeness studies.

Ratajczak, J. [Univ. of Utah, Salt Lake City, UT (↗

NASA NTRS2001

Global Positioning System Satellite Selection Method

The satellite selection method as utilized by the spaceborne Global Positioning System receiver provides navigational solutions and is designed for use in low Earth orbit. The satellite selection method is a robust algorithm that can be used a GPS receiver to select appropriate GPS satellites for use in calculating point solutions or attitude solutions. The method is takes into account the difficulty of finding a particular GPS satellite phase code, especially when the search range in greatly increased due to Doppler shifts introduced into the carrier frequency. The method starts with an update of the antenna pointing and spacecraft vectors to determine the antenna backplane direction. Next, the GPS satellites that will potentially be in view of the antenna are ranked on a list, whereby the list is generated based on the estimated attitude and position of each GPS satellite. Satellites blocked by the Earth are not entered on this list. A second list is created, whereby the GPS satellites are ranked according to their desirability for use in attitude determination. GPS satellites are ranked according to their orthogonality to the antenna backplane, and according to geometric dilution of precision considerations. After the lists are created, the channels of the spaceborne GPS receiver are assigned to various GPS satellites for acquisition and lock. Preliminary Doppler frequencies for searching are assigned to the various channels.

Frederick A Niles↗

DOE OSTI2018

An Open, Cloud-Based Platform for Whole-Building Fault Detection and Diagnostics

Small commercial buildings in the U.S. waste an estimated 300 Trillion BTU (approximately $6 billion in energy costs) annually due to faults, but lack cost-effective automated fault detection and diagnosis (AFDD) tools. NREL and GE Global Research are partnering to develop hybrid AFDD algorithms tailored to the unique needs of small commercial buildings (</=10,000 sq. ft.). The approach combines physics-based energy modeling tools with state-of-the-art machine learning algorithms to enable diagnostics using modeled input data. NREL, in partnership with Purdue University, has adapted DOE's physics-based modeling software EnergyPlus and OpenStudio to simulate common building faults. Cloud-based implementations of these physics-based models were used to generate data for multiple climate zones. The data were then used to train machine learning algorithms, such as those available in GE's Predix platform, to detect and diagnose building faults. Key features of the system including the automated, cloud-implementation of EnergyPlus, genetic algorithms for automated model feature selection, multiclass detection and diagnosis models, and anomaly detection algorithms will be presented.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

NASA NTRS1983

Parallel solution of finite element equations

The paper examines several parallel processing solution algorithms for finite element equations arising in linear equilibrium problems. Two basic groups of algorithms, direct and iterative, are investigated with respect to a number of parallel computer architectures and associated selection criteria. The direct algorithms include: LR-Gauss, Crout, Cholesky, Cyclic Reduction and WZ-factorization. The iterative methods examined are: Accelerated Gauss-Seidel, Surrogate Stiffness, Jacobi, Series Expansion, and Energy Monte Carlo. For real-time applications, where the object is to minimize the execution time, Cyclic Reduction appears to be best suited. This assumes a computer with an unlimited number of parallel processors. However, for computers with a limited number of parallel processors that must be used efficiently, both Gauss factorization and Jacobi-like iterative methods rank favorably.

Salama, M.↗