Search NASA⌕ Search

SEARCH · Search NASA

Results for “VECTOR PROCESSING”

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

Optimal ride control for the Twin Otter, STOL aircraft

An aircraft with low wing loading, such as the deHavilland, Twin Otter, exhibits a relatively large acceleration sensitivity to wind gusts. These undesirable aircraft motions can be reduced using an automatic ride control system. In this paper, the techniques of quadratic optimal control theory are utilized to investigate the capabilities of such a ride control system. The effects of the wind gusts on the aircraft can be modeled by a vector stochastic process containing seven states. The impact of this disturbance model on the optimal control system structure is assessed and comparison is made to a system without gust feedback.

Holley, W. E.↗

Mathematical algorithms to maximize performance in numerical weather prediction

Numerical weather prediction models, which involve the solution of non-linear partial differential equations at points on an extensive three dimensional grid, are ideally suited for processing on vector machines. It was logical therefore that the new global forecast model to be implemented at the Meteorological Office should be written in vector code for the CYBER 205. In order to achieve full efficiency and to reduce storage requirements the model used 32-bit arithmetic which was found to provide high enough precision. Unfortunately, however, the trigonometrical and logarithmic functions provided by CDC could only handle 64-bit vectors and, although written in efficient scalar code, did not take advantage of the special facilities of a vector processor. It was therefore necessary to rewrite the functions in vector code to handle both 32 and 64-bit vectors. There was also no half-precision compiler available for the Cyber 205 at that time and so the functions, like the model, had to make extensive use of the special call syntax. This made the code more difficult to write but it allowed much greater flexibility in that it became possible to access the exponent of a floating-point number independently of its coefficient. A description is given of the technique and the results which were achieved are summarized.

Foreman, A.↗

Parallel processors and nonlinear structural dynamics algorithms and software

A nonlinear structural dynamics program with an element library that exploits parallel processing is under development. The aim is to exploit scheduling-allocation so that parallel processing and vectorization can effectively be treated in a general purpose program. As a byproduct an automatic scheme for assigning time steps was devised. A rudimentary form of the program is complete and has been tested; it shows substantial advantage can be taken of parallelism. In addition, a stability proof for the subcycling algorithm has been developed.

Belytschko, T.↗

Linear prediction of stationary vector sequences

The class of all linear predictors of minimal order for a stationary vector-valued process is specified in terms of linear transformations on the associated Hankel covariance matrix. Two particular transformations, yielding computationally efficient construction schemes, are proposed.

Baram, Yoram↗

Open-Source Software for Modeling of Nanoelectronic Devices

The Nanoelectronic Modeling 3-D (NEMO 3-D) computer program has been upgraded to open-source status through elimination of license-restricted components. The present version functions equivalently to the version reported in "Software for Numerical Modeling of Nanoelectronic Devices" (NPO-30520), NASA Tech Briefs, Vol. 27, No. 11 (November 2003), page 37. To recapitulate: NEMO 3-D performs numerical modeling of the electronic transport and structural properties of a semiconductor device that has overall dimensions of the order of tens of nanometers. The underlying mathematical model represents the quantum-mechanical behavior of the device resolved to the atomistic level of granularity. NEMO 3-D solves the applicable quantum matrix equation on a Beowulf-class cluster computer by use of a parallel-processing matrix vector multiplication algorithm coupled to a Lanczos and/or Rayleigh-Ritz algorithm that solves for eigenvalues. A prior upgrade of NEMO 3-D incorporated a capability for a strain treatment, parameterized for bulk material properties of GaAs and InAs, for two tight-binding submodels. NEMO 3-D has been demonstrated in atomistic analyses of effects of disorder in alloys and, in particular, in bulk In(x)Ga(1-x)As and in In(0.6)Ga(0.4)As quantum dots.

Oyafuso, Fabiano↗

Numerical Modeling of Nanoelectronic Devices

Nanoelectronic Modeling 3-D (NEMO 3-D) is a computer program for numerical modeling of the electronic structure properties of a semiconductor device that is embodied in a crystal containing as many as 16 million atoms in an arbitrary configuration and that has overall dimensions of the order of tens of nanometers. The underlying mathematical model represents the quantummechanical behavior of the device resolved to the atomistic level of granularity. The system of electrons in the device is represented by a sparse Hamiltonian matrix that contains hundreds of millions of terms. NEMO 3-D solves the matrix equation on a Beowulf-class cluster computer, by use of a parallel-processing matrix vector multiplication algorithm coupled to a Lanczos and/or Rayleigh-Ritz algorithm that solves for eigenvalues. In a recent update of NEMO 3-D, a new strain treatment, parameterized for bulk material properties of GaAs and InAs, was developed for two tight-binding submodels. The utility of the NEMO 3-D was demonstrated in an atomistic analysis of the effects of disorder in alloys and, in particular, in bulk In(x)Ga(l-x)As and in In0.6Ga0.4As quantum dots.

Klimeck, Gerhard↗

Supercomputing For Everyone!

Describes what a supercomputer is and how it operates. A super computer is a computer that operates at or near the peak performance achievable within the constraints of existing technology and available power and cooling. Cost: A leadership scale supercomputer costs ~$1E8! Size: Can require 6,000+ square feet of space! Power: Can require $6-7 million/year to operate Speed: INL's supercomputers can compute in one second what would take a human with a calculator 50 trillion years! Rate of innovation: Today's smart phones are faster than supercomputers in the 1970's!

99 GENERAL AND MISCELLANEOUS↗

(abstract) A High Throughput 3-D Inner Product Processor

A particularily challenging image processing application is the real time scene acquisition and object discrimination. It requires spatio-temporal recognition of point and resolved objects at high speeds with parallel processing algorithms. Neural network paradigms provide fine grain parallism and, when implemented in hardware, offer orders of magnitude speed up. However, neural networks implemented on a VLSI chip are planer architectures capable of efficient processing of linear vector signals rather than 2-D images. Therefore, for processing of images, a 3-D stack of neural-net ICs receiving planar inputs and consuming minimal power are required. Details of the circuits with chip architectures will be described with need to develop ultralow-power electronics. Further, use of the architecture in a system for high-speed processing will be illustrated.

imaging parallel processing algorithms linear vect↗

Probing the CP structure of the top quark Yukawa at the future muon collider

We study the top-Higgs coupling with a CP violating phase ξ at a future multi-TeV muon collider. We focus on processes that are directly sensitive to the top quark Yukawa coupling: $t$$\overline{t}$$h$, $tbhμν$, and $t$$\overline{t}$$h$$v$$\overline{v}$ with $h$ → $b$$\overline{b}$ and semileptonic top decays. At different energies, different processes dominate the cross section, providing complementary information. At and above an energy of $\mathcal{O}$(10) TeV, vector boson fusion processes dominate. As we show, in the Standard Model there is destructive interference in the vector boson fusion processes $t$$\overline{t}$$h$$v$$\overline{v}$ and $tbhμν$ between the top quark Yukawa and Higgs-gauge boson couplings. A CP-violating phase changes this interference, and the cross section measurement is very sensitive to the size of the CP-violating angle. Although we find that the cross sections are measured to $\mathcal{O}$(50%) statistical uncertainty at 1σ, a 10 and 30 TeV muon collider can bound the CP-violating angle |ξ| ≲ 9.0° and |ξ| ≲ 5.4°, respectively. However, cross section measurements are insensitive to the sign of the CP-violating angle. To determine that the coupling is truly CP violating, observables sensitive to CP-violation must be measured. We find in the $t$$\overline{t}$$h$ process the azimuthal angle between the $t$ + $\overline{t}$ plane and the initial state muon+Higgs plane shows good discrimination for ξ = ±0.1π.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Precise predictions for same-sign W-boson scattering at the LHC

Vector-boson scattering processes are of great importance for the current run-II and future runs of the Large Hadron Collider. The presence of triple and quartic gauge couplings in the process gives access to the gauge sector of the Standard Model (SM) and possible new-physics contributions there. To test any new-physics hypothesis, sound knowledge of the SM contributions is necessary, with a precision which at least matches the experimental uncertainties of existing and forthcoming measurements. In this article we present a detailed study of the vector-boson scattering process with two positively-charged leptons and missing transverse momentum in the final state. In particular, we first carry out a systematic comparison of the various approximations that are usually performed for this kind of process against the complete calculation, at LO and NLO QCD accuracy. Such a study is performed both in the usual fiducial region used by experimental collaborations and in a more inclusive phase space, where the differences among the various approximations lead to more sizeable effects. Afterwards, we turn to predictions matched to parton showers, at LO and NLO: we show that on the one hand, the inclusion of NLO QCD corrections leads to more stable predictions, but on the other hand the details of the matching and of the parton-shower programs cause differences which are considerably larger than those observed at fixed order, even in the experimental fiducial region. We conclude with recommendations for experimental studies of vector-boson scattering processes.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Twos-complement data processing form improved encoded matrix-vector processors

A new method for handling bipolar data by twos-complement representation is detailed. This technique requires fewer bits, uses simpler optical processor devices (fewer channels), and provides a higher processing rate and throughput. It is directly extendable to more complex matrix operations because of its data flow property and requires only a modest increase in the complexity of the digital support system.

Taylor, B. K.↗

A Study of Fast Reactor Fuel Transmutation in a Candidate Dispersion Fuel Design

Dispersion fuels represent a significant departure from typical ceramic fuels to address swelling and radiation damage in high burnup fuel. Such fuels use a manufacturing process in which fuel particles are encapsulated within a non-fuel matrix. Dispersion fuels have been studied since 1997 as part of an international effort to develop and test very high density fuel types for the Reduced Enrichment for Research and Test Reactors (RERTR) program.[1] The Idaho National Laboratory is performing research in the development of an innovative dispersion fuel concept that will meet the challenges of transuranic (TRU) transmutation by providing an integral fission gas plenum within the fuel itself, to eliminate the swelling that accompanies the irradiation of TRU. In this process, a metal TRU vector produced in a separations process is atomized into solid microspheres. The dispersion fuel process overcoats the microspheres with a mixture of resin and hollow carbon microspheres to create a TRUC. The foam may then be heated and mixed with a metal power (e.g., Zr, Ti, or Si) and resin to form a matrix metal carbide, that may be compacted and extruded into fuel elements. In this paper, we perform reactor physics calculations for a core loaded with the conceptual fuel design. We will assume a “typical” TRU vector and a reference matrix density. We will employ a fuel and core design based on the Advanced Burner Test Reactor (ABTR) design.[2] Using the CSAS6 and TRITON modules of the SCALE system [3] for preliminary scoping studies, we will demonstrate the feasibility of reactor operations. This paper will describe the results of these analyses.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Definition of Contravariant Velocity Components

In this paper we have reviewed the basics of tensor analysis in an attempt to clarify some misconceptions regarding contravariant and covariant vector components as used in fluid dynamics. We have indicated that contravariant components are components of a given vector expressed as a unique combination of the covariant base vector system and, vice versa, that the covariant components are components of a vector expressed with the contravariant base vector system. Mathematically, expressing a vector with a combination of base vector is a decomposition process for a specific base vector system. Hence, the contravariant velocity components are decomposed components of velocity vector along the directions of coordinate lines, with respect to the covariant base vector system. However, the contravariant (and covariant) components are not physical quantities. Their magnitudes and dimensions are controlled by their corresponding covariant (and contravariant) base vectors.

Hung, Ching-moa↗

A convenient method of preparing gene vector for real time monitoring transfection process based on the quantum dots

Highlights: ► An easy and direct way to prepare QDs–DNA complexes was developed. ► Surface charge of QDs was tuned with different ratio of amino and glycolate. ► Transfection efficiency was dependent on the surface zeta potentials of QDs. ► Cellular toxicity of this gene vectors is much lower than commercial liposome. ► Whole intracellular behavior of QDs–DNA complexes can be monitored in real time. -- Abstract: Nanoparticle carrier has been developed by combining water-soluble quantum dots and plasmid DNA expressed enhanced green fluorescent protein (EGFP) in a convenient and direct way. First the QDs with different surface charges were obtained by coating with amino and carboxyl terminals at different ratios. Then plasmid DNA was conjugated to QDs via electrostatic interaction. The resultant QDs–DNA complexes showed enhanced resistance to DNase I digestion. The following transfection experiments demonstrated that the transfection efficiency was dependent on the surface charges on QDs. The real time imaging of the transfection process showed that the nanoparticles experienced binding, penetrating the cell membrane and entering cytoplasm in the first 6 h of transfection. The green fluorescence of EGFP began to appear after 18 h transfection and plasmid DNA was fully expressed in the following 6 h. This new QDs–DNA platform showed great potential as new gene delivery carrier.

77 NANOSCIENCE AND NANOTECHNOLOGY↗

Parafrase restructuring of FORTRAN code for parallel processing

Parafrase transforms a FORTRAN code, subroutine by subroutine, into a parallel code for a vector and/or shared-memory multiprocessor system. Parafrase is not a compiler; it transforms a code and provides information for a vector or concurrent process. Parafrase uses a data dependency to reveal parallelism among instructions. The data dependency test distinguishes between recurrences and statements that can be directly vectorized or parallelized. A number of transformations are required to build a data dependency graph.

Wadhwa, Atul↗