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

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

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

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

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

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

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.

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.

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.

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.

The landscape of medical education has witnessed significant transformations over the past decades, particularly with the advent of active teaching methodologies. However, despite these advancements, the traditional theoretical assessment methods have remained largely unchanged. This lack of evolution in assessment systems poses a challenge, as it is crucial for assessment methods to evolve in tandem with teaching approaches to ensure a comprehensive and effective learning process in medical education. This paper reviews the integration and effectiveness of open-book examinations (OBEs) in medical education, reflecting their growing significance. An integrative review of the literature was conducted, drawing from a range of relevant publications over the last decade, sourced from databases such as PubMed, Web of Science, Scopus, and ERIC. The inclusion criteria focused on full-text articles in English, with search terms including "medicine," "assessment," "open book examination," "open book exam," and "open book assessment," combined using Boolean operators. Thirteen publications were selected and critically appraised using The Critical Appraisal Skills Program checklist. The analysis identified three primary thematic categories: ' Teaching Strategy for Pandemic and Challenging Conditions,” Tool of Learning & Educational Impact” and “Operational Challenges & Future Directions”. These themes were explored to understand the role and impact of OBEs in medical education. The findings indicate that open-book examinations are a crucial component in the evolving landscape of medical education. While certain reservations remain, OBEs have shown significant potential in fostering critical thinking, argumentation skills, and lifelong learning among medical students. They reflect the ongoing evolution of knowledge in the medical field and contribute to the development of professionals’ adept at navigating and applying complex information. Further research is recommended to solidify these findings and to expand the understanding of OBEs in medical education.

This study addresses the pressing need for flood extent and exposure information in data-scarce and vulnerable regions, with a specific focus on West Africa, particularly Senegal. Leveraging the Google Earth Engine (GEE) platform and integrating data from Sentinel-1 SAR, Global Surface Water, HydroSHEDS, Global Human Layer Settlement, and MODIS Land Cover, our primary ob-jective is to delineate flood extents and compare them with centennial flood-prone areas, offering a comprehensive assessment of exposure during the period from July to October 2022 across Sen-egal's 14 regions. The findings underscore a total inundation area of 2 951 square kilometers, impacting 297 142 people, 175 square kilometers of urban and 16 square kilometers of crops. Notably, August wit-nessed the largest flooded areas, reaching 780 square kilometers, constituting 0.40% of the coun-try's surface. Subsequent regions, including Saint-Louis, Ziguinchor, Fatick, and Matam, experi-enced varying extents of flooding, with August data showing a 1.34% overall overlap compared to centennial flood-prone areas derived from hydrological and hydraulic modeling. This low per-centage reveals the distinct purposes and natures of the two approaches (remote sensing and modeling), as well as their complementarity. Turning to flood exposure, August emerges as the most critical month, affecting 76 595 people (0.43% of the total population). Dakar, Diourbel, Thiès, and Saint-Louis regions bore substantial impacts, affecting 100 707, 57 648, 31 579, and 26 581 people, respectively. These findings emphasize the imperative for comprehensive disaster preparedness and mitigation efforts. The study provides a crucial national-scale perspective to guide Senegal's authorities in formulating effective flood management, intervention, and adaptation strategies.

The intestinal microbiota, comprised of bacteria, archaea, and phages, inhabits the gastrointestinal tract of the organism. Male reproductive sterility is currently a prominent topic in medical research. Increasing research suggests that gut microbiota dysbiosis can result in various reproductive health problems. This article specifically investigates the impact of gut microbiota dysbiosis on male reproductive infertility development. Gut microbiota imbalances can disrupt the immune system and immune cell metabolism, affecting testicular growth and sperm production. This dysfunction can compromise the levels of hormones produced and secreted by the endocrine glands, affecting male reproductive health. Furthermore, imbalance of the gut microbiota can disrupt the gut-brain-reproductive axis, resulting in male reproductive infertility. This article will explore how the imbalance of the gut microbiota impacts male reproductive infertility through immune regulation, endocrine regulation, and interactions of the gut-brain-reproductive axis, concluding with recommendations for prevention and treatment.

We can analyze the properties of the Collatz Conjecture by using Terras’ Theorem, and computational graphical calculations. To do this, we introduce the concept of “tree" which shows the relationship between the input and output positive integers of the Collatz process. This approach offers a novel way for determining the non-existence of loops and diverge trees through computer simulations.

With the development of deep learning, several Graph Neural Networks (GNN)-based approaches have been utilized for text classification. However, GNNs encounter challenges in capturing contextual text information within a document sequence. To address this, a novel text classification model RB-GAT is proposed by combining RoBERTa-BiGRU embedding and a multi-head Graph ATtention Network (GAT). First, the pre-trained RoBERTa model is exploited to learn word and text embeddings in different contexts. Second, the Bidirectional Gated Recurrent Unit (BiGRU) is employed to capture long-term dependencies and bidirectional sentence information from the text context. Next, the multi-head graph attention network is applied to analyze this information, which serves as a node feature for the document. Finally, the classification results are generated through a Softmax layer. Experimental results on three benchmark datasets demonstrate that our method can achieve an accuracy of 71.48%, 98.45%, and 80.32% on Ohsumed, R8, and MR, which is superior to the existing nine text classification approaches.

The intricate relationship between Gray-Level Co-occurrence Matrix (GLCM) metrics and machine learning model performance underscores the need for rigorous dataset evaluation and selection protocols to ensure the reliability and generalizability of classification outcomes. This study involved a thorough examination of selected publicly available plant diseases datasets, with an emphasis on how well they performed as measured by GLCM metrics. After first classifying the datasets according to their GLCM metrics, dataset_2 (D2) and dataset_5 (D5) were found, respectively, to be the best-performing dataset in all GLCM analyses. The same datasets were then used to train deep learning models, and their classification performances were assessed. A noteworthy association was observed between the results of training deep learning models and the performance ratings derived from GLCM studies. More specifically, dataset_2 (D2) performed best in both GLCM analysis and deep learning model performance, indicating a strong correlation between the accuracy of classification and the textural qualities that GLCM captured. In the context of plant disease identification, in particular, these results highlight the significance of clearly defined dataset selection criteria in deep learning applications. Scholars can improve the accuracy and dependability of deep learning models for diagnosing plant diseases by giving preference to datasets with favorable GLCM metrics. The research also emphasizes the importance of texture features being taken into account in addition to conventional image features, highlighting the necessity of transparency and rigor in dataset selection procedures.

(1)Background: Fascioliasis is considered a neglected tropical disease affecting an estimated 17 million people in more than 70 countries worldwide. The highest prevalence of human fascioliasis is found in regions where livestock farming and consumption of raw or undercooked freshwater plants are common, such as parts of Africa, Asia, Europe, and Latin America. It is responsible for over 90,000 disability-adjusted years of life due to associated abdominal complications. We conducted a study to investigate the prevalence of human fascioliasis through a systematic review and meta-analysis of all available literature in Sun-Saharan Africa.(2). Methods: We screened a total of 126 publications using pubmed online search engine databases; Web of Science and CAB for articles published within a 20-year period between 2000 and 2022. We used a comprehensive search method using a combination of terms, parasite and disease names. The initial search resulted in a screening of articles by title, abstracts and full texts. The relevant information on the prevalence of human fascioliasis in Africa was extracted. Of the 126 publications, 33 articles were selected for meta-analysis. The essential information required was extracted from these documents and determined through statistical analysis in Microsoft Excel for calculating the prevalence of human fascioliasis in sub-Saharan Africa. The variance of each study was assessed using a bimodal distribution and heterogeneity assessment using a I2 index. Analysis was performed using random effects models.(3)Results: A total of 271 articles were searched through the database search and 33 articles were eligible studies that provided qualitative information on the prevalence of human fascioliasis in Africa. These make up 12.17% (n=33). The pooled prevalence estimates for human fascioliasis are 0.032% (IVhet PPE: 0.032% (95%CI 1.4-6.53). The highest prevalence rate was observed in Egypt with a prevalence of 100%. The prevalence of human fascioliasis is very high in some sub-Saharan countries, partly due to neglect of diagnostics, demonstrating the bias of available information for decision-making in human fascioliasis across Africa, given the spatial presence, scarcity and incompleteness are region.(4)Conclusions: The prevalence of Human fascioliasis is very high in some Sub-Saharan Countries partly due to neglect in diagnostics. This presents how highly focal with spatial occurrences, scarcity and patchy the available information for decision making is on Human fascioliasis across the Sub-Saharan African region.

The rise of fintech in the financial sector presents a transformative shift towards digitalization and sustainability, leveraging technologies like AI to minimize environmental footprint. Neobanks not only challenge traditional banking models but also offer innovative solutions that align with sustainable objectives. The purpose of this paper is to analyze the impact of neobanks on global sustainability, from economic, environmental, and social point of view. A comprehensive literature review of existing literature and current sustainable practices of neobanks was conducted. We have found that neobanks significantly positively contribute towards environmental sustainability with reduced paper use and logistics requirements of banking services. By offering more accessible and affordable banking services they importantly contribute towards higher financial inclusion, and with innovative products towards more competitive and innovative financial markets. AI-based tools they employ are increasing financial literacy and social inclusion. We also highlight concerns regarding electronic waste management, potential high energy consumption, required digital literacy and cybersecurity risks. We conclude that despite the mentioned risks, neobanks importantly contribute to global sustainability in many ways, and will even more in the future. Our findings can help neobanks shape sustainable practices and guide policymaking, as well as spread awareness of sustainable impact of banking services.

Color image binarization plays a pivotal role in image preprocessing work, significantly impacting subsequent tasks, particularly in text recognition. This paper concentrates on Document Image Binarization (DIB), aiming to separate a image into foreground (text) and background (non-text content). Through a thorough analysis of conventional and deep learning-based approaches, we conclude that prevailing DIB methods leverage deep learning technology. Furthermore, we explore the receptive fields pre- and post-network training to underscore the Transformer model's advantages. Subsequently, we introduce a lightweight model based on the U-Net structure, enhanced with the Mobile ViT module to better capture global information features in document images. Given its adeptness at learning both local and global features, our proposed model exhibits superior performance on two standard datasets (DIBCO2012 and DIBCO2017) compared to state-of-the-art methods. Notably, our proposed DIB method presents a straightforward end-to-end model devoid of additional image preprocessing or post-processing. Moreover, its parameter count is less than a quarter of the HIP'23 model, which achives best results on three datasets(DIBCO2012, DIBCO2017 and DIBCO2018). Finally, two sets of ablation experiments were conducted to verify the effectiveness of the proposed binarization model.

Fragile X syndrome (FXS), the most common monogenic cause of inherited intellectual disability and autism spectrum disorder, is caused by a full mutation (&gt;200 CGG repeats) in the Fragile X Messenger Ribonucleoprotein 1 (FMR1) gene. Individuals with FXS experience a wide range of challenges related to social interaction (SI). Animal models, such as Drosophila melanogaster model for FXS where the only ortholog of human FMR1 (dFMR1) is mutated, have played a crucial role in understanding of FXS. The aim of this study was to investigate SI in the dFMR1B55 mutants using the novel Drosophila Shallow Chamber and a Python data processing pipeline based on social network analysis (SNA). In comparison with wild-type flies (w1118), SNA analysis in dFMR1B55 mutants revealed hypoactivity, fewer connections in their networks, a lower ability to efficiently transmit information, fewer alternative pathways for information transmission, a higher variability in the number of interactions they achieved, and tended to stay near the boundaries of the testing chamber. These observed alterations indicate the presence of characteristic strain-dependent social networks in dFMR1B55 flies, commonly referred to as the group phenotype. Finally, a combination of novel research tools is a valuable method for SI research in fruit flies.

Spatial relations between tumor cells and host-infiltrating cells are increasingly important in both basic science and clinical research. In this study we have tested the feasibility of using standard methods of immunohistochemistry (IHC) in a multiplex staining system using a newly developed set of chromogenic substrates for the peroxidase and alkaline phosphatase enzymes. Using this approach we have developed a set of chromogens characterized by 1) providing fine cellular detail, 2) non-overlapping spectral profiles, 3) absence of interactions between chromogens, 4) stable upon storage, and 5) compatible with current standard immunohistochemistry practices. When viewed microscopically under brightfield illumination the chromogens yielded the following colors; red, black, blue, yellow, brown, and green. By selecting compatible color combinations we have shown feasibility for four-color multiplex staining. Depending on the particular type of analysis being performed, visual analysis, without the aid of computer assisted image analysis, was sufficient to differentiate up to four different markers.

Goat milk's medicinal properties and potential cosmetic and health benefits have prompted extensive scientific investigation into its therapeutic applications, particularly for human skin conditions like eczema and psoriasis. Genetic factors, including genes such as lactoferrin (LTF), lysozyme (LYZ), and β-casein (CSN2), play a crucial role in shaping milk composition and its effects on skin health. This review explores the utilization of genomic tools to elucidate the genomic profiles of dairy goat breeds and the medicinal properties of goat milk, particularly in addressing key skin diseases. Genetic determinants of milk composition, quality, nutritional quality, and functional properties such as the growth hormone receptor (GHR), butyrophilin (BTN1A1) and lactoglobulin (LGB) genes, facilitating targeted breeding strategies to enhance the production of bioactive compounds with dermatological relevance have been identified. Future genomic approaches should aim at exploring goat milk's immunomodulatory, antimicrobial, and antioxidant activities, offering potential applications in skin care formulations for managing inflammatory skin conditions. Furthermore, the integration of genomic data with functional studies can provide valuable insights into the therapeutic effects of goat’s milk and its derivatives in addressing skin diseases.

As a crucial part of head protection equipment, research on the material and structural application of helmet liners has always been a hot topic in the field of helmet manufacturing. This paper aims to introduce the most common helmet liner materials, including traditional polystyrene, polyethylene, polypropylene, and others, as well as emerging materials such as anisotropic materials, and polymer nanocomposites. In addition, the design principles of helmet liner structure are discussed, including the evolution of multi-layer structure, integration of geometric irregular bubbles, etc., to enhance energy absorption capacity. Advanced manufacturing processes such as additive manufacturing technology are introduced to fabricate complex structures. Finally, the application of biomimetic structures in helmet liner design is explored. For example, the structure of biological tissue can be used to design a helmet liner structure with superior energy absorption performance. On this basis, the idea of bionic structures is extended to the combination of plant stalks and animal skeletal structures, and additive manufacturing technology is used to significantly reduce energy loss during elastic yield energy absorption, thus designing a reusable helmet. This provides a promising research direction for future helmet liner materials and structural applications.

Partial Information Decompositions (PIDs) aim to categorize how a set of source variables provide information about a target variable redundantly, uniquely, or synergetically. The original proposal for such an analysis used a lattice-based approach and gained significant attention. However, finding a suitable underlying decomposition measure is still an open research question, even at an arbitrary number of discrete random variables. This work proposes a solution to this case with a non-negative PID that satisfies an inclusion-exclusion relation for any f-information measure. The decomposition is constructed from a pointwise perspective of the target variable to take advantage of the equivalence between the Blackwell and zonogon order in this setting. The zonogons correspond to the Neyman-Pearson region for an indicator variable of one target state and f-information is the expected value of quantifying its boundary. We prove that the decomposition satisfies the axioms of the original decomposition framework and guarantees non-negative partial information results. We highlight that our decomposition behaves differently depending on the used information measure, which can be utilized for different applications. We additionally show how our proposal can be used to obtain a non-negative decomposition of Rényi-information at a transformed inclusion-exclusion relation, and for tracing partial information flows through Markov chains.

Currently, the textile industry is among the most rapidly expanding areas of the economy and is an important source of water pollution. There are many efficient chemical and physical methods for treating textile effluent, but they produce secondary pollutants. Therefore, there is a need to manage the textile waste wastewater. The potential EPS-producing and plant growth-promoting rhizobacteria Lysinibacillus capsici PB300 (T) bacteria strain has been isolated from the bark borer-affected Peltophorum pterocarpum plant and has been determined to be effective in > 95 decolorizing Reactive Red 120, and other azo dyes such as AB11385%, orange II 94.62%, Congo red 94.62%, phenol red 94.54%, and mixtures of azo dyes 81.66%. Physico-chemical factors were optimized manually, including Taguchi design. EPS production, PGPR strain, and fabric discoloration of L. capsici were qualitatively studied. The FTIR, GC-MS, and UV absorbance studies also confirmed that the dye had been broken into its amines. Research findings using enzyme assays have shown that the bacteria Lysinibacillus capsici PB300 (T) can utilize laccase and manganese peroxidase and are capable of degrading dyes significantly. According to this work, immobilised L. capsici cells and the studied four bacterial consortiums, Lysinibacillus capsici PB300 (T), Alcaligenes faecalis subsp. Phenolicus DSM 16503 (T), Acinetobacterbaumanni ATCC 19606 (T), and Pseudomonasaeruginosa JCM 5962 may be employed to degrade RR120 effectively, and it is concluded that L. capsici PB300 (T) bacteria is significantly efficient in textile effluent treatment.

The coseismic surface three-dimensional deformation fields were significant for quantified the geometric and kinematic characteristics of earthquake rupture faults. Traditional geodetic techniques were constrained by their intrinsic limitations, such as InSAR, which could only extract far-field deformation fields due to its incoherence, and GNSS, which could only acquire deformations at discrete points. The recently developing optical pixel correlation technique based on high resolution remote sensing images could acquire the near-field coseismic horizontal deformation. In this study, the vertical displacement field of the 2022 Mw 6.6 Menyuan earthquake was obtained by differencing the pre- and post-earthquake DEMs from GaoFen-7 stereo satellite images. Further, the line-of-sight (LOS) and azimuthal (AZI) directions far-field deformations by InSAR, the horizontal near-field deformation by optical pixel correlation based on pre- and post-earthquake GF-2/7 images, and the vertical deformation by differencing the pre- and post-earthquake DEMs, were incorporated to comprehensively solve the complete three-dimensional deformation fields of the 2022 Mw 6.6 Menyuan earthquake. Firstly, the vertical displacement field by differencing DEMs indicated there were significant vertical displacements about 1 m at the bend region, which was induced by the local compressive stress. In addition, at the epicenter on the middle segment of ruptured Lenglongling fault (LLLF), the maximum lifting occurred on the southern sides of the main and secondary faults exceeded 2 m. Secondly, the three-dimensional deformation fields solved by multiple deformation data demonstrated that the near-field deformation field calculated by optical pixel correlation method could quantify the displacements distributed over the rupture fault zone, which were not available on the InSAR deformation maps. Finally, the surface 2D strain derived from the displacement maps calculated by optical pixel correlation revealed high strain concentration on the rupture fault zone. Our study focused on the complete surface three-dimensional deformation estimation from multiple far- and near-field deformation data, and provided a new perspective for a deeper understanding of the characteristics of coseismic surface deformation and the rupture pattern of the fault.

Low energy consumption is a significant contribution of new and retrofitted buildings that place an emphasis on energy efficiency. Although the mandatory requirements of the U-factor and R-value are described in the Vietnamese National Technical Regulation on the energy efficiency of buildings—QCVN09:2017/BXD, these values are not widely publicized, leading to designers facing difficulties when choosing suitable materials at the design stage. This study focuses on the method used to declare the heat transfer values of building materials based on the energy labeling process in order to create an energy labeling program for building materials. To accomplish this objective, criteria and labeling procedures for windows, doors, walls, and building roofs have been developed. In addition, a case study of insulation product labeling was used to evaluate the applicability of the developed labeling program in the implementation phase.

An analysis of the features of measurements and correction of phase distortions in optical waves propagating in the atmosphere at various levels of turbulence was performed. It is shown that with increasing intensity fluctuations, the limiting capabilities of phase correction decrease, and the phase of an optical wave that has passed through a turbulence layer consists of two components: potential and vortex. It was found that even in the region of weak fluctuations there is an overlap of spectral filtering functions for intensity and phase fluctuations. Areas of turbulence inhomogeneities have been identified that will have mutual influence and negatively affect the operation of the phase meter. It is noted that correlation functions, both phase and intensity, are less susceptible to this compared to structural functions. The results of experimental studies of the reconstruction of the wavefront of laser radiation distorted by atmospheric turbulence using a Shack-Hartmann wavefront sensor during vignetting and central screening of the entrance pupil of the optical system are presented. Studies have been carried out on the propagation of laser radiation along a horizontal atmospheric path for various levels of turbulence. The results are analyzed in terms of Zernike polynomials.

Introduction: Biliary Atresia (BA) is a common cause of neonatal cholestatic jaundice which, if recognized and treated early, can be life-saving for the infant. If the liver biopsy suggests the presence of BA, exploratory laparotomy is then carried out to confirm the diagnosis, along with the Kasai procedure to provide drainage to the bile secreted by the liver. The purpose of this study is to get a deep dive into all the various imaging modalities that can diagnose BA more effectively and with absolute certitude, thus helping prevent several children from a grave prognosis.Methodology: For the collection of the data, a search was done by two individuals using PubMed, Google Scholar, and Cochrane Library databases for all relevant literature. Each qualifying paper was evaluated independently by two reviewers. Each article was analyzed for the number of patients, their age, procedure modality, complexity of ethology, and incidence of the pre-decided complications. The statistical software packages RevMan (Review Manager, version 5.3), SPSS (Statistical Package for the Social Sciences, version 20), Google Sheets, and Excel in Stata 14 were used to perform the statistical analyses. The data was obtained and entered into analytic software.Results: A total of 39 studies with 3,679 subjects were selected for the study, out of which 7 studies showed sensitivity above or equal to 95%, and an astounding 14 studies showed specificity above 95%. The value of True Positive (TP) was 1280, that of True Negative (TN) was 1817, that of False Positive (FP) was 239, and that of False Negative (FN) was 343. With a confidence interval of 95%, sensitivity, specificity, and positive predictive values were calculated. The sensitivity of Ultrasonography for Biliary Atresia is 0.79, with a CI of 95% in a range of 0.77 to 0.81. The specificity of Ultrasonography for Biliary Atresia is 0.88, with a CI of 95% in a range of 0.87 to 0.90. Conclusion: Even though several radiological techniques at present help to detect BA, USG of the abdomen proves to be an effective diagnostic and a modest screening test for the detection of BA.

In the Vietnamese Mekong delta, soil quality and crop yield are steadily declining under rice monocultures with three crops per year. The objective of this study was to evaluate the medium-term effects of rotating rice with upland crops and adding organic amendments on rice yield and relate it to soil quality. A field trial with split-plot design including two factors and three replicates was carried out from 2017 to 2020, over the course of nine consecutive cropping seasons. Crop rotations and organic amendments were applied as main-plot and subplot factors, respectively. The rotations were: 1) rice–rice–rice (R–R–R), 2) soybean–rice–rice (So–R–R), and 3) sesame–rice–rice (Se–R–R), while organic amendment treatments included: i) no amendment (NO-AM); ii) compost of rice straw and cow manure (RS+CM), and iii) sugarcane compost (SGC); the composts were applied at a rate of 2.0 t ha-1. The rotation cycle started with the so-called spring–summer (SS), followed by summer–autumn (SA) and ended with the winter–spring (WS) season. Rice yield significantly (P &lt; 0.05) increased by organic amendments after nine growing seasons (2019–2020 WS), with an increment of 5.1% for RS+CM (7.07 ton/ha) and 6.1% for SGC (7.14 ton/ha). Contrary to our expectation, rotations with upland crops did not significantly increase rice yield. Rice yield significantly and positively correlated with an integrated soil quality index SQI (r = 0.86) for the topsoil (0–15 cm), but not for the subsoil (15–30 cm). The increased availability of soil nutrients (Si and marginally also P) and improved soil physical properties probably induced by organic amendments, along with other soil properties under study, cumulatively attributed to enhanced rice yield. Use of a SQI involving several soil quality indicators enables to overall quantify the importance of soil fertility for rice yield versus other factors and it provides an effective means of quantifying the integrated effect of improved management. Moreover, integrating a wide range of soil quality indicators in a SQI ensures its applicability across diverse settings, including different crop rotations and various soil types.

World Health Organization recommends adjusting the salt intake as a part of the nine global targets to reduce premature mortality from non-communicable chronic diseases as priority and most cost-effective intervention. In 2006. the main aim of the Croatian Action on Salt and Health was to decrease salt intake for 16% because of its critical intake and consequences on human health. We have organized educative activities for increasing awareness on salt harmfulness, defined food categories of prime interest, collaborate with industries and determine salt intake (24h urine-sodium excretion). It was determined that the proportion of salt in ready-to-eat baked bread should not exceed 1.4%. In the period 2014 –2022, salt in the semi-white bread was reduced 14%, in bakery 22% and in largest meat industry in Croatia 25%. Awareness of the harmfulness of salt on health increased from 65.3% in 2008 to 96.9% in 2023 and salt intake was reduced 15.9%-1.8 grams/day (22.8% men, 11.7% women). In last 18 years a significant decrease in salt intake was achieved in Croatia, awareness of its harmfulness increased, collaboration with food industry established and regulatory documents launched. However, salt intake is still very high underlying the need for continuation of efforts and even stronger activities.

This article develops duality principles and numerical results for a large class of non-convex variational models. The main results are based on fundamental tools of convex analysis, duality theory and calculus of variations. More specifically the approach is established for a class of non-convex functionals similar as those found in some models in phase transition. Finally, in the last section we present a concerning numerical example and the respective software.

Most existing coal-fired power plants were designed for sustained operation at full load to maximize efficiency, reliability, and revenue, as well as to operate air pollution control devices at design conditions. Depending on plant type and design, these plants can adjust output within a fixed range in response to the plant operating or market conditions. The need for flexibility driven by increased penetration of variable and non-dispatchable power generation such as wind and solar is shifting the traditional mission profile of thermoelectric power plants in three ways: more frequent shutdowns when market or grid conditions warrant, more aggressive load ramp rates (rate of output change), and lower minimum sustainable load, which provides a wider operating range and helps avoid costly plant shutdowns. Recent studies have shown that flexibility of a coal-fired power plant can be improved by energy storage. The objective of this work was to analyze a set of energy storage options and determine their impact on flexibility and economics of a representative coal-fired power plant. The effect of three energy storage systems integrated with a coal power plant on plant flexibility and economics was investigated. The results obtained in this project show that Energy Storage Systems integrated with a thermal power plant improves plant flexibility and participation in the Energy and Ancillary Services markets which improves plant financial performance. The study was funded by the U.S. Department Office of Fossil Energy FE-1 under Award Number DE-FE0031903.

This paper explores the application of machine learning (ML) algorithms in predicting trends in the fixed bond market, where traditional analytical methods have proven inadequate. Focusing on various ML techniques such as supervised and unsupervised learning, neural networks, and deep learning, the study evaluates their effectiveness in forecasting market movements. It details a series of experiments in which different ML models are rigorously trained and tested against historical bond market data. The findings reveal that models employing time series analysis and advanced deep learning show marked potential in accurately predicting bond market trends. Additionally, the paper delves into the challenges and limitations inherent in these ML approaches, including data requirements and the risk of model overfitting. Finally, it proposes directions for future research, emphasizing the integration of ML into broader financial market analysis.

Background and Objectives: ACTION-France (Awareness, Care and Treatment In Obesity MaNagement in France) aims to identify the perceptions, attitudes, behaviors, and potential barriers to effective obesity management in France and guide collaborative actions. Methods: ACTION-France is a cross-sectional survey of people with obesity (PwO) and healthcare professionals (HCPs), in France. The PwO and HCP questionnaires ran from 27/09/2022 to 01/02/2023 and from 19/12/2022 to 31/03/2023, respectively. Results: The study, encompassing 1226 PwO and 166 HCPs, reveals a shared recognition of obesity as a chronic condition. However, despite being requested by most PwO, weight-related discussions are surprisingly infrequent, leading to delayed diagnosis and care. PwO and HCPs held different views as to why: HCPs often attributed it to PwO’s lack of motivation or disinterest, whereas PwO avoided them because they felt weight managing was their own responsibility and were uncomfortable discussing it. When weight was discussed, primarily with general practitioners (GPs), discussions mostly focused on physical activity and dietary. However, results identified a strong psychosocial impact of obesity: 42% of respondents reported anxiety-depressive symptoms, and many more hesitated to engage in certain social activities because of their weight. Psychotherapy was only discussed by 55% of HCPs. Pharmaceutical options were also rarely discussed (19.5% of HCPs), though 56.1% of PwO reported they would want to. Conclusions: HCPs’ and PwO’s perceptions differed significantly and need to converge through enhanced communication. A holistic approach, integrating comprehensive training for GPs and psychological comorbidities, would help to bridge perceptual gaps effectively and foster more empathetic and effective patient care.

Background: Permanent tracheostomy because of total laryngectomy surgery entails great conse-quences for the patient regarding respiratory physiopathology such as the filtering, humidifying, and heating function of the air by the nose is lost. The use of special stomal filters can determine adequate protection of the trachea-broncho-pulmonary system with a reduction in respiratory pathologies. In fact, in most cases laryngectomee patients are first cigarette smokers who for this reason already have also respiratory diseases such as chronic obstructive pulmonary disease (COPD). Despite the availability of tracheal filters, multiple times, as reported in the literature, the patient tends to limit their use due to reported breathing difficulties, especially in conditions of intense breathing. Methods: The objective of this clinical study was to evaluate the most suitable stomal filter for the laryngectomee patient during physical activity. The filters studied were an INHEALTH device (Blom-Singer SpeakFree HME); two ATOS devices (Provox® Life™ Energy HME and Provox® Life™ Home HME); and an FAHL device (Laryvox HME Sport). Results: For this purpose, the performances of 31 laryngectomee patients, subjected to medi-um-high physical effort, were analyzed through a standardized pneumological test, the Six Minute Walking Test (6MWT) which involves a sustained walk lasting six minutes, with evaluation , every 60 seconds, heart rate, oxygen saturation and meters travelled; furthermore, it examines two sub-jective indices, namely, the basal and final dyspnea index and the initial and final muscular fatigue index.

This paper investigates the influence of sample size and layer height on the elastic modulus of samples 3D printed by fused filament fabrication (FFF). Cubic samples of different sizes from either a stiff thermoplastic polymer (polycarbonate (PC)) or a soft polymer (thermoplastic polyurethane (TPU)) were printed at three different layer heights: 0.1 mm, 0.2 mm, and 0.4 mm. The samples were imaged using micro-computed tomography to visualize porosity and tested under compression. The results indicate that the elastic modulus of TPU varied with sample size, demonstrating size effects due to high porosity. In contrast, PC samples had a low void volume fraction and did not demonstrate statistically significant size effects on the elastic modulus. The variations in elastic modulus due to layer height were statistically significant for both materials. The highest elastic modulus was observed at 0.2 mm layer height for both materials across different sample sizes, which can be attributed to low void volume fractions. The study develops process-structure-property relations for PC and TPU samples manufactured by FFF. It provides new insights into the design guidelines for FFF based on the size effects. The results indicate that variations in mechanical properties due to size effects must be considered during the design stage for TPU to accurately predict the material’s behavior. Additionally, the locations of the printed parts that are subjected to higher loads should be printed closer to the heated print bed due to the lower void volume fraction observed in the section of the samples printed adjacent to the heated print bed.

Abstract: Severe land degradation is the principal environmental problem in Ethiopian highlands in the form of soil erosion, and soil fertility loss, which is caused by human intervention for food, shelter, and energy demands. Soil erosion contributes to the loss of precious soil and water resources which are the basis of agricultural production and provide numerous other eco-system services. The Ethiopian highlands are one of the most degraded regions in the world. To combat such problems, the government of Ethiopia has been implementing massive soil and water conservation works at the watershed scale since 2010 to conserve soil and water resources. Mount Yewel is one of the highlands in Northeastern Ethiopia where intensive soil and water conserva-tion has been implemented. Despite the massive investment in soil and water conservation measures, most of the rivers in the highlands of Ethiopia carry huge amounts of sediment with high flood risks in the wet season and streams are dried up in the dry period. Nonetheless, the impact of soil and water conservation measures on flood reduction and dry season flow en-hancement has not yet been quantified and evaluated. This research was then conducted on paired micro-catchments of Mount Yewel with the main objective of evaluating the impact of soil and water conservation measures on base flow modification. Stream flow and rainfall data were col-lected from 22/11/2020 to 8/11/2022 on paired micro-catchments of Mount Yewel at their outlets and centers respectively. Base flow separation was done from the stream hydrograph using Sp. Hydro base flow separation tool and SPSS Ver.21 statistical software were employed for data analysis. Flow duration curves (FDC) for both watersheds were developed to compare the stream flow patterns between treated and untreated micro-catchments of Mount Yewel. The FDC indi-cated that the base flow from treated micro-catchment is higher and sustained in the dry season while it is low and unsustained in untreated micro-catchment. From statistical analysis, there is a significant (P

The intelligent morphing wing structure has the characteristics of flexibility, large deformation and adaptive change, which are different from those of the conventional wing. The motion law of the variable-camber leading edge is analysed by the numerical simulation method based on kinematics theory to solve the problem of verifying the motion function and structural strength of the variable camber wing. The driving deformation and aerodynamic load simulation of the variable camber leading edge are realised by designing a follow-up load test apparatus. Based on the numerical simulation of the mechanical boundary, the motion trajectory of the upper and lower wing loading points was predicted, and a multi-point cooperative control system was developed. Multi-sensor iteration was used to ensure the loading accuracy of the test control. The test results show that the average error of the deflection angle is 4.59% in the variable camber leading edge motion test. In the variable camber leading edge strength test, the average error of applied load magnitude and direction is 0.54% and 0.24%, respectively.

The article delves into the crucial realm of compressing hydrogen in its gaseous state, a pivotal process for enhancing its viability in both civil and industrial sectors. The study initiates by providing a concise overview and comparison of diverse hydrogen storage methodologies, laying the groundwork with an in-depth analysis of hydrogen's thermophysical properties. It scrutinizes plausible configurations for hydrogen compression, aiming to strike a delicate balance between energy consumption, predominantly derived from the fuel itself, and the requisite number of compression stages. Notably, to render hydrogen storage competitive in terms of volume, pressures of at least 350 bar are deemed essential, albeit at an energy cost amounting to approximately 10% of the fuel's calorific value. Multi-stage compression emerges as a crucial strategy, not solely for energy efficiency, but also to curtail temperature rise, with an upper limit set at 200°C. This nuanced approach is underlined by the exploration of compression levels commonly cited in the literature, particularly 350 bar and 700 bar. Ultimately, the study advocates for a three-stage compression system as a pragmatic compromise, capable of achieving high-pressure solutions while keeping compression work below 10 MJ/kg, a threshold indicative of sustainable energy utilization.

Soil secondary salinization has seriously affected the greenhouse vegetable production in China. To improve the secondary salinization greenhouse soil and enhance the soil physical-chemical properties in an eco-environmental way, different organic amendments (straw, straw biochar, Trichoderma bio-organic manure, commercial organic manure) were applied using pot experiment for 60 day to comprehensively screen the optimal remediation method. In this study, soil nutrient condition and salt movement were assessed, and predictive models using multi-linear regression (MLR) and Random Forest (RF) were developed to estimate soil salinization parameters. The findings indicated a significant decrease in soil salt content following the application of organic materials compared to the control treatment. Specifically, the addition of straw at a rate of 250g/kg resulted in a 59.38% reduction in soil salt levels after 60 days (P < 0.05). Furthermore, the main salt ions exhibited dynamic changes over the course of the experiment, with reductions observed in Na+, Ca2+, Cl-, and NO3- content under the 250 g/kg straw treatment by 83.63%, 74.67%, 63.26%, 59.07%, respectively, compared to CK (P < 0.05). In addition, the SO42- content under 125 g/kg commercial organic manure amendment reduced by 48.94%, respectively (P < 0.05). Contrary to expectations, the addition of organic materials significantly increased the levels of total nutrients (N/P/K) and available potassium (AK) and phosphorus (AP) in the soil. Specifically, the addition of straw at a rate of 250 g/kg resulted in increases of 18.02%-87.38% in total potassium (TK), 66.67%-200% in total phosphorus (TP), and 142.87%-367.8% in AK after a period of sixty days (P < 0.05). Ultimately, the treatment involving the addition of 250 g/kg of straw demonstrated the most pronounced impact on the physical and chemical properties of the soil. The random forest method shows promise in accurately predicting soil salt and soil sodium adsorption ratio (SAR)indicators, thereby providing a valuable tool for estimating soil properties.

The experience of ego dissolution and self-transcendence induced by psychedelic substances offers a profound challenge to our conventional understanding of the self and our relationship with the natural world. This paper delves into the philosophical underpinnings and implications of this phenomenon, exploring how the temporary breakdown of ego boundaries during a psychedelic experience may foster a sense of profound interconnectedness with nature. Drawing from Western and Eastern philosophical traditions, as well as recent insights from neuroscience and consciousness studies, we examine the potential of psychedelic-induced self-transcendence to catalyze a shift in our perspectives on the human-nature relationship. The paper investigates the philosophical implications of this experience, including its resonance with deep ecological philosophies and its potential to inspire more ecocentric ethical frameworks. Furthermore, we explore the possible practical implications of fostering a sense of ecological connectedness through psychedelics, such as promoting environmentally sustainable behaviors and addressing the pressing challenges of climate change and ecological degradation. Ultimately, this exploration highlights the value of engaging with altered states of consciousness as a means to reconsider our place within the intricate web of life on Earth.

Raru’s plants bark has long been used as traditional medicine in Batak’s tribe. Raru’s bark is derived from several trees that are usually used in a mixture in Batak traditional beverages. This bark is generally used as antidiabetic remedies. This study aims to combine the rarus’s bark extract and mocaf activated-carbon (MAC) in order to study antidiabetics in rats. The combination of raru’s bark extract and MAC were tested on male rats as of Sprague Dawley strain for testing antidiabetic bioactivity. The result showed that antidiabetic activity of raru’s extract and MAC exposed the antidiabetic level declines in rat’s blood. The various treatments of different concentration ratios of raru’s extract and MAC useful in the experiments showed that the levels of blood level reduction were slightly different (14-21%). The raru’s extract pure was observed more effective in decreasing the blood glucose level in rat’s blood, in comparison the positive control. The mixture of raru’s extract and MAC with 75:25 ratio is better than 50:50 ratio. The involvement of MAC in the alleged antidiabetic agent did little in improving the blood glucose level decrease in rat’s blood. Raru’s extract and MAC indicate its potential utilization as an antidiabetic agent.

Present study on land use land cover analysis and taluka wise combination of cropped area, carried out in Beed district of Maharashtra state in India and studied 11 talukas of the district. Secondary data on land use land cover and area in various crops has been collected, compiled and analyzed from various secondary sources. Simple descriptive statistics used to examine the agricultural land use land cover and J.C. Weaver’s crop combination technique was used for taluka wise analysis of crop combinations and on the basis of highest to smallest area engaged in particular crop, crops have been ranked. The study showed that, in the district as a whole, percentage of uncultivated land other than fallow was about 46 percent as compare to net sown area is only 35 percent in total geographical area (1063855ha) of Beed district. The study further revealed that about 42 percent area engaged in food crops and about 58 percent area occupied by nonfood crops, which includes cereals (25%), cotton (19%), pulses (13%), oilseed (12%), sugarcane (5%) and fruits and vegetables (3%). Results of Weaver’s crop combination technique showed that the Wadwani taluka demarcated as most diversified taluka by means of maximum number (sixteen) of crops combinations with the lowest variance value (14) found in the present investigation. Further, the study revealed that the high crop diversity found in Dharur taluka with eighteen crop combinations and the taluka has given first rank amongst others. To derive the crop diversity ranking, taluka wise maximum to minimum number of crop combinations derived in different talukas and given ranks accordingly. The study concluded that, agricultural land use analysis is essential for solving and optimizing the land use problem, maintaining socio-ecological balance, best utilization of scarce resources. The authors enlightened that the rational use of agricultural land has important for food security and biodiversity which increase the productivity and profitability of the agriculture sector and it indicates the decision making ability of farmers in study area.

To be used in cutting-edge green and other technologies, rare earth elements (REEs) are in great demand. Rare earth elements (REEs) include the following elements: La, Ce, Pr, Nd, Pm, Sm, Eu, Gd, Tb, Dy, Ho, Er, Tm, Yb, and Lu; additionally, they include Sc. Computers, laptops, TVs, generators, DVD players, cell phones, refrigerators, and other electronic equipment that are usually thrown away by their original owners because of their limited lifespan are examples of outdated or end-of-life electronics that make up e-waste. At the moment, these metals are essential to many contemporary devices, from LED light bulbs and wind turbines to cell phones and televisions. The development of new, cutting-edge technologies, especially in the field of electronics, depends on the availability of rare earth elements (REEs), sometimes referred to as the "vitamins" of modern industry. Since e-waste frequently has high concentrations of rare earth elements and is handled in hazardous ways, e-waste may be a significant contributor to the contamination of rare earth elements. Apart from their detrimental effects on the environment, these wastes also result in the loss of precious materials and rare earth elements such as gold, silver, copper, platinum, palladium, and rare earth, among other things. Every year, 50 million tonnes of e-waste are created globally. An enormous amount of e-waste is wasted since only 20% of it is handled correctly worldwide. There have been numerous reports on the recovery and separation of rare earth elements (REEs) from e-waste using various techniques, such as the hydrometallurgical process, siderophores, pyrometallurgical process, bioleaching, and biosorption. According to reports, the demand for rare earth elements (REEs) from clean technologies is expected to reach 51.9 thousand metric tons (kt) of REO in 2030. Nd and Dy, on the other hand, make up 75% and 9% of the world's REE deposits, respectively. REE levels in aquatic settings are rising, particularly in urban areas, in tandem with the growing demand for high-tech applications. Urban wastewater from open sewers and the entrance of a wastewater treatment facility in Cotonou, Benin, was collected, and its rare earth element (REE) contamination was evaluated.

Rubella infection is typically mild or asymptomatic except when infection occurs during pregnancy. Infection in early pregnancy can cause miscarriage, stillbirth, or congenital rubella syndrome. Only individuals that are still susceptible to rubella infection during child-bearing age are vulnerable to this burden. Rubella containing vaccine (RCV) is safe and effective, providing life-long immunity. However, average age-at-infection increases with increasing vaccination coverage, which could potentially lead to increased disease burden as well, if the absolute risk of infection during child-bearing age increases. Dynamics of rubella transmission were explored using EMOD, a software tool for building stochastic, agent-based infection models. Simulations of pre-vaccine, endemic transmission of rubella virus introduced RCV at varying levels of coverage to determine the expected future trajectories of disease burden. Introducing RCV reduces both rubella virus transmission and disease burden for a period of around 15 years. Increased disease burden is only possible more than a decade post-introduction, and only for contexts with low current burden and high transmission intensity. Low or declining rubella virus transmission intensity is concurrently associated with both greater disease burden and greater vaccine effectiveness. The risk of increasing burden through vaccination only exists for locations with persistently high infectivity, high connectivity, and high fertility. A trade-off between the risk of a small, future burden increase and a large, immediate burden decrease strongly favors RCV introduction.

Catastrophic mass flows originating from the high mountain cryosphere often cause hazard cascades. With increasing human activities in the alpine region and the sensitivity of glaciers, snow and permafrost to climate warming, the cryospheric hazard risks tend to be more active in the Tibetan Plateau(TP). The remoteness and inaccessibility of high mountain regions make the remote sensing technology the most effective approach for monitoring and investigating the cryospheric hazards. Exploring the evolution process and impact of ice avalanches and subsequent hazards are crucial to understand drivers and nature of mass flow process chain in order to prevent and mitigate potential hazard consequences. In this study, the glacier and ice-rock avalanches occurred in Arutso and Sedongpu basins in Tibet were investigated on the basis of Sentinel-2 time-series images and in-situ investigation, the evolution process of these events were reconstructed, and impacts and driving factors were analyzed. The massive Chamoli rock-ice avalanche occurred in February 2021 in the western Himalayas was also reviewed using using same methods. The study shows that Arutso glacier No. 53 (Arutso-53) avalanche completely melted away in July 2018 after two years from occurrence to final disappearance, while Arutso glacier No. 50 (Arutso-50) avalanche completely melted by the end of August 2023 after lasting for seven years. Four large-scale ice-rock avalanche and debris flow events in the Sedongpu basin in 2017 and 2018 not only had significant impacts on the river flow, landscape and geomorphologic shape in the basin, but also caused serious disasters in the basin and downstream. In March 2021, a small-scale ice-rock avalanche and debris flow event occurred again in the Sedongpu basin. The glacier and ice-rock avalanches occurred in Tibet area were mainly induced by climate warming, heavy precipitation and seismic activity, which acting on specific topographic and geomorphic structure of glacier properties in the high mountain regions. Catastrophic hazard events originating from the high-elevation glacier and ice-rock collapses in the mountain cryosphere and subsequent hazard cascades in the TP and Himalayas highlight the importance of mountain hazard monitoring, early warning systems and sustainable mountain development.

Dietary fibers regulate intestinal barrier function; however, the precise mechanisms remain unclear. This study investigated the effects of psyllium fibers on antimicrobial protein expression, focusing on the type II immunity and tuft cell-group 2 innate lymphoid cell (ILC2) circuit in the small intestine of the mouse. Supplemental psyllium fiber upregulated antimicrobial proteins, such as small proline-rich protein 2A (SPRR2A) and resistin-like beta (RELMβ), in mouse small intestine, evidently affecting cecal microbiota composition. Psyllium fibers also increased the RNA and protein expression of molecules related to ILC2 and tuft cells, such as IL-13, IL-25, DCLK1, Gfi-1b, SH2 domain-containing protein 3C, and Spi-B. In addition, ILC2 inhibitor (disulfiram) and bitter taste receptor blocker administration reduced psyllium-induced SPRR2A and RELMβ expression. Collectively, psyllium supplementation upregulates antimicrobial proteins such as SPRR2A and RELMß via the type II immune response and tuft cell-ILC2 circuit in the mouse small intestine.

Direct Energy Deposition (DED) is a versatile and efficient method in metal additive manufacturing. However, humping, caused by abnormal dynamics in the melt pool (MP), poses a significant threat to the geometric integrity of manufactured products. Current state-of-the-art (SOTA) methods primarily detect humping by analyzing late-stage spatial abnormalities, such as MP detachment. This approach is fundamentally reactive, leading to a tendency to miss early humping spatiotemporal dynamics, like cyclic elongation of the MP. This study introduces a novel, proactive indicator named VIMPS (Variability of Instantaneous MP Solidification-Front Speed), a physics-based tool designed to quantify early abnormal fluctuations in MP solidification speed. The experiments demonstrate VIMPS correlation with humping-induced geometric inaccuracies. By capturing early spatiotemporal dynamics of the MP, VIMPS reduces detection latency by 30 seconds compared to existing SOTAs that focus solely on spatial abnormalities. This significant improvement transforms detection from reactive to proactive, providing the time needed for corrective actions to enhance the overall productivity and quality of the DED process.

Ixodes scapularis is a blood-feeding obligate ectoparasite responsible for transmitting the Lyme disease (LD) agent, Borrelia burgdorferi. During the feeding process, I. scapularis injects B. burgdorferi into the host along with its saliva, facilitating the transmission and colonization of the LD agent. Tick calreticulin (CRT) is one of the earliest tick saliva proteins identified and is currently utilized as a biomarker for tick bites. Our recent findings revealed elevated levels of CRT in the saliva proteome of B. burgdorferi-infected I. scapularis nymphs compared to uninfected ticks. Differential precipitation of proteins (DiffPOP) and LC-MS/MS analyses were used to identify the interactions between Ixs (I. scapularis) CRT and human plasma proteins and further exploring its potential role in shielding B. burgdorferi from complement killing. We observed that although yeast expressed recombinant (r) IxsCRT binds to the C1 complex (C1q, C1r, and C1s), the activator of complement via the classical cascade, it did not inhibit deposition of the membrane attack complex (MAC) via the classical pathway. Intriguingly, rIxsCRT binds intermediate complement proteins (C3, C5, and C9) and reduces MAC deposition through the lectin pathway. Despite inhibition of MAC deposition in the lectin pathway, rIxsCRT did not protect a serum sensitive B. burgdorferi strain (B314/pBBE22Luc) from complement-induced killing. As B. burgdorferi establishes a local dermal infection before disseminating to secondary organs, it is noteworthy that rIxsCRT promotes the replication of B. burgdorferi in culture. We hypothesize that rIxsCRT may contribute to the transmission and/or host colonization of B. burgdorferi by acting as a decoy activator of complement and by fostering B. burgdorferi replication at the transmission site.

Plasmonic sensors have great potential for widespread usage, but the prohibitive cost of noble metals restrains the wider adoption of this technology. The aim of our study is to develop a cost-effective Al-based alternative to plasmonic detectors commonly based on noble metals. We considered a structure that consists of a Si p-n junction with an overlying grating-relief aluminum layer. The investigation of the infrared plasmonic resonance dependency on the structure geometric parameters and optimization of the fabrication process allowed us to determine optimal parameters for photodetection enhancement. The resonance photoresponse of optimized aluminum-based plasmon-polariton photodetector was significantly improved and became comparable to noble metal-based analogs. Our results can be used for the creation of cost-effective high-sensitivity plasmonic sensors.

Diet-related diseases impact populations across the globe. While intertemporal preferences—a fundamental preference for the distribution of benefits across time—have been used to explain low-quality food choices, recent literature proposes another cause: inattention to future implications (or opportunity costs) of the options faced. Food choices tend to become habitual to conserve cognitive resources, rather than carefully modeling future health impacts. Both low discount rates for future benefits and attention to future health impacts predict healthier decisions. While intertemporal preferences are stable, attention may provide an opportunity to intervene in the decision process to promote healthier decisions. In this study, we test the impact of a simple message that highlights health during food choice on the healthiness of foods chosen and on health consideration and intertemporal preferences. Our results show that actively considering health outcomes and lower discount rates lead to healthier food choices. We find that messaging increases the consideration of health outcomes during food choice but does not affect intertemporal preferences, suggesting that simple prompts may be an effective way to promote decisions balancing short and long-term benefits by drawing attention to overlooked opportunity costs of choices.

This research paper presents our investigation of the evolving trends in the field of Learning Sciences (LS) from 2005 to 2021. LS is a multidisciplinary field that integrates various scientific disciplines to study and support learning in real-world contexts (Hoadley, 2018). Our paper aims to understand how LS practices, methods, and disciplines of interest have changed over time, considering factors like the COVID-19 pandemic and the call for more equity-based research. We collected data from the International Society of Learning Sciences (ISLS) repository, which serves as one major platform that showcases LS research. We analysed the proceedings of the ISLS annual meetings and conferences, focusing on variables such as title, abstract, issue date, publisher, and collection using web scraping tools and the RStudio software for data collection and analysis. Our findings indicate several trends in LS research. In terms of methods and practices, design-based research (DBR) and participatory methods were commonly used in LS studies. However, there was a decline in the adoption of DBR in 2021, possibly due to the limitations imposed by the COVID-19 pandemic. Project-based learning, embodied interaction, and game-based learning were the most frequently used techniques among LS researchers. When examining the population of interest and domain focus in LS research. Learners were the primary focus, with a significant increase in the number of studies focusing on students over the years. However, there was also a noticeable increase in studies focusing on teachers in more recent years. In terms of subject disciplines, science and mathematics were the primary areas of focus, but there has been increasing attention to the arts and technology in recent years. Concerning equity-based research in LS, the finding revealed a significant increase in this area from 2005 to 2021, with ICLS studies tending to focus more on equity compared to CSCL studies. These findings contribute to understanding the current status and future development of the learning sciences.

In everyday life, the birth of a number of blind people takes place and millions of people are already available. Visually impaired people struggle to walk safely and in- dependently because they have trouble detecting obstacles. In this work, we suggest a novel approach to detecting obstacles utilizing an Arduino UNO board and an ul- trasonic sensor (HC-SR04). The main goal of this research is to increase the mobility and security of blind people in a variety of settings. The suggested system makes use of the HC-SR04 ultrasonic sensor’s capability to precisely measure distance and identify nearby obstructions. As the main processor component, the Arduino UNO board processes algorithms for real-time obstacle detection while also collecting data from the sensor. The device is intended to give the visually impaired user immedi- ate aural input while informing them of the location and proximity of obstacles. To Extensive testing is done in controlled and real-world settings to assess the system’s performance and dependability. In the studies, the effectiveness of obstacle detec- tion, the system’s response time, and its practicality and usefulness for blind people are all measured. The findings show that the suggested obstacle detection method provides very accurate obstacle identification at a safe distance. Users who are blind or visually handicapped may successfully understand their surroundings thanks to the aural feedback system, which helps them to navigate by making judgments that are well-informed. Additionally, the system responds quickly, guaranteeing that the user receives real-time obstacle updates to increase safety and confidence while mov- ing. The study’s conclusions demonstrate the possibility of using the Arduino UNO board with the HC-SR04 ultrasonic sensor as a practical and affordable approach for detecting obstacles.

New multilayer 3D nanocomposite wear-resistant ion-plasma hard and superhard coatings Avinit [(TiN-AlN)(Mo-Cr-V-Si)]_n have been developed.The introduction of additional alloying elements (Mo, Cr, V, Si) into the Ti-Al-N coating composition, which have a high affinity for nitrogen and are capable of forming strong nitride nanoparticles in the Ti-N and Al-N layers.This makes it possible to obtain hard and superhard hardening coatings.The metallographic and tribological studies carried out indicate the prospects of the developed multicomponent multilayer nano- and microstructured Avinit coatings for increasing wear resistance and reducing friction coefficients.This paper is devoted to the development and implementation of Avinit vacuum plasma technologies for strengthening cutting and forming tools to improve tool performance.Production tests of cutting tools with Avinit's developed multilayer wear-resistant ion-plasma coatings in production conditions at many large machine-building enterprises have shown their high efficiency.In serial production, the wear resistance of tools increases by 3 to 30 times, stamps by 5 to 100 times, and parts rubbing against abrasive materials by 10 to 100 times.Avinit's vacuum plasma technologies have been successfully implemented in production in the aggregate and engine building, transport engineering, and power engineering industries.Positive experience in applying multicomponent coatings has been gained not only when applying hardening coatings to manufactured cutting tools, but also after regrinding to regrindable carbide cutting tools from domestic and foreign manufacturers.

Adeno-associated viruses (AAVs) have been used for liver gene therapy. Hemgenix and Roctavian are AAV-based treatments for hemophilia B and A, respectively. They cost $3 million and $2.8 million per dose, respectively. While AAV vectors may eventually be cheaper to mass produce, a bacteria-based DNA delivery system might be much cheaper for patients. Also, “bactofection” would allow for the delivery of much larger DNA packages. Such a bacterial system may now be possible, and a prototype for the liver could possibly be developed immediately.

The dawn of Artificial Intelligence (AI) in healthcare stands as a milestone in medical innovation. A plethora of different medical fields are heavily involved and pediatric emergency medicine is no exception. These new tools do not merely provide more advanced and efficient systems for patients’ diagnosis, management and treatment. They rather concern a strict shift from traditional methods based upon broad categories towards a more personalized healthcare. AI offers many promises in pediatric emergency medicine with a wide range of applications involving clinical decision making, patients’ flows management and prioritization. Main barriers to a widespread diffusion involve technological challenges but also ethical issues and the paucity of extensive datasets in pediatric contexts. We conducted a narrative review structured in two parts. The first part explores the theoretical principles of AI, providing all the necessary background to feel confident with these new state-of-the-art tools. The second part presents an informative analysis of AI models in pediatric emergencies, pointing out the actual applications and challenges until future feasible research perspectives.

Judgment bias tasks assess optimism and pessimism through responses to ambiguous stimuli. Optimistic individuals anticipate receiving a reward whereas pessimistic individuals anticipate a lack of reward when interacting with ambiguous stimuli, which is reflected in approach time. Researchers have used these tests to assess animals’ reactions to assumed positive and negative contexts, but rarely to assess the effects of participation in ambassador programs. We tested two ambassador animals: a domestic chicken and a red tegu after exposure to zoo visitors. Once they learned that a container on the left contained food whereas a container on the right contained no food, we introduced an ambiguous container equidistant from the left and right locations. We assessed the chicken’s judgment biases when she was perched or held. We assessed the tegu’s judgment bias when visitors were allowed to touch him or not. The chicken displayed pessimism whether it was held or perched, but the tegu displayed pessimism only when no visitor touch occurred, suggesting that touch may not be aversive to the tegu, but that interacting with visitors may have deleterious effects on the chicken. We encourage the use of these tests to inform the use of animals in ambassador programs.

Public perception contrasts scientific findings on the depression-related effects of cannabis. However, earlier studies were performed when cannabis was predominantly illegal, its production was mostly uncontrolled, and the idea of medical cannabis was incipient only. We hypothesized that recent changes in attitudes and legislations may have favorably affected research. In addition, publication bias against cannabis may have also decreased. To investigate this hypothesis, we conducted a systematic review of research studies published over the last three years. We found 156 relevant studies. In most cross-sectional studies, depression was higher in those who consumed cannabis than in those who did not. An increase in cannabis consumption was typically followed by an increase in depression, whereas withdrawal from cannabis ameliorated depression in most cases. Albeit medical cannabis reduced depression in most studies, none of these were placebo controlled. In clinical studies published in the same period, placebo also ameliorated depression and in addition, the average effect size of placebo was larger than the average effect size of medical cannabis. We also investigated the plausibility of the antidepressant effects of cannabis by reviewing molecular and pharmacological studies. Taken together, the reviewed findings do not support the antidepressant effects of herbal cannabis.

Chronic traumatic encephalopathy (CTE) is a neurodegenerative condition caused by repeated traumatic brain injuries (TBIs) leading to cognitive, behavioral, and motor dysfunctions. This study examined the relationship between cognitive impairment and clinical syndromes among 145 CTE patients aged 18 to 75 years who underwent inpatient treatment at the Ternopil Regional Clinical Psychoneurological Hospital between 2021 and 2022. Cognitive function was assessed using the Montreal Cognitive Assessment (MoCA), with results classified into four categories: normal, mild impairment, moderate impairment, and dementia. Statistical analysis revealed significant associations between cognitive impairment and specific neuroimaging changes, including ventricular dilatation. Clinical syndromes, such as cognitive disorder syndrome, also showed significant associations with cognitive impairment (p &lt; 0.001). Using logistic regression, we developed a predictive model to estimate the probability of cognitive impairment based on various clinical features, including memory loss, attention deficits, and sleep disturbances. The model demonstrated high accuracy, with a receiver operating characteristic (ROC) curve showing a sensitivity of 91.0% and a specificity of 92.5%, yielding an area under the curve (AUC) of 0.964 (95% CI: 0.934 - 0.994). These findings suggest that specific neuroimaging and clinical features can predict cognitive impairment in CTE patients.

The most important prognostic factors in curatively treated prostate cancer at the initial diagnosis are T and N stage, histological subtype, Gleason score, initial PSA, PSA density and percentage of core biopsy positivity. Newer, but non-standard prognostic factors are urine PCA3 and genetic markers of prostate cancer. A simple, but seemingly underestimated standard test is serum Calcium (Ca) level, which has been shown by a previous study group to be a good predictor of lethal prostate cancer, but there is scarce evidence regarding the prognostic value of calcium levels at diagnosis. We aimed to determine whether a Ca level in the upper part of normal values has a prognostic value in curatively treated prostate cancer. We have retrospectively included 84 consecutive patients with prostate cancer, who underwent curative radiotherapy (primary or adjuvant; external beam RT with or without brachytherapy). We have performed statistical analysis of available prognostic factors. Ca level at diagnosis was found to be a statistically significant predictor of disease-free survival.

Background and objective: Chronic subdural hematoma (cSDH) is one of the most common neurosurgical entities affecting mostly elderly patients. In this study, we aimed to provide detailed characteristics of surgically treated patients with cSDH and evaluate outcomes between the two conventional treatment methods. Materials and methods: Patients with cSDH surgically treated with burr hole craniostomy (BHC) and craniotomy (CO) in tertiary centers in Croatia and Serbia during 2017-2019 were included in the study. Characteristics and outcomes of these patients were prospectively collected. Results: In total, 155 patients (mean age 72.3±13.4) were included in the study. BHC group consisted of 124 (80 %) and CO group of 31 (20 %) patients. 32 (20.6 %) patients presented with bilateral cSDH, head trauma was documented in 92 (59.4 %), and anticoagulant therapy in 37 (23.9 %) individuals. The most common symptom was hemiparesis (n=85, 54.8 %). The two groups did not differ by age. CO group had higher Glasgow Coma Scale (GCS) score at the admission, with a significant decrease at discharge compared to admission (12.6±4.8 vs 14.4±1.7, p

Transition to renewable energy has been recognized as a crucial step to addressing climate change and achieving greenhouse gas reduction targets, but it can also cause energy sprawl if not planned properly. Clean renewable energy communities (CREC) are emerging globally as an approach for decentralized energy systems and an alternative to traditional centralized energy systems. CREC aims to lower the energy carbon footprint, enhance local energy resilience, and improve the quality of life of residents. Through a comprehensive literature review, this study reviews metrics that can assess the impact of energy transition plans and support decision-making to select technologies that create efficient, reliable, and accessible energy systems. It classifies these metrics into a five-dimensional sustainability approach: environmental, technical, social, economic, political and institutional. The paper proposes a conceptual framework to guide decision-makers in recognizing the role of sustainable land development, sustainable energy planning, and resiliency as an integrated approach to energy transition planning. This framework stresses mapping the place-based potential for clean renewable energy at various scales, highlights the importance of resilience in energy planning, and addresses challenges associated with energy source selection, built environment efficiency, and energy trade. While the framework can serve as a starting point for evaluating energy transition plans, further work is needed to address the limitations of existing metrics and identify additional evaluations for energy mixed land use that are critical to managing energy sprawl on ecosystem services and other land uses.