SEARCH · Search NASA
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.
Appendices to NASA Thesaurus for indexing scientific and technical information - category term listing, hierarchical display, permuted index, and postable terms
Evolutionary models for all composition parameter permutations for globular cluster age determination
Replacement of biologically important isotopes in the alga Chlorella by corresponding heavier stable isotopes produces increasingly greater deviations from the normal cell size and changes the quality and distribution of certain cellular components. The usefulness of isotopically altered organisms increases interest in the study of such permuted organisms.
Coding, synchronization, combinatorial, multiple access, propagation, and permutation studies for telecommunications systems
Existence theorem concerning arbitrarily long good binary block /nonlinear/ codes preserved under large permutation groups
Transformations of sparse linear systems by row-column permutations are considered and various algorithms are constructed to transform arbitrary symmetric positive definite sparse matrices, as well as matrices in band form, doubly bordered band form, and doubly bordered block diagonal form.
Product reliabilities are predicted from past failure rates and reasonable estimate of future failure rates. Algorithm is used to calculate probability that product will function correctly. Algorithm sums the probabilities of each survival pattern and number of permutations for that pattern, over all possible ways in which product can survive.
The sixth annual supplement to the bibliography on planetary quarantine contains 191 references, an author index and a permuted title index.
A mathematical procedure was developed which determines the exact slews relative to any known axes. The axes may be completely arbitrary; their coordinates merely reside on a data base which can be changed at any time without affecting the software. Given the desired reorientation, the procedure then determines all of the two-legged or three-legged slews which will accomplish the reorientation. For example, there are 12 possible permutations of three axes, and if they are orthogonal each always has two solutions. The nonorthogonal case, on the other hand, gives some surprising results, including the nonexistence of a solution: Consider a large reorientation where the three axes are nearly collinear. In this connection, it can be shown that every three-axis reorientation can be accomplished by three successive slews, if and only if the middle axis is perpendicular to the other two.
Consideration of the problem of finding a permutation of rows and columns and an algorithm for solving ordered systems of linear algebraic equations with sparse matrices having a certain regular structure. Two approaches to the solution of this problem, in which the sparsity is used to some extent, are outlined. One of them is a very general approach where optimal (or nearly optimal) ordering is sought and the algorithm for solving the ordered system treats the matrix element by element to perform only necessary operations. The other approach involves the use of band matrices. After comparing these two approaches, a third approach is then suggested which involves the use of pipe matrices, and a means of ordering the rows and columns to obtain this type of matrix is presented. Examples of matrices reordered by the proposed procedure are cited.
Documents concerning planetary quarantine are listed. Author and permuted title indexes are included for 282 citations.
This program, REDUCE, reduces the bandwidth and profile of sparse symmetric matrices, using row and corresponding column permutations. It is a realization of the algorithm described by the authors elsewhere. It was extensively tested and compared with several other programs and was found to be considerably faster than the others, superior for bandwidth reduction and as satisfactory as any other for profile reduction.
Adopting the so-called genealogical construction, the eigenstates of collective operators can be expressed corresponding to a specified mode for an N-atom system in terms of those for an (N-1)-atom system. Matrix element of a collective operator of an arbitrary mode is presented which can be written as the product of an m-dependent factor and an m-independent reduced matrix element (RME). A set of recursion formulas for the RME was obtained. A graphical representation of the RME on the branching diagram for binary irreducible representations of permutation groups was then introduced. This gave a simple and systematic way of calculating the RME. Results show explicitly the geometry dependence of superradiance and the relative importance of r-conserving and r-nonconserving processes and clears up the chief difficulty encounted in the problem of N two-level atoms, spread over large regions, interacting with a multimode radiation field.
Adopting the so-called genealogical construction, one can express the eigenstates of collective operators corresponding to a specified mode for an N-atom system in terms of those for an (N-1) atom system. Using these Dicke states as bases and using the Wigner-Eckart theorem, a matrix element of a collective operator of an arbitrary mode can be written as the product of an m-dependent factor and an m-independent reduced matrix element (RME). A set of recursion formulas for the RME is obtained. A graphical representation of the RME on the branching diagram for binary irreducible representations of permutation groups is then introduced. This gives a simple and systematic way of calculating the RME. This method is especially useful when the cooperation number r is close to N/2, where almost exact asymptotic expressions can be obtained easily. The result shows explicity the geometry dependence of superradiance and the relative importance of r-conserving and r-nonconserving processes.
A low speed wind tunnel test was conducted to determine the effects of 6 canard configurations on the 0.050 scale model of shuttle orbiter 089B. In addition, two horizontal tail configurations were tested at two positions on the model as were two wing configurations. Since this test was restricted to 103 runs, only a limited number of permutations of the configurational changes could be tested. The testing was done in the 15 by 20 foot section of the LSWT and consisted of pitch polars, one yawed polar and several yaw runs. The pitch polars encompassed an alpha range from 0 to 28 deg; the yawed polar was run at beta = +2 degrees and the yaw runs covered a beta range from -6 to +6 deg at angles-of-attack of 0, 4, 10, 16, and 20 deg.
The prolongation structure of a closed ideal of exterior differential forms is further discussed, and its use illustrated by application to an ideal (in six dimensions) representing the cubically nonlinear Schroedinger equation. The prolongation structure in this case is explicitly given, and recurrence relations derived which support the conjecture that the structure is open - i.e., does not terminate as a set of structure relations of a finite-dimensional Lie group. We introduce the use of multiple pseudopotentials to generate multiple Baecklund transformation, and derive the double Baecklund transformation. This symmetric transformation concisely expresses the (usually conjectured) theorem of permutability, which must consequently apply to all solutions irrespective of asymptotic constraints.
The 'trace' of a rectangular matrix is defined as the trace of a square matrix obtained by appending null rows (or columns) at the bottom (or right) end. The problem of maximizing the trace of a matrix, by permutations and mergers of rows and columns with constraints on the resulting size of the matrix, is of interest in comparison of maps and image-change detection. This correspondence presents an algorithm based on dynamic programming for efficient maximization of trace.
In the study of motion effects on tracking performance, a problem of interest is the determination of what sensory inputs a human uses in controlling his tracking task. In the approach presented here a simple canonical model (FID or a proportional, integral, derivative structure) is used to model the human's input-output time series. A study of significant changes in reduction of the output error loss functional is conducted as different permutations of parameters are considered. Since this canonical model includes parameters which are related to inputs to the human (such as the error signal, its derivatives and integration), the study of model order is equivalent to the study of which sensory inputs are being used by the tracker. The parameters are obtained which have the greatest effect on reducing the loss function significantly. In this manner the identification procedure converts the problem of testing for model order into the problem of determining sensory inputs.