Determining the estrous cycle stages in mice is essential for optimizing breeding strategies, synchronizing experimental time lines, and facilitating studies in behavior, drug testing, and genetics. It is critical for reducing the production of genetically unmodified offspring in the generation and investigation of genetically modified animal models. An accurate detection of the estrus cycle is particularly relevant in the context of the 3Rs—Replacement, Reduction and Refinement. The estrous cycle, encompassing the reproductive phases of mice, is key to refining experimental designs and addressing ethical issues related to the use of animals in research. This study presents results from two independent laboratories on the efficacy of the Mouse Estrus Detector (MED) from Elmi Ltd. (Latvia) for the accurate determination of the estrus phase. The female mice of five strains/stocks (CD1, FVB/N, C57Bl6/J, B6D2F1, and Swiss) were used. The results showed that the MEDProTM is a low -traumatic, simple, rapid and painless method of estrus detection that supports the principles of the 3Rs. The use of the MEDProTM for estrus detection in mice caused minimal stress, enhanced mating efficiency, facilitated an increase in the number of embryos for the in vitro fertilization and allowed the production of the desired number of foster animals.

This paper aims to investigate appropriate mathematical models devoted to optimization of some cleaning processes related to pharmaceutical contaminants removal. In our previous recent works has been reported that a possibility for removal from water sources of this type of micropollutants is to rehabilitate the existing cleaning plants by introducing efficient techniques such as adsorption on granulated active carbon filters, micro-, nano- or ultrafiltration. To have such processes under a better control and to pass from small to large scale treatment stations, specific mathematical models are necessary. Starting from Navier-Stokes equations and imposing proper boundary conditions, some mathematical physics problems are obtained for which adequate solving methods via variational methods and surjectivity results are proposed. The importance of these solution characterizations consists in their continuation in a numerical method and the possibility to visualize the result by using CFD program.

In the design of real-world networks, researchers evaluate various structural parameters to assess vulnerability, including connectivity, toughness, and tenacity. Recently, the tightness metric has emerged as a potentially superior vulnerability measure, although many related theorems remain unknown due to its novelty. Harary graphs, known for their maximum connectivity, are an important class of graph models for network design. Prior work has evaluated the vulnerability of three types of Harary graphs using different parameters, but the tightness metric has not been thoroughly explored. This article aims to calculate the tightness values for all three types of Harary graphs. First, it will attempt to calculate the lower bound for the value of the tightness parameter in Harary graphs using existing lemmas and theorems. Then, by presenting new lemmas and theorems, we will try to find the exact value or upper bound for this parameter in Harary graphs. For the first type of Harary graph, the tightness is precisely determined, while for the second and third types, upper bounds are provided due to structural complexity. The lemmas, theorems, and proof methods presented in this research may be used to calculate other graph and network parameters. However, the newness of the tightness parameter means that further research is needed to fully characterize its properties.

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.

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.

A mathematical procedure enabling the transformation of an arbitrary tessellation of a surface into a bi-colored complete graph is introduced. Polygons constituting the tessellation are represented by vertices of the graphs. Vertices of the graphs are connected by two kinds of links/edges, namely, by a green link, when polygons have the same number of sides, and by a red link, when the polygons have a different number of sides. This procedure gives rise to a semi-transitive, complete, bi-colored Ramsey graph. The Ramsey number was established as R_trans (3,3)=5. Shannon entropies of the tessellation and graphs are introduced. Ramsey graphs emerging from random Voronoi and Poisson Line tessellations were investigated. The limits ζ=lim┬(N→∞)⁡〖N_g/N_r 〗, where N is the total number of green and red seeds, N_g and N_r, were found ζ=0.272±0.001 (Voronoi) and ζ= 0.47±0.02 (Poisson Line). The Shannon Entropy for the random Voronoi tessellation was calculated as S= 1.690±0.001 and for the Poisson line tessellation as S =1.265±0.015.

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.

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

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

The age-related loss of muscle mass and strength is referred to as “sarcopenia”. The combined effect of sarcopenia and osteoporosis is a devastating threat to the old adult, accounting for reduced mobility, risk for falls and subsequent fractures. In previous studies, we observed a high degree of inter-individual variability of paraspinal muscle fatty infiltration, one most relevant index of muscle wasting. This aspect solicited us to develop a computerized method to quantitatively characterize muscle fatty infiltration in aging and diseases. Magnetic resonance images of paraspinal muscles from 58 women of different age (age range 23-85 years) and physio-pathological status (healthy young, pre-menopause, post-menopause, and os-teoporosis), were used to set up the method. It is based on fractal analysis of lean muscle area (contractile muscle) to estimate muscle fatty infiltration. In particular, lacunarity was computed by parameter β from our hyperbola model function, used to fit the GBA (gliding box algorithm) curvilinear plot. Succolarity was estimated by parameter µ, for the four main directions, through an algorithm implemented on purpose. Results show that fractal lacunarity, by quantifying muscle fatty infiltration, can discriminate be-tween osteoporosis and healthy aging while succolarity can separate the other three groups showing similar lacunarity. Therefore, fractal features of contractile muscle, by measuring fatty infiltration, can represent good indices of sarcopenia in aging and disease.

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.

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.

The development of plant-based meat analogues has become a significant challenge for the food industry in recent years due to the increasing demand for sustainable and healthier proteins in the context of a global protein transition. Plant-based meat analogues imitate the visual, textural, and chemical properties of traditional meat products and are required to closely resemble meat to appeal to consumers. In addition, consumers demand natural, clean-label, and nutritional and healthy products. To address these challenges, the food industry must develop highly healthy, nutritious, and E-number-free meat analogue products. Understanding the functionality of each ingredient and its role in the food matrix is crucial to being a key player in the innovation of the meat analogues market. This review provides updated information on the primary ingredients utilized for the development of plant-based burger meat alternatives and their functionality. The key components of meat analogue burgers are outlined, including plant proteins, binding agents, fats and oils, flavorings, colorings, preservatives, fortificants, and clean-label considerations.

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.

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.

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.

If we assume that: a. The four fundamental forces of nature are independent waves without rest masses, and their speeds are constant in a vacuum, just like light. b. Light or electromagnetic waves and gravity are comparable in structures. Weak and strong interactions are similar in structures. c. Light and weak interaction have the same speed c_L with spin number +1 or –1. d. Gravity and strong interaction have the same speed c_G without spin. e. The primary particles, namely electrons, electron neutrinos, and dark neutrinos in this paper, are made by the above four waves. We can find and describe some fundamental characteristics of the primary particles (e.g., their sizes, energies, and interactions) and introduce new attractive results from them (e.g., the source of the Pauli exclusion principle, the solution to the Einstein-Podolsky-Rosen paradox, and c_G slightly faster than c_L).

Ubiquitin-specific protease 2 (USP2) maintains mitochondrial integrity in culture myoblasts. In this study, we investigated molecular mechanisms underlying the protective role of USP2 on mitochondria. Knockout (KO) of the Usp2 gene or chemical inhibition of USP2 induced robust accumulation of mitochondrial reactive oxygen species (ROS), accompanied by defects in mitochondrial membrane potential, in C2C12 myoblasts. ROS removal by N-acetyl-L-cysteine restored the mitochondrial dysfunction induced by USP2 deficiency. Comprehensive RT-qPCR screening and following protein analysis indicated that both genetic and chemical inhibition of USP2 elicited a decrease of uncoupling protein 2 (UCP2) at mRNA and protein levels. Accordingly, the introduction of a Ucp2-expressing construct effectively recovered mitochondrial membrane potentials, entailing an increment of the intracellular ATP level in Usp2KO C2C12 cells. In contrast, USP2 deficiency also decreased peroxisome proliferator-activated receptor  coactivator 1 (PGC1 protein in C2C12 cells, while it upregulated Ppargc1a mRNA. Overexpression studies indicate that USP2 potentially stabilizes PGC1 in an isopeptidase-dependent manner. Given that PGC1 is an inducer of UCP2 in C2C12 cells, USP2 might ameliorate mitochondrial ROS by maintaining the PGC1–UCP2 axis in myoblasts.

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.

Euler's theorem about the relationship between the numbers of individual elements of planar graphs (vertices, edges, faces) is also satisfied when the graph has zero vertices. The problem of the existence or not of such graphs has so far been the subject of very few studies. Plus, research that didn't prove anything. The paper presents an interpretation of this kind of graphs as mathematical formations lying on piecewise smooth surfaces. The lines of intersection of two or more smooth surfaces (faces of a graph) form edges without a vertex of the graph. The elementary properties of such graphs are discussed, the method of counting non-isomorphic 0-vertex graphs and their importance in physics and chemistry are given.

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 .

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.

The aim of this 9th expository article is to conclude a study on domination in two fuzzy models, including t−norm fuzzy graphs and fuzzy graphs. All parts are twofold even if we don’t men- tion, directly. I.e., all results depicts some properties about fuzzy graph and t−norm fuzzy graph.

The abilities of quantitative description of noise are restricted due to its origin and only the statistical and spectral analysis methods can be applied while an exact time evolution cannot be defined or predicted. It emphasizes the challenges faced in many applications including communication systems where noise can play, on one hand, a vital role impacting signal-to-noise ratio but possessing, on the other hand, unique properties such as infinite entropy (infinite information capacity), exponentially decaying correlation function and so on. Despite the deterministic nature of chaotic systems, the predictability of chaotic signals is limited for a short time window putting them close to random noise. In this article, we propose and experimentally verify an approach to achieve Gaussian-distributed chaotic signals by processing the outputs of chaotic systems. The mathematical criteria, on which the main idea of the study is based on, is the Central Limit Theorem which states that the sum of a large number of independent random variables with similar variances approaches a Gaussian distribution. The study involves more than 40 mostly three-dimensional continuous-time chaotic systems (Chua’s, Lorenz’s, Sprott’s, memristor-based, etc.) whose output signals are analyzed according to criteria that encompass the probability density functions of a chaotic signal itself and its envelope and phase, statistical and entropy-based metrics such as skewness, kurtosis, and entropy power. We found that two chaotic signals of Chua’s and Lorenz’s systems exhibited superior performance across the chosen metrics. Furthermore, our focus extended to determining the minimum number of independent chaotic signals necessary to yield a Gaussian-distributed combined signal. The analytic and experimental results indicate that the sum of at least three non-Gaussian chaotic signals closely approximates Gaussian distribution. It allows generation of reproducible Gaussian-distributed deterministic chaos by modeling simple chaotic systems.

Rock materials failures are accompanied by the co-existence of various failure mechanisms, in-cluding rock fracturing, shearing, and compaction yield. These mechanisms manifest macro-scopically as multiple failure modes and nonlinear strength characteristics related to stress levels. Considering the limitations of current rock mechanics strength theories, which are primarily derived from single failure mechanisms, this study evaluates the applicability of alternative strength theories. Based on the extensional-strain criterion and the PMC (Paul-Mohr-Coulomb) model, a piecewise linear strength model was proposed that is suitable for analyzing multiple failure mechanisms in rocks and revealing the intrinsic mechanisms of multi-mechanism rock material failure. A multiple failure mechanism strength model in the form of inequalities was proposed, using the generalized shear stress, mean stress, and stress Lode angle as parameters. Strength tests conducted on sandstone and granite rock material samples under different stress conditions revealed distinct piecewise linear strength characteristics for both rock types, vali-dating the rationality and applicability of the multiple failure mechanism model. The findings construct a multi-mechanism failure model for rocks, providing enhanced predictive capabilities and aiding in the prevention of rock structural failures.

One of the primary causes of the mechanical seal failure is rotor vibration. Traditional dynamic seal models often would not be able to fully explaining the failure mechanisms. The seal dynamic models proposed in this paper, including those developed by the authors, prove valuable in predicting seal dynamics during operation in specific turbomachinery and in explaining the causes of seal failure. The single-mass dynamic model is suitable for analyzing contact mechanical seal and simple design dry gas seals dynamics. The two-mass dynamic model is used for investigating operational dynamics processes in classical dry gas seals under complex loading conditions. The three-mass dynamic model is used to study various complex mechanical seal types. This model is able to determine the normal operating condition range and to explain leakage mechanisms in the presence of excessive rotor vibrations.

Type 2 diabetes mellitus (T2DM) is a global health concern driven by factors such as obesity, sedentary behavior, and poor diet. This study uses data from the 2017-18 Bangladesh Demographic and Health Survey (BDHS) to analyze regional and individual predictors of diabetes and predi-abetes. Employing a Bayesian multinomial mixed-effects model, we account for regional varia-bility and individual factors like age, gender, BMI, residence, wealth, education, employment, and hypertension. Our results indicate significant regional differences and associations between de-mographic and health-related factors with diabetes risk. Younger individuals and those with higher BMI are more likely to be diabetic, while hypertension significantly increases diabetes risk. We applied machine learning (ML) models, including logistic regression, decision trees, k-nearest neighbor, linear discriminant analysis, and random forest, to classify diabetic status using these predictors, assessing their accuracy through 10-fold cross-validation. Logistic regression and linear discriminant analysis demonstrated robust performance across various response distributions. Simulation studies further examined the impact of different response distributions on model performance, revealing significant differences in classification accuracies. This approach of esti-mating parameters with a Bayesian model, applying ML for prediction, and conducting simulation studies to explore various scenarios highlights the importance of integrating these methodologies for effective diabetes prediction, providing insights for public health strategies to mitigate T2DM's impact.

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.

This paper investigates five different GARCH models (GARCH, EGARCH, IGARCH, Component GARCH (CGARCH) and GJR-GARCH) along with six distributions (Normal, Student’s t, GED and their skewed forms), which are used to forecast the volatility for the Bulgarian Stock index SOFIX. We use a GARCH model to predict how much time it will take, after the latest crisis, for the SOFIX index to reach its historical peak once again. The empirical data covers the period between the years 2000 and 2024, including the 2008 financial crisis and the COVID-19 pandemic. The purpose is to answer which of the five models is the best at forecasting the volatility of SOFIX and which distribution is most appropriate. The results, based on BIC and AIC information criteria, show that the ARMA(1,1)-CGARCH(1,1) specification with the Student t-distribution is preferred for forecasting. With the help of 5000 simulations, it is estimated that the chances of Index SOFIX reaching its historical peak value of 1976.73 (08.10.2007) are higher than 90% at 13.08.2087.

The conformity assessment of products or a measured value with the given standards is carried out based on the global risk of producers and consumers calculation. A product may conform to specifications but be falsely rejected as non-conforming. This is about the producer's risk. If a product doesn't meet the requirements but is falsely accepted as conforming, that poses a risk to the consumer. The conventional approach to risk assessment, which yields only a single numerical value for the global risk of producers and consumers, is naturally extended, and utilized for assessing risk in measurement models with linear regression. The outcomes of the two-dimensional extension, along a moderate scale, are the parabolas with an opening upwards. Risk surfaces were obtained through three-dimensional extension over the area limited by the moderate scale and guard band axes. Four models with different ranges of tolerance intervals were used to test this innovative method of risk assessment in linear regression. The corresponding standard measurement uncertainties are determined by applying a simplified measurement model with the use of comprehensive data on the measurement performance and by determining measurement uncertainty derived from consideration of the functional relationship obtained by linear regression analysis. Models that utilize information from linear regression analysis to determine measurement uncertainty are biased towards risks at the edges of the moderate scale. Testing the model's performances with metrics related to the confusion matrix, such as the F1 score, further substantiated this assertion. The diagnostic odds ratio has been proven to be extremely effective in identifying the curve along the guard band axis, along which the global risks of producers and consumers are at their lowest.

Facing global warming consequences is a major issue of present times. For what concerns climate, projections say that heavy rainfalls are going to increase with high probability together with temperature rise, thus also the hazard related to rainfall induced shallow landslides will likely increase in density over susceptible territories. Different modeling approaches exist and any of them is forced to make simplifications in order to reproduce landslide occurrences over space and time. Process based models can help in quantifying the consequences of heavy rainfall on the different involved processes. In this paper, a narrative review about physically-based deterministic distributed models (PBDDMs) is presented. Models were selected based on: the adoption of the infinite slope scheme (ISS), the use of a deterministic approach (i.e., input and output are treated as absolute values), the inclusion of new approaches in modeling slope stability through the ISS. Models are presented in chronological order with the aim of drawing a timeline of the evolution of PBDDMs and to give researchers and practitioners a basic knowledge on how much has been already done. Results indicate that including vegetation effects on slope stability has raised in importance over time but that there is still the need of finding an efficient way to include them, and that in the last years the literature production seems to be more focused on probabilistic approaches.

As Artificial Intelligence (AI) technology, particularly Machine Learning algorithms, becomes increasingly ubiquitous, our abilities to understand and interpret AI and machine learning algorithms are becoming increasingly desirable. Visualization has been used as a common tool to view and understand complex machine learning processes. In this paper, we will focus on developing a general framework for the visualization of machine learning models as a scalar valued multi-dimensional function to help users understand how the models behave over different viewing spaces. We first give a formal definition of the visualization problem. Interpolation-based morphing and subspace sampling techniques are applied to generate various renderings through projections and cross-sections of the model space as 3D surfaces or heatmap images. This method will be applied to two real-world datasets and applications: the diagnosis of Alzheimer's Disease (AD) using a human brain networks dataset and a real-world benchmark dataset for predicting home credit default risks. The visualizations show that different machine learning algorithms can behave quite differently under different conditions.

With the development of organizational biology and forced from the EU Cosmetic Regulation (EU/1223/2009) with the complete ban of animal testing for cosmetic purposes, 3D skin models have been widely developed due to their similar physiological structure and metabolic function to native human tissue. 3D skin models for in vitro cosmetic evaluation are still promising alternative methods for evaluating phototoxicity, corrosivity and irritation. These models have been used for early screening and later validation of toxicity and efficacy evaluation by many well-known cosmetic companies. 3D skin models have become an important tool in cosmetic evaluation research. This article reviews the development of 3D skin models and their application in cosmetic evaluation. An outlook on the current application and future technological development directions in the cosmetic field is also presented.

This paper introduces a novel framework for zero-shot learning (ZSL), i.e., to recognize new categories that are unseen during training, by distilling knowledge from foundation models. Specifically, we first employ ChatGPT and DALL-E to synthesize reference images of unseen categories from text prompts. Then, the test image is aligned with text and reference images using CLIP and DINO. Finally, the predicted logits are aggregated according to their confidence to produce the final prediction.Experiments are conducted on multiple datasets, including CIFAR-10, CIFAR-100, and TinyImageNet. The results demonstrate that our model can significantly improve classification accuracy compared to previous approaches, achieving AUROC scores above 96\% across all test datasets. Our code is available at https://github.com/1134112149/MICW-ZIC.

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.

This study addresses a gap in the literature by conducting a comparative analysis of statistical and artificial intelligence techniques for predicting bankruptcy in small and medium-sized enterprises (SMEs). Using a comprehensive database of 7,104 Belgian SMEs, our findings demonstrate that intelligent techniques offer superior predictive accuracy for bankruptcy. Notably, our results indicate that a firm's position in the global value chain significantly affects prediction accuracy, with lower performance for firms operating upstream in the production process. This suggests that bankruptcy risk may spread upward along the value chain. This insight is particularly valuable for practitioners, as it highlights the importance of focusing on specific performance factors based on the type of firms they manage, advise, or collaborate with.

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.

Recommender Systems (RecSys) are crucial in managing information overload and enhancing user satisfaction across various digital platforms, including e-commerce and entertainment. Evolving from traditional models to Deep Neural Networks (DNNs) and, more recently, Large Language Models (LLMs), these systems leverage sophisticated algorithms to analyze user behaviors and preferences. LLMs, such as GPT-4, are trained on extensive datasets to comprehend and generate natural language, significantly advancing their ability to deliver personalized recommendations. This tutorial explores the transformative impact of LLMs on RecSys, discussing their development, application in handling complex datasets, and the integration of contextual insights. Real-world examples illustrate how LLMs enhance recommendation accuracy and user experience, highlighting challenges and future directions in the field.

Artificial neural networks are highly efficient tools for numerous kinds of tasks, which include forecasting, regression, and recognizing patterns in classification and pattern recognition. An artificial neural network is a model for processing information using essential components called artificial neurons that are inspired by the human brain. Two significant aspects of delayed neural networks dynamic activity are their stability and the synchronization phenomenon. This work presents a bidirectional associative memory (BAM) incommensurate fractional-order delay neural network model. The incommensurate fractional orders are calculated within the stability region through the corresponding eigenvalues and their points of equilibrium. The involved neuron states are synchronized with each other for the calculated incommensurate stable fractional orders. The reduction of the time delay will give more relaxation time for the state variable $w_4(t)$ to be stable as compared to the state variable $w_3(t)$ due to the induction of extra activation functions. The theoretical findings of this research have significance for providing guidance and controlling the dynamic behavior of artificial neural networks.

The assortment of low-cost 3D printers for “in-practice” use, e.g., for clear aligner therapies, is ever increasing. To address concerns about the accuracy of orthodontic models produced on such printers when cost efficient modes of 3D printing are employed, this study examined the effect of print model body type and print angulation on accuracy. Six printing-configuration groups were included: 2 model types (solid or hollow shell) combined with 3 print angles (0°, 70°, or 90°) with 10 models/group; all models were printed with 100-µm layer thickness using a digital light processing-based 3-dimensional printer. Eleven selected structures and distances were measured on the printed models with a digital microscope and compared to the same measures on a digitized master model. The clinically-acceptability range was set at ±0.25 mm difference from the master model for single tooth measurements (intra-tooth) and ±0.5 mm for cross-arch measurements (inter-tooth). For individual measurements across all models, 98% fell within clinical acceptability. For mean measurements within each model group, only canine height for the shell-0° model had a mean difference (0.26 mm ± 0.03) outside the clinically acceptable range for intra-tooth measurements. Standard deviations for all intra-tooth measurements were within 0.07 mm. While none of the mean inter-tooth measurements exceeded the acceptability range, the standard deviations were larger (0.04 to 0.30 mm). Accuracy of orthodontic models for clear aligner therapies was not impacted beyond the clinically acceptable range when altering model body type and print angulation to improve efficiency of 3D printing. These findings suggest greater flexibility of the practitioner to alter print settings to address time and cost efficiency in various clinical scenarios and still maintain clinically acceptable model accuracy.

The rapid advancement of large language models (LLMs), such as ChatGPT, has revolutionized natural language processing, enabling these models to generate coherent and contextually relevant text. These capabilities hold significant potential for various applications, particularly in the medical field. LLMs can assist healthcare professionals by providing accurate information, supporting diagnostic processes, and enhancing medical education. However, the implementation of LLMs in clinical settings faces several barriers, including technical limitations, ethical concerns, regulatory constraints, and practical challenges. Ensuring accuracy, reliability, and interpretability is crucial, along with addressing biases, ensuring data privacy, and establishing ethical guidelines. Future research should focus on improving training techniques, developing explainable AI methods, and creating efficient, resource-saving models. Expanding applications through domain-specific models and multi-modal integration can further unlock the potential of LLMs. By addressing these challenges and prioritizing responsible development, LLM technology can be safely and effectively integrated into various domains, driving innovation and improving outcomes. This paper explores the current state of LLM technology, its medical applications, barriers to implementation, and directions for future research and development

Accurate traffic simulation models play a crucial role in developing intelligent transport systems that offer timely traffic information to users and efficient traffic management. However, calibrating these models to represent real-world traffic conditions accurately poses a significant challenge due to the dynamic nature of traffic flow and the limitations of traditional calibration methods. This article introduces a machine learning-based approach to calibrate macroscopic traffic simulation models using real-time traffic video stream data. By leveraging computer vision technologies to extract key traffic parameters from video streams, the approach demonstrated a notable improvement in aligning the generated data from the calibrated simulation model with car sensor data, achieving an average improvement of over 50% compared to the uncalibrated macroscopic model. Moreover, there was a substantial reduction in data drift for the machine learning model integrated into the virtual transport space using vehicle-to-everything technology, resulting in a more than fourfold decrease in the average absolute error of the model.

The paper considers two models of queuing with a varying structure based on the introduction of additional transient intensities into known models or their combinations, which create stationary distributions convenient for calculation. In the first model, it is a probabilistic mixture of known stationary distributions with given weights. In the second model, this uniform distribution is repeatedly used in physical statistics. Both models are based on the selection of states, between which additional transient intensities are introduced. The algorithms used in the paper for introducing new transient intensities are closely related to the concept of flow in a deterministic transport network. The introduced controls are selected so that the marginal distribution of the combined system is a mixture of the marginal distributions of the combined systems with different weights determined by the introduced transient intensities. As a result, the process of functioning of the combined system is obtained by switching processes corresponding to different combined systems at certain points in time.

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.

Pain diagnosis remains a challenging task due to its subjective nature, the variability in pain expression among individuals, and the difficult assessment of the underlying biopsychosocial factors. In this complex scenario, artificial intelligence (AI) can offer the potential to enhance diagnostic accuracy, predict treatment outcomes, and personalize pain management strategies. This review aims at dissecting the current literature on computer-aided diagnosis methods. It also discusses how AI-driven diagnostic methods can be integrated into multimodal models that combine various data sources, such as facial expression analysis, neuroimaging, and physiological signals, with advanced AI techniques. Despite the significant advancements in AI technology, its widespread adoption in clinical settings faces crucial challenges. Ethical considerations related to patient privacy, biases, and lack of reliability and generalizability are the main issues. Furthermore, there is a need for high-quality real-word validation as well as the development of standardized protocols and policy rules to guide the implementation of these technologies in diverse clinical settings.

Drug-induced liver injury (DILI) stands as a significant cause of drug attrition. To mitigate clinical DILI risks, assessing drugs using human liver models is crucial since animal studies may fall short due to species-specific liver pathway variations. Cell-based preclinical hepatotoxicity testing is often pertinent. In the present study, cells from a human liver cancer line (HepG2, HepaRG) were cultured in both formats of 2D and 3D spheroids to explore their responses to drugs. Liver-specific marker expressions across cell lines and culture formats were also examined to assess disparities in drug-induced liver injury marker expressions. In cytotoxicity assays, HepG2 cells exhibited heightened sensitivity to amiodarone HCl, while HepaRG cells showed greater sensitivity to acetaminophen. Generally, 2D cultures were more responsive to drugs than 3D cultures. Consistency was observed between cytotoxicity assays and liver injury markers AST and ALT. Variations were also noted in liver cell marker secretion, with albumin and urea concentrations declining post-drug treatment, particularly with higher baseline expression in HepaRG cells and 3D cultures. Additionally, mRNA expression levels of CYP enzymes involved in hepatocellular drug metabolism were compared following treatment with enzyme inducers. CYP1A2 and CYP2C9 were not expressed in HepG2 cells. On the other hand, CYP3A4 was expressed higher in 3D culture than in 2D culture. HepaRG cells exhibited significantly increased expression of all three enzymes post-treatment. Notably, enzyme expression was notably higher in 3D cultures than in 2D cultures. Collectively, these findings suggest that HepaRG cells and 3D cultures hold promise for evaluating DILI during early-stage drug development.

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.

Variable-Angle Tow (VAT) laminates can improve straight fiber composites mechanical properties thanks to the application of curvilinear fibers. This characteristic allows to achieve ambitious objectives for design and performance purposes. Nevertheless, the wider design space and the higher number of parameters result in a more complex structural problem. Among the various approaches that have been used for VATs study, Carrera’s Unified Formulation (CUF) allows to obtain multiple theories within the same framework, guaranteeing a good compromise between the results accuracy and the computational cost. In this article, the linear buckling behavior of VAT laminates is analyzed through the extension of CUF 2D plate models within the Reissner’s Mixed Variational Theorem (RMVT). Results show that RMVT can better approximate the prebuckling non-uniform stress field of the plate when compared to standard approaches, thus improving the prediction of the linear buckling loads of VAT composites.

The human eye is a vital source of collecting information worldwide via daily observation. The computer science area recognizes it in research as a human-computer interaction. Human blink is an integral part of this observation as a research topic. Several studies have been conducted on eye blinking and left-right eye movements. Previous studies conducted on the eye blink consider the availability of hardware devices high in the budget, high Precision, and low light expo-sure, unlike our study, which uses low-budget devices as simple as a webcam and more versatile usable techniques, incredibly both dim and high light to name a few. This study offers the observational approach via ResNet101v2, VGG-19, and Convolution Neural Network (CNN) architectures. Outperforming both VGG-19 and CNN in this study, ResNet101v2 achieves an impressive accuracy of 98.2%. In contemporary times, deep learning in AI is taking an advanced form. This study attempts to provide a new insight into the real-world implementation of the eye blink.

Nowadays, rotor-stator mixers are widely used in the chemical process industry to carry out the dispersion and de-agglomeration processes for manufacturing the homogenous electrode slurries. Development of the process simulation models for the turbulent mixing of these slurries helps to optimize the mixing parameters such as rotational speed and dispersion time. In this work, computational fluid dynamics (CFD) approach through ANSYS Fluent are explored to determine and analyze the flow patterns, velocity fields and viscosity distribution during the dispersion of anode slurries. It utilizes a non-homogeneous Eulerian multiphase approach and the typical k-ε model to create turbulence fields and compute the mixing rate. This work significantly improves our understanding of the relationship between rotor speed, dispersion time, viscosity distribution, and mixer geometry in rotor-stator mixers.

Predicting human trajectories poses a significant challenge due to the complex interplay of pedestrian behavior, which is influenced by environmental layout and interpersonal dynamics. This complexity is further compounded by variations in scene density. To address this, we introduce a novel dataset from the Festival of Lights in Lyon 2022, characterized by a wide range of densities (0.2-2.2 ped/m2). Our analysis demonstrates that density-based classification of data can significantly enhance the accuracy of predictive algorithms. We propose an innovative two-stage processing approach, surpassing current state-of-the-art methods in performance. Additionally, we utilize a collision-based error metric to better account for collisions in trajectory predictions. Our findings indicate that the effectiveness of this error metric is density-dependent, offering prediction insights. This study not only advances our understanding of human trajectory prediction in dense environments but also presents a methodological framework for integrating density considerations into predictive modeling, thereby improving algorithmic performance and collision avoidance.

Electricity price forecasting has become a crucial element for both private and public decision-making. This importance has been growing since the wave of deregulation and liberalization of energy sector worldwide late 1990s. Given these facts, this paper tries to come up with a precise and flexible forecasting model for the wholesale electricity price for the Italian power market on an hourly basis. We utilize artificial intelligence models such as neural networks and bagged regression trees that are rarely used to forecast electricity prices. After model calibration, our final model is bagged regression trees with exogenous variables. The selected model outperformed neural network and bagged regression with single price used in this paper, it also outperformed other statistical and non-statistical models used in other studies. We also confirm some theoretical specifications of the model. As a policy implication, this model might be used by energy traders, transmission system operators and energy regulators for an enhanced decision-making process.

The extent of correlation or co-movement among the returns of developed and/or emerging stock markets remains pivotal for efficiently diversifying global portfolios. This correlation is prone to variation over time as a consequence of escalating economic interdependence fostered by international trade and financial markets. In this study, we analyzed the time-varying correlation and co-movement between the JSE.JO stock market of South Africa and its developed and developing stock market partners. The Dynamic Conditional Correlation - Exponential Generalized Autoregressive Conditional Heteroscedasticity (DCC-EGARCH) methodology is employed with different multivariate distributions to explore the time-varying correlation and volatilities between the JSE.JO stock market and its partners. Based on the conditional correlation results, the JSE.JO stock market is integrated and co-moves with its partners, and the conditional correlation for all markets exhibit time-variant behavior. The conditional volatility results show that the JSE.JO stock market behaves differently from other markets, especially after 2015, indicating a positive sign for investors to diversify between JSE.JO and its partners. The highest value of conditional volatility for markets was in 2020 during the COVID-19 pandemic, representing the riskiest period that investors should avoid due to the lack of diversification opportunities during crises.

Recent advances in organoid technology have revolutionized cancer biology and thera-peutic interventions, offering personalized immunotherapy treatment. Organoids, three-dimensional cell cultures derived from patient tumors, accurately replicate the tumor microenvi-ronment, providing unprecedented insights into tumor-immune interactions and therapeutic re-sponses. In this literature-based study, we discuss various culture methods for the diverse appli-cations of organoids in cancer immunotherapy, including drug screening, personalized treatment strategies, and mechanistic studies. Additionally, we address the technological challenges asso-ciated with these methods and propose potential future solutions to accelerate the development of novel immunotherapeutic approaches. This review highlights the transformative potential of or-ganoid models in advancing preclinical cancer immunotherapy modeling, screening, and evalua-tion, paving the way for more effective and personalized cancer treatments.

The multiphase motors due to their reliability find new areas of application in the industry and transportation. Developing of any system with multiphase motors at first requires elaborate model of the system, define control mode and controllers. The model of control system for the six-phase drive is based on its conventional d-q mathematical model and indirect field-oriented control. Simulink model of six-phase drive with indirect field-oriented control and simulated with two types PID and PID fuzzy controllers. The simulation results, reflecting step response and provided speed reference law as well as load application at constant speed, are presented and analyzed. Fuzzy controller with 49 rules is considered and applied. Six-phase electric drive with field-oriented control at well-tuned PID controller has good step response specifications: settling time 0.13 s at starting without load, step response has no overshoot, small about 1 % short time decrease of speed at load of 5 Nm application. The system employing PID fuzzy controller shows slightly better results in response to torque application: the decrease in speed 1 % is eliminated in shorter time. Simulation results indicate the robustness of both systems with six-phase drive to disturbance and provide high quality transient specifications at determined reference speed.

Large Language Models (LLMs) have demonstrated promising capabilities to solve complex tasks in critical sectors such as healthcare. However, LLMs are limited by their training data which is often outdated, the tendency to generate inaccurate ("hallucinated") content and a lack of transparency in the content they generate. To address these limitations, retrieval augmented generation (RAG) grounds the responses of LLMs by exposing them to external knowledge sources. However, in the healthcare domain there is currently a lack of systematic understanding of which datasets, RAG methodologies and evaluation frameworks are available. This review aims to bridge this gap by assessing RAG-based approaches employed by LLMs in healthcare, focusing on the different steps of retrieval, augmentation and generation. Additionally, we identify the limitations, strengths and gaps in the existing literature. Our synthesis shows that proprietary models such as GPT-3.5/4 are the most used for RAG applications in healthcare. Also, there is a lack of standardized evaluation frameworks for RAG-based applications. In addition, the majority of the studies do not assess or address ethical considerations related to RAG in healthcare. It is important to account for ethical challenges that are inherent when AI systems are implemented in the clinical setting. Lastly, we highlight the need for further research and development to ensure responsible and effective adoption of RAG in the medical domain.

Molnupiravir, a prodrug known for its broad antiviral activity, demonstrated efficacy in animal models of Covid-19, prompting clinical trials where initial results indicated a significant effect against the disease. However, subsequent clinical studies did not confirm these findings, leading to the rejection of molnupiravir for permanent market authorization in many countries. This report critically assessed 19 studies published in 17 reports that investigated the efficacy of molnupiravir in animal models of Covid-19 with the purpose of determining how well the design of these models informed human studies. We found that the administered doses of molnupiravir in most studies involving animal Covid-19 models were disproportionately higher than the dose rec-ommended for human use. Specifically, when adjusted for body surface area, half of the doses of molnupiravir used in the animal studies were more than twice as high as the human dose. Addi-tionally, the drug was frequently given prophylactically or shortly after SARS-CoV-2 inoculation in these models, in contrast to clinical trials where such timing is not consistently achieved. Furthermore, the recommended five-day treatment duration for humans was exceeded in several animal studies. Collectively, we suggest that these design elements in the reported animal studies contributed to a bias favoring molnupiravir, and thus inflated expectations for its efficacy against Covid-19. Addressing these elements may offer avenues to enhance the clinical efficacy of mol-nupiravir for treatment of Covid-19 that include dose increment, early treatment, and admin-istration by inhalation along with use of molnupiravir in antiviral combination therapy.

Financial market data analysts are increasingly turning towards machine learning techniques for data analysis and making decisions. This paper explores how knowledge graphs, essentially a network of real entities and their relationships, can be used to improve collaborative financial market data analysis and make it more efficient and user friendly. This paper reviews the current state of financial market data analysis, the challenges in deploying machine learning models in industrial environments, and the concepts such as ML-Ops and knowledge graphs. A software architecture comprising various roles, layers and services such as Data Engineers, Data Analysts, public users, APIs, workflows, analytics libraries, UX layer, Business Layer, etc. is introduced and described in detail. Then, it discusses how knowledge graphs can be used to enhance collaborative financial market data analysis. Finally, a case study is presented to demonstrate the usage of the whole system, within the context of financial market data analytics of equities.

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.

Despite significant advancements in Artificial Intelligence (AI) and Large Language Models (LLMs), detecting and mitigating bias remains a critical challenge, particularly within social media platforms like X (formerly Twitter) and in addressing cyberbullying present on them. This research investigates the effectiveness of leading LLMs in generating synthetic biased and cyberbullying data and evaluates the proficiency of Transformer AI models in detecting bias and cyberbullying within both authentic and synthetic contexts. The study involves semantic analysis and feature engineering on a dataset of over 48,000 sentences related to cyberbullying collected from Twitter (before it became X). Leveraging state-of-the-art LLMs such as ChatGPT-4o, Pi AI, Claude 3 Opus, and Gemini-1.5, synthetic biased, cyberbullying, and neutral data were generated to deepen the understanding of bias in human-generated data. AI models including DeBERTa, Longformer, BigBird, HateBERT, MobileBERT, DistilBERT, BERT, RoBERTa, ELECTRA, and XLNet were initially trained to classify Twitter cyberbullying data and subsequently fine-tuned, optimized, and quantized for multilabel classification (detecting both biases and cyberbullying). The study's outcomes include a prototype of a hybrid application that combines a Bias Data Detector and a Bias Data Generator, validated through extensive testing.

In this study, we investigated the features of co-infection with SARS-CoV-2 and nonpathogenic strain LEV8 of coxsackievirus A7 or enterovirus A71 for Vero E6 cells and Syrian hamsters. The investigation of co-infection with SARS-СoV-2 and LEV-8 or EV-A71 in the cell model was shown that a competitive inhibitory effect for these viruses were especially significant against SARS-CoV-2. Pre-infection with enteroviruses in animals caused more than a 100-fold decrease in the levels of SARS-CoV-2 virus replication in the respiratory tracts and more rapid clearance of the lower respiratory tract from infectious SARS-CoV-2. Co-infection with SARS-CoV-2 and LEV-8 or EV-A71 also reduced the severity of clinical manifestations of the SARS-CoV-2 infection for animals. Additionally, the histological data illustrated that co-infection with nonpathogenic coxsackievirus decreased the level of pathological changes by SARS-CoV-2 in the lungs. Research into the chemokine/cytokine profile demonstrated that the studied enteroviruses efficiently triggered this part of antiviral immune response, which can be associated with significant inhibition of SARS-CoV-2 infection. These results demonstrate that there exists a strong viral interference between the studied nonpathogenic strain of coxsackievirus A7 or enteroviruses A71 and SARS-CoV-2 pathogenic for humans in vitro and in vivo.

This study considers an application of the first-order Grey Markov Model to foresee the values of Italian power generation in relation to the available energy sources. The model is used to fit data from the Italian energy system from 2000 to 2022. The integration of Markovian error introduces a random element to the model, which is able now to capture inherent uncertainties and misalignments between the Grey model predictions and the real data. This application provides valuable insights for strategic planning in the energy sector and future developments. The results show good accuracy of the predictions, which provides powerful information for the effective implementation of energy policies concerning the evolution of energy demand in the country. Despite advancements, Italy’s 2032 energy mix will still significantly rely on fossil fuels, emphasizing the need for sustained efforts beyond 2032 to enhance sustainability.

The pursuit of Artificial Intelligence (AI) that emulates human cognitive processes is a cornerstone of ethical AI development, ensuring that emerging technologies can integrate seamlessly into societal frameworks requiring nuanced understanding and decision-making. Zero-Shot Instance Retrieval (ZSIR) stands at the forefront of this endeavour, potentially providing a robust platform for AI systems, particularly large visual language models, to demonstrate and refine cognition-aligned learning without the need for direct experience. In this paper, we critically evaluate current cognition alignment methodologies within traditional zero-shot learning paradigms, using visual attributes and word embedding generated by large AI models. We propose a unified similarity function that quantifies the cognitive alignment level, bridging the gap between AI processes and human-like understanding. Through extensive experimentation, our findings illustrate that this similarity function can effectively mirror the visual-semantic gap, steering the model towards enhanced performance in zero-shot instance retrieval. This work not only benchmarks the cognition alignment of AI, but also sets a new precedent for the development of visual language models attuned to the complexities of human cognition.}

Automating pruning tasks entails overcoming several challenges, encompassing not only robotic manipulation but also environment perception and detection. To achieve efficient pruning, robotic systems must accurately identify the correct cutting points. A possible method to define these points is to choose the cutting location based on the number of nodes present on the targeted cane. For this purpose, in grapevine pruning, it is required to correctly identify the nodes present on the primary canes of the grapevines. In this paper, a novel method of node detection in grapevines is proposed with four distinct state-of-the-art versions of the YOLO detection model: YOLOv7, YOLOv8, YOLOv9 and YOLOv10. These models were trained on a public dataset with images containing artificial backgrounds and afterwards validated on different cultivars of grapevines from two distinct Portuguese viticulture regions with cluttered backgrounds. This allowed to evaluate the robustness of the algorithms on the detection of nodes in diverse environments, compare the performance of the YOLO models used, as well as create a publicly available dataset of grapevines obtained in Portuguese vineyards for node detection. Overall, all used models were capable of achieving correct node detection on images of grapevines from the three distinct datasets. Considering the trade-off between accuracy and inference speed, the YOLOv7 model demonstrated to be the most robust in detecting nodes in 2D images of grapevines, achieving F1-Score values between 70 % and 86.5 % with inference times of around 89 ms for an input size of 1280×1280 px. Considering these results, this work contributes with an efficient approach for real-time node detection for further implementation on an autonomous robotic pruning system.

Abstract This study delved into the application of various machine learning (ML) models for the classification of lung cancer levels. Through meticulous monitoring of parameters such as minimum child weight and learning rate, efforts were made to mitigate overfitting while optimizing model performance. The Deep Neural Network (DNN) emerged as a standout performer, showcasing robust performance across training, validation, and testing stages. Ensemble methods like voting and bagging also demonstrated promising results. However, Support Vector Machine (SVM) models with the Sigmoid kernel faced challenges in achieving satisfactory performance. Overall, the investigation sheds light on the efficacy of different ML models in lung cancer level classification and underscores the importance of parameter tuning to address overfitting concerns.

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

This paper presents a methodology based on deep learning models and metaheuristic algorithms for the optimization of airfoils for the design of aircraft wings with large endurance. The use of AZTLI-NN (a neural network with an architecture composed of a multilayer perceptron and a variational autoencoder) is implemented for the prediction of graphs of the aerodynamic coefficients of the airfoil as a function of the angle of attack. This neural network presents good predictions of the aerodynamic coefficients, similar to the coefficients obtained with computational fluid dynamics simulations. AZTLI-NN in combination of metaheuristic algorithms and the CST profile parameterization method show excellent performance in single-objective and multi-objective profile optimization tasks.