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

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

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

    In this paper, we introduce the concept of s.p-semisimple module. Let S be a semiradical property, we say that a module M is s.p - semisimple if for every submodule N of M, there exists a direct summand K of M such that K ≤ N and N / K has S. we prove that a module M is s.p - semisimple module if and only if for every submodule A of M, there exists a direct summand B of M such that A = B + C and C has S. Also, we prove that for a module M is s.p - semisimple if and only if for every submodule A of M, there exists an idempotent e ∊ End(M) such that e(M) ≤ A and (1- e)(A) has S. 

We introduce the notion of t-polyform modules. The class of t- polyform modules contains the class of polyform modules and contains the class of t-essential quasi-Dedekind.

     Many characterizations of t-polyform modules are given. Also many connections between these class of modules and other types of modules are introduced.

     The current study primarily aims to develop a dictionary system for tracing mobile phone numbers for call centers of mobile communication companies. This system tries to save the numbers using a digital search tree in order to make the processes of searching and retrieving customers’ information easier and faster. Several shrubs that represent digits of the total phone numbers will be built through following the phone number digits to be added to the dictionary, with the owner name being at the last node in the tree. Thus, by such searching process, every phone number can be tracked digit-by-digit according to a required path inside its tree, until reaching the leaf. Then, the value stored in the node, that rep