Results for “ordering transformation” — Page 5

NASA NTRS1981

Daylight imagery of ocean surface waves for wave spectra

A simple second-order model is developed to describe the transformation between surface wave slope and radiance incident on an optical sensor. The model includes azimuth as well as elevation variations in the sky-radiance distribution and their effects on the imaging of wave slopes approaching the sensor azimuth from various directions. The model also includes upwelling radiance. Comparison between the exact transformation from wave slope to radiance and the second-order model suggests that they yield quantitatively similar results. The model is used in physical interpretations of how wave slopes are imaged and in indicating a way of optimizing the linearity and contrast of the transfer function relating wave slope to radiance for various sensor geometries, thereby minimizing sources of error. One-dimensional numerical simulations of the imaging of an analytically generated wave-slope profile demonstrate the utility of this technique in obtaining slope spectra.

Monaldo, F. M.↗

NASA NTRS2005

Computing Instantaneous Frequency by normalizing Hilbert Transform

This invention presents Normalized Amplitude Hilbert Transform (NAHT) and Normalized Hilbert Transform(NHT), both of which are new methods for computing Instantaneous Frequency. This method is designed specifically to circumvent the limitation set by the Bedorsian and Nuttal Theorems, and to provide a sharp local measure of error when the quadrature and the Hilbert Transform do not agree. Motivation for this method is that straightforward application of the Hilbert Transform followed by taking the derivative of the phase-angle as the Instantaneous Frequency (IF) leads to a common mistake made up to this date. In order to make the Hilbert Transform method work, the data has to obey certain restrictions.

Huang, Norden E.↗

NASA NTRS1989

Orthogonal canonical forms for second-order systems

The authors prove that a linear second-order system with arbitrary damping cannot be reduced to Hessenberg-triangular form by means of orthogonal transformations, while this reduction is always possible for the modal damping commonly assumed for models of flexible structures. The type of canonical form obtainable by means of orthogonal transformations acting on a second-order system is heavily dependent on the type of damping considered. If the damping matrix is merely positive semi-definite symmetric, it is generally not possible to obtain a reduction to Hessenberg-triangular form, while this reduction is trivial for zero or Rayleigh damping. If damping is modal, however, as is commonly assumed in structural models, the reduction exists and is nontrivial. Furthermore, reduction to triangular second-order Schur form is always possible for such damping: this canonical form appears likely to have applications to second-order system theory.

Williams, Trevor↗

NASA NTRSDate not supplied

NASA R&M Efficiency through Findable, Accessible, Interoperable, and Reusable (FAIR) Digital Assets

At the intersection of mission, technology, and place is NASA’s need to modernize for a digital-forward future. Digitalization, the process of moving toward digital business, is occurring everywhere and remains an ongoing process across the federal government.”[1] Whereas, Digital Transformation is “employing digitization/digital technologies (e.g., Artificial Intelligence (AI), mobile, cloud, data) to change a process, product, or capability so dramatically (e.g., real-time, intelligent, personalized, anywhere, anytime) that it is unrecognizable compared to its traditional form.” [2] In order to facilitate a digital transformation it is essential for NASA to understand and identify where data exists today and which data are value-needed in the future, understand where there are unfulfilled data needs that limit the advancement of NASA work, and ensure NASA efficiency through Findable, Accessible, Interoperable, and Reusable (FAIR) digital assets in the future. Therefore, NASA’s Reliability & Maintainability (R&M) Enterprise Data Sharing team is working to leverage both Digitization and Digital Transformation to achieve their vision of developing an R&M data discovery framework that enables our community, our partners, and our stakeholders with the ability to efficiently, robustly, and seamlessly access information that enables real-time knowledge and model-based, analytics driven, decision-making impacting R&M. As a result the R&M Enterprise Data Sharing team has conducted a survey of its Reliability, Maintainability, and Availability (RMA) community members to identify data existence (created or used) and where there are corresponding barriers to data acquisition and/or R&M or other issues as shown within this presentation.

Digital Transformation↗

NASA NTRSDate not supplied

Trilateral Task Force – Reliability Analysis Supporting Mission Extension/Post Mission Disposal

At the intersection of mission, technology, and place is NASA’s need to modernize for a digital-forward future. Digitalization, the process of moving toward digital business, is occurring everywhere and remains an ongoing process across the federal government.”[1] Whereas, Digital Transformation is “employing digitization/digital technologies (e.g., Artificial Intelligence (AI), mobile, cloud, data) to change a process, product, or capability so dramatically (e.g., real-time, intelligent, personalized, anywhere, anytime) that it is unrecognizable compared to its traditional form.” [2] In order to facilitate a digital transformation it is essential for NASA to understand and identify where data exists today and which data are value-needed in the future, understand where there are unfulfilled data needs that limit the advancement of NASA work, and ensure NASA efficiency through Findable, Accessible, Interoperable, and Reusable (FAIR) digital assets in the future. Therefore, NASA’s Reliability & Maintainability (R&M) Enterprise Data Sharing team is working to leverage both Digitization and Digital Transformation to achieve their vision of developing an R&M data discovery framework that enables our community, our partners, and our stakeholders with the ability to efficiently, robustly, and seamlessly access information that enables real-time knowledge and model-based, analytics driven, decision-making impacting R&M. As a result the R&M Enterprise Data Sharing team has conducted a survey of its Reliability, Maintainability, and Availability (RMA) community members to identify data existence (created or used) and where there are corresponding barriers to data acquisition and/or R&M or other issues as shown within this presentation.

Digital Transformation, Reliability Engineering↗

NASA NTRS1978

Fixed-point error analysis of Winograd Fourier transform algorithms

The quantization error introduced by the Winograd Fourier transform algorithm (WFTA) when implemented in fixed-point arithmetic is studied and compared with that of the fast Fourier transform (FFT). The effect of ordering the computational modules and the relative contributions of data quantization error and coefficient quantization error are determined. In addition, the quantization error introduced by the Good-Winograd (GW) algorithm, which uses Good's prime-factor decomposition for the discrete Fourier transform (DFT) together with Winograd's short length DFT algorithms, is studied. Error introduced by the WFTA is, in all cases, worse than that of the FFT. In general, the WFTA requires one or two more bits for data representation to give an error similar to that of the FFT. Error introduced by the GW algorithm is approximately the same as that of the FFT.

Patterson, R. W.↗

NASA NTRS2010

Optimal Control Modification Adaptive Law for Time-Scale Separated Systems

Recently a new optimal control modification has been introduced that can achieve robust adaptation with a large adaptive gain without incurring high-frequency oscillations as with the standard model-reference adaptive control. This modification is based on an optimal control formulation to minimize the L2 norm of the tracking error. The optimal control modification adaptive law results in a stable adaptation in the presence of a large adaptive gain. This study examines the optimal control modification adaptive law in the context of a system with a time scale separation resulting from a fast plant with a slow actuator. A singular perturbation analysis is performed to derive a modification to the adaptive law by transforming the original system into a reduced-order system in slow time. A model matching conditions in the transformed time coordinate results in an increase in the actuator command that effectively compensate for the slow actuator dynamics. Simulations demonstrate effectiveness of the method.

Nguyen, Nhan T.↗

NASA NTRS2009

Optimal Control Modification for Robust Adaptation of Singularly Perturbed Systems with Slow Actuators

Recently a new optimal control modification has been introduced that can achieve robust adaptation with a large adaptive gain without incurring high-frequency oscillations as with the standard model-reference adaptive control. This modification is based on an optimal control formulation to minimize the L2 norm of the tracking error. The optimal control modification adaptive law results in a stable adaptation in the presence of a large adaptive gain. This study examines the optimal control modification adaptive law in the context of a system with a time scale separation resulting from a fast plant with a slow actuator. A singular perturbation analysis is performed to derive a modification to the adaptive law by transforming the original system into a reduced-order system in slow time. The model matching conditions in the transformed time coordinate results in increase in the feedback gain and modification of the adaptive law.

Nguyen, Nhan T.↗

NASA NTRS2012

Optimal Control Modification for Time-Scale Separated Systems

Recently a new optimal control modification has been introduced that can achieve robust adaptation with a large adaptive gain without incurring high-frequency oscillations as with the standard model-reference adaptive control. This modification is based on an optimal control formulation to minimize the L2 norm of the tracking error. The optimal control modification adaptive law results in a stable adaptation in the presence of a large adaptive gain. This study examines the optimal control modification adaptive law in the context of a system with a time scale separation resulting from a fast plant with a slow actuator. A singular perturbation analysis is performed to derive a modification to the adaptive law by transforming the original system into a reduced-order system in slow time. A model matching conditions in the transformed time coordinate results in an increase in the actuator command that effectively compensate for the slow actuator dynamics. Simulations demonstrate effectiveness of the method.

Adaptive Control↗

NASA NTRS1986

Mechanisms and depths of atlantic transform earthquakes

Mechanisms and depths of 40 earthquakes on major transforms along the Mid-Atlantic Ridge are studied in order to identify events that deviate from the transform-parallel strike-slip motion. Long and short period waves and Rayleigh wave spectral amplitudes are used to analyze focal mechanisms, depths, source time functions, and seismic moments of earthquakes. The relationship between centroid depths and transform thermal structures is examined. The data reveal that transform earthquake centroid depths occur above the predicted 400 C isotherms and the oceanic intraplate depths extend to the 750 C isotherm. Slip rates inferred from seismic moment releases are compared to those predicted by plate motions and good correlation is detected. The difference in the centroid depths of transform and interplate seismicity indicates transforms are either weaker or higher temperatures than expected.

Engeln, J. F.↗

NASA NTRS1992

Model reduction using new optimal Routh approximant technique

An optimal Routh approximant of a single-input single-output dynamic system is a reduced-order transfer function of which the denominator is obtained by the Routh approximation method while the numerator is determined by minimizing a time-response integral-squared-error (ISE) criterion. In this paper, a new elegant approach is presented for obtaining the optimal Routh approximants for linear time-invariant continuous-time systems. The approach is based on the Routh canonical expansion, which is a finite-term orthogonal series of rational basis functions, and minimization of the ISE criterion. A procedure for combining the above approach with the bilinear transformation is also presented in order to obtain the optimal bilinear Routh approximants of linear time-invariant discrete-time systems. The proposed technique is simple in formulation and is amenable to practical implementation.

Hwang, Chyi↗

NASA NTRS1994

An Exact Separation of the Spin-Free and Spin-Dependent Terms of the Dirac-Coulomb-Breit Hamiltonian

The Dirac Hamiltonian is transformed by extracting the operator (sigma x p)/2mc from the small component of the wave function and applying it to the operators of the original Hamiltonian. The resultant operators contain products of Paull matrices that can be rearranged to give spin-free and spin-dependent operators. These operators are the ones encountered in the Breit-Pauli Hamiltonian, as well as some of higher order in alpha(sup 2). However, since the transformation of the original Dirac Hamiltonian is exact, the new Hamiltonian can be used in variational calculations, with or without the spin-dependent terms. The new small component functions have the same symmetry properties as the large component. Use of only the spin-free terms of the new Hamiltonian permits the same factorization over spin variables as in nonrelativistic theory, and therefore all the post-Self-Consistent Field (SCF) machinery of nonrelativistic calculations can be applied. However, the single-particle functions are two-component orbitals having a large and small component, and the SCF methods must be modified accordingly. Numerical examples are presented, and comparisons are made with the spin-free second-order Douglas-Kroll transformed Hamiltonian of Hess.

Dyall, Kenneth G.↗

NASA NTRS1976

A fast Karhunen-Loeve transform for a class of random processes

It is shown that for a class of finite first-order Markov signals, the Karhunen-Loeve (KL) transform for data compression is a set of periodic sine functions if the boundary values of the signal are fixed or known. These sine functions are shown to be related to the Fourier transform so that a fast Fourier transform algorithm can be used to implement the KL transform. Extension to two dimensions with reference to images with separable contravariance function is shown.

Jain, A. K.↗

NASA NTRS2001

Antisense expression of an Arabidopsis ran binding protein renders transgenic roots hypersensitive to auxin and alters auxin-induced root growth and development by arresting mitotic progress

We cloned a cDNA encoding an Arabidopsis Ran binding protein, AtRanBP1c, and generated transgenic Arabidopsis expressing the antisense strand of the AtRanBP1c gene to understand the in vivo functions of the Ran/RanBP signal pathway. The transgenic plants showed enhanced primary root growth but suppressed growth of lateral roots. Auxin significantly increased lateral root initiation and inhibited primary root growth in the transformants at 10 pM, several orders of magnitude lower than required to induce these responses in wild-type roots. This induction was followed by a blockage of mitosis in both newly emerged lateral roots and in the primary root, ultimately resulting in the selective death of cells in the tips of both lateral and primary roots. Given the established role of Ran binding proteins in the transport of proteins into the nucleus, these findings are consistent with a model in which AtRanBP1c plays a key role in the nuclear delivery of proteins that suppress auxin action and that regulate mitotic progress in root tips.

Non-NASA Center↗

NASA NTRS1971

The spectrum of steady state turbulent convection.

Based on Heisenberg's statistical theory of turbulence, a model for steady state turbulent convection is herein proposed, and on the basis of this model, equations for the energy spectrum for steady state turbulent convection are derived. The spectrum is obtained from the solution of a nonlinear integral equation. After the integral equation is brought into a universally valid nondimensional form, it is transformed into a nonlinear first order differential equation to be solved numerically, with the Rayleigh number appearing as the only parameter. The energy spectrum has a substantial deviation from the Kolmogoroff law, as a result of the buoyancy force acting on the rising and falling eddies. The presented theory may be applicable to convection in planetary and stellar atmospheres wherein the radiative heat transport is small.

Winterberg, F.↗

NASA NTRS1981

Examination of time series through randomly broken windows

In order to determine the Fourier transform of a quasi-periodic time series (linear problem), or the power spectrum of a stationary random time series (quadratic problem), data should be recorded without interruption over a long time interval. The effect of regular interruption such as the day/night cycle is well known. The effect of irregular interruption of data collection (the "breaking" of the window function) with the simplifying assumption that there is a uniform probability p that each interval of length tau, of the total interval of length T = N sub tau, yields no data, is investigated. For the linear case it is found that the noise-to-signal ratio will have a (one-sigma) value less than epsilon if N exceeds p(-1)(1-p)epsilon(-2). For the quadratic case, the same requirement is met by the less restrictive requirement that N exceed p(-1)(1-p)epsilon(-1).

Sturrock, P. A.↗

NASA NTRS1983

Adaptive control of a flexible beam using least square lattice filters

This paper presents an indirect adaptive control scheme for the control of flexible structures using recursive least square lattice filters. The identification scheme uses lattice filters which provide an on-line estimate of the number of modes, mode shapes and modal amplitudes. These modes are coupled and a transformation to decouple them in order to obtain the natural modes is presented. The decoupled modal amplitude time series are then used in an equation error identification scheme to identify the model parameters in an autoregressive moving average (ARMA) form. The control is based on modal pole placement scheme with the objective of vibration suppression. The control gains are calculated based on the identified ARMA parameters. Before using the identified parameters for control, detailed testing and validation procedures are carried out on the identified parameters. The full adaptive control scheme is demonstrated using the simulation for the 12 foot free-free beam apparatus at NASA Langley Research Center.

Sundararajan, N.↗

NASA NTRS1988

Run-time parallelization and scheduling of loops

The class of problems that can be effectively compiled by parallelizing compilers is discussed. This is accomplished with the doconsider construct which would allow these compilers to parallelize many problems in which substantial loop-level parallelism is available but cannot be detected by standard compile-time analysis. We describe and experimentally analyze mechanisms used to parallelize the work required for these types of loops. In each of these methods, a new loop structure is produced by modifying the loop to be parallelized. We also present the rules by which these loop transformations may be automated in order that they be included in language compilers. The main application area of the research involves problems in scientific computations and engineering. The workload used in our experiment includes a mixture of real problems as well as synthetically generated inputs. From our extensive tests on the Encore Multimax/320, we have reached the conclusion that for the types of workloads we have investigated, self-execution almost always performs better than pre-scheduling. Further, the improvement in performance that accrues as a result of global topological sorting of indices as opposed to the less expensive local sorting, is not very significant in the case of self-execution.

Saltz, Joel H.↗