An official website of the United States government
Here’s how you know
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.
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
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
Effective visualizations can help researchers obtain a more complete understanding of high-level mathematical functions that arise in mathematics, statistics, physics, fluid dynamics and other fields of the mathematical and physical sciences. Accordingly
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 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
Instability of steady circular Couette flow with radial heating across a vertically oriented annulus with inner cylinder rotating and outer cylinder stationary is investigated using linear stability analysis. The convection regime base flow is developed
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