This paper deals with finding the approximation solution of a nonlinear parabolic boundary value problem (NLPBVP) by using the Galekin finite element method (GFEM) in space and Crank Nicolson (CN) scheme in time, the problem then reduce to solve a Galerkin nonlinear algebraic system(GNLAS). The predictor and the corrector technique (PCT) is applied here to solve the GNLAS, by transforms it to a Galerkin linear algebraic system (GLAS). This GLAS is solved once using the Cholesky method (CHM) as it appear in the matlab package and once again using the Cholesky reduction order technique (CHROT) which we employ it here to save a massive time. The results, for CHROT are given by tables and figures and show

This paper presents ABAQUS simulations of fully encased composite columns, aiming to examine the behavior of a composite column system under different load conditions, namely concentric, eccentric with 25 mm eccentricity, and flexural loading. The numerical results are validated with the experimental results obtained for columns subjected to static loads. A new loading condition with a 50 mm eccentricity is simulated to obtain additional data points for constructing the interaction diagram of load-moment curves, in an attempt to investigate the load-moment behavior for a reference column with a steel I-section and a column with a GFRP I-section. The result comparison shows that the experimental data align closely with the simulation

Background: Multidrug-resistant (MDR) enterococci have become a major problem in recent times and have been reported increasingly around the world. Lytic phages infect bacteria leading to rapid host death with limited risk of phage transduction, underlining the increasing interest in potential phage therapy in the future. Objective (s): The aim of this study is to use phage therapy as alternative approach for treatment of Enterococcus faecalis infections that recorded as MDR in Iraq to tackle this problem. Materials and Methods: Thirty E. faecalis isolates were collected from patients with different infectious diseases such as urinary tract infection (UTI), diabetic foot, septicemia, and wound infections. The isolation of specific l

Our recent work displays the successful preparation of Schiff_bases that carried out between hexane-2,5-dione and 2 moles of (Z)-3-hydrazineylideneindolin-2-one forming in Schiff-bases-(L), Which in turn allowed combining with each of the next metal ions: (M²⁺) = Ni, Mn, Zn, Cu and Co forming complexes_ in high stability. The formation of resulting Schiff_ bases (L) is detected spectrally using LC_Mss which gave approximately matching results with theoretical incomes, ¹HNMR proves the founding of doublet signal of (2H) for 2NH, FTIR indicates the occurrence of two interfered imine bands and UV-VIS mean is also indecates the formation of ligand. On the other hand, complexes-based-Schiff were characterized using the s

We studied the effect of certain environmental conditions for removing heavy metal elements from contaminated aqueous solutions (Cd, Cu, Pb, Fe, Zn, Ni, Cr) using the bacterium Bacillus subtilis to appoint the optimal conditions for removal ,The best optimum temperature range for two isolate was 30-35○C while the hydrogen number for the maximum mineral removal range was 6-7. The best primary mineral removal was 100 mg/L, while the maximum removal for all minerals was obtained after 6 hrs of Cu element time and the maximum removal efficiency was obtained after 24 hrs of Cu element. The results have proved that the best aeration for maximum removal was obtained at rotation speed of 150 rpm/minute. Inoculums of 5ml/100ml which contained 1

Multiplicative inverse in GF (2 m ) is a complex step in some important application such as Elliptic Curve Cryptography (ECC) and other applications. It operates by multiplying and squaring operation depending on the number of bits (m) in the field GF (2 m ). In this paper, a fast method is suggested to find inversion in GF (2 m ) using FPGA by reducing the number of multiplication operations in the Fermat's Theorem and transferring the squaring into a fast method to find exponentiation to (2 k ). In the proposed algorithm, the multiplicative inverse in GF(2 m ) is achieved by number of multiplications depending on log 2 (m) and each exponentiation is operates in a single clock cycle by generating a reduction matrix for high power of two ex