An Algebraic Study of Shock Structure

Coordinated Science Laboratory was formerly known as Control Systems LaboratoryJoint Services Electronics Programs / DA 28 043 AMC 00073(E

Initial Behavior of the Pseudo-Shock

Coordinated Science Laboratory was formerly known as Control Systems LaboratoryJoint Services Electronics Program / DA 28 043 AMC 00073(E)ONR N00014-66-C0010-A0

Nonlinear Solutions of the Wigley Hull

Coordinated Science Laboratory was formerly known as Control Systems LaboratoryOffice of Naval Research / N00014-80-C-0740 (NR334-004

On the Accuracy of Approximate Solutions of the Boltzmann Equation

Coordinated Science Laboratory was formerly known as Control Systems LaboratoryJoint Services Electronics Program / DA 28 043 AMC 00073(E)Office of Naval Research / ONR N00014-66-C0010-A0

Implementation of Finite Difference Schemes of Solving Fluid Dynamic Problems on ILLIAC IV

Coordinated Science Laboratory was formerly known as Control Systems LaboratoryOffice of Naval Research / ONR-N00014-67-A-0305-001

Numerical Studies of the Non-Linear Boltzmann Equation: Part II: Studies of New Techniques of Error Reduction

Coordinated Science Laboratory was formerly known as Control Systems LaboratoryJoint Services Electronics Program / DAAB-07-67-C-0199Office of Naval Research / N00014-67-A-0305-000

Fast multi-computations with integer similarity strategy

Abstract. Multi-computations in finite groups, such as multiexponentiations and multi-scalar multiplications, are very important in ElGamallike public key cryptosystems. Algorithms to improve multi-computations can be classified into two main categories: precomputing methods and recoding methods. The first one uses a table to store the precomputed values, and the second one finds a better binary signed-digit (BSD) representation. In this article, we propose a new integer similarity strategy for multi-computations. The proposed strategy can aid with precomputing methods or recoding methods to further improve the performance of multi-computations. Based on the integer similarity strategy, we propose two efficient algorithms to improve the performance for BSD sparse forms. The performance factor can be improved from 1.556 to 1.444 and to 1.407, respectively

Realistic Equations of State for the Primeval Universe

Early universe equations of state including realistic interactions between constituents are built up. Under certain reasonable assumptions, these equations are able to generate an inflationary regime prior to the nucleosynthesis period. The resulting accelerated expansion is intense enough to solve the flatness and horizon problems. In the cases of curvature parameter \kappa equal to 0 or +1, the model is able to avoid the initial singularity and offers a natural explanation for why the universe is in expansion.Comment: 32 pages, 5 figures. Citations added in this version. Accepted EPJ