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.

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

Anxiety in older adults is a prevalent yet under-recognized condition associated with significant societal and individual burdens. This study used a machine learning approach to compare the relative importance of 57 risk and protective factors for anxiety symptoms in a population-representative sample of middle-aged and older European adults (N = 65,684; ages 45–103 years; 55.7% women; 15 countries represented). Results revealed loneliness and self-rated poor health as primary risk factors (Nagelkerke R2 = .272), with additional predictive contributions from country of residence, functional limitations, financial distress, and family care burden. Notably, follow-up analysis showed that none of 16 social network variables were associated with loneliness; rather, cohabitating with a partner/spouse was most strongly associated with reduced loneliness. Further research is needed to elucidate directional associations between loneliness and anxiety (both general and sub-types). These findings underscore the imperative of addressing loneliness for mitigating anxiety and related mental health conditions among aging populations.

Background/Objectives: The latest WHO classification underscores the importance of the complete blood count (CBC) and cell morphology assessment in diagnosing lymphoid neoplasms. This study evaluated the diagnostic role of Research Use Only (RUO) parameters from the BC-6800 Plus Mindray analyzer in differentiating cell chronic lymphocytic leukemia (CLL), acute lymphoblastic leukemia (ALL), and other lymphoproliferative disorders. Methods: CBCs were performed on 90 patients (66% male, median age 67 years) with pathological blood counts (ALL, n=14; CLL, n=47; other lymphoproliferative disorders, n=29) at Novara’s University Hospital. Univariable and multivariable logistic regression assessed the association of basic (WBC, Hb, RDW, NE#, LY#, MO#, PLT) and research cell parameters (NLR, NMR, LMR, NeuX, NeuY, NeuZ, LymX, LymY, LymZ, MonX, MonY, MonZ). Results: In multivariable analysis, Hb (p=0.02), NeuY (p=0.04), and MonY (p=0.01) independently predicted CLL versus ALL, correctly classifying 93.4% of cases (AUC 0.91, 95% CI 0.81-1.0). MO# (p=0.003), LymY (p&lt;0.0001), and MonY (p=0.004) were independent predictors of CLL versus other lymphoproliferative disorders, classifying 77.6% of cases (AUC 0.86, 95% CI 0.78-0.95). NeuZ (p=0.01) and NeuY (p=0.04) independently predicted ALL versus other lymphoproliferative disorders, classifying 93% of cases (AUC 0.98, 95% CI 0.95-1.0). Conclusions: The use of RUO parameters offers valuable, cost-effective support in the early diagnosis of ALL, CLL, and other lymphoproliferative disorders.

This work aims to investigate the effect of process temperature and catalyst content by thermochemical degradation of municipal solid waste (MSW) fraction (organic matter + paper + plastic) on the yield of reaction products (bio-oil, biochar, H2O and gas), physi-cochemical properties and chemical composition of bio-oils, as well as on the morphol-ogy and crystalline phases of biochar in laboratory scale. The organic matter, paper and plastic segregated from the gravimetric composition of total waste sample were subject-ed to the pre-treatments of drying, crushing and sieving. Thermal pyrolysis was per-formed at 400, 450 and 475 °C and 1.0 atmosphere, and catalytic pyrolysis at 450°C and 1.0 atmosphere, using 5.0, 10.0 and 15.0% (wt.) of FCC zeolite, bath mode, using a laboratory-scale borosilicate glass reactor. The bio-oil was characterized for acidic val-ue. The chemical functions present in the bio-oil identified by FT-IR and the composi-tion by GC-MS. Biochar was characterized by SEM/EDS and XRD. Thermal pyrolysis of the MSW fraction shows bio-oil yields between 9.44 and 9.24% (wt), aqueous phase yields between 21.93 and 18.78% (wt), solid phase yields between 67.97 and 40.34% (wt) and gas yields between 28.27 and 5.92% (wt). The bio-oil yield decreased with in-creasing process temperature. For the experiments using FCC, the biochar and gas yields slightly increased with increasing FCC content, while that of bio-oil decreased and the H2O phase remained constant. GC-MS of bio-oils identified the presence of hy-drocarbons and oxygenates, as well as nitrogen-containing compounds including am-ides and amines. The acidity of the bio-oil increased with increasing temperature and with the aid of FCC as a catalyst. The presence of hydrocarbons in bio-oil was identified by the addition of FCC catalyst due to the deoxygenation of carboxylic acids, followed by decarboxylation and decarbonylation reactions, producing aliphatic and aromatic hydrocarbons.

Background: In high-risk breast cancer patients with skin infiltration the administration of a uniform dose to superficial tissues is fundamental in order to reduce local skin relapse. A personalized bolus may prevent the potential standard bolus’ inadequate dose distribution due to air gaps between the bolus and the skin. In this pilot study, we introduced in clinical practice the use of a personalized 3D printed bolus filled with ultrasound transmission gel. Methods: Seven patients undergoing radiotherapy after mastectomy were selected. 3D printed bolus dosimetric assessment was performed with MOSFET dosimeters on an anthropomorphic phantom and subsequently on three selected cases with increasing bolus shape irregularity. Acute/late toxicity and local control was assessed. Results: Overall, for the clinical cases the percentage median difference between measured and calculated doses was -2.7% (-7.0%÷4.9%). Median follow-up was 21 months. After two years, one patient showed G2 pain, one patient manifested G1 telangiectasia, one patient showed G1 hyperpigmentation, and two patients had no relevant toxicity. Conclusions: Personalized 3D-printed bolus filled with ultrasound gel may easily reproduce the standard bolus’ consistency providing an accurate coverage of the target area with tolerable acute/late toxicity grades. This is a pilot study and further investigations are needed.

Clustering is a very common analysis of data present in large datasets, with the aims of understanding and summarizing data, and discovering similarities, among others. However, despite the present success of subsymbolic methods for data clustering, the description of the obtained clusters cannot rely on the intricacies of the subsymbolic processing. For clusters of data expressed in the Resource Description Framework (RDF) we extend and implement an optimized previously proposed logic-based methodology which computed an RDF structure — called a Common Subsumer — describing the commonalities among all resources. We tested our implementation with two open, and very different RDF datasets: one devoted to Public Procurement, and the other devoted to drugs in Pharmacology. For both datasets, we were able to provide reasonably concise and readable descriptions of clusters up to 1800 resources. Our analysis shows the viability of our methodology and computation, and paves the way for general cluster explanations to lay users.

This study addresses a gap in the literature by conducting a comparative analysis of statistical and artificial intelligence techniques for predicting bankruptcy in small and medium-sized enterprises (SMEs). Using a comprehensive database of 7,104 Belgian SMEs, our findings demonstrate that intelligent techniques offer superior predictive accuracy for bankruptcy. Notably, our results indicate that a firm's position in the global value chain significantly affects prediction accuracy, with lower performance for firms operating upstream in the production process. This suggests that bankruptcy risk may spread upward along the value chain. This insight is particularly valuable for practitioners, as it highlights the importance of focusing on specific performance factors based on the type of firms they manage, advise, or collaborate with.

By tonnage, corn (Zea Mays L.) is the #1 crop produced globally, and recent research has suggested that no-till (NT) systems can lead to reduced yields of this important crop. Additionally, there is a lack of long-term data about the effects of tillage and N management on cropping systems. Corn is the most nitrogen (N)-fertilized crop in the USA, and N losses to the environment contribute to significant impacts on air and water quality. We conducted long-term studies on conventionally tilled (CT), and conservation tillage systems such as strip tillage (ST) and NT, under different N rates. We found that immediately after conversion to NT, yields from NT were significantly lower than yields from CT (P&lt;0.1), but after five years of NT, the NT yields were 1.5% higher than the CT yields (P&lt;0.1). Initially, the NT yields were lower than the ST (P&lt;0.01), but after seven years of NT, the NT yields were comparable to ST grain yields. Although the total aboveground N uptake with NT immediately after conversion to NT was lower than with CT and ST, these differences were not significant in the long run. The nitrogen use efficiency (NUE) with NT increased over time. The present work highlights the importance of long-term research for determining the cumulative impacts of best management practices such as NT. We found that NT becomes a more viable practice after five or seven years of implementation, demonstrating the high importance of long-term research.

The structure and diversity of tropical vegetation are shaped by biotic and abiotic factors, which function as environmental filters affecting plant performance in different spatial and temporal scales. We compared soil traits, vegetation structure and leaf traits (i.e., specific leaf area, polyphenols and chlorophyll content a/b and total) in early, intermediate and late successional stages of a tropical dry forests in southeastern Brazil. For this purpose, we measured leaf traits of the most abundant species in the same 18 plots (50 x 20m/ six per successional stage) in 2009 and 2018. We tested whether tree species growing in early forests have a greater investment in conservative traits related to chemical defenses and tolerance to desiccation compared to late-stage tree species. We observed contrasting results when comparing the chronosequence differences in leaf traits both in 2009 and 2018 and the temporal changes along this period. Specific leaf area was lower than expected for all successional stages while polyphenol content increased along time, contrary to other studies in tropical dry forests. These results suggest that contrasting environmental conditions such as soil water holding capacity and light availability are responsible of the observed pattern. Total chlorophyll content increase lightly, while the a/b chlorophyll ratio doubled in all successional stages, contrary to our hypothesis. Therefore, we suggest that the conservative-acquisitive spectrum in successional gradients of TDFs should be further investigated for a better understanding of plant community assemblages.

Background/Objectives: Advancements in surgical stapling devices play a crucial role in improving outcomes for bariatric procedures. This study evaluates the performance and safety of a new endoscopic stapler (EnDrive®BelugaTM) regarding perioperative results across multiple bariatric surgery types. Methods: A retrospective analysis was conducted on 112 patients who underwent bariatric procedures using the Beluga stapler at two centres in the UAE and Kenya over 6-month period (June-December 2023). Procedures included laparoscopic sleeve gastrectomy (LSG), Roux-en-Y gastric bypass (LRYGB), mini gastric bypass (OAGB-MGB), and revisions. Perioperative outcomes, complications, and haemoglobin changes were assessed. Results: The cohort included 29 males and 83 females, with a mean age of 32.8 years and preoperative BMI of 41.1 kg/m². Procedures performed were 88 primary LSG, three primary LRYGB, 12 primary OAGB-MGB, and nine revision surgeries. No conversions, deaths, bleeding, or leaks occurred. Minor complications were observed in 4 patients. One patient required reoperation for intestinal obstruction. The mean hospital stay was 1.5 days. Haemoglobin levels showed minimal change from preoperative (12.8 g/dL) to postoperative day 1 (12.3 g/dL). Conclusions: The new Beluga endoscopic stapler demonstrated safe and effective performance across various bariatric procedures, with low complication rates and minimal blood loss. Its enhanced articulation capabilities may offer advantages in specific cases. Further studies are warranted to compare long-term outcomes with established stapling devices.

The border between Niger and Libya, often described as an "ungoverned space," epitomizes the complex interplay of economic, political, and security challenges within the Sahel region. Authorities and international actors have made various efforts to establish control, but tribal structures predominantly manage governance in these areas. These structures lack formal institutions and rely heavily on external security interventions to combat terrorism and irregular migration. The increasing militarization of the region raises significant concerns about the long-term efficacy of these approaches in achieving sustainable security. This study argues that enduring stability in such contexts requires a nuanced balance of economic, political, and social factors. The research methodology includes a comprehensive literature review of security issues, governance, state fragility, and counter-terrorism, utilizing scientific journals, books, reports, and newspapers. The study investigated the dual nature of ungoverned spaces, examining their role in facilitating terrorism and organized crime while highlighting the critical need for governance to enhance citizen welfare and support state functions. Recent developments in Libya and the Sahel under-score the urgency of addressing security and developmental challenges. The study concludes by advocating for sustainable political and development initiatives over militarization, emphasizing the necessity of a new social contract to address the security challenges in the Sahel region effectively.

This article explores the relationship between Wang Yangming's philosophy and the new quality productivity, revealing how the new quality productivity, while inheriting the core ideas of Yangming's philosophy, achieves a higher level through innovation and development. The new quality productivity emphasizes the integration and innovation of knowledge, technology, and information, characterized by knowledge-driven innovation, information technology support, sustainable green development, and global collaborative development. The fusion of Yangming's philosophy and the new quality productivity holds significant theoretical and practical implications.

Cholera is a diarrheal disease prevalent in populations without access to clean water. Cholera is caused by Vibrio cholerae, which colonizes the upper small intestine in humans once ingested. A growing number of studies suggests the gut microbiome composition modulates animal behavior. Zebrafish are an established cholera model that can maintain a complex, mature gut microbiome during infection. Larval zebrafish, which have immature gut microbiomes, provide the advantage of high-throughput analyses for established behavioral models. We identified the effects of V. cholerae O1 El Tor C6706 colonization at 5 days post-fertilization (dpf) on larval zebrafish behavior by tracking startle responses at 10 dpf. We also characterized the larval gut microbiome using 16S rRNA sequencing. V. cholerae-infected or uninfected control groups were exposed to either an alternating light/dark stimuli or a single-tap stimulus, and average distance and velocity were tracked. While there was no significant difference in the light/dark trial, we report a significant decrease in distance moved for C6706-colonized larvae during the single-tap trial. This suggests that early V. cholerae colonization of the larval gut microbiome has a dampening effect on sensorimotor function, supporting the idea of a link between the gut microbiome and behavior.

Objectives: Imaging exams are requested in intensive care units as a diagnostic, evaluation, and clinical monitoring method. While Chest Computed Tomography is the gold standard, Chest X-ray is the exam usually performed in routine care. Lung ultrasound has been gaining ground as it is a reliable exam performed at the bedside without exposure to radiation and at a low cost. This study aimed to evaluate the accuracy of bedside lung ultrasounds performed by pediatric intensivists as a diagnostic method. Methods: A prospective, diagnostic test-type study comparing bedside lung ultrasound performed by a pediatric intensivist with the evaluation of chest X-ray and lung ultrasound performed by a radiologist. Result: 48 patients on mechanical ventilation, aged from 1 month to 14 years, were analyzed, corresponding to 95 chest X-ray exams and 95 lung ultrasound exams. The Kappa agreement coefficients between the pediatric intensivist and the radiologist, both analyzing the lung ultrasound, were: normal report (1.0), atelectasis (1.0), pneumothorax (1.0), consolidation (0.97), pleural effusion (0.95), and pulmonary edema (0.90). Sensitivity, specificity, and accuracy of lung ultrasound were, respectively, normal report (50%; 91.8%; 82.1%), consolidation (88.3%; 57.1%; 76.8%), atelectasis (11.1%; 90.7%; 83.2%), edema (0; 70.2%; 70.5%), pneumothorax (83.3%; 94.4%; 93.7%), and pleural effusion (71.4%; 73%; 72.6%). Conclusion: The pediatric intensivist was skilled in examining and diagnosing lung injuries. Lung ultrasound showed good sensitivity, specificity, and accuracy when the pediatric intensivist performed when diagnosing consolidation, pleural effusion, and pneumothorax. Furthermore, lung ultrasound demonstrated better accuracy in evaluating pulmonary edema when compared with chest X-ray.

With the offshore oil-gas fields entering decline phase, high-efficiency separation of oil-gas-water mixtures becomes a significant challenge. As essential equipment for separation, the three-phase separators play a key role in Offshore Oil-Gas production. However, level control is critical in the operation of three-phase gravity separators on offshore facilities, as it directly affects the efficacy and safety of the separation process. This paper introduces an advanced deep deterministic policy gradient with adaptive learning rate weights (ALRW-DDPG) control algorithm, which improves the convergence and stability of the conventional DDPG algorithm. An adaptive learning rate weight function is meticulously designed, and an ALRW-DDPG algorithm network is constructed for simulating three-phase separator liquid level control. The effectiveness of the ALRW-DDPG algorithm is subsequently validated through simulation experiments. The results show that the ALRW-DDPG algorithm achieves a 15.38% improvement in convergence rate compared to the traditional DDPG algorithm, and the control error is significantly smaller than that of PID and DDPG algorithms.

This study considers the features of the chemical composition, internal structure, and oscillatory zoning of sulfides, sulfosalts and sulfates in the epithermal high-intermediate sulfidation type Au-Ag-Te Emmy deposit (Khabarovsk Territory), Russia. In this deposit the most widespread sulfide is pyrite occurring in two generations: pre-ore pure pyrite (I) with cubic crystal habit and dimensions from 20 μm to 0.5 mm from the early barren pre-ore hydrothermal stage, and pyrite (II) of the ore stage, which is represented by (a) colloform aggregates (IIa) formed as a result of rapid precipitation from the solution, and (b) crystalline pyrite (IIb), which is precipitated due to continuous decrease in temperature. Both pyrite (II) morphological varieties contain copper (0.06-6.03 wt.%). The crystalline variety of pyrite is associated with goldfieldite, hemusite and kawazulite which were deposited during the early mineralizing event in the deposit.

This study presents a comprehensive examination of the transformative potential of Islamic finance in advancing sustainable development goals (SDGs). It underscores the unique position of Islamic finance, with its ethical and moral foundations, to contribute significantly to environmental sustainability, social equity, and economic development. The paper highlights innovative financial instruments like Zakat, Waqf, and green Sukuk, which not only align with but also actively promote SDGs. Through a multidisciplinary approach, it advocates for a paradigm shift towards integrating sustainability into the core of financial systems. The analysis includes challenges in harmonizing Human Development Indexes (HDIs) with Ecological Footprints (EFs), proposing strategies for sustainable development, ecological conservation, and educational reforms. This study is pivotal for policymakers, financial institutions, and educators, providing a roadmap for leveraging Islamic finance towards achieving a balanced, sustainable, and inclusive global economy.

Commuting to work by private vehicle is one of the main sources of air pollution in cities, mainly from NO2 and particulate matter (PM2.5 and PM10). With the spread of telework, traffic congestion during peak hours is reduced on certain days of the week, improving air quality. This study an-alyzes the relationship between the improvement of air quality improvement and urban traffic resulting from teleworking activities after the COVID-19 pandemic in Madrid, Spain. The article considers road traffic and teleworking before the COVID-19 pandemic (2018 and 2019), during the pandemic (2020 and 2021) and in the period after (2022 and 2023) in the city center and the in-fluence on certain environmental factors. Daily NO2, PM2.5, PM10, and O3 concentration data were collected at air quality stations in Madrid municipality, traffic data and some meteorological variables such as wind speed, precipitation and temperature were considered. When conducting correlation and regression analysis among the variables it shows a clear association between NO2 and traffic before the pandemic, which is lower for both PM and O3. This correlation was main-tained during the pandemic, except for O3, whose association increased during this period and then decreased in the later period due to various motives. These results seem to indicate the ex-istence of a relevant relationship between urban mobility and air quality and an especially rele-vant relationship with telework, suggesting the need for policies aimed at promoting sustainable mobility in the future.

The modern era has numerous issues associated with power generation, especially with old fashioned combustion power plants. Since fossil fuels are primarily responsible for the emission of greenhouse gasses, there is a desperate need for adaptation and sustainability. Looking at those challenges, geothermal energy which civilization had a long time ago becomes the desirable solution. This paper aims at establishing the feasibility of geothermal power plants in meeting the challenges of energy intensity and environmental conservation. This study also illustrates that the categories of geothermal energy systems which include the dry steam, flash steam and the binary cycle power plants are capable of achieving high capacity factors, initiating feasibility studies, and have relatively low impacts on the environment. While it is likely to cost more in the initial stages of construction, geothermal power plants provide more long-term cost benefits and significantly fewer toxic emissions relative to the fossil fuel plants. Switching to geothermal energy not only means that the world will have new sources of energy in the near future but also that it will be clean and environmentally friendly. Through incremental steps, geothermal power plants may well open the door to a full energy source infrastructure for subsequent generations.

This study investigates the collapse of the medial longitudinal arch (MLA) as a risk factor for medial tibial stress syndrome (MTSS), hypothesizing that overuse of extrinsic foot muscles to prevent MLA collapse can lead to disability. Twenty healthy adults (39 feet) with a foot posture index score below 6 and no recent lower extremity orthopedic history participated. Ultrasonog-raphy measured foot muscle cross-sectional areas, while three-dimensional motion analysis us-ing VICON assessed foot kinematics during gait, focusing on navicular height at initial contact (ICNH) and dynamic navicular drop (DND) during the stance phase. Hierarchical cluster analy-sis based on ICNH and DND compared muscle cross-sectional areas between clusters using ANOVA or Kruskal–Wallis test. The analysis indicated that ICNH was lower in clusters 1 and 3 than in cluster 2, and DND was smaller in clusters 1 and 2 than in cluster 3. Although there was no significant difference in muscle cross-sectional area between the clusters, the flexor hallucis longus tended to be thicker in cluster 1 than in cluster 3 (p = 0.051). The findings suggest that the flexor hallucis longus may help prevent MLA compression during loading, indicating that over-use of extrinsic foot muscles may contribute to MTSS development.

Astragalus plants belong to the legume family and have obvious rhizosphere effect. The northwestern area of Yunnan China is the main distribution region of Astragalus plants with high application value, but low recognition and resource reserves. The aim of this research is to explore the species diversity of cultivable rhizosphere fungi derived from A. acaulis, A. forrestii, and A. ernestii growing in special high-cold environment of northwest Yunnan, and discover anti-infective components from these fungi. A total of 93 fungal strains belonging to 38 species in 18 genera were isolated and identified. Antibacterial and antimalarial screening yielded 10 target strains. Among them, the ethyl acetate crude extract of the fungus Aspergillus calidoustus AA12 from A. acaulis fermentation substance showed a broad antibacterial spectrum and the best antimalarial activity. Further chemical investigation led to the first discovery of seven compounds from the species of A. calidoustus, including a sesterterpine 6-epi-ophiobolin G (1), two sesquiterpenes penicisochroman A (2), pergillin (3) and 7-methyl-2-(1-methylethylethlidene)-furo[3,2-H]isoquinoline-3-one (4), and three polyketides trypacidin (5), 1,2-seco-trypacidin (6) and questin (7). Compound 1 exhibited moderate to strong antibacterial activity against six Gram-positive pathogens with the minimum inhibitory concentration (MIC) ranging from 25 to 6.25 μg/mL, and prominent inhibitory effect on the biofilm of Streptococcus agalactiae at MIC value of 3.125 μg/mL. This compound also displayed potent antimalarial activity against Plasmodium falciparum strains 3D7 and chloroquine-resistant Dd2 at the half maximal inhibitory concentration (IC50) values of 3.319 and 4.340 µmol/L at 72 h, respectively. This study contributed to our understanding of the cultivable rhizosphere fungi Astragalus-derived in special high-cold environment and further increased the library of fungi available for natural anti-infectious products screening.

Background/Objectives: Rehabilitation helps reduce disability in dementia. The Australian National Dementia Action Plan identifies a gap in clear treatment pathways post-diagnosis, affecting the quality of life for those with dementia. This study assessed the impact of a one-day dementia training course and follow-up on GPs' and practice nurses' knowledge, attitudes, and confidence regarding dementia rehabilitation. Methods: The training, led by two experienced GPs and an academic physiotherapist, covered dementia diagnosis, allied health roles, care planning, and referrals. The follow-up involved applying the learnt material and completing a reflective task. Three longitudinal surveys (Dementia Knowledge Assessment Scale - DKAS, General Practitioners’ Attitudes and Confidence towards Dementia Survey - GPACS-D, and Dementia Rehabilitation Scale) and Likert-scale statements were conducted pre-course, post-course, and at 4-month follow-up, alongside a focus group. Descriptive and regression analyses were applied to survey data, and content analysis was used for focus group data. Results: Seventeen participants (14 GPs, 3 nurses) completed the pre-post course survey, with eight (6 GPs, 2 nurses) participating in follow-up and focus group discussions. Post-course, DKAS scores increased by 12.1%, GPACS-D by 10.1%, and the dementia rehabilitation scale by 9.4%. Likert-scale statements improved by 8-79%. At the four-month follow-up, there was a slight, non-significant decline in most measures. Focus groups highlighted the training’s impacts, useful components, barriers, and suggestions for improvement. Conclusion: Training GPs and practice nurses in dementia rehabilitation enhances knowledge, awareness, and confidence. Ongoing efforts are needed to sustain benefits and address referral barriers for better access to dementia rehabilitation services.

It is vital to analyze ship collision risk for preventing collisions and improving safety at sea. This paper takes Ningbo-Zhoushan Port, a typical complex navigable water, as the research object, propose a probabilistic conflict detection method to estimate the potential collision risk by using a dynamic domain model driven by AIS data. Combined with the algorithm of fast modularity optimization and spectral clustering, a ship group extraction method from the perspective of water navigation management was proposed. Aiming at ship traffic characteristics in complex navigable waters, conduct dynamic calculation of ship collision risk from individual, regional and local multi-scale perspectives. The results show that the proposed method can detect the collision risk in a timely, reliable and effective manner under complex dynamic conditions. As such, they provide valuable insights for ship collision risk prediction and the development of risk mitigation measures.

Background: Obesity remains a widely debated issue, often criticized for the limitations in its identification and classification. This study aims to compare two distinct systems for classifying obesity: Body Mass Index (BMI) and body fat percentage (BFP) as assessed by bioelectrical impedance analysis (BIA). By examining these measures, the study seeks to clarify how different metrics of body composition influence the identification of obesity-related risk factors. Methods: The study enrolled 1255 adults, comprising 471 males and 784 females, with a mean age of 36 ± 11.90 years. Participants exhibited varying degrees of weight status, including optimal weight, overweight, and obesity. Body composition analysis was conducted using the TANITA Body Composition Analyzer BC-418 MA III device (T5896, Tokyo, Japan), evaluating the following parameters: current weight, basal metabolic rate (BMR), adipose tissue (%), muscle mass (%), and hydration status (%). Results: Age and psychological factors like cravings, fatigue, stress, and compulsive eating were significant predictors of obesity in the BMI model but not in the BFP model. Additionally, having a family history of diabetes was protective in the BMI model (OR: 0.33) but increased risk in the BFP model (OR: 1.66). The BMI model demonstrates exceptional predictive ability (AUC=0.998). In contrast, the BFP model, while still performing well, exhibits a lower AUC (0.975), indicating slightly reduced discriminative power compared to the BMI model. Conclusions:BMI classification demonstrates superior predictive accuracy, specificity, and sensitivity. This suggests that BMI remains a more reliable measure for identifying obesity-related risk factors compared to the BFP model.

As the aging of the world accelerates, clarifying the relationship between cultural differences and ageism is an urgent issue. Therefore, in this study, we conducted a correlation analysis between the six cultural scales of Hofstede et al. [1] and the objective and subjective ageism scales calculated from data on 35,232 people from 31 countries included in the World Values Survey Wave 6 by Inglehart et al. [2]. The results of a partial correlation analysis controlling for economic and demographic factors showed that power distance (PDI) and indulgence versus restraint (IVR) are positively and negatively correlated with ageism, respectively. This is the first study to show that these two cultural scales that previous studies have not paid much attention to are related to ageism.

Potentially, traditional medicine is used to manage multidrug resistance (MDR) bacterial infections. This study determined the antioxidant and antibacterial activities of Thymus schimperi (Ts), Rhamnus prinoides (Rp) and Justicia schimperiana (Js) from Addis Ababa against MDR-Uropathogenic Bacteria. Hydromethanolic extracts were prepared. Quantitative determination of phytochemicals and DPPH, ABTS and FRAP assays for antioxidant activities were carried out. In vitro, antibacterial activity and minimum inhibitory concentration (MIC) were performed. Ts had the highest total phenolic (TPC), flavonoid (TFC) and proanthocyanidin content. GC-MS analyses identified 14 bioactive-compounds: in Ts extract, with hexanedioic acid, bis(2-ethylhexyl) ester, thymol, and o-cymen-5-ol being the most predominant, respectively; in Rp extract (6 compounds; hexanedioic acid, bis(2-ethylhexyl) ester, β-D-glucopyranoside, methyl and desulphosinigrin respectively); and in Js extract (5 bioactive-compounds: hexanedioic acid, mono (2-ethylhexyl) ester, debrisoquine, and 8,11,14-heptadecatrienoate, methyl ester) being predominant, respectively. The extracts' TPC showed a strong negative correlation with the DPPH assay (r= -0.999; p=0.023), while its TFC correlated significantly with the ABTS assay (r=0.999; p= 0.032). Ts showed the highest antibacterial activity against clinical isolates of Escherichia coli and Klebsiella pneumoniae ESBL at 1000 mg/mL, and TS had the lowest MIC (4 mg/mL) among evaluated extracts against E. coli (ATCC25922). In conclusion, Ts and Rp showed activity against patient-isolated MDR-uropathogenic E. coli and K. pneumoniae ESBL.

The clinical application of collagen-based biomaterials is expanding rapidly, especially in tissue engineering and cosmetics. While oral supplements and injectable skin boosters are popular for enhancing skin health, clinical evidence supporting their effectiveness remains limited. Injectable products show potential in revitalizing skin, but safety concerns persist due to challenges in sterilization and the risk of biological contamination. Traditional methods of sterilization (heat and irradiation) can denature collagen. This study addresses these issues by introducing a novel technique: double filtration and low-temperature steam sterilization of a collagen gel. In vitro tests document sterility and confirm that the collagen structure remained intact without modification. An in vivo study found no adverse effects in rats or significant lesions at the implantation site over 13 weeks. These results suggest that this novel method to process collagen gels is a safe and effective skin booster. Advanced processing methods are likely to mitigate safety risks associated with injectable collagen products, though further research is needed to validate their biological effectiveness and clinical benefits.

Regular exercise has been shown to have a positive effect on the health outcomes of individuals with Type-2 diabetes mellitus (T2DM), however, it is still underutilised in developing countries. This study investigated diabetes-related knowledge, attitudes, and practice toward exercise and its benefits among individuals with T2DM. A total of one hundred and ninety-nine participants (male= 21.6% and female= 78.4%) with T2DM, aged between 18- 75, 43.77 (SD ±14.78) years participated in the study. A validated diabetes-related knowledge, attitude, and practice questionnaire, evaluated by true/false or unsure was utilised in the study. Descriptive and inferential statistics analysis was used to analyze data with the significance set at p<0. The study results demonstrated significantly poor diabetes-related knowledge of exercise (p<0.001). The majority of the study participants 163 (81.90%) with T2DM did not know that physical activity and exercise are different. Regarding the attitude of the individuals with T2DM, 158 (70.40%) of the study participants felt that their regular work was an adequate substitution for exercise. More than 50% of the study participants demonstrated a positive practice towards exercise and its benefits towards T2DM (p<0.001). The study revealed that participants’ knowledge and attitudes were poor towards exercise and its benefits, but their practice was good.

Traditional terrain analysis has relied on Digital Topographic Maps produced by national agencies and Digital Elevation Model (DEM) created using Airborne LiDAR. However, these methods have significant drawbacks, including the difficulty in acquiring data at the desired time and precision, as well as high costs. Recently, advancements and miniaturization in LiDAR technology have enabled its integration with Unmanned Aerial Vehicle (UAV), allowing for the collection of highly precise terrain data. This approach combines the advantages of conventional UAV photogrammetry with the flexibility of obtaining data at specific times and locations, facilitating a wider range of studies. Despite these advancements, the application of UAV LiDAR in terrain analysis remains underexplored. This study aims to assess the utility of UAV LiDAR for terrain analysis by focusing on the doline features within karst landscapes. In this study, we analyzed doline terrain using three types of data: 1:5000 scale digital topographic maps provided by the National Geographic Information Institute (NGII) of Korea, Digital Surface Models (DSM) obtained through UAV photogrammetry, and DEM) acquired via UAV LiDAR surveys. The analysis results indicated that UAV LiDAR provided the most precise three-dimensional spatial information for the entire study site, yielding the most detailed analysis outcomes. These findings suggest that UAV LiDAR can be utilized to represent terrain features with greater precision in the future which is expected to be highly useful not only for generating contours but also for conducting more detailed topographic analyses, such as calculating area and slope of the study sites.

Prevalence estimates of Parkinson’s disease (PD) – the fastest growing neurodegenerative disease – are underestimated due to issues surrounding diagnostic accuracy, symptomatic undiagnosed cases, suboptimal prodromal monitoring, and limited screening access. Remotely monitored wearable devices and sensors provide precise, objective, and frequent measures of motor and non-motor symptoms. Here, we used consumer-grade wearable device and sensor data from the WATCH-PD study to develop a PD screening tool aimed at eliminating gaps between patient symptoms and diagnosis. Early-stage PD (n=82) and age-matched comparison (n=50) participants completed a multidomain assessment battery during a one-year longitudinal multicenter study. Using disease- and behavior-relevant feature engineering and multivariate machine learning modeling of early-stage PD status, we developed a highly accurate (92.3%), sensitive (90.0%), and specific (100%) Random Forest classification model (AUC=0.92) that performed well across environmental contexts. These findings provide robust support for further exploring consumer-grade wearable devices and sensors for global population-wide PD screening and surveillance.

Background: The Advanced Lung Cancer Inflammation Index (ALI) is a novel, comprehensive index that integrates inflammation and nutritional status, incorporating parameters such as albumin, body mass index (BMI), and the neutrophil-to-lymphocyte ratio (NLR). Unlike traditional inflammation biomarkers, this study aims to evaluate the prognosis of IPF patients by considering both inflammation and nutritional status. Method: A total of 102 patients with IPF were included in the study. Clinical data were obtained from the patients' medical records. NLR and ALI score were calculated based on data collected at the initiation of antifibrotic treatment using the following formula: Neut/Lym and albumin × BMI / NLR. Results: IPF subject subgroups in terms of ALI based on gender–age–physiology (GAP) stages (1,2,3), FVC (median split,

The energy sector relies on numerical model output forecasts for operational purposes on a short-term scale, up to 10 days ahead. Reducing model errors is crucial, particularly given that coarse resolution models often fail to account for complex topography, such as that found in Costa Rica. Local circulations affect wind conditions at the level of wind turbines, thereby impacting wind energy production. This work addresses a specific need of the Costa Rican Institute of Electricity (ICE) as a public service provider for the energy sector. The developed and implemented product in this study serves as a proof of concept that could be replicated by WMO Members. It demonstrates a product for wind speed forecasting at wind power plants by employing a novel strategy for input selection based on large-scale indicators to enhance Artificial Intelligence-based forecasting methods. The product is developed and implemented based on the full-value chain framework for weather, water, and climate services for the energy sector introduced by the WMO. The results indicate a reduction of wind forecast RMSE by approximately 55% compared to the GFS grid values. The conclusion is that combining coarse model outputs with regional climatological knowledge through AI-based downscaling models is an effective approach for obtaining reliable local short-term wind forecasts up to 10 days ahead.

The integration of drone technology into healthcare logistics presents a significant opportunity to enhance the speed, reliability, and efficiency of medical sample transportation. This study inves-tigates the current advancements in drone technology, focusing on its application in the rapid and secure delivery of medical samples, particularly in urban and remote regions where traditional transportation methods often face challenges. Utilizing a combination of recent technological de-velopments such as AI-driven navigation systems, real-time monitoring, and secure payload management, the study examines how drones can mitigate logistical barriers like traffic conges-tion and geographical isolation. The research methodology includes a comprehensive review of recent case studies from various regions, illustrating the practical applications and benefits of drones in healthcare. The results demonstrate a substantial reduction in transportation time and costs, along with improved accessibility to healthcare services in underserved areas. The study concludes that, while challenges such as regulatory hurdles and privacy concerns remain, the on-going advancements in drone technology and supportive regulatory frameworks have the poten-tial to revolutionize medical logistics, ultimately improving patient outcomes and healthcare de-livery.

The role of astro- and microglial cells in the pathogenesis of epilepsy is currently under active in-vestigation. It is proposed that the activity of these cells may be regulated by agonists of peroxi-some proliferator-activated nuclear receptors (PPARs). The objective of this study was to investi-gate the effects of the PPAR β/δ agonist GW0742 (Fitorine) on the behavior and gene expression of astro- and microglial proteins involved in the regulation of epileptogenesis in rat brain in a lithi-um-pilocarpine model of temporal lobe epilepsy (TLE). A seven-day administration of GW0742 at a dose of 5 mg/kg/day has been shown to suppress TLE-related behavioral hyperactivity in the Open Field test and to attenuate the TLE-induced increase in gene expression and protein levels of astro- and microglial activation markers Gfap and Aif1 in the dorsal hippocampus and temporal cortex. Furthermore, GW0742 reversed the TLE-related increase in Lcn2 gene expression (a marker of the A1 phenotype of astrocytes) in the temporal cortex, the increase in the ratio of Nos2/Arg1 gene expression (markers of the M1/M2 phenotypes of microglia), and the decrease in Arg1 gene ex-pression in the dorsal hippocampus. The results suggest that GW0742 may mitigate behavioral and biochemical abnormalities in a lithium-pilocarpine model of TLE.

Exposure to even low levels of the environmental pollutant cadmium (Cd), increases the risk of kidney damage. The body burden of Cd at which kidney damage occurs is not, however, reliably defined. Here, multiple-regression and mediation analyses were applied to data from 737 non-diabetic Thai nationals, of which 32.2% had hypertension and 9.1% had an estimated glomerular filtration rate (eGFR) ≤ 60 mL/min/1.73 m2 (low eGFR). The excretion rates of Cd (ECd) and N-acetyl-β-D-glucosaminidase (ENAG), a marker of tubular injury, were normalized to creatinine clearance (Ccr) as ECd/Ccr and ENAG/Ccr. Doubling ECd/Ccr increased the risks of having a low eGFR [POR = 2.71 (95% CI:1.97, 3.74), p &lt; 0.001] and severe tubular injury [POR = 4.80 (95% CI: 1.35, 17.1), p = 0.015]. ENAG/Ccr was strongly associated with ECd/Ccr in both men (β = 0.447, p &lt;0.001) and women (β = 0.394, p &lt;0.001), while showing a moderate inverse association with eGFR only in women (β = −0.178, p = 0.002). A moderate association of ENAG/Ccr and ECd/Ccr was found in the low- (β = 0.287, p = 0.001), and the high-Cd body burden groups (β = 0.145, p = 0.004), but ENAG/Ccr was inversely associated with eGFR only in the high-Cd body burden group (β = −0.223, p &lt;0.001). These findings together with an insignificant mediated effect suggested that Cd-induced injury that causes release of NAG plays little or no role in the nephron destruction that reduces GFR.

Assembly theory provides a promising framework to explain the complexity of systems such as molecular structures and the origins of life, with broad applicability across various disciplines. In this study, we explore and consolidate different aspects of assembly theory by introducing a simplified toy model to simulate the autocatalytic formation of complex structures. This model abstracts the molecular formation process, focusing on the probabilistic control of catalysis rather than the intricate interactions found in organic chemistry. We establish a connection between probabilistic catalysis events and key principles of assembly theory, particularly the probability of a possible construction path in the formation of a complex object, and examine how the assembly of complex objects is impacted by the presence of autocatalysis. Our findings suggest that autocatalysis tends to favor longer consecutive construction sequences in environments with low catalysis probability, while this bias diminishes in environments with higher catalysis probabilities, highlighting the significant influence of environmental factors on the assembly of complex structures.

The study surveyed the use of academic libraries and information seeking behaviour of students at Lusaka Apex Medical University. The objectives of the study were to determine how often LAMU students used the libraries, to ascertain the purpose for which students used the library and to determine the challenges faced in accessing library services. Using a survey research design, 230 students selected using simple random sampling participated. Findings revealed that there were more male (51.1%) students who participated. The study also found that the majority of students (54.7%) were occasionally using the library. Results on the purpose for using the library showed that the majority (39.6%) were using it to read in order to improve personal competence. In relation to the challenges, majority students (42.6%) stressed the inadequacy of relevant materials. The need for librarians to make themselves available to aid students that seek information for different purposes was recommended. This was seen as a way through which many would have access to the available information in their field. There is a need for proper orientation and sensitization to students on how to access both physical and online materials. This would increase the library use as well as improve the performance of students. Lastly, it was recommended that a study on the digital literacy of students be done in order to ascertain their competence and search skills in sourcing for information.

A contemporary technique for calculating seismic risk is earthquake nowcasting (EN), which analyzes the progression of the earthquake (EQ) cycle in fault systems. 'Natural time' is a novel idea of time that serves as the foundation for EN assessment. The earthquake potential score (EPS), which has been discovered to have useful uses regionally and worldwide, is a unique tool EN uses to predict seismic risk. For the estimation of the EPS for the occurrences with the highest magnitude among these applications, we have since 2021 concentrated on Greece territory, applying sophisticated Artificial Intelligence (AI) algorithms, both wise (semi)supervised and unsupervised models, along with a customized dynamic sliding window technique that performs as a stochastic filter able to fine-tune the geo seismic occurrences. Long short-term memory (LSTM) neural networks, random forests, and clustering (geospatial) models are three machine learning techniques that are particularly good at finding patterns in vast databases and may be used to enhance earthquake prediction performance. In this study, we attempt to forecast whether practical Machine-learning and AI/Game-theoretic-based approaches can help predict big earthquakes and the normal future seismic cycle for 6-12 months. Specifically, we focus on answering two questions for a given region: (1) Is there a chance that a significant earthquake—say, one with a magnitude of M ≥ 6.0 will happen in the upcoming year? (2) What is the largest earthquake magnitude predicted in the upcoming year, and with which exact geographic coordinates (GCS)? Our results are quite promising and project a high precision accuracy score (≥ 98%) for seismic nowcasting in terms of four predictive parameters: the approximate (a) latitude, (b) longitude, (c) focal depth, and (d) magnitude of the phenomena.

The purpose of this project is to explore the potential of Long Short-Term Memory (LSTM), a type of recurrent neural network (RNN), as a tool for making directional predictions for assets. The focus will be on using LSTM for classifying up/down moves in stock indices, stocks, and FX rates (EUR/USD). Various financial ratios, advanced technical indicators, and volatility estimators will be used as features to enhance the predictive power of the model. Incorporating credit spreads and news indicators can also improve the model. The advantage of LSTM is its ability to handle sequences of arbitrary length, which means that longer time frames such as 5-day, 10-day, or 1-week returns can be used for prediction. Before using RNNs, exploratory data analysis (EDA) will be performed to understand the underlying patterns in the data. This may include dimensionality reduction techniques such as autoencoding, self-organizing maps, or decision tree regression. The results of the EDA will be used to guide the selection of features for the LSTM model. It is important to note that long memory and stationarity are common characteristics of time series data, such as interest rates or economic indicators. Power-law autocorrection, Hurst exponent fractional, or Markov processes may be used to model these data. Predicting 5-day, 10-day returns for equities or 1-week, 1-month returns for financial factors presents two challenges. First, a large amount of data is required, typically 7–10 years of data. Second, positive autocorrelation in the 5-day or 10-day returns in equity time series must be isolated.

Diabetic Foot Ulcer (DFU) is a severe complication of diabetes mellitus (DM), often leading to hospitalization and non-traumatic amputations in the United States. It is particularly prevalent among individuals of Hispanic descent, with a prevalence rate exceeding 10% [1, 2]. The target of this study is to identify markers of severity of DFU. This work follows a strategy that uses first Electronic Health Records and machine learning to identify risk factors reported as measurements of blood tests, such as cholesterol, blood sugar, and specific proteins in a cohort of thousands of patients. After this RNA risk factors are predicted using samples of bulk and single-cell gene expression across patients with different levels of DFU severity. We found the Albu-min/Creatinine Ratio (ACR) test as a key factor in severe DFUs. We also found a cluster of cells that harbor high expression of Apolipoprotein E protein (APOE) and it is significant in non-healing DFU cases. Overall, the study shows how the use of hundreds of thousands of EHR can reduce and inform the search space of molecules in a few samples of bulk-single cell transcriptomics and identify molecular markers of severity of DFU.

Mulberries is a type of fruit tree that is rich in nutrients and possesses both medicinal and dietary properties, deeply loved by consumers. The fragrance is a significant factor in the sensory quality of mulberries, playing a crucial role in consumer purchasing behavior. 'Baichang' mulberry is a unique variety of mulberry that emits a strong, creamy-like fragrance, which has enormous potential market value. However, the key metabolites and mechanisms responsible for the formation of this fragrance are still unclear. In this study, we utilized GC-MS technology and RNA-seq to examine the Volatile Organic Compounds (VOCs) and gene expression in 'Baichang' (Morus macroura) mulberries and 'Hongchang' (Morus laevigata) mulberries, the latter of which do not have a distinct fragrance. The results showed that 661 volatile metabolites were detected in both mulberry varieties. Most of these were found in higher relative amounts in the 'Baichang' mulberry variety, with 47 types being present only in the 'Baichang' mulberries, suggesting a rich composition of VOCs in the 'Baichang' mulberry. 312 metabolites were identified as differential metabolites; combining the sensory annotation information and relative content of VOCs, 70 candidate VOCs were annotated as related to the formation of 'sweet, waxy, coconut, and oily' sensations. They could potentially be the key metabolites contributing to the unique aroma of 'Baichang' mulberries. The relative odor activity value (rOAV) analysis revealed that 2(3H)-Furanone, 5-hexyldihydro- was the key VOC contributing to the formation of the special aroma of 'Baichang' mulberries. By RNA-seq, 19 key structural genes related to ester synthesis were identified, including AAT , ACX , ALDH, CYP, EHL, FAD, HPL, and LOX. The high expression of these structural genes in the "Baichang" mulberry fruit is the main reason for its unique creamy aroma. This study provides insights into the aroma differences among different kinds of mulberrie.

Strong yet ductile alloys have long been desired for industrial applications to enhance structural reliability. This work produced two (CoCrNi)93.5Al3Ti3C0.5 medium-entropy alloys with exceptional strength-ductility combinations, via short/medium (3 min/30 min)-time annealing after hot-rolling. Three types of intergranular precipitates including MC, M23C6 carbides, and L12 phase were detected in both the samples. Noticeably, the high density of intragranular L12 precipitates were only founded in the medium-time annealed sample but not in another one. Upon inspection of deformed substructure, it was revealed that the plane slip is the dominant deformation mechanism of both the alloys. This is related to the lower stacking fault energy, higher lattice friction induced by C solute, and slip plane softening caused by intragranular dense L12 precipitates. Additionally, we noted that the stacking fault and twinning act as the mediated mechanisms in deformation of the short-time annealed alloy, while only the former in the medium-time annealed one. It is attributed to the higher energy stacking faults and the increased critical twinning stress caused by intragranular dense L12 precipitates that inhibited the twinning tendency. Our present findings provide not only a guidance for optimizing the mechanical properties of high/medium-entropy alloys, but also a fundamental understanding of deformation mechanisms.

In the design of real-world networks, researchers evaluate various structural parameters to assess vulnerability, including connectivity, toughness, and tenacity. Recently, the tightness metric has emerged as a potentially superior vulnerability measure, although many related theorems remain unknown due to its novelty. Harary graphs, known for their maximum connectivity, are an important class of graph models for network design. Prior work has evaluated the vulnerability of three types of Harary graphs using different parameters, but the tightness metric has not been thoroughly explored. This article aims to calculate the tightness values for all three types of Harary graphs. First, it will attempt to calculate the lower bound for the value of the tightness parameter in Harary graphs using existing lemmas and theorems. Then, by presenting new lemmas and theorems, we will try to find the exact value or upper bound for this parameter in Harary graphs. For the first type of Harary graph, the tightness is precisely determined, while for the second and third types, upper bounds are provided due to structural complexity. The lemmas, theorems, and proof methods presented in this research may be used to calculate other graph and network parameters. However, the newness of the tightness parameter means that further research is needed to fully characterize its properties.

Lactococcus lactis is a potential bacterial cell factory to develop delivery systems for vaccines and therapeutic proteins. Large progress has been made in applications using engineered L. lactis against, e.g., inflammatory bowel disease and cervical cancer, but improvement of secretion and cell anchoring efficacy is still desirable. A double-labelling method based on biarsenical hairpin binding and nickel-polyhistidine affinity was used for visualization of protein trafficking and quantification of targeted proteins on the cell surface and in the cytoplasm. To investigate the importance of mature domain targeting signals (MTSs), we generated truncated constructs encoding 126, 66, and 26 amino acid residues from the N-terminus of the basic membrane protein A (BmpA) and fused those with the gene for the human papillomavirus serotype 16 (HPV16) E7 oncoprotein. Overexpression of fusion proteins was observed to come at a cost of cell proliferation. L. lactis cells produced and displayed the shortest fusion protein only with difficulty, suggesting that the entire absence of a homologous sequence containing MTSs significantly impedes export and surface anchoring of fusion proteins. With 40 amino acids following the signal peptide and containing one MTS, effective translocation was possible. Mutations of MTSs towards increased hydrophobicity resulted in an increase of secreted and surface-displayed fusion protein, suggesting the potential to design rationally improved constructs.

Textile heaters are made of knitted conductive yarns integrated into the fabric, making them stretchable, washable, breathable, and suitable for close-to-skin wear. The non-zero resistance in the lead wires, however, causes non-uniform power distribution, presenting a design challenge. To address this, the electrical performance of the heaters is modelled as an n-ladder resistor network. Using the finite difference method, simple, closed-form expressions are derived for networks with the power source connected to input terminals A1B1 and A1Bn, respectively. The results are exact and are used to derive approximations and design criteria. Solutions for ladder networks as presented in this paper apply to a wider class of physical problems, such as irrigation systems, transformer windings, and cooling fins.

The aim of this study was to investigate the differentially expressed genes associated with intramuscular fat deposition in the longissimus dorsi muscle of Xinjiang Brown Bulls. The longissimus dorsi muscles of 42 Xinjiang Brown Bulls were selected under the same feeding conditions. The intramuscular fat content of muscle samples were determined by Soxhlet extraction method, from which 5 samples with high intramuscular fat content (HIMF group) and 5 samples with low intramuscular fat content (LIMF group) were selected. It was found that the intramuscular fat content of HIMF group was 46.054% higher than that of LIMF group. Muscle samples produced by paraffin section for morphological observation. It was found that the fat richness of the HIMF group was better than that of the LIMF group. Transcriptome sequencing technology was used to analyze the gene expression differences of longissimus dorsi muscle. Through in-depth analysis of the longissimus dorsi muscle by transcriptome sequencing technology, we screened a total of 165 differentially expressed genes. The results of Gene Ontology (GO) enrichment analysis showed that the differentially expressed genes in the two groups were mainly clustered in biological pathways related to carbohydrate metabolic processes, redox processes and oxidoreductase activities. Kyoto Encyclopedia of Genes and Genomes (KEGG) enrichment analysis showed that the differentially expressed genes were significantly clustered in 15 metabolic pathways, which mainly covered fatty acid metabolism (related to lipid metabolism and glucose metabolism), pentose phosphate pathway, Peroxisome Proliferator-Activated Receptors (PPAR) signalling pathway and other important metabolic processes. The three genes that were predominantly enriched in the glycolipid metabolic pathway by analysis were SCD5, CPT1C, and FBP2, all of which directly or indirectly affect intramuscular fat deposition. In summary, the present study investigated the differences in gene expression between high and low intramuscular fat content in the longissimus dorsi muscle of Xinjiang Brown Bulls by transcriptome sequencing technology, and revealed the related signalling pathways. Therefore, we hypothesized that SCD5, CPT1C, and FBP2 were the key genes responsible for the significant differences in intramuscular fat content of the longissimus dorsi muscles in a population of Xinjiang Brown Bulls. We expect that these findings will provide fundamental support for subsequent studies exploring key genes affecting fat deposition characteristics in Xinjiang Brown Bulls.

Importance: Neuropsychiatric disorders like schizophrenia and bipolar disorder lack objective diagnostic markers, hindering accurate diagnosis and treatment. A novel approach using patient-derived cerebral organoids and digital analysis of electrophysiological recordings could provide much-needed objective biomarkers.Objective: To develop a digital analysis pipeline that can identify distinct electrophysiological signatures of schizophrenia and bipolar disorder using multi-electrode array recordings from patient-derived cerebral organoids.Design: This was an experimental study using previously published data. The study type can be classified as a case-control study, comparing cerebral organoids and 2D neuronal cultures derived from patients with schizophrenia, bipolar disorder, and healthy controls. The study utilized multi-electrode array recordings for analysis. Setting: The study was conducted in a laboratory setting using previously recorded data. Participants: The study included a total of 24 Caucasian subjects, comprising three groups: patients with schizophrenia, patients with bipolar disorder, and healthy controls. The specific number of participants in each group is not provided. The participant pool consisted of 17 males and 7 females, with an average age of 38.8 years.Main Outcomes and Measures: The primary outcome was the accuracy of a support vector machine classifier in distinguishing between healthy control, schizophrenia, and bipolar disorder samples based on electrophysiological features extracted from the recordings. Key cellular-digital biomarkers were identified using minimum redundancy maximum relevance feature selection.Results: This study included 24 Caucasian subjects (17 males, 7 females; mean age 38.8 years) with schizophrenia (SCZ), bipolar disorder (BPD), and healthy controls. Our Support Vector Machine classifier achieved 95.8% accuracy in distinguishing SCZ from control samples in 2D neuronal cultures under both baseline and post-electrical stimulation (PES) conditions. For cerebral organoids, classification accuracy was 83.3% under baseline conditions, improving to 91.6% under PES when distinguishing between control, SCZ, and BPD samples. Key features for classification included channel-specific measures such as median, covariance, autocorrelation, and kurtosis of neural activity. Confusion matrices visualize classification performance, with most misclassifications occurring in the BPD class under baseline conditions. These results demonstrate that our digital analysis pipeline can effectively distinguish between healthy control and patient-derived samples using electrophysiological features from multi-electrode array recordings, particularly under PES conditions.Conclusions and Relevance: This digital analysis pipeline demonstrates the potential to identify objective electrophysiological signatures of schizophrenia and bipolar disorder using patient-derived cerebral organoids. This approach could lead to improved diagnostic accuracy and personalized treatment strategies for neuropsychiatric disorders.

Within the phenomenology of particle physics, the theoretical model of 4-zero textures is validated using a chi-square criterion that compares experimental data with the computational results of the model. Traditionally, analytical methods that often imply simplifications, combined with computational analysis, have been used to validate texture models. In this paper, we propose a new meta-heuristic variant of the differential evolution algorithm that incorporates aspects of the particle swarm optimization algorithm called "HE-DEPSO" to obtain chi-squared values are less than a bound value, which exhaustive and traditional algorithms cannot obtain. The results show that the proposed algorithm can optimize the chi-square function according to the required criteria. We compare simulated data with experimental data in the allowed search region, thereby validating the 4-zero texture model.

Background/Objectives: This literature review, on occasion of the reported case report, explores the complex interplay between gabapentin (GBP), a gamma-aminobutyric acid (GABA) analog, and the hypothalamic-pituitary-adrenal (HPA) axis in patients undergoing major surgical procedures. It specifically investigates the potential impact of GBP on cortisol levels, stress responses, and infection risk, illustrated by a detailed clinical case. Methods: This review combines a comprehensive literature search with a case report of a 17-year-old male with osteosarcoma who experienced transient adrenal insufficiency and infections while receiving GBP. The case is analyzed in the context of existing literature on GBP and the HPA axis. Results: The findings highlight the intricate relationship between GBP use, adrenal insufficiency, and infection susceptibility. It underscores the need for further research and clinical vigilance when prescribing GBP to patients with underlying medical conditions, particularly in the context of major surgical procedures. The review underscores the need for further research and clinical vigilance when prescribing GBP, particularly in perioperative settings. Conclusions: GBP’s effects on the HPA axis and immune responses are complex and multifaceted. Clinicians should exercise caution when prescribing GBP, especially for patients with underlying conditions undergoing major surgery. Further research is needed to elucidate the mechanisms of GBP's influence on cortisol levels and stress responses.

Despite the potential benefits of generative Artificial Intelligence (genAI), concerns about its psy-chological impact on medical students, especially with regard to job displacement, are apparent. This pilot study, conducted in Jordan during July–August 2024, aimed to examine the specific fears, anxieties, mistrust, and ethical concerns medical students could harbor towards genAI. Using a cross-sectional survey design, data were collected from 164 medical students studying in Jordan across various academic years, employing a structured self-administered questionnaire with an internally consistent FAME scale—representing Fear, Anxiety, Mistrust, and Ethics and comprising 12 items, with three items for each construct. The results indicated variable levels of anxiety towards genAI among the participating medical students: 34.1% reported no anxiety about genAI role in their future careers (n = 56), while 41.5% were slightly anxious (n = 61), 22.0% somewhat anxious (n = 36), and 2.4% extremely anxious (n = 4). Among the FAME constructs, Mistrust was the most agreed upon (mean: 12.35±2.78), followed by Ethics construct (mean: 10.86±2.90), Fear (mean: 9.49±3.53), and Anxiety (mean: 8.91±3.68). Sex, academic level, and Grade Point Average (GPA) did not significantly affect the students’ perceptions of genAI. However, there was a notable direct association between the students’ general anxiety about genAI and elevated scores in the Fear, Anxiety, and Ethics constructs of the FAME scale. Prior exposure to genAI and its previous use did not significantly modify the scores of the FAME scale. These findings highlighted the critical need for refined educational strategies to address the integration of genAI in medical training. The results demonstrated a pervasive anxiety, fear, mistrust, and ethical concerns among medical students regarding the deployment of genAI in healthcare, indicating the necessity for curriculum modifi-cations that focus specifically on these areas. Interventions should be tailored to increase genAI familiarity and competency, which would alleviate apprehension and equip future physicians to engage with this inevitable technology effectively. The study also highlighted the importance of incorporating ethical discussions into medical courses to address mistrust and concerns about the human-centered aspects of genAI. Conclusively, the study calls for a proactive evolution of medical education to prepare students for AI-driven healthcare practices shortly to ensure that physicians are well-prepared, confident, and ethically informed in their professional interactions with genAI technologies.

Renal replacement therapy (RRT), widely used in the treatment of renal injury in the course of sepsis, aims to eliminate the toxins and proinflammatory cytokines, involved in the pathomechanism underlying septic shock. Dialysis filters characterised by a high adsorption potential for cytokines in RRT when septic renal injury is the case. It is of key importance in the antibiotics treatment of sepsis to achieve desired values of PK/PD indices. Continuous renal replacement therapy (CRRT) may affect antimicrobial clearance, increasing their elimination in some cases. The aim of this study was to determine the degree of adsorption for linezolid, on three different types of filters used in CRRT. In our in vitro study a continuous veno-venous hemofiltration (CVVH) was conducted using 3 types of filters: polysulfone (PS), polyethyleneimine-treated polyacrylonitrile (PAN PEI) and non-PEI-treated polyacrylonitrile (PAN) filters. Each type of filter was used in 3 CVVH cycles, involving the use of 600 mg of linezolid dissolved in 700 ml of bovine blood or in 700 ml of 0.9% NaCl. In each case the total volume of the obtained solution was 1000 ml. Blood samples, at particular time points, were collected in order to measure drug concentration. The differences in mean drug/NaCl adsorption and drug/ blood adsorption were determined using one-way ANOVA with multiple comparisons by Tukey post-hoc test. A p-value of < 0.05 was considered to be significant. A significant adsorption of linezolid was found for PAN PEI filter, both in samples obtained from bovine blood and 0.9% NaCl solutions, at the endpoint. No significant adsorption was demonstrated on PAN or PS filters. There is a need for in vivo research to confirm the effect of filter type on linezolid concentration in patients undergoing CRRT.

Titanium alloys, notably Ti6Al4V, are frequently employed in biomedical applications due to their high mechanical strength and biocompatibility. But improving their surface qualities like biocompatibility and resistance to corrosion remains a crucial topic of study. This study investigates the effects of rhenium-carbon coatings deposited on Ti6Al4V substrates using magnetron sputtering technique with a molybdenum anchoring layer. Despite successful formation of rhenium carbides, elemental rhenium, and rhenium oxides confirmed by EDS and XRD analysis, the coatings exhibited poor adhesion, resulting in significant delamination as observed in SEM images. Corrosion resistance tests revealed that the coatings adversely affected the Ti6Al4V substrate, as indicated by increased corrosion current densities and more negative corrosion potentials in potentiodynamic polarization tests. Biocompatibility assessments using PK15 cells showed a notable reduction in cell viability and metabolic activity, particularly with coatings of higher surface roughness. These findings underscore the need for improved surface preparation and coating processes to enhance adhesion and biocompatibility of rhenium-carbon coatings on Ti6Al4V substrates. Future research should focus on optimizing coating adhesion, investigating cytotoxicity mechanisms related to surface roughness, and expanding biocompatibility evaluations to various cell types and biological environments.

Ischemic stroke is a leading cause of mortality worldwide, and intravenous thrombo-lysis, while improving functional outcomes, still leaves a significant mortality rate. This study aimed to investigate the clinical and pathological data of thrombolysed stroke patients who subsequently died and underwent autopsy, focusing on hemorrhagic transformation (HT). Over a 10-year period, 1426 acute ischemic stroke patients re-ceived thrombolysis at our center, with an in-hospital mortality rate of 11.7%. Autop-sies were performed on 98 of the 167 deceased patients. HT was found in 47% of these cases, only less than half occurring within a day of thrombolysis. Significant inde-pendent predictors of HT included higher lactate dehydrogenase (LD) levels and higher INR values at admission. HT directly caused death in 30% of cases, often through herniation, while other complications (pulmonary embolism, pneumonia) were also common. These findings underscore the importance of postmortem investi-gations to accurately determine the incidence of HT and contributing factors. Our data indicate that in the vast majority of HT cases, the role of contributing factors other than rt-PA may be important. Of the routinely assessed clinical and laboratory parameters at admission only LD and INR were found to be independent predictors of HT in the autopsied studied cohort.

Introduction: The COVID-19 pandemic highlighted the necessity for rapid, efficient testing at large-scale events. Developing rapid and efficient testing methods was critical, especially for events with a high risk of virus spread. The queueing theory offers a powerful tool to manage the flow of people through testing centers. This study uses the M/M/c model to examine how different floor plan configurations impact the efficiency of RADT testing centers. Aim of the study: This research applies queueing theory to optimize the Rapid Antigen Diagnostic Test (RADT) processes at mass gatherings. The study uses the M/M/c queueing model to evaluate the dynamics of RADT centers configured in U-shaped and straight-line layouts. The primary goal is to assess the feasibility of using RADTs efficiently at events and mass gathering entrances, aiming to enhance throughput and minimize wait times. Methodology: The study involved 500 healthy participants, managed by medical staff across a U-shaped and a straight floor plans. Agile management techniques were employed to enhance operational efficiency. The process stages included queue number issuance, registration, sample collection, sample mixing, and results dissemination. Results: Both floor plans enabled the completion of RADT screening in approximately 2 minutes per participant. The U-shaped layout slightly outperformed the straight-line setup in efficiency, demonstrating its effectiveness in optimizing the testing process. Conclusion: This study confirms the feasibility of implementing Rapid Antigen Diagnostic Test (RADT) processes at mass gatherings. It was found that the U-shaped floor plan configuration is particularly effective, indicating its potential suitability for future mass testing scenarios.