Information diffusion prediction aims to forecast the temporal spread of opinions and behaviors by identifying potential adopters. Existing methods typically treat information diffusion as a sequence of individual adoptions and rely on computationally expensive pairwise (one-to-one) influence computations, often restricting predictions to just the next adopter. This individual-level paradigm both misrepresents real-world collective (many-to-many) influences and suffers a critical efficiency trade-off: to remain feasible, such models must truncate long diffusion histories, thereby overlooking early initiators and opinion leaders. To overcome these limitations, we formalize a more practical task: Group-based Information Diffusion Prediction, and propose an effective and scalable GRID framework. Specifically, GRID first learns group-oriented graph embeddings via a task-regularized information bottleneck objective, which amplifies key influence pathways and produces reliable user embeddings for group identification. Built on these embeddings, the core GroupAttn module captures inter-group influence while reducing complexity from quadratic to linear in cascade length. This enables the modeling of ultra-long cascades (exceeding 10,000 users) without truncation while preserving representational fidelity within a provable error bound. Finally, a group-wise objective guides the model to predict semantically meaningful future groups. Extensive experiments on four real-world datasets show that GRID outperforms ten state-of-the-art baselines by an average of 10.65% in accuracy, while achieving an order-of-magnitude gain in efficiency and extending the supported cascade length by up to 10 times.

Information popularity prediction, aiming to predict the growth of user participation in a trending topic diffusion, is a fundamental task in social networks. Existing methods often treat information diffusion as a single independent process, ignoring the ``public opinion field effect'' where multiple trending topics coexist and compete for user attention simultaneously. Inspired by Hawkes theory, we propose a novel Hawkes-process-based learning model for information popularity prediction, which takes into account both the temporal correlation among users' propagation behaviors in several topics diffusion and public opinion field effect in social networks. We first propose an improved neural Hawkes process to capture comprehensive propagation law from multiple dimensions and then propose a novel public opinion field paradigm based on the improved Hawkes process and cascade structure. We design a novel learning framework incorporating the public opinion field paradigm to extract high-quality representations for information popularity prediction. Extensive experiments on four real-world datasets validate that our model significantly outperforms the state-of-the-art competitors.

Information diffusion prediction is fundamental for forecasting user participation in information sharing on social networks, such as retweets on Twitter. Existing methods typically extract user relationships from social networks and historical interactions, while further capturing contextual information within the specific diffusion process. However, these methods have several limitations: (1) They often utilize sequential diffusion process for prediction and simplify differentiated influences among participants; (2) They capture user relationships on the entire graph for all users, in which most information is not necessary for a specific diffusion process and is too inefficient for real-world large-scale networks. To tackle these limitations, we propose a novel and scalable model SILN, for sphere-based information diffusion prediction on large social networks. Specifically, SILN features three components. First, we integrate two kinds of sphere effects in terms of structural and temporal views, which learn an enhanced cascade representation. Second, SILN designs an efficient learning scheme based on the cascade-specific subgraph, which significantly reduces the entire graph computation to smaller subgraphs. Third, to facilitate subgraph extraction, we develop an optimized graph storage technique to allow constant-time neighbor access and reduce the storage cost by about 30% in practice. Extensive experiments on six real-world datasets validate that SILN consistently outperforms seven state-of-the-art competitors in prediction performance while exhibiting exceptional time and space efficiency on million-node social networks.

Information diffusion prediction, which aims to forecast future infected users during the information spreading process on social platforms, is a challenging and critical task for public opinion analysis. With the development of social platforms, mass communication has become increasingly widespread. However, most existing methods based on GNNs and sequence models mainly focus on structural and temporal patterns in social networks, suffering from spurious diffusion connections and insufficient information for the diffusion analysis. We leverage strong reasoning capability of LLMs and develop a LL**M**-based causal framework for d**i**ffusion inf**l**uence **d**erivation (MILD). Comprehensively integrating four key factors of social diffusion, i.e., connections, active timelines, user profiles, and comments, MILD causally infers authentic diffusion links to construct a diffusion influence graph $G_I$. To validate the quality and reliability of our constructed graph $G_I$, we proposed a newly designed set of evaluation metrics w.r.t. diffusion prediction. We show MILD provides a reliable information diffusion structure that 12% absolutely better than the social network structure and achieves the state-of-the-art performance on diffusion prediction. MILD is expected to contribute to high-quality, more explainable, and more trustworthy public opinion analysis.

Sex-biased gene expression differs across human populations; however, the underlying genetic basis and molecular mechanisms remain largely unknown. Here, we explore the influence of ancestry on sex differences in the human transcriptome and its genetic effects on a Eurasian admixed population: Uyghurs living in Xinjiang (XJU), by analyzing whole-genome sequencing data and transcriptome data of 90 XJU and 40 unrelated Han Chinese individuals. We identified 302 sex-biased expressed genes and 174 sex-biased cis-expression quantitative loci (sb-cis-eQTLs) in XJU, which were enriched in innate immune-related functions, indicating sex differences in immunity. Notably, approximately one-quarter of the sb-cis-eQTLs showed a strong correlation with ancestry composition; i.e. populations of similar ancestry tended to show similar patterns of sex-biased gene expression. Our analysis further suggested that genetic admixture induced a moderate degree of sex-biased gene expression. Interestingly, analysis of chromosome interactions revealed that the X chromosome acted on autosomal immunity-associated genes, partially explaining the sex-biased phenotypic differences. Our work extends the knowledge of sex-biased gene expression from the perspective of genetic admixture and bridges the gap in the exploration of sex-biased phenotypes shaped by autosome and X-chromosome interactions. Notably, we demonstrated that sex chromosomes cannot fully explain sex differentiation in immune-related phenotypes.

Existing knowledge graph query approaches, whether traditional textual query languages or visual query languages, have steep learning curves that are unfriendly for non-expert users. This demonstration presents a Visual Query approach based on Full-Text search for knowledge graphs, called VQFT, which simplifies the process of querying knowledge graphs for users. Inspired by full-text search techniques, VQFT aims to combine the user-friendliness of visual query with the intuitiveness of full-text search , enabling users to query knowledge graphs as straightforward as using a search engine. Faceted full-text indexes, visual query constructor , and an interactive user interface are designed to achieve this goal. User tests and surveys have demonstrated that VQFT is more user-friendly and easier to learn than existing methods, which simplifies the construction of knowledge graph queries for non-expert users.

Node attribute label inference is an important problem in attributed networks. Most existing works assume that node labels are at a single level, but in practice, the attribute labels can always be organized in a hierarchical structure according to their semantics. In this paper, we propose a novel hierarchical label inference model for attributed networks. Specifically, we propose a triple attention mechanism to extract fine-grained label semantics from three levels: hierarchical, sibling and global. Next, we propose the semantic fully-connected layer to explicitly exploit label semantics for attribute inference. We also propose semantic label propagation to enhance the interaction between the label semantics and the attributed network, and this interaction enables nodes in the attributed network to realise the proximity assumption at the label semantic level. Finally, we combine the semantic fully-connected layer with semantic label propagation for top-down hierarchical attribute inference. Extensive experiments demonstrate the superiority of our model.

Trending topic diffusion and prediction analysis is an important problem and has been well studied in social networks. Representation learning is an effective way to extract node embeddings, which can help for topic propagation analysis by completing downstream tasks such as link prediction and node classification. In real world, there are often several trending topics or opinion leaders in public opinion space at the same time and they can be regarded as different centers of public opinion. A public opinion field will be formed surrounding every center. These public opinion fields compete for public's attention and it will potentially affect the development of public opinion. However, the existing methods do not consider public opinion field effect for trending topics diffusion. In this paper, we introduce three well-known observations about public opinion field effect in media and communication studies, and propose a novel and effective heterogeneous representation learning framework to incorporate public opinion field effect and social circle influence effect. To the best of our knowledge, our work is the first to consider these effects in representation learning for trending topic diffusion. Extensive experiments on real-world datasets validate the superiority of our model.

Reachability query is a fundamental problem and has been well studied on static graphs. However, in the real world, the graphs are not static but always evolving over time. In this paper, we study the problem of historical reachability query on evolving graphs. We propose a novel index, named HR-Index, which integrates complete and correct historical reachability information of the evolving graph. A historical reachability query on an evolving graph can be converted into a static reachability query on its HR-Index and thus query efficiency can be improved significantly. We also propose two optimization techniques to reduce the size of HR-Index effectively. We confirm the effectiveness and efficiency of our method through conducting extensive experiments on real-life datasets. Experimental results show both vertex and edge size of HR-Index are far smaller than that of the evolving graphs and our method has at least an order of magnitude improvement in time and space efficiency compared to the state-of-the-art method.

In the social network, each user has attributes for self-description called user attributes, which are semantically hierarchical. Attribute inference has become an essential way for social platforms to realize user classifications and targeted recommendations. Most existing approaches mainly focus on the flat inference problem neglecting the semantic hierarchy of user attributes, which will cause serious inconsistency in multi-level tasks. In this article, we propose a multi-level model MLI, where information propagation part collects attribute information by mining the global graph structure, and the attribute correction part realizes the mutual correction between different levels of attributes. Further, we put forward the concept of generalized semantic tree, a way of representing the hierarchical structure of user attributes, whose nodes are allowed to have multiple parent nodes unlike the regular tree. Both regular and generalized semantic trees are commonly used in practice, and can be handled by our model. Besides, by making the inference start from sub-networks with sufficient attribute information, we design a “Ripple” algorithm to improve the efficiency and effectiveness of our model. For evaluation purposes, we conduct extensive verification experiments on DBLP datasets. The experimental results show the superior effect of MLI, compared with the state-of-the-art methods.

Nowadays, numerous primary technologies, like ultra-dense networks (UDNs) and Base Stations (BSs) sleeping state, are developed in fifth-generation (5G) networks. Due to the UDNs, the number of BSs in 5G networks is proliferating, along with the energy consumption. Therefore, it is necessary to cut down the energy attrition in 5G networks under the assurance of delay. Till now, some researchers have proved that the association of users and the sleeping states of BSs have a significant effect on energy consumption and latency in 5G networks. However, the traditional solutions associate users and select states nonadaptively without the dual consideration of energy-saving and delay. In view of this, we propose a dual-adaptive delay-aware and energy-saving system (DADEs) in 5G networks. To further optimize the energy and delay of 5G BSs, the model is split into two tandem problems: user association and BS state selection. Meanwhile, a tandem deep reinforcement learning (T-DRL) algorithm is presented to make decisions in these problems for optimizing and balancing performance between delay and energy adaptively. Additionally, the real datasets of 5G users and BSs are used and trained in this paper. Finally, simulation results show that the DADEs saves more than 50% of energy with an adaptive and satisfying latency.

Existing image restoration methods usually assume specific degradation model, e.g., linear combination of clean image and degradation map in image denoising and deraining. Benefiting from the power of deep learning, a restoration mapping can be learned from degraded image to latent clean image. In this paper, we propose to integrate degradation learning into image restoration (IDLIR), where degradation model can be learned from training samples. In particular, IDLIR is an iterative restoration framework, where latent clean image and degradation map can be extracted from current residual degraded image, and are then fused by a degradation network to reconstruct degraded image. Then the residual degradation image can be updated by computing the difference between input and reconstructed degraded images. By taking denoising and deraining as examples, IDLIR is compared with state-of-the-art methods on several benchmark datasets. IDLIR performs better than state-of-the-art methods quantitatively and qualitatively.

Today’s Internet user experience greatly depends on some user-perceived network metrics, such as throughput and latency. To improve these metrics, many Internet content providers build the content delivery network (CDN) to provide their services. Generally, CDNs adopt TCP as their transport protocol. A recent line of work improves TCP by proposing novel congestion control algorithms. However, we measure TCP performance in the production CDN and identify an interesting phenomenon termed TCP capping. When the flows experience TCP capping, the fixed-size receive window (rwnd) restricts these flows from fully utilizing network bandwidth. Through in-depth analysis, we demystify that the root cause of TCP capping is an inappropriate constraint on rwnd due to not considering the receiver’s processing capability. To mitigate it, this paper proposes a server-side scheme Apollo and a client-side scheme Artemis for Internet content providers and users, respectively. Apollo probes the receiver’s processing capability and assists the sender in packet sending. And Artemis adjusts the receive buffer in light of the receiver’s processing capability. In our evaluation, compared to vanilla TCP, TCP (w/ Apollo) and TCP (w/ Artemis) shorten flow completion time by up to 91.8% and 94.9%, respectively.

With the advancement of the user application service demands, the IoT system tends to offload the tasks to the edge server for execution. Most of the current studies on edge computation offloading ignore the dependencies between components of the application. The few pieces of research on edge computing offloading which focus on the topology of application are primarily applied in single-user scenarios. Unlike previous work, our work mainly solves dependent task offloading with edge computing in multiuser scenarios, which is more in line with reality. In this article, the dependent task offloading problem is modeled as a Markov decision process (MDP) first. Then, we propose an actor–critic mechanism with two embedding layers for directed acyclic graphs (DAGs)-based multiple dependent tasks computation offloading, namely, ACED, by jointly considering the topology of the application and the channel interference between several users. Finally, the results of simulations also show the priorities of the proposed ACED algorithm.

With the rapid development of artificial intelligence, knowledge graphs have been widely recognized as a critical component in many AI techniques and systems. A complex knowledge graph may contain hundreds of millions of nodes and edges, thus is challenging for end-users to understand and query. In this paper, we present a knowledge graph interactive visual query language, KGVQL, to improve the efficiency of end-users’ understanding and querying of knowledge graphs. Furthermore, KGVQL realizes the novel capability of flexible bidirectional transformations between query graphs and query results, therefore significantly assisting end-users in constructing queries over large and unfamiliar knowledge graphs in an incremental way. We present the visual syntax of KGVQL, discuss our design rationale behind this interactive visual query language, and illustrate a number of case studies. We empirically evaluate the effectiveness of a visual query system based on KGVQL against a number of textual and visual query environments over a large knowledge graph, DBpedia. Our evaluation demonstrates the superiority of KGVQL in effectiveness and accuracy.

Evaluations of indoor earthquake safety actions can provide effective guidance for occupants, and can be beneficial for reducing earthquake-induced casualties. Accordingly, in this study, a virtual reality (VR)-based evaluation method is proposed for indoor earthquake safety actions. Specifically, an indoor seismic damage scene is constructed based on the Federal Emergency Management Agency (FEMA) P-58 method and a physics engine, by which the damage and movements of indoor nonstructural components can be accurately calculated. Subsequently, a virtual body model is created, and a corresponding inverse kinematics (IK) algorithm is developed to accurately track the earthquake safety actions of occupants. Finally, a human safety model based on collision kinetic energy and fatal conditions is designed for quantitatively evaluating the effectiveness of earthquake safety actions. Taking an office room and living room as case studies, three earthquake safety actions (i.e., “drop, cover, and hold on,” “triangle of life,” and “run outside”) are evaluated using the proposed method. The results indicate that “drop, cover, and hold on” is the safest action in most earthquake scenarios. The outcomes of this study can be used to rate the effectiveness of various earthquake safety actions, and to support occupant safety decision-making.

Today, considerable Internet traffic is sent from datacenter and heads for users. The network characteristics of connections served by servers in datacenters are usually diverse. As a result, a specific congestion control algorithm hardly accommodates the heterogeneity and performs well in various scenarios. In this work, we present Rein — a novel framework for Internet congestion control. With Rein, diverse congestion control algorithms can be assigned purposely to connections in one server to adapt to heterogeneity. We design and implement Rein in Linux, and the experiments validate that Rein is capable of smoothly switching among various candidate algorithms on the fly to achieve potential performance gain. Meanwhile, the overheads introduced by Rein are moderate and acceptable.

With the trend of outsourcing fabrication, split manufacturing is regarded as a promising way to both acquire the high-end nodes in untrusted external foundries and protect the design from potential attackers. However, in this article, we show that split manufacturing is not inherently secure, that a hardware Trojan attacker can still recover necessary information with a proximity-based or a simulated-annealing-based mapping approach together with a probability-based or net-based pruning method at the placement level. We further propose a defense approach by moving the insecure gates away from their easily attacked candidate locations. Results on benchmark circuits show the effectiveness of our proposed methods.

With the popularity of knowledge graphs growing rapidly, large amounts of RDF graphs have been released, which raises the need for addressing the challenge of distributed subgraph matching queries. In this paper, we propose an efficient distributed method to answer subgraph matching queries on big RDF graphs using MapReduce. In our method, query graphs are decomposed into a set of stars that utilize the semantic and structural information embedded RDF graphs as heuristics. Two optimization techniques are proposed to further improve the efficiency of our algorithms. One algorithm, called RDF property filtering , filters out invalid input data to reduce intermediate results; the other is to improve the query performance by postponing the Cartesian product operations. The extensive experiments on both synthetic and real-world datasets show that our method outperforms the close competitors S2X and SHARD by an order of magnitude on average.

Shortest path query is an important problem and has been well studied in static graphs. However, in practice, the costs of edges in graphs always change over time. We call such graphs as time-dependent graphs. In this paper, we study how to find a cost-optimal path with time constraint in time-dependent graphs. Most existing works regarding the Time-Dependent Shortest Path (TDSP) problem focus on finding a shortest path with the minimum travel time. All these works are based on the following fact: the earliest arrival time at a vertex v can be derived from the earliest arrival time at v 's neighbors. Unfortunately, this fact does not hold for our problem. In this paper, we propose a novel algorithm to compute a cost-optimal path with time constraint in time-dependent graphs. We show that the time and space complexities of our algorithm are O ( kn log n + mk ) and O (( n + m ) k ) respectively. We confirm the effectiveness and efficiency of our algorithm through conducting experiments on real datasets with synthetic cost.

Shortest path query is an important problem in graphs and has been well-studied. However, most approaches for shortest path query are based on single-cost (weight) graphs. In this paper, we introduce the definition of multi-cost graph and study a novel query: the optimal path query over multi-cost graphs. We propose a best-first branch and bound search algorithm with two optimizing strategies. Furthermore, we propose a novel index named k-cluster index to make our method more space and time efficient for large graphs. We discuss how to construct and utilize k-cluster index. We confirm the effectiveness and efficiency of our algorithms using real-life datasets in experiments.

In this paper, the authors proposed a novel English teaching model based on blended learning to assist students in successfully mastering the courses. The model is realized as a combination of a face-to-face environment and online learning using an English teaching system. In the system, student dynamic model is established with semantics. The personalized learning resource recommendation is made by support vector machines (SVMs) classifier based on the student dynamic model. The framework of learning resource management using domain ontology is described. A case study on blended learning approach for English teaching is given. The results indicate that blended learning provides an effective approach for the English teaching.