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.

   In this paper we prove a theorem about the existence and uniqueness common fixed point for two uncommenting self-mappings which defined on orbitally complete G-metric space. Where we use a general contraction condition.
 

The purpose of this research is to introduce a concept of general partial metric spaces as a generalization of partial metric space. Give some results and properties and find relations between general partial metric space, partial metric spaces and D-metric spaces.

The focus of this article, reviewed a generalized  of contraction mapping and nonexpansive maps and recall some theorems about the existence and uniqueness of common fixed point and coincidence fixed-point for such maps under some conditions. Moreover, some schemes of different types as one-step schemes ,two-step schemes and three step schemes (Mann scheme algorithm, Ishukawa scheme algorithm, noor scheme algorithm, .scheme algorithm,  scheme algorithm Modified  scheme algorithm arahan scheme algorithm and others. The convergence of these schemes has been studied .On the other hands, We also reviewed the convergence, valence and stability theories of different types of near-plots in convex metric space.

      In this paper, a modified three-step iteration algorithm for approximating a joint fixed point of non-expansive and contraction mapping is studied. Under appropriate conditions, several strong convergence theorems and Δ-convergence theorems are established in a complete CAT (0) space. a numerical example is introduced to show that this modified iteration algorithm is faster than other iteration algorithms. Finally, we prove that the modified iteration algorithm is stable. Therefore these results are extended and improved to a novel results that are stated by other researchers. Our results are also complement to many well-known theorems in the literature. This type of research can be played a vital role in computer programming

         In this paper, developed Jungck contractive mappings into fuzzy Jungck contractive and proved  fuzzy fixed point for some types of generalize fuzzy Jungck contractive mappings.

Considered despicable motive of the most accurate indicators that reveal the amount of serious criminal, Which involves the character of the perpetrator and on whose basis the penalty is estimated,The origin is that the despicable motive doesnot affect the existence of the crime ,But it affects in punishment, the despicable motive has a set of characteristics that ensure its distinctiveness from other cases that have an indication of the perpetrator of the crime,the despicable motive has privacy in some contemporary crimes, as it enters the composition of the criminal intent of the actor does not do the moral side without it.and therefore it is not doing crime,Such as terrorist offenses, hate crimes and the offense of in

The transmitting and receiving of data consume the most resources in Wireless Sensor Networks (WSNs). The energy supplied by the battery is the most important resource impacting WSN's lifespan in the sensor node. Therefore, because sensor nodes run from their limited battery, energy-saving is necessary. Data aggregation can be defined as a procedure applied for the elimination of redundant transmissions, and it provides fused information to the base stations, which in turn improves the energy effectiveness and increases the lifespan of energy-constrained WSNs. In this paper, a Perceptually Important Points Based Data Aggregation (PIP-DA) method for Wireless Sensor Networks is suggested to reduce redundant data before sending them to the

In the present study, the cluster concept was adopted to find points parallel to the cumulative points of any subset in topology cluster proximity spaces. The takeoff set term was given by the researcher to the set of all points. Also, an opposite definition was found for it, which is the follower set. The relation between them was found and their most important properties were highlighted. Through these two sets, new sets were built that are called, f_σ-set ,f_tσ-set ,t_fσ-set ,bushy set, scant set  .