Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “connectivity”

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 181 records · Page 10

Reverse time migration: A seismic processing application on the connection machine

The implementation of a reverse time migration algorithm on the Connection Machine, a massively parallel computer is described. Essential architectural features of this machine as well as programming concepts are presented. The data structures and parallel operations for the implementation of the reverse time migration algorithm are described. The algorithm matches the Connection Machine architecture closely and executes almost at the peak performance of this machine.

Fiebrich, Rolf-Dieter↗

Solving very large, sparse linear systems on mesh-connected parallel computers

The implementation of Pan and Reif's Parallel Nested Dissection (PND) algorithm on mesh connected parallel computers is described. This is the first known algorithm that allows very large, sparse linear systems of equations to be solved efficiently in polylog time using a small number of processors. How the processor bound of PND can be matched to the number of processors available on a given parallel computer by slowing down the algorithm by constant factors is described. Also, for the important class of problems where G(A) is a grid graph, a unique memory mapping that reduces the inter-processor communication requirements of PND to those that can be executed on mesh connected parallel machines is detailed. A description of an implementation on the Goodyear Massively Parallel Processor (MPP), located at Goddard is given. Also, a detailed discussion of data mappings and performance issues is given.

Opsahl, Torstein↗

Teleparallelism as a universal connection on null hypersurfaces in general relativity

It is shown that a close relationship between the inner geometry of a null hypersurface N3 and the Newman-Penrose (NP) (1962, 1963) spin coefficient formalism exists. Projecting the null complex NP tetrad onto N3, two triads of basis vectors in N3 are obtained. The inner geometry of N3 is based on the assumption that these vectors are parallelly transported along the surface; this gives rise to the teleparallel connection as a metric nonsymmetric affine connection. The gauge freedom for the choice of the basis triads is given by the isotropy subgroup of the local Lorentz group leaving invariant the direction of the null generators of N3, and teleparallelism is determined by the equivalence class of the basis triads with respect to the global gauge group. Nine of the twelve NP coefficients are identified as the triad components of the torsion and the second fundamental form of N3. The resulting generalized Gauss-Codazzi equations are identical to nine of the NP equations, i.e., to the half of the Ricci identities. This result gives a geometrical meaning to the entire formalism. Finally a general proof of Penrose's theorem that the shear of the null generators of N3 is the only initial null datum for a gravitational field on N3 is presented.

Mazur, P. O.↗

Binary synaptic connections based on memory switching in a-Si:H for artificial neural networks

A scheme for nonvolatile associative electronic memory storage with high information storage density is proposed which is based on neural network models and which uses a matrix of two-terminal passive interconnections (synapses). It is noted that the massive parallelism in the architecture would require the ON state of a synaptic connection to be unusually weak (highly resistive). Memory switching using a-Si:H along with ballast resistors patterned from amorphous Ge-metal alloys is investigated for a binary programmable read only memory matrix. The fabrication of a 1600 synapse test array of uniform connection strengths and a-Si:H switching elements is discussed.

Thakoor, A. P.↗

Connectivity is the key

Connectivity that would allow users at home to interact with an experiment in space and with facilities and services worldwide is a primary goal of the international Space Station program. The systems supporting such connectivity, including the Space Station Information System, the Technical and Management Information System, and the Software Support Environment, are discussed here. The primary purposes of each system and their operational data are addressed.

Hall, Dana L.↗

Space station architecture, module, berthing hub, shell assembly, berthing mechanism and utility connection channel

A Space Station includes a plurality of modules, and berthing hubs, joined by interconnections which are sideways connectable. The modules and hubs are fastened together in a trianglar configuration in three dimensions. The interconnections include a pair of opposed, axially aligned, flanged ports, and a clamp latch formed from a plurality of sections hinged along their length and extending circumferentially around the flanged ports. A utilities connection channel extends between ports. The channel has a shell with utilities connectors movable between an extended position to mating connectors in the modules and a withdrawn position. Assembly sequence and common module shell structure is detailed.

Marc M Cohen↗

Kanerva's sparse distributed memory: An associative memory algorithm well-suited to the Connection Machine

The advent of the Connection Machine profoundly changes the world of supercomputers. The highly nontraditional architecture makes possible the exploration of algorithms that were impractical for standard Von Neumann architectures. Sparse distributed memory (SDM) is an example of such an algorithm. Sparse distributed memory is a particularly simple and elegant formulation for an associative memory. The foundations for sparse distributed memory are described, and some simple examples of using the memory are presented. The relationship of sparse distributed memory to three important computational systems is shown: random-access memory, neural networks, and the cerebellum of the brain. Finally, the implementation of the algorithm for sparse distributed memory on the Connection Machine is discussed.

Rogers, David↗

Phase connection for geodesy - Results from a 245-km baseline

In an effort to greatly improve the measurement precision of VLBI observables used to determine geodetic baselines, the potential of utilizing fringe phase has been investigated. The 245-km baseline between Mojave and Owens Valley in CA has been most thoroughly studied for this purpose. In trying several different experimental designs, it appears that source scheduling is not the critical factor in determining when phase connection can be established. Normally, instrumental instabilities are also not limiting (although nominal functioning of the instrumentation is essential). The most serious factor in limiting opportunities for phase connection seems to be atmospheric variability. However, when the observation SNR is made large (greater than 50) to give very precise group delays (and hence enhance the chance of resolving phase ambiguities), the improvement in baseline uncertainty obtained using phase delays is only marginal compared with the corresponding group delay solution. For this case, the baseline error budget is dominated by stochastic variations in clock and atmospheric delay contributions rather than by observation noise.

Ray, J. R.↗

Novel tether-connected two-dimensional structures for low earth orbits

This paper proposes novel tether-connected two-dimensional structures with a size of several hundred square kilometers for low earth orbits. The attitude of these structures is gravitationally stabilized with respect to an earth-oriented reference frame. A stable shape is obtained by utilizing environmental forces such as differential air drag or electrodynamic forces which stiffen the system. Configurations which differ in geometry and in the number of connecting tethers are presented in the paper. The static stability of each configuration is analyzed as a function of design and orbital parameters. A brief discussion of the applications of such tethered systems is provided at the end of the paper.

Lorenzini, Enrico C.↗

Connection Protocol For Mobile/Satellite Communications

Throughput increased by better resolution of competing simultaneous requests for connections. Improved protocol sorts out simultaneous competing requests by message-originating stations for connection to satellite transmission link of land-mobile/satellite digital communication system. Applies to multiple-channel packet-message system with synchronous timeslots on all channels. Communication system has Q channels. Transmissions of packets allowed to begin only at beginnings of timeslots. Provides, to all users, binary feedback information on state of channel - namely, whether or not there is collision - during each timeslot.

Tan, Harry H.↗

Weakly connected neural nets

A new neural network architecture is proposed based upon effects of non-Lipschitzian dynamics. The network is fully connected, but these connections are active only during vanishingly short time periods. The advantages of this architecture are discussed.

Zak, Michail↗

Connecting forest ecosystem and microwave backscatter models

A procedure is outlined to connect data obtained from active microwave remote sensing systems with forest ecosystem models. The hierarchy of forest ecosystem models is discussed, and the levels at which microwave remote sensing data can be used as inputs are identified. In addition, techniques to utilize forest ecosystem models to assist in the validation of theoretical microwave backscatter models are identified. Several examples to illustrate these connecting processes are presented.

Kasischke, Eric S.↗

Quick-Connect Truss Fastener

Quick-connect fastener actuated by simple motion of hexagonal wrench. Enables assembly of truss by heavily gloved technician or by robot. Originally designed for use by Astronaut or robot assembling a truss in outer space, fastener also adapts to various connection applications requiring quick assembly or disassembly.

Sheridan, Philip L.↗

Topology-selective jamming of fully-connected, code-division random-access networks

The purpose is to introduce certain models of topology selective stochastic jamming and examine its impact on a class of fully-connected, spread-spectrum, slotted ALOHA-type random access networks. The theory covers dedicated as well as half-duplex units. The dominant role of the spatial duty factor is established, and connections with the dual concept of time selective jamming are discussed. The optimal choices of coding rate and link access parameters (from the users' side) and the jamming spatial fraction are numerically established for DS and FH spreading.

Polydoros, Andreas↗

An assessment of the connection machine

The CM-2 is an example of a connection machine. The strengths and problems of this implementation are considered as well as important issues in the architecture and programming environment of connection machines in general. These are contrasted to the same issues in Multiple Instruction/Multiple Data (MIMD) microprocessors and multicomputers.

Schreiber, Robert↗

Comparison of coupled-cluster methods which include the effects of connected triple excitations

The 'coupled cluster single, double, and triple' (CCSDT) excitation model has been used to ascertain electron correlation energies for 14 different molecules representing a variety of chemical bonds, in conjunction with several methods of this type 'CCSDT-x', which include only an approximate treatment of connected triple excitations; these methods encompass CCSDT-1a, -1b, -2, -3, and -4, as well as the novel CCSD(T). While all methods treat the effects of connected triple excitations iteratively, CCSD(T) approaches then perturbationally. For the 14 molecules considered, the CCSD(T) method's average error relative to CCSDT is substantially lower than any of the CCSDT-x methods.

Scuseria, Gustavo E.↗

Weakly connected neural nets

A new neural network architecture is proposed based upon effects of non-Lipschitzian dynamics. The network is fully connected, but these connections are active only during vanishingly short time periods. The advantages of this architecture are discussed.

Zak, Michail↗