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.
This report summarizes recent technical work of the Applied and Computational Sciences Division of the Information Technology Laboratory at the National Institute of Standards and Technology (NIST). Part I (Overview) provides a high-level overview of the
In the electronic measurement of the Boltzmann constant based on Johnson noise thermometry, the ratio of the power spectral densitiesof thermal noise across a resistor and pseudo-random noise synthetically generated by a quantum-accurate voltage-noise
Sean A. Colbert-Kelly, Geoffrey B. McFadden, Daniel Phillips, Jie Shen
In this paper, a numerical scheme for a generalized planar Ginzburg-Landau energy in a circular geometry is studied. A spectral-Galerkin method is utilized, and a stability analysis and an error estimate for the scheme are presented. It is shown that the
In this paper, we look at long arithmetic progressions on conics. By an arithmetic progression on a curve, we mean the existence of rational points on the curve whose x-coordinates are in arithmetic progression. We revisit arithmetic progressions on the
Magnus G. Find, Alexander Golovnev, Edward Hirsch, Alexander Kulikov
We consider Boolean circuits over the full binary basis. We prove a $(3+\frac{1}{86})n-o(n)$ lower bound on the size of such a circuit for an explicitly defined predicate, namely an affine disperser. This improves the $3n-o(n)$ bound of Norbert Blum (1984)
Previous studies have defined different types of software bugs based on their complexity and reproducibility. Simple bugs, which involve only direct factors and are often easy to reproduce, have been called Bohrbugs, while complex bugs, with at least one
Working over the field Q(t), Kihara constructed an elliptic curve with torsion group Z/4Z and five independent rational points, showing the rank is at least five. Following his approach, we give a new infinite family of elliptic curves with torsion group Z
Combined detection-estimation tasks are frequently encountered in medical imaging. Hence, optimal methods for joint detection and estimation are of interest because they provide upper bounds on observer performance and can motivate practical image analysis
Magnus G. Find, Mika Goos, Matti Jarvisalo, Petteri Kaski, Miko Koivisto, Janne Korhonen
Given a boolean n x n matrix A we consider arithmetic circuits for computing the transformation x 7! Ax over different semirings. Namely, we study three circuit models: monotone OR-circuits, monotone SUM-circuits (addition of non-negative integers), and
Raghu N. Kacker, David R. Kuhn, Jagan Chandrasekaran, Yu Lei
Debugging or fault localization is one of the most challenging tasks during software development. Automated fault localization tools have been developed to reduce the amount of effort and time software developers have to spend on debugging. In this paper
Curve registration problems in data analysis and com- puter vision can often be reduced to the problem of match- ing two functions defined on an interval. Dynamic Pro- gramming (DP) is an effective approach to solve this prob- lem. In this paper, we
Empirical studies have shown that most software interaction faults involve one or two variables interacting, with progressively fewer triggered by three or more, and no failure has been reported involving more than six variables interacting. This paper
Dustin Moody, Souradyuti Paul, Daniel C. Smith-Tone
A hash function secure in the indi fferentiability framework is able to resist all generic attacks. Such hash functions also play a crucial role in the security of the protocols that use hash functions as random functions. The rate of a hash mode is the
The stated mission of the Joint Committee for Guides in Metrology (JCGM) is to maintain and promote the use of the Guide to the Expression of Uncertainty in Measurement (GUM) and the International Vocabulary of Metrology (VIM, 2nd edition). The JCGM has
In a model of network communication based on a random walk in an undirected graph, what subset of nodes (subject to constraints on its size), enable the fastest spread of information? The dynamics of spread is described by a process dual to the movement
This report summarizes recent technical work of the Applied and Computational Sciences Division of the Information Technology Laboratory at the National Institute of Standards and Technology (NIST). Part I (Overview) provides a high-level overview of the
Lidong Chen, Stephen P. Jordan, Yi-Kai Liu, Dustin Moody, Rene C. Peralta, Ray A. Perlner, Daniel C. Smith-Tone
In recent years, there has been a substantial amount of research on quantum computers - machines that exploit quantum mechanical phenomena to solve mathematical problems that are difficult or intractable for conventional computers. If large-scale quantum
Dye-sensitized solar cells (DSCs) represent a viable means for harvesting solar energy to produce electrical power. Though a number of light harvesting dyes are in use, the search continues for more efficient and effective compounds to make commercially
The problem of optimally removing a set of vertices from a graph to minimize the size of the largest resultant component is known to be NP-complete. Prior work has provided near optimal heuristics with a high time complexity that function on up to hundreds
Recently, Gligoroski et al. proposed code-based encryption and signature schemes using list decoding, blockwise triangular private keys, and a nonuniform error pattern based on "generalized error sets." The general approach was referred to as "McEliece in
Given an undirected network, we describe a two- dimensional graphical measure based on the con- nected component distribution of its degree-limited subgraphs. This process yields an unambiguous vi- sual portrait which reveals important network proper- ties
Wenhua Wang, Sreedevi Sampath, Yu Lei, Raghu N. Kacker, D. Richard Kuhn, James F. Lawrence
Modelling a software system is often a challenging prerequisite to automatic test case generation. Modelling the navigation structure of a dynamic web application is particularly challenging because of the presence of a large number of pages that are
We explore the nature of glass-formation in variable spatial dimensionality (d) based on the generalized entropy theory, a synthesis of the Adam-Gibbs model with direct computation of the configurational entropy of polymer fluids using an established
When generating a random graph, if more structure is desired than is given in the popular Erd\H{o}s Renyi model, one method is to generate a degree sequence first then create a graph with this degree sequence. Blitzstein and Diaconis (among others)
The recently developed Flory-Huggins (FH) type general theory for competitive solvation of polymers by two mixed solvents is extended to explain phase boundaries and the variation of the solvent quality, as determined by the second osmotic virial coefficient