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 this research, we introduce and study the concept of fibrewise bitopological spaces. We generalize some fundamental results from fibrewise topology into fibrewise bitopological space. We also introduce the concepts of fibrewise closed bitopological spaces,(resp., open, locally sliceable and locally sectionable). We state and prove several propositions concerning with these concepts. On the other hand, we extend separation axioms of ordinary bitopology into fibrewise setting. The separation axioms we extend are called fibrewise pairwise T_0 spaces, fibrewise pairwise T_1 spaces, fibrewise pairwise R_0 spaces, fibrewise pairwise Hausdorff spaces, fibrewise pairwise functionally Hausdorff spaces, fibrewise pairwise regular spaces, fibrewise

In this paper, a fusion of K models of full-rank weighted nonnegative tensor factor two-dimensional deconvolution (K-wNTF2D) is proposed to separate the acoustic sources that have been mixed in an underdetermined reverberant environment. The model is adapted in an unsupervised manner under the hybrid framework of the generalized expectation maximization and multiplicative update algorithms. The derivation of the algorithm and the development of proposed full-rank K-wNTF2D will be shown. The algorithm also encodes a set of variable sparsity parameters derived from Gibbs distribution into the K-wNTF2D model. This optimizes each sub-model in K-wNTF2D with the required sparsity to model the time-varying variances of the sources in the s

The main objective of this work is to introduce and investigate fixed point (F. p) theorems for maps that satisfy contractive conditions in weak partial metric spaces (W.P.M.S), and give some new generalization of the fixed point theorems of Mathews and Heckmann. Our results extend, and unify a multitude of (F. p) theorems and generalize some results in (W.P.M.S). An example is given as an illustration of our results.

The basic concepts of some near open subgraphs, near rough, near exact and near fuzzy graphs are introduced and sufficiently illustrated. The Gm-closure space induced by closure operators is used to generalize the basic rough graph concepts. We introduce the near exactness and near roughness by applying the near concepts to make more accuracy for definability of graphs. We give a new definition for a membership function to find near interior, near boundary and near exterior vertices. Moreover, proved results, examples and counter examples are provided. The Gm-closure structure which suggested in this paper opens up the way for applying rich amount of topological facts and methods in the process of granular computing.