In the present study, a low cost adsorbent is developed from the naturally available sawdust
which is biodegradable. The removal capacity of chromium(VI) from the synthetically prepared
industrial effluent of electroplating and tannery industrial is obtained.
Two modes of operation are used, batch mode and fixed bed mode. In batch experiment the
effect of Sawdust dose (4- 24g/L) with constant initial chromium(VI) concentration of 50 mg/L and
constant particle size less than1.8 mm were studied.
Batch kinetics experiments showed that the adsorption rate of chromium(VI) ion by Sawdust
was rapid and reached equilibrium within 120 min. The three models (Freundlich, Langmuir and
Freundlich-Langmuir) were fitted to experimental data and the goodness of their fit for adsorption
was compared. In the fixed bed isothermal adsorption column, the effect of particle size (dp) (1.09-
1.8) mm, influent flow rate (Q) (1- 4) L/hr, bed depth (H) (25- 35) cm and the pH(1-7)of the
solution were studied .The results show that Sawdust is an efficient adsorbent for the removal of
Cr(VI) from wastewater. Percent removal of chromium reaches (100%) with increasing of contact
time and decreasing the pH.UV- Spectrophotometer was used to determine the metal ion
concentration
The present research was conducted to reduce the sulfur content of Iraqi heavy naphtha by adsorption using different metals oxides over Y-Zeolite. The Y-Zeolite was synthesized by a sol-gel technique. The average size of zeolite was 92.39 nm, surface area 558 m2/g, and pore volume 0.231 cm3/g. The metals of nickel, zinc, and copper were dispersed by an impregnation method to prepare Ni/HY, Zn/HY, Cu/HY, and Ni + Zn /HY catalysts for desulfurization. The adsorptive desulfurization was carried out in a batch mode at different operating conditions such as mixing time (10,15,30,60, and 600 min) and catalyst dosage (0.2,0.4,0.6,0.8,1, and 1.2 g). The most of the sulfur compounds were removed at 10 min for all catalyst ty
... Show MoreIn Automatic Speech Recognition (ASR) the non-linear data projection provided by a one hidden layer Multilayer Perceptron (MLP), trained to recognize phonemes, and has previous experiments to provide feature enhancement substantially increased ASR performance, especially in noise. Previous attempts to apply an analogous approach to speaker identification have not succeeded in improving performance, except by combining MLP processed features with other features. We present test results for the TIMIT database which show that the advantage of MLP preprocessing for open set speaker identification increases with the number of speakers used to train the MLP and that improved identification is obtained as this number increases beyond sixty.
... Show MoreIn this paper, a subspace identification method for bilinear systems is used . Wherein a " three-block " and " four-block " subspace algorithms are used. In this algorithms the input signal to the system does not have to be white . Simulation of these algorithms shows that the " four-block " gives fast convergence and the dimensions of the matrices involved are significantly smaller so that the computational complexity is lower as a comparison with " three-block " algorithm .
The purpose of this research is to enhance the role of organizational communication in organizations using IT technologies. The results showed that there is a strong relationship with information technology technologies in enhancing the role of organizational communication, which in turn helps to improve the performance of organizations in general
Steganography is the art of secret communication. Its purpose is to hide the presence of information, using, for example, images as covers. The frequency domain is well suited for embedding in image, since hiding in this frequency domain coefficients is robust to many attacks. This paper proposed hiding a secret image of size equal to quarter of the cover one. Set Partitioning in Hierarchal Trees (SPIHT) codec is used to code the secret image to achieve security. The proposed method applies Discrete Multiwavelet Transform (DMWT) for cover image. The coded bit stream of the secret image is embedded in the high frequency subbands of the transformed cover one. A scaling factors ? and ? in frequency domain control the quality of the stego
... Show MoreThe 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. In this work, we implement an interaction between the feedforward neural network and the stream cipher, so the secret message will be encrypted by unsupervised neural network method in addition to the first encryption process which is performed by the stream cipher method. 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 le
... Show Morein this paper we adopted ways for detecting edges locally classical prewitt operators and modification it are adopted to perform the edge detection and comparing then with sobel opreators the study shows that using a prewitt opreators
A LiF (TLD-700) PTFED disc has adiameter of (13mm) and thickness of (0.4mm) for study the response and sensetivity of this material for gamma and beta rays by using (TOLEDO) system from pitman company. In order to calibrate the system and studying the calibration factor. Discs were irradiated for Gamma and Beta rays and comparing with the theoretical doses. The exposure range is between 15×10-2 mGy to 1000×10-2 mGy. These doses are within the range of normal radiation field for workers.
This paper introduces a relation between resultant and the Jacobian determinant
by generalizing Sakkalis theorem from two polynomials in two variables to the case of (n) polynomials in (n) variables. This leads us to study the results of the type: , and use this relation to attack the Jacobian problem. The last section shows our contribution to proving the conjecture.