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

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

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

Accurate forecasting of icing thickness has a great significance for ensuring the security and stability of power grid. In order to improve the forecasting accuracy, this paper proposes an icing forecasting system based on fireworks algorithm and weighted least square support vector machine (W-LSSVM). The method of fireworks algorithm is employed to select the proper input features with the purpose of eliminating the redundant influence. In addition, the aim of W-LSSVM model is to train and test the historical data-set with the selected features. The capability of this proposed icing forecasting model and framework is tested through the simulation experiments using real-world icing data from monitoring center of key laboratory of anti-ice disaster, Hunan, South China. The results show that the proposed W-LSSVM-FA method has a higher prediction accuracy and it may be a promising alternative for icing thickness forecasting.

Various means (the arithmetic mean, the geometric mean, the harmonic mean, the power means) are often used as central tendency statistics. A new statistic of such type is offered for a sample from a distribution on the positive semi-axis, the gamma-weighted geometric mean. This statistic is a certain weighted geometric mean with adaptive weights.

This paper considers the Hermitian solutions of a new system of commutative quaternion matrix equations, we establish both necessary and sufficient conditions for the existence of solutions. Furthermore, we derive an explicit general expression when it is solvable. To illustrate our main findings, we present two numerical algorithms and examples in this paper.

The release of the active substance from the matrix modified-release tablets based on Kollidon®SR and chitosan depends on its solubility in the dissolution medium and on the composition of the matrix-forming polymers. The study is based on new oral matrix tablets based on Kollidon®SR and chitosan, formulated to optimize the low oral bioavailability of chlorzoxazone, a non-steroidal anti-inflammatory drug, a class II Biopharmaceutical Classification System. Nine types of chlorzoxazone matrix tablets were obtained using the direct compression method, and their combination at 1:1, 1:2, 1:3 chlorzoxazone/ excipients, 20%-40% (w/w) Kollidon®SR, 3-7% (w/w) chitosan and the auxiliary substances were formulated in constant concentrations. Pharmaco-technical characterization included the analysis of flowability and compressibility properties (flow time, friction coefficient, angle of repose, Hausner ratio, Carr Index), and of pharmaco-chemical characteristics (mass and dose uniformity, thickness, diameter, mechanical strength, Friability, degree of softening, in vitro release profile) of the tablets. Based on the initial evaluation of the pharmaco-technical analysis, pharmaco-chemical characteristics, and in vitro release profile, only three matrix tablet formulations (F1b, F2b, and F3b) were further tested. They were evaluated through Fourier-transform infrared spectrometry, X-ray Diffraction, thermogravimetry, differential scanning calorimetry, and in vitro dissolution tests. The three formulations were comparatively studied regarding the release kinetics of active substances using in vitro release testing. The results were analyzed by fitting into four representative mathematical models for the modified release oral formulations. In vitro kinetic study reveals a complex mechanism of release occurring in the first (0 - 2 hours) and second (2.0 hours – 36 hours) steps of drug release. Two factors have been calculated to assess the release profile of chlorzoxazone: f1 - the similarity factor and f2 - the factor difference. The results have shown that both Kollidon®SR and chitosan may be used as matrix-forming agents when combined with chlorzoxazone. In vitro dissolution tests revealed the F2b sample, data suggesting a faster drug release. The three formulations showed optimum pharmaco-technical properties and in vitro kinetic study, and they had tremendous potential to be used in oral pharmaceutical products for the controlled delivery of chlorzoxazone.

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

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

This investigation mainly focused on the microstructural analysis of Al based hybrid metal matrix composites. Aluminium as base metal and reinforced with 2% B4 C, ZrO2 (2%,4%,6%), SiC (4%,8%,12%). Specimens were manufactured by using conventional stir casting technique. Hybrid metal matrix composites were examined by using Scanning electron microscope. This research explained XRD, EDS and Fractography analysis. This investigation shows the reinforced material has given better results in all aspects than pure Al6061 alloy and homogeneous dispersion of particles inside the matrix. Porosity, delamination, cracks, particle distributions were observed through microstructural analysis. Additionally determined the crystal size of pure Aluminium 6061 alloy and hybrid composites.

This note reconsiders a matrix equality $A_1A_2^{-}A_3A_4^{-}A_5 = A$ composed by six matrices of appropriate sizes, where $A_2^{-}$ and $A_4^{-}$ are generalized inverses of $A_2$ and $A_4$, respectively, and solves a selection of matrix set inclusion problems associated with various mixed reverse order laws for generalized inverses of products of two, three, and four matrices by means of this equality and its variations.

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

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

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

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

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

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

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

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

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

Thin people who undergo implant insertion into the chest wall face a high risk of implant exposure to the external environment. Five months after an 8-year-old boy underwent implantable cardioverter-defibrillator (ICD) implantation in a subcutaneous pocket in the left anterolateral chest wall to manage long QT syndrome, ICD replacement became necessary owing to exposure risk from distal and lateral thinning of the ICD pocket. Pocket rupture and exposure would increase the risk of infection; therefore, we performed ICD removal and primary pocket closure. Two weeks later, a new suprafascial pocket was created, acellular dermal matrix (ADM) was attached to the inner wall to prevent ICD protrusion, and a new ICD was inserted. One year postoperatively, the ADM was engrafted, and no complications were observed. A thin subcutaneous layer increases the risk of ICD implantation complications. Inner wall strengthening with ADM can help prevent pocket rupture.

In Indonesia, types of meat are still identified manually due to increasing prices for beef and buf-falo ahead of Idul Fitri. Traders mix beef with pork to thwart the beef scam. Haar wavelet and GLCM, GLCM with angles of 0°, 45°, 90°, and 135°, as well as matrices using contrast, correlation, energy, homogeneity, and entropy, are used in feature extraction. The following are the results of meat image classification testing using k-NN, Haar wavelet, and GLCM: The k-NN algorithm shows superiority in identifying fresh (99%), frozen (99%), and rotten (96%) meat texture images with the most fantastic accuracy results in every situation. Meanwhile, GLCM routinely provides good results, especially regarding the texture image of fresh meat (183.21) and rotten meat (115.79). However, despite delivering less throughput than k-NN and GLCM, Haar wavelets are still helpful, especially when dealing with fresh meat texture images (89,96).

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.

Purpose of this article is to introduce a modification of Phillips operators on the interval $\left[ \frac{1}{2},\infty \right) $ via Dunkl generalization. This type of modification enables a better error estimation on the interval $\left[ \frac{1}{2},\infty \right) $ rather than the classical Dunkl Phillips operators on $\left[ 0,\infty \right) $. We discuss the convergence results and obtain the degrees of approximations. Furthermore, we calculate the rate of convergence by means of modulus of continuity, Lipschitz type maximal functions, Peetre's $K$-functional and second order modulus of continuity.

Purpose of this article is to introduce a modification of Phillips operators on the interval $\left[ \frac{1}{2}% ,\infty \right) $ via Dunkl generalization. This type of modification enables a better error estimation on the interval $\left[ \frac{1}{2},\infty \right) $ rather than the classical Dunkl Phillips operators on $\left[ 0,\infty \right) $. We discuss the convergence results and obtain the degrees of approximations. Furthermore, we calculate the rate of convergence by means of modulus of continuity, Lipschitz type maximal functions, Peetre's $K$-functional and second order modulus of continuity.

Ranked Set Sampling (RSS) is a useful technique for improving the estimator of population mean when the sampling units in a study can be easily ranked than the actual measurement. RSS performs better than simple random sampling (SRS) when the mean of units corresponding to each rank is used. The performance of RSS can be increased further by assigning weights to the ranked observations. In this paper, we propose weighted RSS procedures to estimate the population mean of positively skew distributions. It is shown that the gain in the relative precisions of the population mean for chosen distributions are uniformly higher than those based on RSS. The gains in relative precisions are substantially high. Further, the relative precisions of our estimator are slightly higher than the ones based on Neyman’s optimal allocation model for small sample sizes. Moreover, it is shown that, the performance of the proposed estimator increases as the skewness increases by using the example of lognormal family of distributions.

In this paper, we introduce the notion of weighted generalized group inverse in a Banach algebra with proper involution. This is a natural generalization of weighted weak group inverse for a complex matrix and Hilbert space operator. We present several characterizations and representations of this generalized inverse. In addition, a new partial order on elements in a Banach *-algebra is investigated by using the weighted generalized group inverse and some known results are thus generalized.

In this paper, we study the weighted reproducing kernels. We introduce a generalization of weighted reproducing property and extend it to relative reproducing property on Banach spaces. This generalization will develop the parallel computing and it can be used as a base of parallel learning for machines especially in the case that there are non-homogenous weighted hypothesis. This methods formulate learning and estimation problems in a relative reproducing kernel Banach space (RRKBS) of functions defined on the data domain, expanded in terms of a kernel.

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.

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.

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

In this paper we establish some weighted integral inequalities of Ostrowski, Čebyšev and Lupaş type. Applications for continuous probability density functions supported on infinite intervals with two examples are also given.

The heterogeneous structure implies that a few nodes may be crucial in maintaining network structural and functional properties. Identifying these crucial nodes correctly and quickly is a primary issue as contemporarily may face the mushrooming of large-scale datasets. Besides, the ‘weight issue’ is always ignored in this field which edge weight may play a positive/negative role in contributing to the node importance in different weighted networks. This paper provides a novel algorithm, Weighted Expectation Algorithm (WEA), which aims to ensure accuracy and speed of computation by taking advantage of dynamic programming to better handle the task of large-scale networks. Additionally, the weight issue that edge weights may contribute differently is addressed by a simply quantitative definition. Two standard experiments show WEA can maintain the network structure in connectivity well (by the lowest average robustness 0.192) and identify the node importance better in the spreading function test of spreading dynamics (by the highest average Kendall’s tau-b 0.678). In addition, the time complexities of different algo-rithms are evaluated, and their time-consuming are tested, proving that WEA consumes a rela-tively short time.

We have estimated the level of Risk Weighted Assets among 30 countries in Europe, in 30 trimesters, using data of the European Banking Authority-EBA of 139 variables. We perform an econometric model using Pooled OLS, Panel Data with Fixed Effects, Panel Data with Random Effects, Weighted Least Squares. We found that Risk Weighted Assets is negatively associated, among others, to the level of NFC loans in mining and quarrying, in public administration and defence, and in financial and insurance activities and positively associated, among others to distribution of NFC loans in human health services and social work activities, in education and the level of net fee and commission income. Furthermore, we apply a cluster analysis with the k-Means algorithm, and we find the presence of two clusters. A comparison was then made between eight different machine learning algorithms for predicting the value of the RWAs and we found that the best predictor is the linear regression. The RWA value is predicted to increase by 1.5%.

Aiming at the defects of low precision and time cumulative error, an external wireless signal weighted centroid localization algorithm aided inertial positioning method is designed in this paper. According to the signal strength of each anchor node received at the test point, the distance between the anchor node and the anchor node is obtained by using the attenuation model of the wireless signal. Three anchor nodes are used to measure the distance between the anchor node and the measured point. We can obtain the area to be measured according to the actual situation, the position of the measured point is obtained by the weighted centroid localization algorithm and a combined model of wireless signal aided inertial navigation system is established. The simulation results show that the method can greatly improve the positioning accuracy and restrain the divergence of the longitude error and latitude error.

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.

Background and Objectives To compare navigator-gated three-dimensional T1-weighted gradient-echo sequences (NG-3D T1W-GRE) with standard breath-hold T1W-GRE (BH T1W-GRE) for the detection of HCC nodules in patients with chronic viral hepatitis which undergo at magnetic resonance imaging (MRI) using gadoxetic acid. Methods and materials We evaluated 58 patients with hepatic nodules at least 1 cm in diameter detected by ultrasound who underwent liver MRI including NG-3D T1W-GRE sequences and breath hold T1-weighted gradient-echo sequences with different flip angles(FA) at 10-25-40° after contrast administration of gadoxetic acid at magnetic scanner operating at1.5 Tesla. Image quality and relative hepatic and nodular enhancement were evaluated by three blinded reviewers. Results In these patients, image quality of NG-3D T1W-GRE was assessed significantly better than quality of BHT1W- GRE (P < 0.005) and relative enhancement was significantly higher than that of BH- T1W-GRE ( P

In the radar system, detection represents a basic and important stage in the receiver side. The detection process is based on the thresholding criteria; two philosophies of this criteria, constant and adaptive threshold. The constant threshold is simple in design, but it has a mis-detection and does not control the false alarm rate. As for the adaptive threshold, it is powerful in target detection, and better control of the false alarm rate, where it is called Constant False Alarm Rate (CFAR). Lots of research in the CFAR design, but the gap in the previous works is that there is no CFAR algorithm can be working with all or most environmental fields and all or most target situations.In this paper, The CFAR, which can work with the most environment and most of the target situations, has been presented. The producing the design and implementation of the new practical CFAR processor is presented. Where, the new CFAR is a combination of the properties of three different CFAR algorithm (CA, OSGO, and OSSO), and from two different families; averaging and statistical. Where it has overperformed of it's is 97.25% for simulation and 96.25% for the implementable version for different target situations. The simulation analysis is made by using Matlab 2015, while the implementation is done by using Xilinx Spartan 700 3a.

Containing hundreds of spectral bands (features), hyperspectral images (HSIs) have high ability in discrimination of land cover classes. Traditional HSIs data processing methods consider the same importance for all bands in the original feature space (OFS), while different spectral bands play different roles in identification of samples of different classes. In order to explore the relative importance of each feature, we learn a weighting matrix and obtain the relative weighted feature space (RWFS) as an enriched feature space for HSIs data analysis in this paper. To overcome the difficulty of limited labeled samples which is common case in HSIs data analysis, we extend our method to semisupervised framework. To transfer available knowledge to unlabeled samples, we employ graph based clustering where low rank representation (LRR) is used to define the similarity function for graph. After construction the RWFS, any arbitrary dimension reduction method and classification algorithm can be employed in RWFS. The experimental results on two well-known HSIs data set show that some dimension reduction algorithms have better performance in the new weighted feature space.

In this short communication, following a brief introduction, we undertake a comprehensive analytical study of the weighted Simpson index. Our primary emphasis concerns the precise determination of the optimal point (minimizer) coordinates and of the minimum value of the index, a differentiable convex function, which is related to the harmonic mean concept. Furthermore, we address and solve the inversion problem and show the tight connection between both approaches. Last, we give some insights and final remarks on this subject.

Weighted Student Funding (WSF) systems have been implemented in various countries to give schools more autonomy over how to allocate their funding. School principals use funding to maintain school operations and foster innovation for achieving educational goals. However, despite the importance of this process, scholarly research has largely overlooked how principals make decisions about their financial resources. Accordingly, this study seeks to provide practical insights into the strategies used by one school by highlighting their staff’s perceptions about using their WSF to maintain school operations and spur innovation. Using a case study approach, we investigated a principal who effectively used a school’s WSF to transform a failing school into an innovative one. The findings revealed that the principal strategically implemented financial management mechanisms in a way that inspired teachers to deeply consider how a school's WSF can help achieve educational goals. The principal fostered consensus on the school's direction, encouraged innovation through hands-on experiential learning and strategic planning, and facilitated funding for innovative teachers by guiding proposal development. Insights into the shifting cultural and practical landscape of financial resource utilization within schools are discussed.

In this paper we provide amongst others some simple error bounds in approximating the weighted Riemann-Stieltjes integral $\int_{a}^{b}f\left(t\right) g\left(t\right) dv\left(t\right) $ by the use of three points formula \begin{equation*} f\left(b\right) \int_{c}^{b}g\left(s\right) dv\left(s\right) +f\left(a\right) \int_{a}^{d}g\left( s\right) dv\left( s\right) -f\left(x\right) \int_{c}^{d}g\left(t\right) dv\left(t\right) \end{equation*} where $x,$ $c,$ $d\in \left[a,b\right],$ $g,$ $v:\left[a,b\right] \rightarrow \mathbb{C}$ under bounded variation and Lipschitzian assumptions for the function $f$ and such that the involved Riemann-Stieltjes integrals exist.

This study introduces a new discrete distribution which is a weighted version of Poisson-Lindley distribution. The weighted distribution is obtained using the negative binomial weight function and can be fitted to count data with over-dispersion. The p.m.f., p.g.f. and simulation procedure of the new weighted distribution, namely weighted negative binomial Poisson-Lindley (WNBPL), are provided. The maximum likelihood method for parameter estimation is also presented. The WNBPL distribution is fitted to several insurance datasets, and is compared to the Poisson and negative binomial distributions in terms of several statistical tests.

The transformation of the states of polarization of electromagnetic waves that interact with polarimetrically linear media can be represented by means of the associated Mueller matrix. A global measure of the ability of a linear medium to modify the states of polarization of incident waves, due to any combination of enpolarizing, depolarizing and retarding properties, is introduced as a distance of the Mueller matrix to the identity matrix. This new descriptor, called the polarizing power, is applicable to any Mueller matrix and can be expressed as a function of the degree of polarimetric purity and the trace of the Mueller matrix. The graphical representation of the feasible values of the polarizing power provides a general view of its main peculiarities and features. The values of the polarizing power for several typical devices are analyzed.

In this paper after introducing a model of binary data matrix (BDM) for physical parameters of an evolving system (of particles), we develop a Hilbert space as an ambient space to derive induced metric tensor on embedded parametric manifold identified by associated joint probabilities of particles observables (parameters). Parameter manifold assumed as space-like hypersurface evolving along time axis, an approach that resembles 3+1 formalism of ADM and numerical relativity. We show the relation of endowed metric with related density matrix. Identification of system density matrix by this metric tensor, leads to the equivalence of quantum Liouville equation and metric compatibility condition while covariant derivative of metric tensor has been calculated respect to Wick rotated time or spatial coordinates. After deriving a formula for expected energy per particles, we prove the equality of this expected energy with local scalar curvature of related manifold. We show the compatibility of BDM model with Hamilton-Jacobi formalism and canonical forms. On the basis of the model, I derive the Ricci flow like dynamics as the governing dynamics and subsequently derive the action of BDM model and Einstein field equations. Given examples clarify the compatibility of the results with well-known principles such as equipartition energy principle and Landauer’s principle. This model provides a background for geometrization of quantum mechanics compatible with curved manifolds and information geometry. Finally, we conclude a “bit density principle” which predicts the Planck equation, De Broglie wave particle relation, , Beckenstein bound and Bremermann limit.

The present paper discusses a study of a class of Charlier matrix polynomials and its generalized analogue. Certain generating matrix functions, recurrence matrix relations, matrix differential equation, summation formulas and many new results have been discussed for these matrix polynomials. Weisner's group theoretic method is used to obtain matrix generating relations for Charlier matrix polynomials and the details of this method were given in this paper. Finally, we will discuss only briefly the procedure followed.

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

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

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

Prostate cancer (PCa) is the most diagnosed non-cutaneous cancer in men. Despite therapies such as radical prostatectomy, which is considered curative, distant metastases may form resulting in biochemical recurrence (BCR). This study used radiomic features calculated from multi-parametric magnetic resonance imaging (MP-MRI) to evaluate their ability to predict BCR and PCa presence. Data from a total of 279 patients, of which 46 experienced BCR, undergoing MP-MRI prior to surgery were assessed for this study. After surgery, the prostate was sectioned using patient-specific 3D-printed slicing jigs modeled using the T2-weighted imaging (T2WI). Sectioned tissue was stained, digitized, and annotated by a GU-fellowship trained pathologist for cancer presence. Digitized slides and annotations were co-registered to the T2WI and radiomic features were calculated across the whole prostate and cancerous lesions. A tree regression model was fitted to assess the ability of radiomic features to predict BCR, and a tree classification model was fitted with the same radiomic features to classify regions of cancer. We found that 10 radiomic features predict eventual BCR with an AUC of 0.97 and classifying cancer at an accuracy of 89.9%. This study showcases the application for a radiomics-based tool to screen for the presence of prostate cancer and assess patient prognosis, as determined by biochemical recurrence.

Power law relationships, which describe scaling relationships of data, are powerful information theoretic descriptive tools in many empirical contexts, including that of music. Zipf’s law (pink noise) describes the optimum case of a power law relation where observations are exactly inversely proportional to their rank. Descriptions that approximate a pink noise signature can be said to maximize the amount of information in a signal, and is thus suggestive of a richness of an understanding. This information density of pink noise signatures is not, however, necessarily a desirable quality for explanations in general, which, by definition, “flattens out” some data while highlighting others, ideally those most relevant to an interpretation. The privileging of data most relevant to comprehension corresponds to a red noise relationship, as opposed to the pink noise of Zipf’s law or the white noise of a description that highlights nothing in particular. Here, I explore and evaluate this concept of red noise explanations in the form of analyses of three comparable short piano works: Robert Schumann’s “Von fremden Ländern und Menschen” (no.1 from Kinderszenen op. 15, 1838), Frédéric Chopin’s Prelude op. 28 no. 20 (1838-9), and Felix Mendelssohn’s “Venetianisches Gondellied” (no. 6 from Lieder ohne Worte op. 19b, 1829-30).

In this paper, we define Tetranacci and Tetranacci-Lucas matrix sequences and investigate their properties.

Hydrogels can be considered as mimics of extracellular matrix (ECM).Cytoskeleton through integrins is connected with ECM and cytoskeleton tension depends on ECM stiffness.A number of age-related diseases depend on cellular processes related with cytoskeleton function.Some examples of cancer initiation and progression and heart disease in relationship with ECM stiffness has been analysed.Incorporation of rigid particles in ECM can increase ECM stifness and to promote formation of internal residual stresses. Water migration, changes of water binding energy to biomactomolecules, changes of the state of water from tightly bound water to free and loosely bound water changes stiffness of ECM. Risks related with rigid particles incorporation into ECM have been also iscussed.

Cells actively sense differences in topology, matrix elasticity and protein composition of the extracellular microenvironment and adapt their function and morphology. In this study, we focus on the cross-talk between matrix stiffness and protein coating density that regulate morphology and proliferation dynamics of single myocytes. For this, C2C12 myocytes were monitored on L-DOPA functionalized hydrogels of 22 different elasticity and fibronectin density compositions. Static images were recorded and statistically analyzed to determine morphological differences and to identify the optimized extracellular matrix (ECM). Using that information, selected ECMs were used to study the dynamics before and after cell proliferation by statistical comparison of distinct cell states. We observed a fibronectin density independent increase of the projected cell area until 12 kPa. Additionally, changes in the fibronectin density led to an area optimum at about 2.6 μg/cm, which was confirmed by an independent F-actin analysis, revealing a maximum actin filament to cell area ratio of 7.5 %. The proliferation evaluation showed an opposite correlation between cell spreading duration and speed to the matrix elasticity and protein density, which did not affect the cell cycle duration. In summary, we identified an optimized ECM composition, while independent matrix properties regulate distinct cell characteristics.

Background and Objectives: The existing recommendations for female pelvic magnetic susceptibility weighted imaging MRI (FP-SWI) have not been optimized to capture the disease characteristics of the female pelvis. Therefore, it is imperative to explore acquisition parameters before conducting larger-scale studies. To establish optimized flip angle (FA) for acquiring FP-SWI to improve the image quality of female pelvic lesion sites. Materials and Methods: To evaluate signal quality and lesion conspicuity, regions of interest (ROIs) were manually drawn within the lesion on SWI sequences. Signal intensity was measured within the ROIs. Additionally, signal-to-noise ratio (SNR) and contrast-to-noise ratio (CNR) were calculated for SWI sequences acquired at three FA: 10°, 15°, and 20°. Finally, a qualitative assessment of anatomical detail visualization, geometric distortion extent, artifacts, and lesion clarity was performed using a four-point scale. The Wilcoxon rank sum test was employed to compare the qualitative evaluation parameters. The intra-class correlation coefficient (ICC) was calculated to determine the consistency of subjective ratings between two observers. Results: FA=10° showed significantly higher SNR than FA=15° and 20° in most anatomical regions (P&lt;0.05), while the CNR was significantly higher than FA=15° and 20° (P&lt;0.05). Compared with FA=15° and 20°, the image quality of FA=10° was significantly higher, with less distortion and ghosting, and better image contrast (P&lt;0.05). Lesions with FA=10° exhibited higher clarity compared to FA=15° and 20° (P&lt;0.05). Conclusions: The image quality of FP-SWI images at FA=10° exceeds that at FA=15° and 20°. We recommend that when conducting SWI examination of the female pelvic cavity, the FA value should be set at 10° to stabilize the SWI sequence and improve image quality.

We investigate \texorpdfstring{$L_2$}{}-approximation problems in the worst case setting in the weighted Hilbert spaces \texorpdfstring{$H(K_{R_{d,\a,\g}})$}{} with weights \texorpdfstring{$R_{d,\a,{\bm \ga}}$}{} under parameters \texorpdfstring{$1\ge \ga_1\ge \ga_2\ge \cdots\ge 0$ and $1<\az_1\le \az_2\le \cdots$}{}. Several interesting weighted Hilbert spaces \texorpdfstring{$H(K_{R_{d,\a,\g}})$}{} appear in this paper. We consider the worst case error of algorithms that use finitely many arbitrary continuous linear functionals. Multivariate approximation; information complexity; tractability; weighted Hilbert spacesWe discuss tractability of \texorpdfstring{$L_2$}{}-approximation problems for the involved Hilbert spaces, which describes how the information complexity depends on \texorpdfstring{$d$}{} and \texorpdfstring{$\va^{-1}$}{}. As a consequence we study the strongly polynomial tractability (SPT), polynomial tractability (PT), weak tractability (WT), and \texorpdfstring{$(t_1,t_2)$}{}-weak tractability (\texorpdfstring{$(t_1,t_2)$}{}-WT) for all \texorpdfstring{$t_1>1$}{} and \texorpdfstring{$t_2>0$}{} in terms of the introduced weights under the absolute error criterion or the normalized error criterion.

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.

Bonchev and Trinajstic defined two distance based entropy measures to measure the molecular branching of molecular graphs in 1977 [Information theory, distance matrix, and molecular branching, J. Chem. Phys., 38 (1977), 4517–4533]. In this paper we use these entropy measures which are based on distance matrices of graphs. The first one is based on distribution of distances in distance matrix and the second one is based on distribution of distances in upper triangular submatrix. We obtain the two entropy measures of paths, stars, complete graphs, cycles and complete bipartite graphs. Finally we obtain the minimal trees with respect to these entropy measures with fixed diameter.

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.

Background. To describe the characteristics of anterior mediastinal masses on conventional magnetic resonance imaging (MRI) and to assess the role of the Apparent Diffusion Coefficient (ADC) value in distinguishing benign from malignant mediastinal lesions. Methods. We conducted a retrospective cross-sectional study on 55 patients with anterior mediastinal mass who performed MRI before treatment. Biopsy and histopathological assessments were done after that. A radiologist evaluates the changes of signal intensity on these sequences: T1- weighted VIBE DIXON pre and post-contrast with Gadolinium, T2 HASTE, T2 TIRM, DWI/ADC, to determine the size, margin of the lesion, the presence of fat, cystic in it. ADCs values were calculated from the ADC maps which were constructed from b = 0 and b = 2000 Results. The study was composed of 55 patients, with 5 benign lesions and 50 malignant lesions. The ADCmean, ADCmedian, ADC10, and ADC90 in the histogram-based approach and hot-spot-ROI-based mean ADC for the malignant lesions was significantly lower than those found in benign lesions (P-value <0.05). The hot-spot-ROI-based mean ADC had the highest value in differentiation between benign and malignant mediastinal lesions, between group A (benign lesions, thymoma A, AB, B1) and group B (thymoma B2, B3 and other malignant lesions). The cut-off point of the ADC value differentiating malignant from benign mediastinal lesions was 1,17x10-3mm2/s with sensitivity of 80%, and specificity of 80%. The cut off point of the ADC value differentiating group A from group B was 0.99 x10-3mm2/s with sensitivity of 78,4%, and specificity of 88.9%. The cut-off point of the ADC value differentiating lymphoma from other malignant lesions was 0,91 x10-3mm2/s with sensitivity of 100%, and specificity of 60.5%. Conclusion. Diffusion-weighted MRI and measurement of ADC value in histogram-based approach and hot-spot-ROI-based mean ADC are very helpful in the differentiation between benign and malignant anterior mediastinal lesions.

Matrix metalloproteinases (MMPs) have been demonstrated to have both detrimental and protective functions in inflammatory diseases. Several MMP inhibitors, with the exception of Periostat®, have failed in Phase III clinical trials. As an alternative strategy, recent efforts have been focussed on the development of more selective inhibitors or targeting other domains than their active sites (e.g., exosites, ectosites) through specific small molecule inhibitors or monoclonal antibodies. Here, we present some examples that aim to better understand the mechanisms of conformational changes/allosteric control of MMPs functions. In addition to MMP inhibitors, we discuss unbiased global approaches such as proteomics and N-terminomics to identify new MMP substrates and achieve a better understanding of the roles of these proteases in diseases.

Artistic image completion is fundamental for the preservation and restoration of invaluable art paintings and it has experienced significant progress through the implementation of deep learning methodologies. Despite these advancements, challenges persist, even with sophisticated approaches like Generative Adversarial Networks (GANs), particularly in achieving optimal results for high-resolution paintings. Small-scale texture synthesis and the inference of missing information from distant contexts present persistent issues, leading to distortions in lines and unnatural colors, especially in art paintings with complicated structures and textures. Concurrently, patch-based image synthesis has evolved by incorporating global optimization on the image pyramid to enhance structural coherence and details. However, methods relying on gradient-based synthesis encounter obstacles related to directionality, inconsistency, and the heavy computational burdens associated with solving the Poisson equation in non-integrable gradient fields. This paper introduces a groundbreaking approach, integrating Weighted Similarity-Confidence Laplacian Synthesis, to comprehensively address these challenges and advance the field of artistic image completion. This proposal addresses challenges not only in high-resolution artistic image completion but also makes a significant contribution to the broader field of patch-based synthesis by utilizing the Laplacian pyramid for enhanced edge-aware correspondence search. Experimental result confirms the effectiveness of our approach, offering promising outcomes for the preservation and restoration of art paintings with complicated details and irregular missing regions.

One of the most important applications in the wireless sensor networks (WSN) is to classify mobile targets in the monitoring area. In this paper, a multi-DBN weighted voting classification algorithm is proposed on the basis of the Deep Belief Network (DBN) classifier and combined with the idea of voting method, which is implemented on the nodes of the WSN monitoring system by means of "upper training, lower transplantation" appraoch. The performance of the algorithm is verified by using real-world experimental data, and the results show that the proposed method has a higher accuracy in classifying the target signal features, achieving an average classification accuracy of 84.63% across four different types of moving targets. The experiment reveals that the multi-DBN weighted voting algorithm enhances the target classification accuracy by approximately 5% in comparison to the single DBN classifier, but the memory and computation time required for the algorithm to run are also increased at the same time. Compared to the FFNN classifier, which exhibited the highest classification accuracy among the four selected methods, the algorithm achieves an improvement of approximately 8.8% in classification accuracy. However, it incurs greater time overhead to run.

The assessment outcomes of regional susceptibility to geological disasters can directly indicate the extent and intensity of risks within the study area, thus, providing targeted guidance for disaster management efforts. This study selects eight evaluation indicators, namely elevation, gradient, terrain relief, lithology of strata, normalized difference vegetation index, distance from the fault, distance from road, and distance from the river. The study focuses on Huize County in Yunnan Province as the research area, utilizing the certainty factor (CF) and random forest (RF) models for evaluating the susceptibility to geological disasters. The non-geological disaster points in the study area are determined using the deterministic coefficient prior model, and the deterministic coefficient values for each evaluation factor serve as the classification data for the random forest model. The optimal parameters for the random forest are selected through iterative calculations of bag error in PyCharm, while the weight of the evaluation factor is determined based on the ran-dom forest model with the optimal parameters. The results of geological disaster susceptibility zoning in Huize County are obtained by overlaying the weighted deterministic coefficients of each evaluation factor. The accuracy of the evaluation results is verified using zoning statistics and ROC curves with a test sample of 30% of the points. The results demonstrate the high accuracy of the model in evaluating the susceptibility to geological disasters in Huize County. Compared to the single deterministic coefficient model, this approach offers advantages in terms of reliability and accuracy. The evaluation results can serve as a scientific reference for related work in Huize County.

The airport ground handling services (AGHS) equipment supplier selection problem involves a safety guarantee on the part of the AGHS company that carries out the daily work. AGHS company can prevent aircraft damage and delays in airlines schedules, and ensure reliable and high-quality ground handling service. In our research, we developed an AGHS equipment supplier selection model based on the analytic hierarchy process and an AHP weighted fuzzy linear programming approach, and we solved the AGHS equipment supplier’s selection problem. The main objective of this article is to create an AHP and AHP-FLP decision model in order to help the AGHS company authorities select the best AGHS equipment supplier. The practical application in AGHS equipment supplier selection decisions can be interpreted as demonstrating that the proposed model provides knowledge and practical value for the AGHS industry.

Tail-biting convolutional codes extend the classical zero-termination convolutional codes: Both encoding schemes force the equality of start and end states, but under the tail-biting each state is a valid termination. This paper proposes a machine-learning approach to improve the state-of-the-art decoding of tail-biting codes, focusing on the widely employed short length regime as in the LTE standard. This standard also includes a CRC code. First, we parameterize the circular Viterbi algorithm, a baseline decoder that exploits the circular nature of the underlying trellis. An ensemble combines multiple such weighted decoders, each decoder specializes in decoding words from a specific region of the channel words' distribution. A region corresponds to a subset of termination states; the ensemble covers the entire states space. A non-learnable gating satisfies two goals: it filters easily decoded words and mitigates the overhead of executing multiple weighted decoders. The CRC criterion is employed to choose only a subset of experts for decoding purpose. Our method achieves FER improvement of up to 0.75dB over the CVA in the waterfall region for multiple code lengths, adding negligible computational complexity compared to the circular Viterbi algorithm in high SNRs.

In this paper, we introduce deboost, a Python library devoted to weighted distance ensembling of predictions for regression and classification tasks. Its backbone resides on the scikit-learn library for default models and data preprocessing functions. It offers flexible choices of models for the ensemble as long as they contain the predict method, like the models available from scikit-learn. deboost is released under the MIT open-source license and can be downloaded from the Python Package Index (PyPI) at https://pypi.org/project/deboost. The source scripts are also available on a GitHub repository at https://github.com/weihao94/DEBoost.

Assume that $f:C\rightarrow \mathbb{R}$ is subadditive (superadditive) and hemi-Lebesgue integrable on $C,$ a cone in the linear space $X$ with $0\in C. $ Then for all $x,$ $y\in C$ and a symmetric Lebesgue integrable and nonnegative function $p:\left[ 0,1\right] \rightarrow \lbrack 0,\infty ),$ \begin{align*} \frac{1}{2}f\left( x+y\right) \int_{0}^{1}p\left( t\right) dt& \leq \left( \geq \right) \int_{0}^{1}p\left( t\right) f\left( \left( 1-t\right) x+ty\right) dt \\ & \leq \left( \geq \right) \int_{0}^{1}p\left( t\right) f\left( tx\right) dt+\int_{0}^{1}p\left( t\right) f\left( ty\right) dt. \end{align*} In particular, for $p\equiv 1,$ we have \begin{equation*} \frac{1}{2}f\left( x+y\right) \leq \left( \geq \right) \int_{0}^{1}f\left( \left( 1-t\right) x+ty\right) dt\leq \left( \geq \right) \int_{0}^{1}f\left( tx\right) dt+\int_{0}^{1}f\left( ty\right) dt. \end{equation*} Some particular inequalities related to Jensen's dicrete inequality for convex functions are also given.

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.

Introduced in 1967 by Lov\'{a}sz, graph exponentiation has received little attention over the past several decades. Since graph exponentiation produces large graphs and any graph can be constructed utilizing its adjacency matrix, we provide a four step linear construction algorithm that generates the adjacency matrix for the graph exponential.

Biofilm matrix is akin to bacterial abodes, primarily composed of proteins, polysaccharides, extracellular DNA, and lipids, providing essential structural support to bacteria. While some biofilm matrix offers significant benefits, such as engineered biofilm reactors that assist in water pollutant removal, others pose risks to human health, potentially leading to conditions like lung infections. Realizing the potential of advantageous biofilm matrix and mitigating the harmful effects of detrimental ones necessitates a comprehensive and systematic exploration of this intricate domain. To facilitate this examination, our study leveraged a dataset of the 1000 most pivotal papers in the field and conducted an exhaustive bibliographic review. This paper serves as a valuable resource for understanding the current progress in biofilm matrix research and delving into vital avenues for future exploration in this dynamic field.

We report a theoretical derivation of the Cabibbo-Kobayashi-Maskawa (CKM) matrix parameters and the accompanying mixing angles. These results are arrived at from the exceptional Jordan algebra applied to quark states, and from expressing flavor eigenstates (i.e. left-chiral states) as superposition of mass eigenstates (i.e. the right-chiral states) weighted by square-root of mass. Flavor mixing for quarks is mediated by the square-root mass eigenstates, and the mass ratios used have been derived in earlier work from a left-right symmetric extension of the standard model. This permits a construction of the CKM matrix from first principles. There exist only four normed division algebras, they can be listed as follows - the real numbers $\mathbb{R}$, the complex numbers $\mathbb{C}$, the quaternions $\mathbb{H}$ and the octonions $\mathbb{O}$. The first three algebras are fairly well known; however, octonions as algebra are less studied. Recent research has pointed towards the importance of octonions in the study of high energy physics. Clifford algebras and the standard model are being studied closely. The main advantage of this approach is that the spinor representations of the fundamental fermions can be constructed easily here as the left ideals of the algebra. Also the action of various Spin Groups on these representations too can be studied easily. In this work, we build on some recent advances in the field and try to determine the CKM angles from an algebraic framework. We obtain the mixing angle values as $\theta_{12}=11.093^o, \theta_{13}=0.172^o, \theta_{23}=4.054^o$. In comparison, the corresponding experimentally measured values for these angles are $13.04^o \pm 0.05^o, 0.201^o \pm 0.011^o, 2.38^o \pm 0.06^o $. The agreement of theory with experiment is likely to improve when running of quark masses is taken into account.

Metal matrix composite are used in such fields of technology, such as: aerospace, electronics, energy, industry, defense, automotive, aviation, shipbuilding, and more. Composite coatings of ceramic - metals is used primarily to enhance the durability of machine parts. Therefore, new materials are permanently looked for, what has resulted in the past in development of composite materials. The coatings dispersed are consisting of metallic matrix (metals and their alloys) and small non-metallic particles. The deposition of ceramic particles simultaneously with metallic matrix leads often to composite coatings possessing properties much better than those of metallic coating. The nickel and less often, other iron group elements are usually used as a matrix and Al2O3 as tough particles. The welding technology of applying alloy and composite coatings is widely used. The technology of infrasound thermal spraying of metal matrix composite coatings was presented. It is a simple technology and a very useful one in ship machinery regeneration during the cruise craft (e.g. internal combustion engines, torque pumps, separators). The metal matrix composite coatings must undergo finishing due to high surface roughness after application. In the article to used finishing by plastic working and machining of coatings nickel matrix composite was proposed.

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.