The aim of this paper is to introduce a new type of proper mappings called semi-p-proper mapping by using semi-p-open sets, which is weaker than the proper mapping. Some properties and characterizations of this type of mappings are given.

      Strong and ∆-convergence for a two-step iteration process utilizing asymptotically nonexpansive and total asymptotically nonexpansive noneslf mappings in the CAT(0) spaces have been studied. As well, several strong convergence theorems under semi-compact and condition (M) have been proved. Our results improve and extend numerous familiar results from the existing literature.

In this paper, we introduce weak and strong forms of ω-perfect mappings, namely the -ω-perfect, weakly -ω-perfect and strongly-ω-perfect mappings. Also, we investigate the fundamental properties of these mappings. Finally, we focused on studying the relationship between weakly -ω-perfect and strongly -ω-perfect mappings.

     A fuzzy valued diffusion term, which in a fuzzy stochastic differential equation refers to one-dimensional Brownian motion, is defined by the meaning of the stochastic integral of a fuzzy process. In this paper, the existence and uniqueness theorem of fuzzy stochastic ordinary differential equations, based on the mean square convergence of the mathematical induction approximations to the associated stochastic integral equation, are stated and demonstrated.

This work employs the conceptions of neutrosophic crisp a-open and semi-a-open sets to distinguish some novel forms of weakly neutrosophic crisp open mappings; for instance, neutrosophic crisp a-open mappings, neutrosophic crisp a*-open mappings, neutrosophic crisp a**-open mappings, neutrosophic crisp semi-a-open mappings, neutrosophic crisp semi-a*-open mappings, and neutrosophic crisp semi-a**-open mappings. Moreover, the close connections between these forms of weakly neutrosophic crisp open mappings and the viewpoints of neutrosophic crisp open mappings are explained. Additionally, various theorems and related features and notes are submitted.

This paper consist some new generalizations of some definitions such: j-ω-closure converge to a point,  j-ω-closure directed toward a set, almost  j-ω-converges to a set, almost  j-ω-cluster point, a set  j-ω-H-closed relative, j-ω-closure continuous mappings, j-ω-weakly continuous mappings, j-ω-compact mappings, j-ω-rigid a set, almost j-ω-closed mappings and  j-ω-perfect mappings. Also, we prove several results concerning it, where j ÃŽ{q, δ,a, pre, b, b}.

The structure of this paper includes an introduction to the definition of the nano topological space, which was defined by M. L. Thivagar, who defined the lower approximation of G and the upper approximation of G, as well as defined the boundary region of G and some other important definitions that were mentioned in this paper with giving some theories on this subject. Some examples of defining nano perfect mappings are presented along with some basic theories. Also, some basic definitions were presented that form the focus of this paper, including the definition of nano  pseudometrizable space, the definition of nano compactly generated space, and the definition of completely nano para-compact. In this paper, we presented images of nan

Soft closure spaces are a new structure that was introduced very recently. These new spaces are based on the notion of soft closure operators. This work aims to provide applications of soft closure operators. We introduce the concept of soft continuous mappings and soft closed (resp. open) mappings, support them with examples, and investigate some of their properties.

In the present work, an image compression method have been modified by combining The Absolute Moment Block Truncation Coding algorithm (AMBTC) with a VQ-based image coding. At the beginning, the AMBTC algorithm based on Weber's law condition have been used to distinguish low and high detail blocks in the original image. The coder will transmit only mean of low detailed block (i.e. uniform blocks like background) on the channel instate of transmit the two reconstruction mean values and bit map for this block. While the high detail block is coded by the proposed fast encoding algorithm for vector quantized method based on the Triangular Inequality Theorem (TIE), then the coder will transmit the two reconstruction mean values (i.e. H&L)