PdRe/Al2O3 catalysts are highly selective for hydrogenation of furfural to furfuryl alcohol (FAL). Moreover, synergy between the metals can result in greater specific activity (higher turnover frequency, TOF) than exhibited by either metal alone. Bimetallic catalyst structure depends strongly on the metal precursors employed and their addition sequence to the support. In this work, PdRe/Al2O3 catalysts were prepared by: (i) co impregnation (CI) and sequential impregnation (SI) of  Al2O3 using HReO4 and Pd(NO3)2, (ii) SI using NH4ReO4 and [Pd(NH3)4(NO3)2], (iii) HReO4 addition to a reduced and passivated Pd/Al2O3 catalyst, and (iv) impregnation with the double complex salt (DCS), [Pd(NH3)4(ReO4)2]. Raman spectroscopy and temperature-programmed reduction (TPR) evidence larger supported PdO crystallites in catalysts prepared using Pd(NO3)2 than [Pd(NH3)4(NO3)2]. Surface [ReO4]- species detected by Raman exhibit TPR peak temperatures from ranging 85 to 260°C (versus 375°C for Re/Al2O3). After H2 reduction at 400°C, the catalysts were characterized by chemisorption, temperature-programmed hydride decomposition (TPHD), CO diffuse reflectance infrared Fourier transform spectroscopy (DRIFTS), and scanning transmission electron microscopy (STEM) with energy-dispersive x-ray (EDX) spectroscopy. The CI catalyst containing supported Pd-Re alloy crystallites had a TOF similar to Pd/Al2O3 but higher (61%) FAL selectivity. In contrast, catalysts prepared by methods (ii-iv) containing supported Pd-Re nanoparticles exhibit higher TOFs and up to 78% FAL selectivity.

A series of MgAl-layered double hydroxide (MgAl-HT), the calcined form at 500^oC (MgAlO_x) and the re-hydrated one at 25^oC (MgAl-HT-RH) were synthesized. Physicochemical properties of the catalysts were characterized by x-ray diffraction (XRD), scanning electron microscopy (SEM). Surface area of the as-synthesized, calcined and re-hydrated catalysts was determined by N₂ physisorption at -196^oC. CO₂-teperature programmed desorption (CO₂-TPD) was applied to determine the basic sites of catalysts. The catalytic test reaction was carried out using benzaldehyde and their derivatives with nitromethane and their derivatives. The Henry products (1-15) were obtained in a very good yield using MgAl-HT-RH catalyst either by conventional method at 90^oC in liquid phase, or under microwave irradiation method. The mesoporous structure and basic nature of re-hydrated solid catalyst were responsible for their superior catalytic efficiency. The robust nature was determined by using the same catalyst for five times, where the product % yield was almost unchanged significantly.

: Extra- and intra-cellular activity occurs under the direction of numerous inter-molecular interactions, and in any tissue or cell, molecules are densely packed, thus promoting those molecular interactions. Galectins and chemokines, the focus of this review, are small, protein effector molecules that mediate various cellular functions, in particular cell adhesion and migration, as well as cell signaling/activation. In the past, researchers have reported that combinations of these (and other) effector molecules act separately, yet sometimes in concert, but nevertheless physically apart and via their individual cell receptors. This view that each effector molecule functions independently of the other limits our thinking about functional versatility and cooperation, and, in turn, ignores the prospect of physiologically important inter-molecular interactions, especially when both molecules are present or co-expressed in the same cellular environment. This review is focused on such protein-protein interactions with chemokines and galectins, their homo- and hetero-oligomeric structures that they can form, and the functional consequences of those paired interactions.

Malaria comprises a spectrum of disease syndromes and the immune system is a major participant in malarial disease. This is particularly true in relation to the immune responses elicited against blood stages of Plasmodium-parasites that are responsible for the pathogenesis of infection. Mouse models of malaria are commonly used to dissect the immune mechanisms underlying disease. While no one mouse model of Plasmodium infection completely recapitulates all the features of malaria in humans, collectively the existing models are invaluable for defining the events that lead to the immunopathogenesis of malaria. Here we review the different mouse models of Plasmodium infection that are available, and highlight some of the main contributions these models have made with regards to identifying immune mechanisms of parasite control and the immunopathogenesis of malaria.

The patterns of food consumption in general and those of meat, in particular, are constantly changing. These changes are due not only to socio-economic and cultural trends that affect the whole society but also to the specific lifestyles of consumer groups. Due to the importance of consumer lifestyle, the objectives of this study were i) to identify the profiles of lamb meat consumers according to their orientation toward convenience, as defined by their eating and cooking habits; ii) to characterize these profiles according to their socio-economic characteristics and their preferences regarding the intrinsic and extrinsic quality signals of lamb meat; and iii) to analyze the willingness to pay for lamb confit. In this study, four types of consumers have been differentiated according to their lifestyles related to lamb consumption. These groups, due to their characteristics, could be called "Gourmet", "Disinterested", "Conservative" and "Basic". The Gourmet group has characteristics that make it especially interesting to market a product such as lamb confit; however, this group is unaware of this product. Therefore, a possible strategy to expand the commercialization of light lamb and the confit product would be guided marketing to this niche market.

This work demonstrates that a plasmid can function as an efficient biocatalyst in mediating the nitroaldol (Henry) reaction at high temperatures in ultrapure water. Compared with ssDNA, the plasmid displayed a remarkable catalytic efficiency (97% yield within 20 min). Aromatic aldehydes which bear strong or moderate electron-withdrawing groups reacted satisfactorily with nitromethane, which afforded the corresponding β-nitroalcohols in good yields within 2 h (up to 98%). By contrast, aliphatic and aromatic aldehydes with electron-donating groups did not react. Moreover, the yield significantly dropped when the size of the carbanion increased, and the yield was only 10% when nitropropane was used as the donor.

Over the past decades, overweight and obesity has become a global epidemic and the leading threat for death. To prevent the serious risk, an overweight or obese individual must apply a long-term weight-management strategy to control food intake and physical activities, which is however, not easy. Recently, with the advances of information technology, more and more people can use wearable devices and smartphones to obtain physical activity information, while they can also access various health-related information from Internet online social networks (OSNs). Nevertheless, there is a lack of an integrated approach that can combine these two methods in an efficient way. In this paper, we address this issue and propose a novel mobile-social framework for health recognition and recommendation, namely, H-Rec². The main ideas of H-Rec² include (1) to recognize the individual's health status using smartphone as a general platform, and (2) to recommend physical activity and food intake based on personal health information, life science principles, and health-related information obtained from OSNs. To demonstrate the potentials of the H-Rec² framework, we develop a prototype that consists of four important components: (1) an activity recognition module that senses physical activity using accelerometer, (2) a health status modeling module that applies a novel algorithm to generate personalized health status index, (3) a restaurant information collection module that collects relevant information from OSN, and (4) a restaurant recommendation module that provides personalized and context-aware recommendation. To evaluate the prototype, we conduct both objective and subjective experiments, which confirm the performance and effectiveness of the proposed system.

The importance of frailty in older people is getting constant recognition as an important aspect both in terms of public health, as well in personal level for the appropriate management of an older person health condition. This is reflected by the continuously increasing number of research studies carried out in several settings across different countries. Sometimes this is very solid, but in other cases there is a considerable gap in terms of accurate and well grounded documentation of frailty status. This is the case in Greece, where we are missing clinically validated tools to approach frailty. We are missing frailty screening tools, such as for instance PRISMA 7, the gold standard tool of Fried criteria is somehow problematic since the question referring to physical activity originates from a questionnaire that has not been translated and validated, while Clinical Frailty Scale has been validated for the translation but not for the capacity to detect frailty. Aim of this study is to validate these tools for their accuracy to detect frailty by using a measurable index of frailty, previously proposed for use in clinical studies: the Short Physical Performance Battery (SPPB). 74 male and female participants have been evaluated for their frailty status using different tools. We observed that PRISMA 7 translation detects frailty only when one question is removed at a cut-off of ≥ 2 and indicated a sensitivity of 88.1%, and specificity of 99.9% with a good correlation with SPPB measurements (r = 0.858; p < 0.001). When CFS was validated using SPPB it demonstrated a very good correlation (r = -0.838; p < 0.001 respectively) as it was the case for the modified Fried Criteria (r = -0.725; p < 0.001). All items demonstrated a good correlation between them. We can here propose that we can accurately assess frailty status in the community setting by using a modified version of Fried criteria, Clinical Frailty Scale translation in Greek and we can screen for frailty by using the Greek translation of PRISMA 7 only after removing the item 6 of the questionnaire.

There is a deep link existing between symmetry and nature that may be best apprehended by using group theory. In physics, giving a symmetry group is entirely equivalent to fix natural laws (Noether’s theorem). Within such a framework, it follows that all fundamental mechanical laws may be given by defining a group of symmetry operations belonging to the Gal(3,1) symmetry group having ten generators (3 + 3 + 3 + 1 = 10). The move to special relativity amounts simply to substitute another group ISO(3,1) to Gal(3,1) and having the same number of generators. In both cases, one immediately perceives that we live in universe with 3 dimensions of space and 1 dimension of time. A further progress could be made by looking for the symmetry group that leaves Maxwell’s equations invariant. The answer to this fundamental question is the group ISO(4,2)⊗U(2)⊗U(2) characterized by 23 generators : 15 = 10 + 5 for the conformal group ISO(4,2), 4 for U(2) and hence 8 = 4 + 4 for the compact part U(2)⊗U(2) that could be related to the existence of quantum physics besides relativity. As ISO(3,1) is a sub-group of ISO(4,2), the two numbers 4 and 2 suggests that, taking into account the existence of light besides matter, we live in an universe having 4 spacelike dimensions and 2 time-like dimensions. Here, it is proposed that, as music is characterized by a scale-invariant symmetry operation (transposition by octaves) and that as time may be perceived differently in shamanic trance for instance, the two “new” dimensions of our universe may be related to music and consciousness. Related to the fifth dimension of music, the notion of diapason linking physical frequencies to a musical note is revisited. It is thus proposed to adopt a new A4 = 429.62 Hz value based on universal physical constants of our universe and on the mass of the water molecule H₂O, the most abundant molecule in the universe. Demonstration is done that this new diapason is superior to other diapasons based on frequencies of 440 Hz or even 432 Hz

The study was conducted to prepare juice blend by using Orange, Carrot and Tiger-nut juices. Fully mature raw Orange, Tiger-nut and Carrot were processed into juice forms and combined in different ratios which were analyzed for their composition and Consumer’s acceptability. The analysis showed that the juice with higher Orange juice content had higher levels of acidity. This implies that they would last longer as they are not susceptible to spoilage by most organisms. The Juice with higher orange juice content was also found to be very rich in Vitamin C, due to inherent high amount of Vitamin C in raw Orange Fruit. However, it scored lowest in terms of general acceptability because the raw fruit was purchased separately and there’s a likelihood some of the Orange used in the Juice preparation were sour. This led to a sour taste in this Juice blend. The Juice blend that contained equal proportions of all three juices was the most acceptable to the consumers in terms of color, taste and Nutritional composition. It gave equal amounts of the unique properties of each fruit and provided a unique color and taste that was very appealing to the panelists. This product makes it possible to properly utilize these fruits, reduce post harvest losses, cater to different health needs of the consumers and ensure food security. It is recommended that further work should be done on antioxidant properties, other fruit blends and storage stability of the beverage to determine the shelf-life.

Objective: To explore motivation to exercise, support, and self-management needs among people with Parkinson’s (PwP), family-members and physiotherapists. Methods: Purposeful and maximum difference sampling methods (age, sex, geographical setting, and disease severity) were employed. PwP and family-members were recruited through physiotherapy services and local support groups. Semi-structured interviews with 12 PwP, focus groups with four family-members, and five physiotherapists were conducted. Interview guides were informed by patient-public input, and a recent systematic review. Interviews were recorded, transcribed, and analysed using thematic analysis. Results: Four common themes emerged: 1) The value of an intrinsic connection with exercise: but there are challenges. A greater connection to exercise led to long-term compliance. 2) Tailoring exercise is essential. Preferred exercises and environments were mixed, with differences emerging between sexes. 3) Physiotherapists’ aim to only maintain physical function led to frustration. Limited self-management opportunities, stigma and dehumanisation were discussed. 4) Non-motor symptoms, stigma, fear, and determination. Apathy, pain, and low mood were discussed. Conclusion: Exercise provided physical, emotional, and social rewards. Supports are necessary; however, challenges arise when PwP’s motivation are mismatched to family-members’ and physiotherapists’ goals. Co-created goals, tailored to their preferences, and exercise plans with supported self-management are recommended.

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

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

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

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

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

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

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

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

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

The primary barrier to understanding visual and abstract information in STEM fields is representational competence the ability to generate, transform, analyze and explain representations. The relationship is known between the foundational visual literacy and the domain specific science literacy, however how science literacy is a function of science learning is still not well understood despite investigation across many fields. To support the improvement of students’ representational competence and promote learning in science, identification of visualization skills is necessary. This project details the development of an artificial neural network (ANN) capable of measuring and modeling visual science literacy (VSL) via neurological measurements using functional near infrared spectrometry (fNIRS). The developed model has the capacity to classify levels of scientific visual literacy allowing educators and curriculum designers the ability to create more targeted and immersive classroom resources such as virtual reality, to enhance the fundamental visual tools in science.

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

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

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

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

This article introduces a novel payload structure, which has been experimentally proven to have smaller impact force while the carried internal electronics remains intact. The study describes in details how materials and geometric structures were chosen based on information analysis. It is clarified how possible geometric structures and materials can be chosen to yield optimal efficiency. Finite element method simulations were carried out to investigate the mechanical properties of several geometric structures, which has led to the dodecahedron form. For the frame, Polylactic Acid were chosen as an optimal material. A low air pressure test for parts of the structure, and also the whole structure were carried out with successful results. Drop tests, with force measuring sensors and high speed videos, were carried out for measuring and comparing the maximal impact force of classical payloads and the novel one. Laboratory and real life tests demonstrated that the developed new structure is safer and it is applicable.

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

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

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

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

In this paper, inspired by recent articles of G. Anatriello and G. Vincenzi (see \cite{Ana}), and G. Cerda-Morales (see \cite{Cer1,Cer2}), we will introduce the third-order $\overline{h}$-Jacobsthal and third-order $\overline{h}$-Jacobsthal--Lucas sequences and their associated quaternions. The new results that we have obtained extend most of those obtained in \cite{Cer2}.

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

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

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

In this research, new setting is introduced for new SuperHyperNotion, namely, 11 Neutrosophic 1-failed SuperHyperForcing. Two different types of SuperHyperDefinitions 12 are debut for them but the research goes further and the SuperHyperNotion, 13 SuperHyperUniform, and SuperHyperClass based on that are well-defined and 14 well-reviewed. The literature review is implemented in the whole of this research. For 15 shining the elegancy and the significancy of this research, the comparison between this 16 SuperHyperNotion with other SuperHyperNotions and fundamental 17 SuperHyperNumbers are featured. The definitions are followed by the examples and the 18 instances thus the clarifications are driven with different tools. The applications are 19 figured out to make sense about the theoretical aspect of this ongoing research. The 20 “Cancer’s Neutrosophic Recognition” are the under research to figure out the challenges 21 make sense about ongoing and upcoming research. The special case is up. The cells are 22 viewed in the deemed ways. There are different types of them. Some of them are 23 individuals and some of them are well-modeled by the group of cells. These types are all 24 officially called “SuperHyperVertex” but the relations amid them all officially called 25 “SuperHyperEdge”. The frameworks “SuperHyperGraph” and “neutrosophic 26 SuperHyperGraph” are chosen and elected to research about “Cancer’s Neutrosophic 27 Recognition”. Thus these complex and dense SuperHyperModels open up some avenues 28 to research on theoretical segments and “Cancer’s Neutrosophic Recognition”. Some 29 avenues are posed to pursue this research. It’s also officially collected in the form of 30 some questions and some problems. Assume a SuperHyperGraph. Then a “1-failed 31 SuperHyperForcing” Z(NSHG) for a neutrosophic SuperHyperGraph NSHG : (V,E) 32 is the maximum cardinality of a SuperHyperSet S of black SuperHyperVertices 33 (whereas SuperHyperVertices in V (G) \ S are colored white) such that V (G) isn’t 34 turned black after finitely many applications of “the color-change rule”: a white 35 SuperHyperVertex is converted to a black SuperHyperVertex if it is the only white 36 SuperHyperNeighbor of a black SuperHyperVertex. The additional condition is referred 37 by “1-” about the usage of any black SuperHyperVertex only once to act on white 38 SuperHyperVertex to be black SuperHyperVertex; a “neutrosophic 1-failed 39 SuperHyperForcing” Zn(NSHG) for a neutrosophic SuperHyperGraph NSHG : (V,E) 40 is the maximum neutrosophic cardinality of a SuperHyperSet S of black 41 SuperHyperVertices (whereas SuperHyperVertices in V (G) \ S are colored white) such 42 that V (G) isn’t turned black after finitely many applications of “the color-change rule”: 43 a white SuperHyperVertex is converted to a black SuperHyperVertex if it is the only 44 1/128 white SuperHyperNeighbor of a black SuperHyperVertex. The additional condition is 45 referred by “1-” about the usage of any black SuperHyperVertex only once to act on 46 white SuperHyperVertex to be black SuperHyperVertex. Assume a SuperHyperGraph. 47 Then an “δ−1-failed SuperHyperForcing” is a maximal 1-failed SuperHyperForcing of 48 SuperHyperVertices with maximum cardinality such that either of the following 49 expressions hold for the (neutrosophic) cardinalities of SuperHyperNeighbors of s ∈ S : 50 |S ∩N(s)| > |S ∩(V \N(s))|+δ, |S ∩N(s)| < |S ∩(V \N(s))|+δ. The first Expression, 51 holds if S is an “δ−SuperHyperOffensive”. And the second Expression, holds if S is an 52 “δ−SuperHyperDefensive”; a“neutrosophic δ−1-failed SuperHyperForcing” is a maximal 53 neutrosophic 1-failed SuperHyperForcing of SuperHyperVertices with maximum 54 neutrosophic cardinality such that either of the following expressions hold for the 55 neutrosophic cardinalities of SuperHyperNeighbors of s ∈ S : |S ∩ N(s)|neutrosophic > 56 |S ∩ (V \ N (s))|neutrosophic + δ, |S ∩ N (s)|neutrosophic < |S ∩ (V \ N (s))|neutrosophic + δ. 57 The first Expression, holds if S is a “neutrosophic δ−SuperHyperOffensive”. And the 58 second Expression, holds if S is a “neutrosophic δ−SuperHyperDefensive”. It’s useful to 59 define “neutrosophic” version of 1-failed SuperHyperForcing. Since there’s more ways to 60 get type-results to make 1-failed SuperHyperForcing more understandable. For the sake 61 of having neutrosophic 1-failed SuperHyperForcing, there’s a need to “redefine” the 62 notion of “1-failed SuperHyperForcing”. The SuperHyperVertices and the 63 SuperHyperEdges are assigned by the labels from the letters of the alphabets. In this 64 procedure, there’s the usage of the position of labels to assign to the values. Assume a 65 1-failed SuperHyperForcing. It’s redefined neutrosophic 1-failed SuperHyperForcing if 66 the mentioned Table holds, concerning, “The Values of Vertices, SuperVertices, Edges, 67 HyperEdges, and SuperHyperEdges Belong to The Neutrosophic SuperHyperGraph” 68 with the key points, “The Values of The Vertices & The Number of Position in 69 Alphabet”, “The Values of The SuperVertices&The maximum Values of Its Vertices”, 70 “The Values of The Edges&The maximum Values of Its Vertices”, “The Values of The 71 HyperEdges&The maximum Values of Its Vertices”, “The Values of The 72 SuperHyperEdges&The maximum Values of Its Endpoints”. To get structural examples 73 and instances, I’m going to introduce the next SuperHyperClass of SuperHyperGraph 74 based on 1-failed SuperHyperForcing. It’s the main. It’ll be disciplinary to have the 75 foundation of previous definition in the kind of SuperHyperClass. If there’s a need to 76 have all SuperHyperConnectivities until the 1-failed SuperHyperForcing, then it’s 77 officially called “1-failed SuperHyperForcing” but otherwise, it isn’t 1-failed 78 SuperHyperForcing. There are some instances about the clarifications for the main 79 definition titled “1-failed SuperHyperForcing”. These two examples get more scrutiny 80 and discernment since there are characterized in the disciplinary ways of the 81 SuperHyperClass based on 1-failed SuperHyperForcing. For the sake of having 82 neutrosophic 1-failed SuperHyperForcing, there’s a need to “redefine” the notion of 83 “neutrosophic 1-failed SuperHyperForcing” and “neutrosophic 1-failed 84 SuperHyperForcing”. The SuperHyperVertices and the SuperHyperEdges are assigned 85 by the labels from the letters of the alphabets. In this procedure, there’s the usage of 86 the position of labels to assign to the values. Assume a neutrosophic SuperHyperGraph. 87 It’s redefined “neutrosophic SuperHyperGraph” if the intended Table holds. And 88 1-failed SuperHyperForcing are redefined “neutrosophic 1-failed SuperHyperForcing” if 89 the intended Table holds. It’s useful to define “neutrosophic” version of 90 SuperHyperClasses. Since there’s more ways to get neutrosophic type-results to make 91 neutrosophic 1-failed SuperHyperForcing more understandable. Assume a neutrosophic 92 SuperHyperGraph. There are some neutrosophic SuperHyperClasses if the intended 93 Table holds. Thus SuperHyperPath, SuperHyperCycle, SuperHyperStar, 94 SuperHyperBipartite, SuperHyperMultiPartite, and SuperHyperWheel, are 95 “neutrosophic SuperHyperPath”, “neutrosophic SuperHyperCycle”, “neutrosophic 96 SuperHyperStar”, “neutrosophic SuperHyperBipartite”, “neutrosophic 97 2/128 SuperHyperMultiPartite”, and “neutrosophic SuperHyperWheel” if the intended Table 98 holds. A SuperHyperGraph has “neutrosophic 1-failed SuperHyperForcing” where it’s 99 the strongest [the maximum neutrosophic value from all 1-failed SuperHyperForcing 100 amid the maximum value amid all SuperHyperVertices from a 1-failed 101 SuperHyperForcing.] 1-failed SuperHyperForcing. A graph is SuperHyperUniform if it’s 102 SuperHyperGraph and the number of elements of SuperHyperEdges are the same. 103 Assume a neutrosophic SuperHyperGraph. There are some SuperHyperClasses as 104 follows. It’s SuperHyperPath if it’s only one SuperVertex as intersection amid two given 105 SuperHyperEdges with two exceptions; it’s SuperHyperCycle if it’s only one 106 SuperVertex as intersection amid two given SuperHyperEdges; it’s SuperHyperStar it’s 107 only one SuperVertex as intersection amid all SuperHyperEdges; it’s 108 SuperHyperBipartite it’s only one SuperVertex as intersection amid two given 109 SuperHyperEdges and these SuperVertices, forming two separate sets, has no 110 SuperHyperEdge in common; it’s SuperHyperMultiPartite it’s only one SuperVertex as 111 intersection amid two given SuperHyperEdges and these SuperVertices, forming multi 112 separate sets, has no SuperHyperEdge in common; it’s SuperHyperWheel if it’s only one 113 SuperVertex as intersection amid two given SuperHyperEdges and one SuperVertex has 114 one SuperHyperEdge with any common SuperVertex. The SuperHyperModel proposes 115 the specific designs and the specific architectures. The SuperHyperModel is officially 116 called “SuperHyperGraph” and “Neutrosophic SuperHyperGraph”. In this 117 SuperHyperModel, The “specific” cells and “specific group” of cells are 118 SuperHyperModeled as “SuperHyperVertices” and the common and intended properties 119 between “specific” cells and “specific group” of cells are SuperHyperModeled as 120 “SuperHyperEdges”. Sometimes, it’s useful to have some degrees of determinacy, 121 indeterminacy, and neutrality to have more precise SuperHyperModel which in this case 122 the SuperHyperModel is called “neutrosophic”. In the future research, the foundation 123 will be based on the “Cancer’s Neutrosophic Recognition” and the results and the 124 definitions will be introduced in redeemed ways. The neutrosophic recognition of the 125 cancer in the long-term function. The specific region has been assigned by the model 126 [it’s called SuperHyperGraph] and the long cycle of the move from the cancer is 127 identified by this research. Sometimes the move of the cancer hasn’t be easily identified 128 since there are some determinacy, indeterminacy and neutrality about the moves and 129 the effects of the cancer on that region; this event leads us to choose another model [it’s 130 said to be neutrosophic SuperHyperGraph] to have convenient perception on what’s 131 happened and what’s done. There are some specific models, which are well-known and 132 they’ve got the names, and some SuperHyperGeneral SuperHyperModels. The moves 133 and the traces of the cancer on the complex tracks and between complicated groups of 134 cells could be fantasized by a neutrosophic SuperHyperPath(-/SuperHyperCycle, 135 SuperHyperStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). 136 The aim is to find either the longest 1-failed SuperHyperForcing or the strongest 137 1-failed SuperHyperForcing in those neutrosophic SuperHyperModels. For the longest 138 1-failed SuperHyperForcing, called 1-failed SuperHyperForcing, and the strongest 139 SuperHyperCycle, called neutrosophic 1-failed SuperHyperForcing, some general results 140 are introduced. Beyond that in SuperHyperStar, all possible SuperHyperPaths have 141 only two SuperHyperEdges but it’s not enough since it’s essential to have at least three 142 SuperHyperEdges to form any style of a SuperHyperCycle. There isn’t any formation of 143 any SuperHyperCycle but literarily, it’s the deformation of any SuperHyperCycle. It, 144 literarily, deforms and it doesn’t form. A basic familiarity with SuperHyperGraph 145 theory and neutrosophic SuperHyperGraph theory are proposed.

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

On Feb. 6^th, 2020, FDA implemented the enforcement priorities against all flavored, cartridge-based e-cigarettes other than menthol and tobacco flavors. This ban undermined the products’ attraction to vapers, so e-cigarette manufacturers added flavorants of other attractive flavors into tobacco-flavored e-cigarettes and re-established attractions. Both the sales of e-cigarettes and posts on social media suggested that the manufacturers’ strategies are likely “successful”. The re-established attraction causes not only a public health issue, but also threats to the health of individual vapers. Research has shown an increase in toxicity associated with the flavorants commonly used in flavored e-cigarettes that are likely added in tobacco-flavored e-cigarettes based on tobacco-derived and synthetic tobacco free nicotine, and these other flavors are associated with higher clinical symptoms not often induced by only natural traditional tobacco flavors. The additional health risks posed by the flavorants are pronounced even without considering the interactions of toxicology of the different tobacco flavorants, and more research should be done to understand the health risks thoroughly and to take proper actions accordingly for regulation of these emerging products.

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

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

We have investigated the antiferromagnetic phase transition in the frustrated and multiferroic hexagonal manganites $h$-(Y$_{0.98}$ Eu$_{0.02}$)MnO$_3$ (YEMO) and $h$-YMnO$_3$ (YMO). Elastic neutron scattering has been used to study in detail the phase transition in YMO and YEMO in zero pressure and in YMO at a hydrostatic pressure of 1.5~GPa. In zero pressure, we find the critical temperature $T_{\rm N} = 72.11(5)$~K and 71.3(1)~K and the critical exponent $\beta = 0.206(3)$ and 0.22(2), for YEMO and YMO, respectively. This is in agreement with earlier work by Roessli {\em et al.}. In applied hydrostatic pressure of 1.5~GPa, the ordering temperature increases to $T_{\rm N} = 75.2(5)$~K, in agreement with earlier reports, while $\beta$ is unchanged. Inelastic neutron scattering was used to determine the anisotropy spin wave gap at the phase transition, expected from spin wave theory to close with a critical exponent $\beta'$ identical to the one of the order parameter, $\beta' = \beta$. Our results indicate that the gap in YEMO indeed closes at $T_{\rm N}=72.4(3)$~K with $\beta' = 0.24(2)$, while the in-pressure gap in YMO closes at 75.2(5)~K with an exponent of $\beta' =0.19(3)$. In addition, the low-temperature anisotropy gap was found to have a slightly higher absolute value under pressure. The consistent values obtained for $\beta$ in the two systems support the likelihood of a new universality class for triangular, frustrated antiferromagnets.

For gravitational wave (GW) detected neutron star mergers, one of the leading candidates for electromagnetic (EM) counterparts is the afterglow from an ultra-relativistic jet. Where this afterglow is observed, it will likely be viewed off-axis, such as the afterglow following GW170817/GRB 170817A. The temporal behaviour of an off-axis observed GRB afterglow can be used to reveal the lateral jet structure, and statistical model fits can put constraints on the various model free-parameters. Amongst these parameters is the inclination of the system to the line of sight. Along with the GW detection, the afterglow modelling provides the best constraint on the inclination to the line-of-sight and can improve the estimates of cosmological parameters e.g. the Hubble constant, from GW-EM events. However, modelling of the afterglow depends on the assumed jet structure and, often overlooked, the effects of lateral spreading. Here we show how the inclusion of lateral spreading in the afterglow models can affect the estimated inclination of GW-EM events.

Carbon fiber reinforced polymers (CFRP) are extensively employed in the aerospace industry due to their excellent properties. Delamination damage occurring at critical locations in CFRP can seriously reduce the safety of in-service components. The detection and localization of delamination damage using Lamb waves hold significant potential for widespread application in non-destructive testing. However, the choice of damage localization algorithm may produce different delamination damage localization results. This research presented an IRAPID (improved reconstruction algorithm for probabilistic inspection of defects) method derived from the ORAPID (original reconstruction algorithm for probabilistic inspection of defects) method, aiming to improve the accuracy and reliability of delamination damage localization. Three CFRP bending plates, including a healthy bending plate and two bending plates with delamination damage sizes of Φ20 mm and Φ40 mm, were prepared in the experiment, respectively. The detection experiment of the CFRP bending plate using lead zirconate titanate (PZT) as a transducer to excite and receive Lamb waves was conducted, and the influence of excitation signal frequency on the performance of the proposed method was discussed. Under the condition of excitation signal frequency of 220 ~ 320 kHz and step size of 10 kHz, the accuracy of the delamination damage localization method proposed in this paper was compared with that of the existing methods. The experimental results indicate that the IRAPID algorithm exhibits good stability in the localization of delamination damage across the frequency variations range considered. The localization error of the IRAPID algorithm for delamination damage is significantly lower than that of the DaS (delay-and-sum) algorithm and the ORAPID algorithm. As the size of the delamination damage increases, so does the localization error. The accuracy of delamination damage localization is lower in the X-axis direction than in the Y-axis direction. By averaging the localization results across various frequencies, we can mitigate the potential localization errors associated with single-frequency detection to a certain extent. For the localization of delamination damage, Lamb waves at multiple frequencies can be employed for detection, and the detection results at each frequency are averaged to enhance the reliability of localization.

In this paper, we investigated transducer placement strategies for detecting crack in primary aircraft structures using ultrasonic Structural Health Monitoring (SHM). The approach developed is for an expected damage location based on fracture mechanics, for example fatigue crack growth in a high stress location. To assess the performance of the developed approach, finite-element (FE) modelling of a damage tolerant aluminum fuselage has been performed by introducing an artificial crack at a rivet hole into the structural FE model and assessing its influence on the Lamb wave propagation, compared to a baseline measurement simulation. The efficient practical sensor position was determined from the largest change in area that is covered by reflected and missing wave scatter using an additive color model. Blob detection algorithms were employed in order to determine the boundaries of this area and to calculate the blob centroid. To demonstrate that the technique can be generalized, the results from different crack lengths and from tilted crack are also presented.

The purpose of this case study was to evaluate the benefits that evidence-based nutritional and training recommendations could have on the time course of reconditioning following hip arthroplasty in a competitive master triathlete. Methods: During 38 weeks (from 6 weeks prior to surgery through to the return to competition), the athlete was provided with detailed training and nutritional recommendations based on the latest research evidence. Dietary intake (via the remote food photographic method), body composition (via DXA), peak oxygen uptake (VO2peak), peak power output (PPO) and cycling efficiency (GE) were assessed 6 weeks pre- and 8, 12, 18, 21 and 25-weeks post-surgery. Training load was quantified (TRIMP score) daily during the retraining. Results: Total body mass increased by 8.2 kg (attributable to a 3.5 and 4.6 kg increase in fat mass and lean mass, respectively) between week -6 and week 8 despite a reduction in carbohydrate (CHO) intake post-surgery (<3.0g/kg/day). This was accompanied with a decrease in VO2peak, PPO, and GE due to a drop in training load. From week 7, the athlete resumed training and was advised to gradually increase CHO intake according to the demands of training. Conclusions: Eventually the athlete was able to return to competition in week 32 with a higher PPO, improved VO2peak and GE. Throughout retraining, energy availability was maintained around 30 kcal/kg LBM/day, protein intake was high while CHO intake was periodised. Such dietary conditions allowed the athlete to maintain and even increase lean mass, which represents a major challenge with ageing.

The treatment of the bulky Rind-based dibromosilanes, (Rind)2SiBr2 (2) [Rind = 1,1,7,7-tetra-R1-3,3,5,5-tetra-R2-s-hydrindacen-4-yl: EMind (a: R1 = Et, R2 = Me) and Eind (b: R1 = R2 = Et)], with two equivalents of tBuLi in Et2O at low temperatures resulted in the formation of blue solutions derived from the diarylsilylenes, (Rind)2Si: (3). Upon warming the solutions above −20 °C, the blue color gradually faded, accompanying the decomposition of 3 and yielding the cyclic hydrosilanes (4) via intramolecular C−H bond insertion at the Si(II) center. The molecular structures of the bulky Eind-based 3b and 4b were confirmed by X-ray crystallography. Thus, at −20 °C, blue crystals were formed (Crystal-A), which were identified as mixed crystals of 3b and 4b. Additionally, colorless crystals of 4b as a singular component were isolated (Crystal-B), whose structure was also determined by an X-ray diffraction analysis. Although the isolation of 3 was difficult due to their thermally-labile nature, their structural characteristics and electronic properties were discussed based on the experimental findings complemented by computational results. We also examined the hydrolysis of 3b to afford the silanol, (Eind)2SiH(OH) (5b).

The human landscape transforming activity contributes to the global change of vegetation in different forms. Hunting is one of the most ancient human landscape-shaping activities. Feeders for hunting are particularly disruptive to vegetation. In the present study, we conducted a vegetation survey in these highly disturbed places. We are investigating the vegetation dynamics over several years in in the turkey oak–sessile oak zone, in two areas with different moisture and shade conditions (forest and clearing). One important background factor is changes in precipitation and temperature. The novelty of our present study lies in the fact that the observation takes place with continuous disturbance, where the human influence is very large. Our results confirm that the weed infestation be detectable at bait sites over a long period, and the interannual changes were typical in every year, according to the fact that in August, more weed species are usually present with a greater cover at the bait sites. The main meteorological factors played a role in the degree of weed infestation in each year. There was a higher proportion of vegetation regeneration in wetter years, while dry periods do not favor successional processes. With the drying of the climate, the disturbed areas are constantly losing their natural value, but wetter weather is not an automatic solution either. A more precise understanding of vulnerable systems and careful planning of treatment interventions is necessary.

The apicomplexan parasite, Sarcocystis neurona causes the degenerative neurological equine protozoal myeloencephalitis (EPM) disease of horses. Due to its host range expansion, S. neurona is an emerging threat that requires close monitoring. In apicomplexans, protein kinases (PKs) have been implicated in a myriad of critical functions such as host cell invasion, cell cycle progression and host immune responses evasion. Here, we used various bioinformatics methods to define the kinome of S. neurona and phylogenetic relatedness of its PKs to other apicomplexans. Further, three-dimensional (3D) homology models for selected S. neurona putative PKs were constructed and evaluated for inhibitor docking. We identified 92 putative PKs clustering within the AGC, CAMK, CK1, CMGC, STE, TKL, aPK and OPK groups. Although containing the universally conserved PKA (AGC group), S. neurona kinome was devoid of PKB and PKC, but contained the six apicomplexan conserved CDPKs (CAMK group). The OPK group was represented by ROPKs 19A, 27, 30, 33, 35 and 37, but was devoid of the virulence-associated ROPKs 5, 6, 18 and 38. Two out of the three S. neurona CK1 enzymes had high sequence similarities to T. gondii TgCK1-α and TgCK1-β and the Plasmodium PfCK1. Docking of four inhibitors onto homology models of putative ROP27 and PKA indicated that inhibition of S. neurona PKs is feasible, but needs to be experimentally tested. The essentiality of apicomplexan PKs makes the elucidation of S. neurona kinome a key milestone for development of novel therapeutics for EPM.

We report on the occurrence of natural Magnesium Alumina Silicate Hydrate (M-(A)-S-H) cement at Feragen and Leka in eastern and western Trøndelag Norway, respectively. Both occurrences are located in the sub-arctic climate zone and form in glacial till and moraine material deposited on ultramafic rock during the Weichselian glaciation. Weathering of serpentinized peridotite dissolve brucite and result in a relative high pH alkaline fluid that subsequently reacts with the felsic minerals of the till (quartz, plagioclase, K-feldspar) to form a cement consisting of an amorphous material or a mixture of nanocrystalline Mg-rich phyllosilicates, including illite. The presence of plagioclase in the till results in the enrichment of alumina in the cement, i.e., forms M-A-S-H instead of the M-S-H cement. Dissolution of quartz results in numerous etch-pits and negative quartz crystals filled with M-A-S-H cement. Where the quartz dissolution is faster that the cement precipitation, a honeycomb-like texture is formed. Compositionally the cemented till (tillite) contains more MgO and has a higher loss of ignition than the till, suggesting that the cement is formed by a MgO fluid that previously reacted with the peridotite. The M-(A)-S-H cemented till represent a new type of duricrust, coined magsilcrete. The study of natural Mg-cement provides information on peridotites as a Mg-source for Mg-cement and as a feedstock for CO2 sequestration.

Knowing the spatial variability of factors that influence crop yield is essential to carry out a localized treatment. The present study aimed to map the spatial variability of apparent soil electrical conductivity (ECa) in two cultivation areas, delimit management zones (MZ), characterize the soil density (Sd) at two depths, in each MZ, and assess whether the delimitation of MZ, based on the spatial variability of ECa, was able to identify regions of the productive field with different Sd. Spatial variability of ECa was detected. MZ with the highest mean value of ECa also presented the highest mean values of Sd. The highest Sd values were observed for the 0.1 – 0.2 m layer, regardless of the studied area. Regardless of granulometry, the proposed method was able to detect density differences from ECa. The delimitation of MZ, based on the spatial variability of ECa mapping, was able to differentiate the mean values of Sd between MZ 1 (1.53 g cm-3) and MZ 2 (1.67 g cm-3) in the Area A, in the 0.1 – 0.2 m layer. A statistical difference was observed for the mean values of Sd, in MZ 1, layer 0.1 - 0.2 m, when comparing the two study areas: A (1.53 g cm-3) and B (1.64 g cm-3). We suggest that further studies should be carried out, as the mapping of the spatial variability of the apparent soil electrical conductivity showed potential in the differentiation of soil bulk density at different depths.

In this paper a full state feedback control of a double inverted pendulum on a cart (DIPC) are designed and compared. Modeling is based on Euler-Lagrange equations derived by specifying a Lagrangian, difference between kinetic and potential energy of the DIPC system. A full state feedback control with H infinity and H 2 is addressed. Two approaches are tested: open loop impulse response and a double inverted pendulum on a cart with full state feedback H infinity and H 2 controllers. Simulations reveal superior performance of the double inverted pendulum on a cart with full state feedback H infinity controller.

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

Background: The antimalarial drug chloroquine and antimicrobial drug azithromycin have received significant attention during the current COVID-19 pandemic. Both drugs can alter cardiac electrophysiology and have been associated with drug-induced arrhythmias. Meanwhile, sympathetic activation is commonly observed during systemic inflammation and oxidative stress (e.g., in SARS-CoV-2 infection), and may influence the electrophysiological effects of chloroquine and azithromycin. Here, we investigated the effect of beta-adrenergic stimulation on proarrhythmic properties of chloroquine and azithromycin using a detailed in silico model of ventricular electrophysiology. Methods: Concentration-dependent chloroquine and azithromycin-induced alterations in ion-channel function were incorporated into the Heijman canine ventricular cardiomyocyte model. Single and combined drug effects on action-potential (AP) properties were analyzed using a population of 592 models accommodating inter-individual variability. Sympathetic stimulation was simulated by an increase in pacing rate and experimentally validated isoproterenol-induced changes in ion-channel function. Results: At 1 Hz pacing, therapeutic doses of chloroquine and azithromycin (5 and 20 µM, respectively) individually prolonged AP duration (APD) by 33% and 13%. Their combination produced synergistic APD prolongation (+161%) with incidence of proarrhythmic early afterdepolarizations in 53.5% of models. Increasing the pacing frequency to 2 Hz shortened APD and together with 1 µM isoproterenol corrected the drug-induced APD prolongation. No afterdepolarizations occurred following increased rate and simulated application of 0.1-1 µM isoproterenol. Conclusion: Sympathetic stimulation limits chloroquine- and azithromycin-induced proarrhythmia by reducing their APD-prolonging effect, suggesting the importance of heart rate and autonomic status monitoring in particular conditions (e.g., COVID-19).

Using the h-index to assess individual researchers is not only unethical and unfair but also inaccurate and misleading. This index fails to offer a reliable measure of a researcher's impact based on their citation scores. Beyond statistical and conceptual considerations, authorship practices, especially in the case of multi-authored publications, give rise to significant problems that often go unnoticed. While some modifications of the h-index have been proposed to mitigate these weaknesses, the fundamental deficiencies persist. Most of these flaws have been effectively addressed by the c-score, a composite citation index. The c-score excludes self-citations, normalizes the number of citations by considering the number of authors in each paper, and takes into account first, single, and last authorship. This approach provides a more realistic measure of the impact of each individual researcher based on raw citations.

In this paper, we investigate a new $q$-analogue of the higher order degenerate Changhee polynomials and numbers, which are called the Witt-type formula for the $q$-analogue of degenerate Changhee polynomials of order $r$. We can derive some new interesting identities related to the degenerate $(h,q)$-Changhee polynomials and numbers.

In this paper, we investigate a new $q$-analogue of the higher order degenerate Changhee polynomials and numbers, which are called the Witt-type formula for the $q$-analogue of degenerate Changhee polynomials of order $r$. We can derive some new interesting identities related to the degenerate $(h,q)$-Changhee polynomials and numbers.

In this data deposit, I describe a dataset that is the result of content mining 167,318 published articles for statistical test results. As a result of this content mining, 688,112 results from 50,845 articles were extracted. In order to provide a comprehensive set of data, the statistical results are supplemented with metadata from the article they originate from. The dataset is provided in a comma separated file (CSV) in long-format. For each of the 688,112 results, 20 variables are included, of which seven are article metadata and 13 pertain to the individual statistical results (e.g., reported and recalculated p-value). A five-pronged approach was taken to generate the dataset: (i) collect journal lists, (ii) spider journal pages for articles, (iii) download articles, (iv) add article metadata, and (v) mine articles for statistical results.

In this paper, we propose an imagined speech-based brain wave pattern recognition using deep learning. Multiple features were extracted concurrently from eight-channel Electroencephalography (EEG) signals. To obtain classifiable EEG data with fewer number of sensors, we placed the EEG sensors on carefully selected spots on the scalp. To decrease the dimensions and complexity of the EEG dataset and to avoid overfitting during the deep learning algorithm, we utilized the wavelet scattering transformation. A low-cost 8-channel EEG headset was used with MATLAB 2023a to acquire the EEG data. The Long-Short Term Memory Recurrent Neural Network (LSTM-RNN) was used to decode the identified EEG signals into four audio commands: Up, Down, Left, and Right. Wavelet scattering transformation was applied to extract the most stable features by passing the EEG dataset through a series of filtration processes. Filtration has been implemented for each individual command in the EEG datasets. The proposed imagined speech-based brain wave pattern recognition approach achieved a 92.50% overall classification accuracy. This accuracy is promising for designing a trustworthy imagined speech-based Brain-Computer Interface (BCI) future real-time systems. For better evaluation of the classification performance, other metrics were considered, and we obtained 92.74%, 92.50% and 92.62% for precision, recall, and F1-score, respectively.

Recent years have seen a massive increase in research on mindfulness as both a therapeutic practice as well as a protective health factor. While many associations have been made between mindfulness and clinical outcomes, understanding of the underlying mechanistic processes is still in its infancy. In this review, associations between mindfulness and other established frameworks in cognitive control are explored—in particular the dual modes of control framework in cognitive control theory. Studies in mindfulness providing evidence towards a dual-mode mindfulness model are reviewed and compared with the proactive and reactive modes of cognitive control to identify common underlying principles. Studies involving cognitive testing, advanced neuroimaging, and neurotransmitter levels and their associations with proactive and reactive control are reviewed in the context of the dual modes of mindfulness. While evidence supporting relationships between proactive and reactive modes of mindfulness and cognitive control are preliminary, existing literature on mindfulness already supports the notion of two components of mindfulness and is in line with the hypothesis that cognitive control and mindfulness are closely related. Since preliminary evidence suggests that proactive forms of mindfulness are more associated with improvement in clinical outcomes, mindfulness programs could be modified to target proactive mindfulness practices to maximize outcomes. The implications of proactive and reactive mindfulness on therapy, limitations of the framework, and necessity of studies providing direct evidence are further discussed.

A modular approach to the construction of electric machines, drive systems, power supply systems is a new direction of modern technology development. Especially, the modular approach is promising for electric vehicles due to such positive aspects as increased efficiency, fault tolerance, overall reliability, safety, enhanced control capabilities, etc. In this work, the modular approach is comprehensively applied to an EV powertrain system, which includes a dual three-phase (DTP) BLDC motor with two machine modules of an asymmetric configuration, two battery modules and a supercapacitor module (SCM). The proposed H–H configuration of modular EV powertrain system includes four voltage source inverters that combine the power modules with the open ends of the windings (OEW) of the module machine armature, and provide control of their operation. Based on the developed mode system of the OEW machine module operation for EV traction and braking, a general control algorithm for the proposed configuration of the modular EV powertrain system has been developed. It combines the control of the operating modes with the functions of maintaining the required SOC level of the SCM and equalizing the SOCs of the two battery modules. The conducted simulation and experimental studies confirmed the workability and effectiveness of the proposed solutions.

Many factors affect the quality of red meat. The aim of the study, carried out on 44 Polish Merino lambs, was analysis of physicochemical traits (pH, meat color, expressed juice, content of moisture, protein, fat, total collagen and fatty acid ) and content of carnosine, taurine, L-carnitine on fresh and meat aged for 7 and 14 d in the longissimus lumborum (LL) and gluteus medius (GM) muscles., Higher (p&lt;0.05) redness value (a*), lower yellowness (b*) were recorded in meat after of aging in gluteus medius muscle. A lower value (p&lt;0.05) of expressed juice was found in both LL and GM after 7 days of aging. The increase (p&lt;0.05) in protein and fat content in both muscle and collagen content in LL was observed in aged meat. There was no difference in fatty acid groups and C18:2 c9, t11 content between GM and LL muscle and fresh and aging meat. A higher TBARS content (p&lt;0.05) was recorded in meat after aging in both GM and LL. The meat aging process increased (p&lt;0.05) the content of carnitine and taurine, while the content of carnosine decreased. In summary the processes that turn muscles into meat in different types of muscles affect the physicochemical characteristics and the content of bioactive ingredients.

This paper addresses investigation of guided-wave excitation by angle-beam wedge piezoelectric transducers in multi-layered composite plate structure with orthotropic symmetry of the material. The aim of the present study is to determine the capability of such actuators to provide the controlled generation of an acoustic wave of a desirable type with the necessary wavelength, propagation distance and directivity. The studied CFRP panel is considered as homogenous with effective elastic moduli and anisotropic structural damping, whose parameters were determined experimentally. According to the results of dispersion analysis and taking into account the data of wave attenuation in a highly damping CFRP composite, the two types of propagating waves A0 and S0 were considered theoretically and experimentally in the frequency range 10 - 100 kHz. Using the results of a previous study, the structure of the wedge actuator was reconstructed to develop its finite element (FE) model, and a modal analysis was carried out, which revealed the most intense natural vibration modes and their eigenfrequencies within the used frequency range. Both experimental and numerical studies of the generation, propagation, directivity and attenuation of waves in the orthotropic composite panel under study revealed the influence of the angular orientation of the actuator on the formation of wave patterns and allowed to determine the capabilities of the wave's directivity control.

In this paper, the design and analysis of coupled tank water level control system is done using robust control theory. The main aim of this work is to improve level controlling mechanisms in industries and household areas. In this paper, H ∞ and μ –synthesis controllers are designed to improve the level control system. The coupled tank water level control system is designed using the proposed controller’s comparison and tested for tracking a reference level signals (step, sine wave and random) and simulation results have been analyzed successfully. Finally the comparative simulation results prove the effectiveness of the proposed coupled tank water level control system with H ∞ controller for improving the tracking mechanism performance of the system.

In this work, we introduce the class of h-MN-convex functions by generalizing the concept of MN-convexity and combining it with h-convexity. Namely, let M : [0, 1] → [a, b] be a Mean function given by M (t) = M (t; a, b); where by M (t; a, b) we mean one of the following functions: A_t (a, b) := (1 − t) a + tb, G_t (a, b) = a^1−tb^t and H_t (a, b) := $\frac{ab}{ta+\left(1-t\right)b}=\frac{1}{A_t\left(\frac{1}{a},\frac{1}{b}\right)}$ with the property that M (0; a, b) = a and M (1; a, b) = b. Let I, J be two intervals subset of (0, ∞) such that (0, 1) ⊆ J and [a, b] ⊆ I. Consider a non-negative function h : J → (0, ∞), a function f : I → (0, ∞) is said to be h-MN-convex (concave) if the inequality f (M (t; x, y)) ≤ (≥) N (h(t); f (x), f (y)), holds for all x, y ∈ I and t ∈ [0, 1]. In this way, nine classes of h-MN-convex functions are established, and therefore some analytic properties for each class of functions are explored and investigated. Characterizations of each type are given. Various Jensen’s type inequalities and their converses are proved.

One of the main challenges of cultured meat is reducing the costs of production, often described as scaling. The main components of the cultivation process include: cells, media, scaffolds and bioreactors. This work presents an alternative to current stainless steel or glass bioreactors and uses food-grade plant-based scaffolds. Bioreactors must be sterile and leak-free to maintain a proper environment for cell growth. Thermoplastic films are a popular material for constructing these fluidic systems, but traditional methods of welding these film are expensive and do not allow rapid prototyping resulting in high research and development costs for companies. In this study, a laser welding method was developed to join thermoplastic films in a way that prevents contamination and leaks, affording effective macro-fluidics fabrication. This technique was tested using polyethylene (PET) films and a laser cutter operating with settings calibrated for the material to be welded or cut. The laser welding method was found to produce strong, leak-free seals in PET films with minimal heat-induced damage to the films. The ability to design fluidics, chambers and ports of various size. Using this method afforded the incorporation of plant-based scaffolds from food-grade plants (Rice). The laser welding method developed in this study provides a reliable, contamination-free method for the rapid fabrication of fluidic systems for cell cultivation. This technique has the potential to be compatible with a vast range of cell types and scaffolds and to be widely adopted in tissue engineering for regenerative medicine and food applications such as cultured meat.

Detecting and monitoring changes in soil salinity through remote sensing provides an opportunity for field assessment in regions where on-site measurements are limited. This investigation, carried out in Siwa Oasis, Egypt, aimed to assess the efficacy of several soil salinity indices derived from Landsat 5 and 7 satellite images. To achieve this, 56 on-site ground measurements were utilized for evaluation purposes. The study aimed to improve the correlation between EC and index values and explore the relationship between salinity and changes in land cover. Eleven spectral indices were calculated for nine scenes captured in different months from August to December. The first approach involved stacking the data to identify the index with the strongest correlation with ground EC values, without the need for complex analysis or EC value ranging. In the second approach, the ground EC measurements were classified into seven different salinity categories, and the correlation coefficient was calculated between each index and each salinity category. The third approach analyzed the data temporally, considering different salinity levels. Lastly, a spatial correlation analysis was conducted between EC and index values in the fourth scenario. The initial approach revealed a weak correlation due to substantial variation in EC values. However, the SI index demonstrated the highest correlation coefficient of 0.38. In the second scenario, the S2 index exhibited the highest correlation of 0.96 for moderate salinity samples. The third scenario showed that the S1 index achieved the highest correlation value of 0.99 for moderately saline areas. In the fourth scenario, the SI index exhibited the strongest correlation among all four ponds with correlation coefficients of 0.23, 0.23, 0.18, and 0.61. Notably, the correlations observed in the second and third scenarios demonstrated higher correlation coefficients compared to both the first and fourth scenarios. The study highlighted significant variations in EC levels related to land cover types and pond elevation. Additionally, remote sensing methods detected a 48% increase in total vegetated area over 17 years, showing the potential of remote sensing techniques in salinity monitoring for expanding agriculture and improving land management.

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

The presence of potentially pathogenic bacteria on veterinary clinic surfaces may be problematic. In this study we collected swab samples (Fisherbrand, double transport swabs with Stuart’s liquid medium) and water samples from five veterinary rehabilitation clinics. Swabs and water samples were transported to a microbiology lab for processing. At the lab swabs were used to inoculated Hardy’s Cdiff Banana broth (for Clostridium difficile [Cdiff]), and five different types of bacterial growth media, including: Hardy CHROM MRSA agar (methicillin resistant Staphylococcus aureus [MRSA], and S. pseudintermedius [SIM]), Mannitol Salt Agar (S. aureus), Eosin Methylene Blue agar (enterics [ENT]), Pseudomonas Isolation agar (Pseudomonas sp.), and Tryptic Soy Agar [TSA] (non-specific). The most prominent species cultured was Cdiff (on nearly 55% of swabs). Bacillus sp. and Enterics were encountered on nearly 35% of swabs, with MRSA and SIM on just over 10% of swabs. The most contaminated sample site was harnesses/life jackets used with the underwater treadmill (33% of swabs). Underwater treadmill water had total bacterial counts from 1.6 to 2.7 e3 cfu/ml. Of all bacterial species detected SIM tends to be more pathogenic for dogs. Targeted cleaning/disinfecting in these clinics could help reduce risks for both animals and caregivers utilizing these clinics.

Carbon fiber reinforced polymer (CFRP) bending structure is widely used in the aviation field. The occurrence and propagation of delamination damage will reduce the safety of in-service bending structures. As a detection tool with high damage sensitivity, Lamb wave can effectively identify delamination damage. In this study, the signal difference coefficient (SDC) was introduced to quantify delamination damage and evaluate the sensitivity of A0 and S0 mode lamb waves to delamination damage. The simulation results show that compared with the S0 mode Lamb wave, the A0 mode Lamb wave exhibits higher delamination damage sensitivity. The delamination damage can be quantified based on the strong correlation between the SDC and the delamination damage size. The control effect of the linear array PZT phase time-delay method on Lamb wave mode was investigated by simulation. The phase time-delay method realizes the generation of a single-mode Lamb wave, which can separately excite the A0 mode and S0 mode Lamb wave to identify delamination damage of different sizes. The A0 mode Lamb wave was excited by the developed one-dimensional linear comb transducer (LCT), which was used to conduct the detection experiment on the CFRP bending plate with delamination damage sizes of Φ6.0 mm, Φ10.0 mm, and Φ15.0 mm. The experimental results verify the correctness of the simulation. According to the Hermite interpolation results of the finite-element simulation data, the relationship between the delamination damage size and the SDC was fitted by the Gaussian function, which can accurately quantify the delamination damage. The absolute error of the delamination damage quantification with fitting expression is not larger than 0.8 mm, and the percentage error is not more than 8%.

This paper describes the design and implementation of an ultrasonic non-contact air-coupled technique (UNCACT) using antisymmetric Lamb waves (ALW) for NDT assessment in novel composite sandwich plates of the car body shell. This technique is complemented with a C-Scan image implementation using this kind of guided waves. The finite element method using Comsol 6.1 is developed for the interpretation of the several wave modes presented in the experiments, including the ALW mode. The phase velocity method (PVM) is applied for the verification of the ALW mode in the portion of the RF signal necessary in the C-Scan image.

Accurate measurements of tree height and diameter at breast height (DBH) in forests to evaluate the growth rate of cultivars is still a significant challenge, even when using LiDAR and 3-D modeling. We propose an integrated pipeline methodology to measure the biomass of different tree cultivars in plantation forests with high crown density which that combines unmanned aerial vehicles (UAVs), hyperspectral image sensors, and data processing algorithms using machine learning. Using a planation of Cunninghamia lanceolate, commonly known as Chinese fir, in Fujian, China, images were collected using a hyperspectral camera and orthorectified in HiSpectral Stitcher. Vegetation indices and modeling were processed in Python using decision trees, random forests, support vector machine, and eXtreme Gradient Boosting (XGBoost) third-party libraries. Tree height and DBH of 2880 samples were measured manually and clustering into three groups: “fast growth,” “median,” growth and “normal” growth group, and 19 vegetation indices from 12,000 pixels were abstracted as the input of features for the modeling. After modeling and cross-validation, the classifier generated by random forests had the best prediction accuracy compare to other algorisms (75%). This framework can be applied to other tree species to make management and business decisions.

Universe created with the fundamental laws of science. Nature is lazy and needs to form with the least possible to be perfect. A natural pattern, such as pinecones, sunflowers, pineapples, and cacti, has a double spiral structure. Once we look at these plants' centers, we will see the seeds line up in spirals shape. The number of spirals whirling in each direction will give us the Fibonacci numbers. We can give more examples representing these natural patterns; however, one example is unique and remarkable. The similarities between spiral galaxies- Milky Way and hurricanes. Are they similar in every property or just in shape and rotational movements? What are the similarities between them? This short review article will try to find these questions' answers by reviewing some literature articles. The first part of this article gave some information about hurricanes and galaxies. The second of this article focused on the comparison between hurricanes and galaxies. Finally, we will conclude the article with our remarks.

This paper aims to unify q-derivative/q-integral and h-derivative/h-integral in a single definition, this will be called q−h-derivative/q−h-integral. These notions are further extended on finite interval [a,b] in the form of left and right q−h-derivatives and q−h-integrals. Some inequalities are studied for q−h-integrals which are directly connected with well known results. In diverse fields of science and engineering the theory based on q-derivatives/q-integrals and h-derivatives/h-integrals can be unified by using the concept of q−h-derivative/q−h-integral.

In sheep raised for meat production, the relationship between external udder conformation, colostrum quality, and lamb growth rates has not received much attention. We hypothesize that ewes with a more desirable udder conformation at lambing have greater colostrum quality and increased growth rates in lambs. Fifty Suffolk ewes were used in this study. Within 6-8 hours of parturition, colostrum samples from both halves of the udder were collected and a visual scoring of the udder was conducted. Colostrum quality was measured for total protein using both optical and Brix refractometers. On day 2, day 45, and day 60 after parturition, lamb weights were recorded, and udder conformation measurements were repeated. A visual scoring system evaluating udder floor (scale 1-4), udder depth (scale 1-9), teat placement (scale 1-9), teat lesions (present or absent), and the presence of wool (present or absent) was used to assess external udder conformation. Normal udder parameters include udder depth scores of 5 or 6, udder floor score of 1 or 2, teat placement scores 4, 5, and 6, and the absence of teat lesions and wool. All ewes not meeting normal parameters were considered to have an abnormal udder. The data was analyzed using the GLM procedure. Mean total colostrum total protein was greater (p = 0.03) in ewes displaying ‘normal’ udder conformation compared with those with ‘abnormal’ (14.82±0.5 and 13.31±0.3mg/dl). Mean Brix values were also greater (p = 0.03) for ewes with a ‘normal’ udder compared to an abnormal udder confirmation, respectively (21.70±0.8 and 19.54±0.5). On day 2 after parturition, mean lamb body weight was not different between ewes with ‘normal’ and abnormal udder (5.38±0.26 vs 5.46±0.15). No difference (p > 0.05) in lamb weights were detected between ewes with normal and abnormal udder conformations on day 45 and 60 after parturition. This data provides evidence of increased colostrum total protein values and increased Brix values present in ewes with ‘normal’ udder conformation and no difference in lamb weights between udder conformations.

In this study, we define new classes of convexity called of h-Godunova-Levin and h-Godunova-Levin preinvexity, through which some new inequalities of Hermite-Hadamard type were established. These new classes are the generalisation of several known convexity including the s-convex, P-function, Godunova-Levin. Further, the properties of h-Godunova-Levin function were also discussed. Meanwhile, the applications of h-Godunova-Levin Preinvex function are given

In this work, several inequalities of Popoviciu type for h-MN-convex functions are proved, where M and N are denote to Arithmetic, Geometric and Harmonic means and h is a non-negative superadditive or subadditive function.

Coral reefs are critical ecosystems globally for marine fauna, biodiversity and through the services they provide to humanity. However, they are significantly threatened by anthropogenic stressors, such as climate change. By combining 9 environmental variables and ecological and health-based thresholds obtained from the available literature, we develop, using fuzzy logic (discontinuous functions), a Coral Reef Stress Exposure Index (CRSEI) for remotely monitoring coral reef exposure to environmental stressors. Our approach capitalises on the abundance of readily available satellite Earth Observation (EO) data available in the Google Earth Engine (GEE) cloud-based geospatial processing platform. CRSEI values from 3157 distinct reefs were generated and mapped across 12 important coral reef ecosystem regions. Quantitative analyses indicated that the index detected significant temporal differences in stress and was, therefore, able to capture historic change at a global scale. We also applied the CRSEI to three case-study reef ecosystems, previously well-monitored for stress and disturbance using other methods. PCA analysis indicated that depth, current, sea surface temperature (SST) and SST anomaly accounted for the greatest contribution to the variance in stress in these three regions. The CRSEI corroborated temporal and spatial differences in stress exposure from known disturbances within these reference regions, in addition to identifying the potential drivers of inter- and intra-region differences in stress, namely depth, degree heating weeks and SST anomaly. We discuss how the index can be further improved in future with site-specific thresholds for each stress variable, and the incorporation of additional variables not currently available in GEE. This index provides an open access tool, built around a free and powerful processing platform, that has broad potential to assist in the regular monitoring of our increasingly imperilled coral reef ecosystems, and, in particular, those that are remote or inaccessible.

Renewable resources gain increasing interest as source for environmentally benign biomaterials, such as drug encapsulation/release compounds, and scaffolds for tissue engineering in regenerative medicine. Being the second largest naturally abundant polymer, the interest in lignin valorization for biomedical utilization is rapidly growing. Depending on resource and isolation procedure, lignin shows specific antioxidant and antimicrobial activity. Today, efforts in research and industry are directed toward lignin utilization as renewable macromolecular building block for the preparation of polymeric drug encapsulation and scaffold materials. Within the last five years, remarkable progress has been made in isolation, functionalization and modification of lignin and lignin-derived compounds. However, literature so far mainly focuses lignin-derived fuels, lubricants and resins. The purpose of this review is to summarize the current state of the art and to highlight the most important results in the field of lignin-based materials for potential use in biomedicine (reported in 2014–2018). Special focus is drawn on lignin-derived nanomaterials for drug encapsulation and release as well as lignin hybrid materials used as scaffolds for guided bone regeneration in stem cell-based therapies.

This paper aims to investigate the rate of expansion and extraction within the solar system. We carried out the Solar system expansion calculations to do such a review. The Universe is expected to look the same from every point in it. After the big bang, Universe is expanding at some speed. Astrophysicists have been in a race to measure precisely how fast the Universe is expanding since Hubble announced that galaxies were systematically moving away from Milky Way Galaxy with a current speed in 1929. Hubble’s observations came after Einstein’s general relativity, which inspired the big bang theory. According to the Big Bang theory, the Universe has created billions of years ago with an explosion and started to expand until today. The expansion of the Universe mostly happens in vast spaces, so clusters of galaxies move away from each other. For example, raising bread during baking will expand, but the raisings will stay the same size while moving each other to expand the bread. Observers have proven that an object (galaxies, a cluster of planets) held together by gravity has a patch of nonexpanding space produced by a gravitational field. However, some observers claimed the solar system is not expanding, while others claimed it is expanding. Does our solar system expand in an expanding Universe? The cosmological expansion of local systems is reviewed in the modern cosmological models. We showed answers related to this question with the help of literature. This review article revisited the proof of the Solar System’s expansion and its speed with about 0.32 nm/s in an expanding Universe.

This article examines older physical education (PE) teachers’ wellbeing over the course of their career in Finland. The study highlights challenges to physical and mental functioning as well as how teachers respond to these challenges. The six interviewees were over 55-year-old PE teachers, whose career had lasted for more than 30 years. Qualitative methods were used in the collection, transcription and analysis of the research data. The qualitative analysis consisted of a series of interpretations that visualised the world described by the interviewees. All the research participants had physical problems that affected their teaching and make teachers consider a potential career change. To be able to teach, teachers adapted their ways of working according to the challenges brought by age and injuries. The research participants found that the challenges caused by musculoskeletal problems and ageing were an inevitable part of the profession. They emphasised the positive sides of the work: the profession permits varied workdays. In addition, the teachers noted that their work provides them with opportunities to remain physically fit. Teaching health education is a means to lighten the workload of older teachers. PE teachers enjoy their profession and are dedicated to it, despite all the challenges. The interviewed participants clearly experienced work engagement. Our development proposal for teacher education is that future PE teachers be informed about the risks involved in the profession. Such activity helps young teachers reflect proactively on the measures taken to maintain their functioning during their career and on perspectives related to the ways of working.