This research aims to test the ability of glass waste powder to adsorb cadmium from aqueous solutions. The glass wastes were collected from the Glass Manufacturing Factory in Ramadi. The effect of concentration and reaction time on sorption was tested through a series of laboratory experiments. Four Cd concentrations (20, 40, 60, and 80) as each concentration was tested ten times for 5, 10, 15, 20, 25, 30, 35, 40, 45, and 50 min. Solid (glass wastes) to liquid was 2g to 30ml was fixed in each experiment where the total volume of the solution was 30ml. The pH, total dissolved salts and electrical conductivity were measured at 30ºC. The equilibrium concentration was determined at 25 minutes, thereafter it was noted that the sorption

<span>We present the linearization of an ultra-wideband low noise amplifier (UWB-LNA) operating from 2GHz to 11GHz through combining two linearization methods. The used linearization techniques are the combination of post-distortion cancellation and derivative-superposition linearization methods. The linearized UWB-LNA shows an improved linearity (IIP3) of +12dBm, a minimum noise figure (NF_min.) of 3.6dB, input and output insertion losses (S₁₁ and S₂₂)  below -9dB over the entire working bandwidth, midband gain of 6dB at 5.8GHz, and overall circuit power consumption of 24mW supplied from a 1.5V voltage source. Both UWB-LNA and linearized UWB-LNA designs are

The main targets for using the edge detection techniques in image processing are to reduce the number of features and find the edge of image based-contents. In this paper, comparisons have been demonstrated between classical methods (Canny, Sobel, Roberts, and Prewitt) and Fuzzy Logic Technique to detect the edges of different samples of image's contents and patterns. These methods are tested to detect edges of images that are corrupted with different types of noise such as (Gaussian, and Salt and pepper). The performance indices are mean square error and peak signal to noise ratio (MSE and PSNR). Finally, experimental results show that the proposed Fuzzy rules and membership function provide better results for both noisy and noise-free

     Elliptic Curve Cryptography (ECC) is one of the public key cryptosystems that works based on the algebraic models in the form of elliptic curves. Usually, in ECC to implement the encryption, the encoding of data must be carried out on the elliptic curve, which seems to be a preprocessing step. Similarly, after the decryption a post processing step must be conducted for mapping or decoding the corresponding data to the exact point on the elliptic curves. The Memory Mapping (MM) and Koblitz Encoding (KE) are the commonly used encoding models. But both encoding models have drawbacks as the MM needs more memory for processing and the KE needs more computational resources. To overcome these issues the proposed enhanced Koblitz encodi

With simple and undirected connected graph Φ, the Schultz and modified Schultz polynomials are defined as  and , respectively, where the summation is taken over all unordered pairs of distinct vertices in V(Φ), where V(Φ) is the vertex set of Φ, degu  is the degree of vertex u and d(v,u) is the ordinary distance between v and u, u≠v. In this study, the Shultz distance, modified Schultz distance, the polynomial, index, and average for both have been generalized, and this generalization has been applied  to some special graphs.

In this paper, the effective computational method (ECM) based on the standard monomial polynomial has been implemented to solve the nonlinear Jeffery-Hamel flow problem. Moreover, novel effective computational methods have been developed and suggested in this study by suitable base functions, namely Chebyshev, Bernstein, Legendre, and Hermite polynomials. The utilization of the base functions converts the nonlinear problem to a nonlinear algebraic system of equations, which is then resolved using the Mathematica^®12 program. The development of effective computational methods (D-ECM) has been applied to solve the nonlinear Jeffery-Hamel flow problem, then a comparison between the methods has been shown. Furthermore, the maximum

In this paper, a robust invisible watermarking system for digital video encoded by MPEG-4 is presented. The proposed scheme provides watermark hidden by embedding a secret message (watermark) in the sprite area allocated in reference frame (I-frame). The proposed system consists of two main units: (i) Embedding unit and (ii) Extraction unit. In the embedding unit, the system allocates the sprite blocks using motion compensation information. The allocated sprite area in each I–frame is used as hosting area for embedding watermark data. In the extraction unit, the system extracts the watermark data in order to check authentication and ownership of the video. The watermark data embedding method is Blocks average modulation applied on RGB dom