Search NASA⌕ Search

SEARCH · Search NASA

Results for “serialization”

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 667 records · Page 37

Electro-optical characterization of the Tektronix TK512M-011 charge-coupled device

An electrooptical characterization encompassing linearity, blooming, dark-count rate, charge-transfer efficiency (CTE), and quantum efficiency, is presented for a front/side-illuminated CCD with 512x512 format and 27x27-micron pixels. The detailed noise characteristics of the CCD-output FET are reported. While very good low light level CTE is obtained in the parallel-shift direction, CTE problems arise in the serial direction. The output FET noise is equivalent to 5-12 electrons, depending on FET operating conditions and system bandwidth.

Epperson, Patrick M.↗

Lick Observatory charge-coupled-device data acquisition system

The Lick Observatory CCD data acquisition system is described, with some observational results to illustrate the system capability. The electronics for the CCD are subdivided into those attached to the dewar, a 'smart' controller near the dewar, and a computer connected by serial link to the smart controller. Software for the controller is in assembler code, while the software for data acquisition and on-line analysis is written in C and uses the UNIX operating system. The computers and controllers are programmed to recognize and operate several different types of CCD. Three separate instruments that use the CCDs are described briefly, together with examples of the data they produce.

Robinson, L. B.↗

Mathematical model partitioning and packing for parallel computer calculation

This paper deals with the development of multiprocessor simulations from a serial set of ordinary differential equations describing a physical system. The identification of computational parallelism within the model equations is discussed. A technique is presented for identifying this parallelism and for partitioning the equations for parallel solution on a multiprocessor. Next, an algorithm which packs the equations into a minimum number of processors is described. The results of applying the packing algorithm to a turboshaft engine model are presented.

Arpasi, Dale J.↗

Electronic Neural-Network Simulator

Experimental circuits faster than simulation programs run on digital computers. Serial shift register routes clock pulses C1 to neurons in sequence. Clock pulses C2 interrogate neurons. Neuron interconnection information stored in simulated synapses. Can be expanded to greater complexity.

Moopenn, Alex W.↗

Electronic Neural Networks

Memory based on neural network models content-addressable and fault-tolerant. System includes electronic equivalent of synaptic network; particular, matrix of programmable binary switching elements over which data distributed. Switches programmed in parallel by outputs of serial-input/parallel-output shift registers. Input and output terminals of bank of high-gain nonlinear amplifiers connected in nonlinear-feedback configuration by switches and by memory-prompting shift registers.

Lambe, John↗

Robot Gripper With Signal Processing

Single-chip computer and sensor-circuit chips preprocess sensor data. Self-contained circuitry combines sensor signals for serial digital transmission. Gripping surfaces crossed with grooves for grasping differently shaped objects. Gripper cavities house sensors and preprocessing circuitry. Sensors and preprocessing circuitry in robot gripper reduce amount of data being transmitted between robot controller and gripper. Placement in gripper reduces signal delays and vulnerability to electromagnetic interference.

Killion, Richard R.↗

A geostationary imaging spectrometer TOMS instrument

One design for a geostationary Total Ozone Mapping Spectrometer (TOMS) with many desirable features is an imaging spectrometer. A preliminary study makes use of a 0.25 m Czerny-Turner spectrometer with which the Earth is imaged on a charge-coupled device (CCD) in dispersed light. The wavelength is determined by a movable grating which can be set arbitrarily by ground control. The signal integration time depends on wavelength but this system allows arbitrary timing by command. Special circumstances such as a requirement to track a low-lying sulfur dioxide cloud or a need to discriminate high level ozone from total ozone at midlatitudes could be obtained by adding a particular wavelength to the normally pre-programmed time sequence. The incident solar irradiance is measured by deploying a diffuser plate in the field of view. Individual detector elements correspond to scene elements in which the several wavelengths are serially sampled and the Earth radiance is compared to the incident sunlight. Thus the problem of uncorrelated drift of multiple detectors is removed.

Krueger, Arlin J.↗

A Generalized Method for Automatic Downhand and Wirefeed Control of a Welding Robot and Positioner

A generalized method for controlling a six degree-of-freedom (DOF) robot and a two DOF positioner used for arc welding operations is described. The welding path is defined in the part reference frame, and robot/positioner joint angles of the equivalent eight DOF serial linkage are determined via an iterative solution. Three algorithms are presented: the first solution controls motion of the eight DOF mechanism such that proper torch motion is achieved while minimizing the sum-of-squares of joint displacements; the second algorithm adds two constraint equations to achieve torch control while maintaining part orientation so that welding occurs in the downhand position; and the third algorithm adds the ability to control the proper orientation of a wire feed mechanism used in gas tungsten arc (GTA) welding operations. A verification of these algorithms is given using ROBOSIM, a NASA developed computer graphic simulation software package design for robot systems development.

Fernandez, Ken↗

Investigations on the usefulness of the Massively Parallel Processor for study of electronic properties of atomic and condensed matter systems

The usefulness of the Massively Parallel Processor (MPP) for investigation of electronic structures and hyperfine properties of atomic and condensed matter systems was explored. The major effort was directed towards the preparation of algorithms for parallelization of the computational procedure being used on serial computers for electronic structure calculations in condensed matter systems. Detailed descriptions of investigations and results are reported, including MPP adaptation of self-consistent charge extended Hueckel (SCCEH) procedure, MPP adaptation of the first-principles Hartree-Fock cluster procedure for electronic structures of large molecules and solid state systems, and MPP adaptation of the many-body procedure for atomic systems.

Das, T. P.↗

An O(N squared) method for computing the eigensystem of N by N symmetric tridiagonal matrices by the divide and conquer approach

An efficient method is proposed to solve the eigenproblem of N by N Symmetric Tridiagonal (ST) matrices. Unlike the standard eigensolvers which necessitate O(N cubed) operations to compute the eigenvectors of such ST matrices, the proposed method computes both the eigenvalues and eigenvectors with only O(N squared) operations. The method is based on serial implementation of the recently introduced Divide and Conquer (DC) algorithm. It exploits the fact that by O(N squared) of DC operations, one can compute the eigenvalues of N by N ST matrix and a finite number of pairs of successive rows of its eigenvector matrix. The rest of the eigenvectors--all of them or one at a time--are computed by linear three-term recurrence relations. Numerical examples are presented which demonstrate the superiority of the proposed method by saving an order of magnitude in execution time at the expense of sacrificing a few orders of accuracy.

Gill, Doron↗

Parallel image compression

A parallel compression algorithm for the 16,384 processor MPP machine was developed. The serial version of the algorithm can be viewed as a combination of on-line dynamic lossless test compression techniques (which employ simple learning strategies) and vector quantization. These concepts are described. How these concepts are combined to form a new strategy for performing dynamic on-line lossy compression is discussed. Finally, the implementation of this algorithm in a massively parallel fashion on the MPP is discussed.

Reif, John H.↗

Parallel algorithms for mapping pipelined and parallel computations

Many computational problems in image processing, signal processing, and scientific computing are naturally structured for either pipelined or parallel computation. When mapping such problems onto a parallel architecture it is often necessary to aggregate an obvious problem decomposition. Even in this context the general mapping problem is known to be computationally intractable, but recent advances have been made in identifying classes of problems and architectures for which optimal solutions can be found in polynomial time. Among these, the mapping of pipelined or parallel computations onto linear array, shared memory, and host-satellite systems figures prominently. This paper extends that work first by showing how to improve existing serial mapping algorithms. These improvements have significantly lower time and space complexities: in one case a published O(nm sup 3) time algorithm for mapping m modules onto n processors is reduced to an O(nm log m) time complexity, and its space requirements reduced from O(nm sup 2) to O(m). Run time complexity is further reduced with parallel mapping algorithms based on these improvements, which run on the architecture for which they create the mappings.

Nicol, David M.↗

Attention, effort, and fatigue: Neuropsychological perspectives

Models of attention, effort, and fatigue are reviewed. Methods are discussed for measuring these phenomena from a neuropsychological and psychophysiological perspective. The following methodologies are included: (1) the autonomic measurement of cognitive effort and quality of encoding; (2) serial assessment approaches to neurophysiological assessment; and (3) the assessment of subjective reports of fatigue using multidimensional ratings and their relationship to neurobehavioral measures.

Cohen, Ronald A.↗

Recursive mass matrix factorization and inversion: An operator approach to open- and closed-chain multibody dynamics

This report advances a linear operator approach for analyzing the dynamics of systems of joint-connected rigid bodies.It is established that the mass matrix M for such a system can be factored as M=(I+H phi L)D(I+H phi L) sup T. This yields an immediate inversion M sup -1=(I-H psi L) sup T D sup -1 (I-H psi L), where H and phi are given by known link geometric parameters, and L, psi and D are obtained recursively by a spatial discrete-step Kalman filter and by the corresponding Riccati equation associated with this filter. The factors (I+H phi L) and (I-H psi L) are lower triangular matrices which are inverses of each other, and D is a diagonal matrix. This factorization and inversion of the mass matrix leads to recursive algortihms for forward dynamics based on spatially recursive filtering and smoothing. The primary motivation for advancing the operator approach is to provide a better means to formulate, analyze and understand spatial recursions in multibody dynamics. This is achieved because the linear operator notation allows manipulation of the equations of motion using a very high-level analytical framework (a spatial operator algebra) that is easy to understand and use. Detailed lower-level recursive algorithms can readily be obtained for inspection from the expressions involving spatial operators. The report consists of two main sections. In Part 1, the problem of serial chain manipulators is analyzed and solved. Extensions to a closed-chain system formed by multiple manipulators moving a common task object are contained in Part 2. To retain ease of exposition in the report, only these two types of multibody systems are considered. However, the same methods can be easily applied to arbitrary multibody systems formed by a collection of joint-connected regid bodies.

Rodriguez, G.↗

Echocardiographic measurements of left ventricular mass by a non-geometric method

The accuracy of a new nongeometric method for calculating left ventricular myocardial volumes from two-dimensional echocardiographic images was assessed in vitro using 20 formalin-fixed normal human hearts. Serial oblique short-axis images were acquired from one point at 5-deg intervals, for a total of 10-12 cross sections. Echocardiographic myocardial volumes were calculated as the difference between the volumes defined by the epi- and endocardial surfaces. Actual myocardial volumes were determined by water displacement. Volumes ranged from 80 to 174 ml (mean 130.8 ml). Linear regression analysis demonstrated excellent agreement between the echocardiographic and direct measurements.

Parra, Beatriz↗

The Lick Observatory CCD data acquisition system

An evolving system for CCD data acquisition is described. The electronics are subdivided into those attached to the dewar, a 'smart' controller near the dewar, and a computer connected by serial link to the smart controller. Software for the smart controller is in assembler code, while the data acquisition and on-line analysis software is written in 'C' and uses the UNIX operating system.

Robinson, L. B.↗

Applications considerations in the system design of highly concurrent multiprocessors

A flow model processor approach to parallel processing is described, using very-high-performance individual processors, high-speed circuit switched interconnection networks, and a high-speed synchronization capability to minimize the effect of the inherently serial portions of applications on performance. Design studies related to the determination of the number of processors, the memory organization, and the structure of the networks used to interconnect the processor and memory resources are discussed. Simulations indicate that applications centered on the large shared data memory should be able to sustain over 500 million floating point operations per second.

Lundstrom, Stephen F.↗

Partitioning problems in parallel, pipelined, and distributed computing

The problem of optimally assigning the modules of a parallel program over the processors of a multiple-computer system is addressed. A sum-bottleneck path algorithm is developed that permits the efficient solution of many variants of this problem under some constraints on the structure of the partitions. In particular, the following problems are solved optimally for a single-host, multiple-satellite system: partitioning multiple chain-structured parallel programs, multiple arbitrarily structured serial programs, and single-tree structured parallel programs. In addition, the problem of partitioning chain-structured parallel programs across chain-connected systems is solved under certain constraints. All solutions for parallel programs are equally applicable to pipelined programs. These results extend prior research in this area by explicitly taking concurrency into account and permit the efficient utilization of multiple-computer architectures for a wide range of problems of practical interest.

Bokhari, Shahid H.↗