The urban Gentrification  is an inclusive global phenomenon to restructure the cities on the overall levels, the research to propose a specific study about the concept of urban Gentrification in the cities and showcasing its, specifications, and results, and how to deal with the variables that occur on cities through improvements as part of urban renewal projects, then the general axis of the research is shrinked, choosing the urban centers as the most important areas that deal with the urban Gentrification process due to its direct connection with indivisuals and social changes, and to process the specific axis of the research theses and studies will be showcased that discuss the topic in different research directions, and emerged

An experimental study on a KIA pride (SAIPA 131) car model with scale of 1:14 in the wind tunnel was made beside the real car tests. Some of the modifications to passive flow control which are (vortex generator, spoiler and slice diffuser) were added to the car to reduce the drag force which its undesirable characteristic that increase fuel consumption and exhaust toxic gases. Two types of calculations were used to determine the drag force acting on the car body. Firstly, is by the integrating the values of pressure recorded along the pressure taps (for the wind tunnel and the real car testing), secondly, is by using one component balance device (wind tunnel testing) to measure the force. The results show that, the avera

A submoduleA of amodule M is said to be strongly pure , if for each finite subset {ai} in A , (equivalently, for each a ?A) there exists ahomomorphism f : M ?A such that f(ai) = ai, ?i(f(a)=a).A module M is said to be strongly F–regular if each submodule of M is strongly pure .The main purpose of this paper is to develop the properties of strongly F–regular modules and study modules with the property that the intersection of any two strongly pure submodules is strongly pure .

To achieve safe security to transfer data from the sender to receiver, cryptography is one way that is used for such purposes. However, to increase the level of data security, DNA as a new term was introduced to cryptography. The DNA can be easily used to store and transfer the data, and it becomes an effective procedure for such aims and used to implement the computation. A new cryptography system is proposed, consisting of two phases: the encryption phase and the decryption phase. The encryption phase includes six steps, starting by converting plaintext to their equivalent ASCII values and converting them to binary values. After that, the binary values are converted to DNA characters and then converted to their equivalent complementary DN

The confirming of security and confidentiality of multimedia data is a serious challenge through the growing dependence on digital communication. This paper offers a new image cryptography based on the Chebyshev chaos polynomials map, via employing the randomness characteristic of chaos concept to improve security. The suggested method includes block shuffling, dynamic offset chaos key production, inter-layer XOR, and block 90 degree rotations to disorder the correlations intrinsic in image. The method is aimed for efficiency and scalability, accomplishing  complexity order for n-pixels over specific cipher rounds. The experiment outcomes depict great resistant to cryptanalysis attacks, containing statistical, differential and brut

Computer systems and networks are increasingly used for many types of applications; as a result the security threats to computers and networks have also increased significantly. Traditionally, password user authentication is widely used to authenticate legitimate user, but this method has many loopholes such as password sharing, brute force attack, dictionary attack and more. The aim of this paper is to improve the password authentication method using Probabilistic Neural Networks (PNNs) with three types of distance include Euclidean Distance, Manhattan Distance and Euclidean Squared Distance and four features of keystroke dynamics including Dwell Time (DT), Flight Time (FT), mixture of (DT) and (FT), and finally Up-Up Time (UUT). The resul

The cuneiform images need many processes in order to know their contents
and by using image enhancement to clarify the objects (symbols) founded in the
image. The Vector used for classifying the symbol called symbol structural vector
(SSV) it which is build from the information wedges in the symbol.
The experimental tests show insome numbersand various relevancy including
various drawings in online method. The results are high accuracy in this research,
and methods and algorithms programmed using a visual basic 6.0. In this research
more than one method was applied to extract information from the digital images
of cuneiform tablets, in order to identify most of signs of Sumerian cuneiform.

Abstract  

All central air conditioning systems contain piping system with various components, sizes, material, and layouts. If such systems in operating mode, the flow in piping system and its component such as valves can produce severe vibration due to some flow phenomenon’s. In this research, experimental measurements and numerical simulation are used to study the flow-induced vibration in valves. Computational fluid dynamics (CFD) concepts are included with one-way and two-way fluid-structure interaction concepts by using finite element software Package (ANSYS 14.57). Detection analysis is performed on flow characteristics under operation conditions and relations with structural vibration. Most of

Localization is an essential demand in wireless sensor networks (WSNs). It relies on several types of measurements. This paper focuses on positioning in 3-D space using time-of-arrival- (TOA-) based distance measurements between the target node and a number of anchor nodes. Central localization is assumed and either RF, acoustic or UWB signals are used for distance measurements. This problem is treated by using iterative gradient descent (GD), and an iterative GD-based algorithm for localization of moving sensors in a WSN has been proposed. To localize a node in 3-D space, at least four anchors are needed. In this work, however, five anchors are used to get better accuracy. In GD localization of a moving sensor, the algo