This study introduces a novel computational approach for testing conditional independence (BB CI test) within causal Directed Acyclic Graphs (DAGs), leveraging Bayesian non-parametric bootstrap and machine learning techniques. Our method offers an alternative for validating the assumptions underpinning causal DAGs. Through simulation studies and an industrial case analysis, we demonstrate the test procedure in accurately assessing conditional independence, comparing it with the Generalized Covariance Measure (GCM) test. Our findings suggest that the BB CI test is advantageous in scenarios where existing methods may falter due to violations of model assumptions. This research contributes to the causal inference literature by providing a computational tool for researchers and practitioners to validate causal models.

The origins of directed acyclic graphs (DAGs) date back to the emergence of ‘graph theory’ in the early 1700s (Biggs et al. 1986). DAGs are conceptual or literal, diagrammatic representations of causal paths between variables which are constructed – as their name suggests – on the basis of two over-riding principles: first, that all causal paths are ‘directed’ (i.e. for each pair of variables, only one can represent the cause, while the other must be its consequence); and second, that no direct cyclical paths, or indirect cyclical pathways (comprising sequences of consecutive paths) are allowed, such that no consequence can be considered its own direct or indirect cause (hence ‘acyclic’; Law et al., 2012). As such DAGs reflect the knowledge, presumptions, assumptions and/or speculation of the analyst(s) concerned regarding the causal relationships between each of the variables included therein. Current convention dictates that variables are represented as nodes/vertices, and that any causal paths between variables are represented as directed arcs/edges/lines, often in the form of arrows (see Figure 1). Although each arc indicates the presence and direction of a known/presumed/assumed/speculative causal relationship between the two variables concerned, drawing an arc does not require the sign, magnitude, precision or shape of the relationship to be known or declared (Tennant et al., 2021). In this respect, DAGs provide a simple, uncomplicated, accessible and entirely nonparametric approach for postulating causal relationships amongst any variables of interest even when these are uncertain, unknown or entirely speculative (Ellison, 2020). Nonetheless, as a result of the parametric constraints imposed by the presence/absence of possible arcs within any given DAG, these also reflect and support a number of more sophisticated statistical applications which make it possible to use DAGs to inform the design of multivariable statistical models that reflect the causal structure(s) involved – albeit without the need to know or understand the mathematical technicalities on which these are based (Lewis and Kuerbis, 2016). These features make DAGs attractive cognitive, educational and analytical tools for strengthening the epistemological, theoretical and empirical basis of causal inference, and there has been a recent proliferation in the use of DAGs across a range of applied scientific disciplines (e.g. Knight and Winship, 2013), and an associated upsurge in analytical methods training (e.g. Elwert, 2011; Gilthorpe, 2017; Hernán 2018; Roy, 2021; Hünermund, 2021). This Chapter reflects on a decade of delivering medical statistics training to undergraduate medical students at the University of Leeds between 2012-2021 in which the third year research, evaluation and special studies module (‘RESS3’) has used DAGs to support the development of applied statistical skills relevant to the extended student-selected research and evaluation projects (ESREP) students undertake in their fourth and final years (Ellison, 2021; Ellison et al., 2014a,b). Based on successive iterations of the structure and content of the RESS3 module, together with notes made during formal and informal planning and review meetings with module leads, lecturers, tutors and students, we draw on the claims and criticisms made of DAGs in the epidemiological literature to identify a number of explicit strengths (and associated, often implicit. weaknesses) that are central to their use in prediction and causal inference modelling. While using DAGs requires (and benefits from) a clear understanding of their non-parametric nature and parametric implications, the weaknesses of DAGs seem likely to reflect both: the challenges inherent in the modelling of data generating processes when these are imperfectly understood; and troublesome cognitive and heuristic tendencies common to all analytical tools – in which the tool facilitates the task in hand by reducing the necessity (and benefits of) exploring uncertainties and identifying assumptions. These, more epistemological considerations appear particularly challenging for medical undergraduates to grasp (Ellison, 2021), but also appear poorly understood by many established analysts and clinical epidemiologists (Ellison, 2020).

Directed acyclic graphs (DAGs) are nonparametric causal path diagrams that have substantial utility as principled representations of disease and healthcare pathways, and of the underlying ‘data generating mechanisms’ these pathways involve. As such, DAGs provide a valuable bridge between: the aetiological knowledge, operational insight and professional experience on which clinical training and practice depend; and the more abstract epistemological and analytical considerations required to extract robust statistical insight from health and healthcare data. DAGs are nonetheless vulnerable to imperfect biomedical paradigms, partial clinical knowledge and limited empirical data. DAGs drawn under such circumstances offer limited scope for statistical insight free from cognitive, analytical or inferential bias if: they misrepresent the data generating mechanisms involved; or ignore the important role that omitted variables (whether measured, unmeasured or unacknowledged) might play therein. To address these weaknesses and broaden the appeal and application of DAGs, this chapter provides ten simple steps that educators can use to improve the analytical competence and statistical confidence of the healthcare students, qualified practitioners and experienced researchers they support. These steps use temporal logic to draw DAGs so as to: reduce reliance on uncertain knowledge, incomplete information, flawed assumptions or guesswork; and avoid, mitigate or acknowledge the errors and biases that each of these incur. The chapter comprises an accessible, non-technical overview of the perspective and thoughtfulness required to generate temporally coherent DAGs as objective representations of the probabilistic causal paths involved in context-specific data generating mechanisms. It encourages a focus on those variables operating as potential sources of analytical or inferential bias when estimating the plausible, probabilistic causal relationship between two pre-specified variables; and specifically addresses the challenges posed by: omitted; time-variant; non-asynchronous; and temporally obscure variables. The chapter includes a worked example based on a published clinical study to demonstrate how each of the steps required to generate temporally-informed DAGs can be applied to: critically appraise the analytical decisions made during applied healthcare research; and inform the decisions required when designing, undertaking and analysing primary and secondary, prospective and retrospective research. The appendices include a summary of ten recommendations for improving the reporting and interrogability of DAGs and DAG-informed analyses.

The Collatz conjecture is a well-known number theory puzzle that states that every positive integer would eventually converge to the trivial cycle of 1, 2, 1, 2,... when repeatedly exposed to a particular transformation. In this transformation, even numbers are divided in half, odd numbers are tripled, and one is added. In this study, we present a new method for creating a directed graph and using it to display and analyze Collatz sequences. Our technique creates what we call a Collatz directed graph by joining an endless number of simple directed graphs, each of which corresponds to a natural number. We show by careful mathematical analysis that all positive integers are included in this Collatz directed graph. Moreover, we give an evidence that verifies the Collatz conjecture by showing that the sole cycle in this graph is the trivial cycle of 1, 2, 1, 2,... We also prove that there is no sequence that diverges to infinity in this graph. Our results provide insights into the fundamental structure of Collatz sequences and further our knowledge of the Collatz conjecture .

Despite the partial disclosure of driving scenario knowledge graphs, they still fail to meet the comprehensive needs of intelligent connected vehicles for driving knowledge. Current issues include the high complexity of pattern layer construction, insufficient accuracy of information extraction and fusion, and limited performance of knowledge reasoning models. To address these challenges, a hybrid knowledge graph method was adopted in the construction of the Driving Scenario Knowledge Graph (DSKG). Firstly, core concepts in the field were systematically sorted and classified, laying the foundation for the construction of a multi-level classified knowledge graph top-level ontology. Subsequently, by deeply exploring and analyzing the Traffic Genome data, 34 entities and 51 relations were extracted and integrated with the ontology layer, achieving the expansion and updating of the knowledge graph. Then, in terms of knowledge reasoning models, an analysis of the training results of the TransE, Complex, Distmult, and Rotate models in the entity linking prediction task of DSKG revealed that the Distmult model performed the best in metrics such as hit rate, making it more suitable for inference in DSKG. Finally, a standardized and widely applicable Driving Scenario Knowledge Graph was proposed. The DSKG and related materials have been publicly released for use by industry and academia.

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.

Directed energy deposition (DED) parameters were determined for near-β alloy Ti-55511 by employing statistical design of experiments (DOE) methods. Parameters resulting in fully dense freeform deposits were identified using two sequential DOEs. Single laser tracks were printed with several laser power, traverse rate, and powder feed rate settings in an initial DOE to identify promising build parameters. Capture efficiency and effective deposition rate were used to characterize and rank the single track deposits. The best parameters were then used to print solid cube with various X-Y and Z-overlaps (different hatch spacing, HS, and layer thickness, ZS) in a second DOE. Suitable deposition parameters were selected based on cube density and microstructure and were used to fabricate larger tensile samples for mechanical testing. Multiple parameter sets were found to provide dense Ti-55511 deposits with acceptable mechanical properties and parametric models showed statistical significance.

The social- and self-directed behaviours of two golden lion tamarins (Leontopithecus rosalia) was investigated while having residence in the tropical house of Aalborg Zoo, Denmark. The behaviour of the female had been distinct from the male since 2018. Despite several diagnostic examinations and medicinal treatments, the cause of the aberrant and apparently stereotypical behavioural patterns remained undetermined, which initiated this study. The pair were recorded throughout a predetermined observation period and these recordings were analysed to illuminate the behaviours of the individuals. The results showed that there were differences in the type, frequency, and durations of both social- and self-directed behaviours between the sick female and the healthy male. The female expressed both social- and self-directed behaviours more frequently and for longer durations, while the male were more socially reserved and did not engage in social behaviours as frequently. Furthermore, subsequent necropsy of the female revealed uro-genital disease.

In this paper, we observe that if X is a set and (Bin(X), □) is the semigroup of binary systems on X, then its center ZBin(X) consists of the locally-zero-semigroups and that these can be modeled as (simple) graphs and conversely. Using this device we show that we may obtain many results of interest concerning groupoids by reinterpreting graph theoretical properties and at the same time results on graphs G may be obtained by considering them as elements of centers of the semigroups of binary systems (Bin(X), □) where X = V(G), the vertex set of G.

Recent development for synthesis of bio-based long chain aliphatic polyesters by acyclic diene metathesis (ADMET) polymerization of α,ω-dienes, derived from plant oils and bio-based chemicals, like bis(10-undecenoate) with isosorbide, using ruthenium-carbene catalysts have been reviewed. Development of subsequent (one-pot) tandem hydrogenation afforded saturated polyesters under mild conditions. The polymerizations under bulk (without solvent, 80-90 ºC) or in ionic liquids (50 ºC) under vacuum conditions enabled synthesis of high molar mass polymers (Mn >30,000 g/mol). The polymerization by molybdenum-alkylidene catalyst afforded the highest molecular weight polyesters (44000‒49400 g/mol, in toluene at 25 ºC) exhibiting promising tensile properties (strength and elongation at break) beyond polyethylene, polypropylene. Depolymerizations of these polyesters including closed loop chemical recycling were also demonstrated. Catalyst developments (more active, under mild conditions) play a key role for the efficient synthesis.

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.

We address the problem of finding a unique graph embedding that best describes a graph's "topology". This issue is of particular interest in the chemistry of materials. Graphs that admit a tiling in 3-dimensional Euclidean space are termed tessellate, those that do not decussate. We give examples of decussate and tessellate graphs that are finite and 3-periodic. We conjecture that a graph has at most one tessellate embedding. We give reasons for considering this the default "topology" of periodic graphs.

Graph visualization has evolved significantly over time, offering various methods to effectively represent complex data structures. This study introduces a novel force-directed algorithm for 3D data visualization, specifically tailored for commonly used datasets in linked data visualization. Leveraging the power of graph theory and methods, the algorithm aims to address the challenge of creating visually appealing and easily interpretable visualizations, which often necessitate advanced user interaction. By utilizing 3D space and the Unity Engine, the research successfully visualizes data and develops interactive visualizations, overcoming limitations of basic force-directed implementations. The main contribution of presented research is in the force-directed algorithm with springs and controlled placement as a visualization technique that combines the use of springs and attractive forces to stabilize a graph in a 3D environment. The combination of these two techniques also helps prevent the formation of a single large cluster within the graph, enhancing the overall visualization quality.

Patients with underlying health conditions are at risk for a poor outcome from Coronavirus disease 2019 (COVID-19). Using machine reasoning by the sci.AI system, we investigated the pathobiochemistry of this observation to generate therapeutic guidelines. Facts were extracted and linked from publications available in nlm.nih.gov and Europe PMC to form the dataset which was validated by medical experts. Previously we described how preexisting chronic inflammation renders the acute inflammatory response to Severe acute respiratory syndrome coronavirus 2 (SARS-CoV-2) excessive translating the SARS-CoV-2 infection into the clinical COVID-19 syndrome. Herein we focus on therapeutic interventions that mitigate the immune response. In essence, from bench to bedside, as depicted in the Graphical Abstract, the clinical management of COVID-19 should aim at: A. Control of excessive oxidant production. B. Neutralization of excessive oxidants. C. Upregulation of nitric oxide (NO) production.

Being able to express broad families of equivariant or invariant attributed graph functions is a popular measuring stick of whether graph neural networks should be employed in practical applications. However, it is equally important to learn deep local minima of losses (i.e., with much smaller loss values than other minima), even when architectures cannot express global minima. In this work we introduce the architectural property of attracting GNN optimization trajectories to local minima as a means of achieving smaller losses. We take first steps in satisfying this property for losses defined over attributed undirected unweighted graphs with a novel architecture, called Universal Local Attractor (ULA). The latter refines each dimension of end-to-end trained node feature embeddings based on graph structure to track the optimization trajectories of losses satisfying some mild conditions. The refined dimensions are then linearly pooled to create predictions. We experiment on 10 tasks, from node classification to clique detection, on which ULA is comparable with or significantly outperforms popular alternatives of similar or greater theoretical expressive power.

Symmetry, as a key concept in geometry and the foundational principle of mathematical concepts, is a fundamental part of geometry and nature, creating patterns that help us conceptually organize our world. It is often linked with aesthetic beauty and can be observed in both natural phenomena and human-made objects, such as artworks and manufactured products, across the globe. The automorphism group of a graph is a mathematical structure that captures all the symmetries of the graph. symmetry refers to the property of a graph, indicating that it can be transformed without changing its structure, while the automorphism group is the collection of all permutations of the vertices that preserve the graph's adjacency relationships. In graph theory, the concepts of symmetry group and automorphism group play fundamental roles in understanding the symmetries and structural properties of graphs. This paper aims to explore the relationship between symmetry groups and automorphism groups, shedding light on their interconnected nature and their significance in graph theory. We delve into the definitions and properties of both symmetry groups and automorphism groups, highlighting their similarities and distinctions. Furthermore, we discuss their applications in various fields, including computer science, chemistry, and network analysis. Through this exploration, we aim to provide a comprehensive understanding of the relationship between symmetry groups and automorphism groups, deepening our comprehension of the symmetries and structures inherent in graphs.

Shannon entropy quantifying bi-colored Ramsey complete graphs is introduced. Complete graphs in which vertices are connected with two types of links, labeled as α-links and β-links are considered. Shannon-entropy is introduced according to the classical Shannon formula considering the fractions of monochromatic convex α-colored polygons with n α-sides or edges, and the fraction of monochromatic β-colored convex polygons with m β-sides in the given complete graph. Introduced Shannon entropy is insensitive to the exact shape of the graph, but it is sensitive to the distribution of monochromatic polygons in a given graph. The introduced Shannon Entropies Sα and Sβ are interpreted as follows: Sα is interpreted as an average uncertainty to find the green α-polygon in the given graph, Sβ is, in turn, an average uncertainty to find the red β-polygon in the same graph. The re-shaping of the Ramsey theorem in terms of the Shannon Entropy is suggested. Various measures quantifying the Shannon Entropy of the entire complete bi-colored graphs are suggested. Physical interpretations of the suggested Shannon Entropies are discussed.

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

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

The aim of this expository article is to present recent developments in the centuries-old discussion on the interrelations between several types of domination in graphs. However, the novelty even more prominent in the newly discovered simplified presentations of several older results. Domination can be seen as arising from real-world application and extracting classical results as first described by this article.The main part of this article, concerning a new domination and older one, is presented in a narrative that answers two classical questions: (i) To what extend must closing set be dominating? (ii) How strong is the assumption of domination of a closing set? In a addition, we give an overview of the results concerning domination. The problem asks how small can a subset of vertices be and contain no edges or, more generally how can small a subset of vertices be and contain other ones. Our work was as elegant as it was unexpected being a departure from the tried and true methods of this theory that had dominated the field for one fifth a century. This expository article covers all previous definitions. The inability of previous definitions in solving even one case of real-world problems due to the lack of simultaneous attentions to the worthy both of vertices and edges causing us to make the new one. The concept of domination in a variety of graphs models such as crisp, weighted and fuzzy, has been in a spotlight. We turn our attention to sets of vertices in a fuzzy graph that are so close to all vertices, in a variety of ways, and study minimum such sets and their cardinality. A natural way to introduce and motivate our subject is to view it as a real-world problem. In its most elementary form, we consider the problem of reducing waste of time in transport planning. Our goal here is to first describe the previous definitions and the results, and then to provide an overview of the flows ideas in their articles. The final outcome of this article is twofold: (i) Solving the problem of reducing waste of time in transport planning at static state; (ii) Solving and having a gentle discussions on problem of reducing waste of time in transport planning at dynamic state. Finally, we discuss the results concerning holding domination that are independent of fuzzy graphs. We close with a list of currently open problems related to this subject. Most of our exposition assumes only familiarity with basic linear algebra, polynomials, fuzzy graph theory and graph theory.

We introduce a new variation on the domination theme which we call vertex domination as reducing waste of time in transportation planning and optimization of transport routes. We determine the vertex domination number $\gamma_v$ for several classes of fuzzy graphs. The bounds is obtained for it. In fuzzy graphs, monotone decreasing property and monotone increasing property are introduced. We prove both of the vizing's conjecture and the Grarier-Khelladi's conjecture are monotone decreasing fuzzy graph property for vertex domination. We obtain Nordhaus-Gaddum (NG) type results for these parameters. The relationship between several classes of operations on fuzzy graphs with the vertex domination number of them is studied. Finally, we discuss about vertex dominating set of a fuzzy tree by using the bridges and $\alpha$-strong edges equivalence.

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

A popular approach to learning about admixture from population genetic data is by computing the allele-sharing summary statistics known as f-statistics. Compared to some methods in population genetics, f-statistics are relatively simple, but interpreting them can still be complicated at times. In addition, f-statistics can be used to build admixture graphs (multi-population trees allowing for admixture events), which provide more explicit and thorough modeling capabilities but are correspondingly more complex to work with. Here, I discuss some of these issues to provide users of these tools with a basic guide for protocols and procedures. My focus is on the kinds of conclusions that can or cannot be drawn from the results of f₄-statistics and admixture graphs, illustrated with real-world examples involving human populations.

Complex systems can be described as the network of interactions between their components. In directed networks, information, energy and matter flow in dominant directions. Undirected networks, on the other hand, cannot easily capture these asymmetries. The local flow of information depends on the node spin, which is a function of the number of incoming and outgoing links attached to it. And yet, how the heterogeneous association between in-degree and out-degree constraints global dynamics remains poorly understood. Here, we develop a new theoretical model to study the relationship between node directionality and global flow dynamics. Our computational analysis of random and scale-free directed networks indicates that structural diversity constrains the dimensionality of reachable dynamical space. These results suggest how local directionality might be an universal driver of global dynamics in many systems, from social networks, to technological systems to the connectome.

We present a new computing package Flagser, designed to construct the directed flag complex of a finite directed graph, and compute persistent homology for flexibly defined filtrations on the graph and the resulting complex. The persistent homology computation part of Flagser is based on the program Ripser [2], but is optimised specifically for large computations. The construction of the directed flag complex is done in a way that allows easy parallelisation by arbitrarily many cores. Flagser also has the option of working with undirected graphs. For homology computations Flagser has an Approximate option, which shortens compute time with remarkable accuracy. We demonstrate the power of Flagser by applying it to the construction of the directed flag complex of digital reconstructions of brain microcircuitry by the Blue Brain Project and several other examples. In some instances we perform computation of homology. For a more complete performance analysis, we also apply Flagser to some other data collections. In all cases the hardware used in the computation, the use of memory and the compute time are recorded.

The study on graphs emerging from different algebraic structures like groups, rings, fields, vector spaces, etc. is a prominent area of research in mathematics, as algebra and graph theory are two mathematical fields that focuses on creating and analysing structures. There are numerous studies linking algebraic structures and graphs, which began with the introduction of Cayley graphs of groups. Several algebraic graphs have been defined on rings, which have huge-growing literature. In this article, we systematically review the literature on some variants of Cayley graphs that are defined on rings, to understand the research in this area.

In IP networks, packet forwarding is destination-based and hop-by-hop, and routes are built as needed. Kwong et al. introduced a protection routing in which packet delivery to the destination node can proceed uninterrupted in the event of any single node or link failure. He then shows that “whether there is a protection routing to the destination” is NP-complete. Tapolcai find that two completely independent spanning trees, abbreviated as CISTs, can be used to configure the protection routing. In this paper, we propose dual protection routing trees, denoted as dual-PRTs to replace CISTs, which are less restrictive than CISTs. Next, we propose a transformation algorithm that uses dual-PRTs to configure the protection routing. Taking complete graphs Kn, complete bipartite graphs Km,n, hypercubes Qn, locally twisted cubes LTQn as examples, we provide a recursive method to construct dual-PRTs on them. This article will show that there are no two CISTs on K3,3, Q3, and LTQ3, but there exist dual-PRTs that can be used to configure the protection routing. As shown in the performance evaluation of simulation results, for both Qn and LTQn, we get the average path length of protection routing configured by dual-PRTs is shorter than that by two CISTs.

Graph entropies have been used to interpret the complexity of the networks. There are various graph entropies in the literature. In this note a new graph entropy is defined which is based on the dominating sets of the graphs. Moreover the entropy of some classes of the graphs is obtained

The canonical decomposition of a bipartite graph is a new decompositionmethod that involves three operators, parallel, series and K+S. The class of weak bisblit graphs is totally decomposable with respect of these operators, and the class of bicographs is totally decomposable with respect of parallel and series operators. We prove in this paper that the class of bipartite (P_6,C_6)-free graphs is exactly the class of bipartite graphs that are totally decomposable with respect of parallel and K+S operators. We simplify the recognition algorithm of weak-bisplit graphs to adepte with bipartite (P_6,C_6)-free graphs. As a result of this adapted algorithm, we prsent efficient solutions in this class of graphs for two optimization graph problems, the first is the maximm balanced bi-clique problem and the the second is the maximum independent set problem.

Let G[F,Vk, Huv] be the graph with k pockets, where F is a simple graph of order n ≥ 1,Vk= {v1,v2,··· ,vk} is a subset of the vertex set of F and Hvis a simple graph of order m ≥ 2,v is a specified vertex of Hv. Also let G[F,Ek, Huv] be the graph with k edge pockets, where F is a simple graph of order n ≥ 2, Ek= {e1,e2,···ek} is a subset of the edge set of F and Huvis a simple graph of order m ≥ 3, uv is a specified edge of Huvsuch that Huv− u is isomorphic to Huv− v. In this paper, we derive closed-form formulas for resistance distance and Kirchhoff index of G[F,Vk, Hv] and G[F,Ek, Huv] in terms of the resistance distance and Kirchhoff index F, Hv and F, Huv, respectively.

Onchocerciasis, or river blindness, has historically been one of the most important causes of blindness worldwide, and a major cause of socio-economic disruption, particularly in sub-Saharan Africa. Its importance as a cause of morbidity and an impediment to economic development in some of the poorest countries in the world motivated the international community to implement several programs to control or eliminate this scourge. Initially, these involved reducing transmission of the causative agent Onchocerca volvulus through controlling the vector population. When ivermectin was found to be a very effective drug for treating onchocerciasis, the strategy shifted to mass drug administration (MDA) of endemic communities. In some countries, both vector control and ivermectin MDA have been used together. However, traditional vector control methods involve treating rivers in which the black fly vectors breed with insecticides, a process which is expensive, requires trained personnel to administer, and is ecologically harmful. In this review, we discuss recent research into alternatives to riverine insecticide treatment, which are inexpensive, ecologically less harmful and which can be implemented by the affected communities themselves. These can dramatically reduce vector densities and, when combined with ivermectin MDA, can accelerate the time to elimination when compared to MDA alone.

Knowledge graphs (KGs) play a crucial role in many applications, such as question answering, but incompleteness is an urgent issue for their broad application. Much research in knowledge graph completion (KGC) has been performed to resolve this issue. The methods of KGC can be classified into two major categories: rule-based reasoning and embedding-based reasoning. The former has high accuracy and good interpretability, but a major challenge is to obtain effective rules on large-scale KGs. The latter has good efficiency and scalability, but it relies heavily on data richness and cannot fully use domain knowledge in the form of logical rules. We propose a novel method that injects rules and learns representations iteratively to take full advantage of rules and embeddings. Specifically, we model the conclusions of rule groundings as 0-1 variables and use a rule confidence regularizer to remove the uncertainty of the conclusions. The proposed approach has the following advantages: 1) It combines the benefits of both rules and knowledge graph embeddings (KGEs) and achieves a good balance between efficiency and scalability. 2) It uses an iterative method to continuously improve KGEs and remove incorrect rule conclusions. Evaluations on two public datasets show that our method outperforms the current state-of-the-art methods, improving performance by 2.7% and 4.3% in mean reciprocal rank (MRR).

When an aircraft malfunctions, quickly and accurately identifying the faulty unit is essential for ensuring normal operation. Unfortunately, maintenance engineers often struggle to acquire the necessary fault-related knowledge due to poor management and utilization of aircraft fault documents. To address this issue, we introduce knowledge graph technology into the field of aircraft fault diagnosis, exploring its construction and application for effective knowledge management. Our work starts by analyzing the critical knowledge elements required for aircraft fault diagnosis and designing a schema layer for fault knowledge graphs. We then we then combine deep learning and heuristic rules to extract fault knowledge from both structured and unstructured data, enabling the construction of aircraft fault knowledge graphs. Finally, we develop a fault question-answering system based on fault knowledge graphs that can accurately give solutions to questions posed by maintenance engineers. Our practice demonstrates that knowledge graphs provide an effective means of managing aircraft fault knowledge, assisting engineers in locating fault reasons accurately and quickly.

The generalization of Farey graphs and extended Farey graphs are all originated from Farey graph and scale-free and small-world simultaneously. We propose a labeling of the vertices for it that allows determining all the shortest paths routing between any two vertices only based on their labels. The maximum number of shortest paths between any two vertices is huge as the product of two Fibonacci numbers, however, the label-based routing algorithm runs in linear time O(n). The existence of an efficient routing protocol for Farey-type models should help the understanding of several physical dynamic processes on it.

Combinatoric measures of entropy capture the complexity of a graph, but rely upon the calculation of its independent sets, or collections of non-adjacent vertices. This decomposition of the vertex set is a known NP-Complete problem and for most real world graphs is an inaccessible calculation. Recent work by Dehmer et al. and Tee et al. identified a number of alternative vertex level measures of entropy that do not suffer from this pathological computational complexity. It can be demonstrated that they are still effective at quantifying graph complexity. It is intriguing to consider whether there is a fundamental link between local and global entropy measures. In this paper, we investigate the existence of correlation between vertex level and global measures of entropy, for a narrow subset of random graphs. We use the greedy algorithm approximation for calculating the chromatic information and therefore Körner entropy. We are able to demonstrate close correlation for this subset of graphs and outline how this may arise theoretically.

Topological indices have been used to modeling biological and chemical properties of molecules in quantitive structure property relationship studies and quantitive structure activity studies. All the degree based topological indices have been defined via classical degree concept. In this paper we define a novel degree concept for a vertex of a simple connected graph: S degree. And also we define S indices of a simple connected graph by using the S degree concept. We compute the S indices for well-known simple connected graphs such as paths, stars, complete graphs and cycles.

In large-scale parallel computing and communication systems, an interconnect network structure is usually modeled as a graph, in which vertices and edges correspond to processors and communication links, respectively. In a graph, the vertices and edges are likely to fail, so we must think about the fault tolerance of a graph. Connectivity is an important parameter in the study of faulty tolerance for a graph. In this paper, we study a special class of connectivity: $m$-component connectivity, this is a natural generalization of the classical connectivity of graphs defined in terms of the minimum vertex-cut. Let $F$ is a vertex set of $G$ $(i.e, F\subseteq V(G))$, if the following conditions are satisfied, we say $F$ is a $m$-component cut: $(1)$ $G-F$ is disconnected; $(2)$ the number of components in $G-F$ is greater than or equal to $m$. In another word, the $m$-component connectivity $c\kappa_{m}(G)$ is defined as $min\{|F|~|~F\subseteq V(G)$ and $F$ is a $m$-component cut$\}$. Determining $m$-component connectivity is still unsolved in most interconnection networks even for small $m'$s. Leaf-sort graph is a special Cayley graph, it has many special properties that are different from other Cayley graphs. So we need to pay attention to some of it's special properties when we study it. In this paper, we can get the values: $c\kappa_{3}(CF_{n})=3n-6$ $(n$ is odd$)$ and $c\kappa_{3}(CF_{n})=3n-7$ $(n$ is even$)$ for $n\geq3$; $c\kappa_{4}(CF_{n})=\frac{9n-21}{2}$ $(n$ is odd$)$ and $c\kappa_{4}(CF_{n})=\frac{9n-24}{2}$ $(n$ is even$)$ for $n\geq4$; $c\kappa_{5}(CF_{n})=6n-16$ $(n$ is odd$)$ and $c\kappa_{5}(CF_{n})=6n-18$ $(n$ is even$)$ for $n\geq5$.

During the creation and integration of a health care system based on medical knowledge graphs, it is necessary to review and select the vocabularies and definitions that best fit the information requirements of the system being developed. This implies the reuse of medical knowledge graphs; however, full importation of knowledge graphs is not a tractable solution in terms of memory requirements. In this paper we present a modularization-based method for knowledge graph reuse. A case study of graph reuse is presented by transforming the original model into a lighter one.

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

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

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

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

For the first time, We do fuzzification the concept of domination in crisp graph on a generalization of fuzzy graph by using membership values of vertices, α-strong edges and edges. In this paper, we introduce the first variation on the domination theme which we call vertex domination. We determine the vertex domination number γ_v for several classes of t-norm fuzzy graphs which include complete t-norm fuzzy graph, complete bipartite t-norm fuzzy graph, star t-norm fuzzy graph and empty t-norm fuzzy graph. The relationship between effective edges and α-strong edges is obtained. Finally, we discuss about vertex dominating set of a fuzzy tree with respect to a t-norm ⨂ by using the bridges and α-strong edges equivalence.

Background: Emergency medical services (EMS) are the first health care contact for the majority of stroke patients. However, there is a lack of data on the current paramedics’ hospital-directed feedback and training needs across different health care settings. We aimed to evaluate paramedics’ prehospital stroke care knowledge, training needs, and current status of feedback on suspected stroke patients. Methods: We surveyed paramedics from the Vilnius region from September to November 2019, and compared the answers between the city and the district agencies. The questionnaire content included questions on paramedics’ demographic characteristics, prehospital stroke care self-assessment, knowledge on stroke mimics, stroke training needs, and the importance of hospital-directed feedback on suspected stroke patients. Results: A total number of 161 paramedics were surveyed, with more district paramedics rating their prehospital stroke care knowledge as inadequate (44.8% (95% confidence interval (CI) 32.8–57.6) vs 28.1% (95% CI 20.1–27.8), p = 0.028). In addition, more district paramedics indicated a need for additional stroke training (83.1% (95% CI 71.5–90.5) vs 69.8% (60.0–78.1), p = 0.043). However, respondents reported being the most confident while dealing with stroke (71.3%, 95% CI 63.8–77.7) compared to other time-critical conditions (p < 0.001). Vertigo (60.8%, 95% CI 53.0–68.0), brain tumours (56.3%, 95% CI 48.5–63.8), and seizures (54.4%, 95% CI 46.7–62.0) were indicated as the most common stroke mimics. Only 6.2% (95% CI 3.4–11.1) of respondents received formal feedback on the outcome of suspected stroke patients brought to the emergency department. Conclusion: A high proportion of paramedics self-perceive having inadequate stroke knowledge and an urgent need for further stroke training. The EMS staff indicate receiving an insufficient amount of feedback on suspected stroke patients, even though the usefulness is perceived to be paramount.

We use binary string to represent a natural number and show the composite procedure of odd-number and even-number functions, thus we propose full binary directed tree to represent the set of natural numbers and give another partition the natural number set to three sets: pure odd, pure even and mixed number. For the Collatz conjecture we make use of the parity of a natural number to analyse the sequence of iteration (or composite) of Collatz function and reduced Collatz function analog to the inverse function. We give tabular and binary strings to the algebra expression to state the sequence of Collatz, this is the key topic to proof the conjecture: the discrete powers of 2 can be changed to ultimately continuous powers of 2, finally get to pure even number and to the smallest number 1. The sequence created by the infinite iterations of the Collatz function becomes the ultimately periodic sequence if any natural number is the beginning value, proving the conjecture that has been held for 87 years.

The Harmonic Graphs Conjecture states that there exists an asymptotic relation involving the Harmonic Index and the natural logarithm as the order of the graph increases. This conjecture, grounded in the novel context of Prime Graphs, draws upon the Prime Number Theorem and the sum of divisors function to unveil a compelling asymptotic connection. By carefully expanding the definitions of the harmonic index and the sum of divisors function, and leveraging the prime number theorem's approximations, we establish a formula that captures this intricate relationship. This work is an effort to contribute to the advancement of graph theory, introducing a fresh lens through which graph connectivity can be explored. The synthesis of prime numbers and graph properties not only deepens our understanding of structural complexity but also paves the way for innovative research directions.

In this paper, we give some upper and lower bounds for the multiplicative Randic index, reduced reciprocal Randic index, Narumi-Katayama index and symmetric division index a graph using solely the vertex degrees. Then we obtain upper and lower bounds for these indices for the complete graphs, path graphs and Fibonacci-sum graphs. Finally, we compared the bounds of these indices for a general graph and some special graphs.

Chellali et al. introduced two degree concepts, ve-degree and ev-degree (Chellali et al, 2017). The ve-degree of a vertex equals to number of different edges which are incident to a vertex from the closed neighborhod of v. Moreover the ev-degree of an edge e=ab equals to the number of vertices of the union of the closed neighborhoods of a and b. The most private feature of these degree concepts is, total number of ve-degrees and total number of ev-degrees equal to first Zagreb index of the graphs for triangle-free graphs. In this paper we introduce ve-degree entropy, ev-degree entropy and investigate the relations between these entropies and the first Zagreb index entropy. Finally we obtain the maximal trees with respect to ve-degree irregularity index.

In different fields in our life, like physics, coding theory and computer science, graph labeling dramas an vital role and appears in many applications. A labeling of a graph is a map which assign each element in with a positive integer number. An edge irregular total -labeling is a function such that where and are weights for any two distinct edges. In this case, has total edge irregularity strength (TEIS) if is minimum. In our paper, we defined a new type of graphs called a triple star snake graph and star snake graph . Also, we investigated TEIS for a triple star snake graph . After that, we generalized the results for star snake graph .

Tracking information diffusion is a non-trivial task and it has been widely studied across different domains and platforms. The advent of social media has led to even more challenges, given the higher speed of information propagation and the growing impact of social bots and anomalous accounts. Nevertheless, it is crucial to derive a trustworthy information diffusion graph, which is capable of highlighting the importance of specific nodes in spreading the original message. The paper introduces the interaction strength, a novel metric to model retweet cascade graphs by exploring users’ interactions. Initial findings show the soundness of the approaches based on this new metric with respect to the state-of-the-art model, and its ability to generate a denser graph, revealing crucial nodes that participated in the retweet propagation. Reliable retweet graph generation will enable a better understanding of the diffusion path of a specific tweet.

A growing number of studies focus on methods to estimate and analyze the functional connectome of the human brain. Graph theoretical measures are commonly employed to interpret and synthesize complex network-related information. While resting state functional MRI (rsfMRI) is often employed in this context, is known to exhibit poor reproducibility, a key factor which is commonly neglected in typical cohort studies using connectomics-related measures as biomarkers. We aimed to fill this gap by analyzing and comparing inter- and intra- subject variability of connectivity matrices as well as graph-theoretical measures in a large (n=1003) database of young healthy subjects which underwent four consecutive rsfMRI sessions. We analyzed both directed (Granger Causality and Transfer Entropy) and undirected (Pearson Correlation and Partial Correlation) time-series association measures and related global and local graph-theoretical measures. While matrix weights exhibit a higher reproducibility in undirected as opposed to directed methods, this difference disappears when looking at global graph metrics and, in turn, exhibits strong regional dependence in local graphs metrics. Our results warrant caution in the interpretation of connectivity studies, and serve as a benchmark for future investigations by providing quantitative estimates for the inter- and intra- subject variabilities in both directed and undirected connectomic measures.

The research proposes a self-directed paradigm with self-design using the existing technology with LMS modules, discussions, and self-tests. The research establishes its criteria for assurance of teaching and learning known as 7x2C for the compliance of content, and appearance along with other criteria for the analysis. The above technology of web and LMS is tested for a business course that is technology-oriented in creating an experiential learning system for Covid-19 awareness. Similarly, among other ideas, an environment for educating learners about diabetes and obesity has been designed. The project is known as Sunchoke with its theme of Grow, Eat, and Heal. The educators can use their technology and apply self-directed pedagogy to transform this approach to their customized ways by using their content and rubrics.

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

In this work, oligoesters with terminal hydroxyl groups were obtained by directed glycolytic degradation of polyethylene terephthalate. The possibility of obtaining bifunctional reactive oligomers with an average molecular weight of 865 g mol-1 by directed glycolytic destruction via a dissolution-degradation strategy in dimethyl sulfoxide at a low concentration of ethylene glycol (32.3 mass parts per 100 mass parts of polyethylene terephthalate) was shown. This process allows us to partially solve the urgent problem of recycling post-consumer polyethylene terephthalate.

Zika virus (ZIKV), a mosquito-borne flavivirus, was an almost neglected pathogen until its introduction in the Americas in 2015, where it has been responsible for a threat to global health, causing a great social and sanitary alarm due to its increased virulence, rapid spread, and an association with severe neurological and ophthalmological complications. Currently, no specific antiviral therapy against ZIKV is available, and treatments are palliative and mainly directed to symptoms relief, such as fever and rash, by administering antipyretics, anti-histamines, and fluids for dehydration. Nevertheless, lately, a great effort has been made to search for antiviral candidates using different approaches and methodologies, ranging from repurposing of specific compounds with known antiviral activity to the screening of libraries and of natural compounds. The identified antiviral candidates include drugs targeting viral components (structural proteins and enzymes), as well as cellular ones. Here, we present an updated review of current knowledge about anti-ZIKV strategies, focusing on host-directed antivirals as a realistic alternative to combat ZIKV infection.

A total $m$-labelling $\alpha$ on graph $\Gamma$ is called an edge irregular total $m$-labelling if for any two different edges of $\Gamma$, their weights respect to $\alpha$ are distinct, where the weight of any edge is defined as the sum of its label and the labels of its end vertices. We determine the minimum $m$ such that $\Gamma$ can be labelled by an edge irregular total $m$-labelling whenever $\Gamma$ is an odd staircase graph or an even staircase graph.

A signed graph is an undirected graph such that all of its edges are labeled positive or negative. Let D be an embedding of a signed graph G in the Euclidean line. If in D for all of the vertices their positive neighbors are closer than the negative neighbors, then D is called a valid drawing of G. In this paper we show that signed trees, unicyclic graphs, and ladder graphs have a valid drawing in the Euclidean line.

The realization of the third-generation artificial intelligence (AI) requires the evolution from perceptual intelligence to cognitive intelligence, where knowledge graphs may not meet the practical needs anymore. Based on the dual channel theory, cognitive graphs are established and developed through coordinating the implicit extraction module and the explicit reasoning module as well as integrating knowledge graphs, cognitive reasoning and logical expressions, which have achieved successes in multi-hop question answering. It is desired for cognitive graphs to be widely used in advanced AI applications such as large-scale knowledge representations and intelligent responses, promoting the development of Al dramatically. This review discusses cognitive graphs systematically and elaborately, including basic concepts, generations, theories and technologies. Moreover, we try to predict the development of cognitive intelligence in the short-term future and further enlighten more researches and studies.

Since the discovery of the human epidermal growth factor receptor 2 (HER2) as an oncogenic driver in a subset of breast cancers and the development of HER2 directed therapies, the prognosis of HER2 amplified breast cancers has increased meaningfully. Next to monoclonal anti-HER2 antibodies and tyrosine kinase inhibitors, the antibody-drug conjugate T-DM1 is a pillar of targeted treatment of advanced HER2-positive breast cancers. Currently, several HER2 directed antibody-drug conjugates are under clinical investigation for HER2 amplified but also HER2 expressing but not amplified breast tumors. In this article, we review the current preclinical and clinical evidence of the investigational drugs A166, ALT-P7, ARX788, DHES0815A, DS-8201a, RC48, SYD985, MEDI4276 and XMT-1522.

The problem of quantifying the vulnerability of graphs has received much attention nowadays, especially in the field of computer or communication networks. In a communication network, the vulnerability measures the resistance of the network to disruption of operation after the failure of certain stations or communication links. If we think of a graph as modeling a network, the average lower 2-domination number of a graph is a measure of the graph vulnerability and it is defined by ${\gamma }_{2av}\left(G\right)=\frac{1}{\left|V\left(G\right)\right|}{\sum }_{v\in V\left(G\right)}{\gamma }_{2v}\left(G\right)$, where the lower 2-domination number, denoted by ${\gamma }_{2v}\left(G\right)$, of the graph G relative to v is the minimum cardinality of 2-domination set in G that contains the vertex v. In this paper, the average lower 2-domination number of wheels and some related networks namely gear graph, friendship graph, helm graph and sun flower graph are calculated. Then, we offer an algorithm for computing the 2-domination number and the average lower 2-domination number of any graph G.

Loss of function of the hippocampus or frontal cortex is associated with reduced performance on memory tasks in which subjects are incidentally exposed to cues at specific places in the environment and are subsequently asked to recollect the location at which the cue was experienced. Here, we examined the roles of the rodent hippocampus and frontal cortex in cue-directed attention during encoding of memory for the location of a single incidentally experienced cue. During a spatial sensory preconditioning task, rats explored an elevated platform while an auditory cue was incidentally presented at one corner. The opposite corner acted as an unpaired control location. The rats demonstrated recollection of location by avoiding the paired corner after the auditory cue was in turn paired with shock. Damage to either the dorsal hippocampus or the frontal cortex impaired this memory ability. However, we also found that hippocampal lesions enhanced attention directed towards the cue during the encoding phase while frontal cortical lesions reduced cue-directed attention. These results suggest that the deficit in spatial sensory preconditioning caused by frontal cortical damage may be mediated by inattention to the location of cues during the latent encoding phase, while deficits following hippocampal damage must be related to other mechanisms such as generation of neural plasticity.

We characterize the form of the order divisor graph of cyclic groups based on the group order. Furthermore, we describe some topological indices of the order divisor graph of cyclic groups, including the Wiener index, Harary index, first Zagreb index, and second Zagreb index.

It has recently been shown that, contrary to the wide belief that a shift-enabled condition (necessary for any shift-invariant filter to be representable by a graph shift matrix) can be ignored because any non-shift-enabled matrix can be converted to a shift-enabled matrix, such a conversion in general may not hold for a directed graph with non-symmetric shift matrix. This paper extends this prior work, focusing on undirected graphs where the shift matrix is generally symmetric. We show that while, in this case, the shift matrix can be converted to satisfy the original shift-enabled condition, the converted matrix is not associated with the original graph, that is, it does not capture anymore the structure of the graph signal. We show via a counterexample, that a non-shift-enabled matrix cannot be converted to a shift-enabled one and still maintain the topological structure of the underlying graph, which is necessary to facilitate localized signal processing.

This paper presents a new method : HIVEC to learn latent vector representations of graphs in a manner that captures the semantic dependencies of sub-structures. The representations can then be used in machine learning algorithms for tasks such as graph classification, clustering etcetera. The method proposed is unsupervised and uses the information of co-occurrence of sub-structures. It introduces a notion of hierarchical embeddings that allows us to avoid repetitive learning of sub-structures for every new graph. As an alternative to deep learning methods, the edit distance similarity between sub-structures is also used to learn vector representations. We compare the performance of these methods against previous work.

Directed evolution methods are becoming increasingly popular, as they are extremely powerful toward developing new biomolecules with altered/novel activities, e.g., proteins with new catalytic functions or substrate specificities, and nucleic acids that recognize an intended target. Especially useful are systems that have incorporated continuous evolution, where the protein to be evolved undergoes continuous mutagenesis to evolve a desired trait with little to no input from the researcher once the system is started. However, continuous evolution methods can be challenging to implement in the lab and daunting for researchers to invest time and resources. Our intent is to provide basic information and helpful suggestions that we have gained from our experience with bacterial phage-assisted continuous evolution (PACE). Specifically, we review factors to consider before adopting PACE for a given evolution scheme, different types of selection circuits that can be utilized with particular focus on the PACE-B1H selection system, what optimization of a PACE selection circuit may look like using directed evolution of ME47 as a case study, and additional techniques that may be incorporated into a PACE experiment. With this information, researchers will be better equipped to determine if PACE is a valid strategy to use to evolve their proteins and how to set up a valid selection circuit.

The accurate diagnosis and effective treatment of mental health disorders such as depression remain challenging owing to the complex underlying causes and varied symptomatology. Traditional information extraction methods struggle to adapt to evolving diagnostic criteria such as the Diagnostic and Statistical Manual of Mental Disorders fifth edition (DSM-5) and to contextualize rich patient data effectively. This study proposes a novel approach for enhancing information extraction from mental health data by integrating medical knowledge graphs and large language models (LLMs). Our method leverages the structured organization of knowledge graphs specifically designed for the rich domain of mental health combined with the powerful predictive capabilities and zero-shot learning abilities of LLMs. This research enhances the quality of knowledge graphs through entity linking and demonstrates superiority over traditional information extraction techniques, making a significant contribution to the field of mental health. It enables a more fine-grained analysis of the data and the development of new applications. Our approach redefines the manner in which mental health data are extracted and utilized. By integrating these insights with existing healthcare applications, the groundwork is laid for the development of real-time patient monitoring systems. The performance evaluation of this knowledge graph highlights its effectiveness and reliability, indicating significant advancements in automating medical data processing and depression management.

Conceptual distance refers to the degree of proximity between two concepts within a conceptualization. It is closely linked with semantic similarity and relationship, but its computation relies entirely on the context of the given concepts. The DIS-C algorithm, which requires using search algorithms such as Breadth First Search, represents an advance in computing the semantic similarity/relation regardless of the type of knowledge structure and semantic relationships. The shortest path algorithm facilitates the determination of the semantic closeness between two indirectly connected concepts in an ontology by propagating local distances. This process is implemented for each concept pair to establish the most effective and efficient paths to connect these concepts. The algorithm identifies the shortest path between the concepts, allowing for the inference of the most relevant relationships between them. This approach contributes to developing a comprehensive understanding of the ontology and enhances the accuracy and precision of the semantic representation of the concepts. However, one of the critical issues is associated with the computational complexity due to the nature of the algorithm, which is errorn3. This paper studies alternatives to accelerate the DIS-C based on approximation and optimized algorithms, focusing on Dijkstra, pruned Dijkstra, and Sketched-based algorithms to compute conceptual distance. Based on the experiments, we discovered that the bottleneck can be avoided using the proposed 2-hop coverages, bringing DIS-C almost linearity.

Wireless sensor networks (WSNs) are a critical research area with numerous practical applications. WSNs are utilized in real-life scenarios, including environmental monitoring, healthcare, industrial automation, smart homes, and agriculture. As WSNs advance and become more sophisticated, they offer limitless opportunities for innovative solutions in various fields. However, due to their unattended nature, it is essential to develop strategies to improve their performance without draining the battery power of the sensor nodes, which is their most valuable resource. This paper proposes a novel sink mobility model based on constructing a bipartite graph from a deployed wireless sensor network. Using the bipartite graph’s properties, the mobile sink node can visit stationary sensor nodes in an optimal way to collect data and transmit it to the base station. We evaluated the proposed approach through simulations using the NS-2 simulator to investigate the performance of wireless sensor networks when adopting this mobility model. Our results show that using the proposed approach can significantly enhance the performance of wireless sensor networks while conserving the energy of the sensor nodes.

Recent years have seen the growing adoption of non-relational data models for representing diverse, incomplete data. Among these, the RDF graph-based data model has seen ever-broadening adoption, particularly on the Web. This adoption has prompted the standardization of the SPARQL query language for RDF, as well as the development of a variety of local and distributed engines for processing queries over RDF graphs. These engines implement a diverse range of specialized techniques for storage, indexing, and query processing. A number of benchmarks, based on both synthetic and real-world data, have also emerged to allow for contrasting the performance of different query engines, often at large scale. This survey paper draws together these developments, providing a comprehensive review of the techniques, engines and benchmarks for querying RDF knowledge graphs.

Let G be a graph with n vertices and let 1; 2; : : : ; n be the eigenvalues of Randic matrix. The Randic Estrada index of G is REE(G) = Ón i=1 ei . In this paper, we establish lower and upper bounds for Randic index in terms of graph invariants such as the number of vertices and eigenvalues of graphs and improve some previously published lower bounds.

We compute explicitly traces of one-dimensional diffusion processes. The obtained trace forms can be regarded as Dirichlet forms on graphs. Then we discuss conditions ensuring the trace forms to be conservative. Finally, the obtained results are applied to the one-dimensional diffusion related to the Bessel’s process of order $\nu$.

In mathematics, one always aims to obtain new frameworks from specific ones. This also stratified to the regality of graphs, where one can produce numerous new graphs from a specific set of graphs. In this work we define some classes of pyramid graphs created by a gear graph and we derive straightforward formulas of the complexity of these graphs, using linear algebra matrix analysis techniques and employing knowledges of Chebyshev polynomials.

Topological indices are numerical parameters of a graph which characterize its topology and are usually graph invariant. In this paper, bounds for the Randić, general Randić, sum-connectivity, the general sum-connectivity and harmonic indices for tensor product of graphs are determined by using the combinatorial inequalities and combinatorial computing.

Deploying UAVs as aerial base stations is an exceptional approach to reinforce terrestrial infrastructure owing to their remarkable flexibility and superior agility. However, it is essential to design their flight trajectory effectively to make the most of UAV-assisted wireless communications. This paper presents a novel method for improving wireless connectivity between UAVs and terrestrial users through effective path planning. This is achieved by developing a goal-directed trajectory planning method using active inference. First, we create a global dictionary using TSPWP instances executed on various training examples. This dictionary contains letters representing available hotspots, tokens representing local paths, and words depicting complete trajectories and hotspot order. By using this world model, the UAV can understand the TSPWP’s decision-making grammar and how to use the available letters to form tokens and words at various levels of abstraction and time scales. With this knowledge, the UAV can assess encountered situations and deduce optimal routes based on the belief encoded in the world model. Our proposed method outperforms traditional Q-learning by providing fast, stable, and reliable solutions with good generalization ability.

Directed movement towards a target requires spatial working memory, including processing of sensory inputs and motivational drive. In a stimulus-driven, operant conditioning paradigm designed to train zebrafish, we present a pulse of light via LED’s and/or sounds via an underwater transducer. A webcam placed below a glass tank records fish swimming behavior. During operant conditioning, a fish must interrupt an infrared beam at one location to obtain a small food reward at the same or different location. A timing-gated interrupt activates robotic-arm and feeder stepper motors via custom software controlling a microprocessor (Arduino). “Ardulink”, a JAVA facility, implements Arduino-computer communication protocols. In this way, full automation of stimulus-conditioned directional swimming is achieved. Precise multi­day scheduling of training, including timing, location and intensity of stimulus parameters, and feeder control is accomplished via a user-friendly interface. Our training paradigm permits tracking of learning by monitoring, turning, location, response times and directional swimming of individual fish. This facilitates comparison of performance within and across a cohort of animals. We demonstrate the ability to train and test zebrafish using visual and auditory stimuli. Current methods used for associative conditioning often involve human intervention, which is labor intensive, stressful to animals, and introduces noise in the data. Our relatively simple yet flexible paradigm requires a simple apparatus and minimal human intervention. Our scheduling and control software and apparatus (NemoTrainer) can be used to screen neurologic drugs and test the effects of CRISPR­-based and optogenetic modification of neural circuits on sensation, locomotion, learning and memory.

The characteristic lesion of primary tuberculosis is the granuloma as is widely studied in human tissues and animal models. Post-primary tuberculosis is different. It develops only in human lungs and begins as a prolonged subclinical obstructive lobular pneumonia that slowly accumulates mycobacterial antigens and host lipids in alveolar macrophages with nearby highly sensitized T cells. After several months, the lesions undergo necrosis to produce a mass of caseous pneumonia large enough to fragment and be coughed out to produce a cavity or be retained as the focus of a post-primary granuloma. Here we extend these findings with the demonstration of mycobacterial antigen, but not AFB, of M. tuberculosis in the cytoplasm of ciliated bronchiolar epithelium and alveolar pneumocytes in association with elements of the programmed death ligand 1 (PD-L1), cyclo-oxygenase (COX)-2, and fatty acid synthase (FAS) pathways in the early lesion. This suggests that M. tuberculosis uses its secreted antigens to coordinate prolonged subclinical development of the early le-sions in preparation for a necrotizing reaction sufficient to produce a cavity, post-primary granulomas and fibrocaseous disease.

The characteristic lesion of primary tuberculosis is the granuloma as is widely studied in human tissues and animal models. Post-primary tuberculosis is different. It develops only in human lungs and begins as a prolonged subclinical obstructive lobular pneumonia that slowly accumulates mycobacterial antigens and host lipids in alveolar macrophages with nearby highly sensitized T cells. After several months, the lesions under necrosis to produce a mass of caseous pneumonia large enough to fragment and be coughed out to produce a cavity or be retained as the focus of a post-primary granuloma. Here we extend these findings with the demonstration of mycobacterial antigen, but not AFB, of M. tuberculosis in the cytoplasm of ciliated bronchiolar epithelium and alveolar pneumocytes in association with elements of the programmed death ligand 1 (PD-L1), cyclo-oxygenase (COX)-2, and fatty acid synthase (FAS) pathways in the early lesion. This suggests that M. tuberculosis use its secreted antigens to coordinate prolonged subclinical development of the early lesions in preparation for a necrotizing reaction sufficient to produce a cavity, post-primary granulomas and fibrocaseous disease

In the last decade several projects have been developed for the digitization and semantization of cultural heritage data. They were developed to preserve and maintain this heritage, but bringing it closer to all types of users and allowing access to this information to other sectors such as tourism, education, etc. In these developments, web technologies are combined, along with the use of knowledge graphs and interactive visualisation tools. Although remarkably interesting projects have been developed, in those projects, the data visualization tools are usually focused on the project context. This makes it difficult to reuse these jobs. Additionally, there are peculiarities of cultural heritage data considered with little depth, such as uncertainty, spatial and temporal granularity, as well as other aspects, such as relationships between data. In this article, these problems are described and based on other works such as VUMO or VISO, the design of an ontology that formalizes how to visualise this information is proposed, considering these problems. In addition, the development of a platform that allows the visualisation of this information through a web application and its evaluation of its use in projects such as SILKNOW, or Arxiu Valencià del Disseny is exposed

Novel therapies for treatment of familial dilated cardiomyopathy (DCM) are lacking. Triggers for the progression of the disorder commonly occur due to specific gene variants that affect the production of sarcomeric/cytoskeletal proteins. Generally these variants cause a decrease in tension by the myofilaments, resulting in signaling abnormalities within the micro-environment which over time result in structural and functional maladaptations leading to heart failure (HF). Current concepts support the hypothesis that the mutant sarcomere proteins induce a causal depression in the tension time integral (TTI) of linear preparations of cardiac muscle. However, molecular mechanisms underlying tension generation particularly in relation to mutant proteins and their impact on sarcomere molecular signaling, are currently the subject of controversy. Thus, there is a need for clarification as to how mutant proteins affect sarcomere molecular signaling in the etiology and progression of DCM. A main topic in this controversy is the control of the number of tension generating myosin heads reacting with the thin filament. One line of investigation proposes that this number is determined by changes in the ratio of myosin heads in a sequestered super-relaxed state (SRX) or in a disordered relaxed state (DRX) poised for force generation upon Ca-activation of the thin filament. Contrasting evidence from nanometer–micrometer-scale x-ray diffraction in intact trabeculae indicates that the SRX/DRX states may have a lesser role. Instead, the proposal is that myosin heads are in a basal OFF state in relaxation then transfer to an ON state through a mechano-sensing mechanism induced during early thin filament activation and increasing thick filament strain. Recent evidence about the modulation of these mechanisms by protein phosphorylation has also introduced a need for reconsidering control of tension. We discuss these mechanisms that lead to different ideas related to how tension is controlled and disturbed by mutant sarcomere proteins linked to DCM including cardiac myosin, myosin-binding protein C, titin filaments, and thin filaments. Resolving the various mechanisms and incorporating them into a unified concept is crucial for gaining a comprehensive understanding of DCM. This deeper understanding is not only important for diagnosis and treatment strategies with small molecules, but also for understanding the reciprocal signaling processes that occur between cardiac myocytes and their micro-environment. By unraveling these complexities, we can pave the way for improved therapeutic interventions for managing DCM.

The contemporary landscape of education is witnessing a paradigm shift towards innovative instructional methods, with the flipped learning approach gaining considerable attention. The purpose of this research was to investigate the impact of the flipped learning approach on students' perception and acceptance throughout an entire semester in the 'Introduction to Programming with Java' course, using a research design with a quantitative approach, ultimately aiming to inform educational practice and advance our knowledge of innovative teaching methods in higher education. This study was conducted at a university with 174 students involved, divided into two groups, 87 students in the experimental group and 87 students in the control group. The data collected through the scales were analyzed by using descriptive and inferential statistical analysis techniques in statistical software. At the end of the measurements, the technology acceptance level and self-directed learning perceptions of engineering students who received education with flipped learning were high. The results suggest that educators should consider students' readiness for self-directed learning when implementing the flipped learning approach and focus on creating an environment that supports their autonomy and engagement. This research offers valuable guidance for instructors, curriculum designers, and educational policymakers seeking to enhance the effectiveness of flipped learning in higher education courses.

Background: Role-playing is often used as a pedagogical method for learning communication in medical education. Therefore, medical play using the Teddy Bear Hospital (TBH) is a concept that can quickly familiarize children with health care and help them develop positive experiences in these areas. This review aims to assess the strengths of TBH, as a form of directed medical role play, in improving health outcomes and well-being in children, along with implanting an awareness of preventive health care in young children.Methods: For this scoping review, we examined the list of recommendations, including 11 studies from two databases, PubMed and Google Scholar. We incorporated pre/post quasi-experimental studies, ANOVA, qualitative research studies, systematic reviews, and control group studies that deliberately utilize the teddy bear hospital as an intervention.Results: The results of individual studies were further categorized into three sections. The first being upon the analysis of 11 studies, the Teddy Bear Hospital was mainly conducted in Europe and Asia. It is evident that regardless of the different approaches and strategies used to implement the Teddy Bear Hospital, they all ultimately share the same intent: to raise health care awareness and alleviate young children's anxiety over medical treatment while focusing on the promotion of positive healthy lifestyle. All studies portray the teddy bear hospital as an intervention of medical roleplay which analyzed the children's feelings, behaviors, and health awareness after visiting the Teddy Bear Hospital.Conclusion: The application of the teddy bear hospital has overwhelmingly positive results, with lower levels of anxiety and improved health knowledge. Its reported efficacy calls for future studies on aspects that lead to its efficacy and potential effectiveness.

The idea of strong and weak adjacencies between vertices has been generalized into fuzzy graphs and intuitionistic fuzzy graphs (IFGs) and it is an important part of making decisions. However, one or two membership degrees are not always sufficient for making decisions on real-world problems that need an answer of types “yes, neutral, and no". Consequently, in previous work, we generalized the concept into picture fuzzy graphs (PFGs) where each element in the PFG has membership, neutral, and non-membership degrees. Moreover, we constructed the notion of the coloring of PFGs based on strong and weak adjacencies between vertices. In this paper, we investigate some properties of the chromatic number of PFGs based on the concept of strong and weak adjacencies between vertices. According to the properties, we construct an algorithm to find the chromatic number of PFGs. The algorithm is usefull when we work with large PFGs. Further, we improve the method to implement the PFG’s coloring for determining traffic signal phasing at an intersection. A case study has also been done to evaluate the method.

A simple undirected graph $\Gamma=(V_\Gamma,E_\Gamma)$ admits an $H$-covering if every edge in $E_\Gamma$ belongs to at least one subgraph of $\Gamma$ that isomorphic to a graph $H$. For any graph $\Gamma$ admitting $H$-covering, a total Labelling $\beta: V_\Gamma \cup E_\Gamma \longrightarrow \{1,2,\dots,p\}$ is called an $H$-irregular total $p$-labelling of $\Gamma$ if every two different subgraphs $H_1$ and $H_2$ of $\Gamma$ isomorphic to $H$ have distinct weights where the weight $w_\beta(K)$ of subgraph $K$ of $\Gamma$ is defined as $w_f(K):=\displaystyle \sum_{v\in V_K} f(v) + \sum_{e\in E_K} f(e)$. The smallest number $p$ for which a graph $\Gamma$ admits an $H$-irregular total $p$-labelling is called the total $H$-irregularity strength of $\Gamma$ and is denoted by $ths(\Gamma)$. In this paper, we determine the total $H$-irregularity strength of edge comb product of two graphs.

We investigate new graph characteristics namely total (vertex, edge) face irregularity strength of gen- eralized plane grid graphs Gmn under k-labeling Phi of type (Alpha, Beta, Gamma). The minimum integer k for which a vertex-edge labelled graph has distinct face weights is called the total face irregularity strength of the graph and is denoted by tfs(Gmn). In this article, the graphs G = (V;E; F) under consideration are simple, fi nite, undirected and planar. We will estimate the exact tight lower bounds for the total face irregularity strength of some families of generalized plane grid graphs.

This paper presents a new framework to classify floor plan elements and represent them in a vector format. Unlike existing approaches using image-based learning frameworks as the first step to segment the image pixels, we first convert the input floor plan image into vector data and utilize graph neural network. Our framework consists of three steps. (1) image pre-processing and vectorization of the floor plan image. (2) region adjacency graph conversion. (3) graph neural network on converted floor plan graphs. Our approach is able to capture different types of indoor elements including basic elements such as walls, doors, and symbols as well as spatial elements such as rooms and corridors. In addition, the proposed method can also detect element shapes. Experimental results show that our framework can classify indoor elements with an F1 score of 95%, with scale and rotation invariance. Furthermore, we propose a new graph neural network model that takes the distance between nodes into account, which is a valuable feature of spatial network data.

A double Roman dominating function on a graph G is a function f : V(G) → {0, 1, 2, 3} 2 with the condition that every vertex u for which f(u) = 0 is adjacent to at least one vertex v for 3 which f(v) = 3 or two vertices v1 and v2 for which f(v1) = f(v2) = 2, and every vertex u for which 4 f(u) = 1 is adjacent to at least one vertex v for which f(v) ≥ 2. The weight of a double Roman dominating function f is the value w(f) = ∑u∈V(G) 5 f(u). The minimum weight over all double 6 Roman dominating functions on a graph G is called the double Roman domination number γdR(G) 7 of G. In this paper we determine the exact value of the double Roman domination number of the 8 generalized Petersen graphs P(n, 2) by using a discharging approach.

Laser-Powder Directed Energy Deposition (DED-LB/Powder) is an additive manufacturing process that is gaining popularity in the manufacturing industry due to its numerous advantages, particularly in repairing operations. However, its application is often limited to case studies due to some critical issues that need to be addressed, such as the degree of internal porosity. This paper investigates the effect of the most relevant process parameters of the DED-LB/Powder process on the level and distribution of porosity. Results indicate that, among the process parameters examined, porosity is less affected by travel speed and more influenced by powder mass flow rate and laser power. Additionally, a three-dimensional finite element transient model was introduced, which was able to predict the development and location of lack-of-fusion pores along the building direction.

A sedentary lifestyle associated with unregulated diets rich in high-calorie foods have contributed to the great prevalence of metabolic dysfunction-associated steatotic liver disease (MASLD) latterly, with up to 60% in high-risk population and 25% in the general population. The absence of specific pharmacological strategies for this syndrome represents one of the major problems in the management of MASLD patients. Lifestyle interventions and adherence to a healthy diet are the main cornerstones of current therapies. The identification of nutraceuticals useful in the treatment of MASLD appears to be one of the most promising strategies for the development of new effective and safe treatments for this disease. The onion, one of the most widely studied foods in the field of nutraceuticals, serves as an inexhaustible reservoir of potent compounds with various beneficial effects. The following preliminary study analyses, mediating in silico studies, the iteration of a library of typical onion compounds with 3-hydroxy-3-methylglutaryl-coenzyme A reductase, Liver receptors X α and β as well as Peroxisome proliferator-activated receptors α and γ. In this study fort the first time promising smart molecules from the onion that could have a beneficial action in MASLD patients were identified.

Having garnered significant attention in the scientific community over the past decade, Wire Arc Directed Energy Deposition (arc-DED) technology is at the heart of this investigation into additive manufacturing parameters. Singularly focused on invar as the selected material, the primary objective revolves around devising an indirect cord height measurement approach. This innovative methodology involves the seamless integration of internal signals and sensors, enabling the derivation of crucial measurements sans the requirement for direct physical interaction or conventional measurement methodologies. Through the course of this research, meticulous alteration of deposition parameters is undertaken to thoroughly scrutinize their influence on the ultimate cord dimensions. The fusion of cutting-edge manufacturing techniques with advanced sensor technology constitutes the essence of this endeavor, offering substantial potential to augment precision and efficiency in additive manufacturing processes. Remarkably cost-effective, this solution circumvents the need for intricate measurements and significantly contributes to the proper layer-by-layer growth process.

Laser Powder Directed Energy Deposition (LP-DED) is an Additive Manufacturing process in which a laser beam is used to generate a melt pool onto a substrate. The additional material, in form of powder material, is fed into the generated melt pool and a raised track is obtained. The LP-DED process is very powerful for different applications such as the repair operations and the production of functionally graded material, however the application is still limited and one of the main reasons is related to the lack of knowledge in the physics of the process mechanisms. The process is influenced by a huge number of parameters and three main mechanisms can be identi-fied. These mechanisms are the powder flow, the generation of the molten pool and the solidifica-tion process and for each of these mechanisms the process parameters have a different relevance. In this paper, a review of the main mechanisms and the relationship between the process parame-ters and the outcome of each step of the process is presented.

The rational fabrication of low-dimensional materials with a well-defined topology and functions is an incredibly important aspect of nanotechnology. In particular, the on-surface synthesis (OSS) methods based on the bottom-up approach enable facile construction of sophisticated molecular architectures unattainable by traditional methods of wet chemistry. Among such supramolecular constructs especially interesting are surface-supported metal-organic networks (SMONs), composed of low-coordinated metal atoms and π-aromatic bridging linkers differing in size, shape and functionalization scheme. In this work, the lattice Monte Carlo (MC) simulation technique was used to extract the chemical information encoded in a family of Y-shaped positional isomers coadsorbed with trivalent metal atoms on a flat metallic surface with (111) geometry. For this purpose the investigated tritopic molecules/metal atoms were carefully mapped on a triangular lattice as interconnected/isolated segments with appropriatelly embedded anisotropic interactions. Depending on the intramolecular distribution of active centers (functional groups) within the simulated molecular bricks, we observed the metal-directed self-assembly of two-dimensional (2D) openwork patterns, aperiodic mosaics and metal-organic ladders. The obtained theoretical findings could be especially relevant for the scanning tunneling microscopy (STM) experimentalists interested in a surface-assisted construction of complex nanomaterials stabilized by directional coordination bonds.

Accumulating evidences demonstrate that the host genome's epigenetic modificationsare essential for living organisms to adapt extreme conditions.DNA methylation, covalent modifications of histone, andinter-association of non-coding RNAs facilitate the cellular manifestation ofepigenetic changes in the genome. Out of various factors involved in the epigenetic programming of the host, miRNA (microRNA) and LncRNA (Long non-coding RNA) are new generationnon-coding molecules that influence a variety of cellular processes like immunity, cellular differentiation, and tumor development. During tumor development, temporal changes in miRNA/LncRNA rheostat influence sterile inflammatory responses accompanied by the changes in the carcinogenic signalling in the host. At the cellular level, this is manifested by the up-regulation of Inflammasome and inflammatory pathways, which promotes cancer-related inflammation. In view of this, we discuss the potential of lncRNA and miRNA directed interventions in regulating inflammation and tumor development in the host.

Directed Energy Deposition (DED) is a process that enables high-speed deposition with a sub-millimeter thickness using laser technology. Thus far, defect studies on additive manufacturing, including DED, have focused mostly on preventing pores and crack defects that reduce fatigue strength. On the other hand, evaporation products, fumes and spatters, generated by the high energy have often been neglected despite being some of the main causes of porosity and defects. In high-quality metal deposition, the problems caused by evaporation products are difficult to solve, but they have not yet caught the attention of metallurgists and physicists. This review examines the effect of the laser, material, and process parameters on the evaporation products to help obtain a high-quality metal film layer in thin-DED.

Recent results have shown that the human malaria-resistant hemoglobin S mutation originates de novo more frequently in the gene and in the population where it is of adaptive significance, namely, in the hemoglobin subunit beta gene compared to the non-resistant but otherwise identical 20A>T mutation in the hemoglobin subunit delta gene, and in sub-Saharan Africans, who have been subject to intense malarial pressure for many generations, compared to Northern Europeans, who have not. This finding raises a fundamental challenge to the traditional notion of accidental mutation. Here we address this finding with the replacement hypothesis, according to which pre-existing genetic interactions can lead directly and mechanistically to mutations that simplify and replace them. Thus, a gradual evolutionary process under selection can hone in on interactions of importance for the currently evolving adaptations, from which large-effect mutations follow that are relevant to these adaptations. We exemplify this hypothesis using multiple types of mutation, including gene fusion mutations, gene duplication mutations, A>G mutations in RNA-edited sites and transcription-associated mutations, and place it in the broader context of a system-level view of mutation origination called Interaction-based Evolution. Potential consequences include that similarity of mutation pressures may contribute to parallel evolution in genetically related species, that the evolution of genome organization may be driven by mutational mechanisms, that transposable element movements may also be explained by replacement, and that long-term directional mutational responses to specific environmental pressures are possible. Such responses need to be further tested by future studies in natural and artificial settings.

In a previous paper we defined the Black-and-White SAT problem which has exactly two solutions, where each variable is either true or false. We showed that Black-and-White $2$-SAT problems represent strongly connected directed graphs. We presented also the strong model of communication graphs. In this work we introduce two new models, the weak model, and the Balatonbogl\'{a}r model of communication graphs. A communication graph is a directed graph, where no self loops are allowed. In this work we show that the weak model of a strongly connected communication graph is a Black-and-White SAT problem. We prove a powerful theorem, the so called Transitions Theorem. This theorem states that for any model which is between the strong and the weak model, we have that this model represents strongly connected communication graphs as Blask-and-White SAT problems. We show that the Balatonbogl\'{a}r model is between the strong and the weak model, and it generates $3$-SAT problems, so the Balatonbogl\'{a}r model represents strongly connected communication graphs as Black-and-White $3$-SAT problems. Our motivation to study these models is the following: The strong model generates a $2$-SAT problem from the input directed graph, so it does not give us a deep insight how to convert a general SAT problem into a directed graph. The weak model generates huge models, because it represents all cycles, even non-simple cycles, of the input directed graph. We need something between them to gain more experience. From the Balatonbogl\'{a}r model we learned that it is enough to have a subset of a clause, which represents a cycle in the weak model, to make the Balatonbogl\'{a}r model more compact. We still do not know how to represent a SAT problem as a directed graph, but this work gives a strong link between two prominent fields of formal methods: SAT problem and directed graphs.

Intercellular transport of auxin is driven by PIN-formed (PIN) proteins. PINs are localized at the plasma membrane (PM) and on constitutively recycling endomembrane vesicles. Therefore, PINs can mediate auxin transport either by direct translocation across the PM or by pumping it into secretory vesicles (SVs), leading to its secretory release upon fusion with the PM. Which of these two mechanisms dominates is a matter of debate. Here we addressed the issue with a mathematical modeling approach. We demonstrate that the efficiency of secretory transport depends on SV size, half-life of PINs on the PM, pH, exocytosis frequency and PIN density. 3D-SIM microscopy was used to determine PIN density on the PM. Combing this data with published values of the other parameters, we show that the transport activity of PINs in SVs would have to be at least 1000x greater than on the PM in order to produce a comparable macroscopic auxin transport. If both transport mechanisms operated simultaneously and PINs were equally active on SVs and PM, the contribution of secretion to the total auxin flux would be negligible. In conclusion, while secretory vesicle-mediated transport of auxin is intriguing and theoretically possible model, it unlikely to be a major mechanism of auxin transport in planta.

In this paper, we propose a method for assessing the effectiveness of entropy features using several chaotic mappings. We anlyze fuzzy entropy (FuzzyEn) and neural network entropy (NNetEn) on four discrete mappings: the logistic map, the sine map, the Planck map, and the two-memristor-based map, with a base length time series of 300 elements. FuzzyEn is shown to have improved global efficiency (GEFMCC) in the classification task compared to NNetEn. At the same time, there are local areas of the time series dynamics in which the classification efficiency NNetEn is higher than FuzzyEn. The results of using horizontal visibility graphs (HVG) instead of the raw time series are also shown. GEFMCC decreases after HVG time series transformation, but there are local areas of the time series dynamics in which the classification efficiency increases after including the HVG. The scientific community can use the results to explore the efficiency of entropy-based classification of time series.

The minimum vertex cover (MVC) problem is a canonical NP-hard combinatorial optimization problem, aiming to find a smallest set of vertices such that every edge has at least one endpoint in the set, which has extensive applications in cyber security, scheduling, and monitoring link failures in wireless sensor networks (WSNs). Numerous local search algorithms have been proposed to obtain a “good” vertex cover. However, due to the NP-hard nature, it is challenging to efficiently solve the MVC problem, especially on large graphs. In this paper, we propose an efficient local search algorithm for MVC called TIVC, which is based on two main ideas: A 3-improvements (TI) framework with tiny perturbation, and an edge selection strategy. We conducted experiments on real-world large instances of a massive graph benchmark. Compared with two state-of-the-art MVC algorithms, TIVC shows superior performance in accuracy and possesses a remarkable ability to identify significantly smaller vertex covers on many graphs.

The independent set, IS, on a graph $G=(V,E)$ is $V^{*}\subseteq V$ such that no two vertices in $V^{*}$ have an edge between them. The MIS problem on G seeks to identify an IS with maximum cardinality, i.e. MIS. $V^{*}\subseteq V$ is a vertex cover, i.e. VC of $G=(V,E)$ if every $e\in E$ is incident upon at least one vertex in $V^{*}$ . $V^{*}\subseteq V$ is dominating set, DS, of $G=(V,E)$ if $\forall v\in V$ either $v\in V^{*}$ or $\exists u\in V^{*}$ and $(u,v)\in E$ . The MVC problem on G seeks to identify a vertex cover with minimum cardinality, i.e. MVC. Likewise, MCV seeks a connected vertex cover, i.e. VC which forms one component in G, with minimum cardinality, i.e. MCV. A connected DS, CDS, is a DS that forms a connected component in G. The problems MDS and MCD seek to identify a DS and a connected DS i.e. CDS respectively with minimum cardinalities. MIS, MVC, MDS, MCV and MCD on a general graph are known to be NP-complete. Polynomial time algorithms are known for bipartite graphs, chordal graphs, cycle graphs, comparability graphs, claw-free graphs, interval graphs and circular arc graphs for some of these problems. We introduce a novel graph class, layered graph, where each layer refers to a subgraph containing at most some k vertices. Inter layer edges are restricted to the vertices in adjacent layers. We show that if $k=\Theta (log\mid V\mid )$ then MIS, MVC and MDS can be computed in polynomial time and if $k=O\left({(log\mid V\mid )}^{\alpha }\right)$ , where $\alpha <1$ , then MCV and MCD can be computed in polynomial time. If $k=\Theta \left({(log\mid V\mid )}^{1+ϵ}\right)$ , for $ϵ>0$ , then MIS, MVC and MDS require quasi-polynomial time. If $k=\Theta (log\mid V\mid )$ then MCV, MCD require quasi-polynomial time. Layered graphs do have constraints such as bipartiteness, planarity and acyclicity.

Cas endonuclease-mediated genome editing provides a long-awaited molecular biological approach to the modification of predefined genomic target sequences in living organisms. Although cas9/guide (g)RNA constructs are straightforward to assemble and can be customized to target virtually any site in the plant genome, the implementation of this technology can be cumbersome, especially in species like Triticale that are difficult to transform, for which only limited genome information is available and/or which carry comparatively large genomes. To cope with these challenges, we have pre-validated cas9/gRNA constructs (1) by frameshift restitution of a reporter gene co-introduced by ballistic DNA transfer to barley epidermis cells, and (2) via transfection in Triticale protoplasts followed by either a T7E1-based cleavage assay or by deep-sequencing of target-specific PCR amplicons. For exemplification, we addressed the Triticale ABA 8’-hydroxylase 1 gene, one of the putative determinants of pre-harvest sprouting of grains. We further show that in-del induction frequency in Triticale can be increased by TREX2 nuclease activity, which holds true for both well- and poorly performing gRNAs. The presented results constitute a sound basis for the targeted induction of heritable modifications in Triticale genes.