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 626 - 650 of 872

Extending Measurement Science to Interactive Visualization Environments

January 30, 2009
Author(s)
Judith E. Terrill, William L. George, Terence J. Griffin, John G. Hagedorn, John T. Kelso, Thomas M. Olano, Adele P. Peskin, Steven G. Satterfield, James S. Sims, Jeffrey W. Bullard, Joy P. Dunkers, Nicos Martys, Agnes A. O'Gallagher, Gillian Haemer
We describe a method for creating a visual laboratory to interactively measure and analyze scientific data. We move the normal activities that scientists perform to understand their data into the visualization environment. The visualization environment is

Local Bounds on Effective Hamiltonians for Stabilizer Codes

January 22, 2009
Author(s)
Stephen Bullock, Dianne M. O'Leary
This paper introduces various notion of k-locality of stabilizer codes inherited from the associated stabilizer groups. A choice of generators for the group leads to a Hamiltonian with the code in its groundspace, while a Hamiltonian holding the code in

Bifurcations, Center Manifolds, and Periodic Solutions

January 15, 2009
Author(s)
David E. Gilsinn
Nonlinear time delay differential equations are well known to have arisen in models in physiology, biology, and population dynamics. They have also arisen in models of metal cutting processes. Machine tool chatter, from a process called regenerative

An Interaction-based Test Sequence Generation Approach for Testing Web Applications

December 3, 2008
Author(s)
Wenhua Wang, Sreedevi Sampath, Yu Lei, Raghu N. Kacker
Web applications often use dynamic pages that interact with each other by accessing shared objects, e.g., session objects. Interactions between dynamic pages need to be carefully tested, as they may give rise to subtle faults that cannot be detected by

Quantum Simulations of Classical Annealing Processes

September 26, 2008
Author(s)
Rolando Somma, S. Boixo, Howard Barnum, Emanuel Knill
We describe a quantum algorithm that solves combinatorial optimization problems by quantum simulation of a classical simulated annealing process. Our algorithm exploits quantum walks and the quantum Zeno effect induced by evolution randomization. It

Comparison of statistical consistency and metrological consistency

September 6, 2008
Author(s)
Raghu N. Kacker, Ruediger Kessel, Klaus-Dieter Sommer, Xin Bian
The conventional concept of consistency in multiple evaluations of the same measurand is based on statistical error analysis. This concept is based on regarding the evaluations as realizations from sampling probability distributions of potential

Refining the In-Parameter-Order Strategy for Constructing Covering Arrrays

September 1, 2008
Author(s)
Michael Forbes, James F. Lawrence, Yu Lei, Raghu N. Kacker, D. Richard Kuhn
Covering arrays are structures for well-representing extremely large input spaces and are used to efficiently implement blackbox testing for software and hardware. This paper proposes refinements over the In-Parameter-Order strategy (for arbitrary $t$)

Grain Size Distribution in Two Dimensions in the Long Time Limit

July 8, 2008
Author(s)
Geoffrey B. McFadden, C.S. Pande, K.P. Cooper
It is shown that the inclusion of a "noise" term in the growth rate of individual grains leads to a stochastic model that provides a more realistic description of grain growth phenomenon. The resulting Fokker-Planck equation for the grain size distribution

Tight Bounds for the Multiplicative Complexity of Symmetric Functions

April 28, 2008
Author(s)
Joan Boyar, Rene Peralta
The multiplicative complexity of a Boolean function f is defined as the minimum number of binary conjunction (AND) gates required to construct a circuit representing f , when only exclusive-or, conjunction and negation gates may be used. This article