The topic of supra.topological.spaces considered one of the important topics because it is a generalization to topological.spaces. Many researchers have presented generalizations to supra open sets such as supra semi.open and supra pre.open sets and others. In this paper, the concept of δ∼open sets was employed and introduced in to the concept of supra topology and a new type of open set was extracted, which was named S∼δ∼open. Our research entails the utilization of this category of sets to form a new concepts in these spaces, namely S∼δ∼limit points and S∼δ∼derive points, and examining its relationship with S∼open and S∼reg∼open. Based on this class of sets, we have introduced other new concepts such as S∼isolated points, S∼δ∼congested points, S∼δ∼adherent points, S∼δ∼dense, S∼δ∼nowhere.dense and S∼δ∼Exterior, and explored their properties. Additionally, we have highlighted the distinctions among these concepts through several examples
Astronomy image is regarded main source of information to discover outer space, therefore to know the basic contain for galaxy (Milky way), it was classified using Variable Precision Rough Sets technique to determine the different region within galaxy according different color in the image. From classified image we can determined the percentage for each class and then what is the percentage mean. In this technique a good classified image result and faster time required to done the classification process.
The product of rn-paracompact and rn-strongly paracompact are briefly disc. ussed.
In the present study, Čech fuzzy soft bi-closure spaces (Čfs bi-csp’s) are defined. The basic properties of Čfs bi-csp’s are studied such as we show from each Čfs bi-csp’s (
In this article, we introduce a new type of soft spaces namely, soft spaces as a generalization of soft paces. Also, we study the weak forms of soft spaces, namely, soft spaces, soft spaces, soft space, and soft spaces. The characterizations and fundamental properties related to these types of soft spaces and the relationships among them are also discussed.
By definition, the detection of protein complexes that form protein-protein interaction networks (PPINs) is an NP-hard problem. Evolutionary algorithms (EAs), as global search methods, are proven in the literature to be more successful than greedy methods in detecting protein complexes. However, the design of most of these EA-based approaches relies on the topological information of the proteins in the PPIN. Biological information, as a key resource for molecular profiles, on the other hand, acquired a little interest in the design of the components in these EA-based methods. The main aim of this paper is to redesign two operators in the EA based on the functional domain rather than the graph topological domain. The perturb
... Show MoreSince his first existence on earth, human had formed a connecting link for a regressive, kinetic and developed relationship that comes from a semi-complicated interaction between natural environment and constructed environment, and this resulted in the survival of human and his existence continuance. Constructed environment enabled human to survive the natural environment inconstancies and enemies as predators, also it helped him to feel safe, comfortable and to practice his everyday life activities...etc. This alternative interaction resulted in creating a civilized legacy for a group of landmarks that tell about the development of this relationship by elemental output that reached us either by documents and manuscripts or as an existed
... Show MoreIn 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
... Show MoreThe aim of this paper is to study the convergence of an iteration scheme for multi-valued mappings which defined on a subset of a complete convex real modular. There are two main results, in the first result, we show that the convergence with respect to a multi-valued contraction mapping to a fixed point. And, in the second result, we deal with two different schemes for two multivalued mappings (one of them is a contraction and other has a fixed point) and then we show that the limit point of these two schemes is the same. Moreover, this limit will be the common fixed point the two mappings.