Features Of Nodes Research Articles

Identification of mild cognitive impairment using multimodal 3D imaging data and graph convolutional networks

Abstract Objective. Mild cognitive impairment (MCI) is a precursor stage of dementia characterized by mild cognitive decline in one or more cognitive domains, without meeting the criteria for dementia. MCI is considered a prodromal form of Alzheimer's disease (AD). Early identification of MCI is crucial for both intervention and prevention of AD. To accurately identify MCI, a novel multimodal 3D imaging data integration graph convolutional network model is designed in this paper. Approach. The proposed model utilizes 3D-VGGNet to extract three-dimensional features from multimodal imaging data (such as sMRI and FDG-PET), which are then fused into feature vectors as the node features of a population graph. Non-imaging features of participants are combined with the multimodal imaging data to construct a population sparse graph. Additionally, in order to optimize the connectivity of the graph, we employed the Pairwise Attribute Estimation (PAE) method to compute the edge weights based on non-imaging data, thereby enhancing the effectiveness of the graph structure. Subsequently, a population-based graph convolutional network (GCN) integrates the structural and functional features of different modal images into the features of each participant for MCI classification. Main results. Experiments on the ADNI demonstrated accuracies of 98.57%, 96.03%, and 96.83% for the NC-EMCI, NC-LMCI, and EMCI-LMCI classification tasks, respectively. The AUC, specificity, sensitivity, and F1-score are also superior to state-of-the-art models, demonstrating the effectiveness of the proposed model. Furthermore, the proposed model is applied to the ABIDE dataset for autism diagnosis, achieving an accuracy of 91.43% and outperforming the state-of-the-art models, indicating excellent generalization capabilities of the proposed model. Significance. This study demonstrate the proposed model’s ability to integrate multimodal imaging data and its excellent ability to recognize MCI. This will help achieve early warning for AD and intelligent diagnosis of other brain neurodegenerative diseases.

Academic collaboration recommendation based on graph neural network and multi-attribute embedding

Academic collaboration recommendation (ACR) can help researchers find potential partners for research and thus promote academic innovation. Recent works mostly use graph learning-based methods to explore various ways of combining node information with topology, which consists of multiple steps, including network construction, node feature extraction, network representation learning and link prediction. One limitation is that they only conduct research on co-authorship networks and ignore citation relationship between publications. Besides, they tend to use attributes from a single dimension of researchers and do not take attributes of researchers from multiple dimensions into consideration at the same time. To address the above issues, we present the multi-dimensional attributes enhanced heterogeneous (MAH) network representation learning method, which constructs heterogeneous networks with both co-authorship and citation information and makes use of multi-dimensional attributes. Three research questions are addressed in this work: (RQ1) Is our proposed method effective on academic collaboration recommendation compared with existing state-of-the-art methods? (RQ2) Does incorporating citation information into co-authorship network help improve the performance of academic collaboration recommendation? (RQ3) How does fusing multi-dimensional attributes affect the performance of academic collaboration recommendation? A publicly available real-world data set is used in our experiments. The superior performance of MAH compared with baseline methods demonstrates that the proposed multi-dimensional feature-based researcher profile can enrich node information in academic network and effective researcher representations can be learned by applying graph representation learning methods on the network.

A Study of Recommendation Methods Based on Graph Hybrid Neural Networks and Deep Crossing

In the face of complex user behavior patterns and massive data, improving the performance of recommender system models is an urgent challenge. Traditional methods often struggle to effectively handle feature interactions and complex user-item relationships. Combining the advantages of graph neural networks and the Deep Crossing network, this paper proposes a recommendation method based on hybrid neural networks with Deep Crossing (Deep Crossing with Graph Convolution and GRU, DCGCN-GRU). First, by constructing the graph structure of users and items, higher-order feature representations are extracted, and node features are updated using a multilayer graph convolution operation. Then, the higher-order features learned by the graph convolution network are spliced and weighted with the original features to form new feature inputs. Next, a Gated Recurrent Unit (GRU) is introduced to capture the inter-feature temporal dynamic relationships and sequence information. Finally, the Deep Crossing model is utilized to learn the interactions between the fused features at multiple levels and enhance the interactions between the features. Comparative experiments on three public datasets, MovieLens-ml-25m, Book-Crossings, and Amazon Reviews’23, show that the model achieves significant improvements in accuracy, mean square error (MSE), and mean absolute error (MAE).

PASCL: supervised contrastive learning with perturbative augmentation for particle decay reconstruction

Abstract In high-energy physics, particles produced in collision events decay in a format of a hierarchical tree structure, where only the final decay products can be observed using detectors. However, the large combinatorial space of possible tree structures makes it challenging to recover the actual decay process given a set of final particles. To better analyse the hierarchical tree structure, we propose a graph-based deep learning model to infer the tree structure to reconstruct collision events. In particular, we use a compact matrix representation termed as lowest common ancestor generations matrix, to encode the particle decay tree structure. Then, we introduce a perturbative augmentation technique applied to node features, aiming to mimic experimental uncertainties and increase data diversity. We further propose a supervised graph contrastive learning algorithm to utilize the information of inter-particle relations from multiple decay processes. Extensive experiments show that our proposed supervised graph contrastive learning with perturbative augmentation method outperforms state-of-the-art baseline models on an existing physics-based dataset, significantly improving the reconstruction accuracy. This method provides a more effective training strategy for models with the same parameters and makes way for more accurate and efficient high-energy particle physics data analysis.

L-GraphSAGE: A Graph Neural Network-Based Approach for IoV Application Encrypted Traffic Identification

Recently, with a crucial role in developing smart transportation systems, the Internet of Vehicles (IoV), with all kinds of in-vehicle devices, has undergone significant advancement for autonomous driving, in-vehicle infotainment, etc. With the development of these IoV devices, the complexity and volume of in-vehicle data flows within information communication have increased dramatically. To adapt these changes to secure and smart transportation, encrypted communication realization, real-time decision-making, traffic management enhancement, and overall transportation efficiency improvement are essential. However, the security of a traffic system under encrypted communication is still inadequate, as attackers can identify in-vehicle devices through fingerprinting attacks, causing potential privacy breaches. Nevertheless, existing IoV traffic application models for encrypted traffic identification are weak and often exhibit poor generalization in some dynamic scenarios, where route switching and TCP congestion occur frequently. In this paper, we propose LineGraph-GraphSAGE (L-GraphSAGE), a graph neural network (GNN) model designed to improve the generalization ability of the IoV application of traffic identification in these dynamic scenarios. L-GraphSAGE utilizes node features, including text attributes, node context information, and node degree, to learn hyperparameters that can be transferred to unknown nodes. Our model demonstrates promising results in both UNSW Sydney public datasets and real-world environments. In public IoV datasets, we achieve an accuracy of 94.23%(↑0.23%). Furthermore, our model achieves an F1 change rate of 0.20%(↑96.92%) in α train, β infer, and 0.60%(↑75.00%) in β train, α infer when evaluated on a dataset consisting of five classes of data collected from real-world environments. These results highlight the effectiveness of our proposed approach in enhancing IoV application identification in dynamic network scenarios.

The preoperative prediction of lymph node metastasis of resectable pancreatic ductal adenocarcinoma using dual-layer spectral computed tomography.

To investigate the value of dual-layer spectral computed tomography (DLCT) parameters derived from primary tumors in predicting lymph node metastasis (LNM) of resectable pancreatic ductal adenocarcinoma (PDAC). In this retrospective study, patients with resectable PDAC who underwent DLCT within 2-week intervals before surgery were enrolled and randomly divided into training and validation sets at a 7:3 ratio. The patients' clinical data, CT morphological features, and DLCT parameters were analyzed. Univariate and multivariate logistic analyses were used to identify the predictors and construct a predictive model, and receiver operator characteristic (ROC) curves were programmed to evaluate the predictive efficacy. We enrolled 107 patients (44 patients with LNM and 63 patients without LNM). Among all variables, iodine concentration in the venous phase, extracellular volume, and tumor size were identified as independent predictors of LNM. The nomogram model, incorporating the two DLCT parameters and the morphological feature, achieved an area under the curve (AUC) of 0.877 (95% confidence interval [CI]: 0.803-0.952) and 0.842 (95% CI: 0.707-0.977) for predicting LNM in the training and validation sets, respectively. Furthermore, the AUC of the nomogram model was greater than that of morphological features of lymph nodes in the training (AUC = 0.877 vs. 0.570) and validation (AUC = 0.842 vs. 0.583) sets. DLCT has the potential to predict LNM in patients with resectable PDAC and show a better predictive value than morphological features of lymph nodes. Question Morphological features of lymph nodes are of limited value in detecting metastatic lymph nodes in pancreatic ductal adenocarcinoma (PDAC). Findings Dual-layer spectral computed tomography (DLCT) parameters and morphological features derived from PDAC lesions show good preoperatively predictive efficacy for lymph node metastasis. Clinical relevance The proposed DLCT-based nomogram model may serve as an effective and convenient tool for preoperatively predicting lymph node metastasis of resectable PDAC.

TRGCN: A Prediction Model for Information Diffusion Based on Transformer and Relational Graph Convolutional Network

In order to capture and integrate the structural features and temporal features contained in social graph and diffusion cascade more effectively, an information diffusion prediction model based on the Transformer and Relational Graph Convolutional Network (TRGCN) is proposed. Firstly, a dynamic heterogeneous graph composed of the social network graph and the diffusion cascade graph was constructed, and it was input into the Relational Graph Convolutional Network (RGCN) to extract the structural features of each node. Secondly, the time embedding of each node was reencoded using Bi-directional Long Short-Term Memory (Bi-LSTM). The time decay function was introduced to give different weights to nodes at different time positions, so as to obtain the temporal features of nodes. Finally, structural features and temporal features were input into Transformer and then merged. The spatiotemporal features are obtained for information diffusion prediction. The experimental results on three real datasets of X (formerly known as Twitter), Douban, and Memetracker show that compared with the optimal model in the comparison experiment, the TRGCN model has an average increase of 4.16% in Hits@100 metric and 13.26% in map@100 metric. The validity and rationality of the model are proved.

Identifying influential nodes in social networks via improved Laplacian centrality

Identifying influential nodes in social networks has significant applications in terms of social analysis and information dissemination. How to capture the crucial features of influential nodes without increasing the computational complexity is an urgent issue to be solved in the context of big data. Laplacian centrality (LC) measures nodal influence by computing nodes' degree, making it extremely low complexity. However, there is still significant room for improvement. Consequently, we propose the improved Laplacian centrality (ILC) to identify influential nodes based on the concept of self-consistent. Identifying results on 9 real networks prove that ILC is superior to LC and other 6 classical measures in terms of ranking accuracy, top-k nodes identification and discrimination capability. Moreover, the computational complexity of ILC has not significantly increased compared to LC, and remains the linear order of magnitude O(m). Additionally, ILC has excellent robustness and universality such that there is no need to adjust parameters according to different network structures.

Research on Smart City Road Network Capacity Optimization Configuration Based on Deep Learning Algorithms

At present, the urban traffic system is faced with the problems of congestion and low efficiency, and the traditional methods have certain limitations when dealing with the complex urban road network. This paper aims to explore a new method of capacity Optimization of Road Networks in a Smart City environment and proposes a method based on a Graph Neural network, named “Smart City Road optimization Graph Neural Network” (SCRO-GNN). SCRO-GNN first collects and preprocesses multi-source data, including road network data, traffic flow, accident records, environmental factors, etc. The key node and edge features, including the number of lanes at the intersection, the traffic flow of the section, and the adjacency matrix of the road network are defined to characterize the structure of the road network. Then, the graph neural network model is constructed and trained to predict the traffic flow of different sections and evaluate the road capacity by using the graph structure of the road network. This paper tests the performance of SCRO-GNN on real road networks in multiple cities. The results show that, compared with the traditional traffic flow prediction model, SCRO-GNN can significantly improve the prediction accuracy, especially when dealing with the highly complex urban road network structure. Based on these predictions, the proposed optimization strategy performed well in reducing traffic congestion and improving the efficiency of road use. The research in this paper not only demonstrates the potential of graph neural networks in smart city road network optimization, but also provides a new direction for future traffic system research. The successful implementation of the SCRO-GNN approach is expected to provide more efficient and intelligent solutions for urban traffic management and planning.

GRRIS: A Real-time Intrasite Observation Scheduling Scheme for Distributed Survey Telescope Arrays

The distributed telescope array offers promise for conducting large-sky-area, high-frequency time-domain surveys. Multiple telescopes can be deployed at each observation site, so intrasite observation task scheduling is crucial for enhancing observation efficiency and quality. Efficient use of observable time and rapid response to special situations are critical to maximize scientific discovery in time-domain surveys. Besides, the competing scientific priorities, time-varying observation conditions, and capabilities of observation equipment, lead to a vast search space of the scheduling. So with the increasing number of telescopes and observation fields, balancing computational time with solution quality in observation scheduling poses a significant challenge. Informed by the seminal contributions of earlier studies on a multilevel scheduling model and global scheduler for a time-domain telescope array, this study is devoted to further exploring the site scheduler. Formulating the observation scheduling of multiple telescopes at the site as a cooperative decision-making problem, this paper proposes GRRIS, a real-time intrasite observation scheduling scheme for the telescope array using graph and reinforcement learning (RL). It employs a graph neural network to learn node features that can embed the spatial structure of the observation scheduling. An algorithm based on multi-agent RL is designed to efficiently learn the optimum allocation policy of telescope agents to field nodes. Through numerical simulations with real-world scenarios, GRRIS can achieve up to a 22% solution improvement over the most competitive scheme. It offers better scalability and subsecond decision speed, meeting the needs of observation scheduling control for future distributed telescope arrays.

Multi-Modal Graph Aggregation Transformer for image captioning

The current image captioning directly encodes the detected target area and recognizes the objects in the image to correctly describe the image. However, it is unreliable to make full use of regional features because they cannot convey contextual information, such as the relationship between objects and the lack of object predicate level semantics. An effective model should contain multiple modes and explore their interactions to help understand the image. Therefore, we introduce the Multi-Modal Graph Aggregation Transformer (MMGAT), which uses the information of various image modes to fill this gap. It first represents an image as a graph consisting of three sub-graphs, depicting context grid, region, and semantic text modalities respectively. Then, we introduce three aggregators that guide message passing from one graph to another to exploit context in different modalities, so as to refine the features of nodes. The updated nodes have better features for image captioning. We show significant performance scores of 144.6% CIDEr on MS-COCO and 80.3% CIDEr on Flickr30k compared to state of the arts, and conduct a rigorous analysis to demonstrate the importance of each part of our design.

Chain-aware graph neural networks for molecular property prediction.

Predicting the properties of molecules is a fundamental problem in drug design and discovery, while how to learn effective feature representations lies at the core of modern deep-learning-based prediction methods. Recent progress shows expressive power of graph neural networks (GNNs) in capturing structural information for molecular graphs. However, we find that most molecular graphs exhibit low clustering along with dominating chains. Such topological characteristics can induce feature squashing during message passing and thus impair the expressivity of conventional GNNs. Aiming at improving node features' expressiveness, we develop a novel chain-aware graph neural network model, wherein the chain structures are captured by learning the representation of the center node along the shortest paths starting from it, and the redundancy between layers are mitigated via initial residual difference connection (IRDC). Then the molecular graph is represented by attentive pooling of all node representations. Compared to standard graph convolution, our chain-aware learning scheme offers a more straightforward feature interaction between distant nodes, thus it is able to capture the information about long-range dependency. We provide extensive empirical analysis on real-world datasets to show the outperformance of the proposed method. The MolPath code is publicly available at https://github.com/Assassinswhh/Molpath.

GSSCL: A framework for Graph Self-Supervised Curriculum Learning based on clustering label smoothing

Graph self-supervised learning is an effective technique for learning common knowledge from unlabeled graph data through pretext tasks. To capture the interrelationships between nodes and their essential roles globally, existing methods use clustering labels as self-supervised signals. However, in some cases, these methods may introduce noise, leading to over-fitting of the model and a reduction in performance. To address these issues, a novel framework for Graph Self-Supervised Curriculum Learning based on clustering label smoothing called GSSCL has been proposed. GSSCL clusters knowledge in an easy-to-difficult manner, reducing the heavy dependence on the reliability of clustering and improving the generalizability of the model. Moreover, the Silhouette Coefficient is employed to evaluate the clustering confident scores for all nodes. Some nodes are selected based on high confident scores to perform self-supervised learning. To account for the possibility of complex heterophilous information in graphs (e.g., noisy links), clustering pseudo-label smoothing is performed on K-nearest neighbor graphs built upon the similarities between node features instead of the original graph structures. The obtained multi-scale knowledge is then applied to curriculum learning. Finally, comprehensive experiments conducted across diverse public graph benchmarks demonstrate the superior performance of the proposed framework. It exhibits comparable results to state-of-the-art methods across semi-supervised node classification and clustering tasks.

Graph convolutional network for water network partitioning

The partitioning of a water distribution network into several district-metered areas (DMAs) yields is of great benefits for the management of water distribution systems, including enhanced leak control, pollution monitoring, and pressure optimization. However, achieving an effective partitioning that simultaneously incorporates node characteristics and network connections is challenging. Previous studies have tackled water network partitioning by focusing on either node features or pipe connections individually. In response to the limitations of current approaches for water distribution network partitioning, this study introduces an innovative unsupervised clustering approach for node partitioning based on graph convolutional network (GCN) techniques. Initially, the network nodes are clustered using the Cross-Attention Fusion Based Enhanced Graph Convolutional Network (CaEGCN) deep clustering algorithm, considering both the network’s topological layout and hydraulic properties. The resulting clusters categorize the network nodes into distinct regions. We evaluate our approach and other methods through a real world water distribution network using five different metrics commonly used to evaluate applied in assessing water supply network zoning issues. By comparing and analyzing the performance of experiments with other schemes, the experimental results demonstrate that the CaEGCN deep clustering method featured a remarkable performance. The proposed method showcases its potential for practical application by offering a dependable and easily interpretable water network partitioning solution.

Cluster-guided denoising graph auto-encoder for enhanced traffic data imputation and fault detection

In an era of increasing digitalization, the integration of diverse sensors has become commonplace. Within the transportation sector, state Departments of Transportation have extensively deployed traffic sensors to support various engineering endeavors. However, these sensors are prone to faults such as data loss, random noise, bias, and drift due to sensor aging, defects, or environmental influences. Therefore, detecting these faults is imperative to maintain data integrity. This paper presents a novel approach for detecting faults in traffic data based on a cluster-guided data reconstruction process. First, a traffic sensor clustering module is designed using a dual-encoding attention graph auto-encoder (DA-GAE) to identify clusters of traffic sensors. This module leverages a joint embedding of node and edge features in a low-dimensional vector space. Subsequently, utilizing the identified clusters, a cluster-guided denoising graph auto-encoder (CG-DGAE) is devised and trained for data reconstruction. The CG-DGAE employs a diffusion graph convolutional network (DGCN) and is trained with a cluster-wise sampling strategy. Extensive experiments were conducted using traffic data obtained from a real-world large sensor network, demonstrating superior performance of the CG-DGAE model in data reconstruction compared to various baseline methods. For fault detection, a score function is devised to discern potential faults by contrasting the sensor data sequence and the reconstructed data sequence. The fault detection results show that our proposed CG-DGAE model achieved an impressive overall accuracy of 99.09%, a precision of 99.13%, a recall of 99.53%, and a F1 score of 99.53%. The superior capability of CG-DGAE in data reconstruction and fault detection is attributable to the cluster-wise spatial–temporal context leveraged by the model.

Predicting functional connectivity network from routinely acquired T1-weighted imaging-based brain network by generative U-GCNet

Predicting the function magnetic resonance imaging (fMRI)-based brain network (fMRI-BN) from structure MRI-based brain network is imperative in clinical practice because fMRIs are not routinely acquired in a vast majority of hospitals. In this study, a generative U-GCNet (U-shaped graph convolutional Network) was proposed to predict fMRI-BN from radiomics-based morphological brain network (radMBN) derived from routinely acquired T1-WI image. Specifically, the U-GCNet consisted of a graph convolutional network (GCN) encoder module (En-GCN), a deep feature connectivity construction module (DF2C), and a GCN decoder module (De-GCN). Both En-GCN and De-GCN employed mixed local-and-long distance node feature aggregation strategy to enhance the graph encoding and decoding ability, and the DF2C reshaped the deep feature matrix into the connectivity matrix for outputting the brain network prediction. Additionally, a multi-scale network similarity loss function was conducted on full values, upper triangular values, and each row values of connectivity matrix. Experiments on 3169 subjects from three publicly available databases demonstrated that the U-GCNet could predict the fMRI-BN from radMBN with a promising performance (MSE [0.0002 0.0025], PCC [0.956 0.991]) over eight alternative methods under comparison. The results exhibited a significant correlation (PCC [0.796, 0.897], P<0.05) between the estimated and real radiomics-function coupling values. The individual-level and group-level brain network visualization was displayed with high consistency. The TOP brain regions identified by four graph-based metrics also exhibited with consistency. These results demonstrated that the proposed U-GCNet could achieve promising prediction of fMRI-BN from radMBN which could alleviate the limited availability of fMRI and boost its usage in clinical practice.

GeoHi-GNN: Geometry-aware hierarchical graph representation learning for normal estimation

Normal estimation has been one of the key tasks in point cloud analysis, while it is challenging when facing with severe noises or complex regions. The challenges mainly come from the selection of supporting points for estimation, that is, improper selections of points and points' scale will lead to insufficient information, loss of details, etc. To this end, this paper proposes one feature-centric fitting scheme, GeoHi-GNN, by learning geometry-aware hierarchical graph representation for fitting weights estimation. The main functional module is the continuously conducted Hierarchically Geometric-aware (HG) module, consisting of two core operations, namely, the graph node construction (GNC) and the geometric-aware dynamic graph convolution (GDGC). GNC aims to aggregate the feature information onto a smaller number of nodes, providing global-to-local information while avoiding the interferences from noises in larger scales. With these nodes distributed in different scales, GDGC dynamically updates the node features regarding to both intrinsic feature and extrinsic geometric information. Finally, the hierarchical graphical features are cascaded to estimate the weights for supporting points in the surface fitting. Through the extensive experiments and comprehensive comparisons with the state-of-the-arts, our scheme has exhibited many attractive advantages such as being geometry-aware and robust, empowering further applications like more accurate surface reconstruction.

EEG spatial inter-channel connectivity analysis: A GCN-based dual stream approach to distinguish mental fatigue status

Mental fatigue is defined as a decline in the ability and efficiency of mental activities. A lot of research suggests that the transition from alertness to fatigue is accompanied by alterations in correlation patterns among various brain regions. However, conventional methods for detecting mental fatigue seldom emphases inter-channel connectivity in the spatial domain. To fill this gap, this paper explores the spatial inter-channel connectivity in alertness and fatigue, employing spectral graph convolutional networks (GCN) for mental fatigue detection. We utilized Pearson correlation coefficients (PCC) to establish temporal connections and magnitude-squared coherence (MSC) for spectral connections. Topological features of the brain network were then analysed. To enhance the learning of spatial inter-channel connectivity, a dual-graph strategy transforms edge features into node features, serving as inputs to the spectral GCN. By simultaneously learning PCC and MSC features, the model results indicate significant differences in some brain network characteristics between alert and fatigue states. It confirms that the synchronicity of brain operations differs in the alert state compared to mental fatigue, and indicates that fatigue states can influence correlation patterns among different brain regions. Our approach is evaluated on a self-designed experimental dataset containing 7 subjects, demonstrating a classification accuracy of 89.59 % in group-level experiments and 95.24 % at the subject level. Additionally, on the public dataset SEED-VIG containing 23 subjects, our method achieves an accuracy of 86.58 %. In summary, this paper proposes a neural network approach based on a dynamic functional connectivity network. The network integrates both temporal and spectral connections with the goal of simultaneously learning spatial inter-channel connectivity in time and frequency domains. This effectively accomplishes fatigue state detection, highlighting that fatigue significantly influences correlations among different brain regions.

Insights into management and physiological determinants of lowest pod height in soybean

AbstractHarvest losses caused by the low height of the lowest pods (LPH) are a significant issue in soybean cultivation. Minimizing these losses requires identifying management, physiological, and agronomic factors that interactively modulate LPH. Four studies were conducted to examine the relationships among soybean LPH, node and internode features, and light quality under different management practices. These practices included population density (19, 31, and 43 plants m−2) and row width (equidistant, 25, 51, and 76 cm), relative maturity (maturity group [MG] 0.8, MG 2.1, and MG 2.8), mulch color (gray bare soil, red mulch, and white mulch), and timing of stand reduction (V1, R3, R4, and R5 growth stages). An increase in population density from 19 to 43 plants m−2 led to an average increase in LPH of 28%, from 11.9 to 15.3 cm. LPH was not influenced by row width. Later maturing cultivars demonstrated the highest potential for enhancing LPH, with late AG2802 having a higher LPH (18.8 cm) than early AG0803 (12.4 cm). Data indicated that the elongation of internodes 10, 11, and 12, along with changes in the red to far‐red light ratio beneath the canopy, plays a pivotal role in determining the location of the lowest pods. Moreover, LPH is established around the R3 growth stage. Nevertheless, further investigations are warranted to gain a better understanding of how these parameters, individually and collectively, influence LPH in soybean.

Deep learning-derived optimal aviation strategies to control pandemics

The COVID-19 pandemic affected countries across the globe, demanding drastic public health policies to mitigate the spread of infection, which led to economic crises as a collateral damage. In this work, we investigate the impact of human mobility, described via international commercial flights, on COVID-19 infection dynamics on a global scale. We developed a graph neural network (GNN)-based framework called Dynamic Weighted GraphSAGE (DWSAGE), which operates over spatiotemporal graphs and is well-suited for dynamically changing flight information updated daily. This architecture is designed to be structurally sensitive, capable of learning the relationships between edge features and node features. To gain insights into the influence of air traffic on infection spread, we conducted local sensitivity analysis on our model through perturbation experiments. Our analyses identified Western Europe, the Middle East, and North America as leading regions in fueling the pandemic due to the high volume of air traffic originating or transiting through these areas. We used these observations to propose air traffic reduction strategies that can significantly impact controlling the pandemic with minimal disruption to human mobility. Our work provides a robust deep learning-based tool to study global pandemics and is of key relevance to policymakers for making informed decisions regarding air traffic restrictions during future outbreaks.