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.
In this paper we show that there are in nitely many pairs of integer isosceles triangles and integer parallelograms with a common (integral) area and common perimeter. We also show that there are in nitely many Heron triangles and integer rhombuses with
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