“De-[Constructing] Growth” is offered as a deeper and more useful conceptualization that avoids the negative connotations of, and resistance to, “degrowth” by decoupling profit from unsustainable consumption, production, and inequality.

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.

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.

The kind of set which is based on edges, is introduced. The analysis on this set is done in the matter of operation which are the classes of graphs. The general notion which is related to this concept, is up. The set of edges is seen in the matter of common vertex, entitled neighbor edges and the set of edges which has specific condition on the vertices of graphs, entitled ghost set. The kind of viewpoint when the edges are up so the kind of efforts to assign some notions which get the sensible result of edges which make sense about these two types of notions. Notions of having some attributes about vertices concerning edges and edges' attributes to get result about edges in the matter of vertices.

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.

In this article, there's an effort to make sense about the new versions of matroid. I believe that there's new idea on the background of. matroid. Two styles of matroid is defined in the background of fixed graphs and after that the attributes of these new notion on the graph and its parameters have been studied. The focus of this article is on the version of matroid which has the basis on the cycles as if there's gentle discussion on the results which are based on the set of independent vertices as matroid-x. The relation amid fundamental parameters and specific set like independent set and minimal set in the terminology of graph theory have been considered. Matroid is the word to use in the study on the parameters of graph theory as if set theory and its terminology are also recorded. The terms of word in various terminology have been relatively used. There are open ways to use hypergraphs or some serious relations amid these two types.

In this article, the connections amid matroid and other notions have been studied. The structure of matroid could be a reflection of some other structure in lattice theory, group theory, other algebraic structure, graph theory, combinatorics and enumeration theory.

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

Alphaviruses are positive-sense RNA arboviruses that are capable of causing severe disease in otherwise healthy individuals. There are many aspects of viral infection that determine pathogenesis and major efforts regarding the identification and characterization of virulence determinants have largely focused on the roles of the nonstructural and structural proteins. Nonetheless, the viral RNAs of the alphaviruses themselves play important roles in regard to virulence and pathogenesis. In particular, many sequences and secondary structures within the viral RNAs play an important part in the development of disease and may be considered important determinants of virulence. In this review article, we summarize the known RNA-based virulence traits and host:RNA interactions that influence alphaviral pathogenesis for each of the viral RNA species produced during infection. Overall, the viral RNAs produced during infection are important contributors to alphaviral pathogenesis and more research is needed to fully understand how each RNA species impacts the host response to infection as well as the development of disease.

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

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

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.

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

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

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.

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

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

The development of new target stations for radioisotope production based on a dedicated 70~MeV commercial cyclotron is described. Currently known as the South African Isotope Facility (SAIF), this initiative will free the existing separated-sector cyclotron (SSC) at iThemba LABS (near Cape Town) to mainly pursue research activities in nuclear physics and radiobiology. It is foreseen that the completed SAIF facility will realize a three-fold increase in radioisotope production capacity compared to the current programme based on the SSC.

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

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

This paper, based on the "Unified Theory of Forces," rigorously proves the formula of de Broglie's wave function. This helps us better understand the following important issues: 1) Theoretically prove and understand the essence of de Broglie's wave function; 2) Prove that when the particle's momentum P is determined, the greater the mass of the particle, the more concentrated its wave function distribution, and the weaker the interference effect; 3) Correct the spatial distribution of the wave function of free particles, proving that the wave function of free particles is strictly constrained within a finite spatial range, which is consistent with the facts we observe.

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

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.

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.

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.

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.

Purpose: To report a novel application of excimer ablation for normalization of central corneal refractive irregularity, combined with higher fluence CXL in the effective management and visual rehabilitation of progressive keratoconus. Methods: 17 cases with progressive keratoconus were treated with a corneal surface excimer laser ablation normalization using the topographyguided (Contura) myopic ablation for customized corneal re-shaping using a 6mm optical zone. The epithelial removal was accounted for by adding a -2.75 diopters correction in the topographyguided normalizing surface ablation followed by, a second, wavefront-optimized hyperopic excimer treatment of + 2.75 diopters at 6mm optical zone. The 2 sequential excimer ablations were followed by the corneal crosslinking (CXL). Visual acuity, refraction, and keratoconus documentation via keratometry, topography, and pachymetry, as well as endothelial cell density were evaluated over 36 months. Results: Keratoconus stabilized in all cases. The severity of keratoconus stage by Amsler-Krumeich criteria improved for the OD from an average 2.2 to 1. Mean UDVA showed marked improvement at one-year follow-up all values in decimal: from 0.21±0.18 pre-operative to 0.51±0.25 at 12 months, with small additional improvement through the 3 years to 0.51±0.16. CDVA respectively increased from 0.55±0.11 to 0.77±0.14 at 1 year, and to 0.79±0.16 at 3 years. Mean minimal corneal thickness decreased significantly from 466.74±34.25 µm to 396.17±45.17 µm (P<.01) as recorded the first year postoperatively and then slightly increased to 405.17±32.21 µm at the 3-year follow-up. Conclusions: We introduce herein initial clinical data with the use of novel, off-label therapeutic excimer laser surface ablation application: Designed to perform both epithelial removal and anterior corneal stroma reshaping, to be combined with CXL, in order to apply the Athens Protocol CXL with US excimer laser approved specifications.

Charcot-Marie-Tooth (CMT) syndrome is the most common progressive human motor and sensory peripheral neuropathy. CMT type 1E is a demyelinating neuropathy affecting Schwann cells due to pmp22 mutations, modelized by Trembler-J mice. Curcumin, a natural polyphenol com-pound obtained from turmeric (Curcuma longa), exhibits dose- and time-varying antitumor, antioxidant and neuroprotective properties, however, the neurotherapeutic actions of curcumin still remain elusive. Here, we propose curcumin as a possible natural treatment capable of enhancing cellular detoxification mechanisms, resulting in an improvement of the neurodegenerative Trembler-J phenotype. Using a refined method for obtaining enriched Schwann cell cultures, we evaluated the neurotherapeutic action of low dose curcumin treatment on the PMP22 expression, and on the chaperones (HSF1 and Hsp27) and autophagy/mTOR (HDAC6 and ribosomes) pathways in Trembler-J and wild-type genotypes. In wild-type Schwann cells, the action of cur-cumin resulted in strong stimulation of the chaperone and macroautophagy pathway, whereas the modulation of ribophagy showed a mild effect. However, despite the promising neuroprotective effects for the treatment of neurological diseases, we report (demonstrate?) that the action of cur-cumin in Trembler-J Schwann cells could be impaired due to the irreversible impact of ethanol used as a common curcumin vehicle necessary for administration. These results contribute to expand our still limited understanding of PMP22 biology in neurobiology, and expose the intrinsic lability of the neurodegenerative Trembler-J genotype. Furthermore, they unravel interesting physiological mechanisms of cellular resilience relevant for to the pharmacological treatment of the neurodegenerative Tremble J phenotype with curcumin and ethanol. We conclude that the analysis of the effects of the vehicle itself is an essential and in-escapable step to comprehensibly assess the own effects and full potential of curcumin treatment for therapeutic purposes.

We know that the classical Mittag-Leffler function play an important role as solution of fractional order differential and integral equations. We introduce the j-generalized p - k Mittag-Leffler function. We evaluate the second order differential recurrence relation and four different integral representations and introduce a homogeneous linear differential equation whose one of the solution is the j-generalized p-k Mittag-Leffler function. Also we evaluate the certain relations that exist between j-generalized p - k Mittag-Leffler function and Riemann-Liouville fractional integrals and derivatives. We evaluate Mellin-Barnes integral representation of j-generalized p-k Mittag-Le er Function. The relationship of j-generalized p-k Mittag-Leffler Function with Fox H-Function and Wright hypergeometric function is also establish. we obtained its Euler transform, Laplace Transform and Mellin transform. Finally we derive some particular cases.

The extensive metabolic diversity of microalgae, coupled with their rapid growth rates and cost-effective production, position these organisms as highly promising resources for a wide range of biotechnological applications. These characteristics allow microalgae to address crucial needs in both the agricultural, medical, and industrial sectors. Microalgae are proving to be val-uable in various fields, including the remediation of diverse wastewater types, the production of biofuels and biofertilizers, and the extraction of various products from their biomass. For decades, the microalga Chlamydomonas has been widely used as a fundamental research model organism in various areas such as photosynthesis, respiration, sulfur and phosphorus metabolism, nitrogen metabolism, and flagella synthesis, among others. However, in recent years, the potential of Chlamydomonas as a biotechnological tool for bioremediation, biofertilization, biomass, and bio-products production has been increasingly recognized. Bioremediation of wastewater using Chlamydomonas presents significant potential for sustainable reduction of contaminants and fa-cilitates resource recovery and valorization of microalgal biomass, offering important economic benefits. Chlamydomonas has also established itself as a platform for the production of a wide va-riety of biotechnologically interesting products, such as different types of biofuels, and high-value-added products. The aim of this review is to achieve a comprehensive understanding of the potential of Chlamydomonas in these aspects, and to explore their interrelationship, which would offer significant environmental and biotechnological advantages.

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

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

In this research, assume a SuperHyperGraph. Then a 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.

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

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

in this research, new setting is introduced for new SuperHyperNotion, namely, Neutrosophic SuperHyperStable. In this research article, there are some research segments for ``Neutrosophic SuperHyperStable'' about some researches on neutrosophic SuperHyperStable. With researches on the basic properties, the research article starts to make neutrosophic SuperHyperStable theory more understandable. Assume a neutrosophic SuperHyperGraph. Then a ``neutrosophic SuperHyperStable'' $\mathcal{I}_n(NSHG)$ for a neutrosophic SuperHyperGraph $NSHG:(V,E)$ is the maximum neutrosophic cardinality of a neutrosophic SuperHyperSet $S$ of neutrosophic SuperHyperVertices such that there's no neutrosophic SuperHyperVertex to have a neutrosophic SuperHyperEdge in common. A basic familiarity with SuperHyperGraph theory and neutrosophic SuperHyperGraph theory are proposed.

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

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.

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

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.

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

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

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

The aim of this article is to introduce the new notion on a given graph. The notions of valued set, valued function, valued graph and valued quotient are introduced. The attributes of these new notions are studied. Valued set is about the set of vertices which have the maximum number of neighbors. The kind of partition of the vertex set to the vertices of the valued set is introduced and its attributes are studied. The behaviors of classes of graphs under these new notions are studied and the algebraic operations on these sets in the different situations get new result to understand the classes of graphs, these notions and the general graphs better and more.

In this article, some kinds of triple belongs to metric dimensions are defined. Some classes of graphs in the matter of these kinds, are studied and the relation amid these kinds are considered. The kind of having equivalency amid these notions and some classes of graphs, is obtained. The kind of locating some vertices by some vertices when the number of locating vertices is increased, has the key role to analyze the classes of graphs, general graphs, and graph's parameters.

Constructing new graph from the graph's parameters and related notions in the way that, the study on the new graph and old graph in their parameters could be facilitated. As graph, new graph has some characteristics and results which are related to the structure of this graph. For this purpose, regular graph is considered so the internal relation and external relation on this new graph are studied. The kind of having same number of edges when this number is originated by common number of graphs like maximum degree, minimum degree, domination number, coloring number and clique number, is founded in the word of having regular graph

Number is based in special edges, is introduced. The kind of natural extension from edges toward vertex and the set of vertices in the way that, the final notion is number, is studied. The result is obtained which is about the study on the classes of graphs in the matter of new notions. There is the extended notion about having edge amid two vertices toward having some edges in the word of neighbor and in another stage going into the atmosphere of having consecutive edges in the terminology of path and in the upper vision going on the notion about path with jargon and buzzword of distance as if the minimal vertices has concluded the new notions with the word, number.

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.

In this outlet, I’ve devised the concept of relation amid two points where these points are coming up to make situation which in that the set of objects are greed to represent the story of how to be in whatever situations when these two points have the styles of being everywhere in the highlights of the concept which are coming from the merits of these points where are eligible to make capable situation to overcome every situation when they’re participant in the hugely diverse situations which mean too styles of graphs with have the name or the general results for the general situation as possible as are.

In this research paper, design and development of pyramidal horn antenna for J-band application is reported. It is particularly designed for 17 dB gain and half beam width about 25 degrees at 6.93 GHz. Horn aperture, horn axial length and distance from the throat of the antenna to aperture are the main design constraints which are calculated and used for the antenna design and simulation. Beam width in E-plane and H-plane horn is calculated and it is 19.18 dB and 22.86 dB respectively. The reported antenna design shows good performance for J-band in radiometry, satellite, and radar applications.

Nanocrystalline silicon oxide (nc-SiOx:H) is a multipurpose material with its varied application in solar cells as a transparent front contact, intermediate reflector, back reflector layer and even tunnel layer for passivating contacts, owing to easy tailoring of its optical properties. In this work, we systematically investigate the influence of gas mixture (SiH4, CO2, PH3 and H2), RF power and process pressure on the optical, structural and passivation properties of thin n-type nc-SiOx:H films prepared in an industrial, high throughput, plasma-enhanced chemical vapor deposition (PECVD) reactor. We provide a detailed description of the n-type nc-SiOx:H material develop-ment using various characterization techniques (SEM, EDX, Raman spectroscopy, and spectro-scopic ellipsometry) with a focus on the relationship between the material properties and the pas-sivation they provide to n-type c-Si wafers characterized by their effective carrier lifetime (τeff). Further, we also outline the parameters to be kept in mind while developing different n-type nc-SiOx:H layers for different solar cell applications. We report a tunable optical gap (1.8 – 2.3 eV) for our n-type nc-SiOx:H films as well as excellent passivation properties with τeff up to 3.5 ms (iVoc ~ 715 mV) before annealing. Oxygen content plays an important role in determining the crystallinity and hence passivation quality of the deposited nanocrystalline silicon oxide films.

Single cell RNA-seq (scRNA-seq) profiles conceal temporal and spatial tissue developmental information. De novo reconstruction of single cell temporal trajectory has been fairly addressed, but reverse engineering single cell 3D spatial tissue localization is hitherto landmark based, and de novo spatial reconstruction is a compelling computational open problem. Here we show that a new algorithm - named D-CE - for coalescent embedding of single cell transcriptomic networks can address this open problem. We rely merely on the spatial information encoded in the expression patterns of developmental signal transcription factor (DST) genes, and we find that D-CE of cell-cell association DST-transcriptomic networks reliably reconstructs the Geo-seq or single cell samples’ 3D spatial tissue distribution. Comparison to the novoSpaRC and CSOmap (recent and only available de novo 3D spatial reconstruction methods) on 16 datasets and 681 reconstructions, reveals a significantly distinctive superior performance of D-CE.

The role of foods is shifting from focusing on the provision of energy and basic nutrients to also include bioactive compounds that prevent the development of chronic age-related diseases. Mi-croalgae offer a source of nutritional compounds with important health effects, and have the po-tential for production of health-promoting products, without increasing agricultural land use and negatively impacting the environment. Here we investigate the health effects of microalgal ex-tracts with high levels of the colourless carotenoid phytoene. Phytoene is widely available from dietary sources and can be detected across different tissues in the human body. However, it is usually regarded as a precursor for the synthesis of other carotenoids, rather than a bioactive molecule. We utilised the model organism C. elegans to show that phytoene-rich extracts from Chlorella sorokiniana and Dunaliella bardawil have anti-ageing properties. The extracts protect against oxidative damage and amyloid-β42 proteotoxicity (a major pathology of Alzheimer's disease), and extends lifespan. We show that pure phytoene also has these anti-ageing effects, suggesting that phytoene is a bioactive molecule with positive effects on ageing and longevity.

Over the last two decades, a considerable amount of equipment has been acquired (spreaders, seeders, sprayers, among others) to respond to the challenges of Precision Agriculture (PA) concept. Most of this equipment has been purchased at a high cost. However, many of them, despite still being functional and equipped with sensors, actuators, and electronic processing units capable of adjusting to variations in speed, have become obsolete in terms of communication, and incompatible with new monitoring and control systems based on the “Isobus” protocol. This work aims to present a solution for updating the control system (“Ferticontrol”) of a “Vicon RS-EDW” spreader with variable rate application (VRA), making it compatible with the “InCommand” system from “Ag Leader”. The solution includes low-cost “Arduino” and “Raspberry Pi” microcontrollers and open-source software. The development shows that it is possible to implement a solution that is accessible to farmers in general. It also provides a niche business opportunity for young researchers to set up small technology-based enterprises associated with universities and research centers. These partnerships guarantee permanent innovation and represent a decisive step towards modern, technological, competitive, and sustainable agriculture.

Cities are complex systems requiring urban design models that balance order and disorder. Collective creativity initiatives engage citizens in these processes, empowering bottom-up approaches that prioritize people and social well-being within urban development. This paper investigates an 'Urban Laboratory' as a case study, examining the potential of collective creativity to address urban complexity. The successful and ongoing project 'El Campo de Cebada' in Madrid, Spain, demonstrates how a community transformed a vacant lot into a vibrant social hub. The phases of this study include case selection, data collection, data analysis, and presentation of the results. This study identifies key enabling factors, including agents, management, social dynamics, infrastructure, and actions. These insights offer a methodological framework for designing future collaborative, resilient, and inclusive urban spaces, addressing the complex needs of communities within our cities.

On February 28th, 2023, Spanish Royal Decree 150/2023 as published, approving the plans for the management of the maritime space of the five Spanish marine demarcations. This Royal Decree Law inaugurates the Planning of the Maritime Space in Spain. Terrestrial Space Planning is very advanced, both in the legislation and in the instruments that are enabled to organize this space, from the national scale to the municipal scale, passing through the regional, provincial, and supra-municipal scales. Naturally, both Planning must converge and thus speak of an Integrated Space Planning. In some of the countries that we can take as global references, this convergence in the form of integration is taking place. On the other hand, and within the context of climate change, coastal cities will be the most affected, both by the potential rise in sea level and by the increasingly continuous and greater extreme events. Integrated Space Planning is postulated as the most effective tool to carry out adequate territorial and urban planning of our coastal cities, as well as to analyse the influence and possible corrective measures to apply against the effects produced by climate change.

This paper shows the firsts results of a methodological approach in which Remote Sensing technologies (Satellite imagery and LiDAR) combined with Least Cost Path algorithm on GIS are being tested like tools to overcome locally-based interpretations about populational patterns and communication routes during Flavian municipality in the Comarca de El Condado region. The identification of fourteen hypothetical communication routes between already known archaeological sites thanks to a recent archaeological prospection, and the confirmation of three sections of them and a new archaeological site demonstrate that the combined use of the aforementioned technics has a very useful to delve more deeply, more widely and at a variety of different scales into the relation between the twelve known/selected Early Roman Empire sites and the surrounding landscape in the right bank of Guadalén River. It is expected that, in next phases, this methodological approach will allow us to go deeper in analysing and understanding spatial distribution, exploitation, and interrelation between different Early Roman Empire sites, helping us to fill the aforementioned gaps in our understanding of the archaeological continuum in the region reducing time and costs.

In this work, several random Boolean networks (RBN) are generated and analyzed from two characteristics: their time evolution diagram and their transition diagram. To do this, its randomness is estimated using three metrics, of which algorithmic complexity is the only one capable of revealing both transitions towards the chaotic regime and the algorithmic contribution of certain states to the transition diagram and their relationship with the order they occupy in the temporal evolution of the respective RBN.

(R)-(+)-3,5-Dinitro-N-(1-phenylethyl)benzothioamide 1 is a potential chiral solvating agent (CSA) for the spectral resolution of enantiomers by 1H NMR spectroscopy. The single enantiomer of 1 was synthesized from commercially (R)-(+)-a-methylbenzylamine 2 in two-steps with 85% yield.

The ability to self-direct a research program determines graduate degree completion. Yet, research on incompletion of graduate physics programs assume students’ present level of self-direction adequate and neglects to recognize a lack of self-directed learning as key. One theoretical mathematical physicist focused on changing this challenge of physics graduate education by promoting self-directed learning through the type research flow that has been found to bring the greatest satisfaction to researchers with respect to their insights. This he provided through his space, time, open mindedness and theoretical contributions with his students and in collaboration with his colleagues. A self-directed learner himself, David J. Rowe developed methods of mentoring for encouraging physics graduate students to recognize symmetry as valuable in identifying solutions to problems quickly—helping these students take the lead in finding insightful resolutions to complex, multidimensional, mathematical physics uncertainties. How Rowe set about supporting self-directed learning in his graduate physics education interactions will be examined with the use of narrative research to interpret the texts and conversations with the author he made available. His techniques will be presented and recommendations made regarding how Rowe’s work in this regard can be modeled to improve self-direction in STEM graduate education.

Resistance evolution during exposure to non-lethal levels of antibiotics is influenced by various stress responses of bacteria which are known to affect growth rate. Here, we aim to disentangle how the interplay between resistance development and associated fitness costs is affected by stress responses. We performed de novo resistance evolution of wild-type strains and single-gene knockout strains in stress response pathways using four different antibiotics. Throughout resistance development, the increase in minimum inhibitory concentration (MIC) is accompanied by a gradual decrease in growth rate, most pronounced with amoxicillin or kanamycin. By measuring biomass yield on glucose and whole-genome sequences at intermediate and final timepoints, we identified two patterns of how the stress responses affect the correlation between MIC and growth rate. First, single-gene knockout E. coli strains associated with reactive oxygen species (ROS) acquire resistance faster and mutations related to antibiotic permeability and pumping out occur earlier. This increases the metabolic burden of resistant bacteria. Second, the ΔrelA knockout strain which has reduced (p)ppGpp synthesis, is restricted in its stringent response, leading to diminished growth rates. The ROS-related mutagenesis and the stringent response are vulnerabilities within the fitness of resistant strains that can possibly be targeted to prevent development of resistance.

The World Health Organization (WHO) cancer agency predicts that more than 35 mil-lion cases of will be experienced in 2050, a 77 % increase over the 2022 estimate. Cur-rently, the leading cancer diagnosed cancer are breast, lung and colorectal. There is no standardized tool for cancer diagnosis; initially clinical procedures are guided by the patient´s symptoms and generally involve biochemical blood tests, imaging and biopsy. Label-free nonlinear optical approaches are promising tool for tumor imaging, due to their inherent non-invasive biosafe contrast mechanisms and the ability to monitor collagen-related disorders and metabolic changes during cancer progression. Last ad-vances in nonlinear modalities for tumor imaging are reviewed here. In addition, an application of a blind deconvolution procedure to improve the quality of two-photon images of breast tumor tissues is shown.

An explanation of the origin of dark matter is suggested in this work. The argument is based on symmetry considerations about the concept of mass. In the Wigner's view, the rest mass and the spin of a free elementary particle in flat space-time are the two invariants that characterize the associated unitary irreducible representation of the Poincar\'e group. The Poincar\'e group has two and only two deformations with maximal symmetry. They describe respectively the de Sitter (dS) and Anti de Sitter (AdS) kinematic symmetries. Analogously to their shared flat space-time limit, two invariants, spin and energy scale for de Sitter and rest energy for Anti de Sitter, characterize the unitary irreducible representation associated with dS and AdS elementary systems. While the dS energy scale is a simple deformation of the Poincaré rest energy and so has a purely mass nature, AdS rest energy is the sum of a purely mass component and a kind of zero-point energy derived from the curvature. An analysis based on recent estimates on the chemical freeze-out temperature marking in Early Universe the phase transition quark-gluon plasma epoch to the hadron epoch supports the guess that dark matter energy might originate from an effective AdS curvature energy.

Arduino microcontrollers are being used for a wide range of technological and biomedical applications such as image classification, computer vision, brain-computer interaction and vision experiments. Here I present a new cost-effective mini-device based on RGB LED flicker stimulation for the assessment of polychromatic temporal resolution of visual function. The visual device configuration allows for relative luminance thresholding, mono- and polychromatic critical flicker fusion frequency assessment. The results demonstrate the steady white visual perception of a trichromatic flicker stimulus beyond the critical flicker fusion frequency, as predicted by Talbot´s law for monochromatic stimuli. The trichromatic critical flicker fusion frequency (tFCC) depends on the relative luminance threshold at the light-adaptation level. Finally, wavefront measurements demonstrate that high-order aberrations improve the temporal resolution of visual function.

Dairy products are an important source of protein and other nutrients in the Mediterranean diet. In these countries the most common source of milk for producing dairies are cow, goat, sheep and buffalo. Andalusia is traditionally the largest producer of goat milk in Spain. Kefir is a fermented product made from bacteria and yeasts which has health benefits beyond its nutritional properties. There is a lack of knowledge about the molecular mechanisms and metabolites that bring about these benefits. In this work, the combination of analytical techniques (GC-FID, UHPLC-MS-QToF, GC-QqQ-MS, and GC-ToF-MS) resulted in the detection of 105 metabolites in kefir produced with goat milk from two different thermal treatments (raw and pasteurized) fermented at four times (12, 24, 36, and 48 h, using 0 h as control). Of these, 27 metabolites differed between kefir produced with raw and pasteurized milk. These changes could be possibly caused by the effect of pasteurization on the microbial population in the starting milk. Some interesting molecules were identified, as shikimic acid, dehydroabietic acid, GABA and tyramine that could be related to antibacterial properties, enhance of immune system and arterial pressure. Moreover, a viability assay of the NIRS technique was performed to evaluate its use on monitoring the fermentation and classification of samples, which had resulted in a 90 % of correct classified samples according to their fermentation time. This study represents the most comprehensive metabolomic analysis of goat milk kefir so far, revealing the intricate changes in metabolites during fermentation and the impact of milk treatment.

This paper presents a study on the development of the cross-curricular learning outcome (CCLO) "Ethical, environmental and professional responsibility" by the students of different Bache-lor’sDegrees taught at Universitat Politècnica de València. The work and development of this learning outcome entails great complexity, given the double dimension of responsibility that it involves. At the end of their training at the university, students are expected to show ethical, en-vironmental, and professional responsibility towards themselves and others. Interviews have been conducted with lecturers who work and assess this outcome in their subjects, most/all of them related to science and engineering. The objective was to identify the learning approach used at the different subjects to guarantee the acquisition of this CCLO by the students. A focus group has also been carried out with students to determine the importance they give to this learning outcome, and to know their degree of satisfaction with the training received. The methodology used to obtain the data from lecturers and students and to process the information to get a precise diagnosis is fully described in the paper. Results are satisfactory to some extent: most of the lecturers carry out appropriate activities and most of students achieve the expected proficiency level. Finally, recommendations are given to improve the development of this cross-curricular learning outcome.

Corneal biomechanics is a hot topic in ophthalmology. The biomechanical properties of the cornea (BMPs) have important implications in the management and diagnosis of corneal diseases such as ectasia and keratoconus. In addition, the characterization of BMPs is crucial to model the predictability of a corneal surgery intervention, the outcomes of refractive surgery or follow-up of corneal diseases. The biomechanical behavior of the cornea is governed by viscoelastic properties that allow, among other structural implications, the damping of excess of intraocular pressure and reduce damage to the optic nerve. Currently, the most versatile and complete methods to measure corneal viscoelasticity are based on air-puff corneal applanation. However, those methods lack the ability to directly measure corneal viscosity. The aim of this work is to propose a new methodology based on the analysis of corneal air-puff measurements through the Standard Linear Solid model (SLSM) to provide analytical expressions to separately calculate the elastic and time-dependent (corneal retardation time and viscosity) properties. The results shown the mean values of elasticity (E), viscosity (Ƞ) and corneal retardation time (τ) in a sample of 200 young and healthy subjects. The influence of elasticity and viscosity on viscoelasticity, high-order corneal aberrations and optical transparency is investigated. Finally, the SLSM fed back from experimental E and Ƞ values was employed to compare the creep-relaxation response between normal, an ocular hypertension patient and Ortho-K user.

The transformation of the states of polarization of electromagnetic waves that interact with polarimetrically linear media can be represented by means of the associated Mueller matrix. A global measure of the ability of a linear medium to modify the states of polarization of incident waves, due to any combination of enpolarizing, depolarizing and retarding properties, is introduced as a distance of the Mueller matrix to the identity matrix. This new descriptor, called the polarizing power, is applicable to any Mueller matrix and can be expressed as a function of the degree of polarimetric purity and the trace of the Mueller matrix. The graphical representation of the feasible values of the polarizing power provides a general view of its main peculiarities and features. The values of the polarizing power for several typical devices are analyzed.

Wearable Biosensor Technology (WBT) has emerged as a transformative tool in the educational system over the past decade. This systematic review encompasses a comprehensive analysis of WBT utilization in educational settings over a 10-year span (2012-2022), highlighting both the evolution of this field and its integration to address challenges in education by integrating technology to solve specific educational challenges, such as enhancing student engagement, monitoring stress and cognitive load, improving learning experiences, and providing real-time feedback for both students and educators. By exploring these aspects, the review sheds light on the potential implications of WBT for the future of learning. A rigorous and systematic search of major academic databases, including Google Scholar and Scopus, was conducted in accordance with PRISMA guidelines. Relevant studies were selected based on predefined inclusion and exclusion criteria. The articles selected were assessed for methodological quality and bias using established tools. The process of data extraction and synthesis followed a structured framework. Key findings include the shift from theoretical exploration to practical implementation with the EEG being the predominant measurement, aiming to explore mental states, physiological constructs, and teaching effectiveness. Wearable biosensors are significantly impacting the educational field, serving as an important resource for educators and a tool for students. Their application has the potential to transform and optimize academic practices through sensors that capture biometric data, enabling the implementation of metrics and models to understand the development and performance of students and professors in an academic environment, as well as to gain insights into the learning process.

Blackberry (Rubus fruticosus spp) is a fruit that has a significant antioxidant activity, due to its content in anthocyanins and antioxidant compounds. Emerging technologies are required as the thermoultrasound technique that ensures microbial reduction and release of compounds with antioxidant properties. The objective of this study was to evaluate changes in the antioxidant content and fatty acid profile of blackberry juice when it is subjected to conservation treatment (pasteurization and thermoultrasound). The blackberry juice and the extracted oil of blackberry juice with n-hexane (control, pasteurized and thermoultrasonicated) were evaluated in antioxidant activity, fatty acid profile and antioxidant content. The thermoultrasound juice had the highest (p < 0.05) amount of total phenols (1011 mg GAE/L), anthocyanins (118 mg Cy-3-GlE/L); antioxidant activity by ABTS (44 mg VCEAC/L) and DPPH (2665 µmol TE/L) compared to the control and pasteurized samples, as well as, as well as, oil extract of obtained of the thermoultrasound juice presented high antioxidant activity (177.54 mg VCEAC/L to ABTS and 1802.60 µmol TE/L to DPPH). The fatty acid composition of the oil extract showed the presence of myristic, linolenic, stearic, oleic, and linoleic acid, the fatty acid profile was similar in the different samples with the exception of stearic acid where this was higher in control sample. The thermoultrasound treatment can be an alternative to pasteurization treatments because keeps and releases antioxidant bioavailable compounds, preserving their fatty acids.

The aim of this work is to compare two softwares (MAUD and TOPAS) based on the Rietveld algorithm and to test the concept of tolerance factor using the dissolution at high temperature of yttrium into BaTiO₃. In general, both softwares give up different values of the crystalline parameters however the trends are similar in most cases but the analysis of the strain and crystallite size in the BaTiO₃ crystals suggests that, in this particular case, MAUD offered results more consistent with the expected behavior. Using the crystalline parameters calculated by Rietveld, the tolerance factor values were obtained and these data suggest even better stability in the crystalline structure than that expected using theoretical parameters. Tolerance factor concept also indicates that Ti⁴⁺ should be preferred.

Zinc oxide is one of the most important semiconductor metal oxides and one of the most promising n-type materials, but its practical use is limited because of both its high thermal conductivity and its low electrical conductivity. Numerous studies have shown that doping with metals in ZnO structures leads to the modification of the band gap energy. In this work, Al-doped ZnO, Ni-doped ZnO, and undoped ZnO nanocrystalline powders were prepared by sol-gel method coupled with ultrasound irradiation. The doping concentration in ZnO was 1.0 at.% of Al and Ni. Influence of Al³⁺ and Ni²⁺ ions in the ZnO network are explored in this paper. X-ray Diffraction (XRD), Raman Spectroscopy, Nitrogen Adsorption (BET method), X-Ray Fluorescence (XRF) and Field Emission Scanning Electron Microscopy (FESEM) analyses demonstrated the incorporation of metal ions (aluminum and nickel) into the ZnO wurtzite structure. The crystallite size of the sample was decreased from 24.5 nm (ZnO) to 22.0 nm (ZnO-Al) and 21 nm (ZnO-Ni).

Polymethyl methacrylate (PMMA) polymer is widely used in various fields today. In order to thoroughly reveal the structural impact performance of PMMA materials, this paper is based on the comprehensive Johnson-Cook constitutive model and damage failure model, and accurately confirm the J-C constitutive and damage failure model parameters of PMMA through material test data, The dynamic process of steel bullet impacting PMMA plate structure is analyzed by finite element software ABAQUS. The calculation results show that the numerical simulation results in this paper are in good agreement with the experimental test data. Therefore, the feasibility and accuracy of the impact analysis of PMMA structures based on J-C constitutive and damage failure models in this paper are studied. Finally, based on the J-C constitutive model and damage failure model, the variation of the residual velocity of the bullet with the PMMA plate thickness is analyzed in depth, that is, the results show that the residual velocity of the bullet has a certain linear relationship with the plate thickness.

As a form of protection, a nature park is often created to protect and valorise natural and cultural heritage in peripheral rural areas. However, in terms of multi-functionality, new nature parks are incorporated into traditional productive activities, such as recreational and tourist activities, which sometimes compromise sustainability. The research objective is to study the relationship between tourism and sustainability in the Nature Parks of “Sierra de Aracena y Picos de Aroche”, “Sierra Norte de Sevilla” and “Sierra de Hornachuelos” that makes up the Dehesas de Sierra Morena Biosphere Reserve in Andalusia, Spain. Therefore, selective interviews have been carried out with the stakeholders to establish their perception of sustainable tourism and the presence of dominant discourses. The main conclusions indicate (1) the presence of different dominant discourses on sustainability, namely the conservationist and mercantilist ones, with the prevalence of the economic dimension; (2) poor awareness and adaptation to the context of global change; and (3) the presence of competitive relationships that generate difficulties for the governance of sustainable tourism.

The conformations of trifluoroacetyl triflate, CF3C(O)OSO2CF3, were investigated through vibrational experimental methods (gas-phase FTIR, liquid-phase Raman, and Ar-matrix FTIR spectroscopy) and Density Functional Theory (DFT) calculations. A potential energy surface was computed using the B3P86 /6-31+g(d) approximation as a function of the dihedral angles τ1 = CCOS and τ2 = COSC. The surface reveals three minima, which were further optimized using the B3LYP method with various basis sets (6-31++G(d), 6-311++G(d), tzvp and cc-pvtz). The global minimum corresponds to a syn-anti conformer (the CO double bound syn with respect the O−S single bond and the C−O single bond anti with respect to de S−C single bond). The other two minima represent enantiomeric syn-gauche forms. The Ar-matrix FTIR spectrum exhibited clear evidence of the presence of two conformers. Furthermore, the randomization process observed following broad-band UV-visible irradiation facilitated the identification of the IR absorption of each conformer. Based on the Ar-matrix FTIR experiments, the vapour phase of trifluoroacetyl triflate at room temperatures was composed of approximately 60-70% of the syn-anti conformer and 30-40% of the syn-gauche form.

Breast cancer (BCa) is the most frequently diagnosed malignant tumor in women and is also one of the leading causes of cancer-related death. Most breast tumors are hormone-dependent and estrogen signaling plays a critical role in promoting the survival and malignant behaviors of these cells. Estrogen signaling involves ligand-activated cytoplasmic estrogen receptors that translocate to the nucleus with various co-regulators such as steroid receptor co-activator (SRC) family members, and bind to the promoters of target genes and regulate their expression. SRC-3 is a member of this family that interacts with, and enhances the transcriptional activity of the ligand activated estrogen receptor. Although SRC-3 has important roles in normal homeostasis and developmental processes, it has been shown to be amplified and overexpressed in breast cancer and to promote malignancy. The malignancy-promoting potential of SRC-3 is diverse and involves both promoting malignant behavior of tumor cells and creating a tumor microenvironment that has an immunosuppressive phenotype. SRC-3 also inhibits the recruitment of tumor-infiltrating lymphocytes with effector function and promotes stemness. Furthermore, SRC-3 is also involved in the development of resistance to hormone therapy and immunotherapy during breast cancer treatment. The versatility of SRC-3 in promoting breast cancer malignancy in this way makes it a good target, and methodical targeting of SRC-3 probably will be important for the success of breast cancer treatment.

Live video streaming has become one of the main multimedia trends in networks in recent years. Providing Quality of Service (QoS) during live transmissions becomes a challenge due to the stringent requirements for low latency and minimal interruptions. This scenario has led to a high dependence on cloud services, implying a widespread usage of Internet connections, which constrains contexts where an Internet connection is not available. Thus, alternatives such as Mobile Ad Hoc Networks (MANETs) emerge as potential communication techniques. These networks operate autonomously with mobile devices serving as nodes, without the need for coordinating centralized components. However, these characteristics lead to challenges to live-video streaming, such as dynamic node topologies or periods of disconnection. Considering these constraints, this paper investigates the application of Artificial Intelligence (AI)-based classification techniques to provide adaptive streaming in MANETs. For this, a software-driven architecture is proposed to route stream in offline MANETs, predicting the stability of individual links and compressing video frames accordingly. The proposal has been implemented and assessed in a laboratory context, analyzing the model performance and QoS metrics. As a result, the model is implemented in a decision forest algorithm, which provides 95.9% of accuracy. Also, obtained latency values become assumable for video streaming, manifesting a reliable response for routing and node movements.

This paper deals with the use of low earth orbit (LEO) satellite links in long-term monitoring of water, ice and snow levels across wide geographic areas, where no other communication links can be applied. Unlike geostationary satellites, LEO satellites do not maintain the same position relative to the ground station, and transmissions need to be scheduled for satellite overfly periods. For our application, the energy consumption optimization is critical, and we develop a learning approach for scheduling the transmission times from the sensors. Our approach is based on online learning, and is applicable to any LEO satellite transmissions.

We discuss the consequences of the unique symmetry of the de Sitter spacetime. This symmetry leads to the specific thermodynamic properties of the de Sitter vacuum, which produces the thermal bath for matter. The de Sitter spacetime is invariant under the modified translations, ${\bf r}\rightarrow {\bf r} -e^{Ht}{\bf a}$, where $H$ is the Hubble parameter. For $H\rightarrow 0$, this symmetry corresponds to the conventional invariance of Minkowski spacetime under translations ${\bf r}\rightarrow {\bf r} -{\bf a}$. Due to this symmetry, all the comoving observers at any point of the de Sitter space perceive the de Sitter environment as the thermal bath with temperature $T=H/\pi$, which is twice larger than the Gibbons-Hawking temperature of the cosmological horizon. This temperature does not violate the de Sitter symmetry, and thus does not require the preferred reference frame, as distinct from thermal state of matter, which violates the de Sitter symmetry. This leads to the heat exchange between gravity and matter, and to instability of de Sitter state towards the creation of matter, its further heating, and finally to the decay of the de Sitter state. The temperature $T=H/\pi$ determines different processes in the de Sitter environment, which are not possible in the Minkowski vacuum, such as the process of ionization of an atom in the de Sitter environment. This temperature also determines the local entropy of the de Sitter vacuum state, and this allows us to calculate the total entropy inside the cosmological horizon. The result reproduces the Gibbons-Hawking area law, which is related to the cosmological horizon, $S_{\rm hor}=4\pi KA$, where $K=1/16\pi G$. This supports the holographic properties of the cosmological event horizon. We extend the consideration of the local thermodynamics of the de Sitter state using the $f({\cal R})$ gravity. In this thermodynamics, the Ricci scalar curvature ${\cal R}$ and the effective gravitational coupling, $K$, are thermodynamically conjugate variables. The holographic connection between the bulk entropy of the Hubble volume, and the surface entropy of the cosmological horizon remains the same, but with the gravitational coupling $K=df/d{\cal R}$. Such connection takes place only in the $3+1$ spacetime, where there is the special symmetry due to which the variables $K$ and ${\cal R}$ have the same dimensionality. We also consider the lessons from the de Sitter symmetry for the thermodynamics of black and white holes.

We have developed a family of N-alkyl-nitrobenzamides that exhibit promising antitubercular ac-tivities. These compounds are a simplification of the structure of known inhibitors of DprE1, an essential Mtb enzyme and an emergent anti-TB target. The compounds were obtained by a simple synthetic methodology and their antitubercular, cyto-toxicity and stability were studied. The most active compounds were the 3,5-dinitro and the 3-nitro-5-trifluoromethyl derivatives. Lipophilicity was shown to be a main parameter modulating activity within each family. The most active compound presented MIC of 16 ng/mL and had in-termediate lipophilicities. The activity was also studied in a macrophage model of infection. In this model the compounds with chain lengths of 6 and 12 carbon atoms presented the best results, ex-hibiting activity profiles comparable to isoniazid. Docking studies performed suggested that the fit of our highly active compounds to the DprE1 binding pocket was very similar to the literature compounds. Furthermore, the metrics used in the analysis were able to distinguish between the families of the highly and least active compounds. Assessment of susceptibility over multiple species and computational together with the structure of the compounds are complementary information that supports DprE1 as a likely target of action for this type of compounds.

With the increasing resistance of bacteria to current antibiotics, novel compounds are urgently needed to treat bacterial infections. Streptozotocin (STZ) is a natural product that has broad-spectrum antibiotic activity, albeit with limited use because of its toxicity to pancreatic β cells. In an attempt to derivatize STZ through structural modification at the C3 position, we performed the synthesis of three novel STZ analogues by making use of our recently developed regioselective oxidation protocol. Keto-STZ (2) shows the highest inhibition of bacterial growth (MIC and viability assays), but is also the most cytotoxic compound. Pre-sensitizing the bacteria with GlcNAc increased the antimicrobial effect, but did not result in complete killing. Interestingly, allo-STZ (3) revealed moderate concentration-dependent antimicrobial activity and no cytotoxicity towards β cells, and deoxy-STZ (4) showed no activity at all.

This paper analyses the viability of different solutions to passively augment the axial stiffness of a horizontal axis radial levitation passive magnetic bearing (PMB) with topology previously studied. The zero-field cooling (ZFC) of high-temperature superconductor (HTS) bulks promotes higher magnetic impulsion and levitation forces and lower electromagnetic losses than with the field-cooling (FC), but on the other hand, the guiding stability is much lower than with FC. Because of stability reasons, FC was adopted in most superconducting maglev systems. The trend of this research group has been to develop an HTS ZFC horizontal axis radial levitation PMB presenting notable levitation forces with reduced electromagnetic losses, defined by a topology that creates guiding stability. Previous work has shown that even optimizing the bearing geometry to maximize magnetic guidance forces, could not be enough to guarantee the axial stiffness required for many applications. First, the extent to which guidance forces are augmented by increasing the number of HTS bulks in the stator is evaluated. Then, the axial stiffness augmentation by passively adding two limiting permanent magnet (PM) rings is evaluated. Results show that the axial stiffness is highly augmented by adding limiting PM rings with no significant additional investment. This change enables using the studied ZFC superconducting PMB in high-precision axial stability applications, such as precision gyroscopes, horizontal axis propellers and turbines.

We propose a theoretical method for the deterministic shaping of quantum light via photon number state selective interactions. Nonclassical states of light are an essential resource for high precision optical techniques that rely on photon correlations and noise reshaping. Notable techniques include quantum enhanced interferometry, ghost imaging, and generating fault tolerant codes for continuous variable optical quantum computing. We show that a class of nonlinear-optical resonators can transform many-photon wavefunctions to produce structured states of light with nonclassical noise statistics. The devices, based on parametric down conversion, utilize the Kerr effect to tune photon number dependent frequency matching, inducing photon number selective interactions. With a high amplitude coherent pump, the number selective interaction shapes the noise of a two-mode squeezed cavity state with minimal dephasing, illustrated with simulations. We specify the requisite material properties to build the device and highlight the remaining material degrees of freedom which offer flexible material design.

The increasing variability of precipitation, higher temperatures and recurring droughts in the semi-arid regions due to climate change are leading to increased aridity, resulting in scarcer water resources for crops. The present study aimed to analyse the spatial distribution of climate variables related to water resources in the olive-growing areas throughout Extremadura, southwestern Spain. To perform this task, three climate variables were used: potential evapotranspiration of the crop, the FAO aridity index and the annual water requirement. Considering data from 58 weather stations located throughout Extremadura and 17 along boundaries with at least 30-year length (within the 1991-2021 period), each variable was computed at each station. After calculating some descriptive statistics, a multivariate geostatistical (regression-kriging) algorithm, incorporating secondary information on elevation and latitude, was used to accurately map each climate variable. Later, temporal trends and their magnitude were analysed using the Mann-Kendall test and the Sen’s estimator, respectively. The highest evapotranspiration and water requirements are located in the southern part of the region, which has large areas dedicated to olive cultivation. In the northern part of the region, there is greater spatial variability in evapotranspiration and, consequently, in water requirements for olive groves due to the more rugged topography. Similarly, the olive-growing areas with the highest aridity are also in the south of Extremadura. In most areas of Extremadura, olive cultivation requires appropriate irrigation for optimal productivity. According to evapotranspiration trends, the water requirements will become greater in the future. However, it is not guaranteed that the water supply will be sufficient in olive-growing areas where aridity is higher and water resources are scarce. The results of this study are very important for evaluating water deficit and water resources in vulnerable olive-growing areas throughout Extremadura.

The transverse momentum distribution of J/ψ mesons produced in pp collisions at the center-of-mass energy 5 TeV, 7 TeV，and 13 TeV is described by the modified Hagedorn function which is based on the Tsallis function and Hagedorn function. The calculated results by the modified Hagedorn function are in accord with experimental data measured by the LHCb Collaboration at LHC. The related parameters are obtained and analyzed.

Considered one of the finest first-generation Nigerian writers, John Pepper Clark-Bekederemo, who passed away on 13th October, 2020, had been categorised as a Eurocentric writer. This work assesses the authenticity or otherwise of this critics’ perception of Clark by critiquing his America, their America. By analysing this autobiography vis-à-vis the notion of self and other which is a theoretical concern in contemporary travel writing, it was established, among other things, that every culture has its dark sides which it must not feel too proud to change as time and situation demand; that Clark vehemently rejects the Americans’ claim of sophistication and superiority of their culture over African culture. The paper concludes that contemporary travel writing should be a rightful site for negotiating cultural, political and diplomatic compromises between the Self and the Other since the gulf may be difficult to close altogether.

Pesticide exposure is a growing concern for public health. Although Brazil is the world's largest consumer of pesticides, few studies addressed the health effects among farmers. This study aimed to evaluate whether pesticide exposure is associated with respiratory outcomes among rural workers and relatives in Brazil during the crop and off-seasons. 82 family farmers were interviewed about occupational history and respiratory symptoms, and cholinesterase tests were conducted in the crop-season. Spirometry was performed during the crop and off-season. Respiratory outcomes were compared between seasons and multiple regressions were conducted to search for associations with exposure indicators. Participants were occupationally and environmentally exposed to multiple pesticides from an early age. During the crop and off-season, respectively, they presented a prevalence of 40% and 30.7% for cough, 30.7% and 24% for nasal allergies, and 24% and 17.3% for chest tightness. Significant relations between spirometry impairments and exposure indicators were found both during the crop and off-season. These findings provide complementary evidence about the association of pesticide exposure with adverse respiratory effects among family farmers in Brazil. This situation requires special attention as it may increase the risk of pulmonary dysfunctions, and the morbidity and mortality burden associated with these diseases.

This paper focuses on the role of the most common mineralogical techniques applied to the identification of the different statuary qualities in white, grey and black Göktepe marble. For this purpose, a Roman case of sculpture marble collection from the rural villa of Valdetorres de Jarama (central Iberia), of the 4th century AD, is presented. The mythological statuary, combining white, grey and black marbles, are one of the most outstanding marble collections in Aphrodisian style found in Hispania. The analytical results (Petrography, Cathodoluminescence, C and O isotopes, and Sr and Mn concentration) support the identification of two varieties of “black” Göktepe, traditionally named as bigio morato and bigo antico, as well as the best statuary quality on white Göktepe. In addition, the analytical identification of other Asiatic marbles in Valdetorres collection, a white coarse-grained originally from the quarries of Aphrodisias city and one small piece identified as Carian red from Iasos, corroborates the already suggested strong connection existing between artists and the stone material they chose for their works. Finally, it is noteworthy the identification carried out on the marble of the bases that served as seats for the sculptures, as it is a white marble of lower quality whose analytical characteristics are consistent with the Microasiatic marble of Denizli. The use of these exotic and exceptional raw materials confirms the taste for luxury and decorative richness in Late Antique Hispanic rural villae and contributes to a better understanding of the distribution of Aphrodisian productions in the Western Roman provinces.

Dried blood spot (DBS) testing on confetti is one of the most common methods used to collect and extract DNA from field samples for molecular epidemiology of malaria studies. Here, we investigated whether ethanol or other solutions used to clean scissors are a source of sample contamination. DBS were prepared from 3 drops of blood from two Plasmodium falciparum cultures spotted on confetti, and 3 solutions (water, ethanol and DNase) were used to clean scissors between spots during DNA extraction. For each cleaning solution, two blank confetti were used as negative controls. Samples were analyzed by PCR-based genotyping of merozoite surface proteins 1 & 2 (msp-1 and msp-2), and P. falciparum chloroquine resistance transporter (Pfcrt). A total of 15 samples were analyzed. Based on msp-1 and msp-2 amplification, P. falciparum was detected on blank confetti when scissors were washed with ethanol. Based on Pfcrt amplification, DNA of P. falciparum was detected on blank confetti when scissors were cleaned with ethanol or water. No P. falciparum genes were detected on blank confetti when scissors were cleaned with DNase. Scissors cleaned with DNase prevented cross-contamination between samples during processing of dried blood spots, whereas ethanol (which is commonly used) fails to avert cross-contamination.

LPA3 receptors were expressed in TREx HEK 293 cells, and their signaling and phosphorylation were studied. The agonist, lysophosphatidic acid (LPA), increased intracellular calcium and ERK phosphorylation through pertussis toxin-insensitive processes. Phorbol myristate acetate, but not LPA, desensitizes LPA3-mediated calcium signaling. The agonists and the phorbol ester-induced LPA3 internalization. Pitstop 2 (clathrin heavy chain inhibitor) markedly reduced LPA-induced receptor internalization; in contrast, phorbol ester-induced internalization was only delayed. LPA induced rapid β-arrestin-LPA3 receptor association. The agonist and the phorbol ester induced marked LPA3 receptor phosphorylation, and phosphorylation sites were detected using mass spectrometry. Phosphorylated residues were detected in the intracellular loop 3 (S221, T224, S225, and S229) and in the carboxyl terminus (S321, S325, S331, T333, S335, Y337, and S343). Interestingly, phosphorylation sites are within sequences predicted to constitute β-arrestin binding sites. These data provide insight into LPA3 receptor signaling and regulation.

Lysophosphatidic acid (LPA) type 3 (LPA3) receptor mutants were generated in which the sites detected phosphorylated were substituted by non-phosphorylatable amino acids. Substitutions were made in the intracellular loop 3 (IL3 mutant), the carboxyl terminus (Ctail), and both domains (IL3/Ctail). The wild-type (WT) receptor and the mutants were expressed in T-REx HEK293 cells, and the consequences of the substitutions were analyzed employing different functional parameters. Agonist- and LPA-mediated receptor phosphorylation was diminished in the IL3 and Ctail mutants and essentially abolished in the IL3/Ctail mutant, indicating that the main sites were substituted and distributed in both domains. The WT and mutant receptors increased intracellular calcium and ERK 1/2 phosphorylation in response to LPA and PMA. An increase in baseline ERK phosphorylation was detected in the IL3/Ctail mutant. LPA and PMA-induced receptor interaction with β-arrestin 2 and LPA3 internalization were severely diminished in the mutants. Mutant-expressing cells also exhibit increased baseline proliferation and response to different stimuli, which were inhibited by the antagonist Ki16425, suggesting a role of LPA receptors in this process. Migration in response to different attractants was markedly increased in the Ctail mutant, which the Ki16425 antagonist also attenuated.

Objectives: To investigate the etiology of amyotrophic lateral sclerosis (ALS) in an adult female patient. Methods: We conducted trio genome sequencing on a 35-year-old woman with progressive weakness in her left upper limb, as well as on her parents. Prior to sequencing, we performed a comprehensive neurological work-up on the patient, including neurological exam, electrophysiology, biomarker assessment, and brain and spinal cord MRI. Results : The propositus experienced weakness and atrophy in her left hand 6 months before the evaluation. This was associated with brisk reflexes and Hoffman sign in the same arm. Electroneuromyography revealed lower motor neuron involvement in three body regions. Neurofilament light chains were elevated in her cerebrospinal fluid. Brain imaging showed asymmetrical T2 hyperintensity of the corticospinal tracts and T2 linear hypointensity of the precentral gyri. Genome trio sequencing identified a likely pathogenic de novo variant in the propositus’s KIF1A gene (NM_001244008.2): c.574A&gt;G, p.(Ile192Val). Discussion: Pathogenic variants in the KIF1A gene have been associated with a wide range of neurological manifestations called KIF1A-associated neurological diseases (KAND). The present report describe a likely pathogenic de novo variant in KIF1A associated with ALS, expanding the phenotypic spectrum of KAND and our understanding of the pathophysiology of ALS.

Objective To analyze the influence of HIV in penitentiary institutions through an exhaustive lexiconmetric and sentiment analysis of news in the Spanish written press related to HIV and prison. Material an method observational, descriptive, and retrospective design based on news published in Spanish newspapers from 1981 to 2020, linking HIV infection with penitentiary institutions. Natural language processing and lexiconmetry techniques were used, using the Python programming language and ATLAS Ti v.9 software. Result: 318 articles were analyzed, with 10,502 distinct words. The sentiment of news was evaluated in three different periods: the discovery of HIV, and the periods before and after the existence of antiretroviral treatments. N-gram analysis and word cloud creation were carried out for each period. In the initial phase, ignorance predominated, and prominent terms such as "homosexual," "isolate," "test," "trial," or "confirm" were observed. In the period before antiretroviral treatments, news reflected negative feelings and criticism of prison policy, with keywords such as "give birth," "drug," "carrier," or "disease." With the arrival of treatments, news showed an evolution towards a more positive tone, highlighting terms such as "treatment," "release," or "syringes”.Conclusions: The presence of HIV in Spanish prisons has experienced a significant evolution from an alarming situation to an improvement in the care of inmates, driven by institutional adaptation and advances in antiretroviral treatments.

Despite the efforts made to stop the tuberculosis (TB) epidemic, it still remains one of the leading causes of death from an infectious disease. Previous work in the group uncovered a new family of amides which showed promising activities against Mycobacterium tuberculosis. A closer look at the literature showed that these compounds are structurally related to the DNB family of DprE1 inhibitors, so, we decided to study a wide range of substituted amides and determine their activity, focusing on unexplored structures related to the dinitrobenzamides (DNB) found in the literature. To synthesize our library of compounds we started from 3,5-dinitrobenzoic acid to form the nitroaromatic core that is characteristic of the DNB’s, to which we then added linear or cyclic amine moieties. Additionally, the impact of terminal aromatic moieties was also assessed for some derivatives, via an ether, ester, or amide bond. In order to obtain the desired derivatives, multiple synthetic approaches were used, mainly focused on nucleophilic addition/elimination reactions, SN2 reactions and Mitsunobu reactions. The activity was impacted mainly by two structural features, the addition of an aromatic moiety as a terminal group and the type of the linker. The most interesting compounds exhibited activities comparable to isoniazid and DNB1. Computational studies were also performed aimed at understanding their possible interactions with DprE1. The most active compounds are a good starting point for further development, and we plan to study an extended family of compounds based in those structures.

CO₂ geological storage in deep saline aquifers was recently developed at industrial scale mainly in sandstone formations. Experiences on CO₂ injections in carbonates aquifers for permanent trapping are quite limited, mostly from US projects such as AEP Mountaineer, Michigan and Williston Basin. The behavior of fractures in carbonates plays a key role in those reservoirs in which porous matrix permeability is very poor, which drives the CO₂ plume migration through the fracture network where hydromechanics and geochemical effects take place due to injection. Hontomín (Spain) is the actual on-shore injection pilot in Europe (EP Resolution of 14 January 2014), whose reservoir is comprised of fractured carbonates. Existing experiences from field scale tests conducted on site have supported to better understand the behavior of this type of reservoirs for CO₂ geological storage. Innovative CO₂ injection strategies are being carried out in ENOS Project (EU H2020 Programme, http://www.enos-project.eu). First results based on field tests conducted at Hontomín, and the advanced modelling developed so far will be analyzed and discussed in this article, as well as, the description of future works. The evolution of operating parameters such as flow rate, pressure and recovery term during the tests confirm the CO₂ migration through the fractures.