In the digital age, software security is essential for the stability of information systems and data protection, yet increasing complexity in software systems has made vulnerabilities a significant cybersecurity threat, leading to data breaches, system crashes, and service disruptions. Traditional vulnerability assessments usually analyze vulnerabilities in isolation, ignoring their time relations and the risk of attackers exploiting multiple vulnerabilities simultaneously, known as co-exploitation. This paper proposes an innovative time-aware cybersecurity knowledge graph (TCG) reasoning method called TCGFormer, which is designed to address these challenges. TCGFormer comprises four modules: (1) an entity encoding module that adjusts attention based on positional information and interaction frequency, (2) a novel attention mechanism for encoding relational topology graphs, (3) a joint sequence encoding module for extracting temporal representations and node relations from historical interactions, and (4) a parameter learning module for predicting entities and relations. Extensive experiments on three public temporal datasets demonstrate that TCGFormer significantly outperforms existing baseline methods, and validation on a cybersecurity knowledge graph dataset—including NVD, CVE details, CWE database, and EDB—further confirms its efficacy in identifying co-exploitation behaviors.

The geographic location of social media users is crucial for understanding user behavior, optimizing advertising, and supporting location-based services such as emergency awareness and event monitoring services. However, existing Twitter user geolocation methods primarily focus on explicit social relationships between users while overlooking implicit location correlations, which affects the accuracy of user geolocation. To address this, this article proposes a Twitter user geolocation method (GeoICMF) based on implicit location correlations and multi-scale feature fusion. GeoICMF introduces a novel location association graph construction method to effectively capture implicit location correlations among users, an innovative multi-scale feature fusion model to dynamically fuse multi-scale features and generate richer user representations, and a pioneering geographic partitioning method to better adapt to user location distributions and enhance geolocation accuracy. Extensive experiments on three real-world datasets demonstrate that GeoICMF outperforms state-of-the-art baseline methods in Twitter user geolocation tasks, validating the effectiveness and superiority of the proposed method.

The geolocation of social users is crucial for understanding user behavior, optimizing advertisement placement, and enhancing public safety.However, existing methods tend to show some deficiencies when handling sparse datasets and may not fully capture the natural clustering characteristics of user locations, thereby resulting in inadequate geolocation accuracy.This paper proposes a novel social user geolocation method (MILGCN) that innovatively integrates Mean Shift Clustering, Incremental Learning, and Graph Convolutional Networks.Specifically, Mean Shift performs fine-grained clustering of user locations based on density peak characteristics, ensuring that geographically close users are grouped into the same cluster.Introducing an incremental learning mechanism into graph convolutional networks enables MILGCN to have progressive learning ability.As a result, the problem of incomplete feature extraction from sparse data is alleviated, resulting in more comprehensive user features and improved geolocation accuracy.Extensive experiments proved that the proposed method significantly outperforms the state-of-the-art baselines on the real Twitter datasets, demonstrating a substantial improvement in geolocation performance.

In the era of big data, data security poses a paramount challenge in dealing with large-scale data in cloud computing environments. Traditional encryption methods such as RSA and Paillier face the problems that, as the data volume increases, the encryption consumes too much computation resource and the storage size of ciphertext is too large. To tackle these problems, this paper explores secure and lightweight tensor train (TT) based encryption methods for large-scale data in federated cloud environments. First, we develop a novel encryption method called Orthogonalized TT Encryption (OTT-EPT), which can encrypt large-scale plaintext data into a list of small-size ciphertext (TT cores) and store them in different clouds. Second, to tackle the unique characteristics of TT decomposition that adjacent TT cores have the same rank, which could be exploited by attackers to threaten encrypted data, we further propose a Noise-Added Orthogonalized TT Encryption (NOTT-EPT) method. NOTT-EPT can change arbitrary TT-rank by adding noise TT-cores on specific order. Furthermore, we present a TT-based encryption framework and a suite of secure homomorphic operation protocols for large-scale data computation in federated cloud environments. The experimental results indicate that, compared to state-of-the-art methods, our proposed methods not only ensure the integrity and security of encrypted data but also reduce both time and space consumption by about 1000 times.

Cancer is known as a heterogeneous disease. Cancer driver genes (CDGs) need to be inferred for understanding tumor heterogeneity in cancer. However, the existing computational methods have identified many common CDGs. A key challenge exploring cancer progression is to infer cancer subtype-specific driver genes (CSDGs), which provides guidane for the diagnosis, treatment and prognosis of cancer. The significant advancements in single-cell RNA-sequencing (scRNA-seq) technologies have opened up new possibilities for studying human cancers at the individual cell level. In this study, we develop a novel unsupervised method, CSDGI (Cancer Subtype-specific Driver Gene Inference), which applies Encoder-Decoder-Framework consisting of low-rank residual neural networks to inferring driver genes corresponding to potential cancer subtypes at the single-cell level. To infer CSDGs, we apply CSDGI to the tumor single-cell transcriptomics data. To filter the redundant genes before driver gene inference, we perform the differential expression genes (DEGs). The experimental results demonstrate CSDGI is effective to infer driver genes that are cancer subtype-specific. Functional and disease enrichment analysis shows these inferred CSDGs indicate the key biological processes and disease pathways. CSDGI is the first method to explore cancer driver genes at the cancer subtype level. We believe that it can be a useful method to understand the mechanisms of cell transformation driving tumours.

Cross-network anchor link discovery is an important research problem and has many applications in heterogeneous social network. Existing schemes of cross-network anchor link discovery can provide reasonable link discovery results, but the quality of these results depends on the features of the platform. Therefore, there is no theoretical guarantee to the stability. This article employs user embedding feature to model the relationship between cross-platform accounts, that is, the more similar the user embedding features are, the more similar the two accounts are. The similarity of user embedding features is determined by the distance of the user features in the latent space. Based on the user embedding features, this article proposes an embedding representation-based method Con&Net(Content and Network) to solve cross-network anchor link discovery problem. Con&Net combines the user’s profile features, user-generated content (UGC) features, and user’s social structure features to measure the similarity of two user accounts. Con&Net first trains the user’s profile features to get profile embedding. Then it trains the network structure of the nodes to get structure embedding. It connects the two features through vector concatenating, and calculates the cosine similarity of the vector based on the embedding vector. This cosine similarity is used to measure the similarity of the user accounts. Finally, Con&Net predicts the link based on similarity for account pairs across the two networks. A large number of experiments in Sina Weibo and Twitter networks show that the proposed method Con&Net is better than state-of-the-art method. The area under the curve (AUC) value of the receiver operating characteristic (ROC) curve predicted by the anchor link is 11% higher than the baseline method, and Precision@30 is 25% higher than the baseline method.