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.

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.

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.

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

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

in this research, new setting is introduced for new 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 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, 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 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, 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, 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, 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.

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

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.

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.

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

In this research, 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.

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.

This paper proposes a simulation technique for investigating the battery thermal management system based direct refrigerant cooling (BTMS-DRC). It employs finite element method for a combined-conduction-convection heat transfer to predict the module temperature and to prove the temperature uniformity. The refrigerant side cooling is based on the two-phase flow evaporation which is represented by the convection heat transfer (flow evaporation) under a certain refrigerant saturation temperature. The battery heat generation is modeled as the constant heat flux. The main module is modeled as the conduction heat transfer. The real BTMS-DRC is constructed for experimentation with the test bench which is based on the dual-evaporators vapour compression refrigeration system. The simulated result is validated with the experimental results to ensure the correction of the modelling. The simulation also investigates the impact of the heat generation, convection heat transfer coefficient, refrigerant saturation temperature, and thermal conductivity on the module temperature and temperature uniformity. It is found that the simulated results agree well with the experimental results. The errors are around 2.9 - 7.2% throughout the specified working conditions. Overall, the proposed technique can be used as a design tool for further developing the BTMS-DRC.

In this study, we conducted a comprehensive analysis of the spatial distribution of soil organic carbon stock (SOC stock) and the associated uncertainties in two soil layers (0–10 cm and 0–30 cm; SOC stock 10 and SOC stock 30 respectively), in Valchiavenna, an alpine valley located in northern Italy . We employed the digital soil mapping (DSM) approach within different machine learning models, including multivariate adaptive regression splines (MARS), random forest (RF), support vector regression (SVR), and elastic net (ENET). Our dataset comprised soil data from 110 profiles, with SOC stock calculations for all sampling points based on bulk density (BD), whether measured or estimated, considering the presence of rock fragments. As environmental covariates for our research we utilized environmental variables, in particular geomorphometric parameters derived from a digital elevation model (with a 20 m pixel resolution), land cover data, and climat-ic maps. To evaluate the effectiveness of our models, we evaluated their capacity to predict SOC stock 10 and SOC stock 30 using the coefficient of determination (R2). The results for the SOC stock 10 were as follows: MARS 0.39, ENET 0.41, RF 0.69, and SVR 0.50. For the SOC stock 30, the corresponding R2 values were: MARS 0.45, ENET 0.48, RF 0.65, and SVR 0.62. Additionally, we calculated the Root Mean Square Error (RMSE) and Mean Absolute Error (MAE) for further assessment. To map the spatial distribution of SOC stock and address uncertainties in both soil layers, we chose the RF model, due to its better performance, as indicated by the highest R2 and the lowest RMSE and MAE. The resulting SOC stock maps using the RF model demonstrated an accuracy of RMSE = 1.35 kg.m-2 for the SOC stock 10 and RMSE= 3.36 kg.m-2 for the SOC stock 30. To further evaluate and illustrate the precision of our soil maps, we conducted an uncertainty assessment and mapping by analyzing the standard deviation (SD) from 50 iterations of the best-performing RF model. This analysis effectively highlighted the high accuracy achieved in our soil maps. The maps of uncertainty demonstrated that the RF model better predicts the SOC stock 10 compared to the SOC stock 30.

As part of a project ordered by the Ministry of Science, Technology and Innovation of Brazil, an assessment of Brazilian biological collections was conducted by the Brazilian Societies of Botany, Microbiology, Virology and Zoology to obtain data on the current state of these collections. The goal was to provide subsidies for future public policies, including financial support and prioritization policies. Herein, we present the results of the microbiological collections, which play a fundamental role in the ex situ conservation of biodiversity and support research, development and innovation. A survey was sent to public and private institutions in Brazil and answered by 168 microbiological collections from 79 different institutions. Among these, 73 comprise public research institutions and universities, demonstrating the State's importance in preserving and safeguarding Brazilian microbial diversity. The main taxonomic groups are bacteria (present in 70.24% of the collections) and fungi (52.98% of the collections) from different Brazilian ecosystems and biomes, including several type strains. Furthermore, the collections preserve microorganisms with biotechnological potential for application in environmental protection, public health, industry, and agribusiness. However, despite all these economic and biotechnological potentials, the data analysis showed serious limitations and fragilities, especially regarding physical infrastructure and human resources, and raises alerts about the risk that Brazilian collections are subjected to.

Cancers of the brain and nervous system account for 1 in every 100 cancer diagnoses in the United States and about 0.3 million diagnoses globally, every year. Surgery, radiotherapy, and chemo-therapy constitute the standard of care. Despite advancements in diagnosis and treatment delivery, mortality rate for these cancers have remained steady for over three decades. Immunotherapy is an emerging fourth treatment modality which has been effective against several cancers but not brain cancers, such as glioblastoma, GBM. Here, we develop in vitro assays to quantify molecular readouts of cell death, cell migration and clonogenicity, and synopsize these as biophysical markers for the rapid evaluation of immune checkpoint inhibitors (ICI), durvalumab and pembrolizumab, alone and in combination with radiotherapy (radioimmunotherapy). We find different trends in their direct action on two GBM cell lines (T98G and U87), even in the absence of immune cells. Radiation alone, and pembrolizumab with radiation, both reduced (p < 0.05) cell-cell adhesion. This reduction suggests increased potential for local invasion. Our assays offer additional insights regarding ICIs, may enable evaluation of their potential efficacy, and could set the stage for pa-tient-specific radioimmunotherapy against brain cancers, engendering improved treatment out-comes.

In a recent effort to mitigate harm from human pathogens, many biosynthetic pathways are extensively evaluated for their ability to inhibit pathogen growth and determine drug targets. Among those, one of the important products/targets of such pathways is isopentenyl diphosphate, the universal precursor of isoprenoids, which are essential for the normal functioning of microorganisms. In general, two biosynthetic pathways lead to the formation of isopentenyl diphosphate: 1) the mevalonate pathway in animals and 2) the non-mevalonate or methylerythritol phosphate (MEP) in many bacteria, some protozoa, and plants. Because the MEP pathway is not found in mammalian cells, it is considered an attractive target for the development of antimicrobials against a variety of human pathogens, including Mycobacterium tuberculosis (M.tb). In the MEP pathway, 4-diphosphocytidyl-2-c-methyl-d-erythritol kinase (IspE) phosphorylates 4-diphosphocytidyl-2-C-methyl-D-erythritol (CDPME) to form 4-diphosphocytidyl-2-C-methyl-D-erythritol 2-phosphate (CDPME2P), followed by cyclization to 2-C-methyl-D-erythritol 2,4-cyclodiphosphate (MECPP) by 2-C-methyl-D-erythritol 2,4-cyclodiphosphate synthase (IspF). A virtual high throughput screening was done by docking IspE protein with commercially available compounds and identified an active heterotricyclic compound. Hence, we designed, synthesized, and tested similar new heterotricyclic compounds. This study will provide the critical insight necessary for the ability to develop novel antimicrobials that target the MEP pathways in pathogens.

Ionizing radiation-induced damage in cancer and normal cells leads to apoptosis and cell death, through the intracellular oxidative stress, DNA damage and disorders of their metabolism. Irradiation doses that do not lead to the death of tumor cells can result in the emergence of radioresistant clones of these cells, due to the rearrangement of metabolism and the emergence of new mutations, including those in the genes responsible for DNA repair. The search for the substances capable of modulating the functioning of the tumor cell repair system is an urgent task. Here we analyzed the effect of cerium(III) fluoride nanoparticles (CeF3 NPs) on normal (human mesenchymal stem cells – hMSCs) and cancer (MCF-7 line) human cells after X-ray radiation. CeF3 NPs effectively prevent the formation of hydrogen peroxide and hydroxyl radicals in an irradiated aqueous solution, showing pronounced antioxidant properties. CeF3 NPs are able to protect hMSCs from radiation-induced proliferation arrest, increasing their viability and mitochondrial membrane potential, and, conversely, inducing the cell death of MCF-7 cancer cells, causing radiation-induced mitochondrial hyperpolarization. CeF3 NPs provided a significant decrease in the number of double-strand breaks (DSBs) in normal cells, while in MCF-7 cells the number of γ-H2AX foci dramatically increased in the presence of CeF3 4 hours after irradiation. In the presence of CeF3 NPs, there was a tendency to modulate the expression of most analyzed genes associated with the development of intracellular oxidative stress, cell redox status and the DNA repair system after X ray irradiation. Cerium-containing nanoparticles are capable of providing selective protection of normal cells from radiation-induced injuries and are considered as a platform for the development of promising clinical radioprotectors.

This study introduces a multilayer perceptron (MLP) error compensation method for real-time camera orientation estimation, leveraging a single vanishing point and road lane lines within a steady-state framework. The research emphasizes cameras with a roll angle of 0°, predominant in autonomous vehicle contexts. The methodology estimates pitch and yaw angles using a single image and integrates two Kalman filter models with inputs from image points (u, v) and derived angles (pitch, yaw). Performance metrics, including AE, MINE, MAXE, SSE, and STDEV, were utilized, testing the system in both simulator and real-vehicle environments. The outcomes indicate that our method notably enhances the accuracy of camera orientation estimations, consistently outpacing competing techniques across varied scenarios. This method’s potency is evident in its adaptability and precision, holding promise for advanced vehicle systems and real-world applications.

To investigate the effects of plant polysaccharides combined with boric acid on digestive function, immune function, and harmful gas and heavy metal contents in faeces of finishing pigs, for this study, 90 healthy three-way cross-bred pigs were selected and randomly divided into five groups: Con) A control, fed basic feed; BA) fed basic feed supplemented with 40 mg/kg of boric acid; BA+APS) fed basic feed supplemented with 40 mg/kg of boric acid and 400 mg/kg of Astragalus polysaccharides; BA+GLP) fed basic feed supplemented with 40 mg/kg of boric acid with 200 mg/kg of Ganoderma lucidum polysaccharides; and BA+EPS) fed basic feed supplemented with 40 mg/kg of boric acid and 500 mg/kg of Echinacea polysaccharides. Compared with the Con, the average daily gain (ADG) and trypsin activity were higher in BA, along with there being increased glutathione peroxidase (p < 0.05); furthermore, lower malondialdehyde content and harmful substance emissions from manure were observed (p < 0.05). Compared with BA, increases in ADG, gain-to-feed ratio (G/F), trypsin, and maltase activities were observed in BA+EPS (p < 0.05), as well as a lower NH3 emissions (p < 0.05). Compared with BA, BA+APS exhibited higher ADG, average daily feed intake (ADFI), G/F, trypsin, and maltase activities (p < 0.05), while H2S emissions were lower (p < 0.05). And Taken together, our findings reveal that supplementation with boric acid and plant polysaccharides in the diet of finishing pigs synergistically improved their growth performance, trypsin and maltase activities, and immune function, while also discovered the intestinal digestive enzymes, serum inflammatory factors, oxidative stress responseand emissions of harmful gases and heavy metals from feces and urine were tightly related, further reducing the impact of fecal pollution generated by modern animal husbandry on the environment.

Background Acute right heart failure (RHF) is associated with high morbidity and mortality. Temporary mechanical circulatory support (tMCS) is now part of the advanced management strategy for refractory cardiogenic shock (CS). Among such support systems, VA-ECMO remains the fastest MCS system to set up. The ProtekDuo cannula can be used as a temporary and percutaneous right ventricular assist device (RVAD) in relay with VA-ECMO in the context of prolonged weaning. Case Summary This case report describes the clinical course of a 69-year-old patient who underwent elective aortic valve replacement surgery complicated by acute RHF due to iatrogenic ligation of the right coronary artery. VA-ECMO was initiated in the context of refractory cardiogenic shock. Faced with prolonged MCS weaning, due to lack of recovery of the right ventricle associated with the absence of any other therapeutic option, a percutaneous RVAD via a ProtekDuo cannula was implanted as a bridge to recovery. The ProtekDuo was gradually weaned while the patient began rehabilitation. The patient was transferred to the medical ward after 5 weeks in the ICU, stayed 5 months in an acute medical setting, went to a rehabilitation center afterward and returned home 6 months after the initial surgery without any neurological sequalae or organ failures. In total, she remained on MCS for 39 days (21 on VA-ECMO and 18 on ProtekDuo). Discussion In cases of refractory RHF, after stabilization and organ perfusion restoration under VA-ECMO, it is feasible to switch to a percutaneous RVAD, allowing early mobilization of patients during prolonged MCS weaning until the right ventricle adapts to new loading conditions.

The brain being arguably the most complex organ in the human body, its detailed functioning is yet to be fully deciphered, let alone accurately modeled. Nonetheless, the medical community has gathered quite a remarkable amount of studies about the consequences of illnesses and injuries on its development and functioning. This bibliographic review aims to cover mostly the findings related to the changes in the physical distribution of neurons and their connections - the connectome -, both structural and functional, as well as their modelling. It does not intend to offer an extensive medical description of all injuries and diseases affecting the brain, rather presenting the most common ones succinctly so the need for accurate brain modelling can be fully understood and pondered, offering propositions to this aim.

Background and Objectives: Inflammatory bowel disease (IBD) may affect organs outside the intestines, it is called extraintestinal manifestations of IBD. Data on the prevalence of mucocutaneous manifestations in IBD patients are very limited, therefore, the aim of this study was to assess the prevalence of skin and mucosal lesions and to determine the relationship with demographic factors, clinical features, and systemic treatment. Materials and Methods: Prospective study included 162 out-patients with IBD who were managed in the tertiary care center. Ulcerative colitis (UC) was diagnosed in 117 patients, Crohn's disease (CD) in 45. Patients completed the questionnaire containing demographic and IBD data, questions about mucocutaneous lesions (in past or present state). Results: Skin lesions were reported by 40.7% of patients, oral mucosal lesions were reported by 16.7%, without significant differences between sexes or IBD types. In 47 (29%) of patients, skin lesions appeared together with IBD or during the course of the disease. The most common skin lesions were psoriasis (8.0%), erythema nodosum (5.6%), pyoderma gangrenosum and acne (3.7% each). UC patients mostly reported about psoriasis (9.4%), while CD patients – erythema nodosum (11.1%). There were more frequent skin lesions in patients with more extensive UC type (p = 0.01), while no difference was noticed between different types of CD. The average duration of IBD in patients with skin lesions was similar to those without lesions (9.3±6.7 vs. 9.4±6.7 years). Conclusions: Mucocutaneous lesions were reported by 48.8% of inflammatory bowel disease patients. The frequency of mucocutaneous lesions does not differ significantly between UC and CD, and a longer duration of illness is not a predictive factor for the appearance of lesions. More extensive UC is related to higher frequency of skin lesions.

A hybrid organic molecules as ligands and inorganic NCs in this research combines the chemical properties of organic semiconductors with the chemical stability of inor- ganic nanoparticles like PbS. It is possible to improve the ligand exchange and PbS-NCs' distribution by adding Amino phynel anchor group to TIPs-pentacene and Carboxylic anchor group to Tetraphenylporphyrin molecules. By adding anchor groups to one or two sides of these molecules, they would convert the molecules to ecient ligands to obtain superlattice coupled organic-inorganic nanostrcuture semicondcutor layers (COINs). Adding on side group would cap the PbS nanoparticles while adding two an- chor group would play a linker role between two PbS NCs. This morophology enhance- ment paves the way to manipulate the physical properties of the COINs and fabricate solar cells. Singlet ssion phenomena demonstrates pentacene molecule's advantage for high eciency in organic solar cells and its ability to overcome the Schockley-Queisser limit. Ultraviolet photo-emission spectroscopy (UPS) determines the highest occupied molecular orbital (HOMO) and the work function of COINs, while the lowest unoccu- pied molecular orbital (LUMO) of COINs were calculated subsequently by adding both the exciton binding energy and the optical band gap to the measured HOMO energy. The current versus voltage characteristics and impedance spectroscopy were studied for these molecules as well.

Children with epilepsy are affected by several factors, including clinical and social variables, which can lead to reductions in quality of life (QOL). Among these variables, factors relating to seizure severity such as frequent seizures and status epilepticus (SE) have been identified as important predictors of QOL. In addition, frequency of interictal epileptiform discharges (IEDs) on the electroencephalogram (EEG) may also lead to cognitive declines and behavioral disturbances. Moreover, frequent seizures and/or IEDs may play a role in emotional mediators such as stigma and fatigue in childhood epilepsy. Seizure severity and/or IEDs are thus important QOL-related factors in childhood epilepsy. Frontal lobe dysfunctions such as cognitive decline and behavioral disturbances can result in reduced QOL for both the child and their family. Frontal and prefrontal lobe growth disturbances can be present during active-phase epilepsy in some children with neuropsychological impairments. Recovery from prefrontal lobe growth disturbance may depend on the active seizure period. Disturbance of prefrontal lobe growth can recover more rapidly in children with a shorter active seizure period. In contrast, recovery may be delayed in children with a longer active seizure period. Accordingly, severe seizures can lead to neuropsychological impairments in association with prefrontal lobe growth disturbance in children with epilepsy. Moreover, frequent seizures can lead to having seizure-associated headache, perception of self-stigma and parental stigma, and fatigue. In addition, IEDs on EEG, representing persistent pathological neuronal discharges, may be associated with several pathological aspects. Frontal IEDs can be a risk factor for recurrent seizures, cognitive decline, and behavioral disturbances and may also play a role as an emotional mediator similar to stigma. In addition, behavioral disturbances may result in the presence of secondary bilateral synchrony (SBS) on EEG. Behavioral disturbances can be improved in association with reduction of IEDs in children with frontal IED and SBS. Seizure severity and IEDs on EEG may thus be associated with neuropsychological impairments, leading to QOL reduction. Therapeutic management may be desirable to remit seizures and EEG abnormalities such as frontal IED and SBS as soon as possible to improve QOL in children with epilepsy.

Vascular endothelial growth factors (VEGFs) are regarded as the key vasculogenic mediators in the human body, of which VEGF-A is considered as one of the important types. It is the major growth factor possessing increasing vascular permeability as well as angiogenesis properties. This article provides intuition into the different effects of VEGF-A on vessels in ovarian hyper stimulation syndrome (OHSS) which is defined as a complication of in-vitro fertilization for infertility treatment, and obesity, a universally health problem. These are two dissimilar pathways outcomes for VEGF-A effects, thereby This article reviews updated information about the mentioned disorders and reveals that how this kind of growth factor yields different results on vasculature by activating distinct intracellular signaling in endothelial cells.

Surface processes such as coatings, corrosion, photocatalysis, and tribology are greatly diversified by acid-base interaction at the surface overlayer. This study focuses on the action of metallic copper surface as an electron donor/acceptor related to inactivation of viruses; it was found that regarding Cu2O or Cu materials electrostatic interaction plays a major role in virus inactivation. We applied TPPE method to clarify the mechanism of electron transfer (ET) occurring at light irradiated copper surfaces. The TPPE characteristics was strongly influenced by the environments, which correspond to the temperature and environment dependence of the total count of emitted electrons in the incident light wavelength scan (PE total count, NT), the photothreshold, and further the activation energy (E) analyzed from Arrhenius plot of NT values obtained in the temperature-increase and subsequent temperature-decrease processes. In this study we reexamined the dependence of the TPPE data from two types of Cu metal surfaces: Sample A, which was mechanically abraded in alcohols, water, and air, and Sample C, which was only ultrasonically cleaned in these liquids. The NT for both Samples slowly increased with increasing temperature, reached a maximum (NTmax) at 250C (maximum temperature, Tmax), and after that decreased. For Sample A the NTmax value decreased in the order H2O > CH3OH > C2H5OH > (CH3)2CHOH > C3H7OH, although the last alcohol gave Tmax = 100C, while with Sample C the NTmax value decreased in the order: C3H7OH > (CH3)2CHOH > C2H5OH > CH3OH > H2O. Interestingly, both orders of the liquids were completely opposite: this means that Cu surface can possess two-way character. The NT intensity was found to be strongly associated with the change of the hydroxyl group (Cu-OH) to the oxide oxygen (O2) in the O1s spectra in the XPS measurement. The difference between the above orders was explained by the acid-base interaction mode of the Cu-OH group with the adsorbed molecule on the surfaces. The H2O adsorbed on Sample A produces the electric dipole Cu-OH+---:OH2 (--- hydrogen bond), while the C3H7OH and (CH3)2CHOH adsorbed on Sample C produce ROH+---:O(H)-Cu (R = alkyl groups). Gutmann’s acceptor number (AN) representing the basicity of the liquid molecules was found to be related to the TPPE characteristics: (CH3)2CHOH (33.5), C2H5OH (37.1), CH3OH (41.3), H2O (54.8) (the AN of C3H7OH could not be confirmed). With Sample A the values of NTmaxa and EaUp1 both increased with increasing AN (Up1 means the 1st temperature-increase process). On the other hand, with Sample C the values of NTmaxc and EcUp1 both decreased with increasing AN. These findings suggest that Sample A acts as an acid, while Sample C functions as a base. However, in the case of both types of Samples A and C the NTmax values were found to increase with increasing EUp1. It was explained that the EUp1 values depending on the liquids originate from the difference in the energy level of the hydroxyl group radical at the surface denoted. This is able to attract electrons in the neighborhood of the Fermi level of the base metal by tunnelling. After that due to Auger emission electrons are released, leading to the ET in the overlayer. These electrons are considered to have a strong ability of reducibility.

TAU is the main disease driver in Alzheimer’s and many other sporadic and genetic tauopathies. TAU is differently spliced, the role of individual splice-isoforms unclear. Murine Mapt-KO mice are healthy, and protected from Alzheimer’s, but no such case has been reported in humans. Using gnomad database, we here demonstrate that the only isoform expressed during fetal human brain development is intolerant to mutation, while other brain and peripheral nervous system TAU isoforms are dispensable. With TAU targeted therapies for Alzheimer’s and other tauopathies on the rise, we caution that TAU is essential human brain development.

The catalytically inactive caspase-8-homologous protein, c-FLIP, is a potent antiapoptotic protein highly expressed in various types of cancers. c-FLIP competes with caspase-8 for binding to the adaptor protein FADD (Fas-Associated Death Domain) following Death Receptors (DRs) activation by the ligands of the TNF-R family. As a consequence, the extrinsic apoptotic signaling pathway involving DRs is inhibited. Inhibition of c-FLIP activity in tumor cells might enhance DR-mediated apoptosis and overcome immune and anticancer drug resistance. Based on an in silico approach, the aim of this work was to identify, new small inhibitory molecules able to bind selectively to c-FLIP and block its anti-apoptotic activity. Using a homology 3D model of c-FLIP, an in silico screening of 1880 compounds from the NCI database (National Cancer Institute) was performed. Nine molecules were selected for in vitro assays, based on their binding affinity to c-FLIP and their high selectivity compared to caspase-8. These compounds selectively bind to the Death Effector Domain 2 (DED2) of c-FLIP. We have tested in vitro the inhibitory effect of these 9 molecules using the human lung cancer cell line H1703 overexpressing c-FLIP. Our results showed that 6 of these newly identified compounds efficiently prevent FADD/c-FLIP interactions in a molecular pull-down assay, as well as in a DISC Immunoprecipitation assay. Overexpression of c-FLIP in H1703 prevents TRAIL-mediated apoptosis, however, combination of TRAIL with these selected molecules signifi-cantly restored TRAIL-induced cell death by rescuing caspase cleavage and activation. Altogether, our findings indicate that new inhibitory chemical compounds efficiently prevent c-FLIP recruit-ment into the DISC complex, thus restoring caspase-8 dependent apoptotic cascade. These results pave the way to design new c-FLIP inhibitory compounds that may serve as anticancer agents in tumors overexpressing c-FLIP.

We are currently investigating the ultrasound imaging of a sensor consisting of a randomized encoding mask attached to a single lead zirconate titanate (PZT) oscillator for use in a puncture microscope. The proposed model was performed using a finite element method (FEM) simulator. To increase the number of measurements required by a single element system, the transducer was rotated at different angles. The image was constructed by solving a linear equation of the image model. In a previous study, the image resolution was improved by extracting phase information. In this study, we propose a strategy by integrating the weighted frequency subbands compound and a super resolution method (SCM) to improve the resolution in range and lateral resolution. We also evaluated the image performance by applying different methods to improve the image quality. The results show that better image resolution and speckle suppression were obtained by applying the proposed method.

Streptococcus thermophilus is widely used as a starter culture in the dairy industry and has garnered attention as a beneficial bacterium owing to its health-promoting functionalities in humans. In this study, the probiotic potential of S. thermophilus MCC0200, isolated from a dairy product, was investigated through a combinatorial approach of in-vitro and in-silico studies. MCC0200 demonstrated the ability to survive harsh gastro-intestinal transit (GIT), adhere to intestinal mucosa and exert health-promoting traits in in-vitro studies. These findings were corroborated with in-silico evidence, wherein MCC0200 genome harboured genes associated with tolerance to GIT conditions, intestinal adhesion and colonization. Genome mapping also highlighted the ability of MCC0200 to produce compounds advantageous for host (folate, bacteriocins), to release enzymes that can reinforce the host ability (antioxidative enzymes), to metabolize food components that can be harmful to sensitive people (lactose). MCC0200 also demonstrated a positive effect on reducing cholesterol levels, proving to be a potential candidate for food and pharmaceutical applications. Absence of transmissible antibiotic resistance genes and virulence genes underscored the GRAS nature of MCC0200. This study explored the potential of Streptococcus thermophilus for its probable applications as a probiotic beyond the dairy industry.

This article investigates hydraulic percolation in saturated porous media, focusing on containment systems using sheet pile walls and gravity concrete dams. The Laplace equation, which governs hydraulic flow in porous media, is solved using the Finite Element Method through the ANSYS software. The modeling of the porous media employs a planar quadratic element called Plane 55, originally used for thermal problems, composed of four nodes and one hydraulic degree of freedom per node. The numerical results of the water pressure acting on the hydraulic structure, flow rate, and hydraulic gradient at the outlet of the porous media are compared with results obtained in the technical-scientific literature using flow nets. Two different methodologies are used to obtain the rate of seepage: by using the average hydraulic velocity or by calculating the integral of the hydraulic gradient perpendicular to the flow area. Both methodologies are compared and validated in the numerical simulations. This work also demonstrates the importance of mesh refinement for obtaining the flow rate in the studied hydraulic systems.

A soluble biopolymer (SBP) was obtained by hydrolysis in pH 13 water at 60 °C. The dry product was re-dissolved in plain water at pH 10 and used as control against the same solution added with hydrogen peroxide at 0.1-3 H2O2 moles per SBP carbon mole. The control and test solutions were kept at room temperature, in the dark or in a climatic chamber under irradiation with simulated solar light, until the solutions pH remained constant. Afterwards, the solutions were processed to recover and analyze the crude soluble products. For the control solution, the results indicated significant production of CO2, production of organic carboxyl functional groups and de-polymerization of the pristine SBP organic matter. These findings demonstrate the oxidation of SBP by water, which could only occur through the production of O and OH radicals catalyzed by SBP. The present work reports the results obtained from the control solution and for the test solution treated in the presence and absence of H2O2, with and without pH control, in the dark and under irradiation with simulated solar light. The paper discusses the perspectives of further implementation of the autocatalytic properties of SBP for the realization of a municipal biowaste-based biorefinery producing value added bio-products for consumer’s use.

: Poultry products in Zambia form an integral part of the human diet in many households, as they are cheap and easy to produce. The burden of poultry diseases has, however, remained a major challenge. Growing consumer demand for poultry products in Zambia has resulted in non-prudent antimicrobial use on farms, intending to prevent and treat poultry diseases for growth optimization and maximising profits. This cross-sectional study aimed to identify the different types of bacteria causing diseases in chickens in Lusaka and to detect the extended-spectrum-lactamase (ESBL)-encoding genes. We collected 215 samples from 91 diseased chickens at three post-mortem facilities and screened them for gram-negative bacteria. Of these samples, 103 tested positive for various clinically relevant Enterobacteriaceae, including Enterobacter (43/103, 41.7%), Escherichia coli (20/103, 19.4%), Salmonella (10/103, 9.7%), and Shigella (8/103, 7.8%). Other isolated bacteria included Yersinia, Morganella, Proteus, and Klebsiella, which accounted for 21.4%. E. coli, Enterobacter, Salmonella, and Shigella were subjected to antimicrobial susceptibility testing. The results revealed that E. coli, Enterobacter, and shigella were highly resistant to tetracycline, ampicillin, amoxicillin, and trimethoprim-sulfamethoxazole, while Salmonella showed complete susceptibility to all antibiotics. The observed resistance patterns correlated with antimicrobial usage estimated from sales data from a large-scale wholesale and retail company. Six (6/14, 42.9%) E. coli isolates tested positive for bla_CTX-M, whilst eight (8/14, 57.1%) Enterobacter samples tested positive for bla_TEM. Interestingly, four (4/6, 66.7%) of the E. coli isolates carrying bla_CTX-M-positive strains were also positive for bla_TEM. Sanger sequencing of the PCR products revealed that five (5/6,83.3%) of the abovementioned isolates possessed the bla_CTX-M-15 allele. The results suggest the presence of potentially pathogenic ESBL-producing Enterobacteriaceae in poultry, threatening public health. Keywords:. Enterobacteriaceae, bla_CTX-M, bla_TEM

This research delves into the integration of green roofs with Building Information Modeling (BIM), a pivotal advancement in sustainable urban construction. Aligning with the United Nations Sustainable Development Goals, particularly Goal 11, the study explores how this integration can address global challenges like climate change and resource depletion. Using the Dynamo Visual Programming Language within Autodesk Revit, the research develops a computational modeling approach for green roofs, focusing on their thermal and structural characteristics under varied environmental conditions. Key findings demonstrate the significant influence of substrate and drainage material combinations on green roofs’ thermal performance, highlighting the need for tailored designs based on climatic conditions. The study also emphasizes the importance of considering structural performance in both dry and saturated conditions for overall building integrity. The research identifies gaps in current practices, such as limited focus on specific green roof materials and reliance on certain software tools, suggesting the need for broader material selection and software adaptability. Future research directions include expanding material selections, exploring diverse environmental conditions, and integrating green roofs with various BIM software platforms. The study's implications extend to stakeholders in the construction industry, offering a framework for architects, urban planners, and policymakers to design and implement green roofs aligned with environmental goals. This work contributes to the field by proposing a novel approach to sustainable construction, integrating ecological design with digital technology, and setting a new benchmark in the integration of green roofs with BIM. By addressing these aspects, the research paves the way for future developments in sustainable urban construction, enhancing the efficiency, sustainability, and resilience of urban communities in line with global sustainability objectives.

Cork oak mortality has reached alarming proportions in the last decades, exacerbated by climate change. Understanding this phenomenon is crucial in finding mitigation or adaptation strategies. This study conducts a diachronic analysis of cork oak mortality over 10 years using GIS tools, focusing on Portugal's Tagus Lezíria region. Topographic, edaphic and climatic variables were employed to create maps of edaphoclimatic aptitude for cork oaks. Dead trees were identified using remote sensing techniques and crown coverage was determined to calculate the mortality index. The diachronic analysis aimed to explore climate change effects on cork oak mortality. A decrease in precipitation was observed, significantly impacting stands with canopy cover below 40%. Furthermore, a negative effect of solar radiation identified only in stands with canopy cover of 40% suggested its role in cork oak decline. This study introduces a novel perspective, highlighting the protective effect of denser canopy cover (above 40%) against excessive solar radiation and the impact of reduced precipitation. The integrated and diachronic approach provides valuable information for adapting management strategies to climate change challenges.

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. The reciprocating action of a piston expander confirms a net energy gain despite the crystal-fluid material maintaining almost constant density. 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. External pressure perturbations of the low-energy system initiate ‘rolling’ critical responses that see energy and momentum conserved across a synchronized U(2) symmetry group whilst a complex gauge field is also exposed. Simultaneous emergence of the Ginzburg-Landau superconducting phase transition is consistent with gauge-invariant coupling of this 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 the QCD mass gap arises.

Cerebrovascular diseases represent a significant mortality rate worldwide and constitute a major public health and economic challenge. Many African countries such as Cape Verde are going through an epidemiological transition from communicable to non-communicable diseases, demographic and socioeconomic changes and facing an increase in cerebrocardiovascular diseases associated with increased cardiovascular risk. The present study aimed to identify the prevalence of risk factors that predispose to cardiovascular diseases in adult individuals residing on the island of Santiago. Cross-sectional population-based study with individuals over 18 years of age, of both sexes. Data collection took place in October and November 2021, in all municipalities on the island of Santiago. Individuals with Cape Verdean nationality who stayed abroad for more than one year and who arrived on the island of Santiago less than 30 days ago and individuals with any type of disability that could prevent them from participating in the study were excluded from the study. The sample size was calculated based on the projection of the population of the island of Santiago for the year 2021, according to the appropriate epidemiological model. Sociodemographic data were obtained through the application of a questionnaire containing age, sex, race, weight, height, risk factors (presence of diabetes, dyslipidemia, heredity, physical activity, smoking habits, history of cerebrovascular events, control of weight and blood pressure). RESULTS: Study sample is predominantly female (54.8%), the age group with the largest number was 18-27 years (21%); 42.2% with BMI ≥ 25 kg/m2; 65.1% sedentary; Smoking 7.3% and alcoholism 14.4%; 6.5% with diagnosed heart disease; 19.9% with close family members with cardiac pathology; 2.7% had a stroke, 0.1% had a transient ischemic attack; 0.5% acute myocardial infarction; 23.5% had the periodic habit of assessing blood pressure; 32.6% hypertensive; 4.5% with diabetics. CONCLUSIONS: The study showed that there is a high prevalence of cerebrovascular risk factors on Santiago Island, especially in females. Smoking and alcoholism showed a relationship with males. BMI, physical inactivity, diabetes and dyslipidemia were shown to be related to sex. Hypertension and Diabetes revealed a significant relationship with age group. Alcoholism, smoking, hypercholesterolemia and hypertriglyceridemia maintained a significant relationship with the municipalities.

There has been a rapid increase in the use of Marine Spatial Planning (MSP) throughout the world recently, partly due to the continued loss of marine biodiversity and habitat. The sustainability of marine resources is threatened in all regions of the world by major events such as climate change, marine pollution, overfishing, illegal, unreported and unregulated fishing both on the high seas and in country waters. Here, we present a comprehensive review and analysis of how economic information has been applied and used to inform decisions about MSP in British Columbia (BC), Canada and other similar jurisdictions. This focus for the paper was selected because important gaps remain in the literature in terms of incorporating economic questions into MSP. We first present different definitions of MSP, and then we extract useful lessons from MSP regimes with well–tested decision support tools, and use this to guide MSP implementation in BC. We finally present and discuss case studies from Australia, South Africa and Belgium. Our review suggests that applying economic information to support the design and implementation of MSPs would lead to better decisions. This in turn would foster livelihoods, attract finance, increase buy–in and advance United Nations Sustainable Development Goal 14: Life Below Water, thereby achieving Infinity Fish, i.e., ensuring that ocean benefits flow to humanity forever.

(1) Background: Immunosuppressed patients, especially those receiving B-cells depleting therapies (BCDT), are at major risk to develop reduced vaccine seroconversion and contract severe acute respiratory syndrome coronavirus 2 (SARS-CoV2) infection. The aim of our study is to assess safety and efficacy of the pre-exposure prophylactic combination of Tixagevimab and Cilgavimab (TGM-CGM) in a cohort of rheumatic patients diagnosed with Autoimmune Rheumatic Diseases; (2) Methods: We performed a prospective study using the clinical medical charts of 25 patients treated with Rituximab and received a single injection of TGM/CGM. The cohort was followed for 6 months from the injection and compared to a control group of 25 immunosuppressed patients who did not receive TGM-CGM. We assessed the incidence and the severity of Covid-19 in both groups, as well as early and late adverse events; (3) Results: Despite the small sample, we noticed a downward trend in the incidence and severity of symptomatic infection in the group treated with TGM/CGM. In the experimental cohort, one patient was completely asymptomatic, four patients were oligosymptomatic infection, and just one had mild-moderate infection versus 4 oligosymptomatic and 5 mild-moderate infection in the control group. We observed also a reduction in time to nasopharyngeal swab negativization. No adverse events were reported in our data. We collected the dosage of anti-Receptor-Binding Domain (RBD) SARS-CoV2 spike protein for 21 patients, revealing adequate seroconversion in 12 patients out of 21; (4) Conclusions: Even though the study was conducted during the Omicron wave, notably known to be less responsive to monoclonal antibodies, we proved that TGM-CGM could be a risk-free additional tool to prevent SARS-Cov2 infection in rheumatic immunosuppressed patients.

The liver health of Gilthead sea bream and European sea bass fed fishmeal-free diets including various proportions of plant proteins, insect and poultry by-product meals, was investigated through biochemical and histological analyses using a new Liver Index (LI) formula. Four isoproteic (45% DM) and isolipidic (20% DM) diets were compared: a control, plant-based diet (CV) and other three test ones where 40% of a plant protein-rich ingredient mixture was replaced by Hermetia illucens (H40) or poultry by-product (P40) meals alone or in combination (H10P30). The trials lasted 12 and 18 weeks for sea bream and sea bass, respectively. The results so far ob-tained highlighted species-specific differences in the physiological response to dietary changes. In sea bream, the biochemical and histological responses suggest favorable physiological status and liver health, with higher serum cholesterol (CHO) and triglyceride (TAG) levels and moderate hepatocyte lipid accumulation with the H10P30 diet compared to CV (p<0.05). In sea bass, all diets resulted in elevated serum TAG levels and liver lipid accumulation particularly in fish fed the P40 one (p<0.05) which resulted in the highest LI, coupled with higher frequency of severe lipid accumulation, hypertrophy, cord loss, peripheral nuclei displacement and pyknosis. In conclusion sea bream well adapted to the test diets, while sea bass exhibited altered hepatic lipid metabolism leading to incipient liver steatosis, likely due to the high lipid content of the diets including the insect and poultry meals. The LI developed in this study proved to be a reliable tool for assessing the effects of dietary changes on liver health of sea bream and sea bass, consistent with biochemical and histological findings.

Visceral leishmaniasis (VL) is a chronic systemic disease. In Brazil this infection is caused by Leishmania (Leishmania) infantum. Extracellular vesicles (EVs) released by Leishmania species have different functions like modulation of host immune system, inflammatory response, among others. This study evaluated the participation of EVs from L. (L.) infantum (Leish-EVs) in stimulation of the humoral and cellular immune responses of hosts with VL. Promastigotes were cultivated in 199 medium and, in the log phase of growth, they were centrifuged, washed, resuspended in RPMI medium and incubated for 2 to 24h, at 25ºC or 37°C to release Leish-EVs. This dynamic was evaluated by transmission (TEM) and scanning (SEM) electron microscopies, as well as nanoparticle tracking analysis (NTA). The results suggested that parasite penetration in mammal macrophages requires more Leish-EVs than those living in insect vectors, since promastigotes incubated at 37°C released more Leish-EVs than those incubated at 25ºC. In comparison to the control group, infected THP-1 cells produced a significantly higher concentration of EVs (THP-1 cells-EVs). Similar results were obtained when THP-1 cells were treated with Leish-EVs or a crude Leishmania antigen. These data suggest that the concentration of host-EVs-Can distinguish between infected and uninfected cells. THP-1 cells treated with Leish-EVs expressed more IL-12 than control THP-1 cells, but were unable to produce IFN-γ. These same cells produced IL-10, which inhibited TNF and IL-6. Equally, THP-1 cells treated with Leish-EVs up-expressed miR-21-5p and miR-146a-5p. These findings indicate that the increased levels of miR-21-5p and miR-146a-5p observed in Leish-EVs-treated-THP-1 cells lead to immunosuppression and the secretion of pro-inflammatory cytokines.

Although subcutaneous islet transplantation has many advantages, transplant efficiency is still low in animal models, except in mice. We previously reported the efficacy of pretreatment using gelatin hydrogel nonwoven fabric (GHNF) in a mouse model. We investigated whether the preimplantation of GHNF could improve the subcutaneous islet transplantation outcomes in a rat model. GHNF sheets sandwiching a silicone spacer (GHNF group) and silicone spacers without GHNF sheets (control group) were implanted into the subcutaneous space of recipients three weeks before islet transplantation, and diabetes was induced seven days before islet transplantation. Syngeneic islets were transplanted into the space where the silicone spacer was removed. Blood glucose levels, glucose tolerance, immunohistochemistry, and neovascularization were evaluated. The GHNF group showed significantly better blood glucose changes than the control group (p&lt;0.01). The cure rate was significantly higher in the GHNF group (p&lt;0.05). The number of vWF-positive vessels was significantly higher in the GHNF group (p&lt;0.01), and lectin angiography showed the same tendency (p&lt;0.05). The expression of laminin and collagen III around the transplanted islets were also higher in the GHNF group (p&lt;0.01). GHNF pretreatment was effective in a rat model, and the main mechanisms might be neovascularization and compensation of the extracellular matrices.

We aimed to determine whether A-mode ultrasound (US) can provide accurate and reliable measurements comparable to those obtained through B-mode US, under diverse conditions. Thirty healthy participants (15 female, 15 male) underwent measurements of subcutaneous fat thickness (SFT), muscle thickness (MT), and muscle quality (MQ) in the trapezius and biceps brachii muscle with both US modes after and before exercises designed to stimulate the respec-tive muscles. In three key indices, the results demonstrated high validity of A-mode, with min-imal mean differences between the two devices less than 0.91mm and intraclass correlation coef-ficients exceeding 0.95 at all measures. Also, Correlation coefficients between error scores and average scores for the trapezius and biceps brachii muscles suggested no evidence of systematic error. The trapezius MT and MQ significantly increased, and biceps brachii MT significantly in-creased after exercise (p<0.05). Notably, both A-mode and B-mode exhibited the same tendency in these post-exercise changes in muscle. This study suggests that low-cost and low-resolution A-mode US provides measurements of SFT, MT, and MQ similar to more expensive, high-resolution B-mode imaging. A-mode US can serve as an affordable and portable alternative for muscle assessment.

The transition to sustainability requires major behavioural changes. This requires a complete rethinking of ecosystems and their interconnections, reassessing environmental issues, and a behavior change manifesting. Thus, understanding how sustainability Knowledge, Attitudes, and Practices (KAP) change is essential to sustainability as they shape human behaviour. The main aim of this study was to investigate the constructs of sustainability KAP among university and non-university populations. Data were collected using a structured questionnaire of items measured on a five-point Likert scale ranging from 1 (strongly disagree) to 5 (strongly agree). The questionnaire was distributed to diverse participants, ensuring a broad representation of views on sustainability. There are ten sociodemographic variables, 344 respondents in UAE where the female (28.5%) and male (13.7%), (58.1%) participants did not belong to the UAE university and their age fall into the 18-24 years old. The mean scores indicate a positive orientation towards sustainability, with Knowledge (M = 4.2272), Attitudes (M = 4.2650), and Practices (M = 3.8198) all above the midpoint and the UAE university students showed more knowledge, attitude and practices scores ‎than others population. Associations between KAP were significant at a significant level of p &lt; 0.05. This indicates that the next generation will have more environmentally KAP.

Ulcerative colitis is a chronic immune-mediated disease of unclear etiology, affecting people of different ages and significantly reducing the quality of life. Modern methods of therapy are mainly represented by anti-inflammatory drugs and are not aimed at a specific pathogenetic factor. In this study, we investigated the effect of transplantation of sterile stool filtrate from healthy donors on the induction of anti-inflammatory immune mechanisms. It was shown that performing such a procedure in patients with ulcerative colitis caused the appearance of T helper cells in the blood, which reacted to the content of sterile stool filtrates in an antigen-specific manner and produced IL10. At the same time, cells of the same patients before therapy in response to the addition of sterile stool filtrates were less reactive and predominantly produced IL4, indicating its pro-inflammatory skewing. The obtained data demonstrated the effect of an anti-inflammatory shift in the T-helper response after transplantation of sterile stool filtrate, which increased and persisted for at least three months after the procedure.

Distal Sensory Peripheral Neuropathy (DSP) is a common complication in HIV-infected individ-uals, leading to chronic pain and reduced quality of life. Despite antiretroviral therapy (ART), DSP persists, often prompting the use of opioid analgesics, which can paradoxically worsen symptoms through opioid-induced microbial dysbiosis. This study employs the HIV Tg26 mouse model to investigate HIV-DSP development and assess gut microbiome changes in response to chronic morphine treatment and ART using 16s rRNA sequencing. Our results reveal that chronic morphine and ART exacerbate HIV-DSP in Tg26 mice, primarily through mechanical pain path-ways. As the gut microbiome may be involved in chronic pain persistence, microbiome analysis indicated distinct bacterial community changes between WT and Tg26 mice as well as morphine and ART-induced microbial changes in the Tg26 mice. This study reveals the Tg26 mice model to be a relevant system that can help elucidate the pathogenic mechanisms of opioid and ART-induced exacerbation of HIV-associated pain. Our results shed light on the intricate inter-play between HIV infection, ART, opioid use, and the gut microbiome in chronic pain development. They hold implications for understanding the mechanisms underlying HIV-associated pain and microbial dysbiosis, with potential for future research focused on prevention and treatment strategies.

‘Inner mitochondrial membrane peptidase 2 like’ (IMMP2L) is a nuclear encoded mitochondrial peptidase that has been conserved through evolutionary history as has its target enzyme ‘mitochondrial glycerol phosphate dehydrogenase 2’ (GPD2). IMMP2L is known to cleave the mitochondrial transit peptide from GPD2 and another nuclear encoded mitochondrial respiratory related protein cytochrome C1 (CYC1). However, it is not known whether IMMP2L peptidase activates or alters the activity or respiratory related functions of GPD2 or CYC1. Previous investigations found compelling evidence of behavioural change in the Immp2lKD-/- KO mouse and in this study EchoMRI analysis found that many organs of the Immp2lKD-/- KO mouse were smaller and that the KO mouse had significantly less lean mass and overall body weight compared with wildtype littermates (p&lt;0.05). Moreover, all of the organs analysed from the Immp2lKD-/- KO had lower relative levels of mitochondrial reactive oxygen species (mitoROS). The kidneys of the Immp2lKD-/- KO mouse displayed the greatest decrease in mitoROS levels that were over 50% less compared with wildtype litter mates. Mitochondrial respiration was also lower in the kidney of the Immp2lKD-/- KO mouse compared with other tissues when using succinate as the respiratory substrate, whereas respiration was similar to wildtype when glutamate was used as substrate. When glycerol-3-phosphate (G3P) was used as the substrate for Gpd2 we observed ~20% and ~7% respective decreases in respiration in female and male Immp2lKD-/- KO mice over time. Together these findings suggest that the respiratory related functions of mGpd2 and Cyc1 have been compromised to different degrees in different tissues in the Immp2lKD-/- KO mouse. Structural analyses using AlphaFold2-Multimer further predicted that the interaction between Cyc1 and mitochondrial encoded cytochrome b (Cyb) in Complex III had been altered as had the homodimeric structure of the mGpd2 enzyme within the inner mitochondrial membrane of the Immp2lKD-/- KO mouse. mGpd2 functions as an integral component of the glycerol phosphate shuttle (GPS) which positively regulates both mitochondrial respiration and glycolysis. Interestingly, we found that nonmitochondrial respiration (NMR) was also dramatically lowered in the Immp2lKD-/- KO mouse. Primary mouse embryonic fibroblast (MEF) cell lines derived from the Immp2lKD-/- KO mouse displayed a ~27% decrease in total respiration comprised of a ~50% decrease in NMR and a ~12% decrease in total mitochondrial respiration where the latter was consistent with the decreases in substrate specific mitochondrial respiration reported here. This study is the first to report the role of Immp2l in enhancing Gpd2 structure and function, mitochondrial respiration, nonmitochondrial respiration, organ size and homeostasis.

An approach based on the OpenFOAM library has been developed to solve a high-speed, multicomponent mixture of a reacting, compressible flow. This work presents comprehensive validation of the newly developed solver called compressibleCentralReactingFoam with different supersonic flows, including shocks, expansion waves, and turbulence-combustion interaction. The comparisons of the simulation results with experimental and computational data confirm the fidelity of this solver for problems involving multicomponent high-speed reactive flows. The gas dynamics of turbulence-chemistry interaction are modeled using a partially-stirred reactor formulation and provide promising results to better understand the complex physics involved in supersonic combustors. A time-scale analysis based on local Damköhler numbers reveals different regimes of turbulent combustion. In the core of the jet flow, the Damköhler number is relatively high indicating that the reaction time scale is smaller than the turbulent mixing time scale. This means that the combustion is controlled by turbulent mixing. In the shear layer, where the heat release rate and the scalar dissipation rate have the highest value, the flame is stabilized due to finite rate chemistry with small Damköhler numbers and a high fraction of fine structure. This solver allows three-dimensional gas dynamic simulation of high-speed multicomponent reactive flows relevant to practical combustion applications.

Discretization in time and in the state space of the system leads to the necessity to solve the parameter identification problems for dynamic systems in a limited time (at a finite time interval) using observations obtained under the influence of unknown-but-bounded noise. Finding the solution in this case is more difficult compared to traditional identification problem setting which considers random independent zero-mean noise. For system parameter identification problem under unknown-but-bounded noise, a randomized stochastic optimization algorithm is given in the paper, estimates for the mean square values of the residuals for a finite observation interval are obtained. An example of application of the given method to the problem of tuning the parameters of a multi-mirror telescope is considered.

Participating in collaborative scientific research through citizen science, a component of open science holds significance for both citizen scientists and professional researchers. Yet, the ad-vantages for those orchestrating citizen science initiatives are often overlooked. Organizers en-compass a diverse range, including governmental entities, non-governmental organizations, corporations, universities, and institutions like libraries. For libraries, citizen science holds im-portance by fostering heightened civic and research interests, promoting scientific publishing, and contributing to overall scientific progress. This paper aims to provide a comprehensive understanding of the specific ways in which citizen science can benefit libraries and how libraries can effectively utilize citizen science to achieve their goals. The paper is based on a systematic review of peer-reviewed articles that discuss the direct benefits of citizen science on libraries. A list of the main benefits of citizen science for libraries has been compiled from the literature. Additionally, the reasons why it is crucial for libraries to communicate the benefits of citizen science for their operations have been highlighted, particu-larly in terms of encouraging other libraries to actively engage in citizen science projects.

Indigo leaves form various plant species are sources of dyes/pigments, not fully exploited for making sustainable textiles. Blue indigo vat dye extracted from indigo leaves, yields high wash colorfastness but fades slowly with light, and is not easily used for direct printing. Indigo leaves can be used to produce textiles of various color shades, while light resistant Mayan-inspired hybrid pigments have not yet been used for textile coloring. Using blue indigo dyes from 3 plant species, with exhaustion dyeing, intense wash resistant blue colored textiles are produced, and in the case of Indigofera Persicaria tinctoria, textiles have antibacterial activity against S. Epidermis and E. Coli.100% Natural Mayan-inspired blue indigo pigment, made from Sepiolite clay and indigo dye, was used both in powdered and paste forms to perform pigment textile dyeing by pad cure process, and direct screen printing on textiles. A water-based bio-binder (40%) was used efficiently for both padding and printing. Bio-based Na Alginate thickener allowed color fast printing on both polyester and cotton fabrics, while bio-based glycerin allowed good print color fastness on polyester only, yielding prints with excellent color fastness to wash (5/5), to dry and wet rubbing (5/5) and light (7/7).

This project involves the development of Fire Suppression System (FSS) leveraging of Home automation system using Graphical System design (LabVIEW) software and Arduino microcontroller for real-time monitoring and control. The system integrates an Infrared (IR) flame sensor, an MQ2 gas sensor to detect and suppress fire hazards efficiently. The LabVIEW interface facilitates real-time monitoring of sensor data, allowing users to visualize and analyze the environmental conditions. Through this system, fires are automatically subdued, enhancing safety without requiring human intervention. This advances fire safety by swiftly containing threats and minimizing potential damage.

This paper conducts a bibliometric analysis focusing on retail and consumer behavior studies. The research addresses key research questions exploring the landscape and evolution of academic contributions in this domain. Leveraging the Scopus database, the research analyzes a significant corpus of 2,111 documents from 1971 to 2022. The findings reveal a distinct surge in scholarly output, reflecting an escalated interest in understanding consumer behavior, particularly in digital environments, influenced by factors such as sustainability and ethical concerns. The research also identifies leading countries and institutions in document production, highlighting the dominance of the United States, the United Kingdom, India, China, and other leading institutions. The analysis also identifies prolific authors, prevalent research themes, and major publications, emphasizing the evolving demand of retail strategies and consumer behavior research.

Sodium-phosphate-based glass-ceramics (GCs) are promising materials for a wide range of applications, including solid-state sodium-ion batteries, microelectronic packaging substrates, and humidity sensors. This study investigates the impact of 24-hour heat-treatments at varying temperatures on Na-Ge-P glass, with a focus on (micro)structural, electrical, and dielectric properties of prepared GCs. Various techniques such as powder X-ray diffraction (PXRD), infrared spectroscopy-attenuated total reflection (IR-ATR), and scanning electron microscopy-energy dispersive spectroscopy (SEM-EDS) are employed. With the elevation of heat-treatment temperature, crystallinity progressively rises; at 450 °C, the microstructure retains amorphous traits featuring nanometric grains, whereas at 550 °C, heat-treatment results in fully crystallized structures characterized by square-shaped micron-scale grains of NaPO3. The insight into the evaluation of electrical and dielectric properties is provided by Solid-State Impedance Spectroscopy (SS-IS), revealing a strong correlation with the conditions of controlled crystallization and observed (micro)structure. The glass-ceramic heat-treated at 450 °C achieves the highest DC conductivity of 2.30×10–8 Ω–1 cm–1 at 393 K. As the heat-treatment temperature rises, the crystallization of the NaPO3 phase depletes the glass matrix of mobile Na+ ions, resulting in a reduction in DC conductivity. Dielectric parameters also decrease with rising heat-treatment temperature, with the glass-ceramic heat-treated at 550 °C displaying the lowest permittivity of 19.37 and the dielectric loss of 0.008. This research uncovers the intricate relationship between heat-treatment conditions and material properties, emphasizing that controlled crystallization allows for precise modifications to microstructure and phase composition within remaining glassy phase, ultimately facilitating fine-tuning of material properties.

Esters are versatile compounds with a wide range of applications in various industries due to their unique properties and pleasant aromas. Conventionally, the manufacture of these compounds has relied on the chemical route. Nevertheless, this technique employs high temperatures and inorganic catalysts, resulting in undesired additional steps to purify the final product by removing solvent residues, which decreases environmental sustainability and energy efficiency. In accordance with the principles of “Green Chemistry” and the search for more environmentally friendly methods, a new alternative, the enzymatic route, has been introduced. This technique uses low temperatures and does not require the use of solvents, resulting in more environmentally friendly final products. In spite of the large number of studies published on the biocatalytic synthesis of esters, little attention has been paid to the reactors used for it. Therefore, it is convenient to gather the scattered information regarding the type of reactor employed in these synthesis reactions, considering the industrial field in which the process is carried out. The comparison between the performance of the different reactor configurations will allow us to draw the appropriate conclusions regarding their suitability for each specific industrial application.

.Background: Neither radiological phenotypic characteristics nor reconstruction CT scan to study the cranial contour in children with the so called the idiopathic type of West syndrome has been implemented to reach the etiology understanding. Material and Methods: The basic diagnostic measures and the traditional antiepileptic treatments have been applied to these children in accordance with the conventional protocol of investigations and treatment for children with West syndrome. Boys from three unrelated families were given the diagnosis of idiopathic type of West syndrome. Three boys aged 6,7,9 and three parents (age range of 28-41 year) were included in this study. These children and their parents were referred to our orthopedic departments because of variable skeletal deformities. All showed the history of intellectual disabilities, cryptogenic epileptic spasms and fragmented hypsarrhythmia. Recently, variable forms skeletal deformities of flat foot, torticollis and early onset osteoarthritis. We performed detailed clinical and radiological phenotypic characterization of every affected child, siblings and parents. All affected children underwent whole exome sequence analysis Results: The craniofacial phenotype of all children revealed apparent disruption of development of the cranial bones. Palpation of the skull bones showed unusual palpable boney ridges along different sutural locations. A-7-year-old child showed abnormal bulging over the sagittal suture associated with bilateral boney ridges over the sequamosal sutures. Examining his parents, we noticed a similar skull radiographic abnormality in his mother radiographs. A-10-year-old boy showed an extremely narrow frontal area, facial asymmetry and a well palpable ridge over the lambdoid sutures. 3D reconstruction CT scan confirmed the diagnosis of early closure . His mother showed typical radiographic skull phenotype with a history of postadulthood scoliosis. A- 12-year-old boy showed brachycephaly. Investigating his parents revealed a brachycephalic mother with border line intellegence. We affirm that the pattern of inheritance in the three boys was compatible with X-linked recessive pattern of inheritance . Whole exome sequencing showed non definite phenotype/genotype correlation. Conclusion: The aim of this study was fivefold. First, to refute the common usage of the term idiopathic and we affirm that our findings are Novel. Second, it could be possible that West syndrome is a symptom complex rather than a separate diagnostic entity. Third, to further detect the genetic carrier , we explored the connection between the cranial bones in the children with West syndrome with what is seen in parents.. Fourth, the differences in cranial bones abnormalities among every child and another seems to be heterogeneous. Fifth, it seems that the progressive deceleration in the development of this group of children is highly connected to the progressive closure of the cranial sutures.

The prevalent use of synthetic chemical rodenticides (both 1st or 2nd generation anticoagulants and acute rodenticides) is the primary method for managing rodents in sub-Saharan Africa. However, this practice poses substantial health and environmental risks and often fails to yield significant, sustainable reductions in rodent pest populations. In this paper, the second one of a two-part series, we advocate for a more responsible and sustainable approach to rodent management in urban and agricultural settings in sub-Saharan Africa. We propose a shift towards environmentally friendly rodent management strategies, specifically emphasizing the adoption of Ecologically-Based Rodent Management (EBRM) as a viable alternative to synthetic chemical rodenticides. EBRM relies on a comprehensive understanding of pest rodent biology, ecology, and behavior, along with the implementation of a range of community-based interventions. These actions are designed to ensure the consistent reduction of rodent pest populations to economically and hygienically acceptable levels. By embracing EBRM, we not only anticipate a reduction in the social impacts of pest rodents in a cost-effective manner but also a significant decrease in the risks posed by rodents and synthetic chemical rodenticides to human health and the environment. This paradigm shift towards EBRM promises a more sustainable and responsible approach to rodent management in sub-Saharan Africa.