In this paper, we introduce a class of operators on a Hilbert space namely quasi-posinormal operators that contain properly the classes of normal operator, hyponormal operators, M–hyponormal operators, dominant operators and posinormal operators . We study some basic properties of these operators .Also we are looking at the relationship between invertibility operator and quasi-posinormal operator .

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

      was studied by taking several different values for the constant α and fixing the other three variables β, c and d with the values 25.58, -0.7142857, and -1.142, respectively. The purpose of this paper is to know the values by which the system transforms from a steady state to a chaotic state under the initial conditions x, y, and z that equal -1.6, 0 and 1.6 respectively. It was found that when the value of α is equal to 0, the Chua system is in a steady state, and when the value of α is equal to 9.5 and the wave is sinusoidal, the system is in oscillation, and when α is equal 13.4 the system is in a Quasi-chaotic state, and finally the system turns to the chaotic state when the value of α equals 15.0

This work presents a five-period chaotic system called the Duffing system, in which the effect of changing the initial conditions and system parameters d, g and w, on the behavior of the chaotic system, is studied. This work provides a complete analysis of system properties such as time series, attractors, and Fast Fourier Transformation Spectrum (FFT). The system shows periodic behavior when the initial conditions xi and yi equal 0.8 and 0, respectively, then the system becomes quasi-chaotic when the initial conditions xi and yi equal 0 and 0, and when the system parameters d, g and w equal 0.02, 8 and 0.09. Finally, the system exhibits hyperchaotic behavior at the first two conditions, 0 and 0, and the bandwidth of the chaotic

Multilevel models are among the most important models widely used in the application and analysis of data that are characterized by the fact that observations take a hierarchical form, In our research we examined the multilevel logistic regression model (intercept random and slope random model) , here the importance of the research highlights that the usual regression models calculate the total variance of the model and its inability to read variance and variations between levels ,however in the case of multi-level regression models, the calculation of  the total variance is inaccurate and therefore these models calculate the variations for each level of the model, Where the research aims to estimate the parameters of this m

    The paper starts with the main properties of the class of soft somewhere dense open functions and follows their connections with other types of soft open functions. Then preimages of soft sets with Baire property and images of soft Baire spaces under certain classes of soft functions are discussed. Some examples are presented that support the obtained results. Further properties of somewhere dense open functions related to different types of soft functions are found under some soft topological properties.

     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