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.

Gilbert's syndrome (GS) is a common hereditary condition characterized by mild increases in serum bilirubin levels due to inherited defects in bilirubin metabolism. This review, based on data from peer-reviewed articles and journals spanning from 1977 to January 2024, provides a comprehensive overview of over four decades of research on GS. Early studies primarily focused on defining the clinical and genetic characteristics of the syndrome, laying the foundation for subsequent investigations. More recent research has delved into the genetic mechanisms underlying the reduced expression of bilirubin UDP-glucuronosyltransferase, which has significantly enhanced our understanding of the pathogenesis of GS. Furthermore, recent studies have shed light on the clinical implications of GS, including its association with non-alcoholic fatty liver disease and mortality risk, highlighting the complex interplay between genetic factors, bilirubin metabolism, and clinical outcomes. Despite its generally benign nature, thorough research is essential to fully understand the impact of GS on patients' lives. This review emphasizes the importance of ongoing research to deepen our understanding of GS and its broader implications.

Introduction: Gastric cancer (GC) is one of the most common cancers in the world. It is a very aggressive and heterogeneous tumor. GC does not cause symptoms, so it is often diagnosed in an advanced stage and associated with poor prognosis. Despite new treatment options, it still remains a therapeutic problem. An important element determining the method of treatment of locally advanced gastric cancer (LAGC) is the assessment of lymph node metastases in preoperative and postoperative imaging and/or histopathological examination.Aim: The assessment of lymphovascular invasion (LVI) in histopathological examination in patients with LAGC after gastrectomy. The groups of patients were divided into patients who received preoperative chemotherapy, patients without preoperative chemotherapy, and all patients. Additionally, we assessed the correlation between the presence of LVI and the number of lymph nodes collected during gastrectomy.Material and method: We collected patients with histologically confirmed GC after gastrectomy. The collected samples were divided into three subgroups: patients with neoadjuvant chemotherapy (NAC), patients without NAC, and all patients. Histopathological examination assessed the presence of LVI infiltration. We then assessed the correlation between the presence of LVI and the presence of lymph node metastasis in GC. Additionally, we assessed the correlation between LVI and the number of lymph nodes evaluated in patients in each group. The statistical analyses were performed using Statistica v13.3 and Microsoft Excel 2021. The significance limit was set at p<0.05.Results:The presence of LVI strongly correlated with node involvement, and the result was statistically significant in all patients and the group of patients treated with NAC. The difference was not statistically significant in the group not treated by NAC. Additionally, we did not observe a correlation between the presence of LVI and the number of metastatic lymph nodes in GC.Summary and Conclusions: The presence of LVI in a patient with GC indicates a high probability of lymph node metastasis, which should translate into therapeutic procedures. Assessment of LVI may help identify potential patients with lymph node metastases, particularly in patients undergoing endoscopic resection without planned lymphadenectomy. It is advisable to expand research on a larger scale in order to establish clear standards in this area.

In the ever-evolving landscape of information and communication technology, the advent of new media platforms has sparked a profound technological shift, reshaping the dynamics of privacy protection and data governance. This article delves into the intricacies of safeguarding privacy and data on these platforms, shedding light on their transformative impact. Specifically, it explores the pervasive issue of fake news dissemination in digital spaces and examines the regulatory frameworks within India, elucidating their role in fostering a secure online environment. Drawing upon Indian laws and governmental mechanisms, the author underscores the imperative of effective internet regulation to safeguard citizen privacy and mitigate the risks associated with unchecked information flow. By analyzing the regulatory landscape, this article elucidates the pivotal role of legislative measures in addressing contemporary challenges and fortifying data protection in the 21st century. Through a comprehensive examination of pertinent legal frameworks and regulatory strategies, this article provides valuable insights into the multifaceted dimensions of privacy protection and data governance in the digital era. It underscores the importance of a proactive approach to internet regulation, emphasizing the critical need for robust mechanisms to uphold individual privacy rights while fostering responsible information dissemination.

Energy management, especially in communities, is attracting growing interest, but is often marred by confusion between the terms "Energy Information System" (EIS) and "Energy Man-agement System" (EMS). This ambiguity hinders understanding of their use and role in improv-ing energy performance. Our objective is to clarify these terms and their contribution to energy management. We used a mixed qualitative and quantitative approach to evaluate and compare the criteria of definition, objective, functionality, role, as well as correlated elements such as or-ganizational structure, responsibilities, planning and policy, according to the requirements of ISO 50001, in addition to criteria specific to the two systems. The study reveals differences in the roles of the EIS and the SME, with a complementarity of 40% between the two systems, depend-ing on the positioning of the EIS in relation to the elements of the SME process. The EIS plays a crucial role in facilitating the implementation of the EMS according to ISO 50001. This clarifica-tion contributes to a better understanding of the respective roles of these systems in energy management, thus helping communities to improve their energy performance in an effective manner.

The aim of this cross-sectional study was to assess the influence of the maturity status on speed, explosive power and change of direction (COD) in 13-year-old football players. Ninety-eight male players (age: 13.1 ± 1.0 y) were divided into late, average, and early maturation groups. Physical fitness testing included the following variables: 10 and 30-meter sprint time and maximum speed in the 20-30 m segment of the 30-meter sprint test, the T-test time, countermovement jump height and horizontal distance in the triple jump. The data showed a significant effect of maturity status on performance in three parameters: in maximum speed in the 20-30 m section (p = 0,024), however, the only significant differences were found between the early-maturation group and average-maturation group (p = 0.033); in the COD (p = 0.024), where significant differences were confirmed between the late-maturation group and the average-maturation group (p = 0.033); in the unilateral triple jump distance of the dominant and non-dominant (p = 0,007 and p = 0.001, respectively) lower limb. For both limbs, significant differences between the late-maturation group and average maturation group (p = 0.005 and p = 0.013, respectively) as well as the late-maturation group and early-maturation group (p = 0.007 and p = 0.045, respectively) were proved. These results indicate that maximal speed, COD speed and unilateral lower limb reactive strength are moderated by biological age in football players aged 13 years.

Along with the increasing industrialization of contries and population growth, the global. With the thougth of overcoming climate change and renducing greenhouse gas emissions in the atmosphere, interest in alternative sloar, wind, water, geothermal, tidal and ocean wave energy has significantly increased. Hydropower is one of the most used inexhaustible sources of energy on a global scale. The efficiency of water turbines can be increased by optimizing the blade cascade and the casing. For this purpose, research is conducted on specialized laboratory benches. The purpose is to determine the influencing parameters which affecting the nature of the power and cavitaion curves This paper presents the results of numerical and laboratoty studies of axial hydrokinetic turbines. A detailed analysis of the influence of the geometric parameters of the blades on the operating curves is made. A mathematica model for synthesis of the blade cascade is derived. An assessment of water energy soures has been made and sites of high energy potential have been pointed. The present material can be used for development of a methodology for calculation of efficient axial hydrokinetic turbines.

Recovery between physical efforts is essential for optimal performance in sports. Dietary supplements like cannabidiol (CBD) have been proposed to facilitate recovery and performance optimization. This systematic review aimed to: a) systematize the scientific evidence on CBD for recovery, b) associate CBD's biomedical properties with those required for optimal fatigue recovery, and c) recommend a future research agenda. Searches across databases identified 70 relevant studies from 1990-2022, including 38.6% preclinical, 31.4% clinical trials, and 30.0% reviews/meta-analyses across various populations like mice, rats, epileptics, and athletes. CBD demonstrated potentially beneficial properties for athlete recovery such as anti-inflammatory, neuroprotective, anxiolytic, and analgesic effects with doses ranging from 5-600mg administered orally, intravenously, and via other routes. However, rigorous confirmatory research specifically in athlete populations is lacking. While CBD appears promising for facilitating recovery and performance optimization, further randomized placebo-controlled trials are needed to test the acute and chronic effects of different CBD dosing regimens in athletes. Future research should focus on elucidating CBD's physiological mechanisms of action as they relate to post-exercise recovery, as well as its comparative effectiveness versus conventional medications and therapies. Advancing our understanding of CBD's role in athlete recovery could provide new therapeutic strategies to optimize recovery and performance.

For many disciplines of science, all conceivable collisional cross sections and reactions must be precisely known. Although the recent decades were a trial of large-scale research to give these data, many essential atomic and molecular cross section data still missing, and the reliability of the existing cross sections has to be validated. In this paper, we present electron stripping, electron capture, and system breakdown cross sections in carbon (C5+) ions and lithium (Li2+) ions collisions with atomic hydrogen based on the Monte Carlo models of classical and quasi-classical trajectories. According to our expectation, the QCTMC results show higher results in comparison to standard CTMC data, emphasizing the role of Heisenberg correction constraint, especially in the low energy regime. On the Other hand, at high energy, the Heisenberg correction term has less influence as a projectile momentum increase. We present the total cross sections of electron stripping, electron capture, and system breakdown in C5+ ions and Li2+ ions collisions with atomic hydrogen in the impact energy range from 10 keV to 160 keV, which is of interest in astrophysical plasmas, atmospheric sciences, plasma laboratories, and fusion research.

The efficacy of an intranasal (IN) bovine respiratory syncytial virus (BRSV) administered in the face of passive immunity was assessed. Pooled colostrum was administered by intubation to fifty (50) beef-dairy crossbred calves the day they were born. The calves were transported to a research facility and were blocked by age and sex and randomly assigned into two groups, a sham-vaccinated intranasally with a placebo (sterile water) or vaccinated with a tri-valent modified live viral (MLV) vaccine. The calves were 92 days old when vaccinated (day 0). The calves were challenged by aerosolized BRSV on day 80 and day 81 as a respiratory challenge. The study was terminated on day 88. Lung lesion scores (LLS) were significantly lower for calves vaccinated with tri-valent MLV vaccine than those for calves that were sham-vaccinated. Serum neutralization (SN) antibody against BRSV in calves vaccinated with the tri-valent MLV vaccine demonstrated an anamnestic response on day 88. After challenge, the calves sham-vaccinated with the placebo lost weight while those vaccinated with the tri-valent MLV vaccine gained weight. In this study colostrum-derived antibodies did not interfere with the immune response or protection provided by one dose of the tri-valent MLV vaccine.

This is a single center retrospective study to assess safety and tolerability of continuous inhaled iloprost use as rescue therapy for refractory pulmonary hypertension (PH) in critically ill neonates and infants. Retrospective chart review was performed on 58 infants and data was collected at baseline, 1, 6, 12, 24, 48, and 72 hours of iloprost initiation. Primary outcomes were change in heart rate (HR), fraction of inspired oxygen (FiO2), mean airway pressures (MAP), blood pressure (BP) and oxygenation index (OI). Secondary outcomes were need for extracorporeal membrane oxygenation (ECMO) and death. 51 patients treated for > 6 hours were analyzed in 2 age groups, neonate (≤28 days: n=32) and infant (29-365 days: n=19). FiO2 (p

We present an analytic calculation of the cooperative decay of a one-dimensional chain of N two-level atoms in the single-excitation configuration. Whereas the subradiant decay is zero for infinite lattices, we prove that for finite lattice the subradiant decay rate decreases as 1/N. We compare the results obtained using the scalar and the vectorial model. The calculations provide simple analytic expressions for the decay rate of the excitation, for arbitrary lattice spacing.

Chestnut is an interesting productive alternative for farmers in Southern Chile. However, cli-matic variability with the occurrence of late spring and early summer frost have cause damages on young trees. Glycine‒betaine (GB) spraying on shoots of sensitive chestnut induce an increase in tolerance during subsequent chilling stress. Experiment was performed on three years-old trees (cultivar Cittá di Castello) conducted in a leader training system and sprayed with com-mercial GB (120 g hL‒1). In summer trees treated with GB showed a better recovery after the frost (‒2.34°C) occurrence for 3.5 h compared to the control. Whereas trees obtained a 28% greater growth of central axis than untreated control (January). The trunk diameter measured in January showed the highest value under GB (27.2mm) compared with the control (25.7 mm). The GB ap-plication increased by 50 and 47% highest fresh and dry weight respectively in leaves. Under GB trees reached a 28% higher net photosynthesis (AN) compared to the AN in control (11.93 µmol CO2 m‒2 s‒1). Moreover, achieved higher stomatal conductance and transpiration rate was 44 and 31% with GB compared to control trees respectively. Antioxidant performance was differentially affected by GB activating non-enzymatic mechanisms and caused a reduced lipid peroxidation. Glycine‒Betaine has become as an interesting agronomic tool that aimed to increase tolerance to environmental stresses such as low temperatures that cause damage to herbaceous shoots and leaves in young chestnut trees.

Traumatic brain injury (TBI) is an important global clinical issue, requiring not only prevention but also effective treatment. Following TBI, diverse parallel and intertwined pathological mechanisms affecting biochemical, neurochemical, and inflammatory pathways can have severe impact on the patient’s quality of life. The current review summarizes evidence for utility of amantadine in TBI in connection to its mechanism of action. Amantadine combining multiple mechanisms of action may offer both neuroprotective and neuroactivating effects in TBI patients. Indeed, use of amantadine in TBI has been encouraged by several clinical practice guidelines/recommendations. Amantadine is also available as infusion which may be of particular benefit in unconscious patients with TBI, due to immediate delivery to the central nervous system and the possibility of precise dosing. In other situations, orally administered amantadine may be used. There are several questions that remain to be addressed: Can amantadine be effective in disorders of consciousness requiring long-term treatment and in combination with drugs approved for treatment of TBI? Do the observed beneficial effects of amantadine extend to disorders of consciousness due to factors other than TBI? Well controlled clinical studies are warranted to ultimately confirm its utility in the TBI and provide answers these questions.

Few prior works study self-driving cars by deep learning with IoT collaboration. SDC-Net, which is an end-to-end multitask self-driving car camera cocoon IoT-based system, is one of the research that tackles this direction. However, by design SDC-Net is not able to identify the accident locations, it only classifies if it is a crash scene or not. In this work, we introduce an enhanced design for the SDC-Net system by 1) replacing the classification network with a detection one, 2) adapting our benchmark dataset labels built on the CARLA simulator to include the vehicles bounding boxes while keeping the same training, validation, and testing samples, 3) modifying the shared information via IoT to include the accident location. We keep the same path planning and automatic emergency braking network, the digital automation platform, and the input representations to formulate the comparative study. SDC-Net++ system is proposed to 1) output the relevant control actions, especially in case of accidents: accelerate, decelerate, maneuver, and brake, and 2) share the most critical information to the connected vehicles via IoT, especially the accident locations. A comparative study is also conducted between SDC-Net and SDC-Net++ with the same input representations: front camera only, panorama and bird-eye views, and with single-task networks: crash avoidance only, and multitask networks. Multitask network with a BEV input representation outperforms the nearest representation in precision, recall, f1-score, and accuracy by more than 15.134%, 12.046%, 13.593%, and 5%, respectively. SDC-Net++ multitask network with BEV outperforms SDC-Net multitask with BEV in precision, recall, f1-score, accuracy, and average MSE by more than 2.201%, 2.8%, 2.505%, 2%, and 18.677% respectively.

This study reveals the essential load-bearing characteristics of the steel-concrete composite floor system under fire conditions applying structural stressing state theory. Firstly, the strain data in the entire process of the fire test are modeled as state variables which can present the slab’s stressing state evolution characteristics; Then, the state variables are used to build the stressing state mode and the parameter characterizing the mode. Further, the Mann-Kendall criterion is adopted to detect the leap points in the evolution curves of the characteristic parameters during the entire fire exposure process. Also, the evolution curves of the stressing state modes are investigated to verify the leap profiles around the leap/characteristic points; Finally, the detected leap points are defined as the failure starting points and elastoplastic branching points, which is unseen in the past researches focusing on the failure endpoint defined at the ultimate load-bearing state of the composite floor system. The failure starting point and the elastoplastic branching point are the embodiment of natural law from quantitative change to quality change of a system rather than an empirical and statistical judgment. Hence, both characteristic points avoidably exist in the strain data of the composite floor system undergoing the fire process, which can be revealed through the proper modeling methods and update the existing theories and methods on structural analysis and design in fire.

Recent developments in high-performance electrode materials have been pivotal for real-time monitoring biosensors, necessitating compatibility with biomaterials and robust electrochemi-cal properties. This study explores the development of electrode materials using single-walled carbon nanotubes (SWCNTs) and multi-walled carbon nanotubes (MWCNTs), with a primary fo-cus on assessing their dispersion and electrochemical properties. Various solvents, including N N-Dimethylformamide (DMF), deionized water, ethanol, and acetone, were used for dispersion analysis by employing ultrasonic waves. The results showed that SWCNTs exhibited well-dispersed characteristics without precipitation when introduced to a DMF solution. It found that resistance values decreased as the concentration of SWCNTs increased over the range of 0.025 to 0.4 g/L, with a considerable electrical conductivity reached at concentrations ranging from 0.2 g/L to 0.4 g/L in DMF. The biosensor platform was evaluated with 1-pyrenebutanoic acid succin-imidyl este (PBSE) as the linker and glucose oxidase (Gox) and chitosan as the binding substrate. The binding of Gox with glucose resulted in a significant decrease in resistance value of the biosensor with rising their concentrations ranged from 0.001 to 0.1 M. Though this research provides founda-tional insights for the advancement of SWCNT-based high-performance electrode materials, it will pave the way for the next generation of efficient and reliable biosensors.

Uropathogenic E. coli (UPEC) is the main etiologic agent of urinary tract infections (UTI) and possesses virulence and resistance determinants commonly harbored in mobilizable genetic elements such as plasmids or pathogenicity islands (PAI). UPEC belongs to the group of Ex-traintestinal pathogenic E. coli, however the existence of hybrid strains has been described; these possess both diarrheagenic (DEC) and extraintestinal (ExPEC) E. coli traits and are considered as "hypervirulent strains," which represents a significant health problem. This study aimed to de-termine the prevalence of UPEC PAI, ExPEC sequence types (ST), DEC genes, carbapenemase and extended-spectrum β-lactamase (ESBL) phenotypes, fluoroquinolones/aminoglycosides resistance genotypes and the presence of plasmids in 40 clinical isolates previously characterized as UPEC. A 72.5% of the isolates presented PAI, mainly PAI IV536 (53%). Sixty-five percent of the β-lactam-resistant isolates were positive for ESBL phenotype, and 100% of the car-bapenem-resistant isolates were carbapenemase producers. The most prevalent ESBL-associated gene was blaCTX-M-2 (60%), while among isolates resistant to fluoroquinolones and aminoglycosides the most frequent resistance gene was aac(6')Ib (93%). Plasmid bands were present in 57% of the isolates. Seventy percent belonged to the ST131 clonal group. The presence of molecular markers associated with DEC pathotypes was detected in 20 isolates; 60% were classified as hybrid pathotypes. These data suggest, in addition to an important pathogenic potential, the existence of hybrid pathotypes in clinical isolates of E. coli causing UTI in the Mexican population.

In directional forming processes such as rolling and extrusion, the microstructure is strongly elongated in the forming direction. This results in a preferred alignment of the crystal orientations of the initially randomly oriented grains. These preferred orientations – the texture – and elongations of the grains are the cause of the material anisotropy. This anisotropy leads to phenomena such as earing, which occur during further forming processes, e.g., during deep drawing of sheet metal. Considering anisotropic properties in numerical simulations allows to investigate the effects of texture-dependent defects in forming processes and the development of possible solutions. Purely phenomenological models for modelling anisotropy work by fitting material parameters or applying measured R-values in experiments which are applied to all elements of the part and remain constant over the duration of the simulation. In contrast, methods such as the Visco-Plastic Self-Consistent (VPSC) model, which has been used in this work, provide a deeper insight into the development of the material microstructure. By experimentally measuring the initial texture and using it as an initial condition for the simulations, it is possible to predict the evolution of the microstructure and the resulting effect on the mechanical properties during forming operations. The results of the simulations with VPSC show good qualitative agreement with tests typically used for rolled stock.

The symbiotic interaction between leguminous and Bradyrhizobium sp. SUTN9-2 mainly relies on the nodulation process through Nod factors (NFs), while the type IV secretion system (T4SS) acts as an alternative pathway in this symbiosis. Two copies of T4SS (T4SS1 and T4SS2) are located on the chromosome of SUTN9-2. ΔT4SS1 reduces both nodule number and nitrogenase activity in all SUTN9-2 nodulating legumes. The functions of three selected genes (copG1, traG1, and virD21) within the region of the T4SS1 were examined. We generated deleted mutants and tested in Vigna radiata cv. SUT4. ΔtraG1 and ΔvirD21 exhibited lower invasion efficiency at the early stages of root infection but could be lately restored. In contrast, ΔcopG1 completely hindered nodule organogenesis and nitrogenase activity in all tested legumes. ΔcopG1 showed low expression of nodulation gene and ttsI, but exhibited high expression levels of T4SS genes, traG1 and trbE1. The secreted proteins from ΔT4SS1 were down-regulated compared to the wild type. Although ΔcopG1 secreted several proteins after flavonoid induction, T3SS (nopP and nopX) and C4-dicarboxylate transporter (dct) were not detected. These results confirm the crucial role of the copG1 gene as a novel key regulator in the symbiotic relationship between SUTN9-2 and legumes.

China’s leading development of a complete battery value chain for Electric Vehicles (EV) is restructuring the global automotive sector. The competitive advantage of China's EV battery industry lies on its firms’ core competency and political economic geography. Based on first-hand empirical material and data obtained from years of fieldwork in an EV battery cluster in South China, this paper identifies what the Chinese EV battery industry’s core competency is and details how it is built up from below. The current core competency of Chinese battery firms is their mass manufacturing capability to supply lithium-ion batteries vehicle manufacturers (OEMs) with stable and consistent quality as well as competitive prices. This competency is acquired by firms through technological learning at workshop level while taking use of their experiences accumulated in mass production of batteries for consumer electronics sectors. Furthermore, the rapid learning and accumulation of knowledge on battery manufacturing at large scale is also facilitated by the industrial cluster environment where firms are embedded. Supported and promoted by local government policies, Chinese EV battery clusters are composed of firms from different segments of a complete battery value chain. The findings illuminate the likely strategic strengths, weaknesses, and futures of the Chinese EV battery industry in global competition.

Fusarium stalk rot (FSR) caused by the Fusarium species complex is an economic threat to maize cultivation all over the world. We investigated the population structure and genetic diversity of Fusarium spp. obtained from five major maize-growing regions of India. The Tef-1α locus was used for phylogenetic analysis of geographically distinct isolates of Fusarium verticillioides, F. andiyazi, F. proliferatum, F. nygamai, and F. acutatum causing FSR. Geographical separation among four local populations contributed to 7.87% variance, whereas 92.12% of the variance was within popula-tions, suggesting a predominant influence of local adaptation or stochastic events like genetic drift within populations, with geographical separation playing a lesser but significant role in shaping genetic diversity. Genetic differentiation statistics between Fusarium species showed lower gene flow from haplotypes except in the population of F. acutatum and F. andiyazi having high GST values. In contrast, a high Kxy was reported, indicating elevated genetic differentiation between populations. The haplotype network analysis revealed the presence of eight distinct haplotypes which reflected pathogenic evolution and adaptive potential of Fusarium spp. The results offer a comprehensive framework for discussing the implications of genetic diversity in pathogen management and the evolutionary dynamics of the Fusarium spp. causing FSR of maize in the Indian subcontinent.

Mutations affecting codon 172 of the isocitrate dehydrogenase 2 (IDH2) gene define a subgroup of sinonasal undifferentiated carcinomas (SNUCs) with a relatively favorable prognosis and a globally hypermethylated phenotype. They are also recurrent (along with IDH1 mutations) in gliomas, acute myeloid leukemia, and intrahepatic cholangiocarcinoma. Commonly reported mutations, all associated with aberrant IDH2 enzymatic activity, include R172S, R172T, R172G, and R172M. We present a case of SNUC with a never-before-described IDH2 mutation, R172A. Our report compares the methylation pattern of our sample to other cases from the GEO database. Hierarchical clustering suggests a strong association between our sample and other IDH-mutant SNUCs and a clear distinction between sino-nasal normal tissues and tumors. Principal component analysis (PCA), using 100 principal components explaining 94.5% of the variance, shows the position of our sample within 1.02 standard deviation of the other IDH-mutant SNUCs. Molecular modeling analysis of the IDH2 R172A versus other R172 variants provides a structural explanation to how they affect the protein active site. Our findings thus suggest that the R172A mutation in IDH2 confers a gain of function similar to other R172 mutations in IDH2, resulting in a similar hypermethylated profile.

This work focuses on short-term forecasting of PV output power. The multilayer perception (MLP), convolutional neural networks (CNN), and k-nearest neighbour (kNN) neural networks have been used singly or in a hybrid (with other algorithms) to forecast solar PV power or global solar irradiance with good success. Their performances in forecasting PV power have been compared with other algorithms but not with themselves. The study aims to compare performance of a number of neural network algorithms in solar PV energy yield forecasting under different weather conditions. The performance of MLPNN, CNN and kNN are being compared using solar PV (hourly) energy yield data for Grahamstown, Eastern Cape, South Africa. The choice of location is part of the study parameters to provide insight into renewable energy power integration in specific areas in south Africa that may be prone to extreme weather conditions. The kNN algorithm was found to have RMSE value of 4.95% and MAE value of 2.74% at its worst performance, and RMSE value of 1.49% and MAE value of 0.85% at its best performance. It outperformed the others by a good margin and kNN could serve as a fast, easy, and accurate tool to forecast solar PV output power.

Microfiltration membranes derived from semi-crystalline polymers face various challenges when synthesized through the extrusion–casting technique, including the use of large quantities of polymer, long casting times, and the generation of substantial waste. This study focuses on synthesizing these membranes using spin-casting followed by stretch-induced pore formation. Recycled high-density polyethylene (HDPE) and virgin polyethylene powder, combined with a calcium carbonate filler, were used as the source materials for the membranes. The influence of the polymer-filler ratio with and without stretching on the morphology, tensile strength, and water flow rate was investigated. Optimal conditions were determined, emphasizing a balance between pore structure and mechanical integrity. The permeable membrane possessed a mean pore diameter of 500 nm, exhibited a tensile strength measuring 32 MPa, allowed water to flow at a rate of 19 ml/min, and had a water contact angle of 126°. These membranes effectively eliminated suspended particles from water, with their performance evaluated against that of commercially available membranes. This research outlines a synthesis route for microfiltration membranes tailored to semi-crystalline polymers and their plastic forms, utilizing the spin-casting technique.

Hyperspectral imaging, a rapidly evolving technique, furnishes exhaustive information on Earth's surface reflectance over an extensive spectrum of wavelengths. We have developed a more precise method for analyzing spectral data by meticulously selecting plant leaf pixels and employing a relative reference approach. This enhanced technique correlates camera pixel values with light intensity, bypassing the need for complex equations and thereby providing clearer insights into vegetation vitality. The findings of this study not only enhance the precision of hyperspectral imaging but also bolster our capability for ecological monitoring and understanding environmental health. A novel algorithm based on the red-edge slope was established to classify images, exploiting the spectral reflectance data gleaned from the hyperspectral Liquid Crystal Tunable Filter (LCTF) camera. Compared with conventional SVM and K-means algorithms, our novel algorithm demonstrated commendable performance, achieving an overall accuracy of 90% with a Kappa Coefficient of 0.86. This comparison highlights the novel algorithm's relative strength and potential for large-scale satellite and drone imagery analysis applications. The advancements facilitated by this research are instrumental in ecological assessments, conservation efforts, and resource management strategies, signaling a leap forward in the era of environmental monitoring and analysis.

People experiencing homelessness are at risk from a number of co-morbidities including traumatic brain injury, mental health disorders and various infections. Little is known about the rehabilitation needs of this population. This study took advantage of unique access to a specialist ‘Access’ GP practice for people experiencing homelessness and a local inclusion health initiative to explore the five year period prevalence of these conditions in a population of people experiencing homelessness, through electronic case record searches; and identify barriers and facilitators to healthcare provision for this population in the context of an interdisciplinary and multi specialist inclusion health team, through semi structured interviews with 12 staff working in primary and secondary care who interact with this population. The five year period prevalence of TBI, infections and mental health disorders was 9.5%, 4% and 22.8% respectively. Of those who had suffered a brain injury only 3, had accessed rehabilitation services. Themes from thematic analysis of interviews included: lack of resource, stigmatisation, under recognised multi-morbidity (including from brain injury) as barriers, trauma-informed, person-centred, adaptable, &amp; integrated and collaborative models of care as facilitators. The combination of quantitative and qualitative data suggests a potential role for rehabilitation medicine in inclusion health initiatives.

Purpose: The purpose of this study is to apply the Composite Radiographic Index modified (CRIm) in CBCT scans of patients with Medication related osteonecrosis of the jaws (MRONJ) in order to detect its validity, and corelate the radiologic findings with the clinical staging of the disease. Methods: This study included 43 patients with MRONJ diagnosis and CBCT scans performed in the School of Dentistry and approved by the Research Ethics Committee. Clinical staging for every patient (0-3) was provided according to AAOMS 2022 guidelines. In cases of patients with both jaws affected, each jaw was evaluated independently resulting to 52 CBCT scans. The 52 CBCT scans were assessed under standardized viewing conditions by 2 observers who evaluated independently the following 8 radiologic features: lytic changes, sclerosis, periosteal reaction, sequestration, non-healing extraction sockets and other findings (sinus implication, inferior alveolar canal involvement, jaw fracture). The CRIm index was constructed to assess the extent of osseous changes. The radiologic features were scored as absent (0), localized/single (1), extensive/multiple (2), yielding a theoretical range of 0–12. For statistical analysis Fisher’s exact test and Spearman’s correlation coefficient were performed. Results: A statistically significant association of clinical stage with lytic changes, sequestration and inferior alveolar canal involvement was found. Also, a statistically significant correlation of clinical stage with CRIm index classification was obtained. Conclusions: The CRIm index tends to increase as the clinical stages of MRONJ advance, suggesting a correlation between the clinical stage of MRONJ and the CRIm index.

High dimensional datasets are highly likely to have redundant, irrelevant, and noisy features that negatively affect the performance of the classification algorithms. Selecting the most relevant features and reducing the dimensions of datasets by removing the undesired features is a dimensional reduction technique called Feature Selection (FS). In this paper, we propose an FS approach based on the Black Hole Algorithms (BHO) with a mutation technique called MBHO. Generally, BHO contains two major phases. At the exploitation phase, a set of stars are modified based on some rule and according to some objective function, the best star is selected as the black hole which attracts other stars. Furthermore, when a star gets closer to the event horizon, it will be swallowed and a new one will be randomly generated in the search space which thus is the exploration phase. However, randomness may cause the algorithm to fall into the trap of local optima, and to overcome such complications, inversion mutation is used. Furthermore, we modify a widely utilized objective function in most of the proposed works for wrapper feature selection by combining two new terms that are based on the correlation among the selected subset of features and the features and the classification label. We also utilize a transfer function, known as the V2 transfer function, to convert continuous values into discrete ones to enhance search. We assess our approach via extensive evaluation experiments using fourteen benchmark datasets. We benchmark the performance of a wrapper FS approach called Binary Cuckoo Search (BCS), and three filter-based FS approaches (namely Mutual Information Maximisation (MIM), Joint Mutual Information (JMI), and minimum Redundancy Maximum Relevance (mRMR)). Our evaluation has shown that the proposed model is an effective approach for FS, in selecting better features that enhance the performance metrics on the classifiers. Thus, MBHO can be utilized as one alternative to the existing state-of-art-approaches. We release the source codes of our implementation for the community to build on with new methods and datasets.

In recent years, there has been an intensification of weather variability worldwide as a result of climate change. Some regions have been affected by drought, while others have experienced more intense rainfall. The incidence and severity of mouldy grain and mycotoxin contamination during the growing and harvesting seasons have increased as a result of these weather conditions. Addi-tionally, torrential rains and wet conditions may cause delays in grain drying, leading to mold growth in the field. In July 2023, a wheat field in Lecco (Lombardy, Italy) was affected by torren-tial rains that led to the development of the Claviceps fungi. In the field, dark sclerotia were identi-fied on some ears. Wheat ears, kernels and sclerotia were collected and analyzed by LC-MS/MS at IZSLER, Food Chemical Department, in Bologna. The wheat ears, kernels and sclerotia were ana-lyzed for 12 ergot alkaloids (EAs) according to (EU) Regulation 2023/915 (er-gocornine/ergocorninine; ergocristine/ergocristinine; ergocryptine/ergocryptinine; ergome-trine/ergometrinine; ergosine/ergosinine; ergotamine/ergotaminine), after QuEChERS (Z-Sep/C18) purification. The analyzed sclerotia showed significant differences in total alkaloids content that varies between 0.01-0.5% (w/w), according to the results of 2017 EFSA scientific report. EAs de-tected in sclerotia were up to 4951 mg/kg, in wheat ears up to 33 mg/kg, and in kernels were 1 mg/kg. Additional mycotoxins including ochratoxin A, deoxynivalenol, zearalenone, fumonisins, T2-HT2 toxins, and aflatoxins were investigated in wheat kernels, after purification with immu-noaffinity columns (IAC). The analysis revealed the presence of deoxynivalenol in wheat kernels at a concentration of 2251 µg/kg. It is expected that climate change will increase the frequency of extreme weather events. In order to mitigate the potential risks associated with mycotox-in-producing fungi and to ensure the protection of human health, it is suggested to implement of-ficial controls in the field.

: Climate change necessitates urgent actions to mitigate carbon dioxide (CO2) emissions from fossil fuel-based energy generation. Among various strategies, the deployment of carbon capture and storage (CCS) solutions are critical for reducing emissions from point sources such as power plants and heavy industries. In this context, cryogenic carbon capture (CCC) via desublimation has emerged as a promising technology. While CCC offers high separation efficiency, minimal downstream compression work, and integration potential with existing industrial processes, challenges such as low operating temperatures and equipment costs persist. Ongoing research aims to address these hurdles in order to optimize the desublimation processes for widespread implementation. This review consolidates diverse literature works, providing insights into the strengths and limitations of CCC technology, including the latest pilot plant scale demonstrations. The transformative potential of CCC is first assessed on a theoretical basis, such as thermodynamic aspects and mass transfer phenomena. Then, recent advancements in the proposed process configurations are critically assessed and compared through key performance indicators. Furthermore, future research directions for this technology are clearly highlighted.

Spontaneous tumours in higher plants can develop depending on plant genotype without any pathogen invasion. Spontaneous tumour formation on the taproots is consistently observed in certain inbred lines of radish (Raphanus sativus var. radicula Pers.). In this work, we have sequenced the genomes of two closely related radish inbred lines that differ in their ability to spontaneously form tumours. We have identified numerous single nucleotide variants (amino acid substitutions, insertions or deletions) that are likely to be associated with the spontaneous tumour formation. Furthermore, we performed the identification of CLE and WOX genes the genomic sequences of the radish inbred lines and, as a result, identified two unique radish CLE genes which probably encode proteins with multiple CLE domains. The results obtained provide a basis for investigating the mechanisms of plant tumour formation and also for future genetic and genomic studies of radish.

This study aimed to develop a laboratory-scale direct air capture unit for evaluating and comparing amine-based adsorbents under temperature vacuum swing adsorption conditions. The experimental campaign conducted with the direct air capture unit allowed for the determination of equilibrium loading, CO2 uptake capacity, and other main performance parameters of the investigated adsorbent Lewatit VP OC 1065®. The investigations also helped to understand the co-adsorption of both CO2 and H2O on the tested material, which is crucial for improving temperature vacuum swing adsorption processes. This was achieved by obtaining pure component isotherms for CO2 and H2O as well as three different co-adsorption isotherm models from literature. It was found that the weighted average dual-site Toth model emerged as the most accurate and reliable model for simulating this co-adsorption behavior. Its predictions closely align with experimental data, particularly in capturing the adsorption equilibrium at various temperatures. It was also observed that this lab-scale unit offers advantages over thermogravimetric analysis when conducting adsorption experiments on the chosen amine. The final aim of this study is to provide a pathway to develop devices for testing and developing efficient and cost-effective adsorbents for direct air capture.

Ultra-wide field optical coherence tomography (UWF-OCT) has been recently introduced into clinical ophthalmological practice. To date, there is little data on the reference values of retinal thickness (RT) and choroidal thickness (CT) measured with this technique. This study aimed to analyze the variance of RT and CT in healthy eyes with UWF-OCT tests performed with the largest available scan size of 23 x 20 mm. The data were analyzed with reference to the patients' age, gender, and the axial length of the eyeball. The results of UWF-OCT scanning enabled us to picture the shape of the retina and choroid in a large portion of the eyeball. Both anatomical entities become significantly thinner at the periphery. The peripheral CT is greater in the upper and temporal sectors; the RT is higher in the nasal compared to the temporal sectors. Both choroid and retina lose thickness with age, however, CT and RT do not show a statistically significant correlation with the axial length after adjusting for age and gender. Age-related variations in thickness are especially prominent in the choroid. The CT in UWF-OCT testing is significantly greater in females while the RT is greater in males. UWF-OCT testing provides additional information on the anatomical structure of the retina and choroid compared to standard-field OCT

TLC and HPTLC in normal (NP) and reversed (RP) phase systems combined with densitometry were used to analyze caffeine, propyphenazone and paracetamol. Normal phase analyses were performed on five different stationary phases (chromatographic plates), testing three mobile phases. Reversed-phase analyses were performed on four different chromatographic plates using three mobile phases. Thus, it was checked whether analyses using TLC chromatographic plates could be as sensitive as those performed on HPTLC plates. For all analyzed biologically active substances, the limit of detection (LOD) was calculated, i.e. a parameter that describes the method sensitivity. It has been shown that using both TLC and HPTLC plates, it is possible to develop chromatographic conditions that enable the detection of caffeine, propyphenazone and paracetamol in amounts ranging from a dozen to several dozen µg/spot. In the reversed-phase (RP) system, lower LOD values for all tested compounds were obtained using TLC than HPTLC. However, using analyses in the normal phase system (NP), similar (of the same order) LOD values are obtained for caffeine, propyphenazone and paracetamol, both when using TLC and HPTLC plates. Therefore, for economic reasons, TLC plates should be recommended for analyses of caffeine, propyphenazone and paracetamol, which are several times cheaper than HPTLC plates.

In the realm of educational technology, Data Analytics (DA) is reshaping teaching and learning. This paper investigates the impact of DA on education, specifically comparing Student Information Systems (SIS) and Learning Management Systems (LMS). Data-driven insights from SIS and LMS platforms enable educators to tailor instructional strategies to individual student needs effectively. While SIS manages student data for administrative tasks, LMS offers tools for content delivery and collaboration. Using the strengths of SIS and LMS, educators can optimise teaching and learning experiences, tracking student progress, and fostering collaboration. The comparison emphasises their distinct roles: SIS manages administrative tasks, while LMS focusses on content delivery and collaboration. Using both systems, educators improve the teaching and learning experience, leveraging DA for continuous improvement. In summary, this paper underscores the transformative role of DA in education, framed within the context of comparing the SIS and LMS functionalities. By examining the intersection of data-driven decision making and educational technology, educators are equipped with the tools and knowledge to harness the power of data for meaningful and impactful teaching and learning.

This paper utilizes the 2020 financial data of A-share listed companies, both ST and non-ST, as the data sample. The model is constructed employing the Factor-Logistic fusion algorithm. Eight key indicator factors were selected from the frameworks of profitability, solvency, operating capacity, development potential, shareholder retained earnings, cash flow and asset growth. An independent indicator system was subsequently established to address the issue of collinearity among risk indicators. The results of model are presented in the form of probabilities, enhancing the interpretability of model. The weights of the features indicate the influence of different features on the final outcome. The model achieves a prediction accuracy of over 89%, with an AUC score exceeding 95%. Finally, by applying the principles of interval estimation theory in statistical hypothesis testing, the risk levels are categorized as A-level representing significant risk, B-level representing moderate risk, C-level representing minor risk and D-level representing no risk. This paper aims to provide a comprehensive definition of a universal financial risk management warning model for enterprises, applicable to all enterprises in China.

We use binary string to represent a natural number and show the composite procedure of odd-number and even-number functions, thus we propose full binary directed tree to represent the set of natural numbers and give another partition the natural number set to three sets: pure odd, pure even and mixed number. For the Collatz conjecture we make use of the parity of a natural number to analyse the sequence of iteration (or composite) of Collatz function and reduced Collatz function analog to the inverse function. We give tabular and binary strings to the algebra expression to state the sequence of Collatz, this is the key topic to proof the conjecture: the discrete powers of 2 can be changed to ultimately continuous powers of 2, finally get to pure even number and to the smallest number 1. The sequence created by the infinite iterations of the Collatz function becomes the ultimately periodic sequence if any natural number is the beginning value, proving the conjecture that has been held for 87 years.

This research aimed to study and compare prevalence of work-related musculoskeletal (MSK) problem and perceived discomfort among port crane operators consisting of quay and rubber tyred gantry (RTG) cranes working in the Laem Chabang Deep-sea Port, Thailand. Direct interviews for a cross-sectional analysis was selected for this unique job with a small amount of sample size. A standardized modified version of the Nordic Musculoskeletal Questionnaire (NMQ) was lunched for 26 male participants, consisting of 11 quay and 15 RTG, where a priori power analysis using G*Power suggested the minimum as 24 for the hypothesis test. Socio-demographic characteristics showed no significant difference among them. The NMQ revealed lower back as the highest prevalent body part (76.9%) followed by neck, shoulders and upper back at the same percentage (23.1%) for all port crane group, with up to 96.2% reporting MSK problem over the past 12 months. And Borg scale rating, assessing the perceived discomfort, revealed lower back with the highest score (2.38) followed by upper back (0.65), shoulders (0.54) and neck (0.5). Remarkably, the comparation between the quey and RTG crane operators on the MSK prevalence (χ2 test) and perceived discomfort levels (Kruskal-Wallis test), regarding different 9 body parts, revealed a significant difference between the two on upper back with quay crane having more problem than the RTG at p &lt; 0.05. while the rest of them were mainly in the same direction. MSK contributors such as: working awkward posture, mental stress, height, trolley distance and vibration are considerably the main causes of this. However, the larger in scale of exposure to those for the quey crane compared to the RTG might have led to the distinguishing MSK problem found in this study which require thoroughly deliberation for the particular solutions.

This article explores the intricate relationship between Human-Data Interaction (HDI) and Data Virtualization (DV), two integral fields that are redefining how we engage with and manage data in the digital age. Positioned at the intersection of technology and user-centric design, this study examines how DV can transcend traditional data management boundaries to significantly enhance data accessibility, legibility, and agency, thus fostering more ethical and meaningful interactions across various sectors. Opening with a detailed exposition on the evolving role of HDI, the paper contextualizes the importance of user-centric data practices within contemporary digital challenges. HDI’s principles are pivotal as they advocate for user empowerment in data interactions, ensuring that data processes are not only transparent but also negotiable and aligned with users’ needs and ethical standards. DV emerges as a transformative solution that inherently supports these principles by integrating diverse data sources into a cohesive and accessible format, thereby eliminating many of the inefficiencies found in conventional data management systems. Through a series of nuanced case studies, the paper provides empirical evidence of DV’s effectiveness across diverse domains. In healthcare, DV facilitates a holistic approach to patient care by providing seamless access to comprehensive medical records, thereby enabling faster, more accurate diagnostic and treatment processes. In the financial sector, DV proves instrumental in enhancing the detection and management of fraud, integrating transactional data across global platforms in real-time to allow for swift, proactive interventions. In education, DV supports personalized learning by synchronizing data from various educational tools, thus allowing for tailored educational experiences that respond dynamically to student performance and engagement metrics. Moreover, the paper critically addresses the ethical considerations and privacy concerns that arise with the integration of HDI and DV, particularly as data interactions become more pervasive and complex. By proposing forward-thinking research directions, it seeks to refine these technologies to better serve societal needs while addressing potential risks and governance issues. In conclusion, this study significantly contributes to the discourse on HDI by advocating for DV as an essential, innovative tool that enhances the clarity, fairness, and efficacy of data interactions. By demonstrating how DV can transform large-scale data sets into user-friendly formats that support decision-making and improve operational efficiencies, the paper underscores DV’s potential to advance a range of industries and enhance the daily lives of individuals interacting with digital systems.

The Pantanal region in the state of Mato Grosso suffers from intensive biomass burning at the dry season. A great volume of anthropogenic emissions affects the ecosystem, damaging the richest fauna and flora internationally recognized. The collect and characterization of natural aerosols is important to accompany the variations in the composition and concentration of these particles, this work determined the total mass concentration of fine inhalable particles, concentration of aerosol compound Black Carbon (BC) and the presence of 25 chemical elements in the samples. Maximum total mass inhalable fine (PM2.5) and BC concentration was, respectively, 83.66 μg m-3 and 4.52 μg m-3, and the median values of both was 36.62 ± 31.69 μg m-3 and 1.83 ± 1.65 μg m-3. The Pb element concentration demonstrated a great maximum value of 25 ng m-3, around twenty-one times bigger than a similar study realized ten years ago in the same area. The results indicate a low correlation between aerosols concentration and environmental parameters, nonetheless, we verify a considerable increase in concentration of PM2.5, BC and chemical elements S, K, Fe, Si and heavy metals compared with previous studies.

India, a megadiverse nation, harbors significant biodiversity, particularly in tropical moist deciduous forests. However, these forests and valuable medicinal plants face habitat loss and overexploitation threats. While indigenous knowledge of medicinal plants exists, a comprehensive ethnomedicinal study still needs to be included, especially for Uttar Pradesh's Terai region. This study focuses on the Suhelwa Wildlife Sanctuary, a haven for medicinal plants within the Terai. We aim to document the knowledge of local healers regarding wild medicinal plants used in phytotherapy. We will employ quantitative indices and compare our findings with data from other regions to identify novel medicinal plant uses. This enriched database can serve as a springboard for future pharmacological research. Suhelwa's diverse geography and climate contribute to its rich medicinal flora, making it a prime candidate for exploring the potential of traditional knowledge for drug discovery and sustainable income generation for local communities.

The NW-SE trending dextral strike-slip faults on the north side of the Tian Shan play an important role in accommodating the crustal shortening, which mainly includes the Karatau fault, Talas-Fergana fault, Dzhalair-Naiman fault, Aktas fault, Dzhungarian fault (also named Bolokenu-Aqikekuduk fault) and Chingiz fault. The classic viewpoint is that the strike-slip fault is the adjustment product caused by the difference of the crustal shortening from west to east. Another viewpoint attributes the dextral strike-slip fault to large-scale sinistral shearing. The Alakol Lake Fault is situated along the northern margin of the Dzhungarian Gate, stretching for roughly 150 km from Lake Ebinur to Lake Alakol. Our team utilized aerial photographs, Satellite Stereo-imagery, and field observation to map the distribution of the Alakol Lake fault. Our findings provided evidence supporting the assertion that the fault is a dextral strike-slip fault. In reference to its spatial distribution, Lake Alakol is situated in a pull-apart basin that lies between two major dextral strike-slip fault lines: the Chingiz and Dzhungarian faults. The Alakol Lake Fault serves as a connecting point for these two faults, resulting in the formation of a mega NW-SE dextral strike-slip fault zone. According to our analysis of the dating samples taken from the alluvial fan, as well as our measurement of the displacement of the riser and gully, it appears that the Alakol Lake fault has a dextral strike-slip rate of 0.8-1.5mm/yr. The strike-slip rate of the Alakol Lake fault is comparatively higher than that of the Chingiz fault in the northern region (~0.7 mm/yr), but slower than that of the Dzhungarian fault in the southern (3.2-5 mm/yr). The Chingiz-Alakol-Dzhungarian fault zone shows a gradual decrease in deformation towards the interior of the Kazakhstan platform. We contend that the rate of deformation observed is better explained by the crustal shortening adjustment model, rather than the large-scale sinistral shearing model.

Glioblastoma multiforme (GBM) is one of the deadliest human cancers with very lim-ited treatment options available. The malignant behavior of GBM is manifest in a tu-mor which is highly invasive, resistant to standard cytotoxic chemotherapy and is strongly immunosuppressive. Immune checkpoint inhibitors have recently been in-troduced in the clinic and have yielded promising results in certain cancers. GBM however is largely refractory to these treatments. The immune checkpoint CD47 has recently gained attention as potential target for intervention as it conveys a “don’t eat me” signal to tumor associated macrophages via the inhibitory SIRP alpha protein. In preclinical models, administration of anti-CD47 monoclonal antibodies have shown impressive results with GBM and other tumor models. Several well characterized on-cogenic pathways have recently been shown to regulate CD47 expression in GBM cells and Glioma Stem cells (GSCs) include EGFR, beta catenin and LRIG2. Other macro-phage pathways involved in regulating phagocytosis including TREM2 and glycan binding proteins are discussed as well. Finally, Chimeric Antigen Receptor Macro-phages (CAR)-M could be leveraged for greatly enhancing phagocytosis of GBM and repolarization of the microenvironment in general. Here we comprehensively review the mechanisms that regulate about macrophage phagocytosis of GBM cells.

Spatial and temporal variation of the free electron concentration in the ionosphere affects SAR interferograms, in particular at low radar frequencies. In this work the identification, estimation and compensation of ionospheric path delay phases in PALSAR-3 and NISAR-L interferograms is discussed. Both these L-band sensors acquire simultaneously SAR data in a main spectral band and in an additional, spectrally separated, narrower second band to support the mitigation of ionospheric path delays. The methods presented permit separating the dispersive and the non-dispersive phase terms based on the double-difference interferogram between the two available spectral bands and the differential interferogram of the main band. The applicability of the proposed methods is demonstrated using PALSAR-3-like data that was simulated based on PALSAR-2 SM1 mode data.

Investments in small and medium-sized anaerobic digestion facilities have the potential to boost biogas production in Greece and other EU countries. This study aimed to evaluate the economic feasibility of anaerobic digestion facilities equipped with combined heat and power (CHP) units ranging from 50 to 400 kW, while treating livestock waste. For this purpose, data were gathered from various livestock operations (dairy cattle, poultry, swine, dairy sheep and goat) regarding their annual production, revenues, electricity and fuel usage, and waste generation. Waste samples were then collected and analyzed to assess their biochemical methane production potential. The capital and operational costs of anaerobic digestion facilities, from 50 and 400 kW, were calculated using the equations developed within the “eMT cluster” project. Findings indicate that current feed-in tariffs (FIT) of 0.21 € kWh-1 are insufficient to incentivize investment in anaerobic digestion facilities with capacities below 250 kW, highlighting the need for increased FIT rates or capital expenditure subsidies. Recommendations include shifting towards simplified technology and business models with reduced farmer involvement, coupled with supportive legislative framework and long-term electricity price guarantees. These measures are expected to foster the implementation of anaerobic digestion projects in the animal husbandry sector.

The efficacy and cost-effectivness of Multigene Panel Next-Generation Sequencing (NGS) in directing patients towards genomically matched therapies remains uncertain. This study investigated metastatic colorectal cancer (mCRC) patients who underwent NGS analysis on formalin-fixed paraffin-embedded tumor samples. Data from 179 patients were analyzed, revealing no mutations in 39 patients (21.8%), one mutation in 83 patients (46.4%), and two or more mutations in 57 patients (31.8%). KRAS mutations were found in 87 patients (48.6%), including KRAS G12C mutations in 5 patients (2.8%), PIK3CA mutations in 40 patients (22.4%), BRAF mutations in 26 patients (14.5%). Less common mutations were identified: ERBB2 in 5 patients (2.8%) and SMO in 4 patients (2.2%). Additionally, MAP2K1, CTNNB1, and MYC were mutated in 3 patients (2.4%). Two mutations (1.1%) were observed in ERBB3, RAF1, MTOR, JAK1, and FGFR2. No significant survival differences were observed based on mutation numbers. 40% of patients had druggable molecular alterations, but only 1.1% received genomically guided treatment, suggesting limited application in standard practice. Despite this, expanded gene panel testing can identify actionable mutations, aiding personalized treatment strategies in metastatic CRC, although current eligibility for biomarker-guided trials remains limited.

In the symptomatic treatment of gastrointestinal disorders, high dosages of zinc oxide (ZnO) were conventionally employed. However, concerns regarding the potential for microbial resistance and ecological detriment have arisen due to the excessive application of this compound. These concerns highlight the urgency to minimize the use of ZnO and to explore sustainable nutritional solutions. Hydrolysable tannins (HTs), known for their role in traditional medicine for acute gastrointestinal issues, emerge as a promising alternative. This study examined the combined effect of food-grade HTs and lower ZnO concentration on relevant biological functions of Caco-2 cells, a widely used model of the intestinal epithelial barrier. We found that, when used together, ZnO and HTs (ZnO/HTs) enhanced tissue repair and improved epithelial barrier function, normalizing the expression and functional organization of tight junction proteins. Finally, the ZnO/HTs combination strengthened enterocyte defence against oxidative stress induced by inflammation stimuli. In conclusion, combining ZnO and HTs may offer a suitable and practical approach for decreasing ZnO levels in veterinary medical applications.

Abstract Cerebral microbleed(s) (CMBs) are increasingly being viewed not only as a marker for cerebral small vessel disease (SVD) but also as having an increased risk for the development of stroke (hemorrhagic/ischemic) and aging-related dementia. Recently, brain endothelial cell activation and dysfunction and blood-brain barrier dysfunction and/or disruption have been shown to be associated with SVD, enlarged perivascular spaces, and the development and evolution of CMBs. CMBs are a known disorder of cerebral microvessels that are visualized as 3-5mm, smooth, round or oval, and hypointense (black) lesions seen only on T2*-weighted gradient recall echo or susceptibility-weighted sequences on MRI images. CMBs (a global problem) are known to occur with high prevalence in community-dwelling older individuals. Since our current global population is the oldest recorded in history and only expected to continue to grow, we can only expect the health care burdens associated with CMBs to also grow. CMBs should raise a red flag regarding the increased risk of large symptomatic neurologic intracerebral hemorrhages. Importantly, CMBs are also currently regarded as markers of diffuse vascular and neurodegenerative brain damage. Thus, it is essential that we try to learn as much as we can about their development, evolution, and their relation to impaired cognition, dementia, and neurodegeneration.

Lifestyle interventions can prevent type 2 diabetes (T2DM). However, some in-dividuals do not experience anticipated improvements despite weight loss. Bi-omarkers to identify such individuals at early stages are lacking. IGF-1 and IGFBP-1 were shown to predict T2DM onset in prediabetes. We assessed if these markers also predict the success of lifestyle interventions, thereby possibly guid-ing personalized strategies. We analyzed fasting serum levels of IGF-1, IGFBP-1 and IGFBP-2 in relation to changes in metabolic and anthropometric parameters, including intrahepatic li-pids (IHL) and visceral adipose tissue (VAT) volume measured by MRI, in 345 high-risk prediabetic participants (54% female; aged 36-80 years). Participants were enrolled in three randomized dietary intervention trials and assessed both at baseline and one year post-intervention. Statistical analyses were performed using IBM SPSS Statistics (version 28), significance set at p

Myocardial fibrosis is a pivotal pathophysiological step of various cardiovascular diseases, which eventually leads to heart failure and death. Cardiac fibroblasts activation and subsequently differentiate into myofibroblasts are pivotal pathophysiological step in myocardial fibrosis. Phosphoglycerate mutase 1 (PGAM1) directly interacts with α-smooth muscle actin (ACTA2) and participate in fibrosis regulation. Allosteric inhibitor of PGAM1 could attenuates fibrosis through break the interaction of PGAM1 and ACTA2. In this study, we aimed to screen and identify novel ligand of PGAM1 in natural product library. Firstly, various natural products were screened via DARTS assay and Carthamus tinctorius L. was identified as a target pool for molecular docking. Then, in silico screening assay identified baicalein as a novel ligand. In addition, baicalein could directly bind to the PGAM1 protein with a KD value of 34.6 μM. Molecular dynamics simulation revealed that baicalin and PGAM1 interactions were stable. These findings indicate that PGAM1 is a direct pharmacological target of baicalein. Immunoblot analysis further demonstrated that baicalin inhibits the activation of fibroblasts in vitro. Finally, the anti-myocardial fibrosis effect of baicalein was verified in vivo. Taken together, our findings suggest that baicalein is a novel PGAM1 templates for developing new therapeutics against myocardial fibrosis.

Quantum computing represents a paradigm shift in computational power, promising exponential speedups for solving certain classes of problems. However, harnessing the full potential of quantum computers requires effective utilization of data science techniques. In this review paper, we explore the intersection of data science and quantum computing, focusing on the role of data analytics in advancing quantum computing applications. We begin with an overview of quantum computing fundamentals, including quantum mechanics principles and quantum algorithms. We then delve into topics such as quantum data representation, manipulation, and machine learning algorithms tailored for quantum computing environments. Additionally, we discuss quantum error correction and noise mitigation strategies essential for reliable quantum computation. Furthermore, we survey the landscape of quantum software development tools and frameworks, highlighting their importance in facilitating quantum algorithm design and optimization. Through case studies and examples, we demonstrate the practical applications of data science techniques in quantum computing, including quantum cryptography and quantum-enhanced data analysis. Finally, we identify future research directions and challenges in the field, emphasizing the need for interdisciplinary collaboration between the data science and quantum computing communities to unlock the full potential of quantum data science.

The space exploration landscape has transformed dramatically over the past several decades, with a significant rise in the number of annual launches. Key factors driving this increase include technological advancements, the miniaturization of satellites, and the surge in commercial satellite deployments for communication, Earth observation, and remote sensing. This paper examines the evolution of space activities from the launch of Sputnik 1 in 1957 to recent developments in commercial spaceflight and international collaborations. The paper discusses notable milestones in space exploration history, including early space missions, Apollo Moon landings, and the development of space stations like the International Space Station. It highlights the shift from state-led space programs to a more diverse landscape, characterized by private sector involvement and international partnerships. The "Space 4.0" phase, beginning around 2006, has seen the entry of commercial players like SpaceX, leading to a significant upsurge in orbital launches. Statistical data reveals an upward trend in launch activity, with over 200 launches in 2023 alone, driven by large satellite constellations like SpaceX's Starlink and the steady growth of China's space program. The increasing launch rate poses challenges such as space debris, emphasizing the need for mitigation strategies. Looking ahead, the paper projects a continued increase in launch activity, with over 150 launches expected annually by 2026 and 200-300 launches by 2040. Commercial space ventures, deep space exploration, lunar activities, and space tourism drive this growth. The paper concludes by emphasizing the importance of addressing space debris and promoting the long-term sustainability of space activities, which is crucial as humanity's presence in space continues to expand.

Alena Tensor is a recently discovered class of energy-momentum tensors that provides a mathematical framework in which the description of a physical system in curved spacetime and its description in a flat spacetime with fields are equivalent. As demonstrated in previous publications, in curved spacetime this tensor reproduces Einstein Field Equations and in flat Minkowski spacetime, it describes physical system with fields that can be widely configured. Thanks to the obtained compliance with QM and QED, the use of the discussed tensor may significantly simplify Quantum Field Theory equations and a new interpretation of the Schrödinger equation is possible. In the article it has also been shown that the use of Alena Tensor for the electromagnetic field takes into account effects related to the particle's spin, Abraham–Lorentz effect and, in the curvilinear description, this excludes non-physical phenomena such as the black hole singularity. The article contains a method for verifying Alena Tensor within QM, proposing an explanation for the discrepancy between the Dirac and Klein-Gordon solutions. It also discusses prospects for the application of Alena Tensor in unification theories against the background of existing research directions.