Current Issue

  • 2026 Volume 47 Issue 5
    Published: 26 May 2026
      

  • Select all
    |
  • 2026, 47(5): 1025-1031.
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    To address the challenges of massive data volume and substantial computational overhead in large area electromagnetic spectrum maps construction,a sparse Gaussian process regression method based on variational inference is proposed.First,the electromagnetic spectrum map construction problem is modeled as a regression problem,and mapping relationship between geographic location and corresponding received signal strength is fitted using collected data.Second,the mapping relationship is modeled as a Gaussian stochastic process,and the non-parametric property of Gaussian process regression is used to construct a prediction model.Finally,only part of the collected data is selected as input of the model,and a sparse Gaussian process regression prediction model is obtained by maximizing the similarity between variational distribution and posterior distribution.Simulation experiments and real data experiments show that this method can significantly reduce computational complexity and speed up operation process while obtaining high-precision electromagnetic spectrum maps.
  • 2026, 47(5): 1032-1040.
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Risk identification is essential for maintaining the integrity of industry chains by precisely locating vulnerable nodes to interrupt risk propagation.However,existing methods lack collaborative modeling of industry nodes across static-indicator level,dynamic-time-series level,and structural-spatial level representations.Therefore,this paper proposes an industrial chain risk identification model based on a heterogeneous graph neural network with multi-module attention collaboration(MGRI).MGRI first dynamically learns and assigns weights to attribute dimensions based on a company′s industry to emphasize the importance of key indicators;it simultaneously captures the risk evolution information embedded in low-frequency financial time series to form a global dynamic temporal representation; finally,using the fused static and dynamic features as initial representations,it aggregates relation-aware neighborhood information to generate the final embeddings that contain the structural-spatial dependencies of the industry chain for risk identification,thereby achieving collaborative modeling of cross-dimensional,multi-level features.Experiments on two real-world industry chain datasets demonstrate that MGRI outperforms state-of-the-art methods in accurately identifying at-risk enterprises.
  • 2026, 47(5): 1041-1047.
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    With the development of computer deep learning theory and the enhancement of the demand for intelligent fault diagnosis and operation and maintenance of key equipment in the field of aviation,the monitoring and evaluation method of the operating state of aero-engine based on deep learning has become an important guarantee for the safe operation of aircraft.Due to the complexity of the mechanical structure of the aero-engine and the high-speed operation of the bearings in a harsh environment such as high temperature and high pressure,there are problems such as multi-scale and non-linearity in the fault characteristic information,which makes it difficult to effectively identify and analyze and diagnose the fault signals.Therefore,this paper proposes a CAE-LSTM-based fault diagnosis method for airframe bearings,which firstly utilizes the improved Convolutional Autoencoder (CAE) to perform downscaling and feature extraction for high-dimensional vibration signals,and then inputs the extracted features into the Long Short-Term Memory (LSTM) classification network.Memory (LSTM) classifier for fault type identification,thus improving the accuracy and robustness of bearing fault classification.The experimental results show that the method proposed in this paper can effectively learn the dynamic features in the aircraft bearing sensing signal sequence and improve the accuracy and intelligence of aircraft bearing fault diagnosis.
  • 2026, 47(5): 1048-1055.
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    As artificial intelligence continues to be applied in highly regulated domains,ensuring that large language models comply with strict legal constraints has become a central challenge.Existing approaches often face limitations such as high annotation costs,poor adaptability to evolving regulatory environments,and conflicts between user preferences and compliance requirements.To address these issues,this paper proposes a fine-tuning framework based on Reinforcement Learning from Knowledge Base Feedback(RLKBF).This method constructs a structured legal knowledge base using semantically enhanced vector representations and hierarchical retrieval mechanisms.Additionally,a dual-objective optimization strategy is introduced,incorporating a compliance deviation penalty to balance user intent with regulatory constraints.Experimental results demonstrate that RLKBF outperforms mainstream models in terms of response accuracy,compliance stability,and expert evaluation metrics,significantly improving the model's ability to integrate and apply domain-specific legal knowledge.
  • 2026, 47(5): 1056-1069.
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Deep reinforcement learning algorithms achieve impressive performance in multiple challenging tasks by combing the powerful representation learning capability of deep learning together with the sequential decision ability of reinforcement learning.However,as for some risk-aware real-world systems,collecting the data based on trial-and-error method is inaccessible because it is dangerous,expensive and sample inefficient.The active learning framework is an important reason that hinders the widespread applications of online reinforcement learning algorithms.Offline reinforcement learning is a data-driven paradigm that can learn exclusively from the static dataset without interaction with the environment during the training process.Due to the ability of learning from the previously collected data,offline reinforcement learning is appealing to deal with real-world applications.In this paper,the fundamentals of reinforcement learning is first introduced.Then,we analyze the challenges of this active learning framework to deal with practical systems.Second,the problem formulation of offline reinforcement learning is provided.A comprehensive review of important algorithms,common benchmarks and main practical applications in this field is given.Finally,we summarize the primary challenges and discuss research directions.
  • 2026, 47(5): 1070-1078.
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    In recent years,Heterogeneous Graph Neural Networks have demonstrated strong capabilities in modeling complex relationships involving multiple types of nodes and edges.However,message-passing-based architectures still face limitations such as restricted expressive power,over-smoothing,and over-squashing.This paper proposes a novel Transformer architecture,CHGormer,which innovatively addresses the challenge of integrating local heterogeneous relations with global semantic dependencies in heterogeneous graphs by combining contrastive learning with a token generation mechanism for heterogeneous relation encoding.Specifically,CHGormer introduces a dual-space token generation strategy,where positive and negative token sequences are sampled separately from the attribute and topology feature spaces.These are then aggregated through type-aware neighborhood aggregation to form heterogeneous relational representations,which are incorporated into global interactions as attention biases.Moreover,a contrastive learning-based cross-sequence optimization is employed to further enhance the discriminative power of node representations.
  • 2026, 47(5): 1079-1088.
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Neural Architecture Search(NAS)is a key technology for deep learning automation,but its high computational cost severely limits its practical applications.Traditional methods require complete training for each candidate architecture,resulting in a time-consuming and resource intensive search process.This article proposes a progressive multi fidelity neural architecture search method(PMF-NAS),which achieves efficient architecture search through a three-stage progressive strategy.PMF-NAS uses low fidelity to quickly evaluate and identify high potential areas during the global exploration phase,uses medium fidelity to refine the search within a reduced space during the area search phase,and performs high fidelity validation on the optimal candidate during the fine optimization phase.The core of this method is a performance predictor based on early training features,which can accurately predict the final performance of the architecture and avoid a large amount of ineffective computation.At the same time,an adaptive resource allocation mechanism is introduced to dynamically adjust the evaluation investment based on the potential and uncertainty of the architecture.Experiments have shown that PMF-NAS can complete searches in 8~9 hours in a single GPU environment,while achieving optimal or near optimal accuracy on multiple datasets.Text provides a practical solution for neural architecture search in resource constrained environments,reducing the application threshold of NAS technology and potentially promoting its application in a wider range of fields.
  • 2026, 47(5): 1089-1098.
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Efficiently mining research hotspots and their corresponding authors is a critical task in academic research.To address the limitations of traditional author topic models,which often overlook contextual semantics,struggle to incorporate external knowledge,and fail to model background topics,this paper proposes a contextualized neural author topic model.The model utilizes Transformer to capture contextual semantics of text to improve the accuracy of topic inference,incorporates pre-trained word and author embeddings into the decoding process,and employs von Mises-Fisher distribution for topic modeling to improve topic quality.Meanwhile,it uses Dirichlet tree distribution as a prior to distinguish background topics from hotspot topics.Furthermore,the paper introduce two metrics to quantify the degree of association between research hotspots and authors.Experiments were conducted on three constructed datasets:Computational Linguistics,Computer Vision,and Data Mining.The results demonstrate that the model outperforms existing methods in topic coherence,diversity,and author-topic relevance,validating its superiority in mining research hotspots.
  • 2026, 47(5): 1099-1107.
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Precise traffic flow prediction is fundamental to the development of intelligent transportation systems and smart city initiatives.Traffic flow data is characterized by complex spatio-temporal dependencies,manifesting multi-scale feature variations and dynamic evolutionary patterns.Existing methodologies exhibit significant limitations in capturing these multi-scale spatio-temporal features,thus failing to adequately exploit the rich spatio-temporal correlations inherent in traffic data.Pre-trained Large Language Models(PLMs)have demonstrated considerable potential in feature representation learning;however,their direct application is substantially constrained by the domain disparity between their pre-training data,which is predominantly concentrated in natural language domains,and the distinctive characteristics of traffic flow data.To address these challenges,this paper proposes a Pre-trained Spatio-Temporal Attention Model for Traffic Flow Prediction(PSTAM).The framework incorporates two primary innovations:firstly,an innovative dual-pathway activation mechanism to resolve domain disparities,facilitating effective feature alignment and fusion;secondly,advanced pre-training strategies for comprehensive modeling of multi-scale spatio-temporal features,substantially enhancing the capacity to capture complex spatio-temporal dependencies.Experimental evaluations demonstrate that PSTAM consistently outperforms state-of-the-art methods across multiple benchmark traffic datasets,providing robust support for real-time decision-making processes in intelligent transportation systems.
  • 2026, 47(5): 1108-1116.
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Aiming at the problem that the existing temporal knowledge graph reasoning has insufficient ability to capture long-distance dependencies and lack of interpretability,a temporal knowledge graph completion model combining Transformer and reinforcement learning is proposed.This model uses reinforcement learning to design a new highly interpretive strategy network,which is composed of three core components:time-aware encoder,path context encoder and action scoring device.First,the time-aware encoder uses the self attention mechanism to embed the time information into the relational representation,which enhances the ability to deal with the time dynamics;Secondly,the path context encoder uses Transformer to efficiently encode historical event sequences,capturing long-distance dependencies;Thirdly,the action scorer uses the two-way gated cycle unit to predict actions,which improves the accuracy of prediction.In addition,for the problem of reward sparsity,the proposed model introduces a new reward function,which comprehensively considers time shaping reward,path length reward and path diversity reward,and provides more detailed feedback to optimize path selection.This paper compares the proposed model with the existing advanced methods on four public datasets,and the results show that the proposed model is effective in evaluating the MRR and Hits@k.Compared with the baseline method,the above method has improved.
  • 2026, 47(5): 1117-1126.
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Federated Learning (FL) is a typical distributed machine learning approach.Due to its unique advantages in privacy preservation,FL has garnered widespread attention and research in recent years.However,traditional federated learning faces two core challenges that urgently need to be addressed:the issue of data heterogeneity and the conflict between model generalization and personalization.To tackle these problems,the concept of Personalized Federated Learning (PFL) has been introduced.PFL enables personalized model adjustments based on the local data characteristics of each federated learning client,allowing clients to build customized models according to their specific needs while protecting the privacy of their sensitive data.This paper provides an overview of the concept of personalized federated learning and the key challenges it currently faces,categorizes and reviews the developmental progress of various PFL methods,and introduces some emerging research directions and practical applications of personalized federated learning.
  • 2026, 47(5): 1127-1133.
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    In the medical area,automated question answering places high demands on the accuracy of answers.Although large language models (LLMs) provide general-purpose question-answering capabilities,they cannot meet the stringent accuracy requirements of the medical domain.In contrast,knowledge graph-based automated question answering relies on objective knowledge representation to ensure answer reliability.However,current methods suffer from issues such as inefficient knowledge graph retrieval,insufficient coverage,excessive redundant information,and inadequate understanding of complex questions,which negatively impact retrieval quality.To address these challenges,this paper integrates knowledge graphs with LLMs.Specifically,the LLM is used to decompose user questions into sub-questions,each of which is then subjected to subgraph retrieval in the knowledge graph.The merged subgraphs are then fed back to the LLM to generate reliable answers.The proposed method is evaluated on medical datasets (GenMedGPT-5k,LiveQA,HealthCareMagic-100k) and the knowledge graph FB15k-237.Experimental results demonstrate that the proposed approach achieves superior performance.
  • 2026, 47(5): 1134-1146.
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    In classification tasks utilizing k-nearest neighbors(kNN)algorithm,insufficient feature representation of original data and reliance on majority voting for decision-making can significantly hinder the algorithm′s classification performance.To address this issue,this paper proposes an Enhanced k-Nearest Neighbor algorithm(EnDWkNN)based on multi-view generation and evidence theory.This approach aims to enhance the classification performance of kNN by providing a more comprehensive description of data features and making more accurate classification decisions.It first employs multiple super-parent class-dependent estimators along with random forest algorithms to classify the original attribute view,generating two new label views.Then,distance-weighted k-NN algorithms are constructed separately on original attribute view and two generated label views.Finally,Dempster-Shafer(D-S)theory is applied to fuse the predictions from different view-based k-NN algorithms,resulting in an aggregated final classification outcome.Experimental results demonstrate that EnDWkNN outperforms traditional kNN as well as other competitors in terms of both classification accuracy and root relative squared error metrics.
  • 2026, 47(5): 1147-1155.
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Given the profound impact of news bias on public perception,social trust,and fairness,building transparent and interpretable debiasing frameworks with natural language processing(NLP)has become a research focus at the intersection of communication studies and artificial intelligence.Existing work mainly targets lexical bias and framing bias.For lexical bias,mainstream approaches replace explicit biased words but struggle with implicit stance tendencies in neutral words and poor contextual adaptability.For framing bias,text reconstruction or multi-text fusion is often used,yet faces the unobservability of framing bias,difficulty in disentangling stance conflicts,and vague generation objectives,limiting further improvement.To address these issues,we propose a multi-stage news bias mitigation method combining causal intervention and counterfactual reasoning.A PMI-based multi-stance lexicon and a back-door intervention mechanism perform semantic similarity-based word replacement to reduce explicit bias.Counterfactual reasoning with TIE=TE-NDE models the influence of left-and right-leaning frames on neutral expressions,where TE is the total bias effect,NDE is the natural direct effect,and TIE captures indirect bias propagation.A pre-trained bias detector provides auxiliary supervision,enhancing the model′s ability to generate neutral and professional text.Experiments show our approach significantly outperforms mainstream methods across multiple debiasing and text quality metrics,confirming its effectiveness in multi-source news debiasing tasks.
  • 2026, 47(5): 1156-1165.
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    This paper proposes a multi-strategy cooperatively improved crayfish optimization algorithm (ICOA) to address the issues of insufficient diversity,slow convergence,and susceptibility to local optima in the original COA.Firstly,the Logistic-Tent chaotic mapping is employed to replace random initialization,enhancing the quality of the initial solutions.Secondly,a mirror reflection learning mechanism is introduced in the early iteration stage to expand the solution space through symmetry,thereby accelerating convergence.Additionally,during the summer avoidance phase,adaptive opposition-based learning based on lens imaging is incorporated to improve the algorithm′s ability to escape local optima.Finally,the vertical crossover operation from the genetic algorithm is integrated to increase population diversity and strengthen global search capabilities.In the experimental section,comparative and ablation experiments are conducted based on the CEC2014 test functions to validate the performance improvements of the algorithm.The research confirms that the proposed multi-strategy cooperative mechanism effectively overcomes the shortcomings of the original COA,achieving significant enhancements in convergence speed,accuracy,and robustness.
  • 2026, 47(5): 1166-1174.
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    As modern in-vehicle embedded systems continue to integrate more applications and the number of Electronic Control Units(ECUs)increases,ensuring system real-time performance becomes increasingly challenging.Meanwhile,frequent interactions between vehicles and the external environment raise security concerns.Although the Controller Area Network with Flexible Data-Rate(CAN FD)improves transmission performance through flexible data rates,it lacks built-in security mechanisms and remains vulnerable to threats such as spoofing.Introducing security mechanisms often consumes real-time resources and may compromise vehicle safety.Therefore,enhancing security while ensuring real-time guarantees is essential.This paper proposes a Reinforcement Learning-based Task Mapping and Scheduling Algorithm(RLMS),which formulates the task mapping process as a Markov Decision Process.By incorporating a resource-aware mechanism that constrains ECU utilization,the proposed method reduces the number of CAN FD bus messages while satisfying real-time constraints.Each message is provided with basic security protection through a 4-byte Message Authentication Code(MAC).To further strengthen system security,a mechanism called Security Enhancement with Balanced Rounds(SEBR)is introduced,which gradually increases the MAC length by leveraging system idle time in a round-by-round manner.The effectiveness of the proposed approach is validated through real-world case studies and simulation experiments.
  • 2026, 47(5): 1175-1181.
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Recently,due to the variety of table styles and layouts,recognizing tables with 2D structure from document images is a complex task.Tables express data content in a compact form to improve the efficiency of information transfer and human comprehension,but the relationship between the 2D structure and the content needs to be understood by machines,making it challenging to automatically recognize tables.To address these issues,an end-to-end framework for Table Graph to Markup Sequence is proposed,named TGMS.The framework first uses a convolutional neural network for visual feature extraction,and then employs a segmentation-based approach to recognize the spatial location of cells.Secondly,it uses spatial location information to recognize the text in the region and constructs a graph,and deduces logical relationships using a graph convolutional network and an attention mechanism.Finally,the last module generates a sequence of table tokens by combining the logical relationships and the text in the cell.Experimental results on three widely used form recognition datasets,ICDAR-2013,SciTSR,and PubTabNet,show that the proposed TGMS can effectively accomplish the form recognition task.
  • 2026, 47(5): 1182-1189.
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Infrared and visible image fusion aims to generate a single image highlighting salient objects and rich textures.Existing fusion methods predominantly focus on spatial characteristics while ignoring valuable frequency information.Therefore,this paper proposes a frequency-spatial collaboration network for infrared and visible image fusion.Firstly,the frequency decomposition module decomposes the source image into high-frequency(modality-specific features)and low-frequency components(modality-shared features).Simultaneously,the spatial characteristics are roughly extracted to preserve the spatial structure of the fused image.Finally,the cross-domain adaptive fusion module learns adaptive weights to dynamically adjust features in both frequency and spatial domains,thereby mitigating inter-domain differences and generating high-quality fused images.Quantitative and qualitative experimental results on the TNO and VOT2020-RGBT datasets demonstrate that the proposed method performs excellently across six evaluation metrics.Compared with seven state-of-the-art methods,it effectively integrates multi-modal complementary information and generates fused images with prominent salient targets and fine-grained texture information.
  • 2026, 47(5): 1190-1197.
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    In recent years,object detection has received widespread attention and research and has achieved many results.However,to obtain a high-performance detection model,a large number of labeled samples are required for training.In sharp contrast,humans can quickly learn new knowledge with only few examples.To narrow the gap between these two,few-shot object detection has received increasing attention.The few-shot object detection method aims to achieve new class knowledge through a limited number of annotated samples,without catastrophically forgetting previously learned base class knowledge,thereby improving the performance of new class detection.However,existing few-shot object detection methods have the following problems:1)Excessive focus on model accuracy while neglecting model efficiency;2)Only focusing on model classification performance while neglecting model localization performance.To address these issues,this paper proposes a novel few-shot object detection method based on aggregation-reconstruction data augmentation and multidimensional feature knowledge transfer.Specifically,an aggregation reconstruction data augmentation strategy is proposed,which extracts specific objects from generated images,scales them,and aggregates them into randomly selected base class samples.This enhances the model′s generalization ability to different datasets while increasing data diversity and alleviating data scarcity.Then,a semantic feature knowledge transfer strategy is proposed to achieve ideal initialization of classifier weights and improve model convergence speed,and a localization feature knowledge transfer strategy is proposed to improve the model′s localization ability.The experimental results demonstrate that the proposed method performs well in few-shot object detection tasks and has certain competitiveness compared to existing methods.
  • 2026, 47(5): 1198-1204.
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    To address the challenges of disorder,missing geometric information,and blurred boundaries in 3D point cloud semantic segmentation,this paper proposes an algorithm that combines complementary ordered modeling with spatial perception.A complementary ordered modeling module is first constructed by integrating Z-order curves,Hilbert curves,and their mirrored variants,forming spatially consistent and structurally complementary point cloud encoding sequences.Then,a dynamic spatial encoding mechanism is introduced to adaptively adjust the encoding dimensions according to the requirements of different stages,thereby improving the efficiency of spatial representation.Finally,a spatial-aware aggregation module is designed to fuse spatially guided local feature propagation with multilayer perceptron-based global context modeling,achieving efficient hybrid feature learning while enhancing spatial stability and geometric consistency.Experiments conducted on three public datasets—S3DIS,ScanNet v2,and ScanObjectNN—demonstrate that the proposed algorithm delivers high-accuracy semantic segmentation and significantly enhances spatial perception and semantic understanding in complex boundary regions and small object scenarios.
  • 2026, 47(5): 1205-1211.
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Optical Coherence Tomography(OCT)is renowned for its high resolution and ability to capture the three-dimensional structure of fingertip skin,significantly enhancing the anti-spoofing capability of fingerprint recognition systems.However,compared to other biometric technologies,the scarcity of datasets severely hinders its widespread application.Due to the difficulty of data collection and privacy concerns that restrict public sharing,synthetic data generation presents a more practical solution to this challenge.This paper proposes a conditional generation method based on a diffusion model,which leverages layer segmentation masks as prior knowledge to guide the generation process.By employing iterative denoising to directly model the pixel space,our approach avoids the precision loss associated with latent diffusion models,thereby producing high-fidelity OCT fingerprint images.Experiments demonstrate that the generated samples exhibit realistic skin structural features,with subjective evaluations by 30 domain experts confirming their anatomically accurate structures and authentic pixel distributions.Further validation shows that augmenting training datasets with synthetic data significantly improves the performance of various anti-spoofing models.
  • 2026, 47(5): 1212-1218.
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    The sparse texture and restricted field of view of the tissue surface in endoscopic scenes significantly increases the difficulty of depth estimation.Conventional methods are susceptible to interference from noise,missing texture and illumination variations,resulting in insufficient stability of the results.To improve the accuracy of endoscopic image depth estimation,a self-supervised monocular endoscopic depth estimation network architecture embedded with a dual attention mechanism is proposed.The network adopts an encoder-decoder structure,and in order to improve the accuracy of the model,this paper integrates a dual-attention mechanism in the network architecture,which specifically includes channel attention and spatial attention modules for extracting contextual information at a distance in both channel and spatial dimensions.Meanwhile,photometric reprojection error and structural similarity and edge-aware smoothing are introduced as loss functions to accommodate the special properties of endoscopic images.Finally,it is tested on Endoslam public dataset,and the results show that the method proposed in this paper can effectively improve the accuracy of depth estimation of endoscopic images.
  • 2026, 47(5): 1219-1224.
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Person Re-Identification (ReID) refers to the technology of matching the same pedestrian across different scenarios.To address the limitations of local feature representation caused by relying solely on global information in handling pedestrian details under occlusion scenarios,this paper proposes a ViT-enhanced ReID method.The key contributions include:1) A novel Cross-scale Dilated Fusion Module (CDFM) that optimizes input features through multi-dimensional re-weighting and integrates multi-scale dilated convolutional branches to enhance feature discriminability;2) A Global-Local Feature Collaboration Module combining Transformer blocks and lightweight CNN layers to leverage the complementary strengths of global dependency modeling by Transformers and local detail feature extraction by CNNs,thereby improving feature fusion and robustness;3) A Dynamic Weighted Loss Function that introduces a visibility-aware contrastive learning mechanism to enforce consistency in visible regions,adopts a dynamic hard example mining strategy to mitigate occlusion-induced noise interference,and incorporates channel attention weights for refined feature alignment,significantly enhancing discriminative power in occlusion scenarios.Experimental results demonstrate that the proposed method achieves superior performance on multiple mainstream occluded ReID benchmarks,including Occluded-Duke and Occluded-REID,outperforming existing state-of-the-art methods in both Rank-1 accuracy and mAP metrics.
  • 2026, 47(5): 1225-1235.
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    The number of parameters of deep neural networks in federated learning is huge.The client needs to upload the complete model update for each round of training,which makes the communication overhead become the bottleneck of system performance,especially in bandwidth-constrained environments.Therefore,reducing communication while ensuring model performance is one of the key issues in federated learning research.In response to the above challenges,this paper proposes a communication-efficient adaptive federated pruning optimization method(CEAFL).The core is a staged adaptive model pruning algorithm,which is divided into two stages:initial pruning and adaptive pruning.The model is pruned using gradient importance to achieve lightweight transmission.In addition,a model fine-tuning algorithm for integrated classifier reuse is designed to improve generalization ability and data distribution perception ability.Experiments show that compared with the benchmark method,this method improves the model accuracy on multiple data sets by more than 0.5%,while reducing the communication volume by about 38%,demonstrating its potential in practical applications.
  • 2026, 47(5): 1236-1244.
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Task offloading represents a pivotal research direction within mobile edge computing.While existing studies have achieved remarkable progress in optimizing computation latency and energy consumption,most fail to adequately address the inherent complexities of edge computing environments.Factors such as the unreliability of resource nodes,device heterogeneity,and task diversity significantly affect offloading decisions and overall system performance.To address these challenges,this paper proposes a task offloading scheme grounded in dynamic trust evaluation.The proposed approach integrates two algorithms:Firstly,drawing inspiration from the evolution of trust mechanisms in human society,a trust relationship model between devices is established within the edge network.This mechanism ensures the provision of reliable resource node information for task offloading,effectively mitigating failures caused by device malfunctions,malicious attacks,or resource insufficiency.Subsequently,an improved Q-learning algorithm is employed to solve the task offloading problem,aiming to minimize system costs.Compared to heuristic scheme,the proposed scheme reduces system costs by 16.3% and improves task success rates by 32.1%.Furthermore,experimental results validate the effectiveness of the trust-value mechanism in identifying reliable resource nodes.
  • 2026, 47(5): 1245-1255.
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    As large language models and vision-language models become deeply embedded in mobile robots and automated devices,embodied intelligence—an AI paradigm that relies on continual interaction with the environment and a closed-loop coupling of perception,cognition and action—has evolved from rule-driven to knowledge-driven approaches.This shift renders the decision layer,whose semantics are open-ended and whose reasoning process is opaque,increasingly exposed to novel attack surfaces.Existing surveys emphasize perceptual robustness or ethical governance; however,a unified framework that concentrates on the decision-making security of embodied systems is still missing.This paper first categorizes decision vulnerabilities into two sources:exogenous threats (physical attacks,network intrusions,adversarial perturbations) and endogenous threats (model hallucination,policy over-fitting,hardware failure),and explains how risk propagates through the perception-planning-execution chain.We then conduct a systematic analysis of representative attacks—adversarial perturbations,sensor spoofing,backdoor triggers,jailbreak prompts and hallucination amplification—highlighting their cross-modal and cross-temporal manipulation paths as well as their impact on task reliability.Next,we synthesize defense strategies such as safety constraints,reachability verification,multi-modal feedback rejection and risk-sensitive shutdown,evaluating each method with respect to real-time performance,resource constraints and task complexity.Finally,in light of practical deployment requirements,we distill three open challenges:semantic-physical alignment,cross-layer coordination and standardized evaluation.We also outline future directions,including end-to-end verifiable frameworks,prior-risk-aware pre-training and natural-language rule specification.Collectively,this work provides a systematic reference for building trustworthy,controllable and deployable embodied intelligent systems.
  • 2026, 47(5): 1256-1263.
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    In opportunistic networks,due to the limited available energy of most terminal devices,how to effectively conserve energy during data transmission has become key to enhancing network performance.This paper proposes an energy-efficient beaconing strategy based on game theory,named GTEEB(A Game-Theoretic Energy-Efficient Beaconing Strategy).The strategy constructs a game model based on node benefits and dynamically adjusts the beacon frequency of nodes using Nash equilibrium theory,deducing an energy consumption threshold for node beacon frequency selection.This balances the energy consumption and communication opportunities of nodes under high and low beacon frequencies.It also introduces a node autonomous decision-making mechanism,enabling nodes to adaptively adjust their beacon frequency according to the surrounding environmental state.This achieves a balance between energy consumption and communication probability at different beacon frequencies,thereby effectively reducing overall network energy consumption.Simulation results show that compared with energy-saving schemes such as ST-Prophet,EASE,and TLEE,the GTEEB strategy can significantly reduce energy consumption and extend the average network lifetime while ensuring network connectivity and data transmission quality.
  • 2026, 47(5): 1264-1270.
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    In a UAV-assisted mobile edge computing communication system,a UAV acts as an airborne base station to receive data offloaded by multiple ground mobile devices,and in order to satisfy UAV maneuverability as well as 3D obstacle avoidance constraints,and with the goal of maximizing the system energy efficiency (defined as the ratio between the total amount of offloaded data and the UAV′s energy consumption),this study jointly optimizes the flight trajectory of the UAV and the ground devices′ task offloading rate by proposing an optimization scheme of a hybrid alternating element heuristic.Due to the non-convexity and fractional structure of this optimization problem,it can be transformed into an equivalent parametric optimization problem by Dinkelbach′s method,and then split into two sub-optimization problems to be optimized by using the meta-heuristic algorithm alternately respectively.The effectiveness of the proposed joint optimization scheme is verified through simulation experiments,and the results show that the energy efficiency of UAV communication of the proposed scheme is significantly higher than that of the traditional algorithm,which provides a new idea for solving the energy efficiency problem in UAV-assisted mobile edge computing networks.
  • 2026, 47(5): 1271-1280.
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    With the deepening of digital transformation and the rise of technologies such as big data and the Internet of Things,many new types of business scenarios are emerging,and the related systems are becoming increasingly complex.In this context,the field of digital power grid is also facing brand-new challenges,especially more stringent requirements on the real-time performance of the system.How to efficiently evaluate the performance of digital power grid business scenarios,and then provide support for improving the performance reliability of the system,is an important issue.In this paper,we propose a modeling and performance analysis method for the digital power grid business scenarios,and implement a prototype tool,BizModeler.We firstly propose a visual modeling language DPG(Dataflow-based Performance Graph)for the characteristics of the digital grid domain; secondly,we summarize the common performance indicators in the digital grid domain and propose a model performance analysis method based on the synchronous data flow graph; finally,we verify the usability and effectiveness of the method through the implementation of the tool as well as an example study.