11.12.2012 Views

NASA Scientific and Technical Aerospace Reports

NASA Scientific and Technical Aerospace Reports

NASA Scientific and Technical Aerospace Reports

SHOW MORE
SHOW LESS

You also want an ePaper? Increase the reach of your titles

YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.

20040111304 <strong>NASA</strong> Langley Research Center, Hampton, VA, USA<br />

A Parallel Prefix Algorithm for Almost Toeplitz Tridiagonal Systems<br />

Sun, Xian-He; Joslin, Ronald D.; [1995]; 29 pp.; In English<br />

Contract(s)/Grant(s): NAS1-19480; NAS1-1672; No Copyright; Avail: CASI; A03, Hardcopy<br />

A compact scheme is a discretization scheme that is advantageous in obtaining highly accurate solutions. However, the<br />

resulting systems from compact schemes are tridiagonal systems that are difficult to solve efficiently on parallel computers.<br />

Considering the almost symmetric Toeplitz structure, a parallel algorithm, simple parallel prefix (SPP), is proposed. The SPP<br />

algorithm requires less memory than the conventional LU decomposition <strong>and</strong> is efficient on parallel machines. It consists of<br />

a prefix communication pattern <strong>and</strong> AXPY operations. Both the computation <strong>and</strong> the communication can be truncated without<br />

degrading the accuracy when the system is diagonally dominant. A formal accuracy study has been conducted to provide a<br />

simple truncation formula. Experimental results have been measured on a MasPar MP-1 SIMD machine <strong>and</strong> on a Cray 2<br />

vector machine. Experimental results show that the simple parallel prefix algorithm is a good algorithm for symmetric, almost<br />

symmetric Toeplitz tridiagonal systems <strong>and</strong> for the compact scheme on high-performance computers.<br />

Author<br />

Algorithms; Parallel Computers; Decomposition<br />

20040111395 <strong>NASA</strong> Marshall Space Flight Center, Huntsville, AL, USA<br />

Allowables for Structural Composites<br />

Netles, Alan T.; [2004]; 2 pp.; In English; International Conference on Composites Engineering, 8-14 Aug. 2004, Hilton Head,<br />

SC, USA; No Copyright; Avail: CASI; A01, Hardcopy<br />

In order to obtain the most benefit from building a structure with composite laminates, the strength of the laminate must<br />

be known. Based on the ‘weakest link’ theory, the lower strength numbers obtained from testing are the ones to be used for<br />

design <strong>and</strong> analysis. The strength value to be used is determined by a statistical analysis of the test data, <strong>and</strong> is known as an<br />

allowable. MIL-HDBK- 17 outlines procedures to follow for determining these allowables. There are two types of statistically<br />

determined allowables, A- Basis <strong>and</strong> B-Basis. A-Basis is defined as a strength value at which only 1 in 100 specimens will<br />

fail with a 95% confidence level. B-Basis is a strength value at which only 10 in 100 specimens will fail with a 95% confidence<br />

level. As more specimens are tested a higher value of strength can be used as a valid allowable. Composites are highly process<br />

dependent <strong>and</strong> show much strength variation with environment, so it is critical to test materials <strong>and</strong> environments that are<br />

representative of hardware. Either using data obtained from a previous test series, or extrapolation to a certain temperature is<br />

highly discouraged.<br />

Author<br />

Structural Analysis; Structural Design; Laminates; High Strength; Design Analysis<br />

20040111458 Air Force Inst. of Tech., Wright-Patterson AFB, OH<br />

Target Recognition Using Late-Time Returns from Ultra-Wideb<strong>and</strong>, Short-Pulse Radar<br />

Pascoe, Kenneth J.; Jun. 2004; 316 pp.; In English; Original contains color illustrations<br />

Report No.(s): AD-A425348; AFIT/DS/ENG/04-04; No Copyright; Avail: CASI; A14, Hardcopy<br />

The goal of this research is to develop algorithms that recognize targets by exploiting properties in the late- time resonance<br />

induced by ultra-wide b<strong>and</strong> radar signals. A new variant of the Matrix Pencil Method algorithm is developed that identifies<br />

complex resonant frequencies present in the scattered signal. Kalman filters are developed to represent the dynamics of the<br />

signals scattered from several target types. The Multiple Model Adaptive Estimation algorithm uses the Kalman filters to<br />

recognize targets. The target recognition algorithm is shown to be successful in the presence of noise. The performance of the<br />

new algorithms is compared to that of previously published algorithms.<br />

DTIC<br />

Algorithms; Broadb<strong>and</strong>; Electromagnetic Scattering; Pulse Radar; Target Recognition<br />

20040111535 Kestrel Inst., Palo Alto, CA<br />

E-Merge-ANT: A Toolkit to Create Run-Time Autonomous Negotiating Teams (ANT) Generators, Aggregators, <strong>and</strong><br />

Synthesizers<br />

Fitzpatrick, Stephen; Green, Cordell; Jun. 2004; 63 pp.; In English; Original contains color illustrations<br />

Contract(s)/Grant(s): F30602-00-C-0014; DARPA ORDER-J123; Proj-J123<br />

Report No.(s): AD-A425550; AFRL-IF-RS-TR-2004-179; No Copyright; Avail: CASI; A04, Hardcopy<br />

This project addressed the problem of the real- time management of distributed resources. It developed an abstract<br />

263

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!