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.
SAGRAD, a Fortran 77 program for computing neural networks for classification using batch learning, is discussed. Neural network training in SAGRAD is based on a combination of simulated annealing and Møller's scaled conjugate gradient algorithm, the
This report summarizes the technical work of the Applied and Computational Sciences Division of NISTs Information Technology Laboratory. Part I (Overview) provides a high-level overview of the Divisions activities, including highlights of technical
A simple algorithm for averaging a stochastic sequence of 1D arrays in a moving, expanding window is provided. The samples are grouped in bins which increase exponentially in size so that a constant fraction of the samples is retained at any point in the
Felipe Vico, Leslie Greengard, Miguel Ferrando, Zydrunas Gimbutas
We present a new formulation for the problem of electromagnetic scattering from perfect electric conductors. While our representation for the electric and magnetic fields is based on the standard vector and scalar potentials A, φ in the Lorenz gauge, we
Allan Reiman, Antoine Cerfon, Geoffrey B. McFadden
In comparing equilibrium solutions for a DIII-D shot that is amenable to analysis by both stellarator and tokamak 3D equilibrium codes, a significant disagreement has been seen between solutions of the VMEC stellarator equilibrium code and solutions of
In this paper, we present a fast multipole method (FMM) for the half-space Green's function in a homogeneous elastic half-space subject to zero normal stress, for which an explicit solution was given by Mindlin (1936). The image structure of this Green's
Covering arrays are combinatorial objects that have several practical applications, specially in the design of experiments for software and hardware testing. A covering array CA(N;t,k,v) of strength t and order v is an N×k array over Z v with the property
Asha K. Nurse, Sam R. Coriell, Geoffrey B. McFadden
We consider the equilibrium and stability of rotating axisymmetric fluid drops by appealing to a variational principle that characterizes the equilibria as stationary states of a functional containing surface energy and rotational energy contributions
Constraint handling is a challenging problem in combinatorial test generation. In general, there are two ways to handle constraints, i.e., constraint solving and forbidden tuples. In our early work we proposed a constraint handling approach based on
In this paper, we show that the vertical growth phase of IPOG is optimal for t-way test generation when t = 2, but it is no longer optimal when t is greater than 2. We present an improvement that reduces the number of tests generated during vertical growth
A generic way to design lightweight cryptographic primitives is to construct simple rounds using small nonlinear components such as 4x4 S-boxes and use these iteratively (e.g., PRESENT and SPONGENT). In order to efficiently implement the primitive, optimal
James F. Lawrence, Raghu N. Kacker, Ruediger Kessel
Given a most believed value for a quantity together with upper and lower possible deviations from that value, a rectangular distribution might be used to represent state-of-knowledge about the quantity. If the deviations are themselves known by probability
We show that the strength of Internet-based network interconnectivity of countries is increasing over time. We then evaluate bounds on the extent to which a group of colluding countries can disrupt this connectivity. We evaluate the degree to which a group