Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Ordering transformation”

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 379 records · Page 21

The role of topography in geodetic gravity field modelling

Masses associated with the topography, bathymetry, and its isostatic compensation are a dominant source of gravity field variations, especially at shorter wavelengths. On global scales the topographic/isostatic effects are also significant, except for the lowest harmonics. In practice, though, global effects need not be taken into account as such effects are included in the coefficients of the geopotential reference fields. On local scales, the short-wavelength gravity variations due to the topography may, in rugged terrain, be an order of magnitude larger than other effects. In such cases, explicit or implicit terrain reduction procedures are mandatory in order to obtain good prediction results. Such effects may be computed by space-domain integration or by fast Fourier transformation (FFT) methods. Numerical examples are given for areas of the Canadian Rockies. In principle, good knowledge of the topographic densities is required to produce the smoothest residual field. Densities may be determined from sample measurements or by gravimetric means, but both are somewhat troublesome methods in practice. The use of a standard density, e.g., 2.67 g/cu cm, may often yield satisfactory results and may be put within a consistent theoretical framework. The independence of density assumptions is the key point of the classical Molodensky approach to the geodetic boundary value problem. The Molodensky solutions take into account that land gravity field observations are done on a non-level surface. Molodensky's problem may be solved by integral expansions or more effective FFT methods, but the solution should not be intermixed with the use of terrain reductions. The methods are actually complimentary and may both be required in order to obtain the smoothest possible signal, least prone to aliasing and other effects coming from sparse data coverage, typical of rugged topography.

Forsberg, R.↗

A new approach to the solution of large, full matrix equations: A two-dimensional potential flow feasibility study

An approach to the solution of matrix problems resulting from integral equations of mathematical physics is presented. Based on the inherent smoothness in such equations, the problem is reformulated using a set of orthogonal basis vectors, leading to an equivalent coefficient problem which can be of lower order without significantly impairing the accuracy of the solution. This approach was evaluated using a two-dimensional Neumann problem describing the inviscid, incompressible flow over an airfoil. Two different kinds of mode functions were investigated, namely eigenfunction series and Fourier series. The method using Fourier series was found preferable. It uses all of the coefficients from a Fast Fourier Transform algorithm in an approximate method which exploits the known structure of the transformed coefficient matrix and very promising results for the flow over a realistic airfoil are obtained. On the basis of the results presented here, an order of magnitude reduction in this computer time can be expected for such problems as compared with the time for a direct matrix solution.

James, R. M.↗

Representations of the language recognition problem for a theorem prover

Two representations of the language recognition problem for a theorem prover in first order logic are presented and contrasted. One of the representations is based on the familiar method of generating sentential forms of the language, and the other is based on the Cocke parsing algorithm. An augmented theorem prover is described which permits recognition of recursive languages. The state-transformation method developed by Cordell Green to construct problem solutions in resolution-based systems can be used to obtain the parse tree. In particular, the end-order traversal of the parse tree is derived in one of the representations. An inference system, termed the cycle inference system, is defined which makes it possible for the theorem prover to model the method on which the representation is based. The general applicability of the cycle inference system to state space problems is discussed. Given an unsatisfiable set S, where each clause has at most one positive literal, it is shown that there exists an input proof. The clauses for the two representations satisfy these conditions, as do many state space problems.

Minker, J.↗

TPGITF user's manual

The primary purpose of TPG interface (TPGITF) software is to create test patterns, according to a mathematical model, for a real device. In order for the device actually to be tested or to be accurately simulated, a means is required to transform the TPGITF generated test into forms acceptable as input to logic test equipment or to a software logic simulator. The MACRODATA-200 Logic Test System and the LOGSIM logic simulator are the particular systems supported by the TPGITF software. A description is presented of the TPGITF software processor. It is assumed that the reader is familiar with the TPG, LOGSIM, and TOIL systems. Flow charts are given.

Pitts, E. R.↗

Implicit finite-difference procedures for the computation of vortex wakes

Implicit finite-difference procedures for the primitive form of the incompressible Navier-Stokes and the compressible Euler equations are used to compute vortex wake flows. The partial differential equations in strong conservation-law form are transformed to cluster grid points in regions with large changes in vorticity. In addition to clustering, fourth-order accurate, spatial difference operators are used to help resolve the flow-field gradients. The use of implicit time-differencing permits large time steps to be taken since temporal variations are typically small. Computational efficiency is achieved by approximate factorization. Both two-dimensional and preliminary three-dimensional calculations are described and qualitatively compared with existing experimental data.

Steger, J. L.↗

An Eigensystem Realization Algorithm (ERA) for modal parameter identification and model reduction

A method, called the Eigensystem Realization Algorithm (ERA), is developed for modal parameter identification and model reduction of dynamic systems from test data. A new approach is introduced in conjunction with the singular value decomposition technique to derive the basic formulation of minimum order realization which is an extended version of the Ho-Kalman algorithm. The basic formulation is then transformed into modal space for modal parameter identification. Two accuracy indicators are developed to quantitatively identify the system modes and noise modes. For illustration of the algorithm, examples are shown using simulation data and experimental data for a rectangular grid structure.

Juang, J. N.↗

Multigrid applications to three-dimensional elliptic coordinate generation

The multigrid algorithm was applied to solve the coupled set of elliptic quasilinear partial differential equations associated with three-dimensional coordinate generation. The results indicate that the multigrid scheme is more than twice as fast as conventional relaxation schemes on moderate-size grids. Convergence factors of order 0.90 per work unit were achieved on 36,000-point grids. The paper covers the form of transformation, develops the set of generation equations, and gives details on the multigrid approach used. Included are a development of the full-approximation storage scheme, details of the smoothing-rate analysis, and a section devoted to rational programming techniques applicable to the multigrid algorithm.

Thames, F. C.↗

An eigensystem realization algorithm for modal parameter identification and model reduction

A method called the eigensystem realization algorithm is developed for modal parameter identification and model reduction of dynamic systems from test data. A new approach is introduced in conjunction with the singular-value decomposition technique to derive the basic formulation of minimum order realization which is an extended version of the Ho-Kalman algorithm. The basic formulation is then transformed into modal space for modal parameter identification. Two accuracy indicators are developed to quantitatively identify the system and noise modes. For illustration of the algorithm, an example is shown using experimental data from the Galileo spacecraft.

Juang, J.-N.↗

Adiabatic properties of pulsating DA white dwarfs. I - The treatment of the Brunt-Vaisala frequency and the region of period formation

The fundamental issue of the region of period formaton in a degenerate star is examined, with special attention given to the treatment of the Brunt-Vaisala frequency. It is shown that, in order to obtain reliable numerical results in degenerate stellar models, the Brunt-Vaisala frequency must be appropriately transformed, because it is defined in terms of a difference between two numbers which become nearly equal in highly degenerate matter, causing serious numerical problems and systematic errors. An alternative expression is derived, which is valid for multicomponent nonideal partially degenerate and partially ionized plasmas such as those encountered in white dwarf envelopes. This expression is used to compute the period structure of the same white dwarf considered by Pesnell (1987). It is shown that the implicit numerical differencing used in the Lagrangian pulsation code of Pesnell leads to very serious difficulties when used with models of degenerate stars.

Brassard, P.↗

An unsymmetric Lanczos algorithm for damped structural dynamics systems

A one-sided, unsymmetric block Lanczos algorithm is proposed for the model reduction of structural dynamics systems with unsymmetric damping and/or stiffness matrices. The algorithm is a three-term iteration scheme, which transforms the system matrix into an almost skew-symmetric, block-tridiagonal form. The Lanczos reduced-order model is guaranteed to be stable if the full-order system is stable. For unstable systems, a shifting method is available. Also, the algorithm offers flexibility in the choice of starting vectors and thus can yield more accurate reduced-order models. A linear system example and a plane truss structure example are used to show the efficacy of the proposed method.

Su, Tzu-Jeng↗

Structures of aspartic acid-96 in the L and N intermediates of bacteriorhodopsin: analysis by Fourier transform infrared spectroscopy

The light-induced difference Fourier transform infrared spectrum between the L or N intermediate minus light-adapted bacteriorhodopsin (BR) was measured in order to examine the protonated states and the changes in the interactions of carboxylic acids of Asp-96 and Asp-115 in these intermediates. Vibrational bands due to the protonated and unprotonated carboxylic acid were identified by isotope shift and band depletion upon substitution of Asp-96 or -115 by asparagine. While the signal due to the deprotonation of Asp-96 was clearly observed in the N intermediate, this residue remained protonated in L. Asp-115 was partially deprotonated in L. The C = O stretching vibration of protonated Asp-96 of L showed almost no shift upon 2H2O substitution, in contrast to the corresponding band of Asp-96 or Asp-115 of BR, which shifted by 9-12 cm-1 under the same conditions. In the model system of acetic acid in organic solvents, such an absence of the shift of the C = O stretching vibration of the protonated carboxylic acid upon 2H2O substitution was seen only when the O-H of acetic acid is hydrogen-bonded. The non-hydrogen-bonded monomer showed the 2H2O-dependent shift. Thus, the O-H bond of Asp-96 enters into hydrogen bonding upon conversion of BR to L. Its increased hydrogen bonding in L is consistent with the observed downshift of the O-H stretching vibration of the carboxylic acid of Asp-96.

NASA Discipline Exobiology↗

GeneLab: A Systems Biology Platform for Omics Analysis

NASA's GeneLab includes an open-access repository of some 200+ omics datasets generated by biological experiments relevant to spaceflight (including simulated cosmic radiation and microgravity). In order to maximize the intelligibility of these data, particularly for users with limited bioinformatics knowledge, GeneLab is now transforming the data in the repository into actual biological and physiological knowledge of the genetic and proteomic signatures found in these samples. This processed data is being derived by establishing standard data analysis workflows vetted by 114 scientists who are members of the four GeneLab Analysis Working Groups (Animal AWG, Plant AWG, Microbe AWG, Multi-Omics AWG). AWG members from institutes spanning the U.S. and four other countries participate on a voluntary basis. The AWGs meet monthly to discuss data mining, compare results and interpretations, and test forthcoming releases of the GeneLab Data Systems (GLDS). GLDS version 3.0 has been available to the general public since October 1st 2018, and has been providing a professional state-of-the-art bioinformatics platform for everyone in the space biology community to upload their data into a space biology omics data commons, to process their data with vetted standard workflows and to compare to existing analyses. The user interface for the platform is being designed to be accessible to a broad variety of users including those with limited bioinformatics experience, including high school and college students who can use it to learn about omics data analysis and space biology. As such, Genelab will constitute a powerful general public outreach capability of NASA and the Space Biology community at large. Data mining of the GeneLab database by the AWG has already started generating very interesting findings, including reports linking specific spaceflight conditions such as radiation, microgravity or carbon dioxide levels to molecular changes seen across various species. In this presentation, we will report on the current and future objectives for GeneLab, and review recent studies reported by the various AWGs relating molecular changes observed in various animal models and tissue with microgravity, radiation, circadian rhythm, hydration and carbon dioxide conditions.

Omics↗

GeneLab: A Systems Biology Platform for Omics Analysis: Disseminate and Reuse Data, Tools, and Samples Post-Project

NASA's GeneLab includes an open-access repository of some 200 plus omics datasets generated by biological experiments relevant to spaceflight (including simulated cosmic radiation and microgravity). In order to maximize the intelligibility of these data, particularly for users with limited bioinformatics knowledge, GeneLab is now transforming the data in the repository into actual biological and physiological knowledge of the genetic and proteomic signatures found in these samples. This processed data is being derived by establishing standard data analysis workflows vetted by 114 scientists who are members of the four GeneLab Analysis Working Groups (Animal AWG, Plant AWG, Microbe AWG, Multi-Omics AWG). AWG members from institutes spanning the U.S. and four other countries participate on a voluntary basis. The AWGs meet monthly to discuss data mining, compare results and interpretations, and test forthcoming releases of the GeneLab Data Systems (GLDS). GLDS version 3.0 has been available to the general public since October 1st 2018, and has been providing a professional state-of-the-art bioinformatics platform for everyone in the space biology community to upload their data into a space biology omics data commons, to process their data with vetted standard workflows and to compare to existing analyses. The user interface for the platform is being designed to be accessible to a broad variety of users including those with limited bioinformatics experience, including high school and college students who can use it to learn about omics data analysis and space biology. As such, Genelab will constitute a powerful general public outreach capability of NASA and the Space Biology community at large. Data mining of the GeneLab database by the AWG has already started generating very interesting findings, including reports linking specific spaceflight conditions such as radiation, microgravity or carbon dioxide levels to molecular changes seen across various species. In this presentation, we will report on the current and future objectives for GeneLab, and review recent studies reported by the various AWGs relating molecular changes observed in various animal models and tissue with microgravity, radiation, circadian rhythm, hydration and carbon dioxide conditions.

Omics↗

Sequential Principal Component Analysis -An Optimal and Hardware-Implementable Transform for Image Compression

This paper presents the JPL-developed Sequential Principal Component Analysis (SPCA) algorithm for feature extraction / image compression, based on "dominant-term selection" unsupervised learning technique that requires an order-of-magnitude lesser computation and has simpler architecture compared to the state of the art gradient-descent techniques. This algorithm is inherently amenable to a compact, low power and high speed VLSI hardware embodiment. The paper compares the lossless image compression performance of the JPL's SPCA algorithm with the state of the art JPEG2000, widely used due to its simplified hardware implementability. JPEG2000 is not an optimal data compression technique because of its fixed transform characteristics, regardless of its data structure. On the other hand, conventional Principal Component Analysis based transform (PCA-transform) is a data-dependent-structure transform. However, it is not easy to implement the PCA in compact VLSI hardware, due to its highly computational and architectural complexity. In contrast, the JPL's "dominant-term selection" SPCA algorithm allows, for the first time, a compact, low-power hardware implementation of the powerful PCA algorithm. This paper presents a direct comparison of the JPL's SPCA versus JPEG2000, incorporating the Huffman and arithmetic coding for completeness of the data compression operation. The simulation results show that JPL's SPCA algorithm is superior as an optimal data-dependent-transform over the state of the art JPEG2000. When implemented in hardware, this technique is projected to be ideally suited to future NASA missions for autonomous on-board image data processing to improve the bandwidth of communication.

Duong, Tuan A.↗

Recursive linearization of multibody dynamics equations of motion

The equations of motion of a multibody system are nonlinear in nature, and thus pose a difficult problem in linear control design. One approach is to have a first-order approximation through the numerical perturbations at a given configuration, and to design a control law based on the linearized model. Here, a linearized model is generated analytically by following the footsteps of the recursive derivation of the equations of motion. The equations of motion are first written in a Newton-Euler form, which is systematic and easy to construct; then, they are transformed into a relative coordinate representation, which is more efficient in computation. A new computational method for linearization is obtained by applying a series of first-order analytical approximations to the recursive kinematic relationships. The method has proved to be computationally more efficient because of its recursive nature. It has also turned out to be more accurate because of the fact that analytical perturbation circumvents numerical differentiation and other associated numerical operations that may accumulate computational error, thus requiring only analytical operations of matrices and vectors. The power of the proposed linearization algorithm is demonstrated, in comparison to a numerical perturbation method, with a two-link manipulator and a seven degrees of freedom robotic manipulator. Its application to control design is also demonstrated.

Lin, Tsung-Chieh↗

Asynoptic meteorological data assimilation by means of a time coordinate transformation

A possible method for assimilating large quantities of asynoptic data, such as satellite observations, into numerical weather forecasts, is investigated. The method is based on a transformation of the time coordinate to coincide with satellite paths, and a well-posed problem is solved in order to obtain forecasts beyond the time of data acquisition. Simulated barotropic forecasts based on the proposed technique are compared with forecasts derived from the direct insertion of data. Results indicate that only in ideal situations, when asynoptic data are obtained both continuosly and accurately, will the method function well as compared with direct insertion techniques.

Halberstam, I.↗

Long period perturbations of earth satellite orbits

All the equations involved in extending the PS phi solution to include the long periodic and second order secular effects of the zonal harmonics are presented. Topics covered include DSphi elements and relations for their conconical transformation into the PS phi elements; the solution algorithm based on the Von Zeipel method; and the elimination of long periodic terms and analytical integration of primed variables. The equations were entered into the ASOP program, checked out, and verified. Comparisons with numerical integrations show the long period theory to be accurate within several meters after 800 revolutions.

Wang, K. C.↗

Scene shadow effects on multispectral response

Spectral responses measured from nonuniform balsam fir canopies with varying amounts and locations of shadows are examined in order to study the effects of scene shadows on spectral response. The behavior of canopy reflectance and spectral band transformations, normalized difference (ND), and greenness for a variety of solar zenith angles and background types are analyzed. The use of vegetation indices for monitoring vegetation is studied in terms of shadowing. It is observed that the red and near-IR reflectance factors decrease as the amount of scene shadows increase; the ND increases with increasing scene shadows; changing shadow amounts have little effect on greenness; and the ND from 'pure' pixels increases as the shadows cast by adjacent vegetation canopies increases.

Ranson, K. Jon↗