Landslides are among the most common geological hazards that result in considerable human and economic losses globally. Researchers have put great efforts into addressing the landslide prediction problem for decades. Previous methods either focus on analyzing the landslide inventory maps obtained from aerial photography and satellite images or propose machine learning models—trained on historical land deformation data—to predict future displacement and sedimentation. However, existing approaches generally fail to capture complex spatial deformations and their inter-dependencies in different areas. This work presents a novel landslide prediction model based on graph neural networks, which utilizes graph convolutions to aggregate spatial correlations among different monitored locations. Besides, we introduce a novel locally historical transformer network to capture dynamic spatio-temporal relations and predict the surface deformation. We conduct extensive experiments on real-world data and demonstrate that our model significantly outperforms state-of-the-art approaches in terms of prediction accuracy and model interpretations.

Accurate urban flow prediction (UFP) is crucial for a range of smart city applications such as traffic management, urban planning, and risk assessment. To capture the intrinsic characteristics of urban flow, recent efforts have utilized spatial and temporal graph neural networks to deal with the complex dependence between the traffic in adjacent areas. However, existing graph neural network based approaches suffer from several critical drawbacks, including improper graph representation of urban traffic data, lack of semantic correlation modeling among graph nodes, and coarse-grained exploitation of external factors. To address these issues, we propose DiffUFP , a novel probabilistic graph-based framework for UFP. DiffUFP consists of two key designs: (1) a semantic region dynamic extraction method that effectively captures the underlying traffic network topology, and (2) a conditional denoising score-based adjacency matrix generator that takes spatial, temporal, and external factors into account when constructing the adjacency matrix rather than simply concatenation in existing studies. Extensive experiments conducted on real-world datasets demonstrate the superiority of DiffUFP over the state-of-the-art UFP models and the effect of the two specific modules.

Online Social Networks (OSNs)( e.g., Facebook, Twitter, and Tecent QQ) are popular platforms for people to share information online. The providers of OSNs typically leverage demographic attributes of users in OSNs to perform business behaviors like personalized commodity recommendation, advertisement delivery, etc. Thus, understanding demographic attributes of users in OSNs is of great importance. However, some users refuse to reveal their demographic information due to privacy concerns. Therefore, inferring demographic attributes of users in OSNs with public information is an attractive topic for researchers. Most existing methods mainly focus on individual attribute inference without taking the relationship among attributes into account, which results in low precisions. In this paper, we propose a novel approach, called DeepAttr, to infer users’ multiple attributes simultaneously. DeepAttr leverages existing network embedding algorithm to learn the social embedding for each user. Meanwhile, it encodes multiple attributes into structured attribute vectors which are treated as class labels. The core component of DeepAttr is a multi-layer fully connected deep neural network which captures complex nonlinear mapping between the users’ social embeddings and the structured attribute vectors. Extensive experiments on a real-world dataset demonstrate that DeepAttr outperforms existing models in both single-attribute inference and multiple-attribute inference as to macro-Precision, macro-Recall, and macro-F1.

Recent advancements in generative modeling have successfully integrated denoising diffusion probabilistic models (DDPMs) into the domain of speech enhancement (SE). Despite their considerable advantages in generalizability, ensuring semantic consistency of the generated samples with the condition signal remains a formidable challenge. Inspired by techniques addressing posterior collapse in variational autoencoders, we explore skip connections within diffusion-based SE models to improve consistency with condition signals. However, experiments reveal that simply adding skip connections is ineffective and even counterproductive. We argue that the independence between the predictive target and the condition signal causes this failure. To address this, we modify the training objective from predicting random Gaussian noise to predicting clean speech and propose a progressive skip connection strategy to mitigate the decrease in mutual information between the layer's output and the condition signal as network depth increases. Experiments on two standard datasets demonstrate the effectiveness of our approach in both seen and unseen scenarios. The code is publicly available at https://github.com/ICDM-UESTC/SCSE.

Accurate traffic flow measurement is essential for the development of smart cities, yet the deployment of ubiquitous monitoring sensors using traditional methods is often cost-prohibitive. This article proposes an innovative entropy-aware masked autoencoder framework, namely TMAE, for low-cost traffic flow inference. TMAE leverages a small number of selectively measured regions with few deployed sensors to infer traffic flow across entire urban areas, incorporating prior knowledge from road distribution maps. Specifically, TMAE employs a shared encoder to process traffic flow context, using self-attention scores to identify the importance of each region and guide a masking policy that retains regions rich in traffic flow information. The road distribution map, reflecting inherent traffic flow patterns, is incorporated as prior knowledge by substituting masked tokens during training. A cross-attention mechanism in the decoder further refines inference, where embeddings from the road distribution map serve as queries, and retained visible patches act as keys and values. Additionally, regional traffic entropy is introduced to quantify the information richness of each region, enabling the selection of minimal measurement regions to optimize inference for other areas. Extensive experiments conducted on datasets from various cities demonstrate the effectiveness and efficiency of TMAE, highlighting its potential as a scalable solution for low-cost traffic flow inference in urban environments. The source code of this work is released at https://github.com/TextGraph/TMAE.

P2P systems are currently the popular file-sharing platforms. The cooperation mechanism of P2P system can't offer fair exchange function. Because P2P system is a decentralized system, using a dedicated TTP server to support fair exchange is not suitable. A fair exchange protocol in P2P system without dedicated TTP is proposed, which is called P2PFair. P2PFair offers the fairness and secret guarantee. The fairness is provided by Dis_TTP which is composed of n random peers. P2PFair uses IBE to guarantee the secret of items exchanged. In order to eliminate collusion, Dis_TTP using threshold mechanism to manage the shadows of master key which is generated by distributed key generation algorithm. The threshold mechanism accommodates the fault-tolerant capacity at the same time. According to the probability analysis, the collusion probability is negligible. The protocol analysis shows that P2PFair is an effective solution of fair exchange in P2P sharing systems