In this research article, an Iterative Decomposition Method is applied to approximate linear and non-linear fractional delay differential equation. The method was used to express the solution of a Fractional delay differential equation in the form of a convergent series of infinite terms which can be effortlessly computable.
The method requires neither discretization nor linearization. Solutions obtained for some test problems using the proposed method were compared with those obtained from some methods and the exact solutions. The outcomes showed the proposed approach is more efficient and correct.

This paper present the fast and robust approach of English text encryption and decryption based on Pascal matrix. The technique of encryption the Arabic or English text or both and show the result when apply this method on plain text (original message) and how will form the intelligible plain text to be unintelligible plain text in order to secure information from unauthorized access and from steel information, an encryption scheme usually uses a pseudo-random enecryption key generated by an algorithm. All this done by using Pascal matrix. Encryption and decryption are done by using MATLAB as programming language and notepad ++to write the input text.This paper present the fast and robust approach of English text encryption and decryption b

Here, we found an estimation of best approximation of unbounded functions which satisfied weighted Lipschitz condition with respect to convex polynomial by means of weighted Totik-Ditzian modulus of continuity

     The first step in this research is to find some of the necessary estimations in approximation by using certain algebraic polynomials, as well as we use certain specific points in approximation. There are many estimations that help to find the best approximation using algebraic polynomials and geometric polynomials. Throughout this research, we deal with some of these estimations to estimate the best approximation error using algebraic polynomials where the basic estimations in approximation are discussed and proven using algebraic polynomials that are discussed and proven using algebraic polynomials that are specified by the following points and  if   as well as if   .

  For the second step of the work, the estimatio

      In this paper we used Hosoya polynomial ofgroupgraphs Z_1,...,Z₂₆ after representing each group as  graph and using Dihedral group to"encrypt the plain texts with the immersion property which provided Hosoya polynomial to immerse the cipher text in another"cipher text to become very"difficult to solve.

A metal mandrel was designed for manufacturing the cathodes of high power electron tube ( Tetrode ) used in broadcasting transmitting tubes type TH558 and CQS200.The cathodes were manufactured in the present work from thoriated tungsten wires ( 2? ThO2- W) with different diameters .These cathodes were carbonized in sequences of processes to determine the carbonization parameters (temperature, pressure, time, current and voltage).Then the carbonized cathodes dimension were accurately measured to determine the deviation due to the high temperature distortion effect at about 1800°C .the distorted cathodes due to the carbonization process was treated when it was subjected inside the vacuum chamber and heat treated again .The carbonized cat

In this work, we give an identity that leads to establishing the operator . Also, we introduce the polynomials . In addition, we provide Operator proof for the generating function with its extension and the Rogers formula for . The generating function with its extension and the Rogers formula for the bivariate Rogers-Szegö polynomials  are deduced. The Rogers formula for  allows to obtain the inverse linearization formula for , which allows to deduce the inverse linearization formula for . A solution to a q-difference equation is introduced and the solution is expressed in terms of the operators . The q-difference method is used to recover an identity of the operator  and the generating function for the polynomials

The main aim of this paper is to apply a new technique suggested by Temimi and Ansari namely (TAM) for solving higher order Integro-Differential Equations. These equations are commonly hard to handle analytically so it is request numerical methods to get an efficient approximate solution. Series solutions of the problem under consideration are presented by means of the Iterative Method (IM). The numerical results show that the method is effective, accurate and easy to implement rapidly convergent series to the exact solution with minimum amount of computation. The MATLAB is used as a software for the calculations.           

LED is an ultra-lightweight block cipher that is mainly used in devices with limited resources. Currently, the software and hardware structure of this cipher utilize a complex logic operation to generate a sequence of random numbers called round constant and this causes the algorithm to slow down and record low throughput. To improve the speed and throughput of the original algorithm, the Fast Lightweight Encryption Device (FLED) has been proposed in this paper. The key size of the currently existing LED algorithm is in 64-bit & 128-bit but this article focused mainly on the 64-bit key (block size=64-bit). In the proposed FLED design, complex operations have been replaced by LFSR left feedback technology to make the algorithm perform more e