The concept of -closedness, a kind of covering property for topological spaces, has already been studied with meticulous care from different angles and via different approaches. In this paper, we continue the said investigation in terms of a different concept viz. grills. The deliberations in the article include certain characterizations and a few necessary conditions for the -closedness of a space, the latter conditions are also shown to be equivalent to -closedness in a - almost regular space. All these and the associated discussions and results are done with grills as the prime supporting tool.

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

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

Discrete Krawtchouk polynomials are widely utilized in different fields for their remarkable characteristics, specifically, the localization property. Discrete orthogonal moments are utilized as a feature descriptor for images and video frames in computer vision applications. In this paper, we present a new method for computing discrete Krawtchouk polynomial coefficients swiftly and efficiently. The presented method proposes a new initial value that does not tend to be zero as the polynomial size increases. In addition, a combination of the existing recurrence relations is presented which are in the n- and x-directions. The utilized recurrence relations are developed to reduce the computational cost. The proposed method computes app

In the present paper, a simply* compact spaces was introduced it defined over simply*- open set previous knowledge and we study the relation between the simply* separation axioms and the compactness, in addition to introduce a new types of functions known as 𝛼𝑆 𝑀∗ _irresolte , 𝛼𝑆 𝑀∗ __𝑐𝑜𝑛𝑡𝑖𝑛𝑢𝑜𝑢𝑠 and 𝑅 𝑆 𝑀∗ _ continuous, which are defined between two topological spaces.

Fibrewise topological spaces theory is a relatively new branch of mathematics, less than three decades old, arisen from algebraic topology. It is a highly useful tool and played a pivotal role in homotopy theory. Fibrewise topological spaces theory has a broad range of applications in many sorts of mathematical study such as Lie groups, differential geometry and dynamical systems theory. Moreover, one of the main objects, which is considered in fibrewise topological spaces theory is connectedness. In this regard, we of the present study introduce the concept of connected fibrewise topological spaces and study their main results.