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 271 records · Page 15

A circular median filter approach for resolving directional ambiguities in wind fields retrieved from spaceborne scatterometer data

The retrieval algorithm for spaceborne scatterometry proposed by Schultz (1985) is extended. A circular median filter (CMF) method is presented, which operates on wind directions independently of wind speed, removing any implicit wind speed dependence. A cell weighting scheme is included in the algorithm, permitting greater weights to be assigned to more reliable data. The mathematical properties of the ambiguous solutions to the wind retrieval problem are reviewed. The CMF algorithm is tested on twelve simulated data sets. The effects of spatially correlated likelihood assignment errors on the performance of the CMF algorithm are examined. Also, consideration is given to a wind field smoothing technique that uses a CMF.

Schultz, Howard↗

An Impact-Location Estimation Algorithm for Subsonic Uninhabited Aircraft

An impact-location estimation algorithm is being used at the NASA Dryden Flight Research Center to support range safety for uninhabited aerial vehicle flight tests. The algorithm computes an impact location based on the descent rate, mass, and altitude of the vehicle and current wind information. The predicted impact location is continuously displayed on the range safety officer's moving map display so that the flightpath of the vehicle can be routed to avoid ground assets if the flight must be terminated. The algorithm easily adapts to different vehicle termination techniques and has been shown to be accurate to the extent required to support range safety for subsonic uninhabited aerial vehicles. This paper describes how the algorithm functions, how the algorithm is used at NASA Dryden, and how various termination techniques are handled by the algorithm. Other approaches to predicting the impact location and the reasons why they were not selected for real-time implementation are also discussed.

Bauer, Jeffrey E.↗

Heat Capacity Mapping Radiometer (HCMR) data processing algorithm, calibration, and flight performance evaluation

The rationale and procedures used in the radiometric calibration and correction of Heat Capacity Mapping Mission (HCMM) data are presented. Instrument-level testing and calibration of the Heat Capacity Mapping Radiometer (HCMR) were performed by the sensor contractor ITT Aerospace/Optical Division. The principal results are included. From the instrumental characteristics and calibration data obtained during ITT acceptance tests, an algorithm for post-launch processing was developed. Integrated spacecraft-level sensor calibration was performed at Goddard Space Flight Center (GSFC) approximately two months before launch. This calibration provided an opportunity to validate the data calibration algorithm. Instrumental parameters and results of the validation are presented and the performances of the instrument and the data system after launch are examined with respect to the radiometric results. Anomalies and their consequences are discussed. Flight data indicates a loss in sensor sensitivity with time. The loss was shown to be recoverable by an outgassing procedure performed approximately 65 days after the infrared channel was turned on. It is planned to repeat this procedure periodically.

Bohse, J. R.↗

Reconstruction of multiple cracks from experimental electrostatic boundary measurements

An algorithm for recovering a collection of linear cracks in a homogeneous electrical conductor from boundary measurements of voltages induced by specified current fluxes is described. The technique is a variation of Newton's method and is based on taking weighted averages of the boundary data. An apparatus that was constructed specifically for generating laboratory data on which to test the algorithm is also described. The algorithm is applied to a number of different test cases and the results are discussed.

Bryan, Kurt↗

A Collisional Algorithm for Modeling Circumstellar Debris Disks

Many planetary systems harbor circumstellar disks of dust and planetesimals thought to be debris left over from planet formation. These debris disks exhibit a range of morphological features which can arise from the gravitational perturbations of planets. Accurate models of these features, accounting for the interactions of the particles in a disk with each other and with whatever planets they contain, can act as signposts for planets in debris disks that otherwise could not be detected. Such models can also constrain the planet's mass and orbital parameters. Current models for many disks consider the gravitational and radiative effects of the star and planets on the disk, but neglect the morphological consequences of collisional interactions between the planetesimals. Many observed disk features are not satisfactorily explained by the current generation of models. I am developing a new kind of debris disk model that considers both the gravitational shaping of the disk by planets and the inelastic collisions between particles. I will use a hybrid N-body integrator to numerically solve the equations of motion for the particles and planets in the disk. To include the collisional effects, I begin with an algorithm that tests for collisions at each step of the orbit integration and readjusts the velocities of colliding particles. I am adapting this algorithm to the problem at hand by allowing each particle to represent a "swarm" of planetesimals with a range of masses. When the algorithm detects an encounter between swarms, two or three swarms are produced to approximate the range of possible trajectories of the daughter planetesimals. Here I present preliminary results from my collisional algorithm.

Nesvold, Erika↗

An Environment for Hardware-in-the-Loop Formation Navigation and Control Simulation

Recent interest in formation flying satellite systems has spurred a considerable amount of research in the relative navigation and control of satellites. Development in this area has included new estimation and control algorithms as well as sensor and actuator development specifically geared toward the relative control problem. This paper describes a simulation facility, the Formation Flying Testbed (FFTB) at NASA's Goddard Space Flight Center, which allows engineers to test new algorithms for the formation flying problem with relevant GN&C hardware in a closed loop simulation. The FFTB currently supports the injection of GPS receiver hardware into the simulation loop, and support for satellite crosslink ranging technology is at a prototype stage. This closed-loop, hardware inclusive simulation capability permits testing of navigation and control software in the presence of the actual hardware with which the algorithms must interact. This capability provides the navigation or control developer with a perspective on how the algorithms perform as part of the closed-loop system. In this paper, the overall design and evolution of the FFTB are presented. Each component of the FFTB is then described in detail. Interfaces between the components of the FFTB are shown and the interfaces to and between navigation and control software are described in detail. Finally, an example of closed-loop formation control with GPS receivers in the loop is presented and results are analyzed.

Burns, Rich↗

Feasibility Study on Implementing a Staggered-Grid Finite Volume Method for System Analysis Code Development Under the MOOSE Framework

Here, this work summarizes a feasibility study on testing numerical algorithms that are suitable and efficient for advanced system analysis code development under the mutli-physics framework, MOOSE. The key to the test bed is the implementation of high-order one-dimensional staggered-grid finite volume method (SG-FVM), and its direct interaction with the linear/nonlinear solver, PETSc. The test bed utilized a more flexible code structure to enable the finite volume method implementation and direct interacting with the solver package, instead of using the natively supported finite element method by the framework. Using a suite of selected test problems with different problem sizes and levels of complexity, the implemented SG-FVM demonstrated superior performance improvement against a direct finite element method implementation through MOOSE. On two computer systems, the speedup was observed to be significant, with at least one order of magnitude of solving time reduction. For a complex reactor model, transient simulation was performed using the newly developed finite volume method code, the results of which agree very well with the reference results from the finite element method code. Overall, this study demonstrates a successful feasibility study on the proposed numerical algorithms and software structure to support advanced system analysis tool development.

MOOSE↗

Obstacle Detection Algorithms for Rotorcraft Navigation

In this research we addressed the problem of obstacle detection for low altitude rotorcraft flight. In particular, the problem of detecting thin wires in the presence of image clutter and noise was studied. Wires present a serious hazard to rotorcrafts. Since they are very thin, their detection early enough so that the pilot has enough time to take evasive action is difficult, as their images can be less than one or two pixels wide. After reviewing the line detection literature, an algorithm for sub-pixel edge detection proposed by Steger was identified as having good potential to solve the considered task. The algorithm was tested using a set of images synthetically generated by combining real outdoor images with computer generated wire images. The performance of the algorithm was evaluated both, at the pixel and the wire levels. It was observed that the algorithm performs well, provided that the wires are not too thin (or distant) and that some post processing is performed to remove false alarms due to clutter.

Kasturi, Rangachar↗

Wire Detection Algorithms for Navigation

In this research we addressed the problem of obstacle detection for low altitude rotorcraft flight. In particular, the problem of detecting thin wires in the presence of image clutter and noise was studied. Wires present a serious hazard to rotorcrafts. Since they are very thin, their detection early enough so that the pilot has enough time to take evasive action is difficult, as their images can be less than one or two pixels wide. Two approaches were explored for this purpose. The first approach involved a technique for sub-pixel edge detection and subsequent post processing, in order to reduce the false alarms. After reviewing the line detection literature, an algorithm for sub-pixel edge detection proposed by Steger was identified as having good potential to solve the considered task. The algorithm was tested using a set of images synthetically generated by combining real outdoor images with computer generated wire images. The performance of the algorithm was evaluated both, at the pixel and the wire levels. It was observed that the algorithm performs well, provided that the wires are not too thin (or distant) and that some post processing is performed to remove false alarms due to clutter. The second approach involved the use of an example-based learning scheme namely, Support Vector Machines. The purpose of this approach was to explore the feasibility of an example-based learning based approach for the task of detecting wires from their images. Support Vector Machines (SVMs) have emerged as a promising pattern classification tool and have been used in various applications. It was found that this approach is not suitable for very thin wires and of course, not suitable at all for sub-pixel thick wires. High dimensionality of the data as such does not present a major problem for SVMs. However it is desirable to have a large number of training examples especially for high dimensional data. The main difficulty in using SVMs (or any other example-based learning method) is the need for a very good set of positive and negative examples since the performance depends on the quality of the training set.

Kasturi, Rangachar↗

A general rough-surface inversion algorithm: Theory and application to SAR data

Rough-surface inversion has significant applications in interpretation of SAR data obtained over bare soil surfaces and agricultural lands. Due to the sparsity of data and the large pixel size in SAR applications, it is not feasible to carry out inversions based on numerical scattering models. The alternative is to use parameter estimation techniques based on approximate analytical or empirical models. Hence, there are two issues to be addressed, namely, what model to choose and what estimation algorithm to apply. Here, a small perturbation model (SPM) is used to express the backscattering coefficients of the rough surface in terms of three surface parameters. The algorithm used to estimate these parameters is based on a nonlinear least-squares criterion. The least-squares optimization methods are widely used in estimation theory, but the distinguishing factor for SAR applications is incorporating the stochastic nature of both the unknown parameters and the data into formulation, which will be discussed in detail. The algorithm is tested with synthetic data, and several Newton-type least-squares minimization methods are discussed to compare their convergence characteristics. Finally, the algorithm is applied to multifrequency polarimetric SAR data obtained over some bare soil and agricultural fields. Results will be shown and compared to ground-truth measurements obtained from these areas. The strength of this general approach to inversion of SAR data is that it can be easily modified for use with any scattering model without changing any of the inversion steps. Note also that, for the same reason it is not limited to inversion of rough surfaces, and can be applied to any parameterized scattering process.

Moghaddam, M.↗

Survey of Time Shift Detection Algorithms for Measured PV Data

In this research, three variations of time shift detection algorithms were tested for their ability to detect time shift issues (including daylight savings time and random time shifts) in measured PV data sets. Two algorithms from the Python PVAnalytics package were assessed, and one algorithm from the Solar-Data-Tools package was assessed. Each algorithm's ability to accurately detect and measure time shifts was assessed.

automated preprocessing↗

A deep-learning based raw waveform region-of-interest finder for the liquid argon time projection chamber

The liquid argon time projection chamber (LArTPC) detector technology has an excellent capability to measure properties of low-energy neutrinos produced by the sun and supernovae and to look for exotic physics at very low energies. In order to achieve those physics goals, it is crucial to identify and reconstruct signals in the waveforms recorded on each TPC wire. In this work, we report on a novel algorithm based on a one-dimensional convolutional neural network (CNN) to look for the region-of-interest (ROI) in raw waveforms. We test this algorithm using data from the ArgoNeuT experiment in conjunction with an improved noise mitigation procedure and a more realistic data-driven noise model for simulated events. This deep-learning ROI finder shows promising performance in extracting small signals and gives an efficiency approximately twice that of the traditional algorithm in the low energy region of ~0.03–0.1 MeV. This method offers great potential to explore low-energy physics using LArTPCs.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Evaluation of improved algorithms for nonlinear transient structural heat transfer

The paper presents the evaluation of algorithms having potential for reducing computer time to integrate large systems of equations governing nonlinear transient heat transfer in complex structures. A series of test problems is being developed to test two algorithms. The Shuttle Orbiter frame model having 190 nodes was the subject of an analytical/experimental study. Plans are to perform calculations for the complete wing model having about 4000 nodes as well as a regional (plug) model having about 200 nodes.

Adelman, H. M.↗

An automatic frequency control loop using overlapping DFTs (Discrete Fourier Transforms)

An automatic frequency control (AFC) loop is introduced and analyzed in detail. The new scheme is a generalization of the well known Cross Product AFC loop that uses running overlapping discrete Fourier transforms (DFTs) to create a discriminator curve. Linear analysis is included and supported with computer simulations. The algorithm is tested in a low carrier to noise ratio (CNR) dynamic environment, and the probability of loss of lock is estimated via computer simulations. The algorithm discussed is a suboptimum tracking scheme with a larger frequency error variance compared to an optimum strategy, but offers simplicity of implementation and a very low operating threshold CNR. This technique can be applied during the carrier acquisition and re-acquisition process in the Advanced Receiver.

Aguirre, S.↗

Analysis of algorithms for the retrieval of rain-rate profiles from a spaceborne dual-wavelength radar

The ability to retrieve rain-rate profiles from a dual-wavelength spaceborne radar system operating at 13.6 and 35 GHz is analyzed. The fundamental problem of extracting either the attenuation and/or the reflectivity from the backscatter echo, which contains both contributions, is addressed. Three algorithms, the backscatter, the attenuation coefficient, and the dual-wavelength methods, are examined. These algorithms are tested using four rain-rate profiles derived from radar measurements. In particular, measured (true) values are compared with calculated (retrieved) rain rates applying the algorithms with superimposed uncertainties assuming a suggested spaceborne dual-wavelength radar system. Error values of rain rates are determined where these values reflect failure of the assumptions utilized in the derivation of the algorithms, rain backscatter noise, and instrument noise. It is concluded that no single technique gives rise to a panacea in the making of accurate rain measurements and that difficulties exist with each method.

Goldhirsh, Julius↗

Canonical analysis for increased classification speed and channel selection

The quadratic form can be expressed as a monotonically increasing sum of squares when the inverse covariance matrix is represented in canonical form. This formulation has the advantage that, in testing a particular class hypothesis, computations can be discontinued when the partial sum exceeds the smallest value obtained for other classes already tested. A method for channel selection is presented which arranges the original input measurements in that order which minimizes the expected number of computations. The classification algorithm was tested on data from LARS Flight Line C1 and found to reduce the sum-of-products operations by a factor of 6.7 in comparison with the conventional approach. In effect, the accuracy of a twelve-channel classification was achieved using only that CPU time required for a conventional four-channel classification.

Eppler, W.↗

Ocean Surface Flux Algorithm Effects on Tropical Indo-Pacific Intraseasonal Precipitation

Surface latent heat fluxes help maintain tropical intraseasonal precipitation. We develop a latent heat flux diagnostic that depicts how latent heat fluxes vary with the near-surface specific humidity vertical gradient (Δq) and surface wind speed (|V|). Compared to fluxes estimated from |V| and Δq measured at tropical moorings and the Coupled Ocean Atmosphere Response Experiment 3.0 (COARE3.0) algorithm, tropical latent heat fluxes in the National Center for Atmospheric Research CEMS2 and Department of Energy E3SMv1 models are significantly overestimated at |V| and Δq extrema. Madden–Julian oscillation (MJO) sensitivity to surface flux algorithm is tested with offline and inline flux corrections. The offline correction adjusts model output fluxes toward mooring-estimated fluxes; the inline correction replaces the original bulk flux algorithm with the COARE3.0 algorithm in atmosphere-only simulations of each model. Both corrections indicate reduced latent heat flux feedback to intraseasonal precipitation, in better agreement with observations, suggesting that model-simulated fluxes are overly supportive for maintaining MJO convection.

54 ENVIRONMENTAL SCIENCES↗

Binary pseudorandom array test standard optimized for characterization of large field-of-view optical interferometers

Recently, a technique for calibrating the modulation transfer function (MTF) of a broad variety of metrology instrumentation has been demonstrated. This technique is based on test samples structured as one-dimensional binary pseudo-random (BPR) sequences and two-dimensional BPR arrays (BPRAs). The inherent power spectral density of BPR gratings (sequences) and arrays has a deterministic white-noise-like character that allows direct determination of the MTF with uniform sensitivity over the entire spatial frequency range and field-of-view of an instrument. As such, the BPR samples satisfy the characteristics of a test standard: functionality, ease of specification and fabrication, reproducibility, and low sensitivity to manufacturing error. Here we discuss our recent developments directed to the optimization of the sample design, fabrication, application, and data processing procedures, suitable for thorough characterization of large aperture optical interferometers. Compared with the previous coded-aperture based design, the improved, 'highly randomized' BPRA pattern of the new test standard provides better accuracy and reliability of instrument MTF and aberration characterization, and enables operation optimization of large aperture optical interferometers. We describe the pattern generation algorithm and tests to verify the compliance to desired BPRA topography. The data acquisition and analysis procedures for different applications of the technique are also discussed.

Yashchuk, Valeriy V.↗