In this research, assume a SuperHyperGraph. Then an extreme SuperHyperMatching $\mathcal{C}(NSHG)$ for a neutrosophic SuperHyperGraph $NSHG:(V,E)$ is the maximum cardinality of a SuperHyperSet $S$ of high cardinality SuperHyperEdges such that there's no SuperHyperVertex not to in a SuperHyperEdge and there's no SuperHyperEdge to have a SuperHyperVertex in a SuperHyperEdge; a neutrosophic SuperHyperMatching $\mathcal{C}(NSHG)$ for a neutrosophic SuperHyperGraph $NSHG:(V,E)$ is the maximum neutrosophic cardinality of a neutrosophic SuperHyperSet $S$ of high neutrosophic cardinality neutrosophic SuperHyperEdges such that there's no neutrosophic SuperHyperVertex not to in a neutrosophic SuperHyperEdge and there's no neutrosophic SuperHyperEdge to have a neutrosophic SuperHyperVertex in a neutrosophic SuperHyperEdge; an extreme SuperHyperMatching SuperHyperPolynomial $\mathcal{C}(NSHG)$ for a neutrosophic SuperHyperGraph $NSHG:(V,E)$ is the extreme SuperHyperPolynomial contains the coefficients defined as the number of the maximum cardinality of a SuperHyperSet $S$ of high cardinality SuperHyperEdges such that there's no SuperHyperVertex not to in a SuperHyperEdge and there's no SuperHyperEdge to have a SuperHyperVertex in a SuperHyperEdge and the power is corresponded to its coefficient; a neutrosophic SuperHyperMatching SuperHyperPolynomial $\mathcal{C}(NSHG)$ for a neutrosophic SuperHyperGraph $NSHG:(V,E)$ is the neutrosophic SuperHyperPolynomial contains the neutrosophic coefficients defined as the neutrosophic number of the maximum neutrosophic cardinality of a neutrosophic SuperHyperSet $S$ of high neutrosophic cardinality neutrosophic SuperHyperEdges such that there's no neutrosophic SuperHyperVertex not to in a neutrosophic SuperHyperEdge and there's no neutrosophic SuperHyperEdge to have a neutrosophic SuperHyperVertex in a neutrosophic SuperHyperEdge and the neutrosophic power is neutrosophicly corresponded to its neutrosophic coefficient; an extreme R-SuperHyperMatching $\mathcal{C}(NSHG)$ for a neutrosophic SuperHyperGraph $NSHG:(V,E)$ is the maximum cardinality of a SuperHyperSet $S$ of high cardinality SuperHyperVertices such that there's no SuperHyperVertex not to in a SuperHyperEdge and there's no SuperHyperEdge to have a SuperHyperVertex in a SuperHyperEdge; a neutrosophic R-SuperHyperMatching $\mathcal{C}(NSHG)$ for a neutrosophic SuperHyperGraph $NSHG:(V,E)$ is the maximum neutrosophic cardinality of a neutrosophic SuperHyperSet $S$ of high neutrosophic cardinality neutrosophic SuperHyperVertices such that there's no neutrosophic SuperHyperVertex not to in a neutrosophic SuperHyperEdge and there's no neutrosophic SuperHyperEdge to have a neutrosophic SuperHyperVertex in a neutrosophic SuperHyperEdge; an extreme R-SuperHyperMatching SuperHyperPolynomial $\mathcal{C}(NSHG)$ for a neutrosophic SuperHyperGraph $NSHG:(V,E)$ is the extreme SuperHyperPolynomial contains the coefficients defined as the number of the maximum cardinality of a SuperHyperSet $S$ of high cardinality SuperHyperVertices such that there's no SuperHyperVertex not to in a SuperHyperEdge and there's no SuperHyperEdge to have a SuperHyperVertex in a SuperHyperEdge and the power is corresponded to its coefficient; a neutrosophic R-SuperHyperMatching SuperHyperPolynomial $\mathcal{C}(NSHG)$ for a neutrosophic SuperHyperGraph $NSHG:(V,E)$ is the neutrosophic SuperHyperPolynomial contains the neutrosophic coefficients defined as the neutrosophic number of the maximum neutrosophic cardinality of a neutrosophic SuperHyperSet $S$ of high neutrosophic cardinality neutrosophic SuperHyperVertices such that there's no neutrosophic SuperHyperVertex not to in a neutrosophic SuperHyperEdge and there's no neutrosophic SuperHyperEdge to have a neutrosophic SuperHyperVertex in a neutrosophic SuperHyperEdge and the neutrosophic power is neutrosophicly corresponded to its neutrosophic coefficient. Assume a SuperHyperGraph. Then $\delta-$SuperHyperMatching is a maximal of SuperHyperVertices with a maximum cardinality such that either of the following expressions hold for the (neutrosophic) cardinalities of SuperHyperNeighbors of $s\in S:$ there are $|S\cap N(s)| > |S\cap (V\setminus N(s))|+\delta;$ and $ |S\cap N(s)| < |S\cap (V\setminus N(s))|+\delta.$ The first Expression, holds if $S$ is an $\delta-$SuperHyperOffensive. And the second Expression, holds if $S$ is an $\delta-$SuperHyperDefensive; a neutrosophic $\delta-$SuperHyperMatching is a maximal neutrosophic of SuperHyperVertices with maximum neutrosophic cardinality such that either of the following expressions hold for the neutrosophic cardinalities of SuperHyperNeighbors of $s\in S$ there are: $|S\cap N(s)|_{neutrosophic} > |S\cap (V\setminus N(s))|_{neutrosophic}+\delta;$ and $ |S\cap N(s)|_{neutrosophic} < |S\cap (V\setminus N(s))|_{neutrosophic}+\delta.$ The first Expression, holds if $S$ is a neutrosophic $\delta-$SuperHyperOffensive. And the second Expression, holds if $S$ is a neutrosophic $\delta-$SuperHyperDefensive It's useful to define a ``neutrosophic'' version of a SuperHyperMatching . Since there's more ways to get type-results to make a SuperHyperMatching more understandable. For the sake of having neutrosophic SuperHyperMatching, there's a need to ``redefine'' the notion of a ``SuperHyperMatching ''. A basic familiarity with Extreme SuperHyperMatching theory, SuperHyperGraphs, and Neutrosophic SuperHyperGraphs theory are proposed.

In this research, assume a SuperHyperGraph. Then a “SuperHyperForcing” Z(NSHG) for a neutrosophic SuperHyperGraph NSHG : (V,E) is the minimum cardinality of a SuperHyperSet S of black SuperHyperVertices (whereas SuperHyperVertices in V (G) \ S are colored white) such that V (G) is turned black after finitely many applications of “the color-change rule”: a white SuperHyperVertex is converted to a black SuperHyperVertex if it is the only white SuperHyperNeighbor of a black SuperHyperVertex; a “neutrosophic SuperHyperForcing” Zn(NSHG) for a neutrosophic SuperHyperGraph NSHG : (V,E) is the minimum neutrosophic cardinality of a SuperHyperSet S of black SuperHyperVertices (whereas SuperHyperVertices in V (G) \ S are colored white) such that V (G) is turned black after finitely many applications of “the color-change rule”: a white SuperHyperVertex is converted to a black SuperHyperVertex if it is the only white SuperHyperNeighbor of a black SuperHyperVertex. Assume a SuperHyperGraph. Then a “SuperHyperForcing” Z(NSHG) for a neutrosophic SuperHyperGraph NSHG : (V,E) is the minimum cardinality of a SuperHyperSet S of black SuperHyperVertices (whereas SuperHyperVertices in V (G) \ S are colored white) such that V (G) is turned black after finitely many applications of “the color-change rule”: a white SuperHyperVertex is converted to a black SuperHyperVertex if it is the only white SuperHyperNeighbor of a black SuperHyperVertex; a “neutrosophic SuperHyperForcing” Zn(NSHG) for a neutrosophic SuperHyperGraph NSHG : (V,E) is the minimum neutrosophic cardinality of a SuperHyperSet S of black SuperHyperVertices (whereas SuperHyperVertices in V (G) \ S are colored white) such that V (G) is turned black after finitely many applications of “the color-change rule”: a white SuperHyperVertex is converted to a black SuperHyperVertex if it is the only white SuperHyperNeighbor of a black SuperHyperVertex. Assume a SuperHyperGraph. Then an “δ−SuperHyperForcing” is a minimal SuperHyperForcing of SuperHyperVertices with minimum cardinality such that either of the following expressions hold for the (neutrosophic) cardinalities of SuperHyperNeighbors of s ∈ S : |S∩N(s)|>|S∩(V \N(s))|+δ, |S∩N(s)|<|S∩(V \N(s))|+δ.Thefirst Expression, holds if S is an “δ−SuperHyperOffensive”. And the second Expression, holds if S is an “δ−SuperHyperDefensive”; a“neutrosophic δ−SuperHyperForcing” is a minimal neutrosophic SuperHyperForcing of SuperHyperVertices with minimum neutrosophic cardinality such that either of the following expressions hold for the neutrosophic cardinalities of SuperHyperNeighbors of s ∈ S : |S ∩ N(s)|neutrosophic > |S ∩ (V \ N (s))|neutrosophic + δ, |S ∩ N (s)|neutrosophic < |S ∩ (V \ N (s))|neutrosophic + δ. The first Expression, holds if S is a “neutrosophic δ−SuperHyperOffensive”. And the second Expression, holds if S is a “neutrosophic δ−SuperHyperDefensive”. It’s useful to define “neutrosophic” version of SuperHyperForcing. Since there’s more ways to get type-results to make SuperHyperForcing more understandable. For the sake of having neutrosophic SuperHyperForcing, there’s a need to “redefine” the notion of “SuperHyperForcing”. The SuperHyperVertices and the SuperHyperEdges are assigned by the labels from the letters of the alphabets. In this procedure, there’s the usage of the position of labels to assign to the values. A basic familiarity with SuperHyperGraph theory and neutrosophic SuperHyperGraph theory are proposed.

In this research, new setting is introduced for new SuperHyperNotions, namely, SuperHyperAlliances and Neutrosophic SuperHyperAlliances. Two different types of SuperHyperDefinitions are debut for them but the research goes further and the SuperHyperNotion, SuperHyperUniform, and SuperHyperClass based on that are well-defined and well-reviewed. The literature review is implemented in the whole of this research. For shining the elegancy and the significancy of this research, the comparison between this SuperHyperNotion with other SuperHyperNotions and fundamental SuperHyperNumbers are featured. The definitions are followed by the examples and the instances thus the clarifications are driven with different tools. The applications are figured out to make sense about the theoretical aspect of this ongoing research. The “Cancer’s Recognitions” are the under research to figure out the challenges make sense about ongoing and upcoming research. The special case is up. The cells are viewed in the deemed ways. There are different types of them. Some of them are individuals and some of them are well-modeled by the group of cells. These types are all officially called “SuperHyperVertex” but the relations amid them all officially called “SuperHyperEdge”. The frameworks “SuperHyperGraph” and “neutrosophic SuperHyperGraph” are chosen and elected to research about “Cancer’s Recognitions”. Thus these complex and dense SuperHyperModels open up some avenues to research on theoretical segments and “Cancer’s Recognitions”. Some avenues are posed to pursue this research. It’s also officially collected in the form of some questions and some problems. Assume a SuperHyperGraph. An “SuperHyperAlliance” is a minimal SuperHyperSet of SuperHyperVertices with minimum cardinality such that either of the following expressions hold for the cardinalities of SuperHyperNeighbors of s∈S:,|S∩N(s)|>|S∩(V \N(s))|,and|S∩N(s)|<|S∩(V \N(s))|.Thefirst Expression, holds if S is SuperHyperOffensive. And the second Expression, holds if S is “SuperHyperDefensive”. It’s useful to define “neutrosophic” version of SuperHyperAlliances. Since there’s more ways to get type-results to make SuperHyperAlliances more understandable. For the sake of having neutrosophic SuperHyperAlliances, there’s a need to “redefine” the notion of “SuperHyperAlliances”. The SuperHyperVertices and the SuperHyperEdges are assigned by the labels from the letters of the alphabets. In this procedure, there’s the usage of the position of labels to assign to the values. Assume a SuperHyperAlliance. It’s redefined neutrosophic SuperHyperAlliance if the mentioned Table holds, concerning, “The Values of Vertices, SuperVertices, Edges, HyperEdges, and SuperHyperEdges Belong to The Neutrosophic SuperHyperGraph” with the key points, “The Values of The Vertices & The Number of Position in Alphabet”, “The Values of The SuperVertices&The Minimum Values of Its Vertices”, “The Values of The Edges&The Minimum Values of Its Vertices”, “The Values of The HyperEdges&The Minimum Values of Its Vertices”, “The Values of The SuperHyperEdges&The Minimum Values of Its Endpoints”. To get structural examples and instances, I’m going to introduce the next SuperHyperClass of SuperHyperGraph based on SuperHyperAlliances. It’s the main. It’ll be disciplinary to have the foundation of previous definition in the kind of SuperHyperClass. If there’s a need to have all SuperHyperConnectivities until the SuperHyperAlliances, then it’s officially called “SuperHyperAlliances” but otherwise, it isn’t SuperHyperAlliances. There are some instances about the clarifications for the main definition titled “SuperHyperAlliances”. These two examples get more scrutiny and discernment since there are characterized in the disciplinary ways of the SuperHyperClass based on SuperHyperAlliances. For the sake of having neutrosophic SuperHyperAlliances, there’s a need to “redefine” the notion of “neutrosophic SuperHyperAlliances” and “neutrosophic SuperHyperAlliances”. The SuperHyperVertices and the SuperHyperEdges are assigned by the labels from the letters of the alphabets. In this procedure, there’s the usage of the position of labels to assign to the values. Assume a neutrosophic SuperHyperGraph. It’s redefined “neutrosophic SuperHyperGraph” if the intended Table holds. And SuperHyperAlliances are redefined “neutrosophic SuperHyperAlliances” if the intended Table holds. It’s useful to define “neutrosophic” version of SuperHyperClasses. Since there’s more ways to get neutrosophic type-results to make neutrosophic SuperHyperAlliances more understandable. Assume a neutrosophic SuperHyperGraph. There are some neutrosophic SuperHyperClasses if the intended Table holds. Thus SuperHyperPath, SuperHyperCycle, SuperHyperStar, SuperHyperBipartite, SuperHyperMultiPartite, and SuperHyperWheel, are “neutrosophic SuperHyperPath”, “neutrosophic SuperHyperCycle”, “neutrosophic SuperHyperStar”, “neutrosophic SuperHyperBipartite”, “neutrosophic SuperHyperMultiPartite”, and “neutrosophic SuperHyperWheel” if the intended Table holds. A SuperHyperGraph has “neutrosophic SuperHyperAlliances” where it’s the strongest [the maximum neutrosophic value from all SuperHyperAlliances amid the maximum value amid all SuperHyperVertices from a SuperHyperAlliances.] SuperHyperAlliances. A graph is SuperHyperUniform if it’s SuperHyperGraph and the number of elements of SuperHyperEdges are the same. Assume a neutrosophic SuperHyperGraph. There are some SuperHyperClasses as follows. It’s SuperHyperPath if it’s only one SuperVertex as intersection amid two given SuperHyperEdges with two exceptions; it’s SuperHyperCycle if it’s only one SuperVertex as intersection amid two given SuperHyperEdges; it’s SuperHyperStar it’s only one SuperVertex as intersection amid all SuperHyperEdges; it’s SuperHyperBipartite it’s only one SuperVertex as intersection amid two given SuperHyperEdges and these SuperVertices, forming two separate sets, has no SuperHyperEdge in common; it’s SuperHyperMultiPartite it’s only one SuperVertex as intersection amid two given SuperHyperEdges and these SuperVertices, forming multi separate sets, has no SuperHyperEdge in common; it’s SuperHyperWheel if it’s only one SuperVertex as intersection amid two given SuperHyperEdges and one SuperVertex has one SuperHyperEdge with any common SuperVertex. The SuperHyperModel proposes the specific designs and the specific architectures. The SuperHyperModel is officially called “SuperHyperGraph” and “Neutrosophic SuperHyperGraph”. In this SuperHyperModel, The “specific” cells and “specific group” of cells are SuperHyperModeled as “SuperHyperVertices” and the common and intended properties between “specific” cells and “specific group” of cells are SuperHyperModeled as “SuperHyperEdges”. Sometimes, it’s useful to have some degrees of determinacy, indeterminacy, and neutrality to have more precise SuperHyperModel which in this case the SuperHyperModel is called “neutrosophic”. In the future research, the foundation will be based on the “Cancer’s Recognitions” and the results and the definitions will be introduced in redeemed ways. The recognition of the cancer in the long-term function. The specific region has been assigned by the model [it’s called SuperHyperGraph] and the long cycle of the move from the cancer is identified by this research. Sometimes the move of the cancer hasn’t be easily identified since there are some determinacy, indeterminacy and neutrality about the moves and the effects of the cancer on that region; this event leads us to choose another model [it’s said to be neutrosophic SuperHyperGraph] to have convenient perception on what’s happened and what’s done. There are some specific models, which are well-known and they’ve got the names, and some SuperHyperGeneral SuperHyperModels. The moves and the traces of the cancer on the complex tracks and between complicated groups of cells could be fantasized by a neutrosophic SuperHyperPath(-/SuperHyperCycle, SuperHyperStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). The aim is to find either the longest SuperHyperAlliances or the strongest SuperHyperAlliances in those neutrosophic SuperHyperModels. For the longest SuperHyperAlliances, called SuperHyperAlliances, and the strongest SuperHyperCycle, called neutrosophic SuperHyperAlliances, some general results are introduced. Beyond that in SuperHyperStar, all possible SuperHyperPaths have only two SuperHyperEdges but it’s not enough since it’s essential to have at least three SuperHyperEdges to form any style of a SuperHyperCycle. There isn’t any formation of any SuperHyperCycle but literarily, it’s the deformation of any SuperHyperCycle. It, literarily, deforms and it doesn’t form. A basic familiarity with SuperHyperGraph theory and neutrosophic SuperHyperGraph theory are proposed.

In this research, new setting is introduced for new SuperHyperNotions, namely, SuperHyperDefensive SuperHyperAlliances and Neutrosophic SuperHyperDefensive SuperHyperAlliances. Two different types of SuperHyperDefinitions are debut for them but the research goes further and the SuperHyperNotion, SuperHyperUniform, and SuperHyperClass based on that are well-defined and well-reviewed. The literature review is implemented in the whole of this research. For shining the elegancy and the significancy of this research, the comparison between this SuperHyperNotion with other SuperHyperNotions and fundamental SuperHyperNumbers are featured. The definitions are followed by the examples and the instances thus the clarifications are driven with different tools. The applications are figured out to make sense about the theoretical aspect of this ongoing research. The “Cancer’s Recognitions” are the under research to figure out the challenges make sense about ongoing and upcoming research. The special case is up. The cells are viewed in the deemed ways. There are different types of them. Some of them are individuals and some of them are well-modeled by the group of cells. These types are all officially called “SuperHyperVertex” but the relations amid them all officially called “SuperHyperEdge”. The frameworks “SuperHyperGraph” and “neutrosophic SuperHyperGraph” are chosen and elected to research about “Cancer’s Recognitions”. Thus these complex and dense SuperHyperModels open up some avenues to research on theoretical segments and “Cancer’s Recognitions”. Some avenues are posed to pursue this research. It’s also officially collected in the form of some questions and some problems. Assume a SuperHyperGraph. An “SuperHyperAlliance” is a minimal SuperHyperSet of SuperHyperVertices with minimum cardinality such that either of the following expressions hold for the cardinalities of SuperHyperNeighbors of s∈S:,|S∩N(s)|>|S∩(V \N(s))|,and|S∩N(s)|<|S∩(V \N(s))|.Thefirst Expression, holds if S is SuperHyperOffensive. And the second Expression, holds if S is “SuperHyperDefensive”. It’s useful to define “neutrosophic” version of SuperHyperDefensive SuperHyperAlliances. Since there’s more ways to get type-results to make SuperHyperDefensive SuperHyperAlliances more understandable. For the sake of having neutrosophic SuperHyperDefensive SuperHyperAlliances, there’s a need to “redefine” the notion of “SuperHyperDefensive SuperHyperAlliances”. The SuperHyperVertices and the SuperHyperEdges are assigned by the labels from the letters of the alphabets. In this procedure, there’s the usage of the position of labels to assign to the values. Assume a SuperHyperAlliance. It’s redefined neutrosophic SuperHyperAlliance if the mentioned Table holds, concerning, “The Values of Vertices, SuperVertices, Edges, HyperEdges, and SuperHyperEdges Belong to The Neutrosophic SuperHyperGraph” with the key points, “The Values of The Vertices & The Number of Position in Alphabet”, “The Values of The SuperVertices&The Minimum Values of Its Vertices”, “The Values of The Edges&The Minimum Values of Its Vertices”, “The Values of The HyperEdges&The Minimum Values of Its Vertices”, “The Values of The SuperHyperEdges&The Minimum Values of Its Endpoints”. To get structural examples and instances, I’m going to introduce the next SuperHyperClass of SuperHyperGraph based on SuperHyperDefensive SuperHyperAlliances. It’s the main. It’ll be disciplinary to have the foundation of previous definition in the kind of SuperHyperClass. If there’s a need to have all SuperHyperConnectivities until the SuperHyperDefensive SuperHyperAlliances, then it’s officially called “SuperHyperDefensive SuperHyperAlliances” but otherwise, it isn’t SuperHyperDefensive SuperHyperAlliances. There are some instances about the clarifications for the main definition titled “SuperHyperDefensive SuperHyperAlliances”. These two examples get more scrutiny and discernment since there are characterized in the disciplinary ways of the SuperHyperClass based on SuperHyperDefensive SuperHyperAlliances. For the sake of having neutrosophic SuperHyperDefensive SuperHyperAlliances, there’s a need to “redefine” the notion of “neutrosophic SuperHyperDefensive SuperHyperAlliances” and “neutrosophic SuperHyperDefensive SuperHyperAlliances”. The SuperHyperVertices and the SuperHyperEdges are assigned by the labels from the letters of the alphabets. In this procedure, there’s the usage of the position of labels to assign to the values. Assume a neutrosophic SuperHyperGraph. It’s redefined “neutrosophic SuperHyperGraph” if the intended Table holds. And SuperHyperDefensive SuperHyperAlliances are redefined “neutrosophic SuperHyperDefensive SuperHyperAlliances” if the intended Table holds. It’s useful to define “neutrosophic” version of SuperHyperClasses. Since there’s more ways to get neutrosophic type-results to make neutrosophic SuperHyperDefensive SuperHyperAlliances more understandable. Assume a neutrosophic SuperHyperGraph. There are some neutrosophic SuperHyperClasses if the intended Table holds. Thus SuperHyperPath, SuperHyperCycle, SuperHyperStar, SuperHyperBipartite, SuperHyperMultiPartite, and SuperHyperWheel, are “neutrosophic SuperHyperPath”, “neutrosophic SuperHyperCycle”, “neutrosophic SuperHyperStar”, “neutrosophic SuperHyperBipartite”, “neutrosophic SuperHyperMultiPartite”, and “neutrosophic SuperHyperWheel” if the intended Table holds. A SuperHyperGraph has “neutrosophic SuperHyperDefensive SuperHyperAlliances” where it’s the strongest [the maximum neutrosophic value from all SuperHyperDefensive SuperHyperAlliances amid the maximum value amid all SuperHyperVertices from a SuperHyperDefensive SuperHyperAlliances.] SuperHyperDefensive SuperHyperAlliances. A graph is SuperHyperUniform if it’s SuperHyperGraph and the number of elements of SuperHyperEdges are the same. Assume a neutrosophic SuperHyperGraph. There are some SuperHyperClasses as follows. It’s SuperHyperPath if it’s only one SuperVertex as intersection amid two given SuperHyperEdges with two exceptions; it’s SuperHyperCycle if it’s only one SuperVertex as intersection amid two given SuperHyperEdges; it’s SuperHyperStar it’s only one SuperVertex as intersection amid all SuperHyperEdges; it’s SuperHyperBipartite it’s only one SuperVertex as intersection amid two given SuperHyperEdges and these SuperVertices, forming two separate sets, has no SuperHyperEdge in common; it’s SuperHyperMultiPartite it’s only one SuperVertex as intersection amid two given SuperHyperEdges and these SuperVertices, forming multi separate sets, has no SuperHyperEdge in common; it’s SuperHyperWheel if it’s only one SuperVertex as intersection amid two given SuperHyperEdges and one SuperVertex has one SuperHyperEdge with any common SuperVertex. The SuperHyperModel proposes the specific designs and the specific architectures. The SuperHyperModel is officially called “SuperHyperGraph” and “Neutrosophic SuperHyperGraph”. In this SuperHyperModel, The “specific” cells and “specific group” of cells are SuperHyperModeled as “SuperHyperVertices” and the common and intended properties between “specific” cells and “specific group” of cells are SuperHyperModeled as “SuperHyperEdges”. Sometimes, it’s useful to have some degrees of determinacy, indeterminacy, and neutrality to have more precise SuperHyperModel which in this case the SuperHyperModel is called “neutrosophic”. In the future research, the foundation will be based on the “Cancer’s Recognitions” and the results and the definitions will be introduced in redeemed ways. The recognition of the cancer in the long-term function. The specific region has been assigned by the model [it’s called SuperHyperGraph] and the long cycle of the move from the cancer is identified by this research. Sometimes the move of the cancer hasn’t be easily identified since there are some determinacy, indeterminacy and neutrality about the moves and the effects of the cancer on that region; this event leads us to choose another model [it’s said to be neutrosophic SuperHyperGraph] to have convenient perception on what’s happened and what’s done. There are some specific models, which are well-known and they’ve got the names, and some SuperHyperGeneral SuperHyperModels. The moves and the traces of the cancer on the complex tracks and between complicated groups of cells could be fantasized by a neutrosophic SuperHyperPath(-/SuperHyperCycle, SuperHyperStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). The aim is to find either the longest SuperHyperDefensive SuperHyperAlliances or the strongest SuperHyperDefensive SuperHyperAlliances in those neutrosophic SuperHyperModels. For the longest SuperHyperDefensive SuperHyperAlliances, called SuperHyperDefensive SuperHyperAlliances, and the strongest SuperHyperCycle, called neutrosophic SuperHyperDefensive SuperHyperAlliances, some general results are introduced. Beyond that in SuperHyperStar, all possible SuperHyperPaths have only two SuperHyperEdges but it’s not enough since it’s essential to have at least three SuperHyperEdges to form any style of a SuperHyperCycle. There isn’t any formation of any SuperHyperCycle but literarily, it’s the deformation of any SuperHyperCycle. It, literarily, deforms and it doesn’t form. A basic familiarity with SuperHyperGraph theory and neutrosophic SuperHyperGraph theory are proposed.

In this research, the neutrosophic SuperHyperNotion, namely, neutrosophic SuperHyperGirth, is up. $E_1$ and $E_3$ are some empty neutrosophic SuperHyperEdges but $E_2$ is a loop neutrosophic SuperHyperEdge and $E_4$ is an neutrosophic SuperHyperEdge. Thus in the terms of neutrosophic SuperHyperNeighbor, there's only one neutrosophic SuperHyperEdge, namely, $E_4.$ The neutrosophic SuperHyperVertex, $V_3$ is neutrosophic isolated means that there's no neutrosophic SuperHyperEdge has it as an neutrosophic endpoint. Thus the neutrosophic SuperHyperVertex, $V_3,$ is excluded in every given neutrosophic SuperHyperGirth. $ \mathcal{C}(NSHG)=\{E_i\}~\text{is an neutrosophic SuperHyperGirth.} \ \ \mathcal{C}(NSHG)=jz^i~\text{is an neutrosophic SuperHyperGirth SuperHyperPolynomial.} \ \ \mathcal{C}(NSHG)=\{V_i\}~\text{is an neutrosophic R-SuperHyperGirth.} \ \ \mathcal{C}(NSHG)=jz^I~{\small\text{is an neutrosophic R-SuperHyperGirth SuperHyperPolynomial.}} $ The following neutrosophic SuperHyperSet of neutrosophic SuperHyperEdges[SuperHyperVertices] is the neutrosophic type-SuperHyperSet of the neutrosophic SuperHyperGirth. The neutrosophic SuperHyperSet of neutrosophic SuperHyperEdges[SuperHyperVertices], is the neutrosophic type-SuperHyperSet of the neutrosophic SuperHyperGirth. The neutrosophic SuperHyperSet of the neutrosophic SuperHyperEdges[SuperHyperVertices], is an neutrosophic SuperHyperGirth $\mathcal{C}(ESHG)$ for an neutrosophic SuperHyperGraph $ESHG:(V,E)$ is an neutrosophic type-SuperHyperSet with the maximum neutrosophic cardinality of an neutrosophic SuperHyperSet $S$ of neutrosophic SuperHyperEdges[SuperHyperVertices] such that there's only one neutrosophic consecutive sequence of the neutrosophic SuperHyperVertices and the neutrosophic SuperHyperEdges form only one neutrosophic SuperHyperCycle. There are not only four neutrosophic SuperHyperVertices inside the intended neutrosophic SuperHyperSet. Thus the non-obvious neutrosophic SuperHyperGirth isn't up. The obvious simple neutrosophic type-SuperHyperSet called the neutrosophic SuperHyperGirth is an neutrosophic SuperHyperSet includes only less than four neutrosophic SuperHyperVertices. But the neutrosophic SuperHyperSet of the neutrosophic SuperHyperEdges[SuperHyperVertices], doesn't have less than four SuperHyperVertices inside the intended neutrosophic SuperHyperSet. Thus the non-obvious simple neutrosophic type-SuperHyperSet of the neutrosophic SuperHyperGirth isn't up. To sum them up, the neutrosophic SuperHyperSet of the neutrosophic SuperHyperEdges[SuperHyperVertices], isn't the non-obvious simple neutrosophic type-SuperHyperSet of the neutrosophic SuperHyperGirth. Since the neutrosophic SuperHyperSet of the neutrosophic SuperHyperEdges[SuperHyperVertices], is an neutrosophic SuperHyperGirth $\mathcal{C}(ESHG)$ for an neutrosophic SuperHyperGraph $ESHG:(V,E)$ is the neutrosophic SuperHyperSet $S$ of neutrosophic SuperHyperVertices[SuperHyperEdges] such that there's only one neutrosophic consecutive neutrosophic sequence of neutrosophic SuperHyperVertices and neutrosophic SuperHyperEdges form only one neutrosophic SuperHyperCycle given by that neutrosophic type-SuperHyperSet called the neutrosophic SuperHyperGirth and it's an neutrosophic SuperHyperGirth . Since it 's the maximum neutrosophic cardinality of an neutrosophic SuperHyperSet $S$ of neutrosophic SuperHyperEdges[SuperHyperVertices] such that there's only one neutrosophic consecutive neutrosophic sequence of neutrosophic SuperHyperVertices and neutrosophic SuperHyperEdges form only one neutrosophic SuperHyperCycle. There are only less than four neutrosophic SuperHyperVertices inside the intended neutrosophic SuperHyperSet, thus the obvious neutrosophic SuperHyperGirth, is up. The obvious simple neutrosophic type-SuperHyperSet of the neutrosophic SuperHyperGirth, is: ,is the neutrosophic SuperHyperSet, is: does includes only less than four SuperHyperVertices in a connected neutrosophic SuperHyperGraph $ESHG:(V,E).$ It's interesting to mention that the only simple neutrosophic type-SuperHyperSet called the neutrosophic SuperHyperGirth amid those obvious[non-obvious] simple neutrosophic type-SuperHyperSets called the neutrosophic SuperHyperGirth , is only and only. A basic familiarity with neutrosophic SuperHyperGirth theory, SuperHyperGraphs, and neutrosophic SuperHyperGraphs theory are proposed.

in this research, new setting is introduced for new SuperHyperNotion, namely, Neutrosophic SuperHyperStable. In this research article, there are some research segments for ``Neutrosophic SuperHyperStable'' about some researches on neutrosophic SuperHyperStable. With researches on the basic properties, the research article starts to make neutrosophic SuperHyperStable theory more understandable. Assume a neutrosophic SuperHyperGraph. Then a ``neutrosophic SuperHyperStable'' $\mathcal{I}_n(NSHG)$ for a neutrosophic SuperHyperGraph $NSHG:(V,E)$ is the maximum neutrosophic cardinality of a neutrosophic SuperHyperSet $S$ of neutrosophic SuperHyperVertices such that there's no neutrosophic SuperHyperVertex to have a neutrosophic SuperHyperEdge in common. A basic familiarity with SuperHyperGraph theory and neutrosophic SuperHyperGraph theory are proposed.

In this research, new setting is introduced for new SuperHyperNotion, namely, 11 Neutrosophic 1-failed SuperHyperForcing. Two different types of SuperHyperDefinitions 12 are debut for them but the research goes further and the SuperHyperNotion, 13 SuperHyperUniform, and SuperHyperClass based on that are well-defined and 14 well-reviewed. The literature review is implemented in the whole of this research. For 15 shining the elegancy and the significancy of this research, the comparison between this 16 SuperHyperNotion with other SuperHyperNotions and fundamental 17 SuperHyperNumbers are featured. The definitions are followed by the examples and the 18 instances thus the clarifications are driven with different tools. The applications are 19 figured out to make sense about the theoretical aspect of this ongoing research. The 20 “Cancer’s Neutrosophic Recognition” are the under research to figure out the challenges 21 make sense about ongoing and upcoming research. The special case is up. The cells are 22 viewed in the deemed ways. There are different types of them. Some of them are 23 individuals and some of them are well-modeled by the group of cells. These types are all 24 officially called “SuperHyperVertex” but the relations amid them all officially called 25 “SuperHyperEdge”. The frameworks “SuperHyperGraph” and “neutrosophic 26 SuperHyperGraph” are chosen and elected to research about “Cancer’s Neutrosophic 27 Recognition”. Thus these complex and dense SuperHyperModels open up some avenues 28 to research on theoretical segments and “Cancer’s Neutrosophic Recognition”. Some 29 avenues are posed to pursue this research. It’s also officially collected in the form of 30 some questions and some problems. Assume a SuperHyperGraph. Then a “1-failed 31 SuperHyperForcing” Z(NSHG) for a neutrosophic SuperHyperGraph NSHG : (V,E) 32 is the maximum cardinality of a SuperHyperSet S of black SuperHyperVertices 33 (whereas SuperHyperVertices in V (G) \ S are colored white) such that V (G) isn’t 34 turned black after finitely many applications of “the color-change rule”: a white 35 SuperHyperVertex is converted to a black SuperHyperVertex if it is the only white 36 SuperHyperNeighbor of a black SuperHyperVertex. The additional condition is referred 37 by “1-” about the usage of any black SuperHyperVertex only once to act on white 38 SuperHyperVertex to be black SuperHyperVertex; a “neutrosophic 1-failed 39 SuperHyperForcing” Zn(NSHG) for a neutrosophic SuperHyperGraph NSHG : (V,E) 40 is the maximum neutrosophic cardinality of a SuperHyperSet S of black 41 SuperHyperVertices (whereas SuperHyperVertices in V (G) \ S are colored white) such 42 that V (G) isn’t turned black after finitely many applications of “the color-change rule”: 43 a white SuperHyperVertex is converted to a black SuperHyperVertex if it is the only 44 1/128 white SuperHyperNeighbor of a black SuperHyperVertex. The additional condition is 45 referred by “1-” about the usage of any black SuperHyperVertex only once to act on 46 white SuperHyperVertex to be black SuperHyperVertex. Assume a SuperHyperGraph. 47 Then an “δ−1-failed SuperHyperForcing” is a maximal 1-failed SuperHyperForcing of 48 SuperHyperVertices with maximum cardinality such that either of the following 49 expressions hold for the (neutrosophic) cardinalities of SuperHyperNeighbors of s ∈ S : 50 |S ∩N(s)| > |S ∩(V \N(s))|+δ, |S ∩N(s)| < |S ∩(V \N(s))|+δ. The first Expression, 51 holds if S is an “δ−SuperHyperOffensive”. And the second Expression, holds if S is an 52 “δ−SuperHyperDefensive”; a“neutrosophic δ−1-failed SuperHyperForcing” is a maximal 53 neutrosophic 1-failed SuperHyperForcing of SuperHyperVertices with maximum 54 neutrosophic cardinality such that either of the following expressions hold for the 55 neutrosophic cardinalities of SuperHyperNeighbors of s ∈ S : |S ∩ N(s)|neutrosophic > 56 |S ∩ (V \ N (s))|neutrosophic + δ, |S ∩ N (s)|neutrosophic < |S ∩ (V \ N (s))|neutrosophic + δ. 57 The first Expression, holds if S is a “neutrosophic δ−SuperHyperOffensive”. And the 58 second Expression, holds if S is a “neutrosophic δ−SuperHyperDefensive”. It’s useful to 59 define “neutrosophic” version of 1-failed SuperHyperForcing. Since there’s more ways to 60 get type-results to make 1-failed SuperHyperForcing more understandable. For the sake 61 of having neutrosophic 1-failed SuperHyperForcing, there’s a need to “redefine” the 62 notion of “1-failed SuperHyperForcing”. The SuperHyperVertices and the 63 SuperHyperEdges are assigned by the labels from the letters of the alphabets. In this 64 procedure, there’s the usage of the position of labels to assign to the values. Assume a 65 1-failed SuperHyperForcing. It’s redefined neutrosophic 1-failed SuperHyperForcing if 66 the mentioned Table holds, concerning, “The Values of Vertices, SuperVertices, Edges, 67 HyperEdges, and SuperHyperEdges Belong to The Neutrosophic SuperHyperGraph” 68 with the key points, “The Values of The Vertices & The Number of Position in 69 Alphabet”, “The Values of The SuperVertices&The maximum Values of Its Vertices”, 70 “The Values of The Edges&The maximum Values of Its Vertices”, “The Values of The 71 HyperEdges&The maximum Values of Its Vertices”, “The Values of The 72 SuperHyperEdges&The maximum Values of Its Endpoints”. To get structural examples 73 and instances, I’m going to introduce the next SuperHyperClass of SuperHyperGraph 74 based on 1-failed SuperHyperForcing. It’s the main. It’ll be disciplinary to have the 75 foundation of previous definition in the kind of SuperHyperClass. If there’s a need to 76 have all SuperHyperConnectivities until the 1-failed SuperHyperForcing, then it’s 77 officially called “1-failed SuperHyperForcing” but otherwise, it isn’t 1-failed 78 SuperHyperForcing. There are some instances about the clarifications for the main 79 definition titled “1-failed SuperHyperForcing”. These two examples get more scrutiny 80 and discernment since there are characterized in the disciplinary ways of the 81 SuperHyperClass based on 1-failed SuperHyperForcing. For the sake of having 82 neutrosophic 1-failed SuperHyperForcing, there’s a need to “redefine” the notion of 83 “neutrosophic 1-failed SuperHyperForcing” and “neutrosophic 1-failed 84 SuperHyperForcing”. The SuperHyperVertices and the SuperHyperEdges are assigned 85 by the labels from the letters of the alphabets. In this procedure, there’s the usage of 86 the position of labels to assign to the values. Assume a neutrosophic SuperHyperGraph. 87 It’s redefined “neutrosophic SuperHyperGraph” if the intended Table holds. And 88 1-failed SuperHyperForcing are redefined “neutrosophic 1-failed SuperHyperForcing” if 89 the intended Table holds. It’s useful to define “neutrosophic” version of 90 SuperHyperClasses. Since there’s more ways to get neutrosophic type-results to make 91 neutrosophic 1-failed SuperHyperForcing more understandable. Assume a neutrosophic 92 SuperHyperGraph. There are some neutrosophic SuperHyperClasses if the intended 93 Table holds. Thus SuperHyperPath, SuperHyperCycle, SuperHyperStar, 94 SuperHyperBipartite, SuperHyperMultiPartite, and SuperHyperWheel, are 95 “neutrosophic SuperHyperPath”, “neutrosophic SuperHyperCycle”, “neutrosophic 96 SuperHyperStar”, “neutrosophic SuperHyperBipartite”, “neutrosophic 97 2/128 SuperHyperMultiPartite”, and “neutrosophic SuperHyperWheel” if the intended Table 98 holds. A SuperHyperGraph has “neutrosophic 1-failed SuperHyperForcing” where it’s 99 the strongest [the maximum neutrosophic value from all 1-failed SuperHyperForcing 100 amid the maximum value amid all SuperHyperVertices from a 1-failed 101 SuperHyperForcing.] 1-failed SuperHyperForcing. A graph is SuperHyperUniform if it’s 102 SuperHyperGraph and the number of elements of SuperHyperEdges are the same. 103 Assume a neutrosophic SuperHyperGraph. There are some SuperHyperClasses as 104 follows. It’s SuperHyperPath if it’s only one SuperVertex as intersection amid two given 105 SuperHyperEdges with two exceptions; it’s SuperHyperCycle if it’s only one 106 SuperVertex as intersection amid two given SuperHyperEdges; it’s SuperHyperStar it’s 107 only one SuperVertex as intersection amid all SuperHyperEdges; it’s 108 SuperHyperBipartite it’s only one SuperVertex as intersection amid two given 109 SuperHyperEdges and these SuperVertices, forming two separate sets, has no 110 SuperHyperEdge in common; it’s SuperHyperMultiPartite it’s only one SuperVertex as 111 intersection amid two given SuperHyperEdges and these SuperVertices, forming multi 112 separate sets, has no SuperHyperEdge in common; it’s SuperHyperWheel if it’s only one 113 SuperVertex as intersection amid two given SuperHyperEdges and one SuperVertex has 114 one SuperHyperEdge with any common SuperVertex. The SuperHyperModel proposes 115 the specific designs and the specific architectures. The SuperHyperModel is officially 116 called “SuperHyperGraph” and “Neutrosophic SuperHyperGraph”. In this 117 SuperHyperModel, The “specific” cells and “specific group” of cells are 118 SuperHyperModeled as “SuperHyperVertices” and the common and intended properties 119 between “specific” cells and “specific group” of cells are SuperHyperModeled as 120 “SuperHyperEdges”. Sometimes, it’s useful to have some degrees of determinacy, 121 indeterminacy, and neutrality to have more precise SuperHyperModel which in this case 122 the SuperHyperModel is called “neutrosophic”. In the future research, the foundation 123 will be based on the “Cancer’s Neutrosophic Recognition” and the results and the 124 definitions will be introduced in redeemed ways. The neutrosophic recognition of the 125 cancer in the long-term function. The specific region has been assigned by the model 126 [it’s called SuperHyperGraph] and the long cycle of the move from the cancer is 127 identified by this research. Sometimes the move of the cancer hasn’t be easily identified 128 since there are some determinacy, indeterminacy and neutrality about the moves and 129 the effects of the cancer on that region; this event leads us to choose another model [it’s 130 said to be neutrosophic SuperHyperGraph] to have convenient perception on what’s 131 happened and what’s done. There are some specific models, which are well-known and 132 they’ve got the names, and some SuperHyperGeneral SuperHyperModels. The moves 133 and the traces of the cancer on the complex tracks and between complicated groups of 134 cells could be fantasized by a neutrosophic SuperHyperPath(-/SuperHyperCycle, 135 SuperHyperStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). 136 The aim is to find either the longest 1-failed SuperHyperForcing or the strongest 137 1-failed SuperHyperForcing in those neutrosophic SuperHyperModels. For the longest 138 1-failed SuperHyperForcing, called 1-failed SuperHyperForcing, and the strongest 139 SuperHyperCycle, called neutrosophic 1-failed SuperHyperForcing, some general results 140 are introduced. Beyond that in SuperHyperStar, all possible SuperHyperPaths have 141 only two SuperHyperEdges but it’s not enough since it’s essential to have at least three 142 SuperHyperEdges to form any style of a SuperHyperCycle. There isn’t any formation of 143 any SuperHyperCycle but literarily, it’s the deformation of any SuperHyperCycle. It, 144 literarily, deforms and it doesn’t form. A basic familiarity with SuperHyperGraph 145 theory and neutrosophic SuperHyperGraph theory are proposed.

In this research, new setting is introduced for new SuperHyperNotions, namely, an 1-failed SuperHyperForcing and Neutrosophic 1-failed SuperHyperForcing. Assume a SuperHyperGraph. Then an ``1-failed SuperHyperForcing'' $\mathcal{Z}(NSHG)$ for a neutrosophic SuperHyperGraph $NSHG:(V,E)$ is the maximum cardinality of a SuperHyperSet $S$ of black SuperHyperVertices (whereas SuperHyperVertices in $V(G) \setminus S$ are colored white) such that $V(G)$ isn't turned black after finitely many applications of ``the color-change rule'': a white SuperHyperVertex is converted to a black SuperHyperVertex if it is the only white SuperHyperNeighbor of a black SuperHyperVertex. The additional condition is referred by ``1-'' about the usage of any black SuperHyperVertex only once to act on white SuperHyperVertex to be black SuperHyperVertex; a ``neutrosophic 1-failed SuperHyperForcing'' $\mathcal{Z}_n(NSHG)$ for a neutrosophic SuperHyperGraph $NSHG:(V,E)$ is the maximum neutrosophic cardinality of a SuperHyperSet $S$ of black SuperHyperVertices (whereas SuperHyperVertices in $V(G) \setminus S$ are colored white) such that $V(G)$ isn't turned black after finitely many applications of ``the color-change rule'': a white SuperHyperVertex is converted to a black SuperHyperVertex if it is the only white SuperHyperNeighbor of a black SuperHyperVertex. The additional condition is referred by ``1-'' about the usage of any black SuperHyperVertex only once to act on white SuperHyperVertex to be black SuperHyperVertex. Assume a SuperHyperGraph. Then an ``$\delta-$1-failed SuperHyperForcing'' is a \underline{maximal} 1-failed SuperHyperForcing of SuperHyperVertices with \underline{maximum} cardinality such that either of the following expressions hold for the (neutrosophic) cardinalities of SuperHyperNeighbors of $s\in S:$ $~|S\cap N(s)| > |S\cap (V\setminus N(s))|+\delta,~|S\cap N(s)| < |S\cap (V\setminus N(s))|+\delta.$ The first Expression, holds if $S$ is an ``$\delta-$SuperHyperOffensive''. And the second Expression, holds if $S$ is an ``$\delta-$SuperHyperDefensive''; a``neutrosophic $\delta-$1-failed SuperHyperForcing'' is a \underline{maximal} neutrosophic 1-failed SuperHyperForcing of SuperHyperVertices with \underline{maximum} neutrosophic cardinality such that either of the following expressions hold for the neutrosophic cardinalities of SuperHyperNeighbors of $s\in S:$ $~|S\cap N(s)|_{neutrosophic} > |S\cap (V\setminus N(s))|_{neutrosophic}+\delta,~ |S\cap N(s)|_{neutrosophic} < |S\cap (V\setminus N(s))|_{neutrosophic}+\delta.$ The first Expression, holds if $S$ is a ``neutrosophic $\delta-$SuperHyperOffensive''. And the second Expression, holds if $S$ is a ``neutrosophic $\delta-$SuperHyperDefensive''. A basic familiarity with SuperHyperGraph theory and neutrosophic SuperHyperGraph theory are proposed.

In this research, new setting is introduced for new SuperHyperNotions, namely, an SuperHyperStable and Neutrosophic SuperHyperStable. Two different types of SuperHyperDefinitions are debut for them but the research goes further and the SuperHyperNotion, SuperHyperUniform, and SuperHyperClass based on that are well-defined and well-reviewed. The literature review is implemented in the whole of this research. For shining the elegancy and the significancy of this research, the comparison between this SuperHyperNotion with other SuperHyperNotions and fundamental SuperHyperNumbers are featured. The definitions are followed by the examples and the instances thus the clarifications are driven with different tools. The applications are figured out to make sense about the theoretical aspect of this ongoing research. The ``Cancer's Recognitions'' are the under research to figure out the challenges make sense about ongoing and upcoming research. The special case is up. The cells are viewed in the deemed ways. There are different types of them. Some of them are individuals and some of them are well-modeled by the group of cells. These types are all officially called ``SuperHyperVertex'' but the relations amid them all officially called ``SuperHyperEdge''. The frameworks ``SuperHyperGraph'' and ``neutrosophic SuperHyperGraph'' are chosen and elected to research about ``Cancer's Recognitions''. Thus these complex and dense SuperHyperModels open up some avenues to research on theoretical segments and ``Cancer's Recognitions''. Some avenues are posed to pursue this research. It's also officially collected in the form of some questions and some problems. Assume a SuperHyperGraph. Then a``SuperHyperStable'' $\mathcal{I}(NSHG)$ for a SuperHyperGraph $NSHG:(V,E)$ is the maximum cardinality of a SuperHyperSet $S$ of SuperHyperVertices such that there's no SuperHyperVertex to have a SuperHyperEdge in common. Assume a SuperHyperGraph. Then an ``$\delta-$SuperHyperStable'' is a \underline{maximal} SuperHyperStable of SuperHyperVertices with \underline{maximum} cardinality such that either of the following expressions hold for the (neutrosophic) cardinalities of SuperHyperNeighbors of $s\in S:$ $~|S\cap N(s)| > |S\cap (V\setminus N(s))|+\delta,~|S\cap N(s)| < |S\cap (V\setminus N(s))|+\delta.$ The first Expression, holds if $S$ is an ``$\delta-$SuperHyperOffensive''. And the second Expression, holds if $S$ is an ``$\delta-$SuperHyperDefensive''; a``neutrosophic $\delta-$SuperHyperStable'' is a \underline{maximal} neutrosophic SuperHyperStable of SuperHyperVertices with \underline{maximum} neutrosophic cardinality such that either of the following expressions hold for the neutrosophic cardinalities of SuperHyperNeighbors of $s\in S:$ $~|S\cap N(s)|_{neutrosophic} > |S\cap (V\setminus N(s))|_{neutrosophic}+\delta,~ |S\cap N(s)|_{neutrosophic} < |S\cap (V\setminus N(s))|_{neutrosophic}+\delta.$ The first Expression, holds if $S$ is a ``neutrosophic $\delta-$SuperHyperOffensive''. And the second Expression, holds if $S$ is a ``neutrosophic $\delta-$SuperHyperDefensive''. It's useful to define a ``neutrosophic'' version of an SuperHyperStable. Since there's more ways to get type-results to make an SuperHyperStable more understandable. For the sake of having neutrosophic SuperHyperStable, there's a need to ``redefine'' the notion of an ``SuperHyperStable''. The SuperHyperVertices and the SuperHyperEdges are assigned by the labels from the letters of the alphabets. In this procedure, there's the usage of the position of labels to assign to the values. Assume an SuperHyperStable. It's redefined a neutrosophic SuperHyperStable if the mentioned Table holds, concerning, ``The Values of Vertices, SuperVertices, Edges, HyperEdges, and SuperHyperEdges Belong to The Neutrosophic SuperHyperGraph'' with the key points, ``The Values of The Vertices \& The Number of Position in Alphabet'', ``The Values of The SuperVertices\&The maximum Values of Its Vertices'', ``The Values of The Edges\&The maximum Values of Its Vertices'', ``The Values of The HyperEdges\&The maximum Values of Its Vertices'', ``The Values of The SuperHyperEdges\&The maximum Values of Its Endpoints''. To get structural examples and instances, I'm going to introduce the next SuperHyperClass of SuperHyperGraph based on an SuperHyperStable. It's the main. It'll be disciplinary to have the foundation of previous definition in the kind of SuperHyperClass. If there's a need to have all SuperHyperConnectivities until the SuperHyperStable, then it's officially called an ``SuperHyperStable'' but otherwise, it isn't an SuperHyperStable. There are some instances about the clarifications for the main definition titled an ``SuperHyperStable''. These two examples get more scrutiny and discernment since there are characterized in the disciplinary ways of the SuperHyperClass based on an SuperHyperStable. For the sake of having a neutrosophic SuperHyperStable, there's a need to ``redefine'' the notion of a ``neutrosophic SuperHyperStable'' and a ``neutrosophic SuperHyperStable''. The SuperHyperVertices and the SuperHyperEdges are assigned by the labels from the letters of the alphabets. In this procedure, there's the usage of the position of labels to assign to the values. Assume a neutrosophic SuperHyperGraph. It's redefined ``neutrosophic SuperHyperGraph'' if the intended Table holds. And an SuperHyperStable are redefined to an ``neutrosophic SuperHyperStable'' if the intended Table holds. It's useful to define ``neutrosophic'' version of SuperHyperClasses. Since there's more ways to get neutrosophic type-results to make a neutrosophic SuperHyperStable more understandable. Assume a neutrosophic SuperHyperGraph. There are some neutrosophic SuperHyperClasses if the intended Table holds. Thus SuperHyperPath, SuperHyperCycle, SuperHyperStar, SuperHyperBipartite, SuperHyperMultiPartite, and SuperHyperWheel, are ``neutrosophic SuperHyperPath'', ``neutrosophic SuperHyperCycle'', ``neutrosophic SuperHyperStar'', ``neutrosophic SuperHyperBipartite'', ``neutrosophic SuperHyperMultiPartite'', and ``neutrosophic SuperHyperWheel'' if the intended Table holds. A SuperHyperGraph has a ``neutrosophic SuperHyperStable'' where it's the strongest [the maximum neutrosophic value from all the SuperHyperStable amid the maximum value amid all SuperHyperVertices from an SuperHyperStable.] SuperHyperStable. A graph is a SuperHyperUniform if it's a SuperHyperGraph and the number of elements of SuperHyperEdges are the same. Assume a neutrosophic SuperHyperGraph. There are some SuperHyperClasses as follows. It's SuperHyperPath if it's only one SuperVertex as intersection amid two given SuperHyperEdges with two exceptions; it's SuperHyperCycle if it's only one SuperVertex as intersection amid two given SuperHyperEdges; it's SuperHyperStar it's only one SuperVertex as intersection amid all SuperHyperEdges; it's SuperHyperBipartite it's only one SuperVertex as intersection amid two given SuperHyperEdges and these SuperVertices, forming two separate sets, has no SuperHyperEdge in common; it's SuperHyperMultiPartite it's only one SuperVertex as intersection amid two given SuperHyperEdges and these SuperVertices, forming multi separate sets, has no SuperHyperEdge in common; it's a SuperHyperWheel if it's only one SuperVertex as intersection amid two given SuperHyperEdges and one SuperVertex has one SuperHyperEdge with any common SuperVertex. The SuperHyperModel proposes the specific designs and the specific architectures. The SuperHyperModel is officially called ``SuperHyperGraph'' and ``Neutrosophic SuperHyperGraph''. In this SuperHyperModel, The ``specific'' cells and ``specific group'' of cells are SuperHyperModeled as ``SuperHyperVertices'' and the common and intended properties between ``specific'' cells and ``specific group'' of cells are SuperHyperModeled as ``SuperHyperEdges''. Sometimes, it's useful to have some degrees of determinacy, indeterminacy, and neutrality to have more precise SuperHyperModel which in this case the SuperHyperModel is called ``neutrosophic''. In the future research, the foundation will be based on the ``Cancer's Recognitions'' and the results and the definitions will be introduced in redeemed ways. The recognition of the cancer in the long-term function. The specific region has been assigned by the model [it's called SuperHyperGraph] and the long cycle of the move from the cancer is identified by this research. Sometimes the move of the cancer hasn't be easily identified since there are some determinacy, indeterminacy and neutrality about the moves and the effects of the cancer on that region; this event leads us to choose another model [it's said to be neutrosophic SuperHyperGraph] to have convenient perception on what's happened and what's done. There are some specific models, which are well-known and they've got the names, and some SuperHyperGeneral SuperHyperModels. The moves and the traces of the cancer on the complex tracks and between complicated groups of cells could be fantasized by a neutrosophic SuperHyperPath(-/SuperHyperCycle, SuperHyperStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). The aim is to find either the longest SuperHyperStable or the strongest SuperHyperStable in those neutrosophic SuperHyperModels. For the longest SuperHyperStable, called SuperHyperStable, and the strongest SuperHyperCycle, called neutrosophic SuperHyperStable, some general results are introduced. Beyond that in SuperHyperStar, all possible SuperHyperPaths have only two SuperHyperEdges but it's not enough since it's essential to have at least three SuperHyperEdges to form any style of a SuperHyperCycle. There isn't any formation of any SuperHyperCycle but literarily, it's the deformation of any SuperHyperCycle. It, literarily, deforms and it doesn't form. A basic familiarity with SuperHyperGraph theory and neutrosophic SuperHyperGraph theory are proposed.

I introduce now for the first time the neutrosophic modal logic. The Neutrosophic Modal Logic includes the neutrosophic operators that express the modalities. It is an extension of neutrosophic predicate logic, and of neutrosophic propositional logic. In order for the paper to be self-contained, I also recall the etymology and definition of neutrosophy and of neutrosophic logic. Several examples are presented as well.

In this research, Assume a neutrosophic SuperHyperGraph. Then a ``Failed SuperHyperStable $\mathcal{I}(NSHG)$ for a SuperHyperGraph $NSHG:(V,E)$ is the maximum cardinality of a SuperHyperSet $S$ of SuperHyperVertices such that there's a SuperHyperVertex to have a SuperHyperEdge in common; a ``neutrosophic Failed SuperHyperStable'' $\mathcal{I}_n(NSHG)$ for a neutrosophic SuperHyperGraph $NSHG:(V,E)$ is the maximum neutrosophic cardinality of a neutrosophic SuperHyperSet $S$ of neutrosophic SuperHyperVertices such that there's a neutrosophic SuperHyperVertex to have a neutrosophic SuperHyperEdge in common. Assume a SuperHyperGraph. Then an ``$\delta-$Failed SuperHyperStable'' is a \underline{maximal} Failed SuperHyperStable of SuperHyperVertices with \underline{maximum} cardinality such that either of the following expressions hold for the (neutrosophic) cardinalities of SuperHyperNeighbors of $s\in S:$ $~|S\cap N(s)| > |S\cap (V\setminus N(s))|+\delta,~|S\cap N(s)| < |S\cap (V\setminus N(s))|+\delta.$ The first Expression, holds if $S$ is an ``$\delta-$SuperHyperOffensive''. And the second Expression, holds if $S$ is an ``$\delta-$SuperHyperDefensive''; a``neutrosophic $\delta-$Failed SuperHyperStable'' is a \underline{maximal} neutrosophic Failed SuperHyperStable of SuperHyperVertices with \underline{maximum} neutrosophic cardinality such that either of the following expressions hold for the neutrosophic cardinalities of SuperHyperNeighbors of $s\in S:$ $~|S\cap N(s)|_{neutrosophic} > |S\cap (V\setminus N(s))|_{neutrosophic}+\delta,~ |S\cap N(s)|_{neutrosophic} < |S\cap (V\setminus N(s))|_{neutrosophic}+\delta.$ The first Expression, holds if $S$ is a ``neutrosophic $\delta-$SuperHyperOffensive''. And the second Expression, holds if $S$ is a ``neutrosophic $\delta-$SuperHyperDefensive''. A basic familiarity with Extreme Failed SuperHyperClique theory, Neutrosophic Failed SuperHyperClique theory, and (Neutrosophic) SuperHyperGraphs theory are proposed.

In this research, assume a SuperHyperGraph. Then a neutrosophic SuperHyperMatching $\mathcal{C}(NSHG)$ for a neutrosophic SuperHyperGraph $NSHG:(V,E)$ is the maximum neutrosophic cardinality of a neutrosophic SuperHyperSet $S$ of high neutrosophic cardinality neutrosophic SuperHyperEdges such that there's no neutrosophic SuperHyperVertex not to in a neutrosophic SuperHyperEdge and there's no neutrosophic SuperHyperEdge to have a neutrosophic SuperHyperVertex in a neutrosophic SuperHyperEdge; a neutrosophic SuperHyperMatching SuperHyperPolynomial $\mathcal{C}(NSHG)$ for a neutrosophic SuperHyperGraph $NSHG:(V,E)$ is the neutrosophic SuperHyperPolynomial contains the neutrosophic coefficients defined as the neutrosophic number of the maximum neutrosophic cardinality of a neutrosophic SuperHyperSet $S$ of high neutrosophic cardinality neutrosophic SuperHyperEdges such that there's no neutrosophic SuperHyperVertex not to in a neutrosophic SuperHyperEdge and there's no neutrosophic SuperHyperEdge to have a neutrosophic SuperHyperVertex in a neutrosophic SuperHyperEdge and the neutrosophic power is neutrosophicly corresponded to its neutrosophic coefficient; a neutrosophic R-SuperHyperMatching $\mathcal{C}(NSHG)$ for a neutrosophic SuperHyperGraph $NSHG:(V,E)$ is the maximum neutrosophic cardinality of a neutrosophic SuperHyperSet $S$ of high neutrosophic cardinality neutrosophic SuperHyperVertices such that there's no neutrosophic SuperHyperVertex not to in a neutrosophic SuperHyperEdge and there's no neutrosophic SuperHyperEdge to have a neutrosophic SuperHyperVertex in a neutrosophic SuperHyperEdge; a neutrosophic R-SuperHyperMatching SuperHyperPolynomial $\mathcal{C}(NSHG)$ for a neutrosophic SuperHyperGraph $NSHG:(V,E)$ is the neutrosophic SuperHyperPolynomial contains the neutrosophic coefficients defined as the neutrosophic number of the maximum neutrosophic cardinality of a neutrosophic SuperHyperSet $S$ of high neutrosophic cardinality neutrosophic SuperHyperVertices such that there's no neutrosophic SuperHyperVertex not to in a neutrosophic SuperHyperEdge and there's no neutrosophic SuperHyperEdge to have a neutrosophic SuperHyperVertex in a neutrosophic SuperHyperEdge and the neutrosophic power is neutrosophicly corresponded to its neutrosophic coefficient. It's useful to define a ``neutrosophic'' version of a SuperHyperMatching . Since there's more ways to get type-results to make a SuperHyperMatching more understandable. For the sake of having neutrosophic SuperHyperMatching, there's a need to ``redefine'' the notion of a ``SuperHyperMatching ''. A basic familiarity with neutrosophic SuperHyperMatching theory, SuperHyperGraphs theory, and neutrosophic SuperHyperGraphs theory are proposed.

New setting is introduced to study neutrosophic failed-independent number and failed independent neutrosophic-number arising neighborhood of different vertices. Neighbor is a key term to have these notions. Having all possible edges amid vertices in a set is a key type of approach to have these notions namely neutrosophic failed-independent number and failed independent neutrosophic-number. Two numbers are obtained but now both settings leads to approach is on demand which is finding biggest set which have all vertices which are neighbors. Let NTG : (V,E,σ,μ) be a neutrosophic graph. Then failed independent number I(NTG) for a neutrosophic graph NTG : (V,E,σ,μ) is maximum cardinality of a set S of vertices such that every two vertices of S are endpoints for an edge, simultaneously; failed independent neutrosophic-number In(NTG) for a neutrosophic graph NTG : (V,E,σ,μ) is maximum neutrosophic cardinality of a set S of vertices such that every two vertices of S are endpoints for an edge, simultaneously. As concluding results, there are some statements, remarks, examples and clarifications about some classes of neutrosophic graphs namely path-neutrosophic graphs, cycle-neutrosophic graphs, complete-neutrosophic graphs, star-neutrosophic graphs, complete-bipartite-neutrosophic graphs and complete-t-partite-neutrosophic graphs. The clarifications are also presented in both sections “Setting of Neutrosophic Failed-Independent Number,” and “Setting of Failed Independent Neutrosophic-Number,” for introduced results and used classes. Neutrosophic number is reused in this way. It’s applied to use the type of neutrosophic number in the way that, three values of a vertex are used and they’ve same share to construct this number to compare with other vertices. Summation of three values of vertex makes one number and applying it to a comparison. This approach facilitates identifying vertices which form neutrosophic failed-independent number and failed independent neutrosophic-number arising neighborhoods of vertices. In path-neutrosophic graphs, two neighbors, form maximal set but with slightly differences, in cycle-neutrosophic graphs, two neighbors forms maximal set. Other classes have same approaches. In complete-neutrosophic graphs, a set of all vertices leads us to neutrosophic failed-independent number and failed independent neutrosophic-number. In star-neutrosophic graphs, a set of vertices containing only center and one other vertex, makes maximal set. In complete-bipartite-neutrosophic graphs, a set of vertices including two vertices from different parts makes intended set but with slightly differences, in complete-t-partite-neutrosophic graphs, a set of t vertices from different parts makes intended set. In both settings, some classes of well-known neutrosophic graphs are studied. Some clarifications for each result and each definition are provided. Using basic set to extend this set to set of all vertices has key role to have these notions in the form of neutrosophic failed-independent number and failed independent neutrosophic-number arising neighborhood of vertices. The cardinality of a set has eligibility to neutrosophic failed-independent number but the neutrosophic cardinality of a set has eligibility to call failed independent neutrosophic-number. Some results get more frameworks and perspective about these definitions. The way in that, two vertices have connections amid each other, opens the way to do some approaches. A vertex could affect on other vertex but there’s no usage of edges. These notions are applied into neutrosophic graphs as individuals but not family of them as drawbacks for these notions. Finding special neutrosophic graphs which are well-known, is an open way to pursue this study. Some problems are proposed to pursue this study. Basic familiarities with graph theory and neutrosophic graph theory are proposed for this article.

New setting is introduced to study quasi-degree and quasi-co-degree arising from co-neighborhood. quasi-degree and quasi-co-degree is about a vertex which are applied into the setting of neutrosophic graphs. . The structure of set is studied and general results are obtained. Also, some classes of neutrosophic graphs namely path-neutrosophic graphs, cycle-neutrosophic graphs, complete-neutrosophic graphs and star-neutrosophic graphs, complete-bipartite-neutrosophic graphs and complete-multipartite-neutrosophic graphs are investigated in the terms of a vertex which is called either quasi-degree or quasi-co-degree. Neutrosophic number is reused in this way. It’s applied to use the type of neutrosophic number in the way that, three values of a vertex are used and they’ve same share to construct this number to compare with other vertices. Summation of three values of vertex makes one number and applying it to a comparison. This approach facilitates identifying vertices which form quasi-degree and quasi-co-degree. Quasi-degree is a value of a vertex which is maximum amid all values of vertices which are neighbors to a fixed vertex. Quasi-co-degree is a value of an edge which is maximum amid all values of edges which are neighbors to a fixed vertex but corresponded vertex is representative for this notion. Using different values which are related to a vertex inspire us to focus on edge and vertices which are corresponded to a fixed vertex. The notion of neighborhood is used to collect either vertices are titled neighbors or edges are incident to fixed vertex. In both settings, some classes of well-known neutrosophic graphs are studied. Some clarifications for each result and each definitions are provided. Using fixed vertex has key role to have these notions in the form of vertex or edge. The value of an edge has eligibility to call quasi-co-degree but the value of a vertex has eligibility to call quasi-degree. Some results get more frameworks and perspective about these definitions. The way in that, two vertices have connection together, open the way to define neighborhood and co-neighborhood. The maximum values in neighborhood and co-neighborhood introduces quasi-degree and quasi-co-degree, respectively. New name is chosen from degree. Since amid all vertices with different degrees, one vertex is chosen. In other words, one vertex is fixed and its degree turns out quasi-degree where two degrees could be assigned to a vertex. Degree of edges and degree of vertices. The number of edges which are incident to the vertex and the number of vertices which are neighbors to the vertex. Degree and co-degree are the notions which are transformed to use in quasi-style. Two neutrosophic values introduce two neutrosophic vertices separately in each settings. These notions are applied into neutrosophic graphs as individuals but not family of them as drawbacks for these notions. Finding special neutrosophic graphs which are well-known, is an open way to purse this study. Some problems are proposed to pursue this study. Basic familiarities with graph theory and neutrosophic graph theory are proposed for this article.

Many various using of this new-born fuzzy model for solving real-world problems and urgent requirements involve introducing new concept for analyzing the situations which leads to solve them by proper, quick and ecient method based on statistical data. This gap between the model and its solution cause that we introduce nikfar domination in neutrosophic graphs as creative and eective tool for studying a few selective vertices of this model instead of all ones by using special edges. Being special selection of these edges aect to achieve quick and proper solution to these problems. Domination hasn't ever been introduced. So we don't have any comparison with another denitions. The most used graphs which have properties of being complete, empty, bipartite, tree and like stu and they also achieve the names for themselves, are studied as fuzzy models for getting nikfar dominating set or at least becoming so close to it. We also get the relations between this special edge which plays main role in doing dominating with other special types of edges of graph like bridges. Finally, the relation between this number with other special numbers and characteristic of graph like order are discussed.

In this research article, the notions of SuperHyperDominating and SuperHyperResolving are defined in the setting of neutrosophic SuperHyperGraphs. Some ideas are introduced on both notions of SuperHyperDominating and SuperHyperResolving, simultaneously and as the same with each other. Some neutrosophic SuperHyperClasses are defined based on the notion, SuperHyperResolving. The terms of duality, totality, perfectness, connectedness, and stable, are added to basic framework and initial notions, SuperHyperDominating and SuperHyperResolving but the concentration is on the “perfectness” to figure out what’s going on when for all targeted SuperHyperVertices, there’s only one SuperHyperVertex in the intended set. There are some instances and some clarifications to make sense about what’s happened and what’s done in the starting definitions. The key point is about the minimum sets. There are some questions and some problems to be taken as some avenues to pursue this study and this research. A basic familiarity with SuperHyperGraph theory and neutrosophic SuperHyperGraph theory are proposed.

New setting is introduced to study chromatic number. Different types of chromatic numbers and neutrosophic chromatic number are proposed in this way, some results are obtained. Classes of neutrosophic graphs are used to obtains these numbers and the representatives of the colors. Using colors to assign to the vertices of neutrosophic graphs is applied. Some questions and problems are posed concerning ways to do further studies on this topic. Using different types of edges from connectedness in same neutrosophic graphs and in modified neutrosophic graphs to define the relation amid vertices which implies having different colors amid them and as consequences, choosing one vertex as a representative of each color to use them in a set of representatives and finally, using neutrosophic cardinality of this set to compute types of chromatic numbers. This specific relation amid edges is necessary to compute both types of chromatic number concerning the number of representative in the set of representatives and types of neutrosophic chromatic number concerning neutrosophic cardinality of set of representatives. If two vertices have no intended edge, then they can be assigned to same color even they’ve common edge. Basic familiarities with neutrosophic graph theory and graph theory are proposed for this article.

New setting is introduced to study chromatic number. vital chromatic number and n-vital chromatic number are proposed in this way, some results are obtained. Classes of neutrosophic graphs are used to obtains these numbers and the representatives of the colors. Using colors to assign to the vertices of neutrosophic graphs is applied. Some questions and problems are posed concerning ways to do further studies on this topic. Using vital edge from connectedness to define the relation amid vertices which implies having different colors amid them and as consequences, choosing one vertex as a representative of each color to use them in a set of representatives and finally, using neutrosophic cardinality of this set to compute vital chromatic number. This specific relation amid edges is necessary to compute both vital chromatic number concerning the number of representative in the set of representatives and n-vital chromatic number concerning neutrosophic cardinality of set of representatives. If two vertices have no vital edge, then they can be assigned to same color even they’ve common edge. Basic familiarities with neutrosophic graph theory and graph theory are proposed for this article.

New setting is introduced to study chromatic number. Neutrosophic chromatic number and chromatic number are proposed in this way, some results are obtained. Classes of neutrosophic graphs are used to obtains these numbers and the representatives of the colors. Using colors to assigns to the vertices of neutrosophic graphs is applied. Some questions and problems are posed concerning ways to do further studies on this topic. Using strong edge to define the relation amid vertices which implies having different colors amid them and as consequences, choosing one vertex as a representative of each color to use them in a set of representatives and finally, using neutrosophic cardinality of this set to compute neutrosophic chromatic number. This specific relation amid edges is necessary to compute both chromatic number concerning the number of representative in the set of representatives and neutrosophic chromatic number concerning neutrosophic cardinality of set of representatives. If two vertices have no strong edge, then they can be assigned to same color even they’ve common edge. Basic familiarities with neutrosophic graph theory and graph theory are proposed for this article.

New setting is introduced to study co-neighborhood, neutrosophic t-neighborhood, neutrosophic quasi-vertex set, neutrosophic quasi-order, neutrosophic neighborhood, neutrosophic co-t-neighborhood, neutrosophic quasi-edge set, neutrosophic quasi-size, Neutrosophic number, neutrosophic co-neighborhood, co-neutrosophic number, quasi-number and quasi-co-number. Some classes of neutrosophic graphs are investigated.

New setting is introduced to study failed zero-forcing number and failed zero-forcing neutrosophic-number. Leaf-like is a key term to have these notions. Forcing a vertex to change its color is a type of approach to force that vertex to be zero-like. Forcing a vertex which is only neighbor for zero-like vertex to be zero-like vertex but now reverse approach is on demand which is finding biggest set which doesn’t force. LetNTG : (V,E,σ,μ) be a neutrosophic graph. Then failed zero-forcing number Z(NTG) for a neutrosophic graph NTG : (V,E,σ,μ) is maximal cardinality of a set S of black vertices (whereas vertices in V (G) \ S are colored white) such that V (G) isn’t turned black after finitely many applications of “the color-change rule”: a white vertex is converted to a black vertex if it is the only white neighbor of a black vertex. Failed zero-forcing neutrosophic-number Zn(NTG) for a neutrosophic graphNTG : (V,E,σ,μ) is maximal neutrosophic cardinality of a set S of black vertices (whereas vertices in V (G) \ S are colored white) such that V (G) isn’t turned black afterfinitely many applications of “the color-change rule”: a white vertex is converted to a black vertex if it is the only white neighbor of a black vertex. Failed zero-forcing number and failed zero-forcing neutrosophic-number are about a set of vertices which are applied into the setting of neutrosophic graphs. The structure of set is studied and general results are obtained. Also, some classes of neutrosophic graphs namely path-neutrosophic graphs, cycle-neutrosophic graphs, complete-neutrosophic graphs, star-neutrosophic graphs, bipartite-neutrosophic graphs, and t-partite-neutrosophic graphs are investigated in the terms of maximal set which forms both of failed zero-forcing number and failed zero-forcing neutrosophic-number. Neutrosophic number is reused in this way. It’s applied to use the type of neutrosophic number in the way that, three values of a vertex are used and they’ve same share to construct this number to compare with other vertices. Summation of three values of vertex makes one number and applying it to a comparison. This approach facilitates identifying vertices which form failed zero-forcing number and failed zero-forcing neutrosophic-number. In path-neutrosophic graphs, the set of vertices such that every given two vertices in the set, have distance at least two, forms maximal set but with slightly differences, in cycle-neutrosophic graphs, the set of vertices such that every given two vertices in the set, have distance at least two, forms maximal set. Other classes have same approaches. In complete-neutrosophic graphs, a set of vertices excluding two vertices leads us to failed zero-forcing number and failed zero-forcing neutrosophic-number. In star-neutrosophic graphs, a set of vertices excluding only two vertices and containing center, makes maximal set. In complete-bipartite-neutrosophic graphs, a set of vertices excluding two vertices from same parts makes intended set but with slightly differences, in complete-t-partite-neutrosophic graphs, a set of vertices excluding two vertices from same parts makes intended set. In both settings, some classes of well-known neutrosophic graphs are studied. Some clarifications for each result and each definition are provided. Using basic set not to extend this set to set of all vertices has key role to have these notions in the form of failed zero-forcing number and failed zero-forcing neutrosophic-number. The cardinality of a set has eligibility to form failed zero-forcing number but the neutrosophic cardinality of a set has eligibility to call failed zero-forcing neutrosophic-number. Some results get more frameworks and perspective about these definitions. The way in that, two vertices don’t have unique connection together, opens the way to do some approaches. A vertex could affect on other vertex but there’s no usage of edges. These notions are applied into neutrosophic graphs as individuals but not family of them as drawbacks for these notions. Finding special neutrosophic graphs which are well-known, is an open way to pursue this study. Some problems are proposed to pursue this study. Basic familiarities with graph theory and neutrosophic graph theory are proposed for this article.

New setting is introduced to study the global powerful alliance. Global powerful alliance is about a set of vertices which are applied into the setting of neutrosophic graphs. Neighborhood has the key role to define this notion. Also, neighborhood is defined based on strong edges. Strong edge gets a framework as neighborhood and after that, too close vertices have key role to define global powerful alliance based on strong edges. The structure of set is studied and general results are obtained. Also, some classes of neutrosophic graphs excluding empty, path, star, and wheel and containing complete, cycle and r-regular-strong are investigated in the terms of set, minimal set, number, and neutrosophic number. Neutrosophic number is used in this way. It’s applied to use the type of neutrosophic number in the way that, three values of a vertex are used and they’ve same share to construct this number. It’s called “modified neutrosophic number”. Summation of three values of vertex makes one number and applying it to a set makes neutrosophic number of set. This approach facilitates identifying minimal set and optimal set which forms minimal-global-powerful-alliance number and minimal-global-powerful-alliance-neutrosophic number. Two different types of sets namely global-powerful alliance and minimal-global-powerful alliance are defined. Global-powerful alliance identifies the sets in general vision but minimal-global-powerful alliance takes focus on the sets which deleting a vertex is impossible. Minimal-global-powerful-alliance number is about minimum cardinality amid the cardinalities of all minimal-global-powerful alliances in a given neutrosophic graph. New notions are applied in the settings both individual and family. Family of neutrosophic graphs has an open avenue, in the way that, the family only contains same classes of neutrosophic graphs. The results are about minimal-global-powerful alliance, minimal-global-powerful-alliance number and its corresponded sets, minimal-global-powerful-alliance-neutrosophic number and its corresponded sets, and characterizing all minimal-global-powerful alliances, minimal-t-powerful alliance, minimal-t-powerful-alliance number and its corresponded sets, minimal-t-powerful-alliance-neutrosophic number and its corresponded sets, and characterizing all minimal-t-powerful alliances. The connections amid t-powerful-alliances are obtained. The number of connected components has some relations with this new concept and it gets some results. Some classes of neutrosophic graphs behave differently when the parity of vertices are different and in this case, cycle, and complete illustrate these behaviors. Two applications concerning complete model as individual and family, under the titles of time table and scheduling conclude the results and they give more clarifications and closing remarks. In this study, there’s an open way to extend these results into the family of these classes of neutrosophic graphs. The family of neutrosophic graphs aren’t study deeply and with more results but it seems that analogous results are determined. Slight progress is obtained in the family of these models but there are open avenues to study family of other models as same models and different models. There’s a question. How can be related to each other, two sets partitioning the vertex set of a graph? The ideas of neighborhood and neighbors based on strong edges illustrate open way to get results. A set is global powerful alliance when two sets partitioning vertex set have uniform structure. All members of set have more amount of neighbors in the set than out of set and reversely for non-members of set with less members in the way that the set is simultaneously t-offensive and(t-2)-defensive. A set is global if t=0. It leads us to the notion of global powerful alliance. Different edges make different neighborhoods but it’s used one style edge titled strong edge. These notions are applied into neutrosophic graphs as individuals and family of them. Independent set as an alliance is a special set which has no neighbor inside and it implies some drawbacks for these notions. Finding special sets which are well-known, is an open way to purse this study. Special set which its members have only one neighbor inside, characterize the connected components where the cardinality of its complement is the number of connected components. Some problems are proposed to pursue this study. Basic familiarities with graph theory and neutrosophic graph theory are proposed for this article.

New setting is introduced to study the global offensive alliance. Global offensive alliance is about a set of vertices which are applied into the setting of neutrosophic graphs. Neighborhood has the key role to define this notion. Also, neighborhood is defined based on strong edges. Strong edge gets a framework as neighborhood and after that, too close vertices have key role to define global offensive alliance based on strong edges. The structure of set is studied and general results are obtained. Also, some classes of neutrosophic graphs containing complete, empty, path, cycle, star, and wheel are investigated in the terms of set, minimal set, number, and neutrosophic number. Neutrosophic number is defined in new way. It’s first time to define this type of neutrosophic number in the way that, three values of a vertex are used and they’ve same share to construct this number. It’s called “modified neutrosophic number”. Summation of three values of vertex makes one number and applying it to a set makes neutrosophic number of set. This approach facilitates identifying minimal set and optimal set which forms minimal-global-offensive-alliance number and minimal-global-offensive-alliance-neutrosophic number. Two different types of sets namely global-offensive alliance and minimal-global-offensive alliance are defined. Global-offensive alliance identifies the sets in general vision but minimal-global-offensive alliance takes focus on the sets which deleting a vertex is impossible. Minimal-global-offensive-alliance number is about minimum cardinality amid the cardinalities of all minimal-global-offensive alliances in a given neutrosophic graph. New notions are applied in the settings both individual and family. Family of neutrosophic graphs is studied in the way that, the family only contains same classes of neutrosophic graphs. Three types of family of neutrosophic graphs including m-family of neutrosophic stars with common neutrosophic vertex set, m-family of odd complete graphs with common neutrosophic vertex set, and m-family of odd complete graphs with common neutrosophic vertex set are studied. The results are about minimal-global-offensive alliance, minimal-global-offensive-alliance number and its corresponded sets, minimal-global-offensive-alliance-neutrosophic number and its corresponded sets, and characterizing all minimal-global-offensive alliances. The connection of global-offensive-alliances with dominating set and chromatic number are obtained. The number of connected components has some relations with this new concept and it gets some results. Some classes of neutrosophic graphs behave differently when the parity of vertices are different and in this case, path, cycle, and complete illustrate these behaviors. Two applications concerning complete model as individual and family, under the titles of time table and scheduling conclude the results and they give more clarifications. In this study, there’s an open way to extend these results into the family of these classes of neutrosophic graphs. The family of neutrosophic graphs aren’t study deeply and with more results but it seems that analogous results are determined. Slight progress is obtained in the family of these models but there are open avenues to study family of other models as same models and different models. There’s a question. How can be related to each other, two sets partitioning the vertex set of a graph? The ideas of neighborhood and neighbors based on strong edges illustrate open way to get results. A set is global offensive alliance when two sets partitioning vertex set have uniform structure. All members of set have more amount of neighbors in the set than out of set. It leads us to the notion of global offensive alliance. Different edges make different neighborhoods but it’s used one style edge titled strong edge. These notions are applied into neutrosophic graphs as individuals and family of them. Independent set as an alliance is a special set which has no neighbor inside and it implies some drawbacks for these notions. Finding special sets which are well-known, is an open way to purse this study. Special set which its members have only one neighbor inside, characterize the connected components where the cardinality of its complement is the number of connected components. Some problems are proposed to pursue this study. Basic familiarities with graph theory and neutrosophic graph theory are proposed for this article.

New notion of dimension as set, as two optimal numbers including metric number, dimension number and as optimal set are introduced in individual framework and in formation of family. Behaviors of twin and antipodal are explored in fuzzy(neutrosophic) graphs. Fuzzy(neutrosophic) graphs, under conditions, fixed-edges, fixed-vertex and strong fixed-vertex are studied. Some classes as path, cycle, complete, strong, t-partite, bipartite, star and wheel in the formation of individual case and in the case, they form a family are studied in the term of dimension. Fuzzification(neutrosofication) of twin vertices but using crisp concept of antipodal vertices are another approaches of this study. Thus defining two notions concerning vertices which one of them is fuzzy(neutrosophic) titled twin and another is crisp titled antipodal to study the behaviors of cycles which are partitioned into even and odd, are concluded. Classes of cycles according to antipodal vertices are divided into two classes as even and odd. Parity of the number of edges in cycle causes to have two subsections under the section is entitled to antipodal vertices. In this study, the term dimension is introduced on fuzzy(neutrosophic) graphs. The locations of objects by a set of some junctions which have distinct distance from any couple of objects out of the set, are determined. Thus it’s possible to have the locations of objects outside of this set by assigning partial number to any objects. The classes of these specific graphs are chosen to obtain some results based on dimension. The types of crisp notions and fuzzy(neutrosophic) notions are used to make sense about the material of this study and the outline of this study uses some new notions which are crisp and fuzzy(neutrosophic). Some questions and problems are posed concerning ways to do further studies on this topic. Basic familiarities with fuzzy(neutrosophic) graph theory and graph theory are proposed for this article.

This article presents a new method of segmenting images with gray levels. The method is based on determining several thresholds for separation of gray levels. The determination of these thresholds is done using the certainty of the neutrosophic information. The concept of this method can be stated simply: to choose the local maximums for the neutrosophic certainty.

In this paper, a geometric model is introduced for Neutrosophic data problem for the first time. This model is based on neutrosophic sets and neutrosophic relations. Neutrosophic control points are defined according to these points, resulting in neutrosophic Bézier curves.

New setting is introduced to study resolving number and chromatic number alongside dominating number. Different types of procedures including set, optimal set, and optimal number alongside study on the family of neutrosophic hypergraphs are proposed in this way, some results are obtained. General classes of neutrosophic hypergraphs are used to obtains these numbers and the representatives of the colors, dominating sets and resolving sets. Using colors to assign to the vertices of neutrosophic hypergraphs and characterizing resolving sets and dominating sets are applied. Some questions and problems are posed concerning ways to do further studies on this topic. Using different ways of study on neutrosophic hypergraphs to get new results about numbers and sets in the way that some numbers get understandable perspective. Family of neutrosophic hypergraphs are studied to investigate about the notions, dimension and coloring alongside domination in neutrosophic hypergraphs. In this way, sets of representatives of colors, resolving sets and dominating sets have key role. Optimal sets and optimal numbers have key points to get new results but in some cases, there are usages of sets and numbers instead of optimal ones. Simultaneously, three notions are applied into neutrosophic hypergraphs to get sensible results about their structures. Basic familiarities with neutrosophic hypergraphs theory and hypergraph theory are proposed for this article.

This article presents a new method of segmenting grayscale images by minimizing Shannon's neutrosophic entropy. For the proposed segmentation method, the neutrosophic information components, i.e., the degree of truth, the degree of neutrality and the degree of falsity are defined taking into account the belonging to the segmented regions and at the same time to the separation threshold area. The principle of the method is simple and easy to understand and can lead to multiple thresholds. The efficacy of the method is illustrated using some test gray level images. The experimental results show that the proposed method has good performance for segmentation with optimal gray level thresholds.

New setting is introduced to study types of coloring numbers, degree of vertices, degree of hyperedges, co-degree of vertices, co-degree of hyperedges, neutrosophic degree of vertices, neutrosophic degree of hyperedges, neutrosophic co-degree of vertices, neutrosophic co-degree of hyperedges, neutrosophic number of vertices, neutrosophic number of hyperedges in neutrosophic hypergraphs. Different types of procedures including neutrosophic (r, n)−regular hypergraphs and neutrosophic complete r−partite hypergraphs are proposed in this way, some results are obtained. General classes of neutrosophic hypergraphs are used to obtain chromatic number, the representatives of the colors, degree of vertices, degree of hyperedges, co-degree of vertices, co-degree of hyperedges, neutrosophic degree of vertices, neutrosophic degree of hyperedges, neutrosophic co-degree of vertices, neutrosophic co-degree of hyperedges, neutrosophic number of vertices, neutrosophic number of hyperedges in neutrosophic hypergraphs. Using colors to assign to the vertices of neutrosophic hypergraphs and characterizing representatives of the colors are applied in neutrosophic (r, n)−regular hypergraphs and neutrosophic complete r−partite hypergraphs. Some questions and problems are posed concerning ways to do further studies on this topic. Using different ways of study on neutrosophic hypergraphs to get new results about number, degree and co-degree in the way that some number, degree and co-degree get understandable perspective. Neutrosophic (r, n)−regular hypergraphs and neutrosophic complete r−partite hypergraphs are studied to investigate about the notions, coloring, the representatives of the colors, degree of vertices, degree of hyperedges, co-degree of vertices, co-degree of hyperedges, neutrosophic degree of vertices, neutrosophic degree of hyperedges, neutrosophic co-degree of vertices, neutrosophic co-degree of hyperedges, neutrosophic number of vertices, neutrosophic number of hyperedges in neutrosophic (r, n)−regular hypergraphs and neutrosophic complete r−partite hypergraphs. In this way, sets of representatives of colors, degree of vertices, degree of hyperedges, co-degree of vertices, co-degree of hyperedges, neutrosophic degree of vertices, neutrosophic degree of hyperedges, neutrosophic co-degree of vertices, neutrosophic co-degree of hyperedges, neutrosophic number of vertices, neutrosophic number of hyperedges have key points to get new results but in some cases, there are usages of sets and numbers instead of optimal ones. Simultaneously, notions chromatic number, the representatives of the colors, degree of vertices, degree of hyperedges, co-degree of vertices, co-degree of hyperedges, neutrosophic degree of vertices, neutrosophic degree of hyperedges, neutrosophic co-degree of vertices, neutrosophic co-degree of hyperedges, neutrosophic number of vertices, neutrosophic number of hyperedges are applied into neutrosophic hypergraphs, especially, neutrosophic (r, n)−regular hypergraphs and neutrosophic complete r−partite hypergraphs to get sensible results about their structures. Basic familiarities with neutrosophic hypergraphs theory and hypergraph theory are proposed for this article.

Neutrosophic cubic set is the hybridization of the concept of neutrosophic set and interval neutrosophic set. Neutrosophic cubic set has the capacity to express the hybrid information of both the interval neutrosophic set and the single valued neutrosophic set simultaneously. As newly defined, little research on the operations and applications of neutrosophic cubic sets appear in the current literature. In the present paper we propose the score, accuracy functions for neutrosophic cubic sets and prove their basic properties. We firstly develop TODIM method to solve multi attribute group decision making in neutrosophic cubic set environment, which we call NC-TODIM. Also, we solve a MAGDM problem using the proposed NC-TODIM method to show the applicability and effectiveness of the developed method. We also conduct sensitivity analysis to show the impact of ranking order of the alternatives for different values of attenuation factor of losses for multi-attribute group decision making problem.

In this research, assume a SuperHyperGraph. Then a ``Failed SuperHyperClique'' $\mathcal{C}(NSHG)$ for a neutrosophic SuperHyperGraph $NSHG:(V,E)$ is the maximum cardinality of a SuperHyperSet $S$ of SuperHyperVertices such that there's a SuperHyperVertex to have a SuperHyperEdge in common. Assume a SuperHyperGraph. Then an ``$\delta-$Failed SuperHyperClique'' is a \underline{maximal} Failed SuperHyperClique of SuperHyperVertices with \underline{maximum} cardinality such that either of the following expressions hold for the (neutrosophic) cardinalities of SuperHyperNeighbors of $s\in S:$ $~|S\cap N(s)| > |S\cap (V\setminus N(s))|+\delta,~|S\cap N(s)| < |S\cap (V\setminus N(s))|+\delta.$ The first Expression, holds if $S$ is an ``$\delta-$SuperHyperOffensive''. And the second Expression, holds if $S$ is an ``$\delta-$SuperHyperDefensive''; a``neutrosophic $\delta-$Failed SuperHyperClique'' is a \underline{maximal} neutrosophic Failed SuperHyperClique of SuperHyperVertices with \underline{maximum} neutrosophic cardinality such that either of the following expressions hold for the neutrosophic cardinalities of SuperHyperNeighbors of $s\in S:$ $~|S\cap N(s)|_{neutrosophic} > |S\cap (V\setminus N(s))|_{neutrosophic}+\delta,~ |S\cap N(s)|_{neutrosophic} < |S\cap (V\setminus N(s))|_{neutrosophic}+\delta.$ The first Expression, holds if $S$ is a ``neutrosophic $\delta-$SuperHyperOffensive''. And the second Expression, holds if $S$ is a ``neutrosophic $\delta-$SuperHyperDefensive''. A basic familiarity with Neutrosophic Failed SuperHyperClique theory, SuperHyperGraphs theory, and Neutrosophic SuperHyperGraphs theory are proposed.

Neutrosophic cubic set (NCS) is one of the important family members of neutrosophic hybrid sets. Neutrosophic cubic set has more strength than other family members of neutrosophic hybrid sets to express incomplete information due to the presence of interval valued neutrosophic set (IVNS) and single valued neutrosophic set (SVNS) in its structure. Cross entropy measure is one of the best way to calculate the divergence of any variable from the priori one variable. In this paper we first define a new cross entropy measure under NCSs environment which we call NC- cross entropy measure. We investigate the basic properties of NC-cross entropy. We also propose weighted NC-cross entropy and investigate its basic properties. We develop a novel multi attribute decision making (MADM) strategy based on weighted NC-cross entropy. To show the feasibility and applicability, we solve a MADM problem using the proposed strategy.

The research is on the SuperHyperGirth and the neutrosophic SuperHyperGirth. A SuperHyperGraph has SuperHyperGirth where it’s the longest SuperHyperCycle. To get structural examples and instances, I’m going to introduce the next SuperHyperClass of SuperHyperGraph based on SuperHyperGirth. It’s the main. It’ll be disciplinary to have the foundation of previous definition in the kind of SuperHyperClass. This SuperHyperClass is officially called “SuperHyperFlower”. If there’s a need to have all SuperHyperCycles until the SuperHyperGirth, then it’s officially called “SuperHyperOrder” but otherwise, it isn’t SuperHyperOrder. There are two instances about the clarifications for the main definition titled “SuperHyperGirth”. These two examples get more scrutiny and discernment since there are characterized in the disciplinary ways of the SuperHyperClass based on SuperHyperGirth and they’re called “SuperHyperFlower.” A SuperHyperGraph has “neutrosophic SuperHyperGirth” where it’s the strongest [the maximum value from all SuperHyperCycles amid the minimum value amid all SuperHyperEdges from a SuperHyperCycle.] SuperHyperCycle. In “Cancer’s Recognitions”, the aim is to find either the longest SuperHyperCycle or the strongest SuperHyperCycle in those neutrosophic SuperHyperModels. For the longest SuperHyperCycle, called SuperHyperGirth, and the strongest SuperHyperCycle, called neutrosophic SuperHyperGirth, some general results are introduced. Beyond that in SuperHyperStar, all possible SuperHyperPaths have only two SuperHyperEdges but it’s not enough since it’s essential to have at least three SuperHyperEdges to form any style of a SuperHyperCycle. There isn’t any formation of any SuperHyperCycle but literarily, it’s the deformation of any SuperHyperCycle. It, literarily, deforms and it doesn’t form. A basic familiarity with SuperHyperGraph theory and neutrosophic SuperHyperGraph theory are proposed.

New setting is introduced to study the alliances. Alliances are about a set of vertices which are applied into the setting of neutrosophic graphs. Neighborhood has the key role to define these notions. Also, neighborhood is defined based on the edges, strong edges and some edges which are coming from connectedness. These three types of edges get a framework as neighborhood and after that, too close vertices have key role to define offensive alliance, defensive alliance, t-offensive alliance, and t-defensive alliance based on three types of edges, common edges, strong edges and some edges which are coming from connectedness. The structure of set is studied and general results are obtained. Also, some classes of neutrosophic graphs containing complete, empty, path, cycle, bipartite, t-partite, star and wheel are investigated in the terms of set, minimal set, number, and neutrosophic number. In this study, there’s an open way to extend these results into the family of these classes of neutrosophic graphs. The family of neutrosophic graphs aren’t study but it seems that analogous results are determined. There’s a question. How can be related to each other, two sets partitioning the vertex set of a graph? The ideas of neighborhood and neighbors based on different edges illustrate open way to get results. A set is alliance when two sets partitioning vertex set have uniform structure. All members of set have different amount of neighbors in the set and out of set. It leads us to the notion of offensive and defensive. New ideas, offensive alliance, defensive alliance, t-offensive alliance, t-defensive alliance, strong offensive alliance, strong defensive alliance, strong t-offensive alliance, strong t-defensive alliance, connected offensive alliance, connected defensive alliance, connected t-offensive alliance, and connected t-defensive alliance are introduced. Two numbers concerning cardinality and neutrosophic cardinality of alliances are introduced. A set is alliance when its complement make a relation in the terms of neighborhood. Different edges make different neighborhoods. Three types of edges are applied to define three styles of neighborhoods. General edges, strong edges and connected edges are used where connected edges are the edges arising from connectedness amid two endpoints of the edges. These notions are applied into neutrosophic graphs as individuals and family of them. Independent set as an alliance is a special set which has no neighbor inside and it implies some drawbacks for this notions. Finding special sets which are well-known, is an open way to purse this study. Special set which its members have only one neighbor inside, characterize the connected components where the cardinality of its complement is the number of connected components. Some problems are proposed to pursue this study. Basic familiarities with graph theory and neutrosophic graph theory are proposed for this article.

Single valued neutrosophic set has king power to express uncertainty characterized by indeterminacy, inconsistency and incompleteness. Most of the existing single valued neutrosophic cross entropy bears an asymmetrical behavior and produce an undefined phenomenon in some situations. In order to deal with these disadvantages, we propose a new cross entropy measure under single valued neutrosophic set (SVNS) environment namely SN- cross entropy and prove its basic properties. Also we define weighted SN-cross entropy measure and investigate its basic properties. We develop a new multi attribute group decision making (MAGDM) strategy for ranking of the alternatives based on the proposed weighted SN-cross entropy measure between each alternative and the ideal alternative. Finally, a numerical example of MAGDM problem of investment potential is solved to show the validity and efficiency of proposed decision making strategy. We also present comparative anslysis of the obtained result with the results obtained form the existing solution strategies in the solution.

The concept of neutrosophic number is a significant mathematical tool to deal with real scientific problems because it can tackle indeterminate and incomplete information which exists generally in real problems. In this article, we use neutrosophic numbers (a + bI), where a and bI denote determinate component and indeterminate component respectively. We explore the situations in which the input information is needed to express in terms of neutrosophic numbers. We define score functions and accuracy functions for ranking neutrosophic numbers. We then define a cosine function to determine unknown criteria weights. We define neutrosophic number harmonic mean operators and proved their basic properties. Then, we develop two novel MCGDM strategies using the proposed aggregation operators. We solve a numerical example to demonstrate the feasibility and effectiveness of the proposed two strategies. Sensitivity analysis with variation of “I” on neutrosophic numbers is performed to demonstrate how the preference ranking order of alternatives is sensitive to the change of “I”. The efficiency of the developed strategies is ascertained by comparing the obtained results from the proposed strategies with the existing strategies in the literature.

The paper investigates some similarity measures in interval bipolar neutrosophic environment for multi-attribute decision making problems. At first, we define Hamming and Euclidean distances measures between interval bipolar neutrosophic sets and establish their basic properties. We also propose two similarity measures based on the Hamming and Euclidean distance functions. Using maximum and minimum operators, we define new similarity measures and prove their basic properties. Using the proposed similarity measures, we propose a novel multi attribute decision making strategy in interval bipolar neutrosophic set environment. Lastly, we solve an illustrative example of multi attribute decision making and present comparison analysis to show the feasibility, applicability and effectiveness of the proposed strategy.

In this research, the extreme SuperHyperNotion, namely, extreme SuperHyperGirth, is up. $E_1$ and $E_3$ are some empty extreme SuperHyperEdges but $E_2$ is a loop extreme SuperHyperEdge and $E_4$ is an extreme SuperHyperEdge. Thus in the terms of extreme SuperHyperNeighbor, there's only one extreme SuperHyperEdge, namely, $E_4.$ The extreme SuperHyperVertex, $V_3$ is extreme isolated means that there's no extreme SuperHyperEdge has it as an extreme endpoint. Thus the extreme SuperHyperVertex, $V_3,$ is excluded in every given extreme SuperHyperGirth. $ \mathcal{C}(NSHG)=\{E_i\}~\text{is an extreme SuperHyperGirth.} \ \ \mathcal{C}(NSHG)=jz^i~\text{is an extreme SuperHyperGirth SuperHyperPolynomial.} \ \ \mathcal{C}(NSHG)=\{V_i\}~\text{is an extreme R-SuperHyperGirth.} \ \ \mathcal{C}(NSHG)=jz^I~{\small\text{is an extreme R-SuperHyperGirth SuperHyperPolynomial.}} $ The following extreme SuperHyperSet of extreme SuperHyperEdges[SuperHyperVertices] is the extreme type-SuperHyperSet of the extreme SuperHyperGirth. The extreme SuperHyperSet of extreme SuperHyperEdges[SuperHyperVertices], is the extreme type-SuperHyperSet of the extreme SuperHyperGirth. The extreme SuperHyperSet of the extreme SuperHyperEdges[SuperHyperVertices], is an extreme SuperHyperGirth $\mathcal{C}(ESHG)$ for an extreme SuperHyperGraph $ESHG:(V,E)$ is an extreme type-SuperHyperSet with the maximum extreme cardinality of an extreme SuperHyperSet $S$ of extreme SuperHyperEdges[SuperHyperVertices] such that there's only one extreme consecutive sequence of the extreme SuperHyperVertices and the extreme SuperHyperEdges form only one extreme SuperHyperCycle. There are not only four extreme SuperHyperVertices inside the intended extreme SuperHyperSet. Thus the non-obvious extreme SuperHyperGirth isn't up. The obvious simple extreme type-SuperHyperSet called the extreme SuperHyperGirth is an extreme SuperHyperSet includes only less than four extreme SuperHyperVertices. But the extreme SuperHyperSet of the extreme SuperHyperEdges[SuperHyperVertices], doesn't have less than four SuperHyperVertices inside the intended extreme SuperHyperSet. Thus the non-obvious simple extreme type-SuperHyperSet of the extreme SuperHyperGirth isn't up. To sum them up, the extreme SuperHyperSet of the extreme SuperHyperEdges[SuperHyperVertices], isn't the non-obvious simple extreme type-SuperHyperSet of the extreme SuperHyperGirth. Since the extreme SuperHyperSet of the extreme SuperHyperEdges[SuperHyperVertices], is an extreme SuperHyperGirth $\mathcal{C}(ESHG)$ for an extreme SuperHyperGraph $ESHG:(V,E)$ is the extreme SuperHyperSet $S$ of extreme SuperHyperVertices[SuperHyperEdges] such that there's only one extreme consecutive extreme sequence of extreme SuperHyperVertices and extreme SuperHyperEdges form only one extreme SuperHyperCycle given by that extreme type-SuperHyperSet called the extreme SuperHyperGirth and it's an extreme SuperHyperGirth . Since it 's the maximum extreme cardinality of an extreme SuperHyperSet $S$ of extreme SuperHyperEdges[SuperHyperVertices] such that there's only one extreme consecutive extreme sequence of extreme SuperHyperVertices and extreme SuperHyperEdges form only one extreme SuperHyperCycle. There are only less than four extreme SuperHyperVertices inside the intended extreme SuperHyperSet, thus the obvious extreme SuperHyperGirth, is up. The obvious simple extreme type-SuperHyperSet of the extreme SuperHyperGirth, is: ,is the extreme SuperHyperSet, is: does includes only less than four SuperHyperVertices in a connected extreme SuperHyperGraph $ESHG:(V,E).$ It's interesting to mention that the only simple extreme type-SuperHyperSet called the extreme SuperHyperGirth amid those obvious[non-obvious] simple extreme type-SuperHyperSets called the neutrosophic SuperHyperGirth , is only and only. A basic familiarity with extreme SuperHyperGirth theory, SuperHyperGraphs, and extreme SuperHyperGraphs theory are proposed.

New ideas on the framework of Neutrosophic SuperHyperGraph for different styles of Neutrosophic SuperHyper-Bipartite and Neutrosophic SuperHyper-Path are introduced. More instances and more clarifications alongside sufficient references.

In this research, assume a SuperHyperGraph. Then a ``Failed SuperHyperStable'' $\mathcal{I}(NSHG)$ for a neutrosophic SuperHyperGraph $NSHG:(V,E)$ is the maximum cardinality of a SuperHyperSet $S$ of SuperHyperVertices such that there's a SuperHyperVertex to have a SuperHyperEdge in common. Assume a SuperHyperGraph. Then an ``$\delta-$Failed SuperHyperStable'' is a \underline{maximal} Failed SuperHyperStable of SuperHyperVertices with \underline{maximum} cardinality such that either of the following expressions hold for the (neutrosophic) cardinalities of SuperHyperNeighbors of $s\in S:$ $~|S\cap N(s)| > |S\cap (V\setminus N(s))|+\delta,~|S\cap N(s)| < |S\cap (V\setminus N(s))|+\delta.$ The first Expression, holds if $S$ is an ``$\delta-$SuperHyperOffensive''. And the second Expression, holds if $S$ is an ``$\delta-$SuperHyperDefensive''; a``neutrosophic $\delta-$Failed SuperHyperStable'' is a \underline{maximal} neutrosophic Failed SuperHyperStable of SuperHyperVertices with \underline{maximum} neutrosophic cardinality such that either of the following expressions hold for the neutrosophic cardinalities of SuperHyperNeighbors of $s\in S:$ $~|S\cap N(s)|_{neutrosophic} > |S\cap (V\setminus N(s))|_{neutrosophic}+\delta,~ |S\cap N(s)|_{neutrosophic} < |S\cap (V\setminus N(s))|_{neutrosophic}+\delta.$ The first Expression, holds if $S$ is a ``neutrosophic $\delta-$SuperHyperOffensive''. And the second Expression, holds if $S$ is a ``neutrosophic $\delta-$SuperHyperDefensive''. A basic familiarity with Extreme Failed SuperHyperClique theory, Neutrosophic Failed SuperHyperClique theory, and (Neutrosophic) SuperHyperGraphs theory are proposed.

In this research, new setting is introduced for new notions, namely, SuperHyperDegree and Co-SuperHyperDegree. Two different types of definitions are debut for them but the research goes further and the SuperHyperNotion, SuperHyperUniform, and SuperHyperClass based on that are well-defined and well-reviewed. The literature review is implemented in the whole of this research. For shining the elegancy and the significancy of this research, the comparison between this SuperHyperNotion with other SuperHyperNotions and fundamental SuperHyperNumbers are featured. The definitions are followed by the examples and the instances thus the clarifications are driven with different tools. The applications are figured out to make sense about the theoretical aspect of this ongoing research. The cancer’s treatments are the under research to figure out the challenges make sense about ongoing and upcoming research. The special case is up. The cells are viewed in the deemed ways. There are different types of them. Some of them are individuals and some of them are well-modeled by the group of cells. These types are all officially called “SuperHyperVertex” but the relations amid them all officially called “SuperHyperEdge”. The frameworks “SuperHyperGraph” and “neutrosophic SuperHyperGraph” are chosen and elected to research about “cancer’s treatments”. Thus these complex and dense SuperHyperModels open up some avenues to research on theoretical segments and “cancer’s treatments”. Some avenues are posed to pursue this research. It’s also officially collected in the form of some questions and some problems. If there’s a SuperHyperEdge between two SuperHyperVertices, then these two SuperHyperVertices are called SuperHyperNeighbors. The number of SuperHyperNeighbors for a given SuperHyperVertex is called SuperHyperDegree. The number of common SuperHyperNeighbors for some SuperHyperVertices is called Co-SuperHyperDegree for them and used SuperHyperVertices are called Co-SuperHyperNeighbors. A graph is SuperHyperUniform if it’s SuperHyperGraph and the number of elements of SuperHyperEdges are the same. Assume a neutrosophic SuperHyperGraph. There are some SuperHyperClasses as follows. It’s SuperHyperPath if it’s only one SuperVertex as intersection amid two given SuperHyperEdges with two exceptions; it’s SuperHyperCycle if it’s only one SuperVertex as intersection amid two given SuperHyperEdges; it’s SuperHyperStar it’s only one SuperVertex as intersection amid all SuperHyperEdges; it’s SuperHyperBipartite it’s only one SuperVertex as intersection amid two given SuperHyperEdges and these SuperVertices, forming two separate sets, has no SuperHyperEdge in common; it’s SuperHyperMultiPartite it’s only one SuperVertex as intersection amid two given SuperHyperEdges and these SuperVertices, forming multi separate sets, has no SuperHyperEdge in common; it’s SuperHyperWheel if it’s only one SuperVertex as intersection amid two given SuperHyperEdges and one SuperVertex has one SuperHyperEdge with any common SuperVertex. The number of SuperHyperEdges for a given SuperHyperVertex is called SuperHyperDegree. The number of common SuperHyperEdges for some SuperHyperVertices is called Co-SuperHyperDegree for them. The number of SuperHyperVertices for a given SuperHyperEdge is called SuperHyperDegree. The number of common SuperHyperVertices for some SuperHyperEdges is called Co-SuperHyperDegree for them. The model proposes the specific designs. The model is officially called “SuperHyperGraph” and “Neutrosophic SuperHyperGraph”. In this model, The “specific” cells and “specific group” of cells are modeled as “SuperHyperVertices” and the common and intended properties between “specific” cells and “specific group” of cells are modeled as “SuperHyperEdges”. Sometimes, it’s useful to have some degrees of determinacy, indeterminacy, and neutrality to have more precise model which in this case the model is called “neutrosophic”. In the future research, the foundation will be based on the caner’s treatment and the results and the definitions will be introduced in redeemed ways. A basic familiarity with SuperHyperGraph theory and neutrosophic SuperHyperGraph theory are proposed.

New ideas on the framework of Neutrosophic SuperHyperGraph for different styles of Neutrosophic SuperHyper-Wheel and Neutrosophic SuperHyper-Star are introduced. More instances and more clarifications alongside sufficient references are featured with a specific type of independency of SuperHyperVertices.

Bipolar neutrosophic set is an important extension of bipolar fuzzy set. This set is a hybridization of bipolar fuzzy set and neutrosophic set. Every element of a bipolar neutrosophic set consists of three independent positive membership functions and three independent negative membership functions. In this paper, we develop cross entropy measures of bipolar neutrosophic sets and prove its properties. We also define cross entropy measures of interval bipolar neutrosophic sets and prove its properties. Thereafter, we develop two novel multi-attribute decision making methods based on the proposed cross entropy measures. In the decision making framework, we calculate the weighted cross entropy measures between each alternative and the ideal alternative to rank the alternatives and choose the best one. We solve two illustrative examples of multi-attribute decision making problems and compare the obtained result with the results of other existing methods to show the applicability and effectiveness of the developed method. In the end, the main conclusion and future scope of research are summarized.

Along with the economic growth, the companies must contribute to social progress and promote environmental sustainability in equal harmony. Sustainable human resource management (SHRM) strategies make it possible to attain the economic, social and environmental goals of a firm. In this regard, a survey method is discussed using the literature review and online questionnaire to identify the main factors/indicators during the SHRM evaluation of manufacturing firms in India. Uncertainty is commonly occurred in the assessment of SHRM factors. As a generalized version of fuzzy sets, single-valued neutrosophic set (SVNS) has been demonstrated as a valuable tool to illustrate the indeterminate, inconsistent and uncertain data of realistic decision-making problems. Considering the idea of SVNSs, this study develops a hybrid multi-criteria group decision-making (MCGDM) approach for assessing the SHRM of manufacturing firms under uncertainty settings. For this purpose, an SVN-alternative ranking order method accounting for two-step normalization (AROMAN) is proposed based on VIFI-score function-based decision experts’ (DEs’) weighting tool and integrated criteria weight-determining model to solve the MCGDM problems with fully unknown DEs and criteria weights. In this regard, we develop new SVN-distance measure to compute the degree of difference between SVNSs. Some examples are presented to demonstrate the efficacy of developed measure over the existing ones. In addition, new criteria weight-determination model is presented with the integration of objective weights through IVIF-distance measure-based model and subjective weights through ranking comparison (RANCOM) tool on SVNSs. The proposed ranking method is applied to an empirical study of SHRM assessment for manufacturing firms in India, which shows its applicability and feasibility. In this study, the evaluation criteria are characterized into social, environmental and economic aspects with DE’s opinions. Comparative and sensitivity analyses are made to show the strength and steadiness of presented approach. This study provides an innovative MCGDM analysis framework, which makes a significant contribution to the SHRM assessment problem under indeterminate, inconsistent and uncertain setting.

New setting is introduced to study “closing numbers” and “super-closing numbers” as optimal-super-resolving number, optimal-super-coloring number and optimal-super-dominating number. In this way, some approaches are applied to get some sets from (Neutrosophic)n-SuperHyperGraph and after that, some ideas are applied to get different types of super-closing numbers which are called by optimal-super-resolving number, optimal-super-coloring number and optimal-super-dominating number. The notion of dual is another new idea which is covered by these notions and results. In the setting of dual, the set of super-vertices is exchanged with the set of super-edges. Thus these results and definitions hold in the setting of dual. Setting of neutrosophic n-SuperHyperGraph is used to get some examples and solutions for two applications which are proposed. Both setting of SuperHyperGraph and neutrosophic n-SuperHyperGraph are simultaneously studied but the results are about the setting of n-SuperHyperGraphs. Setting of neutrosophic n-SuperHyperGraph get some examples where neutrosophic hypergraphs as special case of neutrosophic n-SuperHyperGraph are used. The clarifications use neutrosophic n-SuperHyperGraph and theoretical study is to use n-SuperHyperGraph but these results are also applicable into neutrosophic n-SuperHyperGraph. Special usage from different attributes of neutrosophic n-SuperHyperGraph are appropriate to have open ways to pursue this study. Different types of procedures including optimal-super-set, and optimal-super-number alongside study on the family of (neutrosophic)n-SuperHyperGraph are proposed in this way, some results are obtained. General classes of (neutrosophic)n-SuperHyperGraph are used to obtains these closing numbers and super-closing numbers and the representatives of the optimal-super-coloring sets, optimal-super-dominating sets and optimal-super-resolving sets. Using colors to assign to the super-vertices of n-SuperHyperGraph and characterizing optimal-super-resolving sets and optimal-super-dominating sets are applied. Some questions and problems are posed concerning ways to do further studies on this topic. Using different ways of study on n-SuperHyperGraph to get new results about closing numbers and super-closing numbers alongside sets in the way that some closing numbers super-closing numbers get understandable perspective. Family of n-SuperHyperGraph are studied to investigate about the notions, super-resolving and super-coloring alongside super-dominating in n-SuperHyperGraph. In this way, sets of representatives of optimal-super-colors, optimal-super-resolving sets and optimal-super-dominating sets have key role. Optimal-super sets and optimal-super numbers have key points to get new results but in some cases, there are usages of sets and numbers instead of optimal-super ones. Simultaneously, three notions are applied into (neutrosophic)n-SuperHyperGraph to get sensible results about their structures. Basic familiarities with n-SuperHyperGraph theory and neutrosophic n-SuperHyperGraph theory are proposed for this article.

In this research, new setting is introduced for assuming a SuperHyperGraph. Then a ``SuperHyperClique'' $\mathcal{C}(NSHG)$ for a neutrosophic SuperHyperGraph $NSHG:(V,E)$ is the maximum cardinality of a SuperHyperSet $S$ of SuperHyperVertices such that there's a SuperHyperVertex to have a SuperHyperEdge in common. Assume a SuperHyperGraph. Then an ``$\delta-$SuperHyperClique'' is a \underline{maximal} SuperHyperClique of SuperHyperVertices with \underline{maximum} cardinality such that either of the following expressions hold for the (neutrosophic) cardinalities of SuperHyperNeighbors of $s\in S:$ $~|S\cap N(s)| > |S\cap (V\setminus N(s))|+\delta,~|S\cap N(s)| < |S\cap (V\setminus N(s))|+\delta.$ The first Expression, holds if $S$ is an ``$\delta-$SuperHyperOffensive''. And the second Expression, holds if $S$ is an ``$\delta-$SuperHyperDefensive''; a``neutrosophic $\delta-$SuperHyperClique'' is a \underline{maximal} neutrosophic SuperHyperClique of SuperHyperVertices with \underline{maximum} neutrosophic cardinality such that either of the following expressions hold for the neutrosophic cardinalities of SuperHyperNeighbors of $s\in S:$ $~|S\cap N(s)|_{neutrosophic} > |S\cap (V\setminus N(s))|_{neutrosophic}+\delta,~ |S\cap N(s)|_{neutrosophic} < |S\cap (V\setminus N(s))|_{neutrosophic}+\delta.$ The first Expression, holds if $S$ is a ``neutrosophic $\delta-$SuperHyperOffensive''. And the second Expression, holds if $S$ is a ``neutrosophic $\delta-$SuperHyperDefensive''. A basic familiarity with Extreme SuperHyperClique theory, SuperHyperGraphs, and Neutrosophic SuperHyperGraphs theory are proposed.

In this research, assume a SuperHyperGraph. Then a ``Failed SuperHyperClique'' $\mathcal{C}(NSHG)$ for a neutrosophic SuperHyperGraph $NSHG:(V,E)$ is the maximum cardinality of a SuperHyperSet $S$ of SuperHyperVertices such that there's a SuperHyperVertex to have a SuperHyperEdge in common. Assume a SuperHyperGraph. Then an ``$\delta-$Failed SuperHyperClique'' is a \underline{maximal} Failed SuperHyperClique of SuperHyperVertices with \underline{maximum} cardinality such that either of the following expressions hold for the (neutrosophic) cardinalities of SuperHyperNeighbors of $s\in S:$ $~|S\cap N(s)| > |S\cap (V\setminus N(s))|+\delta,~|S\cap N(s)| < |S\cap (V\setminus N(s))|+\delta.$ The first Expression, holds if $S$ is an ``$\delta-$SuperHyperOffensive''. And the second Expression, holds if $S$ is an ``$\delta-$SuperHyperDefensive''; a``neutrosophic $\delta-$Failed SuperHyperClique'' is a \underline{maximal} neutrosophic Failed SuperHyperClique of SuperHyperVertices with \underline{maximum} neutrosophic cardinality such that either of the following expressions hold for the neutrosophic cardinalities of SuperHyperNeighbors of $s\in S:$ $~|S\cap N(s)|_{neutrosophic} > |S\cap (V\setminus N(s))|_{neutrosophic}+\delta,~ |S\cap N(s)|_{neutrosophic} < |S\cap (V\setminus N(s))|_{neutrosophic}+\delta.$ The first Expression, holds if $S$ is a ``neutrosophic $\delta-$SuperHyperOffensive''. And the second Expression, holds if $S$ is a ``neutrosophic $\delta-$SuperHyperDefensive''. A basic familiarity with Extreme Failed SuperHyperClique theory, Extreme SuperHyperGraphs theory, and Neutrosophic SuperHyperGraphs theory are proposed.

Nowadays, microfluidics has become an anarchist interdisciplinary topic with considerable attention in a wide range of biotechnology applications. In this research work, numerical investigation of microfluidic micro-mixer is carried out using hybrid actuation approach with different micropillar shapes and gaps. For this purpose, COMSOL Multiphysics is used with three different physics such as thermoviscous acoustic to solve acoustic governing equations, laminar physics is used to solve fluid flow governing equations and diluted transport species is used to solve mixing governing equations. The simulations were carried out with flow velocity of 200 µm/s at both inlets with an oscillation frequency of 15kHz. The outcomes were in the form of acoustic characteristics such as acoustic pressure, acoustic velocity, acoustic streaming and mixing index. The results revealed that the inclusion of micropillars enhanced the mixing performance and strength of acoustic field resulting in improvement of mixing performance compared to the case without micropillars. In addition, it was also investigated that blade shape micropillars with 0.150 mm gaps deliver best results compared to the other cases with maximum and minimum values of the mixing index 0.95 and 0.72 respectively. The obtained results can be extremely helpful for design and modifications of hybrid microfluidics micro-mixer.

The aim of this research work is to get a method for Galfenol electrodeposition thought which we can control the desired percentage of Ga versus Fe that has the maximum magnetostriction constant. Galfenol is electrodeposited on an optical fiber with an imbedded Fiber Bragg Grating (FBG) in its core. The final objective, that goes further of the scope of this research, is to get an optical magnetostrictive sensor. The device will sense magnetic field or current based on the combination of this magnetostrictive Galfenol, that will stress the optical fiber with the application of magnetic field or current and will change the reflected wavelength of the FBG as a consequence of the variation of the Bragg wavelength. We have developed a method of electrodeposition that allows controlling the density of current in the electrodeposition process in order to get the desired percentage of Ga and Fe in the alloy Ga X Fe 1-x. We have manufactured a set of samples with different parameters (as density of current and pH) and we have characterized these samples morphological, structural and magnetically. With this research we want to give to the scientific community the groundwork to design magnetostrictive optical sensors based on and FBG coated by giant magnetostrictive material. In this paper we have developed a method of covering the optical fiber controlling the composition of (Ga X Fe 1-X) in order to be able to get the maximum magnetostriction constant.

Pulmonary arteriovenous malformations (PAVMs) are vascular anomalies resulting in abnormal connection between pulmonary arteries and veins. In 80% of cases, PAVMs are present from birth, but clinical manifestations are rarely seen in childhood. These congenital malformations are typically associated with Hereditary Hemorrhagic Telangiectasia (HHT), a rare disease that affects 1 in 5,000/8,000 individuals. HHT disease is frequently caused by mutations in genes involved in the TGF-β pathway. However, approximately 15% of patients do not have a genetic diagnosis and, among the genetically diagnosed, more than 33% do not meet the Curaçao Criteria. This makes clinical diagnosis even more challenging in the pediatric age group. Here, we introduce an 8 years old patient bearing a severe phenotype of multiple diffuse PAVMs caused by an unknown mutation which ended in lung transplantation. Phenotypically, the case of study follows a molecular pattern HHT-like. Therefore, molecular biology and cellular functional analysis has been performed in primary endothelial cells (ECs) isolated from the explanted lung. The findings revealed a loss of functionality in lung endothelial tissue and a stimulation of endothelial to mesenchymal transition. Understanding the molecular basis of this transition could potentially offer new therapeutic strategies to delay lung transplantation in severe cases.

Heart failure is associated with a significant mortality rate, and an elevated prevalence of this condition has been noted among hypertensive patients. The identification of predictive factors for heart failure progression in hypertensive individuals is crucial for early intervention and improved patient outcomes. In this study, we aimed to identify these predictive factors utilizing medical history data for hypertension patients. Specifically, we focused solely on utilizing medical data preceding the diagnosis of hypertension to enable patients to anticipate the onset of potential heart failure at the time of hypertension diagnosis. Age-specific and ICD system-specific predictive factors were identified utilizing the MIMIC-IV database through the application of two analytical approaches: chi-square tests and XGBoost modeling. Our findings reveal 21 overall predictive factors, encompassing conditions such as atrial fibrillation, the use of anticoagulants, kidney failure, obstructive pulmonary disease, and anemia. These factors were assessed through a comprehensive review of the existing literature. We anticipate that the results will offer valuable insights for the risk assessment of heart failure in hypertensive patients.

When separation to the parameters of interest appears below resolution limit of the estimator, the ambiguity arises whether two parameter estimates relate to one source emitted twice or two close sources emitted once. In the paper, novel Bayes technique aimed to identify one/two sources below resolution limit by the pair of Gaussian estimates of a source(s) planar location as parameter is developed. Prior probabilities of the hypotheses on one/two sources are available from the analysis of physical characteristics of the emissions, assuming that they can be equally probable. The identifier recalculates a posteriori these probabilities subject to a distance between sources. It is applied to distinguish two location estimates obtained in the planar time difference of arrival mobile communication network. The work of the identifier is studied in the domain of closely spaced network users where covariance matrices of estimates are sufficiently approximated by the constant. The application gives an example of how the identifier revises the prior probabilities and can change thereby the initial preference of a hypothesis with a distance between users in some cases.

Background: breastfeeding is the optimal nourishment for infants and recommends that children commence breastfeeding within the first hour of birth and be exclusively breastfed for the initial 6 months of life. Our objective was to determine which factors related to mothers could influence the degree of exclusive breastfeeding during hospitalization, as well as to assess breastfeeding mothers' attitudes towards breastfeeding. Methods: A multicenter cross-sectional study was undertaken in the healthcare area of Santiago de Compostela, Spain. The reduced Iowa Infant Feeding Attitude Scale (IIFAS-s) was employed to gauge maternal attitudes toward feeding their baby. Results: 64 women were studied. The overall score of IIFAS-s (mean ± standard deviation) was 36.95 ± 5.17. No use of pacifier by the newborn was associated with a positive attitude for breastfeeding. Having previous children (ORa=6,40; IC95% 1,26 – 32,51) and previous experience with breastfeeding (ORa=6,70; IC95% 1,31 – 34,27) increase the likelihood of exclusive breastfeeding during admission. Conclusions: It is important to identify the factors that contribute to increasing the probability that mothers choose exclusive breastfeeding. We must guide our training efforts to these factors.

This study aimed to evaluate a cantilever beam-type piezoelectric energy harvester operating on train-induced vibrations for powering Wireless Sensor Networks (WSNs) used in railway track monitoring systems. The harvester's behaviors under different conditions are simulated in MATLAB using the analytical model. Natural frequency, maximum deflection, and stress were calculated with greater precision using eigenfrequency and stationary analysis using COMSOL Multiphysics. At a base excitation of 2 g and a resonant frequency of 4.38 Hz, the simulated results showed that the developed energy harvester prototype could generate up to 14 V of AC output voltage and 550 mW of output power. These findings highlight the promising potential of the proposed energy harvester for transforming train mechanical energy into electrical power. This energy harvester's viability and dependability for real-world applications in monitoring railway tracks are supported by developed analytical and simulation models.

The authors undertook pilot studies to assess the accuracy of the reverse engineering process of worn nonstandard spur gears (non-standardized modulus value, unusual profile/pressure angle, high or low teeth), using conventional techniques and measuring instruments. Eight gears were tested, the module of which ranges from 1.020 to 4.98 mm and the number of teeth from 13 to 42. The key parameter, the basic pitch, was selected to estimate the accuracy of the process. The goal is to determine the value of the profile angle. Eleven models were proposed to estimate the nominal tolerance field, using various types of random data distribution. The tested gears were made in IT grade: 6, 7, 8 and 9 according to DIN 3961. Vernier disc micrometers with various measurement ranges were used for research. It has been shown that the nominal module does not have to be treated as a random variable in the population. EIG (Equation of Identity) was developed, allowing conversion of any gear with specific values of geometric parameters into an identical gear with alternative values of these parameters. The directions and degrees of shifts of the estimated tolerance fields relative to the nominal field were determined. The most effective estimating model was selected in the context of the percentage filling of the nominal tolerance field, taking into account the symmetric Student-Fisher distribution with a confidence level of 60%. Further directions of the research activities were described.

Background: The coexistence of HIV infection and latent tuberculosis infection (LTBI) presents a significant public health concern due to the increased risk of tuberculosis (TB) reactivation and progression to active disease. The multicenter observational cohort study, TUBHIVIT, conducted in Italy from 2017 to 2023, aimed to assess the prevalence of LTBI among people living with HIV (PLHIV) and their outcomes following LTBI screening and therapy initiation. Methods: We performed a prospective study in 5 referral centers for HIV care in Italy. PLHIV who consented to participate underwent QuantiFERON-TB Gold Plus and clinical, microbiological, and radiological assessments to exclude subclinical tuberculosis, as opportune. PLHIV diagnosed with LTBI that started chemoprophylaxis were followed until the ending of therapy. Results: A total of 1105 PLHIV were screened for LTBI using the QuantiFERON-TB Gold Plus test, revealing a prevalence of 3.4% of positive results (38/1105). Non-Italy-born individuals exhibited a significantly higher likelihood of testing positive. Thirty-one were diagnosed with LTBI, 1 showed active subclinical TB, 6 were lost to follow-up before discriminating between latent and active TB. Among PLHIV diagnosed with LTBI, 83.9% (26/31) started chemoprophylaxis. Most individuals received 6-9 months of isoniazid-based therapy. Of the 26 PLHIV commencing chemoprophylaxis, 18 (69.2%) completed the therapy, while 3 discontinued it and 5 were still on treatment at the time of the analysis. Adverse events were observed in two cases, while in one case the patient refused to continue the treatment.

The risk of malignant transformation of induced pluripotent stem cells (iPSC)-derived cells in response to DNA damage is a potential concern as the tumor suppressor genes TP53 and CDKN2A are transiently inactivated during reprogramming. Here, we evaluated the integrity of cellular senescence pathways and DNA double-strand break (DSB) repair in iPSC-derived human fibroblasts (i-HF) compared to their parental skin fibroblasts (HF). Using a variety of functional assays, we show that the capacity of i-HF to enter senescence and repair DSB is not compromised after damage induced by ionizing radiation (IR) or overexpression of H-RASV12. Still, i-HF lines are transcriptionally different from their parental lines, showing enhanced metabolic activity and higher expression of p53-related effector genes. As a result, i-HF lines generally exhibit increased sensitivity to various stresses, have an elevated senescence-associated secretory phenotype (SASP) and cannot be immortalized unless p53 expression is knocked down. In conclusion, while our results suggest that i-HF are not at a greater risk of transformation, their overall hyperactivation of senescence pathways may impede their function as a cell therapy product.

There is significant need for development of a new environmentally friendly, extraction-free sample collection medium that can effectively preserve and protect genetic material for point-of-care, and/or self-collection, home-collection, and mail-back testing. Systematic Evolution of Ligands by Exponential Enrichment (SELEX) was used to create anti-ribonuclease (RNase) Deoxyribonucleic acid (DNA) aptamers against purified RNase A conjugated to paramagnetic carboxylated beads. Following 8 rounds of SELEX carried out under various stringency conditions, e.g., selection using Xtract-Free™ (XF) specimen collection medium, and elevated ambient temperature of 28 ºC, a panel of 5 aptamers was chosen following bioinformatic analysis using next-generation sequencing. The efficacy of aptamer inactivation of RNase was assessed by monitoring Ribonucleic acid (RNA) integrity by fluorometric and real-time RT-PCR analysis. Inclusion of aptamers in reaction incubations resulted in an 8,800 to 11,200-fold reduction of RNase activity, i.e., digestion of viral RNA compared to control. Thus, anti-RNase aptamers integrated into XF collection medium as well as other commercial reagents and kits have great potential for ensuring quality intact RNA for subsequent genomic analysis.

We report the case of a 28-year-old male with uncontrolled human immunodeficiency virus (HIV) infection who presented with extensive ulcerated lesions with dark lamellated crusting on his face, torso, and limbs. The patient had an RPR of 1:512. A skin biopsy revealed granulomata surrounded by lymphocytes, histiocytes, and plasma cells, with spirochetes visible on immunohistochemical staining. This severe form of secondary syphilis has been termed malignant syphilis, lues maligna, ulceronodular syphilis, and rupioid syphilis, among other names. The patient’s rash resolved with hyperpigmented scarring after treatment with penicillin and doxycycline. First, we propose a single descriptive name for this entity, ulceronodular-rupioid syphilis. In 1967, Fisher and coworkers proposed criteria for malignant syphilis based on lesion appearance, RPR values, histopathologic findings, the occurrence of the Jarisch-Herxheimer reaction, and response to treatment. However, the Fisher criteria were found to be imprecise. Thus, we examined the features of an additional 74 cases from the medical literature and propose new diagnostic criteria based on rash appearance, histopathologic characteristics, non-treponemal and treponemal test positivity, and response to therapy. We also found that uncontrolled viremia and not a low CD4 count is a major risk factor for this severe manifestation of secondary syphilis in the HIV population.

Histones are keys to many epigenetic events and their complexes have therapeutic and diagnostic importance. The determination of the structures of histone complexes is fundamental in the design of new drugs. Computational molecular docking is widely used for the prediction of target-ligand complexes. Large, linear peptides like the tail regions of histones are challenging ligands for docking due to their large conformational flexibility, extensive hydration, and weak interactions with the shallow binding pockets of their reader proteins. Thus, fast docking methods often fail to produce complex structures of such peptide ligands at a level appropriate for drug design. To answer this challenge, and improve the structural quality of the docked complexes, post-docking refinement has been applied using various molecular dynamics (MD) approaches. However, a final consensus has not been reached on the desired MD refinement protocol. In the present study, MD refinement strategies were systematically explored on a set of problematic complexes of histone peptide ligands with relatively large errors in their docked geometries. Six protocols were compared that differ in their MD simulation parameters. In all cases, pre-MD hydration of the complex interface regions was applied to avoid the unwanted presence of empty cavities. The best-performing protocol achieved a median of 32 % improvement over the docked structures in terms of the change of root mean squared deviations from the experimental references. The influence of structural factors and explicit hydration on the performance of post-docking MD refinements was also discussed to help their implementation in future methods and applications.

Defining integrals over volume element in curved spacetime together with the mass and energy densities within that region of spacetime is apparently equivalent to the given energy and mass of that body or particle. With this in mind equations involving energies and mass can be rewritten in terms of their densities and the integral over the volume element. The idea find its place in the Hamiltonian formulations, and can be carried over into quantum mechanical frameworks systematically accounting for the effect of spacetime volume structures and gravity on dynamics of quantum systems. This article briefly explores this concept and runs through various frameworks and equations relevant to this idea, particularly the schrodinger-Newton equation and discusses the cosmological constant as a vacuum energy density.

Cannabidiol (CBD) is a safe and non-psychotropic phytocannabinoid with a wide range of potential therapeutic antiinflamatory and antioxidant activity. Due to its lipophilicity, it is normally available dissolved in oily phases. The main aim of this work was to develop and characterize a new formulation of a microemulsion with a potential anti-inflammatory and antioxidant action for topical treatment of inflammatory skin disorders. The micro-emulsion system was obtained from a 20% CBD oil as hydrophobic phase, Labrasol/Plurol Oleique (1:1) as surfactant and cosurfactant (S/CoS) respectively and an aqueous vegetal extract obtained from S. ebulus L. ripe fruits, with a potential anti-oxidant and anti-inflammatory activity, as water phase. A pseudo-ternary phase diagram was elaborated, selecting an optimal proportion of 62% (S/CoS), 27% CBD oil and 11% water and, after testing its reproducibility, the aqueous phases were replaced by the vegetal hydrophilic extract. The defined systems were characterized in terms of conductivity, droplet size by laser scattering, compatibility of components by differential scanning calorimetry and rheological properties using a rotational rheometer. The designed microemulsion showed good stability and a slight pseudo-plastic behavior. The release properties of CBD from the oil phase and caffeic acid from the water phase of the microemulsion were studied by in vitro diffusion experiments using flow-through diffusion cells in comparison to a CBD oil and a microemulsion only with CBD as active substance. It was evidenced that the inclusion of the original oil in microemulsions did not provoke a significant modification of the release of CBD, incorporating the possibility of including hydrophilic active compounds in the formulation, stablishing an interesting strategy for the development of future formulations.

Metastatic melanoma patients have a poor prognosis with poor responsiveness to chemotherapy. BRAF V600E mutations have been detected in ~40% of melanoma patients. Vemurafenib is an oral agent licensed for patients with BRAF V600E mutation-positive inoperable and metastatic melanoma, which already presents resistance that leads to patient relapse and the serious side effects. In our study, we synthesized 5 new vemurafenib analogs, RF-86A, RF-87A, RF-94A, RF-94B and RF-96B, with structural improve-ments, in order to increase the anti-proliferative and anti-metastatic effect on human melanoma. We showed that the analogs were efficient in inducing cell death and reducing the migration of A375 cells, by inhibition of MMP-2 and MMP-9 activity, indicating that this action may be longer lasting comparing to the action of Vemurafenib.

Stairs are among the key elements in architectural composition, both aesthetically and spatially. They are also one of the main innovations in architecture and building, allowing pedestrians to bridge considerable height differences with relative efficiency. It is therefore surprising that, in spite of all stair regulations in building codes, stairs are responsible for a huge number of accidents – second only to motorcars. The extent of safety failures suggests that user interaction with stairs is poorly understood by designers and policy makers. This is not unrelated to the lack of research into the design and use of stairs. Templer’s seminal work is the exception but it dates from 1992 and since then little has been done to understand the relation between architectural design and stair performance, including safety. To redress this, we can build on affordance-based analyses of stair climbability, which establish a clear connection between the form of a stair and the perception of action possibilities and dangers by all kinds of users. By doing so affordances establish a comprehensive and consistent framework for the analysis of architectural designs, which utilizes both domain and psychological knowledge, including as a foundation for computational applications.

The sound power LW of wind turbines (WTs) over the past decades has developed in relation to their electric power P as LW ∝ logP. The spectral distribution of the sound did not change significantly over time. This applies to the average performance of wind turbines, with differences between individual WT types. Because of the expected growth of onshore wind energy, a greater number of people will be living close to wind farms. This sustains the need for sound reduction. Sound reduction measures, such as serrations, reduced tip speed and low noise modes, may counteract the development of higher sound power from ever bigger WTs. To investigate this, the sound production of WT types over the last decades is analysed in relation to their size and electric power and the application of sound reduction measures. The analysis includes the broad band A-weighted and low frequency sound power levels as well as more detailed spectral distributions. Results show that the sound power level of wind turbines above 3 MW on average increases less with size than smaller turbines did. This is due to a lower blade tip speed and the use of sound reducing serrations. The spectral content of wind turbine sound, including the lower frequencies, has not changed significantly.

Exploring for green and affordable protection of perishable fruit like cherry tomato is of significance. Here the protective efficacy and its underpinnings of coating with oleaster gum, alone or incorporated with cuminal, on cherry tomatoes stored at ambient temperature were investigated. The composite coating of oleaster gum with 0.1% cuminal reduced decay, respiration rate, weight loss, and softening of the fruit and decelerated their decreases of total soluble solids, titratable acidity, and soluble proteins, and therefore maintained their marketability. Furthermore, it reduced the accumulation of O•− 2and H2O2 in fruit, and mitigated cell membrane lipid oxidation and permeabilization, thereby retarding their senescence. Instrumentally, it elevated the activities of superoxide dismutase, catalase, peroxidase, and ascorbate peroxidase and the levels of ascorbic acid and glutathione. This potentiation of the fruit antioxidant system makes the composite coating a promising approach to keeping the postharvest quality of perishable fruit.

Background/Objectives: Community-acquired pneumonia (CAP) is a common emergency presentation in Australia, with the choice of admitting specialty unit often influenced by pneumonia severity and comorbidities. However, it remains unclear whether there are between-specialty differences in patient characteristics and outcomes. We sought to address this issue by investigating the characteristics and outcomes of CAP patients admitted to General Medicine (GM) versus Respiratory units.Methods: This retrospective observational study utilised data from the two largest metropolitan hospitals in South Australia, encompassing all non-COVID-19-related CAP admissions throughout 2021 to 2023. Hospital length of stay (LOS), in-patient and 30-day mortality, and 30-day readmission rates were assessed by propensity-score-matching (PSM) with using 14 variables.Results: Of the 3,004 cases of non-COVID-19 CAP admitted across the two hospitals during the study period, 2,673 (71.8%) were admitted under GM units and 331 (9.1%) under Respiratory units. GM patients were, on average, a decade older, presented with a significantly higher burden of comorbidities, exhibited a greater prevalence of frailty and had higher pneumonia severity compared to those admitted under a Respiratory unit, (P

Procurement plays a central and defining role in the efficiency of supply chains. In recent years, the understanding and practice of procurement management have changed significantly due to increasing emphasis on and demand for agility and sustainability within supply chain management systems. Meanwhile, traditional supply chain systems, characterized by siloed processes, limited visibility, and inefficiencies due to manual interventions, can no longer cope with the current dynamic market conditions. Besides, the increasing requirements of sustainability, ethical sourcing, and environmental impact have intensified, making more responsible, transparent, and traceable procurement practices unnegotiable requirements for modern systems. In this paper, we examine the potential of emerging technologies and innovations such as blockchain, artificial intelligence, and the Internet of Things (IoT) in filling these gaps within the supply chain systems of enterprises in the US. The study employs a comprehensive review of relevant literature and case studies to discover and provide insights on how these technologies can improve procurement processes, optimize resource allocation and utilization, and improve sustainability. The findings of this study highlight the need for stakeholders to embrace technological advancements to effectively navigate the dynamic landscape of supply chain management.

Stress is an inherent sensation of being unable to handle demands and occurrences. If not properly managed, stress can develop into a chronic condition, leading to the onset of additional chronic health issues like cardiovascular illnesses and diabetes. Various stress meters have been suggested in the past, along with diverse approaches for its estimate. However, in the case of more serious health issues such as hypertension and diabetes, the results can be significantly improved. This study presents the design and implementation of a distributed wearable sensor computing platform with multiple channels. The platform aims to estimate stress levels in diabetes patients by utilizing a fuzzy logic algorithm that is based on the assessment of several physiological indicators. Additionally, a mobile application was created to monitor users' stress levels and integrate data on their blood pressure and blood glucose levels. Validation experiments were performed on patients with chronic diabetes, and the initial findings are presented in the study.

For this research we are selected three indicators of wheat: yield (t/ha), producer price (USD/t) and share of the harvested area under wheat in relation to the total land area of country (%). The mentioned indicators were analyzed for the period 2006-2021 in thirty-two European countries. The purpose of the research is to determine which of the mentioned indicators achieve average annual growth/decrease rates, what is the correlation between them, how European countries are grouped with their similarities and differences. The research examines the impact of the COVID-19 pandemic on the mentioned indicators in a two time phases: Phase I, before the pandemic (2006-2019); Phase II, during the pandemic (2020-2021). The methodological approach to the research topic involved the application of descriptive statistics, as the method of principal components analysis (abbr. PCA) with graphics. A positive correlation exists only between the yield of wheat and the share of the harvested area under wheat in the total area of the land (0.291). PCA method showed that countries are grouped differently depending on the observed indicator and the analyzed time phase.

In this study, the NiCrAlY coating was prepared using the atmospheric plasma spraying (APS). The sample was then exposed to a continuous fiber laser beam. Laser surface melting (LSM) can effectively homogenize the composition of the coating. It also reduced the defects and roughness. The coating was examined using optical microscopy (OM), scanning electron microscopy (SEM), and X-ray diffraction (XRD) analysis. The process parameters of the LSM consist of laser power and scan rate. The high-temperature oxidation test was conducted for 200 hours at a temperature of 1100 °C. After a period of 200 hours, the primary coating demonstrated the emergence of an aluminum oxide layer, along with the presence of harmful spinel oxides. The laser remelting technique was used to modify the surface, which led to the uniform growth and development of an aluminum oxide layer (α-Al₂O₃) during the oxidation examination. Therefore, it appears that the reduction in grain size caused by laser remelting prevents the wrinkling of Al2O3 oxide. This process represents a novel and alternative approach to modifying MCrAlY coatings.

Background/Objectives: We defined the value of a machine learning algorithm to distinguish between the EEG response to no light or any light stimulation, and between red or green light stimulation in awake volunteers with closed eyelids. This new method of EEG analysis is visionary in the understanding of visual signal processing and will facilitate anaesthetic depth research. Methods: X-gradient boosting models were used to classify the cortical response to VEP stimulation (no light vs. any light stimulation; red vs. green light stimulation). For each of the two classifications, three scenarios were tested: training and prediction in all participants (all), training and prediction in one participant (individual), training across all but one participant with prediction in the participant left out (one out). Results: Ninety-four Caucasian adults were included. The machine learning algorithm had a very high predictive value and accuracy in differentiating between no light and any light stimulation (AUCROCall: 0.96; accuracyall: 0.94; AUCROCindividual: 0.96±0.05, accuracyindividual: 0.94±0.05; AUCROConeout: 0.98±0.04; accuracyo-neout:0.96±0.04). The machine learning algorithm was highly predictive and accurate in distinguishing between green and red colour stimulation (AUCROCall: 0.97; accuracyall: 0.91; AUCROCin-dividual: 0.98±0.04, accuracyindividual: 0.96±0.04; AUCROConeout: 0.96±0.05; accuracyoneout: 0.93±0.06). The predictive value and accuracy of both classification tasks was comparable between males and females. Conclusions: Machine learning algorithms could almost continuously and reliably differentiate between the cortical EEG responses to no light or any light stimulation and between green or red colour stimulation using VEPs in awake female and male volunteers with eyes closed. Our findings may open new possibilities for using VEPs in the intraoperative setting.

Telecoupling, interactions between social-ecological systems across large, often global, distances, drives negative impacts from the forest-based carbon market. Yet, these negative impacts have been underreported; and therefore, likely vastly underestimated. We identify how these unintended negative impacts may occur and provide recommendations for the forest-based carbon market to better account for externalities by prioritising positive social impact, expanding comprehensive ecological outcomes and improving transparency of investments. We call for a carbon market that is designed to account for its global interconnectedness.

Adeno-associated viruses (AAVs) have been used for liver gene therapy. Hemgenix and Roctavian are AAV-based treatments for hemophilia B and A, respectively. They cost $3 million and $2.8 million per dose, respectively. While AAV vectors may eventually be cheaper to mass produce, a bacteria-based DNA delivery system might be much cheaper for patients. Also, “bactofection” would allow for the delivery of much larger DNA packages. Such a bacterial system may now be possible, and a prototype for the liver could possibly be developed immediately.

Background: Long COVID, characterized by a persistent symptom spectrum following SARS-CoV-2 infection, poses significant health, social, and economic challenges. This review aims to consolidate knowledge on its epidemiology, clinical features, and underlying mechanisms to guide global responses; Methods: We conducted a systematic literature review, analyzing peer-reviewed articles and reports to gather comprehensive data on long COVID’s epidemiology, symptomatology, and management approaches; Results: Our analysis revealed a wide array of long COVID symptoms and risk factors, with notable demographic variability. The current understanding of its pathophysiology suggests a multifactorial origin yet remains partially understood. Emerging diagnostic criteria and potential therapeutic strategies were identified, highlighting advancements in long COVID management.; Conclusion: This review highlights the multifaceted nature of long COVID, revealing a broad spectrum of symptoms, diverse risk factors, and the complex interplay of physiological mechanisms underpinning the condition. Long COVID symptoms and disorders will continue to weigh on healthcare systems in years to come. Ad-dressing long COVID requires a holistic management strategy that integrates clinical care, social support, and policy initiatives. The findings underscore the need for increased international cooperation in research and health planning to address the complex challenges of long COVID. There is a call for continued refinement of diagnostic and treatment modalities, emphasizing a multidisciplinary approach to manage the ongoing and evolving impacts of the condition.

Artificial intelligence (AI), deep learning (DL) or machine learning (ML) is the ability of computer systems, machines and enginery to work devise procedures like humans. These technologies provide opportunities and possibilities to advance diagnostics and in planning also in the field of human medicine and dentistry. The purpose of this literature review was to ascertain the applicability and significance of AI, as well as to highlight its uses in maxillofacial surgery. The primary inclusion criterion for this publication was an original paper written in English focusing on the use of AI, DL or ML in maxillofacial surgery. The sources of information were PubMed, Scopus and Web of Science, and the queries were made on 31st of December 2023. The search strings used were “artificial intelligence maxillofacial surgery”, “machine learning maxillofacial surgery” and “deep learning maxillofacial surgery”. Following the removal of duplicates, all remaining publications that were returned by the searches and were screened by three independent operators to minimize the risk of bias. The analysis of publications from 1992 to 2023 identified certain records, of which 324 were finally selected. These were calculated according to the year of publication with a continuous increase (excluding 2012 and 2013) of R2 = 0.9295. Generally, in orthognathic dentistry and maxillofacial surgery, artificial intelligence and machine learning have gained popularity over the past few decades. When we included the keywords "planning in maxillofacial surgery" and "planning in orthognathic surgery", the set of published papers significantly increased to the number of 7535 publications. The first publication appeared in 1965, with an increasing trend (excluding 2014-2018), with an R2 value of 0.8642. These tools have been found useful for diagnosis, treatment planning in head and neck surgical oncology, cosmetic and aesthetic surgery, and in oral pathology. In orthognathic surgery, they have been utilised for diagnosis, treatment planning, assessment of treatment needs, cephalometric analyses, and orthognathic surgeries, among other applications. The review confirms that the current use of artificial intelligence and machine learning in maxillofacial surgery is focused mainly on the evaluation of digital diagnostic methods especially radiology, treatment plans and postoperative results. However, as these technologies are integrated in maxillofacial surgery and robotic surgery in head and neck region, it is expected that in the future they will be gradually utilized to plan and comprehensively evaluate the success of maxillofacial surgeries.

Hydrodynamic modeling and hazard mapping are essential tools for urban flood mitigation and spatial planning. Leveraging software like HEC-RAS (Hydrologic Engineering Center - River Analysis System) and ArcGIS, this study aimed to map flood-prone areas along the Jijia River in the Ungheni administrative unit of Iasi County. Human-induced environmental changes and global climate shifts have heightened flood risks worldwide, particularly in urbanized areas. Hydrological and hydraulic modeling anticipate and assess flood events, while hydrodynamic modeling accurately simulates flow propagation, in-forming flood extent, timing, and volume. Flood hazard maps offer essential insights into flooded areas, water depths, and velocities, assisting in risk assessment and mitigation strategies. Through the use of different scenarios, river modeling aims to accurately replicate real-world conditions. This study focuses on Ungheni commune in Iasi County, Romania, situated along the Prut River's eastern bank. Utilizing a combination of fixed-grid and irregular mesh elements in modeling al-lows for fine-tuning of flow details and optimization of simulation times. Model accuracy, particularly regarding peak river levels, hinges on hydrograph duration. While a 30-minute error is typically accepted, greater tolerances may apply to river basins with longer response times. The extraction and processing of model results, including maximum water depths, flood extents, and velocity maps, are facilitated by ArcGIS, providing valuable data for effective flood management strategies.

Global optimization is widely adopted nowadays in a variety of practical and scientific problems. In this context, a group of techniques that is widely used is that of evolutionary techniques. A relatively new evolutionary technique in this direction is that of Giant Armadillo Optimization, which is based on the hunting strategy of giant armadillos. In this paper, a number of modifications to this technique are proposed, such as the periodic application of a local minimization method as well as the use of modern termination techniques based on statistical observations. The proposed modifications have been tested on a wide - series test functions, available from the relevant literature and it was compared against other evolutionary methods.

The experience of ego dissolution and self-transcendence induced by psychedelic substances offers a profound challenge to our conventional understanding of the self and our relationship with the natural world. This paper delves into the philosophical underpinnings and implications of this phenomenon, exploring how the temporary breakdown of ego boundaries during a psychedelic experience may foster a sense of profound interconnectedness with nature. Drawing from Western and Eastern philosophical traditions, as well as recent insights from neuroscience and consciousness studies, we examine the potential of psychedelic-induced self-transcendence to catalyze a shift in our perspectives on the human-nature relationship. The paper investigates the philosophical implications of this experience, including its resonance with deep ecological philosophies and its potential to inspire more ecocentric ethical frameworks. Furthermore, we explore the possible practical implications of fostering a sense of ecological connectedness through psychedelics, such as promoting environmentally sustainable behaviors and addressing the pressing challenges of climate change and ecological degradation. Ultimately, this exploration highlights the value of engaging with altered states of consciousness as a means to reconsider our place within the intricate web of life on Earth.

The study findings revealed significant variability in various wood properties among different genetic families, although the static modulus of elasticity did not exhibit significant differences between the chosen genetic families. All measured wood properties decreased from the bottom to the top of the model trees. Wood hardness displayed a moderately negative correlation with wood density and weak correlations with MOE and MOR. Given the weak correlations between wood hardness and other wood mechanical properties, it is suggested that the MOEdyn would be a more suitable trait for genetic studies.

Based on the goals of "high reliability, high frequency, rapid launch, and low cost" for space launch site, and drawing inspiration from the design principles of SpaceX's Starship launch test facility, an integrated dual-sided deflector system for convective cooling and thermal protection is presented. The interaction process between the gas jet and liquid water jet and its effect on the flow field environment are thoroughly studied using numerical calculation methods. Furthermore, Regarding the phase-change heat transfer issue in a compressible gas-liquid two-phase flow and the varying distribution of different bubble shapes and sizes at the gas-liquid interface, a modified Lee model is derived. The rationality and accuracy of the phase-change mass-transfer coefficient values can be improved by adjusting the equivalent diameter and shape factor of the bubbles. The research results demonstrate that compared to the classical Lee model, the modified Lee model can achieve a higher numerical accuracy in predicting the heat and mass transfer processes in gas-liquid two-phase flows. Through comparative analysis with traditional dual-sided deflector and conventional cooling system, the integrated dual-sided deflector system for convective cooling and thermal protection exhibits significant performance advantages in gas flow regulation, flow field environment improvement and erosion protection in the near-ground region of the launch site. Particularly, regarding the thermal environment of the dual-sided deflector, it not only achieves effective flow deflection, but also mitigates the degree of erosion caused by the gas jet on the deflector. This conclusion can provide theoretical references for the thermal protection design of commercial launch vehicle system at space launch site.

The direct hydrogenation of greenhouse gas carbon dioxide (CO2) to higher alcohols (C2+OH), as an important research area in C1 chemistry, is one of the most essential approaches to convert CO2 into liquid fuels or other value-added chemicals. The high atom economy and direct pathway make this reaction attractive to convert CO2 to higher alcohols. However, due to the complicated reaction network and the difficulty of C-C coupling, the formation of higher alcohols is more difficult compared with methanol or other compounds containing one carbon. The key issue is development of novel catalysts with high conversion and space time yield. But this is still a huge challenge faced by researchers. In this review, the thermodynamics and reaction pathways of CO2 hydrogenation were firstly clarified. Subsequently, after reviewing single metal-based, bi-and multi-metallic catalysts, the recently progress of tandem catalytic system was emphasized. Finally, we also provided an overview about tandem catalysis for CO2 hydrogenation to higher alcohols.

Enclosed public spaces are the hotspots for airborne disease transmission. To measure and maintain indoor air quality in terms of airborne transmission, an open source, low cost and distributed array of Particulate Matter Sensors has been developed and named as Dynamic Aerosol Transport for Indoor Ventilation or DATIV system. This system can use multiple Particulate Matter Sensors (PMS) simultaneously and can be remotely controlled using a Raspberry Pie based operating system. The data acquisition system can be easily operated using the GUI within any common browser installed on a remote device such as a PC or Smartphone with corresponding IP address. The software architecture and validation measurements are presented together with possible future developments.

Retinoblastoma (Rb) is a rare cancer that nonetheless represents the most common ocular malignancy in children. Rb exists as familiar and sporadic cancer and the increasing incidence of the sporadic one and its pathogenesis is mostly unknown. To date the management of retinoblastoma requires intensive chemotherapy and sometimes invasive surgery in order to preserve vision and quality of life in Rb patients. The discovery of the epigenetic nature of non-hereditable/sporadic Rb led to the development of high-throughput precision investigation strategies for the study of its epigenetic landscape. Here we investigated the effect of the demethylating 5-Aza-2’- deoxycytidine (Decitabine; DAC) agent on preclinical models to assess its possible use as anti-cancer drug in the treatment of Rb patients. We found that DAC treatment induced cell cycle arrest and apoptosis in Weri-Rb-1 cells. We investigated the variation of differential gene expression profile in Rb cells in relation to time of exposure to DAC with respect to controls. Network map analysis evidences 15 hub/driver genes, which share pathways of regulation of TNF-, FAS-, p53-dependent apoptotic signaling and NF-kB pro-survival pathways. Furthermore, a computing expression profile analysis of publicly available datasets of patients’ primary tumors and normal retina cell-derived organoids vs WeriWeri-Rb-1 DEGs depicted the relevancy of these 15 hub genes on retinoblastoma genesis. The antiproliferative effect of DAC treatment on Rb was confirmed in vivo, both in subcutaneous xenograft and orthotopic models also showing the changes the gene methylation status in treated Weri-Rb-1, shedding a new light on the reprogramming antiproliferative dynamics induced by the epigenetic therapy and on the role of this therapeutic approach to spare children sight and life.

Quasi-interpolation is a powerful tool for approximating functions using radial basis functions (RBFs) such as Gaussian kernels. This avoids solving large systems of equations as in RBF interpolation. However, quasi-interpolation with Gaussian kernels on compact intervals can have significant errors near the boundaries. This paper proposes a quasi-interpolation method with Gaussian kernels using Chebyshev points and boundary corrections to improve the approximation near the boundaries. The boundary corrections use a linear approximation of the function beyond the interval to estimate the truncation error and add correction terms. Numerical studies on test functions show that the proposed method reduces errors significantly near boundaries compared to quasi-interpolation without corrections, for both equally spaced and Chebyshev points. The convergence and accuracy with the boundary corrections are generally better with Chebyshev points compared to equally spaced points. The proposed method provides an efficient way to perform quasi-interpolation on compact intervals while controlling the boundary errors.

A methodology has been developed to assess the presence and dissipation of herbicides of wide range of polarities in soil using in-tube solid phase microextraction (IT-SPME) coupled on-line to capillary liquid chromatography (capLC). The compounds investigated were tritosulfuron (TRT), triflusulfuron-methyl (TRF), aclonifen (ACL) and bifenox (BF), with log octanol-water partition coefficients (log Kow) ranging from 0.62 to 4.48. The linearity, recoveries, intra and interday precision, limits of detection (LODs) and quantification (LOQs), and accuracy of the method were established. The proposed approach was successfully applied assess the degradation of the tested herbicides in different types of soil (agricultural, urban and forest) after being exposed to different laboratory and outdoor conditions. The results obtained showed a greater persistence of the most apolar compounds ACL and BF, regardless of the soil characteristics, whereas a significant degradation of highly polar herbicides TRT and TRF was observed in soils with lowest organic matter even after a few days of exposure. Those results indicate that the proposed approach can be considered an effective tool for a better understanding of soil pollution.

In this study, I will present some documentary evidence that Carlos Drummond de Andrade’s poem “A Máquina do Mundo” [The Machine of the World] (1949) was based on prior reflections contained in a forgotten newspaper article entitled “Poesia e Pesadelo” [Poetry and Nightmare] (1949). In that article, Drummond critically analyzed some of the theses of Stephen Spender's essay “What Is Modern in Modern Poetry” (1948), which had just been published in The Tiger's Eye magazine. As soon as he read Spender's text, Drummond wrote “Poetry and Nightmare” and began to elaborate a narrative poem whose protagonist would be a machine. All the documentary evidence indicates that Drummond took Spender's lessons as touchstones for the elaboration of the narrative and allegorical structure of “The Machine of the World.” According to the interpretation I am proposing here, Drummond, in writing the machine poem, put into practice at least six lessons drawn from Spender’s essay, namely: 1) the modern poet must represent the tension between the external machinelike landscape and the landscape of the inner world of the creative imagination; 2) he must also represent the machinelike, ugly, and urban world around him in a beautiful and poetic way; 3) he must avoid the misconceptions of excessive utopian visionarism, as well as creeping realism; 4) he must reject the imperative of political engagement, whose principle of action states that poetry has a transformative mission in society; 5) he must free himself from the obsession with free verse as the only form of modern poetry and start using the traditional fixed forms; 6) he must understand machines as poetic symbols of human passions, and not just as exotic objects foreign to human reality. My conclusion is that, after reading Spender’s essay, Drummond changed his aesthetic and philosophical understanding of what defines the essence of modern poetry, both in terms of form and content.

Objectives: This study assessed the performance of a novel fluoride dentifrice containing micro- fibrillated cellulose (MFC) and 7% silica (Protegera™) versus common fluoride dentifrices. Methods: Removal of extrinsic stains was assessed using the pellicle cleaning ratio (PCR) method, and radioactive dentin abrasivity (RDA) was measured, to calculate a cleaning efficiency index (CEI). Fluoride efficacy was evaluated using widely used remineralization and fluoride uptake methods. Results: The MFC dentifrice removed stained pellicle significantly more effectively than the ADA reference material, Crest Cavity Protection™ and Sensodyne Pronamel™, and had equal performance to three known marketed stain-removing dentifrices (Arm & Hammer™ Advanced Whitening, Crest ProHealth™, and Colgate Optic White™). The MFC dentifrice vehicle had a low RDA (88), which was significantly less than Crest ProHealth (166) and Crest 3D-White™ (183). Based on PCR and RDA data, the CEI was 31% greater for the MFC product than for Crest ProHealth. In a 10-day pH cycling study, the fluoride efficacy of the MFC product was superior to a non-fluoridated control and was not significantly different from Sensodyne Pronamel and Crest Cavity Protection. The MFC dentifrice was superior for promoting fluoride uptake into incipient enamel lesions than the USP reference dentifrice. Conclusion: The low dentin abrasivity MFC dentifrice is highly effective in removing stained pellicle, and is an efficacious fluoride source when compared to other relevant commercially available fluoride dentifrices with high dentin abrasivity. Clinical Significance: Including micro-fibrillated cellulose into a fluoride dentifrice may enhance cleaning performance for the removal of external stain, while lowering abrasivity, and providing an effective fluoride source. This combination of benefits seems well suited to enamel protection and caries prevention.

The integration of artificial intelligence (AI) technologies into business practices presents both opportunities and challenges for Sabah, Malaysia. This dynamic abstract explores the latest research problem at the intersection of AI and business in Sabah, focusing on optimizing resource allocation in agriculture and enhancing tourism experiences through AI-driven solutions.In Sabah's agricultural sector, AI holds immense potential to revolutionize traditional farming practices. With limited arable land and unpredictable weather patterns, farmers face significant challenges in maximizing crop yields while minimizing resource inputs. Through the application of machine learning, remote sensing, and IoT devices, researchers aim to develop precision farming techniques that can analyze soil health, monitor crop growth, and predict pest outbreaks with unprecedented accuracy. By optimizing resource allocation and enhancing decision-making processes, these AI-driven solutions have the potential to revolutionize Sabah's agriculture industry, promoting sustainability and resilience in the face of environmental uncertainties.Moreover, the tourism industry in Sabah stands to benefit from AI integration, particularly in enhancing visitor experiences and destination management. With its diverse natural landscapes and rich cultural heritage, Sabah attracts tourists from around the globe. AI-powered recommendation systems, tailored to individual preferences and behavior, have the potential to provide personalized travel itineraries, optimize resource allocation, and boost visitor satisfaction. Additionally, natural language processing (NLP) algorithms can analyze online reviews and social media sentiments, providing valuable insights for destination marketing and management strategies. By harnessing the power of AI, Sabah can elevate its tourism offerings, attract more visitors, and enhance its reputation as a premier travel destination.However, alongside these opportunities, challenges abound in the integration of AI into Sabah's business landscape. Concerns regarding data privacy, cybersecurity, and ethical implications must be carefully addressed to ensure the responsible and sustainable deployment of AI technologies. Furthermore, the digital divide and limited access to technology in rural areas pose barriers to widespread adoption, necessitating comprehensive strategies for capacity building and infrastructure development.In conclusion, the advancement of AI integration in Sabah's business landscape holds immense promise for driving innovation, economic growth, and sustainability. By addressing the research problems outlined in this abstract, researchers, policymakers, and industry stakeholders can collaboratively navigate the opportunities and challenges of AI integration, paving the way for a prosperous and inclusive future for Sabah, Malaysia.

Alcoholic liver disease (ALD) develops when the immunotolerant environment of the liver is compromised due to excessive alcohol consumption. ALD progression involves variations in the expression of multiple genes, resulting in liver inflammation and the development of a leaky gut. Molecular mechanism involved for ALD progression is still unclear, and due to that there are currently no FDA-approved drugs available for its treatment. In this study, the protective effects of Graphene oxide nanoparticles (GO) was investigated against ethanol-induced damage in the gut-liver axis in in vitro. GO was synthesized using a modified Hummer's method and characterization was done. Given the general concerns regarding nanoparticle toxicity, assessment of cell viability, lipid accumulation, DNA damage, cell death, and the generation of reactive oxygen species (ROS) were conducted using various techniques. Furthermore, gene expression of pro- and anti-inflammatory cytokines was done using RT-qPCR. The findings revealed that GOs promoted cell viability even against ethanol treatment. Additionally, lipid accumulation significantly decreased when cells were treated with GO alongside ethanol compared to ethanol treatment alone, with similar trends observed for other assays. Gene expression analysis indicated that GO treatment reduced the expression of proinflammatory cytokines while enhancing the expression of antioxidant genes. Moreover, GO treatment led to improvements in gut permeability and a reduction in proinflammatory cytokines in colon cells damaged by ethanol. These findings suggest that GO holds promise as a drug carrier, exhibiting no observed toxic effects. By shedding light on the protective effects of GO against ethanol-induced damage, this study contributes to the burgeoning field of nanoparticle-mediated therapy for ALD.

LONP1 is the principal AAA+ unfoldase and bulk protease in the mitochondrial matrix, so its deletion causes embryonic lethality. The AAA+ unfoldase CLPX and the peptidase CLPP also act in the matrix, conspicuously during stress periods, but their substrates are poorly defined. Mammalian CLPP deletion triggers infertility, deafness, growth retardation, and cGAS-STING activated cytosolic innate immunity. CLPX mutations impair heme biosynthesis and heavy metal homeostasis. CLPP and CLPX are conserved from bacteria to human, despite their secondary role for proteolysis. Based on recent proteomic-metabolomic evidence from knockout mice and patient cells, we propose that CLPP acts on phase-separated ribonucleoprotein granules, and CLPX on multi-enzyme condensates, near the inner mitochondrial membrane, as first-aid system. Trimming within assemblies, CLPP rescues stalled processes in mitoribosomes, in mitochondrial RNA granules and nucleoids, and in D-foci-mediated degradation of toxic double-stranded mtRNA / mtDNA. Unfolding multi-enzyme condensates, CLPX maximizes PLP-dependent delta-transamination, and rescues malformed nascent peptides. Overall, their actions occur in granules with multivalent or hydrophobic interactions, separated from the aqueous phase. Thus, the role of CLPXP in the matrix is compartment-selective, like peptidases MPP at precursor import pores, m-AAA and i-AAA at either IMM face, PARL within the IMM, and OMA1/HTRA2 in the intermembrane space.

Addressing the issue of low bonding strength in Ti/Mg laminated composites due to interfacial oxidation, this study employs a differential temperature rolling method using longitudinal induction heating to fabricate Ti/Mg composite plates. The entire process is conducted under an argon gas protective atmosphere, which prevents interfacial oxidation while achieving uniform deformation. The effects of reduction on the mechanical properties and microstructure of the composite plates are thoroughly investigated. Results indicate that as the reduction increases, the bonding strength gradually increases, mainly attributed to the increased mechanical interlocking area and a broader element diffusion layer. This corresponds to a transition from brittle to ductile fracture at the microscopic tensile-shear fracture surface. When the reduction reaches 47.5%, the Ti/Mg interfacial strength reaches 63 MPa, which is approximately a 20% improvement compared to the bonded strength with previous oxidation at the interface. Notably, at a low reduction of 17.5%, the bonding strength is significantly enhanced by about 1 time. Additionally, it is found that a strong bonded interface at high reduction is beneficial in hindering the propagation of interfacial cracks during tensile testing, enhancing the ability of the Ti/Mg composite plates to resist interfacial delamination.

The abstract summarizes the transformative impact of artificial intelligence (AI) on employment in Malaysia, highlighting the need for comprehensive strategies to ensure inclusivity and equitable access to AI-driven opportunities and digital skills training. It addresses the research problem of potential inequalities and marginalization among vulnerable populations due to uneven distribution of AI-related employment opportunities and training. The research objectives focus on developing decentralized strategies tailored to rural communities and marginalized groups, alongside evaluating policy interventions for equitable access. The literature review provides theoretical frameworks emphasizing skill development, understanding structural shifts, fostering inclusive innovation, and promoting collaborative governance. Future research directions include implementing and evaluating strategies in real-world contexts, exploring technological solutions, conducting qualitative research on individuals' experiences, and adopting interdisciplinary approaches. Overall, a multidimensional approach combining theoretical insights, empirical evidence, and stakeholder engagement is essential for developing inclusive and sustainable solutions to harness AI's potential for the benefit of all Malaysians.

The performance of Yttrium-Barium Copper Oxide (YBCO) high-temperature superconductors in high-frequency applications is significantly affected by the microwave surface resistance (Rs). The paper delves into the basics, measuring methods and factors affecting the resistance (Rs) in YBCO, highlighting its high critical temperature (Tc) and low resistance, positioning it as a promising material. YBCO's compatibility with epitaxial growth and microstructure engineering offers opportunities to reduce grain boundary effects and improve Rs, making it advantageous for high-frequency electronics, communication systems, and MRI coils. This is due to its high critical current density (Jc) and exceptional Rs at practical temperatures. Challenges remain in comprehending and managing Rs in YBCO, despite its favorable characteristics. Utilizing advanced fabrication methods and incorporating nanotechnology allow for customization of YBCO-based devices. Multi-scale modeling and simulation are essential for guiding experimental work and understanding YBCO's performance in high-frequency settings. This study highlights the promise of YBCO for future high-frequency technologies and stresses the importance of more research to overcome hurdles and fully exploit its capabilities, potentially transforming superconducting devices for practical use.

This research article describes the creation of a mock-up for a Smart Insole prototype that employs Force Sensitive Resistors (FSRs) and an ADXL345 accelerometer. The mock-up is an early step towards realising the concept and functionality of the planned Smart Insole system. The key factors in the mock-up's design, integration, and testing are highlighted, with a focus on the iterative refining and optimisation process. The mock-up, which was carefully planned and implemented, highlights the practicality and possible applications of Smart Insole technology in healthcare, sports performance measurement, and rehabilitation. The paper outlines the development process and implementation of a "Smart Insole" utilizing Force Sensitive Resistors (FSR) and the ADXL345 accelerometer. The project aims to create an innovative wearable technology solution for monitoring foot biomechanics and enhancing human performance. The Smart Insole prototype integrates FSRs strategically placed on the insole to capture pressure distribution across the foot, along with an ADXL345 accelerometer to track foot orientation and movement. Through a combination of hardware integration, firmware development using Arduino IDE, and visualization using Processing application, the Smart Insole offers real-time monitoring and analysis of gait dynamics, pressure distribution, and foot movement.

The mortality of birds resulting from collisions and electrocutions with overhead lines, such as power lines, and phone line among others, has been implicated in the decline of various avian species globally. Specifically, overhead line collisions pose a significant threat to the conserva-tion of the Canarian houbara bustard (Chlamydotis undulata fuertaventurae), an endangered sub-species endemic to the Canary Islands. This study centres on the postmortem findings of Canarian houbara bustards that have collided with overhead lines, providing insights into the post-collision outcomes for these birds. A com-plete standardized necropsy of nine Canarian houbara bustards revealed that polytrauma was the cause of death in all cases. The most notable gross lesions associated with trauma included bone fractures, soft tissue lacerations, haemorrhages, luxations, and hemocoelom, with certain body regions being more frequently affected. Histopathology, immunohistochemistry, and en-tomology analysis confirmed that numerous birds survived the initial trauma, exhibiting varia-ble survival intervals before succumbing to their injuries. We concluded that when a houbara bustard collide with an overhead line it frequently survives the initial trauma. The histopathology, immunohistochemistry, or entomologic analysis may be helpful to approximate the timing interval between trauma and death.

This study presents an advanced Simulated Shearer Machine Cutting Experiment System enhanced with digital twin technology. Central to this system is a simulated shearer drum, designed based on similarity theory to mirror the operational dynamics of actual mining cutters accurately. The setup incorporates a modified machining center equipped with sophisticated sensors that monitor various parameters such as cutting states, forces, torque, vibration, temperature and sound. These sensors are crucial for precisely simulating the shearer cutting actions. The integration of digital twin technology is pivotal, featuring a real-time data management layer, a dynamic simulation mechanism model layer, and an application service layer that facilitates virtual experiments and algorithm refinement. This multifaceted approach allows for in-depth analysis of simulated coal cutting, utilizing sensor data to comprehensively evaluate the shearer's performance. The study also includes tests on simulated coal samples. The system effectively conducts experiments and captures cutting condition signals via the sensors. Through time-domain analysis of these signals, gathered while cutting materials of varying strengths, it is determined that the cutting force signal characteristics are particularly distinct. By isolating the cutting force signal as a key feature, the system can effectively distinguish between different cutting modes. This capability provides a robust experimental basis for coal-rock identification research, offering significant insights into the nuances of shearer operation.

Emerging semiconductor devices often lack accurate analytical models. The same is usually true of any devices working under extreme conditions like cryogenic temperatures. The usual workaround involves the use of approximation models, usually based on lookup tables or neural networks individually fitted to measurement data. In the case of experimental devices or ones working under extreme conditions, the number of units available for measurement is limited. As a result, the number of approximation-model instances is too small to enable a statistical simulation of even middle-sized circuits, which is a necessary step in integrated-circuit design since it provides the realistic picture of the circuit’s behavior in the presence of manufacturing process variations. Approximation models using structure parameters as inputs do exist in the literature, but are only useful if the end user knows the statistical distributions of those parameters, which is not usually the case. We propose a technique based on generative machine learning, namely the variational autoencoder, that uses only a small sample of devices to capture the essential features of their I–V curves under process variations and subsequently generates an arbitrary number of similarly disturbed curves. The model trained on as few as 20 instances per device type is shown to precisely reproduce the distributions of period and power consumption of a ring oscillator.

Keywords: Vascular Malformation, Diode Laser, Angioma, Blue light, Conservative

Smallsats are becoming the predominant electro-optical Earth observation (EO) imaging platforms. While atmospheric correction of smallsat data enhances its utility, an established pathway to do so may constrain accuracy and utility. The alternative, Closed-form Method for Atmospheric Correction (CMAC), developed for smallsat application provides surface reflectance derived solely from scene statistics. In a prior paper, CMAC closely agreed with Land Surface Reflectance Code (LaSRC) software for correction of the four VNIR bands of Landsat-8/9 images for conditions of low to moderate atmospheric effect over quasi-invariant warehouse-industrial targets. Those results were accepted as surrogate surface reflectance to support analysis of CMAC and LaSRC reliability for surface reflectance retrieval in two contrasting environments: shortgrass prairie and barren desert. Reliability was defined and tested through a null hypothesis: the same top-of-atmosphere reflectance under the same atmospheric condition will provide the same estimate of surface reflectance. Evaluated against the prior surrogate surface reflectance, the results found decreasing error with increasing wavelength for both methods. From 58 comparisons across the four bands, LaSRC average absolute error ranged from 0.59% (NIR) to 50.30% (blue). CMAC error was well constrained from 0.01% (NIR) to 0.98% (blue) sustaining the null hypothesis for reliability.