Cloud computing (ClC) has become a more popular computer paradigm in the preceding few years. Quality of Service (QoS) is becoming a crucial issue in service alteration because of the rapid growth in the number of cloud services. When evaluating cloud service functioning using several performance measures, the issue becomes more complex and non-trivial. It is therefore quite difficult and crucial for consumers to choose the best cloud service. The user's choices are provided in a quantifiable manner in the current (...) methods for choosing cloud services. Hence, this study attempts to achieve this objective through construction. decision-making framework so-called cloud services evaluator (CSsEv). The main indicator and its sub-indicators are formed as nodes at levels(n) in tree soft sets (TSSs). Thereafter Single Value Neutrosophic Sets (SVNSs) as branch of neutrosophic sets which conjunction with the Multi-Criteria Decision Making (MCDM) technique to facilitate analysis and evaluation process for the available Cloud services providers. Hence, entropy is employed to obtain indicators and sub_indicators weights and Complex Proportional Assessment utilizes these weights to facilitate the decision process of selecting optimal ClSPs. (shrink)

The theory of plithogeny developed by Smarandache is described as a more generalized form of representing sets of different nature such as crisp, fuzzy, intuitionistic and neutrosophic. Plithogenic set comprises degree of appurtenance and contradiction degree with respect only to the dominant attribute. This paper introduces extended plithogenic sets comprising degrees of appurtenance and contradiction with respect to both dominant and recessive attributes. The extension of the 5-tuple Plithogenic sets to a 7- tuple plithogenic sets helps in developing a more (...) comprehensive kind of Plithogenic sociogram. The newly developed plithogenic sets and its implications in Plithogenic sociogram is validated by the decision making problem on food processing industries. The obtained results using extended plithogenic sets are more promising in comparison to the conventional plithogenic sets. The proposed kind of plithogenic sets will benefit the decision makers to make optimal decisions based on both optimistic and pessimistic approaches. (shrink)

We now found nine new topologies, such as: NonStandard Topology, Largest Extended NonStandard Real Topology, Neutrosophic Triplet Weak/Strong Topologies, Neutrosophic Extended Triplet Weak/Strong Topologies, Neutrosophic Duplet Topology, Neutrosophic Extended Duplet Topology, Neutrosophic MultiSet Topology, and recall and improve the seven previously founded topologies in the years (2019-2023), namely: NonStandard Neutrosophic Topology, NeutroTopology, AntiTopology, Refined Neutrosophic Topology, Refined Neutrosophic Crisp Topology, SuperHyperTopology, and Neutrosophic SuperHyperTopology. They are called avantgarde topologies because of their innovative forms.

In this paper we recall, improve, and extend several definitions, properties and applications of our previous 2019 research referred to NeutroAlgebras and AntiAlgebras (also called NeutroAlgebraic Structures and respectively AntiAlgebraic Structures). Let <A> be an item (concept, attribute, idea, proposition, theory, etc.). Through the process of neutrosphication, we split the nonempty space we work on into three regions {two opposite ones corresponding to <A> and <antiA>, and one corresponding to neutral (indeterminate) <neutA> (also denoted <neutroA>) between the opposites}, which may (...) or may not be disjoint – depending on the application, but they are exhaustive (their union equals the whole space). A NeutroAlgebra is an algebra which has at least one NeutroOperation or one NeutroAxiom (axiom that is true for some elements, indeterminate for other elements, and false for the other elements). A Partial Algebra is an algebra that has at least one Partial Operation, and all its Axioms are classical (i.e. axioms true for all elements). Through a theorem we prove that NeutroAlgebra is a generalization of Partial Algebra, and we give examples of NeutroAlgebras that are not Partial Algebras. We also introduce the NeutroFunction (and NeutroOperation). (shrink)

The author makes an introduction to non-standard analysis, then extends the dialectics to “neutrosophy” – which became a new branch of philosophy. This new concept helps in generalizing the intuitionistic, paraconsistent, dialetheism, fuzzy logic to “neutrosophic logic” – which is the first logic that comprises paradoxes and distinguishes between relative and absolute truth. Similarly, the fuzzy set is generalized to “neutrosophic set”. Also, the classical and imprecise probabilities are generalized to “neutrosophic probability”.

This is a review paper, where we recall the definitions together with practical applications of the Soft Set and its extensions to HyperSoft Set, IndetermSoft Set, IndetermHyperSoft Set, and TreeSoft Set.

In this paper, we generalize the soft set to the hypersoft set by transforming the function F into a multi-attribute function. Then we introduce the hybrids of Crisp, Fuzzy, Intuitionistic Fuzzy, Neutrosophic, and Plithogenic Hypersoft Set.

In this paper, we prove that Neutrosophic Statistics is more general than Interval Statistics, since it may deal with all types of indeterminacies (with respect to the data, inferential procedures, probability distributions, graphical representations, etc.), it allows the reduction of indeterminacy, and it uses the neutrosophic probability that is more general than imprecise and classical probabilities and has more detailed corresponding probability density functions. While Interval Statistics only deals with indeterminacy that can be represented by intervals. And we respond to (...) the arguments by Woodall et al. [1]. We show that not all indeterminacies (uncertainties) may be represented by intervals. Also, in some cases, we should better use hesitant sets (that have less indeterminacy) instead of intervals. We redirect the authors to the Plithogenic Probability and Plithogenic Statistics which are the most general forms of MultiVariate Probability and Multivariate Statistics respectively (including, of course, the Imprecise Probability and Interval Statistics as subclasses). (shrink)

We recall and improve our 2019 and 2020 concepts of n-SuperHyperGraph, Plithogenic nSuperHyperGraph, n-Power Set of a Set, and we present some application from the real world. The nSuperHyperGraph is the most general form of graph today and it is able to describe the complex reality we live in, by using n-SuperVertices (groups of groups of groups etc.) and nSuperHyperEdges (edges connecting groups of groups of groups etc.).

We present this research to all researchers and scholars who have realized the existence of indeterminacy in all data, through the results they obtain and the values that are not accurate enough and that may cause loss to the systems and facilities under study, and we will present through it the emergence, foundations and development of Neutrosophic theories and their applications for more than two decades (1995- 2023) since it was defined and studied, along with its applications, in order to (...) be able to present new studies and research that keep pace with the great scientific development that our contemporary world is witnessing, through the use of research that has been published by the professionals and found on the attached open links. (shrink)

Recently, research on uncertainty modeling is progressing rapidly and many essential and breakthrough stud ies have already been done. There are various ways such as fuzzy, intuitionistic and neutrosophic sets to handle these uncertainties. Although these concepts can handle incomplete information in various real-world issues, they cannot address all types of uncertainty such as indeterminate and inconsistent information. Also, plithogenic sets as a generalization of crisp, fuzzy, intuitionistic fuzzy, and neutrosophic sets, which is a set whose elements are characterized by (...) many attributes’ values. In this paper, our aim is to demonstrate and review the history of fuzzy, intuitionistic and neutrosophic sets. For this purpose, we divided the paper as: section 1. History of Fuzzy Sets, section 2. History of Intuitionistic Fuzzy Sets and section 3. History of Neutrosophic Theories and Applications, section 4. History of Plithogenic Sets. (shrink)

Both neutrosophic sets theory and rough sets theory are emerging as powerful tool for managing uncertainty, indeterminate, incomplete and imprecise information .In this paper we develop an hybrid structure called “ rough neutrosophic sets” and studied their properties.

This paper explores the defects in fuzzy (hyper) graphs (as complex (hyper) networks) and extends the fuzzy (hyper) graphs to fuzzy (quasi) superhypergraphs as a new concept.We have modeled the fuzzy superhypergraphs as complex superhypernetworks in order to make a relation between labeled objects in the form of details and generalities. Indeed, the structure of fuzzy (quasi) superhypergraphs collects groups of labeled objects and analyzes them in the form of the part to part of objects, the part of objects to (...) the whole group of objects, and the whole to the whole group of objects at the same time. We have investigated the properties of fuzzy (quasi) superhypergraphs based on any positive real number as valued fuzzy (quasi) superhypergraphs, considering the complement of valued fuzzy (quasi) superhypergraphs, the notation of isomorphism of valued fuzzy (quasi) superhypergraphs based on the permutations, and we have presented the isomorphic conditions of (self complemented) valued fuzzy (quasi) superhypergraphs. The concept of impact membership value of fuzzy (quasi) superhypergraphs is introduced in this study and it is applied in designing the real problem in the real world. Finally, the problem of business superhypernetworks is presented as an application of fuzzy valued quasi superhypergraphs in the real world. (shrink)

The n-th PowerSet of a Set {or Pn(S)} better describes our real world, because a system S (which may be a company, institution, association, country, society, set of objects/plants/animals/beings, set of concepts/ideas/propositions, etc.) is formed by sub-systems, which in their turn by sub-sub-systems, and so on. We prove that the SuperHyperFunction is a generalization of classical Function, SuperFunction, and HyperFunction. And the SuperHyperAlgebra, SuperHyperGraph are part of the SuperHyperStructure. Almost all structures in our real world are Neutrosophic SuperHyperStructures since they (...) have indeterminate/incomplete/uncertain/conflicting data. (shrink)

While it is known that Euclid’s five axioms include a proposition that a line consists at least of two points, modern geometry avoid consistently any discussion on the precise definition of point, line, etc. It is our aim to clarify one of notorious question in Euclidean geometry: how many points are there in a line segment? – from discrete-cellular space (DCS) viewpoint. In retrospect, it may offer an alternative of quantum gravity, i.e. by exploring discrete gravitational theories. To elucidate our (...) propositions, in the last section we will discuss some implications of discrete cellular-space model in several areas of interest: (a) cell biology, (b) cellular computing, (c) Maxwell equations, (d) low energy fusion, and (e) cosmology modelling. (shrink)

This article is an update of our previous article in this SGJ journal, titled: On Gödel's Incompleteness Theorem, Artificial Intelligence & Human Mind. We provide some commentary on the latest developments around AI, humanoid robotics, and future scenario. Basically, we argue that a more thoughtful approach to the future is "techno-realism.".

It has been known for long time that most of the existing cosmology models have singularity problem. Cosmological singularity has been a consequence of excessive symmetry of flow, such as “Hubble’s law”. More realistic one is suggested, based on Newtonian cosmology model but here we include the vertical-rotational effect of the whole Universe. We review a Riccati-type equation obtained by Nurgaliev, and solve the equation numerically with Mathematica. It is our hope that the new proposed method can be verified with (...) observation data. (shrink)

Inspired by “One Note Samba,” a standard jazz repertoire, we present an outline of Bose-Einstein Condensate Cosmology (BECC). Although this approach seems awkward and a bit off the wall at first glance, it is not impossible to connect altogether BEC, Scalar Field Cosmology and Feshbach Resonance with Ermakov-Pinney equation. We also discuss shortly possible link with our previous paper, where we describe Newtonian Universe with Vortex in terms of Ermakov equation.

For the classical Geometry, in a geometrical space, all items (concepts, axioms, theorems, etc.) are totally (100%) true. But, in the real world, many items are not totally true. The NeutroGeometry is a geometrical space that has some items that are only partially true (and partially indeterminate, and partially false), and no item that is totally false. The AntiGeometry is a geometrical space that has some item that are totally (100%) false. While the Non-Euclidean Geometries [hyperbolic and elliptic geometries] resulted (...) from the total negation of only one specific axiom (Euclid’s Fifth Postulate), the AntiGeometry results from the total negation of any axiom [and in general: theorem, concept, idea etc.] and even of more axioms [theorem, concept, idea, etc.] and in general from any geometric axiomatic system (Euclid’s five postulates, Hilbert’s 20 axioms, etc.), and the NeutroAxiom results from the partial negation of any axiom (or concept, theorem, idea, etc.). Clearly, the AntiGeometry is a generalization of Non-Euclidean Geometries. (shrink)

The second volume of “Advancing Uncertain Combinatorics through Graphization, Hyperization, and Uncertainization: Fuzzy, Neutrosophic, Soft, Rough, and Beyond” presents a deep exploration of the progress in uncertain combinatorics through innovative methodologies like graphization, hyperization, and uncertainization. This volume integrates foundational concepts from fuzzy, neutrosophic, soft, and rough set theory, among others, to further advance the field. Combinatorics and set theory, two central pillars of mathematics, focus on counting, arrangement, and the study of collections under defined rules. Combinatorics excels in handling (...) uncertainty, while set theory has evolved with concepts such as fuzzy and neutrosophic sets, which enable the modeling of complex real-world uncertainties by addressing truth, indeterminacy, and falsehood. These advancements, when combined with graph theory, give rise to novel forms of uncertain sets in "graphized" structures, including hypergraphs and superhypergraphs. Innovations such as Neutrosophic Oversets, Undersets, and Offsets, as well as the Nonstandard Real Set, build upon traditional graph concepts, pushing both theoretical and practical boundaries. The synthesis of combinatorics, set theory, and graph theory in this volume provides a robust framework for addressing the complexities and uncertainties inherent in both mathematical and real-world systems, paving the way for future research and application. In the first chapter, “A Review of the Hierarchy of Plithogenic, Neutrosophic, and Fuzzy Graphs: Survey and Applications”, the authors investigate the interrelationships among various graph classes, including Plithogenic graphs, and explore other related structures. Graph theory, a fundamental branch of mathematics, focuses on networks of nodes and edges, studying their paths, structures, and properties. A Fuzzy Graph extends this concept by assigning a membership degree between 0 and 1 to each edge and vertex, representing the level of uncertainty. The Turiyam Neutrosophic Graph is introduced as an extension of both Neutrosophic and Fuzzy Graphs, while Plithogenic graphs offer a potent method for managing uncertainty. The second chapter, “Review of Some Superhypergraph Classes: Directed, Bidirected, Soft, and Rough”, examines advanced graph structures such as directed superhypergraphs, bidirected hypergraphs, soft superhypergraphs, and rough superhypergraphs. Classical graph classes include undirected graphs, where edges lack orientation, and directed graphs, where edges have specific directions. Recent innovations, including bidirected graphs, have sparked ongoing research and significant advancements in the field. Soft Sets and their extension to Soft Graphs provide a flexible framework for managing uncertainty, while Rough Sets and Rough Graphs address uncertainty by using lower and upper approximations to handle imprecise data. Hypergraphs generalize traditional graphs by allowing edges, or hyperedges, to connect more than two vertices. Superhypergraphs further extend this by allowing both vertices and edges to represent subsets, facilitating the modeling of hierarchical and group-based relationships. The third chapter, “Survey of Intersection Graphs, Fuzzy Graphs, and Neutrosophic Graphs”, explores the intersection graph models within the realms of Fuzzy Graphs, Intuitionistic Fuzzy Graphs, Neutrosophic Graphs, Turiyam Neutrosophic Graphs, and Plithogenic Graphs. The chapter highlights their mathematical properties and interrelationships, reflecting the growing number of graph classes being developed in these areas. Intersection graphs, such as Unit Square Graphs, Circle Graphs, and Ray Intersection Graphs, are crucial for understanding complex graph structures in uncertain environments. The fourth chapter, “Fundamental Computational Problems and Algorithms for SuperHyperGraphs”, addresses optimization problems within the SuperHypergraph framework, such as the SuperHypergraph Partition Problem, Reachability, and Minimum Spanning SuperHypertree. The chapter also adapts classical problems like the Traveling Salesman Problem and the Chinese Postman Problem to the SuperHypergraph context, exploring how hypergraphs, which allow hyperedges to connect more than two vertices, can be used to solve complex hierarchical and relational problems. The fifth chapter, “A Short Note on the Basic Graph Construction Algorithm for Plithogenic Graphs”, delves into algorithms designed for Plithogenic Graphs and Intuitionistic Plithogenic Graphs, analyzing their complexity and validity. Plithogenic Graphs model multi-valued attributes by incorporating membership and contradiction functions, offering a nuanced representation of complex relationships. The sixth chapter, “Short Note of Bunch Graph in Fuzzy, Neutrosophic, and Plithogenic Graphs”, generalizes traditional graph theory by representing nodes as groups (bunches) rather than individual entities. This approach enables the modeling of both competition and collaboration within a network. The chapter explores various uncertain models of bunch graphs, including Fuzzy Graphs, Neutrosophic Graphs, Turiyam Neutrosophic Graphs, and Plithogenic Graphs. In the seventh chapter, “A Reconsideration of Advanced Concepts in Neutrosophic Graphs: Smart, Zero Divisor, Layered, Weak, Semi, and Chemical Graphs”, the authors extend several fuzzy graph classes to Neutrosophic graphs and analyze their properties. Neutrosophic Graphs, a generalization of fuzzy graphs, incorporate degrees of truth, indeterminacy, and falsity to model uncertainty more effectively. The eighth chapter, “Short Note of Even-Hole-Graph for Uncertain Graph”, focuses on Even-Hole-Free and Meyniel Graphs analyzed within the frameworks of Fuzzy, Neutrosophic, Turiyam Neutrosophic, and Plithogenic Graphs. The study investigates the structure of these graphs, with an emphasis on their implications for uncertainty modeling. The ninth chapter, “Survey of Planar and Outerplanar Graphs in Fuzzy and Neutrosophic Graphs”, explores planar and outerplanar graphs, as well as apex graphs, within the contexts of fuzzy, neutrosophic, Turiyam Neutrosophic, and plithogenic graphs. The chapter examines how these types of graphs are used to model uncertain parameters and relationships in mathematical and real-world systems. The tenth chapter, “General Plithogenic Soft Rough Graphs and Some Related Graph Classes”, introduces and explores new concepts such as Turiyam Neutrosophic Soft Graphs and General Plithogenic Soft Graphs. The chapter also examines models of uncertain graphs, including Fuzzy, Intuitionistic Fuzzy, Neutrosophic, and Plithogenic Graphs, all designed to handle uncertainty in diverse contexts. The eleventh chapter, “Survey of Trees, Forests, and Paths in Fuzzy and Neutrosophic Graphs”, provides a comprehensive study of Trees, Forests, and Paths within the framework of Fuzzy and Neutrosophic Graphs. This chapter focuses on classifying and analyzing graph structures like trees and paths in uncertain environments, contributing to the ongoing development of graph theory in the context of uncertainty. (shrink)

The third volume of “Advancing Uncertain Combinatorics through Graphization, Hyperization, and Uncertainization: Fuzzy, Neutrosophic, Soft, Rough, and Beyond” presents an in-depth exploration of the cutting-edge developments in uncertain combinatorics and set theory. This comprehensive collection highlights innovative methodologies such as graphization, hyperization, and uncertainization, which enhance combinatorics by incorporating foundational concepts from fuzzy, neutrosophic, soft, and rough set theories. These advancements open new mathematical horizons, offering novel approaches to managing uncertainty within complex systems. Combinatorics, a discipline focused on counting, arrangement, (...) and structure, often faces challenges when uncertainty is present. Set theory, which underpins combinatorial problems, has evolved to tackle these challenges. The introduction of fuzzy and neutrosophic sets has expanded the toolkit for modeling uncertainty by incorporating elements of truth, indeterminacy, and falsehood into decision-making processes. These innovations seamlessly intersect with graph theory, providing new ways to represent uncertain structures through "graphized" forms such as hypergraphs and superhypergraphs. This volume also introduces advanced concepts like Neutrosophic Oversets, Undersets, and Offsets, which push the boundaries of classical graph theory and offer deeper insights into the mathematical and practical challenges posed by real-world systems. By blending combinatorics, set theory, and graph theory, the authors have created a robust framework for addressing uncertainty in both mathematical systems and their real-world applications. This foundation sets the stage for future breakthroughs in combinatorics, set theory, and related fields. Each chapter in this volume contributes both theoretical foundations and practical applications, demonstrating the power of integrating graph theory, set theory, and uncertainty models. The new ideas, algorithms, and mathematical tools presented here will drive the future of combinatorial research and its applications in uncertain environments. In the first chapter, “Introduction to Upside-Down Logic: Its Deep Relation to Neutrosophic Logic and Applications”, the authors present Upside-Down Logic, a novel logical framework that systematically transforms truths into falsehoods and vice versa, based on contextual shifts. Introduced by F. Smarandache, this paper provides a mathematical definition of Upside-Down Logic, including applications related to the Japanese language. The chapter also introduces Contextual Upside-Down Logic, an extension that adjusts logical connectives alongside flipped truth values, as well as Indeterm-Upside-Down Logic and Certain Upside-Down Logic to address indeterminacy. A simple algorithm is also proposed to demonstrate the computational aspects of this logic. In the second chapter, “Local-Neutrosophic Logic and Local-Neutrosophic Sets: Incorporating Locality with Applications”, the authors introduce Local-Neutrosophic Logic and Local-Neutrosophic Sets, which integrate the concept of locality into Neutrosophic Logic. By defining locality as the influence of immediate surroundings on an object or system, this chapter explores how it affects indeterminacy in real-world problems. The paper also examines potential applications and provides mathematical definitions for these new concepts. The third chapter, “A Review of Fuzzy and Neutrosophic Offsets: Connections to Some Set Concepts and Normalization Function”, extends the concept of offsets in uncertain set-theoretic frameworks, such as Fuzzy Sets, Neutrosophic Sets, and Plithogenic Sets. This chapter introduces several advanced types of offsets, including Nonstationary Fuzzy Offset, Multi-valued Plithogenic Offset, and Subset-valued Neutrosophic Offset, offering deeper insights into handling uncertainty in mathematical models. In the fourth chapter, “Review of Plithogenic Directed, Mixed, Bidirected, and Pangene OffGraph”, the authors build upon Plithogenic Graphs to propose extensions such as Plithogenic Directed OffGraph, Plithogenic BiDirected OffGraph, and Plithogenic Mixed OffGraph. These new concepts, including the Plithogenic Pangene OffGraph, are explored in detail, with a focus on their mathematical properties and potential applications in uncertain graph theory. The fifth chapter, “Short Note on Neutrosophic Closure Matroids”, explores the extension of matroid concepts into Neutrosophic and Turiyam Neutrosophic set theories, introducing Neutrosophic closure matroids. This concept integrates uncertainty, indeterminacy, and liberal states into matroid theory, enhancing its applicability in optimization and combinatorial problems. In the sixth chapter, “Some Graph Parameters for Superhypertree-width and Neutrosophic Tree-width”, the authors discuss graph parameters such as Superhypertree-width and Neutrosophic tree-width. These parameters play a crucial role in the study of graph characteristics, particularly in algorithms and real-world applications. The chapter explores the generalization of hypergraphs to SuperHyperGraphs and examines how these concepts extend tree-width parameters within the context of Neutrosophic logic. (shrink)

In this chapter, a new type Hyper groups are defined, corresponding basic properties and examples for new type Hyper groups are given and proved. Moreover, new type Hypergroups groups and are compared to hyper groups and groups. New type Hyper groups are shown to have a more general structure according to Hyper groups and groups. Also, new type SuperHyper groups are defined, corresponding basic properties and examples for new type SuperHyper are given and proved. Furthermore, we defined neutro-new type SuperHyper (...) groups. (shrink)

Smarandache (1995) defined the notion of neutrosophic sets, which is a generalization of Zadeh's fuzzy set and Atanassov's intuitionistic fuzzy set. In this paper, we first develop some similarity measures of neutrosophic sets. We will present a method to calculate the distance between neutrosophic sets (NS) on the basis of the Hausdorff distance. Then we will use this distance to generate a new similarity measure to calculate the degree of similarity between NS. Finally we will prove some properties of the (...) proposed similarity measures. (shrink)

Big Data is a large-sized and complex dataset, which cannot be managed using traditional data processing tools. Mining process of big data is the ability to extract valuable information from these large datasets. Association rule mining is a type of data mining process, which is indented to determine interesting associations between items and to establish a set of association rules whose support is greater than a specific threshold. The classical association rules can only be extracted from binary data where an (...) item exists in a transaction, but it fails to deal effectively with quantitative attributes, through decreasing the quality of generated association rules due to sharp boundary problems. In order to overcome the drawbacks of classical association rule mining, we propose in this research a new neutrosophic association rule algorithm. The algorithm uses a new approach for generating association rules by dealing with membership, indeterminacy, and non-membership functions of items, conducting to an efficient decision-making system by considering all vague association rules. To prove the validity of the method, we compare the fuzzy mining and the neutrosophic mining. The results show that the proposed approach increases the number of generated association rules. (shrink)

The purpose of this study is to propose new similarity measures namely rough variational coefficient similarity measure under the rough neutrosophic environment. The weighted rough variational coefficient similarity measure has been also defined. The weighted rough variational coefficient similarity measures between the rough ideal alternative and each alternative are xxxxx calculated to find the best alternative. The ranking order of all the alternatives can be determined by using the numerical values of similarity measures. Finally, an illustrative example has been provided (...) to show the effectiveness and validity of the proposed approach. Comparisons of decision results of existing rough similarity measures have been provided. (shrink)

Since the world is full of indeterminacy, the Neutrosophics found their place into contemporary research. We now introduce for the first time the notions of Neutrosophic Crisp Sets and Neutrosophic Topology on Crisp Sets. We develop the 2012 notion of Neutrosophic Topological Spaces and give many practical examples. Neutrosophic Science means development and applications of Neutrosophic Logic, Set, Measure, Integral, Probability etc., and their applications in any field. It is possible to define the neutrosophic measure and consequently the neutrosophic integral (...) and neutrosophic probability in many ways, because there are various types of indeterminacies, depending on the problem we need to solve. Indeterminacy is different from randomness. Indeterminacy can be caused by physical space, materials and type of construction, by items involved in the space, or by other factors. In 1965 [51], Zadeh generalized the concept of crisp set by introducing the concept of fuzzy set, corresponding to the situation in which there is no precisely defined set;there are increasing applications in various fields, including probability, artificial intelligence, control systems, biology and economics. Thus, developments in abstract mathematics using the idea of fuzzy sets possess sound footing. In accordance, fuzzy topological spaces were introduced by Chang [12] and Lowen [33]. After the development of fuzzy sets, much attention has been paid to the generalization of basic concepts of classical topology to fuzzy sets and accordingly developing a theory of fuzzy topology [1-58]. In 1983, the intuitionistic fuzzy set was introduced by K. Atanassov [55, 56, 57] as a generalization of the fuzzy set, beyond the degree of membership and the degree of non-membership of each element. In 1999 and 2002, Smarandache [71, 72, 73, 74] defined the notion of Neutrosophic Sets, which is a generalization of Zadeh’s fuzzy set and Atanassov's intuitionistic fuzzy set. Some neutrosophic concepts have been investigated by Salama et al. [61-70]. Forwarding the study of neutrosophic sets, this book consists of seven chapters, targeting to:  generalize the previous studies in [1-59], and[91-94] so to define the neutrosopic crisp set and neutrosophic set concepts;  discuss their main properties; A. A. Salama & Florentin Smarandache  introduce and study some concepts of neutrosophic crisp and neutrosophic topological spaces and deduce their properties;  deduce many types of functions and give the relationships between different neutrosophic topological spaces, which helps to build new properties of neutrosophic topological spaces;  stress once more the importance of Neutrosophic Ideal as a nontrivial extension of neutrosophic set and neutrosophic logic [71, 72, 73, 74];  propose applications on computer sciences by using neutrosophic sets. (shrink)

In this article, we first provide a modified definition of SuperHyperGraphs (SHG) and we call it Restricted SuperHyperGraphs (R-SHG). We then generalize the R-SHG to the neutrosophic graphs and then define the corresponding trees. In the following, we examine the Helly property for subtrees of SuperHyperGraphs.

This paper is devoted to present Technique for Order Preference by Similarity to Ideal Solution (TOPSIS) method for multi-attribute group decision making under rough neutrosophic environment. The concept of rough neutrosophic set is a powerful mathematical tool to deal with uncertainty, indeterminacy and inconsistency. In this paper, a new approach for multi-attribute group decision making problems is proposed by extending the TOPSIS method under rough neutrosophic environment. Rough neutrosophic set is characterized by the upper and lower approximation operators and the (...) pair of neutrosophic sets that are characterized by truth-membership degree, indeterminacy membership degree, and falsity membership degree. In the decision situation, ratings of alternatives with respect to each attribute are characterized by rough neutrosophic sets that reflect the decision makers’ opinion. Rough neutrosophic weighted averaging operator has been used to aggregate the individual decision maker’s opinion into group opinion for rating the importance of attributes and alternatives. Finally, a numerical example has been provided to demonstrate the applicability and effectiveness of the proposed approach. (shrink)

In this paper we recall our concepts of n th-Power Set of a Set, SuperHyperOperation, SuperHyperAxiom, SuperHyperAlgebra, and their corresponding Neutrosophic SuperHyperOperation, Neutrosophic SuperHyperAxiom and Neutrosophic SuperHyperAlgebra. In general, in any field of knowledge, one actually encounters SuperHyperStructures (or more accurately (m, n)- SuperHyperStructures).

In this paper, we define a new cosine similarity between two interval valued neutrosophic sets based on Bhattacharya’s distance [19]. The notions of interval valued neutrosophic sets (IVNS, for short) will be used as vector representations in 3D-vector space. Based on the comparative analysis of the existing similarity measures for IVNS, we find that our proposed similarity measure is better and more robust. An illustrative example of the pattern recognition shows that the proposed method is simple and effective.

In this paper, we make a short history about: the neutrosophic set, neutrosophic numerical components and neutrosophic literal components, neutrosophic numbers, neutrosophic intervals, neutrosophic hypercomplex numbers of dimension n, and elementary neutrosophic algebraic structures. Afterwards, their generalizations to refined neutrosophic set, respectively refined neutrosophic numerical and literal components, then refined neutrosophic numbers and refined neutrosophic algebraic structures.

Sound is one of the types of waves that can be felt by the sense of hearing (ears). In physics, the definition of sound is something that is produced from objects that vibrate. Objects that produce sound are called sound sources. The sound source that vibrates will vibrate the molecules into the air around it. Sound is mechanical compression or longitudinal waves that propagate through the medium. This medium or intermediate agent can be liquid, solid, gas. So, sound waves can (...) propagate for example in water, coal, or air. Most sounds are a combination of various vibratory signals composed of harmonic waves, but pure sound can theoretically be explained by oscillating vibrational speed or frequency measured in Hertz (Hz) vibration units and amplitude or loudness of sound with measurements in decibels (dB). The effect sounds can have on us humans is simply astounding. While everyday life becomes stressful, overcrowded and increasingly hectic, we seek ways for inner peace and balance. The power of music, felt through overtone-rich sound therapy and sound massage, can be a solution. No matter how much scientific explanation is behind it, healing through music remains fascinating, even magical. This paper introduces a new field called cymatics and sound healing with their plausible impact to spirituality and consciousness research. (shrink)

In this paper, the sine, cosine and cotangent similarity measures of interval rough neutrosophic sets is proposed. Some properties of the proposed measures are discussed. We have proposed multi attribute decision making approaches based on proposed similarity measures. To demonstrate the applicability, a numerical example is solved.

In this paper, we define correlation coefficient measure between any two rough neutrosophic sets. We also prove some of its basic properties.. We develop a new multiple attribute group decision making method based on the proposed correlation coefficient measure. An illustrative example of medical diagnosis is solved to demonstrate the applicability and effecriveness of the proposed method.

We introduce Pura Vida Neutrosophic Algebra, an algebraic structure consisting of neutrosophic numbers equipped with two binary operations namely addition and multiplication. The addition can be calculated sometimes with the function min and other times with the max function. The multiplication operation is the usual sum between numbers. Pura Vida Neutrosophic Algebra is an extension of both Tropical Algebra (also known as Min-Plus, or Min-Algebra) and Max-Plus Algebra (also known as Max-algebra). Tropical and Max-Plus algebras are algebraic structures included in (...) semirings and their operations can be used in matrices and vectors. Pura Vida Neutrosophic Algebra is included in Neutrosophic semirings and can be used in Neutrosophic matrices and vectors. (shrink)

Impostor syndrome or Impostor phenomenon is a belief that a person thinks their success is due to luck or external factors, not their abilities. This psychological trait is present in certain groups like women. In this paper, we propose a neutrosophic trait measure to represent the psychological concept of the trait-anti trait using refined neutrosophic sets. This study analysed a group of 200 undergraduate students for impostor syndrome, perfectionism, introversion and self-esteem: after the COVID pandemic break in 2021. Data labelling (...) was carried out using these neutrosophic trait measures. Machine learning models like Support Vector Machine(SVM), K-nearest neighbour (K-NN), and random forest were used to model the data; SVM provided the best accuracy of 92.15%. (shrink)

In this paper we introduce the notion of filter on the neutrosophic crisp set, then we consider a generalization of the filter’s studies. Afterwards, we present the important neutrosophic crisp filters. We also study several relations between different neutrosophic crisp filters and neutrosophic topologies. Possible applications to database systems are touched upon.

In this paper we extend the NeutroAlgebra & AntiAlgebra to the geometric spaces, by founding the NeutroGeometry & AntiGeometry. While the Non-Euclidean Geometries resulted from the total negation of one specific axiom (Euclid’s Fifth Postulate), the AntiGeometry results from the total negation of any axiom or even of more axioms from any geometric axiomatic system (Euclid’s, Hilbert’s, etc.) and from any type of geometry such as (Euclidean, Projective, Finite, Affine, Differential, Algebraic, Complex, Discrete, Computational, Molecular, Convex, etc.) Geometry, and the (...) NeutroGeometry results from the partial negation of one or more axioms [and no total negation of no axiom] from any geometric axiomatic system and from any type of geometry. Generally, instead of a classical geometric Axiom, one may take any classical geometric Theorem from any axiomatic system and from any type of geometry, and transform it by NeutroSophication or AntiSophication into a NeutroTheorem or AntiTheorem respectively in order to construct a NeutroGeometry or AntiGeometry. Therefore, the NeutroGeometry and AntiGeometry are respectively alternatives and generalizations of the Non-Euclidean Geometries. In the second part, we recall the evolution from Paradoxism to Neutrosophy, then to NeutroAlgebra & AntiAlgebra, afterwards to NeutroGeometry & AntiGeometry, and in general to NeutroStructure & AntiStructure that naturally arise in any field of knowledge. At the end, we present applications of many NeutroStructures in our real world. (shrink)

Cross entropy measure is one of the best way to calculate the divergence of any variable from the priori one variable. We define a new cross entropy measure under interval neutrosophic set environment.

The science of operations research is one of the modern sciences that have made a great revolution in all areas of life through the methods provided by it, suitable and appropriate to solve most of the problems that were facing researchers, scholars and those interested in the development of societies, and the most beneficiaries of this science were companies and institutions that are looking for scientific methods that help them manage their work so that they achieve the greatest profit and (...) the lowest cost, and one of the important methods that have been used in the management of companies we offer in this research two methods, Dynamic programming method. This method has been used in many practical matters and helped decision-makers in companies to achieve a maximum profit and less cost by formulating the reality of the state of the company and the data provided by decision-makers with a dynamic mathematical model that is solved using methods of solving dynamic models and we will provide in this research an example of this through the issue of choosing the optimal investment for the budget of a company so that it achieves a maximum profit, and the method of programming with integers: the method that provided these companies with solutions with integer values suitable for the nature of its work, through the use of the binary integer in the formulation of the appropriate mathematical model on the one hand, and on the other hand, the use of the binary integer variable helped to convert some nonlinear models that lead to some practical problems into linear models, and it should be noted here that in the previous two methods there is something indeterminable because we must make a decision in choosing or not choosing something, but the optimal solution that we will get remains A specific value because we are building the mathematical model for any realistic issue through the data provided by those responsible for the work and these data are calculated quantities and therefore they are uncertain values because their validity depends on the circumstances surrounding the work environment, they may be exposed to increase or decrease, and therefore the optimal solution on which the company will base its decision is suitable for specific values and any change in them can cause the company an uncalculated loss, so in this research we will use the concepts of neutrosophic science, the branch of science founded by the American scientist Florentin Smarandache in 1995 based on his belief that there is no absolute truth, a science that is interested in the study of ideas and concepts that are neither true nor false, but just in between, and we will take the data (calculated quantities) neutrosophic values that are specified or unspecified values are any set close to the calculated quantities, then the resulting mathematical model is a neutrosophic model and the optimal solution has neutrosophic values and thanks to the indefinite uncertainty that these values have, companies from the development of appropriate plans for all circumstances and thus achieve the greatest profit and the lowest cost, and we will clarify the above through two issues, the issue of optimal designation of a warehouse site, which we will formulate the mathematical model of using the neutrosophic integer programming method - and the issue of capital budget, which we will present in two different forms, we use in the first form the neutrosophic integer programming method and in the second the neutrosophic dynamic programming method. (shrink)

In this paper, we recall and study the new type of algebraic structures called Symbolic Plithogenic Algebraic Structures. Their operations are given under the Absorbance Law and the Prevalence Order.

This article is a preliminary draft for initiating and commencing a new pioneer dimension of expression. To deal with higher-dimensional data or information flowing in this modern era of information technology and artificial intelligence, some innovative super algebraic structures are essential to be formulated. In this paper, we have introduced such matrices that have multiple layers and clusters of layers to portray multi-dimensional data or massively dispersed information of the plithogenic universe made up of numerous subjects their attributes, and sub-attributes. (...) For grasping that field of parallel information, events, and realities flowing from the micro to the macro level of universes, we have constructed hypersoft and hyper-super-soft matrices in a Plithogenic Fuzzy environment. These Matrices classify the non-physical attributes by accumulating the physical subjects and further sort the physical subjects by accumulating their non-physical attributes. We presented themasPlithogenicAttributiveSubjectivelyWholeHyper-Super-Soft-Matrix(PASWHSS-Matrix)andPlithogenic Subjective Attributively Whole-Hyper-Super-Soft-Matrix (PSAWHSS-Matrix). Several types of views and level-layers of these matrices are described. In addition, some local aggregation operators for Plithogenic Fuzzy Hypersoft Set (PPFHS-Set) are developed. Finally, few applications of these matrices and operators are used as numerical examples of COVID-19 data structures. (shrink)

Many results have been obtained on isolated graphs and complete graphs. In this paper, a necessary and sufficient condition will be proved for a single valued neutrosophic graph to be an isolated single valued neutrosophic graph.

Neutrosophy, the study of neutralities, is a new branch of Philosophy that has applications in many different fields of science. Inspired by the idea of Neutrosophy, Smarandache introduced NeutroAlgebraicStructures (or NeutroAlgebras) by allowing the partiality and indeterminacy to be included in the structures’ operations and/or axioms.

This Paper combines interval- valued neutrouphic sets and rough sets. It studies roughness in interval- valued neutrosophic sets and some of its properties. Finally we propose a Hamming distance between lower and upper approximations of interval valued neutrosophic sets.

A hypergroup, as a generalization of the notion of a group, was introduced by F. Marty in 1934. The first book in hypergroup theory was published by Corsini. Nowadays, hypergroups have found applications to many subjects of pure and applied mathematics, for example, in geometry, topology, cryptography and coding theory, graphs and hypergraphs, probability theory, binary relations, theory of fuzzy and rough sets and automata theory, physics, and also in biological inheritance.

In this paper, we define projection and bidirectional projection measures between interval rough neutrosophic sets and prove their basic properties. Then two new multi attribute decision making strategies are proposed based on interval rough neutrosophic projection and bidirectional projection measures respectively. Then the proposed methods are applied for solving multi attribute decision making problems. Finally, a numerical example is solved to show the feasibility, applicability and effectiveness of the proposed strategies.

This paper is devoted to Plithogeny, Plithogenic Set, and its extensions. These concepts are branches of uncertainty and indeterminacy instruments of practical and theoretical interest. Starting with some examples, we proceed towards general structures. Then we present definitions and applications of the principal concepts derived from plithogeny, and relate them to complex problems.