Search

Abstract In recent years, air pollution has become increasingly serious and poses a great threat to human health. Timely and accurate air quality prediction is crucial for air pollution early warning and control. Although data-driven air quality prediction methods are promising, there are still challenges in studying spatial–temporal correlations of air pollutants to design effective predictors. To address this issue, a novel model called adaptive adjacency matrix-based graph convolutional recurrent network (AAMGCRN) is proposed in this study. The model inputs Point of Interest (POI) data and meteorological data into a fully connected neural network to learn the weights of the adjacency matrix thereby constructing the self-ringing adjacency matrix and passes the pollutant data with this matrix as input to the Graph Convolutional Network (GCN) unit. Then, the GCN unit is embedded into LSTM units to learn spatio-temporal dependencies. Furthermore, temporal features are extracted using Long Short-Term Memory network (LSTM). Finally, the outputs of these two components are merged and air quality predictions are generated through a hidden layer. To evaluate the performance of the model, we conducted multi-step predictions for the hourly concentration of PM2.5, PM10 and O3 at Fangshan, Tiantan and Dongsi monitoring stations in Beijing. The experimental results show that our method achieves better predicted effects compared with other baseline models based on deep learning. In general, we designed a novel air quality prediction method and effectively addressed the shortcomings of existing studies in learning the spatio-temporal correlations of air pollutants. This method can provide more accurate air quality predictions and is expected to provide support for public health protection and government environmental decision-making.

Flowcharts have broad applications in the fields of software development, engineering design, and scientific experimentation. Current flowchart data structure is mainly based on the adjacency list, cross-linked list, and adjacency matrix of the graph structure. Such design originated from the fact that any two nodes could have a connection relationship. But flowcharts have clear regularities, and their nodes have a certain inflow or outflow relationship. When graph structures such as an adjacency table or an adjacency matrix are used to store a flowchart, there is a large room for optimization in terms of traversal time and storage complexities, as well as usage convenience. In this paper we propose two hierarchical data structures for flowchart design. In the proposed structures, a flowchart is composed of levels, layers, and numbered nodes. The nodes between layers are connected according to a certain set of systematic design rules. Compared with the traditional graph data structures, the proposed schemes significantly reduce the storage space, improve the traversal efficiency, and resolve the problem of nesting between sub-charts. Experimental data based on flowchart examples used in this paper show that, compared with adjacency list, the hierarchical table data structure reduces the traversal time by 50% while their storage spaces are similar; compared with adjacency matrix, the hierarchical matrix data structure reduces the traversal time by nearly 70% and saves the storage space by about 50%. The proposed structures could have broad applications in flowchart-based software development, such as low-code engineering for smart industrial manufacturing. [ABSTRACT FROM AUTHOR]

The Brain Tumor presents a highly critical situation concerning the brain, characterized by the uncontrolled growth of an abnormal cell cluster. Early brain tumor detection is essential for accurate diagnosis and effective treatment planning. In this paper, a novel Convolutional Neural Network (CNN) based Graph Neural Network (GNN) model is proposed using the publicly available Brain Tumor dataset from Kaggle to predict whether a person has brain tumor or not and if yes then which type (Meningioma, Pituitary or Glioma). The objective of this research and the proposed models is to provide a solution to the non-consideration of non-Euclidean distances in image data and the inability of conventional models to learn on pixel similarity based upon the pixel proximity. To solve this problem, we have proposed a Graph based Convolutional Neural Network (GCNN) model and it is found that the proposed model solves the problem of considering non-Euclidean distances in images. We aimed at improving brain tumor detection and classification using a novel technique which combines GNN and a 26 layered CNN that takes in a Graph input pre-convolved using Graph Convolution operation. The objective of Graph Convolution is to modify the node features (data linked to each node) by combining information from nearby nodes. A standard pre-computed Adjacency matrix is used, and the input graphs were updated as the averaged sum of local neighbor nodes, which carry the regional information about the tumor. These modified graphs are given as the input matrices to a standard 26 layered CNN with Batch Normalization and Dropout layers intact. Five different networks namely Net-0, Net-1, Net-2, Net-3 and Net-4 are proposed, and it is found that Net-2 outperformed the other networks namely Net-0, Net-1, Net-3 and Net-4. The highest accuracy achieved was 95.01% by Net-2. With its current effectiveness, the model we propose represents a critical alternative for the statistical detection of brain tumors in patients who are suspected of having one. [ABSTRACT FROM AUTHOR]

In recent years, there has been a growing prevalence of deep learning in various domains, owing to advancements in information technology and computing power. Graph neural network methods within deep learning have shown remarkable capabilities in processing graph-structured data, such as social networks and traffic networks. As a result, they have garnered significant attention from researchers.However, real-world data often face challenges like data sparsity and missing labels, which can hinder the performance and generalization ability of graph convolutional neural networks. To overcome these challenges, our research aims to effectively extract the hidden features and topological information of graph convolutional neural networks. We propose an innovative model called Adaptive Feature and Topology Graph Convolutional Neural Network (AAGCN). By incorporating an adaptive layer, our model preprocesses the data and integrates the hidden features and topological information with the original data’s features and structure. These fused features are then utilized in the convolutional layer for training, significantly enhancing the expressive power of graph convolutional neural networks.To evaluate the effectiveness of the adaptive layer in the AAGCN model, we conducted node classification experiments on real datasets. The results validate its ability to address data sparsity and improve the classification performance of graph convolutional neural networks.In conclusion, our research primarily focuses on addressing data sparsity and missing labels in graph convolutional neural networks. The proposed AAGCN model, which incorporates an adaptive layer, effectively extracts hidden features and topological information, thereby enhancing the expressive power and classification performance of these networks. [ABSTRACT FROM AUTHOR]

In the field of skeleton-based action recognition, accurately recognizing human actions is crucial for applications such as virtual reality and motion analysis. However, this task faces challenges such intraindividual action differences and long-term temporal dependencies. To address these challenges, we propose an innovative model called spatial-temporal graph neural ordinary differential equations (STG-NODE). First, in the data preprocessing stage, the dynamic time warping (DTW) algorithm is used to normalize and calculate 3D skeleton data to facilitate the derivation of customized adjacency matrices for improving the influence of intraindividual action differences. Secondly, a custom ordinary differential equation (ODE) integrator is applied based on the initial conditions of the temporal features, producing a solution function that simulates the dynamic evolution trend of the events of interest. Finally, the outstanding ODE solver is used to numerically solve the time features based on the solution function to increase the influence of long-term dependencies on the recognition accuracy of the model and provide it with a more powerful temporal modeling ability. Through extensive experiments conducted on the NTU RGB+D 60 and Kinetics Skeleton 400 benchmark datasets, we demonstrate the superior performance of STG-NODE in the action recognition domain. The success of the STG-NODE model also provides new ideas and methods for the future development of the action recognition field. [ABSTRACT FROM AUTHOR]

Graph theory can be used to address problems with complex network structures. Congenital heart diseases (CHDs) involve complex abnormal connections between chambers, vessels, and organs. We proposed a new method to represent CHDs based on graph theory, wherein vertices were defined as the spaces through which blood flows and edges were defined by the blood flow between the spaces and direction of the blood flow. The CHDs of tetralogy of Fallot (TOF) and transposition of the great arteries (TGA) were selected as examples for constructing directed graphs and binary adjacency matrices. Patients with totally repaired TOF, surgically corrected d-TGA, and Fontan circulation undergoing four-dimensional (4D) flow magnetic resonance imaging (MRI) were included as examples for constructing the weighted adjacency matrices. The directed graphs and binary adjacency matrices of the normal heart, extreme TOF undergoing a right modified Blalock–Taussig shunt, and d-TGA with a ventricular septal defect were constructed. The weighted adjacency matrix of totally repaired TOF was constructed using the peak velocities obtained from 4D flow MRI. The developed method is promising for representing CHDs and may be helpful in developing artificial intelligence and conducting future research on CHD. [ABSTRACT FROM AUTHOR]

Improving the human reliability of the human–machine interface (HMI) of deep-sea manned submersible is of great importance for the development of the deep-sea field. Based on the SHEL (Software S, Hardware H, Environment E, Liveware L) model, this study classifies the performance shaping factors (PSF) that affect the human reliability of submersible HMIs and builds a PSF system. The interpretative structural model (ISM) is used to matrix the interactions between the elements that make up the system of PSF. A multi-level recursive structure is obtained by building the corresponding adjacency matrix. The Noisy-OR model is introduced to construct a Bayesian network in order to build a new HMI evaluation method. A real case of Bayesian network causal inference verifies the validity of the built method. This study proposes a set of HMI human reliability evaluation methods applicable to deep-sea manned submersible, which provides a new idea for human reliability assessment. [ABSTRACT FROM AUTHOR]

The characteristics of common prosperity include harmonious relationships between humans and the environment, as well as sustainable economic and social growth. The process of achieving common prosperity will necessarily have an impact on carbon emissions. In this article, panel statistics collected from 30 Chinese provinces and cities between the years 2006 and 2020 are utilized to assess the level of common prosperity and the intensity of carbon emissions in China. Then the SDM model is applied to explore the effects of the common prosperity level on the intensity of carbon emissions. The findings reveal that: (i) The common prosperity level in China has shown an increasing tendency. Between 2006 and 2020, the mean level of common prosperity increased from 0.254 to 0.486. From the regional perspective, eastern China has seen greater levels of common prosperity than central China, while central China has experienced greater levels of common prosperity than western China; regional disparities in the degree of common prosperity are substantial among Chinese provinces from 2006 to 2020; the common prosperity level is relatively high in economically developed provinces and relatively low in economically backward provinces. (ii) China's carbon emission intensity shows a continuous downward tendency. The annual average intensity of China's carbon emissions decreased from 4.458 in 2006 to 2.234 in 2020. From the regional perspective, the three main regions' carbon emission intensity likewise exhibits a decline in tendency between 2006 and 2020; still, western China continues to have the greatest carbon emission intensity, following central China, while eastern China has the smallest; however, certain provinces, notably Inner Mongolia and Shanxi, continue to have high carbon emission intensity. (iii) China's common prosperity level and carbon emission intensity both exhibit positive spatial autocorrelation at a 1% significant level under the adjacency matrix. The spatial agglomeration effect is significant, and adjacent provinces can affect each other. (iv) The SDM (Spatial Durbin Model) model test with fixed effects finds that the increase in the level of common prosperity suppresses the intensity of carbon emissions in the local area and neighboring regions. (v) The mediating effects model indicates that the process of common prosperity suppresses carbon emission intensity through high-quality economic development, narrowing the income disparity, and the development of a sharing economy. [ABSTRACT FROM AUTHOR]

Predicting soil heavy metal (HM) content is crucial for monitoring soil quality and ensuring ecological health. However, existing methods often neglect the spatial dependency of data. To address this gap, our study introduces a novel graph neural network (GNN) model, Multi-Scale Attention-based Graph Neural Network for Heavy Metal Prediction (MSA-GNN-HMP). The model integrates multi-scale graph convolutional network (MS-GCN) and attention-based GNN (AGNN) to capture spatial relationships. Using surface soil samples from the Pearl River Basin, we evaluate the MSA-GNN-HMP model against four other models. The experimental results show that the MSA-GNN-HMP model has the best predictive performance for Cd and Pb, with a coefficient of determination (R2) of 0.841 for Cd and 0.886 for Pb, and the lowest mean absolute error (MAE) of 0.403 mg kg−1 for Cd and 0.670 mg kg−1 for Pb, as well as the lowest root mean square error (RMSE) of 0.563 mg kg−1for Cd and 0.898 mg kg−1 for Pb. In feature importance analysis, latitude and longitude emerged as key factors influencing the heavy metal content. The spatial distribution prediction trend of heavy metal elements by different prediction methods is basically consistent, with the high-value areas of Cd and Pb respectively distributed in the northwest and northeast of the basin center. However, the MSA-GNN-HMP model demonstrates superior detail representation in spatial prediction. MSA-GNN-HMP model has excellent spatial information representation capabilities and can more accurately predict heavy metal content and spatial distribution, providing a new theoretical basis for monitoring, assessing, and managing soil pollution. [ABSTRACT FROM AUTHOR]

In this study, CO2 solubility in different choline chloride-based deep eutectic solvents (DESs) has been investigated using the Quantitative Structure–Property Relationship (QSPR). In this regard, the effect of different structures of the hydrogen bond donor (HBD) in choline chloride (ChCl) based deep eutectic solvents (DESs) has been studied in different temperatures and different molar ratios of ChCl as hydrogen bond acceptor (HBA) to HBD. 12 different datasets with 390 data on the CO2 solubility were chosen from the literature for the model development. Eight predictive models, which contain the pressure and one structural descriptor, have been developed at the fixed temperature (i.e. 293, 303, 313, or 323 K), and the constant molar ratio of ChCl to HBD equal to 1:3 or 1:4. Moreover, two models were also introduced, which considered the effects of pressure, temperature, and HBD structures, simultaneously in the molar ratios equal to 1:3 or 1:4. Two additional datasets were used only for the further external validation of these two models at new temperatures, pressures, and HBD structures. It was identified that CO2 solubility depends on the "EEig02d" descriptor of HBD. "EEig02d" is a molecular descriptor derived from the edge adjacency matrix of a molecule that is weighted by dipole moments. This descriptor is also related to the molar volume of the structure. The statistical evaluation of the proposed models for the unfixed and fixed temperature datasets confirmed the validity of the developed models. [ABSTRACT FROM AUTHOR]

With the advent of the era of big data, privacy computing analyzes and calculates data on the premise of protecting data privacy, to achieve data 'available and invisible'. As an important branch of secure multi-party computation, the geometric problem can solve practical problems in the military, national defense, finance, life, and other fields, and has important research significance. In this paper, we study the similarity problem of geometric graphics. First, this paper proposes the adjacency matrix vector coding method of isomorphic graphics, and use the Paillier variant encryption cryptography to solve the problem of isomorphic graphics confidentiality under the semi-honest model. Using cryptography tools such as elliptic curve cryptosystem, zero-knowledge proof, and cut-choose method, this paper designs a graphic similarity security decision protocol that can resist malicious adversary attacks. The analysis shows that the protocol has high computational efficiency and has wide application value in terrain matching, mechanical parts, biomolecules, face recognition, and other fields. [ABSTRACT FROM AUTHOR]

Abstract Link prediction methods use patterns in known network data to infer which connections may be missing. Previous work has shown that continuous-time quantum walks can be used to represent path-based link prediction, which we further study here to develop a more optimized quantum algorithm. Using a sampling framework for link prediction, we analyze the query access to the input network required to produce a certain number of prediction samples. Considering both well-known classical path-based algorithms using powers of the adjacency matrix as well as our proposed quantum algorithm for path-based link prediction, we argue that there is a polynomial quantum advantage on the dependence on N, the number of nodes in the network. We further argue that the complexity of our algorithm, although sub-linear in N, is limited by the complexity of performing a quantum simulation of the network’s adjacency matrix, which may prove to be an important problem in the development of quantum algorithms for network science in general.

Deep learning has brought a dramatic development in molecular property prediction that is crucial in the field of drug discovery using various representations such as fingerprints, SMILES, and graphs. In particular, SMILES is used in various deep learning models via character-based approaches. However, SMILES has a limitation in that it is hard to reflect chemical properties. In this paper, we propose a new self-supervised method to learn SMILES and chemical contexts of molecules simultaneously in pre-training the Transformer. The key of our model is learning structures with adjacency matrix embedding and learning logics that can infer descriptors via Quantitative Estimation of Drug-likeness prediction in pre-training. As a result, our method improves the generalization of the data and achieves the best average performance by benchmarking downstream tasks. Moreover, we develop a web-based fine-tuning service to utilize our model on various tasks. [ABSTRACT FROM AUTHOR]

Speech emotion recognition (SER) has gained an increased interest during the last decades as part of enriched affective computing. As a consequence, a variety of engineering approaches have been developed addressing the challenge of the SER problem, exploiting different features, learning algorithms, and datasets. In this paper, we propose the application of the graph theory for classifying emotionally-colored speech signals. Graph theory provides tools for extracting statistical as well as structural information from any time series. We propose to use the mentioned information as a novel feature set. Furthermore, we suggest setting a unique feature-based identity for each emotion belonging to each speaker. The emotion classification is performed by a Random Forest classifier in a Leave-One-Speaker-Out Cross Validation (LOSO-CV) scheme. The proposed method is compared with two state-of-the-art approaches involving well known hand-crafted features as well as deep learning architectures operating on mel-spectrograms. Experimental results on three datasets, EMODB (German, acted) and AESDD (Greek, acted), and DEMoS (Italian, in-the-wild), reveal that our proposed method outperforms the comparative methods in these datasets. Specifically, we observe an average UAR increase of almost 18 % , 8 % and 13 % , respectively. [ABSTRACT FROM AUTHOR]

Recently, hetero-functional graph theory (HFGT) has developed as a means to mathematically model the structure of large-scale complex flexible engineering systems. It does so by fusing concepts from network science and model-based systems engineering (MBSE). For the former, it utilizes multiple graph-based data structures to support a matrix-based quantitative analysis. For the latter, HFGT inherits the heterogeneity of conceptual and ontological constructs found in model-based systems engineering including system form, system function, and system concept. These diverse conceptual constructs indicate multi-dimensional rather than two-dimensional relationships. This paper provides the first tensor-based treatment of hetero-functional graph theory. In particular, it addresses the "system concept" and the hetero-functional adjacency matrix from the perspective of tensors and introduces the hetero-functional incidence tensor as a new data structure. The tensor-based formulation described in this work makes a stronger tie between HFGT and its ontological foundations in MBSE. Finally, the tensor-based formulation facilitates several analytical results that provide an understanding of the relationships between HFGT and multi-layer networks. [ABSTRACT FROM AUTHOR]

Models of networks play a major role in explaining and reproducing empirically observed patterns. Suitable models can be used to randomize an observed network while preserving some of its features, or to generate synthetic graphs whose properties may be tuned upon the characteristics of a given population. In the present paper, we introduce the Fitness-Corrected Block Model, an adjustable-density variation of the well-known Degree-Corrected Block Model, and we show that the proposed construction yields a maximum entropy model. When the network is sparse, we derive an analytical expression for the degree distribution of the model that depends on just the constraints and the chosen fitness-distribution. Our model is perfectly suited to define maximum-entropy data-driven spatial social networks, where each block identifies vertices having similar position (e.g., residence) and age, and where the expected block-to-block adjacency matrix can be inferred from the available data. In this case, the sparse-regime approximation coincides with a phenomenological model where the probability of a link binding two individuals is directly proportional to their sociability and to the typical cohesion of their age-groups, whereas it decays as an inverse-power of their geographic distance. We support our analytical findings through simulations of a stylized urban area. [ABSTRACT FROM AUTHOR]

Due to the effect of emotions on interactions, interpretations, and decisions, automatic detection and analysis of human emotions based on EEG signals has an important role in the treatment of psychiatric diseases. However, the low spatial resolution of EEG recorders poses a challenge. In order to overcome this problem, in this paper we model each emotion by mapping from scalp sensors to brain sources using Bernoulli–Laplace-based Bayesian model. The standard low-resolution electromagnetic tomography (sLORETA) method is used to initialize the source signals in this algorithm. Finally, a dynamic graph convolutional neural network (DGCNN) is used to classify emotional EEG in which the sources of the proposed localization model are considered as the underlying graph nodes. In the proposed method, the relationships between the EEG source signals are encoded in the DGCNN adjacency matrix. Experiments on our EEG dataset recorded at the Brain-Computer Interface Research Laboratory, University of Tabriz as well as publicly available SEED and DEAP datasets show that brain source modeling by the proposed algorithm significantly improves the accuracy of emotion recognition, such that it achieve a classification accuracy of 99.25% during the classification of the two classes of positive and negative emotions. These results represent an absolute 1–2% improvement in terms of classification accuracy over subject-dependent and subject-independent scenarios over the existing approaches. [ABSTRACT FROM AUTHOR]

Perinatal stroke occurs early in life and often leads to a permanent, disabling weakness to one side of the body. To test the hypothesis that non-lesioned hemisphere sensorimotor network structural connectivity in children with perinatal stroke is different from controls, we used diffusion imaging and graph theory to explore structural topology between these populations. Children underwent diffusion and anatomical 3T MRI. Whole-brain tractography was constrained using a brain atlas creating an adjacency matrix containing connectivity values. Graph theory metrics including betweenness centrality, clustering coefficient, and both neighbourhood and hierarchical complexity of sensorimotor nodes were compared to controls. Relationships between these connectivity metrics and validated sensorimotor assessments were explored. Eighty-five participants included 27 with venous stroke (mean age = 11.5 ± 3.7 years), 26 with arterial stroke (mean age = 12.7 ± 4.0 years), and 32 controls (mean age = 13.3 ± 3.6 years). Non-lesioned primary motor (M1), somatosensory (S1) and supplementary motor (SMA) areas demonstrated lower betweenness centrality and higher clustering coefficient in stroke groups. Clustering coefficient of M1, S1, and SMA were inversely associated with clinical motor function. Hemispheric betweenness centrality and clustering coefficient were higher in stroke groups compared to controls. Hierarchical and average neighbourhood complexity across the hemisphere were lower in stroke groups. Developmental plasticity alters the connectivity of key nodes within the sensorimotor network of the non-lesioned hemisphere following perinatal stroke and contributes to clinical disability. [ABSTRACT FROM AUTHOR]

Abstract Flowcharts have broad applications in the fields of software development, engineering design, and scientific experimentation. Current flowchart data structure is mainly based on the adjacency list, cross-linked list, and adjacency matrix of the graph structure. Such design originated from the fact that any two nodes could have a connection relationship. But flowcharts have clear regularities, and their nodes have a certain inflow or outflow relationship. When graph structures such as an adjacency table or an adjacency matrix are used to store a flowchart, there is a large room for optimization in terms of traversal time and storage complexities, as well as usage convenience. In this paper we propose two hierarchical data structures for flowchart design. In the proposed structures, a flowchart is composed of levels, layers, and numbered nodes. The nodes between layers are connected according to a certain set of systematic design rules. Compared with the traditional graph data structures, the proposed schemes significantly reduce the storage space, improve the traversal efficiency, and resolve the problem of nesting between sub-charts. Experimental data based on flowchart examples used in this paper show that, compared with adjacency list, the hierarchical table data structure reduces the traversal time by 50% while their storage spaces are similar; compared with adjacency matrix, the hierarchical matrix data structure reduces the traversal time by nearly 70% and saves the storage space by about 50%. The proposed structures could have broad applications in flowchart-based software development, such as low-code engineering for smart industrial manufacturing.

Although numerous spatiotemporal approaches have been presented to address the problem of missing spatiotemporal data, there are still limitations in concurrently capturing the underlying spatiotemporal dependence of spatiotemporal graph data. Furthermore, most imputation methods miss the hidden dynamic connection associations that exist between graph nodes over time. To address the aforementioned spatiotemporal data imputation challenge, we present an attention-based message passing and dynamic graph convolution network (ADGCN). Specifically, this paper uses attention mechanisms to unify temporal and spatial continuity and aggregate node neighbor information in multiple directions. Furthermore, a dynamic graph convolution module is designed to capture constantly changing spatial correlations in sensors utilizing a new dynamic graph generation method with gating to transmit node information. Extensive imputation tests in the air quality and traffic flow domains were carried out on four real missing data sets. Experiments show that the ADGCN outperforms the state-of-the-art baseline. [ABSTRACT FROM AUTHOR]

Quantum chemistry is interested in calculating ground and excited states of molecular systems by solving the electronic Schrödinger equation. The exact numerical solution of this equation, frequently represented as an eigenvalue problem, remains unfeasible for most molecules and requires approximate methods. In this paper we introduce the use of Quantum Community Detection performed using the D-Wave quantum annealer to reduce the molecular Hamiltonian matrix in Slater determinant basis without chemical knowledge. Given a molecule represented by a matrix of Slater determinants, the connectivity between Slater determinants (as off-diagonal elements) is viewed as a graph adjacency matrix for determining multiple communities based on modularity maximization. A gauge metric based on perturbation theory is used to determine the lowest energy cluster. This cluster or sub-matrix of Slater determinants is used to calculate approximate ground state and excited state energies within chemical accuracy. The details of this method are described along with demonstrating its performance across multiple molecules of interest and bond dissociation cases. These examples provide proof-of-principle results for approximate solution of the electronic structure problem using quantum computing. This approach is general and shows potential to reduce the computational complexity of post-Hartree–Fock methods as future advances in quantum hardware become available. [ABSTRACT FROM AUTHOR]

Mixing in many body systems is intuitively understood as the change in time of the set of neighbors surrounding each particle. Its rate and its development over time hold important clues to the behavior of many body systems. For example, gas particles constantly change their position and surrounding particles, while in solids one expects the motion of the atoms to be limited by a fixed set of neighboring atoms. In other systems the situation is less clear. For example, agitated granular systems may behave like a fluid, a solid or glass, depending on various parameter such as density and friction. Thus, we introduce a parameter which describes the mixing rate in many body systems in terms of changes of a properly chosen adjacency matrix. The parameter is easily measurable in simulations but not in experiment. To demonstrate an application of the concept, we simulate a many body system, with particles interacting via a two-body potential and calculate the mixing rate as a function of time and volume fraction. The time dependence of the mixing rate clearly indicates the onset of crystallization [ABSTRACT FROM AUTHOR]

Irritable bowel syndrome (IBS) is a functional disorder of brain-gut interactions. Differential brain responses to rectal distention between IBS and healthy controls (HCs) have been demonstrated, particularly in the pain matrix and the default mode network. This study aims to compare resting-state functional properties of these networks between IBS patients and HCs using graph analysis in two independent cohorts. We used a weighted graph analysis of the adjacency matrix based on partial correlations between time series in the different regions in each subject to determine subject specific graph measures. These graph measures were normalized by values obtained in equivalent random networks. We did not find any significant differences between IBS patients and controls in global normalized graph measures, hubs, or modularity structure of the pain matrix and the DMN in any of our two independent cohorts. Furthermore, we did not find consistent associations between these global network measures and IBS symptom severity or GI-specific anxiety but we found a significant difference in the relationship between measures of psychological distress (anxiety and/or depressive symptoms) and normalized characteristic path length. The responses of these networks to visceral stimulation rather than their organisation at rest may be primarily disturbed in IBS. [ABSTRACT FROM AUTHOR]

LSD is a hallucinogen with complex neurobiological and behavioral effects. Underlying these effects are changes in brain neuroplasticity. This is the first study to follow the developmental changes in brain structure and function following LSD exposure in periadolescence. We hypothesized LSD given during a time of heightened neuroplasticity, particularly in the forebrain, would affect cognitive and emotional behavior and the associated underlying neuroanatomy and neurocircuitry. Female and male mice were given vehicle, single or multiple treatments of 3.3 µg of LSD by oral gavage starting on postnatal day 51. Between postnatal days 90–120 mice were imaged and tested for cognitive and motor behavior. MRI data from voxel-based morphometry, diffusion weighted imaging, and BOLD resting state functional connectivity were registered to a mouse 3D MRI atlas with 139 brain regions providing site-specific differences in global brain structure and functional connectivity between experimental groups. Motor behavior and cognitive performance were unaffected by periadolescent exposure to LSD. Differences across experimental groups in brain volume for any of the 139 brain areas were few in number and not focused on any specific brain region. Multiple exposures to LSD significantly altered gray matter microarchitecture across much of the brain. These changes were primary associated with the thalamus, sensory and motor cortices, and basal ganglia. The forebrain olfactory system and prefrontal cortex and hindbrain cerebellum and brainstem were unaffected. The functional connectivity between forebrain white matter tracts and sensorimotor cortices and hippocampus was reduced with multidose LSD exposure. Does exposure to LSD in late adolescence have lasting effects on brain development? The bulk of our significant findings were seen through changes is DWI values across 74 brain areas in the multi-dose LSD group. The pronounced changes in indices of anisotropy across much of the brain would suggest altered gray matter microarchitecture and neuroplasticity. There was no evidence of LSD having consequential effects on cognitive or motor behavior when animal were evaluated as young adults 90–120 days of age. Neither were there any differences in the volume of specific brain areas between experimental conditions. The reduction in connectivity in forebrain white matter tracts with multidose LSD and consolidation around sensorimotor and hippocampal brain areas requires a battery of tests to understand the consequences of these changes on behavior. [ABSTRACT FROM AUTHOR]

British scholar Peter Taylor constructed the World City Network by analyzing the office networks of multinational companies, enabling a network perspective on world cities. However, this method has long been hindered by data deficiencies and update delays. In this study, we utilized publicly available, real-time updated data on global routes to construct the World City Network, thereby addressing the issues of data insufficiency and delayed updates in the existing model. For the first time, advanced Graph Convolutional Networks were employed to analyze the World City Network, and we introduced GCNRank. Finally, we compared GCNRank with other centrality measures and found that GCNRank provides a more detailed representation of city rankings and effectively avoids local optima. [ABSTRACT FROM AUTHOR]

Heart failure (HF) is a terminal condition of multiple cardiovascular disorders. Cancer is a deadly disease worldwide. The relationship between HF and cancer remains poorly understood. The Gene Expression Omnibus database was used to download the RNA sequencing data of 356 patients with hypertrophic cardiomyopathy-induced HF and non-HF. A co-expression network was established through the weighted correlation network analysis (WGCNA) to identify hub genes of HF and cancer. Cox risk analysis was performed to predict the prognostic risks of HF hub genes in pan-cancer. HF was linked to immune response pathway by the analysis of Gene Ontology (GO) and Kyoto Encyclopedia of Genes and Genomes (KEGG). A positive correlation was observed between the expression levels of 4 hub genes and the infiltration of CD8+T-cells in pan-cancer. 4 hub genes were identified as beneficial prognostic factors in several cancers. Western blotting and real-time polymerase chain reaction validated the high expression of GZMM, NKG7, and ZAP70 in both mice and patients with HF compared to control groups. Our study highlights the shared immune pathogenesis of HF and cancer and provides valuable insights for developing novel therapeutic strategies, offering new opportunities for improving the management and treatment outcomes of both HF and cancer. [ABSTRACT FROM AUTHOR]

Statistical characterizations of complex network structures can be obtained from both the Ihara Zeta function (in terms of prime cycle frequencies) and the partition function from statistical mechanics. However, these two representations are usually regarded as separate tools for network analysis, without exploiting the potential synergies between them. In this paper, we establish a link between the Ihara Zeta function from algebraic graph theory and the partition function from statistical mechanics, and exploit this relationship to obtain a deeper structural characterisation of network structure. Specifically, the relationship allows us to explore the connection between the microscopic structure and the macroscopic characterisation of a network. We derive thermodynamic quantities describing the network, such as entropy, and show how these are related to the frequencies of prime cycles of various lengths. In particular, the n-th order partial derivative of the Ihara Zeta function can be used to compute the number of prime cycles in a network, which in turn is related to the partition function of Bose–Einstein statistics. The corresponding derived entropy allows us to explore a phase transition in the network structure with critical points at high and low-temperature limits. Numerical experiments and empirical data are presented to evaluate the qualitative and quantitative performance of the resulting structural network characterisations. [ABSTRACT FROM AUTHOR]

The uncertainty of structural interpretation complicates the practical production and application of data-driven complex geological structure modeling technology. Intelligent structural modeling excavates and extracts structural knowledge from structural interpretation through human–machine collaboration and combines structural interpretation to form a new model of complex structural modeling guided by knowledge. Specifically, we focus on utilizing knowledge rule reasoning technology to extract topological semantic knowledge from interpretive data and employ knowledge inference to derive structural constraint information from complex geological structure models, thus effectively constraining the 3D geological structure modeling process. To achieve this, we develop a rule-based knowledge inference system that derives theoretical models consistent with expert cognition from interpretive data and prior knowledge. Additionally, we represent the extracted knowledge as a topological semantic knowledge graph, which facilitates computer recognition and allows estimation of intersection lines during 3D geological modeling, resulting in the creation of accurate models. The applicability of our proposed method to various complex geological structures is validated through application tests using real-world data. Furthermore, our method effectively supports the realization of intelligent structure modeling in real working area. [ABSTRACT FROM AUTHOR]

Multi-modal sentiment analysis (MSA) aims to regress or classify the overall sentiment of utterances through acoustic, visual, and textual cues. However, most of the existing efforts have focused on developing the expressive ability of neural networks to learn the representation of multi-modal information within a single utterance, without considering the global co-occurrence characteristics of the dataset. To alleviate the above issue, in this paper, we propose a novel hierarchical graph contrastive learning framework for MSA, aiming to explore the local and global representations of a single utterance for multimodal sentiment extraction and the intricate relations between them. Specifically, regarding to each modality, we extract the discrete embedding representation of each modality, which includes the global co-occurrence features of each modality. Based on it, for each utterance, we build two graphs: local level graph and global level graph to account for the level-specific sentiment implications. Then, two graph contrastive learning strategies is adopted to explore the different potential presentations based on graph augmentations respectively. Furthermore, we design a cross-level comparative learning for learning local and global potential representations of complex relationships. [ABSTRACT FROM AUTHOR]

Ulcerative colitis (UC) is a chronic inflammatory disorder of the colon, and its pathogenesis remains unclear. Polyamine metabolic enzymes play a crucial role in UC. In this study, we aimed to identify pivotal polyamine-related genes (PRGs) and explore the underlying mechanism between PRGs and the disease status and therapeutic response of UC. We analyzed mRNA-sequencing data and clinical information of UC patients from the GEO database and identified NNMT, PTGS2, TRIM22, TGM2, and PPARG as key PRGs associated with active UC using differential expression analysis and weighted gene co-expression network analysis (WCGNA). Receiver operator characteristic curve (ROC) analysis confirmed the accuracy of these key genes in UC and colitis-associated colon cancer (CAC) diagnosis, and we validated their relationship with therapeutic response in external verification sets. Additionally, single-cell analysis revealed that the key PRGs were specific to certain immune cell types, emphasizing the vital role of intestinal tissue stem cells in active UC. The results were validated in vitro and in vivo experiments, including the colitis mice model and CAC mice model. In conclusion, these key PRGs effectively predict the progression of UC patients and could serve as new pharmacological biomarkers for the therapeutic response of UC. [ABSTRACT FROM AUTHOR]

This paper presents a novel approach to the phase space reconstruction technique, fractional-order phase space reconstruction (FOSS), which generalizes the traditional integer-order derivative-based method. By leveraging fractional derivatives, FOSS offers a novel perspective for understanding complex time series, revealing unique properties not captured by conventional methods. We further develop the multi-span transition entropy component method (MTECM-FOSS), an advanced complexity measurement technique that builds upon FOSS. MTECM-FOSS decomposes complexity into intra-sample and inter-sample components, providing a more comprehensive understanding of the dynamics in multivariate data. In simulated data, we observe that lower fractional orders can effectively filter out random noise. Time series with diverse long- and short-term memory patterns exhibit distinct extremities at different fractional orders. In practical applications, MTECM-FOSS exhibits competitive or superior classification performance compared to state-of-the-art algorithms when using fewer features, indicating its potential for engineering tasks. [ABSTRACT FROM AUTHOR]

Prostate cancer, one of the most prevalent malignancies among men worldwide, is intricately linked with androgen signaling, a key driver of its pathogenesis and progression. Understanding the diverse expression patterns of androgen-responsive genes holds paramount importance in unraveling the biological intricacies of this disease and prognosticating patient outcomes. In this study, utilizing consensus clustering analysis based on the expression profiles of androgen-responsive genes, prostate cancer patients from the TCGA database were stratified into two distinct subtypes, denoted as C1 and C2. Notably, the C1 subtype demonstrates a significant upregulation of certain genes, such as CGA and HSD17B12, along with a shorter progression-free survival duration, indicating a potentially unfavorable prognosis. Further analyses elucidated the immune infiltration disparities, mutation landscapes, and gene functional pathways characteristic of each subtype. Through integrated bioinformatics approaches and machine learning techniques, key genes such as BIRC5, CENPA, and MMP11 were identified as potential therapeutic targets, providing novel insights into tailored treatment strategies. Additionally, single-cell transcriptome analysis shed light on the heterogeneous expression patterns of these genes across different cell types within the tumor microenvironment. Furthermore, virtual screening identified candidate drugs targeting the BIRC5 receptor, offering promising avenues for drug development. Collectively, these findings deepen our understanding of prostate cancer biology, paving the way for personalized therapeutic interventions and advancing the quest for more effective treatments in prostate cancer management. [ABSTRACT FROM AUTHOR]

Group decision-making (GDM) is crucial in various components of graph theory, management science, and operations research. In particular, in an intuitionistic fuzzy group decision-making problem, the experts communicate their preferences using intuitionistic fuzzy preference relations (IFPRs). This approach is a way that decision-makers rank or select the most desirable alternatives by gathering criteria-based information to estimate the best alternatives using a wider range of knowledge and experience. This article proposes a new statistical measure in a fuzzy environment when the data is ambiguous or unreliable to solve a decision-making problem. This study uses the variation coefficient measure combined with intuitionistic fuzzy graphs (IFG) and Laplacian energy (LE) to solve a GDM problem that utilizes intuitionistic fuzzy preference relations (IFPRs) to select a reliable alliance partner. Initially, the Laplacian energy determines the weight of individual standards, and the obtained weight average further estimates the overall criterion weight vector. We establish the authority criteria weights using the variation coefficient measure and then ultimately rank the alternatives for each criterion using the same measure. We examine four distinct companies Alpha, Beta, Delta, and Zeta to conduct a realistic GDM to choose which alliance partner would be ideal. We successfully implemented the suggested technique, determining that Alpha satisfies company standards and is ranked first among other companies. Moreover, this technique is useful for all kinds of Intuitionistic fuzzy group decision-making problems to select optimal ones. [ABSTRACT FROM AUTHOR]

The interplay between (criminal) organizations and (law enforcement) disruption strategies is critical in criminology and social network analysis. Like legitimate businesses, criminal enterprises thrive by fulfilling specific demands and navigating their unique challenges, including balancing operational visibility and security. This study aims at comprehending criminal networks' internal dynamics, resilience to law enforcement interventions, and robustness to changes in external conditions. Using a model based on evolutionary game theory, we analyze these networks as collaborative assemblies of roles, considering expected costs, potential benefits, and the certainty of expected outcomes. Here, we show that criminal organizations exhibit strong hysteresis effects, with increased resilience and robustness once established, challenging the effectiveness of traditional law enforcement strategies focused on deterrence through increased punishment. The hysteresis effect defines optimal thresholds for the formation or dissolution of criminal organisation. Our findings indicate that interventions of similar magnitude can lead to vastly different outcomes depending on the existing state of criminality. This result suggests that the relationship between stricter punishment and its deterrent effect on organized crime is complex and sometimes non-linear. Furthermore, we demonstrate that network structure, specifically interconnectedness (link density) and assortativity of specialized skills, significantly influences the formation and stability of criminal organizations, underscoring the importance of considering social connections and the accessibility of roles in combating organized crime. These insights contribute to a deeper understanding of the systemic nature of criminal behavior from an evolutionary perspective and highlight the need for adaptive, strategic approaches in policy-making and law enforcement to disrupt criminal networks effectively. [ABSTRACT FROM AUTHOR]

Improving the green electricity efficiency (GEE), is an important issue for China's high-quality economic development. This study presents a spatial correlation network of urban GEE in the Yellow River Basin from 2012 to 2021, constructed using an improved gravity model. Social network analysis and the quadratic assignment procedure method are employed to analyze the spatial correlation characteristics and influencing factors. The findings indicate that urban GEE in the Yellow River Basin exhibits complex and stable network characteristics. The spatial network analysis reveals that Jiayuguan City, Dongying City, Dingxi City, Zibo City, and Shizuishan City occupy central positions within the network. The results indicate that spatial adjacency, GDP per capita, industrial structure, and the level of science and technology expenditure are positively related to urban GEE, while environmental regulation and average temperature are negatively related. The findings of the study have led to policy recommendations aimed at enhancing urban GEE in the Yellow River Basin. [ABSTRACT FROM AUTHOR]

Mitochondrial permeability transition (MPT)-driven necrosis (MPTDN) was a regulated variant of cell death triggered by specific stimuli. It played a crucial role in the development of organisms and the pathogenesis of diseases, and may provide new strategies for treating various diseases. However, there was limited research on the mechanisms of MPTDN in cervical cancer (CESC) at present. In this study, Weighted Gene Co-expression Network Analysis (WGCNA) was performed on differentially expressed genes in CESC. The module MEyellow, which showed the highest correlation with the phenotype, was selected for in-depth analysis. It was found that the genes in the MEyellow module may be associated with the tumor immune microenvironment (TIME). Through COX univariate regression and LASSO regression analysis, 6 key genes were identified. These genes were further investigated from multiple perspectives, including their independent diagnostic value, prognostic value, specific regulatory mechanisms in the tumor immune microenvironment, drug sensitivity analysis, and somatic mutation analysis. This study provided a comprehensive exploration of the mechanisms of action of these 6 key genes in CESC patients. And qRT-PCR validation was also conducted. Through COX univariate regression and LASSO coefficient screening of the MEyellow module, 6 key genes were identified: CHRM3-AS2, AC096734.1, BISPR, LINC02446, LINC00944, and DGUOK-AS1. Evaluation of the independent diagnostic value of these 6 key genes revealed that they can serve as independent diagnostic biomarkers. Through correlation analysis among these 6 genes, a potential regulatory mechanism among them was identified. Therefore, a risk prognostic model was established based on the collective action of these 6 genes, and the model showed good performance in predicting the survival period of CESC patients. By studying the relationship between these 6 key genes and the tumor microenvironment of CESC patients from multiple angles, it was found that these 6 genes are key regulatory factors in the tumor immune microenvironment of CESC patients. Additionally, 16 drugs that are associated with these 6 key genes were identified, and 8 small molecule drugs were predicted based on the lncRNA-mRNA network. The 6 key genes can serve as independent biomarkers for diagnosis, and the Risk score of these genes when acting together can be used as an indicator for predicting the clinical survival period of CESC patients. Additionally, these 6 key genes were closely related to the tumor immune microenvironment of CESC patients and were the important regulatory factors in the tumor immune microenvironment of CESC patients. [ABSTRACT FROM AUTHOR]

In this study, we propose a novel method for identifying lithology using an attention mechanism-enhanced graph convolutional neural network (AGCN). The aim of this method is to address the limitations of traditional approaches that evaluate unbalanced lithology by improving the identification of thin layers and small samples, while providing reliable data support for reservoir evaluation. To achieve this goal, we begin by using Principal Component Analysis (PCA) with maximum and minimum distance clustering (Max-min-distance) to correct the logging curves, which compensates for the low resolution of thin layers and enhances the accuracy of stratigraphic representation. Subsequently, we transform the logging data into graph-structured data by connecting distance similarity points and feature similarity points of the logging samples. We then use the graph convolutional network (GCN) to identify lithology, leveraging both labeled and unlabeled data to enhance the ability to identify lithology in small sample datasets. Additionally, our model incorporates a channel and spatial attention mechanism that assigns weights to the graph structure during lithology identification, improving the model's capability to discern differences across samples. To evaluate the performance of our model, we constructed a lithology dataset comprising five wells and conducted experiments. The results indicate that our approach achieves a maximum accuracy of 97.67%, surpassing the performance of a singlestructure model in lithology identification. In conclusion, our proposed method provides a promising and effective approach for unbalanced lithology identification, significantly improving accuracy levels. [ABSTRACT FROM AUTHOR]