Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “algorithm development”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

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

At least 1,207 records · Page 67

NPP ATMS Snowfall Rate Product

Passive microwave measurements at certain high frequencies are sensitive to the scattering effect of snow particles and can be utilized to retrieve snowfall properties. Some of the microwave sensors with snowfall sensitive channels are Advanced Microwave Sounding Unit (AMSU), Microwave Humidity Sounder (MHS) and Advance Technology Microwave Sounder (ATMS). ATMS is the follow‐on sensor to AMSU and MHS. Currently, an AMSU and MHS based land snowfall rate (SFR) product is running operationally at NOAA/NESDIS. Based on the AMSU/MHS SFR, an ATMS SFR algorithm has been developed recently. The algorithm performs retrieval in three steps: snowfall detection, retrieval of cloud properties, and estimation of snow particle terminal velocity and snowfall rate. The snowfall detection component utilizes principal component analysis and a logistic regression model. The model employs a combination of temperature and water vapor sounding channels to detect the scattering signal from falling snow and derive the probability of snowfall (Kongoli et al., 2015). In addition, a set of NWP model based filters is also employed to improve the accuracy of snowfall detection. Cloud properties are retrieved using an inversion method with an iteration algorithm and a two‐stream radiative transfer model (Yan et al., 2008). A method developed by Heymsfield and Westbrook (2010) is adopted to calculate snow particle terminal velocity. Finally, snowfall rate is computed by numerically solving a complex integral. NCEP CMORPH analysis has shown that integration of ATMS SFR has improved the performance of CMORPH‐Snow. The ATMS SFR product is also being assessed at several NWS Weather Forecast Offices for its usefulness in weather forecast.

Forecasting↗

Efficient and Optimal Attitude Determination Using Recursive Global Positioning System Signal Operations

In this paper, a new and efficient algorithm is developed for attitude determination from Global Positioning System signals. The new algorithm is derived from a generalized nonlinear predictive filter for nonlinear systems. This uses a one time-step ahead approach to propagate a simple kinematics model for attitude determination. The advantages of the new algorithm over previously developed methods include: it provides optimal attitudes even for coplanar baseline configurations; it guarantees convergence even for poor initial conditions; it is a non-iterative algorithm; and it is computationally efficient. These advantages clearly make the new algorithm well suited to on-board applications. The performance of the new algorithm is tested on a dynamic hardware simulator. Results indicate that the new algorithm accurately estimates the attitude of a moving vehicle, and provides robust attitude estimates even when other methods, such as a linearized least-squares approach, fail due to poor initial starting conditions.

Crassidis, John L.↗

Mathematical Foundation for Plane Covering Using Hexagons

This work is to indicate the development and mathematical underpinnings of the algorithms previously developed for covering the plane and the addressing of the elements of the covering. The algorithms are of interest in that they provides a simple systematic way of increasing or decreasing resolution, in the sense that if we have the covering in place and there is an image superimposed upon the covering, then we may view the image in a rough form or in a very detailed form with minimal effort. Such ability allows for quick searches of crude forms to determine a class in which to make a detailed search. In addition, the addressing algorithms provide an efficient way to process large data sets that have related subsets. The algorithms produced were based in part upon the work of D. Lucas "A Multiplication in N Space" which suggested a set of three vectors, any two of which would serve as a bases for the plane and also that the hexagon is the natural geometric object to be used in a covering with a suggested bases. The second portion is a refinement of the eyeball vision system, the globular viewer.

Johnson, Gordon G.↗

Identification of a second-order mechanical system model from a state space realization

Many system identification algorithms produce models in modern state variable form. When a mechanical system is identified one knows that there must be a model in second order form. In structural dynamics one is interested in either a modal model of the system, or in a model including a mass matrix, stiffness matrix and a damping matrix. In this paper, algorithms are developed that convert a modern state space realization into the above two representations of interest in mechanical systems. The algorithm can be used with any identification methods that produce a modern state variable representation such as the Eigensystem Realization Algorithm (ERA), its modified version by data correlation (ERA/DC), and combinations of these with Observer/Kalman Filter Identification (OKID). An algorithm is developed that allows one to identify the damping matrix in a model representation, so that one determines how near to modal the damping is in the system, and can therefore understand the degree to which the modes are coupled by the damping in the system. A second algorithm produced the mass, damping, and stiffness matrices, given the input and output matrices. It is assumed that the number of sensors (or the number of actuators) is greater than or equal to the number of modes in the system, and it is proved that this is a necessary condition to be able to uniquely identify these matrices. Experience with examples suggests that a singular value truncation involved in these algorithms can help one determine the true system order. This truncation has the benefit of knowledge of the correct form for a mechanical system model, which is not present in the modern control identification algorithm.

Tseng, Dong-Huei↗

MT's algorithm: A new algorithm to search for the optimum set of modulation indices for simultaneous range, command, and telemetry

MT's algorithm was developed as an aid in the design of space telecommunications systems when utilized with simultaneous range/command/telemetry operations. This algorithm provides selection of modulation indices for: (1) suppression of undesired signals to achieve desired link performance margins and/or to allow for a specified performance degradation in the data channel (command/telemetry) due to the presence of undesired signals (interferers); and (2) optimum power division between the carrier, the range, and the data channel. A software program using this algorithm was developed for use with MathCAD software. This software program, called the MT program, provides the computation of optimum modulation indices for all possible cases that are recommended by the Consultative Committee on Space Data System (CCSDS) (with emphasis on the squarewave, NASA/JPL ranging system).

Nguyen, Tien Manh↗

KAZR Hydrometeor and Insect Masks

The Ka-band ARM zenith pointing radar (aka, KAZR) is so sensitive that it detects cloud particles and individual insects. While detecting insects with Ka-band radar is beneficial and desirable to advance radar entomology, this sensitivity can be detrimental to radar meteorology because insects could be interpreted as clouds or precipitation. For example, misclassifying insects as clouds has been a problem for the ARM Active Remote Sensing of Clouds (ARSCL) Value Added Product since its inception (Clothiaux et al. 2000). Based on cloud particle and insect radar scattering properties, an algorithm was developed that identifies clouds, raindrops, ice particles, and insects in KAZR co- and cross-polarimeteric Doppler velocity spectra. The algorithm produces affirmative masks in the KAZR native time and height resolution indicating time-height locations of hydrometeors and insects. The hydrometeor mask contains binary information (e.g., yes/no hydrometeor presence), and the insect mask includes a proxy for insect activity that increases when more insects are detected in the Doppler velocity spectra. The algorithm was developed using KAZR medium sensitivity mode (MD) observations and was applied to two summer seasons of KAZR observations at the Southern Great Plains (SGP) Central Facility: May-October 2018 and 2019. In the future, this data set will be expanded to include other KAZR operating modes and observations from other ARM field sites. Details of the algorithm and data set can be found in: Williams, C.R., K.L. Johnson, S.E. Giangrande, J. C. Hardin, R. Oktem, and D. M. Romps, 2021: Identifying Insects, Clouds, and Precipitation using Vertically Pointing Polarimetric Radar Doppler Velocity Spectra. Atmospheric Measurement Techniques, submitted 6-Feb-2021. https://amt.copernicus.org/preprints/amt-2021-27/#discussion.For more information on the ARSCL VAP, see Clothiaux, E. E., T. P. Ackerman, G. G. Mace, K. P. Moran, R. T. Marchand, M. A. Miller, and B. E. Martner, 2000; J. Appl. Meteor., 39, 645-665.

54 ENVIRONMENTAL SCIENCES↗

A primal–dual algorithm for risk minimization

In this paper, we develop an algorithm to efficiently solve risk-averse optimization problems posed in reflexive Banach space. Such problems often arise in many practical applications as, e.g., optimization problems constrained by partial differential equations with uncertain inputs. Unfortunately, for many popular risk models including the coherent risk measures, the resulting risk-averse objective function is nonsmooth. Here, this lack of differentiability complicates the numerical approximation of the objective function as well as the numerical solution of the optimization problem. To address these challenges, we propose a primal–dual algorithm for solving large-scale nonsmooth risk-averse optimization problems. This algorithm is motivated by the classical method of multipliers and by epigraphical regularization of risk measures. As a result, the algorithm solves a sequence of smooth optimization problems using derivative-based methods. We prove convergence of the algorithm even when the subproblems are solved inexactly and conclude with numerical examples demonstrating the efficiency of our method.

97 MATHEMATICS AND COMPUTING↗

Where are the parallel algorithms?

Four paradigms that can be useful in developing parallel algorithms are discussed. These include computational complexity analysis, changing the order of computation, asynchronous computation, and divide and conquer. Each is illustrated with an example from scientific computation, and it is shown that computational complexity must be used with great care or an inefficient algorithm may be selected.

Voigt, R. G.↗

Flat and Level Analysis Tool (FLAT) for real-time automated segmentation and analysis of concrete slab point clouds

In the United States, the flatness and levelness of concrete floors during construction is traditionally specified by a maximum allowable gap under a 3 meter straightedge. However, the straightedge method is inexact and rarely representative of the entire floor since the technician is free to choose any location on the floor to perform the measurement. In cases requiring a higher degree of precision and repeatability, concrete floor flatness and levelness can be measured using the standard test method ASTM E1155. With the recent introduction of advanced surveying instruments such as robotic theodolites and terrestrial laser scanners (TLS), the means now exist to modernize and expedite the measurement of floor flatness and levelness. This paper details the development and demonstration of a digital tool, named the Flat and Level Analysis Tool (FLAT), to automate and expedite the segmentation and analysis of flatness and levelness from dense point cloud data of concrete floor slabs. Segmentation algorithms were developed using unsupervised machine learning to extract the set of points belonging to the concrete floor slab from a full 360 scan of a construction site. After segmentation, automated analysis algorithms report the results according to the standard method. The developed algorithms were demonstrated on a dense point cloud captured from a concrete slab-on-grade at a construction site. Results show that the digital tool can quickly provide estimates for floor flatness and levelness with minimal human involvement with comparable accuracy to manual methods.

Hayes, Nolan↗

Development of a validation model for the defense meteorological satellite program's special sensor microwave imager

The Defence Meteorological Space Program's (DMSP) Special Sensor Microwave/Imager (SSM/I), an operational wind speed algorithm was developed. The algorithm is based on the D-matrix approach which seeks a linear relationship between measured SSM/I brightness temperatures and environmental parameters. D-matrix performance was validated by comparing algorithm derived wind speeds with near-simultaneous and co-located measurements made by off-shore ocean buoys. Other topics include error budget modeling, alternate wind speed algorithms, and D-matrix performance with one or more inoperative SSM/I channels.

Swift, C. T.↗

Machine vision guided sensor positioning system for leaf temperature assessment

A sensor positioning system was developed for monitoring plants' well-being using a non-contact sensor. Image processing algorithms were developed to identify a target region on a plant leaf. A novel algorithm to recover view depth was developed by using a camera equipped with a computer-controlled zoom lens. The methodology has improved depth recovery resolution over a conventional monocular imaging technique. An algorithm was also developed to find a maximum enclosed circle on a leaf surface so the conical field-of-view of an infrared temperature sensor could be filled by the target without peripheral noise. The center of the enclosed circle and the estimated depth were used to define the sensor 3-D location for accurate plant temperature measurement.

NASA Discipline Life Support Systems↗

Development of signal processing algorithms for ultrasonic detection of coal seam interfaces

A pattern recognition system is presented for determining the thickness of coal remaining on the roof and floor of a coal seam. The system was developed to recognize reflected pulse echo signals that are generated by an acoustical transducer and reflected from the coal seam interface. The flexibility of the system, however, should enable it to identify pulse-echo signals generated by radar or other techniques. The main difference being the specific features extracted from the recorded data as a basis for pattern recognition.

Purcell, D. D.↗

An Algorithm for Interactive Modeling of Space-Transportation Engine Simulations: A Constraint Satisfaction Approach

In this research we have developed an algorithm for the purpose of constraint processing by utilizing relational algebraic operators. Van Beek and others have investigated in the past this type of constraint processing from within a relational algebraic framework, producing some unique results. Apart from providing new theoretical angles, this approach also gives the opportunity to use the existing efficient implementations of relational database management systems as the underlying data structures for any relevant algorithm. Our algorithm here enhances that framework. The algorithm is quite general in its current form. Weak heuristics (like forward checking) developed within the Constraint-satisfaction problem (CSP) area could be also plugged easily within this algorithm for further enhancements of efficiency. The algorithm as developed here is targeted toward a component-oriented modeling problem that we are currently working on, namely, the problem of interactive modeling for batch-simulation of engineering systems (IMBSES). However, it could be adopted for many other CSP problems as well. The research addresses the algorithm and many aspects of the problem IMBSES that we are currently handling.

Mitra, Debasis↗

Aerosol backscatter studies supporting LAWS

Optimized Royal Signals and Radar Establishment (RSRE), Laser True Airspeed System (LATAS) algorithm for low backscatter conditions was developed. The algorithm converts backscatter intensity measurements from focused continuous-wave (CW) airborne Doppler lidar into backscatter coefficients. The performance of optimized algorithm under marginal backscatter signal conditions was evaluated. The 10.6 micron CO2 aerosol backscatter climatologies were statistically analyzed. Climatologies reveal clean background aerosol mode near 10(exp -10)/kg/sq m/sr (mixing ratio units) through middle and upper troposhere, convective mode associated with planetary boundary layer convective activity, and stratospheric mode associated with volcanically-generated aerosols. Properties of clean background mode are critical to design and simulation studies of Laser Atmospheric Wind Sounder (LAWS), a MSFC facility Instrument on the Earth Observing System (Eos). Previous intercomparisons suggested correlation between aerosol backscatter at CO2 wavelength and water vapor. Field measurements of backscatter profiles with MSFC ground-based Doppler lidar system (GBDLS) were initiated in late FY-88 to coincide with independent program of local rawinsonde releases and overflights by Multi-spectral Atmospheric Mapping Sensor (MAMS), a multi-channel infrared radiometer capable of measuring horizontal and vertical moisture distributions. Design and performance simulation studies for LAWS would benefit from the existence of a relationship between backscatter and water vapor.

Rothermel, Jeffry↗

Digital optical computers at the optoelectronic computing systems center

The Digital Optical Computing Program within the National Science Foundation Engineering Research Center for Opto-electronic Computing Systems has as its specific goal research on optical computing architectures suitable for use at the highest possible speeds. The program can be targeted toward exploiting the time domain because other programs in the Center are pursuing research on parallel optical systems, exploiting optical interconnection and optical devices and materials. Using a general purpose computing architecture as the focus, we are developing design techniques, tools and architecture for operation at the speed of light limit. Experimental work is being done with the somewhat low speed components currently available but with architectures which will scale up in speed as faster devices are developed. The design algorithms and tools developed for a general purpose, stored program computer are being applied to other systems such as optimally controlled optical communication networks.

Jordan, Harry F.↗

A variable multi-step method for transient heat conduction

A variable explicit time integration algorithm is developed for unsteady diffusion problems. The algorithm uses nodal partitioning and allows the nodal groups to be updated with different time steps. The stability of the algorithm is analyzed using energy methods and critical time steps are found in terms of element eigenvalues with no restrictions on element types. Several numerical examples are given to illustrate the accuracy of the method.

Smolinski, Patrick↗

Data integration in multi-sensor based robotic workstations

A relaxation labeling algorithm is developed. The major advantage of this algorithm over the existing ones is that the mathematic operation is simplified. The simplification eases the analysis of the convergence properties. Both the theoretical and application aspects of the proposed algorithm are investigated. The local convergence properties of a labeling process with n labels and m labels are established. The investigation of the interaction among the nodes in a multinode labeling process reveals some insight into the mathematical issues involved in the relaxation operations.

Chen, Qin↗

Dust Aerosol Retrieval Over the Oceans With the MODIS/VIIRS Dark‐Target Algorithm: 1. Dust Detection

To prepare for implementation of a new aerosol retrieval specifically designed for dust aerosol over ocean in the operational Dark-Target (DT) algorithms for the Moderate-resolution Imaging Spectrometer (MODIS) and Visible Infrared Imaging Radiometer Suite (VIIRS) satellite sensors, we focus on the challenge of detecting dust. We first survey the literature on existing dust detection algorithms and then develop an innovative algorithm that combines near-UV (deep blue), visible, and thermal infrared (TIR) wavelength spectral tests. The new detection algorithm is applied to Terra and Aqua MODIS granules and compared with other dust detection possibilities from existing MODIS products. Quantitative evaluation of the new dust detection algorithm is conducted using both a collocated AERONET-MODIS data set and collocated Cloud-Aerosol Lidar and Infrared Pathfinder Satellite Observation (CALIPSO)-MODIS data set. From comparison with both AERONET and CALIOP measurements, we estimate the new dust detection algorithm detects about 30% of weakly dusty pixels and more than 80% of heavily dusty pixels, with false detections in the range of 1–2%. The very low false detection rate is particularly noteworthy in comparison with existing literature. Compared with the dust flag currently available as part of the MODIS cloud mask product (MOD35/MYD35), and dust classification based on commonly used thresholds with aerosol optical depth (AOD) and Angstrom exponent (AE), the new dust detection algorithm finds more dusty pixels and fewer false detections.

spectral dust detection↗