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.

Personalized cancer vaccines have emerged as a promising avenue for cancer treatment or prevention strategies. This approach targets the specific genetic alterations in individual patient’s tumors, offering a more personalized and effective treatment option. Previous studies have shown that generalized peptide vaccines targeting a limited scope of gene mutations are ineffective, emphasizing the need for personalized approaches. While studies have explored personalized mRNA vaccines, personalized peptide vaccines have not yet been studied in this context. Pancreatic ductal adenocarcinoma (PDAC) remains challenging in oncology, necessitating innovative therapeutic strategies. In this study, we developed a personalized peptide vaccine design methodology, employing RNA sequencing (RNAseq) to identify prevalent gene mutations underlying PDAC development in a specific patient solid tumor tissue. We performed RNAseq analysis for trimming adapters, read alignment, and somatic variant calling. We also developed a Python program, called GeneFinder, which validates the alignment of the RNAseq analysis. The Python program is freely available to download. Using chromosome number and locus data, GeneFinder identifies the target gene along the UCSC hg38 reference set. Based on the gene mutation data, we developed a personalized PDAC cancer vaccine that targets 100 highly prevalent gene mutations in the individual patient. We predicted peptide-MHC binding affinity, immunogenicity, antigenicity, allergenicity, and toxicity for each epitope. Then, we selected the top 50 and 100 epitopes based on our previously published vaccine design methodology. Finally, we generated pMHC-TCR 3D molecular model complex structures which are freely available fo download. The designed personalized cancer vaccine contains epitopes commonly found in PDAC solid tumor tissue. Our personalized vaccine was composed of neoantigens, allowing for a more precise and targeted immune response against cancer cells. Additionally, we identified mutated genes which were also found in the reference study where we obtained the sequencing data, thus validating our vaccine design methodology. This is the first study designing a personalized peptide vaccine using human patient data to identify gene mutations associated with the specific tumor of interest.

In this work, a GaN-on-Si quasi-vertical Schottky diode was demonstrated on a locally grown n-GaN drift layer. The diode achieves a high current density of 2.5 kA/cm², a specific on-resistance RON,sp of 1.9 mΩ.cm² despite the crowding effect in quasi-vertical device and on/off current ratio (Ion/Ioff) of 1010. Temperature-dependent current-voltage characteristics have been measured in the range of 300-433 K to investigate the mechanisms of leakage conduction in the device. At near zero bias, thermionic emission (TE) was found to dominate. At voltage range from -1 to -10 V, electrons gain enough energy to excite into trap states, leading to the dominance of Frenkel-Poole emission (FPE). For a higher voltage range (-10V to -40V), the increased electric field promotes electron hopping along the threading dislocations in the “bulk” GaN layers, and thus, Variable Range Hopping becomes the main mechanism for the whole temperature range. This work provides an in-depth insight into the leakage conduction mechanisms on vertical GaN-on-Si Schottky barrier Diodes (SBDs) grown by localized epitaxy.

This paper is showing the results of a study focused on the occurrence of failures in heterogeneous structural materials, especially on the issue of modelling the formation and propagation of cracks. Attention is paid to the application of the finite element method to various types of materials in order to find critical parameters determining the behaviour of materials during the damage process. Application of damage mechanisms and approaches to modelling the origin of crack propagation by modifications in FEM systems are presented. Furthermore, some practical applications are tested. The main effort is devoted to composites and searching for procedures when using cohesion models for their more accurate modelling, especially near the stress concentrators, or before the crack tip. The use of the cohesive approach of elements that represent the physical nature of energy release in front of the crack front has proven to be promising not only in the direct use of cohesive elements, but also in combination with modified methods of standard finite elements. The authors of this article use their long-term experience in the given issue, which they consistently confront with developments in this area in recent years.

Biosynthesis of C-dots using black mulberry fruit as a precursor for C-dot synthesis is a novel approach. We successfully synthesized C-dots from the fruit extract by employing a hydrothermal autoclave. This green synthesis method offers a sustainable and environmentally friendly route for C-dot production. Our results demonstrate the efficient degradation of pollutants under visible light irradiation, indicating the strong photocatalytic activity of the C-dots. This finding has implications for environmental remediation and the elimination of harmful substances, showcasing the potential practical applications of C-dots in addressing water contamination issues. We made an effort to identify the optimum doping concentration of C-dots and found that 0.2 mol% was the sweet spot. At this concentration, the photodegradation of pollutants reached an impressive 95.8%. The enhanced photocatalytic activity can be attributed to increased electron trapping due to more surface sites and different absorption wavelengths. This work contributes to the synthesis of carbon dots using black mulberry fruits as a sustainable precursor, as well as the comprehensive analysis of their optical and photocatalytic properties.

Abstract: (1) Background: The occurrence of youth aggression has aroused widespread concern, and we would like to explore the reasons for it from both the family and individual sides of the youth. This study constructed a chain mediation model based on Bandura's Social Learning Theory to explore the mechanism of internet gaming disorder and avatar identification in it; (2) Methods: We conducted a randomized survey involving 973 adolescents from various middle schools in China. We used the Harsh Parenting Scale, the Online Gaming Disorder Scale, the Incarnate Identity Scale, and the Buss-Perry Aggression Scale to conduct a randomized survey. Empirical analyses were conducted using SPSS 25.0 and Amos 24.0 software to examine the mediating role of online gaming barriers and avatar identity; (3) Results: There was a two-by-two significant positive correlation between harsh parenting, internet gaming disorder, avatar identification and aggression. The me-diation model between harsh parenting, internet gaming disorder, avatar identification and ag-gression was well fitted ( χ2/df=7.268, GFI=0.961, AGFI=0.923, IFI=0.970, CFI=0.970, TLI=0.951, RMSEA=0.080).; (4) Conclusions: Parental harsh parenting affects adolescent aggression not only through the separate mediating roles of internet gaming disorder and avatar identification, but also through the chain mediating roles of internet gaming disorder and avatar identification.

Background: Pulmonary embolism (PE) is a common multifactorial disease, but high-risk PE s a life-threatening condition associated with high mortality and morbidity and a heavy prognostic burden. Systemic thrombolysis is the first-line treatment approach for severe high-risk PE, but only few agents are indicated for use by international guidelines. Tenecteplase, a thrombolytic agent, is proven to reduce mortality and right ventricle dysfunction in high-risk PE, but is not approved yet by major recommendations. Aim: We present a series of cases of high-risk PE treated with Tenecteplase, with satisfying hemodynamic and clinical outcomes. Our goal is to encourage the usage of Tenecteplase with secure safety and efficacy in situations of unavailability of guidelines-approved fibrinolytic agents. Cases : Patients were included from January 2022 to January 2024. We report 3 cases of patients with high-risk PE treated with Tenecteplase where rtPA and other second-generations agents were not available. Clinical, biological and imaging data were detailed for each case. Conclusion: Tenecteplase was effective in our patients, without bleeding complications, and should be suggested in settings of unavailability of first-line recommended agents.

This study investigates the transformative impact of ChatGPT, a cutting-edge AI language model developed by OpenAI, on the financial sector. We explore ChatGPT's applications in financial analysis, focusing on its ability to perform tasks traditionally handled by human analysts. By creating a set of multi-step and advanced reasoning financial tasks, and establishing several task-specific evaluation metrics, our experimental results demonstrate that ChatGPT-4o can effectively perform both basic and some complex financial analysis tasks comparable to those executed by humans. However, our empirical evaluation reveals limitations in its performance on complex tasks that require comprehensive understanding and critical thinking. The study highlights the necessity for meticulous task formulation and robust evaluation to achieve consistent functionality. While ChatGPT enhances efficiency in financial analysis, its integration with human expertise remains crucial for effective decision-making. This study contributes to the understanding of AI's role in finance and provides insights into its potential and constraints, guiding future integration of AI technologies in financial practices.

Developing countries, including Small Island Developing States (SIDS) and Least Developed Countries (LDCs), are exceptionally vulnerable to climate change due to their distinct geographical and environmental characteristics. The impacts of climate change extend across their ecosystems, water resources, and vital economic sectors, such as food systems, health, education, and energy. Escalating sea levels and heightened salinity levels imperil freshwater reserves, while warmer ocean temperatures and acidification disrupt water demand, tourism, health services, and fisheries. Furthermore, developing countries bear the brunt of water shortages, flooding, and deteriorating water quality. Alarmingly, nearly two-thirds of the global population experience severe water scarcity for at least one month annually, with the majority residing in developing countries. By 2025, half of the world's population could inhabit areas grappling with water scarcity, predominantly concentrated in developing nations. In this context, innovative adaptation strategies, notably transformative wastewater projects, are imperative for fostering sustainability and resilience in these regions. However, significant barriers impede progress, creating a stark disparity between current financing capabilities and the imperative to fund water security initiatives. Compounding these challenges, developing countries find themselves ensnared in a burgeoning debt crisis, marked by escalating interest rates and inflation, which threatens to impede developmental progress and curtail investments in adaptation and mitigation endeavors. Consequently, there arises a critical necessity to harness innovative financial mechanisms to transform these debts into assets that facilitate climate action. This paper meticulously explores the potential of debt-for-climate swaps as a catalyst for advancing transformative wastewater projects, with a focused lens on their strategic deployment to underpin critical initiatives. Through rigorous examination of case studies and empirical evidence, the paper elucidates how debt-for-climate swaps can effectively bolster sustainable wastewater management systems in developing countries. Furthermore, it delineates best practices for leveraging these mechanisms to fortify environmental sustainability and resilience. Additionally, the paper delineates the roles and responsibilities of key stakeholders, including governments, policymakers, the private sector, communities, and climate financial institutions. By amalgamating theoretical insights with tangible examples, this paper furnishes a comprehensive framework for harnessing debt-for-climate swaps to enhance water security and resilience in developing countries. It endeavors to furnish actionable strategies for policymakers, practitioners, and stakeholders to navigate the complex terrain of climate change and engender sustainable development.

MATERIAL AND METHOD: This is an observational analytical cohort study carried out on a total of 160 patients, divided into 4 groups: healthy, with myopia, with primary open-angle glaucoma (POAG), and with POAG and myopia together. The study variables were Bruch's membrane opening area (BMO), the thickness of the RNFL and the RGC layer using the Glaucoma Premium program of the OCT Spectralis of Heidelberg. RESULTS: Regarding the analysis between age and the thickness of the RNFL, significant results were found in the healthy and glaucoma groups with myopia, for the rest of the groups, although there are no significant results, the correlation is negative, the older the younger is the thickness. Regarding intraocular pressure (IOP), significant results have been found in the nasal sector in the glaucoma group. In the glaucoma with myopia group, statistically significant results have been obtained when analyzing the thickness of the RNFL with refraction. In the analysis between the thickness of the RNFL and the RGC layer, significant results were obtained in the myopia and glaucoma groups; in the group of glaucoma with myopia, it occurs in the superior temporal sector. CONCLUSION: In the case of myopic patients with glaucoma, damage at the functional, both the thickness of the RNFL, the RCG and the BMO-MRW are greater than other groups. All these alterations can be evaluated and monitored with the OCT Spectralis thanks to the programs it includes, making this instrument one of the best for an early diagnosis of glaucoma and the damage produced in myopic patients.

In the realm of digital transformation, effective leadership and motivation are pivotal for organisations navigating the complexities of today’s systems. This study explores the intersection of intrinsic motivation and mental well-being among mature students—an analogy that sheds light on strategies applicable to organisational contexts. In developed nations like the UK, mental health for mature students is increasingly recognised as a crucial component of their educational journey. Mature students, who typically enrol in higher education after an educational gap and upon turning 21, often face specific challenges that can impact their mental well-being while pursuing academic goals. The primary objective of our study was to assess the relationship between intrinsic motivation and the mental well-being of mature students. Our research revealed a significant positive correlation between these two variables. Confirmatory factor analysis (CFA) results supported a one-factor solution for the sample data from mature students. Additionally, we found that intrinsic motivation is a significant predictor of the mental well-being of mature students. Recognising and addressing the unique difficulties individuals encounter and providing appropriate support can enhance their well-being and contribute to the overall success of the higher education community.

The object of study in the article is the auxiliary variable-frequency electric drive onboard of an AC electric locomotive, and more precisely, the structure and parameters of the control system of the active corrector of power factor (ACPF), which is part of the electric drive, as a unit that ensures electromagnetic compatibility of the electric drive with other equipment on board the electric locomotive and catenary and its energy efficiency. The topic of the article's research is the substantiation of the structure of the ACPF control system, the choice of types (transfer functions) of controllers and the calculation of their parameters. The research method chosen was the calculation of the transfer functions of the controllers of the cascaded loops control system, followed by computer simulation using the OrCAD software. The results of simulating a cascaded two loops control system of an ACPF with different types of controllers are presented and analytically compared. It is concluded that it is advisable to use a cascaded two loops control system, containing a voltage control loop and a current control loop. The best results show the simulation when using an aperiodic current controller (A-controller) and a proportional-integral voltage controller (PI-controller). The data obtained serve as the basis for further improvement of the operation of the ACPF by enhancing and optimizing the settings, structure and algorithms of the control system, which, with the selected hardware of power converter unit, will allow the ACPF to perform its functions with a high degree of reliability in an entire range of disturbing and control influences.

The monosodium glutamate (MSG) that elicits umami taste, one of the five primary tastes, has been shown to be a helpful tool in reducing salt intake and improving eating patterns. This study aimed to investigate how MSG taste is perceived and evaluated in a sample of adult participants living in Austria, taking into account their sex, education, and travel habits. A Text Semantic-mining Analysis (TSA) was conducted using data from 300 adults (152 males and 148 females, mean age = 26.71 years). They also performed an MSG and NaCl (salt) discrimination test and were further interviewed about taste preferences, travel habits, and type of residence. The results indicated that the taste sensation elicited by the MSG solution was complex, unfamiliar and had negative valence. The descriptor most commonly used for MSG was "sour," followed by "bitter" and "salty" for the whole group, but these differed by gender. Both males and females preferred the salt solution over MSG, with no significant difference between the two groups. Additionally, there were apparent differences in primary/spicy taste preferences between genders, as males tended to prefer spicy flavors while females favored sweet and salty tastes. This finding underscores the unexplored significance of umami taste, suggesting the importance of establishing an accurate notion in European culture and promoting its usage in food choices for better health.

To investigate the repair mechanism of umbilical cord mesenchymal stem cells (UC-MSCs) in hydrogel on pancreatic β-cells in diabetes, MIN-6 damaged by streptozotocin (STZ) in vitro was used in co-culture with UC-MSCs in hydrogel (UC-MSCs + hydrogel). It was found that UC-MSCs + hydrogel had a significant repair effect on injured MIN-6 cells, which was better than the use of UC-MSCs alone (without hydrogel). After repair, the expression of superoxide dismutase (SOD) and catalase (CAT) as well as the total antioxidant capacity (T-AOC) of the repaired MIN-6 cells were increased, effectively reducing the oxidative stress caused by STZ. In addition, UC-MSCs + hydrogel were able to curb the inflammatory response by promoting the expression of anti-inflammatory factor IL-10 and reducing inflammatory factor IL-1β. In addition, the expression of both nuclear antigen Ki67 for cell proliferation and insulin-related genes such as Pdx1 and MafA was increased in the repaired MIN-6 cells by UC-MSCs + hydrogel, suggesting that the repair effect promotes the proliferation of the injured MIN-6 cells. Compared with the use of UC-MSCs alone, UC-MSCs + hydrogel exhibited longer survival time of UC-MSCs, because the porous structure and hydrophilic properties of the hydrogel could affect the growth of cells and slow down their metabolic activities, resulting in a better repair effect on the injured MIN-6 cells.

Despite the availability of COVID-19 vaccines, the global pandemic remains a significant health challenge. Timely detection of the virus is crucial for effective containment efforts, prompting the exploration of machine learning (ML) models for COVID-19 detection. highlights the ongoing significance of COVID-19 as a global health crisis despite the availability of vaccines. To address the need for timely virus detection, the study explores the efficacy of machine learning (ML) models, including DNN, Voting, Bagging, SVC_rbf, SVC_linear, SVC_polynomial, and SVC_sigmoid, in predicting COVID-19 infection probability. With a dataset comprising 4000 samples split into 3200 for training and 800 for testing, the analysis reveals that DNN and Voting models demonstrate the highest performance, achieving an impressive accuracy of 89%. These results underscore the potential of ML techniques, particularly DNN and ensemble methods like Voting, in facilitating early COVID-19 detection and contributing to effective pandemic management. The study emphasizes the importance of continued research to further refine and optimize ML-based COVID-19 detection systems.

In the ground-based infrared optical remote sensing system, the target signal is very weak due to the dynamic strong light background and the movement of small and small targets. In order to improve the limit detection capability, the background suppression and target enhancement methods are required to be more suitable for this scene. To solve this problem, we first analyze the image features in the current scene, and propose a more perfect point target and noise model. Then, we propose a new WY distribution function based on the Fermi Dirac distribution function, and propose an anisotropic filtering method based on this function, and further suppress the back-ground through the difference results of two steps. Then, based on the distribution function, we further designed an energy concentration accumulation strategy in 9 scale directions, through which the SNR of the target is effectively improved and the suppression ability of the background is enhanced. Through quantitative and qualitative experimental analysis, compared with the same type of algorithms, the proposed method has better robustness against extremely weak targets and dynamic backgrounds.

This study focuses on the impact of collaboration on reducing price inflation in renewable energy supply chains. The study utilises in-depth interviews and theme analysis to reveal the complex dynamics of collaboration among stakeholders and the resulting implications for addressing difficulties in the renewable energy sector. Trust is a key factor in successful collaboration, whereas legal frameworks and policy incentives are important in influencing collaborative activities. Collaborative procurement, cooperative research and development, strategic alliances, and collaborative supply chain management are recognised as crucial measures for decreasing expenses, promoting innovation, and improving resilience in renewable energy supply chains. Nevertheless, in order to achieve successful collaboration, it is necessary to overcome obstacles such as lack of trust, uncertainty in regulations, and competitive dynamics. Creating a cooperative environment that prioritises common objectives, openness, and reciprocal advantages is crucial for fully harnessing the potential of renewable energy supply chains in promoting sustainable energy transitions. The report provides practical insights and recommendations for policymakers, industry professionals, and academics who aim to encourage collaboration and reduce price inflation in renewable energy supply chains.

Resistance to the existing drugs and increasing numbers of diseases result in identifying new drug candidates with new forms of activity. Marine sources of alkylglycerols such as the liver oil Shark (SLO) mixture of certain species or rat fish (elasmobranch fishes) contain high levels of these compounds as a mixture of few species varying by length and unsaturation or saturation of the alkyl chain. They have multiple biological activities such as hematopoiesis stimulation, lowering radiotherapy-induced injuries, reducing tumor growth and improving vaccination efficiency. The synthesis of two Alkylglycerols (AKGs) containing at least one alkyne moiety in the alkyl chain has been reported. In this work, we describe the synthesis of others unknown AKGs based alkyne 1-O-(hexadec-11’-ynyl)-sn-glycerol 4 and 1-O-(octadec-9’-ynyl)-sn-glycerol 5 as analogues of bioactive ether lipids found in the SLO mixture.

Over the last decade, a lot of research has been conducted on memristors. Most of this research focusses on using memristors for Artificial Intelligence (AI) applications and to fabricate non-volatile memory, but also the security aspects of memristors have been examined. The current study summarises and compares five reviews on the security aspects of memristors. These reviews cover two different perspectives: (1) security applications of memristors such as Physical Unclonable Functions (PUFs) or True Random Number Generators (TRNGs), and (2) potential threats when using memristors to train and store neural networks. The comparison of the reviews reveals that different sets of studies are included in the reviews and different characterisations of the studies are provided. This shows that different perspectives are necessary to get a comprehensive overview of the security aspects of memristors. By synthesising the perspectives of different reviews, this study helps to get such an overview.

The global steel industry is a major contributor to greenhouse gas emissions, and the adoption of green hydrogen in Direct Reduced Iron (DRI) production has the potential to significantly reduce CO2 emissions and support climate targets. This review explores the environmental, economic, technological, and social implications of using green hydrogen in DRI processes. The findings suggest that green hydrogen can reduce emissions by up to 90% compared to traditional methods, enhance energy security, and stimulate local economic development. However, high initial costs, energy efficiency concerns, and social acceptance issues remain significant barriers. The review also highlights the importance of integrating carbon capture and storage technologies, addressing logistical challenges, and considering the geopolitical implications of a shift towards green hydrogen. Green hydrogen presents a promising solution for decarbonising the steel industry but continued research, investment in infrastructure, and strategic planning are essential to overcome the challenges and drive widespread adoption.

Pepper leaf segmentation plays a crucial role in monitoring pepper leaf diseases in various backgrounds and ensuring the healthy growth of peppers. However, existing transformer-based segmentation methods suffer from computational inefficiency, excessive parameterization, and limited utilization of edge information. To tackle these challenges, we propose an adaptive multi-scale MLP framework, named AMS-MLP, which combines the multi-path aggregation module (MPAM) and the multi-scale context relation mask module (MCRD) to refine the object boundaries in pepper leaf segmentation. AMS-MLP consists of an encoder-based network, an adaptive multi-scale MLP (AM-MLP) module, and a decoder network. In the encoder network, the MPAM module effectively fuses five-scale features to generate a single-channel mask, improving the accuracy of pepper leaf boundary extraction. The AM-MLP module divides the input features into two branches: the global multi-scale MLP branch captures long-range dependencies between image information, while the local multi-scale MLP branch focuses on extracting local feature maps. Adaptive attention mechanism is designed to dynamically adjust the weights of global and local features. The decoder network incorporates the MCRD module into the convolutional layer, enhancing the extraction of boundary features. To verify the performance of the proposed method, we conducted extensive experiments on three pepper leaf datasets with different backgrounds. The results demonstrate mIoU scores of 97.39%, 96.91%, and 97.91%, as well as F1 scores of 98.29%, 97.86%, and 98.51%, respectively. Comparative analysis with U-Net and state-of-the-art models reveals that the proposed method dramatically improves the accuracy and efficiency of pepper leaf image segmentation.

The migration of gallstones from the gallbladder into the gastrointestinal tract has been recognized for over 100 years. The most common way gallstone reaches the digestive tract is through a fistula between the gallbladder and the duodenum. Large stones become impacted in the duodenum and result in gastric outlet obstruction (Bouveret's syndrome). In this report, we present a 81-years old patient with the cholecystoduodenal fistula, which was diagnosed by ultrasound and computed tomography and effectively surgically managed. Even Bouveret syndrome is rare, with a timely diagnosis followed with an appropriate treatment maybe we could decrease morbidity and mortality rates of this complication.

Hamman’s syndrome is a rare condition that mostly affects young males, often with a predisposition of asthma. It includes the presence of free air in the mediastinum and subcutaneous emfysema with no other underlying cause such as trauma or infection. It occurs spontanously and often in association with prolonged valsalva manouvre. This might explain why there are some cases of Hamman syndrome among young females giving birth. Here we present a case report of a 24-year- old primigravida with Hamman’s syndrome. She presented with symptoms a few hours after an uncomplicated vaginal delivery at 40+1 pregnancy week. The symptoms resolved spontanously after a few days of observation. We also give a systemic review of reported cases since 2000 to provide overview on pathomechanism, symptoms, diagnostics, treatment and management of this condition. Hamman’s syndrome is a rare, usually benign, but potentially serious complication that can occur during the second stage of labour. Diagnostics include inquiring about typical symptoms, clinical examination and chest x-ray or CT scan. Treatment is usually conservative with oxygen, bronchodilators and pain relief. The reccurence rate is low and there is no contraindication to vaginal delivery in future pregnancies. However, it is suggested that physicians and midwives be cautious and consider low threshold for instrumental delivery or caesarean section to avoid excessive valsalva manoeuvre.

The Shule River Basin (SRB) is a typical arid area in northwest China with a fragile ecology. Un-derstanding vegetation dynamics and its response to climate change and human activities provides essential information for ecological and environmental resource management. This study extracted fractional vegetation coverage (FVC) data from 2000 to 2019 using the Google Earth Engine plat-form and Landsat satellite images, employing trend analysis and other methods to examine spati-otemporal changes in vegetation in the SRB. Additionally, partial correlation and residual analysis were utilized to explore the response of FVC to climate change and human activities. The main results were as follows: (1) The regional average FVC in the SRB showed a significant upward trend from 2000 to 2019, increasing by 1.3 × 10−3 y–1. The area within 1 km of roads experienced a higher increase of 3 × 10−3 y–1, while the roadless areas experienced a lower increase of 1.1 × 10−3 y–1. Road construction from 2004 to 2006 significantly reduced the FVC within 200 meters of the roads. FVC spatial heterogeneity in the SRB is significant. (2) Partial correlation analysis shows that FVC has a strong positive correlation with precipitation and surface water area, with correlation coefficients of 0.575 and 0.744, respectively. There is a weak negative correlation between FVC and land surface temperature (LST). FVC changes are more influenced by precipitation than by LST. (3) Compared to climate factors, human activities have a greater impact on vegetation dynamics in the SRB. The contributions of climate change to vegetation recovery are increasing. (4) The area changes of dif-ferent land types are closely related to climate factors and human activities, reflecting their impact on vegetation. These results provide valuable information for ecosystem restoration and environ-mental protection in the SRB.

Teledermatology, the dermatological consultation and diagnosis via digital communication technologies, has become increasingly important in modern healthcare. The integration of teledermatology into clinical practice has gained significant interest, especially during the COVID-19 pandemic. Numerous studies have shown the effectiveness and reliability of teledermatology, with high levels of patient satisfaction and diagnostic accuracy. Pathpoint® eDerma is a cloud-based dermatology platform that aims to streamline the documentation and management of dermatological conditions. It offers several clinical benefits, including faster diagnosis, reduced unnecessary procedures, improved access to care, and cost savings. The platform follows a comprehensive risk management plan and complies with safety regulations. It undergoes regular recertification and reviews to ensure its safety and effectiveness. The clinical evaluation of eDerma confirms its ability to deliver significant clinical benefits while effectively mitigating risks. The benefit-risk ratio of eDerma is highly acceptable, supporting its use in clinical settings to enhance dermatological care.

The Interdisciplinary Canadian Collaborative ME Research Network (ICanCME), established in 2019, aims to foster research in Canada and contribute to finding the causes and possible treatments for myalgic encephalomyelitis /chronic fatigue syndrome (ME/CFS), thereby reducing the impact of ME/CFS on the health of Canadians. The main objectives of this paper are to suggest standards for ME/CFS research for the collection of data from participants (Recommended Data Elements) and to consider other factors, such as design, language, cultural issues, equity, and diversity. Consensus of the relevant contents of this research guideline was reached during the ICanCME working group meetings and were based on existing guidelines. Members of the working group contributed to guideline development based on their respective expertise. The proposed research guidelines could improve research quality and advance knowledge in the field of ME/CFS, and ultimately benefit ME/CFS patients.

Almost contact complex Riemannian manifolds, known also as almost contact B-metric manifolds, are equipped with a pair of pseudo-Riemannian metrics that are mutually associated with each other using the tensor structure. Here we consider a special class of these manifolds, those of the Sasaki-like type. They have an interesting geometric interpretation: the complex cone of such a manifold is a holomorphic complex Riemannian manifold (also called a Kähler–Norden manifold). The basic metric on the considered manifold is specialized here as a soliton, i.e. has an additional curvature property such that the metric is a self-similar solution of an intrinsic geometric flow. Almost solitons are more general objects than solitons because they use functions rather than constants as coefficients in the defining condition. A β -Ricci-Bourguignon-like almost soliton ( β is a real constant) is defined using the pair of metrics. The introduced soliton is a generalization of some well-known (almost) solitons (such as those of Ricci, Schouten, Einstein), which in principle arise from a single metric rather than a pair of metrics. The soliton potential is chosen to be pointwise collinear to the Reeb vector field, or the Lie derivative of any B-metric along the potential to be the same metric multiplied by a function. The resulting manifolds equipped with the introduced almost solitons are characterized geometrically. Appropriate examples for two types of almost solitons are constructed and the properties obtained in the theoretical part are confirmed.

It is challenging to precisely measure the slow interseismic crustal deformation rate from SAR data. The long-wavelength orbital errors, owing to the uncertainties in satellite orbit vectors, commonly exist in SAR interferograms, which degrade the precision of the InSAR products and become the main barrier of extracting interseismic tectonic deformation. In this study, we propose a novel temporal network orbital correction method that is able to isolate the far-fault tectonic deformation from the mixed long-wavelength signals based on its spatio-temporal characteristic. The proposed approach is straightforward in methodology but could effectively separate the subtle tectonic deformation from glaring orbital errors without ancillary data. Both synthetic data and real Sentinel-1 SAR images are used to validate the reliability and effectiveness of this method. The derived InSAR velocity fields clearly present the predominant left-lateral strike-slip motions of the Tuosuo Lake segment of the Kunlun fault in western China. The fault-parallel velocity differences of 5-6 mm/yr across the fault between areas ~50 km away from the fault trace are addressed. The proposed method presents significantly different performance from traditional quadratic approximate method in the far-field. Through the implementation of the proposed method, the RMSE between the LOSGPS and our derived descending InSAR LOS is reduced to less than one-third of the previous study, suggesting its potential to enhance the availability of InSAR technology for interseismic crustal deformation measurement.

New advances in creating effective and affordable copper-based catalysts for water splitting represent a promising strategy for driving sustainable energy technologies. However, ma- terials containing copper are susceptible to corrosion and agglomeration. In this study, we describe a synthesis route to produce olamine-functionalized CuO nanoparticles using the Hot Injection method. Nanoparticles were obtained and subsequently deposited on FTO substrates, undergoing thermal treatment at 500°C and 600°C in atmospheres containing O2 and N2, aiming to enhance the adhesion of the active material to the substrate and modify its oxidation state. Microstructural properties were analyzed using XRD, SEM, and TEM, while electrochemical properties were studied using CV, LSV, and EIS. Electrodes treated thermally in an N2 atmosphere at 600°C exhibited higher ESCA, indicating a greater area of active sites exposed to surface reactions and, therefore, superior catalytic activity in Hy- drogen Evolution Reaction (HER). These findings show an interesting strategy for avoiding rapid electron-hole recombination and, consequently, CuO corrosion. For Oxygen Evolution Reaction (OER), samples treated thermally in O2 atmosphere at 500°C and 600°C appear to be more effective.

Background Neisseria gonorrhoeae can acquire antimicrobial resistance (AMR) through horizontal gene transfer (HGT) from other Neisseria spp. such as commensals like Neisseria subflava. The prevalence of Neisseria subflava in the oropharynx is close to 100%. Low doses of antimicrobials in food could select for AMR in N. subflava, which could then be transferred to N. gonorrhoeae. In this study, we aimed to determine the lowest concentration of ciprofloxacin that can induce ciprofloxacin resistance (minimum selection concentration – MSC) in N. subflava. Methods Neisseria subflava Co000790/2 was serially passaged on GC agar plates containing ciprofloxacin concentrations ranging from 1:100- to 1:10,000-below its ciprofloxacin MIC (0.006 µg/ml) for six days. Results After 6 days of serial passaging at ciprofloxacin concentrations 1/100th of the MIC, 24 colonies emerged on the 0.06 µg/ml ciprofloxacin plate. Their ciprofloxacin MICs were between 0.19 to 0.25 µg/ml, and whole genome sequencing revealed a missense mutation T91I in the gyrA gene, which has previously been found to cause reduced susceptibility to fluoroquinolones. Conclusion The N. subflava MSCde novo was determined to be 0.06 ng/mL or 1:100 below the MIC. The implications of this finding are that the low concentrations of antibiotics found in certain environmental samples and even the food we eat may be able to select for ciprofloxacin resistance in N. subflava.

Vinyltriethoxysilane (VTES) was covalently bonded onto graphene oxide. Several methods, including X-ray photoelectron spectroscopy, Fourier transform infrared spectroscopy, and X-ray diffraction, were used to demonstrate the presence of VTES on the surface of graphene oxide and the creation of this covalent link. Following that, different quantities of the resultant vinyltriethoxysilane functionalized graphene oxide (VTESFGO) were mixed with polyvinyl alcohol (PVA) to form VTESFGO/PVA nanocomposite films (NCFs) with a 3-dimensional network structure. The creation of these NCFs and the presence of a three-dimensional network were confirmed by Fourier transform infrared spectroscopy. The three-dimensional network structure provided these NCFs extraordinary characteristics. The mechanical and thermal stability, oxygen transfer rate (OTR), and water resistance pressure (WRP) of the NCFs were investigated. The nanocomposite film (NCF) with the highest weight percentage of VTESFGO (3.0 wt.%) was 47.5% more thermally stable than pure PVA, with an oxygen transmission rate of 0.3 cm3/m2 per day and a water resistance pressure of 780 mm/cm2. However, as the weight percentage of VTESFGO increased, the mechanical strength of the NCFs decreased as a result of silanol self-condensation, resulting in particulate formation, as confirmed by scanning electron microscopy.

Infill well location optimization poses significant challenges due to its complexity and time-consuming nature. Currently, determining the scope of infill wells relies heavily on field engineers' experience, often using single indices such as remaining oil saturation or abundance of remaining oil reserves to evaluate the potential of remaining oil. However, this approach lacks effectiveness in guiding the precise tapping of remaining oil in ultra-high water cut reservoirs. To address this, our study comprehensively considers factors influencing the recoverable potential of remaining oil in such reservoirs. We characterize differences in reservoir heterogeneity, the scale of recoverable remaining oil reserves, water flooding conditions, and oil-water flow capacity to construct a quantitative evaluation index system for the recoverable potential of remaining oil. Recognizing the varying degrees of influence of different indices on the recoverable potential of remaining oil, we determine the objective weight of each evaluation index by combining an accelerated genetic algorithm with the projection pursuit model. This approach enables the construction of a recoverable potential index for remaining oil and forms a quantitative evaluation method for the recoverable potential of remaining oil in ultra-high water cut reservoirs. Subsequently, we establish a mathematical model for infill well location optimization, integrating and optimizing infill well location coordinates, well length, well inclination angle, and azimuth angle. Using the main layer sand body of an oilfield in Bohai as a case study, we conducted evaluations of remaining oil potential and infill well location optimization. Results demonstrate that the assessment of remaining oil potential comprehensively characterizes the influence of reservoir physical properties and oil-water diversion capacity on remaining oil potential across different regional positions. This evaluation can effectively guide the determination of infill well location ranges based on the evaluation results. Furthermore, further optimization of infill well locations can effectively enhance reservoir development outcomes.

Aiming at the problem of small size of some spots on apple leaves and the difficulty of accurate detection of spot targets brought by the complex background of the orchard, this paper takes the alternaria leaf spot, rust, brown spot, grey spot and frog eye leaf spot on apple leaves as the research object, and proposes a high-accuracy detection model YOLOv5-Res and lightweight detection model YOLOv5-Res4 are proposed. Firstly, a multiscale feature extraction module ResBlock is designed by combining the Inception multi-branch structure and ResNet residual idea. Secondly, a lightweight feature fusion module C4 is designed to reduce the number of model parameters while improving the detection ability of small targets. Finally, a parameter streamlining strategy based on optimized model architecture is proposed. The experimental results show that the performance of YOLOv5-Res model and YOLOv5-Res4 model is significantly improved, the [email protected] value is improved by 2.8% and 2.2% compared with YOLOv5s model and YOLOv5n model, respectively, and the size of YOLOv5-Res model and YOLOv5-Res4 model is only 10.8MB and 2.4MB, and the number of model parameters is reduced compared with YOLOv5s model and YOLOv5n model. counts are reduced by 22% and 38.3% compared to the YOLOv5s model and YOLOv5n model.

This paper addresses the cosmological constant problem, a significant discrepancy highlighted by \cite{Weinberg:1988cp} that underlines a fundamental inconsistency between quantum field theory (QFT) and general relativity (GR). QFT examines matter dynamics within Lorentzian spacetime under standard model symmetry, while GR uses Riemannian geometry but adapts it to ensure local Lorentzian behavior in small regions. Despite the experimental successes of both theories, a major challenge exists in theoretical understanding. This letter seeks to clarify this critical misunderstanding. As the universe cools from its hot beginning, the \(SU(3) \times SU(2) \times U(1)\) standard model gauge symmetry evolves. This symmetry breaks to \(SU(3) \times U(1)\) upon cooling at the electroweak scale and ultimately to \(SU(3)\) alone as temperatures approach near-absolute zero kelvin, facilitated by the experimental Meissner effect. This suggests that \(SU(3)\) symmetry forms the foundational "atoms" of vacuum energy. Calculating the number of \(SU(3)\) vacuum atoms across the universe results in a value that perfectly aligns the theoretical predictions with the observed vacuum energy densities, thereby resolving the cosmological constant problem. Since \(SU(3)\) atoms account for the cosmological constant, they must be unbreakable. The third law of thermodynamics, which states that it is impossible to reach absolute zero Kelvin, provides the protection that prevents SU(3) atoms from breaking at zero Kelvin. This reveals the connection between the third law of thermodynamics and the quark confinement. This leads to the \(SU(3)\) atom creating a mass gap within the universe. This solution serves as a symmetric evidence of gauge-gravity duality as well as gravity-superconductor duality.

The current 2019-2021 marine pharmacology literature review provides a continuation of previous reviews covering the period 1998 to 2018. Preclinical marine pharmacology research during 2019-2021 was published by researchers in 42 countries and contributed novel mechanism of action pharmacology for 171 structurally characterized marine compounds. The peer-reviewed marine natural products pharmacology literature reported antibacterial, antifungal, antiprotozoal, antituberculosis,and antiviral mechanism of action studies for 49 compounds, 87 compounds with antidiabetic and anti-inflammatory activities as well as affecting the immune and nervous system, while another group of 51 compounds demonstrated novel miscellaneous mechanisms of action, which upon further investigation, may contribute to several pharmacological classes. Thus, in 2019-2021, a very active preclinical marine natural product pharmacology pipeline provided novel mechanism of actions as well as new lead chemistry for the clinical marine pharmaceutical pipeline targeting the therapy of several disease categories.

As cardiovascular diseases continue to be a leading cause of mortality, recent-ly, wearable devices for monitoring cardiac activity have gained much interest among medical community. This paper introduces an innovative ECG monitoring system based on a single – lead ECG machine enhanced with machine learning methods. The system only processes and analyses the ECG data, but also predict potential heart disease at an early stage. The wearable device was built on the ADS1298 and a microcontroller STM32L151xD. A server module based on REST API architecture style was designed to fa-cilitate interaction with web-based segment of the system. The module is responsible for receiving data in real time from microcontroller and their deliver to web – based segment. Algorithms for analyzing ECG signals have been developed, including band filter artifact removal, K-means clustering for signal segmentation, and PQRST analysis. Machine leaning methods as Isolation Forest have been employed for ECG anomaly detection. Moreover, a comparative analysis with various machine learning methods, including lo-gistic regression, random forest, SVM, XGBoost, decision forest and, CNNs was conducted to predict cardiovascular diseases. Convoluted Neural Networks (CNN) showed an accu-racy of 0.926, proving high effectiveness in ECG data process.

Tryptophan, an essential amino acid in mammals obtained from the diet, is influenced by maternal diet, which impacts early life and development of offspring. This is studied under the Developmental Origins of Diseases and Health (DOHaD) concept, so factors from conception to early childhood affect health and disease susceptibility. Tryptophan is metabolized mainly through two pathways: serotonin (5-HT) and kynurenine. The kynurenine pathway, active in the brain, gut, liver, and placenta, breaks down over 95% of tryptophan and plays roles in inflammation, neurotransmission, immune responses, and immune modulation during pregnancy. The serotonin pathway uses up to 5% of Tryptophan, mainly in the gut, adipose tissues, pancreatic cells, and central nervous system, and regulates responses to environmental changes, including sleep, cognition, and feeding behavior. Key enzymes in these pathways include Trp-2,3-dioxygenase (TDO), indoleamine-2,3-dioxygenase (IDO) type1 (IDO1), and type 2 (IDO2) (kynurenine pathway), and tryptophan hydroxylase type 1 (TPH1) and type 2 (TPH2), serotonin pathway. The fetus-placental unit manages tryptophan metabolism. Serotonin and kynurenine are crucial for placental health and fetal development. Serotonin adjusts placental blood volume and aids neurodevelopment. Kynurenine metabolites protect the fetus from maternal immunity and offer initial neuroprotection. At birth, infants switch from placental nutrients to breast milk, rich in tryptophan and protective bioactive molecules. Tryptophan, solely from breast milk, is crucial for infants. Its levels are high in newborns (first three weeks, 2-4 times higher than in adults), gradually declining to adult levels by the fourth week. The highlights the importance of tryptophan for the serotonin and kynurenine pathways in fetuses, newborns and babies applied to the DOHaD concept.

Grey mullets comprise different species which represent the most ubiquitous teleost families in the planet coastal waters. They represent an important proportion of the Mediterranean lagoons production and have been recently considered a cultivated marine fish. This study aimed to explore the intestinal bacterial communities of 34 wild-caught grey mullets in order to study their composition and the variation during different seasons. Thirty four healthy wild-caught fish were sampled and the V3-V4 hypervariable regions of 16S rRNA were sequenced. Sixty prokaryotic phyla were identified and the most abundant ones were: Proteobacteria (mean relative abundance 35.4%±17.9), Actinobacteriota (mean relative abundance 16.4%±9.9) and Firmicutes (mean relative abundance 10.1%±10.9). Bacteria belonging to the phylum Chloroflexi were rele-vant in autumn, Spirochaetota, Verrucomicrobiota, Fusobacteriota and Cyanobacteria were particularly abundant in winter while Bacteroidota characterized summer fish. A total of three hundred thirty-two prokaryotic families were identified and the twenty-six most abundant ones were: Rhodociclaceae (Proteobacteria), Brevinemataceae (Spirocheaetota) and Fusobacteriaceae (Fusobacteriota) and the Staphylococcaceae (Firmicutes). This study sheds light on the ecology and high variation in the complex gut microbial community structure of Mediterranean grey mullets, the potential biotechnological role for fish nutrition and health and for preserving the aquatic habitat, a prerequisite for a sustainable aquaculture.

Fluidized beds are pivotal in the process industry and chemical engineering, with Computational Fluid Dynamics (CFD) playing a crucial role in their design and optimization. Challenges in CFD modeling stem from the scarcity or inconsistency of experimental data for validation, along with the uncertainties introduced by numerous parameters and assumptions across different CFD codes. This study navigates these complexities by comparing simulation results from the open-source MFIX and OpenFOAM, and the commercial ANSYS FLUENT, against experimental data. Utilizing a Eulerian-Eulerian framework and the kinetic theory of granular flow (KTGF), the investigation focuses on solid-phase properties through the classical drag laws of Gidaspow and Syamlal-O’Brien across varied parameters. Findings indicate that ANSYS Fluent, MFiX, and OpenFOAM can achieve reasonable agreement with experimental benchmarks, each showcasing distinct strengths and weaknesses. The study also emphasizes that both the Syamlal-O’Brien and Gidaspow drag models exhibit reasonable agreement with experimental benchmarks across the examined CFD codes, suggesting a moderated sensitivity to the choice of drag model. Moreover, the analysis were also carried out for 2D and 3D simulations, revealing that the dimensional approach impacts the predictive accuracy to a certain extent, with both models adapting well to the complexities of each simulation environment. The study highlights the significant influence of restitution coefficients on bed expansion due to their effect on particle-particle collisions, with a value of 0.9 deemed optimal for balancing simulation accuracy and computational efficiency. Conversely, the specularity coefficient, impacting particle-wall interactions, exhibits a more subtle effect on bed dynamics. This finding emphasizes the critical role of carefully choosing these coefficients to effectively simulate the nuanced behaviors of fluidized beds.

Objective: Daratumumab (Dara) is the first-in-class human-specific anti-CD38 mAb approved for treating multiple myeloma (MM). However, DARA-induced depletion of CD38high natural killer (NK) cells results in crippled antibody-dependent cellular cytotoxicity (ADCC), which limits its clinical detection and prediction for Dara efficacy. Therefore, we aimed to explore new NK subsets that could predict Dara efficacy and the underlying mechanism in Dara development. Methods: Multicolour spectral flow cytometry monitored changes in the immune cells of 13 paired RRMM patients. We used machine learning-driven clustering, FlowSOM (Flow Self-Organizing Maps), and dimensional reduction with tSNE (t-distributed Stochastic Neighbour Embedding) to identify unique cell populations pre- and posttreatment. Then, in vitro, fratricide and proliferation assays were performed to explore the function of new NK subsets against MM under Dara treatment. Results: The NK cells were divided into 25 subsets, among which we found that the percentages of KIR-NKP46+ NK cells decreased in paired RRMM patients compared to healthy controls but increased significantly post-Dara treatment. The fold change in KIR-NKP46+ after one dose of Dara treatment can predict whether the best response could be achieved within one month (ROC=0.86, p=0.011). Further in vitro experiments showed that KIR-NKP46+ NK cells are superior to KIR+ NK cells, cooperatively acting with daratumumab to sustainably eradicate MM cells. Meanwhile, apoptosis was significantly decreased, and the proliferation ability was relatively increased post-Dara treatment. Conclusion: In conclusion, the fold change in KIR-NKP46+ NK cell subsets after one dose of Dara treatment can predict the outcome of the curative effect, indicating a putative role of KIR-NKP46+ subsets against MM cells. The mechanism attributed to a relative expansion of the subset due to decreased apoptosis and increased proliferation ability.

Coronavirus disease 2019 (COVID-19) continues to cause morbidity and mortality worldwide; therefore, effective treatments remain crucial to controlling it. As interferon-alpha (IFN-α) and -beta (β) have been proposed as COVID-19 treatments, we sought to assess their effectiveness on respiratory, cardiovascular, neurological, and psychiatric signs and symptoms, as well as PASC and death, in hospitalized COVID-19 patients without multiple sclerosis (MS). Using a federated data research network (TriNetX), we performed a retrospective cohort study of hospitalized COVID-19 patients without MS who received IFN-α or -β treatment, comparing them to a similar cohort who did not receive treatment. Following propensity score-matched analyses, we demonstrate that hospitalized COVID-19 patients who were treated with IFN-α or -β had significantly higher odds of death. In contrast, there was no significant difference in any other outcomes between 1-30 days or 1 day to anytime afterward. Overall, hospitalized COVID-19 patients without MS who were treated with IFN-α or -β had similar short- and long-term sequelae (except for mortality) as those who did not receive treatment. The potential benefits of utilizing IFN-α or -β treatment as therapeutics remain to be realized, and our research highlights the need to explore repurposing drugs for COVID-19 using real-world evidence.

This study investigates the transformative impact of ChatGPT, a cutting-edge AI language model developed by OpenAI, on the financial sector. We explore ChatGPT's applications in financial analysis, focusing on its ability to perform tasks traditionally handled by human analysts. By creating a set of multi-step and advanced reasoning financial tasks, and establishing several task-specific evaluation metrics, our experimental results demonstrate that ChatGPT-4o can effectively perform both basic and some complex financial analysis tasks comparable to those executed by humans. However, our empirical evaluation reveals limitations in its performance on complex tasks that require comprehensive understanding and critical thinking. The study highlights the necessity for meticulous task formulation and robust evaluation to achieve consistent functionality. While ChatGPT enhances efficiency in financial analysis, its integration with human expertise remains crucial for effective decision-making. This study contributes to the understanding of AI's role in finance and provides insights into its potential and constraints, guiding future integration of AI technologies in financial practices.

We have investigated the influence of the relative proportions of glass formers in a series of lithium alumino-borosilicate glasses with respect to electrical conductivity () and glass transition temperature (Tg) as functions of glass structure, as determined by Raman spectroscopy. The ternary lithium alumino-borate glass exhibits the highest  and lowest Tg among all the compositions of the glass series, 30Li2O•3Al2O3• (67-x) B2O3•xSiO2. However, as B2O3 is replaced by SiO2, a shallow minimum in  as well as a shallow maximum in Tg are observed near x = 27, where the Raman spectra indicate isolated diborate/tetraborate/orthoborate groups are being progressively replaced by danburite/reedmergnerite-like borosilicate network units. Overall, as the glasses become silica-rich,  is minimized, while Tg is maximized. In general, these findings show correlations among Tg, (sensitive to network polymerization),  (proportional to ionic mobility), and the different borate and silicate glass structural units as determined by Raman spectroscopy. X-ray diffraction analyses demonstrate the absence of appreciable crystallinity in the glasses investigated. However, scanning electron microscopy (SEM) images of HF-etched samples showed that glasses, and especially the borate-rich compositions comprise two distinct glassy phases. The isolated phase is 25-100 nm in diameter, dispersed evenly in a glassy matrix.

The electronic properties of calcium intercalated graphite (CaC6) as a function of pressure are revisited using density functional theory (DFT). The electronic band structures of CaC6, like many other layered superconducting materials, display cosine-shaped bands at or near the Fermi level (FL). Such bands encompass bonding/antibonding information with a strong connection to superconducting properties. Using an hexagonal cell representation for CaC6, construction of a double supercell in the c-direction effects six-folding in reciprocal space of the full cosine function, explicitly revealing the bonding/antibonding relationship divide at the cosine midpoint. Similarly, folding of the Fermi surface (FS) reveals physical phenomena relevant to electronic topological transitions (ETT) with application of pressure. For CaC6, the peak value for the superconducting transition temperature, Tc, occurs at about 7.5 GPa, near to the observed pressure of the calculated ETT. At this pressure, the radius of the nearly spherical Ca 4s-orbital FS coincides with three times the distance from the G centre point to the Brillouin zone (BZ) boundary of the 2c supercell (which is equal to half the identically defined distance for the primitive rhombohedral BZ). In addition, the ETT coincides with alignment of the non-bonding (inflection) point of the cosine band (the point at which the sign of the cosine amplitude modulation is reversed) with the FL. At other calculated pressure conditions, the Ca 4s-orbital FS undergoes topological changes that correspond and can be correlated to experimentally determined changes in Tc. The ETT is a key mechanism that circumscribes the known significant drop in Tc for CaC6 as a function of increasing pressure.

Accurate forecasting of crop yields holds paramount importance in guiding decision-making processes related to breeding efforts. This study focused on the application of multi-sensor data fusion and machine learning algorithms based on unmanned aerial vehicles (UAVs) in wheat yield prediction. Five machine learning (ML) algorithms namely random forest (RF), partial least squares (PLS), ridge regression (RR), K-Nearest Neighbor (KNN) and eXtreme Gradient Boosting Decision Tree (XGboost) were utilized for multi-sensor data fusion, and three ensemble methods including the second-level ensemble methods (stacking and feature-weighted) and the third-level ensemble method (simple average) for wheat yield prediction. The 270 wheat hybrids were used as planting materials under full and limited irrigation treatments. A cost-effective multi-sensor UAV platform, equipped with red–green–blue (RGB), multispectral (MS), and thermal infrared (TIR) sensors, was utilized to gather remote sensing data. The results revealed that the XGboost algorithm exhibited outstanding performance in multi-sensor data fusion, with the RGB+MS+Texture+TIR combination demonstrating the highest fusion performance (R2=0.660, RMSE= 0.754). Compared with the single ML model, the employment of three ensemble methods significantly enhanced the prediction accuracy of wheat yield. Notably, the third-layer simple average ensemble method demonstrated superior performance (R2 = 0.733, RMSE= 0.668 t ha-1). It significantly outperformed both the second-layer ensemble methods of Stacking (R2= 0.668, RMSE= 0.673 t ha-1) and feature-weighted (R2= 0.667, RMSE= 0.674 t ha-1), thereby exhibiting superior predictive capabilities. This finding demonstrated that the third-layer ensemble method not only augments the predictive ability of the model but also fine-tuned the accuracy of wheat yield prediction through the employment of simple average ensemble learning. Consequently, it offers a novel perspective for crop yield prediction and breeding selection.

The present article describes the synthesis of an isonicotinate-derived meso-arylporphyrin, that has been fully characterized by spectroscopic methods (including fluorescence spectroscopy), as well as by elemental analysis and by HR-MS. The structure of a n-hexane monosolvate has been determined by single crystal X-ray diffraction analysis. The radical scavenging activity of this new porphyrin against the 2,2-diphenyl-1-picrylhydrazyl (DDPH) radical has been measured. Its antifungal activity against three yeast strains (C. albicans ATCC 90028, C. glabrata ATCC 64677 and C. tropicalis ATCC 64677) has been tested, using the disk diffusion and the microdilution methods. Whereas the measured antioxidant activity was low, the porphyrin showed moderate but encouraging antifungal activity. Finally, a study of its effect on the germination of lentil seeds revealed interesting allelopathic properties.

Entanglement is one of the most striking features in quantum systems. Today, quantum entanglement plays a vital role in quantum technology, the non-classical correlation of quantum entanglement is an important resource for quantum communication and quantum computing. Entanglement can be divided into two categories: between multi-particle systems and between various degrees of freedom in a single-particle system (intraparticle entangled states). This work first analogized the distinctions and connections between two kinds of entangled states. Then it designed three types of entanglement-swapping methods based on Bell state joint measurement, cross-Kerr medium, and linear optical elements for intraparticle entangled states by analogizing the entanglement swapping between multiple particles. Intraparticle entanglement swapping can be applied in super quantum dense encoding, quantum information transmission, and quantum teleportation. This work is beneficial for promoting the development of quantum information technologies.

Citrus fruits are extensively cultivated worldwide, with Italy and Spain being major producers. Southern Italy, particularly in Reggio Calabria, a typical citrus fruit is produced, namely, bergamot (Citrus bergamia Risso et Poiteau), known for its mysterious origins and exceptional quality essential oil protected by the EU's PDO designation. Despite historical challenges, bergamot has regained prominence for its nutraceutical potential, especially its flavonoid-rich juice, offering significant health benefits. However, little attention has been paid to understanding the qualitative and quantitative differences of bergamot juice in Calabrian production areas. For this reason, this work aims to investigate the quality characteristics of bergamot juice produced in different areas of Ca-labria sites. The results showed the best quality attributes of bergamot fruits harvested in the DPO area. In particular, higher levels of total soluble solids, stable acidity and higher juice were found. In addition, higher contents of ascorbic and citric acids, which are nutritionally valuable and tasteful, were found. The phenolic profile, characterized by the key compounds of bergamot, highlighted the better nutraceutical potential of the fruit grown in the DPO area.

Aluminum (Al), making up a third of the Earth's crust, is a widespread toxic contaminant, particularly in acidic soils. It impacts crops at multiple levels, from the cellular to the whole plant. This review delves into aluminum's reactivity, including its cellular transport, involvement in oxidative redox reactions, development of specific metabolites, and the influence of genes on the production of membrane channels and transporters, as well as its role in triggering apoptosis leading to senescence. It discusses the involvement of channel proteins in calcium influx, vacuolar proton pumping, the suppression of mitochondrial respiration, and the initiation of programmed cell death. At the cellular nucleus level, the effects of Al on gene regulation through alterations in nucleic acid modifications, such as methylation and histone acetylation, are examined. The review in addition outlines the pathways of Al induced metabolic disruption specifically citric acid metabolism, regulation of proton excretion, induction of specific transcription factors, modulation of Al-responsive proteins, changes of citrate and nucleotide glucose transporters and overall metal detoxification pathways in tolerant genotypes. It also considers the expression of phenolic oxidases in response to oxidative stress, their regulatory feedback on mitochondrial cytochrome proteins, and their consequences on root development. Ultimately, the review focuses on the selective metabolic pathways that facilitate Al exclusion and tolerance, emphasizing compartmentalization, antioxidative defense mechanisms, and the control of programmed cell death to manage metal toxicity.

Many studies on flexible strain and pressure sensors have been reported due to growing interest in wearable devices for healthcare. However, most are fabricated with multiple ingredients and complicated methods even though commercial textiles, such as cotton, nylon, polyester, and silk were used. Here we present flexible pressure and strain (motion) sensors prepared with only graphene oxide (GO) and commercial silk fabrics and yarns. The pressure sensors were fabricated by simply dipping the silk fabric into GO solution followed by thermal treatment at 400 °C for reduction of GO (rGO). The pressure sensors were made from rGO-coated fabrics, which were stacked in 3-, 5-, and 7-layers. The super-sensitivity of 2.58 ×103 kPa-1 at low pressure was observed in the 7-layer pressure sensor. The strain sensors were obtained from rGO-coated twisted silk yarns whose gauge factor was 0.307. Although this value is small or comparable to other sensors, it is appropriate for motion sensing. The results of this study show a cost-effective and simple method for the fabrication of pressure and motion sensors with commercial silk and GO.

In the intricate landscape of software development, the distinction between average and exceptional outcomes often hinges on the approach taken by the engineers involved. This paper explores the core aspects that characterize responsible and professional software engineering, emphasizing the importance of stakeholder engagement, innovative problem-solving, and adherence to standards and best practices. Through detailed real-life examples, we illustrate how professional engineers ensure the creation of robust, efficient, and adaptable software solutions. Additionally, the paper delves into advanced strategies for enhancing database security, including the implementation of Sealed Secrets in Kubernetes environments, continuous improvement, and future enhancements. The goal is to provide a comprehensive understanding of professional software engineering practices and their impact on delivering superior value to projects and organizations.

This study is the first to investigate the asymmetric effects of oil price volatility on stock returns for the Ho Chi Minh Stock Exchange (HOSE). We utilized weekly series of VN30-Index, WTI crude oil prices, geopolitical risks (GPR) index and gold prices spanning from 6 February 2012 to 31 December 2023 as data sources. Using a nonlinear Autoregressive Distributed Lag (NARDL) bounds testing approach, we found that in the short-term, oil price volatility has negative asymmetric effects on the market returns. Specifically, in the short-term, a one percent increase in oil price volatility immediately leads to a 2,6868 percent decrease in the market returns while a similar magnitude decrease in oil price volatility is associated with 6.3180 percent increase in the market returns. In addition, the results obtained from the NARDL model indicated that, in the long-term, the negative and positive changes of oil price volatility have significantly negative effects on the market returns. Finally, the findings derived from the error correction model (ECM) show that 98.21 percent of the disequilibria from the previous week are converged and corrected back to the long-term equilibrium in the current week.

Studies and opinion articles present unequal conclusions concerning empathy and morality, mainly because a somewhat heterogeneous and foggy conceptual approach prevails. This scoping review aims to analyse the relationship between empathy and morality and to present a novel conceptual model of empathy applied to moral decisions.A search in PsycINFO, Scopus and PubMed identified articles addressing the relationship between empathy and morality.Thirty-two articles were included. We find an absence of a consensual definition of empathy. It is commonly defined as a predominant emotional process and a factor of bias and prejudice in moral decisions.According to our conceptual model, empathy is a distinct, complex human neuropsychological capacity that mobilises and is dependent on the proper functioning of several brain areas and balances the scales on which are Emotion and Reason, enabling the most thoughtful moral decisions possible in diverse circumstances and contexts.

The collection of photo shoots during the systematic monitoring activities is useful to witness the ecological role of marine phanerogams as hosts for a rich variety of organisms in coastal and transitional waters. Cymodocea nodosa is present in the Taranto seas. In the Mar Piccolo, it reached high covers in short times, up to 100%, due to the bettering of the environmental conditions. The most recent observations showed that it offers welcoming towards several vertebrates and invertebrates, native and non-indigenous, as well as to micro and macroalgae. The NPPR funded activities will make these observations more robust and structural.