The spread of ideas is a fundamental concern of today’s news ecology. Understanding the dynamics of the spread of information and its co-option by interested parties is of critical importance. Research on this topic has shown that individuals tend to cluster in echo-chambers and are driven by confirmation bias. In this paper, we leverage the active inference framework to provide an in silico model of confirmation bias and its effect on echo-chamber formation. We build a model based on active inference, where agents tend to sample information in order to justify their own view of reality, which eventually leads to them to have a high degree of certainty about their own beliefs. We show that, once agents have reached a certain level of certainty about their beliefs, it becomes very difficult to get them to change their views. This system of self-confirming beliefs is upheld and reinforced by the evolving relationship between agent's beliefs and its observations, which over time will continue to provide evidence for their ingrained ideas about the world. The epistemic communities that are consolidated by these shared beliefs, in turn, tend to produce perceptions of reality that reinforce those shared beliefs. We provide an active inference account of this community formation mechanism. We postulate that agents are driven by the epistemic value that they obtain from sampling or observing the behaviors of other agents. Inspired by digital social networks like Twitter, we build a generative model in which agents generate observable social claims or posts (e.g. `tweets') while reading the socially-observable claims of other agents, that lend support towards one of two mutually-exclusive abstract topics. Agents can choose which other agent they pay attention to at each timestep, and crucially who they attend to and what they choose to read influences their beliefs about the world. Agents also assess their local network’s perspective, influencing which kinds of posts they expect to see other agents making. The model was built and simulated simulated using the freely-available Python package pymdp. The proposed active inference model can reproduce the formation of echo-chambers over social networks, and gives us insight into the cognitive processes that lead to this phenomenon.

Despite the effectiveness of insulin injections in managing hyperglycemia in Type 1 Diabetes, they fall short in addressing autoimmunity and regenerating damaged islets. This review aims to explore the potential of various treatment modalities for T1DM, including mesenchymal stem cells (MSCs), MSC-derived exosomes, gene therapy, islet allotransplantation, and pancreatic islet cell transplantation. Results: MSCs demonstrate efficacy in T1DM treatment through immunomodulation and tissue regeneration, although further research is warranted to optimize their therapeutic potential. Gene therapy presents a promising approach despite challenges such as donor shortage and immune rejection. Pancreatic islet cell transplantation emerges as a viable option, albeit with associated risks including graft rejection and the need for immunosuppression. Teplizumab, an FDA-approved humanized monoclonal antibody, revolutionizes the treatment landscape of Type 1 Diabetes by significantly delaying its onset, offering a paradigm shift since the discovery of insulin Conclusion: Ongoing studies and technological advancements in T1DM management offer a promising outlook for improved treatments and possibly even eradication on a global scale. MSCs, MSC-derived exosomes, gene therapy, and pancreatic islet transplantation hold considerable potential.

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.

The design flood concept (DF) provides for an essential tool in designing the hydraulic works, in defining the reservoir operation programs and for a reliable flood hazard identification. Under a simplified approach, the maximum discharge and the floods volume are statistically processed to reasonably define the DF. Yet, the integral hydrograph provides additional key temporal and quantitative details of important significance for flood management and particularly for the res-ervoirs operation and associated risks of failures. The procedure presented in this paper (as applied on a set of compatibly shaped hydrographs) involves the following key stages: (i) normalize the floods, (ii) define similar flood shape classes and (iii) evaluate the average dimensionless flood (ADF) for each class. The ADFs are finally transformed into a set of (DF)s. Many statistical distributions approximate acceptably the frequent values of the maximum discharges or the flood volumes, yet displaying a significant spread for medium or rare probabilities of exceedance (PE). This scattering, which can be explained by the epistemic uncertainty, defines an area of uncertainty both for measured and extrapolated values. In considering upper and lower values of the uncertainty in-tervals as limits for maximum discharges and flood volumes, then by combining them compatibly, a set of DFs - as completely defined hydrographs, with different shapes - results for each PE. The herein proposed procedure defines both one peak DF and multi-peaks DF. Subsequently, such DFs do assist water managers in examining and establishing tailored approaches for a variety of input hydrographs. Among the DFs that would correspond to a same PE, the most compact floods arise a special interest, for they are basic in defining the set of safe operation rules for hydraulic structures.

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

In this research, new setting is introduced for new SuperHyperNotions, namely, an 1-failed SuperHyperForcing and Neutrosophic 1-failed SuperHyperForcing. Assume a SuperHyperGraph. Then an ``1-failed SuperHyperForcing'' $\mathcal{Z}(NSHG)$ for a neutrosophic SuperHyperGraph $NSHG:(V,E)$ is the maximum cardinality of a SuperHyperSet $S$ of black SuperHyperVertices (whereas SuperHyperVertices in $V(G) \setminus S$ are colored white) such that $V(G)$ isn't turned black after finitely many applications of ``the color-change rule'': a white SuperHyperVertex is converted to a black SuperHyperVertex if it is the only white SuperHyperNeighbor of a black SuperHyperVertex. The additional condition is referred by ``1-'' about the usage of any black SuperHyperVertex only once to act on white SuperHyperVertex to be black SuperHyperVertex; a ``neutrosophic 1-failed SuperHyperForcing'' $\mathcal{Z}_n(NSHG)$ for a neutrosophic SuperHyperGraph $NSHG:(V,E)$ is the maximum neutrosophic cardinality of a SuperHyperSet $S$ of black SuperHyperVertices (whereas SuperHyperVertices in $V(G) \setminus S$ are colored white) such that $V(G)$ isn't turned black after finitely many applications of ``the color-change rule'': a white SuperHyperVertex is converted to a black SuperHyperVertex if it is the only white SuperHyperNeighbor of a black SuperHyperVertex. The additional condition is referred by ``1-'' about the usage of any black SuperHyperVertex only once to act on white SuperHyperVertex to be black SuperHyperVertex. Assume a SuperHyperGraph. Then an ``$\delta-$1-failed SuperHyperForcing'' is a \underline{maximal} 1-failed SuperHyperForcing of SuperHyperVertices with \underline{maximum} cardinality such that either of the following expressions hold for the (neutrosophic) cardinalities of SuperHyperNeighbors of $s\in S:$ $~|S\cap N(s)| > |S\cap (V\setminus N(s))|+\delta,~|S\cap N(s)| < |S\cap (V\setminus N(s))|+\delta.$ The first Expression, holds if $S$ is an ``$\delta-$SuperHyperOffensive''. And the second Expression, holds if $S$ is an ``$\delta-$SuperHyperDefensive''; a``neutrosophic $\delta-$1-failed SuperHyperForcing'' is a \underline{maximal} neutrosophic 1-failed SuperHyperForcing of SuperHyperVertices with \underline{maximum} neutrosophic cardinality such that either of the following expressions hold for the neutrosophic cardinalities of SuperHyperNeighbors of $s\in S:$ $~|S\cap N(s)|_{neutrosophic} > |S\cap (V\setminus N(s))|_{neutrosophic}+\delta,~ |S\cap N(s)|_{neutrosophic} < |S\cap (V\setminus N(s))|_{neutrosophic}+\delta.$ The first Expression, holds if $S$ is a ``neutrosophic $\delta-$SuperHyperOffensive''. And the second Expression, holds if $S$ is a ``neutrosophic $\delta-$SuperHyperDefensive''. A basic familiarity with SuperHyperGraph theory and neutrosophic SuperHyperGraph theory are proposed.

In this research, new setting is introduced for new 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.

Taxonomic studies of dreams that continue to influence the dreamer’s thoughts and feelings after awakening have distinguished three types of impactful dreams: nightmares, existential dreams, and transcendent dreams. Of these, existential dreams and transcendent dreams are characterized by recurrent metacognitive appraisal of the epistemic tension between complementary (a) metaphoric (A “is” B) assertions and (b) literal (A “is not” B) assertions. Metacognitive appraisal of such complementary metaphoric and literal assertions is detectible as the felt sense of inexpressible realizations. The poesy of such inexpressible realizations depends upon the juxtaposition of a metaphoric topic and vehicle that are both “semantically dense” but at an abstract level “distant” from each other. The result is the “emergence” of attributes of the metaphoric vehicle that are sufficiently abstract to be attributes also of the metaphoric topic. The cumulative effect of successive metaphoric/literal categorical transformations produces a higher-level form of metacognition that is consistent with a neo-Kantian account of sublime feeling. Sublime feeling occurs as either sublime disquietude (existential dreams) or as sublime enthrallment (transcendent dreams). The aftereffects of these two dream types are thematically iterative “living metaphors” that have existential (but not totalizing) abstract ontological import.

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

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

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

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.

I introduce now for the first time the neutrosophic modal logic. The Neutrosophic Modal Logic includes the neutrosophic operators that express the modalities. It is an extension of neutrosophic predicate logic, and of neutrosophic propositional logic. In order for the paper to be self-contained, I also recall the etymology and definition of neutrosophy and of neutrosophic logic. Several examples are presented as well.

This article aimed at providing some extension of the modal square of opposition in the 1 light of Ockham’s account of the modal operators. Moreover, we shall set forth some significant 2 remarks on the de re-de dicto distinction and on the modal operator of contingency by means of a 3 Boolean algebra called Bitstring Semantics. This generalisation starting from Ockham’s account of 4 modalities will allow us to take into consideration whether Ockham’s thought on this matter holds 5 water or not, and in which case it should be changed in order to make it coherent.

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

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

In this research, 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.

Pancreatic ductal adenocarcinoma (PDAC) is the most common malignant tumor of the pancreas, carrying a poor prognosis, in most cases patients being diagnosed in a nonresectable stage. Image-based artificial intelligence (AI) models implemented in tumor detection, segmentation and classification could improve diagnosis with better treatment options and increased survival. This review included papers published in the last 5 years and describes the current trends in AI algorithms used in PDAC. We analyzed the applications of AI in detection of PDAC, segmentation of the lesion and classification algorithms used in differential diagnosis, prognosis, and histopathological and genomic prediction. The results show lack of multi-institutional collaboration and stresses the need for bigger datasets in order for AI models to be implemented in a clinically relevant manner.

The purpose of this research has been to analyze the organizational structures of the different federations and entities representing the modalities of trail-running, skyrunning and mountain running and how they have settled in the current sports landscape. The main task of these entities is to act as hosts of the legally established modalities, both internationally and nationally, applying their respective regulations and statutes unilaterally. Through an in-depth review of the different regulations, statutes and current articles of all the organizations that represent the different disciplines, we can observe how a sport modality that seems to be the same is nevertheless distant in its execution (regulations, championships, classifications, systems of points, ...) and that has led to the international level being established in different sport modalities (trail-running and skyrunning) and at the level of the Spanish territory, it has led to an administrative dispute to know who has the powers to approve the sports competitions.

Abstract: Nordic exercises aim to improve physical abilities and prevent injuries; However, it is not clear in what type of sports modalities to use it, so this study arises from the interest of ana-lyzing its effect in different sports modalities. Objective: To analyze Nordic exercises effects on the lower limbs, and their relationship with the explosive and absolute strength inherent to demands of different sports modalities (football, athletics, basketball, sport climbing, cycling and taekwondo). Method: quasi-experimental research, identifying 122 athletes (18±3 years old) from: football (n=24), athletics/speed (n=20), sport climbing (n=20), basketball (n=24), taekwondo (n=14) and cycling (n=20); classified into a control group CG (n=57) and an experimental group EG (n=65). Results: dominant absolute strength of the initial (12.4±0.51) and final (14.5±0.98) EG, in greater proportion in basketball (P= < 0.05); explosive strength of the initial (42.4±1.2) and final (45.8±1.5) EG, with a significant difference in all modalities between before and after (p≤0.05), except in cy-cling and taekwondo; no major changes were found in the GC. Conclusion: Nordic exercises are recommended as part of training to improve levels of explosive strength with emphasis on the modalities of football, basketball, athletics/speed and sport climbing, being applicable to increase absolute strength in basketball.

Cardiac amyloidosis (CA) results mainly from infiltration of myocardium by either immunoglobulin light chain fibrils (AL) or transthyretin fibrils (ATTR), causing restrictive cardiomyopathy and eventually death if untreated (3). AL derives from monoclonal immunoglobulin light chain produced by plasma cell clone in the bone marrow, while ATTR is the misfolded form of hepatically-derived transthyretin (TTR) protein, and could be hereditary (hATTR) or wild-type (wtATTR). Over the last decade, improvement in diagnostic imaging and better clinical awareness has unleashed a notable presence of CA in the community, especially ATTR in the elderly population. These multimodality imaging modalities include echocardiography, cardiac magnetic resonance and radionuclide scintigraphy with bone-avid tracers. There has been remarkable progress in the therapeutic landscape as well, and there are disease-modifying therapies available now that can alter the course of the disease and improve survival if initiated at an early stage in the disease. There remains an unmet need for detecting this disease accurately and early, so that these patients could benefit the most from newly-emerging therapies.

Among cross-sectional imaging modalities, computed tomography (CT) is more available and faster; however, magnetic resonance (MR) performs better in terms of sensitivity and specificity, due to its higher contrast resolution. The appearance of peritoneal deposits on CT and MR depends mainly on the primary tumour histology: in case of unknown primary tumour (3-5% of cases), their behaviour at imaging may provide insights on the tumour origin. The time-point of tumour evolution, previous or ongoing treatments and the peritoneal spaces where they occur, also play an important role in determining the appearance of peritoneal deposits. Thus, knowledge of peritoneal anatomy and fluid circulation is mandatory in detection and characterization of peritoneal deposits. Several benign and malignant conditions may show similar imaging features that overlap those of PC, making the differential diagnosis challenging. Clinical history, laboratory findings and previous imaging examinations must be considered to achieve the correct diagnosis.

This paper presents an overview of tomography and different tomographic imaging modalities. The goal of this paper is to provide an understanding of various imaging modalities; in particular, how the imaging is performed, working principles, and applications. It was not intended to provide the in-depth mathematical principles of these imaging modalities, rather this paper focuses on providing the knowledge in an easy-to-grasp manner for the readers' benefit. Imaging modalities are categorized based on the physics behind image generation. First, the paper explains the general tomography principle. Then explains Ultrasound Imaging, Electrical Impedance Tomography, Computed Tomography, Magnetic Resonance Imaging (MRI), Photoacoustic Tomography (PAT), and Positron Emission Tomography (PET). In the end, the paper provides the fundamentals and review of two relatively new imagining modalities, Diffuse Optical Tomography (DOT) and functional Near-infrared Spectroscopy (fNIRS).

Molecular imaging modalities are used for different type of cancers detection and diagnosis. In recent few years, there has been an increased focus on developing novel nanoparticles as new imaging contrast agents for early detection of cancer. The aim of this review article is to summarize molecular imaging technologies accompanying with using nanoparticles to improve potential imaging for cancer detection and hence valuable therapy in the future. Nanoprobes are rapidly becoming potentially transformative tools on cancer diagnostics for a wide range of imaging modalities such as CT, MRI, SPECT, PET, Ultrasound and Optical imaging. The study results seen in the recent literature are provided and discussed the diagnostic performance of imaging modalities for cancer diagnosis and their future directions. With knowledge of the correlation between the application of nanoparticles and molecular imaging modalities and with the development of targeted contrast agents or nanoprobes, they may provide better cancer diagnosis in the future.

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

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

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

The increased prevalence of obesity worldwide has been implicated for the alarming rise of the incidence of gestational diabetes and preeclampsia as well, both considered as threatening conditions for both mother and fetus. We studied gene polymorphisms of the proinflammatory cytokine Interleukin 6 (IL-6) and the gene expression levels of VEGF and VEGF-receptor all known to be involved in pregnancy complications aiming to identify possible predisposing risk factors in pregnancies with obesity. G allele of IL-6 was found to correspond with an increased risk for gestational diabetes and preeclampsia occurrence. Furthermore, in obese pregnant mothers with either gestational diabetes or pre-existing type 2 diabetes and to those developed preeclampsia it was confirmed that gene expression levels of VEGF were reduced while they were increased for VEGF receptor. We conclude that the genetic profile of the obese pregnant woman shares a common background with that of a pre-existing type 2 diabetes mellitus and therefore predisposes to complications in pregnancy.

There are several forms of maintenance high-efficiency hemodialysis (HD) including hemodiafiltrations (HDF) in different technic modes and expanded HD using dialyzers with medium cut-off membranes. The aim of the study was to assess the intradialytic tolerance and length of dialysis recovery time (DRT) in these modalities. This is an exploratory, cross-over study in maintenance HD patients with low comorbidity and no clinical indications for the use of high-efficiency HD, who were exposed to five intermittent dialysis in random order: high flux hemodialysis (S-HD), expanded HD (HDx), pre-dilution HDF (PRE-HDF), mix-dilution HDF (MIX-HDF) and post-dilution HDF (POST-HDF). 24 dialysis sessions of each method were included in the analysis. Dialysis parameters including blood flow rate, dialysis fluid flow rate and temperature, and pharmacological treatment were constant. Average total convection volume for post-HDF, pre-HDF and mix-HDF were 25.6 (3.8), 61.5 (7.2) and 47.1 (11.4) l, respectively. During all therapies, patients had similar hydration status monitored using bioimpedance spectroscopy and similar variability over time in systemic blood pressure, cardiac output, and peripheral resistance monitored using impedance cardiography. The lowest frequency of all intradialytic adverse events were observed during HDx. Delayed DRT was the shortest during PRE-HDF. Patients were also more likely to report immediate recovery while receiving PRE-HDF. These differences did not reach statistical significance, however the study results suggest that, intradialytic tolerance and DRT may depend on the dialysis method used. This support the need of taking into account patient preferences and quality of life while individualizing high efficiency therapy in HD patients.

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.

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 deployment of Artificial Intelligence (AI) systems in decentralized environments is on the rise, yet representation of shared conceptualization in such scenarios remains a challenging issue. The absence of a shared understanding can lead to suboptimal performance of AI systems and hinders the ability to comprehend the knowledge and beliefs of agents in the domain. This paper proposes a formal model for modeling conceptualization in AI systems that integrates ontology, epistemology, and epistemic logic. The model aims to address the gap in representing shared conceptualization in decentralized environments and enhance the performance of AI systems operating in such environments. The proposed model is a hybrid structure that blends extensional and intensional structures and leverages logic-based languages for modeling purposes. A case study in the healthcare sector is presented to illustrate the application of the proposed model. The study contributes to the existing literature by providing a formal model for representing shared conceptualization in decentralized environments, which can be utilized to optimize the performance of AI systems in these environments.

Echoing the long-held JTB account of knowledge, according to which knowledge can be conceptually analyzed as justified true belief, Backes (2019) argues that our epistemic aim is to believe truly or accurately and emphasizes on that “a belief is justified iff it is highly probable”. We maintain that this line of reasoning is deficient, in terms of epistemic concerns and non-epistemic concerns of interest for both philosophy and legal theory. Specifically, in this short paper, we argue for the ineffectiveness of the aforementioned Backes’ view to meet the challenges posed by the ongoing rapid techno-scientific transformation of our contemporary societies and ways-of life.

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.

Commons and food are experiencing a revival in recent years and yet the links between both are almost absent in academic and political discourses. Commons are often portrayed as historical and yet innovative governing mechanisms that can challenge the State-Market hegemony. On the other side, food is both a relevant agent of change and a major driver of planetary destruction, being thus cause and solution to multiple crises that affect humankind. Departing from the commodification of food as one root cause of the broken global food system, this text firstly situates and discusses the different schools of thought (or epistemologies) that have addressed the private/public, commodity/commons nature of goods in general, and then explores how those schools have considered food in particular. To do so, the author has defined five epistemologies, four academic (economic, legal, historical and political) and one non-academic (grassroots activists). The analysis highlights how those epistemologies have yielded incommensurable understandings and conflicting vocabularies, hence creating confusion in the socio-political realm and even rejection around the idea of food being considered as a commons. The economic epistemic regard has reigned over the others by applying an approach to commons, public and private goods that is theoretical, reductionist and ontological instead of phenomenological, therefore preventing or obscuring other scholarly or practical understanding of commons. When applied to food, the iron law of economics dictated that food, a private good based on rivalry and excludability, shall be better allocated through market mechanisms with absolute proprietary rights and valued as a pure commodity. This reductionist view collides with the plurality of meanings of food in different societies, civilisations and historical periods, as other schools of thought indicate. The author uses diverse epistemic tools to re-construct food as a commons, based on its essentiality to human beings and societies and the customary and contemporary praxis to produce, consume and govern food collectively through non-market mechanisms for more than 2000 centuries. As commoning has instituting power to create different political and legal frameworks, if food is valued differently the entire architecture of the global food system would change, as the grassroots activist school claims. Re-commoning food defies the legal and political scaffoldings that sustain the hegemony of market and state decision-makers over eaters and food producers and informs sustainable forms of food production (agro-ecology), new collective practices of governance (food democracies) and alternative policies to regain control over the food system (food sovereignty). Food as a commons is an agent of change with transformative power, no matter what economists say.

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

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

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

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

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

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

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.

Background: Quality of life (QoL) in IC/BPS patients is an evidence gap in guidelines, because studies are limited and outdated. Therefore, guidelines might not reflect the current situation accurately, and no possible improvements in QoL of these patients. Secondly, guidelines suggest multimodal approach in therapy, however unknown is how the efficacy of these therapies are perceived by the patient themselves. The aim of this study is to investigate the perception of IC/BPS patients on their QoL and to determine which treatments they received and how they evaluate the efficacy of these various (alternative) therapies.Methods: Quantitative retrospective database study in IC/BPS patients, compiled of existing patient survey data (n=217) from July 2021. Results: The QoL of patients is affected significantly by IC/BPS. This is evident from the substantial self-reported impact by patients, the various affected domains on EQ-5D 5L. The QoL was not negatively affected by delayed diagnosis, but there were differences between female and males. Secondly, there was the wide array of (alternative) treatments utilized, although some have doubtful results and high dropout rates. Conclusion: QoL is considerably impaired in IC/BPS patients. Coagulation therapy and intravesical GAG therapy were most appreciated treatments. The diverse responses and adherence to various treatments warrant a personalized approach (phenotype-oriented therapy). To achieve improvement in the QoL, it is important to incorporate the patient’s perspective in treatment guidelines.

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

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.

This paper is a mini literature review about electromagnetic field’s effects on cells, tissues and new treatment modalities. We have reviewed a papers which have been published in high quality journals in the last 5 years as two authors. This review’s aim is to be a resource for experimental studies about electricity’s effects on cell biology and pathophysiology. As a result of this literature review, we found that especially extremely low electric frequency and intermediate frequency fields have very important pathophysiological effects. We have mentioned four important expressions on this subject; electroporation, electrofusion, electrochemotherapy, gene electrotransference. Two different new treatment approaches have been developed by use of these two important electrical waves. First is tumor treating fields and the other is pulsed electric fields. Most studies in literature have been done with extremely low frequency and pulsed electric fields. In terms of diseases, most studies are about glioblastoma multiforme and malign melanoma.Most studies in literature have been done with extremely low frequency and pulsed electric fields. In terms of diseases, most studies are about glioblastoma and melanoma.

Abstract Background The number of immune-related endocrine dysfunctions (irEDs) has concurrently increased with the widespread use of immunotherapy in clinical practice and further expansion of the approved indications for immune checkpoint inhibitor (ICI) combinations using different modalities of anti-cancer treatment. Method A retrospective analysis was conducted on consecutive patients >18 years of age with advanced solid malignancies who had received at least one dose of anti-programmed cell death protein 1 (anti-PD-1) and/or anti-CTLA4 antibodies between January 2014 and December 2019 at a Hong Kong university hospital. Patients were reviewed for up to two months after the last administration of an ICI. The types, onset times and grades of irEDs, including hypothyroidism, hyperthyroidism, adrenal insufficiency and immune-related diabetes mellitus, were recorded. Factors associated with irEDs were identified using multivariate analysis. Result A total of 953 patients (male: 603, 64.0%; median age: 62.0 years) received ICIs during the study period. Of these, 580 patients (60.9%) used ICI-alone, 132 (13.9%) used dual-ICI, 187 (19.6%) used an ICI combined with chemotherapy (chemo+ICI), and 54 (5.70%) used immunotherapy with a targeted agent (targeted+ICI). A significantly higher proportion of patients using targeted+ICI had irEDs and hypothyroidism; in contrast, a higher proportion of patients using dual-ICI had adrenal insufficiency. There was no significant difference in the incidence of irED between the younger (<65 years) and older (>65 years) patients. Using logistic regression, only treatment type was significantly associated with irEDs. Notably, older patients had a higher risk of having immune-related diabetes mellitus. Conclusions This large, real-world cohort demonstrates that combining ICI with targeted therapy has a higher risk of overall irED and hypothyroidism. Immunotherapy is safe and well-tolerated regardless of age, but close monitoring of fasting glucose is needed in older populations.

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

Diagnosing congenital heart disease (CHD) remains challenging because of its complex morphology. Representing the intricate structures of CHD on conventional two-dimensional flat screens is difficult owing to wide variations in the pathologies. Technological advancements, such as three-dimensional printed heart models (3DPHM) and virtual reality (VR), could potentially address the limitations of viewing complex structures using conventional methods. This study aimed to investigate the usefulness and clinical value of four visualization modalities across three different cases of CHD, including ventricular septal defect, double outlet right ventricle, and tetralogy of fallot. Seventeen cardiac specialists were invited to participate in this study, which was aimed at assessing the usefulness and clinical value of four visualization modalities, namely, DICOM images, 3DPHM, VR, and 3D PDF. Of these modalities, 76.4% of the specialists ranked VR as the best for understanding the spatial associations among cardiac structures and for presurgical planning. Meanwhile, 94.1% ranked 3DPHM as the best modality for communicating with patients and their families. Of the various visualization modalities, VR was the best tool for assessing anatomical locations and vessels, comprehending the spatial relationships among cardiac structures, and for presurgical planning. The 3DPHM models were the best tool for medical education as well as communication. In summary, both 3DPHM and VR have their own advantages and outperform the other two modalities, i.e., DICOM images and 3D PDF, in terms of visualizing and managing CHD.

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

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

In this research, 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.

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

This study examined the eye movement patterns of 317 elementary students across reading conditions (audio-assisted reading (AR) and reading-only (R)) and text types (fiction and non-fiction), and identified eye movement parameters that predict their literal comprehension (LC) and inferential comprehension (IC). Participants, randomly assigned to either reading condition and either text type, answered questions assessing their LC and IC. Average fixation duration (AFD), total fixation duration (TFD), and scanpath length were used as eye movement parameters. There were main effects of age on all parameters and interaction effects between age and reading condition on TFD and scanpath length. Controlling for age, TFD had a positive impact on LC of both text types in the AR, while under the R, it affected negatively on IC of both text types. Longer scanpaths predicted IC of fiction in the AR, LC and IC of non-fiction under the AR, and LC of non-fiction within the R. AFD influenced negatively on IC of fiction in the AR, LC and IC of non-fiction in the AR, and LC of non-fiction under the R. These eye movement patterns and predictors indicate children employ different reading strategies based on reading modality and text type.

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.

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

Background: Objectives. The objective of this study was to compare the efficacy of direct current stimulation (DCS) applied at the transcranial, suboccipital and spinal level on experimental sensory modalities and pain outcome measures in healthy subjects. The hypothesis of this study was that systematic analysis of the efficacy of DCS on modulating evoked thermal and mechanical pain modalities and mechanisms such as endogenous pain modulation in healthy individuals would reveal sensitive outcome measures help develop this technique for the control of chronic pain. Materials and Methods. Database searches were conducted up to December 2019 for randomized controlled trials that performed sham-controlled DCS of experimental sensory modalities and pain outcomes following transcranial, suboccipital and spinal locations in healthy participants. Standardized mean differences with 95% confidence intervals were calculated for sensory modalities, including random-effect metanalysis. Results: Thirty-one studies were included for analysis (647 participants). A significant decrease in pain intensity for active vs sham transcranial stimulation was identified for pain intensity (n=158; SMD=0.79; 95% CI=0.56 to 1.02), a significant increase in heat pain threshold (n=222; SMD=1.16; 95% CI=0.95 to 1.37), and a significant increase in cold pain threshold (n = 155; SMD = 0.77, 95% CI 0.53 to 1.01). No significant modulation of pressure pain threshold was identified with DCS and only a limited number of studies focused on experimental pain modulation following neuromodulation at the suboccipital or spinal level. Conclusions: These results show significant transcranial DCS neuromodulation of pain intensity and on thermal pain modalities. Future studies should focus on endogenous pain and sensory modality modulation with sham-controlled DCS applied at transcranial, suboccipital and spinal locations.

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

Breast cancer is among the most common and fatal diseases for women, and no permanent treatment has been discovered. Thus, early detection is a crucial step to control and cure breast cancer that can save the lives of millions of women. For example, in 2020, more than 65% of breast cancer patients were diagnosed in early-stage of cancer, from whom all survived cancer. Although early detection is the most effective approach for cancer treatment, breast cancer screening conducted by radiologists is very expensive and time-consuming. More importantly, conventional methods of analyzing breast cancer images suffer from high false detection rates. Different breast cancer imaging modalities are used to extract and analyze the key features affecting diagnosis and treatment of breast cancer. These imaging modalities can be divided into subgroups such as mammograms, ultrasound, magnetic resonance imaging, histopathological images, or any combination of them. Radiologists or pathologists analyze images produced by these methods manually that leads to increase the risk of wrong decisions for cancer detection. Thus, utilization of new automatic methods to analyze all kinds of breast screening images to assist radiologists to interpret images is required. Recently, artificial intelligence (AI) has been widely utilized to automatically improve the early detection and treatment of different types of cancer, specifically breast cancer, thereby enhancing the survival chance of patients. Advances in AI algorithms, such as deep learning, and availability of datasets obtained from various imaging modalities have opened an opportunity to surpass limitations of current breast cancer analysis methods. In this article, we first review breast cancer imaging modalities, and their strengths and limitations. Then, we explore and summarize the most recent studies that employed AI in breast cancer detection using various breast imaging modalities. In addition, we report available datasets on the breast cancer imaging modalities which are important in developing AI-based algorithms and training deep learning models. In conclusion, this review paper tries to provide a comprehensive resource to help researchers working in breast cancer imaging analysis.

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

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

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

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

Background: Exercise is an accepted intervention to improve the quality of life (QoL) of breast cancer patients. Exercise programs have been developed and all have shown satisfactory results in improving QoL. There is a lack of research comparing different prescription modalities. The aim of this study is to evaluate the effectiveness of physical exercise (in-person, home-based, prescription) on QoL in breast cancer patients actively undergoing treatment; Methods Quasi-experimental study with randomized assignment to three groups (in-person: guided and supervised in-person exercise program; home-based exercise: guided and supervised exercise program with streaming monitoring; recommendation: exercise recommendation). Quality of life was measured using the QLQ-C30 questionnaire. Baseline and 24-week analysis. Results: The total sample analyzed was n=80. QoL improved significantly at 24 weeks in the face-to-face and home-based exercise groups, but not in the advice group. Exercise in all modalities improved fatigue, nausea, vomiting, appetite, and constipation. QoL at 24 weeks depended on active chemotherapy, tumor type, and assigned exercise group (r2 = 0.503; p &lt; 0.001). Conclusions: QoL in breast cancer patients undergoing active treatment improves after a 24-week exercise program, especially in face-to-face and home-based exercise. Home-based exercise, streaming-based recommendation is a viable option for exercise recommendation.

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.

Background/Objectives: Although the role of F-18 FDG PET/CT imaging is well established in oncology, its diagnostic value in routine monitoring for recurrent colorectal cancer (CRC) is still controversial. The aim was to evaluate the diagnostic value of FDG PET/CT in detecting recurrent CRC in correlation with CEA, CA 19-9 levels, and conventional imaging modalities (CIM). Methods: Between 2009 and 2023, we retrospectively studied 134 CRC patients referred for FDG PET/CT imaging on the suspicion of recurrence based on elevated CEA and/or CA 19-9, and/or equivocal radiological findings. According to the Institutional Tumor Board CRC protocol, after initial treatment which was dependent on TNM stage (neoadjuvant therapy, primary resection or adjuvant treatment), patients underwent a standard 5-year surveillance including CEA and CA 19-9 measurements, CIM, and colonoscopy every 6 months. The statistics including univariate and multivariable analyses were conducted using the IBM SPSS 20.0 statistical software. P-values <0.05 were considered statistically significant. Results: Recurrent CRC was confirmed in 54/134 (40.3%) patients with elevated tumor markers. FDG PET/CT shows high diagnostic performance in detecting recurrent CRC with sensitivity, specificity, PPV, NPV, and accuracy of 94.4%, 82.5%, 78.5%, 95.7%, and 87.3%, respectively. The CEA shows a high sensitivity of 98.1%, but both low specificity and accuracy of 15% and 48.5%, respectively. The sensitivity, specificity, and accuracy, for CA 19-9 and CIM for the correct diagnosis in CRC patients were: 44.4%, 67.5%, 58.2%, and 51.9%, 98.8%, 79.9%, respectively. The AUC for FDG PET/CT, elevated CEA levels, CIM, and elevated CA 19-9 levels was 0.885 (95% CI: 0.824-0.946; p<0.001), 0.844 (95% CI: 0.772-0.916; p<0.001), 0.753 (95% CI: 0.612-0.844; p<0.001); and 0.547 (95% CI: 0.442-0.652; p=0.358). Univariate analysis shows that both FDG PET/CT- and CIM-positive results were highly associated with CRC recurrence (p<0.001 and p<0.001, respectively), while gender, mucinous tumor type, presence of initial lymph node metastasis (N+), and presence of initial distant metastasis (M+) have no significance (p=0.211, p=0.158, p=0.583, and p=0.201, respectively). Our multivariate analysis shows that independent predictors for CRC recurrence are: positive FDG PET/CT scans (p<0.001), positive CIM results (p=0.001) and elevated CA19-9 levels (p=0.023). Although CA 19-9 was not detected as a statistically significant predictor in the univariate analysis (p=0.358), in a multivariate analysis it was recognized as a significant predicting factor in detecting CRC recurrence (p=0.023). Conclusions: FDG PET/CT shows a high diagnostic efficacy in CRC recurrence detection, in correlation with CEA levels, CA 19-9 levels, and CIM. This imaging modality should be routinely integrated into the postoperative follow-op in patients with elevated tumor markers.

This study aims to investigate the effects of self-paced high-intensity interval training (Sp-HIIT) vs self-paced moderate-intensity continuous training (Sp-MICT) on the aerobic fitness level, psy-chophysiological responses and antioxidant status, to assess the relationship between aerobic fit-ness level and antioxidant markers. Well-trained males were randomised into Sp-HIIT and Sp-MICT. The intervention consisted of 3 weekly sessions during an 8-wk period. Sp-HIIT per-formed two sets of 12–24 x 30-s high-intensity runs ≥85 %HRmax followed by 30-s rest periods, while Sp-MICT performed 24-48 min of continuous running at 60-75 %HRmax. Pre and post-intervention testing included maximal oxygen uptake (VO2max) assessment during a 30-15 intermittent fitness test (30-15 IFT), as well as resting blood samples analysed for oxidative stress markers (Malondialdehyde (MDA)) and intracellular antioxidant enzymes activity (Catalase (CAT), Superoxide Dismutase (SOD) and Reduced (GSH) and Oxidized Glutathione (GSSG)). The Sp-HIIT showed meaningfully greater improvement in velocity of 30-15 IFT, VO2max and MDA responses. Furthermore, the Sp-HIIT demonstrated higher psychophysiological responses than the Sp-MICT, except for anger responses. In conclusion, these results suggest that Sp-HIIT has higher level of exercise-induced beneficial effects in physiological responses with greater perceived exer-tion in young well-trained adults.

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

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

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

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.

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.

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

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.

Glycosidic linkage analysis was conducted on the unfractionated polysaccharides in the alcohol-insoluble residues (AIRs) prepared from six red seaweeds (Gracilariopsis sp., Prionitis sp., Mastocarpus papillatus, Callophyllis sp., Mazzaella splendens, and Palmaria palmata) using GC-MS/FID analysis of partially methylated alditol acetates (PMAAs). The cell walls of P. palmata primarily contained mixed-linkage xylans and small amounts of sulfated galactans and cellulose. In contrast, the unfractionated polysaccharides of the other five species were rich in galactans displaying diverse 3,6-anhydro-galactose and galactose linkages with varied sulfation patterns. Different levels of cellulose were also observed. This glycosidic linkage method offers advantages for cellulose analysis over traditional monosaccharide analysis that is known for underrepresenting glucose in crystalline cellulose. Relative linkage compositions calculated from GC-MS and GC-FID measurements showed that anhydro sugar linkages generated more response in the latter detection method. This improved linkage workflow presents a useful tool for studying polysaccharide structural variations across red seaweed species. Furthermore, for the first time, relative linkage compositions from GC-MS and GC-FID measurements, along with normalized FID and total ion current (TIC) chromatograms without peak assignments, were analyzed using principal component analysis (PCA) as a proof-of-concept demonstration of the technique's potential to differentiate various red seaweed species.

Background: Educating college students about the importance of good sleep habits could lead to the adoption of healthier sleep routines, including sufficient sleep duration and sleep quality. The current pre-post study examines the impact of completing a sleep education program called “Sleep 101” on (1) sleep hygiene practices, (2) sleep quality, and (3) weekday and weekend sleep behaviors among college students. “Sleep 101” is an interactive online course developed to educate college students about the importance of sleep by addressing basic sleep physiology, the impact of sleep on mood, academic and physical performance, the interactions between sleep and various substances, and common sleep disorders. Methods: 338 college students were recruited from a midsized public university in the US and invited to participate in “Sleep 101”, of which 25 participants completed the baseline and post-intervention questionnaire. The Sleep Hygiene Index (SHI) was utilized to evaluate sleep hygiene practices, while standard questions were employed to assess weekday and weekend sleep behaviors and overall sleep quality. Results: Those who completed the study demonstrated a significant increase in weekday sleep duration and were less likely to engage in negative prior bedtime activities. In addition, 40% of those who completed baseline and post-intervention assessments noticed improvements in their sleep quality. Conclusion: These findings suggest that a brief online program is beneficial in improving sleep behaviors among college and could be a scalable approach to addressing current sleep issues and preventing future sleep problems in college students.

The profile of secondary metabolites occurring in apple cuticular layer is not only characteristic for particular apple cultivar, but also dynamically reflects various external factors in growing environment. In this study, the possibility to authenticate apple samples based on analysis of their cuticular layer extracts was investigated. Ultra-high-performance liquid chromatography coupled to high resolution tandem mass spectrometry (UHPLC-HRMS/MS) was employed for obtaining metabolomic fingerprints. In total, 274 authentic apple samples, four cultivars harvested within the seasons 2020 to 2022 in the Czech Republic and Poland were analysed. The generated complex data processed by univariate and multivariate statistical methods enabled to build classification models for discrimination of apple cultivars as well as their geographical origin. The models showed very good performance in differentiation of Czech and Polish samples for three of four cultivars: ‘Gala’, ‘Golden Delicious’ and ‘Idared’, moreover, the validity of the models was verified over harvest seasons. The diagnostic markers, besides metabolites of triterpene biosynthetic pathway, mainly represented wax esters. ‘Jonagold’, which is known to be susceptible to mutations, was the only cultivar for which the unambiguous classification of geographical origin was not possible.

Superior fiber quality is one of the most important objectives in cotton breeding. To detect the genetic basis underlying fiber quality, an F2 population containing 413 plants was constructed by crossing Jifeng 914 and Jifeng 173, both of which have superior fiber quality, with Jifeng 173 being better. Five fiber quality traits were investigated in the F2, F2:3, F2:4, and F2:5 populations. Quantitative trait loci (QTL) mapping was conducted based on a high-density genetic map containing 11,488 single nucleotide polymorphisms (SNPs) and spanning 4,202.12 cM in length. Transgressive segregation patterns and complex correlations in the five tested traits were observed. A total of 108 QTLs were found, including 27 for fiber length (FL), 16 for fiber strength (FS), 24 for micronaire (MC), 17 for fiber uniformity (FU), and 24 for fiber elongation rate (FE). Chromosome A7 contained 12 QTL, ranking the first. No QTL was found on chromosome D1 and D11. Each QTL contributed 1.98%–21.45% to the phenotypic variation (PV), including 13 major effect QTLs that contributed more than 10% toward PV. Two QTLs could be repeatedly detected in three populations, including qFL-D3-2 in F2, F2:4, and F2:5 with 9.18%–21.45% of PV, qFS-A11-1 in F2:3, F2:4 and F2:5 with 6.05%–10.41% of PV. Another seven stable QTLs could be detected in two populations, including four major effect QTLs: qFL-A12-3, qFS-D10-2, qMC-D6-2, and qMC-D8-1. Fourteen QTL-overlapping regions were found, which might explain the complex correlations among the five phenotypic traits. Four regions on chromosome A11, D3, D6, and D10 covered by both stable and major effect QTLs are promising for further fine mapping. The genomic regions of the two QTLs detected in three populations and the four major effect QTLs contain 810 genes. Gene functional analysis revealed that the annotated genes are mainly involved in protein binding and metabolic pathways. Fifteen candidate genes in the qFL-D3-2 region are highly expressed in fiber or ovules during fiber initiation, elongation, secondary cell wall thickening, or maturation stages. qRT-PCR revealed that Ghir_D03G005440.1 and Ghir_D03G011310.1 may play a role in promoting fiber initiation, Ghir_D03G006470.1 may be beneficial for promoting fiber elongation. This study provides more information for revealing the molecular genetic basis underlying cotton fiber quality.

Currently there are fewer depth models applied to pepper picking detection, while the existing generalized neural networks have problems such as large model parameters, long training time, and low model accuracy.In order to solve the above problems, this paper proposes a Yolo-chili target detection algorithm for chili pepper detection. First, the classical target detection algorithm yolov5 is used as a benchmark model, and an adaptive spatial feature pyramid structure combining the attention mechanism and the idea of multi-scale prediction is introduced to improve the model's detection effect on occluded peppers and small target peppers. Secondly, a three-channel attention mechanism module is introduced to improve the algorithm's long-distance recognition ability and reduce the interference of redundant testers. Finally, the quantized pruning method is used to reduce the model parameters and realize the lightweight processing of the model. Applying the method to the homemade chili pepper dataset, the AP value of chili pepper reaches 93.11%; the accuracy rate is 93.51% and the recall rate is 92.55%.The experimental results show that yolo-chili is able to achieve accurate and real-time pepper detection under complex orchards.

The temporary immersion system bioreactor named GreenTray®[2], [3]presents advantages over the existing ones. Firstly, there is no need to use forceps to move the shoots or plantlets in or out of the recipient, neither the use of scalpel to divide them. Secondly, the basis of the shoot can remain in the GreenTray® and can sprout again in several cycles of growth. These two characteristics reduce the costs in the process of micropropagation. Besides, shoots or plantlets development is enhanced by the aeration of the recipient, thus enriching with CO2 the recipient atmosphere. The chapter describes and provides images and values of interest in (1) the micropropagation process of some commercial Prunus or Pyrus rootstocks; (2) the plantlet growth under autotrophic conditions; and (2) the inoculation of plants with pathogens that reproduce in vitro the symptoms observed in vivo, using the GreenTray® bioreactor.

Aiming at the problems of inaccurate segmentation of long object and information loss of small object in real-time semantic segmentation algorithm, this paper proposes a lightweight multi-branch real-time semantic segmentation network based on BiseNetV2. The new auxiliary branch makes full use of spatial details and context information to cover the long object in the field of view. Meanwhile, in order to ensure the inference speed of the model, the asymmetric convolution is used in each stage of the auxiliary branch to design a structure with low computational complexity. In the multi-branch fusion stage, the alignment and fusion module is designed to provide guidance information for deep and shallow feature mapping, so as to make up for the problem of feature misalignment in the fusion of information at different scales, and thus reduce the loss of small target information. In order to further improve the model’s awareness of key information, a global context module is designed to capture the most important features in the input data. The proposed network uses NVIDIA GeForce RTX 3080 Laptop GPU experiment, on the road street view data set Cityscapes and CamVid average occurring simultaneously ratio reached 77.1% and 78.4% respectively, with running speed of 127 frames/s respectively and 112 frames/s. The experimental results show that the proposed algorithm can achieve real-time segmentation and improve the accuracy significantly, showing good semantic segmentation performance

Strawberry root rot caused by Neopestalotiopsis clavispora is one of the main diseases of strawberry and significantly impacts the yield and quality of strawberry fruit. There are now no effective control techniques available except for fungicide sprays, which may directly impact consumers. Biological control is becoming an alternative method for the control of plant diseases to replace or decrease the application of traditional synthetic chemical fungicides. Trichoderma is widely used as a biological agent for controlling strawberry root rot. In order to provide resources for screening the highly effective biocontrol fungus for controlling strawberry root rot caused by Neopestalotiopsis clavispora, the biocontrol mechanism,the control effects of Trichoderma asperellum CMT10 against strawberry root rot and growth-promoting effects on strawberry seedlings were investigated by plate culture, microscopy observation and root drenching methods.The results showed that CMT10 had obvious competitive, antibiotic and hyperparasitism effects on Neopestalotiopsis clavispora CMGF3. The CMT10 could quickly occupy nutritional space, and the inhibition rates of CMT10 against CMGF3 in confrontation culture on 7 d was 65.49%. The inhibition rates of volatile metabolite and fermentation metabolite produced by CMT10 against CMGF3 were 79.67% and 69.84%, respectively. The mycelium of strain CMT10 can act as hyperparasites by making contacting, winding and penetrating hyphae of CMGF3. Pot experiment showed that the biocontrol efficacy of CMT10 on strawberry root rot caused by Neopestalotiopsis clavispora was 63.00%. CMT10 had obvious promotion effect on strawberry growth, the plant height, root length, total fresh weight, root fresh weight, stem fresh weight and root dry weight, with the promotion rates were 20.09%, 22.39%, 87.11%, 101.58%, 79.82% and 72.33%, respectively. Overall, this study showed the ability of Trichoderma asperellum CMT10 to control strawberry root rot and their potential to develop as novel biocontrol agents to replace chemical fungicides for eco-friendly, sustainable agriculture.

In this paper we study a class of impulsive delayed neural networks with parameter uncertainties and reaction-diffusion terms. Using the properties of M-matrices and some inequality techniques, some sufficient conditions are derived to guarantee the global exponential stability of the given system. The results obtained are presented by simple algebraic inequalities, which are certainly more concise than previous methods. Finally, the validity and usefulness of our results are illustrated by arithmetic examples.

Pyrops candelaria is one of the common pests of fruit trees, but the research on the pathogenic microorganisms it may carry is very limited. Therefore, it is essential to reveal the pathogenic microbes it carries and their potential hazards. This study found a new virus from the transcriptome of P. candelaria, which was first reported in P. candelaria and named as PyCaV (Pyrops candelaria associated virus). RACE and bioinformatics assay revealed that the full-length of PyCaV is 10855 bp with the polyA tail, containing a single open reading frame (ORF) encoding a polyprotein consisting of 3171 amino acid (aa). The virus has a typical Iflavirus structure, including two rhv domains, a RNA helicase domain (HEL), a 3C cysteine protease domain (Pro), and a RNA-dependent RNA polymerase domain (RdRp). Further phylogenetic analysis revealed that this virus belongs to family Iflaviridae and sequence alignements analysis suggedted PyCaV is new member in unassigned genus of family Iflaviridae. Further in-depth analysis of virus-infection-part showed that PyCaV is distributing in the whole longan lanternfly, including its head, chest, and abdomen, but more PyCaV was identified in the chest. The distribution of PyCaV in different parts of P. candelaria was further explored, which showed that more PyCaV were detected in its piercing-sucking mouthparts and chest viscera. Statistical analysis showed that the PyCaV infection was affected by time and locations.

Apis mellifera, especially weak ones, are highly vulnerable to Carpoglyphus lactis mites, which can rapidly infest and consume stored pollen, leading to weakened colonies and potentially colony collapse. This study aimed to ascertain and investigate the prevalence of this mite in honeybee colonies across 9 provinces in the Republic of Korea (ROK). A total of 615 honeybee colonies were collected, from 66 apiaries during the spring and 58 apiaries during the summer of 2023. A 1,242 bp segment of the the Cytochrome c oxidase subunit 1 (COI) gene was amplified using the polymerase chain reaction method. The detection levels of C. lactis in the honeybees were compared between winter and summer. Based on the COI sequence analysis, the nucleotide sequence similarity of C. lactis mites isolated in the ROK with those from China (NC048990.1) was found to be 99.5%, and with those from the United Kingdom (KY922482.1) was 99.3%. This study is the first report of C. lactis in Korean apiaries. The findings in this study demonstrate a significantly higher detection rate in winter, which is 4.1 times greater than that in summer (p &lt; 0.001). Furthermore, the results underscore the usefulness of molecular diagnostic techniques for detecting C. lactis mites.

With the burgeoning growth of online retail, the issue of counterfeit products has become a significant threat to both consumer trust and brand integrity, posing challenges to sustainable market practices. Online retail platforms are promoted to redesign their channel structures and enhance brand traceability to tackle counterfeits using blockchain technology. To investigate the interactions between blockchain technology and the channel structures of online retail platforms, we design a game theory model incorporating a manufacturer with(out) blockchain participation selling products via an online retail platform that operates an agency channel and/or a reselling channel. We show that the critical trade-off of blockchain participation comprises the brand assurance effect of the blockchain, the channel competition intensification effect, and the blockchain adoption cost. The platform is capable of strategically designing the channel structure to encourage (while discouraging) blockchain participation by the manufacturer. Our analysis highlights the complementarity between blockchain participation and the channel structure. Furthermore, the effect of the consumer’s belief in the reselling channel, the commission fee in the agency channel, and the substitutability between channels are investigated in depth. The research provides valuable insights for online retail platforms and policymakers seeking to foster a sustainable and trustworthy e-commerce ecosystem.

COX II containing a dual core CuA active site is one of the three core subunits of mitochondrial Cco, which plays a significant role in the physiological process. In this report, the full-length cDNA of COXⅡ gene was cloned from Sitophilus zeamais, which had an ORF of 684 bp encoding 227 amino acids residues. The predicted COXⅡ protein had a molecular mass of 26.2 kDa with pI value of 6.37, and multiple sequence alignment and phylogenetic analysis indicated that Sitophilus zeamais COXⅡ had high sequence identity 78.51% with the COXⅡ of other insect species, especially similarity to sitophilus oryzae. This gene was subcloned into the prokaryotic expression vector pET-32a, and induced by IPTG in E.coli Transetta (DE3) expression system. Finally the COXⅡ with 6-His tag was purified using affinity chromatography with Ni²⁺-NTA agarose. WB showed the recombinant COXⅡ was about 44 kD, and the concentration of fusion protein was 50μg/mL. UV-spectrophotometer and infrared spectrometer analysis showed that recombinant COXⅡ could catalyze the oxidation of substrate Cytc, and influenced by AITC. It was found that AITC could form a hydrophobic region with COXⅡ protein via molecular docking, besides, a sulfur atom of AITC structure could form a length of 2.9 Å hydrogen bond with Leu-31. These results will provide valuable information for elucidating the role of COXⅡ in Sitophilus zeamais responses to AITC, meanwhile, it will helpful to carry out a point mutation in AITC binding sites for the future research.

The properties of the annual, semiannual and triennial oscillations (AO, SAO and TO) in the middle atmosphere have been investigated using the TIMED/SABER temperature data. The Lomb-Scargle and wavelet spectra were used to determine the dominant oscillations in the background temperature field. The AO is prominent at the mid-latitudes. The AO amplitudes present an asymmetry between the two Hemispheres, being larger in the mesosphere than in the stratosphere. The SAO dominates the tropical regions, with three amplitude maxima at altitudes of 45, 75, and 85 km. The SAOs in the upper mesosphere (75 km) are out of phase with those in the mesopause (85 km) in the tropical regions, which can generate an enhancement of 11 K at each equinox, contributing to the lower mesospheric inversion layer. The TO is significant in the tropical region, with amplitude being maximum at 35, 45 and 85 km. Result shows that there may be potential interaction by the TO with SAO at 85km at the equator. The relation between ENSO and TO has also been discussed. The ENSO signal may modulate the amplitude of the TO, mainly in the lower stratosphere. The real origin of the TO may lie in the wave-mean-flow interaction.

The paper describes the new method for image compression based on coordinated group signal transformation. The algorithm is a type of difference coding. Coordinated processing significantly simplifies the difference signal conversion scheme using a single group codec for all signals. The described method considers color channels as correlated signals of a multi-channel communication system. The specifics of the processed data required modification of the coordinated group processing algorithm. First, we changed how to calculate the difference signals to prevent data loss. Secondly, the group codec was supplemented with a neural network to improve the quality of reconstructed images. We considered the following types of neural networks: fully connected, recurrent, convolution, and convolution in the Fourier space. Based on the simulation results, it is best to use fully connected neural networks if the goal is to minimize processing delay time. These networks have a response time of 13 ms. On the other hand, if the priority is to improve quality in cases where delays are not critical, then convolution neural networks in the Fourier space should be used. These networks have a response time of 140 ms and are of significant interest.

As the world population grows, fulfilling the need for biomaterials in the healthcare system becomes increasingly important. Biomaterials, which include metals, polymers, ceramics, and composites, play an important role in the creation of medical devices that improve people's lives. The European Society for Biomaterials described biomaterials as non-biological materials used in medical devices to interact with biological systems. This definition has developed to encompass materials that treat, assess, or replace tissues or bodily functions. Biocompatibility, as defined by the FDA, is a key feature of biomaterials, as is the requirement to fulfil design requirements such as mechanical performance, geometry, and electrical control. Over the last decade, advances in regenerative medicine and tissue engineering have boosted biomaterials' usage in medical applications dramatically. Despite its promise, scientists, engineers, and physicians continue to face significant challenges due to the complexity of biomaterials. Biomaterials have various benefits, including biodegradability, non-toxicity, and biocompatibility, making them extremely useful for replacing, sustaining, or improving biological activities in damaged tissues. They are used in a wide range of applications, including tissue engineering implants, human tissue healing and regeneration, medication delivery systems, and biosensors. This study gives insights into the fundamental characteristics, case studies, and ethical issues associated with the usage and use of biomaterials, further examining their potential and significance in healthcare and medicine.

The studied solar pot is a recent invention, which gained a utility model protection in 2021 from the Hungarian Intellectual Property Office under patent number 5489. The device is made for environmentally friendly cooking or heating (by utilizing solar energy) of foods and liquids. Its structure is similar to a double pipe heat exchanger, it has an outer mantle and an inner cooking tank. The goals of the paper are proposing a new physically-based mathematical model describing the solar pot and carrying out computer experiments with it, assembling an experimental system of the pot connected with a solar collector and performing measurements on it. Based on the results, the solar pot can successfully be used for cooking or sterilizing foods or liquids during the studied time period, in Hungary.

The research reported on this paper was aimed at improving the overall efficiency of a PDO certified artisanal cheese production process. Being a PDO certified foodstuff by the EU, it is considered to have properties and qualities determined by the geographical environment in which is made, with its production taking place in a specific and determined geographical location, in this case the Serra da Estrela region. In that sense, the authors conducted a mapping according to a systemic perspective of the processes involved in the context of manufacturing and distribution of certified Serra da Estrela cheese. Numerous methods were used throughout the process, such as a systemic design analysis, and techniques derived from ethnographic methods, which led to the collection of data in the field and consequently provided the immersion of the researcher in genuine work situations. Critical points were identified and emphasized in the systemic map with the purpose of encouraging initiatives to address and overcome the gaps and inefficiencies detected. The systemic design analysis triggered the development of design work. Observations following an ethnographic approach identified ergonomic risks in cheese making during the process of cutting excess chips, fostering the emergence of musculoskeletal disorders at the wrist. A tool that fits best to the task at hand was developed. A prototype of the new tool enabled collecting feedback from use in the work context, in order to inform product development. The domains of agricultural production and microbiology, considering the specific microorganisms developed trough the ripening process of the cheese, turned out to be aspects of high importance for the issue under focus, contributing to a broader understanding of the ripening process and its risks, simultaneously improving the efficiency and success of cheese production. If it were not for the systemic analysis, which served as a link between the boundaries of distinct domains such as the risk of microorganism contamination, ergonomics, energy efficiency, legislation and regulation policies, transportation challenges and economic viability, approached throughout the research. Simultaneously creating bridges between them, the various problems might not have been detected in the first place, as they are usually addressed in specialized disciplines, predetermined by the restrictions of each specific area of knowledge. As a consequence of the development of this research, which was based on an analysis that sought to establish possible connections between various disciplines and tried to constantly maintain a holistic perspective, making new connections and observing the issues from a new angle, apart from the already established methodologies. All this allowed to lay out the seeds for the development of a plan to tackle the critical points identified by the systemic analysis reported in this paper.

Abstract: Transcription factors are crucial pre-transcriptional regulatory mechanisms that can modulate the expression of downstream genes by binding to their promoter regions. DOF (DNA binding with One Finger) proteins are a unique class of transcription factors with extensive roles in plant growth and development. Our previous research indicated a decrease in iron content in chlorotic bamboo leaves. However, to our knowledge, genes related to iron metabolism pathways in bamboo species have not yet been studied. Therefore, in the current study, we identified iron metabolism-related (IMR) genes in bamboo and determined the transcription factors that significantly influence them. Among these, DOFs were found to have widespread effects and potentially significant impacts on their expression. We identified specific DOF members in Dendrocalamus latiflorus with binding abilities through homology with Arabidopsis DOF proteins, and established connections between some of these members and IMR genes using RNA-seq data. Additionally, molecular docking confirmed the binding interactions between these DlDOFs and the DOF binding sites in the promoter regions of IMR genes. The co-expression relationship between the two gene sets was further validated using q-PCR experiments. This study paves the way for research into iron metabolism pathways in bamboo and lays the foundation for understanding the role of DOF transcription factors in D. latiflorus.

This paper is focused on typical rural settlements in the Stara Planina Mountain area in Serbia. They are distinguished by their authenticity, identity and character, and they have still not been destroyed by inappropriate development as is the case in some other mountain areas in Serbia, where the effects of urbanization, globalization and homogenization are obvious. Consequently, there is a need to prevent these effects in mountain areas where there is a threat of disbalance between development and the inherited natural and cultural values. The paper starts from several important concepts that relate contemporary approaches to cultural heritage preservation, place morphology and planning future development. The concept definitions from recent documents from related fields are used. These concepts are then applied to the area of Stara Planina Mountain and its rural settlements. The necessity for an integrative approach to planning this area with significant natural and anthropogenic potential is pointed out, including its integration into international programs of sustainable development.

The wetlands in northeastern Bangladesh are home to some of the most prolific and valuable ecosystems on the planet, offering a wide range of benefits to both the local and wider communities. A limited number of research on this topic have been carried out in various wetlands in coastal hilsa, but none have been located in the northeastern region of Bangladesh. Thus, the goal of this study was to better understand the most commercially relevant species (anadromous hilsa) in northeastern Bangladesh as well as to assess the wetland ecosystem services more thoroughly with the contribution of their fish genetic resources. In addition to laboratory studies, fieldwork was done in the fishing settlements along the Surma River, Hakaluki Haor, and Tanguar Haor. The study classified 77 fish species into 21 subcategories of ecosystem services, of which 56% were not threatened, 17% were vulnerable, and 10% were highly endangered. The species Hilsa was found to be the most economically significant, accounting for 1% of the GDP overall. The study determined if the hilsa stock of the examined wetlands maintains a single or several subpopulations in comparison to other parts of the country when they migrate from saline water to northeastern Bangladesh (freshwater). But when compared to other groups, the FST score was between 0.000 to 0.017, indicating that the populations are identical and that there is genetic material sharing between them. Additionally, these statistics imply that the Sylhet haor and adjacent river systems contain a single stock of Hilsa fish. Nevertheless, a number of stresses and risks, including overexploitation, illicit and destructive fishing, siltation, and natural disasters like flash floods, have been linked to changes in the supply of hilsa and other ecosystem services. This study also emphasizes the necessity of policy attention and research to address the concerns.