This  research deals with the form of the physical identity which is concerned with the features and characteristics that distinguish the shape of the city from other existing cities and reveal its similarity with the self (itself) and objective difference with others.  Accordingly, these features must be sophisticated and variable resulting the shape of the city, while preserving the continuity of time, and eventually leads to the emergence of the whole shape. Physical identity is conceptually equivalent with the terms "personality" and "sense of place".  The research determined the criteria for evaluating the physical identity as follows:              

The areas surrounding Iraqi international airports generally suffer from a lack of interest in their planning in a manner compatible with the airport with the absence of integrated planning between the airport and the city. From here, the search problem appears. It is represented by a lack of interest in the integration of urban planning and airport planning and the lack of a clear policy to deal with the areas surrounding international airports. A desire to achieve the research aims to introduce compatible uses in the vicinity of airports and review the planning and global directions for dealing with the areas surrounding the airports within urban areas. In contrast, the second aspect of the research aims to assess the

The High Modulus Asphalt Concrete Mixture (HMACM) or (EME) (Enrobes a Module Eleve) developed in France, since, 1980 by Laboratories Central des Ponts et Chaussees (LCPC). Due to the increasing in traffic intensity and axle loading this type of mixing were suitable for pavement subjected to heavy duty. Experiments showed that EME mixtures have an excellent moisture damage resistance permanent deformation, fatigue cracking and reducing costs of maintenance and a significant reduction in thickness of pavement. Because of the high stiffness of EME mixes, the stresses transformed to the bottom laid layer by repeated traffic wheel loads were reduced effectively. This study intend to focus the light into the possibility of producing asphalt mixtu

Orthogonal polynomials and their moments have significant role in image processing and computer vision field. One of the polynomials is discrete Hahn polynomials (DHaPs), which are used for compression, and feature extraction. However, when the moment order becomes high, they suffer from numerical instability. This paper proposes a fast approach for computing the high orders DHaPs. This work takes advantage of the multithread for the calculation of Hahn polynomials coefficients. To take advantage of the available processing capabilities, independent calculations are divided among threads. The research provides a distribution method to achieve a more balanced processing burden among the threads. The proposed methods are tested for va

Was expanded display high reflectivity of the spectral remote infrared (m j 14-8) adoption order Alcolmtin ????????? thickness optical northeastern quarter wavelength and compared with results of previous studies based Aldrashalhalah on Ndharah matrix distinctive amended and fall of light close to the vertical arrangement multilayer materials buffer and in thin films homogeneous and uniform properties deposited on germanium basis results showed that the best choice for governments and their kills to expand bandwidth high reflectivity is much easier for the infrared than the area visible in addition to the order of these stacks is the cornerstone of the filters other visual...

Discrete Krawtchouk polynomials are widely utilized in different fields for their remarkable characteristics, specifically, the localization property. Discrete orthogonal moments are utilized as a feature descriptor for images and video frames in computer vision applications. In this paper, we present a new method for computing discrete Krawtchouk polynomial coefficients swiftly and efficiently. The presented method proposes a new initial value that does not tend to be zero as the polynomial size increases. In addition, a combination of the existing recurrence relations is presented which are in the n- and x-directions. The utilized recurrence relations are developed to reduce the computational cost. The proposed method computes app