Two distinct redistribution grids - adaptation techniques, spring analogy and elliptic grid generator are applied to two-dimensional steady, inviscid, shocked flows, and the ability of each technique is examined and compared. Euler equations are solved base on Roe's Reimann solver approach to simulate supersonic flow around a sphere, transonic flow about an airfoil and supersonic flow in a symm...

The generation of computational grids on surfaces of three-dimensional configurations is an important component of many areas of computational research, both as a boundary grid for volume grid generation or to perform computations on the surface. For reasons of computational efficiency, structured grids remain widely used in areas such as the computation of aerodynamic flows. Elliptic grid gene...

advanced metering infrastructure (ami) is a key part of the smart grid; thus, one of the most important concerns is to offer a secure mutual authentication.  this study focuses on communication between a smart meter and a server on the utility side. hence, a mutual authentication mechanism in ami is presented based on the elliptic curve cryptography (ecc) and one time signature (ots) consists o...

In the conventional structure of the wind turbines along with the doubly-fed induction generator (DFIG), the stator is directly connected to the power grid. Therefore, voltage changes in the grid result in severe transient conditions in the stator and rotor. In cases where the changes are severe, the generator will be disconnected from the grid and consequently the grid stability will be attenu...

We present a pseudo random bit generator whose security is based on the intractability of the discrete logarithm problem in the group E(Fp) of rational points on an elliptic curve over a finite prime field Fp. The bit generator is implemented within the framework of the Java Cryptography Architecture (JCA). It uses an elliptic curve E chosen such that both E(Fp) and its twist E (Fp) are of prim...

We consider a number of practical issues associated with the parallel distributed memory solution of elliptic partial diierential equations using unstructured meshes in two dimensions. The rst part of the paper describes a parallel mesh generation algorithm which is designed both for eeciency and to produce a well-partitioned, distributed mesh, suitable for the eecient parallel solution of an e...

In this short paper we propose a pseudorandom number generator over EC based on Pollardlike method. In contrast to the well known Elliptic Curve Random Number Generator (see e.g. ANSI and NIST draft standards) the generator is based on a random walk over the group of EC-points like in the original Pollard’s rho algorithm and only resembles a little bit the linear congruential generator over ell...