Latest ArticlesEfficient scene graph generation (SGG) serves as a bridge connecting low-level visual perception and high-level semantic reasoning, playing an important role in various vision-language tasks. However, existing dedicated SGG models often produce unreasonable relation predictions due to the lack of semantic constraint mechanisms. Although multimodal large language models (MLLMs) possess rich commonsense knowledge, their inherent black-box characteristics and severe hallucination issues lead to unreliable relationship reasoning results when directly applied to SGG tasks. To address these challenges, we propose KETR (commonsense knowledge embedding Transformer), an end-to-end scene graph generation model that incorporates commonsense knowledge embeddings. The model extracts global and local image features through a multi-scale visual feature fusion encoder and employs a parallel decoder based on learnable queries for entity detection. The core innovation lies in a soft alignment knowledge fusion mechanism that dynamically aggregates knowledge information through probabilistic mapping between visual features and external commonsense knowledge graph embedding spaces, and a commonsense-aware subject-object indicator and knowledge-driven scoring constraints are introduced, integrating the TransE scoring function as a regularization term into the joint training loss to significantly improve the logical consistency of relationship reasoning. Extensive experiments on Visual Genome and Open Images V6 demonstrate that KETR achieves competitive performance on multiple standard SGG metrics. Further ablation studies show that soft-aligned knowledge fusion improves the recognition of infrequent predicates, while the commonsense-aware subject-object indicator and knowledge-driven scoring constraint reduce relation predictions that conflict with entity roles, object affordances, and spatial semantics.
To address the limitations of large language models (LLMs) in source code vulnerability detection—namely insufficient utilization of program structural information, unstable reasoning processes, and high fine-tuning costs—we propose a vulnerability detection framework that integrates graph-based representations with LLM reasoning capabilities. The proposed method constructs data flow graphs (DFGs) from source code to model variable dependencies and semantic propagation paths, and aligns graph features with the semantic embedding space of LLMs through a cross-modal mapping module, enabling effective injection of structural knowledge into the language model. Furthermore, a progressive pretraining strategy based on code reconstruction tasks is designed to enhance the graph encoder’s ability to capture vulnerability-related structural patterns. On this basis, structured reasoning distillation and parameter-efficient fine-tuning via low-rank adaptation (LoRA) are incorporated to transfer vulnerability analysis knowledge from teacher models to student models, improving detection performance while reducing training overhead. In addition, a chain-of-thought reasoning process tailored for vulnerability detection is introduced to improve interpretability and reasoning consistency. Experimental results demonstrate that the proposed method significantly improves both the accuracy and robustness of source code vulnerability detection while maintaining low fine-tuning cost.
Knowledge tracing, as the core task of intelligent tutoring systems, aims to predict students’ future learning performance by analyzing their historical behavioral data, and provides a fundamental basis for personalized learning path planning. Current mainstream deep learning methods are constrained by knowledge boundaries and rely on single-feature modeling, often exhibiting issues such as overly simplified learning process modeling, inadequate contextual adaptability, and black-box prediction mechanisms that yield results lacking interpretability and difficult to translate into actionable teaching references. To address these challenges, we propose CAKT-Agent, a context-adaptive knowledge tracing agent based on mixture-of-experts model, and construct a three-tier collaborative architecture consisting of a unified memory module, a learning agent, and a companion agent: the unified memory module realizes global storage and sharing of learning data, educational priors and intermediate model states; The learning agent defines a five-dimensional context based on educational measurement theory and cognitive science, designs a hybrid expert architecture with dimension-aware capabilities, and achieves context-adaptive integration through a two-level gating mechanism; the companion agent generates learning diagnostic reports with educational comprehensibility based on expert activation weights and educational theory rules. Experimental results on real-world datasets show that the proposed model outperforms mainstream knowledge tracing models in the prediction accuracy of students' learning performance, with excellent context-adaptive capability and result comprehensibility.
Whole slide images (WSIs) are central to cancer diagnosis and prognosis. However, mainstream survival prediction methods directly map massive tile features into a single global representation for risk readout, failing to explicitly distinguish complex histological composition, ignoring cancer-specific clinical phenotype differences, and leaving the model’s internal reasoning process opaque. To address these issues, we propose PathRoute, an active evidence routing framework for interpretable WSI survival prediction. The framework models WSI reasoning as a two-stage directional process that first forms evidence and then reads out risk: four role-specific learnable queries collaborate in a shared latent space, respectively performing tissue-composition sensing, active evidence routing, phenotype-semantic auxiliary supervision, and risk readout; a directional attention mask further constrains forward visibility between queries, so that risk prediction is structurally realized as a downstream readout of pre-formed evidence representations, rather than an end-to-end black-box mapping. On five TCGA solid tumor cohorts under unified inputs and identical patient-level 5-fold cross-validation splits, PathRoute using WSI alone achieves higher average C-index than representative multimodal and WSI-only methods, validating the effectiveness of structured evidence organization. Further analysis shows that routing queries consistently and spontaneously concentrate attention onto tumor regions across all five cancer types without any tissue-type supervision, providing direct interpretability support for the active routing mechanism. Code available at https://github.com/ZephyrGo/pathRoute.
Non-volatile memory (NVM), with the advantages of persistence after power failure, high density, and large capacity, has attracted extensive attention from both academia and industry. However, its persistence also makes NVM more vulnerable to security threats such as unauthorized access and data tampering. To ensure data confidentiality and integrity during storage and access, secure NVM systems generally employ encryption and integrity verification mechanisms. Nevertheless, directly applying these mechanisms to NVM may cause severe write amplification, resulting in increased write latency and energy consumption. To address this problem, we propose epoch-based re-encryption delay (ERED), including word-epoch-based re-encryption delay (W-ERED) and line-epoch-based re-encryption delay (L-ERED). Since the re-encryption frequency of a data line is usually dominated by its most frequently updated word, W-ERED introduces flag bits for local counters to identify frequently overflowing words. When a local counter overflows, only the overflowing word is re-encrypted with a new line counter, while non-overflowing words continue to use the old line counter, thereby avoiding unnecessary re-encryption operations. Based on this observation, L-ERED further exploits the fact that the re-encryption rate of a data page is mainly determined by the data line with the highest overflow frequency in that page. By introducing overflow flags for line counters, L-ERED ensures that only overflowing data lines are re-encrypted with the major counter upon overflow, thus significantly reducing the re-encryption granularity and overhead caused by line-counter overflow. Furthermore, to reduce write overhead and improve crash recovery capability, we propose an enhanced scheme, STAR+. STAR+ introduces a counter write-filtering mechanism that writes counters back to NVM only when the number of cache updates reaches a preset threshold, thereby reducing counter write operations. During crash recovery, STAR+ adopts the Osiris technique and uses shadow counters to record incremental updates. It reconstructs counter states by reading persisted counter values, replaying the logged increments, and verifying their correctness. In addition, STAR+ restores the integrity tree by updating the authentication values of leaf and parent nodes and recursively recalculating upper-level Hash values, thereby ensuring consistency between data and metadata. Experimental results show that, compared with SECRET, W-ERED reduces the average write bit-flip rate by 5%, write latency by 11%, and write energy by 6%, with only 8/512 additional storage overhead. In L-ERED, the number of re-encrypted lines is only 26.7% of that in BASE and 47.7% of that in RSR, with only 1/512 additional storage overhead. Moreover, compared with STAR, STAR+ reduces NVM writes by 9.8% and performance overhead by 3.1%, while achieving comparable recovery time.
With the deep integration of 5G, artificial intelligence, and the Internet of things, network infrastructure is facing the dual challenges of an expanding dynamic attack surface and increasing threat stealthiness. Traditional static defense mechanisms are no longer capable of effectively countering the evolving attack strategies. Although the existing active deception defense systems have enhanced threat detection capabilities through honey point technology, they still have significant shortcomings, particularly the lack of dynamic effectiveness evaluation and resource optimization mechanisms, which leads to a severe imbalance between defense costs and security benefits. Current research primarily focuses on the initial deployment strategies and architectural improvements of honey points; however, these studies have not effectively addressed the periodic attenuation of defense effectiveness in dynamic confrontation scenarios. There are also obvious deficiencies in the quantitative modeling of multidimensional security indicators and closed-loop optimization mechanisms. To address this research gap, we propose a multi-dimensional effectiveness representation mechanism for honey point cluster defense systems. The mechanism constructs a comprehensive effectiveness evaluation system with three core indicators: redundancy risk index, cross-honey point IP repetition rate, and threat entrapment effectiveness score. Specifically, the method first uses deep embedded clustering technology to obtain the prior labels of honey point effectiveness, providing basic data for subsequent effectiveness evaluation. It then introduces a weight adaptive optimization mechanism driven by genetic evolutionary strategies to dynamically adjust the weights of the core indicators according to the actual threat environment and defense requirements, thereby achieving precise and efficient effectiveness evaluation. On this basis, a closed-loop defense system of “evaluation-feedback-optimization” is further established, enabling the defense system to adjust defense strategies and resource allocation promptly based on real-time effectiveness evaluation results, thereby significantly enhancing the intelligence level of active deception defense systems. This closed-loop defense system provides a feasible theoretical paradigm for promoting the intelligent development of active deception defense systems and is expected to play an important role in the field of future network security defense.
Adaptive gradient accumulation backdoor attack (AGABA) framework is designed for federated learning (FL) systems, integrating a parameterized adaptive subblock trigger (AST) with dynamic transparency and a multistage gradient accumulation (MGA) mechanism. This framework effectively addresses the persistent trade-off dilemma between stealthiness and persistence that plagues traditional backdoor attacks in the FL environment. AST decomposes the complete trigger into multiple independent components via dynamic transparency control and distributed subblock superposition technology, allowing malicious clients to collaboratively construct a global trigger pattern while maintaining a high level of attack stealthiness. MGA mechanism adopts a three-phase attack strategy including initial accumulation, gradient accumulation and attack execution, and combines it with a parameter importance-aware mechanism. It realizes the latent hiding and targeted activation of malicious updates in model aggregation through cross-round progressive gradient accumulation. Moreover, AGABA adopts momentum-accelerated gradient divergence propagation and adaptive memory factor adjustment, ensuring that all malicious gradient updates fall within the legitimate distribution interval of the FL system and thus evading statistical anomaly-based detection mechanisms effectively. Experiments show that with 20% malicious clients participating in FL training, AGABA can maintain a favorable backdoor attack success rate even under the protection of various mainstream defense mechanisms, and its overall performance outperforms single backdoor attack methods.
Artificial intelligence data centers (AIDCs) have emerged as a new and increasingly critical form of computing infrastructure. Unlike traditional cloud data centers that primarily provide virtualization of general-purpose computing resources, AIDCs are designed to support high-performance, AI-centric workloads such as large-scale model training and inference. As AI models continue to grow and complex, AIDC networks are required to deliver unprecedented levels of bandwidth, low latency, and efficient cross-device coordination. We provide a comprehensive analysis of AIDC network characteristics, including service requirements, topology design, communication patterns, and traffic characteristics, and further examine the unique challenges that arise from these aspects. Building on a network layering perspective, we then present a structured overview of key enabling technologies for AIDC networks. These technologies include collective communication libraries, transmission control, load balancing, data-link flow control, and fault management. Representative academic studies and industrial implementations are summarized to illustrate their strengths, limitations, and suitability for real-world AIDC deployments. Finally, we outline several future development trends, such as the convergence of general-purpose and AI-oriented data centers, deeper specialization and co-design across AIDC hardware and software stacks, and the advancement of multi-tenant, shareable AI computing power. These trends are expected to play a pivotal role in shaping next-generation AI infrastructure.
Time sensitive networking (TSN) enhances traditional Ethernet with technologies such as high-precision time synchronization and time-aware shaping, delivering end-to-end deterministic data transmission services characterized by low latency, low jitter, and high reliability. It finds extensive applications in aerospace, industrial control, vehicle networks, and other scenarios. However, the inability of a large number of existing Ethernet end nodes to upgrade for TSN time synchronization has become a bottleneck restricting TSN deployment and application. To address this, FlyPTP method is introduced. Its core innovation decouples time synchronization from end-node architecture through a cooperative design, using lightweight software on endpoints and dedicated hardware in access switches. The theoretical validity of FlyPTP method is proven, and the hardware logic of FlyPTP and related software is developed based on FPGA. Experiments are designed to deploy FlyPTP on various heterogeneous end nodes. The results show that all tested end nodes can be deployed without modifying existing software and hardware, with a synchronization accuracy reaching 85 ns. This verifies the capability of FlyPTP to achieve TSN time synchronization for heterogeneous end nodes without altering their existing architectures. By separating time synchronization functions from the complex and diverse hardware/software environments of end nodes, FlyPTP provides a flexible and scalable solution for upgrading traditional Ethernet to TSN, overcoming the limitations of hardware dependency and kernel modification in conventional methods. This not only reduces the technical threshold for TSN deployment but also ensures compatibility and performance consistency across different platforms, laying a solid foundation for the large-scale application of TSN in industrial Internet and critical infrastructure scenarios.
Graph pattern mining, as a core task for analyzing entity relationships, finds extensive applications in fields such as community detection and drug discovery. However, due to its non-polynomial time complexity, large-scale graph processing encounters challenges related to search space explosion and low computational efficiency. Existing GPU-accelerated solutions utilize parallel computing to enhance performance but often suffer from thread idleness caused by the power-law distribution of graph data and excessive CPU intervention in multi-GPU communication, which impede the full utilization of hardware capabilities. We present Saturn, a GPU-based graph pattern mining system, which overcomes the above bottlenecks through computation-communication co-optimization. At computation level, Saturn decouples the loading and querying phases of set operations, employs fine-grained parallel batch processing to dynamically adapt Hash and binary search algorithms, and optimizes memory access efficiency via shared memory caching, significantly improving thread utilization. At communication level, it establishes a CPU-free GPU communication model, leveraging high-bandwidth NVLink interconnect and unified memory mechanism for direct cross-device data access, while reducing redundant transmission and link contention through vertex caching and message aggregation scheduling. Experimental results demonstrate that Saturn outperforms state-of-the-art GPU-based graph mining systems on real-world datasets, achieving superior computational parallel efficiency and cross-device communication effectiveness for large-scale graph pattern mining tasks.