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.

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, 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 Neutrosophic Failed SuperHyperClique theory, SuperHyperGraphs theory, and Neutrosophic SuperHyperGraphs 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 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.

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.

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

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

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

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

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

New setting is introduced to study 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.

Extreme overvalued beliefs (EOB) are rigidly-held, shared beliefs that are the motive behind most acts of terrorism and mass shootings. EOBs are differentiated from delusions and obsessions. The concept of overvalued idea was first described by Wernicke and later applied to terrorism by McHugh. Our group of forensic psychiatrists (Rahman, Resnick, Harry) refined the definition as an aid in the differential diagnosis seen in acts of violence. The form and content of EOBs is discussed as well as group effects, conformity and obedience to authority. Religious cults such as: The People’s Temple, Heaven’s Gate, Aum Shinrikyo, Islamic State (ISIS) and conspiracy beliefs such as assassinations, moon-hoax and vaccine-induced autism beliefs are discussed using this construct. Finally, some concluding thoughts on countering violent extremism, including its online presence is discussed utilizing information learned from online eating disorder and consumer experience.

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.

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

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

We consider an alternative hypothesis of crater formation -- through an electric discharge machining (EDM) of the celestial bodies' surfaces. The source of the energy and the current itself may lie in the plasma infalling on a celestial body (from an extremely strong solar outburst or a nearby supernova). This mechanism may have been even more important than impact cratering in the early Solar System, with potential implications to the history of the dynamics of the System itself and solar activity in particular. In this light, the conclusion that shocked and metamorphosed minerals found within crater sites are evidence of hypervelocity impacts might be reconsidered. There are ambiguities that remain among sources of mineralogical formations. This study is ongoing with details of investigations supporting a new approach to crater formation not yet exhausted. Apart from mineralogical analysis and theoretical considerations regarding the large scale crater formation, we present a description of experimental studies of EDM acting at low pressures. Experimental results are made with crude setups and could easily be replicated on a larger scale with valuable research potential, as there is a well understood relation between the crater size and the energy needed for its production.

Many works have recently identified the need to combine deep learning with extreme learning to strike a performance balance with accuracy especially in the domain of multimedia applications. Considering this new paradigm, namely convolutional extreme learning machine (CELM), we present a systematic review that investigates alternative deep learning architectures that use extreme learning machine (ELM) for a faster training to solve problems based on image analysis. We detail each of the architectures found in the literature, application scenarios, benchmark datasets, main results, advantages, and present the open challenges for CELM. We follow a well structured methodology and establish relevant research questions that guide our findings. We hope that the observation and classification of such works can leverage the CELM research area providing a good starting point to cope with some of the current problems in the image-based computer vision analysis.

Soybean with insignificant differences in appearance have large differences in their internal physical and chemical components, therefore follow-up storage, transportation and processing require targeted differential treatment. A fast and effective machine learning method based on hyperspectral data of soybean for pattern recognition of categories is designed as a non-destructive testing method in this paper. A hyperspectral-image dataset with 2299 soybean seeds in 4 categories is collected; Ten features is selected by extreme gradient boosting algorithm from 203 hyperspectral bands in range 400 to 1000 nm; A Gaussian radial basis kernel function support vector machine with optimization by the Tree-structured Parzen Estimator algorithm is built as TPE-RBF-SVM model for pattern recognition of soybean categories. The metrics of TPE-RBF-SVM are significantly improved compared with other machine learning algorithms. The accuracy is 0.9165 in the independent test dataset which is 9.786% higher for vanilla RBF-SVM model and 10.02% higher than the extreme gradient boosting model.

On review of neuroscience literature extreme capsule considered as a whiter matter tract. Nevertheless it is not clear that extreme capsule itself is a association fiber pathway or is o bottleneck for passing other association fiber. By a systematic search with investigating anatomical position, dissection, connectivity and cognitive role of extreme capsule it can be argued that extreme capsule probably is a bottleneck for passing uncinated fasciculus (UF) and inferior fronto – occipital fasciculus(IFOF), And its different role of language processing is duo to different tract that passing it.

Reconstruction of fine-scale information from sparse data is often needed in practical fluid dynamics where the sensors are typically sparse and yet, one may need to learn the underlying flow structures or inform predictions through assimilation into data-driven models. Given that sparse reconstruction is inherently an ill-posed problem, the most successful approaches encode the physics into an underlying sparse basis space that spans the manifold to generate well-posedness. To achieve this, one commonly uses generic orthogonal Fourier basis or data specific proper orthogonal decomposition (POD) basis to reconstruct from sparse sensor information at chosen locations. Such a reconstruction problem is well-posed as long as the sensor locations are incoherent and can sample the key physical mechanisms. The resulting inverse problem is easily solved using $l_2$ minimization or if necessary, sparsity promoting $l_1$ minimization. Given the proliferation of machine learning and the need for robust reconstruction frameworks in the face of dynamically evolving flows, we explore in this study the suitability of non-orthogonal basis obtained from Extreme Learning Machine (ELM) auto-encoders for sparse reconstruction. In particular, we assess the interplay between sensor quantity and sensor placement for a given system dimension for accurate reconstruction of canonical fluid flows in comparison to POD-based reconstruction.

Power disaggregation aims at determining the appliance-by-appliance electricity consumption leveraging upon a single meter only, which measures the entire power demand. Data-driven procedures based on Factorial Hidden Markov Models have been proven remarkable results on energy disaggregation. Nevertheless, those procedures have various weaknesses: there is a scalability problem as the number of devices to observe raises and the algorithmic complexity of the inference step is severe. DNN architectures, such as Convolutional Neural Networks, have demonstrated to be a viable solution to deal with FHMMs shortcomings. Nonetheless, there are two significant limitations: a complicated and time-consuming training system based on back-propagation has to be employed to estimates the neural architecture parameters, and large amounts of training data covering as many operation conditions as possible need to be collected to attain top performances. In this work, we aim to overcome those limitations by leveraging upon the unique and useful characteristics of the extreme learning machine technique, which is based on a collection of randomly chosen hidden units and analytically defined output weights. Experiment evaluation has been conducted using the UK-DALE corpus. We find that the suggested approach achieves similar performances to recently proposed ANN-based methods and outperforms FHMMs. Besides, our solution generalises well to unseen houses.

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.

Coastal marine ecosystems worldwide, like Florida Bay, are increasingly affected by tide alteration and anthropogenic disturbances which affect water quality imbalance leading to algal blooms. Increased bloom persistence is a serious threat due to the long-lasting impact on processes like carbon cycle and services like species presence. However, exploring eco-environmental feedback patterns of algal blooms remains challenging and poorly investigated, also due to the paucity of data. Florida Bay, taken as an epitome, has long experienced algal blooms in its central and western regions, and in 2006 an unprecedented bloom occurred in the eastern habitats. We analyzed the occurrence of blooms from three perspectives: (1) the spatial spreading networks of chlorophyll-a (CHLa) that pinpoints source and unbalanced habitats; (2) the fluctuations of water quality factors pre- and post-bloom outbreaks to in assess environmental impacts of ecological dysbiosis and target prevention and control of algal of blooms; and (3) the biogeochemical-spreading network topological co-evolution to quantify ecosystemic stability and ecological shift likelihood in long-term. Here, we propose Transfer Entropy (TE) to quantify dynamical interactions between spatial areas and biogeochemical factors (ecosystem connectome) underpinning bloom emergence and spreading, as well as environmental effects; the Pareto principle is defined for identifying the salient eco-environmental interactions of CHLa. We quantified the spatial dynamics of algal blooms, and thus obtained areas in need for ecological monitoring and potential bloom control. Results show that algal blooms are increasingly persistent over space with long-term negative effects on water quality factor. A dichotomy is reported between spatial ecological corridors of spreading and biogeochemical networks as well as divergence from the optimal eco-organization: randomization of the former due to nutrients' overload and temperature increase leads to scale-free CHLa spreading and extreme outbreaks a posteriori. Subsequently this increases bloom persistence, turbidity and salinity with potentially strong ecological effects on highly biodiverse and vulnerable areas such as tidal flats and marshes. Algal blooms are important ecosystem regulators of nutrient cycles; however, beyond limit chlorophyll-a outbreaks cause aquatic species mortality due to their effect on water turbidity, nutrient balance (nitrogen and phosphorus in particular), salinity and temperature. Beyond compromising local environmental quality, socio-ecological services are also compromised at large scales, yet ecological assessment models like the one presented are in need of application in subtropical and tropical bays worldwide.

Micro turbojets are used for propelling radio-controlled aircraft, aerial targets and personal air vehicles. When compared to full-scale engines, they are characterized by relatively low efficiency and durability. In this context, the degraded performance of gas path components could lead to an unacceptable reduction in the overall engine performance. In this work, a data-driven model based on a conventional Artificial Neural Network (ANN) and an extreme learning machine (ELM) was used for estimating the performance degradation of the micro turbojet. The training datasets containing the performance data of the engine with degraded components were generated using the validated GSP model and the Monte Carlo approach. In particular, compressor and turbine performance degradation were simulated for three different flight regimes. It was confirmed that component degradation had a similar impact in flight than at sea level. Finally, the datasets were used in the training and testing process of the ELM algorithm with four different input vectors. Two vectors had an extensive number of virtual sensors, and the other two were reduced to just fuel flow and Exhaust Gas Temperature. Even with the small number of sensors, the high prediction accuracy of ELM was maintained for takeoff and cruise but was slightly worse for variable flight conditions.

We develop the process of discounting when underlying rates follow a jump-diffusion process, that is, when, in addition of diffusive behavior, rates suffer a series of finite discontinuities located at random Poissonian times. Jump amplitudes are also random and governed by an arbitrary density. Such a model may describe the economic evolution specially when extreme situations occur (pandemics, global wars, etc.). When between jumps the dynamical evolution is governed by an Ornstein-Uhlenbeck diffusion process, we obtain exact and explicit expressions for the discount function and the long-run discount rate and show that the presence of discontinuities may drastically reduce the discount rate, a fact that has significant consequences for environmental planning. We also discuss as a specific example the case when rates are described by the continous time random walk.

We report cross-shore profile evolution at Palanga, eastern Baltic Sea where short period waves dominate. Cross-shore profile studies began directly after a significant coastal erosion caused by storm “Anatoly” in December of 1999 and continued for a year. Further measurements were undertaken sixteen years later. Cross-shore profile ∆V(x) changes were described, and cross-shore transport rates Q(x) were calculated. A K-means clustering technique was applied to determine sections of the profile with the same development tendencies. Profile evolution was strongly influenced by the depth of closure which is constrained by a moraine layer and the presence of a groyne. The method used divided the profile into four clusters: the 1st cluster in the deepest water represents profile evolution limited by the depth of closure, and the 2nd and 3rd mostly are affected by processes induced by wind, wave and sea-water level changes. The most intensive sediment volume changes were observed directly after the coastal erosion. The largest sand accumulation was in the 4th profile cluster, which includes the upper beach and dunes. Seaward extension of the dune system caused a narrowing of the visible beach which has led to an increased sand volume (accretion) being misinterpreted as erosion

We evaluate the complexity of Colombian climate from extreme behavior of gauge temperature and precipitation, using the the novel Tsallis' non-extensive entropy principle based on physical information through the q-index. We find the spatial structure of non additive universal categories (q-index) and compare with some complex systems with the potential to have some degree of dynamical affinity. Our results evidence the great dynamical variability of regional climate expressed in the large range of values of $q$-index, and the high degree of non-extensitivity for both temperature and precipitation.

UAV photogrammetry development during the last decade has allowed to catch information at a very high spatial and temporal resolution from terrains with very difficult or impossible human access. This paper deals with the application of these techniques to study and produce information of very extreme topography which is useful to plan works on this terrain or monitoring it over the time to study its evolution. The methodology stars with the execution of UAV flights on the cut slope studied, one with the cam vertically oriented and other at 45º respect that orientation. Ground control points (GCPs) and check points (CPs) were measured for georeference and accuracy measurement purposes. Orthophoto was obtained projecting on a fitted plane to a studied surface. Moreover, since a digital surface model (DSM) is not able to represent faithfully that extreme morphology, information to project works or monitoring it has been derived from the point cloud generated during the photogrammetric process. An informatics program was developed to generate contour lines and cross sections derived from the point cloud, which was able to represent all terrain geometric characteristics, like several Z coordinates for a given planimetric (X, Y) point. Results yield a root mean square error (RMSE) in X, Y and Z directions of 0.053 m, 0.070 m and 0.061 m respectively. Furthermore, comparison between contour lines and cross sections generated from point cloud with the developed program on one hand and those generated from DSM on other hand, shown that the former are capable of representing terrain geometric characteristics that the latter cannot. The methodology proposed in this work has been shown as an adequate alternative to generate manageable information, as orthophoto, contour lines and cross sections, useful for the elaboration, for example, of projects for repairing or maintenance works of cut slopes with extreme topography.

A portable laser photoacoustic sensor based on a Field-Programmable Gate Array (FPGA) is reported for methane detection. A tunable DFB diode laser in the 1654 nm wavelength range is used as an excitation source. The photoacoustic signal processing was implemented by a FPGA device. A small resonant photoacoustic cell is designed. The minimum detection limit (1σ) of 10 ppm for methane (CH₄) is demonstrated.

The point cloud is a form of three-dimensional data that comprises various detailed features at multiple scales. Due to this characteristic and its irregularity, point cloud analysis based on deep learning is challenging. While previous works utilize the sampling-grouping operation of PointNet++ for feature description and then explore geometry by means of sophisticated feature extractors or deep networks, such operations fail to describe multi-scale features effectively. Additionally, these techniques have led to performance saturation. And it is difficult for standard MLPs to directly "mine" point cloud. To address above problems, we propose the Detail Activation (DA) module, which encodes data based on Fourier transform after sampling and grouping. We activate the channels at different frequency levels from low to high in the DA module to gradually recover finer point cloud details. As training progresses, the proposed Point-MDA can uncover local and global geometries of point cloud progressively. Our experiments show that Point-MDA achieves superior classification accuracy, outperforming PointNet++ by 3.3% and 7.9% in terms of overall accuracy on the ModelNet40 and ScanObjectNN dataset, respectively. Furthermore, it accomplishes this without employing complicated operations, while exploring the full potential of PointNet++.

Background and objectives: In the current context, the 2021 presidential elections in Peru distance from the social objective, not being objectively represented, that is why we analyze their validity, we determine the distances between the parties if they are extreme, the correspondences with the departments and their prospects, in the surveys we propose which departments influence the results. Methods: We use a mixed methodology, qualitative analysis, it will be multidimensional with the support of statistical methods and programs such as R Studio, worddj, Gephi, and Iramuteq. The quantitative analysis will be through factor analysis, correspondence and discriminant analysis to the data of the election Results and conclusions: The textual analysis mentions that there are dimensions such as the social issue, the results of the surveys and democracy that are far apart, regarding the electoral issue. This inculcates to work both on the part of the organisms that carry out these processes, as well as the initiative of the candidates, and the media. Regarding the quantitative analysis, it is detailed that the representative parties must be greater than 4.0 million voters, to make representative parties at the national level. The classification regarding the percentage of votes is given in three groups, highlighting the independence of the Peru Libre political party in these . In the correspondence analysis we can detail that both Fuerza Popular and Peru Libre are extremist parties. The vast majority of Peruvian citizens have an ideological tendency, intermediate between both parties. The prospective projections with a cross section give a victory to the Peru Libre party. In the discriminant analysis, the sample for the surveys focuses on 7 departments that does not include the Peruvian capital.

This work can be considered as a first step of designing a future competitive data-driven approach for remaining useful life prediction of aircraft engines. The proposed approach is an ensemble of serially connected extreme learning machines. The results of prediction of the first networks are scaled and fed to the next networks as an additive features to the original inputs. This feature mapping allows increasing the correlation of training inputs with their targets by holding new prior knowledge about the probable behavior of the target function. The proposed approach is evaluated under remaining useful estimation using a set of “time-varying” data retrieved from the public dataset C-MAPSS (Commercial Modular Aero Propulsion System Simulation) provided by NASA. The prediction performances are compared to basic extreme learning machine and proved the effectiveness of the proposed methodology.

In this study, we evaluated chlorophyll fluorescence (CF) under two extreme illumination conditions at plant scale with a passive spectroradiometer. Fluorescence (F) was estimated by reading directly from radiance spectra of a variety of plants illuminated with light-emitting diode (LED) grow lights in the laboratory. Solar-induced fluorescence (SIF) was estimated from spectral measurements of the same plants under sunlight using the Fraunhofer Line Depth (FLD) method. Chlorophyll fluorescence yield (F_yield) and solar-induced fluorescence yield (SIF_yield) were calculated by normalizing F and SIF with absorbed photosynthetically active radiation (APAR). Two approaches to estimating APAR were compared: utilizing white reference spectra and reflected spectra versus white reference spectra combined with the fraction of absorbed photosynthetically active radiation (fPAR) derived from literature. Average F and SIF were different by a factor of approximately twenty-four (F = 0.110 ± 0.038 Wm⁻²μm⁻¹sr⁻¹ versus SIF = 2.60 ± 1.87 Wm⁻²μm⁻¹sr⁻¹). In contrast, the average normalized values F_yield and SIF_yield were within the margin of error of one another (F_yield = 0.022 ± 0.008 μm⁻¹sr⁻¹ and SIF_yield = 0.030 ± 0.020 μm⁻¹sr⁻¹). This study highlights the influence of APAR on CF and the importance of properly accounting for it when estimating yield and demonstrates the ability of two simple and portable experimental setups with a passive instrument to obtain fluorescence metrics.

This paper presents an analysis of future precipitation patterns over the Lake Victoria Basin using bias-corrected CMIP6 model projections. A mean increase of about 5% in mean annual (ANN) and seasonal [March-May (MAM), June-August (JJA), and October-December (OND)] precipitation climatology is expected over the domain by mid-century (2040-2069). The changes intensify towards the end of the century (2070-2099) with an increase in mean precipitation of about 16% (ANN), 10% (MAM), and 18% (OND) expected, relative to the 1985-2014 baseline period. Additionally, the mean daily precipitation intensity (SDII), the maximum 5-day precipitation values (RX5Day), and the heavy precipitation events, represented by the width of the right tail distribution of precipitation (99p-90p) show an increase of 16%, 29%, and 47%, respectively, by the end of the century. The projected changes have a substantial implication for the region - which is already experiencing conflicts over water and water-related resources.

The primary purpose of the study was the determination of the spatial day-to-day variability of extreme temperatures in Poland and the dependency of large temperature changes on atmospheric circulation in accordance with the Grosswetterlagen (GWL) classification. The goal was implemented based on data from 1966 to 2015, made available by the Institute of Meteorology and Water Management – National Research Institute. Day-to-day changes in maximum and minimum temperatures were designated with a rate of ≥ 6 °C (large) and with a rate of ≥ 12 °C (very large) and their spatial distribution was presented. Finally, the analysis of the dependency of considerable temperature changes on atmospheric circulation in accordance with the Grosswetterlagen (GWL) classification was conducted. The obtained results showed that in Poland in the period 1966-2015 the number of large changes in both Tmax and Tmin slightly increased, although the fluctuations show spatial variability. Large changes in Tmax occur more frequently in spring, and in Tmin in winter. Large changes in Tmax and Tmin are mainly recorded during cyclonic circulation, however, the anticyclonic circulation types favour especially large decreases in Tmin.

Construction of Pontoons is based on multiple elements, dimensions and weight. The study has addressed about how the industry of the floating reinforcement concrete precast (pontoons) installs in the factory with the combinations of utility, electricity services, and Internet service. The pontoon bridges are successfully installed in the road for transport or sea for shops. The installation process for pontoons is successfully attempted in a balanced situation above surface of the sea to the resistant of floating precast (pontoons) to any ambient effects such as weather conditions, the movement of the waves or any others effects. The findings elaborate that it is not just a military solution. Pontoon installation can significantly serve for civil purposes.

Advancements in Machine Learning techniques, availability of more data-sets, and increased computing power have enabled a significant growth in a number research areas. Predicting, detecting and classifying complex events in earth systems which by nature are difficult to model is one of such areas. In this work, we investigate the application of different machine learning techniques for detecting and identifying extreme rainfall events in a sub-catchment within Pangani River Basin, found in Northern Tanzania. Identification and prediction of extreme rainfall event is a preliminary crucial task towards success in predicting rainfall-induced river floods. To identify a rain condition in the selected sub-catchment, we use data from five weather stations which have been labeled for the whole sub-catchment. In order to assess which Machine Learning technique suits better for rainfall identification, we apply five different algorithms in a historical dataset for the period of 1979 to 2014. We evaluate the performance of the models in terms of precision and recall, reporting Random Forest and XGBoost as the ones with best overall performance. However, since the class distribution is imbalanced, the generic Multi-layer Perceptron performs best when identifying the heavy rainfall events, which are eventually the main cause of rainfall-induced river floods in the Pangani River Basin

In this work, we explore the extreme searching of multidimensional functions by natural gradient descent based on Dirichlet and generalized Dirichlet distributions. The natural gradient is based on describing multidimensional surface with probability distributions, which allows us to reduce changing the accuracy of gradient and step-size. In this article, we propose an algorithm of natural gradient descent based on Dirichlet and generalized Dirichlet distributions. We demonstrate that the natural gradient descent with step-size adaptation with Dirichlet and generalized Dirichlet distributions has higher accuracy and does not take a large number of iterations for minimizing test functions than gradient descent and Adam.

The aim of the study is to assess the loads that are transferred from the main rotor and the tail rotor to the helicopter fuselage. These loads change in the various phases of the transient flight as a result of the variable control of the maneuver and as a result of the variable flow around the blades. The knowledge of the loads allows for the proper selection of the level of excitations that should load the fuselage structure during fatigue and strength tests. The simulation model describing the helicopter flight is discussed. This model takes into account the motion of each blade relative to its hinges. Results are shown for two maneuvers - pullup/pushover and diving. The values of extreme loads transferred to the fuselage were obtained.

The paper deals with the Compound Inverse Rayleigh distribution, shown to constitute a proper model for the characterization of the probability distribution of extreme values of wind-speed, a topic which is gaining growing interest in the field of renewable generation assessment, both in view of wind power production evaluation and the wind-tower mechanical reliability and safety. The first part of the paper illustrates such model starting from its origin as a generalization of the Inverse Rayleigh model - already proven to be a valid model for extreme wind-speeds - by means of a continuous mixture generated by a Gamma distribution on the scale parameter, which gives rise to its name. Moreover, its validity to interpret different field data is illustrated, also by means of numerous numerical examples based upon real wind speed measurements. Then, a novel Bayes approach for the estimation of such extreme wind-speed model is proposed. The method relies upon the assessment of prior information in a practical way, that should be easily available to system engineers. In practice, the method allows to express one’s prior beliefs both in terms of parameters, as customary, and/or in terms of probabilities. The results of a large set of numerical simulations – using typical values of wind-speed parameters - are reported to illustrate the efficiency and the accuracy of the proposed method. The validity of the approach is also verified in terms of its robustness with respect to significant differences compared to the assumed prior information.

This work focuses on the analysis of the performance of satellite-based precipitation products for monitoring extreme rainfall events. Five precipitation products are inter-compared and evaluated in capturing indices of extreme rainfall events during 1998-2019 considering four indices of extreme rainfall. Satellite products show a variable performance, which in general indicates that the occurrence and amount of rainfall of extreme events can be both underestimated or overestimated by the datasets in a systematic way throughout the country. Also, products that consider the use of ground truth data have the best performance.

Calculating hydrocarbon components solubility of natural gases is known as one of the important issues for operational works in petroleum and chemical engineering. In this work, a novel solubility estimation tool has been proposed for hydrocarbon gases including methane, ethane, propane and butane in aqueous electrolyte solutions based on extreme learning machine (ELM) algorithm. Comparing the ELM outputs with a comprehensive real databank which has 1175 solubility points concluded to R-squared values of 0.985 and 0.987 for training and testing phases respectively. Furthermore, the visual comparison of estimated and actual hydrocarbon solubility leaded to confirm the ability of proposed solubility model. Additionally, sensitivity analysis has been employed on the input variables of model to identify their impacts on hydrocarbon solubility. Such a comprehensive and reliable study can help engineers and scientists to successfully determine the important thermodynamic properties which are key factors in optimizing and designing different industrial units such as refineries and petrochemical plants.

Having sustained, over the course of more than two decades, record-breaking natural catastrophe losses, American insurers and reinsurers are justifiably questioning the potential linkage between anthropogenic climate change and extreme weather. Here, we explore issues pertaining to this linkage, looking at both the likely short-term implications for the insurance industry, as well as potential longer-term impacts on financial performance and corporate resilience. We begin our discussion with an overview of the implications that climate change is likely to have on the industry, especially as it relates to how catastrophic risks are construed, assessed, and managed. We then present the rudiments of an econometric analysis that explores the financial resilience of the property/casualty (P/C) industry in the face of both natural and man-made catastrophes. In this analysis, we explore the profitability consequences of several illustrative scenarios involving large-scale losses from extreme weather—specifically, a sequence of storms like those striking the U.S. in 2004—and a scenario that explores the prospect of a Katrina-scale storm in combination with a mass terror attack on the scale of 9/11. At systemic levels of aggregation, our analysis suggests a high degree of macro-resilience for the insurance industry. Moreover, we find that insurer resilience is higher for larger impacts, considering both the speed of recovery, as well as the inverse of the area under the unaffected system profile. We conclude with a summary of our findings and a closing commentary that explores the potential implications of these results for P/C insurers moving forward.

In a complex working environment, the fault signal of the gearbox is greatly affected by the outside world, and fault feature recognition is difficult, so the fault diagnosis accuracy is difficult to meet the expected requirements. To solve this problem, this paper proposes a gearbox fault diagnosis method based on an optimized stacked denoising auto encoder (SDAE) and kernel extreme learning machine (KELM). Firstly, the Particle Swarm Optimization algorithm in Adaptive Weight (SAPSO) was adopted to optimize the SDAE network structure, and the number of hidden layer nodes, learning rate, noise addition ratio and iteration times were adaptively obtained to make SDAE obtain the best network structure. Then, the best SDAE network structure was used to extract the deep feature information of weak faults in the original signal. Finally, the extracted fault features are fed into KELM for fault classification. Experimental results show that, compared with existing commonly used methods of fault diagnosis, the fault diagnosis model proposed in this paper can reduce the influence of noise in the original signal can better learn the deep-level features in the original signal and has higher diagnosis accuracy, faster diagnosis speed and good generalization in fault diagnosis.

With the aim to improve cladding coating quality and prevent cracking, this paper established an extreme high-speed laser cladding thermo-mechanical coupling simulation model to study the evolution of the temperature field and residual stress distribution. Process parameters that impacted the macroscopic morphology of single-pass coatings were investigated. Numerical calculations and temperature field simulations were performed based on the process parameter data to validate the effect of the temperature gradient and cooling rate on the coating structure and the residual stress distribution. The results showed that a good coating quality could be achieved using a laser power of 2400 W, a cladding rate of 20 m/min, and a powder feeding rate of 20.32 g/min. The coatings’ cross-sectional morphology corresponded well with the temperature distribution predicted by numerical modeling of the melt pool. The microstructure of the molten coatings is affected by the temperature gradient and cooling rate, which vary greatly from the bottom to the middle to the top. Maximum residual stress appears between the bonding region of the coatings and the substrate, and the coatings themselves have significant residual stress in the form of tensile strains that are mostly distributed in the direction of the laser cladding speed.

Mountain systems within the Mediterranean region, e.g. the Pyrenees, are very sensitive to climate change. In the present study, we quantified the magnitude of extreme precipitation events and the number of days with torrential precipitation (daily precipitation ≥ 100 mm) in all the rain gauges available in the Pyrenees for the 1981-2015 period, analyzing the contribution of the synoptic scale in this type of events. The easternmost (under the Mediterranean influence) and north-westernmost (under Atlantic influence) areas of the Pyrenees registered the highest number of torrential events. The heaviest events are expected in the eastern part, i.e. 400 mm day-1 for a return period of 200 years. Northerly advections over the Iberian Peninsula, which present a low zonal index, i.e. im-plying a stronger meridional component, give rise to torrential events over the western Pyrenees; and easterly advections favour extreme precipitation over the eastern Pyrenees. The air mass travels a long way, from the east coast of North America, bringing heavy rainfall to the western Pyrenees. In the case of the torrential events over the eastern Pyrenees, the air mass causing the events in these areas is very short and originates in the Mediterranean Basin. The NAO index has no influence upon the occurrence of torrential events in the Pyrenees, but these events are closely related to certain Mediterranean teleconnections such as the WeMO

This study examines the improvement in coupled intercomparison project phase six (CMIP6) models against the predecessor CMIP5 in simulating mean and extreme precipitation over the East Africa region. The study compares the climatology of the precipitation indices simulated by the CMIP models with the CHIRPS dataset using robust statistical techniques for 1981 – 2005. The results display the varying performance of the general circulation models (GCMs) in the simulation of annual and seasonal precipitation climatology over the study domain. CMIP6-MME shows improved performance in the local annual mean cycle simulation with a better representation of two peaks, especially the MAM rainfall relative to its predecessor. Moreover, simulation of extreme indices is well captured in CMIP6 models relative to its predecessor. The CMIP6-MME performed better than the CMIP5-MME with lesser biases in simulating SDII, CDD, and R20mm over East Africa. Remarkably, most CMIP6 models are unable to simulate extremely wet days (R95p). A few CMIP6 models (e.g., NorESM2-MM and CNRM-CM6-1) depicts robust performance in reproducing the observed indices across all analyses. Conversely, OND season shows the overestimation of some indices (i.e., R95p, PRCPTOT), except for SDII, CDD, and R20mm. Consistent with other studies, the mean ensemble performance for both CMIP5/6 shows better performance due to the cancellation of some systematic errors in the individual models. Generally, the CMIP6 depicts improved performance in the simulation of MAM season akin CMIP5 models. However, the new model generation is still marred with uncertainty, thereby depicting substandard performance over the East Africa domain. This calls for further investigation of attribution studies into the sources of persistent systematic biases and a prerequisite for identifying individual models with robust features that can accurately simulate observed patterns for future usage.

Abstract: The main contribution of this paper is to introduce a new iterative training algorithm for restricted Boltzmann machines. The proposed learning path is inspired from online sequential extreme learning machine one of extreme learning machine variants which deals with time accumulated sequences of data with fixed or varied sizes. Recursive least squares rules are integrated for weights adaptation to avoid learning rate tuning and local minimum issues. The proposed approach is compared to one of the well known training algorithms for Boltzmann machines named “contrastive divergence”, in term of time, accuracy and algorithmic complexity under the same conditions. Results strongly encourage the new given rules during data reconstruction.

Accurate and efficient traffic incident detection methods can effectively alleviate traffic congestion caused by traffic incidents, prevent secondary accidents and improve the safety of urban road traffic.Aiming at the problems that the traditional machine learning event detection method cannot fully extract the parameter characteristics of traffic flow and is not suitable formulti-dimensional and non-linear massive data, we propose a new traffic event detection method(CNN-XGBoost).This method combines the respective advantages of Convolution Neural Network(CNN) and Extreme Gradation Boosting (XGBoost). Firstly, we preprocessed the original freeway traffic incident detection data set by constructing initial variable set, data normalization, data balance processing and dimension reorganization. Secondly,we use CNN network to automatically extract the deep features of event detection data, and use XGBoost as a classifier to classify the extracted features for expressway traffic event detection.Finally, we use the data set of Hangzhou expressway microwave detector in China to carry out simulation experiments on CNN-XGBoost. The experimental results show that compared with XGBoost, CNN, Support Vector Machine (SVM) and Gradient Boosting Decision Tree (GBDT) and other methods, CNN-XGBoost method can effectively improve the accuracy of expressway traffic event detection and has better generalization ability.

We replace the current industry-standard empirical forecasts of oil production from hydrofractured horizontal wells in shales with a statistically and physically robust, accurate and precise approach, using the Bakken shale as an illustration. The proposed oil production forecasting method extends our previous work on predicting fieldwide gas production in the Barnett shale and merges it with our new scaling of oil production in shales. We first divide the existing 14,678 horizontal oil wells in the Bakken into 12 static samples in which depositional settings and completion technologies are similar. For each sample, we construct a purely data-driven P50 well prototype by merging the GEV distribution fits of oil production from appropriate well cohorts. We fit the parameters of our physics-based scaling curve to the statistical well prototypes, and obtain their smooth extrapolations to 30 years on production. By calculating the number of potential wells of each Bakken region, and scheduling future drilling programs, we stack up the extended well prototypes to achieve the most plausible forecast. We predict that Bakken will ultimately produce 5 billion barrels of oil from the existing wells, with the possible increments of 2 and 6 billion barrels from core and noncore areas.

Estimates of extreme water level return periods in river systems are crucial for hydraulic engineering design and planning. Recorded historical water level data of Taiwan’s rivers are not long enough for traditional frequency analyses when predicting extreme water levels for different return periods. In this study, the integration of a one-dimensional flash flood routing hydrodynamic model with the Monte Carlo simulation was developed to predict extreme water levels in the Danshuei River system of northern Taiwan. The numerical model was calibrated and verified with observed water levels using four typhoon events. The results indicated a reasonable agreement between the model simulation and observation data. Seven parameters, including the astronomical tide and surge height at the mouth of the Danshuei River and the river discharge at five gauge stations, were adopted to calculate the joint probability and generate stochastic scenarios via the Monte Carlo simulation. The validated hydrodynamic model driven by the stochastic scenarios was then used to simulate extreme water levels for further frequency analysis. The design water level was estimated using different probability distributions in the frequency analysis at five stations. The design high-water levels for a 200-year return period at Guandu Bridge, Taipei Bridge, Hsin-Hai Bridge, Da-Zhi Bridge, and Chung-Cheng Bridge were 2.90 m, 5.13 m, 6.38 m, 6.05 m, and 9.94 m, respectively. The estimated design water levels plus the freeboard are proposed and recommended for further engineering design and planning.

In this work, a tailored extreme learning machine (ELM) algorithm to enhance the overall robustness of gas analyzer based on the tunable diode laser absorption spectroscopy (TDLAS) method is presented. The ELM model is tailored through activation function selection, input weight and bias searching, and cross validation method to address the analyzer robustness issues for industrial process analysis field application. The two particular issues are the inaccurate gas concentration measurement caused by the process gas background components variation, and the inaccurate spectra shift calculation caused by spectral interference. By using our algorithm, the concentration error is reduced by one order of magnitude over a much larger stream pressure and component range compared with that obtained by classical least square (CLS) fitting methods based on reference curves. Additionally, it is shown that with our algorithm, the wavelength shift accuracy is improved to less than 1 count over 1000 counts spectra length. In order to test the viability of our algorithm, a trace ethylene (C₂H₄) TDLAS analyzer with coexisting methane was implemented, and its experimental measurements support analyzing robustness enhancement effect.

It was demonstrated during the past decade that ultra-short intense laser pulse tightly focused deep inside a transparent dielectric generates the energy density in excess of several MJ/cm$^3$. Such energy concentration with extremely high heating and quenching rates leads to unusual solid-plasma-solid transformation paths overcoming kinetic barriers to formation of previously unknown high-pressure material phases, which are preserved in the surrounding pristine crystal. These results were obtained with the pulse of Gaussian shape in space and in time. Recently it was shown that the Bessel-shaped pulse could transform much larger amount of a material and allegedly create even higher energy density than that was achieved with the Gaussian (GB) pulses. Here we present a succinct review of previous results and discuss the possible routes for achieving higher energy density employing the Bessel beams (BB) and take advantage of its unique properties.

Given the documented wave-induced damage of elevated coastal decks during extreme natural hazards (e.g. hurricanes) in the last two decades, it is of utmost significance to decipher the wave-structure-interaction of complex deck geometries and quantify the associated loads. Therefore, this study focuses on the assessment of solitary wave impact on open-girder decks that allow the air to escape from the sides. To this end, an arbitrary Lagrangian-Eulerian (ALE) numerical method with a multi-phase compressible formulation is used for the development of three-dimensional hydrodynamic models, which are validated against a large-scale experimental dataset of a coastal deck. Using the validated model as a baseline, a parametric investigation of different deck geometries with a varying number of girders Ng and three different widths, was conducted. The results reveal that the Ng of a superstructure has a complex role and that for small wave heights the horizontal and uplift forces increase with the Ng, while for large waves the opposite happens. If the Ng is small the wave particles accelerate after the initial impact on the offshore girder leading to a more violent slamming on the onshore part of the deck and larger pressures and forces, however, if Ng is large then unsynchronized eddies are formed in each chamber, which dissipate energy and apply out-of-phase pressures that result in multiple but weaker impacts on the deck. The decomposition of the total loads into slamming and quasi-static components, reveals surprisingly consistent trends for all the simulated waves, which facilitates the development of predictive load equations. These new equations, which are a function of Ng and are limited by the ratio of the wavelength to the deck width, provide more accurate predictions than existing empirical methods, and are expected to be useful to both engineers and researchers working towards the development of resilient coastal infrastructure.

Objectives: COVID-19, a respiratory disease caused by SARS-COV2 and transmitted from person-to-person through viral droplets remains a global pandemic. There is a need to understand the transmission modes, populations at risk, and how to mitigate the spread and case fatality in the United States (US) and globally. The current study aimed to assess the global COVID-19 transmission and case fatality, examine similar parameters by countries and determine evidence-based practice in extreme epidemiology response in epidemic curve flattening and case fatality reduction. Methods: A cross-sectional ecologic design was used to assess the preexisting data on confirmed COVID-19 cases and mortality in March 2020 from the CDC, WHO, Worldodomter, and STATISTA. A rapid assessment between March 23^rd and 31^st, 2020, was utilized for the extreme epidemiology response. The case fatality, termed fatality proportion, was examined using mortality in relation to confirmed cases involving the world, United States of America (USA), United Kingdom (UK), Italy, France, Spain, China, Germany, India and South Korea. Results: The COVID-19 is a global pandemic, with the US as the epicenter for transmission, representing 20.9% of all confirmed cases worldwide, while Italy is the epicenter for case fatality, 30.6% of mortality as at 03/31/ 2020. The fatality proportion (FP) in Italy was 11.4%, Spain (8.8%), France (6.8%) and UK (6.4%). Despite the increased number of confirmed cases, the lowest FP was observed in Germany (0.96%) and South Korea (1.66%). There is increasing linear tends in transmission in the US, R²=0.97 as well as positive daily percentage change, ranging from 1.27% to 20.5%. Conclusions: The USA remains the epicenter for COVID-19 transmission, while Italy is the epicenter for case fatality. The observed relatively low case fatality in Germany and South Korea is due to an “extreme epidemiology” response through the application of Wuhan, China’s early data on COVID-19 transmission control measures and optimized patient care. These data are suggestive of relaxing the clinical guidelines in the United States in COVID-19 testing, application of contact tracing and testing, case isolation and most importantly enhancing resources for case management and social and physical distancing globally, hence epidemic curve flattening and case fatality reduction.

It is difficult to capture the real-time online measurement data for biochemical oxygen demand (BOD) in wastewater treatment processes. An optimized extreme learning machine (ELM) based on an improved cuckoo search algorithm (ICS) is proposed in this paper for the design of soft BOD measurement model. In ICS-ELM, the input weights matrices of the extreme learning machine (ELM) and the threshold of the hidden layer are encoded as the cuckoo's nest locations. The best input weights matrices and threshold are obtained by using the strong global search ability of improved cuckoo search (ICS) algorithm. The optimal results can be used to improve the precision of forecasting based on less number of neurons of the hidden layer in ELM. Simulation results show that the soft sensor model has good real-time performance, high prediction accuracy and stronger generalization performance for BOD measurement of the effluent quality compared to other modeling methods such as back propagation (BP) network in most cases.

：An effective technology for predicting the end-point phosphorous content of basic oxygen furnace (BOF) can provide theoretical instruction to improve the quality of steel via controlling the hardness and toughness. Given the slightly inadequate prediction accuracy in the existing prediction model, a novel hybrid method was suggested to more accurately predict the end-point phosphorus content by integrating an enhanced sparrow search algorithm (ESSA) and a multi-strategy with a deep extreme learning machine (DELM) as ESSA-DELM in this study. To begin with, the input weights and hidden biases of DELM were randomly selected, resulting in that DELM inevitably had a set of non-optimal or unnecessary weights and biases. Therefore, the ESSA was used to optimize the DELM in this work. For the ESSA, the Trigonometric substitution mechanism and Cauchy mutation were introduced to avoid trapping in local optima and improve the global exploration capacity in SSA. Finally, to evaluate the prediction efficiency of ESSSA-DELM, the proposed model was tested on process data of the converter from the Baogang steel plant. The efficacy of ESSA-DELM was more superior to that of other DELM-based hybrid prediction models and conventional models. The result demonstrated that the hit rate of end-point phosphorus content within ±0.003%, ±0.002%, and ±0.001% was 91.67%, 83.33%, and 63.55%, respectively. The proposed ESSA-DELM model could possess better prediction accuracy compared with other models, which could guide field operations.

The US pacific northwest recorded its highest temperature in late June 2021. The three-day stretch of scorching heat had a devastating effect on not only the residents of the state, but also on the crops thus impacting the food supply-chain. It is forecasted that streaks of 100-degree temperatures will become common. Farmers will have to adapt to the changing landscape to preserve their crop yield and profitability. A research collaborative consisting of researchers and academicians in Eastern Washington led by a pioneering startup has setup a 16.9-acre Honeycrisp Apple Smart Orchard in Grandview, WA as a laboratory to study the environmental and plant growth factors in real-time using modern computational tools and techniques like IoT (Internet of Things), Edge and Cloud Computing, and Drone and LiDAR (Light Detection and Ranging) imaging. The computational analysis is used to develop guidelines for precision agriculture for orchard blocks to address plant growth issues scientifically and in a timely fashion. The analysis also helps in creating risk-mitigation strategies for severe weather events while helping prepare farmers to maximize crop yield and profitability per acre. I was fortunate to gain access to the terabytes of farm data related to the weather, soil, water, tree, and canopy health, to analyze and formulate recommendations for the farmers that can be adopted nationwide for different crops and weather conditions. This paper discusses the different streams of farm data that were analyzed (ex. soil moisture, soil water potential, and sap flow) and the development of the framework to use data to convert insights into actionable steps. For example, the use of sensors can inform a farmer that their level of soil water potential is below threshold in a specific patch of the orchard, prompting them to turn on irrigation for the patch instead of the whole orchard. I estimate that using an IoT-sensor-based decision framework discussed in this paper, growers can save up to 55% of their water costs for the season. Using these insights, farmers can better manage their irrigation resources and labor, thus maximizing their crop yield and profits.

Computing in the cloud-edge continuum, as opposed to cloud computing, relies on high performance processing on the extreme edge of the IoT hierarchy. Hardware acceleration is a mandatory solution to achieve the performance requirements, yet it can be tightly tied to particular computation kernels, even within the same application. Vector-oriented hardware acceleration has gained renewed interest to support AI applications like convolutional networks or classification algorithms. We present a comprehensive investigation of the performance and power efficiency achievable by configurable vector acceleration subsystems, obtaining evidence of both the high potential of the proposed microarchitecture and the advantage of hardware customization in total transparency to the software program.

Exome sequencing has been commonly used in rare diseases by selecting multiplex families or singletons with an extreme phenotype (EP) to search for rare variants in coding regions. The EP strategy covers both extreme ends of a disease spectrum and it has been also used to investigate the contribution of rare variants to heritability in complex clinical traits. We have conducted a systematic review to find evidence supporting the use of EP strategies to search for rare variants in genetic studies of complex diseases, to highlight the contribution of rare variation to the genetic structure of multiallelic conditions. After performing the quality assessment of the retrieved records, we selected 19 genetic studies considering EP to demonstrate genetic association. All the studies successfully identified several rare variants, de novo mutations and many novel candidate genes were also identified by selecting an EP. There is enough evidence to support that the EP approach in patients with an early onset of the disease can contribute to the identification of rare variants in candidate genes or pathways involved in complex diseases. EP patients may contribute to a better understanding of the underlying genetic architecture of common heterogeneous disorders such as tinnitus or age-related hearing loss.

This study measures the communication ability of wineries in two extreme territories of Southern Italy, Mount Etna and the island of Pantelleria. The evaluation of four dimensions of web communication was carried out by the AGIL Scheme (i.e. adaptation, goal-attainment, integration, latent pattern maintenance). The study provides a generalizable model to be applied in other similar studies. Also, focus groups of experts were carried out. The method proved to be suitable to measure the communication effectiveness of wineries through websites. Extreme territories may add value to the wine, regardless of the brand. The heroic wines may become the symbol of these territories helping environmental safeguard and contrasting territory abandonment by rural communities. The findings highlight that effective communication of heroic viticulture may be used to reposition these wines and increase their competitive advantage in foreign markets. The study generates new ideas for reflection on new types of web communication.

Sickle cell disease (SCD) is a blood disorder caused by a point mutation on the beta globin gene resulting in the synthesis of abnormal hemoglobin. Fetal hemoglobin (HbF) reduces disease severity, but the levels vary from one individual to another. Most research has focused on common variants which differ across populations and hence do not fully account for HbF variation. To investigate rare and common variants influencing HbF levels in SCD, we performed targeted next generation sequencing covering exonic and other significant fetal hemoglobin-associated loci, including BCL11A, MYB, HOXA9, HBB, HBG1, HBG2, CHD4, KLF1, MBD3, ZBTB7A and PGLYRP1. Results revealed a range of functionally relevant genetic variants. Notably, there were significantly more deletions in individuals with high HbF levels (11% vs 0.9%). We identified frameshift deletion in individuals with high HbF levels and frameshift insertions in individuals with low HbF. CHD4 and MBD3 genes, interacting in the same sub-network, were identified to have a significant number of pathogenic or non-synonymous mutations in individuals with low HbF levels, suggesting an important role of epigenetic pathways in the regulation of HbF synthesis. This study provides new insights in selecting essential variants associated with extreme HbF levels in SCD.

The Hunga Tonga-Hunga Ha’apai underwater volcano (20.57°S, 175.38°W) violently erupted on 15 January 2022. The volcanic plume evolution during its initial stages is delineated by using Constellation Observing System for Meteorology, Ionosphere, and Climate (COSMIC)-2 radio occultation (RO) measurements. The bending angle (BA) anomaly over the Tonga volcanic plume (within 200 km from the eruption center) at 5:17 UTC on 15 January shows a prominent peak at higher stratospheric heights. The top of the BA anomaly revealed that negative to positive change occurred at ~38 km indicating the first height where the RO line-of-sight encounters the volcanic plume. The BA anomaly further revealed an increase of ~50% at ~36 km and confirms the volcanic plume reached above ~36 km. Further, the evolution of BA perturbations within 24 hours after the initial explosion is also discussed. From collocated RO profiles with the volcanic plume, we find a clear descending of the peak altitude of the BA perturbation from ~36 km to ~30 km within 24 hours after the initial eruption. The results from the study will provide some insights into advancing our understanding of volcanic cloud dynamics and their implementation in volcanic plume modeling.

Assuming a two component, positive and negative mass, superfluid/supersolid for space (the Winterberg model), we model the Higgs field as a condensate made up of a positive and a negative mass, planckion pair. The connection is shown to be consistent (compatible) with the underlying field equations for each field, and the continuity equation is satisfied for both species of planckions, as well as for the Higgs field. An inherent length scale for space (the vacuum) emerges, which we estimate from previous work to be of the order of,

Different cohort studies documented a lower glomerular filtration rate (GFR) in former extremely low birth weight (ELBW, <1000 g) neonates throughout childhood when compared to term controls. The current aim is to pool these studies to describe the GFR pattern over the pediatric age range. To do so, we conducted a systematic review on studies reporting on GFR measurements in former ELBW cases while GFR data of healthy age-matched controls included in these studies were co-collected. Based on 248 hits, 6 case-control and 3 cohort studies were identified, with 444 GFR measurements in 380 former ELBW cases (median age 5.3-20.7 years). The majority were small (17-78 cases) single center studies, with heterogeneity in GFR measurement (inulin, Cystatin C or creatinine estimated GFR formulae) tools. Despite this, the median GFR (ml/kg/1.73m²) within case-control studies was consistently lower (-13, range -8 to -25%) in cases, so that a relevant minority (15-30%) has a eGFR<90 mgl/kg/1.73m²). Consequently, this pooled analysis describes a consistent pattern of reduced eGFR in former ELBW cases throughout childhood. Research should focus on perinatal risk factors for impaired GFR and long-term outcome, but is hampered by single center cohorts, study size, and heterogeneity of GFR assessment tools.

This research is focused on two key areas. The first is mapping the 2022 flood in the Red River of the North near Grafton, North Dakota, US, and the second is evaluating the scour potential of the Grafton Bridge. Local scour of bridge piers can cause hydraulic structures such as bridge piers and abutments to fail during floods, making it a crucial area of investigation. To collect bathymetry and discharge data during low and high flow conditions, including a flood event with a 16.5-year return period in 2022, an Autonomous Surface Vehicle (ASV) incorporated with LiDAR DEM (Digital Elevation Model) data obtained from the US Geological Survey (USGS) National Map was used. Flood mapping and evaluation of local scour around the bridge pier were conducted using the HEC-RAS 6.0.0 software, which utilizes the Colorado State University method as a default equation. This research demonstrates the potential of ASVs in collecting critical data and LiDAR DEM data is an efficient method for flood mapping and determining scour potential, as it integrates bathymetry, flow velocity, and flood prediction.

We performed a global analysis with data from 149 countries to test whether temperature can explain the spatial variability of the spread rate and mortality of COVID-19 at the global scale. We performed partial correlation analysis and linear mixed effect modelling to evaluate the association of the spread rate and motility of COVID-19 with maximum, minimum, average temperatures and temperature extreme (difference between maximum and minimum temperature) and other environmental and socioeconomic parameters. After controlling the effect of the duration after the first positive case, partial correlation analysis revealed that temperature was not related with the spatial variability of the spread rate of COVID-19. Mortality was negatively related with temperature in the countries with high-income economies. In contrast, temperature extreme was significantly and positively correlated with mortality in the low-and middle-income countries. Taking the country heterogeneity into account, mixed effect modelling revealed that inclusion of temperature as a fixed effect in the model significantly improved model skill predicting mortality in the low-and middle-income countries. Our analysis suggest that warm climate may reduce the mortality rate in high-income economies but in low and middle-income countries temperature extreme may increase the mortality risk.

This paper performs non-parametric Mann Kendall (MK) trend analysis of historical hydroclimatic data (1961-2016), an ensemble climate model validation and a computation of 16 Expert Team on Climate Change Detection and Indices (ETCCDI) temperature and rainfall extremes indices. The climate indices are evaluated using MK test and annual trend analysis for two Representative Concentration Pathways (RCP4.5 & RCP8.5) future scenarios from 2020 to 2045 over Mono River Basin (MRB) in Togo. The annual and seasonal trend analyses are assessed on historical potential evapotranspiration, mean temperature, rainfall and discharge data. Results show positive and negative trends of hydroclimatic data over MRB from1961 to 2016. Mean temperatures increase significantly in most of the stations while a negative non-significant trend is noticed for rainfall. Meanwhile, the discharge presents a significant seasonal and annual trend for three gauge stations (Corrokope, Nangbéto and Athiémé). Validation of the ensemble climate models reveals that the model under-estimates observations at Sokode, Atkakpamé and Tabligbo stations, however linear regression and spatial correlation coefficients are higher than 0.6. Moreover, the percentage of bias between climate model and observations are less than 15% at most of the stations. Finally, the computation of extreme climatic indices under RCP4.5 and RCP8.5 scenarios shows a significant annual trend of some extreme climatic indices of rainfall and temperature at selected stations between 2020 and 2045 in the MRB. Therefore, relevant governmental politics are needed to elaborate strategies and measures to cope with projected climate changes impacts in the country.

Although the statistical methods of downscaling climate data have progressed significantly, the development of high-resolution precipitation products continues to be a challenge. This is especially true when interest centres on downscaling value over several study sites. In this paper , we report a new downscaling method termed the multi-site Climate Generative Adversarial Network (MSCliGAN), which can simulate annual maximum precipitation to the regional scale during the 1950-2010 period in different cities in Canada by using different AOGCM's from the Coupled Model Inter-Comparison Project 6 (CMIP6) as input. Auxiliary information provided to the downscaling model included topography and land-cover. The downscaling framework uses a convolution encoder-decoder U-net network to create a generative network and a convolution encoder network to create a critic network. An adversarial training strategy is used to train the model. The critic/discriminator used Wasserstein distance as a loss measure and on the other hand the generator is optimized using a summation of content loss on Nash-Shutcliff Model Efficiency (NS), structural loss on structural similarity index (SSIM), and adversarial loss Wasserstein distance. Downscaling results show that downscaling AOGCMs by incorporating topography and land-use/land-cover can produce spatially coherent fields close to observation over multiple-sites. We believe the model has sufficient downscaling potential in data sparse regions where climate change information is often urgently needed.

Portugal Mainland has hundreds of thousands of people living in the Atlantic coastal zone, with numerous high economic value activities and a high number of infrastructures that must be protected from natural coastal hazard, namely extreme storms and sea level rise (SLR). In the context of climate change adaptation strategies, a reliable and accurate assessment of the physical vulnerability to SLR is crucial. This study is a contribution to the implementation of flooding standards imposed by the European Directive 2007/60/EC, which requires each member state to assess the risk associated to SLR and floods caused by extreme events. Therefore, coastal hazard in the Continental Atlantic coast of Portugal Mainland was evaluated for 2025, 2050 and 2100 in the whole coastal extension with different sea level scenarios for different extreme event return periods and due to SLR. A coastal flooding probabilistic map was produced based on the developed methodology using Geographic Information Systems (GIS) technology. The Extreme Flood Hazard Index (EFHI) was determined on flood probabilistic bases through five probability intervals of 20% of amplitude. For a given SLR scenario, the EFHI is expressed, on the probabilistic flooding maps for an extreme tidal maximum level, by five hazard classes ranging from 1 (Very Low) to 5 (Extreme).

The finding of important explanatory variables for the location parameter and the scale parameter of the generalized extreme value (GEV) distribution, when the latter is used for the modelling of annual streamflow maxima, is known to have reduced the uncertainties in inferences, as estimated through regional flood frequency analysis frameworks. However, important explanatory variables have not been found for the GEV shape parameter, despite its critical significance, which stems from the fact that it determines the behaviour of the upper tail of the distribution. Here we examine the nature of the shape parameter by revealing its relationships with basin attributes. We use a dataset that comprises information about daily streamflow and forcing, climatic indices, topographic, land cover, soil and geological characteristics of 591 basins with minimal human influence in the contiguous United States. We propose a framework that uses random forests and linear models to find (a) important predictor variables of the shape parameter and (b) an interpretable model with high predictive performance. The process of study comprises of assessing the predictive performance of the models, selecting a parsimonious predicting model and interpreting the results in an ad-hoc manner. The findings suggest that the shape parameter mostly depends on climatic indices, while the selected prediction model results in more than 20% higher accuracy in terms of RMSE compared to a naïve approach. The implications are important, since incorporating the regression model into regional flood frequency analysis frameworks can considerably reduce the predictive uncertainties.

The Kashmir valley is prone to flooding due to its peculiar geomorphic setup compounded by the rapid anthropogenic land system changes and climate change. The study assesses the impact of land use and land cover (LULC) changes between 1980 and 2020 and extreme rainfall on peak discharge and sediment yield in the Upper Jhelum Basin (UJB), Kashmir Himalaya, India using KINEROS2 model. Analysis of LULC change revealed a notable shift from natural LULC to more intensive human-modified LULC, including a decrease in vegetative cover, deforestation, urbanization, and improper farming practices. The findings revealed a strong influence of the LULC changes on peak discharge, and sediment yield relative to the 2014 timeframe, which coincided with the catastrophic September 2014 flood event. The model predicted a peak discharge of 115101 cubic feet per second (cfs) and a sediment yield of 56.59 tons/ha during the September 2014 flooding, which is very close to the observed peak discharge of 115218 cfs indicating that the model is reliable for discharge prediction. The model predicted a peak discharge of 98965 cfs and a sediment yield of 49.11 tons/ha in 1980, which increased to 118366 cfs and, 58.92 tons/ha respectively in 2020, showing an increase in basin’s flood risk over time. In the future, it is anticipated that the ongoing LULC changes will make flood vulnerability worse, which could lead to another major flooding in the event of an extreme rainfall as predicted under climate change and, in turn compromise achievement of sustainable development goals (SDG). Therefore, regulating LULC in order to modulate various hydrological and land surface processes would ensure stability of runoff and reduction in sediment yield in the UJB, which is critical for achieving many SDGs.

Mammography is often used as the most common laboratory method for the detection of breast cancer, yet associated with the high cost and many side effects. Machine learning prediction as an alternative method has shown promising results. This paper presents a method based on a multilayer fuzzy expert system for the detection of breast cancer using an extreme learning machine (ELM) classification model integrated with radial basis function (RBF) kernel called ELM-RBF, considering the Wisconsin dataset. The performance of the proposed model is further compared with a linear-SVM model. The proposed model outperforms the linear-SVM model with RMSE, R², MAPE equal to 0.1719, 0.9374 and 0.0539, respectively. Furthermore, both models are studied in terms of criteria of accuracy, precision, sensitivity, specificity, validation, true positive rate (TPR), and false-negative rate (FNR). The ELM-RBF model for these criteria presents better performance compared to the SVM model.

Soil pH, either low (acidity) or high (alkalinity) is one of the major constraints that affect many biochemical and biological processes within the cell. The present study was carried out to understand the oxidative damage and antioxidant defense in wheat (Triticum aestivum L. cv. BARI Gom-25) grown under different pH regimes. Eight-day-old seedlings were exposed to growing media with different pH levels (4.0, 5.5, 7.0 and 8.5). Seedlings grown in pH 4.0 and in pH 8.5 showed reductions in biomass, water, and chlorophyll contents; whereas plants grown at pH 7.0 (neutral) exhibited better performance. Extremely acidic (pH 4.0) and/or strongly alkaline (pH 8.5)-stress also increased oxidative damages in wheat by excess reactive oxygen species (ROS) generation and methylglyoxal (MG) production, which increased lipid peroxidation and disrupted the redox state. In contrary, the lowest oxidative damage was observed at neutral condition followed by strong acidic condition (pH 5.5), which was attributed mainly due to better performance of the antioxidant defense and glyoxalase systems. Interestingly, seedlings grown at pH 5.5 showed a significant increase in morphophysiological attributes compared with extreme acidic (pH 4.0)- and strong alkaline (pH 8.5)-stress treatments, which indicates the tolerance of wheat to the acidic condition.

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.

Three significant changes have occurred in the winter climate in Europe recently: increased UK flooding; Iberian drought; and warmer temperatures north of the Alps. The literature links all three to a persistent, significant increase in sea level pressure over Southern Europe, the Mediterranean, Iberia and the Eastern Atlantic (SEMIEA) which changes the atmospheric circulation system: forcing cold fronts to the north away from Iberia; and creating a south westerly flow around the northern perimeter of the high-pressure region bringing warmer, moist air from the subtropical Atlantic to the UK and Europe which increases precipitation in the UK and raises the temperature in Europe. I use the Last Millennium Ensemble, MERRA-2 and Terra-NCEP data to demonstrate that the extreme, anthropogenic, West African aerosol Plume (WAP) which only exists from December to April perturbs the northern, regional Hadley Circulation creating the high pressure in the SEMIEA. I also show that the anthropogenic WAP has only existed in its extreme form in recent decades as the two major sources of the WAP aerosols: biomass burning; and gas flaring have both increased significantly since 1950 due to: a four-fold increase in population; and gas flaring rising from zero to 7.4 billion m3/annum and note that this time span coincides with the changes in the three elements of the winter climate of Europe. I also suggest that it may be possible to eliminate the WAP and return the winter climate of Europe to its natural state after the crucial first step of recognising the cause of the changes is taken.

The critical hypoxia in COVID-19 patients during this pandemic, has taken away many lives all around the globe. The mechanism has been poorly understood and initially, word got around that it was a SARS (Severe Acute Respiratory Syndrome) pneumonia. The atypical images in lung computerized axial tomography (CAT) scans were alarming. This immediately alerted everyone including poor countries to purchase lacking sophisticated ventilator equipment. However, in some countries, even 88% of the patients on ventilators lost their lives. New observations and pathological findings are gradually clarifying the disease. What seems evident is that it is not only one disease but several, with different responses in different countries and different altitudes. The critical hypoxia and «gasping» present in some patients are not totally understood. It was mentioned that it could be like a High-Altitude Pulmonary Edema (HAPE). Hereby, as high-altitude medicine and hypoxia physiology specialists, we compare the pathophysiology with that of high-altitude exposure in order to understand the mechanisms involved. Some differences in lung radiological images along with transmission and viral attack mechanisms are discussed. The oxygen transport triad used at high-altitude can be applied on this pathology in order to propose even the use of erythropoietin (EPO) early in the treatment. The immune system is the most important long-term survival tool, so we suggest a short-term strategy: the use of special Earth open-circuit astronaut-resembling suits with effective outside air filtering re-breathing mechanisms in order to return to work and daily activities, without contamination risk. Thereby, the curve can be flattened without quarantine and the economy could recover.

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.

Assessment of extreme events and climate change on reservoir inflow is important for water and power stressed countries. Projected climate is subject to uncertainties related to climate change scenarios and Global Circulation Models (GCMs’). Extreme climatic events will increase with the rise in temperature as mentioned in the AR5 of the IPCC. This paper discusses the consequences of climate change that include extreme events on discharge. Historical climatic and gauging data were collected from different stations within a watershed. The observed flow data was used for calibration and validation of SWAT model. Downscaling was performed on future GCMs’ temperature and precipitation data, and plausible extreme events were generated. Corrected climatic data was applied to project the influence of climate change. Results showed a large uncertainty in discharge using different GCMs’ and different emissions scenarios. The annual tendency of the GCMs’ is bi-vocal: six GCMs’ projected a rise in annual flow, while one GCM projected a decrease in flow. The change in average seasonal flow is more as compared to annual variations. Changes in winter and spring discharge are mostly positive, even with the decrease in precipitation. The changes in flows are generally negative for summer and autumn due to early snowmelt from an increase in temperature. The change in average seasonal flows under RCPs’ 4.5 and 8.5 are projected to vary from -29.1 to 130.7% and -49.4 to 171%, respectively. In the medium range (RCP 4.5) impact scenario, the uncertainty range of average runoff is relatively low. While in the high range (RCP 8.5) impact scenario, this range is significantly larger. RCP 8.5 covered a wide range of uncertainties, while RCP 4.5 covered a short range of possibilities. These outcomes suggest that it is important to consider the influence of climate change on water resources to frame appropriate guidelines for planning and management.

Keywords: Geobacillus thermocatenolatus; lipases; ethanolysis; ionic liquids; kinetic resolution; mandelic acid.

Abstract: (1) Background: tuberculosis presents an epidemiological trend towards inequality, especially among people in social exclusion and situations of vulnerability. To analyze territories where there is a concentration of people diagnosed with tuberculosis, in a street situation, and who make chronic use of alcohol, tobacco, and illicit drugs. We will also analyze trends in this health condition in southern Brazil; (2) Methods: Ecological study, developed in the 399 municipalities of Paraná, Southern Brazil, with all tuberculosis cases in the homeless population registered in the Information System of Notifiable Diseases between 2014 to 2018. For data analysis, we used descriptive statistics, for the time series, the Prais-Winsten autoregression method, whereas for spatial analysis, we used the Getis-Ord Gi technique*; (3) Results: in total, 560 cases were reported. We found a predominance of alcohol, smoking, and illicit drugs users, with an increasing trend in the state and clusters of spatial risk in the East health macro-region; (4) Conclusions: We observed territories with critical levels of highly vulnerable people who use psychoactive substances and are in a street situation. The results highlight the importance of incorporating public policies of social protection to these individuals and resolutive health services that receive and assist in eradicating TB.

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.

Objectives to assess COVID-19 mortality rates per country population. To determine what if any independent country-specific variables from 9 different databases were correlated. Design population based retrospective cohort study. Setting analysis of global COVID-19 treatment and containment strategies using data from 9 worldwide websites. Participants 108 countries worldwide. Interventions none. Main Outcome Measures were COVID-19 death rates per country population analyzed by univariate and multivariate analysis. The main outcome parameters were to determine if there are any correlations between the percentage of countrywide COVID-19 deaths/population by the countries’ percent vaccinated. Secondary outcome measures include the effect of other independent variables on COVID-19 death rates per country population including: health expenditures per capita, annual income per capita, COVID-19 tests per 1000 people, stringency index (a measure of each countries containment strategies), hydroxychloroquine score (a measure of each countries use), ivermectin score (a measure of each countries use), hypertension, obesity, diabetes, and specific countries and geographic locations. Results COVID-19 vaccination rates ranged from 0-99% in 108 countries. Univariate analysis demonstrates the following independent variables to correlate with COVID-19 deaths/population (correlation coefficient, p value): countrywide COVID-19 vaccination rates (+0.2936, p=0.002); healthcare costs per capita (+0.3212, p=0.0007), income per capita (+0.3051, p=0.0013), COVID-19 tests per 1000 population (+0.6981 p=0.0307); stringency index (+0.3098, p=0.0011); hydroxychloroquine index (-0.1337, p=0.0678); and ivermectin index (-0.1383, p=0.1535). Conclusions Increasing rates of COVID-19 vaccination are associated with increase COVID-19 death rates per country population (p=0.002). Other variables associated include healthcare costs per capita (+0.3212, p=0.0007), income per capita (+0.3051, p=0.0013), COVID-19 tests per 1000 population (+0.6981 p=0.0307); and stringency index (+0.3098, p=0.0011).

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.

Various authors have highlighted the importance of marriage as a social marker that alter the so-cial categorization of individuals and their relationships from youth to adulthood according to the cultural construction of the life course in Arab countries. This article aims to analyze the in-teraction between the socio-political framework (structure) and the capacity for individual action (agency) in the context of biographical experiences to achieve emancipation in Morocco. This per-spective responds to the demand of different authors to include the subjective approaches of young people in the process of analysis. This analysis will be guided by some questions: Which is the capacity of young Arabs to decide the orientation of their life trajectories? What factors (cultural, family, socioeconomic, educational, etc.) create and shape the expectations of young people re-garding their transition to adult life? Is there a specific model of emancipation in the Arab Medi-terranean countries?

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