The aim of this work is to develop an axi-symmetric two dimensional model based on a coupled simplified computational fluid dynamics (CFD) and Lagrangian method to predict the air flow patterns and drying of particles.  Then using this predictive tool to design more efficient spray dryers. The approach to this is to model what particles experience in the drying chamber with respect to air temperature and humidity. These histories can be obtained by combining the particles trajectories with the air temperature/humidity pattern in the spray dryer. Results are presented and discussed in terms of the air velocity, temperature, and humidity profiles within the chambers and compared for drying of a 42.5% solids solution in a spray chamber

Electrocoagulation is an electrochemical process of treating polluted water where sacrificial anode corrodes to produce active coagulant (usually aluminum or iron cations) into solution. Accompanying electrolytic reactions evolve gas (usually as hydrogen bubbles). The present study investigates the removal of phenol from water by this method. A glass tank with 1 liter volume and two electrodes were used to perform the experiments. The electrode connected to a D.C. power supply. The effect of various factors on the removal of phenol (initial phenol concentration, electrode size, electrodes gab, current density, pH and treatment time) were studied. The results indicated that the removal efficiency decreased as initial phenol concentration

Image compression is very important in reducing the costs of data storage transmission in relatively slow channels. Wavelet transform has received significant attention because their multiresolution decomposition that allows efficient image analysis. This paper attempts to give an understanding of the wavelet transform using two more popular examples for wavelet transform, Haar and Daubechies techniques, and make compression between their effects on the image compression.

        The set of all (n×n) non-singular matrices over the field F. And this set forms a group under the operation of matrix multiplication. This group is called the general linear group of dimension  over the field F, denoted by . The determinant of these matrices is a homomorphism from  into F* and the kernel of this homomorphism was the special linear group and denoted by  Thus  is the subgroup of  which contains all matrices of determinant one.

The rationally valued characters of the rational representations are written as a linear combination of the induced characters for the groups discussed in this paper. We find the Artin indicator for this group after studying the rationally valued characters of the rational

A new approach for baud time (or baud rate) estimation of a random binary signal is presented. This approach utilizes the spectrum of the signal after nonlinear processing in a way that the estimation error can be reduced by simply increasing the number of the processed samples instead of increasing the sampling rate. The spectrum of the new signal is shown to give an accurate estimate about the baud time when there is no apriory information or any restricting preassumptions. The performance of the estimator for random binary square waves perturbed by white Gaussian noise and ISI is evaluated and compared with that of the conventional estimator of the zero crossing detector.

The set of all (n×n) non-singular matrices over the field F this set forms a group under the operation of matrix multiplication. This group is called the general linear group of dimension  over the field F, denoted by . The determinant of these matrices is a homomorphism from  into F* and the kernel of this homomorphism was the special linear group and denoted by  Thus  is the subgroup of  which contains all matrices of determinant one.

The rational valued characters of the rational representations written as a linear combination of the induced characters for the groups  discuss in this paper and find the Artin indicator for this group after study the rational valued characters of the rational representations and the induce

The objective of this work is to design and implement a cryptography system that enables the sender to send message through any channel (even if this channel is insecure) and the receiver to decrypt the received message without allowing any intruder to break the system and extracting the secret information. This work modernize the feedforward neural network, so the secret message will be encrypted by unsupervised neural network method to get the cipher text that can be decrypted using the same network to get the original text. The security of any cipher system depends on the security of the related keys (that are used by the encryption and the decryption processes) and their corresponding lengths. In this work, the key is the final weights

          Web application protection lies on two levels: the first is the responsibility of the server management, and the second is the responsibility of the programmer of the site (this is the scope of the research).  This research suggests developing a secure web application site based on three-tier architecture (client, server, and database). The security of this system described as follows: using multilevel access by authorization, which means allowing access to pages depending on authorized level; password encrypted using Message Digest Five (MD5) and salt. Secure Socket Layer (SSL) protocol authentication used. Writing PHP code according to set of rules to hide source code to ensur

In this paper, we prove that our proposed localization algorithm named Improved
Accuracy Distribution localization for wireless sensor networks (IADLoc) [1] is the
best when it is compared with the other localization algorithms by introducing many
cases of studies. The IADLoc is used to minimize the error rate of localization
without any additional cost and minimum energy consumption and also
decentralized implementation. The IADLoc is a range free and also range based
localization algorithm that uses both type of antenna (directional and omnidirectional)
it allows sensors to determine their location based on the region of
intersection (ROI) when the beacon nodes send the information to the sink node and
the la