In this paper we define and study new concepts of fibrewise topological spaces over B namely, fibrewise closure topological spaces, fibrewise wake topological spaces, fibrewise strong topological spaces over B. Also, we introduce the concepts of fibrewise w-closed (resp., w-coclosed, w-biclosed) and w-open (resp., w-coopen, w-biopen) topological spaces over B; Furthermore we state and prove several Propositions concerning with these concepts.

Abstract. This study gives a comprehensive analysis of the properties and interactions of fibrewise maximal and minimal topological spaces. Fibrewise topology extends classical topological concepts to structured spaces, providing a thorough understanding of spaces that vary across different dimensions. We study the basic theories, crucial properties, and characterizations of maximal and minimal fibrewise topological spaces. We investigate their role in different mathematical contexts and draw connections with related topological concepts. By providing exact mathematical formulations and comprehensive examples, this abstract advances the fields of topology and mathematical analysis by elucidating the unique properties and implications of fib

Here, we found an estimation of best approximation of unbounded functions which satisfied weighted Lipschitz condition with respect to convex polynomial by means of weighted Totik-Ditzian modulus of continuity

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.

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

The current study sheds light on the measurement and estimation of the radioactivity of radionuclides (²³⁸U, ²²⁶Ra, ²³²Th, and ⁴⁰k) in natural waters of different regions of Nineveh Governorate in Iraq.15 samples were collected from different sources of natural waters, where gamma-ray spectroscopy was used using NaI)TI) sodium iodide detector to determine the concentration of radioactivity in the samples. According to the results, the radioactivity concentration in the tested water sample were ​​ranged from 0.36 ± 0.04-1.57 ± 0.09with an average value of 0.69 ± 0.06 Bq/l for ²³⁸U, and 2.9 ± 0.02-0.88 ± 0.03 with an average value of 0.65 ± 0.03 Bq/l for ²²⁶Ra Bq/l

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

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