In this work, a modeling technique utilizing the P-Graph framework was used for a case 1 study involving biomass-based local energy production. In recent years, distributed energy systems 2 gained attention. These systems aim at satisfying energy supply demands, supporting the local 3 economy, decreasing transportation needs and dependence on imports, and in general obtaining a 4 more sustainable energy production process. Designing such systems is a challenge, for which novel 5 optimization approaches were developed to help decision-making. Previous work used the P-Graph 6 framework to optimize energy production in a small rural area, involving manure, intercrops, grass, 7 and corn silage as inputs, and fermenters. Biogas is produced in fermenters, and Combined Heat 8 and Power (CHP) plants provide heat and electricity. A more recent result introduced the concept of 9 operations with flexible inputs in the P-Graph framework. In this work, the concept of flexible inputs 10 was applied to model fermenters in the original case study. A new implementation of the original 11 decision problem was made both as a Mixed-Integer Linear Programming (MILP) model and as a 12 purely P-Graph model by using the flexible input technique. Both approaches provided the same 13 optimal solution, with a 31% larger profit than originally reported.

It is difficult to effectively operate a dual-arm robot using only the information written in a cooking recipe. To cope with this problem, this paper proposes a graph based approach on bimanual cooking motion planning from a cooking recipe. In our approach, we first decompose the cooking recipe into graph elements. Then, we try to connect the graph elements taking into account the attributes of the input/output nodes. If two graph elements cannot be connected each other, we search for a graph element that can be inserted between them from the database of graph elements. Since the constructed graph includes the whole sequence of the robot’s motions to perform the cooking task, we can generate a task sequence of a dual-arm manipulator simultaneously performing two different tasks by using two arms. Through experimental study, we show that it is possible to generate robot motions from a cooking recipe and perform the cooking motions while simultaneously moving the left and right arms.

Graph coloring is a manifestation of graph partitioning, wherein, a graph is partitioned based on the adjacency of its elements. Partitioning serves potentially as a compartmentalization for any structural problem. Vertex coloring is the heart of the problem which is to find the chromatic number of a graph. The fact that there is no general efficient solution to this problem that may work unequivocally for all graphs opens up the realistic scope for combinatorial optimization algorithms to be invoked. The algorithmic complexity of graph coloring is non-deterministic in polynomial time (NP) and hard. To the best of our knowledge, there is no algorithm as yet that procures an exact solution of the chromatic number comprehensively for any and all graphs within the polynomial (P) time domain. However, several heuristics as well as some approximation algorithms have been attempted to obtain an approximate solution for the same. Here, we present a novel heuristic, namely, the 'trailing path', which returns an approximate solution of the chromatic number within polynomial time, and, with a better accuracy than most existing algorithms. The ‘trailing path’ algorithm is effectively a subtle combination of the search patterns of two existing heuristics (DSATUR and Largest First), and, operates along a trailing path of consecutively connected nodes (and thereby effectively maps to the problem of finding spanning tree(s) of the graph) during the entire course of coloring, where essentially lies both the novelty and the apt of the current approach. The study also suggests that the judicious implementation of randomness is one of the keys towards rendering an improved accuracy in such combinatorial optimization algorithms. Apart from the algorithmic attributes, essential properties of graph partitioning in random and different structured networks have also been surveyed, followed by a comparative study. The study reveals the remarkable stability and absorptive property of chromatic number across a wide array of graphs. Finally, a case study is presented to demonstrate the potential use of graph coloring in protein design – yet another hard problem in structural and evolutionary biology.

Based on the Graph Model of Conflict Resolution (GMCR), a two-stage decision framework is developed to reveal the essence of brownfield incidents and facilitate the resolution of brownfield conflicts caused by the incidents. More particularly, the forward GMCR is utilized in Stage I, the negotiation stage, to simulate the evolution of a brownfield conflict (BC) and predict its potential resolution via stability analysis. If no acceptable equilibrium can be obtained, the BC progresses into Stage II, the third-party-intervention stage, where the inverse GMCR is used to assist a third party in intervening the conflict to achieve a desirable outcome. To illustrate the practicality of this framework, a recent BC occurred in Changzhou, China, is taken as a case study. Invaluable insights are provided through the computation and investigation of the corresponding preference relationships.

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

In this work, magnetic CuFe₂O₄/Ag nanoparticles activated by porous covalent organic frameworks (COF) was fabricated to evaluate the heterogenous reduction of 4-nitrophenol (4-NP). The core-shell CuFe₂O₄/Ag@COF was successfully prepared by polydopamine reduction of silver ions on CuFe₂O₄ nanoparticles, followed by COF layer condensation. With integrating the intrinsic characteristics of the magnetic CuFe₂O₄/Ag core and COF layer, the obtained nanocomposite exhibited features of high specific surface area (464.21 m² g^-1), ordered mesoporous structure, strong environment stability, as well as fast magnetic response. Accordingly, the CuFe₂O₄/Ag@COF catalyst showed good affinity towards 4-NP via π-π stacking interactions and possessed enhanced catalytic activity compared with CuFe₂O₄/Ag and CuFe₂O₄@COF. The pseudo-first-order rate constant of CuFe₂O₄/Ag@COF (0.77 min^-1) is 3 and 5 times higher than CuFe₂O₄/Ag and CuFe₂O₄@COF, respectively. The characteristics of bi-catalytic CuFe₂O₄/Ag and the porous COF shell of CuFe₂O₄/Ag@COF made a contribution to improve the activity of 4-NP reduction. The present work demonstrated a facile strategy to fabricate COF activated nano-catalysts with enhanced performance in the fields of nitrophenolic wastewater treatment.

The paper illustrates a general framework in which a neural network application can be easily integrated and proposes a traffic forecasting approach that uses neural networks based on graphs. The method minimizes the communication network (between vehicles and the database servers) load and represents a reasonable trade-off between communication network load and forecasting accuracy. Traffic prediction leads to the choice of less congested routes and therefore to the reduction of energy consumption. The traffic is forecasting using a LTSM neural network with a regression layer. The inputs of the neural network are sequences - obtained from graph that represent the road network - at specific moments of time that are read from traffic sensors or the outputs of neural network (forecasting sequences). The input sequences can be filtered to improve the forecasting accuracy. This general framework is based on Contiki IoT operating system that ensure support for wireless communication and efficient implementation of processes in a resource constrained system and it is particularized to implement a graph neural network. Two cases are studied: one case in which the traffic sensors are periodically read and the other case in which the traffic sensors are read when their values changes are detected. A comparison between the cases is made and the influence of filtering is evaluated. The obtained accuracy is very good, very close to the accuracy obtained in infinite precision simulation, and the computation time is low enough and the system can work in real time.

The fusion of machine learning, biomedical, and bioengineering research offers novel ways to understand, diagnose, and treat various health conditions. However, the complexities of biomedical and bioengineering data, coupled with the intricate process of developing and deploying machine learning solutions, often pose significant challenges to researchers in these fields. We introduce a new Automatic Semantic Machine Learning Microservice Framework (AIMS) that addresses these challenges by automating key aspects of the machine learning pipeline, from data preprocessing to model evaluation. Our proposed framework emphasizes model interpretability, the integration of domain knowledge, and the efficient handling of biomedical data. Furthermore, it incorporates self-supervised knowledge learning strategies, enabling the automatic generation, optimization, and continuous adaptation of machine learning models in response to new tasks and data. We illustrate the potential of our framework through three case studies in biomedical research, showcasing its capacity to streamline research processes, improve scientific exploration quality, and provide a foundation for significant breakthroughs.

Activities of daily living (ADLs) are fundamental routine tasks that the majority of physically and mentally healthy people can independently execute. In this paper, we present a Semantic Framework for detecting problems in ADLs execution, monitored through Smart Home sensors. In the context of this work, we conducted a pilot study, gathering raw data from various sensors and devices installed in a smart home environment. The proposed Framework combines multiple Semantic Web technologies (i.e. ontology, RDF, triplestore) to handle and transform these raw data into meaningful representations forming a Knowledge Graph. Subsequently, SPARQL queries are used to define and construct explicit rules to detect problematic behaviours in ADLs execution, a procedure that leads to generating new implicit knowledge. Finally, all available results are visualized in a clinician dashboard. The proposed framework can monitor the deterioration of ADLs performance for people in the spectrum of dementia, by offering a comprehensive way for clinicians to describe problematic behaviors in the every-day life of an individual.

High rates of phosphorus (P) currently being applied to soils for the production of vegetables in the Mekong Delta, Vietnam has led to the concern of its negative effect on the economics and the environment. This research presents a comprehensive study on the determination of P supplying capacity in this region of Vietnam to examine the possibility of reducing P fertilizer input. One hundred twenty (120) soil samples were collected to evaluate total P and Bray 1 available P in the soils. Phosphorus maximum sorption, degree of P saturation, P release, and the effect of P fertilizer on corn (Zea mays L.) yield in greenhouse and fields were also determined. Total P concentrations of 56.7% soil samples evaluated yielded high P concentrations (>560 mg P/kg), while 74.2% of the samples had high Bray 1 available P concentrations (>20 mg P/kg soil). Maximum P sorption ranged from 149 to 555 mg P/kg soil, respectively and has negative correlation to available P (r = - 0.63*), degrees of P saturation ranged from 0.63 to 5.46% correlated to available P (r = 0.98**) and maximum P release ranged from 1.2 to 61.9 mg P/kg soil, respectively correlated to available P (r = 0.96**). Corn grown in soils with available P concentrations >15 mg P/kg did not respond to P fertilizer in greenhouse or field experiments. We conclude that many farmers in this region can reduce P fertilizer input, thus increasing their profits and reducing negative environmental impacts associated with excess soil P for sustainable agriculture.

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.

There has been a great deal of research in the area of using graph engines and graph databases to model network traffic and network attacks, but the novelty of this research lies in visually or graphically representing the Reconnaissance Tactic (TA0043) of the MITRE ATT&CK framework. Using the newly created dataset, UWF-Zeekdata22, based on the MITRE ATT&CK framework, patterns involving network connectivity, connection duration, and data volume were found and loaded into a graph environment. Patterns were also found in the graphed data that match the Reconnaissance as well as other tactics captured by UWF-Zeekdata22. The Star motif was particularly useful in mapping the Reconnaissance tactic. The results of this paper show that graph databases/graph engines can be essential tools for understanding network traffic and trying to detect network intrusions before they happen. Finally, an analysis of the run-time performance of the reduced dataset used to create the graph databases showed that the reduced datasets performed better than the full dataset.

We revise the definition of graph operations in [WDK2018] and adapt correspondingly the construction of graph term algebras. As a first contribution to a prospective research field Universal Graph Algebra, we generalize some basic concepts and results from algebras to graph algebras. To tackle this generalization task, we revise and reformulate traditional set-theoretic definitions, constructions and proofs in Universal Algebra by means of more category-theoretic concepts and constructions. Especially, we generalize the concept generated subalgebra and prove that all monomorphic homomorphisms between graph algebras are regular. Derived graph operations are the other main topic. After an in depth analysis of terms as representations of derived operations in traditional algebras, we identify three basic mechanisms to construct new graph operations out of given ones: parallel composition, instantiation, and sequential composition. As a counterpart of terms, we introduce graph operation expressions with a structure as close as possible to the structure of terms. We show that the three mechanisms allow us to construct for any graph operation expression a corresponding derived graph operation in any graph algebra.

Sewage sludge is an organic waste generated in waste-water treatment plants with certain content of nutrients, what may potentially be used as a source of slow release fertilizer, especially as phosphorus (P) source, but it demands some pre-treatment and the content of P is much lower compared to soluble mineral fertilizers. For these reasons, composted sewage sludge was used to manufacture pelletized organomineral fertilizers, mixing it with the inorganic sources monoammonium phosphate (MAP) and AshDec® (ASD) (thermochemically incinerated sewage sludge). The fertilizers were physiochemically characterized and evaluated as to the dynamics of soil P solubilization, and the forms of P remaining according to its lability. The sources evaluated were: organic compost of sewage sludge powder (SSC), pelletized SSC (SCP), pelletized organominerals SSC+MAP (S+MAP) and SSC+ASD (S+ASD), ASD alone, all compared to a soluble mineral fertilizer (MAP), and a control without P fertilizer. A test was conducted in leaching columns with 50 g of soil (Oxisol), where the fertilizers were applied at a dose of 100 mg P/column, and 30 mL of water or 2% citric acid were added daily for 30 consecutive days. The collected leachates had pH measured and P content determined. Pelletizing process resulted in denser products and promoted more gradual P release. The organomineral S+MAP was the most water-soluble recycled source, solubilizing about 70% of the total P, while the others presented much lower solubilization (<20%). In contrast, all fertilizers showed high solubility in 2% citric acid (except for S+ASD). After leaching, the greatest amount of P remaining in the soil as labile and moderately labile. Composting and the AshDec process produced materials with slow P solubilization, which would be favoured to solubilize in acidic soils and acidic rhizosphere conditions. In turn, the organomineral mixture of SSC with a highly soluble mineral fertilizer (MAP) resulted in a promising product with intermediate nutrient solubility, better synchronized with crop demand, thus increasing efficiency in P use.

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 commonly-used large-scale knowledge bases have been facing challenges in open domain question answering tasks which are caused by the loose knowledge association and weak structural logic of triplet-based knowledge. To find a way out of this dilemma, this work proposes a novel metaknowledge enhanced approach for open domain question answering. We design an automatic approach to extract metaknowledge and build metaknowledge network from Wiki documents. For the purpose of representing the directional weighted graph with hierarchical and semantic features, we present an original graph encoder GE4MK to model the metaknowledge network. Then a metaknowledge enhanced graph reasoning model MEGr-Net is proposed for question answering, which aggregates both relational and neighboring interactions comparing with R-GCN and GAT. Experiments have proved the improvement of metaknowledge over main-stream triplet-based knowledge. We have found that the graph reasoning models and pre-trained language models also have influences on the metaknowledge enhanced question answering approaches.

Everyday place descriptions provide a rich source of knowledge about places and their relative locations. This research proposes a place graph model for modeling this spatial, non-spatial, and contextual knowledge from place descriptions. The model extends a prior place graph, and overcomes a number of limitations. The model is implemented using the Neo4j graph database, and a management system has also been developed that allows operations including querying, mapping, and visualizing the stored knowledge in an extended place graph. Then three experimental tasks, namely georeferencing, reasoning, and querying, are selected to demonstrate the superiority of the extended model.

The Randić index of a graph G is the sum of (dG(u)dG(v))−1/2 over all edges uv of G, where dG(u) denotes the degree of vertex u in G. In this paper, we investigate a few graph transformations that decrease Randić index of graph. By applying those transformations, we determine the minimum Randić index on tricyclic graphs, and characterize the corresponding extremal graphs.

In this paper, we introduce the (ρ,q)-analogue of the p-adic factorial function. By utilizing some properties of (ρ,q)-numbers, we obtain several new and interesting identities and formulas. We then construct the p-adic (ρ,q)-gamma function by means of the mentioned factorial function. We investigate several properties and relationships belonging to the foregoing gamma function, some of which are given for the case p = 2. We also derive more representations of the p-adic (ρ,q)-gamma function in general case. Moreover, we consider the p-adic (ρ,q)-Euler constant derived from the derivation of p-adic (ρ,q)-gamma function at x = 1. Furthermore, we provide a limit representation of aforementioned Euler constant based on (ρ,q)-numbers. Finally, we consider (ρ,q)-extension of the p-adic beta function via the p-adic (ρ,q)-gamma function and we then investigate various formulas and identities.

In this paper, we introduce a new class of $(p,q)$-analogue type of Fubini numbers and polynomials and investigate some properties of these polynomials. We establish summation formulas of these polynomials by summation techniques series. Furthermore, we consider some relationships for $(p,q)$-Fubini polynomials associated with $(p,q)$-Bernoulli polynomials, $(p,q)$-Euler polynomials and $(p,q)$-Genocchi polynomials and $(p,q)$-Stirling numbers of the second kind.

The graph model enables a broad range of analysis, thus graph processing is an invaluable tool in data analytics. At the heart of every graph processing system lies a concurrent graph data structure that stores the graph. Such a data structure needs to be highly efficient for both graph algorithms and queries. Due to the continuous evolution, the sparsity, and the scale-free nature of real-world graphs, graph processing systems face the challenge of providing an appropriate graph data structure that enables both fast analytical workloads and low-memory fast graph mutations. Existing graph structures offer a hard tradeoff between read-only performance, update friendliness, and memory consumption upon updates. In this paper, we introduce CSR++, a new graph data structure that removes these tradeoffs and enables both fast read-only analytics and quick and memory-friendly mutations. CSR++ combines ideas from CSR, the fastest read-only data structure, and adjacency lists to achieve the best of both worlds. We compare CSR++ to CSR, adjacency lists from the Boost Graph Library, as well as state-of-the-art update-friendly graph structures: LLAMA, STINGER, GraphOne, and Teseo. In our evaluation, which is based on popular graph processing algorithms executed over real-world graphs, we show that CSR++ remains close to CSR in read-only concurrent performance (within 10% on average), while significantly outperforming CSR (by an order of magnitude) and LLAMA (by almost 2×) with frequent updates. We also show that both CSR++’s update throughput and analytics performance exceed that of several state-of-the-art graph structures, while maintaining low memory consumption when the workload includes updates.

Link prediction is to complete the missing links in the network or to predict the generation of new links according to the current network structure information, which is very important for mining and analyzing the evolution of the network such for construction and analysis of logical architecture in 6G network. Link prediction algorithms based on node similarity need predefined similarity functions, which is highly hypothetical and only applies to specific network structures without generality. To solve this problem, this paper proposes a link prediction algorithm based on the subgraph of the target node pair. In order to automatically learn the graph structure characteristics, the algorithm firstly extracts the h-hop subgraph of the target node pair, and then predicts whether the target node pair will be linked according to the subgraph. Experiments on seven real data sets show that the link prediction algorithm based on target node pair subgraph is suitable for various network structures and superior to other link prediction algorithms.

This paper describes a polynomial time algorithm for solving graph isomorphism and automorphism. We introduce a new tree data structure called Walk Length Tree. We show that such tree can be both constructed and compared with another in polynomial time. We prove that graph isomorphism and automorphism can be solved in polynomial time using Walk Length Trees.

Molecular descriptors are essential in mathematical chemistry for studying quantitative structure-property relationships (QSPR), and topological indices are a valuable source of information about molecular properties such as size, cyclicity, branching degree, and symmetry. Graph theory has played a crucial role in the development of topological indices and dominating parameters for molecular descriptors. The molecule graph, under graph isomorphism conditions, represents an invariant number, and the graph theory approach considers dominating sets, which are subsets of the vertex set where every vertex outside the set is adjacent to at least one vertex inside the set. The dominating sigma index, a topological index that incorporates the mathematical principles of domination topological indices and the sigma index, is applicable to some families of graphs, such as book graphs, windmill graphs, and some graph operations, which have exact values for this new index. To evaluate the effectiveness of the domination sigma index in QSPR studies, a comparative analysis was conducted to establish an appropriate domination index that correlates with the physicochemical properties of octane and its isomers. Linear and non-linear models were developed using the QSPR approach to predict the properties of interest, and the results showed that both the domination forgotten and domination first Zagreb indices exhibited satisfactory performance in comparison testing. Further research into QSAR/QSPR domination indices is required to build more robust models for predicting the physicochemical properties of organic compounds while maintaining the importance of symmetry.

Existing Knowledge Graph (KG) models for commonsense question answering present two challenges: (i) existing methods retrieved entities related to questions from the knowledge graph, which may extract noise and irrelevant nodes, and (ii) lack of interaction representation between questions and graph entities. However, current methods mainly focus on retrieving relevant entities with some noisy and irrelevant nodes. In this paper, we propose a novel Retrieval-augmented Knowledge Graph (RAKG) model, which solves the above issues through two key innovations. First, we leverage the density matrix to make the model reason along the corrected knowledge path and extract an enhanced knowledge graph subgraph. Second, we fuse representations of questions and graph entities through a bidirectional attention strategy, in which two representations fuse and update by Graph Convolutional Network (GCN). To evaluate the performance of our method, we conduct experiments on two widely-used benchmark datasets CommonsenseQA and OpenBookQA. The case study gives insight into findings that the augmented subgraph provides reasoning along the corrected knowledge path for question answering.

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

In considering knowledge graphs in a diverse range of domains of interest, graph neural networks have demonstrated significant improvements in node classification and prediction when applied to graph representation with learning node embedding to effectively represent hierarchical properties of graphs. DiffPool is a deep-learning approach using a differentiable graph pooling technique that generates hierarchical representations of graphs. In operation DiffPool is a differentiable graph pooling technique that generates hierarchical representations of graphs. DiffPool learns a differentiable soft cluster assignment for nodes at each layer of a deep graph neural network with nodes mapped sets of clusters. However, control of the learning process is difficult given the complexity and large number of parameters on an `end-to-end’ model. To address this difficulty we propose an novel approach termed FPool which is predicated on the basic approach adopted in DiffPool (where pooling is applied directly to node representations). Methods designed to enhance data classification have been developed and evaluated using a number popular and publicly available sensor data sets. Experimental results for FPool demonstrate improved classification and prediction performance when compared to alternative methods. Moreover, FPool shows an important reduction in the training time over the basic DiffPool framework.

Metabolic pathways provide key information to achieve a better understanding of life and all its processes; this is useful information for the improvement of medicine, agronomy, pharmacy, and other similar areas. The main analysis tool used to study these pathways is based on the idea of pathway comparison, using graph data structures. Metabolic pathway comparison has been defined as a computationally complex task \cite{ay2011submap,abaka2013campways}. In previous work from 2017, two different approaches that simplify the problem of comparing pathways represented as graphs were introduced. The first algorithm consists of the transformation of a two-dimensional graph structure, representing a metabolic pathway, to a one-dimensional structure and thus aligning the corresponding data using a reduced 1 dimension string. The second algorithm consists of performing a paired analysis between reactions in pathways and thus eliminating all similarities, finally, showing these differences to the user. The suggestion is to use the information provided by these algorithms as a previous analysis to a deeper, more expensive, comparison tool use. Here we provide an extension of this work with more data and deeper analysis. These methods have shown to be an effective way to treat the problem of metabolic pathway comparison as listed in the discussion and results section. Our results show evidence of a quick, simple and effective way to resolve the described problem.

The species and bio-availability of phosphorus (P) in primary, secondary and digested sludge were fractionated and further analyzed in this study. Results showed that inorganic P (IP) was the primary P fraction in the secondary sludge and digested sludge, in which non-apatite IP (NAIP) amounted to 91.6% and 69.3% of IP, respectively. Organic P (OP), accounting for about 71.7% of total P (TP), was the dominant P composition in primary sludge. The content of bio-available P was about 9.7, 43.4, 29.8 mg-P/g-TS in primary sludge, secondary sludge and digested sludge, respectively, suggesting secondary sludge is the optimal choice when land application of sewage sludge is taken into consideration, followed by digested sludge and primary sludge. Polyphosphate and orthophosphate, comprising approximately 54.3% and 89.2% of TP, was the dominant P species in the secondary sludge and digested sludge, respectively. Monoester-P (54.6% of TP in extract) and diester- P (24.1%) were identified as OP species in primary sludge by Phosphorus-31 nuclear magnetic resonance (31PNMR). The present results would be helpful for P recovery and recycle from sewage sludge in wastewater treatment plant.

Re-shaping of thermodynamics with the graph theory and Ramsey theory is suggested. Maps built of thermodynamic states are addressed. Thermodynamic states may be attainable and non-attainable by the thermodynamic process in the system of constant mass. We address the following question how large should be a graph describing connections between discrete thermodynamic states to guarantee the appearance of thermodynamic cycles? The Ramsey theory supplies the answer to this question. Direct graphs emerging from the chains of irreversible thermodynamic processes are considered. In any complete directed graph, representing the thermodynamic states of the system the Hamiltonian path is found. Transitive thermodynamic tournaments are addressed. The entire transitive thermodynamic tournament built of irreversible processes does not contain a cycle of length 3, or in other words, the transitive thermodynamic tournament is acyclic and contains no directed thermodynamic cycles.

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.

We conducted a comparative study on the development of two synthetic methods. The solvent-free synthesis is a green chemistry method developed in a bid to ameliorate environmental adverse effects of the conventional solvent-based synthesis. The synthesis of novel dichloro and polymethoxy p-nitrophenylhydrazones through solvent free technique gave moderate to high yields which were however lower than those of the solvent-based method. The established solvent-free approach has several benefits, including universality and simplicity of the approach, catalyst-free conditions, non-use of an organic solvent, quick reaction time, fast and efficient workup, and un-solvated pure products in moderate to high yields.

N-(diisopropylphosphanyl)benzamide, PhC(O)NHPiPr2, has been synthesized in good yield following two alternative procedures that employ benzamide as the starting material. The first one is a two-step preparation, in which N-(trimetilsilyl)benzamide is reacted with PiPr2Cl, to give the title compound in good yield, whereas the second one is a straightforward synthesis which converts benzamide into N-(diisopropylphosphanyl)benzamide by reaction with PiPr2Cl in the presence of N,N-dimethylpyridin-4-amine (DMAP) and triethylamine. NMR spectroscopy and X-ray diffraction analyses have been performed to characterize the new compound and elucidate its molecular structure in the solid state. N-(diisopropylphosphanyl)benzamide adds to the limited family of amido-substituted phosphines, RC(O)NHPR’2, which can be classified as bidentate hybrid P,O-ligands, both in their neutral and anionic forms, the latter achievable by deprotonation of the NH group.

With recent advancements in network technology and spread of Internet, use of social network services and Internet of Things devices has flourished, leading to a continuous generation of large volumes of graph stream data, where changes, such as additions or deletions of vertices and edges occur over time. Additionally, owing to the need for efficient use of storage space and security requirements, graph stream data compression has become essential in various applications. Even though various studies on graph compression methods have been conducted, most of them do not fully reflect the dynamic characteristics of graph streams and complexity of large graphs. In this paper, we propose a compression scheme using provenance data to efficiently process and analyze large graph stream data. It obtains provenance data by analyzing graph stream data and builds a pattern dictionary based on this to perform dictionary-based compression. By improving the existing dictionary-based graph compression methods, it enables more efficient dictionary management through tracking pattern changes and evaluating their importance using provenance. Furthermore, it considers the relationships among sub-patterns using an FP-tree and performs pattern dictionary management that updates pattern scores based on time. Our experiments show that the proposed scheme outperforms existing graph compression methods in key performance metrics, such as compression rate and processing time.

The global malaria community has picked up the theme of malaria elimination in greater than 90 % of the world’s population in the next decade. The recent reports of P. vivax in all sub-Saharan Africa, including Duffy negative individuals, threaten the efforts to achieve elimination. This is not only in view of strategies that are tailored only to P. falciparum elimination, but also due to currently revealed biological characteristics of P. vivax concerning the relapse patterns of hypnozoites and conservation of a large biomass at cryptic sites in the bone marrow and spleen. A typical scenario has been observed in Botswana from the period between 2008 to 2018, which palpably projects how P. vivax could endanger efforts at malaria elimination where the two parasites co-exist. The need for the global malaria community, NMPs, funding agencies and relevant stakeholders to engage in a forum to discuss and recommend clear pathways for sub-Saharan Africa regarding malaria elimination including P. vivax, is warranted.

Academic and corporate research has been focusing on analyzing stock performances, financial markets, and investment strategies for decades. According to Lynch and Rothchild (1989), certain investments can be described as plays. In this work, the authors use the term for investments in value stocks, spin-offs, and turnarounds to analyze the long-term stock performance and risk-adjusted excess returns of up to five years for those stocks. Additionally, stocks with a supe-rior return performance are identified within an investment play based on low P/E and P/B mul-tiples. The study finds that value stocks, spin-offs, and turnarounds outperform the S&P 500 on average on a one-, three- and five-year investment horizon. The analysis of the three investment plays confirms earlier studies that investment plays constitute a profitable investment opportunity. Moreover, the research exemplifies that private investors could achieve an excess return (alpha) through a passive buy-and-hold investment strategy. Overall, the analysis provides a deeper in-sight into the long-term performance of value stocks, spin-offs, and turnarounds.

Application of the Ramsey Theory to the set of the points placed in the plane is discussed. Consider a set of N points located in the same plane. The straight lines connecting these points are yikx=αikx+βik i,k=1...N. Listed below values of slopes αik are possible: αik>0; αik=0; αik is not defined; αik<0. Following coloring procedure is introduced: we connect the pairs of points for which αik>0, αik=0 or αik is not defined, with the red links, and the pairs of points for which αik<0 place with green links. The suggested coloring procedure enables building of the complete bi-colored graph for any set containing N points located in the same plane. We apply the Ramsey theorem to the complete graph emerging from the suggested coloring. For the set containing N=6 points at least one monochromatic triangle will necessarily appear in the graph. The values of the slopes αik depend on the chosen coordinate system. The rotation of coordinate axes changes the coloring of the graph; however, at least one monochromatic triangle will be present for N=6. The introduced coloring procedure diminishes the order of the symmetry group of the regular hexagon, irrespectively to the orientation of the coordinate axes. We hypothesized that this will be true for arbitrary regular n-polygon, independently on the orientation of coordinate axes. The inverse bi-color Ramsey graphs arise, when we replace red links appearing in the source graph with red ones, and vice versa. The total number of triangles in the “direct” and “inverse” Ramsey graphs is the same. We considered the particular case of the set of points for which αik>0 or αik<0 is true in the given coordinates. In this particular case, the rotation of the Cartesian coordinate axes to the angle θ=π2 yields the inverse complete graph. Generalization of this coloring for an arbitrary number and arbitrary location of the source points is introduced.

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.

With the growth of air traffic demand in busy airspace, there is an urgent need for airspace sectorization to increase air traffic throughput and ease the pressure on controllers. The purpose of this paper is to develop a method framework that can perform airspace sectorization automatically, reasonably, which can be used as an advisory tool for controllers as an automatic system, especially for eliminating irregular sector shapes generated by simulated annealing algorithm (SAA) based on region growth method. Two graph cutting method, dynamic Monte Carlo method by changing location of flexible vertices (MC-CLFV) and Monte Carlo method by radius changing (MC-RC) were developed to eliminating irregular sector shapes generated by SAA in post-processing. The experimental results show that the proposed method framework of AS can automatically and reasonably generate sector design schemes that meet the design criteria. Our methodology framework and software can provide assistant design and analysis tools for airspace planners to design airspace, improve the reliability and efficiency of airspace design, and reduce the burden of airspace planners. In addition, this lays the foundation for reconstructing airspace with more intelligent method.

In this paper, various Ni-P composite coatings containing toner, MoS2, and nano-SiO2 particles were deposited on steel substrates by the electroless method. Then, the electrochemical properties of these coatings after a heat treatment process were compared. The microstructural evaluations were also done by using the optical and electron microscopy methods. Both Tafel polarization and electrochemical impedance spectroscopy techniques were utilized to survey the electrochemical behavior of such coatings. The surface morphology of all coatings contained cauliflower-like nodules. The X-ray diffraction patterns showed the crystalline phases of Ni and Ni3P for all coatings after the heat-treatment step. Obtained results showed that all composite coatings exhibited lower corrosion rates with respect to Ni-P coatings. Such a reduction was about 21.6-92.2%. This behavior was attributed to the presence of reinforcement as barriers for corrosive ion diffusion through the coating plus the changes in detected phases and thickness. Electrochemical impedance spectroscopy test results also demonstrated that the increase in the polarization resistance for composites coatings was about 18.4-85.3% after 1 h immersion in a 0.6M NaCl solution; however, when the immersion time increased to 24 h, such increased resistance changed to 18.1 to 73.1%. Totally, despite the lower deposition rate, the presence of MoS2 and nano-SiO2 particles were more effective than toner particles to raise the corrosion rate of the Ni-P coating.

In this paper, we investigate p-adic q-integral (q-Volkenborn integral) on Z_p of p-adic gamma function via their Mahler expansions. We also derived two q-Volkenborn integrals of p-adic gamma function in terms of q-Daehee polynomials and numbers and q-Daehee polynomials and numbers of the second kind. Moreover, we discover q-Volkenborn integral of the derivative of p-adic gamma function. We acquire the relationship between the p-adic gamma function and Stirling numbers of the first kind. We finally develop a novel and interesting representation for the p-adic Euler constant by means of the q-Daehee polynomials and numbers.

It is known that the class of p-normed spaces (0 < p ≤ 1) is an important generalization of usual normed spaces with rich topological and geometrical structure, but the most of tools and general principles in nature with nonlinearity have not been developed yet, thus the main goal of this paper is to develop tools for nonlinear analysis under the framework of p-vector spaces. In particular, we first develop the general fixed point theorems which provide solutions to answer Schauder conjecture since 1930’s in the affirmative for p-vector spaces when p = 1 (which is just general topological vector spaces); then the one best approximation result for upper semi-continuous mappings is given, which is used as a powerful tool to establish fixed points for non-self set-valued mappings with either inward or outward set conditions; and finally we establish comprehensive existence results of solutions for Birkhoff-Kellogg Problems, and the general principle of nonlinear alternative by including Leray-Schauder alternative and related results. The results given in this paper not only include the corresponding results in the existing literature as special cases, but also expected to be useful tools for the study of nonlinear problems arising from theory to practice.

Traffic congestion and frequent traffic accidents have become main problems affecting urban traffic. Effective location prediction of vehicle trajectory can help alleviate traffic congestion, reduce the occurrence of traffic accidents, and optimize the urban traffic system. Vehicle trajectory is closely related to the surrounding Points of Interest (POI). POI can be considered as the spatial feature and can be fused with trajectory points to improve prediction accuracy. A Local Dynamic Graph Spatiotemporal- Long Short-Term Memory (LDGST-LSTM) is proposed in this paper to extract and fuse the POI knowledge and realize next location prediction. POI semantic information is learned by constructing the traffic knowledge graph, and spatial and temporal features are extracted by combining Graph Attention Network (GAT) and temporal attention mechanism. Moreover, the weights of POI that influence location prediction are visualized to improve the interpretability of the proposed model. The effectiveness of LDGST-LSTM is verified on two datasets, including Chengdu taxi trajectory data in October 2018 and August 2014. The accuracy and robustness of the proposed model are significantly improved compared with the benchmark models.

In bioinformatics research, traditional machine learning methods have demonstrated efficacy in addressing Euclidean data. However, real-world data often encompasses non-Euclidean forms, such as graph data, which contain intricate structural patterns or high-order relationships that elude conventional machine-learning approaches. Representation learning seeks to derive valuable data representations from enhancing predictive or analytic tasks, capturing vital patterns and structures. This method has proven particularly beneficial in bioinformatics and biomedicine, as it effectively handles high-dimensional, sparse data, detects complex biological patterns, and optimizes predictive performance. In recent years, graph representation learning has become a popular research direction. It embeds graphs into a low-dimensional space while preserving the structural and attribute information of the graph, enabling better feature extraction for downstream tasks. This study extensively reviews representation learning advancements, particularly in the research of representation methods since the emergence of COVID-19. We begin with an analysis and classification of neural network-based language model representation learning techniques as well as graph representation learning methods. Subsequently, we explore their methodological innovations in the context of COVID-19, with a focus on the domains of drugs, public health, and healthcare. Furthermore, we discuss the challenges and opportunities associated with graph representation learning. This comprehensive review presents invaluable insights for researchers as it documents the development of COVID-19 and offers experiential lessons to preempt future infectious diseases. Moreover, this study guides future bioinformatics and biomedicine research methodologies.

The main aim of this paper is to set some correlations between Boole polynomials and p-adic gamma function in conjunction with p-adic Euler contant. We develop diverse formulas for p-adic gamma function by means of their Mahler expansion and fermionic p-adic integral on ℤ_{p}. Also, we acquire two fermionic p-adic integrals of p-adic gamma function in terms of Boole numbers and polynomials. We then provide fermionic p-adic integral of the derivative of p-adic gamma function and a representation for the p-adic Euler constant by means of the Boole polynomials. Furthermore, we investigate an explicit representation for the aforesaid constant covering Stirling numbers of the first kind.

In order to deal with imprecision, ambiguity, and uncertainty in data analysis, Pawlak introduced rough set theory in 1982. This paper aims to expand the scope of basic set theory developed by presenting the notions of δP-upper and δP-lower approximations, that are based on the notion of δP-open sets, we additionally examine a few of their fundamental characteristics.

This work reports the role of structure and composition on the determination of the performances of p-type SnOx TFTs deposited by rf magnetron sputtering at room temperature, followed by a post-annealed step up to 200 °C at different oxygen partial pressures (Opp), between 0% and 20%, but where the p-type conduction was only observed between 2.8–3.8%. The role of structure and composition were evaluated by XRD and Mössbauer spectroscopic studies. The study allows to identify the best phases/compositions and thicknesses (around 12 nm) to be used that lead to the production of TFTs with a bottom gate configuration, on glasses coated with conductive Indium Tin Oxide, followed by Aluminium Titanium Oxide dielectric layer with saturation mobility of 4.6 cm²V⁻¹s⁻¹ and on-off ratio above 7 × 10⁴, operating at the enhancement mode with a saturation voltage of −10 V.

In this paper, we investigate several relations for p-adic gamma function by means of their Mahler expansion and fermionic p-adic q-integral on ℤ_{p}. We also derive two fermionic p-adic q-integrals of p-adic gamma function in terms of q-Boole polynomials and numbers. Moreover, we discover fermionic p-adic q-integral of the derivative of p-adic gamma function. We acquire a representation for the p-adic Euler constant by means of the q-Boole polynomials. We finally develop a novel, explicit and interesting representation for the p-adic Euler constant including Stirling numbers of the first kind.

In this paper, we investigate p-adic q-integral (q-Volkenborn integral) on ℤ_{p} of p-adic gamma function via their Mahler expansions. We also derived two q-Volkenborn integrals of p-adic gamma function in terms of q-Daehee polynomials and numbers and q-Daehee polynomials and numbers of the second kind. Moreover, we discover q-Volkenborn integral of the derivative of p-adic gamma function. We acquire the relationship between the p-adic gamma function and Stirling numbers of the first kind. We finally develop a novel and interesting representation for the p-adic Euler constant by means of the q-Daehee polynomials and numbers.

Generally, when cognitive radio users are in Underlay mode, through the analysis of the electromagnetic spectrum in time, frequency, space, and field of multiple dimensional data accounts for judging the inherent correlation of the radio spectrum used/idle state, this is the realization of cognitive radio users (secondary users, SUs) efficient access to the foundation of the limited spectrum resources. Therefore, how to efficiently use of spectrum status of each SU implementation of reception multidimensional combination forecasting is the core of this paper addressing the problem. In this paper, we propose a deep-learning hybrid model called TensorGCN-LSTM based on the tensor data structure. The model treats SUs deployed at different spatial locations under the same frequency and the spectrum status of SUs themselves under different frequencies in the task area as nodes and constructs two types of graph structures. Graph convolutional operations are used to sequentially extract corresponding spatial-domain and frequency-domain features from the two types of graph structures. Then, the long short-term memory (LSTM) model is used to fuse the spatial, frequency, and temporal features of the cognitive radio environment data. Finally, the prediction task of the spectrum distribution situation is accomplished through fully connected layers. Specifically, the model constructs a tensor graph based on the spatial similarity of SUs' locations and the frequency correlation between different frequency signals received by SUs, which describes the electromagnetic wave's dependency relationship in spatial and frequency domains. LSTM is used to capture the electromagnetic wave's dependency relationship in the temporal domain. To evaluate the effectiveness of the model, we conducted ablation experiments on LSTM, GCN, GC-LSTM, and TensorGCN-LSTM models using simulated data. The experimental results show that our model achieved better prediction performance in RMSE, and the correlation coefficient R2 of 0.8753 also confirmed the feasibility of the model.

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.

It is increasingly common for experiments in biology and medicine to involve large numbers of hypothesis tests. A natural graphical method for visualizing these tests is to construct a histogram from the p-values of these tests. In this article, we examine the shapes, both normal and abnormal, that these histograms can take on, as well as present simple inferential procedures that help to interpret the shapes in terms of diagnosing potential problems with the experiment. We examine potential causes of these problems in detail, and discuss potential remedies. Throughout, examples of abnormal-looking p-value histograms are provided and based on case studies involving real biological experiments.

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

We studied generalization of a method for extending configurational studies to variables that are not exclusively geographical, in order to allow investigation of generic relationships in the built environment. We observed a number of limitations of the classical approach of configurational studies and we considered how a complex analytical method could be implemented in the study of non-topological variables, such as land use, noise pollution and financial or property rents. In order to do this we established a system of relationships based on a labeled primary graph. Categorization of the labels of the links was performed on a generic variable, specifically, the predominant use of roads. The graph was then contracted using an optimization algorithm, which we describe. The algorithm allows the network to be reduced to a more streamlined system that can better analyze the relationships between the different categories. Application of the method showed that it is faster to identify weaknesses in urban networks, and then take measures to resolve them. The case study concerns the pedestrianization of the Colosseum area in Rome.

Human action recognition (HAR) based on skeleton data is a challenging yet important technique because of its wide range of applications in many fields, including patient monitoring, security surveillance, and observing human-machine interactions. Many algorithms that attempt to distinguish between many types of activities have been proposed. However, most practical applications require highly accurate detection of specific types of activities. In this study, a novel and highly accurate spatiotemporal graph autoencoder network for HAR based on skeleton data is proposed. Furthermore, an extensive study was conducted using different modalities. For this purpose, a spatiotemporal graph autoencoder that automatically learns spatial as well as temporal patterns from human skeleton datasets was built. The powerful graph convolutional network named GA-GCN, developed in this study, notably outperforms most of the existing state-of-the-art methods based on two common datasets, namely NTU RGB+D and NTU RGB+D 120 . On the first dataset, we achieved an accuracy of 92.3% and 96.7% based on the cross-subject and cross-view evaluations, respectively. On the other more challenging dataset (i.e. NTU RGB+D 120), GA-GCN achieved 88.8% and 90.4% based on the cross-subject and cross-set evaluation, respectively.

Here, we describe the bicomplex (p,q)- Fibonacci numbers and the bicomplex (p,q)- Fibonacci quaternions that are based on these numbers and give some of their equations, including the Binet formula, generating function, Catalan, Cassini, d’Ocagne’s identities, and some summation formulas for both of them. Finally, we create a matrix for bicomplex (p,q)- Fibonacci quaternions, and we obtain a determinant of a special matrix that gives the terms of that quaternion.

In this paper, some convexity properties and some inequalities for the (p,k)-analogue of the Gamma function, Г_p,k(x) are given. In particular, a (p,k)-analogue of the celebrated Bohr-Mollerup theorem is given. Furthermore, a (p,k)-analogue of the Riemann zeta function, ζ_p,k(x) is introduced and some associated inequalities are derived. The established results provide the (p,k)-generalizations of some known results concerning the classical Gamma function.

This work considers the task of representation learning on the attributed relational graph (ARG). Both the nodes and edges in an ARG are associated with attributes/features allowing ARGs to encode rich structural information widely observed in real applications. Existing graph neural networks offer limited ability to capture complex interactions within local structural contexts, which hinders them from taking advantage of the expression power of ARGs. We propose Motif Convolution Module (MCM), a new motif-based graph representation learning technique to better utilize local structural information. The ability to handle continuous edge and node features is one of MCM’s advantages over existing motif-based models. MCM builds a motif vocabulary in an unsupervised way and deploys a novel motif convolution operation to extract the local structural context of individual nodes, which is then used to learn higher-level node representations via multilayer perceptron and/or message passing in graph neural networks. When compared with other graph learning approaches to classifying synthetic graphs, our approach is substantially better in capturing structural context. We also demonstrate the performance and explainability advantages of our approach by applying it to several molecular benchmarks.

This article presents a proposed system that enables energy transfer from the dc grid to a single-phase onboard grid, operating at an hi frequency. In addition to the energy transfer function, it additionally enables compensation of reactive power in the ac grid when the converter operates at less than rated power. To operate in compensator mode, it is necessary to decouple the current from the grid into active and reactive components and control them independently. To achieve good dynamics, synchronizers that operate in the dq system are used. In the case of a single-phase grid, it requires such a synchronizer to generate virtual quadrature signals. The used systems based on second-order generalized integrator are good, but to improve dynamics in the work a quadrature generator based on trigonometric calculations was proposed. The developed system was implemented in a proportional resonant current control system. Tests performed in steady state and in dynamic states related to typical grid disturbances showed better dynamic properties than the standard integrator-based system.Keywords: power transfer; compensator; P+R controller

Arc sensors have been used in seam tracking and widely studied since the 80s; commercial arc sensing products for T and V shaped grooves have been developed. However, it is difficult to use these arc sensors in narrow gap welding because arc stability and sensing accuracy are not satisfactory. Pulse gas melting arc welding (P-GMAW) has been successfully applied in narrow gap welding and all position welding processes, so it is worthwhile to research P-GMAW arc sensing technology. In this paper, we derived a linear mathematical P-GMAW model for arc sensing, and the assumptions for the model are verified through experiments and finite element methods. Finally, the linear characteristics of the mathematical model were investigated. In torch height changing experiments, uphill experiments, and groove angle changing experiments the P-GMAW arc signals all satisfied the linear rules. In addition, the faster the welding speed, the higher the arc signal sensitivities; the smaller the groove angle, the greater the arc sensitivities. The arc signal variation rate needs to be modified according to the welding power, groove angles, and swing or rotate speed.

Pardosa pseudoannulata is one of the most common wandering spiders in agricultural fields and a potentially good bioindicator for heavy metal contamination. However, little is known about the mechanism by which spiders respond to heavy metals at the molecular level. In this study, high-throughput transcriptome sequencing was employed to characterize the de novo transcriptome of the spiders and to identify differentially expressed genes (DEGs) after cadmium exposure. We obtained 60,489 assembled unigenes, 18,773 of which were annotated in the public databases. Ultimately, 3450 cDNA simple sequence repeats were identified and validated as potential molecular markers in the unigenes. A total of 2939, 2491 and 3759 DEGs were detected among the three libraries of two Cd-treated groups and the control. Functional enrichment analysis revealed that metabolism processes and digestive system function were predominately enriched in response to Cd stress. At the cellular and molecular levels, significantly enriched pathways in lysosomes and phagosomes as well as replication, recombination and repair demonstrated that oxidative damage resulted from Cd exposure. Based on the selected DEGs, certain critical genes involved in defence and detoxification were analysed. These results may elucidate the molecular mechanism underlying spiders' responses to heavy metal stress.

The COVID-19 pandemic has resulted in a wide range of spatial interventions to slow down the spread of the virus. The spatial limitations of narrow public circulation spaces within informal settlements, which house over one billion people around the world, make it impossible for pedestrians to practice physical distancing (or social distancing). In this paper, we propose a flexible mathematical method, named the Cluster Lane Method, for turning a planar circulation network of any size or complexity into a network of unidirectional lanes, making physical distancing possible in narrow circulation spaces by limiting face-to-face interactions. New notions and theorems about oriented graphs in graph theory are introduced. The paper ends with a discussion of the potential implementation of this cost-efficient, low-tech, sustainable solution, and with the introduction of a novel unidirectional tactile paving for the visually impaired.

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.

In recent years, graph neural networks (GNNs) have become a promising method for analyzing data structured in graph format. By considering connections between entities in a graph, GNNs are able to extract valuable insights. One notable variation of GNN is the graph attention network (GAT), which employs the attention mechanism and has demonstrated promising performance in various applications. However, its ability to incorporate feature information from nodes beyond the immediate neighborhood is limited, leading to degraded performance on heterophilic data. To address this limitation, this thesis proposes a novel attention-based model, namely the Directional Graph Attention Network (DGAT). This model combines the feature-based attention with the global directional information extracted from the graph topology, as inspired by the Directional Graph Network (DGN). A new class of Laplacian matrices is proposed and an existing theoretical result on DGN is extended. This extension bridges a gap in the literature. The experimental results presented in the thesis, based on nine real-world benchmarks and ten synthetic data sets, demonstrate the superiority of the proposed DGAT model compared to the GAT baseline model. Particularly on heterophilic data sets, DGAT showed a notable average increase of approximately 35% in node classification tasks across all heterophilic real-world data sets. In addition, DGAT outperforms GAT by an average margin of around 51% in all ten synthetic data sets with various levels of heterophily

Ensuring the integrity of scientific literature is essential for advancing knowledge and research. However, the credibility and trustworthiness of scholarly publications are compromised by manipulated citations. Traditional methods, such as manual inspection and basic statistical analyses, have limitations in detecting intricate patterns and subtle manipulations of citations. In recent years, network-based approaches have emerged as promising techniques for identifying and understanding citation manipulation. This study introduces a novel method to identify potential citation manipulation in academic papers using perturbations of a deep embedding model. The key idea is to reconstruct meaningful connections represented by citations within a network by exploring slightly longer alternative paths. These indirect pathways enable the recovery of original and reliable citations while estimating their trustworthiness. The investigation takes a comprehensive approach to link prediction, leveraging the consistent behavior of prominent connections when exposed to network perturbations. Through numerical experiments, the method demonstrates a high capability to identify reliable citations as the core of the analyzed data and to raise suspicions about unreliable references that may have been manipulated.

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

With the improvement of software copyright protection awareness, code obfuscation technology plays a crucial role in protecting key code segments. As the obfuscation technology becomes more and more complex and diverse, it has spawned a large number of malware variants, which make it easy to evade the detection of anti-virus software. Malicious code detection mainly depends on binary code similarity analysis. However, the existing software analysis technologies are difficult to deal with the growing complex obfuscation technologies. To solve this problem, this paper proposes a new obfuscation-resilient program analysis method, which is based on the data flow transformation relationship of the intermediate representation and the graph network model. In our approach, we first construct the data transformation graph based on LLVM IR. Then, we design a novel intermediate language representation model based on graph networks, named DFSGraph, to learn the data flow semantics from DTG. DFSGraph can detect the similarity of obfuscated code by extracting the semantic information of program data flow without deobfuscation. Extensive experiments prove that our approach is more accurate than existing deobfuscation tools when searching for similar functions from obfuscated code.

There is a considerable amount of research in online social networks, most of which focuses on the structural analysis of social graphs. The interpersonal relationships of social networks, especially friend circle, can solve the cold start and sparsity problems, and through the relationship between social networks can effectively recommend users' favorite items (items), such as music , videos, brands/products, preferred tags, location, services, etc. User relationships in social networks are diverse and there are many different perspectives on different social networks. Associations among users can form multi-layered composite networks, and multi-layered social networks present new challenges and opportunities. Different relationships can influence users' preferences to different degrees, which in turn affects their behavior. Therefore, fusing multiple social networks is an effective way to improve recommendation. Although some studies have started to address multiple social network recommendations, simple linear superposition cannot reflect the coupling and nonlinear association between multiple social networks. In this paper, we propose a graph neural network recommendation model under social relationships based on this background. We first propose to compute the 2nd order collaborative signals and their intensities directly from the neighboring matrix for updating the node embedding of the graph convolution layer. Secondly by embedding historical evaluations, various social networks constituting different dimensions, the attention integration of user preferences by different social networks is achieved, and its effectiveness and scalability are demonstrated in theoretical derivation and experimental validation. The theoretical derivation and experimental validation demonstrate its effectiveness and scalability.

Formation in soccer is among the most important tactical choices for a successful match.Herein, the simulations of 420000 match-plays have been performed varying the formation, the number of opponents that are actively pressing the team, the speed of the opponents in attempting a pass interception. Dribbling has been neglected. The match-play ends either with a successful series of passes from a central back to the line of the strikers or with the opponents that steal the ball. In this work, I demonstrate that 3-4-3 formation, which is among the most employed formations, relates to the highest probability of success.

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

Since the outbreak of 2019 novel coronavirus (2019-nCoV) at the hardest-hit city of Wuhan, the fast-moving spread has killed over three hundred people and infected more than ten thousands in China¹. There are more than one hundred cases outside of China, affecting a dozen of countries globally². The genome sequence of 2019-nCoV has been reported and fast diagnostic kits, effective treatment as well as preventive vaccines are rapidly being developed³. Initial fast-growing confirmed cases triggered lock-down of Wuhan as well as nearby cities in Hubei Province. Mathematical models have been proposed by scientists around the world to project the numbers of infected cases in the coming days ^4,5. However, major factors such as transportation and cultural customs have not been weighed enough. Our model is not set out for precise prediction of the number of infected cases, rather, it is meant for a glance of the dynamics under a public epidemic emergency situation and of different contributing factors. We hope that our model and simulation would provide more insights and perspective information to public health authorities around the globe for better informed prevention and containment solution.

Plants produce a diverse portfolio of sesquiterpenes that are important in their response to herbivores and the interaction with other plants. Their biosynthesis from farnesyl diphosphate depends on the sesquiterpene synthases. Here, we investigate to what extent metabolic pathways can be reconstructed just from knowledge of the final product and the reaction mechanisms catalyzed by sesquiterpene synthases. We use the software package MedØlDatschgerl (MØD) to generate chemical networks and elucidate pathways contained in them. As examples, we successfully consider the reachability of the important plant sesquiterpenes β-caryophyllene, α-humulene, and β-farnesene. We also introduce a graph database to integrate simulation results with experimental biological evidence for selected predicted sesquiterpenes biosynthesis.

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.

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.

A growing area in neurosciences is focused on the modeling and analysis the complex system of connections in neural systems, i.e. the connectome. Here we focus on the representation of connectomes by using graph theory formalisms. The human brain connectomes are usually derived from neuroimages; the analyzed brains are co-registered in the image domain and brought to a common anatomical space. An atlas is then applied in order to define anatomically meaningful regions that will serve as the nodes of the network - this process is referred to as parcellation. Recently, it has been proposed to perform atlas-free random brain parcellation into nodes and align brains in the network space instead of the anatomical image space to define network nodes of individual brain networks. In the network domain, the question of comparison of the structure of networks arises. Such question is tackled by modeling the comparison of brain network as a network alignment (NA) problem. In this paper, we first defined the NA problem formally, then we applied three existing state of the art of multiple alignment algorithms (MNA) on diffusion MRI-derived brain networks and we compared the performances. The results confirm that MNA algorithms may be applied in cases of atlas-free parcellation for a fully network-driven comparison of connectomes.

In an outstanding article published in 2008, Suzuki obtained a nice generalization of the Banach contraction principle from which derived a characterization of metric completeness. Although Suzuki’s theorem has been successfully generalized and extended in several directions and contexts, we here show by means of a simple example that the problem of achieving, in an obvious way, its full extension to the framework of w-distances does not have an emphatic response. Motivated by this fact we introduce the concept of presymmetric w-distance on metric spaces, we give some properties and examples of this new structure and show that it provides a reasonable setting to obtain a real and hardly forced w-distance generalization of Suzuki’s theorem. This is realized in our main result, which is a fixed point theorem that involves presymmetric w-distances and certain contractions of Suzuki-type. We also discuss the relationship between our main result and the well-known w-distance full generalization of the Banach contraction principle, due to Suzuki and Takahashi. Connected to this approach we prove another fixed point result that compare with our main result through some examples. Finally, we state a characterization of metric completeness by using our fixed point results.

Polychlorinated dibenzo-p-dioxins and polychlorinated dibenzo-p-furans (PCDD/Fs) are environmental pollutants with a great persistence, capacity of bioaccumulation, and well known important toxic effects in humans and animals. Incinerators of hazardous, municipal and medical waste, chlorine bleaching of paper pulp, cement plants, and the traffic of motor vehicles are the most frequent emission sources of these compounds. The diet, followed at a great distance by inhalation, is generally the main way of human exposure to PCDD/Fs. Human biomonitoring is of a great importance to prevent potential adverse effects derived from exposure to chemicals such as PCDD/Fs. In relation to this, blood is among the most used biological monitors. In the current review, we have summarized the recent information (2000-2009) published in the scientific literature (databases: Scopus and PubMed) on the concentrations of PCDD/Fs in blood samples of non-occupationally exposed populations, as well as in some groups of occupationally exposed individuals. We have revised a number of studies conducted in various African American, Asian and European countries, and Australia. Unfortunately, the information is quite limited. No data are available for most countries over the world. Based on the results here reviewed –where available- the current health risks for the general populations do not seem to be of concern. Moreover, taking into account the important reductions observed in the levels of PCDD/Fs in foodstuffs, new decreases in the concentrations of PCDD/Fs in blood -and other biological tissues- are very probable in the immediate years.

We introduce the Concept-Model-Graph-View Cycle (CMGVC). The CMGVC facilitates coherent architecture analysis, reasoning, insight, and decision-making based on conceptual models that are transformed into a generic, robust graph data structure (GDS). The GDS is then transformed into multiple views of the model, which inform stakeholders in various ways. This GDS-based approach decouples the view from the model and constitutes a powerful enhancement of model-based systems engineering (MBSE). The CMGVC applies the rigorous foundations of Category Theory, a mathematical framework of representations and transformations. We show that modeling languages are categories, drawing an analogy to programming languages. The CMGVC architecture is superior to direct transformations and language-coupled common representations. We demonstrate the CMGVC to transform a conceptual system architecture model built with the Object Process Modeling Language (OPM) into dual graphs and a stakeholder-informing matrix that stimulates system architecture insight.

The earthquake alert of the early warning systems is based on the delay that the S waves have in reference to the P waves and on the interpretation of the P waves’ specific parameters. One of the most used parameters for estimating the moment magnitude of an earthquake is the characteristic period measured in the first 3 seconds of the appearance of the P wave. The typical method determines the characteristic period in the time domain, based on the velocity wave and the displacement wave. In the present work, we present a method for estimating the frequency of the characteristic period. This method includes zero padding of the P wave sequence, conversion of the extended sequence from the time domain to the frequency domain, the identification of local frequency maxima and the calculation of the weighted average of the frequency based on the identified maxima. Tests conducted on synthetic signals, as well as standard deviation evaluation tests for simultaneous recordings on several stations, reveal better performance to the usual method.

Cell migration crucial contributor to metastasis, a critical process associated with the mortality of cancer patients. The initiation of metastasis is triggered by epithelial-mesenchymal transition (EMT), along with the changes of the expression of EMT marker proteins. Inflammation plays a significant role in carcinogenesis and metastasis. Lipopolysaccharide (LPS), a typical inflammatory agent, promoted the generation of superoxide through the activation of p-Tyr42 RhoA, Rho-dependent kinase 2 (ROCK2) and the phosphorylation of p47phox. In addition, p-Tyr42 RhoA activated phospholipase D1 (PLD1), with PLD1 and phosphatidic acid (PA) being involved in superoxide production. PA also regulated the expression of EMT maker proteins. Consequently, we have identified MHY9 (Miosin IIA, NMIIA) as a PA-binding protein in response to LPS. MYH9 also contributed cell migration and the alteration of the expression of EMT marker proteins. P-Tyr42 RhoA, PLD1 and MYH9 associated to form a complex, which was distributed in both the cytosol and nucleus. In addition, we have found that p-Tyr42 RhoA and PLD1 associated with the ZEB1 promoter. Taken together, we propose that p-Tyr42 RhoA and PLD1, responsible for producing PA, and PA-bound MYH9 are involved in the regulation of ZEB1 expression, thereby promoting cell migration.

Abstract: (1) Background: Surgery is the best curative option for Gastric Cancer (GC). However, morbimortality associated with surgery still a significant problem. Thus, it is essential to determine the preoperative surgical risk, to optimize outcomes in higher risk patients. (2) Methods: Patients who underwent curative gastrectomy between January 2010 and December 2013 were included, obtaining a sample of 131 patients, and the acuity of the scales understudy was evaluated. The predictive power of the scales was evaluated through calibration and discrimination. (3) Results and Conclusions: Regarding mortality, the scales demonstrated good calibration, with POSSUM and P-POSSUM obtaining the best O:E ratio. The scales presented good discrimination, with POSSUM showing the best result. Considering morbidity, the scales showed good calibration and discrimination. POSSUM and P-POSSUM seem to have potential in predicting morbidity and mortality when applied to the studied population, but there is a need for further studies in this area.

Emerging evidence has shown that microRNAs play pivotal roles in wound healing. MicroRNA-21 (miR-21) was previously found to upregulate in order to fulfill an anti-inflammation role for wounds. Exosomal miRNAs have been identified and explored as essential markers for diagnostic medicine. However, the role of exosomal miR-21 in wounds has yet to be well studied. In order to facilitate the early management of poorly healing wounds, we developed an easy-to-use, rapid, paper-based microfluidic-exosomal miR-21 extraction device to determine wound prognosis in a timely manner. We isolated and then quantitatively examined exosomal miR-21 in wound fluids from normal tissues, acute and chronic wounds. Eight improving wounds displayed lower levels of exosomal miR-21 expression after wound debridement. However, four instances of increased exosomal miR-21 expression levels were notably associated with patients with poor healing wounds despite aggressive wound debridement, indicating a predictive role of tissue exosomal miR-21 for wound outcome. Paper-based nucleic acid extraction device provides a rapid and user-friendly approach for evaluating exosomal miR-21 in wound fluids as a means of monitoring wounds. Our data suggest that tissue exosomal miR-21 is a reliable marker for determining current wound status.

If an algebra of type $A$ contains a subalgebra which is also an algebra of type $B$, then it is a Smarandache $B$-type $A$-algebra provided the subalgebra of type $B$ contains at least two elements. This generalizes the notion of Smarandache group, where the group of order $\geq 2$ is a subsemigroup of a semigroup. In this paper we investigate a number of such pairings and we deduce a number of conclusions as a consequence.

In this paper, we define and investigate modified p-Leonardo, p-Leonardo-Lucas and p-Leonardo sequences as special cases of the generalized Leonardo sequence. We present Binet's formulas, generating functions, Simson formulas, and the summation formulas for these sequences. Moreover, we give some identities and matrices related with these sequences. Furthermore, we show that there are close relations between modified p-Leonardo, p-Leonardo-Lucas, p-Leonardo numbers and Fibonacci, Lucas numbers.

For evaluating probabilities of arbitrary random events with respect to a given multivariate probability distribution, specific techniques are of great interest. An important two-dimensional high risk limit law is the Gauss-exponential distribution whose probabilities can be dealt with based upon the Gauss-Laplace law. The latter will be considered here as an element of the newly introduced family of (p,q)-spherical distributions. Based upon a suitably defined non-Euclidean arc-length measure on (p,q)-circles we prove geometric and stochastic representations of these distributions and correspondingly distributed random vectors, respectively. These representations allow dealing with the new probability measures similarly like with elliptically contoured distributions and more general homogeneous star-shaped ones. This is demonstrated at hand of a generalization of the Box-Muller simulation method. En passant, we prove an extension of the sector and circle number functions.

Identifying influential actors within social networks is pivotal for optimizing information flow and mitigating the spread of both rumors and diseases. Several methods have emerged to pinpoint these influential entities in networks that are represented as graphs. In these graphs, nodes corre-spond to individuals and edges indicate their connections. This study focuses on centrality measures, prized for their straightforwardness and effectiveness. We categorize structural central-ity into two: local, considering a node's immediate vicinity, and global, accounting for overarching path structures. Some techniques blend both centralities to highlight nodes influential at both mi-cro and macro levels. Our paper presents a novel centrality measure, accentuating node degree and incorporating the network's broader features, especially paths of different lengths. Through Spearman and Pearson's correlations tested on seven standard datasets, our method proves its merit against traditional centrality measures. Additionally, we employ the SIR model, portraying disease spread, to further validate our approach. The ultimate influential node is gauged by its capacity to infect the most nodes during the SIR model's progression. Our results indicate a nota-ble correlative efficacy across various real-world networks relative to other centrality metrics.

The study introduces a novel method to identify potential citation manipulation in academic papers using perturbations of a deep embedding model, incorporating Graph Masked Autoencoders. This approach integrates textual information with graph connectivity evidence, resulting in a more sophisticated model of citation distribution. By training a deep network using partial data and reconstructing masked connections, the method leverages the inherent characteristics of central connections under network perturbations. Quantitative evaluations demonstrate its remarkable ability to pinpoint trustworthy citations in the analyzed data and raise concerns about potentially unreliable references due to potential manipulation.

This paper presents the Advanced Syntactic-Graph Convolutional Model (ASGCM), a pioneering approach in Aspect-Based Sentiment Analysis (ABSA) that integrates syntactic dependency features within a graph convolution framework. ASGCM stands out for its novel use of dependency edge encoding and tag-based graph convolutions, providing a fine-grained analysis of sentiments associated with specific aspects in text. This model meticulously captures the intricacies of syntactic structures, thereby offering enhanced precision in sentiment analysis. Notably, ASGCM incorporates a dual-layer graph convolution system: one layer processes syntactic dependencies (edges), while the other interprets semantic roles (tags), ensuring a comprehensive understanding of both structural and contextual elements in text. We rigorously tested ASGCM on multiple datasets, including both English and Chinese languages, and our findings reveal a significant improvement in sentiment classification accuracy compared to existing models. The versatility of ASGCM makes it a robust tool for diverse linguistic environments, setting a new standard for ABSA methodologies.

Consensus algorithms are the core technology of blockchain and a focus in the current distributed system research. The consensus algorithms are widely used in distributed systems, it has solved the decentralization problem. The traditional consensus algorithm needs the process of node legitimacy checking, identity authentication, and primary node view change, so the time cost of reaching an agreement between nodes is still exponential. In response to the problem, a lightweight consensus algorithm based on graph (LCAG) is proposed for the Internet of Things (IoT) in this paper, which is proposes an access control table, and reaches an agreement among nodes by calculating the probability of nodes in the control table, and reduces the time overhead of the reaching an agreement in distributed systems. We have carried out simulation experiments for the new algorithm, and the experiments show that: the new algorithm needs less time overhead than the classical Byzantine algorithm need, as well as Byzantine Generals problem (BGP), practical Byzantine fault-tolerant algorithm (PBFT) and directed acyclic graph (DAG) algorithm, and so on. The new algorithm can be applied to the devices of IoT, which have limited computing power.

With the development of data science, more and more machine learning technologies have been designed to solve complicated and challenging real-world tasks containing a large volume of data. And many significant real-world datasets contain data in the form of networks or graphs. Graph Neural Networks is one of the powerful machine learning tools, which could provide a perfect solution to processing a large amount of non-Euclidean data. And because most bio information data in bioinformatics is in the non-Euclidean domain, Graph Neural Networks could then directly be applied to solve problems in bioinformatics. Much research has been done in the field of GNN, and there are also some surveys related to GNN and its applications. However, there has been little research focusing on GNN in bioinformatics, and we think in the future we could better utilize GNN in the field of biology, so we would like to write a literature review to help take a comprehensive look at GNN and their applications in the field of bioinformatics. In this paper, we would first introduce SOTA models in Graph Neural Networks, and second, introduce their applications in bio information. And then we would provide future directions of Graph Neural Networks in bioinformatics.

Forest fire identification is important for forest resource protection. Effective monitoring of forest fires requires the deployment of multiple monitors with different viewpoints, while most traditional recognition models can only recognize images from a single source. By ignoring the information from images with different viewpoints, these models produce high rates of missed and false alarms. In this paper, we propose a graph neural network model based on the similarity of dynamic features of multi-view images to improve the accuracy of forest fire recognition. The input features of the nodes on the graph are converted into relational features of different gallery pairs by establishing pairs (nodes) representing different viewpoint images and gallery images. The new feature library relationship is used to update the image gallery with dynamic features in order to achieve the estimation of similarity between images and improve the image recognition rate of the model. In addition, to reduce the complexity of image pre-processing process and extract key features in images effectively, this paper also proposes a dynamic feature extraction method for fire regions based on image segment ability. By setting the threshold value of HSV color space, the fire region is segmented from the image, and the dynamic features of successive frames of the fire region are extracted. The experimental results show that, compared with the baseline method Resnet, this paper's method is more effective in identifying forest fires, and its recognition accuracy is improved by 2%. And the scheme of this paper can adapt to different forest fire scenes, with better generalization ability and anti-interference ability.

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.

The prediction of drug--target interactions is always a key task in the field of drug redirection. However, traditional methods of predicting drug--target interactions are either mediocre or rely heavily on data stacking. In this work, we merged heterogeneous graph information and obtained effective node information and substructure information based on mutual information in graph embeddings. We then learned high quality representations for downstream tasks, and proposed an end--to--end auto--encoder model to complete the task of link prediction. Experimental results show that our method outperforms several state--of--art models. The model can achieve the area under the receiver operating characteristics (AUROC) curve of 0.959 and area under the precise recall curve (AUPR) of 0.848. We found that the mutual information between the substructure and graph--level representations contributes most to the mutual information index in a relatively sparse network. And the mutual information between the node--level and graph--level representations contributes most in a relatively dense network.

Identifying fake news on the media has been an important issue. This is especially true considering the wide spread of rumors on the popular social networks such as Twitter. Various kinds of techniques have been proposed for automatic rumor detection. In this work, we study the application of graph neural networks for rumor classification at a lower level, instead of applying existing neural network architectures to detect rumors. The responses to true rumors and false rumors display distinct characteristics. This suggests that it is essential to capture such interactions in an effective manner for a deep learning network to achieve better rumor detection performance. To this end we present a simplified aggregation graph neural network architecture. Experiments on publicly available Twitter datasets demonstrate that the proposed network has performance on a par with or even better than that of state-of-the-art graph convolutional networks, while significantly reducing the computational complexity.

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

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.

The application of graph theory in chemical and molecular structure research far exceeds people's expectations, and it has recently grown exponentially. In the molecular graph, atoms are represented by vertices and bonded by edges. Closed forms of multiplicative degree-based topological indices which are numerical parameters of the structure and determine physico-chemical properties of the concerned molecular compound. In this article, we compute and analyze many multiplicative degree-based topological indices of silicon-carbon Si₂C₃-I[p,q] and Si₂C₃-II[p,q].

Let G be a finite group. The prime graph Γ(G) of G is defined as follows: The set of vertices of Γ(G) is the set of prime divisors of |G| and two distinct vertices p and p' are connected in Γ(G), whenever G has an element of order pp'. A non-abelian simple group P is called recognizable by prime graph if for any finite group G with Γ(G)=Γ(P), G has a composition factor isomorphic to P. In [4] proved finite simple groups ²D_n(q), where n ≠ 4k are quasirecognizable by prime graph. Now in this paper we discuss the quasirecognizability by prime graph of the simple groups ²D_2k(q), where k ≥ 9 and q is a prime power less than 10⁵.

The real-time Railway Traffic Management Problem (rtRTMP) is discussed in the field of railway transportation. In this paper, rtRTMP is considered for planning shunting routes based on the use of routing methods on a spatial-temporal graph. An approach and algorithm of Spatial-Temporal Graph formation for rail yard transportation network is proposed. The idea is to construct an undirected loop-free Double Vertex Graph for determining optimal shunting routes consisting of several half-runs for several trains shunting under draw-out tracks capacity constraints. Experimental results on the rail yard simulation model are presented.

In this research paper, we implement the theory of the primorial function, to develop the Supremum and Infimum bounds for the sum of (log(p))². There are, however, considerable computational difficulties related to these bounds. Therefore, from a pragmatic point of view, a set of Upper and Lower bounds had been developed to bypass this issue. Despite the increased estimation error, the Upper and Lower bounds are still considered sufficiently accurate, while facilitating an easy and fast computation of the estimate of the sum.