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

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.

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.

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

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.

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.

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.

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.

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.

The Jakarta LARP community, established in March 2020 and primarily active in Gelora Bung Karno, fosters inclusivity, diversity, and physical role-playing activities. It adheres to a policy of excluding ultra-nationalist ideologies and integrates new members despite language barriers. Bruhn (2011) defines this kind of community sharing the same goals, values, and lifestyles, while McMillan & Chavis (1986) outline four aspects of the sense of community.The research discovered that communities endure by utilizing solidarity built on the basis of their peculiarities. This study employed ethnographic methods alongside grounded research to identify the community's culture and their efforts to sustain and utilize it as community solidarity.

Aiming at the limitations of single-functionality, limited applicability, and complex designs prevalent in current metasurfaces, we propose a terahertz multifunctional and multiband tunable metasurface utilizing a VO2-metal hybrid structure. This metasurface structure comprises a top VO2-metal resonance layer, a middle polyimide dielectric layer, and a gold film reflective layer at the bottom. This metasurface exhibits multifunctionality, operating independently of polarization and incident angle. The varying conductivity states of the VO2 layers, enable the metasurface to achieve various terahertz functionalities, including single-band absorption, broadband THz absorption, and multiband perfect polarization conversion for linear (LP) and circularly polarized (CP) incident waves. Finally, we believe that the functional adaptability of the proposed metasurface expands the repertoire of options available for future terahertz device designs.

Additive manufacturing (AM) has revolutionized the field of biopolymers by providing a range of opportunities to create complex and intricate structures. Here we provide an overview of developments in biopolymer AM, first in the context of how natural systems have impacted the synthetic processes of AM, and secondly in the context of how synthetically derived structures can be used for biomedical applications. In particular, we explore the range of biopolymers developed for AM, AM techniques for biopolymers, and potential biocompatible medical applications with a focus on four categories of tissue in the human body: skin, bone, heart, and nerve. Despite the current challenges of the technology, exciting results in tissue regeneration, synthetic replacements for natural grafts, and complex dynamic organoids have already come to pass - with many more possible in the future.

In this article, we present two topics related to mathematical economics. We offer an intriguing proposal for securing cost and production functions in the face of uncertainty and risk. We discuss the relationship between individual and social preferences. This is important because traditional revealed preference theory does not account for such factors.

This article argues that philosophy and its influential narrative should take and think "food" - the gastro-world - in order to radically renew itself and develop a gastrocentric view of the world and the future of humanity. It discusses first some of the basic ideas of a gastrocentric understanding of the world, second the adventure of becoming a Terran, and third the daily practice of what I will call "terra madre forming". It tells us this: If there is to be a future of human survival and well-being on Earth, if we are to achieve the goals of sustainable development, then we have a clear agenda for tomorrow with the re-humidification of the soil - madre terra - that nourishes us. What needs to be done is quite simple and down-to-earth: We, each of us, if possible, must participate in the regeneration of the earth. In conclusion, it is time for the Slow Food movement to blossom into a geo-gastro-activism. The future task of this organization is to make itself electable as a political party to support the much-needed transformation of humans into Terrans.

In this paper, we propose an assumption of which the relation between electron and phonon is discussed and investigated based on the experiment of γ photon and electric interconverting with each other. We calculated the charge of a particular standing wave topology with Maxwell’s equation rotated in accordance space with the SO3 transformation. The derived charge value is 1.6035 × 10E−19C around 0.0826% different from the experimental data, indicating the proposal is a promising theory to explain the origin of charge and spin of electron particle. Electron spin angular momentum comes from the orbital angular momentum of photon rotation (electromagnetic field rotation), and electron charge comes from photon, that is, the space-time rotation effect of electromagnetic wave.

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

Background: Acute kidney disease (AKD) is a known risk factor for increased mortality and evolution towards chronic kidney disease (CKD) in adults. The data regarding children are scarce. The purpose of our study is to explore the risk factor for AKD and impact of AKD following an acute kidney injury (AKI) episode in children on mortality and new-onset CKD. Methods: We retrospectively evaluated 736 children with ages between 2 and 18 years old with AKI admitted in a tertiary care hospital from the west Romania over a 9 years period. Results: AKD incidence following AKI was 17%. Patients that developed AKD were older, with higher baseline serum creatinine values, urea, C reactive protein and lower proteins, haemoglobin and sodium. They were more often exposed to sepsis, critical illness and nephrotoxic medications and presented certain susceptibilities like CKD, neoplasia, anemia, heart failure, arterial hypertension, stem cell transplant and female gender. AKI causes that increased the risk of AKD were intrinsic ones. AKD increased the overall mortality by three times. The factors that independently increased the risk of evolution towards CKD were AKD, acute tubular necrosis and higher baseline serum creatinine values. Conclusions: AKD is an independent risk factor for mortality and new-onset CKD in children.

This study investigates the pivotal areas where Artificial Intelligence (AI) integration in healthcare warrants further exploration, leveraging insights from Boston Specialists, a forefront healthcare provider in AI adoption. Employing a qualitative case study approach, enriched by in-depth interviews and comprehensive literature reviews, we identify three main domains for potential AI expansion: scheduling efficiency, clinical documentation, and AI-driven medical research. Our results underscore the substantial enhancements AI brings to operational workflows and patient care, notably through improved scheduling systems, accuracy in medical documentation, and the facilitation of data-driven research methodologies. These findings suggest a critical need for healthcare institutions to further invest in AI technologies, focusing on these key areas to harness AI's full potential in personalizing care, optimizing efficiency, and advancing medical knowledge. The study concludes with a call for continued investigation into AI's integration within healthcare settings, emphasizing the importance of a supportive organizational infrastructure, ethical considerations, and data security in realizing AI's transformative impact on healthcare delivery and patient outcomes.

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 paper we investigate some properties of square-free numbers. In particular, we study a function that counts the number of square-free numbers no larger than the given number n. We show that this function has asymptotics consistent with the predictions of the Riemann hypothesis and use this to obtain new and better estimates of the density of square-free numbers. Finally, we present a well-known generalization of the concept of a square-free number to monoids and research on square-free factorizations.

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.

Cosmetic surgery is the subfield of plastic surgery that enhances appearance mainly for aesthetic reasons. Currently, cosmetic surgery interventions are highly considered appealing and popular all around the world. Several factors have contributed in this rapidly evolving field such as scientific and economic development, breaking down barriers and cultural norms, globalization, social media and mental disorders. Nowadays, the morality of cosmetic surgery is facing many dilemmas due to its benefits and drawbacks. It is proven that the advantages of cosmetic surgery include improved body confidence, mental health, and function. Additionally, aesthetic corrections can upscale the quality of life and create career opportunities for special targeted groups. Also, cosmetic surgery has a major impact in gender affirmation procedures. Although, herein we also describe the disadvantages of this widely developing field such as minor and major medical complications, potential postoperative risks and addiction in plastic surgeries associated with damaging economic issues. Lack in self-confidence, altered mental health status and ethical crisis consist another negative aspects of aesthetic surgery’s impact.

The use of credit cards and online banking is expanding exponentially. As more individuals use debit cards, credit cards, and internet banking, the likelihood of falling victim to various forms of fraud also rises. Due to ignorance, credit card company customers have provided their card details, personal information, and one-time password to an unknown bogus caller on several occasions in the recent past. One of the biggest issues facing financial institutions and customers alike is credit card theft. It may result in large financial losses and harm to the financial institution's image. While there are several ways to identify credit card fraud, one of the best is machine learning.By using past data, machine learning algorithms may be trained to recognize trends and abnormalities that point to fraud. The state-of-the-art in machine learning for credit card fraud detection is reviewed in this study. Numerous research on the same subject have been conducted in the past with a variety of well-known machine-learning techniques. However, with a grasp of the notion of hybrid machine learning, we will now examine how well hybrid machine learning performs on the same problem statement.

Visualising textual content could be helpful to professionals as well as amateurs across several fields. However, training a text-to-image generator in the mainstream domain requires large amounts of paired text-image and data, which is too expensive to collect since labeling millions of images and videos can be tiresome. GANs like StackGAN and StyleGAN can be considered as solutions to generate images from text. But the images generated may be of low accuracy and resolution, and the entire processing can be highly time-consuming. Moreover, image generation is a notion that is still being researched. Hence, the process of developing a Video Generation model necessitates substantial research. Despite the need for such a model, modern technology has lagged behind the solutions to this problem. This proposal suggests combining two methods, Text modification for Action Definition (TexAD) and SeQuential Image Generation for Video Synthesis (SQIGen). The proposed solution synthesises a sequence of images from textual information feeds and combines these images to create a video. TexAD uses Natural Language Processing and Deep Learning techniques to process, classify and modify text data. SQIGen is an extension of the VQGAN+CLIP neural network architecture that generates a sequence of images from the modified text data

Large Language Models (LLMs) have proved significant proficiency when comes to code generation especially in Structured Query Language (SQL) for databases and recent successful Text-to-SQL method involves fine-tuning pre-trained LLMs for SQL generation tasks. Transforming natural language text into SQL queries, has been attempted to solve with various learning techniques including Few-shot learning[1], fine tuning. In this paper we propose Supervised fine-tuning (SFT) as a better alternative for learning technique for text-to-SQL generation task using Code-Llama that pushes state of art accuracy on spider test suite to 89.6% on dev set which represent first instance of surpassing the earlier best-in-class with 5.5% higher score and 86.8% of exact match accuracy on dev set. Furthermore, we demonstrate that properly prompted LLM along with SFT provides far fewer hallucinations and much more robust LLM that can be used as a general tool for any text-to-SQL generation use case.

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.

Various authors have highlighted the importance of marriage as a social marker that alter the so-cial categorization of individuals and their relationships from youth to adulthood according to the cultural construction of the life course in Arab countries. This article aims to analyze the in-teraction between the socio-political framework (structure) and the capacity for individual action (agency) in the context of biographical experiences to achieve emancipation in Morocco. This per-spective responds to the demand of different authors to include the subjective approaches of young people in the process of analysis. This analysis will be guided by some questions: Which is the capacity of young Arabs to decide the orientation of their life trajectories? What factors (cultural, family, socioeconomic, educational, etc.) create and shape the expectations of young people re-garding their transition to adult life? Is there a specific model of emancipation in the Arab Medi-terranean countries?

This study aims to examine the non-volatile Particle Number (PN) emissions of a retrofitted Heavy-Duty Spark-Ignition (HD-SI) engine powered by liquefied petroleum gas (LPG) under both steady-state and transient conditions. The engine was tested under seven steady-state operating points to investigate the PN behavior and Particle Size Distribution (PSD) upstream and down-stream of the Three-Way Catalyst (TWC). This analysis intends to assess the impact of including particles with diameters ranging from 10 nm to 23 nm in the total particle count, a consideration for future regulations. The study employed the World Harmonized Transient Cycle (WHTC) for transient conditions to encompass the same engine working region used in the steady-state analysis. A Dekati FPS-4000 diluted the exhaust sample to measure the PSD and PN for particle diameters between 5.6 nm and 560 nm using the TSI-Engine Exhaust Particle Sizer (EEPS) 3090. Findings indicate that PN levels tend to increase downstream of the TWC under steady-state conditions in operating points with low exhaust gas temperatures and flows (equal to or less than 500 °C and 120 kg/h). Furthermore, the inclusion of particles with diameters between 10 nm and 23 nm leads to an increase in PN emissions by 17.70% to 40.84% under steady conditions and by an average of 40.06% under transient conditions, compared to measurements that only consider particles larger than 23 nm. Notably, in transient conditions, most PN emissions occur during the final 600 seconds of the cycle, linked to the most intense phase of the WHTC.

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.

Price markups and firm Tobin’s Q ratios are widely believed to have been increasing in the past several decades. Various models for the calculation of price markups have been developed, but each have methodological drawbacks and some results are poorly reflective of the near past wider macroeconomic experience. This paper defines an approach for the definition and measurement of markup pricing using the measure of Economic Rent and The Capital Asset Pricing Model. The results show limited markup pricing for The UK’s FTSE 100 companies (2018-2023), but that that certain Real Estate, Technology/Media and Financial Services/Equity Investment firms have enjoyed higher price markup levels. An analysis of the business models of these firms is used to qualitatively propose explanations for such markups. Finally, this work offers a formal proof that that expected price markup is equal to Tobin’s Q and finds that the empiric market level of markup is near equivalent to the market Tobin’s Q; differences between the markup and Tobin’s Q at the level of the firm are equally assessed.

This study investigated the relationship between aluminum adjuvant vaccines and the prevalence of 4 childhood diseases (Autism, Allergies, Asthma, ADD/ADHD) using data from the 2020-2021 National Survey of Children's Health (NSCH) [1] and the Centers for Disease Control National Immunization Survey (CDC NIS) [2]. The study found an association with aluminum adjuvant dosage and the prevalence of each disease studied (Autism, Allergies, Asthma, ADD/ADHD) through a weighted regression analysis of disease prevalence against the summed likelihood of aluminum adjuvant vaccine uptake.

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.

Models of quantum measurements are presented, including observers subject to the laws of quantum mechanics. Observers perform multiple measurements in an attempt to disprove the collapse hypothesis. It is shown that under reasonable assumptions the effort cannot succeed. Under a unitary evolution the end state is a correlation between the result of the first measurement and the result(s) of the others, consistent with the observer's collapse hypothesis. The observer may conclude that the laws of nature include a non-unitary collapse mechanism, even if one does not actually exist. Discard of information is the crucial factor which distinguishes entanglement from measurement.

Abstract: Fetal Alcohol Spectrum Disorder (FASD) is considered a lifelong disability that has been framed by neurobiological descriptions focused on the brain. These are important features but fail to tell the story of living with FASD. By surveying those with FASD, this work expands upon prior survey work which illustrated a multitude of early onset physiological issues occurring at rates much higher than typical of the general population. The current project, again using an anonymous survey methodology, seeks to open up other direct experiences to better understand the complexity of living with FASD. An anonymous online survey was used to gather data on advresity in childhood, schooling, employment, housing and finances, involvement with the criminal justice system as well as relationships and parenting. Results inform how supports can be enhanced and targeted with a goal of improving the quality of life. The survey was developed by adults living with FASD who have served as a long-standing advocacy and educational group influencing policy and practice in the field.

New information suggests female autistic spectrum disorder (ASD) is much more common than previously thought, with a likely prevalence of 6% and with 80% undiagnosed at the age of 18. ASD then becomes a common comorbidity of female mental illness with nearly one in five women who develop a mental illness being autistic. ASD has heretofore been regarded as a pediatric condition and though now thought to be life long it is still not well recognized by adult health services. Most mental illness first presents in the teens and early twenties. Comorbid ASD is more difficult to diagnose due to diagnostic overshadowing, and ASD comorbidity maks the mental illness more severe and mor difficult to treat. Recognized ASD is readily treatable with an approach sympathetic to neurodiversity. Improving the pathway from adolescence to adulthood by increasing knowledge of autism in adult health services would dramatically improve female mental health at surprisingly little extra cost. It is low hanging fruit in a very fraught area of healthcare. This paper will examine the extent of the problem. It will explore solutions and quantify the gains of appropriate therapy.

The ANSYS 2024R1 student edition was used to create a finite element model of a basketball rim and backboard. This finite element model included the use of steel for the rim and its mount, a tempered glass backboard, and an aluminum frame behind the backboard. After a mesh was created, fixed support boundary conditions were applied to the four corners of the aluminum frame. The subsequently calculated mode shapes and frequencies were compared to empirical modal analysis previously done at the United States Military Academy at West Point, New York. Four mode shapes and frequencies agreed rather well between the theoretical finite element analysis and previously published empirical modal analysis, specifically where the rim was vibrating in the vertical direction, which was the direction that the accelerometer was aligned for modal analysis. However, three mode shapes missed by the empirical modal analysis were found where the vibration of the rim was confined to the horizontal plane, which was orthogonal to the orientation of our accelerometer.

Throughout this paper the effects of injuries on athletes are highlighted in different aspects. Exertional compartment syndrome is a specific injury related to athletes that is thoroughly explored in this paper through an analysis of the anatomy, symptoms, diagnosis and treatments of the syndrome. Exertional compartment syndrome is an exercise-induced muscle and nerve condition that causes pain, swelling as well as disability in the affected muscles of the lower leg. This syndrome commonly develops in young athletes involved in sports with excessive running and repetitive impact such as track and field, soccer, basketball and lacrosse. Exertional compartment syndrome is commonly misdiagnosed as other less severe injuries such as shin splints, which is symptomatic of pain along the tibia bone of the lower leg caused by overuse. The misdiagnosis of exertional compartment syndrome allows the syndrome to worsen and intensify resulting in the only effective treatment to be fasciotomy, a surgical procedure to release the pressure within the compartment of the lower leg. There is no definitive protocol developed for patients after fasciotomy is performed. Athletes experiencing similar symptoms after surgery are usually treated for their symptoms rather than the syndrome as a whole, which does not have a high degree of success. The development of a definitive protocol utilizing the techniques of manual therapy, mobility stretching and corrective strength training can improve the adverse effects of exertional compartment syndrome as well as restore functionality to the athlete. Raising awareness of this syndrome in athletics will be effective in treating the athlete early on in order to avoid severe effects and invasive procedures.

Abstract. The remarks by the Supreme Leader of the Islamic Revolution on the toll of the famines that afflicted occupied Iran in World War I and World War II indicate a desire to incorporate these calamities in Iran’s national narrative and collective memory. His criticism of famine historiography and stated toll numbers, and the unfolding catastrophic famine in Gaza, justify and necessitate a fresh look at each famine’s historiography and toll. This article re-estimates the toll of each famine by including many overlooked and neglected primary sources and in ways not previously done. It builds a trajectory of Iran’s demographic development from 1810 to 1944, and derives the toll of each famine. The World War II famine and typhus epidemics had claimed 5.5 million. World War I famine was also more deadly, though the 1869-73 famine was not far behind. At least 15.5 million Iranians died in the two world wars, a fact nowhere reflected in the history of the conflicts. Iran’s 1944 population of 12 million was unchanged from that of 1850 and a century of population growth obliterated

Theoretical physics addresses the fundamental principles of nature and the mysteries of the universe. In the last century, the theory of relativity challenged people's understanding of time and space, while quantum mechanics revealed various forms of energy. However, the concept of gravity remains elusive. All matter in the universe is composed of energy that can be converted into other forms, yet it is always conserved. However, achieving a state of equilibrium, represented by the equal sign, can be challenging to achieve on both macro and quantum scales. A phenomenon that can transition from one state to infinity is called collision and is essential for understanding natural phenomena and physical processes throughout the universe. In the study of general relativity cannot be three-dimensional problems to gain mathematical inspiration, understand the application of new dimensions. Here, we elucidate the nature of gravity, which inspires the solution of the Riemann hypothesis. Our results show that the conduction mode of dimensional energy is defined by Euler's formula.

This article analyzes local level normative regulations aimed at directly or indirectly conserving the urban landscape in rural areas. Using a discursive analysis methodology on regulatory documents being enforced in a series of localities assigned to a tourism promotion program, evidence suggests that promotional activity retroactively influences the phraseology of these municipal regulations. The results obtained point to the existence of perpetuating historicist approaches within the current regulations, which appear to largely derive from the search for success in the tourism market and the resulting benefits to the local economy.

The motivation for investigating the issues presented in this article stemmed from a need to understand better the relationship in long-established physics formulas and extract the information they provided using conventional methods. Based on the definition of magnetic flux quantization, which is based on a combination of fundamental physical constants, the Planck constant, and the particle’s elementary charge, this work explores the results that arise when this equation is combined with the equation of the Bohr-level electrostatic force acting on the electron, which leads to a new mathematical relationship between the combined expressions. The new relationship yields novel theoretical findings related to the known universal constants. Following this insight, the formalism developed in this paper indicates that the mass of the electron and other subatomic particles is associated with the magnitude of the square of the magnetic flux quantum, which makes up the particle. This conclusion is not as strange as it may seem, as the square of the magnetic flux quantum appears in the context of magnetic energy in a current loop and, according to Einstein’s special theory of relativity, energy is equivalent to mass. Another aspect described at the end of this paper demonstrates the connection between the square of the magnetic flux quantum through the Bohr radius and the significance of the wave function in the atom. The theoretical results are in full accordance with experimental results published by NIST CODATA 2018 that I’ve used, which validates the existence of the relationship.

A proof is given showing the Collatz Conjecture is true for all positive integers. The proof was possible once the perspective of the proof was changed from looking at the pattern of the positive integers to looking at the conjecture rules. The conjecture rule for even numbers organizes all positive integers into unique sets and the rule for odd numbers interconnects the unique sets into dendritic pathways to “1.” Infinite loops, other than the minor 4-2-1 loop after reaching “1,” and pathways to infinity are shown to be mathematically impossible. The proof predicted a general equation that shows all positive integers ultimately reach a final value of “1," and calculates the values and locations of the odd positive integers during the iterations for each tested positive integer.

This article begins with exploring fundamental limits in the universe. It examines key principles, such as the uniformity of physical laws and Energy conservation, that lead to the principles of maximum speed, locality, and maximum density. These universal limits govern physical phenomena, culminating in very interesting results.They led to the exploration of Quantum black holes. Quantum black holes are relativistically revolving miniature charged black holes consisting of a single core at the highest possible density. They are the only structures small enough to keep all charges quantized (including gravitational charges). I then demonstrated that quarks and leptons comprise smaller entities - the Quantum Black Holes. Exploring these elementary particles reveals that they release their Energy outward, altering the curvature of nearby space-time and providing new insights. We can characterize movements and processes in local space-time with four sets of equations representing the four charge types and one set representing Dark Matter. By the end of the article, I prove that Quantum black holes explain the quantization of gravity, the nature of Luminous and dark Matter, the Mass, size, and (quantized) charges quantities of elementary particles and the nature of neutrino oscillations.

It is proved that there exist two odd prime numbers, p_i and p_j , such that p_i + p_j = 2r + 2(r ⩾ 2), where p_n denote the n-th odd prime number, 1 ⩽ i, j ⩽ n. By the theory of generating functions, we prove that there exist two positive integers, h_i and h_j , such that h_i + h_j = r(r ⩾ 2), where h_n = (p_n − 1)/2，(p_n ⩾ 3).Then we complete the proof.

DNA damage causes the mutations that are the principal source of genetic variation. DNA damage detection and repair mechanisms therefore play a determining role in generating the genetic diversity on which natural selection acts. Speciation, it is commonly assumed, occurs at a rate set by the level of standing allelic diversity in a population. The process of speciation is driven by a combination of two evolutionary forces: genetic drift and ecological selection. Genetic drift takes place under conditions of relaxed selection, and results in a balance between rates of mutation and rates of genetic substitution. These two processes, drift and selection, are necessarily mediated by a variety of mechanisms guaranteeing genome stability in any given species. One of the outstanding questions in evolutionary biology concerns the origin of the widely varying phylogenetic distribution of biodiversity across the tree of life, and how the forces of drift and selection contribute to shaping that distribution. The following examines some of the molecular mechanisms underlying genome stability and the adaptive radiations that are associated with biodiversity and the widely varying species richness and evenness in the different eukaryotic lineages.

The theories of Evolution and Big Bang have brought a major impact upon the scientific and societal perception upon the origins, abilities and roles of mankind on Earth. It is conclusively evident that Mother Nature and the physical realm is autonomous and all phenomena in the world occur without an imposition against the “free will” of such events and patterns. Nevertheless, this extent of freedom does not imply that life on Earth represents an accident and has no purpose. By careful analysis of ancient religious texts, it can be suggested even otherwise, that it is especially free will that is offered as a gift from outside of the physical dimensions of existence, with the purpose of a continuous edification and improvement of the overall life conditions and of the human perception. It may be that the multi-generational focus on improvement and progress have been misattributed as a long-term evolution of species, that humans came from animal ancestors and that there is a blurred line associating humans with animals. Furthermore, it may be that scientists based their suggestions that no outside Creator would have brought the Earth into existence on physical perspectives, when the extra-dimensional process of Creation implies that all elements of the physical existence undergo a process of Creation from the outside, where time, space and physical matter do not exist, in spite of such elements possibly reflecting unseen elements of the meta-physical world. Finally, there is the following example that deserves attention within the scientific community; just because all living cells - human, animal and plant - contain DNA chromosomes, ribosomes, mitochondria and a plasma membrane, it does not indicate that humans are animals, just as this does not indicate that plants are animals. In Science, there is a golden statement, that correlation does not imply causation. This example is in complete agreement with the verses of the Book of Genesis in the Holy Scriptures regarding the origins of life; namely, that animals could have been created by an Author of all life on Earth so that man would experience companionship. Another major accordance with the teachings of the Holy Scriptures is the fact that life emerged from the water, and not from the soil, although the soil constituted the second principal means of the commencement and extension of life. Namely, after life first emerged in the seas and the oceans from bacteria, a few bacteria were passed from the marine water into the nearby soil on islands and surrounding land through the circulatory air above the sea level. Afterward, the first life forms emerged from the soil, via the transferred bacteria. Eastern Orthodox Christianity regards water as the principal environment of both physical and spiritual birth. Overall, an improved scientific perception of the timeline of life on Earth may be reached via an approach that combines molecular biology with quantum physics, given that the three layers of Science - Biology, Chemistry and Physics - together with their foundational layer of Mathematics, are in fact situated in a relationship of complete harmony.

The Lorentz boost and rapidity for a radially falling frame are derived for the Schwarzschild metric in Kruskal-Szekeres coordinates. It is found through this analysis that the spacetime is radially length contracted toward the metric source in the falling frame as a result of the Lorentz boosting relative to the rest frame (which is shown to be consistent with the rest frame). When the falling frame reaches the event horizon, the Lorentz boost goes to infinity, causing the falling frame to become light-like, but trapped at the horizon. It is shown that in the falling frame at the horizon, the density of the source goes to infinity as a result of the length contraction.

Abraham’s sending forth of Hagar and Ishmael in Gen 21:14 has generally been viewed as an expulsion. It is held that the primary, if not sole, purpose behind this act was to prevent Ishmael from interfering with Isaac’s inheritance. Using an intertextual approach, with an emphasis on key words, Sarah’s גרש (gāreš) demand and Abraham’s שלח (šellach) of Hagar is compared with the narratives of the children of Israel, Jesus, and Adam to uncover objectives as the bestowal of freedom and a mission. An examination of how the LXX translates, and Josephus explains, Sarah and Abraham’s “send-off” of Hagar suggests a mission objective behind their intentions. Abraham’s motivations are analyzed to ascertain whether Hagar’s “send-off” was part of a plan to expand the reach of Abraham and Sarah’s faith-based operations. Finally, linguistic analysis is undertaken to discover possible motives for why Sarah chose Hagar to have a son. These approaches to the biblical story bring into focus a portrait that is radically different from the standard interpretation where there are multiple objectives of Hagar and Ishmael’s being sent into the wilderness primary among them being expanding Abraham and Sarah’s faith-based mission.

A new approach was presented in this study to simulate a stable atom along with subatomic particles in it. Subatomic particles in an atom are treated as conventional particles, exhibiting attraction and repulsion between them, giving a stable atom simulation. This new approach leads to developing new potentials for subatomic particles to simulate a stable atom. Subatomic particle dynamics (SPD) simulations were developed for within-atom simulations that give a stable atom structure for infinite time and provide many insights into electron trajectories and atom properties like energies and radius of the atom. The effect of protons and neutrons movement in the nucleus on electron trajectories was captured in SPD. Hydrogen and Carbon atom SPD were reported in this study. The Pilot-wave theory was implemented in this study to simulate the wave nature of subatomic particles in an atom. Electrons motion was guided by the interference pattern produced by the electron’s aether medium waves in SPD. SPD was implemented on molecules, resulting in a stable molecular structure giving insights into electron trajectories shared by multiple atoms.

This article introduces the Theory of Inverse Discrete Dynamical Systems (TIDDS), a novel methodology for modeling and analyzing discrete dynamical systems via inverse algebraic models. Key concepts such as inverse modeling, structural analysis of inverse algebraic trees, and the establishment of topological equivalences for property transfer between a system and its inverse are elucidated. Central theorems on homeomorphic invariance and topological transport validate the transfer of cardinal attributes between dynamic representations, offering a fresh perspective on complex system analysis. A significant application presented is an alternative proof of the Collatz Conjecture, achieved by constructing an associated inverse model and leveraging analytical property transfers within the inverted tree structure. This work not only demonstrates the theory's capability to address and solve open problems in discrete dynamics but also suggests vast implications for expanding our understanding of such systems

This article proposes an interferometer which should in principle split further an initially split beam to yield new sets of beams, effectively multiplying the number of beams that can be subjected to detectable interference. It can be considered a modification to the Michelson interferometer that introduces additional arrays of beam splitters, mirrors and detectors. It is expected of the interferometer to provide us with a set or sets of data holding details of phase changes in multiple interference patterns detectable by multiple detectors, enabling comparative analysis of data for multiple interference patterns recorded from a single measurement or activity. The number of multiplied beams possible is not limited, as it only depends on the specific amount of beam splitters required for certain experiments and practicals. The interference of multiple beams may improve sensitivity and detection for instrumentation purposes. The use of multiplied beam interferometry may also extend to quantum computation, particularly in linear optical quantum computation scheme as it enable production of multiple coherent beams which may exhibit properties of entanglement, making it suitable for developing optical multi-qubit systems.

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.

Objectives to assess COVID-19 mortality rates per country population. To determine what if any independent country-specific variables from 9 different databases were correlated. Design population based retrospective cohort study. Setting analysis of global COVID-19 treatment and containment strategies using data from 9 worldwide websites. Participants 108 countries worldwide. Interventions none. Main Outcome Measures were COVID-19 death rates per country population analyzed by univariate and multivariate analysis. The main outcome parameters were to determine if there are any correlations between the percentage of countrywide COVID-19 deaths/population by the countries’ percent vaccinated. Secondary outcome measures include the effect of other independent variables on COVID-19 death rates per country population including: health expenditures per capita, annual income per capita, COVID-19 tests per 1000 people, stringency index (a measure of each countries containment strategies), hydroxychloroquine score (a measure of each countries use), ivermectin score (a measure of each countries use), hypertension, obesity, diabetes, and specific countries and geographic locations. Results COVID-19 vaccination rates ranged from 0-99% in 108 countries. Univariate analysis demonstrates the following independent variables to correlate with COVID-19 deaths/population (correlation coefficient, p value): countrywide COVID-19 vaccination rates (+0.2936, p=0.002); healthcare costs per capita (+0.3212, p=0.0007), income per capita (+0.3051, p=0.0013), COVID-19 tests per 1000 population (+0.6981 p=0.0307); stringency index (+0.3098, p=0.0011); hydroxychloroquine index (-0.1337, p=0.0678); and ivermectin index (-0.1383, p=0.1535). Conclusions Increasing rates of COVID-19 vaccination are associated with increase COVID-19 death rates per country population (p=0.002). Other variables associated include healthcare costs per capita (+0.3212, p=0.0007), income per capita (+0.3051, p=0.0013), COVID-19 tests per 1000 population (+0.6981 p=0.0307); and stringency index (+0.3098, p=0.0011).

This article discusses how, in today’s world of disruptive and dramatic social change (DSC), non-sports related coaching, which includes a wide range of services such as life coaching, career coaching, executive coaching, and team coaching, can inadvertently fuel undesirable social dynamics. There is little or no awareness of this risk among coaches and coachees. The global, fast-growing, multi-billion-dollar industry aimed at supporting people and organisations to perform better and increase wellbeing while managing and adapting to change has been developed with limited sociological input. The article is based on 15 years of social constructionist-informed reflective practice by a sociologist-turned-coach, and uses a multi-layered autoethnographic account to argue for a sociologically informed paradigm shift in coaching, as well as relevant sociological knowledge and social and human sciences research methodology in coaches’ education. It presents the rationale and key features of a new coaching approach that places DSC-relevant sociological concepts at the heart of the coaching process, helps people develop psycho-sociological awareness, and uses a learning-to-develop through research design. A new definition of coaching to address DSC is derived. Coaching practitioners will find DSC-relevant sociological concepts, critical reflections, coaching questions, and procedures to expand coaching effectiveness. Interdisciplinary research topics combining coaching sociology and coaching psychology are suggested.

Evolutionary Cancer Cell Biology (ECCB) reveals that the majority of cancer hallmarks trace their origins back to the premetazoic era, approximately 2300 to 1750 million years ago. These cancer hallmarks share deep homology with the oxygen-sensitive non-gametogenic NG (Urgermline), which evolved from the common ancestor of Amoebozoan, Metazoan, and Fungi (AMF). The genes, gene modules, and gene regulatory networks of the premetazoic cell system are preserved in the ancestral genome compartment of metazoans and humans. The Urgermline serves as a blueprint for all germ and stem cell lineages, including parasitic amoebae. As observed in amoebae, DNA double-strand breaks (DSBs) manifest in the homologous recombination (HR) genes of NG germlines and stem cell lineages when exposed to specific hyperoxic conditions, referred to as AMF hyperoxia, characterized by an oxygen content exceeding 6.0%. The cells lose their stemness and differentiation potential but persist in proliferation as low-grade polyploids (4n) through defective symmetric cell division (DSCD phenotype). Genomic integrity can be restored through homotypic cell and nuclear fusion, resulting in the formation of high-grade polyploids known as multinuclear genome repair syncytia (MGRSs), or by inductive hyperpolyploidization of more than 64n, as observed in single-celled polyploid giant cancer cells (PGCCs). Interestingly, low-, middle-, and high-grade polyploidization are not exclusive to cancer. Therefore, we investigate (i) functional polyploidies that occur in healthy cells, including humans, mammals, and protists, (ii) dysfunctional polyploidies that occur in cells with impaired homologous recombination (HR) and irreparable DNA DSB defects, and (iii) the restoration of genome integrity through cyst-like and high-grade polyploidization events. Additionally, we explore dysfunction in aging stem cells, hepatocytes, and cardiomyocytes

The aim of the present work is to explore a different non-traditional approach to higher dimensional spacetime which differs from the usual approaches such as large extra space dimensions, warped extra space dimensions and multiple extra time dimensions. This approach will be referred to as "Dynamic" higher dimensional spacetime. By this term will be introduced a new kind of higher dimensional spacetime (more than the usual 3+1 dimensions), which behaves dynamically in the sense that time is not a fixed dimension but is the extra plus one dimension to the spatial dimensions of the phenomenon we are studying. For a higher dimensional phenomenon, the lower dimensional time will behave as space and the new time will be a plus one dimension, meaning if we study a 3-dimensional phenomenon then time is the usual 4th dimension but if we are studying a 4-dimensional phenomenon then its time will be an extra 5th dimension and for this phenomenon the 4th dimension will behave as space. All spatial dimensions are indistinguishable from each other and behave in the exact same way, which means that the important parameter is not the dimension we are studying (for example the 4th or the 5th) but the number of dimensions in which a phenomenon can interact and how higher dimensional phenomena interact with lower ones. This non-traditional approach to higher dimensional spacetime may appear confusing at first but will become clearer in the rest of the paper. For this reason, we will first associate the time dimension with propagation relative to space dimensions and change orthogonal to them in order to give the reader a better intuition. Following that, we will describe how higher - dimensional phenomena would appear to us, the 3 - dimensional observer and try to set some guidelines on how we should mathematically model higher - dimensional phenomena in order for us to make accurate predictions of their behaviour. Then we will express the general framework of a "Dynamic" higher - dimensional spacetime and turn our gaze to 4+1 – dimensional phenomena. We will explore how a mass term arises for 4 – dimensional waves by generalizing the frequency – speed – wavelength relation of 3D waves and give a basic description on a possible way to describe a 4+1 – dimensional disturbance in a scalar Energy Field in order to make accurate predictions on our 3+1 dimensional plane. In this framework we will derive the Klein – Gordon equation by generalizing the wave equation and ignoring all lower than 4+1 - dimensional disturbances and compere our mass term findings with the Klein – Gordon equation mass term and with results from gravity – induced quantum interference experiments. Lastly, we will describe how a "Dynamic" 5 - dimensional spacetime would appear in a 3D observer and examine whether our findings are compatible with quantum mechanics and the special theory of relativity.

This study comprehensively evaluates the DNA/RNA Defend Pro (DRDP) sample collection buffer designed to inactivate and stabilize patient samples. The primary objectives encompassed assessing DRDP's efficacy in ensuring sample stability, facilitating extraction-free polymerase chain reaction (PCR), and ensuring compatibility with rapid antigen testing.Ninety-five diagnostic nasopharyngeal swab samples tested for influenza A/B, RSV A/B, and/or SARS-CoV-2 were diluted 1/10 with DRDP and anonymized. Stability testing involved incubating 31 positive samples at 4 °C, 20 °C, and 37 °C for 7 days, with regular extraction-free nucleic acid amplification testing (NAAT).Results demonstrated that DRDP guaranteed viral RNA stability at all temperatures for influenza, SARS-CoV-2 and RSV showing stability up to 7 days at 4 °C. DRDP-diluted samples exhibited robust compatibility with direct PCR, as 72 out of 88 samples positive for cobas Liat also tested positive for direct PCR. Non-concordant results could be explained by the 200-fold lower input in the extraction-free NAAT.Compared to NAAT, rapid antigen testing demonstrated lower sensitivity, as expected, while maintaining perfect specificity. Clear cutoffs between positive and negative rapid antigen testing results were observed in both cobas Liat and direct PCR analyses, validating DRDP's compatibility with these techniques. In conclusion, DRDP is an effective stabilizing medium compatible with direct PCR and rapid antigen testing and shows great potential for optimizing diagnostic processes, particularly in resource-limited or time-sensitive scenarios.

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.

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.

Suppose for n∈ ℕ, set A⊆ℝⁿ and function f∶A→ℝⁿ. If set A, using the Hausdorff outer measure, is measurable in the sense of Carathèodory; we want to find an extension of the expected value, w.r.t the Hausdorff measure, that's unique, finite and "natural" (defined on §2.3 & §2.4) for all f in a prevalent subset of ℝᴬ. The issue is current extensions of the expected value are finite for all functions in only a shy subset of ℝᴬ. The reason this issue wasn't resolved is mathematicians have not thought of the problem, focusing on application rather than generalization. Despite the lack of potential use, we'll attempt to solve the problem by defining a choice function---this shall choose a unique set of equivalent sequences of sets (Fₖ***) , where the set-theoretic limit of Fₖ*** is the graph of f; the measure Hʰ is the ℎ-Hausdorff measure, such for each k∈ℕ, 0 < Hʰ(Fₖ***) < +∞; and (fₖ*) is a sequence of functions where {(x,fₖ*(x))∶x∈ dom(Fₖ***)}=Fₖ***. Thus, the extended expected value of or E**[f,Fₖ***] is: ∀(ε>0)∃(N∈ℕ)∀(k∈N)(k≥N⇒1/Hʰ(dom(Fₖ***))∫dom(Fₖ*** )fₖ* dHʰ - E**[f,Fₖ***]<ε ) which should be unique, finite, and "natural" (defined on §2.3 & §2.4) for all f in a prevalent subset of ℝᴬ. Note we guessed the choice function using computer programming but we don’t use mathematical proofs due to the lack of expertise in the subject matter. Despite this, the biggest use of this research is the extension of the expected value is finite for "almost all" functions: this is easier to use in application when finding the "average" of functions covering an infinite expanse of space.

This article describes a novel topical composition constituted by gamma-amino butyric acid (GABA) and microbial chondroitin sulfate. This composition, formulated by the author and manufactured in a certified facility in the United States of America, exhibits potential for non-invasive intervention in anxiety management, sleep quality enhancement, and promotion of brain-related functions like meditation and nonlocal consciousness. The core component comprises GABA, a key inhibitory neurotransmitter within the central nervous system, complexed with a suitable carrier molecule, microbial chondroitin sulfate. This complexation aims to enhance transdermal absorption and optimize delivery of GABA to target tissues. The proposed mechanism of action involves modulation of GABAergic signal transduction pathways. Application of the topical composition allows GABA penetration into the skin and potentially deeper tissues, where it interacts with GABA receptors. This interaction leads to mental calmness and relaxation as assessed by electroencephalography. The influence of GABAergic signaling on brain circuits demonstrated in this article, when associated with meditation and nonlocal consciousness, suggests potential for the composition to support these practices. The advantage of such an approach consists in avoiding the potential systemic side effects associated with oral or injectable administration of GABA, anxiolytics or hypnotics. Furthermore, the combination of GABA and microbial chondroitin sulfate may offer synergistic benefits, potentially enhancing the overall biological effects. In conclusion, this article presents a novel topical approach for managing anxiety, enhancing sleep quality, and potentially facilitating meditation and nonlocal consciousness through modulation of GABAergic signaling pathways. While further research is necessary, the potential for a non-invasive and potentially side-effect-free intervention in these areas is promising.

The new observations, including the fastest star, the circular velocity curve of the Milky Way and the fast galaxy bar, should imply that the mass of the center of the Milky Way is almost 10¹¹ times the mass of the Sun.

According to the ECCB, cancer represents the transition of a genomically damaged multicellular cell to a lower level of cell organization, controlled by the ancestral gene regulatory network (GRN) from the ancestral compartment of human and metazoan genomes. Cancer adopts ancient mechanisms and rules of the common ancestor, similar to those observed in parasitic amoebae. In cancer, the productive cell line generating CSCs is a non-gametogenic cancer germline. This germline proliferates through asymmetric cell division (ACD phenotype). CSCs lack proliferative capacity; they persist in hypoxic niches in a quiescent cell state or transition to an amplifying cell state that performs cyst-like polyploidization cycles, giving rise to precursors and CSCs capable of differentiation. Malignization arises from genomically dysfunctional tetraploid germline cells (DSCD phenotype) that proliferate in a precancerous stage through symmetric cell cycles. DSCD progeny undergo homotypic fusion, forming multinucleated genome repair syncytia (MGRS pathway) driving carcinogenesis. During tumorigenesis, metastasis, and recurrence, subsequent germline clones initiate a cascade of increasingly pathogenic CSCs through mechanisms such as heterotypic cell fusion, soma-to-germ transition, and polyploid giant cell structures (PGCCs). Irradiation and chemotherapies drive some of the very few surviving but dysfunctional CSCs through a PGCC repair pathway homologous to the MGRS pathway of carcinogenesis. The large number of PGCCs during metastasis and recurrence results from the perpetual germline cell damage and CSC poverty induced by oxygen levels above 6.0% O2 (germline hyperoxia).

In this essay, the new notion concerning longest path is introduced. Longest path has a close relation with the notion of diameter in graph. The classes of graph are studied in the terms of having the vertex with longest path. Valued number is the number of edges belong to the longest path in the matter of vertex. For every vertex, there’s a valued number and new notion of valued set is the generalization of valued number for the vertex when all vertices of the graphs are corresponded to a vertex which has the greater valued number. For any positive integer, there’s one graph in that, there’s vertex which its valued number is that. By deleting the vertices which don’t belong to valued set, new notion of new graph is up. It’s called valued graph. The comparison amid valued graph and initial graph is up, too.

In this article, some notions about set, weight of set, number, number's position, special vertex are introduced. Some classes of graph under these new notions have been opted as if the study on the special attributes of these new notion when they've acted amid each other is considered. Internal and external relations amid these new notions have been obtained as if some classes of graphs in the matter of these notions are been pointed out.

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.

The historical idea of entropy as a property of a body has been reviewed and shown to arise from Clausius’s view of heat as motion. This view of heat, being intermediate between the now defunct idea of heat as substance and the modern view that heat represents an exchange of energy, implied that a body contains a definite quantity of heat. Heat, and therefore entropy, was thus considered a property of a body. These ideas led Clausius to develop his famous inequality and the idea that entropy always increases in irreversible, non-cyclic processes. In this paper, the notion of the entropy as a property of a body is examined in detail. A physical meaning is attached to the thermodynamic entropy by showing that a change in the function Q/T can be understood as representing a change in the number of ways that energy can be distributed among the degrees of freedom active in the system at any given temperature. The idea is illustrated with reference to solids and simple liquids. It is shown that the total thermodynamic entropy is, in general, less than the Boltzmann entropy, except for the case of a monatomic classical ideal gas in which the number of degrees of freedom is independent of temperature. Finally, entropy as a state function is discussed. It is argued that this is entirely mathematical in nature and that the entropy of a state represented in p-V space is not equivalent to a physical property of a physical system in the same thermodynamic state.

This paper describes an entropy equation that can be used for measuring energy. It originated from measuring economy in AI models, where the assumption would be that any organic system makes use of energy efficiency to form its structures. Looking at clustering and cohesion resulted in the equation E = (mean * variance). It was apparent however, that it was a very generic type of equation and it could be adjusted so that distance represents mean. This new version was applied to the domain of physics and the universe, when the equation can support the idea that work is done through the energy released by the 'change' in entropy. A comparison with Einstein's relativity equation is made and also the audacious suggestion that a black hole has only potential energy inside, which converts to kinetic energy after a Big Bang, for example. From that suggestion, a universal theory about state change can be made.

This review examines the quality of capital investment. It explores the essential components and analysis involved in financially assessing an engineering project, including an assessment of various associated risks. Additionally, the review delves into the historical progression of current capital budgeting practices and surveys academic research in the field. The evaluation of investments has been a recognized challenge for the past thirty years, but it has recently gained renewed attention from both management and scholars. Investments constitute a significant and growing portion of organizations’ capital expenditures. However, assessing the impact of investments on pursued goals is challenging. Consequently, there is a strong demand for methods and techniques that can aid in evaluating investments during the proposal stage. This paper explores several investment strategies and Examines the criteria for investment.

Among the different steps in software development software testing is one of the inevitable steps. Manual testing is considered to be more expensive and time-consuming, and this led to the formation of automated testing tools. Automated software testing tools offer a comprehensive system testing solution that minimizes the risk of any errors that could result in financial losses. One such tool is selenium. Selenium testing is an advantageous method employed by developers and testers to assess their code. Selenium is compatible with numerous widelyused programming languages like C#, Java, Python, and more. This paper focuses on understanding the in and outs of software testing using selenium

Tumor heterogeneity is a major obstacle in cancer therapy. We offer a novel perspective on tumor heterogeneity, informed by expanding upon the current view on tumor evolution. It is commonly known that in cancer, it is the advantageous genes and mutations that drive tumor capacities and the progression. We recognize an earlier, often overlooked, but necessary thus crucial step preceding the activation of advantageous genes functionality, namely, cellular response. We suggest that cancer is driven by an adaptive action taken by any organism when confronted with adversity - a cellular response to generate specific cancer capacities demanded to overcome survival threat - the responses that prompt the utilization of the functionality of advantageous genetic mutations and genes to attain these capacities and drive the disease. The ongoing development of cancer capabilities, as cells endeavor to obtain a competitive advantage, results in increased molecular chaos, observed as tumor heterogeneity. When the evolutionary drive for survival is impeded by therapeutic inhibition of critical genes, cell death occurs, a phenomenon thus termed oncogene addiction. We summarize the implications of this new framework for understanding tumor evolution and anti-cancer drug discovery, as well as understanding of basic cancer biology.

India has pledged ambitious initiatives to mitigate its growing economies’ impact on the climate, including a goal of net zero emissions by 2070. The transportation sector is one of the key sources of emissions. Therefore, fostering e-mobility within this sector is a key priority for the Indian government. The lifecycle of LiBs raises numerous concerns regarding its sustainability in production, use of rare materials, and most importantly waste management. Furthermore, this paper will highlight the case for EV battery recycling as a growing sector that also has the potential to foster circularity in the EV sector. Through the introductory section, this paper lays out rationale for battery recycling in a circular EV economy. The subsequent sections discuss the current and emerging battery technologies and their link to recycling methods whilst overviewing domestic and foreign battery recycling companies. Finally, the paper concludes with a gap assessment of the battery recycling ecosystem in India and makes recommendations to further integrate this industry into the EV supply chain. As India steers towards a sustainable future, it is imperative that the country integrates battery recycling to enhance circularity in the EV ecosystem, closing the gap between a growing number of EVs and waste management.

Lipofuscin is indigestible garbage that accumulates in the autophagic vesicles and cytosol of post-mitotic cells with age. Drs. Brunk and Terman postulated that lipofuscin accumulation is the main or at least a major driving factor in aging. They even posited that the evolution of memory is the reason why we get lipofuscin at all, as stable synaptic connections must be maintained over time, meaning that the somas of neurons must also remain in the same locale. In other words, they cannot dilute out their garbage over time through cell division. Mechanistically, their position certainly makes sense given that rendering a large percentage of a post-mitotic cell’s lysosomes useless must almost certainly negatively affect that cell and the surrounding microenvironment. Here, I explore the possibility that the accumulation of lipofuscin may to some extent exacerbate every other kind of age-related damage. I do not think that lipofuscin removal will reverse/prevent all forms of aging, just the major component facing us currently. In this piece, I will review what is known about lipofuscin accumulation from evolutionary and mechanistic standpoints and discuss a method of removing it from single cells in vitro.

Differences between the quantum mechanical and relativistic concepts of time observed in GPS satellites are accounted for by applying the equivalence principle to the transitioning electron of an atomic clock. It allows a differential equation of motion to be derived for the electron in the Minkowski space between electron shells. Using Hamilton’s principle we transform the differential equation relativistically into an integral equation of motion, the time integral of a Lagrangian. This newly derived equation accounts for the abstract mathematics of the more familiar non-relativistic model by means of a physical interpretation. Abstract rotations in Hilbert space are replaced by the rotations of real particle field geometries in Minkowski space. Because the properties of energy are universal the same equations are then used to describe the field geometry of galaxies despite vast differences in lifetime. They reveal a symmetry between the electromagnetic fields of atoms and the gravitational fields of galaxies due to similarities in the exchange of energy by radial and transverse fields. Our analysis reveals that the conjugate variables energy and time permit differences between atomic and galactic structure to be compared in a more intuitive way than by means of the differential equations of motion which use the conjugate variables position and momentum.

In our investigation of the time evolution of energy states Einstein’s interpretation from more than a century ago is found to have greater internal consistency than that of non-relativistic quantum mechanics. We choose to align more closely with his methods by abandoning the non-relativistic Hamiltonian method, which has been the standard for nearly a century, in favor of a relativistically correct Lagrangian method. Integral equations of motion for the absorption and emission of radiation are derived that underlie and anticipate the differentially motivated Schrödinger equation. This new interpretation applies to a large volume of experimental evidence of both classical and quantum mechanical origin. Among the examples discussed in support are Planck’s law describing black body radiation, matrix mechanics, the function of the simplest quantum mechanical system an electron cyclotron, chaos theory, and evolutionary biology.

The importance of detecting and diagnosing the imminence of aneurysm rupture before it occurs cannot be overstated. However, this process is often time-consuming and challenging, with variability in conclusions not uncommon among experts. Furthermore, current state-of-the-art models in medical image segmentation suffer from limited availability of large annotated datasets for training, exacerbated by an immense data imbalance. In most segmentation tasks, 3D segmentation is preferred due to its capacity to leverage more contextual information. However, these models require more data, which is constrained by the aforementioned issues. In the realm of current diagnosis models, those lacking geographic context are notably ineffective. To address these issues, the aim is to develop a model pipeline to accurately detect cerebral intracranial aneurysms and diagnose rupture imminence through 3D magnetic resonance angiography (MRA) and tabular input, augmented with the implementation of neuro-symbolic ai. The utilization of data fusion to tackle the lack of context in tabular models is proposed, leveraging extracted geographical features from a segmentation model. To enhance segmentation results and tackle the data imbalance in aneurysm segmentation, a two-stage model pipeline that extracts contextual geographic features before aneurysm segmentation is suggested. Segmentation results are additionally improved through ensemble techniques and novel preprocessing techniques. Finally, a neuro-symbolic aspect is introduced to enhance model diagnosis, interpretability and performance. The multi-step Integrated Neuro-Symbolic Analysis Pipeline for Cerebral Aneurysm Rupture Diagnosis is introduced.

The Fourier Continuous Derivative ($D_C$) offers a unique perspective on fractional differentiation grounded in the theory of Fourier series. This approach has the potential to address problems across various disciplines, including physics, engineering, and mathematics. The primary insight underpinning this approach is that a convex function defined on $\mathbb{Z}$ retains its convexity on $\mathbb{R}$. This paper delves into the Fourier Continuous Derivative, compares it with traditional fractional derivatives, and outlines its possible real-world applications, such as modeling viscoelastic materials, solving wave equations, and financial data analysis.

The extra precession of Mercury - 42.9 seconds of arc per century - explained by General Relativity (GR), is the result of a secular addition of 5.02 × 10⁻⁷ rad. at the end of every orbit around the Sun. We will analyze, the instantaneous precession and its addition along one orbit, determine the magnitude and oscillations around the mean value, comparing key theoretical proposals. This angular precession, should be the result reaction of Mercury to the gravitoelectric action produced by the geometric curve space-time at each single point of the elliptic orbit. The better we should know about this instantaneous precession, the better we will determine the external action and its quantum core nature, if that is the case. The Doppler tracking of the MESSENGER spacecraft, produces only 1 m error, enough precision to deduce the complete geodesic orbit of Mercury as an open free-fall path, isolated from other planets gravitational interference. The aim of this article is also to encourage JPL, IMCCE. and other scientific teams to do so because, as far as I know, it has not been entirely measured yet, by accurately tracking that motion.

This article presents a new methodology for modeling and analyzing discrete dynamic systems through the construction of inverse algebraic models, giving rise to the Theory of Inverse Discrete Dynamical Systems. Key concepts such as inverse modeling, structural analysis in inverse algebraic trees, and the establishment of topological equivalences for the analytical transfer of properties between the canonical system and its inverted counterpart are introduced. Central theorems on homeomorphic invariance and topological transport are demonstrated, consolidating the validity of transferring cardinal attributes between both equivalent dynamic representations. As a concrete application, an alternative proof of the historic Collatz Conjecture is presented through the rigorous construction of the associated inverse model and the analytical transfer of properties exhibited in the inverted tree structure. Furthermore, evidence has been presented on Conway's Conjecture in the Game of Life through meticulous inverse modeling in bounded cases, overcoming initial limitations of the theory in combinatorial explosions. Although a complete proof of the conjecture is not achieved, this positively expands the modeling and analysis capacity of the methodology. The impact of properly applying this novel theory to expand understanding and solve open problems in discrete dynamical systems seems vast and profound.

The only cases where exact distributions of estimates are known is for samples from exponential families, and then only for special functions of the parameters. So statistical inference was traditionally based on the asymptotic normality of estimates. To improve on this we need the {\it Edgeworth expansion} for the distribution of the standardized estimate. This is an expansion in $n^{-1/2}$ about the normal distribution, where $n$ is typically the sample size. The 1st few terms of this expansion were originally given for the special case of a sample mean. In earlier work we derived it for {\it any } standard estimate, hugely expanding its application. We call an estimate $\hat{w}$ of an unknown vector $w\in R^p$, a {\it standard estimate}, if $E\ \hat{w}\rightarrow w$ as $n\rightarrow \infty$, and for $r\geq 1$ the $r$th order cumulants of $\hat{w}$ have magnitude $n^{1-r}$ and can be expanded in $n^{-1}.$ Here we give another huge extension. We give the expansion of the distribution of {\it any smooth function} of $\hat{w}$, say $t(\hat{w})\in R^q,$ giving its distribution to $n^{-5/2}$. We do this by showing that $t(\hat{w})$, is a standard estimate of $t(w)$. This provides far more accurate approximations for the distribution of $t(\hat{w})$ than its asymptotic normality. %NOT USED: The building blocks of the Edgeworth expansions are the {\it cumulant coefficients } of the estimate. These cumulant coefficients are also needed for bias reduction, Bayes estimates and confidence regions. We give {\it chain rules} for the cumulant coefficients of $t(\hat{w})$ in terms of those of $\hat{w}$ and the derivatives of $t(w)$, up to those needed for 5th order Edgeworth expansions for $t(\hat{w})$ and its {\it tilted expansion}, useful for the tail of the distribution.

We develop a renormalizable model of Quantum General Relativity (QGR). We do this by building on earlier work with quantum electrodynamics (QED). Working with the Feynman path integral (FPI) approach to QED, we generalize the paths from varying in space to varying in space and time. This gives the standard results plus dispersion in time of order attoseconds or left. Over longer times, the dispersion in time averages out, but at attosecond times it should be detectable with current technology. As an unexpected but welcome side-effect, the approach caused the usual loop integrals to be finite. Since the usual UV divergences are significantly harder to renormalize in QGR than in QED, and since using paths in time plus space is definitely more in keeping with the general spirit of GR, we here apply the same approach to QGR. We show that with an appropriate choice of gauge (trace-reversed de Donder gauge) we can extend the earlier results to include QGR. Sub-attosecond measurements of individual gravitons are not within our reach, but at least the ultraviolet divergences in QGR are contained in the same way. We have therefore a renormalizable model of QGR

Throughout this paper the impact of anxiety on adolescent athlete’s is highlighted through analyzing neurological and psychological aspects involved in sports performance. The neuroanatomy and neuropsychology of the human brain plays a major role in developing athlete’s that has only begun to be analyzed within recent years. Especially in young athletes, there are numerous factors that affect performance on the field that originate from the environment and training the adolescent athlete is involved in. Sports performance is viewed as a major physical factor such as training and lifting weights, however the psychological aspect of sports performance often goes unnoticed. Athletes can begin to develop mental fatigue and anxiety which inevitably can decrease their ability to perform. The athlete’s internal suffering begins to go unnoticed, as the only tangible factor is watching their performance decrease. This causes the athlete to push themselves further in training resulting in greater mental fatigue. This paper emphasizes the numerous factors neurologically that play a role in athletic performance which should be focused on in adolescent athletes as they navigate the challenges and competition that are apparent within athletics. It is critical to understand the processes and hormonal changes the body undergoes with training and playing a sport, this information can change the way adolescent sports are approached and advanced.

Collatz conjecture (3x+1 problem) is a natural phenomenon in set theory that may be reconstructed using known combinatorics and order theory. Construction begins by selecting a specific order isomorphism with a bijectional order-embedding. Mapping by 3x+1 induces a unique property to only members of the mapped embedding. Under selective congruence from recursive division by two, that complex controls sequence behavior. This demonstration uses an order isomorphism consisting of two linear orders: the (1) odd positive integers and the always odd (2) Rule 50 Jacobsthal numbers, as the embedding. The argument proceeds by cardinality. When the order isomorphism is mapped under 3x+1, all Rule 50 Jacobsthal numbers are mapped to all the powers of four. This one-to-one correspondence guarantees that every odd integer is assigned to a Rule 50 Jacobsthal number, and subsequently, to a power of four. To align this construction with the conjecture, expand the set to all positive integers by showing that: (1) the powers of four embed the powers of two, in a natural way, and (2) the unique factorization of any positive even integer, not congruent to a power of two, is simply an odd integer, once the factorized power of two is divided out. In other words, if the initial choice for a positive integer is not congruent to a power of two, then recursion continues until a Rule 50 Jacobsthal number (guaranteed by cardinality) is attained. Since this value mapped by 3x+1 is always a power of four, repeated division by two will always send the sequence to one. Because this same process occurs for any choice of positive integer, Collatz conjecture is true.

Space exploration is an arduous journey, with future explorations extending in duration, increasing the risk for common space-related health issues such as bone density loss due to microgravity, impaired gut microbiota, cardiovascular ailments, and exposure to cosmic radiation. These ailments can be addressed using medicinal plants. Enhancing their efficacy entails employing gene editing to target specific secondary metabolite pathways associated with therapeutic properties. Moreover, gene editing can combine multiple medicinal properties from various plants, culminating in a singular 'superplant' with enhanced therapeutic benefits. This review discusses the current usage of medicinal plants in promoting human health during space travel, the application of gene editing technology in modifying medicinal plants and presents a vision for the utilization of gene-edited medicinal plants in space to mitigate the risk of various space-related health issues.

One objective of this paper is to investigate bifurcation of solutions of Ornstein-Zernike equation in liquid state theory for the gas-liquid coexistence region of simple fluids. The analysis uses a discrete form of the Ornstein-Zernike equation in real space, together with a closure relation which provides nearly self consistent thermodynamic properties of fluids governed by interaction potentials like the Lennard-Jones potential. Accurate asymptotic forms of correlation functions are incorporated in the real space algorithm so as to mitigate the influence of cutoff length used in the discrete approximations. It is found that there is no spinodal on the vapor side on a sub-critical isotherm. But there are fold bifurcation points on the vapor and liquid sides together with a 'no-real-solution-region' in between. This is followed by a region of negative compressibility extending up to the spinodal on the liquid side. The emerging picture is quite similar to that in the case of the hypernetted-chain-closure. It is also found that complex solutions connect the physical solutions that exist outside the 'no-real-solution-region' as well as in region of negative compressibility. The second objective of the paper, in the light of bifurcation scenario, is to evolve an interpretation of the coupling-parameter expansion of correlation functions pertaining to the region of negative compressibility. It is shown that the expansion provides an accurate description of results of the restricted ensembles, implied in mean field theories and simulation methods. Bifurcation of singlet density to inhomogeneous distributions at a spinodal is also established using a simple equation, which uses the direct correlation function. Thus the paper reestablishes the fact that restriction to a homogeneous singlet density is the root cause of all inconsistencies found in the gas-liquid coexistence region.

The existence of semantic inaccuracy §2 articles by A. Einstein “On the electrodynamics of moving bodies”, illustrating the principle of the relativity of simultaneity. In a sentence “The observers co-moving with the moving rod would thus find that the two clocks do not run synchronously while the observers in the system at rest would declare them synchronous”, the preposition “not” must be moved and placed before the word “synchronous”, at the end of the sentence. The criterion for synchronism of the clocks on the rod is the time it takes for the beam to travel from clock A to clock B and back, and for observers on the rod it will be the same both when the rod is at rest and when the rod is moving. Otherwise, observers on the rod would have had at their disposal an experiment that would allow them to determine whether the rod is moving or at rest, which contradicts the first postulate of the Special Theory of Relativity. The inaccuracy is found unchanged in modern editions in English and Russian, and can become a source of difficulties when teaching the basics of the Special Theory of Relativity based on primary sources, as well as make it difficult to understand the author’s logic when studying independently. Nobel laureate R. Feynman, having expanded and modified A. Einstein's thought experiment, eliminated the inaccuracy described in the article.

In this study, I examined the Beals conjecture on the basis of formulas that produce composite numbers, and I developed some other conjectures that, if answered, would be an answer to the Beals conjecture. Apart from this, I have examined the Beals conjecture from another perspective and posed The Germany Problem.

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

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.

Blockchain technology has emerged as a necessity for the decentralization of payment methods and transactions, but it has brought with it many properties of distributed systems that have made it a crucial technology for overcoming some of society's challenges, especially in the context of decentralizing services, transparency of information, availability, and security. Its architecture and communication methods, although possessing some complex nuances to understand, particularly for the lay audience in the field of distributed systems, protocols, and computer networks. In this article, we will explore some topics of distributed systems related to blockchain technology.