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.
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
Pepe Torres Jimenez, Nelson Rangel-Valdez, Raghu N. Kacker, James F. Lawrence
Packing functions (PFs) are bijections between a set of m-dimensional vectors V over N m and nonnegative integers N. PFs have several applications, e.g. in partitioning schemes or text compression. Two important categories of PFs are diagonal polynomials
James Shook, Michael Ferrara, Jennifer Diemunsch, Sogol Jahanbekam
A sequence $\pi=(d_1,\ldots,d_n)$ is graphic if there is a simple graph $G$ with vertex set $\{v_1,\ldots,v_n\}$ such that the degree of $v_i$ is the $i$th entry of $\pi$. We say that graphic sequences $\pi_1=(d_1^{(1)},\ldots,d_n^{(1)})$ and $\pi_2=(d_1^{
Magnus G. Find, Daniel C. Smith-Tone, Meltem Sonmez Turan
Multiplicative complexity is a complexity measure, which is defined as the minimum number of AND gates required to implement a given primitive by a circuit over the basis (AND, XOR, NOT), with an unlimited number of NOT and XOR gates. Implementations of
Asha K. Nurse, Sean A. Colbert-Kelly, Sam R. Coriell, Geoffrey B. McFadden
Motivated by recent investigations of toroidal tissue clusters that are observed to climb conical obstacles after self-assembly, we study a related problem of the determination of the equilibrium and stability of axisymmetric drops on a conical substrate
We consider the multiplicative complexity of Boolean functions with multiple bits of output, studying how large a multiplicative complexity is necessary and sufficient to provide a desired nonlinearity. For so-called $\Sigma\Pi\Sigma$ circuits, we show
Random numbers are essential for cryptography. In most real-world systems, these values come from a cryptographic pseudorandom number generator (PRNG), which in turn is seeded by an entropy source. The security of the entire cryptographic system then
For many shape analysis problems in computer vision and scientific imaging (e.g., computational anatomy, morphological cytometry), the ability to align two closed curves in the plane is crucial. In this paper, we concentrate on rigidly aligning pairs of
Isogenies are the morphisms between elliptic curves, and are accordingly a topic of interest in the subject. As such, they have been well-studied, and have been used in several cryptographic applications. Vélu's formulas show how to explicitly evaluate an
The numerical computation of ill-posed, nonlinear, multidimensional initial value problems presents considerable difficulties. Conventional stepwise marching schemes for such problems, whether explicit or implicit, are necessarily unconditionally unstable
Mathematical Information Retrieval concerns retrieving information related to a particular mathematical concept. The NTCIR-11 Math Task develops an evaluation test collection for document sections retrieval of scientific articles based on human generated
This paper analyzes an effective technique for stabilizing pure explicit time differencing in the numerical computation of multidimensional nonlinear parabolic equations. The method uses easily synthesized linear smoothing operators at each time step to
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