Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Algorithm testing”

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 37 records · Page 2
All sourcesNASA NTRSDOE OSTI
NASA NTRS2012

A Comparative Study of Interval Management Control Law Capabilities

This paper presents a new tool designed to allow for rapid development and testing of different control algorithms for airborne spacing. This tool, Interval Management Modeling and Spacing Tool (IM MAST), is a fast-time, low-fidelity tool created to model the approach of aircraft to a runway, with a focus on their interactions with each other. Errors can be induced between pairs of aircraft by varying initial positions, winds, speed profiles, and altitude profiles. Results to-date show that only a few of the algorithms tested had poor behavior in the arrival and approach environment. The majority of the algorithms showed only minimal variation in performance under the test conditions. Trajectory-based algorithms showed high susceptibility to wind forecast errors, while performing marginally better than the other algorithms under other conditions. Trajectory-based algorithms have a sizable advantage, however, of being able to perform relative spacing operations between aircraft on different arrival routes and flight profiles without employing ghosting. methods. This comes at the higher cost of substantially increased complexity, however. Additionally, it was shown that earlier initiation of relative spacing operations provided more time for corrections to be made without any significant problems in the spacing operation itself. Initiating spacing farther out, however, would require more of the aircraft to begin spacing before they merge onto a common route.

Barmore, Bryan E.↗
NASA NTRS1992

The remote sensing of ocean primary productivity - Use of a new data compilation to test satellite algorithms

Global pigment and primary productivity algorithms based on a new data compilation of over 12,000 stations occupied mostly in the Northern Hemisphere, from the late 1950s to 1988, were tested. The results showed high variability of the fraction of total pigment contributed by chlorophyll, which is required for subsequent predictions of primary productivity. Two models, which predict pigment concentration normalized to an attenuation length of euphotic depth, were checked against 2,800 vertical profiles of pigments. Phaeopigments consistently showed maxima at about one optical depth below the chlorophyll maxima. CZCS data coincident with the sea truth data were also checked. A regression of satellite-derived pigment vs ship-derived pigment had a coefficient of determination. The satellite underestimated the true pigment concentration in mesotrophic and oligotrophic waters and overestimated the pigment concentration in eutrophic waters. The error in the satellite estimate showed no trends with time between 1978 and 1986.

Balch, William↗
DOE OSTI2020

Radiation Mapping for an Unmanned Aerial Vehicle: Development and Simulated Testing of Algorithms for Source Mapping and Navigation Path Generation

Image reconstruction algorithms were developed for radiation source mapping and used for generating the search path of a moving radiation detector, such as one onboard an unmanned aerial vehicle. Simulations consisted of first assuming radioactive sources of varying complexity and estimating the radiation fields that would then be produced by that source distribution. Next, the "measurements" that would result from a pair of adjacent spatial locations were computed. A crude estimate of the source distribution likely to have produced such "measurements" was reconstructed based upon the limited measurements. Location of the next "measurement" was then determined as halfway between the location of the estimated source and the current "measurement." With each additional sample, improved source distribution reconstructions were made and used to inform the immediate direction of detector motion. Source reconstruction or mapping was formulated as an inverse problem solved with either maximum a posteriori or least squares (LS) regression deconvolution methods. Different amounts of noise were added to the simulated "measurements," allowing evaluation of the methods' performances as functions of signal-to-noise ratio of the measured map. As expected, methods that promote sparsity were better suited in reconstructing point sources. Reliable prior information of the source distribution also improved the reconstruction results, especially with distributed sources. With a non-negative least square algorithm and the suggested paths it generated, location of sources was successfully estimated to an accuracy of 0.014 m within nine iterations in a single-source scenario and 12 iterations in a two-source scenario, given a 10% error on the integrated counts and a Poisson distribution of the noise associated with the measured counts.

98 NUCLEAR DISARMAMENT, SAFEGUARDS, AND PHYSICAL P↗
NASA NTRS1979

A model for testing centerfinding algorithms for automated optical navigation

An efficient software simulation of the imaging process for optical navigation is presented, illustrating results using simple examples. The problems of image definition and optical system modeling, including ideal image containing features and realistic models of optical filtering performed by the entire camera system, are examined. A digital signal processing technique is applied to the problem of developing methods of automated optical navigation and the subsequent mathematical formulation is presented. Specific objectives such as an analysis of the effects of camera defocusing on centerfinding of planar targets, addition of noise filtering to the algorithm, and implementation of multiple frame capability were investigated.

Griffin, M. D.↗
NASA NTRS1993

Comment on 'The remote sensing of ocean primary productivity - Use of a new data compilation to test satellite algorithms' by William Balch et al

Various conclusions by Balch et al. (1992) about the current state of modeling primary production in the sea (lack of improvement in primary production models, since 1957, utility of analytical models, and merits or weaknesses of complex models) are commented on. It is argued that since they are based on a false premise, these conclusions are not robust, and that the approach used by Balch et al. (the model of Platt and Sathyendranath, 1988) was inadequate for the question they set out to address. The present criticism is based mainly on the issue of whether implementation was correct with respect to parameter selection. It is concluded that the findings of Balch et al. with respect to the model of Platt and Sathyendranath is unreliable. Balch replies that satellite-derived estimates of primary production should be compared directly to that measured in situ in as many regions as possible. This will provide a first-order estimate of the magnitude of the error involved in estimating primary production from space.

Platt, Trevor↗
NASA NTRS1995

Numerical magetohydrodynamics in astronphysics: Algorithm and tests for one-dimensional flow`

We describe a numerical code to solve the equations for ideal magnetohydrodynamics (MHD). It is based on an explicit finite difference scheme on an Eulerian grid, called the total variation diminishing (TVD) scheme, which is a second-order-accurate extension of the Roe-type upwind scheme. We also describe a non-linear Riemann solver for ideal MHD, which includes rarefractions as well as shocks. The numerical code and the Riemann solver have been used to test each other. Extensive tests encompassing all the possible ideal MHD structures with planar symmetries (i.e., one-dimensional flows) are presented. These include those for which the field structure is two dimensional (i.e., those flows often called '1 + 1/2 dimensional') as well as those for which the magnetic field plane rotates (i.e., those flows often called '1 + 1/2 + 1/2 dimensional'). Results indicate that the code can resolve strong fast, slow, and magnetosonic shocks within two to four cells, but more cells are required if shocks become weak. With proper steepening, we could resolve rotational discontinuities within three to five cells. However, without successful implementation of steepening, contact discontinuities are resolved with approximately 10 cells and tangential discountinuities are resolved with approximately 15 cells. Out tests confirm that slow compound structures with tow-dimensional magnetic fields are composed of intermediate shocks (so-called 2-4 intermediate shocks) followed by slow rarefaction waves. Finally, tests demostrate that in two-dimensional magnetohydrodynamics, fast compound structures, which are composed of intermediate shocks (so-called 1-3 intermediate shocks) preceeded by fast rarefaction waves, are also possible.

Ryu, Dongsu↗
NASA NTRS1997

Computational Issues in Damping Identification for Large Scale Problems

Two damping identification methods are tested for efficiency in large-scale applications. One is an iterative routine, and the other a least squares method. Numerical simulations have been performed on multiple degree-of-freedom models to test the effectiveness of the algorithm and the usefulness of parallel computation for the problems. High Performance Fortran is used to parallelize the algorithm. Tests were performed using the IBM-SP2 at NASA Ames Research Center. The least squares method tested incurs high communication costs, which reduces the benefit of high performance computing. This method's memory requirement grows at a very rapid rate meaning that larger problems can quickly exceed available computer memory. The iterative method's memory requirement grows at a much slower pace and is able to handle problems with 500+ degrees of freedom on a single processor. This method benefits from parallelization, and significant speedup can he seen for problems of 100+ degrees-of-freedom.

Pilkey, Deborah L.↗
DOE OSTI2024

Generating synthetic signaling networks for in silico modeling studies

Predictive models of signaling pathways have proven to be difficult to develop. Reasons include the uncertainty in the number of species, the complexity in species’ interactions, and the sparseness and uncertainty in experimental data. Traditional approaches to developing mechanistic models rely on collecting experimental data and fitting a single model to that data. This approach works for simple systems but has proven unreliable for complex systems such as biological signaling networks. For example, uncertainty and sparseness of the data often result in overfitted models that have little predictive value beyond recapitulating the experimental data itself. Thus, there is a need to develop new approaches to create predictive mechanistic models of complex systems. However, to determine the effectiveness of any new algorithm, a baseline model is needed to test its performance. To meet this need, we developed a method for generating artificial synthetic networks that are reasonably realistic and thus can be treated as ground truth models. These synthetic models can then be used to generate synthetic data for developing and testing algorithms designed to recover the underlying network topology and associated parameters. Here, we describe a simple approach for generating synthetic signaling networks that can be used for this purpose.

42 ENGINEERING↗
DOE OSTI2024

Machine learning approaches for influenza A virus risk assessment identifies predictive correlates using ferret model in vivo data

In vivo assessments of influenza A virus (IAV) pathogenicity and transmissibility in ferrets represent a crucial component of many pandemic risk assessment rubrics, but few systematic efforts to identify which data from in vivo experimentation are most useful for predicting pathogenesis and transmission outcomes have been conducted. To this aim, we aggregated viral and molecular data from 125 contemporary IAV (H1, H2, H3, H5, H7, and H9 subtypes) evaluated in ferrets under a consistent protocol. Three overarching predictive classification outcomes (lethality, morbidity, transmissibility) were constructed using machine learning (ML) techniques, employing datasets emphasizing virological and clinical parameters from inoculated ferrets, limited to viral sequence-based information, or combining both data types. Among 11 different ML algorithms tested and assessed, gradient boosting machines and random forest algorithms yielded the highest performance, with models for lethality and transmission consistently better performing than models predicting morbidity. Comparisons of feature selection among models was performed, and highest performing models were validated with results from external risk assessment studies. Our findings show that ML algorithms can be used to summarize complex in vivo experimental work into succinct summaries that inform and enhance risk assessment criteria for pandemic preparedness that take in vivo data into account.

59 BASIC BIOLOGICAL SCIENCES↗
NASA NTRS2017

MODIS Retrieval of Aerosol Optical Depth over Turbid Coastal Water

We present a new approach to retrieve Aerosol Optical Depth (AOD) using the Moderate Resolution Imaging Spectroradiometer (MODIS) over the turbid coastal water. This approach supplements the operational Dark Target (DT) aerosol retrieval algorithm that currently does not conduct AOD retrieval in shallow waters that have visible sediments or sea-floor (i.e., Class 2 waters). Over the global coastal water regions in cloud-free conditions, coastal screening leads to approx. 20% unavailability of AOD retrievals. Here, we refine the MODIS DT algorithm by considering that water-leaving radiance at 2.1 microns to be negligible regardless of water turbidity, and therefore the 2.1 microns reflectance at the top of the atmosphere is sensitive to both change of fine-mode and coarse-mode AODs. By assuming that the aerosol single scattering properties over coastal turbid water are similar to those over the adjacent open-ocean pixels, the new algorithm can derive AOD over these shallow waters. The test algorithm yields approx. 18% more MODIS-AERONET collocated pairs for six AERONET stations in the coastal water regions. Furthermore, comparison of the new retrieval with these AERONET observations show that the new AOD retrievals have equivalent or better accuracy than those retrieved by the MODIS operational algorithm's over coastal land and non-turbid coastal water product. Combining the new retrievals with the existing MODIS operational retrievals yields an overall improvement of AOD over those coastal water regions. Most importantly, this refinement extends the spatial and temporal coverage of MODIS AOD retrievals over the coastal regions where 60% of human population resides. This expanded coverage is crucial for better understanding of impact of anthropogenic aerosol particles on coastal air quality and climate.

Retrieval↗
NASA NTRS1998

SeaWiFS Technical Report Series: Satellite Primary Productivity Data and Algorithm Development: A Science Plan for Mission to Planet Earth - Volume 42

Two issues regarding primary productivity, as it pertains to the Sea-viewing Wide Field-of-view Sensor (SeaWiFS) Program and the National Aeronautics and Space Administration (NASA) Mission to Planet Earth (MTPE) are presented in this volume. Chapter 1 describes the development of a science plan for deriving primary production for the world ocean using satellite measurements, by the Ocean Primary Productivity Working Group (OPPWG). Chapter 2 presents discussions by the same group, of algorithm classification, algorithm parameterization and data availability, algorithm testing and validation, and the benefits of a consensus primary productivity algorithm.

Falkowski, Paul G.↗
NASA NTRS1999

Dynamical Chaos in the Wisdom-Holman Integrator: Origins and Solutions

We examine the nonlinear stability of the Wisdom-Holman (WH) symplectic mapping applied to the integration of perturbed, highly eccentric (e-0.9) two-body orbits. We find that the method is unstable and introduces artificial chaos into the computed trajectories for this class of problems, unless the step size chosen 1s small enough that PeriaPse is always resolved, in which case the method is generically stable. This 'radial orbit instability' persists even for weakly perturbed systems. Using the Stark problem as a fiducial test case, we investigate the dynamical origin of this instability and argue that the numerical chaos results from the overlap of step-size resonances; interestingly, for the Stark-problem many of these resonances appear to be absolutely stable. We similarly examine the robustness of several alternative integration methods: a time-regularized version of the WH mapping suggested by Mikkola; the potential-splitting (PS) method of Duncan, Levison, Lee; and two original methods incorporating approximations based on Stark motion instead of Keplerian motion. The two fixed point problem and a related, more general problem are used to conduct a comparative test of the various methods for several types of motion. Among the algorithms tested, the time-transformed WH mapping is clearly the most efficient and stable method of integrating eccentric, nearly Keplerian orbits in the absence of close encounters. For test particles subject to both high eccentricities and very close encounters, we find an enhanced version of the PS method-incorporating time regularization, force-center switching, and an improved kernel function-to be both economical and highly versatile. We conclude that Stark-based methods are of marginal utility in N-body type integrations. Additional implications for the symplectic integration of N-body systems are discussed.

Rauch, Kevin P.↗
DOE OSTI2022

Accuracy of predictions made by machine learned models for biocrude yields obtained from hydrothermal liquefaction of organic wastes

Hydrothermal liquefaction (HTL) has potential for converting abundant wet organic wastes into renewable fuels. Because HTL consists of a complex reaction network, deterministic, physics-based prediction of its biocrude yield is prohibitively difficult. Data-driven methods provide an alternative to the physics-based approach; however, rigorous testing must be performed to ensure the accuracy of predictions made by data-driven methods. To this end, a data set was assembled consisting of 570 data points appearing in the open literature. The data set was divided into training, validation, and test sub-sets and used for evaluating different machine learning regression approaches to predict biocrude yield. Among the tested algorithms, Random Forest and eXtreme Gradient Boosting (XGBoost) predicted biocrude yields in a test set that had not been used for training with the greatest accuracy, with root mean square errors (RMSE) of 8.34 and 8.57, respectively. Further refinement of the Random Forest model reduced its RMSE to 8.07. In comparison, predictions of a series of literature models resulted in RMSE ranging from 9.16 in the most accurate case to 27.6 in the least accurate; most literature models yielded RMSE values > 10. Using biocrude yield predictions from the most accurate Random Forest model and a probabilistic economic analysis found that the model accuracy is sufficient to prioritize allocation of resources based on projected minimum fuel selling price. In our report the models and analysis represent a major advance in the ability to use readily available data to predict biocrude yields on new feedstocks that have not previously been studied.

42 ENGINEERING↗
DOE OSTI2026

Particle Filter Based Inference Testing

The primary intent of PAR-FIT (Particle Filter based Inference Testing) is to provide hard inductive evidence that a machine learning model is capable and proven for an individual test input. By examining training data used to form the underlying model functional correlation, an estimate of the reliability that a model will make the correct prediction can be made. The Sequential Probability Ratio Test is used to derive a qualitative evaluation for reliability based on hypothesis testing. The PAR-FIT framework achieves this by implementing a particle filter and the sequential probability ratio test algorithms on the machine learning model training data to determine relevancy of new individual test samples to the training dataset. The kernel function evaluates the local proximity and density of training data used to derive a prediction outcome. Particles are used to probabilistically determine which training data to evaluate for proximity. For test samples that are within a close proximity to and surrounded by multiple training data points, the evaluated reliability of the prediction is high. For test samples that are anomalies not represented by the training dataset, in low density data clusters, or are far from existing data points, the evaluated reliability is low as insufficient training evidence exists to suggest the model is capable of making the correct prediction. Sequential Probability Ratio Test is further used to determine when a hypothesis on whether a signal can be rejected or accepted for use. The ratio test collects sequence information from the particle filter to test whether the signal is anomalous or normal via hypothesis testing of the underlying distributions.

Chen, Edward [Idaho National Laboratory (INL), Ida↗