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, 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, 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, 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.

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.

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.

Irregular female migration to Europe is a growing phenomenon, as more and more women are fleeing their countries of origin due to gender inequality and violence. During the migration process, women experience physical, psychological and social problems that affect their sex lives. The aim of our study is to describe and understand how irregular migrant wom-en living in humanitarian reception centers experience their sexuality at different stages of the migration process. This qualitative phenomenological study collected data through a sixteen in-depth interviews with irregular migrant women between January and February 2023. Data anal-ysis was carried out using ATLAS-ti 23.0 software, from which three themes were extracted: 1) The sexual reality of sub-Saharan women, 2) In search of a better life: take the risk or surrender, and 3) The migrant sexual revolution. The sexual reality of sub-Saharan women is subject to a complex normative order. The migratory process has severe consequences on migrant women's sex life. The sexual needs of irregular migrant women admitted to humanitarian reception cen-ters undergo a process of change that must be understood by healthcare providers in order to make improvements to care provision.

China is experiencing rapid urbanization. The focus on health issues has shifted from the treatment of diseases to passive or active prevention. Diseases caused by the deterioration of the urban environment, such as cardiovascular disease, diabetes, obesity and other chronic diseases and mental illness, have gradually become the main threat to public health. Studies have confirmed that urban green spaces (UGS) can help residents relieve mental stress, improve mood, reduce mental fatigue and restore attention, which has a positive effect on people's physical and mental health. In this study, the relationship between the quantity and quality factors of UGS and the physical and mental health of urban residents in Xihu District of Hangzhou is examined, and on this basis, UGS design strategies are proposed to promote the physical and mental health of residents. This study is of great significance for the future construction of UGS that are beneficial to the health of residents and the promotion of a healthy China and healthy city construction.

Amidst worsening climate change, drought stress imperils global agriculture, jeopardizing crop yields and food security, necessitating urgent exploration of sustainable methods like biopriming, harnessing beneficial microorganisms to bolster plant resilience. Recent research has revealed diverse biological compounds with versatile applications produced by Schizophyllum commune, rendering this fungus as a promising contender for biopriming applications. For the first time this study aimed to investigate,the potential of S. commune exo- (EPSH) and intra-PSH (IPSH), isolated from two strains: Italian (ITA) and Serbian (SRB) under submerged cultivation, in enhancing the resilience of Pisum sativum L. seeds through biopriming technique. Testing of seed quality of bioprimed, hydroprimed, and unprimed seeds was done using a germination test, under optimal and drought conditions. In optimal conditions, the IPSH SRB increased germination energy by 5.50% compared to the control, while the highest percentage of germination (94.70%) was shown after biopriming with PSH isolated from the ITA strain. Additionally, all assessed treatments resulted in a boost in seedling growth and biomass accumulation, where the ITA strain demonstrated greater effectiveness in optimal conditions, whereas the SRB strain showed superiority in drought conditions. The drought tolerance indices increased significantly in response to all examined treatments during the drought, with EPSH ITA (23.00%) and EPSH SRB (24.00%) demonstrating the greatest effects. Results demonstrate a significant positive influence of fungal PSH, indicating their potential as biopriming agents and offers insights into novel strategies for agricultural resilience in the face of changing environmental conditions.

.Various synthetic nematicides are currently used effectively in the control of plant parasitic nematodes. However, these nematicides have adverse effects on humans and the environment. Neem oil is eco-friendly alternatives to synthetic nematicides. The effectiveness of repeated neem oil application in suppressing the root-knot nematodes infestation in figs seedlings was therefore examined in this study, both in its natural form (10 ml/L) and in its nano-emulsion form (5 and 7 ml/L). The recorded reduction parameters of M. incognita were J2/250g soil, galls and egg masses / 5g roots of infected fig seedlings were measured at that time, and the effects of these natural additives were compared with the Fosthiazate (Krenkel 75%EC). The impact of such soil amendments on some typical plant parameters, the total microbial count of soil, and the overall enzymatic activity of the fig rhizosphere were also included. Obtained results revealed that the soil population density of root knot nematode suppressed by 80.3% , reduction of nematode egg masses (60.4%) due to the application of nano-emulsion of neem oil (at 7ml/L). Present work recommend the use of nano-emulsion of neem oil as one of the effective and eco-friendly means to reduce the root- knot nematode on fig .

This perspective discusses the ongoing real-world practice using nitazxoanide, NSAIDs and/or azithromycin (Kelleni’s protocol) to manage the evolving manifestations of SARS CoV-2 Omicron EG.5.1, its descendant HV.1 as well as BA.2.86 and its descendant JN.1 subvariants in Egypt. These subvariants are well-known for their highly evolved immune-evasive properties and the manifestations include some peculiar manifestations as persistent cough besides high fever in young children as well as high fever, persistent severe cough, change of voice, loss of taste and smell, epigastric pain, nausea, vomiting, diarrhea, generalized malaise and marked bone aches in adults including the high risk groups. It’s suggested that the ongoing SARS CoV-2 evolution is continuing to mostly affect the high risk groups of patients, to some of whom we’ve also successfully prescribed nitazoxanide and/or NSAIDs for post-exposure prophylaxis of all household contacts. We also continue to recommend starting the immune-modulatory antiviral Kelleni’s protocol as soon as possible in the course of infection and adjusting it in a personalized manner to be more aggressive from the beginning for the high risk patients, at least until the currently encountered surge of infections subsides.

Osteoporosis is considered a serious public health problem, particularly affecting the postmenopausal period. In 2018, in the Republic of Kazakhstan the total and primary incidence was 10 and 3.7 cases per 100,000 adults, respectively. The objective is to study osteoporosis prevalence and indicate main factors affecting low bone mineral density by screening adult population of Abay region, Kazakhstan. The target group were 641 respondents aged between 18 and 65 years old, Kazakh population living in Abay region since birth. All participants filled out questionnaire and had a bone mineral density measurement by dual energy X-ray absorptiometry (DXA) between July 15, 2023 and February 29, 2024. Logistic regression analysis was conducted to assess the association between low bone mineral density and key demographic characteristics, aforementioned lifestyle factors and nutrition habits. We identified the prevalence of low bone density and osteoporosis at the level of 34.1% with the highest prevalence in the older population group (50+ years) - 48.3%. Regression analysis revealed a number of indicators associated with the likelihood of bone sparing. However, only 4 of these showed significance in the final multivariate model (R2=22.4%). These included age (AOR 1.05), body mass index (AOR 0.92), fracture history (AOR 1.64), consumption of nuts and dried fruits were associated with lower prevalence of osteoporosis (AOR 0.48). Our study was the first in Kazakhstan that investigates the association of key demographic, behavior and anamnestic factors with low mineral density.

The endorsement from Christian circles in facilitating the rise of right-wing populism in Brazil, the United States, as well as the support and alliance of the Polish Catholic Church with the Law and Justice (PiS) government, is widely acknowledged. Embedded within the intricate fabric of multifaceted factors contributing to the surge of right-wing populism, the Culture War assumes a pivotal yet often underestimated role. Manifesting as a profound confrontation, the Culture War signifies an existential clash between contrasting perspectives concerning socio-cultural values grounded in religious scripture. Progressive endeavors strive to deconstruct longstanding norms, advocating for the ascendancy of post-materialistic ideals, while conservative domains portray an unwavering commitment to safeguarding national and religious socio-cultural values as sacrosanct. Both factions employ moral-ethical justifications in their respective pursuits, rendering the landscape of cultural discourse a nuanced tapestry of ideological contention. The influence of Christian doctrine on the conflict surrounding social justice, and the potential convergence between Christian doctrine and the positions of Populist right-wing movements on social justice issues, is underscored. By employing a singular case study focused on Portugal, owing to the nation's enduring relationship with Catholicism spanning from Monarchical times to the Republic and the Fascist Catholic regime, Portugal emerges as indisputably one of the most religious countries in the Western world, akin to Poland. Consequently, in theory, the support of the Portuguese Catholic Church for the nascent Populist right-wing and Christian-oriented party should be evident amidst the Culture War conflict, wherein conservative religious Christian values face existential challenge. However, the backing extended to CHEGA by both the Catholic Church and the Portuguese Episcopal Conference assumes an ambivalent and markedly diminished stance, diverging from the previously robust support observed in established center-right mainstream parties such as the PSD and CDS. Despite this reality and the absence of official support for CHEGA, numerous Christian politicians or activists have expressed endorsement or alignment with the right-wing party, departing from their former affiliations, primarily due to social justice concerns.

Global navigation satellite system (GNSS) array antenna receivers are widely used to suppress wideband interference in navigation countermeasures. However, existing array antenna receivers all adopt digital array structure and digital beamforming technique, and it has limited analog-front-end (AFE) dynamic range. In strong interference scenarios, AFE saturation will occur, which limits the maximum interference suppression ability of the array receiver. Aiming at this issue, this paper proposes a robust wideband interference suppression method for GNSS array antenna receivers based on hybrid beamforming technique. Firstly, a novel fully connected hybrid array receiver structure is proposed; Secondly, the corresponding hybrid beamforming method is proposed at the same time, and it realizes the complete elimination of strong interference by jointly suppression in analog domain and digital domain. After mathematical simulation experiments, it is verified that compared to the digital beamforming-based anti-jamming technique, the proposed method can effectively suppress strong wideband interference, and the maximum interference suppression ability is improved by 36 dB.

Enterococcus faecalis is a growing cause of nosocomial and antibiotic-resistant infections. Treating drug-resistant E. faecalis requires novel approaches. The use of bacteriophages (phages) against multidrug-resistant (MDR) bacteria has recently garnered global attention. Biofilms play a vital role in E. faecalis pathogenesis as they enhance antibiotic resistance. Phages eliminate biofilms by producing lytic enzymes, including depolymerases. In this study, Enterococcus phage vB_Efs8_KEN04 (ФKEN04), isolated from a sewage treatment plant in Nairobi, Kenya, was tested against clinical strains of MDR Enterococcus faecalis. This phage had a broad host range against 100% (26/26) of MDR E. faecalis clinical isolates and cross-species activity against Enterococcus faecium. It was able to withstand acidic and alkaline conditions, from pH 3 to 11, as well as temperatures between -80ᵒC and 37ᵒC. It could inhibit and disrupt the biofilms of MDR E. faecalis. Its linear double-stranded DNA genome of 142,402 bp contains 238 coding sequences with a G+C content and coding gene density of 36.01% and 91.46%, respectively. Genomic analyses showed that ФKEN04 belongs to the genus Kochikohdavirus in the family Herelleviridae. It lacked antimicrobial resistance, virulence, and lysogeny genes, and its stability, broad host range, and cross-species lysis indicate strong potential for the treatment of Enterococcus infections.

In order to address the issue of nutrient deficiency in coconut coir-based nursery substrates, three materials with nutrient supplementation effects, namely pig manure, composted rice husks, and agricultural humic acid, were added in equal volumes to the coir-based substrate. The newly formulated substrates were then tested for their seedling growth effects on cucumber and rice. Results indicate that the substrate formulation consisting of "10% pig manure + 30% peat + 50% coconut coir + 10% vermiculite" was capable of satisfying the growth requirements of both cucumber and rice seedlings, with the highest acceptance among farmers.

The enhancement of early diagnosis of lung cancer is mandatory to improve prognosis. We observed the increase cancer stem cells (CSC) and circulating tumor cells (CTC) in blood of mice on d3 after Lewis lung carcinoma (LLC) cell implantation before disease symptom. Besides we have developed an approach to reprogramming immune cells by inhibiting the MAPK/ERK pathway through MEKi and the PD-1/PD-L1 immune checkpoint signaling pathway. We hypothesized that reprogramming of spleen CD8+ T-cells could also create a population of immune cells with high antitumor activity. We reprogrammed CD8+ T-cells derived from the spleen of C57BL/6 mice (rsCD8+T-cells). The rsCD8+T-cells were able to migrate to lung and were more resistant after the exhaustion in vitro in comparison with naïve sCD8+T-cells. In the orthotopic LLC model, the rsCD8+T-cells therapy increased the amount of proliferating CD8+ and CD4+ T-cells in blood and lung from mice. The amount of CSC decreased in the blood and lung of mice treated with rsCD8+ T-cells. A morphological study revealed a decrease in the number of metastases in lung tissue. The antitumor effects of rsCD8+T-cells are based on the activation of the host immune response by increasing the populations of CD8+ and CD4+ T-cells and apoptosis of CSCs.

Small interfering RNA (siRNA) holds significant therapeutic potential by silencing target genes through RNA interference. Current clinical applications of siRNA have been primarily limited to liver diseases, while achievements in delivery methods are expanding its applications to various organs, including the lungs. Cholesterol-conjugated siRNA emerges as a promising delivery approach due to its low toxicity and high efficiency. This study focuses on developing a cholesterol-conjugated anti-Il6 siRNA and the evaluation of its potency for the potential treatment of inflammatory diseases using the example of acute lung injury (ALI). The biological activities of different Il6-targeted siRNAs containing chemical modifications were evaluated in J774 cells in vitro. The lead cholesterol-conjugated anti-Il6 siRNA after intranasal instillation demonstrated dose-dependent therapeutic effects in a mouse model of ALI induced by lipopolysaccharide (LPS). The treatment significantly reduced Il6 mRNA levels, inflammatory cell infiltration, and the severity of lung inflammation. IL6 silencing by cholesterol-conjugated siRNA proves to be a promising strategy for treating inflammatory diseases, with potential applications beyond the lungs.

This work introduces a neuromorphic sensor based on force-sensing resistors (FSR) and spiking neurons for robotic systems. The proposed sensor integrates the FSR in the schematic of spiking neuron in order to make the sensor to generate spikes with frequency that depends on the applied force. The performance of the proposed sensor is evaluated for the control of a SMA-actuated ro-botic finger by monitoring the force during steady state when the finger pushes on a tweezers. For comparison purposes, we performed similar evaluation when the SNN receives input from a widely used compression load cell (CLC). The results show that the proposed FSR based neuro-morphic sensor has very good sensitivity to low forces and the function between the spiking rate and the applied force is continuous with good variation range. However, when compared to the CLC, the proposed sensor has lower linearity of the response, but it benefits from two orders of magnitude lower power consumption. These aspects imply that the neuromorphic sensor based on FSR are useful for bioinspired control of humanoid robotics representing a low power and low cost alternative the widely used sensors.

In the present work, a predictive modelling and optimization with the adaptive network based fuzzy inference system(ANFIS) modelling of mechanical properties of laser-coated NB/SiC/Ni welds was studied based on Taguchi design by laser cladding. An ANFIS model based on a Sugeno type fuzzy inference system was developed for predicting the hardness properties of SiC/BN/Ni welds by laser cladding with experimental data required for network training and prediction. Based on analysis of variance, three important factors were taken as inputs for the fuzzy logic inferences, while the hardness properties was taken as the output of the ANFIS. The microstructure of welds were analysed using scanning electron microscopy with an energy dispersive X-Ray spectrometer. Highly developed leaf-like dendrites and eutectic crystals were found in some areas of the melting zone for the BN/SiC/Ni weld, which was significantly hardened. The ANFIS model based on Taguchi's design provides a better pattern of response because the predicted and experimental values were highly similar. As a result, a satisfactory result was achieved between the predicted and experimental values of hardness in laser-coated NB/SiC/Ni welds, whereby the success and validity of the method was verified.

Ammonium sulfate has been utilized in agriculture; however, there is a dearth of research on its application in maize cultivation subsequent to the implementation of nitrification inhibitors or coating. This study aims to analyze the impacts of various combinations of ammonium sulfate fertilizers on soil nutrients, plant nutrient uptake, yield, and fertilizer utilization efficiency in maize cultivation to ascertain the optimal and stabilized disposal method for ammonium sulfate. A completely randomized design was employed with five treatments (AU, the control using urea; AS, treatment using ammonium sulfate; ASN, treatment using ammonium sulfate with a nitrification inhibitor; ASG, treatment using oil-coated ammonium sulfate; ASD, treatment using oil-humic acid-coated ammonium sulfate). Results showed that: (1) Compared with AU and AS, ASN, ASG and ASD decreased the leaching rates of TN, NH4+-N and NO3-N to the 10-20 cm soil layer, and more residual N was obtained in 0-10 cm soil layer. The first-order kinetic equation Nt=N0(1-e-kt) can better fit the process of nitrogen accumulation and release, and the N release rate constant is AU>CK>AS>ASH>ASN>ASD; (2) Compared with AU and AS treatments, the plant dry weight, grain dry weight, spike width, spike length, and yields of maize increased by 8.85-11.08%, 12.98-14.15%, 2.95-3.52%, 5.50-5.65%, and 43.21-51.10% under ASG treatment respectively. The impact of effective spike number on maize yield was found to be significant, as demonstrated by the path analysis conducted in this study. Furthermore, the accumulation levels of nitrogen, phosphorus, and potassium within above-ground plants significantly increased under the ASG treatment compared to the AU and AS treatments. The partial productivity of nitrogen, phosphorus, and potassium increased by 1.43-1.51-fold under ASG treatment, while grain nitrogen balance, grain phosphorus balance, and grain potassium balance increased by 1.41-1.58-fold, 1.51-1.95-fold, and 1.15-l.96-fold respectively. The oil-coated ammonium sulfate, therefore, exhibited the optimal slow-release effect of nutrients, thereby achieving superior performance in enhancing maize production and efficiency.

Bicyclic peptides have attracted the interest of pharmaceutical companies because of their remarkable properties putting them on a new path in medicine. Their conformational rigidity that improves proteolytic stability, leads to rapid penetration into tissues via any possible route of administration and elimination, occurring by renal metabolism, is of great importance for people with a history of liver diseases. In addition, each ring can function independently, making them extremely versatile molecules for further optimization. In this paper we compared the potentiometric and spectroscopic properties studied by UV-Vis, MCD, and EPR, of four synthetic analogues of the bi-cyclic peptide c(PKKHP-c(CFWKTC)-PKKH). In particular we correlated the structural and spectral properties of complexes with coordinating abilities toward Cu(II) ions of MCL (Ac-PKKHPc(CFWKTC)PKKH-NH2) that contains the unbinding cycle and N- and C-terminal linear parts, with two histidine residues, one per part; two monocyclic ligands containing one histidine residue, both in the N-terminal position i.e., MCL2 (Ac-PKKHPc(CFWKTC)PKKS-NH2) and in the C-terminal position i.e., MCL3 (Ac-PKKSPc(CFWKTC)PKKH-NH2), respectively, and the linear structure LNL (Ac-PKKHPSFWKTSPKKH-NH2).

In this study, we aim to evaluate how cyclodextrin molecules affect the hydrophilicity and selec-tivity of PVDF membrane. Herein, we prepared PVDF-PVP(1-x) β-CDx membranes, with x rang-ing from 0 to 1 wt%. The membranes were deeply characterized by means of X-ray diffraction (XRD), attenuated total reflectance infrared (ATR-IR), Raman spectroscopies, Thermal gravimet-ric analysis (TGA), Contact angle measurement (CA), scanning electron microscopy (SEM) and atomic force microscopy (AFM). The study unequivocally demonstrates the effectiveness of the addition of β-CD molecules on membranes' structural, morphological, and dielectric properties. Adding 0.25wt% β-CD enhanced hydrophilicity, with CA decreasing from 72.6° to 56° and roughness decreasing from 81 to 29 nm. The PVDF-PVP(1-x) β-CDx membranes were then fully characterized using electrochemical impedance spectroscopy (EIS) to determine their dielectric properties, which clearly showed that the presence of β-CD induced polarization of the mem-brane. The separation of various dyes with different sizes and charges was utilized. These dyes included methylene blue (MB, positive, 0.504 nm), methyl red (MR, neutral, 0.487 nm), rose Bengal (RB, negative, 0.588 nm), and brilliant blue (BB, negative, 0.798 nm). Based on our re-search, we found that the membrane's selectivity is determined by both exclusion factors (such as size and dielectric properties) and inclusion inside the β-CD cage. We found that using alpha-CD instead of beta-CD led to the disappearance of dye inclusion. These findings strongly sug-gest that β-CD molecules can be a viable solution for dye removal from wastewater.

Abstract: Doppler renal resistive index (RRI) has been used for several decades as a potential indi-cator for renal disease and progression. In recent years, RRI has emerged as a useful prognostic indicator for a range of co-morbidities in patients who are acutely unwell and as a potential marker for sub-clinical acute kidney injury (AKI) and post procedural AKI risk. Despite this, the clinical and theoretical determinants of RRI are poorly understood and remain contentious. Method: A narrative review of studies exploring the theoretical, experimental, and clinical evidence for factors affecting RRI. No date restrictions were set. Findings: Both experimental and clinical data confirm that RRI is markedly affected by a range of systemic and renal determinants and is influenced closely by the underlying risk factors and sys-temic vascular changes that lead to progressive renal damage. Discussion: This paper provides an overview of the key haemodynamic determinants of renal re-sistive index and aims to clarify their relative importance. With reference to a simplified theoretical model, evidence from experimental and clinical studies is reviewed. Pathophysiological factors and patient characteristics that influence RRI are explored to provide a better understanding of why RRI values change in the presence of common or complex pathologies. Conclusion: By gaining a better understanding of the complex systemic and renal factors that influ-ence RRI, ultrasound users will be better prepared to understand and interpret changes in RRI across a range of patient presentations.

Mastitis-causing bacteria can establish persistent infections in the mammary gland of commercially important dairy animals despite the presence of strong specific humoral and cellular immune mechanisms. The aim of this study was to encapsulate vitamin D3 by complex coacervation with sulfur-saturated bovine lactoferrin-alginate using microbial transglutaminase-catalyzed crosslinking and investigate the oral administration of encapsulated vitamin D3 in blood serum biomarkers of the immune response in late-lactating dairy goats. Dairy goats (n = 18) in late lactation were randomly assigned to three experimental groups (n = 6), after balancing weight. Dairy goats were orally administered with 0.35 mg vitamin D3/day in the unencapsulated form and 0.35 mg vitamin D3/day in the encapsulated powder form. Another group received the basal diet. The experimental period lasted 6 weeks. The blood serum concentrations of 25-hydroxyvitamin D3 [25-(OH)-D3], lactoferrin, immunoglobulin A (IgA), and interferon-gamma (INF-γ) were measured. The delivery of vitamin D3 to dairy goats resulted in a marked increase of 25-(OH)-D3 concentration in serum while the serum level of lactoferrin also increased. Alternatively, the serum levels of IgA and the immunomodulatory cytokine INF-γ were elevated following supplementation with the encapsulated vitamin D3. Overall, the capsules in the powder form used in this study kept vitamin D3 highly bioavailable.

A Berry geometrical phase is identified in a strongly metastable system containing dynamically responsive clathrate hydrate structures within a crystal-fluid material. High energy degeneracy in the associated chemistry produces local stability and false vacuum conditions that lead to non-extensive and non-additive contributions in the fundamental thermodynamic relation. Application of Ginzburg-Landau theory and the scaling laws reveals a coherence length and a penetration depth for a macro-scale dual superconductor. The coherence length determines non-extensive volume changes whilst its inverse gives the Higgs mass. The penetration depth determines the extent of QCD vacuum suppression whilst its inverse gives the vector boson mass together with indirect manifestation as non-additive hyperbolic curvature. Simultaneous emergence of the Ginzburg-Landau superconducting phase transition is consistent with gauge-invariant coupling of the scalar field to the Yang-Mills action in QCD. The discovery of an energy gap in the gradient energy term of the system Lagrangian is associated with a critical correlation length revealed in the transition from a gapped to a gapless superconducting state. Together with the emergence and absorption of the Higgs-like scalar field, a mechanism for describing a renormalized QCD mass gap arises.

Though nowadays germanium do not reach the range of popularity than other metals, i.e. rare earth elements, its utility in target industries makes of it also a strategic metal. Though germanium can be find in a series of raw materials, the principal source for its recovery is from secondary wastes of the zinc industry, and also, the recycle of germanium-bearing waste materials is becoming of interest. In this recovery, Hydrometallurgy is performing a key role to the successful achievement of this goal. The present work reviews the most recent applications (2023 and 2024 years) of hydrometallurgical operations on the recovery of germanium from different solid and liquid sources.

As the world attempts to decarbonise the food industry and limit greenhouse gas (GHG) emissions, plant-based meat analogues (PBMAs) have emerged as a sustainable alternative to traditional meat. This study implemented a life cycle assessment (LCA) to rigorously compare the environmental impacts of a beef burger (BB), produced with British beef, against a meat analogue (MA) equivalent with a publicly available recipe. For the LCA, a cradle-to-fork system boundary was utilised, alongside a functional unit of a single 100 g burger patty. Results from the LCA revealed that the BB patty had more than double the total environmental impact than the MA equivalent, as well as possessing a global warming impact that was 62% higher. A simple extrapolation illustrated that if the UK population switched from beef to meat analogue patties, 3 million tonnes of CO2e could be saved annually, corresponding to 0.74% of the country’s yearly territorial GHG emissions. Scenario analyses displayed how the environmental impact of the MA patty remained stable regardless of changes in exportation, ingredient origin or soy protein sourcing. Moreover, sensitivity analysis conducted with an alternative characterisation method corroborated initial findings, whilst uncertainty analysis ensured that nearly all conclusions generated from the original comparison were robust. Future studies should conduct peer-reviewed LCAs on PBMA patties with commercial recipes based on other plant-based proteins, as well as fully understanding any potential health implications of long-term PBMA consumption.

Museums are called to respond to contemporary challenges and contribute to the formation of more progressive societies. One of the major challenges of our time is climate change and museums could construct cocreated narratives around climate and implement targeted actions for the audiences through their sensorial and affective experiences. More specifically, Geology and Palaeontology museums are repositories of knowledge on geoheritage and geoconservation, recognized for their scientific, pedagogical, cultural and recreational values. The educational potential of geological and paleontological exhibits could be used in informal education activities regarding the climate emergency. Taking the above into consideration, this study focuses on both the creation and evaluation of an educational program for the Natural History Museum of Arsakeio Campus at Psychicko.

Background: The modified Duke index derived from coronary computed tomography angiography (CCTA) was designed to predict cardiovascular outcomes based on the severity of coronary ste-nosis. However, it does not take into consideration the presence or severity of peri-coronary in-flammation. The peri-coronary fat attenuation index (FAI) is a novel imaging marker determined by CCTA which reflects the degree of inflammation in the coronary tree in patients with coronary artery disease. Purpose: To assess the association between the modified Duke index assessed by CCTA, cardiovascular risk factors and peri-coronary inflammation in the coronary arteries of pa-tients with coronary artery disease. Methods: One hundred seventy-two patients who underwent CCTA for typical angina were assigned into two groups based on the modified Duke index: group 1 – patients with low index ≤ 3 (n=107) and group 2 – patients with high index > 3 (n=65). Demo-graphic, clinical and CCTA data were collected for all patients, and FAI analysis of coronary in-flammation was performed. Results: Patients with increased values of the modified Duke index were significantly older compared to those with a low index (61.83 ± 9.89 vs. 64.78 ± 8.9; p = 0.002). No differences were found between the two groups in terms of gender distribution, hypertension, hypercholesterolemia or smoking history (all p > 0.5). The FAI score was significantly higher in patients from group 2, who presented a significantly higher score of inflammation compared to the patients in group 1, especially at the level of the right coronary artery (FAI score 20.85 ± 15.80 vs. 14.61 ± 16.66; p = 0.01 for the right coronary artery, 13.85 ± 8.04 vs. 10.91 ± 6.5; p = 0.01 for the circumflex artery, and 13.26 ±10.18 vs. 11.37 ± 8.84; p = 0.2 for the left anterior descending artery). CaRi-Heart® analysis identified a significantly higher risk of future events among patients with a high modified Duke index (34.84 % ± 25.86 % versus 16.87 % ± 15.80 %; p

The aim was to evaluate the effect of different whitening toothpastes on the enamel surface roughness and color variation. Twenty-four molars were sectioned and divided into eight groups (n = 3), considering the two factors under study: toothpaste type (Colgate® Total Original, Oral B® 3D White Luxe Perfection, Curaprox® Black is White, and Signal® White Now) and brushing protocol (short-term and a long-term). Surface roughness was examined by atomic force microscopy (AFM), and color change (ΔE) was measured using the CIE L*a*b* system. Data were statistically analyzed using comparative parametric tests at a 5% significance level. In the short-term protocol, only the Signal® White Now toothpaste increased surface roughness (p = 0.038) compared to the Colgate® Total Original group. No significant differences (p > 0.05) were observed in surface roughness in the long-term protocol. Regarding color variation, no statistically significant differences (p > 0.05) were observed in either protocol. Overall, the whitening toothpastes did not affect enamel surface roughness or color, except for Signal® White Now causing increased roughness in the short-term protocol. However, all toothpastes induced a visual change in color.

In this study, the microbial strain was isolated from the humus soil to ferment Sophora flavescens and Eleutherococcus sessiliflorus extracts. The isolated microbial was identified as Bacillus genus by 16S rRNA sequence analysis. The fermented plant extracts exhibited the antifungal effects against four types of the plant pathogens such as P. carotorum, B. cinerea, C. fructicola Sau-3, and C. gloeosporioides according to incubation time. Especially, the fermented plant extracts showed the most active activities for Colletotrichum genus to inhibit mycelium growth. Metabolite changes in fermented S. flavescens and E. sessiliflorus extracts were confirmed through LC-Q-TOF/MS. Flavonoid and peptide derivatives were improved in fermented S. flavescens and E. sessiliflorus extracts compared to their unfermented one, respectively. This study suggested that the isolated Bacillus microbial fermentation could be a valuable tool in improving the bioactivity of S. flavescens and E. sessiliflorus extracts to have potential with more environmentally-friendly antifungal agents.

Stroke represents one of the neurological diseases most responsible for death and permanent disability in the world. Different factors, such as thrombus, emboli and atherosclerosis, take part in the intricate pathophysiology of stroke. Comprehending the molecular processes involved in this mechanism is crucial to developing new, specific and efficient treatments. Some common mechanisms are excitotoxicity and calcium overload, oxidative stress, and neuroinflammation. Furthermore, non-coding RNAs (ncRNAs) are critical in pathophysiology and recovery after cerebral ischaemia. ncRNAs, particularly microRNAs, and the long non-coding RNAs (lncRNAs) are essential for angiogenesis and neuroprotection, and they have been suggested to be therapeutic, diagnostic and prognostic tools in cerebrovascular diseases, including stroke. This review summarizes the intricate molecular mechanisms underlying ischemic and hemorrhagic stroke and delves into the function of miRNAs in the development of brain damage. Furthermore, we will analyze new perspectives on treatment based on molecular mechanisms in addition to traditional stroke therapies.

In recent years, the scientific and technological developments led to an explosion of available videos on the web, increasing the necessity of fast and effective video analysis and summarization. Video summarization methods aim to generate a synopsis by selecting the most informative parts of the video content. The user’s personal preferences, often involved in the expected results, should be taken into account in the video summaries. In this paper, we provide the first comprehensive survey on personalized video summarization relevant to the techniques and datasets used. In this context, we classify and review personalized video summary techniques based on the type of personalized summary, on criteria, on the video domain, on the source of information, on the time of summarization, and on the machine learning technique. Depending on the type of methodology used by the personalized video summarization techniques for the summary production process, we classify the techniques into five major categories, which are feature-based video summarization, key frame selection, shot selection-based approach, video summarization using trajectory analysis, and personalized video summarization using clustering. We also compare personalized video summarization methods and present 37 datasets used to evaluate personalized video summarization methods. Finally, we analyze opportunities and challenges in the field and suggest innovative research lines.

Climate change is increasing air temperatures and altering the precipitation and hydrological re-gime on a global scale. Challenges arise when assessing the impacts of climate change on the local scale for water resources management proposes, especially for low mountain headwater catch-ments that not only serve as important water towers for local communities, but also have distinct hydrological characteristics. Until now, no low flow or hydrological drought studies have been carried out on the Lauter River. This study is unique in that it compares the Lauter River, a transboundary Rhine tributary with a nearby station on the River Rhine just below its confluence at the French-German border. The Lauter catchment is a mostly natural, forested catchment, however, its water course has been influenced by past and present cultural activities. Climate change disturbances cascade through the hydrologic regime right down to the local scale. As we are expecting more low flow events, the decrease in water availability could cause conflicts be-tween different water user groups in the Lauter catchment. However, the choice of different methods for identifying low flow periods may cause confusion for local water resources manag-ers. Using flow rate time series of the Lauter River between 1956 and 2022 we compare for the first time three low flow identification methods: the variable threshold method (VT), the fixed threshold method (FT), and the Standardized Streamflow Index (SSI). Similar analyses are applied and compared to the adjacent Maxau station on the Rhine River for the same time period. This study aims at 1) interpreting the differences amongst the various low flow identification methods and 2) revealing the differences in low flow characteristics of the Lauter catchment compared to the Rhine River. It appears that the FT reacts faster to direct climate or anthropogenic impacts whereas VT is more sensitive to indirect factors such as decreasing subsurface flow which is typical for small headwater catchments, such as the Lauter where flow dynamics react faster to flow disturbances. Abnormally low flow during the early Spring in tributaries such as the Lauter can help predict low flow conditions of the Rhine River during the following half year and espe-cially for the summer. The results could facilitate Early Warning of hydrological droughts and drought management for water users in the Lauter catchment and further downstream along some of the Rhine.

The rehabilitation of abandoned mining sites is an increasingly pressing issue in the context of sustainable development. Recent research has emphasized the need for a holistic approach to the abandoned mining sites and their environmental rehabilitation. Based on field analysis, environmental assessments, satellite imagery processing and geographic information operations, this paper pushes forward the existing knowledge by doing a comprehensive assessment of abandoned mining sites in the Romanian Carpathians and by proposing innovative and sustainable rehabilitation solutions. Our findings highlight that abandoned mining sites and their surrounding territories in the Romanian mountains have significant ecological imbalances and complex socio-economic issues. The findings also suggest that by adopting innovative, integrated, and sustainability-oriented approaches, territories affected by mining can be transformed into valuable and sustainable spaces to meet human needs. We conclude by presenting the importance of innovation in ecological reconstruction and spatial-functional reintegration of mining sites in mountain areas as a useful tool in making fair decisions, both in the context of implementing appropriate development policies as well as for resilience and environmental sustainability of mining-affected mountain areas.

The fitting and modeling of skewed, complex, symmetric, and asymmetric datasets is an exciting research topic in many fields of applied sciences, notably lifetime, medical, and financial sciences. The Heavy tailed Nadarajah Haghighi model is introduced by compounding the heavy tailed family and Nadarajah Haghighi distribution in this paper. The so obtained model has three parameters accounting for the scale and shape of the distribution. The proposed distribution's fundamental characteristics such as probability density, cumulative distribution, hazard rate, and survival functions are provided, and several key statistical properties are established, and several entropy information measures are proposed. The estimation of model parameter is performed via the ML procedure. Further, different simulation experiments are conducted to demonstrate the performance of proposed estimator’s using some measure, like the average estimate, the average bias, and associated mean square error. Finally, we are applied our proposed model to analyze three different real datasets. In our illustration, we are compared the practicality of the recommended model with several well-known competing models.

The grain filling rate (GFR) plays a crucial role in determining grain yield. However, the regulatory and molecular mechanism of grain filling rate (GFR) in foxtail millet remains unclear. In this study, we found the GFR of 'Changnong No.47' (CN47) was significantly higher at 14 days after flowering (DAF) and 21 DAF in comparison to 'Changsheng 13' (CS13). Furthermore, CN47 also exhibited higher thousand grain weight and yield than CS13. Therefore, we conducted transcriptomics and metabolomics to analyze the biological processes and functional genes associated with GFR during two stages of grain filling in both cultivars. A total of 765 differentially expressed genes (DEGs) and 246 differentially accumulated metabolites (DAMs) were identified at the 14 DAF stage, while at the 21 DAF stage, a total of 908 DEGs and 268 DAMs were identified. The integrated analysis of co-mapped DAMs and DEGs revealed enriched pathways, including flavonoid biosynthesis, plant hormone signal transduction, tyrosine metabolism, ATP-binding cassette (ABC) transporters, beta-alanine metabolism, as well as stilbenoid, diarylheptanoid and gingerol biosynthesis. In order to elucidate their potential functions in the context of GFR, we developed a gene-metabolite regulatory network for these metabolic pathways. Notably we found some genes associated with ABC transporters and plant hormone signal transduction pathway were implicated in auxin transport and signal transduction, highlighting the crucial role of auxin during grain filling. The results provide initial insights into the regulatory and molecular mechanisms underlying GFR in foxtail millet, as well as offer valuable genetic resources for further elucidation of GFR in future studies. The findings have established a theoretical basis for improving the efficiency of yield breeding in foxtail millet.

This paper investigates the impact of debt financing on dividend payments when they face the agency costs of free cash flow. Focusing on a sample of 120 firms listed on the Saudi Stock Exchange during the period 2011-2021. The study found a negative association between agency cost of free cash flow and dividend payment. More importantly, our research highlights the significant role of long-term debt in making more prudent use of free cash flow. The obligation to meet interest and principal payments acts as an incentive for them to steer clear of unprofitable expenses and risky investments. Concurrently, long-term debt imposes restrictive clauses in debt contracts, such as minimum dividend distribution requirements, which further encourage higher dividend payments. Since interest and debt repayments are fixed obligations, using free cash flow for dividend disbursement is considered a more profitable and beneficial approach for shareholders in the context of Saudi Arabia.

Gender has been a rarely addressed aspect in digital game-based learning (DGBL). Likewise, mixed results have been presented regarding the effects according to gender and the conditions that generate these effects. The present work studies the effects of a drill-and-practice mathe-matical game on primary students. The study focused on an analysis by gender, measuring learning performance, and motivation in the practice activity. Also, two instructional mechanics were considered regarding the question answering, a multiple-try (MTF) and a single-try (STF) condition, to search for possible differences. A total of 81 students from 4 courses and 2 schools participated in the experiment. The study's main findings were that: (a) the girls outperformed boys in terms of students' learning gains, (b) girls presented lower levels of competence and autonomy than boys, (c) in the MTF, girls presented lower levels of autonomy but no differences in competence contrasted to boys, (d) in the STF, girls presented lower levels of competence but no differences in autonomy against boys, and (e) no differences existed in interest, effort and value among gender overall o per instructional condition. This study enhances the knowledge of gender differences under diverse instructional settings, in particular providing insights into possible differences by gender when varying the number of attempts provided to students.

Members of the SOX (SRY-related HMG-box) family of transcription factors are crucial for embryonic development and cell fate determination. This review investigates the role of SOX3 in cancer, as aberrations in SOX3 expression have been implicated in several cancers, including osteosarcoma, breast, esophageal, endometrial, ovarian, gastric, hepatocellular carcinomas, glioblastoma, and leukemia. These dysregulations modulate key cancer outcomes such as apoptosis, epithelial-mesenchymal transition (EMT), invasion, migration, cell cycle, and proliferation, contributing to cancer development. SOX3 exhibits varied expression patterns correlated with clinicopathological parameters in diverse tumor types. This review aims to elucidate the nuanced role of SOX3 in tumorigenesis, correlating its expression with clinical and pathological characteristics in cancer patients and cellular models. By providing a comprehensive exploration of SOX3 involvement in cancer, this review underscores the multifaceted role of SOX3 across distinct tumor types. The complexity uncovered in SOX3 function emphasizes the need for further research to unravel its full potential in cancer therapeutics.

We have now identified two thermodynamically distinct types (A and B) of energetic processes naturally occurring on Earth. Type A energy processes such as the classical heat engines, apparently well follow the second law of thermodynamics; Type B energy processes, such as the newly discovered thermotrophic function that isothermally utilizes environmental heat energy to do useful work in driving ATP synthesis, which follows the first law of thermodynamics (conservation of mass and energy) but does not have to be constrained by the second law, owing to their special asymmetric functions. Several Type-B energy processes such as asymmetric-function-gated isothermal electricity and epicatalysis have been created through human efforts. The innovative efforts on Type-B processes to enable isothermally utilizing endless environmental heat energy could help to liberate all peoples from their dependence on fossil fuel energy, thus helping to reduce greenhouse gas CO2 emissions and control climate change towards a sustainable future for the humanity on Earth.

The theories of Evolution and Big Bang have brought a major impact upon the scientific and societal perception upon the origins, abilities and roles of mankind on Earth. It is conclusively evident that Mother Nature and the physical realm is autonomous and all phenomena in the world occur without an imposition against the “free will” of such events and patterns. Nevertheless, this extent of freedom does not imply that life on Earth represents an accident and has no purpose. By careful analysis of ancient religious texts, it can be suggested even otherwise, that it is especially free will that is offered as a gift from outside of the physical dimensions of existence, with the purpose of a continuous edification and improvement of the overall life conditions and of the human perception. It may be that the multi-generational focus on improvement and progress have been misattributed as a long-term evolution of species, that humans came from animal ancestors and that there is a blurred line associating humans with animals. Furthermore, it may be that scientists based their suggestions that no outside Creator would have brought the Earth into existence on physical perspectives, when the extra-dimensional process of Creation implies that all elements of the physical existence undergo a process of Creation from the outside, where time, space and physical matter do not exist, in spite of such elements possibly reflecting unseen elements of the meta-physical world. Finally, there is the following example that deserves attention within the scientific community; just because all living cells - human, animal and plant - contain DNA chromosomes, ribosomes, mitochondria and a plasma membrane, it does not indicate that humans are animals, just as this does not indicate that plants are animals. In Science, there is a golden statement, that correlation does not imply causation. This example is in complete agreement with the verses of the Book of Genesis in the Holy Scriptures regarding the origins of life; namely, that animals could have been created by an Author of all life on Earth so that man would experience companionship. An improved scientific perception of the timeline of life on Earth may be reached via an approach that combines molecular biology with quantum physics, given that the three layers of Science - Biology, Chemistry and Physics - together with their foundational layer of Mathematics, are in fact situated in a relationship of complete harmony.

Background: Fine-needle aspiration cytology (FNAC) is widely used to diagnose and monitor thyroid nodules. The Bethesda System for Reporting Thyroid Cytopathology (TBSRTC) is the standard for interpreting FNAC specimens. The risk of malignancy in Bethesda III nodules also known as Atypia of Undetermined Significance (AUS) varies significantly throughout several studies published worldwide. This retrospective study examines the risk of cancer in thyroid FNAC categorized as Bethesda III, as identified in the final histopathology of thyroidectomy specimens at a single endocrine surgery center. Methods: This retrospective cohort analysis included 1038 consecutive patients who underwent elective thyroid surgery with complete follow up data between January 2020 and March 2024. Preoperative data on clinical and pathological characteristics have been collected. The final histopathology report from the thyroidectomy specimen was compared to the results of the preoperative FNAC on nodules that were judged to be Bethesda category III. Statistical methods were performed using SPSS version 29. Results: A total of 670 ultrasound-guided FNACs (64.5%) performed during the study period were included in the final analysis. The study population was predominantly female, represented by 79.6% of patients with a mean age of 42.5 (SD 12.1), while 20.4% were male and significantly older with mean age 45.13 years (p = 0.02). The FNAC inadequacy rate was 5.1%, which was associated with a high risk of malignancy (6 out of 34, 17.6%). Out of the total sample size of 170 patients classified as group III, 57 were found to have malignancies in final surgical histopathology, representing 33.5% of the cases within this category. The secondary gender-related outcome analysis showed that female patients classified under the Bethesda II category had a significantly higher risk of malignancy, with a rate of 21.2%, compared to males who had a malignancy rate of 3.4% in the same Bethesda category (p = 0.001, chi square test). However, female had more better prognostic non-invasive tumors than male (p = 0.02, chi square test). Conclusion: The study's results indicate that Bethesda categories II and III are associated with a higher risk of malignancy in comparison to the reports of the first and third editions of the TBSRTC, particularly for female patients classified under category II.

The corrosion inhibition behavior of cetyl pyridinium chloride (CPC) on mild steel in 0.5 M H2SO4 solution was examined using measurement techniques such as Fourier Transform Infra-red Spectroscopy (FTIR), Field Emission Scanning Electron Microscopy (FESEM), and Atomic Force Microscopy (AFM). The studies were carried out within a 25°C temperature range. The surface morphology of the corroded steel samples was investigated using FESEM and AFM. The results show that cetyl pyridinium chloride (CPC), a mild steel corrosion inhibitor, effectively prevents corrosion in 0.5 M H2SO4 and, when present, increases corrosion resistance. CPC has a stronger inhibitory effect on mild steel. The FESEM and AFM images clearly show how surface morphology changes when additives are present. The weight loss results were confirmed by en-ergy dispersive X-ray (EDX) spectroscopy analysis, and a value of 98.54% was obtained from potentiodynamic polarization studies at 0.0077M CPC. CPC acts as an important corrosion in-hibitor.

The persistence of Salmonella and Campylobacter in chicken meat is a considerable public health risk and a future challenge. This study aimed to determine the prevalence of Salmonella and Campyl-obacter in poultry processing lines where different chlorination techniques were used. The sam-ples were collected from four types of processing plants considering the chlorine concentration used in the chill tank, which ranged from 2 ppm to 50 ppm. Salmonella and Campylobacter were isolated from carcass washings, neck skin, and, caecal samples. Subsequently, an antimicrobial susceptibility test was performed for the isolates. The results revealed the overall prevalence of Salmonella and Campylobacter was 78.25%, and 64% respectively. Positive percentages of Salmonella and Campylobacter were high in carcasses compared to neck skin and caeca. Carcass Campylobacter counts at higher chlorine concentrations ranging from 20 – 50 ppm was significantly low (p

Recent technological advancements in conservation genetics and genomics have resulted in diverse tools for aiding conservation of species. The precision and resolution of high throughput sequencing technologies provide valuable insights to aid conservation decisions, but these technologies are often financially unfeasible or unavailable in resource constrained countries. Inter-Simple Sequence Repeat (ISSR) markers, when combined with sensitive automated detection systems, provide a simple, cheap means to investigate genetic diversity and discriminate closely related species. Here we apply this technology to assess genetic diversity and taxonomic delimitation in the Encephalartos eugene-maraisii species complex, a highly threatened, taxonomically dubious group of cycads in South Africa. Silica dried cycad leaflets were extracted using the Oktopure robot employing Sbeadex chemistry and amplified with fluorescently tagged ISSR primers. Band presence was scored with an ABI 3130 genetic sequencer under three different fluorescence cut-off values. Phenetic analyses were performed in NTSYS software while Bayesian analysis was performed in STRUCTURE, and haplotype network analysis, AMOVA and Tajima’s D statistic was computed with PopART. Our analyses support taxonomic singularity of E. dyerianus, E. dolomiticus and E. eugene-maraisii. Relationships between E. nubimontanus and E. cupidus remain uncertain. E. middelburgensis samples showed no clustering but had poor amplification success. This study demonstrated the suitability of automated ISSR fingerprinting as a method for plant conservation studies, especially in resource-constrained countries.

The aim of this work was to describe the physiological limitations induced under drought conditions in young sweet orange trees, including the crop capability to recuperate its physiological status once re-watering, and after a water withholding. The trial was conducted during two consecutive months (July and August) in two-years old sweet orange trees. Three irrigation treatments were arranged: A full irrigation treatment; (FI); a low-frequency deficit-irrigation treatment (LFDI); and a sustained-deficit irrigation (SDI) treatment. The obtained results showed that for Stem values below -1.5 MPa, significant decreases in gas exchange rates, evidencing diffusive limitations to drought stress. Additionally, there was evidence of increased osmolyte synthesis, compatible as a defensive response to prevent oxidative damage. Likewise, the isohydric behaviour observed also resulted in significant decreases in gs even for moderate stress situations. In addition, it was observed that in the LFDI treatment, the stress levels reached caused a significant increase in the levels of Pro and MDA, which were not equal to those detected in FI during the recovery periods, which leads us to assume that potential values below -1.8 MPa would be causing significant oxidative damage with no capacity for subsequent recovery, and probably affecting the final yield.

The field of domain adaptation, particularly in cross-domain sentiment classification, leverages labeled data from a source domain alongside unlabeled or sparsely labeled data from a target domain. The objective is to enhance performance in the target domain by mitigating the discrepancies in data distributions. Traditional methods in this area have focused on identifying and differentiating between pivotal sentiment words (shared across domains) and domain-specific sentiment words. In our work, we introduce a novel framework called Sentiment Domain Adapter (SDA), which incorporates a Category Attention Network (CAN) alongside a Convolutional Neural Network (CNN). This approach treats pivotal and domain-specific words as part of a collective category of attributes, which SDA learns to discern automatically, thereby enhancing domain adaptation. Additionally, SDA seeks to provide interpretative insights by learning these category attributes. Our model's optimization targets three main goals: (1) supervised classification accuracy, (2) minimizing the disparity in category feature distribution, and (3) maintaining domain invariance. Evaluations on three benchmark datasets for sentiment analysis affirm that SDA surpasses several established baselines.

In this paper, the entire downhole fluid sucker rod pump system is replaced with a viscoelastic vibration model, namely a third-order differential equation with an inhomogeneous forcing term. Both Kelvin and Maxwell viscoelastic models can be implemented along with the dynamic behaviors of a mass point attached to the viscoelastic model. By employing the time-dependent polished rod force measured with a dynamometer as the input to the viscoelastic dynamic model, we have obtained the displacement responses, which match closely with the experimental measurements in actual operations, through an iterative process. The key discovery of this work is the feasibility of the so-called inverse optimization procedure which can be utilized to identify the equivalent scaling factor and viscoelastic system parameters. The proposed Newton-Raphson iterative method with some terms in the Jacobian matrix expressed with averaged rates of changes based on perturbations of up to two independent parameters provides a feasible tool for optimization issues related to complex engineering problems with mere information of input and output data from either experiments or comprehensive simulations. The same inverse optimization procedure is also implemented to model the entire fluid delivery system of a very viscous non-Newtonian polymer modeled as a first-order ordinary differential system similar to the transient entrance developing flow. The convergent parameter reproduces transient solutions which match very well with those from full-fledged computational fluid dynamics models with the required inlet volume flow rate and the outlet pressure conditions.

In view of the problem that the output thrust of solenoid actuator is affected by various factors and is difficult to calculate in actual working conditions, this paper proposes a semi-analytical model constructed by magnetic field subdomain method with internal and external boundary conditions in cylindrical coordinate system for calculation, and the general solution equations of magnetic vector potential for each subdomain are derived and solved by MATLAB. Taking a push-pull electromagnet as an example, the finite element simulation and experimental comparative analysis are carried out. The correctness and applicable conditions of the subdomain method are illustrated by comparing the gradient plot of magnetic vector potential, inductance curve and electromagnetic force. By calculating the output thrust after considering the core gravity, spring force and electromagnetic force, it is shown that this method has the advantage of computational flexibility compared with the finite element method, and it is easier to write special algorithms according to various working conditions to calculate the important parameters in engineering applications.

This work reports 60 marine alien molluscs, collected by two Belgian citizen scientists, from nine countries across the Mediterranean Sea and the Sea of Marmara. Some of their published observations concerning the collecting dates are compared with the year of first publication for these alien molluscs reported in the literature, which enabled to backdate some of these introductions. This underlines the importance of collaboration between volunteers and institutional scientists in tracing variations and changes in the environment and biodiversity.

In this study, we successfully synthesized a novel branched polyamide 6 with ε-caprolactam(CPL) and α-Amino-ε-caprolactam(ACL) through hydrolytic ring-open co-polymerization. The NMR characterization and rheological test result proved the existence of branched chain structure additionally. The branched chain structure caused a remarkable enhancement in the rheological properties. The met index(MFR),zero shear rate viscosity and storage modulus at low frequency region had a remarkable increase.The shear thinning phenomenon became more obvious. The thermal properties test determined by differential scanning calorimetry(DSC) showed that the melting point and crystallinity of co-polymers decreased with the increase of ACL addition.However, the crystal structure of the samples remained unchanged. The appropriate addition amount of ACL can improve the tensile mechanical properties of the co-polymers. When the amount of ACL was 1%, the tensile strength and fracture elongation rate of the co-polymers had the most significant increase.

The sperm heads of frozen/thawed horse spermatozoa were injected into ovulated mouse oocytes where they decondensed and formed paternal pronuclei in which the DNA damage has been evaluated. The motile spermatozoa exhibit none or minor level of DNA damage and the xenogenic zygotes cleave to the two-cell embryonic stage with regular nuclei and no micronuclei (MNs). On the other hand, the immotile spermatozoa exhibit typically high levels of DNA damage and blastomeres in two-cell stage embryos contain multiple MNs. Moreover, extremely high sperm DNA damage prevents even the cleavage to the two-cell stage.Keywords: keyword 1; keyword 2; keyword 3 (List three to ten pertinent keywords specific to the article yet reasonably common within the subject discipline.)

In this paper, we propose a system of nonlinear mixed variational inequality problems, which consists of two elliptic mixed variational inequality problems on Banach spaces. Under suitable assumptions, using the Kakutani-Ky Fan fixed point theorem and Minty techniques, we prove the solution set to the system of nonlinear mixed variational inequality problem is nonempty, weakly compact and unique. Additionally, we suggest a stability result for the system of nonlinear mixed variational inequality problem by perturbing the duality mappings. Furthermore, we present an optimal control problem governed by the system of nonlinear mixed variational inequality problems and establish a solvability result.

Tunnel-interchange connecting sections pose significant safety challenges on mountainous expressways due to their high incidence of accidents. Improving road safety necessitates a comprehensive understanding of driver behavior in such areas. This study explores the influences of road characteristics, signage information volume, and traffic conditions on drivers' car-following and lane-changing behavior in tunnel-interchange diverging areas. Utilizing driving data from 25 subjects of 72 simulated road models, driving performance is assessed using Friedman rank test and multivariate variance analysis. The results highlight the significant influence of both connection distance and signage information load on driving behavior. In tunnel-interchange scenarios, the reduction of velocity increased by 62.61%, and speed variability surged by 61.11%, indicating potential adverse effects on driving stability due to the environmental transitions. Decreased connection distances are associated with reduced lane-changing durations, larger steering angles, and increased failure rates. Furthermore, every two units increase in signage information leads to a 13.16% rise in maximum deceleration and a 5% increase in time headway. Notably, the signage information volume shows a significant interaction with connection distance (F=1.60, P=0.045) for most car-following indicators. Hence, the study recommends a maximum connection distance of 700 m and signage information not exceeding nine units for optimal safety and stability.

The substitution of chemical fertilizers by organic manure plays a critical role in sustainable crop production. Nevertheless, organic amendments promote the global warming potential (GWP) in rice paddies due to increased methane (CH4) emissions. Increasing evidence shows that lime application can reduce CH4 emissions from acidic paddy soils, while it is still not clear whether liming can reduce the GWP in rice fields under organic manure substitution. A two-year field experiment was conducted to investigate the impacts of pig manure substitution and lime application on grain yield, CH4 and nitrous oxide (N2O) emissions in a subtropical double-cropped rice field in China. The experiment consisted of three treatments: chemical fertilization (CF, 100% N from urea), 50% of chemical N substituted by pig manure (1/2N + M), and the 1/2N + M treatment plus lime amendment (1/2N + M + L). On average, 1/2N + M reduced rice yield by 5.65% compared to CF, while lime application had no effect on rice yield. Mean cumulative CH4 emissions were 218.8% higher in 1/2N + M than in CF, whereas 1/2N + M + L reduced CH4 emissions by 36.6% compared to 1/2N + M. Neither pig manure substitution nor lime application affected N2O emissions. Consequently, 1/2N + M increased the GWP and greenhouse gas intensity (GHGI) by 214.6% and 228.3%, respectively, compared to CF. In contrast, 1/2N + M + L reduced the GWP and GHGI by 36.4% and 36.5% compared to 1/2N + M. Lime application can mitigate CH4 emissions and GWP induced by pig manure amendment in double-cropped rice fields.

The article studies and analyzes a hybrid power source system, lithium battery, and fuel cell assisted by flexible photovoltaic panels for hybrid electric vehicles (HEVs). The new configuration operates based on optimizing the performance of the dual power source to maximize the available energy and operating time. The operational mode simulates specific driving conditions in urban, peripheral, and intercity routes under variable driving patterns and traffic conditions. The simulation results show that the new configuration increases the hybrid electric vehicle performance, providing higher reliability despite the more complex design. The proposed system reduces the external power supply dependence and avoids unexpected sudden stops due to energy exhaustion. The new configuration also extends the vehicle driving range depending on driving mode and route conditions. The vehicle driving range extension may reach up to 276.3 km. The hybridization of fuel cells with lithium battery and PV panel assistance enhances battery management, reducing battery servicing and increasing lifespan. The proposed topology is cheaper than a single fuel cell power system by 17.2%, reducing the total cost related to the single battery power system if we consider the battery recharge for its entire lifespan. The cost saving is 2.6% for the American market and 14.8% for the European one.

The reduction in rheological parameters and dissolution rate of precursors in geopolymer coatings during early hydration significantly contributes to sagging. This study aims to improve the sag resistance of these coatings by incorporating diatomite filler. Rheological testing was conducted to assess the impact of diatomite and its concentration on yield stress, plastic viscosity, and thixotropy of the geopolymer coatings. The results indicated that diatomite's large specific surface area and high reactivity have a significant influence on the rheological parameters and early dissolution rate of precursors. With a diatomite concentration of 1.1%, the coating exhibited a yield stress of 2.749 Pa and a plastic viscosity of 0.921 Pa·s, maintaining stability, homogeneity, and no sagging at a thickness of 600 μm. Furthermore, the highly active SiO2 in diatomite participates in the secondary hydration reaction of the geopolymer materials, leading to the formation of substantial C-(A)-S-H gel. This gel enhances internal interconnectivity within the coating, thereby improving its rheological and mechanical properties.