In this paper, we present an approximate analytical and numerical solutions for the differential equations with multiple delay using the extend differential transform method (DTM). This method is used to solve many linear and non linear problems.

A new method based on the Touchard polynomials (TPs) was presented for the numerical solution of the linear Fredholm integro-differential equation (FIDE) of the first order and second kind with condition. The derivative and integration of the (TPs) were simply obtained. The convergence analysis of the presented method was given and the applicability was proved by some numerical examples. The results obtained in this method are compared with other known results.

This paper concentrates on employing the -difference equations approach to prove another generating function, extended generating function, Rogers formula and Mehler’s formula for the polynomials , as well as thegenerating functions of Srivastava-Agarwal type. Furthermore, we establish links between the homogeneous -difference equations and transformation formulas.

The aim of the research is to find out the methods of employing the : Infographics in the news sites due to the different communicative roles of the : Infographics . To achieve the research objective, the researcher used the survey method: the method of analyzing the content to analyze the : Infographics material from the selected sample of the news sites. What was said ? And how was it said? Through the design of a content analysis form that includes a number of studied analysis Infographics of the study.

     In this work, the methods (Moments, Modified Moments, L-Moments, Percentile, Rank Set sampling and Maximum Likelihood) were used to estimate the reliability function and the two parameters of the Transmuted Pareto (TP) distribution. We use simulation to generate the required data from three cases this indicates  sample size , and it replicates  for the real value for parameters, for reliability times values  we take .

Results were compared by using mean square error (MSE), the result appears as follows :

The best methods are Modified Moments, Maximum likelihood and L-Moments in first case, second case and third case respectively.

Wireless sensor applications are susceptible to energy constraints. Most of the energy is consumed in communication between wireless nodes. Clustering and data aggregation are the two widely used strategies for reducing energy usage and increasing the lifetime of wireless sensor networks. In target tracking applications, large amount of redundant data is produced regularly. Hence, deployment of effective data aggregation schemes is vital to eliminate data redundancy. This work aims to conduct a comparative study of various research approaches that employ clustering techniques for efficiently aggregating data in target tracking applications as selection of an appropriate clustering algorithm may reflect positive results in the data aggregati

In this paper, Touchard polynomials (TPs) are presented for solving Linear Volterra integral equations of the second kind (LVIEs-2k) and the first kind (LVIEs-1k) besides, the singular kernel type of this equation. Illustrative examples show the efficiency of the presented method, and the approximate numerical (AN) solutions are compared with one another method in some examples. All calculations and graphs are performed by program MATLAB2018b.

The main objective of this paper is to designed algorithms and implemented in the construction of the main program designated for the determination the tenser product of representation for the special linear group.

There are many tools and S/W systems to generate finite state automata, FSA, due to its importance in modeling and simulation and its wide variety of applications. However, no appropriate tool that can generate finite state automata, FSA, for DNA motif template due to the huge size of the motif template. In addition to the optional paths in the motif structure which are represented by the gap. These reasons lead to the unavailability of the specifications of the automata to be generated. This absence of specifications makes the generating process very difficult. This paper presents a novel algorithm to construct FSAs for DNA motif templates. This research is the first research presents the problem of generating FSAs for DNA motif temp