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 351 - 375 of 872

The Decoupled Potential Integral Equation for Time-Harmonic Electromagnetic Scattering

May 28, 2015
Author(s)
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

Tower of Covering Arrays

April 25, 2015
Author(s)
Raghu N. Kacker, Jose Torres Jimenez
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

On the Stability of Rotating Drops

April 20, 2015
Author(s)
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 In Combinatorial Test Generation Using Forbidden Tuples

April 13, 2015
Author(s)
Raghu N. Kacker, David R. Kuhn, Yu Lei
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

Improving IPOGs Vertical Growth Based on a Graph Coloring Scheme

April 13, 2015
Author(s)
Raghu N. Kacker, David R. Kuhn, Yu Lei
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

The Multiplicative Complexity of Boolean Functions on Four and Five Variables

March 17, 2015
Author(s)
Meltem Sonmez Turan, Rene C. Peralta
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

Obtaining a Trapezoidal Distribution

March 9, 2015
Author(s)
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