We define and study new ideas of fibrewise topological space namely fibrewise multi-topological space . We also submit the relevance of fibrewise closed and open topological space . Also fibrewise multi-locally sliceable and fibrewise multi-locally section able multi-topological space . Furthermore, we propose and prove a number of statements about these ideas. On the other hand, extend separation axioms of ordinary topology into fibrewise setting. The separation axioms are said to be fibrewise multi-T0. spaces, fibrewise multi-T1spaces, fibrewise multi-R0 spaces, fibrewise multi-Hausdorff spaces, fibrewise multi-functionally Hausdorff spaces, fibrewise multi-regular spaces, fibrewise multi-completely regular spaces, fibrewise multi-normal

Krawtchouk polynomials (KPs) and their moments are promising techniques for applications of information theory, coding theory, and signal processing. This is due to the special capabilities of KPs in feature extraction and classification processes. The main challenge in existing KPs recurrence algorithms is that of numerical errors, which occur during the computation of the coefficients in large polynomial sizes, particularly when the KP parameter (p) values deviate away from 0.5 to 0 and 1. To this end, this paper proposes a new recurrence relation in order to compute the coefficients of KPs in high orders. In particular, this paper discusses the development of a new algorithm and presents a new mathematical model for computing the

In this research is estimated the function of reliability dynamic of multi state systems  and their compounds and for three types of systems (serial, parallel, 2-out-of-3) and about two states (Failure and repair) depending on calculating the structur function allow to describing the behavior of

         Over the last few decades, many instructors have been trying all kinds of teaching methods, but without benefit. Nevertheless, in the 1986, a new technique is appeared which called K-W-L technique, it  is specified for reading comprehension passages because reading  skill is not easy matter for students for specific purposes (ESP).therefore, the K-W-L technique is a good one for thinking and experiences. To fulfill the aims and verify the hypothesis which reads as follows" it is hypothesized that there are no significant differences between the achievements of students who are taught according to K-W-L technique and those who are taught according to the traditional method

In this paper, an approximate solution of nonlinear two points boundary variational problem is presented. Boubaker polynomials have been utilized to reduce these problems into quadratic programming problem. The convergence of this polynomial has been verified; also different numerical examples were given to show the applicability and validity of this method.

Orthogonal polynomials and their moments serve as pivotal elements across various fields. Discrete Krawtchouk polynomials (DKraPs) are considered a versatile family of orthogonal polynomials and are widely used in different fields such as probability theory, signal processing, digital communications, and image processing. Various recurrence algorithms have been proposed so far to address the challenge of numerical instability for large values of orders and signal sizes. The computation of DKraP coefficients was typically computed using sequential algorithms, which are computationally extensive for large order values and polynomial sizes. To this end, this paper introduces a computationally efficient solution that utilizes the parall