The computation of compressible flows becomes more challenging when the Mach number has different orders of magnitude. When the Mach number is of order one, modern shock capturing methods are able to capture shocks and other complex structures with high numerical resolutions. However, if the Mach number is small, the acoustic waves lead to stiffness in time and exces-sively large numerical viscosity, thus demanding much smaller time step and mesh size than normally needed for incompressible flow simulation. In this paper, we develop an all-speed asymptotic preserving (AP) numerical scheme for the compressible isentropic Euler and Navier-Stokes equations that is uni-formly stable and accurate for all Mach numbers. Our idea is to split the system into two parts: one involves a slow, nonlinear and conservative hyper-bolic system adequate for the use of modern shock capturing methods, and the other a linear hyperbolic system which contains the stiff acoustic dynam-ics, to be solved implicitly. This implicit part is reformulated into a standard pressure Poisson projection system, and thus possesses sufficient structure for efficient fast Fourier transform solution techniques. In the zero Mach number limit, the scheme automatically becomes a projection method-like incompress-ible solver. We present numerical results in one and two dimensions in both compressible and incompressible regimes.

A geometric classification of the compact four-dimensional Einstein-Weyl manifolds with at least four-dimensional symmetry group is given. Our results also sharpen previous results on four-dimensional Einstein metrics and correct Parker's topological classification of cohomogeneity-one four-manifolds.

It is well known that the second-order cone and the circular cone have many analogous properties. In particular, there exists an important distance inequality associated with the second-order cone and the circular cone. The inequality indicates that the distances of arbitrary points to the second-order cone and the circular cone are equivalent, which is crucial in analyzing the tangent cone and normal cone for the circular cone. In this paper, we provide an alternative approach to achieve the aforementioned inequality. Although the proof is a bit longer than the existing one, the new approach offers a way to clarify when the equality holds. Such a clarification is helpful for further study of the relationship between the second-order cone programming problems and the circular cone programming problems.

We examine gravitational wave memory in the case where sources and detector are in an expanding cosmology. For simplicity, we treat the case where the cosmology is de Sitter spacetime, and discuss the possibility of generalizing our results to the case of a more realistic cosmology. We find results very similar to those of gravitational wave memory in an asymptotically flat spacetime, but with the magnitude of the effect multiplied by a redshift factor.

Though the Perturbed Matsumoto-Imai (PMI) cryptosystem is considered insecure due to the recent differential attack of Fouque, Granboulan, and Stern, even more recently Ding and Gower showed that PMI can be repaired with the Plus (+) method of externally adding as few as 10 randomly chosen quadratic polynomials. Since relatively few extra polynomials are added, the attack complexity of a Gröbner basis attack on PMI+ will be roughly equal to that of PMI. Using Magma’s implementation of the F 4 Gröbner basis algorithm, we attack PMI with parameters q = 2, 0 ≤ r ≤ 10, and 14 ≤ n ≤ 59. Here, q is the number of field elements, n the number of equations/variables, and r the perturbation dimension. Based on our experimental results, we give estimates for the running time for such an attack. We use these estimates to judge the security of some proposed schemes, and we suggest more efficient schemes. In particular, we estimate that an attack using F 4 against the parameters q = 2, r = 5, n = 96 (suggested in [7]) has a time complexity of less than 250 3-DES computations, which would be considered insecure for practical applications.