Skip to main content
U.S. flag

An official website of the United States government

Official websites use .gov
A .gov website belongs to an official government organization in the United States.

Secure .gov websites use HTTPS
A lock ( ) or https:// means you’ve safely connected to the .gov website. Share sensitive information only on official, secure websites.

Search Publications

Search Title, Abstract, Conference, Citation, Keyword or Author
  • Published Date
Displaying 701 - 725 of 872

Construction Object Identification from LADAR Scans: An Experimental Study Using I-Beams

December 15, 2005
Author(s)
David E. Gilsinn, Geraldine S. Cheok, Christoph J. Witzgall, Alan M. Lytle
Laser Scanning devices (LADAR for Laser Detection and Ranging) are used in construction projects to capture as-built data. They can rapidly generate large unstructured point clouds. This study describes an experiment in which an I-beam on a concrete floor

Uncertainties in Scaling Factors for Ab Intio Vibrational Frequencies

August 26, 2005
Author(s)
K Irikura, R Johnson, Raghu N. Kacker
The n-qubit concurrence canonical decomposition (CCD) is a generalization of the two-qubit canonical decomposition SU(4)=[SU(2) (x) SU(2)] ? [SU(2) (x) SU(2)], where ? is the commutative group which phases the maximally entangled Bell basis. A prequel

The Fast Fourier Transform for Experimentalists Part II: Convolutions

August 1, 2005
Author(s)
D Donnelly, Bert W. Rust
The discrete Fourier transform (DFT) is a widely used tool for the analysis of measured time series data. The Cooley-Tukey fast Fourier transform (FFT) algorithm gives an extremely fast and efficient implementation of the DFT. This is the first of a series

The Fast Fourier Transform for Experimentalists, Part I: Concepts

April 1, 2005
Author(s)
D Donnelly, Bert W. Rust
The discrete Fourier transform (DFT) is a widely used tool for the analysis of measured time series data. The Cooley-Tukey fast Fourier transform (FFT) algorithm gives an extremely fast and efficient implementation of the DFT. This is the first of a series