SEARCH · Search NASA

Results for “permutation”

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.

SourceResearch connectionFrom yearThrough year

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

At least 343 records · Page 19

All sources NASA NTRS DOE OSTI

NASA NTRS1977

Using model order tests to determine sensory inputs in a motion study

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.

Repperger, D. W.↗

NASA NTRS1979

NASF transposition network: A computing network for unscrambling p-ordered vectors

The viewpoints of design, programming, and application of the transportation network (TN) is presented. The TN is a programmable combinational logic network that connects 521 memory modules to 512 processors. The unscrambling of p-ordered vectors to 1-ordered vectors in one cycle is described. The TN design is based upon the concept of cyclic groups from abstract algebra and primitive roots and indices from number theory. The programming of the TN is very simple, requiring only 20 bits: 10 bits for offset control and 10 bits for barrel switch shift control. This simple control is executed by the control unit (CU), not the processors. Any memory access by a processor must be coordinated with the CU and wait for all other processors to come to a synchronization point. These wait and synchronization events can be a degradation in performance to a computation. The TN application is for multidimensional data manipulation, matrix processing, and data sorting, and can also perform a perfect shuffle. Unlike other more complicated and powerful permutation networks, the TN cannot, if possible at all, unscramble non-p-ordered vectors in one cycle.

Lim, R. S.↗

NASA NTRS1978

Heat pipe technology. A bibliography with abstracts

This bibliography cites 55 publications on the theory, design, development, fabrication, and testing of heat pipes. Applications covered include solar, nuclear, and thermoelectric energy conversion. A book (in Russian) on low temperature heat pipes is included as well as abstracts when available. Indexes provided list authors, titles/keywords (permuted) and patents.

Source record↗

NASA NTRS1979

A comparison of WFTA and FFT programs

Bounds on the minimum number of data transfers (i.e., loads and stores) required by WFTA (Winograd Fourier Transform Algorithm) and FFT programs are presented. The analysis is applicable to those general-purpose computers with a small number of general processor registers (e.g., the IBM370, PDP-11, etc.). It is shown that the 1008-point WFTA requires about 21% more data transfers than the 1024-point radix-4 FFT; on the other hand, the 120-point WFTA has about 22% fewer data transfers than the 128-point radix-2 FFT. Finally, comparisons of the 'total' program execution times (multiplications, additions, and data transfers, but not indexing or permutations) are presented.

Nawab, H.↗

NASA NTRS1979

Bounds on the minimum number of data transfers in WFTA and FFT programs

Bounds on the minimum number of data transfers (i.e., loads, stores, copies) required by WFTA and FFT programs are presented. The analysis is applicable to those general-purpose computers with M general processor registers, where M is equal to or greater than 4 but much less than the transform length. It is shown that the 1008-point WFTA requires about 21 percent more data transfers than the 1024-point radix-4 FFT; on the other hand, the 120-point WFTA has about the same number of data transfers as the mixed radix (4 x 4 x 4 x 2) version of the 128-point FFT and 22 percent fewer than the radix-2 version. Finally, comparisons of the 'total' program execution times (multiplications, additions, and data transfers, but not indexing or permutations) are presented.

Nawab, H.↗

NASA NTRS1980

The 1980 summer research fellowship program

The problem of incorporating visual input into robot systems is described. The photochemistry of the stratosphere, particularly possible permutations of the ozone layer, is discussed. Photoelectrochemical properties of metal thio-hypodiphosphates are investigated. Extreme eigenvalues are computed by the Lancqos approach. The rotational Raman spectra of the molecular atmosphere is studied. A computer operated mathematical symbolic manipulation system is described. Preparation of polycrystalline semiconductor electrodes of tungsten and molybdenum dichalcogenides is received.

Darden, G. C.↗

NASA NTRS1982

Implication of a color multibeam communications satellite in the 30/20 GHz bands

In order to meet the need for increased communications capacity, NASA is conducting a program to develop technology and systems for a 30/20 GHz multibeam domestic U.S. satellite. One way to provide the required national interconnectivity is to permute and time share connections among the involved areas by means of a satellite-borne multiport microwave switch with a Time-Division Multiple Access (TDMA) system. In this connection, the question was analyzed whether a practical satellite message routing system can be developed using FDMA techniques. The total traffic (model A) was derived and used as an input specification for the satellite-routed FDMA study. Attention is given to beam isolations, color and regional systems, the level of service, and the color FDMA satellite. It is concluded that the FDMA system considered can handle substantially all the Customer Premises Service (CPS) and Trunking (TR) traffic in Model A. The (color) scheme completely satisfies the CPS and TR requirements of 23 cities.

Hoffman, M.↗

NASA NTRS1984

Shuffle-exchanges on augmented meshes

A mesh connected array of size N = two to the Kth power, K an integer, can be augmented by adding at most one edge per node such that it can perform a shuffle-exchange of size N/2 in constant time. A shuffle-exchange of size N is performed on this augmented array in constant time. This is done by combining the available perfect shuffle of size N/2 with the existing nearest neighbor connections of the mesh. By carefully scheduling the different permutations that are composed in order to achieve the shuffle, the time required is reduced to 5 steps, which is optimal for this network.

Bokhari, S. H.↗

NASA NTRS1986

At least some errors are randomly generated (Freud was wrong)

An experiment was carried out to expose something about human error generating mechanisms. In the context of the experiment, an error was made when a subject pressed the wrong key on a computer keyboard or pressed no key at all in the time allotted. These might be considered, respectively, errors of substitution and errors of omission. Each of seven subjects saw a sequence of three digital numbers, made an easily learned binary judgement about each, and was to press the appropriate one of two keys. Each session consisted of 1,000 presentations of randomly permuted, fixed numbers broken into 10 blocks of 100. One of two keys should have been pressed within one second of the onset of each stimulus. These data were subjected to statistical analyses in order to probe the nature of the error generating mechanisms. Goodness of fit tests for a Poisson distribution for the number of errors per 50 trial interval and for an exponential distribution of the length of the intervals between errors were carried out. There is evidence for an endogenous mechanism that may best be described as a random error generator. Furthermore, an item analysis of the number of errors produced per stimulus suggests the existence of a second mechanism operating on task driven factors producing exogenous errors. Some errors, at least, are the result of constant probability generating mechanisms with error rate idiosyncratically determined for each subject.

Sellen, A. J.↗

NASA NTRS1986

On the structure of parallelism in a highly concurrent PDE solver

A parallel multigrid algorithm for solving elliptic partial differential equations is developed and evaluated. A V-cycle multigrid method is altered to increase the degree of parallelism. A numerical analysis of the resulting concurrent-iteration multigrid algorithm is performed; its architectural implications are considered; highly parallel systems without shared memory are examined (including mesh-connected arrays, mesh-shuffle-connected systems, permutation networks, and direct VLSI embeddings); and the results of numerical experiments are presented in tables and graphs.

Gannon, D.↗

NASA NTRS1987

Optimization of orbital assignment and specification of service areas in satellite communications

The mathematical nature of the orbital and frequency assignment problem for communications satellites is explored, and it is shown that choosing the correct permutations of the orbit locations and frequency assignments is an important step in arriving at values which satisfy the signal-quality requirements. Two methods are proposed to achieve better spectrum/orbit utilization. The first, called the delta S concept, leads to orbital assignment solutions via either mixed-integer or restricted basis entry linear programming techniques; the method guarantees good single-entry carrier-to-interference ratio results. In the second, a basis for specifying service areas is proposed for the Fixed Satellite Service. It is suggested that service areas should be specified according to the communications-demand density in conjunction with the delta S concept in order to enable the system planner to specify more satellites and provide more communications supply.

Wang, Cou-Way↗

NASA NTRS1987

Relation of the spectroscopic reflectance of olivine to mineral chemistry and some remote sensing implications

High-resolution visible and near-IR diffuse spectral reflectance are used to systematically investigate apparent wavelength shifts as a function of mineral chemistry in the Fe/Mg olivine series from Fo(11) to Fo(91). The study also shows that trace amounts of nickel can be spectrally detected in the olivine structure. Significant compositional information can only be extracted at relatively high resolution, because the overall spectral characteristics of the olivines change only subtly as a function of the Fe/Mg ratio. This laboratory study is expected to aid in the interpretation of remotely sensed data from both terrestrial and extraterrestrial bodies. Terrestrial applications may include the recognition of ultramafic, ultrabasic, and basaltic terrains which in themselves may have mineral potential. Among extraterrestrial applications, the asteroids are obvious candidates for further examination. Some permutations of Fe-Mg-Ni relations in olivines are discussed as they apply to the interpretation of asteroid surfaces and other extraterrestrial bodies.

King, Trude V. V.↗

NASA NTRS1991

A trajectory planning scheme for spacecraft in the space station environment

Simulated annealing is used to solve a minimum fuel trajectory problem in the space station environment. The environment is special because the space station will define a multivehicle environment in space. The optimization surface is a complex nonlinear function of the initial conditions of the chase and target crafts. Small permutations in the input conditions can result in abrupt changes to the optimization surface. Since no prior knowledge about the number or location of local minima on the surface is available, the optimization must be capable of functioning on a multimodal surface. It was reported in the literature that the simulated annealing algorithm is more effective on such surfaces than descent techniques using random starting points. The simulated annealing optimization was found to be capable of identifying a minimum fuel, two-burn trajectory subject to four constraints which are integrated into the optimization using a barrier method. The computations required to solve the optimization are fast enough that missions could be planned on board the space station. Potential applications for on board planning of missions are numerous. Future research topics may include optimal planning of multi-waypoint maneuvers using a knowledge base to guide the optimization, and a study aimed at developing robust annealing schedules for potential on board missions.

Soller, Jeffrey Alan↗

NASA NTRS1991

Multiphase complete exchange on a circuit switched hypercube

On a distributed memory parallel computer, the complete exchange (all-to-all personalized) communication pattern requires each of n processors to send a different block of data to each of the remaining n - 1 processors. This pattern is at the heart of many important algorithms, most notably the matrix transpose. For a circuit switched hypercube of dimension d(n = 2(sup d)), two algorithms for achieving complete exchange are known. These are (1) the Standard Exchange approach that employs d transmissions of size 2(sup d-1) blocks each and is useful for small block sizes, and (2) the Optimal Circuit Switched algorithm that employs 2(sup d) - 1 transmissions of 1 block each and is best for large block sizes. A unified multiphase algorithm is described that includes these two algorithms as special cases. The complete exchange on a hypercube of dimension d and block size m is achieved by carrying out k partial exchange on subcubes of dimension d(sub i) Sigma(sup k)(sub i=1) d(sub i) = d and effective block size m(sub i) = m2(sup d-di). When k = d and all d(sub i) = 1, this corresponds to algorithm (1) above. For the case of k = 1 and d(sub i) = d, this becomes the circuit switched algorithm (2). Changing the subcube dimensions d, varies the effective block size and permits a compromise between the data permutation and block transmission overhead of (1) and the startup overhead of (2). For a hypercube of dimension d, the number of possible combinations of subcubes is p(d), the number of partitions of the integer d. This is an exponential but very slowly growing function and it is feasible over these partitions to discover the best combination for a given message size. The approach was analyzed for, and implemented on, the Intel iPSC-860 circuit switched hypercube. Measurements show good agreement with predictions and demonstrate that the multiphase approach can substantially improve performance for block sizes in the 0 to 160 byte range. This range, which corresponds to 0 to 40 floating point numbers per processor, is commonly encountered in practical numeric applications. The multiphase technique is applicable to all circuit-switched hypercubes that use the common e-cube routing strategy.

Bokhari, Shahid H.↗

NASA NTRS1991

Computation of viscous blast wave flowfields

A method to determine unsteady solutions of the Navier-Stokes equations was developed and applied. The structural finite-volume, approximately factored implicit scheme uses Newton subiterations to obtain the spatially and temporally second-order accurate time history of the interaction of blast-waves with stationary targets. The inviscid flux is evaluated using MacCormack's modified Steger-Warming flux or Roe flux difference splittings with total variation diminishing limiters, while the viscous flux is computed using central differences. The use of implicit boundary conditions in conjunction with a telescoping in time and space method permitted solutions to this strongly unsteady class of problems. Comparisons of numerical, analytical, and experimental results were made in two and three dimensions. These comparisons revealed accurate wave speed resolution with nonoscillatory discontinuity capturing. The purpose of this effort was to address the three-dimensional, viscous blast-wave problem. Test cases were undertaken to reveal these methods' weaknesses in three regimes: (1) viscous-dominated flow; (2) complex unsteady flow; and (3) three-dimensional flow. Comparisons of these computations to analytic and experimental results provided initial validation of the resultant code. Addition details on the numerical method and on the validation can be found in the appendix. Presently, the code is capable of single zone computations with selection of any permutation of solid wall or flow-through boundaries.

Atwood, Christopher A.↗

NASA NTRS1990

Optimal parallel solution of sparse triangular systems

A method for the parallel solution of triangular sets of equations is described that is appropriate when there are many right-handed sides. By preprocessing, the method can reduce the number of parallel steps required to solve Lx = b compared to parallel forward or backsolve. Applications are to iterative solvers with triangular preconditioners, to structural analysis, or to power systems applications, where there may be many right-handed sides (not all available a priori). The inverse of L is represented as a product of sparse triangular factors. The problem is to find a factored representation of this inverse of L with the smallest number of factors (or partitions), subject to the requirement that no new nonzero elements be created in the formation of these inverse factors. A method from an earlier reference is shown to solve this problem. This method is improved upon by constructing a permutation of the rows and columns of L that preserves triangularity and allow for the best possible such partition. A number of practical examples and algorithmic details are presented. The parallelism attainable is illustrated by means of elimination trees and clique trees.

Alvarado, Fernando L.↗

NASA NTRS1992

Optimization of laminated stacking sequence for buckling load maximization by genetic algorithm

The use of a genetic algorithm to optimize the stacking sequence of a composite laminate for buckling load maximization is studied. Various genetic parameters including the population size, the probability of mutation, and the probability of crossover are optimized by numerical experiments. A new genetic operator - permutation - is proposed and shown to be effective in reducing the cost of the genetic search. Results are obtained for a graphite-epoxy plate, first when only the buckling load is considered, and then when constraints on ply contiguity and strain failure are added. The influence on the genetic search of the penalty parameter enforcing the contiguity constraint is studied. The advantage of the genetic algorithm in producing several near-optimal designs is discussed.

Le Riche, Rodolphe↗

NASA NTRS1992

Cumulative creep-fatigue damage evolution in an austenitic stainless steel

A model of cumulative creep-fatigue damage has been developed which is based on the use of damage curve equations to describe the evolution of creep-fatigue damage for four basic creep-fatigue cycle types. These cycle types correspond to the four fundamental cycles of the Strain Range Partitioning Life Prediction approach of Manson, Halford, and Hirschberg. A concept referred to as Damage Coupling is introduced to analytically account for the differences in the nature of the damage introduced by each cycle type. For application of this model, the cumulative creep-fatigue damage behavior of type 316 stainless steel at 816 C has been experimentally established for the two-level loading cases involving fatigue and creep-fatigue, in various permutations. The tests were conducted such that the lower life (high strain) cycling was applied first, for a controlled number of cycles, and the higher life (lower strain) cycling was conducted at the second level, to failure. The proposed model correlated the majority of the observed cumulative creep-fatigue data.

Mcgaw, Michael A.↗