Background and Aim: due to the rapid growth of data communication and multimedia system applications, security becomes a critical issue in the communication and storage of images. This study aims to improve encryption and decryption for various types of images by decreasing time consumption and strengthening security. Methodology: An algorithm is proposed for encrypting images based on the Carlisle Adams and Stafford Tavares CAST block cipher algorithm with 3D and 2D logistic maps. A chaotic function that increases the randomness in the encrypted data and images, thereby breaking the relation sequence through the encryption procedure, is introduced. The time is decreased by using three secure and private S-Boxes rather than using si

The issue of increasing the range covered by a wireless sensor network with restricted sensors is addressed utilizing improved CS employing the PSO algorithm and opposition-based learning (ICS-PSO-OBL). At first, the iteration is carried out by updating the old solution dimension by dimension to achieve independent updating across the dimensions in the high-dimensional optimization problem. The PSO operator is then incorporated to lessen the preference random walk stage's imbalance between exploration and exploitation ability. Exceptional individuals are selected from the population using OBL to boost the chance of finding the optimal solution based on the fitness value. The ICS-PSO-OBL is used to maximize coverage in WSN by converting r

 A simulation study is used to examine the robustness of some estimators on a multiple linear regression model with problems of multicollinearity and non-normal errors, the Ordinary least Squares (LS) ,Ridge Regression, Ridge Least Absolute Value (RLAV), Weighted Ridge (WRID), MM and a robust ridge regression estimator MM estimator, which denoted as RMM this is the modification of the Ridge regression by incorporating robust MM estimator . finialy, we show that RMM is the best among the other estimators

Pot experiment was carried out at the College of Agriculture – Baghdad University during autumn season, 2007. Thirteen treatments were formulated to evaluate the effectiveness of four applications of Phosphorus (0, 60, 60×2 and 120 Kg P. h-1) and three applications of Zinc (0, 25×2 mg Zn. L-1 and 50 mg Zn. Kg soil-1) along with inoculating seeds of bean with strains mixture 889 and 1865 and non-inoculated treatment, on nodulation, yield and protein content in seeds (N%). The results showed that inoculated plants exceeded on non-inoculated one in all the studied characteristics. While, P and Zn, applications at the rate of 60×2 kg/ha and 25×2 mg/L respectively, significantly, increased, nodulation, yield, protein content in se

Background: The type of dental implant surface is one of many factors that determine the success of implant restoration. This study aimed to study the effect of mixture of nano titanium oxide with nanohydroxyapatite coating of screw shaped CPTi dental implant on bond strength at bone implant interface by torque removal test related to two healing periods (2 and 6 weeks). Materials and methods: Dip coating process was performed to get an even coating layer on CPTi screws. X-ray diffraction (XRD) analysis and microscopical examination were performed on the coating surfaces of the CPTi. The tibia of 10 white New Zealand rabbits was chosen as implantation sites. The tibia of each rabbit received two screws, one was coated with mixture of nanoT

Root-finding is an oldest classical problem, which is still an important research topic, due to its impact on computational algebra and geometry. In communications systems, when the impulse response of the channel is minimum phase the state of equalization algorithm is reduced and the spectral efficiency will improved. To make the channel impulse response minimum phase the prefilter which is called minimum phase filter is used, the adaptation of the minimum phase filter need root finding algorithm. In this paper, the VHDL implementation of the root finding algorithm introduced by Clark and Hau is introduced.
VHDL program is used in the work, to find the roots of two channels and make them minimum phase, the obtained output results are

There has been a growing interest in the use of chaotic techniques for enabling secure communication in recent years. This need has been motivated by the emergence of a number of wireless services which require the channel to provide very low bit error rates (BER) along with information security. As more and more information is transacted over wireless media, there has been increasing criminal activity directed against such systems. This paper investigates the feasibility of using chaotic communications over Multiple-Input-Multiple-Output (MIMO) channels. We have studied the performance of differential chaos shift keying (DCSK) with 2×2 Alamouti scheme and 2×1 Alamouti scheme for different chaotic maps over additive white Gaussian noise (

In this work the diode planer magnetron sputtering device was
designed and fabricated. This device consists of two aluminum discs
(8cm) diameter and (5mm) thick. The distance between the two
electrodes is 2cm, 3cm, 4cm and 5cm.
Design and construction a double probe of tungsten wire with
(0.1mm) diameter and (1.2mm) length has been done to investigate
electron temperature, electron and ion density under different
distances between cathode and anode. The probes were situated in
the center of plasma between anode and cathode.
The results of this work show that, when the distance between
cathode and anode increased, the electron temperature decreased.
Also, the electron density increases with the increasing

There are many methods of searching large amount of data to find one particular piece of information. Such as find name of person in record of mobile. Certain methods of organizing data make the search process more efficient the objective of these methods is to find the element with least cost (least time). Binary search algorithm is faster than sequential and other commonly used search algorithms. This research develops binary search algorithm by using new structure called Triple, structure in this structure data are represented as triple. It consists of three locations (1-Top, 2-Left, and 3-Right) Binary search algorithm divide the search interval in half, this process makes the maximum number of comparisons (Average case com