The physical behavior for the energy distribution function (EDF) of the reactant particles depending upon the gases (fuel) temperature are completely described by a physical model covering the global formulas controlling the EDF profile. Results about the energy distribution for the reactant system indicate a standard EDF, in which it’s arrive a steady state form shape and intern lead to fix the optimum selected temperature.

Urbanization led to significant changes in the properties of the land surface. That appends additional heat loads at the city, which threaten comfort and health of people. There is unclear understanding represent of the relationship between climate indicators and the features of the early virtual urban design. The research focused on simulation capability, and the affect in urban microclimate. It is assumed that the adoption of certain scenarios and strategies to mitigate the intensity of the UHI leads to the improvement of the local climate and reduce the impact of global warming. The aim is to show on the UHI methods simulation and the programs that supporting simulation and mitigate the effect UHI. UHI reviewed has been conducted the for

     Elliptic Curve Cryptography (ECC) is one of the public key cryptosystems that works based on the algebraic models in the form of elliptic curves. Usually, in ECC to implement the encryption, the encoding of data must be carried out on the elliptic curve, which seems to be a preprocessing step. Similarly, after the decryption a post processing step must be conducted for mapping or decoding the corresponding data to the exact point on the elliptic curves. The Memory Mapping (MM) and Koblitz Encoding (KE) are the commonly used encoding models. But both encoding models have drawbacks as the MM needs more memory for processing and the KE needs more computational resources. To overcome these issues the proposed enhanced Koblitz encodi

With simple and undirected connected graph Φ, the Schultz and modified Schultz polynomials are defined as  and , respectively, where the summation is taken over all unordered pairs of distinct vertices in V(Φ), where V(Φ) is the vertex set of Φ, degu  is the degree of vertex u and d(v,u) is the ordinary distance between v and u, u≠v. In this study, the Shultz distance, modified Schultz distance, the polynomial, index, and average for both have been generalized, and this generalization has been applied  to some special graphs.

  In this paper, we introduce and discuss an algorithm for the numerical solution of two- dimensional fractional dispersion equation.  The algorithm for the numerical solution of this equation is based on explicit finite difference approximation. Consistency, conditional stability, and convergence of this numerical method are described. Finally, numerical example is presented to show the dispersion behavior according to the order of the fractional derivative and we demonstrate that our explicit finite difference approximation is a computationally efficient method for solving two-dimensional fractional dispersion equation