MCA has gained a reputation for being a very useful statistical method for determining the association between two or more categorical variables and their graphical description. For performance this method, we must calculate the singular vectors through (SVD). Which is an important primary tool that allows user to construct a low-dimensional space to describe the association between the variables categories. As an alternative procedure to use (SVD), we can use the (BMD) method, which involves using orthogonal polynomials to reflect the structure of ordered categorical responses. When the features of BMD are combined with SVD, the (HD) is formed. The aim of study is to use alternative method of (MCA) that is appropriate with order

In the present paper, the concepts of a quasi-metric space, quasi-Banach space
have been introduced. We prove some facts which are defined on these spaces and
define some polynomials on quasi-Banach spaces and studied their dynamics, such
as, quasi cyclic and quasi hypercyclic. We show the existence of quasi chaotic in the
sense of Devaney (quasi D-chaotic) polynomials on quasi Banach space of qsummable
sequences lq , 0<q<1 such polynomials P is defined by P((xi)i)=(p(xi+m))i
where p:CC, p(0) = 0. In general we also prove that P is quasi chaotic in the sense
of Auslander and Yorke (quasi AY-chaotic) if and only if 0 belong to the Julia set of
p, mN. And then we prove that if the above polynomial P o

Based on analyzing the properties of Bernstein polynomials, the extended orthonormal Bernstein polynomials, defined on the interval [0, 1] for n=7 is achieved. Another method for computing operational matrices of derivative and integration D_b and R_(n+1)^B respectively is presented. Also the result of the proposed method is compared with true answers to show the convergence and advantages of the new method.

Orthogonal polynomials and their moments have significant role in image processing and computer vision field. One of the polynomials is discrete Hahn polynomials (DHaPs), which are used for compression, and feature extraction. However, when the moment order becomes high, they suffer from numerical instability. This paper proposes a fast approach for computing the high orders DHaPs. This work takes advantage of the multithread for the calculation of Hahn polynomials coefficients. To take advantage of the available processing capabilities, independent calculations are divided among threads. The research provides a distribution method to achieve a more balanced processing burden among the threads. The proposed methods are tested for va

In this paper, a computer simulation is implemented to generate of an optical aberration by means of Zernike polynomials. Defocus, astigmatism, coma, and spherical Zernike aberrations were simulated in a subroutine using MATLAB function and applied as a phase error in the aperture function of an imaging system. The studying demonstrated that the Point Spread Function (PSF) and Modulation Transfer Function (MTF) have been affected by these optical aberrations. Areas under MTF for different radii of the aperture of imaging system have been computed to assess the quality and efficiency of optical imaging systems. Phase conjugation of these types aberration has been utilized in order to correct a distorted wavefront. The results showed that

      The goal of this research is to better understand the physical features of starburst galaxies. Radio and X-ray observations are good for exploring the stuff within the central regions of galaxies.  A galaxy that is undergoing a strong star formation, usually in its central area, is known as a starburst galaxy. This paper provides the results of a statistical analysis of a sample of starburst galaxies. The data used in this research have been collected from NASA Extragalactic Database (NED), and HYPERLEDA. Those data have been used to examine possible luminosity correlations of X-ray to a radio of a sample of starburst galaxies. In this research, statistical software, known as statistic-win-program, has been used to investigat

There is an evidence that channel estimation in communication systems plays a crucial issue in recovering the transmitted data. In recent years, there has been an increasing interest to solve problems due to channel estimation and equalization especially when the channel impulse response is fast time varying Rician fading distribution that means channel impulse response change rapidly. Therefore, there must be an optimal channel estimation and equalization to recover transmitted data. However. this paper attempt to compare epsilon normalized least mean square (ε-NLMS) and recursive least squares (RLS) algorithms by computing their performance ability to track multiple fast time varying Rician fading channel with different values of Doppler