This paper is devoted to introduce weak and strong forms of fibrewise fuzzy ω-topological spaces, namely the fibrewise fuzzy -ω-topological spaces, weakly fibrewise fuzzy -ω-topological spaces and strongly fibrewise fuzzy -ω- topological spaces. Also, Several characterizations and properties of this class are also given as well. Finally, we focused on studying the relationship between weakly fibrewise fuzzy -ω-topological spaces and strongly fibrewise fuzzy -ω-topological spaces.

Abstract This paper is devoted to introduce weak and strong forms of fibrewise fuzzy u-topological spaces, namely the fibrewise fuzzy q-u-topological spaces, weakly fibrewise fuzzy q-u-topological spaces and strongly fibrewise fuzzy q-utopological spaces. Also, Several characterizations and properties of this class are also given as well. Finally, we focused on studying the relationship between weakly fibrewise fuzzy q-u-topological spaces and strongly fibrewise fuzzy q-utopological spaces.

This study rigorously investigates three 3d transition metal carbide (TMC) structures via LDA and GGA approximations. It examines cohesive energy (Ecoh), Vickers hardness (Hv), mechanical stability, and electronic properties. Notably, most 3d TMCs exhibit higher cohesive energy than nitrides, and rs-TiC demonstrates a Vickers hardness of 25.66 GPa, outperforming its nitride counterpart. The study employs theoretical calculations to expedite research, revealing mechanical stability in CrC and MnC (GGA) and CrC (LDA in cc structure), while all 3d TMCs in rs and seven in zb structures show stability. Charge transfer and bonding analysis reveal enhanced covalency along the series, influenced by the interplay between p orbitals of carbon and d o

In this paper, Touchard polynomials (TPs) are presented for solving Linear Volterra integral equations of the second kind (LVIEs-2k) and the first kind (LVIEs-1k) besides, the singular kernel type of this equation. Illustrative examples show the efficiency of the presented method, and the approximate numerical (AN) solutions are compared with one another method in some examples. All calculations and graphs are performed by program MATLAB2018b.

Computer vision seeks to mimic the human visual system and plays an essential role in artificial intelligence. It is based on different signal reprocessing techniques; therefore, developing efficient techniques becomes essential to achieving fast and reliable processing. Various signal preprocessing operations have been used for computer vision, including smoothing techniques, signal analyzing, resizing, sharpening, and enhancement, to reduce reluctant falsifications, segmentation, and image feature improvement. For example, to reduce the noise in a disturbed signal, smoothing kernels can be effectively used. This is achievedby convolving the distributed signal with smoothing kernels. In addition, orthogonal moments (OMs) are a cruc

Tchebichef polynomials (TPs) play a crucial role in various fields of mathematics and applied sciences, including numerical analysis, image and signal processing, and computer vision. This is due to the unique properties of the TPs and their remarkable performance. Nowadays, the demand for high-quality images (2D signals) is increasing and is expected to continue growing. The processing of these signals requires the generation of accurate and fast polynomials. The existing algorithms generate the TPs sequentially, and this is considered as computationally costly for high-order and larger-sized polynomials. To this end, we present a new efficient solution to overcome the limitation of sequential algorithms. The presented algorithm us

A new method based on the Touchard polynomials (TPs) was presented for the numerical solution of the linear Fredholm integro-differential equation (FIDE) of the first order and second kind with condition. The derivative and integration of the (TPs) were simply obtained. The convergence analysis of the presented method was given and the applicability was proved by some numerical examples. The results obtained in this method are compared with other known results.

Numeral recognition is considered an essential preliminary step for optical character recognition, document understanding, and others. Although several handwritten numeral recognition algorithms have been proposed so far, achieving adequate recognition accuracy and execution time remain challenging to date. In particular, recognition accuracy depends on the features extraction mechanism. As such, a fast and robust numeral recognition method is essential, which meets the desired accuracy by extracting the features efficiently while maintaining fast implementation time. Furthermore, to date most of the existing studies are focused on evaluating their methods based on clean environments, thus limiting understanding of their potential a