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.

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.

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.

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

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

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

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

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

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

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

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

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

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

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

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

Purpose: There is limited research on the reasons behind startup failure, and none of the available studies use a competency approach. In this study we applied Spencer’s competency model to identify the competencies in startups which, according to their CEOs, contributed to failure. Methodology: Three coders analyzed the stories of 50 startup failures published online using modified Critical Incident Technique. Findings: Two salient competencies were identified playing a fundamental role in startup failures if missing: Information seeking and Customer service orientation. A network pattern of 9 more prevalent competency deficits was created: Technical/professional/managerial expertise, Analytical thinking, Flexibility, Self-control, Concern for order, quality and accuracy, Interpersonal understanding, Self-confidence, Team leadership and Teamwork and cooperation. Besides startup-specific behavior descriptions were added to Spencer’s competencies. Research implications: Competency approach and Critical Incident Technique method proved to be feasible to identify competency deficits in failed startups. Practical implications: The identified competency deficits offer relevant focus areas for the assessment and development of startup teams. Originality: The study provided research evidence to describe the competency deficits of startup teams that are connected to their failure.

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

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

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

Myostatin inhibition therapy has held much promise for the treatment of muscle wasting disorders. This is particularly true for the fatal myopathy, Duchenne Muscular Dystrophy (DMD). Following on from promising pre-clinical data in dystrophin-deficient mice and dogs, several clinical trials were initiated in DMD patients using different modality myostatin inhibition therapies. All failed to show modification of disease course as dictated by the primary and secondary outcomes measures selected: the myostatin inhibition story thus far, is a failed clinical story. These trials have recently been extensively reviewed and reasons why pre-clinical data collected in animal models has failed to translate into clinical benefit to patients has been purported. However, the biological mechanisms underlying translational failure need to be examined to ensure future myostatin inhibitor development endeavors do not meet with the same fate. Here, we explore the biology which could explain the failed translation of myostatin inhibitors in the treatment of DMD.

Despite all scientific efforts and many protracted and expensive clinical trials, no new drug has been approved by FDA for treatment of Alzheimer disease (AD) since 2003. Indeed, more than 200 investigational programs have failed or have been abandoned in the last decade. The most probable explanations for failures of disease-modifying treatments (DMTs) for AD may include late initiation of treatments during the course of AD development, inappropriate drug dosages, erroneous selection of treatment targets, and mainly an inadequate understanding of the complex pathophysiology of AD, which may necessitate combination treatments rather than monotherapy. Clinical trials’ methodological issues have also been criticized. Current drug-development research for AD is aimed to overcome these drawbacks. Preclinical and prodromal AD populations, as well as traditionally investigated populations representing all the clinical stages of AD, are included in recent trials. Systematic use of biomarkers in staging preclinical and prodromal AD and of a single primary outcome in trials of prodromal AD are regularly integrated. The application of amyloid, tau, and neurodegeneration biomarkers, including new biomarkers—such as Tau positron emission tomography, neurofilament light chain (blood and CSF biomarker of axonal degeneration) and neurogranin (CSF biomarker of synaptic functioning)—to clinical trials allows more precise staging of AD. Additionally, use of the Bayesian statistics, modifiable clinical trial designs, and clinical trial simulators enrich the trial methodology. Besides, combination therapy regimens are currently assessed in clinical trials. The abovementioned diagnostic and statistical advances, which have been recently integrated in clinical trials, are consequential to the recent failures of studies of disease-modifying treatments. Their experiential rather than theoretical origins may better equip potentially successful drug-development strategies.

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

Extracorporeal membrane oxygenation (ECMO) can be a life-saving intervention in cases of potentially reversible refractory respiratory failure. One such indication can be bleomycin-induced lung injury. However, in some cases, the injury can be so severe that it becomes irreversible and creates complex medical decisions regarding life support and the continuation of care when no additional therapeutic options are feasible, particularly in cases of patients who were young and fully functional prior to an acute illness. In cases of full pulmonary replacement with mechanical support and the degree of functionality that can be attained utilizing modalities such as ECMO can obscure the true severity of illness and make end-of-life decisions significantly harder for families and caregivers.

Background: The coronavirus disease-19 (COVID-19) has spread globally with more than 80,000 people infected, and nearly 3000 patients died. Currently, we are in an urgent need for effective treatment strategy to control the clinical deterioration of COVID-19 patients. Methods: The clinical data of 10 COVID-19 patients receiving short-term moderate-dose corticosteroid (160mg/d) plus immunoglobulin (20g/d) were studied in the North Yard of The First Hospital of Changsha, Hunan from January 17^th to February 27^th, 2020. Epidemiological, clinical, laboratory, radiological findings were analyzed. Results: After treatment with combination of low-dose corticosteroid (40-80mg/d) and immunoglobulin (10g/d), patients’ lymphocyte count (0.88±0.34 vs 0.59±0.18, P<0.05), oxygenation index including SPO₂ (94.90±2.51 vs 90.50±5.91, P<0.05) and PaO₂/FiO₂ (321.36±136.91 vs 129.30±64.97, P<0.05) were significantly lower than pre-treatment, and CT showed that the pulmonary lesion deteriorated in all patients. While after treatment of short-term moderate-dose corticosteroid plus immunoglobulin, patients’ APACHE Ⅱ score (9.10±6.15 vs 5.50±9.01, P<0.05), body temperature (37.59±1.16 vs 36.46±0.25, P<0.05), lymphocyte count (0.59±0.18 vs 1.36±0.51, P<0.05), Lactate dehydrogenase (419.24±251.31 vs 257.40±177.88, P<0.05), and C-reactive protein (49.94±26.21 vs 14.58±15.25, P<0.05) significantly improved compared with post-treatment with low-dose therapy. In addition, oxygenation index including SPO₂ (90.50±5.91 vs 97.50±1.18, P<0.05), PaO₂ (60.47±14.53 vs 99.07±34.31, P<0.05), and PaO₂/FiO₂ (129.30±64.97 vs 340.86±146.72, P<0.05) significant improved. Furthermore, CT showed that pulmonary lesions obviously improved in 7 patients. After systematic therapy, 4 out of 10 COVID-19 patients recovered and discharged. Conclusions: Short-term moderate-dose corticosteroid plus immunoglobulin is effective for reversing the continued deterioration of COVID-19 patients who failed to respond to the low-dose therapy. Funding: This work was supported by the Innovative Major Emergency Project Funding against the New Coronavirus Pneumonia in Hunan Province (Dr. Ji-Yang Liu, number 2020SK3014; Dr. Yuan-Lin Xie, number 2020SK3013).

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.

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

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

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

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

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

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

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

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

Studies in animal models have suggested that the ketogenic diet may be effective in the treatment of cancer. However, human cohort studies on the ketogenic diet have, thus far, failed to show benefits in cancer survival or in any other hard clinical endpoints of the disease. This paper presents a case report of a patient with glioblastoma multiforme. The patient had initially been treated with standard oncotherapy including surgery, radiotherapy and chemotherapy. Despite standard treatment, the patient experienced a recurrence of the glioblastoma seven months later. Subsequently, the patient refused radiotherapy and chemotherapy and opted to use the paleolithic ketogenic diet (PKD) as a stand-alone therapy. Following the adoption of the PKD, progression of the disease has been completely halted. At the time of writing, the patient has remained in remission for 48 months, is without side-effects and experiences an excellent quality of life without the use of any drugs.

While paresthesia-based spinal cord stimulation (SCS) has been proven effective to treat chronic neuropathic pain, initial benefits may lead to the development of “Failed SCS Syndrome’ (FSCSS) defined as decrease over time related to Loss of Efficacy (LoE) with or without Loss of Coverage (LoC). Development of technologies associating new paresthesia-free stimulation waveforms and implanted pulse generator adapters provide opportunities to manage patients with LoE. The main goal of our study was to investigate salvage procedures, through neu-rostimulation adapters, in patients already implanted with SCS and experienced LoE. We retro-spectively analyzed a cohort of patients who were offered new SCS programs/waveforms through an implanted adapter between 2018 and 2021. Patients were evaluated before, and at 1, 3, 6 and 12-month follow-up. Outcomes included pain intensity rating with Visual Analog Scale (VAS), pain/coverage mappings and stimulation preferences. Last follow-up evaluations (N=27) showed significant improvement in VAS (p = 0.0001), ODI (p = 0.021) and Quality of Life (p=0.023). In the 11/27 patients with LoC, SCS efficacy on pain intensity (36.89%) was accompa-nied by paresthesia coverage recovery (55.57%) and pain surface decrease (47.01%). At 12-month follow-up, 81.3% preferred to keep tonic stimulation in their waveform portfolio. SCS conver-sion using adapters appears promising as a salvage solution, with an emphasis on paresthesia recapturing enabled by spatial retargeting. In light of these results, adapters could be integrated to SCS rescue algorithms or should be considered in SCS rescue.

Clinching is a manufacturing method of mechanical joining two or more materials without the use of heat or additional components. This process relies on high plastic deformation to create a secure bond. Clinching technology is widely used for joining various grades and thickness of materials. Especially in the automotive industry, clinching is an alternative to spot resistance welding. However, the load-bearing capacity of clinched joints is comparatively lower when compared to resistance spot welded joints. This research aimed to enhance the load-carrying capacity of clinched joints. Experimental tests were conducted on clinched joints with locally modified microstructures to optimize their placement within the joint. The microstructure distribution in the clinched joint region was analysed using light and scanning electron microscopy, as well as microhardness measurements. Two material grades, micro-alloyed steels HX420LAD+Z and dual-phase ferritic-martensitic steels HCT600X+Z, were tested. Each grade underwent five groups of ten samples, subject to identical experimental conditions of local heating by resistance spot welding (RSW) and clinching. The application of RSW to the clinched joint area resulted in increase of load-bearing capacity for both joined types of materials.

In recent years, the analysis of macro- and micro-expression has drawn the attention of researchers since they provide visual cues of an individual's emotions for a broad range of potential applications such as lie detection and criminal detection. In this paper, we address the challenge of spotting facial macro- and micro-expression from videos and present compelling results by using a deep learning approach to analyze the optical flow features. Different from other deep learning approaches that are mainly based on Convolutional Neural Networks (CNNs), we propose a Transformer-based deep learning approach that predicts a score indicating the probability of a frame being within an expression interval. In contrast to other Transformer-based models that achieve high performance by being pre-trained on large datasets, our deep learning model, called SL-Swin, which incorporates Shifted Patch Tokenization and Locality Self-Attention into the backbone network Swin Transformer, effectively spots macro- and micro-expressions by being trained from scratch on small-size expression datasets. Our evaluation outcomes surpass the MEGC 2022 spotting baseline result, obtaining an overall F1-score of 0.1366. Additionally, our approach also performs well in the MEGC 2021 spotting task with an overall F1-score of 0.1824 and 0.1357 on CAS(ME)^2 and SAMM Long Videos, respectively. The code is publicly available on GitHub (https://github.com/eddiehe99/pytorch-expression-spotting).

Middle East region experiences a high prevalence of hypovitaminosis D, yet most genetic studies on Vitamin D have focused on European populations. Furthermore, there is a lack of research on the genomic risk factors affecting the elderly population, who are more susceptible to health burden. We investigated the genetic determinants of 25-hydroxyvitamin D levels in elderly Lebanese individuals (n=199) through a whole exome-based genome-wide association study. We identified new loci with suggestive evidence of an association with Vitamin D levels, including rs141064014 in the MGAM gene (P-value of 4.40 × 10−06) and rs7036592 in PHF2 (P-value of 8.43 × 10−06). A meta-analysis of the Lebanese data and the largest European genome-wide association study confirmed consistence replication of numerous variants, including rs2725405 in SLC38A10 (P-value of 3.73 x 10-08). Despite the lower performance of European-derived polygenic risk scores compared to the European estimations, it still effectively predicted Vitamin D deficiency among elderly Lebanese individuals. Our findings provide novel insights into the genetic mechanisms of Vitamin D deficiency in Middle Eastern elderly populations, facilitating the development of personalized approaches for more effective management of hypovitaminosis D. Additionally, we demonstrated that whole exome-based genome-wide association study is an effective method for identifying genetic components associated with phenotypes.

The aim of this study was to compare the effectiveness of propofol-based sedation and midazo-lam sedation in same-day bidirectional endoscopy (BDE) in children. The charts of children (≤15 years old) who had undergone same-day BDE were retrospectively reviewed. Demographic data, indications, sedatives and their dosages, clinical outcomes, endoscopic findings, adverse events, and patient time requirements were compared in cases with propofol-based and midazolam se-dation. A total of 91 children [51 boys, mean age 13 years (range 9-15)] were enrolled. Propofol alone or in combination with midazolam and/or pentazocine was given in 51 (propofol-based sedation group) while midazolam alone or in combination with pentazocine was given in 40 (midazolam sedation group). The mean doses of propofol, midazolam and pentazocine were 96 mg (range 40–145 mg), 4.1 mg (range 3–5 mg) and 7.5 mg in the propofol group while the mean doses of midazolam and pentazocine were 6.2 mg (range 4–10 mg) and 15 mg in the midazolam group, respectively. The total procedure times and endoscopic findings between the two groups were similar, but the median patient time requirement in the propofol group was significantly shorter than that of the midazolam group (7.3 h vs. 8.4 h, P<0.001). No adverse events occurred in either group. Propofol-based sedation shortened patient time requirements in same-day BDE compared with midazolam sedation in children.

The restriction of normal blood flow is the cause of many diseases including stroke and coronary artery diseases. To study the consequences of vessel blockade, previous models mainly focused on major arteries and have been well studied. However, the sequela from interruption of capillary vessels by microemboli was less well characterized. In this study, we exploited polystyrene microspheres as a mimicry of microemboli and found that microspheres of this size can be trapped in capillary vessels of all organs without causing apparent acute morbidities of the host. Interestingly, we accidentally found significantly increased recruitment of monocyte to the brain vasculature expressing low levels of Ly6C expression, but not to other organs. Further study revealed the spleen is the major origin of the recruited monocyte. Most importantly, VCAM-1 which is constitutively expressed on mouse brain vasculature orchestrates the recruitment of monocyte. Blockade of VCAM-1 in mice can substantially reduce monocyte recruitment. Interestingly, monocytes get activated through TNF- signaling which likely happens in the spleen instead of the brain. Collectively, we found a unique monocyte recruitment strategy in the brain comparing to other orangs, in response to capillary blockade induced by polystyrene microspheres.

ORF6 is responsible for suppressing the immune response of cells infected by the SARS-CoV-2 virus. It is also the most toxic protein of SARS-CoV-2, and its actions are associated with the viral pathogenicity. Here we study in silico and in vitro the structure of the protein, its interaction with RAE1, and the mechanism of action behind its high toxicity. We show both computationally and experimentally that SARS-CoV-2 ORF6, embedded in the membranes of the endoplasmic reticulum, binds to RAE1 and sequesters it in the cytoplasm, thus depleting its availability in the nucleus and impairing nucleocytoplasmic mRNA transport. This negatively affects the cellular genome stability by compromising the cell cycle progression into the S-phase and by promoting the accumulation of RNA-DNA hybrids. Understanding the multiple ways in which ORF6 affects DNA replication may also have important implications for elucidating the pathogenesis of SARS-CoV-2 and developing therapeutic strategies to mitigate its deleterious effects on host cells.

Following the well-known pandemic, declared on 30 January 2020 by the World Health Organi-zation, the request for new global strategies for the prevention and mitigation of the spread of the infection has come to the attention of the scientific community. Nanotechnology has often managed to provide solutions, effective responses, and valid strategies to support the fight against SARS-CoV-2. This work reports a collection of information on nanomaterials that have been used to counter the spread of the SARS-CoV-2 virus. In particular, the objective of this work is to illustrate the strategies that have made it possible to use the particular properties of nanomaterials, for the production of personal protective equipment (DIP) for the defense against the SARS-CoV-2 virus.

The western Sulige gas field is a new and key reserve area for the rolling development of the Sulige gas field in China. However, due to the complex gas–water relationship and the difficulty in identifying gas and water formation, the scale and benefit deployment of the gas field are seriously restricted. In particular, almost all of the wells in the area produce water and no water measurement has been carried out for any single well, which leads to an unclear understanding of the dynamic characteristics of the production wells, thus affecting the productivity calculations of the gas wells and the overall regional productivity evaluation. Based on the testing data for a gas well, the impacts of the reservoir property parameters on the gas and water production were analyzed by combining the production performance and static geological characteristics. It was determined that the physical parameters K, Kh, and φSg had good positive correlations with gas production but not with water production; thus, effective prediction cannot be obtained for water production in gas well testing. After the analysis of the liquid loading law, the gas wells were classified into three types: continuous liquid carrying production, slight liquid loading, and liquid loading wells. In general, up to 96% of the gas wells were liquid loaded. According to the different production performances exhibited in the different stages of the gas wells, five types of methods for diagnosing water production wells were proposed (gas testing, pilot production, gas–liquid two-phase measurement testing, liquid level detection, and production performance analysis), as well as the diagnostic criteria and corresponding solutions. To obtain real-time water production data for each well and investigate the change of water-gas ratio (WGR) during the whole production process, a water production splitting method for gas wells based on three-dimensional geological modeling and numerical simulation combined with the constraints of the total water production of gas gathering stations was explored and established. The splitting results can be used to evaluate the water and gas productivity of gas wells and determine the best deliquification period. The gas well productivity when water production was considered was about 10% lower than that when water production was not considered. The best deliquification period was determined to be 125 days for wells with small water production, 20 days for wells with moderate water production, and 3 days for wells with serious water production. The results of this study could provide technical support for the scientific evaluation of gas well production indicators, reduction of development costs, and improvement of oil recovery.

The German Constitutional Court’s climate verdict provides a re-interpretation of liberal- democratic core concepts and is highly relevant for liberal constitutional law in general – including EU and international law. The verdict accepts human rights as intertemporal and globally applicable; it applies the precautionary principle to these rights and frees them from the misleading causality debate. However, the court fails to address the most important violations of human rights, and it categorised climate policy as a greater threat to freedom than climate change. And the court does not make it clear that the Paris 1.5-degree limit implies a radically smaller carbon budget. Furthermore, little attention has so far been paid to the fact that the ruling implies an obligation for more EU climate protection, especially since most emissions are regulated supranationally. To be effective, the EU emissions trading system demands a reform, which should go well beyond the existing EU proposals to enable societal transformation to sustainability.

Mild TBI (mTBI) accounts for most TBI cases, the leading cause of morbidity and mortality worldwide. Despite their high incidence, mTBI pathophysiology remains largely unknown. Recent studies have shown that the inflammatory response is activated early after mTBI and can persist for several weeks or months. However, limited evidence on the utility of inflammatory biomarkers as predictors of clinical outcomes in mTBI was previously provided. Thus, this study aims to provide an overview of the current knowledge on the role of inflammation in the pathogenesis of mTBI and the potential of some inflammatory biomolecules as biomarkers of mTBI. Thus, it was shown that the increase of IL-6, TNF-α, and IL-1β plasma levels could be implicated in the development of the early post-concussion symptoms. On the other hand, the persistence of the increased plasmatic concentrations of IL-10 and IL-8 for as long as six months following the brain injury event could suggest chronic inflammation leading to neuroinflammation and late or persistent symptoms. In this context, our findings showed that the inflammatory biomarkers could be relevant in diagnosing or predicting recovery or long-term outcomes of mTBI.

Chenodeoxycholic acid (CA) is a naturally occurring bile acid that is produced in the liver from cholesterol. Three CA complexes using Zn(II), Mg(II), and Ca(II) ions were synthesized to examine the chelation tendencies of CA towards these metal ions. The complexation reaction of CA with the metal ions under investigation was conducted with a 1:1 molar ratio (CA to metal) at 60-70°C in natural media (pH 7-8), which consisted of a binary solvent of MeOH and H2O (1:1). The resulting CA complexes were characterized using analytical data (metal, H, C, and Cl, analysis) and spectral data (UV-visible, FT-IR, and 1H NMR) to elucidate the complexes’ structures. The results suggested that CA in anion form utilized oxygen atoms of the carboxylate group (-COO−) to capture Zn(II), Mg(II), and Ca(II) ions. This produced complexes with the general compositions of [Zn(CA)(H2O)Cl], [Mg(CA)(H2O)Cl]H2O, and [Ca(CA)(H2O)Cl]2H2O, respectively. The Kirby-Bauer disc diffusion assay was then used to explore the bioactivity of the CA complexes toward three fungal species, three Gram-positive bacteria, and two Gram-negative bacteria. The Ca(II) and Mg(II) complexes exhibited marked inhibitory effects on the cell growth of the fungal species Aspergillus niger with potency equal to 127% and 116% of the activity of the positive control, respectively. The Zn(II) and Ca(II) complexes strongly inhibited the growth of Penicillium sp., while the Zn(II) and Mg(II) complexes showed strong growth inhibition towards the Gram-negative species Pseudomonas aeruginosa.

(1) Background: Breast cancer is a frequent heterogeneous disorder diagnosed in woman and is a high cause of mortality of them in reason to rapid metastasis and disease recurrence. Ferroptosis can inhibit breast cancer cell growth, improve the sensitivity of chemotherapy and radiotherapy and inhibit distant metastases so potentially acts on tumor micro-environment; (2) Methods: Ferroptosis/Extracellular matrix remodeling literature text-mining results were integrated in breast cancer transcriptome cohort according their distant relapse free survival (DRFS) under adjuvant therapy (anthracyclin+taxanes) and also in MDA-MB-231 transcriptome functional experiments with ferroptosis activations (GSE173905); (3) Results: Ferroptosis/Extracellular matrix remodeling text-mining identified 910 associated genes in at list 10 articles. Univariate Cox analyses censored on breast cancer (GSE25066) selected 252 individual significant genes and 171 of them found with an adverse expression. Functional enrichment of these 171 adverse genes predicted basal breast cancer signatures. By text-mining some ferroptosis significant adverse selected genes shared citations in domain of ECM remodeling such as: TNF, IL6, SET, CDKN2A, EGFR, HMGB1, KRAS, MET, LCN2, HIF1A, TLR4. A molecular score based on expression the eleven genes was found predictive of worst prognosis breast cancer at univariate level: basal subtype, short DRFS, high grade values 3 and 4, estrogen and progesterone receptors negative and nodal stages 2 and 3. This eleven gene signature was validated as regulated by ferroptosis inductors (erastin and RSL3) in triple negative breast cancer cellular model MDA-MB-231.; (4) Conclusions: Crosstalk between ECM remodeling-Ferroptosis functionalities allowed to define a molecular score which have been characterized as an independent adverse parameter in prognosis of breast cancer patients. Gene signature of this molecular score have been validated to be regulated by erastin/RSL3 ferroptosis activators. This molecular score could be promising to evaluate ECM impact of ferroptosis target therapies in breast cancer.

With the increase of intelligent voice phishing and the increasing reliance on open banking systems, there has been a rise in cases where individuals' personal information has been exposed, resulting in significant financial losses for the victims. Non-face-to-face transactions in the financial sector face challenges such as customer identification, ensuring transaction integrity, and preventing transaction rejection. Blockchain-based distributed ledgers have been proposed as a solution, but their adoption is limited due to the difficulty of managing private keys and the burden of gas fees management. This paper proposes a non-face-to-face P2P real-time token payment system that minimizes the risk of key loss by storing private keys in a keystore file and database through a server-based key management module. The proposed system simplifies token creation and management through a server-based token management module and implements an automatic gas charging function for smooth token transactions. Transaction integrity and non-repudiation are ensured through a transaction confirmation module that uses transaction IDs without exposing personal information. Furthermore, advanced security measures such as blocking foreign IP access and DDoS defense are implemented to securely protect user data. The proposed system aims to provide a convenient, secure, and accessible online payment solution to the public by implementing a self-authentication function using a web application that is not limited to smart phones or application platforms.

We develop a quantitative microscopic theory of decaying Turbulence by studying the dimensional reduction of the Navier-Stokes loop equation for the velocity circulation. We have found an infinite dimensional manifold of solutions of the Navier-Stokes loop equation\cite{M93, M23PR} for the Wilson loop in decaying Turbulence in arbitrary dimension $d >2$. This family of solutions corresponds to a fractal curve in complex space $\mathbb C^d$, described by an algebraic equation between consecutive positions plus a nonlinear periodicity condition. We derive the constrained SDE for the evolution of the fractal curve at a fixed moment of physical time as a function of an auxiliary stochastic time. We expect this stochastic process to cover our fixed manifold of the solutions of the decaying Turbulence. The energy density of the fluid decays as $\mathcal E_0/t$, where $\mathcal E_0$ is an initial dissipation rate. Presumably, we have found a new phase of extreme Turbulence yet to be observed in real or numerical experiments.

Injection molding is one of the most common and effective manufacturing processes used to produce plastic products and impacts industries around the world. However, injection molding is a complex process that requires careful consideration of several key control variables. These variables and how they are utilized greatly affect the resulting parts of any molding operation. The bounds of the acceptable values of each control process variable or CPV must be analyzed and delimited to ensure manufacturing success and produce injected molded parts efficiently and effectively. One such method in which the key CPV of an injection molding operation can be delimited is through the development of a process window. Once developed, operating CPV at values inside the boundaries of the window or region will allow for the consistent production of parts that comply with the desired performance measures (PM), promoting a stable manufacturing process. This work proposes a method to experimentally develop process windows and illustrates the methodology with a specific molding operation.

The surface fluorination of polypropylene (PP) was performed using F2 and O2 gas mixtures with different F2 gas proportions at 25 °C and 13.3 kPa for 1 h. The surface roughness of the fluorinated PP samples was approximately 1.5 times higher than that of the untreated sample (5 nm). The Fourier-transform infrared spectroscopy (FTIR) and X-ray photoelectron spectroscopy (XPS) results showed that the PP-derived bonds (-C-C- and -CHx) decreased because they were converted into polar groups (-C–O, -CHF-, and -CFx), which increased the surface electronegativity of PP. The variation in the F2 gas proportion in the gas mixture significantly affected the hydrophilicity and surface composition of PP. At F2 gas proportions of <70%, the hydrophilicity of the fluorinated PP samples improved. Notably, the hydrophilic and negatively charged PP surface enhanced the dyeing of the polymer with basic methylene blue (MB). In contrast, at F2 gas proportions of >90%, the PP surface became hydrophobic owing to increased hydrophobic -CF3 bonds. Thus, enhanced PP dyeing can be controlled based on the composition of the F2 and O2 gas mixture.

On Feb. 6^th, 2020, FDA implemented the enforcement priorities against all flavored, cartridge-based e-cigarettes other than menthol and tobacco flavors. This ban undermined the products’ attraction to vapers, so e-cigarette manufacturers added flavorants of other attractive flavors into tobacco-flavored e-cigarettes and re-established attractions. Both the sales of e-cigarettes and posts on social media suggested that the manufacturers’ strategies are likely “successful”. The re-established attraction causes not only a public health issue, but also threats to the health of individual vapers. Research has shown an increase in toxicity associated with the flavorants commonly used in flavored e-cigarettes that are likely added in tobacco-flavored e-cigarettes based on tobacco-derived and synthetic tobacco free nicotine, and these other flavors are associated with higher clinical symptoms not often induced by only natural traditional tobacco flavors. The additional health risks posed by the flavorants are pronounced even without considering the interactions of toxicology of the different tobacco flavorants, and more research should be done to understand the health risks thoroughly and to take proper actions accordingly for regulation of these emerging products.

Sugarcane mosaic virus (SCMV) is a deleterious pathogen which causes widespread Sugarcane mosaic disease (SCMD) and is classified in the genus Potyvirus (Potyviridae), disseminated by the aphid vector. RNA interference (RNAi)-mediated antiviral innate immunity is a key biological process and antiviral defence system to interfere with viral genomes for controlling plant pathogens. The current study aims to analyze sugarcane (Saccharum officinarum L. and Saccharum spp.) locus-derived microRNAs (sof-miRNAs/ssp-miRNAs) with predicted potential for targeting the SCMV +ssRNA-encoded mRNAs, using ‘five algorithms’ approach. The ultimate goal in this research is to mobilize the in silico endogenous predicted sof-miRNAs/ssp-miRNAs to trigger RNAi catalytic pathway experimentally and generate sugarcane cultivars for evaluating potential antiviral resistance monitoring capability and capacity for SCMV. Experimentally validated mature sugarcane (S. officinarum, 2n = 8X = 80) and (S. spp., 2n = 100-120) sof-miRNAs/ssp-miRNAs (n = 28) were acquired for alignment with the SCMV genome. Of the 28 targeting mature locus-derived sof-miRNAs/ssp-miRNAs investigated, one sugarcane miRNA homolog, sof-miR159c, was concluded to localize potential binding site at genomic nucleotide site 3847 targeting CI ORF of SCMV. In order to validate target prediction accuracy, whether the sugarcane sof-miRNA/ssp-miRNA might bind predicted SCMV mRNA target(s), we created an integrated Circos plot. Genome-wide in-silico-predicted miRNA-mediated target gene regulatory network validated interactions that warrant in vivo analysis. The current work provides valuable evidence and biological material for generating SCMV-resistant sugarcane varieties.

This study probes the probabilistic features of major fire hazards in enclosed spaces to establish their importance to the occurrence of fires onboard ro-ro passenger ships and in turn to raise effective operational countermeasures. Distinct from the previous studies, the present research employs Bayesian Network (BN) analysis to determine the probabilities of fire hazards more effectively. The findings of the research include five critical basic events (BE) identified namely, vehicle engine fire (fuel system fault), vehicle electric fire (electrical equipment defect or short circuit), used car electrical fire, reefer units electrical fire (electrical appliances defects or short circuit), and cargo spontaneous combustion. Additionally, the risk of fire for lithium - ion battery powered vehicles is also highlighted in the process of BN analysis, which prompts the authors to propose preventive measures for mitigating the possibility of fire occurrence on this type of electric vehicles. It is hoped that these measures can be essential justifications for establishing relevant rules regarding carrying LIB vehicles in enclosed spaces on international level.

Background: Smart transport plays a crucial role in urban planning and the transition from traditional to smart cities in developing countries with sustainability requirements.Traditional cities in developing countries often suffer from traffic congestion,air pollution, and inadequate public transportation systems,which can impede economic growth and negatively impact the quality of life for residents. Smart transport solutions can address these challenges by providing more efficient, sustainable.Here is a possible business model for an ITS system in a high-potential city in Iran,Based on IoT analysis, Mashhad city in Iran selected as a high-potential city to be changed to a smart city in the transportation sector.In the localization business model,the Uber smart transportation business model as a successful world experience is considered the base model. Methods: Based on the literature review,various criteria and sub-criteria were identified and determined in designing a new localized transportation business model.A questionnaire was prepared and filled with the help of 11 experts,method IAHP technique; Results:The present study showed the possibility of monthly payments for customers,software development, and the addition of luxury cars are among the most important sub-criteria with high weights;Conclusions: Working with transport companies,schools and universities as key partners solves reaching a strong and sustainable smart transportation system.

The COVID-19 pandemic was associated with increases in some healthcare-associated infections. We investigated the impact of the pandemic on rates and molecular epidemiology of Clostridioides difficile infection (CDI) within one VA Hospital. We anticipated that the potential widespread use of antibiotics for pneumonia during the pandemic might increase CDI rates given that antibiotics are a major risk for CDI. Hospital data on patients with CDI and recurrent CDI (rCDI) were reviewed pre-COVID-19 pandemic (2015 to 2019) and during the pandemic (2020 - 2021). Restriction endonuclease analysis (REA) strain typing was performed on CD isolates recovered from stool samples collected from 10/2019 – 3/2022. CDI case numbers declined 43.2% in 2020 – 2021 compared to the annual mean over the previous 5 years. Stool test positivity rate was also lower during the COVID-19 pandemic (14.3% vs. 17.2%; P = 0.013). Although inpatient volume declined, rates of CDI among inpatients were reduced by 34.2% in 2020 – 2021. Mean monthly cases of rCDI also declined significantly after 2020 [3.38 (95% CI: 2.89 – 3.87) vs. 1.92 (95% CI: 1.27 – 2.56); P = &lt;0.01]. Prior to the pandemic, REA group Y was the most prevalent CD strain among the major REA groups (27.3%). During the first wave of the pandemic from March 8, 2020, through June 30, 2020, there was an increase in the relative incidence of REA group BI (26.7% vs. 9.1%. After adjusting for CDI risk factors, a multivariable logistic regression model revealed that odds of developing an REA group BI CDI increased during the first pandemic wave (OR 6.41, 95% CI: 1.03 – 39.91) compared to the pre-pandemic period. In conclusion, the incidence of CDI and rCDI decreased significantly during the initial waves of the COVID-19 pandemic. In contrast, REA BI (Ribotype 027), a virulent, previously epidemic CD strain and frequently associated with hospital transmission and outbreaks, reappeared as a prevalent strain during the first wave of the pandemic.

This paper proposes an AI-based approach to overcome the limitations of the SHM system in measuring global stress with limited sensors. Feature elements are selected based on correlation analysis among finite elements and used as stress-measured points. An ANN is used to establish the solution relationship between the feature and correlation elements. The proposed method is applied to the connector structure of an offshore platform, and an optimal ANN is established to optimize accuracy by considering factors like the number of sensors, neural network framework, and convergence criteria. The accuracy of the ANN is verified through a real-scale model test, demonstrating 93.6% accuracy. This technology represents a significant advancement, enhancing the practicality of the structural health monitoring (SHM) system from “point monitoring" to “field monitoring".

This study investigates the relationship between clean and dirty energy markets, specifically focusing on clean energy stock indexes and their potential as hedging assets and safe havens during periods of global economic uncertainty. The research analyzes five clean energy indexes and five dirty energy indexes from May 2018 to May 2023, considering events like the global pandemic and the Russian invasion of Ukraine. The main objective is to examine the causal relationship among different stock indexes pertaining to dirty and clean energy by using the Granger causality test (VAR Granger Causality/Block Exogeneity Wald Test) to determine whether clean energy indexes can predict future prices of dirty energy indexes. However, the findings reveal that clean and dirty energy indexes do not exhibit hedging characteristics or serve as safe havens during times of economic uncertainty, rejecting the research question. These results have important implications for investment strategies, as assets lacking safe haven characteristics may not preserve portfolio efficiency in uncertain times. The study's insights provide valuable guidance for investors, poli-cymakers, and participants in energy financial markets. It highlights the need to adapt investment approaches and seek alternative options to navigate uncertain economic conditions effectively.

Individuals and their leadership competencies have been the sole focus of project leadership research, rather than the project leadership's behaviour and functions in project and organizational settings. As a result, this study investigates the project leadership functions and behaviours required for various project and organizational situations in order to propose a project leadership model that will be effective in all project and organizational situations. The model that was developed and tested in this study theorized on the project leadership function that project leaders are expected to perform as a result of their positions. It also described how project leaders could tailor their leadership functions and behaviours to address issues related to positions, organizational situations, and project situations. Three hypotheses were developed and tested using structural equation modelling to validate the model. The model's perceptive power demonstrates adequate validity. The model's validity implies that there are appropriate project leadership functions for different leadership levels and circumstances. The model's validity also implies that each project leadership behaviour has its own value, as conditions and necessities dictate. The study assumes that a project leader can embrace project leadership by combining a few different project leadership functions and behaviours.

Obesity is a troubling public health problem worldwide as it increases risks of respiratory complications, systemic arterial hypertension, type 2 diabetes mellitus, sleep disorders, cardiovascular diseases, and metabolic syndrome (MetS). As a measure to counteract comorbidities associated with severe obesity, bariatric surgery stands out. This study aimed to investigate the adiponectin/leptin ratio in women with severe obesity with and without MetS undergone Roux-en-Y Gastric Bypass (RYGB) and to characterize the biochemical, glucose, and inflammatory parameters of blood in women with severe obesity before and after RYGB. Were enrolled female with severe obesity undergoing RYGP with MetS (n=11) and without (n=39). Anthropometric data and blood samples were obtained before and 6 months after RYGB to analyze total cholesterol, low-density lipoprotein (LDL), high- density lipoprotein (HDL), non-HDL total cholesterol, and glucose; and circulating levels of adiponectin and leptin. Significant reductions in weight, body mass index, and glucose, total cholesterol, LDL, and leptin were observed after surgery, with higher levels of HDL, adiponectin, and adiponectin/leptin ratio observed after surgery compared to preoperative values. This study demonstrated that weight loss induced by RYGB in patients with severe obesity with or without MetS improved biochemical and systemic inflammatory parameters, particularly the adiponectin/leptin ratio.

In order to improve the adaptability of broilers to low-temperature environments and their ability to resist acute cold stress (ACS), 240 one-day-old broilers were selected and randomly divided into three groups. The control treatment (CC) was raised at the conventional feeding temperature from 1-43 days (d), the cold stimulation treatments (CS) were kept at 3 °C below the temperature of CC at 1-d intervals for 3 and 6 hours from 15 to 35 d, namely CS3 and CS6, respectively. Then all broilers were kept at 20 °C from 36 to 43 d. ACS was then carried out at 44 d, and the ambient temperature was dropped to 10 °C for 6 hours. The study investigated the production perfor-mance, as well as levels of intestinal barrier genes (including Claudin-1, E-cadherin, Occludin, ZO-1, ZO-2 and Mucin2), secretory IgA in duodenum and jejunum, and immunoglobulins (IgA and IgG) in serum. The results showed that IMCS could increase the daily weight gain and decrease the feed conversion ratio. During the IMCS, the expression levels of intestinal barrier genes were up-regulated and the content of secretory IgA was increased. When IMCS ceased for one week, the level of immunoglobulins in serum stabilized, and the expression levels of Occludin, ZO-2 and Mucin2 still maintained high levels. After ACS, broilers that received IMCS training maintained the high levels of intestinal barrier genes and secretory IgA.

Background: Recently the role of nutraceutical compounds in the prevention of human diseases is rapidly increasing. Here, we aim to evaluate the beneficial effect of dietary supplementation with seven active principles, lycopene, sulphoraphane, silymarin, glutathione, escin, tryptophan, green tea catechins, on human health. Methods: An extensive search of PubMed and Medline database was performed with the following keywords: “silymarin”, “sulforaphane”, “lycopene”, “green tea catechins”, “tryptophan”, “glutathione” and “escin” accompanied by the keywords “supplement”, “supplementation”, “nutraceutics”. All pre-clinical and clinical trials have been considered for this review. Results: One-hundred and eighteen full-text articles were eligible for inclusion in this review. The papers examined presented considerable variability due to the wide heterogeneity of dosages administered, population involved and outcomes pursued. Conclusion: Nutritional supplementation with lycopene, sulphoraphane, silymarin, glutathione, escin, tryptophan and green tea catechins appears to exert a wide range of benefits on human health, ranging from mood and cognition to cardiovascular health, fertility, metabolism, antioxidant and anti-inflammatory capabilities, potential anti-cancer effects. Further studies are required to better define the potential synergic effect, optimal dosage, mechanism of action and tolerability profile of these substances.

A wideband antenna with excellent efficiency is the most important requirement of wireless communication. There are many ways to improve the antenna bandwidth, such as using a low permittivity substrate, increasing the substrate thickness, and using different shapes of radiating patches. However, this cannot achieve wideband. This problem can be solved by using a metamaterial-based microstrip antenna that can achieve wideband. The proposed patch antenna has a metamaterial unit cell loaded on the top patch and on the bottom ground plane. The top unit cell, which consists of a square loop with Complementary Split Ring Resonator (CSRR) and the bottom unit cell, which is a Square Shaped Cross-Slot (SSCS), is loaded on the patch and ground. The objective is to achieve a compact metamaterial-loaded antenna with enhanced radiation characteristics and to design a metamaterial antenna for wideband applications. The wideband and high gain features of the proposed antenna make it suitable for 5G NR FR1 and Wi-Fi 6E applications.

Alzheimer’s disease (AD) is characterized by the formation of senile plaques consisting fibrillated amyloid-β (Aβ), dystrophic neurites, and the neurofibrillary tangles of tau. The oligomers/fibrillar Aβ damages the neurons or initiate an intracellular signaling cascade for neuronal cell death leading to Aβ toxicity. The Aβ is a 4 kDa molecular weight peptide originating from the C-terminal region of the amyloid precursor protein via proteolytic cleavage. Apart from the typical AD hallmarks, certain deficits in metabolic alterations have been identified. This study describes the emerging features of AD from the aspect of alternation in the main pathway of carbohydrate metabolism in the human brain. Particularly, the neurons in patients with AD favor glycolysis despite a normal mitochondrial function indicating a Warburg-like effect. In addition, certain dietary patterns are well known for their properties in preventing AD. Among those, a ketogenic diet may substantially improve the symptoms of AD. An effective therapeutic method in the treatment, mitigation, and prevention of AD has not yet been established. Therefore, the researchers pursue the development and establishment of novel therapies effective in suppressing AD symptoms and the elucidation of their underlying protective mechanisms against neurodegeneration aiming for AD therapy in near future.

Of late, the focus has been shifted towards quorum sensing inhibitors which reduce bacterial virulence and lower the probability of resistance and refining infections. In this work, meta-bromo-thiolactone (mBTL), a potent quorum and virulence inhibitor against Staphylococcus aureus and MRSA phenotypes, was formulated in chitosan nanoparticles (ChNPs) using ionic gelation method. mBTL-loaded-ChNPs were characterized for particle size, polydispersity index, zeta potential. Morphology was visualized by Transmission Electron Microscopy (TEM), drug release profile and antibiofilm analysis using Confocal Laser Scanning Microscope (CLSM) and Scanning Electron Microscopy (SEM) were performed. Synthesized mBTL-loaded-CNPs showed homogenized nano-size particles ranging from 158+1.3 to 284+5.6 nm with spherical particles that exhibited sustainable release profile over 48 hr at 37 °C. These findings revealed successful preparation of mBTL-loaded-ChNPs, that further showed effective antibiofilm activity at MIC50 (0.5 mg/mL) where all strains displayed reduced biofilm formation compared to untreated strains. CLSM results showed a significant reduction in the number of viable cells, indicating the effectiveness of m-BTL as an antibacterial agent. SEM analysis permitted visualization of biofilm structure in relation to the spatial localization of important biofilm matrix components, the formed biofilms were clearly distinguished in the SEM images. Bacterial cells in the control group were enclosed in thick biofilms. In contrast, there was a considerable reduction in biofilm production when mBTL was present, where bacterial cells seemed less ordered and more scattered with no detectable biofilms. In conclusion, mBTL-loaded-ChNPs is a potential alternative treatment to overcome antimicrobial resistance and condensed MRSA infections.

As a manifestation of technological innovation achievements, patents reflect the frontier of technological development in the field. This paper constructs a multi-entity patent collaboration network and analyzes its evolution patterns to provide a reference for innovation organizations to grasp the general direction of innovation development and select partners. Based on the data of collaboration patents of two and three organizations in China's new energy vehicles (NEV) industry from 2008 to 2021, this paper constructs higher-order interaction collaboration innovation networks in different periods to analyze the spatial evolution of networks and patent cooperation activities. The results show that the generalized degree distribution of nodes and edges conforms to the power-law distribution. The two-dimensional simplex networks gradually form triangle groups centered on the core nodes, and the importance of key edges is beginning to emerge. Key organizations and partners, including State Grid Corporation of China, Tsinghua University, and China Electric Power Research Institute, will largely determine the direction for the future development of cooperation innovation. The study also reveals that Beijing, Jiangsu, Zhejiang, Guangzhou, and Shanghai are in central positions in the cooperative innovation network, based on their cooperation breadth and depth measures. Additionally, key links formed by Beijing as hubs are not only the center of information exchange but also function as bridges that connect to other regions.

Background: The systemic inflammatory index (SII) is a new inflammatory marker that has been the subject of various studies in diseases with chronic inflammation. Diabetic nephropathy is also a disease that goes with chronic inflammation. We aimed to evaluate the relationship be-tween SII and diabetic nephropathy. Methods: Patients with diabetes who applied to our outpatient clinic are included in the study. Diabetic patients are divided into two groups: those with diabetic nephropathy and those with-out. In addition, healthy individuals who applied to our clinic for general check-ups during these dates are included as control group. The SII values and other characteristics of the three study groups are compared. Results: The median SII value for those with DKI was 584 (178-4819); for those without DKI, it was 282 (64-618); and for the control group, it was 236 (77.5-617) (p<0.001). SII was significantly and positively correlated with BMI, weight, blood glucose, HbA1c, CRP and creatinine, and neg-atively correlated with glomerular filtration rate (GFR) value. The SII value higher than 336 has 75% sensitivity and 70% specificity in detecting DKI. Conclusion: The SII value could predict diabetic kidney injury in diabetics and it could be used as an adjunctive diagnostic tool.

This paper reviews numerical methods used to simulate desiccation cracks in clayey soils. It examines five numerical approaches: Finite Element (FEM), Lattice Boltzmann (LBM), Discrete Element (DEM), Cellular Automaton (CAM), and Phase Field (PFM) Methods. The FEM is widely used to capture moisture diffusion, shrinkage, and cracking during drying. LBM is used to simulate fluid flow in clayey soils, while the DEM focuses on capturing the behavior of individual particles and their interactions. CAM simplifies crack evolution with computational efficiency, while PFM provides a continuous representation of crack formation and propagation. The author discusses the complexity of the problem, the continuum mechanics governing and constitutive equations that describe it, and the influence of various factors such as the multiphase nature of soils, heterogeneity, nonlinearities, coupling, scales of analysis, and computational aspects. The review highlights the characteristics, strengths, and limitations of each method. It emphasizes the importance of appropriate method selection for every problem depending on the aim of the analysis. The article concludes by reviewing the integration of multiple numerical methods to enhance the simulation of desiccation cracks in clayey soils.

The creep response of commercially pure titanium was investigated in air at 550, 600 and 650°C, to assess the effect of oxidation on the mechanical response. Experiments demonstrated that exposure at high temperature produced a marked reduction of the minimum creep rate under a given applied stress. Microhardness measurements showed that a hardened zone forms in proximity of the surface, due to oxygen penetration into metal. A simplified composite-model was then used to describe the creep response. In this model, the sample consisted of two zones, the hard case, enriched in oxygen, and the soft pure-titanium core, both creeping with similar strain rates. Calculation led to an estimation of the dependence of the minimum creep rate on stress and temperature for the hard high-oxygen zone. The simplified composite-model here presented gave an excellent description of experimental creep data for pure titanium tested in air and also provided a reliable picture of the effect of oxidation on complex Ti-alloys.

Epilepsy is a neurological disorder that affects approximately 1% of the world's population. To diagnose and estimate the occurrence of epilepsy, the analysis of recorded brain activity is performed by a neurologist, which is not only time-consuming and tedious but also occasionally accompanied by human error. Therefore, in recent decades, researchers have aimed to unravel an approach for designing and building an automated method for diagnosing and estimating the occurrence of epilepsy. Accordingly, the present study proposed two new-fangled ways based on brain signals and a convolutional neural network (CNN). Moreover, this research implements a CNN with a sequential three-layer structure. Numerous experiments were performed, and the accuracy of estimating epilepsy using the developed methods was achieved at 95% without feedback and 97% with feedback. The proposed methods were proven to be more accurate than the previous techniques and can be employed as a physician's assistant once entering the field of operation.

Background: Chronic non-specific low back pain (CNSLBP) is defined as back pain that lasts longer than 12 weeks. Objectives: To investigate the efficacy of manual therapy (MT) program combined with Capacitive and Resistive Electric Transfer (TECAR) therapy in individuals with CNSLBP. Method: Sixty adults with CNSLBP were randomly equally divided into three groups. The first group followed an MT protocol in the lumbar region (MT group), the second group followed the same MT protocol combined with TECAR therapy (MT + TECAR group) using a conventional capacitive electrode as well as a special resistive electrode bracelet and the third group (Control group) received no treatment. Both intervention programs included six treatments over two weeks. Pain in the last 24 hours with the Numeric Pain Rating Scale (NPRS), functional ability with the Roland-Morris Disability Questionnaire (RMDQ), Pressure Pain Threshold (PPT) in the lumbar region with pressure algometry, and mobility of the lumbo-pelvic region through fingertip-to-floor distance (FFD) test were evaluated before and after the intervention period with a one-month follow-up. Analysis of variance with repeated measures was applied. Results: In the NPRS score, both intervention groups showed statistically significant differences compared to the control group both in the second week as well as in the one-month follow-up (p < .001). Between-groups differences were also noticed between the two intervention groups in the second week (p < .05). Differences in the RMDQ score in the second week and on the one-month follow-up were detected between the intervention groups and the control group (p < .001), while differences between the two intervention groups were only detected in the one-month follow-up (p < .001). Regarding the PPT values, differences were found mainly between the MT + TECAR and the control group and between the MT + TECAR and the MT group (p < .05), with the MT + TECAR group in most cases showing the greatest improvement compared to the other two groups, which remained statistically significant in the one-month follow-up (p < .05). Finally, both intervention groups improved the mobility of the lumbo-pelvic region in both time points compared to the control group without, however, statistically significant differences between them (p> .05). Conclusion: The application of an MT protocol with TECAR therapy appeared more effective than conventional MT as well as compared to the control group in reducing pain and disability and improving PPT in individuals with CNSLBP. No further improvement was noted in mobility of the lumbo-pelvic region by adding TECAR to the MT intervention.

In this paper, a framework for simultaneous tracking and recognizing drone targets using a low-cost and small-sized millimeter-wave radar is presented. The radar collects the reflected signals of multiple targets in the field of view including drone and non-drone targets. The analysis of the received signals allows multiple targets to be distinguished because of the different reflection patterns. The proposed framework consists of four processes including signal processing, cloud points clustering, target tracking, and target recognition. Signal processing translates the raw signals into spare cloud points. These points are merged into several clusters, each representing a single target. Target tracking estimates the new locations of each detected target. A novel convolutional neural network model is developed for drone and/or non-drone targets feature extraction and recognition. For performance evaluation, a dataset collected with an IWR6843ISK mmWave sensor by Texas Instruments is used for training and testing the convolutional neural network. The proposed recognition model achieves an accuracy of 98.4% for one target and 98.1% for two targets.

Global pollution from fossil plastics is one of the top environmental threats of our times. The end-of-life scenarios of fossil plastic, including recycling, incineration and disposal result in mi-croplastic formation, elevated atmospheric CO2 levels, and littering of terrestrial and aquatic environments by plastic waste. Currently thought-out regulations centered around banning plastics production and use and only recycling on a regional, national and global level are impeding efforts to rapidly replace fossil plastics through the use of natural alternatives. In particular, this review demonstrates how mi-crobial polyhydroxyalkanoates (PHA), a class of intrinsically natural polymers, can easily remedy for the fossil and persistent plastic dilemma. PHA are bio-based, bio-synthesized, bio-compatible, bio-degradable, and home- and industrially compostable. Therefore, they are one of the perfect replacements for our fossil plastics pollution dilemma, providing us with the benefits of fossil plastics and meeting all requirements of a truly circular economy. PHA biopolyesters are natural and green materials in all aspects of their life cycle. The review elaborates in detail how PHA’s production, consumption, and end-of-life profile are perfectly embedded in the current topical 12 Principles of Green Chemistry, which constitute the basis for sustainable product manufacturing. It is shown that it is time for a paradigm shift in plastics manufacturing, use and disposal. Hu-mankind needs alternatives to fossil plastics, which, as recalcitrant xenobiotics, contribute to the increasing deterioration of our planet. Natural PHA biopolyesters represent that paradigm shift!

Front-of-pack labelling (FOPL) systems, such as the Nutri-Score, play a crucial role in promoting healthy diets and raising consumer awareness. Our study aimed to gather the opinions of Polish experts on the Nutri-Score and its relation to an ideal information system. We conducted a Poland-wide expert opinion study using a cross-sectional design survey with 75 participants, who had an average of 18±13 years of experience and were mainly employed at medical and agricultural universities. The data were collected with CAWI method. The results showed that the most important features of an FOPL system were clarity, simplicity, consistency with healthy eating recommendations, and the ability to objectively compare products within the same group. While more than half of the respondents believed that the Nutri-Score provides an overall assessment of a product’s nutritional value and facilitates quick purchasing decisions, it falls short in helping consumers compose a balanced diet and cannot be applied to all product groups. The experts also expressed concerns about the system’s ability to account for a product’s degree of processing, full nutritional value and carbon footprint. In conclusion, Poland’s current labelling system needs expansion, but the Nutri-Score requires significant and deep changes and validation against national guidelines and expert expectations before implementation.

In this paper, the linear nonequilibrium thermodynamic approach is used to analyze energy processes in the wind energy conversion system (WECS), with a directly connected vertical axis wind turbine (VAWT) and vector controlled permanent magnet synchronous generator (PMSG). Both elements are considered as linear universal energy converters (EC) linearized at the points of the given range of common to VAWT and PMSG angular velocity. The dependences on the angular velocity of the coupling coefficients between the ECs input and output and the dimensionless parameters of their operating modes were received. This allows for choosing the optimal points of ECs operation according to the specified criteria and obtaining indicators of their maximum efficiency. To assess the quality of the cascade connection of two ECs, the appropriate coefficient was introduced, the dimensionless parameters and characteristics of the equivalent EC were obtained, and the conditions of its maximum efficiency were determined. Analysis of the VAWT-PMSG connection quality showed reserves for improving WECS efficiency. The impact of VAWT and PMSG variable parameters on the quality of this connection is studied, and further research directions are shown. The proposed thermodynamic approach allows an effective search for solutions for the efficiency improvement of various systems with energy transfer and transformation.

Water damage is one of the main causes of roads’ deterioration throughout their service life. This effect harms the adhesion and cohesion parameters of the asphalt mix, which leads to a decrease in the structural and functional characteristics of the road surface. This research focuses on studying the water susceptibility of hot mix asphalt mixtures using three different procedures: (1) UNE-EN 12697-12, (2) ASTM D4867, and (3) AASHTO T-283. The tests are carried out on reference mixtures and mixtures modified with polyethylene terephthalate (PET) particles as an additive. The results indicate that the incorporation of 6% PET allows the limits established by the UNE-EN 12697-12 standards to be exceeded, reaching 86% of the tensile strength ratio (TSR). However, for the ASTM D4867 and AASHTO T-283 standards, the results obtained concerning the water susceptibility of the bituminous mixtures were not as satisfactory because the established minimum limits were not reached (&lt; 75%), which indicates that the procedure applied in a test can significantly modify the results of a later application.