Addressing the pressing challenge of global warming, reducing greenhouse gas emissions in the transportation sector is a critical imperative. Battery and fuel-cell electric vehicles have emerged as promising solutions for curbing emissions in this sector. In this study, we conducted a comprehensive life cycle assessment (LCA) for typical passenger vehicles, heavy duty trucks and city buses using either proton-exchange membrane fuel cells or Li-ion batteries with different cell chemistries. To ensure accuracy, we supplemented existing studies with data from the literature, particularly for the recycling phase, as database limitations were encountered. Our results highlight that fuel cell and battery systems exhibit large emissions in the production phase. Recycling can significantly offset some of these emissions, but a comparison of the technologies examined revealed considerable differences. Overall, battery electric vehicles consistently outperform fuel cell electric vehicles regarding absolute greenhouse gas emissions. Hence, we recommend prioritizing battery electric over fuel cell vehicles. However, deploying fuel cell electric vehicles could become attractive in a hydrogen economy scenario where other factors, e. g. the conversion and storage of surplus renewable electricity via electrolysis, become important.

Clustering coefficient measures are key complex network analysis tools. We examine local and global clustering coefficient measures with respect to the lexicographic graph product. As a preliminary condition, we analyze the $K_3$ subgraph structure focused on vertex inclusion with respect to the product graph. From this structure, we determine both the clustering coefficient for the product graph vertices and the average clustering coefficient for the product graph.

Vertical Indoor Farming (VIF) with hydroponics offers a promising perspective for sustainable food production. Intelligent control of VIF system components plays a key role in reducing operating costs and increasing crop yields. Modern machine vision (MV) systems use Deep Learning (DL) in combination with camera systems for various tasks in agriculture, such as disease and nutrient deficiency detection, and flower and fruit identification and classification for pollination and harvesting. This study presents the applicability of MV technology with DL modelling to detect the growth stages of chilli plants using YOLOv8 networks. The influence of different bird’s eye and side view datasets and different YOLOv8 architectures was analysed. To generate the image data for training and testing the YOLO models, chilli plants were grown in a hydroponic environment and imaged throughout their life cycle using four camera systems. The growth stages were divided into growing, flowering and fruiting classes. All trained YOLOv8 models showed reliable identification of growth stages with high accuracy. The results indicate that models trained with data from both views show better generalisation. YOLO’s middle architecture achieved the best performance.

Properties of time domain parameters of the vibration signal have been extensively studied for the fault diagnosis of rolling element bearings (REB). Parameters like kurtosis and Envelope Harmonic-to-Noise Ratio are most widely applied in this field and some important progress has been made. However, since only one-sided information is contained in these parameters respectively, problems still exist in practice when the signals collected are of complicated structure and/or contaminated by strong background noises. A new parameter, named Shock pulse index (SPI), is proposed in this paper. It integrates the mutual advantage of both parameters above and can help effectively identify fault related impulse components under the interference of strong background noises, unrelated harmonic components and random impulses. The SPI optimizes the parameters of Maximum Correlated Kurtosis Deconvolution (MCKD), which is used to filter the signals under consideration. Finally, the interested transient information contained in the filtered signal can be highlighted through demodulation with Teager Energy Operator (TEO). Fault related impulse components can therefore be extracted accurately. Simulations and experiment analyses verify the effectiveness and correctness of the SPI.

Surface acoustic wave (SAW) is effective for the manipulation of fluids and particles in microscale. The current approach of integrating interdigitated transducers (IDTs) for SAW generation into microfluidic channels involves complex and laborious microfabrication steps. These steps often require the full access to clean room facilities and hours to align the transducers to the precise location. This work presents an affordable and innovative method for fabricating SAW-based microfluidic devices without the need of clean room facilities and alignment. The IDTs and microfluidic channels are fabricated in the same process and thus precisely self-aligned in accordance with the device design. With the use of the developed fabrication approach, a few types of different SAW-based microfluidic devices have been fabricated and demonstrated for particle separation and active droplet generation.

This paper proposes a product design model for internalising users’ positive experiences through attachment. First, the research commences with a literature review to define the concepts and research status of positive experience design (PED) and product attachment. Subsequently, the design model is constructed, accompanied by relevant formulas for concept generation. Finally, the model’s validity is verified through a workshop, and its effectiveness is evaluated and discussed using the USE questionnaire. This study incorporates the seven factors of product attachment to activate positive states within the user–product relationship and facilitate the cultivation of positive thinking. Grounded in theories of PED and embracing a product attachment perspective, the attachment-driven PED model offers a systematic approach for generating design concepts that are relevant to user experience.

In the present study, the new biological sources in the form of lichen Usnea orientalis Motyka was screened for its antidermatophytic potential. Six species of dermatophytes were chosen on the basis of their prevalence for antidermatophytic assays, and the Clinical Laboratory Standard Institute (CLSI)-recommended broth microdilution procedure was used to detect the efficacy of extract against dermatophytes. Thin layer chromatography of lichen extracts reveals the presence of two secondary metabolites viz. salazinic acid and usnic acid. U. orientalis extract exhibited promising antidermatophytic activity against all tested pathogens. Amongst all tested pathogens, E. floccosum exhibited most susceptibility towards extract, whereas T. mentagrophytes exhibited the least susceptibility. Topical application of U. orientalis extract might be helpful in the cure of dermal infections.

This bibliographic study addresses key aspects related to fishing, product safety, and climate change in the Adriatic Sea region. The examination of product safety focuses on the assessment of contaminants originating from human activities such as industry, mining, agriculture, and household waste disposal. The contamination of the aquatic environment has emerged as a pressing global concern, extending to the Adriatic subbasin. Aquatic organisms, including fish, are prone to accumulating pollutants directly from polluted water sources and indirectly through the food web. The bio-accumulation of potentially hazardous substances, particularly heavy metals, pesticides, PCBs, PAHs, and antibiotic resistance in aquatic organisms, poses a significant threat to human health. Climate change effects will deplete our seafood supply in terms of quantity and safety owing to negative consequences such as higher levels of pollution, parasites, viruses, infections, acidification, and toxicities such as shellfish poisoning. Global food safety strategies should be developed to reduce greenhouse gas emissions and promote environmentally friendly technology, which indirectly affects seafood quality and microbiological safety, especially for Adriatic Sea, which is part of the Mediterranean Sea, characterized by the most polluted waters in the world.

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.

In this study, 10%PTFE/PEEK blend were modified by potassium titanate whisker (PTW) and chopped glass fiber (GF), respectively. The blends were prepared by three-screw extruder. Through the investigation of thermal stability, tribological properties, mechanical properties and rheological behavior, the effects of reinforcing agents were determined. The results illustrated that the mechanical properties of 10%PTFE/PEEK blend can be dramatically improved by adding reinforcing agent of PTW or GF, and the reinforcing effect of GF was especially obvious. As for tribological properties, 1% addition was the best proportion. The friction coefficient and wear rate of the blend with 1% PTW were 0.283 and 4.97 × 10^-6 mm³/N · m, which decreased by 7.2% and 21% compared with those of the blend without reinforcing agent.

Background: Circulating rare cells participate in breast cancer evolution as systemic components of the disease and thus, are a source of theranostic information. Exploration of cancer-associated rare cells is in its infancy. We determined the validity of a rare-cell detection platform and demonstrated the usefulness of a certain rare cell subset as a novel approach to characterize the breast cancer system. Methods: Linearity of the Rarmax® platform was established using a spike-in approach. The platform includes red blood cell lysis, leukocyte depletion and high-resolution fluorescence image recording. Rare cell analysis was conducted on 28 samples (before and after surgery) from 14 patients with breast cancer, 20 healthy volunteers and 9 non-cancer control volunteers. In-depth identification of rare cells, including circulating tumor cells, endothelial-like cells, erythroblasts and inflammation-associated cells, was performed using a phenotype and morphology-based classification system. Results: The platform performed linearly over a range of 5-950 spiked cells, with an average recovery of 84.6%. Circulating epithelial and endothelial-like cell subsets have been demonstrated to be associated with or independent of cancer with tumor presence. Furthermore, certain cell patterns may be associated with treatment-related adverse effects. The sensitivity in detecting tumor-presence and cancer-associated abnormality before surgery was 50% and 85.7%, respectively and the specificity was 100% and 96.6%, respectively. Conclusion: The present study supports the idea of a cancer-associated rare cell abnormality to represent tumor entities as well as systemic cancer. The latter is independent of the apparent clinical cancer.

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

The influence of short term water absorption on the mechanical properties of halloysite nanotubes-multi layer graphene reinforced polyester hybrid nanocomposites has been investigated. The addition of nano-fillers significantly increased the flexural strength; tensile strength and impact strength in dry and wet conditions. After short term water exposure; the maximum microhardness; tensile; flexural and impact toughness values were observed at 0.1 wt% MLG. The microhardness increased up to 50.3%; tensile strength increased up to 40% and flexural strength increased up to 44%. Compared to dry samples; the fracture toughness and surface roughness of all types of produced nanocomposites were increased that may be attributed to plasticization effect. Scanning electron microscopy revealed that the main failure mechanism is caused by the weakening of nano-filler-matrix interface induced by water absorption. It was further observed that synergistic effects were not effective at concentration of 0.1 wt% to produce considerable improvement in mechanical properties of produced hybrid nanocomposites.

Graph theory plays significant role in every field of science as well as technology. Every situation can be articulated in terms of suitable graphs by using various approaches of graph theory. Considering the recent pandemic in the world and the precautions taken for prevention of the COVID 19, it is the most appropriate way to exercise the graph models with theoretical as well as practical aspects to control this epidemic. This paper defines the variable set, variable graphs and their types with respect to variable vertex sets and variable edge sets. Depending upon the nature of the pandemic, there are four types of Virus graphs. Virus graph I and III are not so perilous for all living beings. Although, Virus graphs II and IV are extremely hazardous for the harmony of the world. In view of different aspects for expand of pandemic, growth types of virus graphs are divided in 1-1, 1-P and 1-all growth types. The COVID19 initially was in Virus graph-I type, but presently it is in Virus graph-II types. We present the table involving the number of infected people after n days with respect to different values of P and growth rates with I0 = 100. Moreover, the country wise starting dates of stages of the virus graph-I and II are specified. The concept of cut sets is applicable for prevention of COVID19 and the whole world is using the same analogy.

We investigate and discuss in detail the structure of the restricted singular value decomposition for a tensor triplet under t-product (T-RSVD). The algorithm is provided with a numerical example illustrating the main result. For applications, we consider color image watermarking processing with T-RSVD.

Among the various generalizations of persistent topology, the one based on rank functions and leading to indexing-aware functions appears to be particularly suited to catch graph-theoretical properties without the need for a simplicial construction and a homology computation. This paper defines and studies "simple" and "single-vertex" features in directed and undirected graphs, by which several indexing-aware persistence functions are produced, within the scheme of steady and ranging sets. The implementation of the "sink" feature and its application to trust networks provide an example of the ease of use and meaningfulness of the method.

Several bio-actors are involved in the occurrence of leishmaniasis, which is made too complex for prevention and control options. Currently, all forms of leishmaniasis are being treated with chemical drugs, which have limitations and adverse effects on patients. Searching the bioactive molecules from plant sources allows the development of a novel drug. The essential oil and solvent extract of the roots of E. kebericho showed antileishmanial activity. But looking for biological activities of the isolated active ingredient from tubers of E. kebericho was scant. Thus, the isolation of the leishmanicidal compound from the roots of E. kebericho through a bioassay-guided technique was an aim of this work. Dehydrocostus lactone showed doubled potent than the standard drug miltefosine on leishmanicidal activities against L. major and L. tropica. Besides, the broad-spectrum biological activities of dehydrocostus lactone could be a potential drug candidate for co-infected patients caused by an association of leishmania and another pathogen.

Although Lov\'{a}sz introduced the graph exponential $G^K$ in 1967, this product has received little attention. This paper focuses on the number of components in $G^K$ when exponent $K$ is a complete graph $K_n$. For a connected bipartite $G$, when $K$ is $K_2$, $G^{K_2}$ has three components; and when $K$ is $K_n$ with $n>2$, $G^{K_n}$ produces $\lceil\frac{n+1}{2}\rceil$ components. A connected $G$ with an odd cycle produces one component in $G^{K_n}$.

Graph databases (GDBs) are becoming increasingly popular across scientific disciplines, being highly suitable to store and connect complex heterogeneous data. In systems biology, they are used as a backend solution for biological data repositories, ontologies, networks, pathways, and knowledge graph (KG) databases. In this review, we analyse all publications using or mentioning graph databases retrieved from PubMed and PubMed Central full-text search, focusing on the top 16 available GDB technologies. Relevant publications are then categorised according to their domain and application. We detail different approaches and highlight advantages of outstanding resources, such as UniProtKB, Disease Ontology, and Reactome, which provide graph-based solutions. We discuss ongoing efforts of the systems biology community to standardise and harmonise KG creation and the maintenance of integrated resources. Outlining prospects, including the use of GDBs as a way of communication between biological data repositories, we conclude that efficient design, querying, and maintenance of GDBs will be key for knowledge generation in systems biology and other research fields with heterogeneous data.

In this paper, some mixed type bounds on the spectral radius $\rho(A\circ B)$ for the Hadamard product of two nonnegative matrices ($A$ and $B$) and the minimum eigenvalue $\tau(C\star D)$ of the Fan product of two $M$-matrices ($C$ and $D$) are researched. These bounds complement some corresponding results on the simple type bounds. In addition, a new lower bound on the minimum eigenvalue of the Fan product of several $M$-matrices is also presented: $$ \tau(A_{1}\star A_{2}\cdots\star A_{m})\geq \min_{1\leq i\leq n}\{\prod^{m}_{k=1}A_{k}(i,i)-\prod^{m}_{k=1}[A_{k}(i,i)^{P_{k}}-\tau(A_{k}^{(P_{k})})]^\frac{1}{P_{k}}\}, $$ where $A_{1},\ldots, A_{k}$ are $n\times n$ $M$-matrices and $P_{1},\ldots, P_{k}>0$ satisfy $\sum^{m}_{k=1}\frac{1}{P_{k}}\geq 1$. Some special cases of the above result and numerical examples show that this new bound improves some existing results.

Tea (Camellia sinenesis) is a health beneficial beverage and is also a source for extracting bioactive components such as theanine, tea polyphenols (TPP) and tea polysaccharides (TPS). TPS is a group of hetero-polysaccharides bounded with proteins. There were tests showing that TPS had various bioactivities, such as antioxidant, antitumors, antihyperglycemia, anti-inflammation and improving immunity. However, inconsistent results concerning chemical composition and bioactivity of TPS were published in recent years. The advances in chemical composition and bioactivities of TPS were reviewed in the present paper. The inconsistent and controversial results regarding composition and bioactivities of TPS were also discussed.

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

(1) Background: Although diagnostic criteria for massive hemorrhage with organ dysfunction such as disseminated intravascular coagulation associated with delivery have been empirically established based on clinical findings, strict logic has yet to be used to establish numerical criteria. (2) Methods: A dataset of 107 deliveries with ≥2,000 g of blood loss, among 13,368 deliveries from nine national perinatal centers in Japan between 2020 and 2023 was obtained. Twenty-three patients had fibrinogen levels <170 mg/dl, which is the initiation of coagulation system failure per our previous reports. Three of these patients had hematuria. We used six machine learning methods to identify the borderline criteria dividing the fibrinogen/fibrin/fibrinogen degradation product (FDP) planes, using 15 coagulation fibrinolytic factors. (3) Results: The boundaries of hematuria development on a two-dimensional plane of fibrinogen and FDP were obtained. If the FDP–fibrinogen/3–60 (mg/dl) value is positive, this indicates hematuria; otherwise, the case is non-hematuria, as demonstrated by the support vector machine method that seemed the most appropriate. (4) Conclusions: The borderline criterion dividing the fibrinogen/FDP plane for patients with hematuria that could be considered organ dysfunction in massive hemorrhage during delivery was obtained using artificial intelligence, and this method seemed to be useful.

The root system plays an irreplaceable role in plant growth. Its improvement can increase crop productivity. However, such system is still mysterious for us. The underlying mechanism has not been fully uncovered. The investigation on proteins related to the root system is an important means to complete this task. In the previous time, lack of root-related proteins makes it impossible to adopt machine learning methods for designing efficient models for the discovery of novel root-related proteins. Recently, a public database on root-related proteins was set up and machine learning methods can be applied in this field. In this study, we proposed a machine learning based model, named Graph-Root, for identification of root-related proteins. The features derived from protein sequences and one network were extracted, where the former features were processed by graph convolutional neural network and multi-head attention, and the later features abstracted the linkage between proteins. These features were fed into the fully connected layer to make prediction. The 5-fold cross-validation and independent tests suggested its good performance. It also outperformed the only one previous model, SVM-Root. Furthermore, the importance of each feature type and component in the proposed model was investigated.

For a graph G, let P(G, λ) be its chromatic polynomial. Two graphs G and H are said to be chromatically equivalent if P(G,λ) = P(H,λ). A graph is said to be chromatically unique if no other graph shares its chromatic polynomial. In this paper, chromatic polynomial of the necklace graph N_n, for n ≥ 2 has been determined. It is further shown that N₃ is chromatically unique.

We present a Deep Learning generative model specialized to work with graphs with a regular geometry. It is build on a Variational Autoencoder framework and employs Graph convolutional layers in both encoding and decoding phases. We also introduce a pooling technique (ReNN-Pool), used in the encoder, that allows to downsample graph nodes in a spatially uniform and highly interpretable way. In the decoder, a symmetrical un-pooling technique is used to retrieve the original dimensionality of graphs. Performance of the model are tested on the standard Sprite benchmark dataset, a set of 2D images of video game characters, adequately transforming images data into graphs, and on the more realistic use-case of a dataset of cylindrical-shaped graph data that describe the distributions of the energy deposited by a particle beam in a medium.

For a long time, a company's Product Development Process (PDP) was seen as supporting the operations department, although PDP decisions and mistakes have a considerable impact on market performance. This is critical even in agriculture where bad habits and practices in the PDP can lead rural producers to great losses. Therefore, this research investigated the effect on the market performance of rural products (banana) in the southern region of Brazil, based on two analyses: (i) how sustainability practices support the PDP phases and (ii) how the phases of the Product Life Cycle Assessment (LCA) mediate sustainability practices and PDP phases. This study presents a quantitative analysis using Confirmatory Factor Analysis (CFA) and hierarchical ordinary least squares (OLS) regression of data obtained from a survey of 110 rural producers who directly participate in the banana production and planning process in southern Brazil. Our results shows that sustainability practices support the PDP, and we confirm that the product development and post-development phase has an effect on market performance. In addition, we identified that in the pre-development phase of the PDP, dealing with rural products (bananas), the maturity stage of the LCA mediates sustainability. In the PDP development phase, we concluded that rural families that develop economic and environmental practices with their products in the market growth phase may have reduced results. As for the post-development phase of the PDP, we conclude that when companies invest in environmental and social practices, there is a complete mediation of the effect, where these practices lose strength if the product is in the introduction and maturity phases in the market. As originality, our study contributed to demonstrate value on the product life cycle for the product development process in agriculture using sustainability practices through a systemic approach, filling the gap in the literature due to the lack of research on these areas seen in an integrated way.

In this paper we introduce the hypo-q-norms on a Cartesian product of inner product spaces. A representation of these norms in terms of inner products, the equivalence with the q-norms on a Cartesian product and some reverse inequalities obtained via the scalar Shisha-Mond, Birnacki et al., Grüss type inequalities, Boas-Bellman and Bombieri type inequalities are also given.

(1) Background: Grapes and their associated by-products (as grape pomace, GP) stand out for their polyphenol content, which makes them a source of bioactive compounds with antioxidant capacity. The aim of this research was to determine if the inclusion of 50 g/kg of GP in the diet of hens could enrich egg with antioxidants and to study its effect on internal and external egg quality parameters. (2) Methods: A trial was conducted with two genetic lines of hens, which were fed either a control diet or a diet containing 50 g/kg of GP. Performance, internal and external egg quality, and egg yolk content of vitamins E and A, and gallic acid were determined; (3) Results: In eggs laid by hens fed GP diet, Haugh units and yolk colour score were enhanced, and eggshell became thinner, but without affecting the breaking strength. No dietary effect was observed on vitamin contents in yolk. Higher gallic acid content was observed in yolk of eggs laid by hens fed the GP diet, suggesting that some dietary phenolic compounds could be transferred to the eggs. Hen genetics influenced egg weight, albumen Haugh units, shell thickness and α- and γ-tocopherol concentration in yolks; (4) Conclusions: Dietary inclusion of GP improved the internal quality of eggs, enriching yolks with a phenolic compound, but reduced shell thickness.

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.

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

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

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.

: Biological networks such as protein interaction networks, gene regulation networks and metabolic pathways are examples of complex networks which are large graphs with small-world and scale-free properties. Analysis of these networks has a profound effect on our understanding the origins of life, health and disease states of organisms, and diagnose diseases to aid the search for remedial processes. In this review, we describe main analysis methods of biological networks using graph theory by first defining main parameters such as clustering coefficient, modularity and centrality. We then survey fundamental graph clustering methods and algorithms followed by the network motif search algorithms with the aim of finding repeating subgraphs in a biological network graph. A frequently appearing subgraph usually conveys a basic function carried out by that small network and discovering such a function provides an insight to the overall function of the organism. Lastly, we review network alignment algorithms that achieve to find similarities between two or more graphs representing biological networks. A conserved subgraph between the biological networks of organisms may mean a common ancestor and finding such relationship may help researchers derive ancestral relationships and predict the future evolution of organisms to enable designing new drugs. We conclude by the current challenging areas of biological network analysis using graph theory and parallel processing for high performance analysis

The hybrid bond graph has been studied in depth for scalar bond graphs, but how does this translate to the multi-bond graph? Here, the controlled junction – used to model structural switching such as contact – is extended to the multi-bond case. This is a simple process, assuming that all bonds switch simultaneously (which makes physical sense). A controlled 0-junction is applied to multi-bond graph of a car, which can lose contact with the ground in cornering. Dynamic causality features, but this can be accommodated using an equational submodel in 20-Sim (in a manner similar to that used with scalar bond graphs). The junction is proposed for subsequent work to develop a validated multi-body dynamics car model in cornering.

This study addresses the urgent need for sustainable protein sources in aquaculture due to the depletion of marine resources and rising costs. Animal protein sources, particularly poultry by-product meal (PBM) and insect exuviae meal, are investigated as viable alternatives to fishmeal (FM). Research confirms the successful replacement of FM with a combination of PBM and insect exuviae meal (up to 50%) in the diet of European seabass without compromising growth, feed conversion, gut health and liver fat content. In particular, growth performance was robust with both PBM formulations, with the 25% PBM diet showing better results. Histological examinations showed good gut and liver health, contradicting the concerns of previous studies. The study emphasizes the importance of holistic analyzes that go beyond growth parameters and include histomorphological investigations. The results show that PBM in combination with insect/exuviae meal is well tolerated by seabass, which is consistent with literature reports of mitigating negative effects on gut health. A detailed analysis of the microbiota revealed a decrease in the Firmicutes/Proteobacteria ratio due to an increase in potentially pathogenic bacteria. However, the formulation containing insect exuviae partially counteracted this effect by preserving the beneficial Lactobacillus and promoting the synthesis of short-chain fatty acids (SCFA), particularly butyrate. Chitin-rich components from insect exuviae were associated with improved gut health, which was supported by increased production of SCFA, which are known for their anti-inflammatory properties. The study concludes that a combination of PBM and insect/exuviae meal can replace up to 50% of FM in the diet of seabass, supporting sustainable aquaculture practices. Despite some changes in the microbiota, the negative effects are mitigated by the addition of insect exuviae, highlighting their potential as a prebiotic to increase fish productivity and contribute to a circular economy in aquaculture.

Here we present a fast and highly scalable community structure preserving network module detection that recursively integrates graph sparsification and clustering. Our algorithm, called SparseClust, participated in the most recent DREAM community challenge on disease module identification, an open competition to comprehensively assess module identification methods across a wide range of biological networks.

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.

Product Development Process is widely known among industry and automobile companies. With the advance of technology and the need to improve product efficiency, many companies have been applying Lean Thinking principles. Their benefits lead those companies to implement their concepts and tools, like Value Stream Design in Indirect Areas, Obeya, Just-in-time (JIT) which is based on the production control system developed and implemented by Toyota. This article describes the case study of the implementation of Lean Product & Process Development (LPPD) on the current Product Development Process (PDP) in an automotive company. The PDP was created by the organization and adapted from Advanced Product Quality Planning (APQP). The main findings were a Value Stream Design model of an improved PDP as a useful and successfully contribution for the company. These improvements reduced the product development lead time from 700 days to 369 days. The process efficiency increased from 68% to 85%. The communication and transparency between the cross-functional team (CFT) was improved and show promise for achieving a successful launch of new products.

Natural products (NPs) are a rich source of structurally novel molecules, and the chemical space they encompass is far from being fully explored. Over history, NPs have represented a significant source of bioactive molecules and have served as a source of inspiration for developing many drugs on the market. On the other hand, computer-aided drug design (CADD) has contributed to drug discovery research, mitigating costs and time. In this sense, compound databases represent a fundamental element for the CADD. This work reviews the progress toward developing compound databases of natural origin, particularly databases developed in Latin America, and their practical applications in the drug discovery area. We also survey the computational methods, emphasizing chemoinformatic approaches to profile natural product databases.

This paper is devoted to the study of reproducing kernels on 2-inner product Hilbert spaces. We focus on a new structure to produce reproducing kernel Hilbert and Banach spaces. According to multi-variable computing, this structures can be useful in electrocardiographs, machine learning and economy

For disciplines like biological science, security, and the medical field, link prediction is a popular research area. To demonstrate the link prediction many methods have been proposed. Some of them that have been demonstrated through this review paper are TransE, Complex, DistMult, and DensE models. Each model defines link prediction with different perceptions. We argue that the practical performance potential of these methods, having similar parameter values, using the fine-tuning technique to evaluate their reliability and reproducibility of results. We describe those methods and experiments; provide theoretical proofs and experimental examples, demonstrating how current link prediction methods work in such settings. We use the standard evaluation metrics for testing the model's ability.

Graph neural networks (GNNs) build on the success of deep learning models by extending them for use in graph spaces. Transfer learning has proven extremely successful for traditional deep learning problems: resulting in faster training and improved performance. Despite the increasing interest in GNNs and their use cases, there is little research on their transferability. This research demonstrates that transfer learning is effective with GNNs, and describes how source tasks and the choice of GNN impact the ability to learn generalisable knowledge. We perform experiments using real-world and synthetic data within the contexts of node classification and graph classification. To this end, we also provide a general methodology for transfer learning experimentation and present a novel algorithm for generating synthetic graph classification tasks. We compare the performance of GCN, GraphSAGE and GIN across both the synthetic and real-world datasets. Our results demonstrate empirically that GNNs with inductive operations yield statistically significantly improved transfer. Further we show that similarity in community structure between source and target tasks support statistically significant improvements in transfer over and above the use of only the node attributes.

A wide variety of bacteria, fungi and plants can produce bioactive secondary metabolites, which are often referred to as natural products. With the rapid development of DNA sequencing technology and bioinformatics, a large number of putative biosynthetic gene clusters have been reported. However, only a few natural products can be detected when isolated species are grown under conventional laboratory conditions, as most biosynthetic gene clusters are not expressed or are expressed at extremely low levels at these conditions. With the rapid development of synthetic biology, advanced genome mining and modification strategies have been reported, and they provide new opportunities for discovery of natural products. This review discusses advances in recent years that can accelerate the design, build, test, and learn (DBTL) cycle of natural product discovery, and prospects trends and key challenges for future research directions.

Ocean surface heat fluxes play a significant role in the genesis and evolution of various marine-based atmospheric phenomena, from the synoptic scale down to the microscale. While in-situ measurements from buoys and flux towers will continue to be the standard in regards to surface heat flux estimates, they commonly have significant gaps in temporal and spatial coverage. Previous and current satellite missions have filled these gaps; though they may not observe the fluxes directly, they can measure the variables needed (wind speed, temperature, and humidity) to estimate latent and sensible heat fluxes. However, current remote sensing instruments have their own limitations, such as infrequent coverage, signals attenuated by precipitation, or both. The Cyclone Global Navigation Satellite System (CYGNSS) mission overcomes these limitations over the tropical and subtropical oceans by providing improved coverage in nearly all weather conditions. While CYGNSS (Level 2) primarily estimates surface winds, when coupled with observations or estimates of temperature and humidity from reanalysis data, it can provide estimates of latent and sensible heat fluxes along its orbit. This paper describes the development of the Surface Heat Flux Product for the CYGNSS mission, its current results, and expected improvements and changes in future releases.

We discuss further details on the concepts of “drug-likeness”, “lead-likeness”, and “natural product-likeness”. The discussion will first focus on natural products as drugs, then a discussion of previous studies in which the complexities of the scaffolds and chemical space of naturally occurring compounds have been compared with synthetic, semi-synthetic compounds and FDA-approved drugs. This is followed by guiding principles for designing “drug-like” natural product libraries for lead compound discovery purposes. We end up by presenting a tool for measuring “natural product-likeness” of compounds and a brief presentation of machine learning approaches and a binary quantitative structure-activity relationship (QSAR) for classifying drugs from non-drugs and natural compounds from non-natural ones, respectively.

Next-generation cancer and oncology research needs to take full advantage of the multi-modal structured, or graph, information, with the graph datatypes ranging from molecular structures to spatially resolved imaging and digital pathology to biological networks to knowledge graphs. Graph Neural Networks (GNNs) efficiently combine the graph structure representations with the high predictive performance of deep learning, especially on the large multi-modal datasets. In this review article, we survey the landscape of recent (2020-present) GNN applications in the context of cancer and oncology research, and delineate six currently predominant research areas. Subsequently, we identify the most promising directions for future research. We compare GNNs with graphical models and "non-structured" deep learning, and devise the guidelines for cancer and oncology researchers or physician-scientists asking the question of whether they should adopt the GNN methodology in their research pipelines.

Graphs are largely used in computer science to model relations, or associations, among entities the compose complex systems. More recently, they found a broad field of application in bioinformatics and medical informatics supporting modelling, analysis of many systems. The applications span from representing interactions among molecules within cells, to model the functions of the brains. In order to support research, algorithms from graph theory that are able to extract knowledge from network should be coupled to efficient visualisation techniques. Although the importance of such topic, we retain that many challenges should be faced in the futures, such as automated pathway and network layout to better match biologists’ needs, the developing of a standard able to give more and better choices to represent nodes, edges finally, the developing of automated mechanism able to improve the network navigation methods that help users manage large and complex networks with the goal to improve the usability.

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.

This paper proposes an interpretable geometry solution based on the formal language set of text and diagram. Geometry problems are solved by machines, which still poses challenges in natural language processing and computer vision. Significant progress promotes existing methods in the extraction of geometric formal languages. However, the neglect of the graph structure information in the formal language and the lack of further refinement of the extracted language set can lead to the poor effect of the theorem prediction and affect the accuracy in problem solving. In this paper, the formal language graph is constructed by the extracted formal language set and used to theorem prediction by graph convolutional network. So as to better extract the relationship set of diagram elements, an improved diagram parser was proposed. The test results indicate that the improved method has good results in solving the problem with interpretability geometry.

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

Many parameters and complex boundaries are involved in the spatial arrangement of an under-ground powerhouse for a hydropower station, which requires reference to many relevant cases and specifications. However, in practical applications, retrieving relevant cases or specifications is difficult, and there is a lack of knowledge of cascading logic among design parameters. For this question, a targeted knowledge graph based on knowledge graph management technology is established to support subsequent applications. This paper proposes a new concept of con-structing a knowledge graph for building information modeling (BIM) underground power-houses of hydropower stations. Firstly, the ontology skeleton of hydropower station spatial ar-rangement design, which represents the knowledge organization structure of the knowledge graph, is reconstructed by carefully analyzing the requirements for intelligent modeling of un-derground powerhouses. A large amount of unstructured data is identified based on optical character recognition (OCR) technology and is divided into words to extract correlation knowledge based on THULAC. In the next step, the knowledge triad of the spatial arrangement of the underground powerhouse is extracted based on ChatGPT and stored in a Neo4j knowledge base to build a knowledge graph. Finally, the knowledge graph is serviced to realize the query of knowledge and parameter recommendation to assist the digital intelligent design of spatial arrangement of an underground powerhouse of pumped storage hydropower stations.

The accurate prediction of molecular properties such as lipophilicity and aqueous solubility are of great importance and pose challenges in several stages of the drug discovery pipeline. Machine learning methods like graph-based neural networks (GNNs) have shown exceptionally good performance in predicting these properties. In this work, we introduce a novel GNN architecture, called directed edge graph isomorphism network (D-GIN). It is composed of two distinct sub-architectures (D-MPNN, GIN) and achieves an improvement in accuracy over its sub-architectures employing various learning, and featurization strategies. We argue that combining models with different key aspects help make graph neural networks deeper and simultaneously increase their predictive power. Furthermore, we address current limitations in assessment of deep-learning models, namely, comparison of single training run performance metrics, and offer a more robust solution.

mRNA-lipid nanoparticle (LNP) medicinal products can be considered a platform technology because the development process is similar for different diseases and conditions, with similar noncoding mRNA sequences and lipid nanoparticles and essentially unchanged manufacturing and analytical methods utilised often for different products. It is critical not to lose the momentum built using the platform approach during the development, regulatory approval and rollout of vaccines for SARS-CoV-2 and its variants. This Review proposes a set of modifications to existing regulatory requirements for mRNA products, based on a platform perspective for quality, manufacturing, preclinical and clinical data. For the first time, we address development and potential regulatory requirements when the mRNA sequences and LNP composition vary in different products as well. In addition, we propose considerations for self-amplifying mRNA, individualised oncology mRNA products and mRNA therapeutics. Providing a predictable development pathway for academic and commercial groups, so they can know in detail what product characterisation and data are required to develop a dossier for regulatory submission, has many potential benefits. These include reduced development and regulatory costs; faster consumer/patient access and more agile development of products in the face of pandemics; and for rare diseases where alternatives may not exist or to increase survival and the quality of life in cancer patients. Therefore, achieving consensus around platform approaches is both urgent and important. This approach with mRNA can be a template for similar platform frameworks for other therapeutics and vaccines to enable more efficient development and regulatory review.

Institutional sustainability is a dynamic and multifaceted concept that relies on the contributions of various institutions, including the legal and the scientific system. On the other side, consumers boycotts are an expression of political consumerism by which consumers can use their market power to attain sustainability objectives. This article explores institutional trust on the legal system and trust on scientists as potential drivers for consumers’ boycotts. Using data retrieved from the European Social Survey covering twenty-five countries, the study employs binary logistic regression to assess the importance of institutional trust and other potential drivers of product boycotts in Europe. Results confirm that boycotting behaviour is affected by institutional trust, as well as other individual variables including gender, age and life-cycle effects, education, interest in politics and level of satisfaction with the political system, generalized trust, personal well-being, and consumers’ use and perceptions of information and communication technologies. The results of this study enrich the literature on consumer boycotts and have implications for policymakers involved in sustainability initiatives.

The current paper has examined the effect of both export product diversification and poverty on non-resource tax revenue in developing countries. The analysis has used an unbalanced panel dataset of 111 countries over the period 1980-2014. Based on the Blundell and Bond two-step system Generalized Methods of Moments technique, the empirical analysis has shown interesting findings. Export product concentration and poverty influence negatively non-resource tax revenue over the full sample, but this effect varies across countries in the sample. Furthermore, the effect of export product diversification on non-resource tax revenue performance depends on the level of poverty. It appears that export product diversification influences positively non-resource tax revenue performance in countries that experience lower poverty rates. From a policy perspective, these findings show that policies in favour of diversifying export product baskets and reducing poverty would contribute to enhancing non-resource tax revenue performance in developing countries.

The accuracy of sales prediction models based on the big data of online word-of-mouth (eWOM) is still not satisfied. We argue that eWOM contains heat and sentiments of different product dimensions, which can improve the accuracy of these models. In this paper, we propose a dynamic topic analysis (DTA) framework in order to extract heat and sentiments of product dimensions from the big data of eWOM. Finally, we propose an autoregressive-heat-sentiment (ARHS) model, which integrates heat and sentiments of dimensions into the baseline predictive model. The empirical study in movie industry confirms that heat and sentiments of dimensions can improve the accuracy of sales prediction model. ARHS model is better for movie box-office revenue prediction than other models.

：Non-Euclidean data, such as social networks, and citation relationships between documents, has node information and structural information. Graph Convolutional Network(GCN) can automatically learn node features and association information between nodes. The core ideology of the graph convolutional network is to aggregate node information by using edge information, thereby generating a new node feature. In the process of updating node features, there are two core influencing factors. One is the number of neighboring nodes of the central node, the other is the contribution of the neighboring nodes to the central node. Due to the previous GCN methods not simultaneously considering the numbers and different contributions of neighboring nodes to the central node, we design the Adaptive Attention Mechanism(AAM). To further enhance the representational capability of the model, we utilize Multi-Head Graph Convolution(MHGC). Finally, we adopt cross-entropy(CE) loss function to describe the difference between the predicted results of node categories and the ground truth (GT). Combined with backpropagation, this ultimately achieves accurate node classification. Based on AAM, MHGC and CE, we contrive the novel Graph Adaptive Attention Network (GAAN). Experiments show that the classification accuracy has achieved outstanding performances on Cora, Citeseer and Pubmed datasets.

This report gives a comprehensive summary of two problems about graph convolutional networks (GCNs): over-smoothing and heterophily challenges, and outlines future directions to explore.

The main goal of the Soil Moisture and Ocean Salinity (SMOS) mission over land surfaces is the production of global maps of soil moisture (SM) and vegetation optical depth (τ) based on multi-angular brightness temperature (TB) measurements at L-band. The operational SMOS Level 2 and Level 3 soil moisture algorithms account for different surface effects, such as vegetation opacity and soil roughness at 4 km resolution, in order to produce global retrievals of SM and τ. In this study, we present an alternative SMOS product which was developed by INRA (Institut National de la Recherche Agronomique) and CESBIO (Centre d’Etudes Spatiales de la BIOsphère). This SMOS-INRA-CESBIO (SMOS-IC) product provides daily SM and τ at the global scale and differs from the operational SMOS Level 3 (SMOSL3) product in the treatment of retrievals over heterogeneous pixels. Specifically, SMOS-IC is much simpler and does not account for corrections associated to the antenna pattern and the complex SMOS viewing angle geometry. It considers pixels as homogeneous to avoid uncertainties and errors linked to inconsistent auxiliary data sets which are used to characterize the pixel heterogeneity in the SMOS L3 algorithm. SMOS-IC also differs from the current SMOSL3 product (Version 300, V300) in the values of the effective vegetation scattering albedo (ω) and soil roughness parameters. An inter-comparison is presented in this study based on the use of ECMWF (European Center for Medium range Weather Forecasting) SM outputs and NDVI (Normalized Difference Vegetation Index) from MODIS (Moderate-Resolution Imaging Spectroradiometer). A 6 year (2010-2015) inter-comparison of the SMOS products SMOS-IC and SMOSL3 SM (V300) with ECMWF SM yielded higher correlations and lower ubRMSD (unbiased root mean square difference) for SMOS-IC over most of the pixels. In terms of τ, SMOS-IC τ was found to be better correlated to MODIS NDVI in most regions of the globe, with the exception of the Amazonian basin and of the northern mid-latitudes.

Excretory-secretory products (ESPs) are the main research targets for investigating the hosts and helminths interaction. Parasitic worms can migrate to parasitic sites and avoid the host immune response by secreting this product. Angiostrongylus cantonensisis an important food-borne zoonotic parasite that causes severe neuropathological damage and symptoms, including eosinophilic meningitis or meningoencephalitis in humans. Benzaldehydes are organic compounds composed of a benzene ring and formyl substituents. This compound has anti-inflammatory and antioxidation properties. Previous studies showed that 3-hydroxybenzaldehyde (3-HBA) and 4-hydroxybenzaldehyde (4-HBA) can reduce apoptosis in A. cantonensis ESPs treated astrocytes. These results on the protective effect underlying benzaldehyde have primarily focused on cell survival. The study was designed to investigate the molecular mechanisms of endoplasmic reticulum stress (ER stress) and oxidative stress in astrocytes in A. cantonensis ESPs treated astrocytes and to evaluate the therapeutic consequent of 3-HBA and 4-HBA. First, we initially established the RNA-seq dataset in each group, including Normal, ESPs, ESPs+3-HBA, and ESPs+4-HBA. We also found that benzaldehyde (3-HBA and 4-HBA) can stimulate astrocytes to express ER stress-related molecules after ESP treatment. The level of oxidative stress could also be decreased in astrocytes by elevating antioxidant activity and reducing ROS generation. These results suggested that benzaldehyde may be a potential therapeutic compound for human angiostrongyliasis to support brain cell survival by inducing the expression levels of ER stress- and oxidative stress-related pathway.

In this article, we prove an orthogonal decomposition theorem for real inner product gyrogroups, which unify some well-known gyrogroups in the literature: Einstein, M\"{o}bius, Proper Velocity, and Chen's gyrogroups. This leads to the study of left (right) coset partition of a real inner product gyrogroup induced from a subgyrogroup that is a finite-dimensional subspace. As a result, we obtain gyroprojectors onto the subgyrogroup and its orthogonal complement. We construct also quotient spaces and prove an associated isomorphism theorem. The left (right) cosets are characterized using gyrolines (cogyrolines) together with automorphisms of the subgyrogroup. With the algebraic structure of the decompositions, we study fiber bundles and sections inherited by the gyroprojectors. Finally, the general theory is exemplified for the aforementioned gyrogroups.

The proposed method deals with the problem of data privacy and sharing when processing personal mobility tracking data. Previous methods concentrate on producing highly detailed data on short-term and restricted areas, e.g. for autonomous driving scenarios. Another possibility consists of city-wide scales and beyond, that are used to predict general traffic flows. The presented approach takes the tracked mobility behavior of individuals to create coherent new mobility data that reflects the long-term mobility behavior of the person, guaranteeing location persistency and sound embedding within the point-of-interest structure of the observed area. After an analysis and clustering step with the original data, the area is distributed into a geospatial grid structure (H3 is used here), and the neighborhood relationships between the grids are interpreted as a graph. A feed-forward-autoencoder and a graph encoding-decoding network generate a latent space representation of the area. The original clustered data is associated with their respective H3 grids. With a greedy algorithm approach and concerning privacy strategies, new combinations of grids are top-level patterns for individual mobility behavior. Concrete locations are found and connected within the grids based on the original data. The described method is then applied to a study with 1000 participants from the city of Munich in Germany, and the results are described, showing the application of the approach in generating synthetic data, enabling further research on individual mobility behavior and patterns. The result is a sharable dataset on the same abstraction level as the input data, which makes it interesting, particularly for machine learning applications.

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.

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.

It is shown how the secondary structure of proteins, musical forms and verses of poems are approximately ruled by universal laws relying on graph coverings. In this direction, one explores the group structure of a variant of the SARS-Cov-2 spike protein and the group structure of apolipoprotein-H, passing from the primary code with amino acids to the secondary structures organizing the foldings. Then one look at the musical forms employed in the classical and contemporary periods. Finally, one investigates in much detail the group structure of a small poem in prose by Charles Baudelaire and that of the Bateau Ivre by Arthur Rimbaud.

The fourth industrial revolution, also known as Industry 4.0, has led to an increased transition towards automation and reliance on data-driven innovations and strategies. Companies in the manufacturing sector are heavily integrating Industry 4.0 technologies, including cloud compu-ting, cyber-physical systems (CPS), big data analytics, horizontal and vertical system integration, the internet of things (IoT), and additive manufacturing (3d printing). The interconnected systems and processes have significantly increased operational efficiency, enhanced organizational capacity to monitor and control functions, reduced costs, and improved product quality. One significant way that companies have achieved these benefits is by integrating diverse sensor technologies within these innovations, allowing critical data collection on products, equipment performance, and maintenance. The sensors connect systems and machines, allowing them to communicate and track operations for enhanced operations. While numerous research has been conducted to show the role of sensors in industry 4.0, limited studies show how these innovations can leverage product design to maximize benefits and opportunities. Given the rapidly changing market conditions, Industry 4.0 requires new products and business models to ensure companies adjust to the current and future changes. These requirements call for the evolutions in product design processes to accommodate design features and principles applicable in the current dynamic business environment. This research paper employs a systematic bibliometric literature review (LRSB) methodology to explore and synthesize data on how Industry 4.0 and sensors can leverage product design. The results show that various product design features create opportunities to be leveraged to guarantee the success of Industry 4.0 and sensor technologies. However, the research also identifies numerous challenges that undermine the ongoing transition towards intelligent factories and products.

This qualitative research explores the dynamics of collaborative marketing and supply chain strategies for enhanced product lifecycle management. Through in-depth interviews with industry stakeholders, key themes, challenges, and implications of collaboration emerge. Trust, communication, technology, strategic alignment, and sustainability are identified as critical factors driving successful collaboration. The study highlights the transformative potential of collaboration in driving innovation, efficiency, and customer satisfaction. Despite challenges such as aligning objectives and ensuring data security, collaborative strategies offer significant opportunities for value creation and differentiation. The findings underscore the importance of building trust, leveraging technology, and integrating sustainability considerations in collaborative efforts. Strategic alignment and cultural fit among partners are essential for overcoming differences and achieving common goals. The implications of the research extend to practitioners seeking to enhance collaboration in their organizations and researchers exploring collaborative practices in different industries and contexts. Future research could further explore the impact of collaboration on stakeholder perspectives and outcomes. By addressing challenges and leveraging opportunities, organizations can maximize the benefits of collaborative marketing and supply chain strategies to drive sustainable growth and competitive advantage in today's dynamic business landscape.

Regular regimes of oil and oil products pipelines are studied. The problem is to develop an algorithm of effective pipeline system control that ensures the fulfillment of specified boundary conditions at the system boundaries. The product is pumped in batches, the flow is characterized by a change in temperature and pressure flow parameters over time. The developed solution method uses the principle of decomposition in the sense that each computational iteration is im-plemented in 3 stages, in three nested loops. The inner cycle is connected with the material bal-ance relations, at the next cycle the flow equations are introduced and the fulfillment of the 2nd Kirchhoff's law is monitored. If the flow process is significantly affected by temperature, then an external cycle is also implemented, correcting the solution so that the energy conservation equa-tion is satisfied. In the calculation procedure, some computational difficulties may arise, which consist in choosing an appropriate optimization method. On a specific example, the possibility of using various library programs to solve the problem was checked. The developed method is suita-ble for the analysis of systems of arbitrary topology. Since the method is not time-consuming, it can be recommended for online control of oil and oil products supply systems. The paper opens a new direction in the theory of hydraulic circuits. It uses both traditional methods of continuum mechanics and stochastic models.

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.

Due to the inclusion of both the principles and divination methods, the study of Yijing (Yijing) becomes more complex. The complex data types, diverse semantic relationships, and unclear influencing mechanisms in Yijing pose challenges to its scientific research. Knowledge graph, as an advanced way of organizing knowledge, can provide technical support in exploring the hidden connections and knowledge structure within text resources. This paper proposes a method of constructing a Yijing knowledge graph based on Neo4j. By analyzing the concepts, entities, and various related relationships in Yijing, the method discusses the basic architecture, data model, and implementation steps of constructing the Yijing knowledge graph. It also extracts, integrates, and structures the Yijing knowledge, allowing for inquiries, associations, and reasoning about the knowledge and its various elements. By adopting a top-down approach, the paper reconstructs the fundamental knowledge system of the Yijing, including yin-yang, the five elements, generation and restriction, 64 hexagrams, and six lines(yao). It establishes a knowledge graph pattern layer and a data layer that encompass concepts, attributes, and relationships. With the technical support of the Neo4j platform, the visualization and retrieval of Yijing knowledge are realized, providing new ideas and methods for studying the mechanisms of the Yijing. The proposed method of constructing a Yijing knowledge graph can be expanded to other types of ancient scripture knowledge graph research and can be applied to the field of digital humanities, promoting in-depth cross-disciplinary research and integration.

This research uses the computing of conceptual distance to measure information content in Wikipedia categories. The proposed metric, generality, relates information content to conceptual distance by determining the ratio of information a concept provides to others compared to the information it receives. The DIS-C algorithm calculates generality values for each concept, considering each relationship's conceptual distance and distance weight. The findings of this study were compared to current methods in the field and found to be comparable to results obtained using the WordNet corpus. This method offers a new approach to measuring information content applied to any relationship or topology in conceptualization.

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.

List-only entity linking is the task of mapping ambiguous mentions in texts to target entities in a group of entity lists. Different from traditional entity linking task, which leverages rich semantic relatedness in knowledge bases to improve linking accuracy, list-only entity linking can merely take advantage of co-occurrences information in entity lists. State-of-the-art work utilizes co-occurrences information to enrich entity descriptions, which are further used to calculate local compatibility between mentions and entities to determine results. Nonetheless, entity coherence is also deemed to play an important part in entity linking, which is yet currently neglected. In this work, in addition to local compatibility, we take into account global coherence among entities. Specifically, we propose to harness co-occurrences in entity lists for mining both explicit and implicit entity relations. The relations are then integrated into an entity graph, on which Personalized PageRank is incorporated to compute entity coherence. The final results are derived by combining local mention-entity similarity and global entity coherence. The experimental studies validate the superiority of our method. Our proposal not only improves the performance of list-only entity linking, but also opens up the bridge between list-only entity linking and conventional entity linking solutions.

The growth rate in academic and scientific publications increased very fast. Researchers must choose a good representative and significant literature in publications, which has become challenging worldwide. Usually, the paper citation number indicates this paper's potential influence and importance. However, this standard metric of citation numbers cannot be used as a measurement to judge the popularity and significance of the recently published papers. To address this challenge, this paper presents an effective prediction method called FutureCite to predict the future citation level of research articles. FutureCite combines machine learning with text and graph mining techniques, leveraging their abilities in classification, datasets in-depth analysis, and feature extraction. FutureCite aims to predict future citation levels of research articles applying a multilabel classification approach. FutureCite can extract significant semantic features and capture the interconnection relationships found in scientific articles during feature extraction using textual content, citation networks, and metadata as feature resources. Our goal is to contribute to the advancement of substantial effective approaches impacting the citation counts in scientific publications by enhancing the precision of future citations. We conducted several experiments using a comprehensive publication dataset to evaluate our method and determine the impact of using a variety of machine learning algorithms. FutureCite demonstrated its robustness and efficiency and showed promising results based on different evaluation metrics. Using the FutureCite model has significant implications in improving the researchers' ability to determine targeted literature for their research and better understand the potential impact of research publications.

In recent years, there has been significant growth in the ubiquity and popularity of three dimensional(3D) point clouds, with an increasing focus on the classification of 3D point clouds. To extract richer features from point clouds, many researchers have turned their attention to various point set regions and channels within irregular point clouds. However, this approach has limited capability in attending to crucial regions of interest in 3D point clouds and may overlook valuable information from neighboring features during feature aggregation. Therefore, this paper proposes a novel 3D point cloud classification method based on global attention and adaptive graph convolution. The method consists of two main branches: the first branch com-putes attention masks for each point, while the second branch employs adaptive graph convolu-tion to extract global features from the point set. It dynamically learns features based on point interactions, generating adaptive kernels to effectively and precisely capture diverse relationships among points from different semantic parts. Experimental results demonstrate that the proposed model achieves 93.8% in overall accuracy and 90.8% in average accuracy on the ModeNet40 dataset.

An important indicator of human-related pollution in watersheds is dissolved oxygen (DO). The DO is highly dependent on both space and time characteristics of the watershed and is directly linked to eutrophication, which impairs the development of both the aquatic fauna and flora, also negatively impacting the water quality. Aspiring to reach a more accurate and precise forecasting approach to predict levels of DO, the present work proposes new graph-based and transformer-based deep learning models. The models were trained and validated for the Credit River Watershed, and the results were compared with both benchmarking and literature-found approaches. The proposed Graph Neural Network Sample and Aggregate (GNN-SAGE) model was the best-performing approach, reaching coefficient of determination (R2) and Root Mean Squared Error (RMSE) values of 97% and 0.34 ppm, respectively. The findings from the Shapley additive explanations (SHAP) indicated that the GNN-SAGE benefited from spatiotemporal information from the surrounding stations, improving the model’s results, and that temperature is a major input attribute for determining future DO levels. The results established that the proposed GNN-SAGE model stands as a state-of-the-art solution for DO forecasting, with potential for real-time water quality applications.

Convolutional neural networks (CNN) have attracted much attention as a commonly used method for hyperspectral image (HSI) classification in recent years, however, CNNs can only be applied to Euclidean data and have limitations in dealing with relationships due to the limitations of local feature extraction. However, each pixel of a hyperspectral image contains a set of spectral bands that are correlated and interact with each other, and the methods used to process Euclidean data cannot effectively obtain these correlations. In contrast, the graph convolutional network (GCN) can be used in non-Euclidean data, but usually leads to oversmoothing and ignoring local detail features due to the need for superpixel segmentation processing to reduce computational effort. To overcome the above problems, we constructed a network a fusion network based on GCN and CNN, which contains two branches: a graph convolutional network based on superpixel segmentation and a convolutional network with added attention mechanism. The graph convolu-tional branch can extract the structural features and capture the relationships between the nodes, and the convolutional branch can extract the detailed features in the local fine region. Owing to the fact that the features extracted from the two branches are different, the classification performance can be improved by fusing the complementary features extracted from the two branches. To vali-date the proposed algorithm, experiments were conducted on three widely used datasets, namely Indian Pines, Pavia University, and Salinas, and the overall accuracy of 98.78% was obtained in the Indian Pines dataset, and the overall accuracy of 98.99% and 98.69% was obtained in the other two datasets. The results showed that the proposed fusion network can obtain richer features and achieve high classification accuracy.

With the rapid development of the Internet industry, the problem of information overload has arisen due to the abundance of information available online. Recommendation algorithms, as the core of recommendation systems, have been attracting much attention and are a hot topic of research for many experts and scholars. The classical recommendation algorithms are mainly divided into three major categories: collaborative filtering recommendation algorithms, content-based recommendation algorithms, and hybrid-based recommendation algorithms. Although these algorithms are widely used in various fields, with the proliferation of information, these traditional recommendation algorithms are no longer able to meet the needs of the times. To address this issue, recommendation systems have been developed to provide users with personalized and relevant information or products. Despite the wide use of recommendation algorithms, such as collaborative filtering, content-based filtering, and hybrid approaches, traditional recommendation algorithms have limitations and are no longer suitable for meeting the demands of the times. This paper proposes a new recommendation algorithm, SFRRG, that fuses structure and feature information in graph neural networks to improve the performance of the recommendation system in rating prediction. The effectiveness of the proposed algorithm is demonstrated through experiments on various data sets and compared with existing recommendation algorithms.

The chemical graph theory is a subfield of mathematical chemistry which applies classic graph theory to chemical entities and phenomena. Chemical graphs are main data structures to represent chemical structures in cheminformatics. Computable properties of graphs lay the foundation for (quantitative) structure activity and structure property predictions - a core discipline of cheminformatics. It has a historic relevance for natural sciences, such as chemistry, biochemistry and biology, and is in the heart of modern disciplines, such as cheminformatics and bioinformatics. This review first covers the history of chemical graph theory, then provides an overview of its various techniques and applications for CASE, and finally summarises modern tools using chemical graph theory for CASE.

This article aims to solve the problem of robust supervision of a reverse osmosis desalination system (RO-DS) with two models, external model and bond graph model. The structure of an industrial system from the point of view of the external model operates according to several modes of operation (degraded and normal). For this external model, we cannot locate the faults since we are talking about a global operation of the system. The possible solution for the development of research was to use the multidisciplinary model called bond graph. This model by its graphic nature and using a unified language makes it possible to model the industrial system element by element from where it helps the user not only to detect the faults but also to locate them when they appear in the system. The results suggest that the use of the bond graph model for alarm 02 is a reverse osmosis error (RO1); these phenomena are readable on the bond graph model and can be quantified by equations. The equation of the model of this reverse osmosis (RO1) is found in the residual equations (r5, r6 and r7), so that these residues will be sensitive to this rupture. The possible solution during research development was to use the bond graph model to supplement information with physical knowledge and to locate faults. This article also describes the operating safety (by minimizing false alarms and non-detections as well as delays in fault detection) of the desalination system by using the bond graph model described in Linear Fractional Transformation (LFT) form for enable it to manage the robust supervision of a desalination system. An approach based on (LFT-BG) is developed to monitor tank leakage (Cu) and reverse osmosis (RO1 and RO2) faults or valve level (V1 and V2) closures and membrane clogging reverse osmosis (Rm1 and Rm2) that can occur in the reverse osmosis desalination system (RO-DS).

To remain competitive in the current market, an enterprise must differentiate itself based on higher value propositions. For this purpose, since improving the product or service performance can reach some limits, one potential solution is to move towards new combinations of products and services. This evolution, called servitization, leads to the generation of Product-Service Systems (PSS). Servitization requires not only a clear understanding of enterprise core business but also a clear vision on the prevailing trends and challenges of PSS development from both business and technological points of view. In addition, the evolution path should be aligned with the enterprise strategy. This paper first highlights the notion of symbiotic PSS where Product Systems and Service Systems, and their stakeholders, interoperate seamlessly based on a win-win approach. Then it proposes a PSS Conceptual Framework (PSS-CF) which can be applied in the early stages of servitization to increase the understating of PSS dimensions and to facilitate the prioritization of the servitization investments. The framework dimensions were discussed in several iterations, from both academic and industrial points of view, in the frame of a European research project. Moreover, the applicability of the framework was studied in four different industrial Use-Cases.

Servitization or productization, indicating evolution from product to service economy or vice-versa, can be considered as a successful strategy to gain competitiveness based on novel combination of products and services. To decrease the risks of servitization and to support the sustainable development of its main outcome, being Product Service System (PSS), it is required not only to have a clear and common understanding of the core business and processes but also to share the same definitions on (PSS) concepts as the main outcome of servitization. For this purpose, managers could be supported by abstract models with a limited number and high ratio of known concepts in the early stages of PSS development. Through an extensive literature review on this subject, followed by a structured conceptualization approach and discussions with domain experts, this paper proposes a Conceptual Model (PSS-CM). To validate the results, PSS-CM and its elements were discussed in several iterations, from both academic and industrial points of view, in the frame of a European research project. In the frame of this project, a case study was also performed to illustrate the instantiation of PSS-CM.

We present a new method of estimating fitness of countries and complexity of products by exploiting a non-linear non-homogeneous map applied to the publicly available information on the goods exported by a country. The non homogeneous terms guarantee both convergence and stability. After a suitable rescaling of the relevant quantities, the non homogeneous terms are eventually set to zero so that this new method is parameter free. This new map reproduces the findings of the method proposed by Tacchella et al. [1], and allows for an approximate analytic solution in case of actual binarized matrices based on the Revealed Comparative Advantage (RCA) indicator. This solution is connected with a new quantity describing the neighborhood of nodes in bipartite graphs, representing in this work the relations between countries and exported products. Moreover, we define the new indicator of country net-efficiency quantifying how a country efficiently invests in capabilities able to generate innovative complex high quality products. Eventually, we demonstrate analytically the local convergence of the algorithm.

Numerous goods and services are now offered through online platforms due to the recent growth of online transactions like e-commerce. Users have trouble locating the product that best suits them from the numerous products available in online shopping. Many studies in deep learning-based recommender systems (RSs) have focused on the intricate relationships between the attributes of users and items. Deep learning techniques have used consumer or item-related traits to improve the quality of personalized recommender systems in many areas, such as tourism, news, and e-commerce. Various companies, primarily e-commerce, utilize sentiment analysis to enhance product quality and effectively navigate today's business environment. Customer feedback regarding a product is gathered through sentiment analysis, which uses contextual data to split it into separate polarities. The explosive rise of the e-commerce industry has resulted in a large body of literature on e-commerce from different perspectives. Researchers have made an effort to categorize the recommended future possibilities for e-commerce study as the field has grown. There are several challenges in e-commerce, such as fake reviews, frequency of user reviews, advertisement click fraud, and code-mixing. In this review, we introduce an overview of the preliminary design for e-commerce. Second, the concept of deep learning, e-commerce, and sentiment analysis are discussed. Third, we represent different versions of the commercial dataset. Finally, we explain various difficulties facing RS and future research directions.

In this article we first write a brief review of supersymmetric quantum mechanics and then we discuss the equivalence of two co-existing formalisms viz. tensor product formalism and partner hamiltonian formalism for 1-D SUSY Harmonic oscillator. Finally, we present a Mathematica code with which one can calculate the eigenstates of any 1-D SUSY partner Hamiltonian along with two illustrated examples of 1-D SUSY HO and 1-D SUSY infinite potential box.

The prim objective of commenced article is to determine q-sumudu transforms of a product of unified family of q-polynomials with basic (or q-) analogue of fox’s H-function and q-analog of I-functions. Specialized cases of the leading outcome are further evaluated as q-sumudu transform of general class of q-polynomials and q-sumudu transforms of the basic analogues of Fox’s H-function and I-functions.

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.

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.

In the realm of autonomous vehicle environment perception, the primary objective of point cloud target detection is to swiftly and accurately identify three-dimensional objects from point cloud data. To meet this requirement, the prevalent network architecture employed in the industry is the voxel-based PointPillars model. Nonetheless, this model faces challenges in maintaining detection accuracy when objects are obscured or diminutive in size. In response to this issue, we introduce AGPNet, a novel model that seamlessly integrates four key modules: Data Augmentation, Dynamic Graph CNN, Pillar Feature Net, and Detection Head (SSD). The Data Augmentation module enhances the adaptability of point cloud data to complex and ever-changing real-world environments. The Dynamic Graph CNN module endows the network structure with geometric features, which encapsulate not only the point itself but also its adjacent points. The Pillar Feature Net module translates three-dimensional point cloud data into pseudo-image data through the utilization of voxels. Subsequently, the Detection Head (SSD) module leverages this pseudo-image data to conduct target detection of three-dimensional objects. Our experiments, conducted on the KITTI dataset, demonstrate that our proposed method boosts object detection accuracy by 6-7 percentage points compared to the PointPillars model, while maintaining similar detection times.

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.

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.

Paraphrase generation is an important yet challenging task in NLP. Neural network-based approaches have achieved remarkable success in sequence-to-sequence(seq2seq) learning. Previous paraphrase generation work generally ignores syntactic information regardless of its availability, with the assumption that neural nets could learn such linguistic knowledge implicitly. In this work we make an endeavor to probe into the efficacy of explicit syntactic information for the task of paraphrase generation. Syntactic information can appear in the form of dependency trees which could be easily acquired from off-the-shelf syntactic parsers. Such tree structures could be conveniently encoded via graph convolutional networks(GCNs) to obtain more meaningful sentence representations, which could improve generated paraphrases. Through extensive experiments on four paraphrase datasets with different sizes and genres, we demonstrate the utility of syntactic information in neural paraphrase generation under the framework of seq2seq modeling. Specifically, our GCN-enhanced models consistently outperform their syntax-agnostic counterparts in multiple evaluation metrics.

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.

The internet can broadly be divided into three parts: surface, deep and dark among which the latter offers anonymity to its users and hosts [1]. Deep Web refers to an encrypted network that is not detected on search engine like Google etc. Users must use Tor to visit sites on the dark web [2]. Ninety six percent of the web is considered as deep web because it is hidden. It is like an iceberg, in that, people can just see a small portion above the surface, while the largest part is hidden under the sea [3, 4, and 5]. Basic methods of graph theory and data mining, that deals with social networks analysis can be comprehensively used to understand and learn Deep Web and detect cyber threats [6]. Since the internet is rapidly evolving and it is nearly impossible to censor the deep web, there is a need to develop standard mechanism and tools to monitor it. In this proposed study, our focus will be to develop standard research mechanism to understand the Deep Web which will support the researchers, academicians and law enforcement agencies to strengthen the social stability and ensure peace locally & globally.

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.

Using graph theory, computer aided motion, static force and power flow analysis of planetary gear mechanism is realized. The motion, static force and efficiency calculations of 6HP26 automatic transmission are carried out. Based on kinematic and static force analysis model, related matrices are acquired. Hence, kinematic and static force analysis of planetary gear mechanism is achieved. The link power can be determined by the link speed and torque. Power flow diagrams of each gear are acquired. The efficiency is calculated by transmission ratio method.

Indoor scene recognition has great significance for intelligent applications such as mobile robots, location-based services (LBS) and so on. Wherever we are or whatever we do, we are under a specific scene. The human brain can easily discern a scene with a quick glance. However, for a machine to achieve this purpose, on one hand, it often requires plenty of well-annotated data which is time-consuming and labor-intensive. On the other hand, it is hard to learn effective visual representations due to large intra-category variation and inter-categories similarity of indoor scenes. To solve these problems, in this paper, we adopted an unsupervised visual representation learning method which can learn from unlabeled data with a Siamese Convolutional Neural Network (Siamese ConvNet) and graph-based constraints. Specifically, we first mined relationships between unlabeled samples with a graph structure. And then, these relationships can be used as supervision for representation learning with a Siamese network. In this method, firstly, a k-NN graph would be constructed by taking each image as a node in the graph and its k nearest neighbors are linked to form the edges. Then, with this graph, cycle consistency and geodesic distance would be considered as criteria for positive and negative pairs mining respectively. In other words, by detecting cycles in the graph, images with large differences but in the same cycle can be considered as same category (positive pairs). By computing geodesic distance instead of Euclidean distance from one node to another, two nodes with large geodesic distance can be regarded as in different categories (negative pairs). After that, visual representations of indoor scenes can be learned by a Siamese network in an unsupervised manner with the mined pairs as inputs. In order to evaluate the proposed method, we tested it on two scene-centric datasets, MIT67 and Places365. Experiments with different number of categories have been conducted to excavate the potential of proposed method. The results demonstrated that semantic visual representations for indoor scenes can be learned in this unsupervised manner. In addition, with the learned visual representations, indoor scene recognition models trained with the learned representations and a few of labeled samples can achieve competitive performance compared to the state-of-the-art approaches.

Product innovation is a crucial factor in enterprise survival. Even though there are sources from strategic theory that guides the clear comprehension towards appreciating the nexus between these two variables (product innovation and enterprise survival), there are still many lacunas that should be addressed and filled. Consequently, the need for additional empirical corroboration or support is pertinent. This study aimed at verifying the nexus between product innovation and enterprise survival, and how they are affected by the existence of antecedent variables such as competitive intensity and competitive advantage. In the methodology, this study adopts the conduct of explanatory and cross-sectional investigations through the use of structural equation modelling (SEM) to a sample of selected food and beverages enterprises in Lagos, Nigeria. Regarding the food and beverage enterprises in Lagos, Nigeria, this study discovered that competitive intensity has huge positive implication on product innovation at (0.39; t = 5.69, p < 0.05). This gives numerical evidence that, in the face of more market competition, enterprises will be pressured to adopt the model of costs reduction on products which will enhance the reduction of product prices, and will have significant impact on profit. However, the findings reveal that there is no significance between competitive advantage and product innovation at (0.002; t = 0.203, p > 0.05), and there is no significance between product innovation and enterprise survival at (-0.035; t = -1.583, p > .05). As a result, the food and beverage enterprises should concentrate more on product innovation so that they will be able to stand the intensity of competition. The results emanated from the study is germane as it make significant contribution to literature and the body of knowledge and on strategic management by enlightening that competitive intensity is a necessary inducement for product innovation.