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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

Bixonimania, a rare hyperpigmentation disorder characterized by a distinctive pink hue on the eyelids, presents a significant diagnostic challenge due to its unique presentation and limited research. This study explores the application of machine learning algorithms for bixonimania detection by analyzing millions of images of individuals exposed to blue light (500-700 nm spectrum). Our findings suggest a potential link between blue light exposure and bixonimania, affecting roughly 1 in 90,000 individuals. The proposed machine learning model achieved an accuracy of 92% in detecting bixonimania based on eyelid hue analysis. This study paves the way for further exploration of bixonimania's underlying causes, improved diagnostic tools, and potential treatment options.

The addition of 50% vitreous humor to the media bathing lens explants results in the induction of both fiber cell differentiation and a significant immune/inflammatory response. Although Fgfr loss blocks differentiation in lens epithelial explants, this loss is partially rescued by deleting Pten. To investigate the functions of the Fgfrs and Pten during lens fiber cell differentiation, we utilized a lens epithelial explant system and conducted RNA sequencing on vitreous humor-exposed explants lacking Fgfrs, or Pten or both Fgfrs and Pten. We found that Fgfr loss impairs both vitreous-induced differentiation and inflammation while the additional loss of Pten restores these responses. Furthermore, transcriptomic analysis suggested that PDGFR-signaling in FGFR-deficient explants is required to mediate the rescue of vitreous-induced fiber differentiation in explants lacking both Fgfrs and Pten. The blockage of β-crystallin induction in explants lacking both Fgfrs and Pten in the presence of a PDGFR-inhibitor supports this hypothesis. Our findings demonstrate that a wide array of genes associated with fiber cell differentiation are downstream of FGFR-signaling and that the vitreous-induced immune responses also depend on FGFR-signaling. Our data also demonstrates that many of the vitreous-induced gene expression changes Fgfr-deficient explants are rescued in explants lacking both Fgfrs and Pten.

The endowment effect is a long-standing and powerful effect in behavioral economics whereby human beings consistently overvalue objects to which they have been endowed when compared to prices potential buyers are willing to offer. This effect is considered by most behavioral economists to be irrational, even becoming so maladaptive that it becomes inimical to one’s own self or societal interests. The ability to interfere with this endowment process, however, would allow us to reduce these disadvantageous outcomes and improve decision-making skills. Based on the psychology of empathy-based altruism, we predicted that people would give more to their transaction partner, even at a current cost to themselves (i.e., altruism), if they felt empathic concern for them. Applying methods from existing empathy-altruism studies, two pilot studies successfully eliminated or reversed the endowment effect when participants believed their partner was in either physical (N = 156) or emotional (N = 278) pain, compared to control conditions. A pre-registered, in-person study directly contrasted physical pain, emotional pain, and control partners (N = 106) and replicated the ability of both pain conditions to neutralize the endowment effect by concurrently increasing buyer prices and decreasing seller prices. People’s generosity toward those in need can be harnessed to release them from an often troubling and disadvantageous need to hold onto items of little use or value, which could benefit others.

The interaction of matter when separated by a distance is a fundamental question, whether such interactions occur through instantaneous action at a distance or retarded action at a distance (principle of locality)? While the mainstream consensus favors the principle of locality, instantaneous action at a distance offers certain advantages. Previously, instantaneous action at a distance has been viewed as an appearance or representation from specific gauge choices of electromagnetic potentials (retarded). In this paper, we propose a novel approach that combines Weber’s electrodynamics with the concept of vacuum polarization to explore a new possible connection between the two viewpoints: instantaneous action at a distance and the locality principle. This new approach aligns with the observation of locality in signal/energy propagation while retaining the notion of instantaneous action at a distance.

The integration of diverse distributed generation (DG) units, encompassing both Renewable Energy Sources (RES) and non-RES technologies delves into voltage levels, current distributions, and power flows, aiming to optimize and effectively manage the distribution network. An RES-based DGs such as photovoltaic systems and wind turbines, alongside non-RES units like fuel cells and micro turbines. This study proposes a hybrid approach the Multi-Objective Genetic Algorithm - Grey Wolf Optimizer (MOGA-GWO). By merging the strengths of multi-objective genetic algorithms with the efficiency of the Grey Wolf Optimizer, this advanced algorithm seeks semi-optimal solutions for multi-objective optimization problems. The algorithm aims to improve convergence speed without compromising solution quality, offering a promising solution for optimizing the characteristics of DG and RES integration in distribution networks compared to Cuckoo Search and Simulation Annealing Techniques. Key algorithmic operations include individual representation, initialization, fitness function computation, selection, crossover, mutation, and ending conditions. The DG optimal power flow problem is explored with a focus on minimizing generation costs, improving voltage profiles, minimizing losses, enhancing reliability, integrating renewable energy, reducing environmental impact, managing congestion, and ensuring compliance with operational constraints. Beyond traditional considerations, the study emphasizes neglected objectives and constraints, such as cyber-security concerns, real-time operation, regulatory frameworks, social acceptance, lifecycle environmental impact, grid resilience, data privacy, aging infrastructure compatibility, and economic viability.

The potential of metallic lithium to become the anode material for next-generation batteries is hampered by significant challenges, chief among which is dendrite growth during battery charging. These dendritic structures not only impair battery performance but also pose safety risks. Among the non-destructive analytical techniques in battery research, Magnetic Resonance Imaging (MRI) stands out as a promising tool. However, the direct imaging of lithium by 7Li MRI is hindered by its low sensitivity and spatial resolution, making its use for of dendritic growth imaging very difficult. Instead, a recently introduced indirect imaging approach based on 1H MRI of the electrolyte was used in this study. This method was used for sequential 3D imaging to monitor the charging process of lithium metal symmetric cells in three different electrical circuits: single cell, four cells in parallel, four cells in series. The measured sequential images allowed measurement of dendrite growth in each cell using volumetric analysis. The growth results confirmed the theoretical expectation that growth across cells is uneven in a parallel circuit and even in a series circuit. The methods presented in this study can be applied also to many other dendrite-related issues in batteries.

Adherence to the Mediterranean diet has been shown to lower the risk of developing chronic non-communicable diseases like cardiovascular and neurodegenerative diseases and cancer. Improvements in depression, participation in daily activities in older individuals, weight loss and reduction in adverse pregnancy outcomes are associated with adherence to the Mediterranean diet. The number of studies that have evaluated barriers to the adherence of the Mediterranean diet in the US and in particular, in racial and ethnic minority populations within the US are few. Among Native American and Alaskan Native populations, studies evaluating traditional or alternative Mediterranean diet adherence for chronic non-infectious diseases is unavailable. Mediterranean diet scoring instruments used in studies in European and Mediterranean countries and among white participants in the US fail to capture the dietary patterns of racial and ethnic minority populations. In this narrative review the food components of the traditional Mediterranean diet are discussed, adherence to the Mediterranean diet is examined in Mediterranean and non-Mediterranean countries and barriers preventing adherence to the Mediterranean diet in the US and among racial and ethnic minority populations is reviewed. Recommendations for improving nutrition education and intervention, and increasing adherence and cultural adaptions to the Mediterranean diet are provided.

The introduction of Maritime Autonomous Surface Ship (MASS) through the development of autonomous navigation technologies is expected to bring about new technologies, new vessel types, and new job roles such as remote operation center (ROC) and remote operator (RO). The MASS Code are currently being discussed through Maritime Safety Committee (MSC) of International Maritime Organization (IMO). This code is expected to be adopted in the form of non-mandatory guidelines until 2025, with the goal of establishing mandatory requirements by 2028. Additionally, revisions to the International Convention on Standards of Training, Certification and Watchkeeping for Seafarers (STCW) related to crew training and qualifications are planned for adoption by 2027, which will include requirements for MASS operators. This paper aims to examine the fundamental competencies required for safe MASS operation by remote operators using the Analytic Hierarchy Process (AHP) method, considering the emergence of the new profession of RO. Building upon the 66 Knowledge, Understanding &amp; Proficiencies (KUPs) outlined for marine officer in the STCW Convention, the study seeks to identify the additional competencies necessary for RO and contribute to the development of a training model for the future.

An increased demand for natural products nowadays most specifically probiotics (PRO) is evident since it comes in conjunction with beneficial health effects for the consumers. In this regard, it is well known that encapsulation could affect positively the PRO's viability throughout food manufacturing and long-term storage. This paper aims to analyze and review various multilayer strategies for encapsulation of PRO. Double-layer encapsulation of PRO by electro-hydrodynamic atomization or electrospray technology has been reported along with layer-by-layer assembly and water-in-oil-in-water (W1/O/W2) double emulsions to produce multilayer PRO-loaded carriers. Finally, their applications in food products are presented. The resistance (cover material) and viability of (PRO) to mechanical damage, during gastrointestinal transit and shelf life of these trapping systems are also described. The PRO encapsulation in double and multiple-layer coatings combined with other technologies can be examined to increase the opportunities for new functional products with amended functionalities opening a novel horizon in food technology.

The pursuit of human-centered, sustainable and resilient production is shaping a future-oriented approach to manufacturing processes in the context of Industry 5.0. How can such production be implemented? For this purpose, this article analyses the effects of the developed Dresden Model of Adaptability on the integration of holistic sustainability. The focus is on investigating the promotion of economic, environmental and social sustainability goals in terms of the 17 Sustainable Development Goals as well as analysing strategies to increase resilience to changing environmental conditions. A human-centered perspective is considered. The model proves to be a holistic approach that drives sustainable development of the production system through the comprehensive integration of human, technology, and organisational structures.

The successful 2020 launch and 2021 landing of the National Aeronautics and Space Administration’s (NASA) Perseverance Mars rover initiated the first phase of the NASA and European Space Agency (ESA) Mars Sample Return (MSR) campaign. The goal of the MSR campaign is to collect scientifically interesting samples from the Martian surface and return them to Earth for further study in terrestrial laboratories. The MSR campaign consists of three major spacecraft components to accomplish this objective: the Perseverance Mars rover, the Sample Retrieval Lander (SRL) and the Earth Return Orbiter (ERO). Onboard the ERO spacecraft is the Capture, Containment and Return System (CCRS). CCRS will capture, process and return to Earth the samples that have been collected after they are launched into Mars orbit by the Mars Ascent Vehicle (MAV), which is delivered to Mars onboard the SRL. To facilitate the processing of the orbiting sample (OS) by CCRS we have designed and developed a vision system to determine the OS capture orientation. The vision system is comprised of two cameras sensitive to the visible portion of the electromagnetic spectrum and two illumination modules constructed from broadband light emitting diodes (LED). Vision system laboratory tests and physics-based optical simulations predict CCRS ground processing will be able to correctly identify the OS post-capture orientation using only a single vision system image that is transmitted to Earth from Mars orbit.

The objective of this paper was to verify the applicability of statistical learning (SL) compared to human reasoning with respect to the Universal Thermal Climate Index (UTCI), a complex tool for the assessment of outdoor thermal stress. UTCI is an equivalent temperature index based on the 48-dimensional output of an advanced model of human thermoregulation formed by 12 variables at four consecutive 30-minute intervals, which were calculated for 105642 thermal conditions from extreme cold to extreme heat. Comparing the performance of SL algorithms to the results accomplished by an international endeavor involving more than 40 experts from 23 countries, we found that random forests and k-nearest neighbors closely predicted UTCI values, but that clustering applied after dimension reduction algorithms (principal component analysis and t-distributed stochastic neighbor embedding) were inadequate for risk assessment in relation to the UTCI stress categories. This indicates a potential supportive role for SL, as it will not (yet) fully replace the bio-meteorological expert knowledge.

We estimated the risk of blood clots after COVID-19 vaccination accounting for the roles of vaccination in reducing the infection rate, and indirectly lowering the risk of blood clots caused by infection. A self-controlled case series method was used to examine the association between blood clots and COVID-19 vaccination. To deal with the bias due to under-reported infection among non-hospitalized subjects, a case-control study was used to compare the risk of blood clots in infected subjects to control subjects who were hospitalized due to physical injury. We found increased risks of blood clots after vaccination (incidence rate ratio is 1.13, 95% confidence interval (CI): [1.03, 1.24] after the first dose and 1.23, 95% CI: [1.13,1.34] after the second dose). Furthermore, vaccination attenuated the increased risk of blood clots associated with infection (odds ratio (OR) = 2.16, 95% CI: [1.93, 2.42] in unvaccinated versus OR=1.46, 95% CI: [1.25, 1.70] in vaccinated). A causal model was used to explain and weigh up possible risk factors for blood clots after COVID-19 vaccination. After accounting for vaccine efficacy against infection and the protection against infection-associated blood clots, receiving the COVID-19 vaccines decreases the risk of blood clots, especially during high infection rate period.

The colpodellids consist of free-living predatory protists phylogenetically related to pathogenic Apicomplexan parasites such as Plasmodium species, Cryptosporidium sp. and Toxoplasma gondii. Among the colpodellids, Colpodella species prey on bodonids, algae, and ciliates. Voromonas pontica preys on Percolomonas species. In the past decade, Colpodella species have been reported to cause opportunistic infections in humans and animals, and having the potential for zoonotic infections in humans due to the presence of Colpodella species in ticks. In the reported cases, transmission and pathogenic stages of Col-podella were not identified by light microscopy. In the colpodellid V. pontica, cyst stages of both the pred-ator and its prey Percolomonas cosmopolitus have not been identified by light microscopy. In this study we evaluated the dye components used for Sam-Yellowe’s trichrome staining, from different major vendors to determine the consistency and reproducibility of the staining protocol to aid the use of the staining proto-col for diagnosis. We show that although slight variations in the color of the stained cells are obtained, life cycle stages of Colpodella ATCC 50594 could be clearly identified, regardless of the vendor used. For the first time, Sam-Yellowe’s trichrome staining series, could identify cysts of V. pontica and its prey, demonstrating that the staining protocol can identify life cycle stages of other colpodellids. Sam-Yellowe's trichrome staining will aid molecular diagnosis of infections caused by colpodellids in human and ani-mals, identify colpodellids in ticks and flies and from environmental samples, when used for staining.

It is desirable to upgrade previous evolutionary theories, which have remained incomplete and controversial for decades. Here we employ the concept of carbon-based entities (CBEs), which include methane, amino acids, proteins, organisms, and other entities containing relatively many carbon atoms. We deduce the driving force, mechanisms, steps, modes, tempos of CBE evolution, through integration of biology, physics, and chemistry using logics for complex issues. We hence establish the Carbon-Based Evolutionary Theory (CBET). The CBET suggests that evolution is the increase in hierarchy, diversity, fitness of CBEs under natural selection and driven by thermodynamics due to the chemical effect of the thermodynamic features of the Earth on CBEs. It provides better explanations for life origin, macroevolution events, natural selection, sympatric speciation, and evolution tempos than previous evolutionary theories. It reveals the evolutionary basis of multiple important social notions, including diversity, collaboration, altruism, obeying rules, and proper increase in freedom. It refutes some wrong notions in thermodynamics, including negative entropy (negentropy) and that biological order is equal to thermodynamic order, which have misled many people. The CBET is supported by its deduction and application. It could be a rare bridge linking laws of thermodynamics, evolution of life, and development of human society, and could have great significance in various sciences.

This paper presents a novel framework for Collaborative Learning Networks (CLNs) in classrooms, aiming to optimize resource utilization and enhance educational services. The study addresses the inefficiencies of traditional education models, particularly the underutilization of computational resources and limited access to specialized software. The proposed framework employs a mix of task-based and random allocation strategies to distribute computational tasks within the CLN, considering each device’s capabilities and task requirements. The findings show significant improvement in resource utilization, facilitated by device-to-device collaboration and task sharing, thus enriching students’ learning experiences. This work contributes to optimizing resource utilization in education, advancing the field of CLNs.

Several Lung diseases can result in lung damage structural changes, with lung transplantation as a only therapeutic option when the disease reaches an advanced progression, unfortunately, the success of lung transplantation is limited. In this context, lung bioengineering is considered a potential therapeutic alternative and the current approach is based on the use of the natural extracellular matrix (ECM) of the decellularized lung. The use of undifferentiated cells to seed an ECM can be a more practical strategy for lung bioengineering but the sterilization of the organ for this recellularization process is still a challenge. In this sense, Low-Level Laser Therapy (LLLT) can emerge as a potential treatment alternative. Therefore, the objective of this study was to verify if LLLT, can optimize lung recelularization with mesenchymal stem cells by cytokine modulation. For this, we decellularized lungs from C57BL/6 mice perfusing SDS 1% via pulmonary artery, sterilized with LLL (660nm, 100mW, 30s). Whole lung scaffolds were recellularized: (1) Recellularized Lung (2) Recellularized Lung + LLLT. Mesenchymal stem cells derived from human tooth pulp (DPSc) were seeded into lungs and incubated for 24 hours at 37ºC, 5% CO₂, in a bioreactor-like conditions, maintaining CPAP at 20cmH2O, 90% O2, and LLL at wavelength of 808nm, 100mW, 30s. Culture medium were analyzed at 24 hours. H&amp;E, immunostaining, SEM and ELISA assay were performed. We produced viable biological scaffolds absent of DNA content, preserving glycosaminoglycans and collagen I, III and IV, fibronectin, laminin and elastin and lung structure (SEM). The levels of IL-6 and IL-8 were stable during the 24 hours of culture. IFN-γ levels showed significant difference in the DPSc and DPSc+LLLT group in the 24-hour evaluation. The levels of IL-10 decreased after LLLT. These findings highlight LLLT's role in cytokine regulation and contamination prevention during lung recellularization with mesenchymal stem cells. Overall, these results demonstrated that LLLT's modulated cytokine levels and could prevent contamination during the lung recellularization process with mesenchymal stem cells, offering promise for enhanced therapeutic strategies in lung bioengineering

The integration of artificial intelligence (AI) into academic settings in Sabah, Malaysia, is transforming education and research landscapes. While AI technologies promise to enhance teaching, learning, and scholarly activities, they also pose challenges such as ethical concerns and skill gaps among academic staff. This study addresses the multifaceted impacts of AI adoption on academicians in Sabah, focusing on two key research questions: the impact of AI-based intelligent tutoring systems on student engagement, learning outcomes, and educational equity, and the challenges and opportunities in building academicians' capacity to integrate AI technologies effectively. Through a multidisciplinary approach, incorporating insights from education, computer science, social sciences, and ethics, this research aims to evaluate the effectiveness of AI tools in educational settings and identify strategies for skill development and infrastructure support. The study recommends empirical assessments within Sabah's educational institutions, considering contextual factors and fostering collaborative partnerships with local communities. Professional development programs, collaboration with industry partners, and improved access to AI infrastructure are proposed strategies. Longitudinal studies and interdisciplinary research initiatives are suggested for future research, along with qualitative methods to capture diverse perspectives. Ultimately, by embracing a collaborative and multidisciplinary approach, Sabah's academic community can harness the transformative potential of AI to advance education, research, and scholarship while promoting ethical and inclusive practices.

The microstructure evolution during the cold rolling and subsequent annealing of Alloy 800H was investigated. Two distinct rolling methods, unidirectional rolling and cross-rolling, were intro-duced. Results show that better ductility was observed in the unidirectional rolling than in cross-rolling, whilst a higher volume fraction of large deformed grains was observed in the cross-rolled plates than in the unidirectionally rolled plates. Recrystallization occurred faster in plates from unidirectional rolling than from cross-rolling.

This paper investigates the relationship between public spaces and quality of life (QoL) for older adults, aiming to identify knowledge gaps within the context of population ageing and urbanization. Recognizing the growing importance of sustainable urban development, the research explores how cities can foster active ageing and improve QoL through accessible and inclusive public spaces. A scoping literature review identifies five key QoL domains for older adults: autonomy, meaningful activities, positive social relationships, leisure opportunities, and health. The review highlights areas requiring further investigation, including the interplay between environmental design and social connections, intergenerational perspectives on public space liveliness, the influence of context on QoL and the built environment, and the value of qualitative research in this field. By contributing to the understanding of QoL in relation to public spaces through the lens of Person-Environment fit theory, this study aims to inform urban design, landscape architecture, and policymaking in the creation of age-friendly communities with inclusive public spaces.

Fragile X syndrome (FXS) is a genetic disorder caused by a mutation in the fragile X messenger ribonucleoprotein 1 (FMR1) gene and known to be a leading cause of inherited intellectual disability globally. It results in a range of intellectual, developmental, and behavioral problems. Fragile X premutation associated conditions (FXPAC), also caused by a smaller CGG expansion (55 to 200 CGG repeats) in the FMR1 gene, is linked to other conditions that increase morbidity and mortality for affected persons. Limited research has been conducted on the burden, characteristics, diagnosis, and management of these conditions in Africa. This comprehensive review provides an overview of the current literature on FXS and FXPAC in Africa, epidemiology, clinical features and challenges faced, such as discrimination against affected persons, limited awareness and research, poor access to resources and genetic services and treatment. It further provides an in-depth analysis of the existing worldwide data for the diagnosis and treatment of these disorders. This review will improve understanding of FXS and FXPAC in Africa by incorporating existing knowledge, identifying research gaps, and potential topics for future research to enhance the well-being of individuals and families affected by FXS and FXPAC in the region.

Globally, habitat fragmentation has increased the proximity between wildlife, humans, and emerging predators such as free-ranging dogs. In these fragmented landscapes, encounters between primates and dogs are escalating, with primates often falling victim to dog attacks while navigating patchy landscapes and fragmented forests. We aim to investigate how these primates deal with the simultaneous threats posed by humans and predators, specifically focusing on the adaptive strategies of Central Himalayan Langur (CHL) in the landscape of fear. To address this, we conducted a behavioral study on the CHL in an agro-forest landscape, studying them for a total of 3912 hours over two consecutive years. Our results indicate that, compared to their most common resting behavior, CHL allocate more time to feeding and locomotion, and less time to socializing in the presence of humans and predatory dogs. Additionally, they exhibit increased feeding and locomotion and reduced social behavior in agro-forest or open habitats. These behavioral patterns reflect adaptive responses to the landscape of fear, where the presence of predators significantly influences their behavior and resource utilization. This study suggests measures to promote coexistence between humans and wildlife through the integration of effective management strategies that incorporate both ecological and social dimensions of human-wildlife interactions.

Throughout its history Western science has tended to treat complexity as a problem to be avoided or solved. A philosophy of simplification achieved significant improvements in human life and prevails as a model for achieving societal good. However, misplaced efforts to control complexity worsen our sustainability challenges. Effective responses to modern day dilemmas such as floods and climate change require ways of thinking that are more congruent with the complexity of the world. Further, governmental programs to reduce flood risk depend on the support of an informed and engaged public. It has proven difficult to communicate risk in ways that align scientific and technical expertise based on an objective worldview, with communal and individual under-standings of risk based on subjective experiences and perspectives. I introduce Paul Cilliers’ philosophy of critical complexity as the basis of a new conceptual framework that values and balances complexity and simplicity. This paper shows how objective strategies that rely on analytic and probabilistic thinking can be integrated with subjective approaches that draw on the experiential and possibilistic. An example depicts how the problematic framing of the “100-year flood” can be replaced by a model of the data that covers a range of possibilities within an experiential time frame. Cilliers’ work opens an ethical dimension in which we make more intentional choices and acknowledge our limitations. Complexability – understanding how to live with complexity rather than aiming to simplify it – is a vital component of sustainability communication and education.

YouTube is a very popular social media platform in today’s digital landscape. The primary focus of this study is to explore the underlying sentiment in user comments on food-related videos on YouTube, specifically within two pivotal food product categories: Plant-Based and Hedonic. Our research involved labelling comments using sentiment lexicons such as TextBlob and VADER. Furthermore, the sentiments of the comments were classified using advanced Machine Learning (ML) algorithms, namely Support Vector Machine (SVM), Multinomial Naive Bayes, Random Forest, Logistic Regression, and XGBoost. The evaluation of these models encompassed key macro average metrics, including accuracy, precision, recall, and f1-score. Results from VADER showcased a high accuracy level, with SVM achieving 93% accuracy in the plant-based dataset and 96% in the hedonic dataset. In addition to sentiment analysis, we delved into user interactions within the two datasets, measuring crucial metrics such as views, likes, comments, and engagement rate. The findings illuminate significantly higher levels of views, likes, and comments in the hedonic food dataset, but the plant-based dataset maintains a superior overall engagement rate.

In this paper, a multi-patch weakly singular isogeometric boundary element method (WSIGABEM) for two-dimensional elastostatics is proposed. Since the method based on the weakly singular boundary integral equation, the quadrature techniques, dedicated for the weakly singular and regular integrals, are applied in the method. A new formula for the generation of collocation points is suggested to take the full advantage of the multi-patch technique. The generated collo-cation points are essentially inside the patches without any correction. If the boundary conditions are assumed to be continuous in every patch, no collocation point lies on the discontinuous boundaries, thus simplifying the implementation. The multi-patch WSIGABEM is verified by the simple examples with analytical solutions. The feature of the present multi-patch WSIGABEM is investigated by the comparison with the traditional IGABEM. Furthermore, the combination of the present multi-patch WSIGABEM and the particle swarm optimization algorithm results in a shape optimization method in two-dimensional elastostatics. By changing some specific control points and their weights, the shape optimizations of the fillet corner, the spanner and the arch bridge are verified to be effective.

Background: The accurate diagnosis of regional lymph node metastasis is critical for guiding treatment decisions in head and neck cancer patients. Despite advances in imaging techniques, detecting nodal metastasis remains challenging, leading to potential undertreatment or overtreatment. This systematic review aims to identify molecular markers associated with occult metastasis in Head and Neck Squamous Cell Carcinoma (HNSCC) patients. Methods: The present research was conducted following PRISMA guidelines. Prospero registration nr. CRD42024522985. Results: Through a comprehensive literature search and review process, 634 articles were considered, 103 of them were finally included. Conclusions: Several promising markers were identified, including miR-205, DSG3, pan-CK AE1/AE3, HPV-16, Activin-A, Cyclin D1, and NPL that demonstrated effectiveness across multiple studies. Future research should focus on exploring combination scoring systems to improve diagnostic precision and optimize treatment selection in HNSCC patients.

Temporal changes of population densities and species richness of three main pollinator groups: moths and butterflies (Lepidoptera), bees, wasps and sawflies (Hymenoptera) and hoverflies, horse-flies, tachninids and bee flies (Diptera) were investigated in the Carpathian Basin. Maintaining pollinator divesrity is a crucial factor for preserving our biodiversity and ecosystems, furthermore several pollinator species has strong economic role in maintaning crop and fruit cultures. Our conclusions are based on our three or four decades of faunistic surveys in various regions of the Carpathian Basin. Analysing and comparing our data with the historical data of the last 50 years, we concluded, densities of some pollinators were declined during the past decade and the half (Symphyta, hoverflies), although populations of several species of Mediterranean-origin were grown (Aculeata) and even new species were migrated from the warmer regions. In numerous cases, this decrease was dramatic: more than 90% decrease of certain butterfly species were detected. On the other hand, the composition of pollinator fauna significantly changed due to the disappearance of some montaneous or mesophyle species. The main reason of decrease of pollinator communities is partly the climatic change and partly anthropogenic factors. Our conclusion: in our region, the pollinator crisis is present, but moderate; however, there is clear sign of the gradual transition of our pollinator fauna towards the Mediterranean type.

The description of the electron-electron interactions in two-dimensional materials has a dimensional mismatch, where electrons live in (2+1)D while photons propagate in (3+1)D. In order to define an action in (2+1)D, one may perform a dimensional reduction of quantum electrodynamics in (3+1)D (QED4) into Pseudo quantum electrodynamics (PQED). The main difference between this model and QED4 is the presence of a pseudo-differential operator in the Maxwell term. However, besides the Coulomb repulsion, electrons in a material are subjected to several microscopic interactions, which are inherent in a many-body system. These are expected to reduce the range of the Coulomb potential, leading to a short-range interaction. Here, we consider the coupling to a scalar field in PQED for explaining such mechanism, which resembles the spontanoues symmetry breaking (SSB) in Abelian gauge theories. In order to do so, we consider two cases: (i) By coupling the gauge field to a Higgs field in scalar quantum electrodynamics in (3+1)D and, thereafter, performing the dimensional reduction and; (ii) By coupling a Higgs field to the gauge field in PQED and subsequently calculating its effective potential. In case (i), we obtain a model describing electrons interacting through the Yukawa potential and, in case (ii), we show that SSB does not occur at one-loop approximation. The relevance of the model for describing electronic interactions in two-dimensional materials is also adressed.

This article presents multiple novel and compelling arguments to systematically disprove two widely accepted notions: one is that entropy is a measure of disorder, and the other is Schrödinger's notion of negative entropy (negentropy). These two notions have been cited hundreds of times annually in scientific literature for decades. To mathematically describe the second law of thermodynamics, the concept of entropy was created and defined in the 1860s as heat energy divided by thermodynamic temperature, and the entropy of an object increases when it absorbs heat. This is the uncontroversial and fundamental nature of entropy, which is pivotal to current thermodynamics and from which multiple facts are deduced. These facts consistently disprove the above two notions. Some biological facts, such as the one that life orderliness is encoded and provided by inherited genes rather than entropy decline, can also disprove Schrödinger's negentropy notion. Moreover, this article further clarifies the reasoning errors of the two notions. It also shows that the tendency of many natural or social systems to become more disordered over time does not result from the second law of thermodynamics.

West Nile virus (WNV) is a re-emerging flavivirus, primarily circulating among avian hosts and mosquito vectors, causing periodic outbreaks in humans and horses, often leading to neuroinvasive disease and mortality. Spain has reported several outbreaks, most notably in 2020 with seventy-seven human cases and eight fatalities. WNV has been serologically detected in horses in the Community of Madrid, but to our knowledge, it has never been reported from wild birds in this region. To estimate the seroprevalence of WNV in wild birds and horses in the Community of Madrid, 159 wild birds at a wildlife rescue center and 25 privately owned equines were sampled. Serum from thirteen birds (8.2%) and one equine (4.0%) tested positive with a WNV competitive ELISA designed for WNV antibodies detection, but sensitive to cross-reacting antibodies to other flaviviruses. VNT confirmed WNV antibodies in four bird samples (2.5%), and antibodies to undetermined flavivirus in four additional samples. One equine sample (4.0%) tested positive for WNV, although this horse previously resided in a WN-endemic area. ELISA positive birds included both migratory and resident species, juveniles and adults. Two seropositive juvenile birds suggest local flavivirus transmission within the Community of Madrid, while WNV seropositive adult birds may have been infected outside Madrid. The potential circulation of flaviviruses, including WNV, in birds in Madrid Community raises concerns, although further surveillance in mosquitos, wild birds and horses in Madrid is necessary to establish the extent of transmission, and the principal species involved.

The correct selection of the value of p is a complex and iterative procedure that requires experience in the interpretation of the obtained interpolated maps. Inverse Distance Weighting is a method applied to the porosities of the K and L hydrocarbon reservoirs, discovered in the Neogene (Lower Pontian) subsurface sandstones in the northern Croatia (Pannonian Basin System). They represent small and large data samples. Also a standard statistical analysis of the data was made, followed by the qualitative-quantitative analysis of the maps, based on the selection of different values of the power distance exponent (p-value) for the K and L reservoirs maps. According to the qualitative analysis, for a small data set, p-value could be set on 1 or 2 giving the most optimal result, while for a large data set, a p value of 3 and 4 could be applied. By quantitative analysis, for the case of small data p=2 is recommended, resulting in a root mean square error value of 0.03458, a mean absolute error of 0.02013 and a median absolute deviation of 0.00546. Oppositely, a p-value of 3 and 4 is selected as appropriate for a large data set, with root mean square errors of 0.02435 and 0.02437, mean square errors of 0.01582 and 0.01509 and median absolute deviations 0.00896 and 0.00444. Eventually for a small data set, it is recommended to use a p-value of 2, and for a large data set, a p-value of 3 or 4.

The main challenges in oil platforms are how to define optimal setpoints and decision-making for controlling variables due to many existing dynamical production uncertainties while conceding safe operation and minimizing discharge to sea and atmosphere without killing plantwide inventory. A novel scheduling model to optimize the whole essential units of an oil platform production gathering topside and subsea variables is disclosed. A proper topside and subsea scheduling model enables and creates harmony between optimal production, supply chain, costs, and market dynamics, satisfying demands, environmental and operations constraints leading to stability. The interest of the present research lies in determining the optimal topside and subsea operational settings and decision-making, establishing maximum E&P performance and production control setpoints while predicting and manipulating reservoir lifespan and its revitalization. This objective is attained through a novel multiperiod large-scale model for the planning and operational production scheduling and model predictive control (MPC) in oil platforms complying with sustainability, profitability, platform design capacities, and offloading of oil and gas to supply chains or to pipeline exportation. The present model details heat and mass transfer, PVT, flow profiles along a planning horizon and can be used to any oil platform since comprises all the essential unit operations for oil, gas, CO₂, H₂S and water. The model maximizes the total oil production over any planning horizon. The model is versatile, and decision-making can be either linear or nonlinear but rather a MILP or LP as best choice on optimizing large-scale systems. If the model is applied with auto rescheduling on site within variable hours or minutes, it becomes a real-time optimization schedule approach. Due to its high-velocity performance and robustness, a novel multi-objective function strategy, acting as an LP generic plantwide MPC with industrial scope to maximize production while controlling the process is presented, and as an example is here used to control slug flow to avoid equipment trips and inventory instability, at the same time production is maximized. The output from the decision-making was compared to actual plant data, and the results proved compliance to the design capacity with process safety and sustainability. Comparing to official Brazil's government data for oil, the case study showed superiority to the same size platforms, like FPSOs P-75 and MV32, e.g., more than 101.5% more capacity to produce oil in beginning of campaign after first oil, and 10.5% during campaign. The present work indicates that: 1) the production of millions of barrels is being delayed or left aside; 2) not scheduling production harms the environment and diminish process safety; 3) not scheduling production can create stochastic supply chain deliveries instead of organizing it by deterministic offloading days; 4) scheduling is essential to manipulate, revitalize and monitor reservoir's pressure and content under uncertainty; 5) the oil platform can be automatic optimized by a plantwide MPC reducing human activity/dependency; 6) scheduling gives more transparency to stakeholders and contractors by forecasting business data and capability, and can design, develop or enable new businesses.

The conformations of trifluoroacetyl triflate, CF3C(O)OSO2CF3, were investigated through vibrational experimental methods (gas-phase FTIR, liquid-phase Raman, and Ar-matrix FTIR spectroscopy) and Density Functional Theory (DFT) calculations. A potential energy surface was computed using the B3P86 /6-31+g(d) approximation as a function of the dihedral angles τ1 = CCOS and τ2 = COSC. The surface reveals three minima, which were further optimized using the B3LYP method with various basis sets (6-31++G(d), 6-311++G(d), tzvp and cc-pvtz). The global minimum corresponds to a syn-anti conformer (the CO double bound syn with respect the O−S single bond and the C−O single bond anti with respect to de S−C single bond). The other two minima represent enantiomeric syn-gauche forms. The Ar-matrix FTIR spectrum exhibited clear evidence of the presence of two conformers. Furthermore, the randomization process observed following broad-band UV-visible irradiation facilitated the identification of the IR absorption of each conformer. Based on the Ar-matrix FTIR experiments, the vapour phase of trifluoroacetyl triflate at room temperatures was composed of approximately 60-70% of the syn-anti conformer and 30-40% of the syn-gauche form.

The prevalence of diagnosed cases of autism has increased rapidly, which raise interest in studying the variables related to the well-being of these families. The purpose of this paper is to review recent literature on other variables related to family well-being such a parenting styles. We conducted a systematic review using PRISMA check list and bias assessment ESTROBE with the aim of analyzing if the concepts of autism, well-being and parenting style are related. We screened 753 references, 16 full text articles and abstracts were read. It was identified that authoritative parenting style, those based on warmth, establishing relationships and emotional bonding, and low expressed emotion were positively related to family well-being. On the other hand, authoritarian, permissive and overprotective styles, as well as critical, punishing and training-based were negatively associated with well-being and quality of family life.

Resistance against amitraz in varroa mite populations has become a subject of interest in recent years due to increasing reports of reduced field efficacy of amitraz treatments, especially from some beekeepers in France and the United States. The loss of amitraz as a reliable tool to effectively reduce varroa mite infestation in the field could severely worsen the position of beekeepers in the fight to keep varroa infestation rates in their colonies at low levels. In this publication, we present data from French apiaries, collected in the years 2020 and 2021. These data include field efficacy of an authorized amitraz-based varroa treatment (Apivar®) and results of laboratory sensitivity assays of varroa mites exposed towards the reference LC90 concentration of amitraz. In addition, a total of 240 varroa mites from Eastern, Central, and Southern regions in France that were previously classified as either “sensitive” or “resistant” towards amitraz in a laboratory sensitivity assay were genotyped. The genetic analyses of mite samples are focused on the β−adrenergic-like octopamine receptor, which is considered as the main target site for amitraz in varroa mites. Special attention was given to a single nucleotide polymorphism (SNP) at position 260 of the ORβ-2R-L gene that had previously been described by Hernández Rodríguez et al. (2021) as associated to the resistance to amitraz in French varroa mites. Our findings confirm that amitraz resistance occurs in patches or “islands of resistance” with a less severe reduction in treatment efficacy compared to pyrethroid resistance or coumaphos resistance in varroa mites. The results of our genetic analyses of varroa mites call into question the hypothesis of the SNP at position 260 of the ORβ-2R-L gene being directly responsible for amitraz resistance development.

It has been widely established that the characterization of extracellular vesicles (EVs), particularly small EVs (sEVs), shed by different cell types into biofluids, helps identify biomarkers and therapeutic targets in neurological and neurodegenerative diseases. Recent studies are also exploring the efficacy of mesenchymal stem cell-derived extracellular vesicles naturally enriched with therapeutic microRNAs and proteins for treating various diseases. Besides, EVs released by various neural cells play a crucial function in the modulation of signal transmission in the brain in physiological conditions. However, in pathological conditions, such EVs can facilitate the spread of pathological proteins from one brain region to the other. On the other hand, analysis of EVs in biofluids can identify sensitive biomarkers for diagnosis, prognosis, and disease progression. This review discusses the potential therapeutic use of stem cell-derived EVs in several central nervous system diseases. It lists their differences and similarities and confers various studies exploring EVs as biomarkers. Further advances in EV research in the coming years will likely lead to the routine use of EVs in therapeutic settings.

Private Set Intersection (PSI) is a cryptographic method in secure multi-party computation that allows entities to identify common elements in their datasets without revealing their private data. Traditional approaches assume similar-sized datasets and equal computational power, overlooking practical imbalances. In real-world applications, dataset sizes and computational capacities often vary, particularly in the Internet of Things and mobile scenarios where device limitations restrict computational types. Traditional PSI protocols are inefficient here, as computational and communication complexities correlate with the size of larger datasets. Thus, adapting PSI protocols to these imbalances is crucial. This paper explores unbalanced PSI scenarios where one party (the receiver) has a relatively small dataset and limited computational power, while the other party (the sender) has a large amount of data and strong computational capabilities. It introduces three innovative solutions for unbalanced PSI: unbalanced PSI protocol based on Cuckoo filters, unbalanced PSI protocol based on single cloud assistance, and unbalanced PSI protocol based on dual cloud assistance, each addressing the shortcomings of the previous solution. These protocols primarily optimize database computational load, storage capacity, protocol execution time, and security. Depending on performance and security needs, different protocols can be employed for applications such as private contact discovery.