The octopus keel is a trait that has been hypothesized to be connected with burrowing in octopuses, but has never been explored in any detail. This research aimed to test for anWe investigated the association between these two traits phylogenies using two approaches independent sets of methods. First, we examined phylogenetic correlation between presence of a keel and known burrowing behavior in incirrate octopuses.by using a phylogenetic approach, benthic octopuses as a group were examined for known burrowing and the presence of a keel to determine whether an evolutionary relationship exists between these traits. Second, burrowing and non-burrowing captive Muusoctopus leioderma were evaluated for keel prominence to determine whether the keel is lost more rapidly in non-burrowing individuals. Pagel’s test for the coevolution of binary characteristics showed the model of best fit for the resulting phylogenetic tree to be one of evolutionary interdependence, and that non-burrowing Muusoctopus leioderma lost their keels over time, while burrowing individuals maintained their keels. Together, these results indicate the keel may be a trait associated with burrowing in octopuses.

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.

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.

A novel approach for designing acceptance sampling plans is presented. It is based on the Bayesian conformity assessment framework from JCGM 106. In particular, the concept of conformance probability plays a central role in the new approach. The new approach takes into account both the producer's and the consumer's perspective by allowing each to have their own prior. In parallel, the JCGM 106 framework allows the definition of Bayesian consumer's and producer's risks which complement the "classical" risks defined in the ISO 2859 and ISO 3951 series. The new approach also casts a new light on the plans from the ISO standards.

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 nuclear factor-ĸB (NF-ĸB) transcriptional system is a major effector pathway involved in inflammatory responses. Previous studies found that a Gardenia decoction (GD) inhibited the expression of NF-κB in a lipopolysaccharide (LPS)-stimulated mouse intestinal injury model. Herein, we hypothesized that geniposide (GE), a component of Gardenia jasminoides Ellis, also exerts anti-inflammatory effects and inhibits NF-ĸB activity in LPS-induced intestinal epithelial cells (IEC-6). IEC-6 cells were stimulated with LPS, following which the effects of GE on NF-ĸB signaling in the IEC-6 cells were examined by western blotting to detect IĸB phosphorylation/degradation. The expression of NF-κB was determined by immunofluorescence assay (IFA). Enzyme-linked immunosorbent assay (ELISA) was used to detect the inhibitory effect of GE on the release of tumor necrosis factor-α (TNF-α), interleukin-6 (IL-6) and interleukin-1β (IL-1β) activated by LPS in IEC-6 cells. In addition, the migration ability of IEC-6 cells was observed by the scratch method. These results showed that GE dose-dependently downregulated levels of the proinflammatory cytokines TNF-α, IL-6 and IL-1β that had been upregulated by LPS and suppressed the phosphorylation of IĸB and NF-ĸB induced by LPS. Our findings indicated that GE could reduce LPS-induced NF-ĸB signaling and proinflammatory expression in IEC-6 cells and significantly enhance the migration of IEC-6 cells. Moreover, GE inhibited the expression of NF-κB, nuclear transfer, and transcriptional activity in IEC-6 cells. GE could block the synthesis of inflammatory factors of IEC-6 cells by inhibiting activation of the IĸB/NF-κB signaling pathway induced by LPS.

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 discusses complexity theory, that is, the many theories that have been proposed for emergence of complexity from the underlying physics. Our aim is to identify which aspects have turned out to be the more fundamental ones as regards the emergence of biology, engineering, and digital computing, as opposed to those that are in fact more peripheral in these contexts. In the cases we consider, complexity arises via adaptive modular hierarchical structures that are open systems involving broken symmetries. Each emergent level is causally effective because of the meshing together of upwards and downwards causation that takes place consistently with the underlying physics. Various physical constraints limit the outcomes that can be achieved. The underlying issue concerns the origin of consciousness and agency given the basis of life in physics, which is structured starting from symmetries and variational principles with no trace of agency. A possible solution is to admit that consciousness is an irreducible emergent property of matter.

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.

Significant challenges exist globally regarding literacy teaching and learning, particularly in poor socio-economic settings in countries of the Global South. In this paper we argue that to address these challenges, major features of how the brain works that are currently ignored in the educational literature should be taken into account. First, perception is an active process based in detection of errors in hierarchical predictions of sensory data and action outcomes. Reading is a particular case. Second, emotions play a key role in underlying cognitive functioning. Innate affective systems underlie and shape all brain functioning, including oral and written forms of language and sign. Third, there is not the fundamental difference between listening/speaking and reading/writing often alleged on the basis of evolutionary arguments. Both are socio-cultural practices driven and learnt by the communication imperative of the social brain. Fourth, like listening, reading is not a linear, bottom-up process. Both are non-linear contextually shaped psycho-social processes of understanding, shaped by current knowledge and cultural contexts and practices. Reductionist neuroscience studies which focus on decontextualized parts of reading cannot access all the relevant processes. An integrated view of brain function reflecting this non-linear nature implies that an ongoing focus on personal meaning and understanding provides positive conditions for all aspects of literacy learning. Assessment of literacy teaching at all its stages should include indicators that take into account these foundational features relating reading and writing to neuroscience.

Pelagic stingray (Pteroplatytrygon violacea) is the only species of stingray (Dasyatidae) that utilizes both pelagic and demersal habitats. It is the main bycatch species in pelagic longline fisheries targeting bluefin tuna in the Gulf of Lions. In the Mediterranean Sea, their stock structure, behavioural ecology and movements are unknown. For the first time in the Mediterranean, 17 individuals (39 to 60 cm disc width) were tagged with pop-up satellite archival transmitting tags using a novel method of tag attachment, to investigate horizontal and vertical movements. The tags were attached for between two and 60 days. Between the months of July and October, pelagic stingray occupied a temperature range of 12.5 to 26.6°C, and a depth range extending from the surface to 480 m. Monthly trends in catch-per-unit-effort (CPUE) of pelagic stingray peaked in August and decreased by late autumn. Pelagic stingray may aggregate on the continental shelf during summer, and move southwards in early autumn, and this movement pattern is considered in relation to the reproductive cycle and overwintering. Future work and options for bycatch mitigation are discussed.

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.

Floodplains are critically important ecosystems that provide a whole suite of ecosystem services including nutrient and carbon sequestration, flood mitigation, water storage, and critical wildlife habitat to name a few. However, human modification of rivers and floodplains through channelization, artificial levee construction, reduction in active floodplain area, and water management can significantly reduce the ecosystem function of river-floodplain systems. In this study, we evaluated the changes in nutrient loading of the Kissimmee River floodplain during the restoration of the river-floodplain system. In addition to time-series loading analysis, we also evaluated soil nutrient concentrations across the lower portion of the Kissimmee River floodplain. During the 44-year nutrient loading time-series, the floodplain remained a nutrient exporter with changes in nutrient loading generally corresponding to both water quality (i.e. point source reductions) and hydrologic restoration activities in the watershed and Kissimmee River floodplain. During the study period, inputs of total phosphorus and total nitrogen loads from upstream either significantly increased or remained the same. In addition to external sources of nutrients, internal sources of nutrients from floodplain soils can also contribute to the total nutrient export from the system. These internal sources could be organic via the decomposition of organic matter or geologic from the original excavation of the canal and/or restoration backfilling. Soil nutrient concentrations vary between vegetative communities and landscape position and could be a significant source of phosphorus to the downstream system which is plagued by eutrophic conditions. Therefore, as floodplain function in the Kissimmee River continues to be restored and managed, additional effort may be needed to address nutrient inputs and internal legacy nutrients.

The onset of the thermal instability is investigated in a porous channel with plane parallel boundaries saturated by a non–Newtonian shear–thinning fluid and subject to a horizontal throughflow. The Ellis model is adopted to describe the fluid rheology. Both horizontal boundaries are assumed to be impermeable. A uniform heat flux is supplied through the lower boundary, while the upper boundary is kept at a uniform temperature. Such an asymmetric setup of the thermal boundary conditions is analysed via a numerical solution of the linear stability eigenvalue problem. The linear stability analysis is developed for three–dimensional normal modes of perturbation showing that the transverse modes are the most unstable. The destabilising effect of the non-Newtonian shear–thinning character of the fluid is also demonstrated as compared to the behaviour displayed, for the same flow configuration, by a Newtonian fluid.

There exists a plethora of studies examining the psychological and physical impacts of COVID-19 on infected victims. Fewer studies have been published assessing the different types of impacts that an individual’s COVID-19 infection has on close friends and family members. This is the first scoping review to gauge the reported psychosocial issues and daily hassles that impact the relatives and friends of infected individuals. This study was conducted by inputting key terms/MeSH terms into selected internet databases to locate prospective studies. The frameworks of scoping reviews by Arksey et al. and the Preferred Reporting Items for Systematic Review and Meta-Analyses (PRISMA) were utilized in the methodology for identifying and selecting the studies. After data extraction, 37 studies were deemed suitable for analysis. The findings generated from each study was placed into combined categories. A total of 16 combined categories were generated from the amalgamation of the findings. The results show that psychosocial feelings (e.g., anxiety, stress, depression) was the category with the highest prevalence of grouped findings. The results from this study may serve as the impetus for future interventions targeting the alleviation of psychosocial feelings or day to day hassles associated with having a loved one inflicted with a severe illness.

A neglected dimension of the fire regime concept is fire patchiness. Habitat mosaics that emerge from the grain of burned and unburned patches (pyrodiversity) are critical for the persistence of a diverse range of plant and animal species. This issue is of particular importance in frequently burned tropical Eucalyptus savannas, where coarse fire mosaics have been hypothesized to have caused the recent drastic population declines of small mammals. Satellites routinely used for fire mapping in these systems are unable to accurately map fine-grained fire mosaics, frustrating our ability to determine whether declines in biodiversity are associated with local pyrodiversity. To advance this problem, we have developed a novel method (we call ‘double-differenced dNBR’) that combines the infrequent (c. bi-monthly) detailed spatial resolution Landsat with daily coarse scale coverage of MODIS and VIIRS to map pyrodiversity in the savannas of Kakadu National Park. We used seasonal Landsat mosaics and differenced Normalized Burn Ratio (dNBR) to define burned areas, with a modification to dNBR that subtracts long-term average dNBR to increase contrast. Our results show this approach is effective in mapping fine-scale fire mosaics in the homogenous lowland savannas, although inappropriate for nearby heterogenous landscapes. Comparison of this methods to other fire metrics (e.g., area burned, seasonality) based on Landsat and MODIS imagery suggest this method is likely accurate and better at quantifying fine-scale patchiness of fire, albeit it demands detailed field validation.

Metastasis is a critical step in the process of carcinogenesis and a vast majority of cancer related mortalities result from metastat-ic disease that is resistant to current therapies. Cell migration and invasion are the first steps of the metastasis process, which mainly occurs by two important biological mechanisms i.e., cytoskeletal remodelling and Epithelial to Mesenchymal Transition (EMT). Akt (also known as Protein Kinase B) is a central signalling molecule of the PI3K-Akt signalling pathway. Aberrant acti-vation of this pathway has been identified in a wide range of cancers. Several studies have revealed that Akt actively engages with the migratory process in motile cells, including metastatic cancer cells. The downstream signalling mechanism of Akt in cell migration depends upon the tumour type, sites, and intracellular localisation of activated Akt. In this review, we focus on the role of Akt in the regulation of two events that control cell migration and invasion in various cancers including head and neck squamous cell carcinoma (HNSCC) and the status of PI3K-Akt pathway inhibitors in clinical trials in HNSCC.

Euglenids are a group of algae of great interest for biotechnology, with a large and complex metabolic capability. To study the metabolic network, it is necessary to know the subcellular locations of the component enzymes, but despite a long history of research into Euglena, the subcellular locations of many major pathways are only poorly defined. Euglena is phylogenetically distant from other commonly studied algae, they have secondary plastids bounded by three membranes, and they can survive after destruction of their plastids. These unusual features make it difficult to assume that the subcellular organization of the metabolic network will be equivalent to that of other photosynthetic organisms. Moreover, we show here that the presence of the secondary chloroplast means that it is not possible to make reliable predictions of the subcellular locations of enzymes in Euglena using existing informatics tools. In order to generate a model of the central metabolic pathway operating in Euglena we analysed biochemical and proteomic information from a variety of sources to assess the subcellular location of relevant enzymes. We use these assignments to propose the compartmentation of the core metabolic pathways in Euglena, a prerequisite for the further study of the metabolic network of Euglena. This model of the metabolic network shows that, other than photosynthesis, all major pathways present in the chloroplast are duplicated elsewhere in the cell, and that several biosynthetic pathways confined to plastids in higher plants are localized elsewhere in Euglena. Our model demonstrates how this organism can synthesise all the metabolites required for growth from simple carbon inputs, and can survive in the absence of chloroplasts.

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

Limited observational studies have described the relationship between sleep duration and overall diet. The present study investigated the association between sleep duration at weekdays and empirically derived dietary patterns in a nationally representative sample of UK adults, aged 19-64 years old, participating in the 2008-2012 UK National Diet and Nutrition Survey Rolling Programme. Survey members completed between three to four days of dietary records. Sleep duration at weekdays was categorised into tertiles to reflect short, normal and long sleep duration. Social jetlag was calculated as the difference between sleep duration at weekends and weekdays. The association between sleep duration/ social jetlag and dietary patterns, derived by principal components analysis, was assessed regressing diet on sleep whilst accounting for the complex survey design and adjusting for relevant confounders. Survey members in the highest tertile of sleep duration had on average 0.45 (95% CI -0.78, -0.12) lower healthy dietary pattern score compared to middle tertile (p =0.007). There was an inverted u-shaped association between social jetlag and a healthy dietary pattern, such that when sleep at weekends exceeded weekday sleep by 1h 45min, scores for indicating a healthy dietary pattern declined (p =0.005). In conclusion, long sleep duration at weekdays and an increased social jetlag are associated with a lower healthy dietary pattern score. Further research is required to address factors influencing dietary patterns in long sleepers.

Oral cancer cells (TYS) and the signalling pathways involved in metastasis, in response to cancer-associated fibroblasts (CAFs, COM) and normal oral mucosal fibroblasts (MM1) was studied. Metastatic cell behaviour was observed by cell-scatter, 3D-collagen gel migration and 3D-spheroid invasion assays. Akt, MAPK, EGFR, TGFβRii and CXCR4 inhibitors were used to identify the signalling pathways involved. Signalling pathway protein expression and activation were assessed by SDS-PAGE and Western Blotting. COM-CM (conditioned medium) and MM1-CM stimulated cancer cell scattering, which was blocked only by the Akt inhibitor. COM-CM induced scattered cancer cells showed higher levels of Akt phosphorylation than the negative control and MM1-CM. Migration and invasion of TYS cells into the collagen gels from the spheroids was stimulated by CM from both sources, compared to the negative control. COM cells stimulated TYS, cancer cell invasion into the collagen more than MM1 and the control. Akt and EGFR inhibitors effectively blocked CM and COM cell-induced invasion. Akt-silenced cancer cells were not stimulated to migrate and invade by fibroblast-CM and did not survive addition of the EGFR inhibitor. This suggests that CAFs stimulate oral cancer cell migration and invasion in an Akt- dependent manner. EGFR and Akt are potential therapy targets in metastatic oral cancer.

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.

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 report cross-shore profile evolution at Palanga, eastern Baltic Sea where short period waves dominate. Cross-shore profile studies began directly after a significant coastal erosion caused by storm “Anatoly” in December of 1999 and continued for a year. Further measurements were undertaken sixteen years later. Cross-shore profile ∆V(x) changes were described, and cross-shore transport rates Q(x) were calculated. A K-means clustering technique was applied to determine sections of the profile with the same development tendencies. Profile evolution was strongly influenced by the depth of closure which is constrained by a moraine layer and the presence of a groyne. The method used divided the profile into four clusters: the 1st cluster in the deepest water represents profile evolution limited by the depth of closure, and the 2nd and 3rd mostly are affected by processes induced by wind, wave and sea-water level changes. The most intensive sediment volume changes were observed directly after the coastal erosion. The largest sand accumulation was in the 4th profile cluster, which includes the upper beach and dunes. Seaward extension of the dune system caused a narrowing of the visible beach which has led to an increased sand volume (accretion) being misinterpreted as erosion

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.

Ethanolic extracts of propolis collected from Apis mellifera hives have been shown to reduce Nosema ceranae infection in honey bee workers. This study aimed to determine the propolis concentration that optimizes the control of N. ceranae infection in honey bee workers. Newly emerged worker bees were individually fed 2 μL of 50% sucrose solution (w/v) containing 105 N. ceranae spores per bee, and treated with 0%, 25%, 50%, and 75% ethanolic extracted propolis in 50% sucrose solution (v/v). The treated bees were maintained in cages at 34 ± 2˚C and 55 ± 5% RH throughout the study. The number of dead bees was counted and removed from the cages daily for 30 days to generate survival curves. The number of N. ceranae spores per bee (infectivity) was quantified using a hemocytometer, and the number of infected bees per hundred bees (infection rate) was determined. The survival rates of N. ceranae infected bees fed 25%, 50%, and 75% propolis (NP1, NP2, NP3, respectively) were significantly higher than those of infected bees not fed propolis (NO). Furthermore, the infectivity and infection rates of NP2 and NP3 groups were significantly lower than those of the NO group. The infectivity and infection rates of the NP1 group were not different than those of the NO group. Our data suggest that 50% and 75% propolis extracts are appropriate concentrations for treating N. ceranae infection in honey bees. Ethanolic extracted propolis can be an alternative treatment for N. ceranae infection in Western honey bees.

Metalloproteinases are zinc-dependent endopeptidases that function as primary effectors of tissue remodelling, cell-signalling, and many other roles. Their regulation is ferociously complex, and is exquisitely sensitive to their molecular milieu, making in vivo studies challenging. Phenanthroline (PhN) is an inexpensive, broad-spectrum inhibitor of metalloproteinases that functions by chelating the catalytic zinc ion, however its use in vivo has been limited due to suspected off-target effects. PhN is very similar in structure to phenanthrene (Phe), a well-studied poly aromatic hydrocarbon (PAH) known to cause toxicity in aquatic animals by activating the aryl hydrocarbon receptor (AhR). We show that zebrafish are more sensitive to PhN than Phe, and that PhN causes a superset of the effects caused by Phe. Morpholino knock-down of the AhR rescues the effects of PhN that are shared with Phe, suggesting these are due to PAH toxicity. The effects of PhN that are not shared with Phe (specifically disruption of neural crest development and angiogenesis) involve processes known to depend on metalloproteinase activity. Furthermore these PhN-specific effects are not rescued by AhR knock-down, suggesting that these are bona fide effects of metalloproteinase inhibition, and that PhN can be used as a broad spectrum metalloproteinase inhibitor for studies with zebrafish in vivo.

Measurement-Device-Independent Quantum Key Distribution (MDI-QKD) is a two-photon protocol devised to eliminate eavesdropping attacks that interrogate or control the detector in realized quantum key distribution systems. In MDI-QKD, the measurements are carried out by an untrusted third party, and the measurement results are announced openly. Knowledge or control of the measurement results gives the third party no information about the secret key. Error-free implementation of the MDI-QKD protocol requires the crypto-communicating parties, Alice and Bob, to independently prepare and transmit single photons that are physically indistinguishable, with the possible exception of their polarization states. In this paper, we apply the formalism of quantum optics and Monte Carlo simulations to quantify the impact of small errors in wavelength, bandwidth, polarization and timing between Alice's photons and Bob's photons on the MDI-QKD quantum bit error rate (QBER). Using published single-photon source characteristics from two-photon interference experiments as a test case, our simulations predict that the finite tolerances of these sources contribute (4.04+/-20/N_sifted) to the QBER in an MDI-QKD implementation generating an N_sifted-bit sifted key.

Background: Distal sensory polyneuropathy (DSP) and distal neuropathic pain (DNP) remain significant challenges for older people with HIV (PWH), necessitating enhanced clinical attention. HIV and certain antiretroviral therapies (ART) can compromise mitochondrial function and impact mitochondrial DNA (mtDNA) replication, which is linked to DSP in ART-treated PWH. Methods: This study investigated mtDNA, mt fission and fusion protein, and mt electron transport chain protein changes in the dorsal root ganglion (DRG) and sural nerve (SuN) from 11 autopsied PWH. In antemortem standardized assessments, six had no or one sign of DSP, while five exhibited two or more DSP signs. Digital droplet polymerase chain reaction (ddPCR) measured mtDNA quantity and the common deletion (CD) in isolated DNA. Results: We found lower mtDNA copy numbers in DSP+ donors. SuN exhibited a higher proportion of mtDNA CD than DRGs in both groups. Mitochondrial electron transport chain (ETC) proteins were altered in DRG of DSP+ compared to DSP- donors, particularly complex I. Conclusion: These findings suggest reduced mtDNA quantity and increased CD abundance may contribute to DSP in PWH, indicating diminished mitochondrial activity in sensory neurons. Accumulated ETC proteins in the DRG imply impaired mitochondrial transport to the sensory neuron's distal portion. Identifying molecules to safeguard mitochondrial integrity could aid in treating or preventing HIV-associated peripheral neuropathy.

It has been previously shown that aldehyde dehydrogenase (ALDH) family member ALDH1A1 has a significant association with acute myeloid leukemia (AML) patient risk group classification, and that AML cells lacking ALDH1A1 expression can be readily killed by chemotherapy. In the past, however, a redundancy between the activities of subgroup members of the ALDH family has hampered conclusive evidence for addressing the role of specific ALDH genes. We here describe the bioinformatics evaluation of all nineteen member genes of the ALDH family as prospective actionable targets for the development of methods aimed to improve AML treatment. We implicate ALDH1A1 in the development of recurrent AML, and we show that from the nineteen members of the ALDH family, ALDH1A1 and ALDH2 have the strongest association with AML patient risk group classification. Furthermore, we discover that the sum of the expression values for RNA from the genes ALDH1A1 and ALDH2 has a stronger association with AML patient risk group classification and survival than either one gene alone. In conclusion, we identify ALDH1A1 and ALDH2 as prospective actionable targets for the treatment of AML in high risk patients. Substances that inhibit both enzymatic activities can constitute potentially effective pharmaceutics.

Coronavirus disease 2019 (COVID-19), caused by the novel coronavirus SARS-CoV-2, has been confirmed in over 10,000,000 individuals worldwide and has resulted in more than 500,000 deaths in a few months since it first surfaced. With such a rapid spread it is no surprise that there has been a massive effort around the world to collectively elucidate the mechanism by which the virus is transmitted. Despite this, there is still no definitive consensus regarding droplet versus airborne transmission of SARS-CoV-2. Public health officials around the world have introduced guidelines within the scope of droplet transmission. However, increasing evidence and comparative analysis with similar coronaviruses, such as severe acute respiratory syndrome (SARS-CoV-1) and middle eastern respiratory syndrome (MERS), suggest that airborne transmission of SARS-CoV-2 cannot be effectively ruled out. As the data supporting COVID-19 airborne transmission grows, there needs to be an increased effort in terms of technical and policy measures to mitigate the spread of viral aerosols. These measures can be in the form of broader social distancing and facial covering guidelines, exploration of thermal inactivation in clinical settings, low-dose UV-C light implementation, and greater attention to ventilation and airflow control systems. This review summarizes the current evidence available about airborne transmission of SARS-CoV-2, available literature about airborne transmission of similar viruses, and finally the methods that are already available or can be easily adapted to deal with a virus capable of airborne transmission.

Using the colloidal method, Au NP’s were deposited onto 6 different supports (TiO2,  and -Al2O3, HFeO2, CeO2, and C), and their catalytic activity and selectivity were compared in the alkylation of aniline by benzyl alcohol. Correlations were made between the nature of the support, the Au NP size and H-binding energy.

Human Rhinovirus (HRV) is the most common cause of upper respiratory infections and exacerbations of asthma. In this work, we selected 14 peptides (6 from HRV A and 8 from HRV C) encompassing potential CD4 T cell epitopes. Peptides were selected for being highly conserved in HRV A and C serotypes and predicted to bind to multiple HLA II molecules. We found positive T cell recall responses by IFNγ-ELISPOT assays to 8 peptides, validating 7 of them (3 from HRV A and 4 from HRV C) as CD4 T cell epitopes through intracellular cytokine staining assays. Additionally, we verified their promiscuous binding to multiple HLA II molecules by quantitative binding assays. According to their experimental HLA II binding profile, the combination of all these 7 epitopes could be presented and recognized by > 95 % of the world population. We actually determined IFNγ responses to a pool encompassing these CD4 T cell epitopes by intracellular cytokine staining, finding positive responses in 29 out of 30 donors. The CD4 T cell epitopes identified in this study could be key to monitor HRV infections and to develop peptide-based vaccines against most HRV A and C serotypes.

Neisseria meningitidis outer membrane vesicles or proteoliposomes (PLs) has been used as vaccines and adjuvant. Despite the presence of potentially toxic amounts of lipopolysaccharide (LPS), they have been shown to be safe, well tolerated, and immunogenic. This suggests that LPS-PL may have reduced LPS toxicity. We show here that the ability of PL to induce pro-inflammatory cytokine production in human U937 histiocytic cell line is significantly lesser than that of an equivalent concentration of purified LPS, thus confirming that certain components or physical properties of PL reduce the pro-inflammatory activity of their endogenous LPS. To investigate the mechanisms responsible for this protective effect, PLs were fractionated and assayed the ability of the resulting fractions to induce inflammatory cytokine expression. Several individual PLs fractions were more potent inducers of pro-inflammatory cytokine production than the unfractionated PLs. The majority of the pro-inflammatory activities appeared to be mediated by the presence of LPS in the fractions, as shown by the ability of an anti-CD14 antibody to block it. However, in two PL fractions, the production of IL-8 and to a lesser extent IL-6 was not inhibited by anti-CD14 treatment, indicating that pro-inflammatory components other than LPS could also be present in PL. Eight proteins present in the fractions were identified by n-terminal sequencing. Our results suggest that two of them PorB and particularly the RmpM protein may also contribute to the pro-inflammatory activity of N. meningitidis PL. Our results could support the development of PLs as vaccine adjuvant.

There is no routine approach to identify patients with gynecologic malignancies at high risk for chemotherapy-resistance. Circulating tumor DNA (ctDNA) tumor fraction (TFx) represents a minimally-invasive approach to tumor profiling, with as yet limited data on utility in gynecologic malignancies. The objective was to investigate the use of ctDNA TFx in a cohort of patients with ovarian and endometrial cancer. Plasma samples from patients with biopsy-proven ovarian or endometrial cancer collected between 4/2018 and 4/2020 were subjected to shallow whole genome sequencing with determination of TFx via ichorCNA package. The association of TFx to continuous and categorical baseline clinicopathologic factors and progression-free survival was assessed. 210 plasma samples from 78 patients with gynecologic cancers were analyzed. Mean TFx for ovarian cancer was 5.5% and endometrial cancer 2.4% and there was no significant difference in TFx among histology either for endometrial or ovarian cancers. Grade was associated with significant difference in ‘sentinel’ TFx among ovarian cancers but not endometrial cancers. ctDNA TFx dynamics over time demonstrated rapid clearance of ctDNA in most patients with ovarian cancer, while endometrial cancer had consistently low TFx. ctDNA TFx is feasible in ovarian and endometrial cancers and may be a valuable important tool for prognostication.

Background: Patients undergoing brain tumor resection experience changes to their neurocognitive abilities, many of which can be difficult to predict. We hypothesized that changes in brain connectivity could predict changes in neurocognitive functioning, demonstrating the potential for brain connectivity aware surgical planning to provide enhanced outcomes for patients. Methods: Patients underwent functional and diffusion MR scanning and neuropsychological testing before tumor resection and two weeks post-resection. Using this functional and diffusion imaging, we measured changes in the topology of the functional and structural graph networks, respectively. From the neuropsychological testing scores, we derived a composite score that describes a patient’s overall level of neurocognitive functioning. We then used a multiple linear regression model to test if structural and functional connectivity measures could predict changes in composite scores. Results: Twenty-one subjects completed imaging and neuropsychological evaluation both before and after surgery. The multiple linear regression model showed that changes in functional local efficiency were inversely correlated with changes in composite score (p

8-oxoguanine glycosylase 1 (OGG1), which was initially identified as the enzyme that catalyzes the first step in the DNA base excision repair pathway, is now known also as a modulator of gene expression. What is important for cancer, is that OGG1 acts as a modulator of NFκB-driven gene expression. Specifically, oxidant stress in the cell transiently halts the enzymatic activity of substrate-bound OGG1. The stalled OGG1 facilitates DNA binding of transactivators, including NFκB, to their cognate sites to enable expression of cytokines and chemokines, with ensuing recruitment of inflammatory cells. Recently, we highlighted chief aspects of OGG1 involvement in regulation of gene expression, which have a significance in lung cancer development. However, OGG1 has also been implicated in the molecular underpinning of acute myeloid leukemia. In general, the capacity of cancer cells to adapt to oxidative stress depends on molecular systems such as the interface of OGG1 with NFκB, which bestows a cancer cell with the molecular mechanism of transformation of its microenvironment to enable adaptation and survival of malignant clones.

A 23-month-old neutered male dog of unknown ancestry presented with a history of progressive neurological signs that included anxiety, cognitive impairment, tremors, seizure activity, ataxia, and pronounced visual impairment. The clinical signs were accompanied by global brain atrophy. Due to progression in the severity of disease signs, the dog was euthanized at 26 months of age. Examination of tissues collected at necropsy revealed dramatic intracellular accumulations of autofluorescent inclusions in the brain, retina, and cardiac muscle. The inclusions were immunopositive for subunit c of mitochondrial ATP synthase, and their ultrastructural appearances were similar to those of lysosomal storage bodies that accumulate in some of the neuronal ceroid lipofuscinosis (NCL) diseases. The also dog exhibited widespread neuroinflammation. Based on these findings, the dog was deemed likely to have suffered from a form of NCL. A whole genome sequence analysis of the proband’s DNA revealed a homozygous C to T substitution that altered the intron 3 – exon 4 splice site of CLN6. Other mutations in CLN6 cause NCL diseases in humans and animals including dogs. CLN6 protein was undetectable with immunolabeling in the tissues of the proband. Based on the clinical history, fluorescence and electron-microscopy, immunohistochemistry, and molecular genetic findings, the disorder in this dog is classified as an NCL resulting from the absence of CLN6 protein. Screening the dog’s genome for a panel of breed-specific polymorphisms indicated that its ancestry included numerous breeds, with no single breed predominating. This suggests that the CLN6 disease variant is likely to be present in other mixed breed dogs and at least some of the ancestral breeds.

Prostate cancer contributes to cancer-related deaths globally, and the etiology of this disease is not yet fully understood. While Human Papillomavirus (HPV) has been associated with several types of cancer, including cervical, anal, and oropharyngeal cancer, studies investigating the relationship between HPV and prostate cancer have shown mixed results. This systematic review aimed to evaluate the causative association between HPV and prostate cancer using Bradford Hill's criteria. A comprehensive search of PubMed was conducted, and 60 out of 482 studies were included in the review. The included studies were evaluated based on nine Bradford Hill criteria, and information on the identification and transmission of the virus and potential oncogenic mechanisms was also extracted. The strength of association criterion was not met, and other criteria, such as consistency and coherence, were not fulfilled. However, biological plausibility was supported, and potential oncogenic mechanisms were identified. While some studies have reported the presence of HPV in prostate cancer tissues, the overall quality of evidence remains low, and the association between HPV and prostate cancer is weak. Nevertheless, the prostate is a potential reservoir for the transmission of HPV, and the HPV E6 and E7 oncoproteins and inflammation are likely to be involved in any oncogenic mechanisms. Further studies with a higher level of evidence are needed to establish a definitive link between HPV and prostate cancer.

Euglena gracilis is an alga of great biotechnological interest and extensive metabolic capacity, able to make high levels of bioactive compounds, such as polyunsaturated fatty acids, vitamins and β-glucan. Previous work has shown that Euglena expresses a wide range of carbohydrate-active enzymes, suggesting an unexpectedly high capacity for the synthesis of complex carbohydrates for a single-celled organism. Here, we present an analysis of some of the carbohydrates synthesised by Euglena gracilis. Analysis of the sugar nucleotide pool showed that there are the substrates necessary for synthesis of complex polysaccharides, including the unusual sugar galactofuranose. Lectin- and antibody-based profiling of whole cells and extracted carbohydrates revealed a complex galactan, xylan and aminosugar based surface. Protein N-glycan profiling, however, indicated that just simple high mannose-type glycans are present and that they are partially modified with putative aminoethylphosphonate moieties. Together, these data indicate that Euglena possesses a complex glycan surface, unrelated to plant cell walls, while its protein glycosylation is simple. Taken together, these findings suggest that Euglena gracilis may lend itself to the production of pharmaceutical glycoproteins.

Objective: This analysis investigates patient experiences regarding pain management during gynecological procedures through a comprehensive survey, aiming to address the lack of clear guidelines in the clinical landscape and emphasize the importance of effective pain management strategies in enhancing patient care and satisfaction. Design: A cross-sectional survey with 258 respondents assessed pain management experiences during gynecological procedures. The survey was distributed via Qualtrics, and 258 responses were obtained. Participants/Materials, Setting, Methods: Participants provided demographic information and responded to questions regarding contraceptive methods, procedures undergone, pain management discussions, anxiety levels, and willingness to accept pain management interventions. Confidentiality and informed consent protocols were strictly observed throughout the study. Results: Most female respondents reported diverse contraceptive methods and procedures. Pain management discussions and provisions varied, with a significant portion reporting never being offered pain management. Many experienced anxiety and pain during procedures, with varying intensities, that were not addressed or discussed by their treating provider. Most expressed willingness to accept pain management interventions. Limitations: This study relies on self-reported data, potentially introducing recall bias, and has limited generalizability due to its cross-sectional design. Conclusions: Findings reveal a significant gap in pain management provision and discussion during gynecological procedures. Improved guidelines and practices are necessary to address patient discomfort effectively. Standardized pain management protocols are crucial to enhance patient experiences and outcomes, with further research needed to tailor strategies to individual patient needs.

Field and numerical investigations at Happisburgh, East coast of England, UK, sought to characterize beach thickness and determine geologic framework controls on coastal change. After a major failure of coastal protection infrastructure, removal of about 1 km of coastal defense along the otherwise protected cliffed coastline of Happisburgh triggered a period of rapid erosion over 20 years of ca. 140 m. Previous sensitivity studies suggested that that beach thickness plays a major role in coastal recession. These studies were limited, however, by a lack of beach volume data. In this study, we have integrated the insights gained from our understanding of the Quaternary geology of the area, a novel non-intrusive passive seismic survey method, and a 3D novel representation of the subsurface source and transportable material into a coastal modelling environment to explore the role of beach thickness on the back wearing and down wearing of the cliffs and consolidated platform, respectively. Results show that beach thickness is non-homogeneous along the study site: we estimate that the contribution to nearshore sediment budget via platform down wearing is of a similar order of magnitude as sediment lost from the beach and therefore non-negligible. We have provided a range of evidence to support the idea that the Happisburgh beach is a relatively thin layer perched on a sediment rich platform of sand and gravel. This conceptualization differs from previous publications, which assumes that the platform was mostly till and fine material. This has direct implication on the regional sediment management of along this coastline. The present study contributes to our understanding of a poorly known aspect of coastal sediment budgeting and outlines a quantitative approach that allows for simple integration of geological understanding for coastline evolution assessments worldwide.

Abstract: A progressive neurological disorder was observed in a male neutered Weimaraner. Clinical signs included fecal incontinence, lethargy, moderate paraparesis, proprioceptive pelvic limb ataxia, falling, cognitive decline, incoordination, decreased interest in food, changes in posture, and episodes of trance-like behavior. Neurologic signs were first observed at approximately 4 years, 10 months of age and progressed slowly. Magnetic resonance imaging showed generalized brain atrophy with areas of white matter pathology. Humane euthanasia was elected at 6 years, 7 months of age due to increasing severity of the neurological signs. Autoflorescent intracellular granules were observed in the cerebral and cerebellar cortexes, optic nerve, and cardiac muscle of the affected dog. These abnormal inclusions in the cerebral cortex and cardiac muscle immunolabeled with antibodies to mitochondrial ATP synthase subunit c protein, like that observed in the neuronal ceroid lipofuscinosis group of lysosomal storage diseases. Immunolabeling also demonstrated pronounced neuroinflammation in brain tissues. The ultrastructural appearances of the disease-related inclusion bodies in the brain and optic nerve were quite variable. The ultrastructure and locations of many of the inclusions in the nervous tissues suggested that they were derived, at least in part, from the myelin surrounding axons. The storage bodies in the cardiac muscle were located in mitochondria-rich regions and consisted of parallel arrays of membrane-like components interspersed with electron-dense flocculent material. The disease was characterized by pronounced abnormalities in the myelin of the brain and optic nerve consisting of distinctive areas of ballooning between the layers of myelin. The whole genome sequence generated from the affected dog contained a homozygous G-to-A missense mutation in CNP, which encodes proteins with CNPase enzyme activity and a structural role in myelin. The mutation predicts a Thr42Met amino acid sequence substitution. Genotyping of archived Weimaraner DNA samples identified an additional G>A variant homozygote with a clinical history and brain lesions similar to those of the proband. Of 292 Weimaraners and over 4,000 other dogs of various breeds, the proband and the other Weimaraner that exhibited similar signs were the only two that were homozygous for the CNP missense variant. CNPase immunolabeling was widespread in brain tissues from normal dogs but was undetectable in the same tissues from the proband. Based on the clinical history, fluorescence and electron-microscopy, immunohistochemistry, and molecular genetic findings, the late-onset Weimaraner disorder likely results from the missense mutation that results in CNPase deficiency, leading to myelin abnormalities, accumulation of lysosomal storage bodies, and brain atrophy. Similar disorders have been associated with different CNP variants in Dalmatians and in human subjects.

There is a significant overlap between HIV infection and substance use disorders. Dopamine (DA) is the most abundantly upregulated neurotransmitter in Methamphetamine abuse, with receptors (DRD1-5) that are expressed by neurons as well as by a large diversity of cell types, including innate immune cells that are targets of HIV infection, making them responsive to the hyperdopaminergic environment that is characteristic of stimulant drugs. Therefore, the presence of high levels of dopamine may affect the pathogenesis of HIV, particularly in the brain. The stimulation of HIV-latently infected U1 promonocytes with DA significantly increased viral p24 levels in the supernatant at 24 hrs, suggesting effects on activation and replication. Using selective agonists to different DRDs, we found that DRD1 played a major role in activating viral transcription, followed by DRD4, which increased p24 with a slower kinetic. Transcriptome and systems biology analyses led to the identification of a cluster of genes responsive to DA, where S100A8 and S100A9 were most significantly correlated with the early increase of p24 levels following DA stimulation. Conversely, DA increased the expression of these genes’ transcripts at the protein level, respectively MRP8 and MRP14, which form a complex also known as Calprotectin. Interestingly, MRP8/14 was able to stimulate HIV transcription in latent U1 cells, and this occurred via binding to the receptor for advanced glycosylation end-product (RAGE). Using selective agonists, both DRD1 and DRD4 increased MRP8/14 on the surface and in the cytoplasm, as well as secreted in the supernatants. On the other hand, while DRD1/5 did not affect the expression of RAGE, DRD4 stimulation caused its downregulation, offering a mechanistic for the delayed effect via DRD4 on p24 increase. To cross-validate MRP8/14 as a DA signature with biomarker value, we tested its expression in HIV+ Meth users’ brains and peripheral cells. MRP8/14+ cells were more frequently identified in mesolimbic areas such as basal ganglia of HIV+ Meth+ cases compared to HIV+ non-Meth users or to controls. Likewise, MRP8/14+ CD11b+ monocytes were more frequent in HIV+ Meth users, particularly in participants with detectable viral load in the CSF. Overall, our results suggest that the MRP8 and MRP14 complex may serve as a signature to distinguish subjects using addictive substances in the context of HIV, and that this may play a role in aggravating HIV pathology by promoting viral replication in people with HIV who use Meth.

The current performance indicator for universal salt iodization (USI) is the percent of households using adequately iodized salt. However, the proportion of dietary salt from household salt is decreasing with the increase in consumption of processed foods and condiments globally. This paper reports on case studies supported by the GAIN-UNICEF USI Partnership Project to investigate processed food industry use of adequately iodized salt in contrasting national contexts. Studies were conducted in Egypt, Indonesia, the Philippines, the Russian Federation, and Ukraine. In all cases, the potential iodine intake from iodized salt in selected food products was modelled according to the formula: Quantity of salt per unit of food product x minimum regulated iodine level of salt at production x average daily per capita consumption of the product. The percent of adult recommended nutrient intake for iodine potentially provided by the average daily intake of bread and frequently consumed foods and condiments was from 10% to 80% at the individual product level. The potential contribution to iodine intake from the use of iodized salt in the processed food industry is of growing significance. National USI strategies should encourage co-operative industry engagement and include regulatory monitoring of iodized salt use in the food industry in order to achieve optimal population iodine status.

Twelve wild North American Porcupines (Erethizon dorsatum) were diagnosed with dermatopathies while being cared for at two wildlife rehabilitation clinics. Biopsy and necropsy were performed on 7 and 5 animals respectively. Atypical dermatophytosis was diagnosed in all cases. Lesions consisted of diffuse severe epidermal hyperkeratosis and mild hyperplasia, with mild lymphoplasmacytic dermatitis, and no folliculitis. Dermatophytes were noted histologically as hyphae and spores in hair shafts, and follicular and epidermal keratin. Trichophyton sp. was grown in 5/6 animals where culture was performed, with molecular diagnosis of Arthroderma benhamiae / Trichophyton mentagrophytes in these 5 cases. Metagenomic analysis of formalin-fixed paraffin-embedded tissue samples from 3 cases identified fungi from 17 orders in phyla Basidiomycota and Ascomycota. Alteration of therapy from ketaconazole, which was unsuccessful in 4 of 5 early cases, to terbinafine or nitraconazole lead to resolution of disease and recovery to release in four subsequent animals. In all, 6 animals were euthanized or died due to dermatopathy, no cases resolved spontaneously, and 6 cases resolved with therapy. The work we present demonstrates an atypical lesion and anatomical distribution due to dermatophytosis in a series of free-ranging wild porcupines and successful development of novel techniques for extraction and sequencing nucleic acids from fungus in archival formalin-fixed paraffin-embedded animal tissue.

In cotton cultivars, an insect that causes irreversible damage is the Spodoptera frugiperda, known as the fall armyworm. Since the visual detection of plants is a burdensome task for human inspection, the spectral information related to plant damage, registered on a spectral scale, can be useful. These measurements, associated with machine learning techniques, produce useful information for a rapid and non-invasive inspection method development. To contribute to this gap fulfillment, this paper proposes a machine learning framework to model the spectral response of cotton plants under the attack of the fall armyworm. Additionally, a theoretical model is presented, built from the results of the machine learning analysis, to infer this damage with up-to-date orbital sensors. The data was composed of the reflectance measurements collected at a cotton field with control plants and plants submitted to Spodoptera frugiperda damage. Their spectral response was recorded with a hand-held spectroradiometer ranging from 350 to 2,500 nm, for eight consecutive days. Different machine learning models were evaluated and the overall best model was defined by accuracies comparisons on a testing-set. A ranking approach was adopted based on the model accuracy, returning the most contributive wavelengths for the classification. Sequentially, an unsupervised neural network (Self-Organizing Map - SOM) was implemented to reduce data-dimensionality and assist in the definition of important spectral regions. The regions were associated with the spectral bands of the two sensors (OLI and MSI) and a theoretical model using a band simulation process with the overall best machine learning model was proposed. The results indicated that the Random Forest (RF) algorithm is the most suitable to predict cotton-plants damaged by insects and that the last day of analysis (8th day) was better to separate it, with F-measure equals 0.912. The ranking approach combined with the SOM method indicated the spectral regions at the red to near-infrared (650 to 1,350 nm) and shortwave infrared (1,570 to 1,640 nm) as the most important regions to the analysis. The proposed theoretical model simulated with the OLI and MSI sensor-bands returned an F-Measure of 0.865 and 0.886, respectively. In conclusion, this framework can be used to map cotton-plants under insect-attack. The theoretical model presents high accuracy to infer the insect-damaged on cotton plants based on multispectral bands from other sensors, being a useful tool for future research that intends to evaluate it in other areas and at different field scales.

The practice of nurse health coaching (NHC) draws from the art and science of nursing, behavioral sciences, and evidence-based health coaching methods. This secondary analysis of the audio-recorded natural language of participants during NHC sessions of our recent 8-week RCT evaluates improvement over time in cognitive-behavioral outcomes: Change Talk, Resiliency, Self-Efficacy/Independent Agency, Insight & Pattern Recognition, and Building Towards Sustainability. We developed a measurement tool for coding, Indicators of Health Behavior Change (IHBC), that was designed to allow trained health coach experts to assess the presence and frequency of the indicators in the natural language content of participants. We used a two-step method for randomly selecting the 20-minute audio-recorded session that was analyzed at each time point. Fifty-six participants had high-quality audio recordings of the NHC sessions. Twelve participants were placed in the social determinants of health (SDH) group based on the following: low income (<$20,000/year), early-onset hypertension, and social disadvantages. Our analyses significantly improved Change Talk and the other four factors over time. Our factor analyses indicated two distinct factors at each measurement point of the study, demonstrating the stability of the outcome measures over time. Our newly developed measurement tool, IHBC, proved stable in structure over time and sensitive to change. This NHC program shows promise in improving cognitive-behavioral indicators associated with health behavior change in both non-SDH and SDH individuals.

Li-ion cell designs, component integrity and manufacturing processes all have critical influence on the safety of Li-ion batteries. Any internal defective features that induce a short circuit, can trigger a thermal runaway: a cascade of reactions, leading to a device fire. As consumer device manufacturers push aggressively for increased battery energy, instances of field failure are increasingly reported. Notably Samsung made a press release in 2017 following a total product recall of their Galaxy Note 7 mobile phone, confirming speculation that the events were attributable to the battery and its mode of manufacture. Recent incidences of battery swelling on the new iPhone 8 have been reported in the media, and the techniques and lessons reported herein may have future relevance. Here we look deeper into the key components of one of these cells and confirm evidence of cracking of electrode material in tightly folded areas, combined with a delamination of surface coating on the separator, which itself is an unusually thin monolayer. We report microstructural information about the electrodes, battery welding attributes and thermal mapping of the battery whilst operational. The findings point to the most likely combination of events and highlights the impact of design features, whilst providing structural considerations most likely to have led to the reported incidences relating to this phone.

Culture-positive (CP) and culture-negative (CN) periprosthetic joint infections (PJI) remain a crucial area of research; however, current studies comparing these infections rely on unstandardized outcome reporting tools. Our study aimed to compare the outcomes of CP and CN PJI using the standardized Musculoskeletal Infection Society (MSIS) outcome reporting tool. We retrospectively reviewed 138 patients who were diagnosed with PJI and indicated for two-stage revision total knee arthroplasty (rTKA). The majority of patients in both CP and CN cohorts achieved infection control without the need for reoperation (54.1% and 62.5%, respectively). There was a significant difference in the overall distribution of MSIS outcomes (p=0.043), with a significantly greater rate of CN patients falling into Tier 1 (infection control without the use of suppressive antibiotics) (52.5% versus 29.6%, p=0.011). There was also a significant difference in the distribution of septic versus aseptic reoperations after 2nd stage (p=0.013), with more CP reoperations being septic and more CN reoperations being aseptic. The duration from 1st to 2nd stage was significantly shorter in the CN cohort (p=0.002). While overall infection control was similar between cohorts, these data suggest that the outcomes of two-stage rTKA are favorable in cases of CN PJI.

Cognitive impairment is a condition which affects aging patient populations and is becoming more prevalent as the geriatric population expands. It is categorized by the extent of cognitive decline, memory loss, functional abilities, and the capability to perform daily tasks. Based on the degree of impairment, it is classified as mild cognitive impairment or dementia. Considering the debilitating nature of cognitive decline and its impact on quality of life, prevention is key. In addition, given the gradual progression of the underlying causes of cognitive decline, early diagnosis and appropriate management has the potential to offer clinical advantages and better patient outcomes. Management options discussed vary from pharmaceutical regimens to neurosurgical interventions, with differing outcomes based on etiology of cognitive impairment.

The taxonomy of the Fabeae (Vicieae) has long been problematic, but an analysis by Schaefer et al in 2012 gave an exceptionally clear view of the tribe and noted the possibility that some nomenclatural adjustments may be required at some future date. These authors suggested several options, expressing some preferences. However, there has been a recent change to formally accepted names implementing one of these possibilities, but without any additional relevant information. This change seems unjustified and unhelpful. We therefore present an argument for the retention, or re-instatement, of the genera Pisum, Vavilovia and Lens until such time as new data supports this requirement and there is no nomenclatural solution that is both accurate and convenient.

Currently, there are few effective methods to monitor patients with gynecologic malignancies, including ovarian and endometrial cancers. The ‘tumor fraction’ of circulating tumor DNA may offer a minimally-invasive method to evaluate tumor aggressiveness via simple blood draw. To date, there is limited data on utility of ctDNA TFx interrogation in gynecologic malignancies, although there is evidence that TFx may be low or undetectable in malignancies primarily confined to the peritoneal cavity. The objective was a descriptive assessment of ctDNA TFx in a cohort of patients with ovarian and endometrial cancer. The association of TFx to continuous and categorical baseline clinicopathologic factors and progression-free survival was assessed. In a large cohort comprised of 210 plasma samples from 78 patients with biopsy-proven ovarian and endometrial cancer, plasma samples collected between 4/2018 and 4/2020 were subjected to shallow whole genome sequencing with determination of TFx. Overall, we demonstrate that TFx was low for most samples with mean TFx for ovarian cancer 5.5% and endometrial cancer 2.4%, yet can be quantified above lower limit of detection in many patients particularly when evaluating serial samples. There was no significant association between TFx level and clinical (primary vs recurrent, best response) or pathologic (e.g. histology, grade) features. Our data demonstrates low TFx levels in ovarian and endometrial cancers likely reflect that tumor types are ‘low ctDNA shed’, suggesting that higher sensitivity assessments may be required for clinical utility.

Background: Early diagnosis of postoperative complications is an urgent task, allowing timely prescribing of appropriate therapy and reducing the cost of patient treatment. Prognostic models based on various data could help in the early diagnosis of postoperative complications after cardiac surgery. Objectives: The purpose of the study was to determine whether an integrated approach based on clinical data along with metabolites and biomarkers had greater predictive value than the models built on less data. Methods: The study included patients (n=62) admitted for planned cardiac surgery (coronary artery bypass grafting with cardiopulmonary bypass), who were retrospectively divided into two groups depending on the presence (n=26) or absence (n=36) of postoperative complications of all types. Clinical and laboratory data on the first day after surgery were analyzed. Additionally, patients' blood samples were collected before and on the first day after surgery to determine biomarkers (interleukin-6, procalcitonin, NT-proBNP, high-sensitivity troponin T) and metabolites (8 aromatic and 2 dicarboxylic acids were detected using gas chromatography-mass spectrometry). Results: Patients before surgery, compared with healthy donors, differed in the concentration of metabolites (p &lt; 0.05), and had concentrations of a number of biomarkers exceeding the corresponding reference values. Multivariate PLS-DA models, predicting the presence or absence of postoperative complications, were built using clinical data (ROC-AUC=0.71), concentrations of metabolites and biomarkers (ROC-AUC=0.60), and the entire data set (ROC-AUC=0.75). For comparison we built univariate models using the EuroScore2 (ROC-AUC=0.59) and SOFA (ROC-AUC=0.76) scales; concentrations of lactate (ROC-AUC=0.71), the dynamic changes of 4-hydroxyphenyllactic acid (ROC-AUC=0.69), and the sum of three sepsis-associated metabolites (ROC-AUC=0.70). The proposed complex model using entire data set was comparable to the SOFA scale, which confirms the expediency of searching for new predictive models based on a variety of factors.

Milk serves as a crucial source of natural bioactive compounds essential for human nutrition and health. The gastrointestinal digestion of milk proteins releases various biologically active peptides that positively impact human health and enhance physiological performance. With the growing production of cheese, Greek yogurt, and other dairy products, the volume of unutilized acid whey is significantly increasing. Acid whey, containing almost all whey proteins and approximately one-quarter of casein, presents a valuable raw material for generating peptides with potential health benefits. These peptides exhibit properties such as antioxidant, antimicrobial, anti-inflammatory, anticarcinogenic, antihypertensive, antithrombotic, opioid, mineral-binding, and growth-stimulating activities, contributing to improved human immunity and the treatment of chronic diseases. Enzymatic hydrolysis of milk proteins has been developed as a method to produce these peptides, facilitating their use in food fortification. To incorporate whey into functional beverages, it undergoes fermentation by lactic acid bacteria with proteolytic activity. To specifically enrich these beverages with peptides exhibiting targeted bioactivities, it is essential to select lactic acid bacteria strains possessing the requisite protease profiles. Additionally, the sensory properties of the final product can be enhanced using starter cultures with diverse metabolic capabilities, even in the absence of added flavoring agents. Given the imperative to develop waste-free technologies and enhance the profitability of the dairy industry, there is a growing need to efficiently utilize and transform acid whey into a broad spectrum of valuable products and food additives. This approach is justified not only by the nutritional benefits of the bioactive components in whey but also by the commercial potential of safe and health-enhancing products.

In regions lacking genomic data, analysis of sequences from the early stages of an outbreak can provide important insights into the diversity of pathogens present. Following the detection of the first imported case of COVID-19 in the Northern sector of Ghana on 13^th March 2020, we have now molecularly characterized and phylogenetically analysed sequences including three (3) complete genomes of the severe acute respiratory syndrome coronavirus 2 (SARS‐CoV‐2) isolated from nine (9) patients observed in Ghana. Eight (8) of these patients reported with a recent history of foreign travel and one (1) with no history of foreign travel. We performed high throughput sequencing for 9 samples following the determination of high concentration of viral RNA. In addition, we estimated the potential impact that long distance transportation of samples to testing centres may have on sequencing outcomes. Here, two samples that were closest in terms of viral RNA concentration but transported from sites which are over 400km apart were assessed. All sequences were compared to previous sequences from Ghana and representative sequences from regions where our patients had previously travelled. Complete genomes were obtained for three (3) sequences and with another near complete genome with a coverage of 95.6%. Sequences with coverage in excess of 80% were found to belong to three lineages namely A, B.1 and B.2. Our sequences clustered in two different clades with the majority falling within a clade composed of sequences from sub-Saharan Africa. Less RNA fragmentation was seen in sample KATH23 which was collected 9km compared with sample TTH6 which was collected and transported over a distance of 400km to the testing site. The clustering of several sequences from sub-Saharan Africa suggests regional circulation of the viruses in the subregion. Importantly, there may be the need to decentralize testing sites and build more capacity across Africa to boost the sequencing output of the subregion.

The paper focuses on the application of a multilevel, integrative and territorial approach to the protection of cultural heritage through planning instruments in Serbia. It points out the problems of the sectoral approach and discusses international recommendations that can be integrated into the planning methodology. The case study is the area of Djerdap National Park, which has an already established international and national importance. The research suggests that the cultural heritage in the area, with the exception of the Roman limes, is still recognized at the level of individual localities. The study emphasizes the importance of aligning all levels of governance to safeguard the whole spatial entity rather than focusing solely on its particular areas. The interna-tional and national importance of the planning area contributes to the strengthening of awareness of heritage and its institutional protection. However, the vitality of the area, which is key to its sustainable development, comes from the local level. Planning documents contribute to the inte-gration of local values and local communities into development programs and projects.

The impact of interaction SS with MJO on rainfall along Java Island to East Nusa Tenggara has been studied using daily rainfall observation data from 2140 weather observation stations, which are also equipped with GSMaP, OLR, and ERA5 data. There were 61 SS events found, 17 during active MJO and 44 in inactive MJO. Rainfall increases more in the western study area when the active MJO and more in the eastern study area when the inactive MJO is due to SS. SS reduces rainfall in the Jakarta region, regardless of the activity or inactivity of the MJO. SS causes extreme rainfall to only occur in a small part of certain areas, so it tends to significantly reduce the possibility of extreme rainfall. In the southern part of the IMC, SS predominates over MJO in supporting increased water vapor transport. Large-scale synoptic circulations like the monsoon, SS, and MJO can interact with local land-sea wind circulation to produce spatiotemporal variability in rainfall on Java Island. Rainfall mostly increases in the afternoon and decreases in the morning when SS occurs, whether there is MJO or not. Convective instability analysis indicates that SS increases precipitation, most likely by lowering CIN and raising VIMFC.

In order to shorten the detection time and improve the average precision on embedded devices, A lightweight and high accuracy model is proposed for passion fruit in complex environments (backlight, occlusion, overlap, sunny, cloudy, rainy). Firstly, replacing the backbone network of YOLOv5 with a lightweight GhostNet model reduces the number of parameters and computation while improving detection speed. Secondly, a new feature branch is added to the GhostNet network, and the feature fusion layer in the neck network is reconstructed to effectively combine the lower-level and higher-level features, which not only improves the accuracy of the model but also maintains its lightweight. Finally, the knowledge distillation methods are used to transfer the knowledge from the more capable teacher model to the less capable student model, which significantly improving the detection accuracy. The improved model is denoted as G-YOLO-NK. The average accuracy of the G-YOLO-NK network is 96.00%, which is 1.00% higher than the original YOLOv5s model. Furthermore, the improved model size is 7.14MB, reduced to half of the original model, and the real-time detection frame rate is 11.25 FPS on the Jetson Nano. Compared to the state-of-the-art model, the proposed model outperforms them in terms of average precision and detection performance. The present work provides an effective model for real-time detection of passion fruits in complex orchard scenes, which can provide valuable technical support for the development of orchard picking robots and greatly improve the intelligence level of orchards.

The Simultaneous Localization And Mapping (SLAM) scanner is an easy and portable Light Detection And Ranging (LiDAR) data acquisition device. Its main output is a 3D point cloud covering the scanned scene. Regarding the importance of accuracy in the survey domain, this paper aims to assess the accuracy of two SLAM scanners: the NavVis VLX and the BLK2GO Scanner. This assessment is conducted for both outdoor and indoor environments. In this context, two types of reference data are used: the Total Station (TS) and the static scanner Z+F Imager 5016. To carry out the assessment, four comparisons are tested: cloud to cloud, cloud to mesh, mesh to mesh, and edge detection board assessment. However, the results of the assessments confirm that the accuracy of indoor SLAM scanner measurements (5 mm) is greater than that of outdoor ones (between 10 mm and 60 mm). Moreover, the comparison of cloud to cloud provides the best accuracy regarding direct accuracy measurement without manipulations. Finally, based on the high accuracy, scanning speed, flexibility, and the accuracy differences between tested cases, it is confirmed that SLAM scanners are effective tools for data acquisition.