| |
| TuA16 |
Room T1 |
| Virtual Session III |
Virtual Session |
| Chair: Gu, Jason | Dalhousie University |
| Co-Chair: Wang, Jiacun | Monmouth University |
| |
| 13:30-13:45, Paper TuA16.1 | |
| Towards Trustworthy Multi-Agent Systems for Corporate Credit Rating: Analysis of Runtime Perturbations, Propagation, and Recovery |
|
| Shi, Yumeng | Beijing University of Posts and Telecommunications |
| Yang, Zhongliang | Beijing University of Posts and Telecommunications, Beijing, China |
| Zhou, Linna | Beijing University of Posts and Telecommunications |
Keywords: Systems Safety and Security, Distributed Intelligent Systems
Abstract: The rapid deployment of multi-agent systems (MAS) in financial decision-making introduces critical systems safety challenges. Focusing on corporate credit rating, this work empirically evaluates a hierarchical MAS against four runtime perturbations: data poisoning, memory poisoning, and both observational and direct prompt injections. By tracking how localized deviations cascade through the agent network, we reveal three key findings: (1) Asymmetric Vulnerability Across Rating Tiers: higher-rated entities exhibit disproportionately high sensitivity to adversarial injections compared to lower-rated counterparts; (2) Divergent Propagation Topologies: localized errors trigger either direct proportional propagation or latent cascading and delayed amplification, fundamentally shaped by the perturbed agent's functional role during consensus aggregation; (3) Empirical Resilience: a modular recovery framework successfully intercepts anomalous propagation, restoring up to 93.2% of system-level ratings.
|
| |
| 13:45-14:00, Paper TuA16.2 | |
| A Dynamic Multi-Objective Optimization Algorithm Based on Dual-Branch Prediction and Lightweight Clustering Mutation |
|
| He, Yue | Chongqing Normal University |
| Chen, Yong | Chongqing Normal University |
| Liang, Kun | Chongqing Normal University |
| Shen, Kang | Chongqing Normal University |
| Liu, Wenqiang | Chongqing Normal University |
Keywords: Evolutionary Computation, Metaheuristic Algorithms, Computational Intelligence
Abstract: 动态多目标优化问题(DMOPs)包括 在资源有限的实时环境中广泛遇到 比如物联网(IoT)边缘计算等场景。 现有的基于预测的动态多目标 进化算法常常面临相当大的困难 响应开销,因为复杂的预测 机制通常依赖于复杂的自适应建模或 密集的历史国家管理。为了解决这个问题 本论文提出了一个动态多目标方案 基于双分支预测和 轻量级聚类突变,称为DBP-LCM。 具体来说,DBP-LCM结合了全局质心漂移和 局部边界引导信息以生成轻量级 环境变化后预测的种群。前往 进一步缓解预测引起的局部拥挤,a 引入了基于聚类的多样性修复策略, 其中对冗余应用自适应柯西变异 通过密度感知聚类识别的区域。在这方面 该方法改善了种群重新分布 同时保持低响应开销
|
| |
| 14:00-14:15, Paper TuA16.3 | |
| Intent-Guided Attentive Social Modulation Framework for Lane Change Trajectory Prediction |
|
| Zhang, Rongfu | Tsinghua University |
| Niu, Ling | Tsinghua University |
| Zhang, Lingling | Tsinghua University |
| Chen, Bokui | Tsinghua University |
Keywords: Autonomous Vehicle, Deep Learning, Intelligent Transportation Systems
Abstract: To address the problem of insufficient modeling of the coupling relationship between intent and trajectory in lane change behavior for autonomous driving, this paper proposes an Intent-Guided Attentive Social Modulation Framework (IGASM). The framework extracts intent vectors through social attention and introduces Feature-wise Linear Modulation (FiLM) and a soft gating mechanism during the trajectory decoding stage to achieve joint modeling of intent recognition and trajectory prediction. A lane change dataset is constructed based on the NGSIM dataset for experiments. Under both LSTM and Transformer frameworks, the proposed method outperforms the baseline in metrics such as accuracy for the intent recognition task. For the trajectory prediction task, metrics including MSE are reduced by 7% to 37% compared to the baseline. Comparative experiments and ablation studies validate the effectiveness of the proposed method.
|
| |
| 14:15-14:30, Paper TuA16.4 | |
| Security Assessment of LLM Apps under the Threat of Malicious Knowledge Injection |
|
| Wang, Xingtong | University of Jinan |
| Du, Cunpeng | University of Jinan |
| Wang, Shanshan | University of Jinan |
| Fu, Sichao | Huazhong University of Science and Technology |
| Chen, Zhenxiang | University of Jinan |
| Peng, Lizhi | University of Jinan |
Keywords: Systems Safety and Security, AI and Applications, Expert and Knowledge-Based Systems
Abstract: With the rapid development of Large Language Model (LLM) App Stores, the surge in customized LLM apps has become a significant trend. However, this expansion has also brought severe security challenges. Although existing studies have analyzed the security risks in LLM App Stores, their focus is often limited to the LLM apps themselves, failing to cover the store’s publication workflow. We investigated the ecosystem security of LLM App Stores from the perspective of the LLM app publication workflow. We developed an automated and store-independent framework that can reproduce malicious publisher behaviors, batch create malicious LLM apps, bypass store audit mechanisms, and record and evaluate behavior after publication. We selected mainstream app stores including Coze, Baidu Wenxin, and Poe, built a multimodal malicious knowledge base containing high-risk text and visual content, and deployed three types of LLM apps (text-based, image-based, and plugin-based) for testing. The evaluation was carried out from multiple dimensions such as output harmfulness, attack success rate, semantic fidelity, and text-image consistency, and revealed systemic vulnerabilities in the knowledge injection layer of the LLM application ecosystem: 1) Malicious or harmful knowledge bypasses filtering mechanisms and is re-outputted as is or with high semantic fidelity; 2) Enabling retrieval tool plugins significantly amplifies the risk potential of harmful content output; 3) In multiple malicious domains, Attack Success Rate (ASR) initiated through image input is close to 100%, and the prompt is highly consistent with the image. To facilitate reproducibility, we have made our implementation publicly available at the project repository.
|
| |
| 14:30-14:45, Paper TuA16.5 | |
| Persistent Retrieval in Hierarchical Memory Systems for Long-Context Agents: A Controlled Evaluation (I) |
|
| Shen, Hushuang | China University of Petroleum-Beijing at Karamay |
| Wang, Yuan | South China University of Technology |
Keywords: Generative AI, System Architecture, Expert and Knowledge-Based Systems
Abstract: Long-context agents often fail when answer-critical evidence is sparse, weakly localized, or unavailable in the active prompt. Memory-augmented agents address this problem with retrieval, caching, hierarchical storage, and adaptive context assembly, but these mechanisms are often evaluated together, making it difficult to isolate the contribution of persistent retrieval. We evaluate memory-layer composition under a fixed execution stack in which the base model, decoding, prompt scaffold, parser, retrieval scorer, and budget policy remain unchanged. Five variants are compared under two support conditions: evidence-sufficient inputs keep answer-bearing support in the active prompt, whereas evidence-scarce inputs relocate the same support to retrievable memory. Across LoCoMo, LongBench~v2, and LongMemEval, current-turn organization (B1) achieves the highest score among the tested variants in all evidence-sufficient runs. Under the evidence-scarce protocol, L0+L2 retrieval (V1) achieves the highest score on all three datasets and improves over B1 by +0.0628, +0.1233, and +0.1220 absolute score points, respectively, with an unweighted mean gain of +0.103. These results indicate that, in the evaluated setting, persistent L2 retrieval is beneficial when answer-bearing support is removed from the active prompt, while adding L1/L3 on top of L2 does not improve the best observed scarce-regime result.
|
| |
| 14:45-15:00, Paper TuA16.6 | |
| MUSE: A Multi-Agent Automated Writing Framework for High-Quality Long-Form Expository Articles with LLMs |
|
| He, Kangze | Shandong University |
| Xu, Chenye | Shandong University |
| Li, Ziyan | Shandong University |
| Xie, Bingbing | Shandong University |
| Ge, Xuri | Shandong University |
| Wang, Changwei | Qilu University of Technology, Shandong Academy of Sciences |
| Xu, Zhiwei | Shandong University |
| Liu, Zeyang | Shandong University |
| Chen, Zhumin | Shandong University |
Keywords: Generative AI, Machine Learning
Abstract: The use of large language models (LLMs) for article generation has become common practice. However, limited research has been conducted on writing expository texts, and existing methods often require substantial human involvement, leading to low efficiency and weak structural coherence. By emulating human article editing workflows, we propose MUSE, a Multi-agent Unified Structured Expository writing Framework. MUSE aligns the LLM-based multi-agent long-form text generation process with the human writer's writing process, automatically generating and editing explanatory texts through three steps: planning, generation, and proofreading. Additionally, it incorporates reader agents and editor agents to iteratively refine the generated content, while retaining the experience gained during the revision process for use in subsequent writing. We conduct comprehensive experiments using both automated and human evaluation of the generated articles. The articles produced by MUSE exhibit clear advantages in writing efficiency and overall quality, and achieve significant improvements in factuality, accuracy, and coherence compared with other text generation frameworks.
|
| |
| 14:45-15:00, Paper TuA16.7 | |
| FedSAA: Personalized Federated Learning with Semantic Anchor Alignment and Decision-Level Similarity-Aware Head Aggregation |
|
| Tang, Fei | Southwest University |
| Zhou, Yanhui | Southwest University |
Keywords: Distributed Intelligent Systems, Machine Learning, Deep Learning
Abstract: Personalized federated learning (PFL) aims to tackle client heterogeneity by learning customized models for each client rather than enforcing a single global solution. However, existing approaches typically focus on either representation alignment or classifier collaboration in isolation, limiting their effectiveness under severe non-IID conditions where feature and decision heterogeneity are tightly coupled. In this paper, we propose FedSAA, a unified personalized federated learning framework that explicitly decouples representation-level alignment from decision-level collaboration. Specifically, FedSAA introduces semantic anchor alignment to stabilize local feature learning across heterogeneous clients. In addition, a similarity-aware head aggregation mechanism enables each client to selectively collaborate with its most relevant peers. This design mitigates unreliable similarity estimation caused by feature drift and reduces negative transfer without enforcing global classifier consensus. Extensive experiments on CIFAR-10 and CIFAR-100 under various non-IID settings demonstrate that FedSAA consistently outperforms state-of-the-art baselines, including FedAvg, FedPAC, and FedAS. Notably, the proposed method achieves significant performance gains on the fine-grained CIFAR-100 dataset, highlighting its robustness in scenarios with severe heterogeneity. Further ablation studies validate the distinct contributions of our decoupled design and show that selectively collaborating with a small number of similar clients yields a better trade-off between personalization and knowledge sharing compared to global aggregation.
|
| |
| 14:45-15:00, Paper TuA16.8 | |
| Automatic Task-Aware Routing across Large Language Models with Context Preservation |
|
| Li, Haoran | Northeastern University |
| Ma, Jianlun | Northeastern University |
| Ma, Lianbo | Northeastern University |
Keywords: Game Theory and Multi-Agent Systems, Agent-Based Modeling, Generative AI
Abstract: Large Language Models (LLMs) have been in wide use in various fields in recent years. Despite their strong performance on many individual tasks, however, no single LLM is universally optimal across diverse tasks and domains. Practical systems often rely on manually orchestrating multiple LLMs for different types of tasks. Moreover, since these models operate independently and typically cannot share context, such multi-LLM setups often suffer from inefficient and fragmented reasoning. To bridge this gap, we present a unified multi-LLM framework named Automatic Task-aware Context-preserving Routing (ATCR), which automatically routes tasks to the most suitable model and maintains a shared global context by summarizing prior interactions into a compact, structured context prompt that is prepended to subsequent calls, enabling more efficient and context-consistent task execution. In addition, we employ a lightweight evolutionary loop guided by programmatic scoring and LLM-based evaluation to further refine the final output. Experiments on a custom cross-modal benchmark that we construct from real usage scenarios show that our framework improves performance by 3.3 points over a no-agent baseline in Easy mode and slightly reduces average cost according to cost logs, while Hard mode refinement yields larger gains at higher cost. Moreover, our approach consistently outperforms random routing baselines across a broad set of benchmarks and evaluation metrics, including MMLU-Pro and MMMU-Pro.
|
| |
| 14:45-15:00, Paper TuA16.9 | |
| Stage-Aware Guided Decoding for Lightweight Self-Supervised Monocular Depth Estimation |
|
| Liu, Guoxing | Guangdong University of Finance |
| Qi, Feifei | Guangdong University of Finance |
Keywords: Machine Vision, Image Processing and Pattern Recognition, Deep Learning
Abstract: Self-supervised monocular depth estimation has emerged as a promising alternative to supervised learning by removing the need for dense ground-truth depth. However, existing lightweight methods usually treat decoding as a uniform feature restoration process, while the dominant errors in self-supervised depth estimation emerge progressively across decoding stages. Early upsampling tends to dilute semantically reliable responses, intermediate cross-scale fusion is vulnerable to background interference, and late high-resolution reconstruction often lacks explicit boundary-sensitive guidance. To address this issue, we propose a lightweight self-supervised monocular depth estimation model with a multi-stage collab orative guided decoder. Instead of stacking several generic enhancement modules, the proposed decoder is organized as a stage-matched recovery pipeline: CRU preserves semanti cally rich responses during early upsampling, GCGB performs structure-aware cross-scale fusion, PCSAB conducts selective contextual refinement, and FEGM injects explicit foreground edge guidance into high-resolution reconstruction. This design enables progressive recovery of decoder-side information loss under a compact computational budget. Extensive experiments demonstrate that the proposed method achieves competitive performance while maintaining an excellent balance between estimation accuracy and computational efficiency.
|
| |
| 14:45-15:00, Paper TuA16.10 | |
| GRAV: Decoupled GRounding Adapter with MLLM-Assisted Verification for Parameter-Efficient Referring Expression Comprehension |
|
| Dai, Siting | Central China Normal University |
| Hu, Chang | Huazhong University of Science and Technology |
| Zhou, Yan | Ocean University of China |
| Yu, Xiumei | Changan's University |
| Fang, Zhaoyu | Central China Normal University |
Keywords: Machine Vision, Image Processing and Pattern Recognition, Transfer Learning
Abstract: Referring expression comprehension (REC) aims to localize a target region in an image given a natural language description. Adapting open-vocabulary detectors to REC through serial parameter-efficient fine-tuning (PEFT) risks disrupting the pretrained feature-head coupling in DETR-style architectures. Moreover, these detectors exhibit bag-of-words behavior, focusing on dominant nouns while neglecting fine-grained attributes and spatial relations. To address these challenges, we propose GRAV, a two-stage framework comprising a Decoupled Grounding Adapter (DGA) and a Multimodal Large Language Model (MLLM)-Assisted Verification (MAV) module. DGA is designed as a parallel side branch that preserves the backbone's feature integrity through zero-initialization and gradient isolation. Within this branch, multimodal features are decoupled into orthogonal subspaces separating entity semantics from relational cues. These components are then aligned through distribution matching and optimal transport, respectively, effectively mitigating the bag-of-words bias. To further resolve ambiguities beyond feature-level alignment, MAV employs a frozen MLLM with an early-exit mechanism to verify top candidates without additional training. With only 0.44M trainable parameters (0.19% of the backbone), GRAV consistently improves Grounding DINO across RefCOCO/+/g benchmarks, achieving accuracy competitive with models that are over 16,000× larger.
|
| |
| 14:45-15:00, Paper TuA16.11 | |
| RACap: Relation-Aware Prompting for Lightweight Retrieval-Augmented Image Captioning |
|
| Long, Xiaosheng | Southeast University |
| Wang, Hanyu | Southeast University |
| Song, Zhentao | Southeast University |
| Luo, Kun | The First Affiliated Hospital of Xinjiang Medical University |
| Liu, Hongde | Southeast University |
Keywords: Generative AI, Application of Artificial Intelligence, Image Processing and Pattern Recognition
Abstract: Recent retrieval-augmented image captioning methods have made progress in improving image understanding. They incorporate external knowledge to compensate for the limitations of single-image models in comprehending complex scenes. However, current approaches face challenges in relation modeling: (1) the representation of semantic prompts is too coarse-grained to capture fine-grained objects and their relationships; (2) these methods lack explicit modeling of image objects and their semantic relationships, which results in limited expressiveness at the level of object relations. To address these limitations, we propose RACap, a relation-aware retrieval-augmented model for image captioning. Our model not only mines structured relation semantics from retrieval captions, but also identifies heterogeneous objects from the image. Then RACap effectively retrieves structured relation features that contain heterogeneous visual information and integrates them into the image representation to enhance the semantic consistency and relational expressiveness. Experimental results show that RACap, with only 10.8M trainable parameters, achieves superior performance compared to previous lightweight captioning models on datasets such as COCO, Flickr30k, and NoCaps.
|
| |
| 14:45-15:00, Paper TuA16.12 | |
| Multi-Agent Collaborative ALNS for Multi-UAV Task Planning with Meta-Synchronization and Priority Reflow (I) |
|
| Xi, Guipeng | Northwestern Polytechnical University |
| Huang, Jingyi | Northwestern Polytechnical University |
| Wu, Shuying | School of Electronics and Information, Northwestern Polytechnical University |
| Peng, Qian | Northwestern Polytechnical University |
| Li, Bo | Northwestern Polytechnical University |
Keywords: Metaheuristic Algorithms, Logistic and Manufacturing Automation, Application of Artificial Intelligence
Abstract: Improving task coverage while satisfying individual travel-budget constraints for unmanned aerial vehicles (UAVs) remains a challenging problem in multi-UAV mission planning. This paper addresses a range-constrained multi-UAV routing problem that aims to maximize the total value of served tasks subject to individual UAV distance limits. We propose a multi-agent collaborative adaptive large neighborhood search (MA-ALNS) framework that integrates heterogeneous parallel search, adaptive meta-synchronization, heuristic phase switching, and priority-based reflow of unserved tasks. The heterogeneous agents explore the solution space with complementary search behaviors, while adaptive meta-synchronization selectively transfers high-quality route structures among agents. Priority-based reflow identifies tasks that remain unserved and attempts to reinsert them into feasible routes, thereby improving task coverage, particularly under tight range constraints. Experiments on large-scale random instances under standard and tight constraint settings show that MA-ALNS consistently achieves higher mean objective values than the genetic algorithm (GA), particle swarm optimization (PSO), and all evaluated ablation variants across every combination of problem scale and constraint setting. The performance gains are more substantial under tight constraints. The ablation results further show that multi-agent parallel search establishes the performance foundation, while priority-based reflow provides the largest improvement in task coverage.
|
| |
| 14:45-15:00, Paper TuA16.13 | |
| IRGRec: Explicitly Modeling Inter-Interest Dependencies with Relation Graphs for Sequential Recommendation |
|
| Lin, Jiayi | Changchun University of Science and Technology |
| Li, Jinqing | Changchun University of Science and Technology |
| Di, Xiaoqiang | Changchun University of Science and Technology |
| Yan, Guanyu | Changchun University of Science and Technology School of Computer Science and Technology CHANGCHUN |
Keywords: Machine Learning, Deep Learning, Representation Learning
Abstract: Traditional sequential recommendation methods rely on a single embedding to represent users, limiting their ability to model diverse preferences. Although multi-interest models address this issue by learning multiple interest vectors, they treat these vectors as mutually independent, overlooking the relational structures among them, particularly the synergistic alignment and mutual suppression between interests. We propose IRGRec, a sequential recommendation framework that explicitly models inter-interest dependencies via dynamically constructed relation graphs. A hybrid collaborative-semantic similarity constructs a dual-channel graph that simultaneously reinforces compatible interests and suppresses conflicting ones, enabling the model to leverage the structural topology of the interest space during candidate generation. Extensive experiments on three public benchmarks demonstrate that IRGRec consistently outperforms strong baselines, validating the effectiveness and superiority of explicitly modeling inter-interest dependencies.
|
| |
| 14:45-15:00, Paper TuA16.14 | |
| Stabilizing Personalized Federated Learning under Data Heterogeneity Via Closed-Loop Representation Alignment |
|
| Wang, Lianhai | Shandong Computer Science Center (National Supercomputer Center in Jinan) |
| Luo, Xuan | Qilu University of Technology(Shandong Academy of Sciences) |
| Xu, Shujiang | Qilu University of Technology |
| Zhang, Shuhui | Shandong Computer Science Center (National Supercomputer Center in Jinan) |
| Shao, Wei | Qilu University of Technology (Shandong Academy of Sciences) |
| Wang, Qizheng | Qilu University of Technology (Shandong Academy of Sciences) |
Keywords: Distributed Intelligent Systems, Machine Learning, Representation Learning
Abstract: ,个性化联邦学习面临关键稳定性 数据异质性下的挑战,即交替出现 局部-全局优化诱导易变特征 表征。我们观察到这一被忽视的现象 作为表示不一致的累积 几何色散引起的波动性与 时间漂移,这会降低系统收敛性, 个性化质量。 为解决这个问题,我们提出了FedHypSA,一个 闭环几何-时间稳定框架。 超球形批次监督对局部有限制 特征映射到超球形流形上,确保 类内紧致性与类间可分离性。 自动感知级对准机制 通过闭环反馈调节比准强度 来自一种新的时空波动率指标。 CIFAR-10、CIFAR-100 上的广泛实验, Tiny-ImageNet 和 Office10 展示了更优的优势 性能显著提升了稳定性 最先进的方法,显著地证明了 在严重数据中减少表征振荡 异质性设置,验证稳健稳定 分布式异构Ŀ
|
| |
| 14:45-15:00, Paper TuA16.15 | |
| DSAH-YOLO: Super-Resolution and Attention-Enhanced Feature Learning for Accurate Small Lesion Detection in Colorectal CT Imaging |
|
| Gan, Jingjing | Qinghai University |
| Meng, Qiao | Qinghai University |
| Boqi, Zhou | Qinghai University Affiliated Hospital |
| Cao, Yuntai | Qinghai University Affiliated Hospital |
| Zhao, Jinning | Qinghai University |
| Yueming, Chen | Qinghai University |
Keywords: Image Processing and Pattern Recognition, Medical Informatics, Deep Learning
Abstract: Colorectal cancer is one of the most common malignant tumors of the digestive tract, and early detection is crucial for improving patient survival rates. Lesion detection based on CT images plays a vital role in early screening, disease assessment, preoperative planning, and therapeutic monitoring. However, due to the irregular morphology, blurred boundaries, and low contrast of lesions, both manual interpretation and existing object detection algorithms face significant challenges in colorectal lesion identification, manifested by reduced detection accuracy and a high rate of missed detections for small lesions. To address these issues, this study proposes DSAH-YOLO integrated with an Adaptive Super-Resolution Enhancement (ASRE) for accurate lesion detection in colorectal CT images. The ASRE enhances the visual quality of abdominal CT patches, effectively mitigating issues caused by low-resolution imaging such as blurred lesion boundaries, loss of structural details, and insufficient feature extraction. Furthermore, a combination of Dynamic Multi-View Feature Fusion (DMVFF) and Multi-Scale Local Feature Enhancement Attention (MS-LFEA) is designed to improve the perception of lesion edges and deep structural features. In addition, a Dual-Branch Feature Guided Detection (DBFGD) Mechanism is reconstructed to optimize the detection of small-area and low-contrast lesions. Experimental results demonstrate that the proposed DSAH-YOLO model achieves consistent performance improvements over the baseline model. Specifically, the proposed method improves precision by 9.1%, sensitivity by 5.4%, and mean mAP@0.5 by 5.7% on the CC-CT-V dataset, maintaining superior detection performance compared to other end-to-end models. This approach provides real-time diagnostic assistance for clinicians in early colorectal cancer screening and offers a technical foundation for quantitative lesion analysis.
|
| |
| 14:45-15:00, Paper TuA16.16 | |
| CLA-FDKformer: A Short-Term Multi-Energy Load Joint Forecasting Model for Integrated Energy Systems (I) |
|
| Xu, Jin | Shenyang Aerospace University |
| Wang, Zhiyong | Shenyang Aerospace University |
| Zhang, Qingxin | Shenyang Aerospace University |
| Shen, Cheng | Shenyang Aerospace University |
| Zhang, Senyue | Shenyang Aerospace University |
Keywords: Modeling of Autonomous Systems, Energy Systems, Intelligent Power Grid
Abstract: There exists a complex nonlinear coupling relationship among electrical, cooling, and heating loads in integrated energy systems. Accurate joint forecasting of multi-energy loads is an important prerequisite for optimal dispatching and economic operation of the system. This paper proposes a short-term multi-energy load joint forecasting model, CLA-FDKformer, based on an improved iTransformer architecture, aiming to enhance the joint forecasting accuracy of electrical, cooling, and heating loads. First, the iTransformer inverted embedding strategy is introduced to address the problem that multivariate mixed modeling in traditional methods destroys the physical independence of individual loads. Second, a Frequency-Domain Decomposition KAN module (FD-KAN) is proposed to enhance the model's ability to capture nonlinear temporal features of multi-energy loads through frequency-domain decoupling and Kolmogorov-Arnold Networks with learnable B-spline activation functions. Finally, a Cross-Load Attention module (CLA) is designed to explicitly model the physical coupling relationships among multi-energy loads by constructing directed cross-attention paths and a gated adaptive fusion mechanism. Experimental results demonstrate that CLA-FDKformer outperforms multiple baseline methods across all three load forecasting tasks, providing reliable forecasting support for the optimal dispatching and safe economic operation of integrated energy systems.
|
| |
| 14:45-15:00, Paper TuA16.17 | |
| CASTLE: A Context-Aware Spatio-Temporal Attention Network for Cellular Traffic Prediction |
|
| Wang, Zhixian | Beijing University of Posts and Telecommunications |
| Zhou, Wen'an | Beijing University of Posts and Telecommunications |
| Zhong, Yingyi | Beijing University of Posts and Telecommunications |
| Tao, Liwen | Beijing University of Posts and Telecommunications |
| Cheng, Chen | Central China Normal University |
Keywords: Communications, Deep Learning, Complex Network
Abstract: Cellular traffic prediction is important for proactive network management and resource allocation. Real-world cellular traffic exhibits pronounced spatio-temporal heterogeneity and non-stationarity, where inter-cell dependencies vary with node--time context. Existing methods either ignore contextual information or use it only as an auxiliary feature fused into traffic representations. They fail to explicitly use contextual information to model context-dependent spatial interactions. We propose CASTLE, a context-aware spatio-temporal attention network with a Contextual Spatial Block (CSB) that treats node--time context as an explicit control signal. Specifically, CSB performs context-conditioned relation learning to determine which inter-cell dependencies should be activated under different contexts, and uses context-conditioned update gating to control how much neighborhood information is written into node representations. Extensive experiments on the real-world Telecom Italia datasets show that CASTLE consistently outperforms strong baselines.
|
| |
| 14:45-15:00, Paper TuA16.18 | |
| SBC-RTDETR: Small Object Detection Network in Complex Environment for Real-Time Detection of Rice Panicles by UAV |
|
| Zhu, Deli | Chongqing Normal University |
| Wu, Kai | Chongqing Normal University |
Keywords: Image Processing and Pattern Recognition, Machine Vision, Deep Learning
Abstract: Rice panicle detection is critical for crop growth monitoring and yield estimation, yet the small size of rice panicles and complex field backgrounds hinder efficient real-time detection in unmanned aerial vehicle (UAV)-based agricultural scenarios. Conventional detection models suffer from high computational consumption and poor real-time performance, limiting their field application value. To solve this problem, this paper proposes a lightweight high-speed SBC-RTDETR detection framework based on RT-DETR. The embedded Space-to-Depth Convolution (SPDConv) module compresses spatial information and enhances fine-grained feature extraction while reducing computational complexity. The Bidirectional Feature Pyramid Network (BiFPN) structure optimizes multi-scale feature fusion, and the Content-Aware ReAssembly of Features (CARAFE) module preserves spatial details during upsampling with negligible computational overhead. The model is trained on a high-quality UAV rice panicle dataset collected from Yongchuan, Chongqing. Experimental results show that compared with the baseline model, SBC-RTDETR reduces model parameters and computation by 37%, and boosts the inference speed from 31.3 FPS to 50.1 FPS (a 66.4% improvement) under the same hardware conditions. Meanwhile, the mAP@0.5 and recall are slightly improved by 0.8% and 1.0%, respectively, realizing high-speed inference without accuracy loss. The proposed SBC-RTDETR achieves efficient small-target detection in complex field environments and is well-suited for real-time deployment in UAV-based smart agriculture systems.
|
| |
| 14:45-15:00, Paper TuA16.19 | |
| CGVD: Caption-Guided Classification and Variational Query Mapping for Open-Vocabulary Object Detection |
|
| Yu, Xiangyu | University of Science and Technology of China |
| Wu, Siying | Hefei Comprehensive National Science Center |
| Sun, Xiaoyan | University of Science and Technology of China |
Keywords: Image Processing and Pattern Recognition, Representation Learning, Machine Learning
Abstract: Open-vocabulary object detection (OVOD) aims to detect objects from novel categories beyond the predefined training set, enabling more flexible visual understanding in real-world scenarios. Recent approaches typically rely on distilling knowledge from vision-language models (VLMs) to align visual and textual representations. However, their performance remains limited when handling challenging instances, such as small, blurry, or visually ambiguous objects. In this paper, we propose CGVD (Caption-Guided Classification and Variational Query Mapping for Open-Vocabulary Object Detection), a novel framework that enhances OVOD by incorporating caption-level semantics and probabilistic visual-to-language mapping. First, we introduce a caption-guided classification refinement module, which leverages global contextual information from image captions to refine instance-level predictions. Second, we design a VAE-based visual-to-language projector that models uncertainty in visual queries and produces more robust textual representations for cross-modal alignment. We evaluate our method on two widely used benchmarks, OV-COCO and OV-LVIS. Experimental results show consistent improvements over a strong baseline, with more pronounced gains on challenging instances such as small objects. These results suggest that combining caption-level context with probabilistic feature modeling can improve robustness and generalization in open-vocabulary object detection.
|
| |
| 14:45-15:00, Paper TuA16.20 | |
| Dynamic Multi-Scale Selective Graph Convolution Network for Skeleton-Based Action Recognition |
|
| Ding, Yan | University of Chinese Academy of Sciences |
| Lu, Ke | University of Chinese Academy of Sciences |
| Shao, Yihua | University of Science and Technology Beijing |
| Pei, Hongjuan | University of Chinese Academy of Sciences |
| Ma, Wei | Beijing Jiaotong University |
| Xue, Jian | University of Chinese Academy of Sciences |
Keywords: Deep Learning, Human-Machine Interaction, Human-Computer Interaction
Abstract: Graph Convolutional Networks (GCNs) often struggle to balance recognition accuracy with computational efficiency. To bridge this gap, we propose the Dynamic Multi-Scale Selective Graph Convolutional Network (DMS-GCN), a lightweight yet powerful framework for skeleton-based action recognition. DMS-GCN features a Dynamic Dual-scale Spatial Modeling (S-GCN) module that adaptively fuses multi-scale semantic information via anatomical hypergraph priors and a scale-selection gate. Complementarily, an Adaptive Multi-scale Temporal Modeling (T-GCN) module employs structured sampling to decouple the observation window from the parameter count, enabling flexible adaptation to diverse action rhythms while preserving temporal causality. Furthermore, a lightweight spatio-temporal channel attention mechanism is integrated to refine global contextual features. Experimental results on NTU RGB+D and NTU RGB+D 120 datasets demonstrate that DMS-GCN achieves state-of-the-art performance with significantly reduced computational overhead, offering a superior trade-off for resource-constrained deployments.
|
| |
| 14:45-15:00, Paper TuA16.21 | |
| Geometric Fragility of the Hippocampus in Alzheimer's Disease Via Contrastive Point Cloud Modeling |
|
| Wang, Yiquan | Xinjiang University |
| Chang, Yuhan | Xinjiang University |
| Zhang, Jialin | Xinjiang University |
| Cai, Minnuo | Xinjiang University |
| Yan, Jiayao | Xinjiang University |
| Ma, Zhongxian | XinJiang University |
| Zhao, Hongtian | Xinjiang University |
Keywords: Cognitive Computing, Medical Informatics, Computational Life Science
Abstract: Alzheimer's disease (AD) is often assessed through local hippocampal atrophy, although cognitive decline may also involve disrupted global shape organization. We define geometric fragility as impaired global hippocampal organization rather than an accumulation of local surface changes. Using geometry-only point clouds, we compared local feature aggregation with global hierarchical attention as probes of structural perception. The global model showed higher diagnostic sensitivity and retained recognition under geometric sparsification, whereas the local model showed pattern collapse. Global modeling produced a more ordered disease manifold and a geometric degradation axis that correlated with clinical cognitive decline. These findings suggest that AD progression may involve disruption of global hippocampal shape organization and that hierarchical abstraction can support continuous geometric biomarkers of neurodegeneration.
|
| |
| 14:45-15:00, Paper TuA16.22 | |
| A Dual-Residual Adaptive Ant Colony Optimization for Mobile Robot Path Planning in Grid Environments |
|
| Fan, Wenjie | Dongguan University of Technology |
| Li, Huan | Dongguan University of Technology |
| Wei, Wenhong | Dongguan University of Technology |
| Lai, Yidan | Dongguan University of Technology |
Keywords: Evolutionary Computation
Abstract: This paper proposes DRACO, a dual-residual adaptive ant colony optimization algorithm for global path planning of mobile robots in two-dimensional grid environments. To mitigate blind exploration, slow convergence, local stagnation, and excessive turning in conventional ant colony optimization (ACO), DRACO integrates four coordinated mechanisms. A line-guided Gaussian pheromone initialization strengthens early goal orientation, whereas a dynamic threelevel node selection mechanism screens ineffective candidates. A dual-residual and direction-continuity based state transition rule jointly evaluates immediate detour redundancy, global deviation from the start-target relation, and directional consistency. In addition, dynamic pheromone regulation with elite-reward updating balances pheromone accumulation and exploration. Comparative experiments on 20×20, 30×30, and 50×50 grid maps and a reverse progressive mechanism validation study evaluate path length, turn count, convergence behavior, and stability. Under the reported experimental settings, DRACO achieves competitive path lengths, favorable turn control, and stable convergence behavior relative to conventional ACO and the tested improved variants.
|
| |
| 14:45-15:00, Paper TuA16.23 | |
| FDBD: Frequency-Domain Dual-Branch Diffusion Model for Multivariate Time Series Forecasting |
|
| Feng, Xingjie | Civil Aviation University of China |
| Li, Hao | School of Computer Science and Technology Civil Aviation University of China Tianjin, China |
Keywords: Generative AI, Neural Networks and their Applications, Deep Learning
Abstract: Abstract— Recent research has applied diffusion models to time series forecasting, yet challenges remain in effectively capturing the intrinsic correlations within long multivariate time series forecasting. Modeling the complex dependencies among temporal variables is challenging, as they can be further weakened by the noise inherent in diffusion models. To address these challenges, we propose a Frequency-Domain Dual-Branch Diffusion model (FDBD) for multivariate time series forecasting. Spanning both temporal and spectral domains, FDBD effectively integrates the extraction of multiscale dependencies with the modeling of intricate cross-variable relationships. This dual-domain approach enhances forecasting accuracy and improves the model’s generalization capability. The model leverages the Discrete Wavelet Transform to enable efficient conversion between the time and frequency domains, and employs a dual-branch architecture to separately model the trend and residual components. These dual-branch features serve as conditional inputs for a diffusion model to generate predictions. Experiments conducted on six public datasets demonstrate that FDBD achieves superior overall performance compared with several state-of-the-art time series diffusion models and strong baseline methods. Ablation studies further validate the effectiveness of the decomposition strategy and architectural design. Overall, FDBD offers a robust and scalable solution for multivariate time series forecasting. Keywords— Diffusion model, Discrete Wavelet Transform, Multivariate time series forecasting, Dual-branch architecture, Trend–residual decomposition
|
| |
| 14:45-15:00, Paper TuA16.24 | |
| UniGraphRAG: A Unified Agentic Graph RAG Via Look-Ahead Node Profiles |
|
| Tang, Ruofeng | Institute of Software Chinese Academy of Sciences |
| Peng, Tao | Institute of Software Chinese Academy of Sciences |
| Wu, Fengge | Institute of Software, Chinese Academy of Sciences |
Keywords: Generative AI, Expert and Knowledge-Based Systems, Knowledge Acquisition
Abstract: Current Retrieval-Augmented Generation (RAG) systems are typically optimized in silos, struggling to seamlessly unify complex multi-hop reasoning with broad holistic summarization. Furthermore, when agents navigate external knowledge, they often face search path hallucination—proposing unverified queries that cause retrieval failures. To bridge this gap, we propose UniGraphRAG, a unified Agentic Graph RAG framework. During the offline phase, UniGraphRAG employs a threshold-based consolidation mechanism to compress scattered document chunks into dense Node Profiles. Crucially, these profiles explicitly encapsulate both a global semantic summary of the entity and its immediate topological neighbors. During online inference, an LLM metacontroller leverages these dense profiles to dynamically adapt its strategy based on task intent: performing immediate synthesis for global summarization queries, or executing deterministic step-by-step routing guided by the embedded neighbors, which effectively mitigates blind search hallucinations. Extensive experiments demonstrate that UniGraphRAG successfully unifies these dual capabilities, establishing state-of-the-art performance on complex multi-hop QA benchmarks while maintaining highly competitive results in holistic summarization tasks.
|
| |
| 14:45-15:00, Paper TuA16.25 | |
| Collaborative UAV Swarm Roundup Decision-Making Method Based on IA-MADDPG Optimization Algorithm (I) |
|
| Li, Hao | Northwestern Polytechnical University |
| Hu, Zhiyang | Northwestern Polytechnical University |
| Song, Chao | Northwestern Polytechnical University |
| She, Yang | Northwestern Polytechnical University |
| Wang, Jianmei | Guizhou Aerospace Institute of Measuring and Testing Technology |
| Li, Bo | Northwestern Polytechnical University |
Keywords: Reinforcement Learning, Neural Networks and their Applications, Deep Learning
Abstract: This paper introduces the intrinsic curiosity and attention mechanisms into the Multi-Agent Deep Deterministic Policy Gradient (MADDPG) algorithm, proposing the IA-MADDPG algorithm to address issues such as slow decision-making and weak adaptability in unmanned aerial vehicle (UAV) swarms surrounding maneuvering targets in uncertain environments. First, to address the challenges of UAV swarm cooperative roundup in uncertain environments, we propose a novel framework that leverages the MADDPG algorithm and an intrinsic curiosity incentive mechanism. The MADDPG algorithm enables autonomous control of the UAV swarm, while the curiosity-driven consistency reward model fosters exploration of the unknown environment. In order to expedite the completion of the roundup task, we incorporate a self-attention mechanism into our framework. This mechanism aggregates the state and action information of the UAV swarm, assigning weights to the internal rewards. Simulation results show that the IA-MADDPG algorithm effectively solves environmental uncertainty and reward sparsity in UAV cooperative hunting, achieving faster convergence, higher task completion, and better autonomous hunting performance than MADDPG.
|
| |
| 14:45-15:00, Paper TuA16.26 | |
| Leveraging Resolved Incident History for LLM-Assisted Software Bug Diagnosis |
|
| Guan, Boyuan | Florida International University |
| Xu, Hailu | California State University, Long Beach |
| Rogers, Jamie | Florida International University |
Keywords: Generative AI, Fault Monitoring and Diagnosis, AI and Applications
Abstract: Effective software bug diagnosis requires two ingre dients: the right knowledge source (operational failure history, not just system documentation) and the right retrieval structure (structured records, not unstructured chunks). Current retrieval augmented generation (RAG) approaches fall short on one or both dimensions. We propose Operational Memory RAG (OM-RAG), which indexes resolved issues as structured symptom–root cause–resolution triples and retrieves the most similar historical precedent via single-hop embedding. OM-RAG powers a purpose built large language model (LLM) administrator that has operated a production Dataverse instance for over six months, operationalizing the Knowledge component of the Monitor–Analyze–Plan-Execute–Knowledge (MAPE-K) feedback loop with the system’s own resolved failure history. In a controlled four-configuration ablation, LLM-based judging covers all 1,172 issues and manual verification a 123-issue subset. OM-RAG achieves Diagnosis Accuracy of 0.931 and Fix Correctness of 0.809, outperforming chunk-based retrieval (+186%) and a documentation-anchored concept graph (+77%). Model-free retrieval metrics (mean similarity 0.880) independently corroborate the ranking.
|
| |
| 14:45-15:00, Paper TuA16.27 | |
| JIT-AGM: Just-In-Time Defect Prediction and Localization Via Commit-Aware Attention Guided by LLM-Augmented Messages |
|
| Zhang, Han | Nanjing University of Aeronautics and Astronautics |
| Huang, Zhiqiu | Nanjing University of Aeronautics and Astronautics |
| Yu, Yaoshen | Nanjing University of Aeronautics and Astronautics |
| Shen, Guohua | Nanjing University of Aeronautics and Astronautics |
| Zhao, Yu | Nanjing University of Aeronautics and Astronautics |
| Xie, Jian | Nanjing University of Aeronautics and Astronautics |
Keywords: Quality and Reliability Engineering, Machine Learning, Deep Learning
Abstract: Just-in-Time Defect Prediction and Localization (JIT-DP and JIT-DL) aim to identify defect-inducing commits and locate defective lines in software systems. However, existing approaches often fail to effectively capture commit semantics or model the interaction between developer intent and code changes, leading to suboptimal prediction and localization performance. Recent advances in large language models (LLMs) provide new opportunities for improving semantic representations in JIT tasks. However, directly applying LLMs to JIT defect prediction and localization remains challenging due to unstable performance and high inference cost of direct LLM prediction. To address these limitations, we propose JIT-AGM, a unified framework that leverages LLMs for semantic augmentation rather than standalone prediction. JIT-AGM generates structured commit messages and integrates them with CodeBERT-based modeling and a guided attention mechanism to explicitly align commit messages with code changes. Experiments on the JIT-Defects4J dataset show that JIT-AGM consistently outperforms strong baselines, improving the F1-score from 0.491 to 0.667 and reducing IFA from 10.3 to 6.0, while also achieving gains in effort-aware metrics. These results highlight that LLMs are more effective as semantic augmentation components in our setting, providing new insights into integrating LLMs with structured models for defect prediction and localization.
|
| |
| 14:45-15:00, Paper TuA16.28 | |
| Monitor-Repair-Integrate: A Cognitively Inspired Framework for Coherence-Aware Retrieval-Augmented Question Answering |
|
| Chen, Xiaoyu | Institute of Software |
| Peng, Tao | Institute of Software Chinese Academy of Sciences |
| Wu, Fengge | Institute of Software, Chinese Academy of Sciences |
| Zhao, Junsuo | Institute of Software, Chinese Academy of Sciences |
| Fan, Yun | Iscas |
Keywords: Cognitive Computing, Knowledge Acquisition, Generative AI
Abstract: Humans monitor discourse for referential breaks and repair them by retrieving missing antecedents. Retrieval-based QA systems face a similar problem when chunk boundaries sever coreference chains, leaving otherwise relevant evidence locally underspecified. We propose Monitor–Repair–Integrate (MRI), a cognitively inspired framework for coherence-aware retrieval that detects referential discontinuities, repairs them via targeted retrieval, and integrates the result for generation. We instantiate MRI in MDR-RAG. Human evaluation (N=15) shows a strong preference for repaired snippets (95.4%), and process analyses indicate that performance gains track coherence disruption and repair success rather than evidence volume alone. Across three long-form QA benchmarks and four LLM backbones, MDR-RAG consistently outperforms strong baselines while introducing only 0.34% additional tokens and 3.55s latency per query. These results support MRI as a principled, efficient framework for coherence-aware evidence construction in retrieval-augmented generation. Code is available at: https://github.com/xxy33/MDR-RAG.
|
| |
| 14:45-15:00, Paper TuA16.29 | |
| Schema-Guided Graph Attention for Cognitively Inspired Scientific Paper Evaluation |
|
| Chen, Xiaoyu | Institute of Software |
| Wu, Fengge | Institute of Software, Chinese Academy of Sciences |
| Zhao, Junsuo | Institute of Software, Chinese Academy of Sciences |
| Fan, Yun | Iscas |
Keywords: Cognitive Computing, AI and Applications, Expert and Knowledge-Based Systems
Abstract: Evaluating scientific papers requires identifying functional roles of claims and assessing logical coherence---processes well-studied in expert cognition. We present GraphEval-GT, a framework inspired by expert reasoning that represents papers as structured argumentation graphs with epistemic role assignments. We introduce two attention biases motivated by cognitive research: a position bias reflecting locality constraints in information integration, and a role bias encoding functional dependencies between argument components. A pilot study with 56 reviewers (24 experts, 32 novices) validates these design choices: expert attention concentrates on Method--Result links, with agreement declining as evidence-claim distance increases. Experiments on three benchmarks demonstrate state-of-the-art performance, outperforming frontier LLMs (GPT-5.4, Claude Sonnet 4.6) and existing graph methods. The framework introduces only 12% parameter overhead over vanilla GAT and processes each abstract in under 0.8s. Learned attention patterns align with human behavior (Pearson r=0.72), providing evidence that cognitively inspired structural biases improve both performance and interpretability. Code is available at: https://github.com/xxy33/grapheval-gt.
|
| |
| 14:45-15:00, Paper TuA16.30 | |
| RKAN-3D: An Efficient Network for Three-Dimensional Unsteady Flow Field Prediction |
|
| Xiao, Liwei | School of Computer Science and Technology, Southwest University of Science and Technology |
| Chen, Yonghui | Southwest University of Science and Technology |
| Wang, Fupan | School of Computer Science and Technology, Southwest University of Science and Technology |
| Fan, Shuai | Computer Science and Technology, Southwest University of Science and Technology |
Keywords: Deep Learning, System Modeling and Control, Neural Networks and their Applications
Abstract: 目前,流体力学中的深度学习研究 主要专注于二维(2D)流动。前往 加速深度学习技术的部署 在实际工程场景中,扩展至关重要 研究范围涵盖高维复杂三维流动 系统。实现三维非稳态的高效预测 本文提出了一种新的时空动力学 由Kolmogorov-Arnold Networks(KAN)和3D驱动的网络 残余卷积,命名为RKAN-3D。模型的准确性 捕捉流场的多尺度空间拓扑 通过三维残留模块,同时利用 KAN 的 可学习的激活机制以缓解拟合 高频传统网络的瓶颈, 非线性物理特征。此外,为了解决 误差发散的严重挑战,广泛存在于 长期自回归预测,本文采用了 趋势预测策略以建模增量特征 流体演化,从而显著增强了 多步的数值稳定性和长期精度 递归推广。实验表明RKAN-3D结构 在预测三维非稳态方
|
| |
| 14:45-15:00, Paper TuA16.31 | |
| Patch-Centric Transformer for Long-Term Time Series Forecasting in Industrial IoT Systems (I) |
|
| Xu, Ruichi | Beihang University |
| Yuan, Haitao | Beihang University |
| Bi, Jing | Beijing University of Technology |
| Zhang, Jia | Southern Methodist University |
| Wang, Weidong | Beijing University of Technology |
Keywords: Cloud, IoT, and Robotics Integration, Deep Learning, Intelligent Industrial Systems
Abstract: While Transformer architectures excel in Long- Term Time Series Forecasting (LTSF), they often fall into a “mean-reversion trap” on non-stationary industrial data, yield- ing overly smoothed predictions that lose vital high-frequency fluctuations. To address this, we propose WavePatchFormer, a lightweight Patch-Centric Transformer designed to balance computational efficiency and waveform fidelity for Industrial Internet of Things (IIoT) applications. Our architecture features three core mechanisms: a joint embedding module for patch-level feature fusion, a Flatten Multi-Layer Perceptron (MLP) direct decoder to mitigate phase drift, and a joint time-frequency loss to preserve spectral energy. Extensive experiments on eight standard benchmarks demonstrate that our model yields lower error rates on datasets with severe distribution shifts (e.g., ETTh2) and reduces shape-matching distances. Finally, we establish the boundary conditions of this paradigm, noting that while explicit channel mixing benefits tightly coupled sensor networks, it creates information bottlenecks in ultra-high-dimensional IIoT deployments.
|
| |
| 14:45-15:00, Paper TuA16.32 | |
| Robust Coupled Multi-Modal Entity Alignment Via Fine-Grained Semantic Disentanglement and Consistency-Aware Fusion |
|
| Li, Mufeng | University of Science and Technology of China |
| Chen, Yikun | JilinUniversity |
| Chen, Shuo | University of Science and Technology of China |
| Zhong, Yang | Hunan University of Chinese Medicine |
| He, Anna | Southwest Petroleum University |
Keywords: AI and Applications, Neural Networks and their Applications, Application of Artificial Intelligence
Abstract: We address the problem of multi-modal en- tity alignment (MMEA) for multi-modal knowledge graphs (MMKGs). Existing MMEA methods face two core bottlenecks: semantic entanglement caused by insufficient feature disentan- glement, and the lack of collaborative optimization between decoupling and fusion stages. This paper proposes RCMEA, a robust coupled MMEA framework, which achieves fine-grained semantic disentanglement via double orthogonality constraints, and realizes adaptive robust fusion with consistency-aware cross-modal attention. We further build a bidirectional feedback loop for collaborative optimization of the two core stages. Ex- periments on standard MMEA benchmarks show that RCMEA achieves state-of-the-art performance under all common set- tings, with ablation studies validating the effectiveness of our core components.
|
| |
| 14:45-15:00, Paper TuA16.33 | |
| SEMG-IMU Dynamic Gesture Recognition Based on Three-Scale Convolution and Bidirectional Long Short-Term Memory Network (I) |
|
| Xu, Jin | Shenyang Aerospace University |
| Wang, Xinchen | Shenyang Aerospace University |
| Zhang, Senyue | Shenyang Aerospace University |
| Shen, Cheng | Shenyang Aerospace University |
| Ding, Zhencai | Dandong Oriental Measurement & Control Technology Co., Ltd |
Keywords: Deep Learning, Biometrics and Applications, Machine Learning
Abstract: 动态手势识别在先进的人机交互和智能控制系统中起着关键作用。然而,有效解读感官数据仍是一个关键挑战,主要原因是局部特征提取不足以及复杂时间依赖性建模困难。本文提出了一种动态手势识别方法,整合了表面肌电图(sEMG)和惯性测量单元(IMU)信号。具体来说,在多通道原始时间信号经过过滤和标准化后,动态手势序列采用滑动窗口策略构建。随后,开发了一种名为TCNN-BLSTM的混合架构,结合了三尺度卷积神经网络和双向长短期记忆网络,用于联合建模局部多尺度特征和长程时间动态。在广泛使用的公共数据集和新建立的包含10名受试者和6个动态手势类的数据集上进行了大量实验。该方法在各自数据集上实现了97.68%和92.03%的窗口级准
|
| |
| 14:45-15:00, Paper TuA16.34 | |
| UMG-Tuning: Uncertainty-Aware Visual Injection As Fine-Grained Refiner for CLIP |
|
| Wang, Haixu | East China Normal University |
| Xi, Xidong | East China Normal University |
| Wei, Conghua | East China Normal University |
| Nie, Mengshang | East China Normal University |
| Cao, Guitao | East China Normal University |
Keywords: Deep Learning, Transfer Learning, Machine Learning
Abstract: While Contrastive Language-Image Pre-training (CLIP) demonstrates remarkable zero-shot generalization, adapting it to downstream few-shot tasks remains challenging.Existing methods typically treat visual and textual adaptation independently or rely on static fusion, overlooking the critical fine-grained visual context for text refinement and neglecting instance-level uncertainty during inference. To overcome these challenges, we propose a novel method Uncertainty-aware Multi-scale Graph Tuning (UMG-Tuning), which leverages visual injection and graph propagation to optimize cross modal alignment. First, we propose a Visual-Injected Graph Refinement (VIGR) module to semantically enrich abstract text prototypes with concrete visual contexts, explicitly modeling inter-class relationships. Complementarily, we develop an Adaptive Multi-Scale Fusion (AMF) module to aggregate hierarchical visual features and preserve fine-grained details. Finally, we devise an Uncertainty-Aware Logit Fusion (ULF) mechanism that dynamically calibrates predictions by weighing the confidence of different branches, improving adaptation to ambiguous samples. Experimental results show that our method significantly improves the performance of CLIP-based few-shot learning.
|
| |
| 14:45-15:00, Paper TuA16.35 | |
| Geometric Line Integral Ordinary Differential Equations for Medical Image Recognition |
|
| Zhu, Shengxiang | Sichuan University |
| Luan, Jiuhong | Machine Intelligence Lab, College of Computer Science, Sichuan University |
| Zhang, Zhicheng | Machine Intelligence Lab, College of Computer Science, Sichuan University |
| Shen, Yuncheng | College of Physics and Information Engineering, Zhaotong University |
| Zhang, Yan | Department of Medical Oncology, Lung Cancer Center/Lung Cancer Institute, Cancer Center, West China Hospital, Sichuan University |
| Junjie, Hu | Sichuan University |
Keywords: Deep Learning
Abstract: In recent years, Convolutional Neural Networks (CNNs) and Vision Transformers (ViTs) have achieved significant progress in medical image recognition, yet they still face a trade-off between capturing global dependencies and computational efficiency. Convolution is limited by its local receptive field, while self-attention mechanisms incur high computational complexity. To address this, we introduce a Neural Ordinary Differential Equations (NODEs) framework to bridge discrete and continuous representations, and adopt improved integration schemes to overcome numerical robustness and long-term integration errors in medical texture analysis. Building on this motivation, we propose GeoLIM-Net, a novel model based on the Line Integral Method (LIM). The solver first applies an explicit Euler predictor to generate an initial path and capture global context, then uses a nested fourth-order Runge-Kutta (RK4) module to refine derivatives and extract nonlinear features, and finally performs implicit line integration to maintain structural consistency. Experiments on BreastMNIST, PneumoniaMNIST, and OrganSMNIST show that GeoLIM-Net achieves state-of-the-art results.
|
| |
| 14:45-15:00, Paper TuA16.36 | |
| CoST-Diff: Joint Spatiotemporal Diffusion with Contextual Guidance for Human Mobility Generation |
|
| Li, Li | Beijing Information Science & Technology University |
| Zou, Linzi | Beijing Information Science & Technology University |
| He, Jialing | Beijing Information Science and Technology University |
| Lu, Junting | Beijing Information Science and Technology University |
| Si, Junjun | Communication University of China |
| Huang, Xiaoming | Beijing Information Science and Technology University |
Keywords: Generative AI
Abstract: Human mobility trajectories are fundamental to urban computing and smart city planning. However, strict privacy regulations limit raw data availability, necessitating high-fidelity trajectory synthesis. Despite recent advances, existing generative methods suffer from two limitations: they decouple spatiotemporal dependencies, causing inconsistencies, and they neglect rich contextual factors, disrupting behavioral coherence. To address these, we propose CoST-Diff, a conditional spatiotemporal diffusion framework. By modeling trajectories as unified sequences of spatiotemporal states, CoST-Diff holistically captures the coupling between location and time. Furthermore, urban mobility contexts are incorporated as conditional guidance to steer generation. Extensive experiments on three real-world datasets show that CoST-Diff substantially outperforms state-of-the-art baselines in spatial and temporal fidelity.
|
| |
| 14:45-15:00, Paper TuA16.37 | |
| DPA: Dynamic Pyramid Attention for Qualitative Document Named Entity Recognition |
|
| Guangpu, Jiang | Shanghai University |
| Tu, Kang | ShangHai University |
| Duan, Xinyi | Shanghai University |
| Deng, Ming | Shanghai University |
| Sun, Sijin | National University of Singapore |
| Wu, Xing | School of Computer Engineering and Science, Shanghai University |
Keywords: Deep Learning, Application of Artificial Intelligence, Neural Networks and their Applications
Abstract: Document-level Chinese named entity recognition (CNER) requires contextual evidence at multiple scales, yet common single-receptive-field or fixed-fusion approaches treat token distances symmetrically and do not explicitly model two task priors: boundary tags can depend on asymmetric left/right context, and intra-span attention should decay more gently than cross-span attention. This paper presents DPA-NER, a three-tier pyramid attention framework with a Directional Span-Adaptive Distance (DSAD) bias that encodes these priors through independent directional decay rates and a piecewise decay kernel initialized from dataset span statistics. A dynamic layer weighting (DLW) module fuses per-tier representations for each input, and a hybrid RoBERTa-BiLSTM encoder provides boundary-sensitive embeddings. Experiments on four Chinese NER datasets (QD-NER, Weibo, MSRA, Resume) show that DPA-NER obtains the best F1 among the compared systems on three datasets and ranks second on Weibo.
|
| |
| 14:45-15:00, Paper TuA16.38 | |
| Efficient Scene Understanding Via Joint Scene-Aware Retrieval and Scene Classification |
|
| Tu, Kang | ShangHai University |
| Guangpu, Jiang | Shanghai University |
| Duan, Xinyi | Shanghai University |
| Deng, Ming | Shanghai University |
| Sun, Sijin | National University of Singapore |
| Wu, Xing | School of Computer Engineering and Science, Shanghai University |
Keywords: Machine Vision, Image Processing and Pattern Recognition, Application of Artificial Intelligence
Abstract: A joint scene-aware retrieval and scene-classification framework is proposed for e-commerce settings where visually similar products must be separated into fine-grained lifestyle sub-domains. Three key contributions are introduced: (1) a background-agnostic VLM annotation strategy that acquires scene awareness entirely through the training objective, avoiding text-side label injection and shortcut matching; (2) a shared-representation design that co-optimises a symmetric I2T/T2I contrastive loss and a scene head over the same projected image pathway; and (3) gate-controlled cross-block LoRA propagation that links all Q-Former attention blocks under a 4.12% trainable parameter budget, enabling scene-discriminative cues to accumulate across the full attention stack. On a benchmark derived from DeepFashion2 with seven scene categories, the framework achieves a scene classification accuracy of 88.92%, a retrieval R@1 of 53.25%, and a median rank of 1.5.
|
| |
| 14:45-15:00, Paper TuA16.39 | |
| Exploring Large Language Models for Continuous Braking Comfort Scoring in Automated Vehicles |
|
| Hajjaj, Hadhoum | University of Grenoble Alpes |
| Guo, Wenqi | National Institute of Standards and Technology |
| Griffor, Edward | National Institute of Standards and Technology |
| Lbath, Ahmed | University of Grenoble Alpes |
Keywords: AI and Applications, Connected and Automated Vehicles
Abstract: Existing braking comfort assessment methods for automated vehicles typically classify braking events into broad categories but cannot distinguish between maneuvers that fall within the same category, even when the underlying kinematics differ significantly. This study presents a proof of concept for whether Large Language Models (LLMs) can provide continuous scoring that aligns with established comfort-related indices while offering finer differentiation. Braking data were collected from 91 manual driving runs at a stop-controlled intersection in 31 speed–distance conditions and used as representative braking profiles for evaluating the proposed LLM-based comfort scoring methodology. In phase 1, ten representative runs spanning three ISO 2631 comfort categories were evaluated using five prompting strategies: zero-shot, domain context, few-shot calibration, chain-of-thought, and raw time-series input. Each strategy produced a comfort score on a 1–10 scale, a categorical label, and a natural-language justification. All five strategies achieved strong inverse rank correlation with physical severity (Kendall’s τ = −0.867) and perfect inter-strategy agreement (Kendall’s W = 1.000). In phase 2, the chain-of-thought strategy was applied to all 91 runs. The resulting scores ranged from 1.8 to 8.6, spreading the 65 runs assigned to a single ISO 2631-based comfort category over a range of 1.8 to 6.1. These findings suggest that LLMs can complement established comfort indices by providing continuous and interpretable scoring outputs where categorical methods reach their resolution limit.
|
| |
| 14:45-15:00, Paper TuA16.40 | |
| Risk-Sensitive Specialist Routing for Volatility Forecasting |
|
| Zhong, Tenghan | University of Southern California |
Keywords: Decision Support Systems, Machine Learning
Abstract: Volatility forecasting becomes challenging when market conditions shift and model performance varies across market states. Motivated by this instability, we develop a risk-sensitive specialist routing framework for ETF volatility forecasting. The framework uses online risk-sensitive evaluation and state-dependent gating to combine different forecasting specialists across calm and stressed market states. Using a daily panel of six ETFs under a rolling walk-forward design, we find that the strongest forecaster is regime-dependent rather than stable across all states. Relative to the rolling-best baseline, the proposed routing framework reduces high-volatility forecast loss by about 24% and underprediction loss by about 22%. These results suggest that specialist routing provides a practical forecasting architecture that adapts to changing market conditions.
|
| |
| 14:45-15:00, Paper TuA16.41 | |
| Dynamic Hazard Analysis for Airborne Cyber-Physical Systems Using Automated Causal Stochastic Modeling |
|
| Liu, Chunbo | Civil Aviation University of China |
| Mengyao, Han | School of Computer Science and Artificial Intelligence, Civil Aviation University of China |
| Zhao, Sihan | Civil Aviation University of China |
| Jia, Chen | Information Security Evaluation Center, Civil Aviation University of China, Tianjin 300300, China |
| Wang, Jing | Civil Aviation University of China |
Keywords: System Modeling and Control, Systems Safety and Security
Abstract: Hazard analysis is critical to the development and airworthiness certification of airborne systems. However, current methods face two fundamental limitations: manual qualitative derivation struggles to ensure complete scenario coverage, while probabilistic models suffer from state-space explosion when scaling to multi-source concurrent threats. To address these issues, we propose an integrated framework combining automated reasoning and stochastic modeling. This famework integrates Systems-Theoretic Process Analysis for Security (STPA-Sec) with stratified Datalog reasoning to automatically generate a Causal Scenario Tree (CST) covering multi-source threats. Subsequently, a predecessor node aggregation strategy is used to map the CST to a Generalized Stochastic Petri Net (GSPN), enabling steady-state probability quantification of system-level unsafe control actions while circumventing state explosion. A case study of the Flight Management System (FMS) demonstrates that this method reduces the model solution dimension, quantifies steady-state hazard probabilities, and reveals the nonlinear suppression effect of dynamic recovery mechanisms on cyberattacks. The proposed famework provides rigorous quantitative support for resilience architecture optimization and comprehensive airworthiness assessment in complex airborne systems. Index Terms—Hazard analysis, STPA-Sec, Automated reasoning, Causal Scenario Tree, Predecessor node aggregation
|
| |
| 14:45-15:00, Paper TuA16.42 | |
| GFD-FirmFuzz: Graph Fusion Based Directed Fuzzing for IoT Device Firmware |
|
| Wang, Zhengwu | Beijing Information Science and Technology University |
| Huang, Xiaoqiang | Beijing Information Science and Technology University |
| Chen, Jingjing | Beijing Information Science and Technology University |
| Zheng, Liwei | Beijing Information Science and Technology University |
| Cui, Zhanqi | Beijing Information Science and Technology University |
Keywords: AIoT, Cloud, IoT, and Robotics Integration, Cyber-physical systems
Abstract: The rapid advancement of Internet of Things (IoT) technology has led to the widespread connection of embedded devices to the Internet. This evolution provides significant convenience for both industrial production and daily life. However, attackers have recently exploited security vulnerabilities in IoT device firmware. They infiltrate and control devices to compromise user privacy. Furthermore, these attacks pose significant threats to national and social security. Fuzzing is an automated software testing technique. It has successfully identified vulnerabilities across diverse software systems. Researchers have applied fuzzing to firmware testing. This approach has uncovered numerous real-world vulnerabilities. It also significantly enhances the efficiency of firmware security testing. Existing IoT firmware fuzzing methods enhance efficiency through state preservation and taint analysis. These methods also address security risks arising from multi-binary interactions. However, they do not measure the distance from cross-binary basic blocks to sensitive basic blocks. This lack of measurement results in inefficient energy allocation for test cases. We propose GFD-FirmFuzz, a graph fusion-based directed fuzzing method for IoT firmware. The method constructs and fuses binary dependency graphs, function call graphs, and control flow graphs. This fusion enables the calculation of basic block-level distances across binaries. GFD-FirmFuzz then allocates energy to test cases based on these distances to enhance fuzzing efficiency. We developed a prototype of GFD-FirmFuzz on top of STAFF. We selected fifteen IoT device firmwares as test subjects. Our evaluation compared GFD-FirmFuzz against STAFF, AFLNet, and TriforceAFL. Results show that GFD-FirmFuzz increases basic block coverage by an average of 5.29%, 3.41%, and 32.63%. It also triggers 7, 25, and 56 additional unique crashes, respectively. Furthermore, GFD-FirmFuzz discovered more crashes related to multi-binary interactions.
|
| |
| 14:45-15:00, Paper TuA16.43 | |
| A Hybrid Adaptive Experience Replay Mechanism for Robust Humanoid Robot Gate-Passing in Unstructured Environments |
|
| Zhao, Guodong | Harbin Engineering University |
| Gao, Xue | Harbin Engineering University |
| Dong, Jian Hua | Harbin Engineering University |
| Liu, Mingshuo | Harbin Engineering University |
Keywords: Robotic Systems, Reinforcement Learning, Environmental Sensing
Abstract: Deep reinforcement learning has become a core technology for addressing complex motion control problems in humanoid robots. To tackle the challenges of low sample efficiency and policy oscillations in autonomous motion control of humanoid robots in unstructured environments, this paper uses the task of passing through a narrow gate as a representative scenario and constructs an end-to-end control framework based on multiple mainstream algorithms, including DQN, SAC, and GAN-SAC. Furthermore, an experience replay mechanism named HQE-PSS, which is improved by a Hybrid Quality Evaluation and Priority Sampling Strategy, is proposed. Through ablation studies conducted in a Webots-based physical simulation environment for gate passing, the proposed mechanism is shown to effectively resolve the learning failure issue of traditional experience replay under imbalanced sample distributions. It not only improves the convergence speed and gate-passing learning policy of the three baseline algorithms but also significantly enhances the environmental adaptability of humanoid robots in scenarios with randomly dynamic gates. Experimental results demonstrate that the proposed mechanism accelerates algorithm convergence and significantly improves task success rates.
|
| |
| 14:45-15:00, Paper TuA16.44 | |
| A Safety-Critical Human-Centric Emergency Decision-Making Model Combining CRITIC-TOPSIS and Mamdani Fuzzy Systems with Hierarchical Non-Orthogonal Rules |
|
| Qin, Wang | Northwest Minzu University |
| Nady, Slam | Northwest Minzu University |
| Feng, Bojie | Lisbon University Institute |
Keywords: Decision Support Systems, Fuzzy Systems and their applications, Systems Safety and Security
Abstract: Emergency decision-making under uncertainty is a research hotspot. In particular, in human-centered real-world scenarios, emergency decision-making needs to balance safety constraints with practical decision needs. However, existing methods obtaining optimal plans by approximating the ideal solution tend to breach safety thresholds by prioritizing resource efficiency; whereas methods for obtaining decision plans through expert-references based often sacrifice optimal resource efficiency due to excessive conservatism in determining attribute weights based on expert experience; furthermore data-driven decision models exhibit insufficient reliability when making decisions within extreme casualty ranges, primarily due to the scarcity of extreme casualty samples. To address these limitations, we propose an emergency multi-attribute decision-making model combining CRITIC-TOPSIS and hierarchical non-orthogonal rule-based Mamdani fuzzy systems (CTF-MADM). The proposed model is implemented through a two-layer architecture: the lower layer utilizes a hybrid approach integrating Criteria Importance Through Intercriteria Correlation (CRITIC) for calculating the objective weight of criteria and the Technique for Order of Preference by Similarity to Ideal Solution (TOPSIS) for ranking candidate plans to evaluate the resource efficiency of plans. The upper layer employs a hierarchical non-orthogonal rule-based Mamdani fuzzy system, converting domain-specific rules into membership degrees during the fuzzification step. Through fuzzification, the hierarchical non-orthogonal rule base, reasoning system, and defuzzification processing, the system ultimately combines the defuzzified scores with those derived from the lower-level decision plans to derive the final decision plan. Comparative experiments conducted across various fire sizes and multiple fire scenarios demonstrate that the proposed model generates decision plans capable of minimizing casualties in large-scale fire scenarios while maintaining optimal resource efficiency in small-scale fire scenarios.
|
| |
| 14:45-15:00, Paper TuA16.45 | |
| An Efficient MLP-Based Generative Approach for Stochastic Human Motion Prediction |
|
| Dong, Kun | University of Chinese Academy of Sciences |
| Li, Fan | University of Chinese Academy of Sciences |
| Xue, Jian | University of Chinese Academy of Sciences |
| Dongming, Zhang | State Key Laboratory of Communication Content Cognition, People's Daily Online |
| Hongjuan, Pei | University of Chinese Academy of Sciences |
| Liu, Haojie | University of Chinese Academy of Sciences |
| Jia, Chuang | University of Chinese Academy of Sciences |
| Lu, Ke | University of Chinese Academy of Sciences |
Keywords: Human-Computer Interaction, Human-centered Learning, Deep Learning
Abstract: Stochastic human motion prediction (SHMP) focuses on forecasting multiple plausible future human pose sequences from past observations. Despite notable advancements, most previous works rely on intricate architectures like RNNs and Transformers, typically necessitating cumbersome training processes and complex loss designs. In this paper, we challenge this convention by introducing MotionMLP, a single-stage and end-to-end MLP-based generative framework for this task. We show that, after integrating well-established practices, a simple MLP-based architecture can significantly outperform current leading approaches. Moreover, to address the inference inefficiency, we further introduce flow matching algorithm to bridge the gap between high performance and low latency. Comprehensive evaluations on Human3.6M and AMASS datasets validate the remarkable superiority of our method.
|
| |
| 14:45-15:00, Paper TuA16.46 | |
| STGIC: Spatio-Temporal Graph Intention Coordination for Multi-Agent Traffic Signal Control |
|
| Yao, Xin-Wei | Zhejiang University of Technology |
| Jiang, Yixuan | Zhejiang University of Technology |
| Yao, Zhong-Hua | ZheJiang Institute of Communications |
| Li, Qiang | Zhejiang University of Technology |
| Yang, Kunhua | Zhejiang University of Technology |
Keywords: Intelligent Transportation Systems, Reinforcement Learning, Distributed Intelligent Systems
Abstract: Effective coordination in Multi-Agent Traffic Signal Control (M-TSC) relies on efficient inter-agent communication. Existing paradigms face a ``bandwidth-foresight dilemma'': sharing raw hidden states is communication-efficient but lacks strategic forward-looking guidance, while sharing explicit future traffic predictions incurs high computational and bandwidth overheads. To circumvent this, Intention Broadcasting presents a compact alternative where agents share their anticipated action-value distributions. However, generating reliable intentions requires deeply understanding dynamic traffic evolution rather than relying on static, single-step observations. To address this limitation, we propose STGIC, a novel framework that integrates temporal foresight with spatial coordination. Specifically, STGIC employs a sliding-window temporal encoder to process short-term historical observations, implicitly extracting local traffic trends to generate trend-aware intentions. Subsequently, a relational transform graph attention network routes these intentions spatially, dynamically filtering neighborhood noise based on local temporal states. Extensive evaluations on real-world datasets demonstrate that STGIC achieves highly competitive performance against representative baselines. Furthermore, mechanistic ablations validate the indispensability of coupling temporal trend extraction with spatial intention sharing.
|
| |
| 14:45-15:00, Paper TuA16.47 | |
| Large Language Model Prompt Augmentation-Based Statement-Level Software Fault Localization |
|
| Cui, Zhanqi | Beijing Information Science and Technology University |
| Zhang, Jiale | Beijing Information Science and Technology University |
| Xu, Weili | Beiiing Information Science and Technology University |
| Zhaxi, Jiancuo | Beijing Information Science and Technology University |
| Chen, Jingjing | Beijing Information Science and Technology University |
Keywords: Quality and Reliability Engineering, Deep Learning, Systems Safety and Security
Abstract: During the development and maintenance of software systems, the introduction of faults is inevitable, posing significant threats to software reliability and security. To accurately locate these faults, researchers have developed various automated fault localization methods. These methods include spectrum-based, mutation-based, and learning to rank-based approaches, which primarily analyze program execution information and code features to locate faults. However, these methods still face limitations in understanding the semantic information of faults, which limits their accuracy of fault localization. To address the challenge, this paper proposes LLMPAFL, which is a large language model prompt augmentation-based statement-level software fault localization. Firstly, the method utilizes a deep learning model to assign suspicious scores to code statements of the program, and select the methods containing highly suspicious statements to construct the code context. This approach alleviates the context window constraints encountered by large language model (LLM) when handling large-scale projects. Secondly, LLMPAFL integrates multi-source information, including bug report, stack trace information and suspicious scores, to construct structured prompts that guide LLM in performing multi-stage reasoning. Finally, it outputs a ranked list of suspicious statements to achieve precise fault localization. Experimental results demonstrate that when examining the first statement in the ranked list of suspicious statements, LLMPAFL successfully locates 19-82 faulty statements compared to spectrum-based, mutation-based, and learning to rank-based methods in fault localization.
|
| |
| 14:45-15:00, Paper TuA16.48 | |
| IMSFC-YOLO: An Internal Multi-Scale and Feature Context Enhanced YOLOv11 for UAV Small Object Detection |
|
| Zhang, Le | National University of Defense Technology |
| Zhang, Xiang | National University of Defense Technology |
| Qu, Ruizhuo | National University of Defense Technology |
| Gao, Xiang | National University of Defense Technology |
| Cao, Hao | National Supercomputing Center in Tianjin |
| Wang, Julong | National Supercomputing Center in Tianjin |
| Jiang, Huanghuang | National University of Defense Technology |
| Wang, XinYu | National University of Defense Technology |
| Ai, Xin | National University of Defense Technology |
| Wang, Daying | National University of Defense Technology |
| Wang, Haoyu | Central South University |
| Gong, Chunye | College of Computing, National University of Defense Technology |
Keywords: AI and Applications, Image Processing and Pattern Recognition, Deep Learning
Abstract: 无人机的部署 (无人机)在军事侦察中带来了极高的要求 关于 他们的机载物体检测系统用以识别微小的, 密集 复杂环境中的目标。为了解决召回率低的问题 对小型目标的探测率和严重漏接率 此类场景下的通用探测器,本文 提出一个 高精度分析增强型探测器——IMSFC-YOLO。 基于YOLOv11的基础,核心创新 包括:1)设计内部多尺度小靶 增强模块(IMSEM),加强了这些功能 以及通过通道分割实现微小目标的轮廓 多尺度 池化和拉普拉斯边缘提取;2)构造一个 轻量级功能上下文模块(FCM)高效地 通过 聚合多尺度上下文信息 平行 多路径结构;3)引入浅层检测 头部 利用高分辨率特征直接改进 Smalltarget召回。VisDrone2019数据集上的实验 节目 IMSFC-YOLO实现47.1%的mAP@0.5%,并实现召回 45.3%的感染率,É
|
| |
| 14:45-15:00, Paper TuA16.49 | |
| D2Net: A Joint Temporal–Channel Framework for Multivariate Time Series Forecasting |
|
| Xu, Can | Nanjing University of Science and Technology |
| Cao, Lei | Nanjing University of Science and Technology |
| Yan, Hui | Nanjing University of Science and Technology |
Keywords: Deep Learning, Machine Learning, Representation Learning
Abstract: Multivariate time series often exhibit complex temporal variation patterns and inter-channel correlations. These two factors are closely related, yet most existing methods fail to jointly exploit them. Temporal variations typically show multi-scale features, whereas inter-channel correlations often encompass both commonalities and distinct characteristics across channels. Motivated by this observation and to address this limitation, we design dedicated mechanisms for the temporal and channel dimensions and propose D2Net, whose core consists of the Multi-Scale Progressive Mixing module (MSPM) and the Channel Common–Specific Mixing module (CSM). Firstly, MSPM fuses multi-scale temporal information, followed by CSM, which separates and fuses channel common and channel specific patterns. To capture global trends and local fluctuations, D2Net then adopts a dual branch network consisting of a linear branch and a non-linear branch, and adaptively fuses the outputs of the two branches for the final prediction. Finally, extensive comparative and ablation experiments on nine real-world datasets validate the strong performance and efficiency of D2Net.
|
| |
| 14:45-15:00, Paper TuA16.50 | |
| Cascaded Spatial Prompting for Allocentric Spatial Reasoning in Vision-Language Models |
|
| Meng, Yuchao | South China University of Technology |
| Zhang, Yunyue | CSN Digital Intelligence Technology Co., Ltd |
| Liang, Lingyu | South China University of Technology |
| Deng, Guoqiang | South China University of Technology |
| Zhang, Haoze | University of Washington |
Keywords: Generative AI, Machine Vision, Cognitive Computing
Abstract: 在具身人工智能中部署视觉语言模型需要 但仍然具备稳健的同种空间推理 跨参考系的透视取向依然存在 对现有车型来说颇具挑战性。我们假设那是 贡献因素是参考系挑战 标准空间推理,直接推理严格 将以镜头为中心的视觉感知与隐含的 协调变换。为了缓解这种情况 表征纠缠,我们提出级联空间纠缠 提示(CSP),一种推理时间提示策略,具有 将异心空间关系预测分解为两部分 显式阶段:(i) 原子摄像机视角感知 (提取宾语关系和人称取向)以及 (ii) 参考框架的规则引导文本推理 转变。系统性评估此类多步骤 基于这个原因,我们引入了AlloCam-Set,一种诊断工具 评估集仅包含约3000人 对齐的三阶段层级注释。广泛 实验显示CSP显著改善了平均值 AlloR
|
| |
| 14:45-15:00, Paper TuA16.51 | |
| A Physics-Guided Dual-Paradigm Architecture for Shield Attitude Prediction |
|
| Wang, Jing | Shandong University |
| Jin, Zijian | Qilu University of Technology |
| Ba, Xingzhi | Shandong University |
Keywords: Application of Artificial Intelligence, Deep Learning, Smart Buildings, Smart Cities and Infrastructures
Abstract: Abstract— Shield tunneling is the predominant method for complex urban subterranean construction. Maintaining the precise attitude of the shield machine is critical to prevent structural damage and ground settlement. However, unpredictable geological variations induce sudden attitude deviations, requiring accurate predictive models for proactive correction. While deep learning is increasingly employed, current data-driven approaches exhibit two limitations: they disregard rigid-body kinematics, leading to inconsistent spatial predictions, and output deterministic point estimates, lacking probabilistic bounds for robust risk assessment. This paper proposes a physics-guided, dual-paradigm architecture synergizing a hybrid LSTM-Transformer network with mechanics-aware feature engineering. A Rigid-Body Constraint Loss (RBCL) is embedded to enforce kinematic consistency, and quantile regression maps deterministic estimates into calibrated uncertainty intervals. Validation on 1,647 excavation rings from the Huanggang Cross-River Tunnel reveals task-dependent advantages. A pure Transformer achieves the lowest mean absolute error (MAE) of 2.680 mm in deterministic point prediction (Paradigm I). Conversely, the hybrid LSTM-Transformer demonstrates exceptional robustness in uncertainty quantification (Paradigm II), yielding a precise MAE of 2.742 mm and an 80% Prediction Interval (PI) with 82.13% coverage and a 9.20 mm width. Gradient saliency and SHAP analyses elucidate the spatiotemporal learning mechanisms. By balancing deterministic precision and calibrated uncertainty, this framework facilitates proactive, mechanics-informed risk management. Index Terms— Tunnel, Shield Machine, Attitude Prediction, Rigid-Body Constraint, Prediction Interval (PI), LSTM-Transformer.
|
| |
| 14:45-15:00, Paper TuA16.52 | |
| MCP-Guard: Detecting and Governing High-Risk Startup Semantics in Project-Level MCP Configurations |
|
| Huang, Yudong | Information Engineering University, Zhengzhou |
| Wang, Yisen | Information Engineering University |
| Du, Jiajun | Information Engineering University |
| Yang, Tianchan | Information Engineering University |
| Jiang, Zirui | Information Engineering University |
Keywords: Systems Safety and Security, Generative AI, Information Assurance and Intelligence
Abstract: Model Context Protocol (MCP) has emerged as the de facto interoperability layer for connecting LLM agents to external tools. In project settings, however, repository-distributed MCP configuration files increasingly function not only as capability declarations, but also as portable, approvable, and executable local startup entry points. Prior work has studied protocol threats, platform benchmarks, and metadata poisoning in MCP ecosystems, yet the access-time risk of executable project-level MCP configurations remains under-modeled. We present MCP-Guard, a layered framework that combines rule-based prefiltering with LLM-based semantic analysis to detect high-risk startup semantics in project-level MCP configurations, and a pre-execution policy guard for host-side onboarding. The detector reconstructs execution semantics from configuration files, installation instructions, and auxiliary scripts, and identifies patterns such as shell wrapping, runtime fetching, capability asymmetry, and semantic obfuscation. The guard enforces source binding, configuration-drift constraints, semantic risk explanation, and policy mapping before a local server is launched. On a manually labeled evaluation set, MCP-Guard achieves 89.7% precision, 86.8% recall, and 86.1% macro-F1, outperforming rule-only and lightweight semantic baselines. In pre-execution protection experiments, the guard raises the block rate for high-risk configurations from 8.7% to 86.8% with only 0.83 s average overhead.
|
| |
| 14:45-15:00, Paper TuA16.53 | |
| TrustLips: An Audio-Visual Lip Synchronization Forgery Detector Via Multi-Scale Orthogonal Fusion |
|
| Liu, Mengting | Sichuan University |
| Meng, Bin | Sichuan University |
| Shen, Yongkun | SIchuan University |
| Wan, Zhiqiang | Sichuan University |
| Zhou, Jiliu | SIchuan University |
Keywords: AI and Applications, Deep Learning, Image Processing and Pattern Recognition
Abstract: With the rapid advancement of deep generative technologies, multimedia such as audio and videos has become inundated with extensive forged material, posing significant challenges to the security of communication content. Furthermore, the rising incidence of telecom fraud cases underscores violations of biometric privacy, such as the misuse of human voices and facial features. Notably, forged videos synthesized through lip synchronization are realistic. Existing detection methods typically rely on identifying audio-visual out-synchronization to differentiate genuine content from fake, yet their performance remains largely unsatisfactory. In this paper, we propose a multimodal lip-sync forgery detector based on multi-scale attention and orthogonal fusion. On the one hand, our approach captures fine-grained multi-scale spatial information around the lip region and allocates distinct attention weights to prioritize key evidence for authenticity evaluation. On the other hand, it introduces an orthogonal fusion mechanism to enhance the interaction between global temporal features and local spatial features, thereby boosting the accuracy of identifying discrepancies between lip movements and corresponding audio signals. Extensive experiments validate the effectiveness and generalizability of our approach, which is designed to mitigate the escalating risks in current communication and multimedia security.
|
| |
| 14:45-15:00, Paper TuA16.54 | |
| Physics-Model-Based Co-Optimization of a Three-Link Robotic Fish Via SSDVM and Bayesian Optimization |
|
| Yin, Zhaoran | Chinese Academy of Sciences |
| Zhou, Chao | Chinese Academy of Sciences |
| Yang, Jie | Hangzhou International Innovation Institute, Beihang University |
| Wang, Xiaofei | Department of Automation, Tsinghua University |
| Liao, Xiaocun | Institute of Automation, Chinese Academy of Sciences |
| Sun, Xiangyu | Institute of Automation, Chinese Academy of Sciences |
Keywords: System Modeling and Control, Robotic Systems
Abstract: This study presents a physics-model-based co-optimization framework for the design and locomotion of a three-link robotic fish based on the Sliding Strip Discrete Vortex Method and Bayesian optimization. By incorporating a minimum speed constraint, the proposed method avoids degenerate low-speed solutions and enables efficient identification of physically meaningful designs under limited function evaluations. This constraint effectively reshapes the optimization landscape by penalizing insufficient propulsion, thereby guiding the search toward regions that balance energy efficiency and swimming performance. The optimization achieves a minimum cost of transport of 16.707 J/(kg*m). Results show that the design space exhibits a structured near-optimal region, where different optimization runs converge to comparable performance despite variations in optimal design variables. The proposed framework provides an efficient and consistent method for coupled morphology-kinematics optimization of bio-inspired robotic fish.
|
| |
| 14:45-15:00, Paper TuA16.55 | |
| Trans-BearLLM Transformer-Enhanced Fault Classification Network with Large Language Model Integration for Interpretable Bearing Health Management (I) |
|
| Hu, Zhenyu | Jiangsu Normal University |
| Han, Fuguang | University of International Business and Economics |
| Wang, Pengbin | Jiangsu Normal University Kewen College |
| Cai, Yuxuan | JiangSu Normal University KeWen College |
| Zhang, Yueyue | Jiangsu Normal University |
| Wang, Hangyu | Jiangnan University |
Keywords: Fault Monitoring and Diagnosis, Deep Learning, Artificial Social Intelligence
Abstract: 跨不同工业领域 0340;轴承故障诊断 工作条件要求并 4892;的框架 可概括、判别且 1487;解释, 还没 现有方法难以统 9968;异质振动 来自不同传感器 0340;信号,提取全ह ;6;光谱 德彭 频域表示的密度 5292;产生 超越离散故障标 1614;的可操作诊断๛ ;5;出。我们 建议Trans-BearLLM,一位ੋ ;6;强健的健康男性 引入了变形金刚 2686;强的年龄框架 故障分类网络以 1462;代原有的 多尺度 卷积注意力块与 1472;加自我注意力 赛段 以及跨频下采样 5292;实现全局频谱 依赖关系 在 由离散余弦归一 1270;产生。该 提取 振动特征被对齐 1040;的令牌空间中 Qwen2 通过语义初始化 0340;对齐层和 好吧 通过LoRA调校,使模 ;型能够同时实现 进行故障诊断、 4322;常检测、维护ॿ ;4;议 通过自然语言进 4892;豁免与风险分ਜ਼ ;2;报告生成。MBHM数据 ;集上的实&
|
| |
| 14:45-15:00, Paper TuA16.56 | |
| MUSE-Dec: Multi-Aspect Supervision Evaluation for Quality-Aware Neural C++ Decompilation |
|
| Xie, Yuanbo | Shanghai Jiao Tong University |
| Zhang, Jinyu | Shanghai Jiao Tong University |
| Song, Yimin | Shanghai Jiao Tong University |
| Hou, Qinsheng | Shanghai Jiao Tong University |
| Liu, Gongshen | Shanghai Jiao Tong University |
Keywords: Generative AI, Deep Learning, Application of Artificial Intelligence
Abstract: Decompilation aims to recover more understandable high-level code from low-level binaries and is a fundamental capability in security tasks such as vulnerability discovery, malware analysis, and program understanding. In recent years, large language models have substantially advanced neural decompilation. However, existing methods mainly focus on model architectures, training scale, or inference strategies, while the quality variation of supervision targets remains underexplored. To address this issue, this paper proposes MUSE-Dec, a multi-aspect supervision evaluation framework for neural C++ decompilation. The proposed method first transforms raw pseudo-C into more source-like supervision targets through a two-phase lifting process, and then evaluates the target from four aspects, namely syntactic validity, diagnostic cleanliness, decompilation artifact burden, and structural readability. Based on the resulting quality scores, the training data are further filtered, tiered, and resampled to construct a higher-quality training distribution. Experimental results on three complementary benchmarks show that MUSE-Dec achieves the best results on HumanEval-Decompile and GitHub2025, while remaining highly competitive on BinMetric-DEC and improving the backbone by 21.7%. These results indicate that explicitly modeling supervision target quality can significantly improve neural decompilation performance without increasing model size.
|
| |
| 14:45-15:00, Paper TuA16.57 | |
| Interpretable Auxiliary Diagnosis of Cranial Nerve Via Clinically Guided Action-Level Modeling |
|
| Cui, Rong | Beijing University of Technology |
| Wang, Ziqi | Zhejiang University |
| Liu, Dong | Xuanwu Hospital, Capital Medical University |
| Zhai, Jiahui | Beijing University of Technology |
| Zhang, Junqi | Beijing University of Technology |
| Guozhen, Wang | China-Japan Friendship Hospital |
| Liu, Naigang | China-Japan Friendship Hospital |
| Shen, Yu | Beijing Neurorient Technology Co., Ltd |
| Hu, Po | Beijing Neurorient Technology Co., Ltd |
| Zhao, Xiaomeng | Beijing Neurorient Technology Co., Ltd |
| Liang, Jiantao | Xuanwu Hospital, Capital Medical University |
| Bi, Jing | Beijing University of Technology |
Keywords: Biometrics and Applications, Machine Vision
Abstract: Cranial nerve dysfunction manifests in diverse clinical conditions, of which facial paralysis is among the most prevalent and clinically significant. However, its clinical diagnosis still depends largely on subjective visual observation, which limits consistency and reproducibility in practice. Despite recent advances in computer-aided diagnosis, existing methods often fail to jointly ensure feature stability, clinical interpretability, and diagnostic robustness. In this paper, we propose CAMEL-FP, a hierarchical framework for interpretable cranial nerve health diagnosis based on Clinically-guided Action-level Modeling and Explainable Learning, using facial paralysis as a representative disease scenario. Specifically, CAMEL-FP represents facial dysfunction using structured indicators derived from facial landmarks, including symmetry, angular variation, and motion velocity differences. A significance-guided strategy is used to adaptively identify discriminative indicators for each action, and action-specific models equipped with clinically informed prior constraints are employed to capture diagnostic patterns while preserving consistency with medical knowledge. The resulting action-level evidence is then aggregated through an adaptive fusion module to form a global diagnostic representation, with feature contribution analysis providing additional interpretability. Experimental results on a clinical dataset show that CAMEL-FP achieves an AUC of 0.9904 pm 0.0086, a sensitivity of 0.9580 pm 0.0390, a specificity of 1.0000 pm 0.0000, and an F1-score of 0.9780 pm 0.0210, indicating its strong effectiveness, stability, and potential clinical utility.
|
| |
| 14:45-15:00, Paper TuA16.58 | |
| Federated Learning in V2X: An Analytical Approach Based on Stochastic Petri Nets |
|
| Silva, Luis Guilherme | Universidade Federal Do Piauí |
| Fé, Iure | UFPI |
| Cardoso, Israel | Federal University of Piaui |
| Barbosa, Francinaldo | Federal University of Piaui |
| Miquéias, José | UFPI |
| Lopes, Lucas | Federal University of Piauí |
| Feitosa, Leonel | Federal University of Piauí (UFPI) |
| Peixoto, Maycon | Federal University of Bahia |
| Vieira, Marco | University of North Carolina at Charlotte |
| Silva, Francisco Airton | Federal University of Piauí |
Keywords: Intelligent Transportation Systems, Cyber-physical systems, Modeling of Autonomous Systems
Abstract: Federated Learning (FL) in V2X vehicular environments operates under varying connectivity, computational availability, and node participation, making it difficult to evaluate its temporal behavior across runs. Approaches based exclusively on simulation require multiple runs and do not allow for the controlled isolation of the effects of concurrency and synchronization on system performance. This work proposes a stochastic analytical model to represent the execution cycle and temporal behavior of FL in 5G/6G vehicular architectures. Validation against experiments implemented in the Flower framework showed differences of less than 5% in average round time, with mean values of 28.77s for the SPN model and 29.31s in the experimental environment. The performance analysis also showed that round time increases from about 7 s to 53 s, while round rate decreases from 0.14 to 0.021 rounds/s as training time and the number of clients grow, highlighting the effects of synchronization and processing overhead on system behavior.
|
| |
| 14:45-15:00, Paper TuA16.59 | |
| CPPMC-Net: A Semi-Supervised Medical Image Segmentation Network with Correlation-Aware Priors and Prototype Memory Consistency (I) |
|
| Zhou, Haoran | Tongji University |
| Zhang, Ziyuan | Tongji University |
| Song, Sihan | Shanghai Normal University |
| Li, Guangyao | Tongji University |
Keywords: Medical Informatics, Image Processing and Pattern Recognition, Deep Learning
Abstract: Semi-supervised medical image segmentation effectively reduces annotation costs by leveraging limited labels alongside abundant unlabeled data. However, existing methods often fail to fully exploit structural priors in labeled data or maintain stable class-wise semantic references across iterations, making unlabeled feature learning prone to representation drift and noisy pseudo-label propagation. To address this, we propose CPPMC-Net, a framework that integrates correlation-aware priors with prototype memory consistency. Built on a student-teacher-student mutual learning framework, CPPMC-Net employs a Prior-Guided Information Extraction (PIE) module to model cross-sample interactions, enabling the transfer of structural anchors from labeled to unlabeled data. Furthermore, a Prototype Memory Consistency (PMC) module serves as a global state anchor, maintaining stable class-wise references across iterations and enforcing prototype-relation consistency to suppress noise propagation. Experiments on the ISIC and LA datasets demonstrate that CPPMC-Net achieves superior performance, particularly in boundary accuracy and structural stability, highlighting its potential for reliable medical image analysis in cyber-medical applications.
|
| |
| 14:45-15:00, Paper TuA16.60 | |
| Reliability-Aware ETF Tail-Risk Monitoring |
|
| Zhong, Tenghan | University of Southern California |
| Wu, Keyuan | University of Southern California |
Keywords: Decision Support Systems, Quality and Reliability Engineering, Fault Monitoring and Diagnosis
Abstract: Daily ETF risk monitoring can become unreliable when market data quality degrades, market conditions shift, or predictive performance becomes unstable. This paper develops a reliability-aware risk monitoring service for next-day tail-risk surveillance. The proposed framework combines service-time quality checks, lower-tail prediction, uncertainty scoring, and risk-aware adjustment of the tail-risk estimate. We evaluate the system on a daily panel of multiple ETFs augmented with VIX and yield-curve information under a rolling walk-forward design. Empirically, the framework improves tail-risk monitoring, especially during stressed periods, while remaining reliable under simulated input degradation.
|
| |
| 14:45-15:00, Paper TuA16.61 | |
| Predictive and Metaheuristic Admission Control for Accelerated Virtual Network Slice Provisioning |
|
| Gomes Sousa, Rayner | Federal University of Piauí |
| Silva, Francisco Airton | Federal University of Piauí |
| Vieira, Marco | University of North Carolina at Charlotte |
Keywords: Metaheuristic Algorithms, Heuristic Algorithms, Machine Learning
Abstract: In ultra-high-definition (4K/8K) video transmission, such as remote surgeries and augmented reality, latency and uplink limitations pose challenges for agile provisioning. Ensuring QoS in these critical applications demands intelligent, low-latency network management. The 5G system prepares the environment in advance through network slicing. Mapping these slices is a computationally complex (NP-hard) problem, traditionally solved using heuristics that require significant time. This work proposes a hybrid approach that integrates an ML-based admission control mechanism into the heuristic mapping process. The solution uses predictive modeling to assess request feasibility before mapping, considering 13 QoS parameters and the virtual network's characteristics. Requests with a high probability of failure or SLA (Service Level Agreement) violation are discarded in advance, reducing customer response time and optimizing the use of the provider's computational resources. The results indicate that predictive filtering accelerates provisioning and increases the mapping success rate for high-demand video services; in the best case, the time dropped from 41.93s to 0.06s, over a 1,000x reduction, allowing real-time operation.
|
| |
| 14:45-15:00, Paper TuA16.62 | |
| Diversity As a Strategy for Moving Target Defense: A Performance Modeling Approach |
|
| Almeida, Iago | Federal University of Piaui |
| Sabino, Arthur | Federal University of Piauì (UFPI) |
| Fé, Iure | UFPI |
| Lima, Luiz Nelson | Federal University of Piauí |
| Vieira, Marco | University of North Carolina at Charlotte |
| Gonçalves, Glauber | Federal University of Piauí (UFPI) |
| Silva, Francisco Airton | Federal University of Piauí |
Keywords: Cyber Systems and Engineering, Resilience Engineering, Cyber-physical systems
Abstract: The increasing interconnectivity of digital systems has expanded the attack surface of critical infrastructures, requiring more adaptive defenses. The Moving Target Defense (MTD) paradigm emerges as an alternative solution by introducing unpredictability into system configurations. This paper proposes a performance evaluation model based on Stochastic Petri Nets (SPNs) to analyze the MTD method from a Diversity-of-Resources perspective, accounting for recognition time, success probability, and resilience. Results indicate that increasing resource diversity can raise the Mean Time To Absorption (MTTA) by up to 357% and significantly reduce the attacker's success rate, demonstrating that periodic heterogeneity changes the attack-defense dynamic. Under concurrent attack scenarios, MTTA with diversity reaches up to ten times the value observed in static environments, further underscoring its effectiveness under high-concurrency conditions.
|
| |
| 14:45-15:00, Paper TuA16.63 | |
| LiteECG-Net: A Lightweight Convolutional Neural Network for ECG Classification |
|
| Hou, Chenyu | Zhejiang University of Technology |
| Wang, Yang | Zhejiang University of Technology |
| Yang, Zhe | Zhejiang University of Technology |
| Cao, Bin | Zhejiang University of Technology |
| Fan, Jing | Zhejiang University of Technology |
Keywords: Biometrics and Applications, Biometric Systems and Bioinformatics, AI and Applications
Abstract: Deploying deep learning models for real-time electrocardiogram (ECG) analysis on wearable and edge devices is challenging due to their high computational cost and large parameter size. To address this issue, we propose LiteECG-Net, a lightweight yet effective network for ECG arrhythmia classification. LiteECG-Net integrates a dual-branch frequency-temporal feature extractor, multi-scale depthwise separable convolutions, and a channel-temporal attention module to learn discriminative ECG representations with low computational overhead. Experiments on the PTB Diagnostic ECG Database and the MIT-BIH Arrhythmia Database show that LiteECG-Net achieves 99.7% accuracy on PTB and 99.3% accuracy on the stratified MIT-BIH split, while obtaining the best F1 score on the more challenging patient-wise split. Compared with lightweight baselines, LiteECG-Net reduces the parameter count by 31.8% and the model size by 68.9%. Moreover, hardware benchmarking demonstrates its practical edge-deployment capability, achieving an inference latency of 3.8 ms on NVIDIA Jetson Orin and 9.4 ms on Raspberry Pi 4B. The dataset and code are available at https://github.com/houchenyu/LiteECG.
|
| |
| 14:45-15:00, Paper TuA16.64 | |
| Robotic Arm Path Planning Based on Global Path Guided Reinforcement Learning |
|
| Liu, Shixian | Chinese Academy of Sciences |
| Shanlin, Zhong | Institute of Automation, Chinese Academy of Sciences |
| Chen, Jiahao | Institute of Automation, Chinese Academy of Sciences |
| Liu, Zhengyu | Institute of Automation, Chinese Academy of Sciences |
Keywords: Reinforcement Learning, Neural Networks and their Applications, Human-Machine Interaction
Abstract: Multi-degree-of-freedom robotic arms are widely used in unstructured dynamic environments such as collaborative services and agricultural harvesting. Achieving efficient and safe path planning in complex environments is a prerequisite for completing high-precision tasks. However, compared to traditional structured environments, the high-frequency interaction between robots and environment leads to significant uncertainty. Furthermore, the high-dimensional motion space of robotic arms results in immense computational complexity, making real-time reactive planning a challenge. Therefore, we propose a hierarchical planning method based on global path guidance to achieve a balance between computational efficiency and flexibility. Specifically, the global planning module first generates a collision-free reference path in the configuration space at the initial moment when obstacles are stationary, ensuring that the target configuration can be reached. Then the reference path is decomposed into continuous local target points and added as local constraints to the optimization objective of reinforcement learning. Finally, the reinforcement learning module is used as a local planner to generate reactive actions based on robot state and environment information. Simulation results show that our method outperforms standard off-policy reinforcement learning algorithms in terms of learning speed and arrival accuracy.
|
| |
| 14:45-15:00, Paper TuA16.65 | |
| An End-To-End Flight Control Network for High-Speed UAV Obstacle Avoidance Based on Event-Depth Fusion |
|
| Dikai, Shang | Shanghai Jiaotong University |
| Zhao, Jingyue | AMS |
| Xu, Shi | Defense Innovation Institute |
| Ye, Nanyang | Shanghai Jiaotong University |
| Wang, Lei | Defense Innovation Institute |
Keywords: Robotic Systems, Environmental Sensing, Deep Learning
Abstract: Achieving safe, high-speed autonomous flight in complex environments with static, dynamic, or mixed obstacles remains challenging, as a single perception modality is incomplete. Depth cameras are effective for static objects but suffer from motion blur at high speeds. Conversely, event cameras excel at capturing rapid motion but struggle to perceive static scenes. To exploit the complementary strengths of both sensors, we propose an end-to-end flight control network that achieves feature-level fusion of depth images and event data through a bidirectional crossattention module. The end-to-end network is trained via imitation learning, which relies on high-quality supervision. Building on this insight, we design an efficient expert planner using Spherical Principal Search (SPS). This planner reduces computational complexity from O(n^2) to O(n) while generating smoother trajectories, achieving over 80% success rate at 17 m/s—nearly 20% higher than traditional planners. Simulation experiments show that our method attains a 70–80% success rate at 17 m/s across varied scenes, surpassing single-modality and unidirectional fusion models by 10–20%. These results demonstrate that bidirectional fusion effectively integrates event and depth information, enabling more reliable obstacle avoidance in complex environments with both static and dynamic objects.
|
| |
| 14:45-15:00, Paper TuA16.66 | |
| FG-CLIP: Toward Large Language and Vision Assistant to Enhance Multimodal Fine-Grained Representations |
|
| Zeng, Zhaofu | Hainan University |
| Xing, Jian | Hainanu.edu.cn |
| Guan, Yingxin | Hainan University |
| Lei, Bai | Hainan University |
| Guo, Haitao | Hainan University |
| Meng, Fanchen | Hainan University |
| Zheng, Zhaohua | Hainan University |
Keywords: AI and Applications, Generative AI
Abstract: Despite the impressive performance of large-scale vision-language pre-training in multimodal tasks, existing models still struggle with fine-grained understanding. As shown in Figure. 1(d), the models fail to differentiate between “a man in the distance wearing a blue shirt” and “a man in the distance wearing a red shirt,” as they tend to focus on prominent cues while overlook fine-grained information. In this paper, we propose FG-CLIP, which leverages the Large Language and Vision Assistant (LLaVA) to enhance multimodal fine-grained representations. We first use LLaVA to generate fine-grained and negative semantics, guiding the model to learn fine-grained features. We then introduce a Fine-Grained Knowledge Enhancement Framework that further refines fine-grained representations through a Dual Text alignment (DTA) strategy and a Fine-Grained Enhancement Encoder (FGE). We introduce two challenging datasets, VGHard-Attribution and VG-Hard-Relation, to assess fine-grained representation ability. Experimental results demonstrate that FG-CLIP achieves state-of-the-art (SOTA) performance on the VG-Attribution, VG-Relation, VG-Hard-Attribution, and VGHard-Relation datasets, surpassing the previous SOTA method by 5.1%, 3.7%, 15.8%, and 12.9%, respectively. Results on general representation tasks indicate that FG-CLIP enhances fine-grained representations while preserving general representations. Additionally, FG-CLIP effectively integrates finegrained textual information into generated images, enabling fine-grained visual generation.
|
| |
| 14:45-15:00, Paper TuA16.67 | |
| Semantic-Adaptive Retrieval with Cluster-Guided Tree Search for Question Answering |
|
| Kun, Yang | Xiamen University |
| Wu, Xiangyu | Xiamen University |
| Liang, Nan | Xiamen University |
| Wentao, Qiu | Xiamen University |
| Jingqi, Gao | Xiamen University |
| Meihong, Wang | Xiamen University |
| Wu, Qingqiang | Xiamen University |
Keywords: Adaptive Systems, Deep Learning, Knowledge Acquisition
Abstract: Retrieval-Augmented Generation (RAG) grounds large language models (LLMs) in external knowledge to mitigate hallucinations, yet indiscriminate retrieval introduces noisy documents and incurs redundant latency. We propose SACG-RAG (Semantic-Adaptive Cluster-Guided RAG), a framework that replaces uniform retrieval with multidimensional semantic analysis. SACG-RAG routes queries to distinct pathways---direct generation, explicit denoising, or cluster-guided tree search---based on intrinsic semantic characteristics including commonsense dependency, temporality, specificity, ambiguity, and precision. For multi-hop reasoning, we employ semantic clustering and consensus-weighted Monte Carlo Tree Search (MCTS) to eliminate redundant exploration. Experiments on TriviaQA, PopQA, Natural Questions, and ASQA demonstrate that SACG-RAG reduces average retrieval calls by 25% compared to Adaptive-RAG while improving accuracy by 6.8% on average across datasets. Our contributions are threefold: (1) a label-free (at deployment) semantic routing mechanism using pre-trained components for query classification; (2) an explicit denoising mechanism for single-step retrieval; and (3) a cluster-guided tree search with confidence-based early stopping for efficient multi-hop reasoning.
|
| |
| 14:45-15:00, Paper TuA16.68 | |
| LKMamba: Large Selective Kernel and Prompt-Enhanced State Space Model for Lightweight Image Super-Resolution |
|
| Liu, Cheng | Henan University |
| Zhang, Peike | Henan University |
| Chen, Shuo | Zhongzhi Software Co, Ltd |
| Zhou, Liming | Henan University |
| Wang, Jun | Hebei University |
| Liu, Mengting | Sichuan University |
| Zhou, Xinhui | Henan University |
Keywords: Deep Learning, Image Processing and Pattern Recognition, Hybrid Models of Neural Networks, Fuzzy Systems, and Evolutionary Computing
Abstract: Deep learning-based single-image super-resolution (SISR) persistently faces a trade-off between computational efficiency and long-range dependency modeling. While Convolutional Neural Networks (CNNs) offer high efficiency, their restricted local receptive fields hinder holistic structural recovery. Conversely, recent State Space Models (SSMs), such as Mamba, effectively capture global dependencies with linear complexity but are bottlenecked by inherent causal masking and the heavy computational redundancy of multi-directional scanning strategies. To break this bottleneck, we propose LKMamba, a streamlined and lightweight hybrid architecture. Deviating from conventional complex hierarchical stacking, LKMamba features an elegant dual-stage processing paradigm. First, an Optimized Large Selective Kernel (OLSK) module is introduced to dynamically expand the effective receptive field, ensuring precise multi-scale local feature extraction. Second, to circumvent the causal limitations of SSMs without resorting to expensive multi-directional scanning, we design a novel State-space Prompt Module (SPM). By efficiently injecting learned prompt-based global priors into a single unidirectional scan, SPM achieves non-causal global perception with minimal parameter overhead. Extensive evaluations across five standard benchmarks validate the superiority of LKMamba. Notably, compared to the highly competitive SwinIR-light, LKMamba achieves a 0.33 dB PSNR improvement on the Manga109 dataset while reducing computational costs (MACs) by 28%, demonstrating a better trade-off between accuracy and efficiency.
|
| |
| 14:45-15:00, Paper TuA16.69 | |
| A Human-Centric Transfer Learning Framework for Multi-Dataset Contactless Blood Pressure Assessment Using Smartphone Facial Video (I) |
|
| Ranjan, Rahul | Monash University |
| Roha, Vishal SIngh | Monash University |
| Yuce, mehmet Rasit | Department of Electrical and Computer Systems Engineering, Monash University, Melbourne, Australia |
Keywords: Medical Informatics, Machine Learning, Deep Learning
Abstract: Accurate and accessible blood pressure (BP) risk stratification remains challenging in real-world settings because conventional cuff-based measurements are intermittent, contact-dependent, and impractical for frequent monitoring. This study presents a fully contactless framework for BP risk stratification using single-site facial video-derived remote photoplethysmography (rPPG) derived from a single-site facial video acquired from a smartphone camera. The proposed approach combines modified UNet-based waveform reconstruction, PPG-based multi-domain feature extraction, and hierarchical ensemble classification to distinguish low, normal, and hypertensive BP categories. The framework is evaluated on the publicly available PulseDB dataset and a curated smartphone dataset collected under structured cardiovascular perturbations. Contact PPG signals from PulseDB are used after preprocessing, while smartphone facial rPPG signals undergo region-of-interest extraction, spatial averaging, filtering, and morphology-preserving reconstruction to recover BP-sensitive waveform characteristics. Temporal, morphological, ratio-based, and demographic features are then extracted to capture complementary cardiovascular information relevant to BP variation. Experimental results show that integrating demographic information with PPG-derived features consistently improves classification performance, with the best-performing model achieving accuracies of 0.79 on PulseDB and 0.91 on the smartphone dataset. The results further indicate that hierarchical classification improves robustness under overlapping class boundaries, while waveform reconstruction enhances the reliability of BP-oriented feature extraction from contactless signals. These findings establish the proposed framework as a practical and physiologically grounded solution for smartphone-based BP risk stratification, with strong potential for future real-time mobile health deployment.
|
| |
| 14:45-15:00, Paper TuA16.70 | |
| SSG-Net: Multi-Scale Feature-Context Calibration and Gated Spatial-Structural Attention for 3D Hippocampus Segmentation |
|
| Shen, Kang | Chongqing Normal University |
| Yu, Lei | Chongqing Normal University |
| Wang, Jiayi | Chongqing Normal University |
| Liu, Wenqiang | Chongqing Normal University |
| He, Yue | Chongqing Normal University |
Keywords: Image Processing and Pattern Recognition, Deep Learning, Machine Learning
Abstract: Accurate 3D segmentation of the hippocampus from MRI scans plays an important role in early detection of neurodegenerative diseases, however, precise segmentation is often hindered by small target volumes and complex geometries, which lead to feature degradation in deep network layers. To overcome these issues, we design Structural-Spatial-Gated Net (SSG-Net), which combines multi-scale feature extraction with a gated spatial attention mechanism. The encoder em- ploys the DPC Block, which utilizes 7 × 7 × 7 depthwise convolutions to enlarge the receptive field without sacrificing fine-grained structural details. To resolve morphological am- biguities, the Multi-Scale Feature-Context Calibration Block (MS-CCB) leverages dilated group convolutions for multi-scale perception, subsequently performing context-aware distribution alignment to distill salient hippocampal textures from noisy backgrounds. Furthermore, Gated Spatial-Structural Atten- tion 3D (GSSA3D) is integrated into skip connections to decouple orthogonal spatial dependencies and sharpen blurred boundaries via dynamic gating. Extensive evaluations on MSD and ADNI-HarP datasets demonstrate that SSG-Net shows consistent improvements over several representative methods, with Dice/IoU reaching 93.42%/87.67% and 95.13%/90.71%, respectively. SSG-Net provides a reasonable trade-off between accuracy and computational cost: its computational complexity (GFLOPs) is lower than contemporary state-space models, while its parameter scale significantly outperforms massive Transformer architectures.
|
| |
| 14:45-15:00, Paper TuA16.71 | |
| INDEX: Lightweight IoT Intrusion Detection Via Explanation-Guided Distillation with Coreset Selection |
|
| Jia, Huiting | Beihang University |
| Lang, Bo | Beihang University |
| Li, Xiangyu | Beihang University |
| Zhang, Yilang | Beihang University |
| Zhao, Shuxin | Beihang University |
Keywords: Neural Networks and their Applications, Deep Learning
Abstract: Regarding intrusion detection in resource-constrained Internet of Things (IoT) environments, knowledge distillation (KD) offers an effective solution for developing lightweight and efficient models. However, existing methods generally lack explainability and are limited to imitating the behavior of teacher models, rather than understanding their internal decision-making logic. Moreover, the selection of distillation data significantly impacts the model performance, while existing research has paid little attention to this aspect. In this paper, we propose an intrusion detection framework called INtrusion Detection based on EXplanation-guided knowledge distillation and coreset selection (INDEX). This framework utilizes attribution explanations as transferable knowledge to explicitly convey the reasoning evidence of the teacher model, thereby enhancing the detection performance and explainability of the student model. Meanwhile, we propose an iterative coreset selection strategy that filters data samples with reliable teacher supervision signals and high informational value for distillation, improving the learning effectiveness of the student. Experimental results on the CIC-IDS-2017, RT-IoT2022, and TON_IoT datasets demonstrate that our proposed INDEX achieves superior detection performance compared to state-of-the-art methods while maintaining lower computational complexity and storage overhead.
|
| |
| 14:45-15:00, Paper TuA16.72 | |
| Empathetic Response Generation Via Dynamic Emotion-Semantics Representation and Neural Information Transmission |
|
| Yin, Yue | Shanghai Technical Institute of Electronics & Information |
| Wang, Haoyu | Shanghai University of Engineering Science |
| Sun, Hangling | Hengtu Imalligent Technology(Shanghai), Co., Ltd |
| Li, Anji | Abbott Laboratories (Shanghai) Co., Ltd |
| Chen, Bin | University of Shanghai for Science and Technology |
Keywords: Deep Learning, Representation Learning, Affective Computing
Abstract: Empathetic dialogue generation has gained significant attention in recent years, aiming to create more human-like and emotionally engaging conversational AI systems. However, existing approaches often struggle to capture the intricate dynamics and nuances of emotional expressions in human communication, leading to generic or contextually inappropriate responses. In this paper, we propose a novel neural information processing approach to empathetic dialogue generation that focuses on optimizing the neural transmission of affective information from the perspectives of language and emotion. Unlike previous methods that neglect the variability of emotional words and the complex interactions between emotions and semantics, our proposed neural emotion-semantics transmission network (NESTN) dynamically captures nuanced emotional expressions and exploits linguistic associations to enhance the model's ability to understand and generate empathetic responses. NESTN incorporates a dynamic emotion-semantics encoder to learn contextually-grounded affective representations and a neural transmission decoder to adaptively control the flow of emotional and semantic information during the generation process. Moreover, we introduce a multi-level attention mechanism to prioritize the most relevant emotional and semantic cues at different granularities. Further analysis reveals that the proposed approach aligns well with psychological theories of empathy, indicating its effectiveness in capturing the core aspects of empathetic communication.
|
| |
| 14:45-15:00, Paper TuA16.73 | |
| TriDiff: A Multi-View Parallel Diffusion Model with a Fluctuation-Aware Graph Module and a Dual-Mode Frequency Module |
|
| Feng, Xingjie | Civil Aviation University of China |
| Chen, Jiaxi | Civil Aviation University of China |
| Wang, Han | Civil Aviation University of China |
Keywords: Artificial Social Intelligence, Deep Learning, Generative AI
Abstract: Generating high-quality long term multivariate time series is important for mitigating data scarcity in domains such as healthcare, electricity, and energy. Existing generative models are usually designed from a single view, which makes it difficult to jointly model temporal dependencies, inter-variable correlations, and global periodic patterns in long sequences. This limitation reduces generation quality during denoising. To address this issue, we propose TriDiff, a multi-view parallel diffusion model with a Fluctuation-Aware Graph Module and a Dual-Mode Frequency Module. Built on a diffusion framework with an encoder-decoder Transformer and decoupled temporal representations, TriDiff forms a multi-view denoising encoder that fuses temporal, spatial, and frequency-domain features in parallel, improving the use of complementary information across views. Experiments on five public datasets, namely Stocks, Energy, fMRI, Mujoco, and Sines, show that compared with the representative baseline DiffusionTS, TriDiff reduces Context-FID, Correlational Score, and Discriminative Score by 23.63%, 18.84%, and 10.90%, respectively. These results show that TriDiff improves the quality of long term multivariate time series generation.
|
| |
| 14:45-15:00, Paper TuA16.74 | |
| Distribution Optimization and Adaptive Knowledge Distillation for Efficient LLM Quantization |
|
| Tai, Jie | Southwest University |
| Cheng, Suyan | Southwest University |
| Zeng, Shaoning | University of Electronic Science and Technology of China |
| Tian, Qing | School of Software, Nanjing University of Information Science and Technology |
| Gou, Jianping | Southwest University |
Keywords: Deep Learning, Generative AI, Transfer Learning
Abstract: Post-training quantization (PTQ) is essential for deploying large language models (LLMs) under hardware constraints. However, low-bit quantization typically suffers from severe performance degradation primarily caused by activation outliers. While recent transformation-based methods attempt to address this, they often incur massive computational overhead during calibration and easily trigger overfitting under limited few-shot data. In this work, we propose DAKQuant, an efficient PTQ framework based on Distribution optimization and Adaptive Knowledge distillation. DAKQuant performs unconstrained orthogonal optimization of rotation matrices via the Whip loss and optimizes scaling matrices through prediction-deviation-based adaptive distillation. By employing Top-K selection to filter long-tail noise, our method successfully suppresses activation outliers while strictly preventing few-shot overfitting. Extensive experiments on LLaMA-2-7B demonstrate that under the extreme W4A4KV4 configuration, DAKQuant effectively retains over 96% of the original FP16 performance. Notably, it completes calibration in just 6.2 minutes on a single GPU, achieving up to a 5.4x speedup over advanced baselines, providing a robust and highly efficient solution for low-bit LLM deployment.
|
| |
| 14:45-15:00, Paper TuA16.75 | |
| Learning What to Protect: A Neuro-Symbolic Model for Privacy-Aware Classification |
|
| Mimi, Mimuna | Chongqing University |
| Liu, Yongqi | Chongqing University |
| Chen, Zhongpu | Southwestern University of Finance and Economics |
| Xiao, Tong | Tsinghua University |
| Chen, Zeao | Chongqing University |
| Qiao, Yue | Chengdu University of Information Technology |
| Chen, Hao | Chengdu University of Information Technology |
| Wang, Zhi-Jie | Chongqing University |
Keywords: Machine Learning, Ethics of AI and Pervasive Systems, Neural Networks and their Applications
Abstract: Data classification underpins critical applications in human society, yet its deployment on sensitive data presents a fundamental dilemma: balancing high accuracy with robust privacy protection that satisfies privacy regulations. Differential Privacy (DP) is the prevailing technical solution, but its standard uniform-noise implementation severely degrades classification accuracy, due to its perturbed discriminative features. Inspired by the dual-process theory and the human selective attention in category learning, we propose a neuro-symbolic model that can adaptively learn features under strict privacy constraints. The policy engine in our model dynamically allocates the privacy budgets based on the feature importance, thereby applying the feature-adaptive noise rather than the uniform noise. In this way, it preserves the informative features while suppressing non-essential ones. Particularly, we formalize regulations (e.g., GDPR) as differentiable symbolic constraints, and thus can seamlessly embed the compliance into the learning process. Our model reduces the accuracy loss significantly under the identical privacy guarantees, demonstrating its effectiveness and competitiveness.
|
| |
| 14:45-15:00, Paper TuA16.76 | |
| Embodied Semantic Planning: Vision-Language Models for Adaptive Skill Sequencing in Robotic Manipulation |
|
| Du, Linlin | Intelligent Game and Decision Lab (IGDL) |
| Liu, Xin | Academy of Military Science |
| Ren, Xiaoguang | Academy of Military Science |
| Tan, Jie | Academy of Military Science |
| Tao, Ma | Institute of Computer Application, China Academy of Engineering Physics |
Keywords: Reinforcement Learning, Human-Machine Cooperation and Systems, Robotic Systems
Abstract: Long-horizon robotic tasks remain challenging for reinforcement learning because rewards are sparse and effective action sequences are difficult to discover through flat exploration alone. Hierarchical reinforcement learning mitigates this issue through temporal abstraction, but existing option-based approaches typically learn option boundaries solely from reward signals or depend on manually specified subgoals, which limits semantic interpretability and sample efficiency. We propose emph{VLM-Option}, a hierarchical framework that leverages pretrained foundation models to generate executable skill and context-aware subgoals for low-level reinforcement learning. Given a language instruction and an initial visual observation, a planner selects skills from a predefined library and predicts termination conditions conditioned on downstream task requirements. A goal-conditioned low-level policy is then trained using CLIP-based multimodal representations, where CLIP encodes the active skill description and current image into a shared embedding space. The generated subgoals additionally induce dense intrinsic rewards that complement sparse task feedback. Experiments on Meta-World and Robosuite manipulation tasks show that VLM-Option converges faster, achieves higher success rates, and requires fewer execution steps than E2E (DRQ-v2) RL, HRL (Option-Critic) and PSL (Plan-Seq-Learn) baselines.
|
| |
| 14:45-15:00, Paper TuA16.77 | |
| Hybrid Knowledge Distillation for Prefix Compression in Pre-Trained Language Models |
|
| Zhu, Hongtao | Southwest University |
| Liu, Daidai | Southwest University |
| Gu, Xin | Southeast University |
| Du, Lan | Monash University |
| Zhou, Min | Southwest University |
| Gou, Jianping | Southwest University |
Keywords: Deep Learning, Transfer Learning, Representation Learning
Abstract: Prompt-based learning has emerged as an effective paradigm for the parameter-efficient adaptation of pre-trained language models. However, existing methods typically rely on long continuous prefixes, which not only occupy the limited context window but also reduce effective input capacity. Furthermore, aggressively compressing prompt length introduces a severe capacity gap, leading to significant performance degradation. To address this challenge, we propose LR-HKD, a low-rank hybrid knowledge distillation framework for prompt compression. This framework adopts an alternating layer strategy, leveraging low-rank structural alignment to capture mini-batch-level inter-sample relationships, while employing intermediate representation matching to model fine-grained point-wise features. Extensive evaluations on multiple benchmark tasks demonstrate that LR-HKD can achieve substantial prompt compression while maintaining strong downstream task performance. Notably, the distilled student model not only outperforms existing baselines but, on certain tasks, even surpasses the uncompressed teacher model. These results highlight the effectiveness of combining feature-level and structure-level distillation for achieving robust knowledge transfer under extreme representational constraints.
|
| |
| 14:45-15:00, Paper TuA16.78 | |
| SQuaD-SQL: Efficient Text-To-SQL with Small Language Models Via LLM-Guided Knowledge Distillation |
|
| Wu, Wangyu | Xi’an Jiaotong-Liverpool University |
| Lin, Xiaojian | Tsinghua University |
| Fu, Rong | University of Macau |
| Yu, Zaiyang | University of Chinese Academy of Sciences |
| Chen, Xuhang | Huizhou University |
| Yu, Wenjun | Shanghai University of International Business and Economics |
| Chen, Zhenhong | Microsoft |
Keywords: Transfer Learning, Deep Learning, Representation Learning
Abstract: Text-to-SQL is a fundamental task in natural language processing that enables users to interact with structured databases using natural language. While large language models (LLMs) have demonstrated remarkable performance on this task, their substantial computational requirements hinder deployment in resource-constrained settings. In this paper, we introduce textbf{SQuaD-SQL} (textit{Small-Qualified and Distilled for SQL}), a novel approach that empowers small language models (SLMs) to approach the performance of LLMs on the Text-to-SQL task while significantly improving efficiency through knowledge distillation and synthetic data generation. Our method comprises three key components: (1) textit{LLM-based synthetic data generation}, where structured knowledge is extracted from LLMs via carefully designed prompting strategies; (2) textit{parameter-efficient fine-tuning}, enabling full model training on a single consumer-grade GPU; and (3) textit{domain-adaptive fine-tuning}, where domain-specific synthetic data further enhances performance in targeted domains. Experiments on the WikiSQL dataset demonstrate that SQuaD-SQL achieve execution accuracies of 86.9% in Test data, respectively, approaching the performance of LLMs, while offering faster inference and lower memory usage. These results suggest that, with proper training strategies, SLMs can serve as practical and efficient alternatives for Text-to-SQL applications in resource-limited environments.
|
| |
| 14:45-15:00, Paper TuA16.79 | |
| DSM-YOLO: A Lightweight Instance Segmentation Algorithm for Multi-Scale Cotton Bolls in Complex Agricultural Scenarios |
|
| Wang, Yousheng | Xinjiang University |
| Huang, Xiaohui | Xinjiang University |
| Dou, Jingjing | Xinjiang University |
Keywords: Deep Learning, Image Processing and Pattern Recognition, Neural Networks and their Applications
Abstract: Constrained by the computational bottlenecks of agricultural edge devices, existing models struggle to balance high precision and ultra-low overhead for cotton boll segmentation in complex scenarios. To address this issue, this paper proposes DSM-YOLO, a novel instance segmentation network based on YOLO11n-seg. The model introduces a Dynamic Feature Decoupling Module (C3K2-GDW) to adaptively extract complex contours and integrates a Multi-Scale Residual Channel Attention (MSRC) to suppress noise while preserving weak target features. Furthermore, a Lightweight State Space Mask Head (Segment_LSSM) is innovatively designed to achieve efficient global decoding while maintaining linear complexity. Experimental results on a self-built dataset consisting of 3,000 images, featuring challenging scenarios such as dense stacking and occlusion, demonstrate that DSM-YOLO contains only 2.40M parameters and 8.6 GFLOPs, achieving a peak mask mAP50-95 of 0.753. Compared to the baseline YOLO11n-seg, DSM-YOLO significantly improves the recall and mAP50 by 4.3% and 4.9%, respectively, while maintaining robust precision despite reductions in both parameter count and computational cost. This substantially reduces missed detections in dense occlusion scenarios, achieving an optimal balance between high-precision segmentation and extreme lightweight design.
|
| |
| 14:45-15:00, Paper TuA16.80 | |
| Cross-Layer Generalized Decoupled Self-Distillation |
|
| Guo, Chunmei | SouthWest University |
| Liu, Daidai | Southwest University |
| Cheng, Suyan | Southwest University |
| Liu, Jinhua | Shangrao Normal University |
| Du, Lan | Monash University |
| Gu, Xin | Southeast University |
| Gou, Jianping | Southwest University |
Keywords: Deep Learning, Transfer Learning, Image Processing and Pattern Recognition
Abstract: To address the limitations of conventional self-distillation methods, including the reliance on a single deep-layer supervision scheme and insufficient decoupling granularity, this paper proposes a Cross-Layer Generalized Decoupled Self-Distillation (CL-GDSD) framework. Specifically, we incorporate generalized decoupled knowledge distillation into the self-distillation paradigm and introduce a Top-k-based category grouping mechanism to model high-probability confusing classes and low-probability long-tail classes in a more fine-grained manner. Furthermore, a multi-teacher cross-layer distillation strategy is designed to enable shallow classifiers to progressively acquire knowledge from intermediate layers, thereby alleviating the semantic gap between shallow and deep representations. Experimental results on CIFAR-10 and CIFAR-100 demonstrate that the proposed method consistently outperforms baseline models and existing self-distillation approaches across various ResNet architectures, achieving stable improvements in both shallow branch performance and overall ensemble accuracy.
|
| |
| 14:45-15:00, Paper TuA16.81 | |
| Transformer-Based World Model Systems with Context-Aware Representations for Continuous Visual Control |
|
| Zhu, Zhanyu | Guangxi University |
| He, Yuhong | Guangxi University |
| Chen, Miaojiang | Guangxi University |
Keywords: Generative AI, Reinforcement Learning, AI and Applications
Abstract: In recent years, the construction of world models by harnessing the powerful sequence modeling capabilities of Transformers has emerged as a prominent research direction. Although Transformer-based agents (e.g., STORM) have demonstrated high data efficiency in discrete environments, their performance in continuous environments remains suboptimal. This limitation stems primarily from the inherent parallel training mechanism of Transformers, which often processes image encoding as an independent, context-agnostic step, thereby diminishing the capacity of the learned representation space. To address this issue, we propose the Recurrent Transformer State Space Model (RTSM), a novel serially-trained Transformer-based world model designed to restore context-aware hybrid deterministic and stochastic state representations. Furthermore, to enhance training efficiency, we incorporate a KV Cache mechanism during training. Experimental results on the DeepMind Control Vision benchmark show that our method achieves significant performance improvements compared to baselines, while maintaining acceptable computational costs.
|
| |
| 14:45-15:00, Paper TuA16.82 | |
| From Terrain Parameters to Cost Maps: Physics-Constrained Continuous Fields for Traversability-Aware Off-Road Planning |
|
| Fu, Junwei | National University of Defence Technology |
| Zhang, Pengnian | National University of Defense Technology |
| Du, Binhan | National University of Defense Technology |
| Xue, Hanzhang | National University of Defense Technology |
| Wang, Chenggang | National University of Defense Technology |
| Li, Junxiang | National University of Defense Technology |
Keywords: Autonomous Vehicle, Intelligent Transportation Systems, Robotic Systems
Abstract: A key challenge in off-road planning is converting terrain recognition into a continuous cost representation that is both physically meaningful and useful for decision-making. Existing approaches usually rely on discrete semantic labels, heuristic cost rules, or black-box learned scores, which do not adequately capture intra-class terrain variation and are difficult to interpret across different vehicles and environments. This paper proposes a physics-constrained continuous cost modeling framework based on a vision-modulated terrain parameter field. Semantic segmentation provides terrain-class priors, while visual cues are treated as observational proxies that refine terramechanics parameters under bounded and monotonic constraints. The estimated parameter field is then propagated through traction, slope, sinkage, and vibration models to compute safety margins, which are transformed into a unified risk-aware cost field and integrated into Hybrid A* as soft constraints. Experiments show that, compared with Hybrid A* without cost guidance, the proposed method reduces the average path cost by 33.3%, and reduces the exposure to hazardous-region exposure ratio by 61.7%; compared with Theta*, which is the strongest baseline in average cost, it still achieves a 24.8% reduction. In local perturbation experiments, replanned paths further reduce average path cost by 18.5%, demonstrating robust avoidance of newly emerged high-risk regions.
|
| |
| 14:45-15:00, Paper TuA16.83 | |
| CBiLSTM-Att: An Optimized CNN-Bidirectional LSTM with Self-Attention for Intrusion Detection in NSL-KDD |
|
| Song, Wenchao | Sichuan University |
Keywords: Deep Learning, Machine Learning, Neural Networks and their Applications
Abstract: Cyberattacks continue to evolve, and Intrusion Detection Systems (IDS) must contend with high-dimensional network traffic alongside severe class imbalance in standard datasets such as NSL-KDD. To tackle these challenges, we introduce CBiLSTM-Att—a hybrid deep learning architecture that combines convolutional neural networks for localized feature extraction, bidirectional long short-term memory for sequential context, and a self-attention mechanism to dynamically focus on relevant features. Hyperparameter selection, including the number of LSTM units and convolutional filters, is handled through the Sparrow Search Algorithm, which balances optimization efficiency with model performance. Data preprocessing follows a stratified split, and class weighting is applied to improve detection of underrepresented attack types. Evaluated on NSL-KDD, the model attains 99% accuracy for binary classification and 92% for five-class classification, with recall rates of 87.50% for U2R attacks and 94.33% for R2L attacks. The main contribution is a reproducible framework that handles data imbalance through integrated optimization and attention-driven feature selection.
|
| |
| 14:45-15:00, Paper TuA16.84 | |
| DualGraph: Familiarity-Gated Dual-Process Reasoning Over Knowledge Graphs |
|
| Chen, Xiaoyu | Institute of Software |
| Wu, Fengge | Institute of Software, Chinese Academy of Sciences |
| Zhao, Junsuo | Institute of Software, Chinese Academy of Sciences |
| Fan, Yun | Iscas |
Keywords: Expert and Knowledge-Based Systems, Generative AI, Cognitive Computing
Abstract: Knowledge graph question answering (KGQA) systems uniformly apply expensive multi-hop traversal to every query regardless of complexity. We propose DualGraph, a dual-process framework inspired by Kahneman's fast/slow cognition that routes queries between two graph reasoning modes: a fast pattern-cache path (System 1) for familiar, structurally simple queries and a deliberative beam-search traversal (System 2) for complex ones. A classifier-free familiarity gate—requiring no gradient-based training beyond a single threshold tuned via grid search—combines template confidence, graph-structural confidence, and draft-answer entropy to make routing decisions using graph-side signals absent from syntax-only routers. Unlike prior adaptive methods that route between text and graph retrieval, both modes of DualGraph operate on the knowledge graph. On four KGQA benchmarks, DualGraph matches state-of-the-art prompt-based accuracy while consuming 53% fewer tokens and reducing average wall-clock latency by 41% (from 8.0s to 4.7s per query) compared to uniform multi-hop traversal.
|
| |
| 14:45-15:00, Paper TuA16.85 | |
| HESonarNet: A Contour-Aware Hybrid Framework for Forward-Looking Sonar Object Detection (I) |
|
| Li, Chuan | Northwestern Polytechnical University |
| Sun, Ruiting | Northwestern Polytechnical University |
| Zhang, Guanwen | Northwestern Polytechnical University |
| Zhou, Wei | Northwestern Polytechnical University |
Keywords: Image Processing and Pattern Recognition, Machine Vision, Deep Learning
Abstract: Forward-looking sonar provides stable observations for underwater perception, but object detection is challenging due to speckle noise, low contrast, and weak target boundaries. Existing detection models often discard fragile contour cues and lack the ability to capture long-range dependencies in cluttered acoustic environments. This paper introduces HESonarNet, a contour-aware hybrid framework that unites shallow structural preservation with deep contextual reasoning. The proposed method utilizes an Edge-Guided Enhancement Module (EGEM) to extract and refine weak contour responses from shallow layers. Meanwhile, a Transformer encoder combined with a multi-scale perception bridge models global contextual information from deep features. These representations are integrated using a bidirectional cross-modal attention fusion module to align structural details with semantic context. Experiments conducted on the Marine debris dataset and UATD benchmarks validate the framework. HESonarNet achieves notable improvements in overall detection accuracy and spatial localization compared to existing detectors, successfully reducing false alarms and missed targets in complex marine scenes.
|
| |
| 14:45-15:00, Paper TuA16.86 | |
| Hybridizing Ant Colony Optimization with Deep Graph Priors for the Capacitated Vehicle Routing Problem |
|
| Yang, Wenchen | Dongguan University of Technology |
| Zhang, Yuhui | DongGuan University of Technology |
| Liu, Zhaoshuai | Dongguan University of Technology |
| Wei, Wenhong | Dongguan University of Technology |
| He, Shenghuang | Dongguan University of Technology |
Keywords: Swarm Intelligence, Logistic and Manufacturing Automation, Evolutionary Computation
Abstract: The Capacitated Vehicle Routing Problem (CVRP) is a challenging combinatorial optimization task in logistics scheduling. To address the limitations of traditional heuristic algorithms, which often get trapped in local optima and exhibit slow convergence on large-scale instances, this paper proposes DGPACO, a deep graph prior-guided heterogeneous ant colony optimization framework. By integrating the high-dimensional feature extraction capability of neural networks with the strong exploitation capability of swarm intelligence, the proposed method is able to effectively optimize the search trajectory. First, an EdgeConv-based neural heuristic prior captures global topological structures, overcoming the myopic nature of static distance heuristics. Second, a prediction-guided pheromone warm-start mechanism enables the algorithm to bypass early blind exploration and directly target high-quality solution spaces. Finally, a heterogeneous multi-colony swarm strategy dynamically maintains population diversity while strengthening local exploitation, preventing premature convergence. Extensive experiments and ablation studies conducted on scalable synthetic datasets demonstrate that DGPACO achieves rapid convergence in minimal iterations. It strikes a good balance between computational overhead and solution accuracy, exhibiting superior robustness and global search capabilities in large-scale complex routing networks compared to state-of-the-art algorithms.
|
| |
| 14:45-15:00, Paper TuA16.87 | |
| CNN-OREI: Convolutional Neural Network with Output Recurrence and Exogenous Input for Small-Scale Vehicle Identification |
|
| Almeida-Junior, Acarcio Gomes de | UFPE |
| Coelho, Francisco Jonatas Siqueira | UFPE |
| Silva-Filho, Abel Guilhermino | UFPE |
Keywords: System Modeling and Control, Autonomous Vehicle, Application of Artificial Intelligence
Abstract: Accurate vehicle dynamics modeling is essential for the development of advanced safety and autonomous driving systems. However, obtaining precise mathematical models for small-scale commercial vehicles is often unfeasible due to the lack of access to proprietary physical parameters and complex tire-road interactions. This paper proposes a novel data-driven system identification architecture: the Convolutional Neural Network with Output Recurrence and Exogenous Input (CNN-OREI). The proposed model leverages 1D-convolutional layers for automated feature extraction from time-series data, combined with an output recurrence mechanism to establish robust temporal dependencies. The network’s topology, specifically the number of convolutional filters and hidden neurons, was optimized using Particle Swarm Optimization (PSO). Experimental results demonstrate that the CNN-OREI outperforms traditional linear transfer functions, state-space representations, and standard NARX neural networks. The proposed architecture achieved a Fit of 95.99% and a Normalized Root Mean Squared Error (NRMSE) of 0.0117 on validation data, maintaining a stable prediction error within ± 0.01 m/s. These findings validate the CNN-OREI as a highly effective solution for identifying the intricate longitudinal dynamics of small-scale electric vehicles, providing a reliable foundation for real-time control and navigation strategies.
|
| |
| 14:45-15:00, Paper TuA16.88 | |
| A Multi-Stage Framework for Early FGR Detection from First-Trimester Placental Ultrasound |
|
| Wang, Si | Dongguan University of Technology |
| Chen, Mengjie | The Eighth Affiliated Hospital of Sun Yat-Sen University |
| Huang, Shiying | The Eighth Affiliated Hospital of Sun Yat-Sen University |
| Bu, Guojuan | The Eighth Affiliated Hospital of Sun Yat-Sen University |
| Li, Weiling | Dongguan University of Technology |
Keywords: AI and Applications, Medical Informatics
Abstract: Fetal growth restriction (FGR) is a leading cause of perinatal morbidity and fetal mortality, making early prediction of FGR clinically and socially valuable. The use of artificial intelligence techniques to analyze ultrasound imaging data represents an effective approach for FGR prediction. However, due to the difficulty in identifying FGR-relevant regions of interest in early ultrasound data, existing research has primarily covered FGR detection after 18 weeks of gestation, which is relatively delayed for clinical intervention. To address this issue, we propose a hybrid multi-stage feature learning-based FGR prediction method. First, a fine-tuned U-Net network is employed to extract highly FGR-relevant regions of interest from the ultrasound data. Subsequently, a dual-paradigm architecture is utilized to achieve complementary feature learning on these regions of interest. Finally, a weighted decision fusion module is designed to fuse the extracted features. Experimental results demonstrate that our method can accurately identify cases ultimately diagnosed with FGR from first-trimester (11-13 weeks) placental ultrasound images, achieving an AUC of 0.741. Meanwhile, on a placental ultrasound dataset acquired between 18-24 weeks, it achieves higher prediction accuracy than state-of-the-art models, with an AUC of 0.845.
|
| |
| 14:45-15:00, Paper TuA16.89 | |
| FlowSeg: Efficient and Boundary-Refined Medical Image Segmentation with Conditional Flow Matching |
|
| Yilihamu, Yilizati | University of Chinese Academy of Sciences |
| Xue, Jian | University of Chinese Academy of Sciences |
| Jia, Chuang | University of Chinese Academy of Sciences |
| Dong, Kun | University of Chinese Academy of Sciences |
| Yang, Meng | Peking Union Medical College Hospital |
| Lu, Ke | University of Chinese Academy of Sciences |
Keywords: Biometrics and Applications, Generative AI, Medical Informatics
Abstract: Medical image segmentation is fundamental to clinical analysis but remains challenging due to complex backgrounds, ambiguous boundaries, and large morphological variations. Although diffusion models excel in generative tasks, their high sampling costs and training instability limit their application in segmentation. To address this issue, we propose FlowSeg, an efficient mask generation framework based on Conditional Flow Matching (CFM). Unlike diffusion based approaches, FlowSeg directly models continuous generative trajectories, significantly improving inference speed and training stability while maintaining high generation quality. Moreover, to address the inherent boundary ambiguity in medical images, a parallel shape constrained flow and a gated fusion module are designed to explicitly enhance the model’s capability to capture fine-grained boundary details. Extensive experiments on the MoNuSeg, ISIC, and a private dataset demonstrate that FlowSeg consistently surpasses state-of-the-art methods in accuracy and efficiency. This work provides a novel, reliable solution for efficient medical image segmentation with strong potential for clinical translation. The source code will be made publicly available upon publication.
|
| |
| 14:45-15:00, Paper TuA16.90 | |
| Pricing of Value-Added Services and Advertising Strategies on Duopoly Video Platforms: A Reward Advertising Perspective (I) |
|
| Zhou, Biying | Henan University, Business School |
| Liu, Xuwang | Henan University |
| Qi, Wei | Henan University |
| Guo, Xiwang | Liaoning Petrochemical University |
| Wang, Jiacun | Monmouth University |
| Tang, Ying | Rowan University |
| Li, Nan | Henan University |
|
|
| |
| 14:45-15:00, Paper TuA16.91 | |
| Proactive Distribution Adaptation for Industrial Time Series Forecasting Via Prototype Alignment and Future Guidance |
|
| Zhong, Yuhong | Tongji University |
| Wang, Chenze | Tongji University |
| Wang, Jingwei | Tongji University |
| Xu, Gaowei | Tongji University |
| Liu, Min | Tongji University |
Keywords: Deep Learning, Neural Networks and their Applications, Intelligent Industrial Systems
Abstract: Industrial time series forecasting is pivotal for intelligent decision-making but remains fundamentally challenged by non-stationarity and continuous distribution drift. Existing transformer-based models often rely on passive static normalization, failing to adapt to evolving data distributions during inference. To address this limitation, we propose a novel framework for Proactive Distribution Adaptation, shifting the paradigm from passive statistical fitting to active distribution alignment. The framework integrates three key components: (1) an Affine Prototype-Timestamp (APT) module that retrieves temporal prototypes to perform dynamic affine transformation, stabilizing feature representations against instantaneous fluctuations; (2) a Future-Guided Learning (FGL) mechanism using feature-level distillation to align latent representations with future distribution trajectories; and (3) a Page-Hinkley (PH) monitor that detects real-time residual deviations to trigger adaptive model updates. Experiments on real-world industrial datasets demonstrate that our approach significantly outperforms state-of-the-art baselines in predictive accuracy and robustness. These results validate the efficacy of combining prototype-based alignment with future-guided distillation for robust forecasting under complex distribution shifts.
|
| |
| 14:45-15:00, Paper TuA16.92 | |
| Monocular Vision-Based CPR Quality Assessment |
|
| Gang, Xu | Ningbo Institute of Materials Technology & Engineering, Chinese Academy of Sciences |
| Zhong, Hanxi | Zhejiang University of Technology |
| Chen, Ruixing | Ningbo Institute of Materials Technology and Engineering, Chinese Academy of Sciences |
| Wang, Zhen | Army Medical Center of PLA,Army Medical University of PLA |
| Du, Xiaokang | Ningbo Institute of Materials Technology & Engineering, Chinese Academy of Sciences |
| Gong, Yingfei | Ningbo Institute of Materials Technology & Engineering, Chiense Academy of Sciences |
| Yutong, Li | Ningbo Institute of Materials Technology & Engineering, Chinese Academy of Sciences |
| Zhang, Yu | Boshi Intelligent (Chongqing) Technology Co., Ltd |
| Xiao, Jiangjian | Ningbo Institute of Materials Technology & Engineering |
Keywords: Application of Artificial Intelligence, Artificial Social Intelligence, Deep Learning
Abstract: Monocular vision offers a low-cost route toward scalable cardiopulmonary resuscitation (CPR) training, but reliable quality assessment remains difficult because clinically relevant cues such as compression depth, recoil, and upper-body force transmission are only indirectly observable in RGB videos. This paper presents an assessment-oriented monocular CPR evaluation framework that couples task-adapted front-end perception with a clinically constrained scoring back-end. The front-end stabilizes downstream analysis through CPR-oriented instance segmentation and phase recognition, while the back-end reconstructs 3D skeletal motion with a topology-constrained GraphMLP-CPR model and evaluates quality through a deviation-aware dual-track scorer that combines explicit clinical descriptors with a deep skeletal branch. We do not position the front-end adaptations as universal new backbones; rather, the contribution lies in how these components are reconfigured around downstream assessment reliability. Experiments on a self-built CPR dataset with synchronized mannequin-based reference labels show that the improved scene parser raises FastInst from 82.8% to 84.5% AP while increasing speed from 53.8 to 62.4 FPS, the phase recognizer attains 94.0% mAP at 14.8 GFLOPs, GraphMLP-CPR reduces MPJPE from 45.5 to 44.8 mm relative to GraphMLP, and the final dual-track evaluator reaches 95.4% accuracy with a Spearman correlation of 0.947. These results suggest that clinically grounded coupling between perception and scoring is a practical design strategy for monocular CPR training systems.
|
| |
| 14:45-15:00, Paper TuA16.93 | |
| MMHC-DTI: Drug-Target Interaction Prediction Via Multi-Scale Motif Hypergraph Convolution and Inter-Branch Semantic Correlation |
|
| Tao, Hong | Qilu University of Technology |
| Zhang, Xuan | Shandong Women's University |
| Guo, Lisha | Qilu University of Technology (Shandong Academy of Sciences) |
| Zhang, Li | Qilu University of Technology |
| Jing, Ming | Shandong Women's University |
| Wang, Fulin | Biocaro Pharmaceutical Co., Ltd |
Keywords: Deep Learning, Machine Learning, Computational Life Science
Abstract: The accurate identification of Drug-Target Inter actions (DTIs) is crucial for advancing drug discovery and repurposing. Although existing Graph Neural Network (GNN) based methods have shown promise in DTI prediction, they primarily focus on pairwise node interactions and struggle to capture deeper, higher-order dependencies. Furthermore, current hypergraph representation learning faces challenges in handling highly heterogeneous and complex relational pat terns. To address these limitations, we propose MMHC-DTI, a novel hypergraph-based framework for DTI prediction. The framework leverages motif-driven hypergraph construction to characterize complex high-order relationships among drugs. A Multi-scale Motif Hypergraph Convolution (MMHC) module is designed to simultaneously capture local structural rela tionships and long-range interaction dependencies through multi-hop propagation and a scale attention mechanism. To overcome the semantic isolation inherent in individual hyper graph branches, an Inter-branch Semantic Correlation Module (ISCM) is further introduced to facilitate information exchange across disparate semantic subspaces. Experimental results demonstrate that MMHC-DTI consistently outperforms state of-the-art baselines across all key evaluation metrics, validating the effectiveness and superiority of the proposed method in modeling complex DTIs.
|
| |
| 14:45-15:00, Paper TuA16.94 | |
| Failure-Robust Constrained Bayesian Optimization Method for Simulation-Driven Industrial Servo System Modeling |
|
| Fan, Zirui | Nanjing University of Aeronautics and Astronautics (NUAA) |
| Zhu, Haifeng | Nanjing University of Aeronautics and Astronautics, Nanjing, China |
| Wu, Hao | Nanjing University of Aeronautics and Astronautics, Nanjing, China |
| Chen, Jiayuan | Nanjing University of Aeronautics and Astronautics, Nanjing, China |
| Zheng, Ningjing | Nanjing Chenguang Group Co., Ltd |
| Zhang, Tong | Nanjing University of Aeronautics and Astronautics |
| Yi, Changyan | Nanjing University of Aeronautics and Astronautics, Nanjing, China |
Keywords: System Modeling and Control, Intelligent Industrial Systems
Abstract: Accurate system modeling is an essential prerequisite for the high-performance industrial servo control. In particular, permanent magnet synchronous motor driven servo system is recognized as a representative application, where parameter identification is critical. However, traditional simulation-driven identification methods commonly explore parameter regions prone to encounter simulation failures, resulting in numerical divergence, physical inconsistency, and low computational efficiency. To address such issues, this paper proposes a failure-robust constrained Bayesian optimization (FRCBO) framework for industrial servo system modeling. Specifically, FRCBO adopts a novel decoupled dual-surrogate architecture, utilizing a Gaussian process regressor to model the tracking error and a Gaussian process classifier to estimate the simulation feasibility. On top of this, we further design a feasibility-weighted expected improvement acquisition function to penalize risky parameter configurations, so as to guide the search away from divergent and physically inconsistent solutions. Both simulations and real-world experiments on an aerospace servo testbed are conducted, which demonstrate that the proposed method can significantly reduce simulation failures while achieving superior identification accuracy and data efficiency over existing methods.
|
| |
| 14:45-15:00, Paper TuA16.95 | |
| DSHR: Decomposition-Guided Structured Hypergraph Reasoning for Multimodal Emotion Recognition in Conversations |
|
| Dong, Hao | Shanghai University of Electric Power |
| Cao, Yukun | ShangHai University of Electric Power |
| Li, WeiKang | Shanghai University of Electric Power |
| Bai, Jiayin | Shanghai University of Electric Power |
| Peng, Hongwei | Shanghai University of Electric Power |
| Xu, Zirui | Shanghai University of Electric Power |
Keywords: Affective Computing, Deep Learning, Machine Learning
Abstract: Abstract— Multimodal Emotion Recognition in Conversations (MERC) based on textual, acoustic, and visual modalities requires both multimodal understanding and conversational reasoning. However, existing decomposition methods often rely on coarse component partitioning, and current MERC models still lack effective mechanisms to organize heterogeneous emotional cues and capture high-order conversational dependencies. To address these limitations, we propose Decomposition-guided Structured Hypergraph Reasoning (DSHR), which decomposes multimodal cues into unique (U), pairwise (P), consensus (C), and synergistic (S) components. Based on these components, DSHR constructs consensus and synergistic hyperedges, while using modality-specific discrepancies to suppress unreliable connections. In this way, DSHR explicitly links representation decomposition with relational structure construction. Experiments on two benchmark datasets demonstrate the effectiveness, stability, and generalizability of DSHR. Compared with large-scale PLM/LLM-based methods, DSHR offers a lightweight and interpretable alternative without relying on expensive instruction-tuned language models.
|
| |
| 14:45-15:00, Paper TuA16.96 | |
| Motif: Hierarchy-Aware Diffusion for Topology-Preserving Molecular Design |
|
| Ma, Zhongxian | XinJiang University |
| Zhao, Hongtian | Xinjiang University |
Keywords: Deep Learning, Generative AI, Biometric Systems and Bioinformatics
Abstract: A primary bottleneck in discrete molecular graph diffusion is maintaining topological coherence. Standard homogeneous noise schedules treat all graph elements equally, which often causes severe global structure degradation (e.g., ring cleavage) at high noise levels. In response, we present Hierarchy-Aware Diffusion for Topology-Preserving Molecular Design (Motif), a framework that leverages the Bemis–Murcko scaffold hierarchy as a guiding structural prior. Central to our approach is a Bipartite Noise schedule that distinctly regulates the diffusion dynamics for scaffolds versus decorators. By preserving a higher signal-to-noise ratio for core scaffolds, Motif guarantees a coarse-to-fine generation paradigm, anchoring the global topology prior to local refinement. Additionally, we introduce Topological Constraint Reinforcement (TCR), a customized reconstruction objective designed to counteract sparsity-induced training imbalances by selectively routing gradients to critical topological substructures. Empirical results across standard multi-conditional polymer and small-molecule benchmarks confirm that Motif achieves superior Fréchet ChemNet Distance (FCD) and enhanced property control compared to strong diffusion baselines. We conclude with a comprehensive evaluation of the balance between global structural resilience and local detail accuracy.
|
| |
| 14:45-15:00, Paper TuA16.97 | |
| QueryGaussian: Scalable and Training-Free Open-Vocabulary 3D Instance Retrieval |
|
| Zhu, Xiuyuan | University of Chinese Academy of Sciences |
| Lu, Ke | University of Chinese Academy of Sciences |
| Yang, Zijie | State Key Laboratory of Communication Content Cognition, People’s Daily Online |
| Yue, Chao | University of Chinese Academy of Sciences |
| Xue, Jian | University of Chinese Academy of Sciences |
| Dongming, Zhang | State Key Laboratory of Communication Content Cognition, People's Daily Online |
Keywords: Image Processing and Pattern Recognition, Machine Vision, Multimedia Computation
Abstract: Efficiently retrieving specific 3D instances from large-scale scenes via natural language prompts remains a formidable challenge in multimedia analysis. Existing approaches predominantly adhere to a ``scene-level embedding'' paradigm, which necessitates distilling high-dimensional semantic features into every 3D primitive. This strategy suffers from a fundamental architectural bottleneck: the memory and computational costs scale linearly with scene complexity, inevitably triggering Out-Of-Memory (OOM) failures in city-scale environments. To dismantle this barrier, we propose QueryGaussian, a training-free framework enabling expeditious and scalable open-vocabulary 3D instance retrieval. Diverging from holistic semantic distillation, QueryGaussian employs a novel Instance-Level Query Mechanism that rigorously decouples semantic understanding from geometric representation. Specifically, we leverage pre-trained 2D vision models to interpret user prompts and lift segmentation masks into 3D via a concurrent maximum-weight association strategy, ensuring strict semantic-visual consistency. To mitigate projection ambiguity, we introduce a temporal fusion module with multi-stage adaptive density clustering. Experimental results demonstrate that QueryGaussian not only matches the accuracy of state-of-the-art methods but also delivers a decisive efficiency leap—reducing GPU memory usage by over 70% and accelerating inference by 180x. Crucially, QueryGaussian enables expeditious instance retrieval on city-scale scenes (containing tens of millions of Gaussians) on consumer-grade hardware.
|
| |
| 14:45-15:00, Paper TuA16.98 | |
| STFusion-Net: Spatio-Temporal Multimodal Deep Reinforcement Learning for Humanoid Robots Ladder Grasping |
|
| Gao, Xue | Harbin Engineering University |
| Zhao, Guodong | Harbin Engineering University |
| Liu, Mingshuo | Harbin Engineering University |
Keywords: Environmental Sensing, Robotic Systems, Reinforcement Learning
Abstract: To address the challenges of humanoid robots performing inclined ladder grasping tasks in complex and dynamic environments, this paper proposes a Spatio-Temporal Attention-based Multimodal Fusion Deep Reinforcement Learning framework (STFusion-Net). Specifically, a channel attention mechanism is introduced in the visual encoding stage to enhance critical ladder-step features. A spatiotemporal attention fusion module is further designed to model cross-modal interactions among visual observations, joint angles, and IMU signals. The fused representations are then integrated into a Dueling Deep Q-Network to enable stable policy learning. The proposed method is evaluated in the Webots simulation environment against unimodal baselines (vision-only and joint-only) as well as a simple concatenation-based fusion approach. Experimental results demonstrate that STFusion-Net achieves the highest grasping success rates in both static and dynamic scenarios (99% and 90%, respectively), while exhibiting more stable performance. These results indicate that STFusion-Net can effectively leverage multimodal information, providing robust policy guidance for high-precision motion execution and enabling reliable perception and decision-making for humanoid robots in complex environments.
|
| |
| 14:45-15:00, Paper TuA16.99 | |
| R2Track: Robust Vision-Language Tracking Via Reasoning-Aware MLLM Adaptation |
|
| Liu, Xuexin | Institute of Automation, Chinese Academy of Science, Chinese Academy of Sciences |
| Zou, Zhuojun | Institute of Automation, Chinese Academy of Sciences |
| Lin, Chang | Institute of Automation, Chinese Academy of Sciences |
| Lei, Xiru | CASIA |
| Hao, Jie | Institute of Automation, Chinese Academy of Sciences |
Keywords: Human-Machine Interaction, Image Processing and Pattern Recognition, Multimedia Computation
Abstract: Vision-Language Tracking aims to locate a specified target within a video sequence based on a natural language description. However, the performance and generalization of existing methods are limited by the lack of linguistic diversity in training data, especially when handling implicit, reasoning-based instructions that are common in real-world scenarios. To address this, we extend existing benchmarks with reasoning-oriented descriptions, resulting in a reasoning corpus for training and the textbf{ReasonTrack-Bench} test set of 882 manually verified sequences for evaluation. We also propose textbf{R2Track}, a underline{textbf{R}}easoning-aware and underline{textbf{R}}obust underline{textbf{T}}racking framework integrating a Multimodal Large Language Model (MLLM) adapter. This adapter functions as a language interpreter, translating complex queries into simplified cues for a downstream tracker. The adapter is trained via a two-stage strategy of Supervised Fine-Tuning (SFT) and Group Relative Policy Optimization (GRPO) to enhance localization accuracy and language understanding. Experiments on ReasonTrack-Bench show R2Track significantly outperforms existing methods, demonstrating superior generalization to diverse and complex language.
|
| |
| 14:45-15:00, Paper TuA16.100 | |
| Research on Decision-Making of Dual-Channel Green Supply Chain Considering Government R&D Subsidies and Power Structures |
|
| Pan, Huaiyi | Beijing Information Science and Technology University |
| Hu, Yu sheng | Beijing Information Science and Technology University |
|
|
| |
| 14:45-15:00, Paper TuA16.101 | |
| DWRNet: Directional Wavelet Refinement for Boundary-Aware Polyp Segmentation |
|
| He, Jiaxin | Donghua University |
| Wang, Shaoyu | Donghua University |
| Fu, Haitao | Donghua University |
| Wan, Hong | Donghua University |
| Shi, Xiujin | Donghua University |
| Qin, Zhidong | Donghua University |
Keywords: Image Processing and Pattern Recognition, Medical Informatics, Deep Learning
Abstract: Accurate polyp segmentation is essential for computer-aided diagnosis, as precise boundary delineation directly affects clinical assessment. However, this task remains challenging due to weak and irregular lesion boundaries, as well as interference from mucosal textures and specular highlights. Existing methods have improved contextual representation but often lack explicit mechanisms to capture boundary-sensitive structures, particularly orientation-dependent high-frequency responses. To address this limitation, we propose DWRNet, a boundary-aware segmentation framework that integrates directional wavelet refinement with edge-guided cross-level feature interaction. Specifically, shallow features are decomposed into orientation-specific subbands, followed by pixel-wise cross-band competition to suppress inconsistent responses while preserving contour-related structures. In addition, an edge-aware cross-level channel attention module is introduced to improve the alignment between structural details and semantic features.Experimental results on five public benchmarks demonstrate that DWRNet achieves competitive performance, with consistent improvements in challenging scenarios involving weak boundaries and complex backgrounds.
|
| |
| 14:45-15:00, Paper TuA16.102 | |
| Outcome-Conditioned Spectral Manifolds for Efficient Exploration in Reinforcement Learning |
|
| Hao, Mingxin | Xi'an Jiaotong University |
| Liang, Yuchen | Xi'an Jiaotong University |
| Liu, Yuehu | Xi'an Jiaotong University |
Keywords: Reinforcement Learning, Artificial Social Intelligence, System Modeling and Control
Abstract: Intrinsic reward is a method to solve the sparse reward problem in reinforcement learning. We propose an efficient spectral-based exploration mechanism that utilizes spectral uncertainty extracted from historical success and failure experiences as intrinsic rewards. Specifically, a Tri-Model Architecture is designed to construct distinct spectral manifolds, smoothly evolving the exploration signal from global novelty search to goal-directed exploitation. As data accumulates, a contrastive spectral guidance mechanism—utilizing the ratio of spectral uncertainties between failure and success manifolds—steers the agent toward successful dynamics while effectively suppressing known failure modes. Our method applies Random Fourier Features to explicitly map the state-action space into a Reproducing Kernel Hilbert Space, providing a closed-form quantification of uncertainty through efficient linear algebra operations, without the need to train additional auxiliary neural networks to generate intrinsic rewards. This computational paradigm avoids complex non-linear network updates and inference processes, significantly reducing computational overhead. Experimental results on continuous control tasks with sparse rewards demonstrate that our method yields substantial improvements in terms of sample efficiency and convergence stability.
|
| |
| 14:45-15:00, Paper TuA16.103 | |
| Dynamic Non-Equilibrium Optimal Transport and Implicitly Cooperative MPC for Multi-AGV Coordination (I) |
|
| Wu, Xiwei | The Hong Kong Polytechnic Univeristy |
| Wu, Wei | The Hong Kong Polytechnic University |
| Huang, George Q. | The Hong Kong Polytechnic University |
| Xiao, Bing | Northwestern Polytechnical University |
Keywords: Game Theory and Multi-Agent Systems, Swarm Intelligence, Cooperative Systems and Control
Abstract: The integrated coordination of task assignment and trajectory planning for multi-automated guided vehicle (AGV) systems in dynamic environments remains a fundamental challenge, primarily due to the tight coupling between discrete decision-making and continuous vehicle dynamics. This paper presents a macroscopic-to-microscopic control framework based on dynamic non-equilibrium optimal transport (DNE-OT). By mapping the discrete multi-AGV system into the Wasserstein space, the spatio-temporal planning problem is formulated as a KL-regularized dynamic action minimization, from which a modified Hamilton-Jacobi equation is derived through first-order optimality conditions. For scalable real-time execution, a globally informed local model predictive control (MPC) is developed using instantaneous Sinkhorn dual potentials. A gauge-invariant normalization makes the resulting cooperation field well defined and yields a dual-weighted combination of local task directions. Furthermore, under the stated feasibility and velocity-alignment conditions, a Wasserstein-distance-based Lyapunov analysis establishes asymptotic convergence of the ideal continuum flow to a stationary task distribution. Simulation results demonstrate the adaptability and favorable performance of the proposed method.
|
| |
| 14:45-15:00, Paper TuA16.104 | |
| JMERF-Diff: Jump-Enhanced Multi-Timestep Energy-Relaxed Fixed-Point Diffusion for Inverse Problems |
|
| Meng, Yuchao | South China University of Technology |
| Zhang, Haoze | University of Washington |
| Yu, Haile | Southwest Jiaotong University |
| Zhang, Yangmiao | University of Electronic Science and Technology of China |
| Liang, Lingyu | South China University of Technology |
Keywords: Image Processing and Pattern Recognition, Generative AI, Deep Learning
Abstract: Diffusion models provide powerful learned priors for inverse problems, but effectively integrating them into optimization remains challenging. Existing approaches often face a trade-off between measurement consistency and prior fidelity: strict fixed-point constraints can improve stability but restrict the feasible search space, while purely local denoising updates may insufficiently explore the diffusion manifold. In this paper, we propose Jump-Enhanced Multi-Timestep Energy-Relaxed Fixed-Point Diffusion (JMERF-Diff), a general framework that addresses this trade-off through an energy-driven formulation. JMERF-Diff decomposes posterior reconstruction into a sequential multi-timestep optimization problem, constructs localized denoisers through a jump-and-return mechanism, and replaces exact fixed-point enforcement with a relaxed energy that softly constrains the iterate near the diffusion-induced manifold. To solve the resulting objective, we develop an inner-outer optimization algorithm that combines Halpern-style fixed-point approximation with energy descent. Experiments on FFHQ and ImageNet across diverse linear and nonlinear inverse problems show that JMERF-Diff achieves consistently strong reconstruction performance and outperforms existing diffusion-based baselines in most settings.
|
| |
| 14:45-15:00, Paper TuA16.105 | |
| Adaptive Triage and Knowledge Injection: Fusing SLM Efficiency with LLM Reasoning for Distantly Supervised Relation Extraction |
|
| He, Jingfeng | Xinjiang University |
| Yang, Wenzhong | Xinjiang University |
| Yin, Yabo | Xinjiang University |
| Chen, Junjiang | Xinjiang University |
| Luo, Zongxu | Xinjiang University |
| Jia, Xiangyi | Xinjiang University |
| Xu, Yan | Xinjiang University |
Keywords: Knowledge Acquisition, Generative AI, Deep Learning
Abstract: Distantly Supervised Relation Extraction (DSRE) faces inherent challenges of label noise and complex textual dependencies. Existing single-model approaches typically struggle to handle these challenges effectively. In this paper, we propose K-Fusion, a novel Knowledge-enhanced Fusion framework that introduces a confidence-aware adaptive triage mechanism to integrate Small Language Models (SLMs) with Large Language Models (LLMs). For hard tasks, K-Fusion utilizes a Vector-based Retrieval-Augmented Generation (Vector-RAG) module to retrieve topological facts from comprehensive knowledge bases and injects them into the LLM. This securely grounds the LLM to mitigate hallucinations and resolve ambiguous relation boundaries. Meanwhile, the SLM handles the standard cases. Ultimately, a dynamic probability fusion strategy combines the predictive distributions from both models. Extensive experiments on standard benchmarks, including NYT-10m and Wiki-20m, demonstrate that K-Fusion consistently achieves excellent performance. Our paradigm provides a highly effective and stable solution for relation extraction tasks.
|
| |
| 14:45-15:00, Paper TuA16.106 | |
| Efficient Hierarchical Autonomous Exploration with Temporally Consistent Guidance and Sustained Progress |
|
| Yuan, Zhiyi | Chinese Academy of Sciences, Institute of Automation |
| He, Xiaodong | Chinese Academy of Sciences, Institute of Automation |
| He, Wenhao | Chinese Academy of Sciences, Institute of Automation |
Keywords: Robotic Systems, Modeling of Autonomous Systems
Abstract: Autonomous exploration in large-scale environments is an important task for mobile robots. However, existing exploration methods often suffer from unstable global guidance and greedy local planning, which lead to repeated revisits and inefficient motion. To address these issues, we propose a hierarchical exploration method with progress-aware local planning and direction-regularized global planning based on a dual-resolution map. The local planner suppresses greedy selection of nearby viewpoints and promotes earlier progress toward global guidance. Meanwhile, the global planner stabilizes the ordering of global exploration targets across replanning cycles using directional regularization. Results from repeated experiments across diverse scenes demonstrate that the proposed method effectively improves exploration efficiency.
|
| |
| 14:45-15:00, Paper TuA16.107 | |
| Leveraging VR Robot Games to Facilitate Data Collection for Embodied Intelligence Tasks |
|
| Zhang, Yihan | Shanghai University |
| Huang, Ziyun | Shanghai University |
| Ye, Linqi | Shanghai University |
Keywords: Human-Machine Interaction, Virtual, Augmented, Mixed Reality, Robotic Systems
Abstract: Collecting embodied interaction data at scale remains costly and difficult due to the limited accessibility of conventional interfaces. We present a gamified data collection framework based on Unity that combines procedural scene generation, VR-based humanoid robot control, automatic task evaluation, and trajectory logging. A trash pick-and-place task prototype is developed to validate the full workflow.Experimental results indicate that the collected demonstrations exhibit broad coverage of the state-action space, and that increasing task difficulty leads to higher motion intensity as well as more extensive exploration of the arm's workspace. The proposed framework demonstrates that game-oriented virtual environments can serve as an effective and extensible solution for embodied data collection.
|
| |
| 14:45-15:00, Paper TuA16.108 | |
| Relation-Aware Temporal Aggregation Network for Temporal Knowledge Graph Reasoning |
|
| Si, Ziwei | Hohai University |
| Xu, Guoyan | Hohai University |
| Kang, Xinyue | Hohai University |
Keywords: Representation Learning, Knowledge Acquisition, Neural Networks and their Applications
Abstract: Temporal knowledge graph (TKG) extrapolation aims to predict missing facts at future timestamps based on historical observations. Existing extrapolation methods have made significant progress in global recurrent pattern mining, local temporal evolution modeling, and the fusion of these two aspects, but they still face two major challenges: insufficient interpretability of reasoning results and inadequate modeling of relational semantics in historical information. To this end, we propose a novel TKG extrapolation model called RATAN, a Relation-Aware Temporal Aggregation Network. The model constructs a temporal relational directed graph (tr-digraph) that incorporates both global single-hop and local multi-hop paths, explicitly capturing key historical evolution trajectories for interpretable evidence chains. RATAN subsequently employs global and local dual encoders to model this graph, mining structural and temporal dependencies at different time scales. In the encoding process, a multi-granularity attention mechanism, comprising fact-level attention and relation-level attention, is introduced to enhance the representation of critical historical information from both fact-level and relation-level perspectives. Experimental results on four benchmark datasets demonstrate that RATAN achieves significant performance improvements.
|
| |
| 14:45-15:00, Paper TuA16.109 | |
| DAQ-ACO: A Q-Learning Enhanced Ant Colony Optimization Strategy for DAG Task Scheduling |
|
| Ni, ZheXuan | Guangzhou University |
| Yan, Hongyang | Guangzhou University |
Keywords: Computational Intelligence, Computational Intelligence in Information
Abstract: 复杂应用规模的增加,DAG(有向) 无环图)工作流程已被广泛采用用于建模 科学计算、大数据处理与云计算 具有复杂依赖结构的计算任务。在 高效地实现异构计算环境 调度此类任务以优化执行性能 仍然是改善整体系统的关键挑战 效率。解决传统蚂蚁的局限性 DAG处理中的殖民地优化(ACO)算法 工作流程——例如探索和 利用与局部最优的易感性——这 论文提出了DAQ-ACO,一种增强型ACO算法,满足条件 将Q学习与对偶优化策略相结合。 该方法利用Q学习来缓解 冷启动问题,实现了两者之间的精细平衡 通过适应性蚂蚁选择进行探索与利用 以及动态加权信息素更新 机制。模拟结果表明,比较后 使用标准ACO和AAS-ACO算法cite{b18}, 拟议方法可将任务完成时间缩短至以下 在拥
|
| |
| 14:45-15:00, Paper TuA16.110 | |
| MILP Modeling and Lexicographic Optimization for Flexible Job Shop Scheduling Problem with Transportation and Delivery Constraints |
|
| Bai, Guang | SICHUAN University |
| Jiang, Yuming | School of Computer Science, Sichuan University, Chengdu, 610065, Sichuan, China |
| Zhang, Jianxiong | School of Computer Science, Sichuan University, Chengdu, 610065, Sichuan, China |
| Chen, Yulin | SICHUAN University |
| Hu, Dasha | School of Computer Science, Sichuan University, Chengdu, 610065, Sichuan, China |
| Guo, Bing | School of Computer Science, Sichuan University, Chengdu, 610065, Sichuan, China |
| Zhang, Jinbo | Chengdu Jwell Group Co., Ltd., Chengdu, 610305, Sichuan, China |
| Teng, Lina | Chengdu Jwell Group Co., Ltd., Chengdu, 610305, Sichuan, China |
| Deng, Yifei | Chengdu Jwell Group Co., Ltd., Chengdu, 610305, Sichuan, China |
| Wang, Hao | Chengdu Jwell Group Co., Ltd., Chengdu, 610305, Sichuan, China |
| Ding, Xuefeng | School of Computer Science, Sichuan University, Chengdu, 610065, Sichuan, China |
Keywords: Manufacturing Automation and Systems, Optimization Control, System Modeling and Control
Abstract: 本文研究灵活工作车间排班问题 带有运输与交付约束(FJSP-TD)的 经典调度的扩展,工件必须 不仅在机器之间运输,还能传送到 最终处理后指定的目的地。在 假设运输资源无限,总计 运输时间(TTT)成为一项关键表演 公制与Makespan并列。为了解决这一双目的 我们构造了一个新的混合整数线性 能够统一表征两者的编程(MILP)模型 机间运输和最终交付运输。然后我们 分析 makespan 与 TTT 之间的层级耦合, 揭示 makespan 优化需要全局 操作层级协调,而TTT优化则是 职位层级和本地层面。基于这一发现,词典编纂 提出优化方法:第一阶段最小化 使 makespan 达到其全局最优值,以及第二阶段 在保持最佳完成时长的同时,最小化TTT。 数值实验使用 CP-SAT 进行 求解器。与加权和方法的
|
| |
| 14:45-15:00, Paper TuA16.111 | |
| CAPE: Early Warning for Cloud Control-Plane Attacks with Windowed API Combinations and Context-Aware Re-Ranking |
|
| Tan, Ru | University of Chinese Academy of Sciences |
| Li, Haoyu | Institute of Information Engineering, Chinese Academy of Sciences |
| Wang, Peng | QI-ANXIN Technology Group Inc |
| Wang, Xiao | University of Chinese Academy of Sciences |
| Jin, Ze | Institute of Information Engineering, Chinese Academy of Sciences |
| Zhang, Jinli | Institute of Information Engineering, Chinese Academy of Sciences |
| Liu, Qixu | Institute of Information Engineering, Chinese Academy of Sciences |
Keywords: Cloud, IoT, and Robotics Integration
Abstract: Cloud control-plane attacks often unfold through a small number of high-risk API call combinations, yet defenders must triage them within massive volumes of benign administrative activity. This paper studies an early-warning scenario in which the goal is not full incident reconstruction, but the rapid surfacing of suspicious short-horizon windows for security analyst review under a fixed triage budget. We propose CAPE, a two-stage design that first gates time windows using risky API co-occurrence patterns, and then re-ranks candidate windows with a lightweight, context-aware anomaly score that incorporates principal behavioral features. This design seeks a practical operating point between the expensive full-chain reconstruction and noisy single-stage anomaly detection. Under a strict forward-chronological validation protocol on synthetic CloudTrail logs with injected attacks, CAPE achieves an F1-score of 93.90%, with a false-alert rate of only 0.3 per thousand windows. Under a fixed analyst review budget (Recall@2000), CAPE attains 98.51% attack coverage, outperforming the Rule-only and Anomaly-only baselines by 15.8 and 7.4 percentage points, respectively. Ablation experiments confirm that the context-aware re-ranking mechanism—particularly IP novelty—is critical for extending clean detection coverage beyond high-confidence alerts.
|
| |
| 14:45-15:00, Paper TuA16.112 | |
| Dual-Path Learning for Insider Threat Detection with Hybrid Feature Selection and Temporal-Structural Fusion |
|
| Zhu, Yan | Institute of Information Engineering,Chinese Academy of Sciences |
| An, Ning | Institute of Information Engineering , Chinese Academy of Sciences |
| Gong, Yiru | Institute of Information Engineering,Chinese Academy of Sciences |
| Zhang, Chen | Institute of Information Engineering,Chinese Academy of Sciences |
| Jiang, Bo | Institute of Information Engineering, Chinese Academy of Sciences |
| Lu, Zhigang | Institute of Information Engineering, Chinese Academy of Sciences |
| Tian, Tian | Institute of Information Engineering,Chinese Academy of Sciences |
Keywords: Cybernetics for Informatics, Systems Safety and Security, Deep Learning
Abstract: Insider threats have become one of the most critical challenges for organizations. Existing detection methods suffer from issues such as feature construction redundancy, insufficient integration of structural and temporal modeling, and limited temporal granularity. To address these challenges, we propose a novel detection method that employs a hybrid feature selection strategy to extract 35 features from an initial set of 829 dimensions, reducing the computational overhead for subsequent models. We also introduce a dual-path parallel learning approach, which simultaneously captures the dependencies between features and the temporal characteristics of user behavior, with the integration of these paths facilitated through a gating mechanism. Finally, we incorporate an auxiliary loss computation for highrisk days in anomaly sequence detection. Experiments conducted on the CMU CERT r5.2 dataset show that our method achieves an AUC of 0.991, outperforming existing deep learning methods by 2.2%.
|
| |
| 14:45-15:00, Paper TuA16.113 | |
| Resolving Multi-Granularity Representation Inconsistency: A Geometry-Aware Collaborative Framework for Oriented Object Detection |
|
| Yao, Xin-Wei | Zhejiang University of Technology |
| Dai, QiZheng | Zhejiang University of Technology |
| Bi, XiaoTong | Zhejiang University of Technology |
| Li, Qiang | Zhejiang University of Technology |
| Yang, Kunhua | Zhejiang University of Technology |
Keywords: Image Processing and Pattern Recognition, Deep Learning, Machine Vision
Abstract: Oriented object detection in remote sensing imagery remains challenging due to arbitrary orientations, extreme aspect ratios, and complex backgrounds. In two-stage detectors, performance degradation often arises from representation inconsistency across multiple granularities, including feature extraction, RoI representation, and score ranking. To alleviate these bottlenecks, we propose a geometry-aware collaborative framework built upon Oriented R-CNN. Specifically, the Geometry-aware Context Collaborative Modeling (GCCM) module injects level specific geometric priors into feature recalibration, the Dynamic Adjacent-level Fusion RoI (DAF-RoI) module compensates truncated boundary cues by fusing adjacent finer-level RoI features, and the Quality Estimation Rescoring (QER) head improves ranking by introducing a predicted localization-quality proxy during inference. Under the same 1× training schedule, the proposed framework improves the reproduced Oriented R-CNN baseline on DOTA-v1.0 from 75.22% to 76.28% mAP, with particularly clear gains on structure-sensitive categories such as Harbor (+5.85%), Bridge (+2.42%), Soccer-ball field (+3.53%), and Roundabout (+2.73%). On HRSC2016, the final model further improves the reproduced baseline from 89.19/92.82 to 89.80/94.26 in mAP(07)/mAP(12). These results indicate that enforcing geometric consistency across multiple granularities is effective for structure-sensitive oriented object detection.
|
| |
| 14:45-15:00, Paper TuA16.114 | |
| Complexity-Domain Heartbeat Reconstruction with mmWave Radar |
|
| Zhu, Yuhan | Southern Medical University |
| Li, Shulong | Southern Medical University |
| Ni, Jianyuan | Juniata College |
Keywords: Wearable Computing, Environmental Sensing, Medical Informatics
Abstract: Non-contact heartbeat monitoring using millimeter-wave (mmWave) radar has emerged as a promising approach for continuous healthcare, enabling unobtrusive physiological assessments where traditional contact-based methods are impractical. However, accurate extraction of cardiac signals remains challenging due to severe mode mixing, primarily caused by spectral overlap between the heartbeat fundamental and higher-order respiratory harmonics in conventional frequency-based approaches. To address this limitation, we propose a novel heartbeat reconstruction framework that shifts the separation criterion from the frequency domain to an intrinsic complexity domain, improving robustness against signal entanglement. Specifically, radar echoes are decomposed into intrinsic mode functions (IMFs), which are mapped into a fuzzy entropy space to characterize time-series complexity. By analyzing the first-order difference of the ordered entropy values, an adaptive statistical threshold is derived to identify a reliable classification boundary. This boundary further guides an asymmetric soft fusion strategy to reconstruct cardiac signals without hard truncation, preserving signal continuity and fidelity. Extensive experiments demonstrate that the proposed method significantly outperforms existing baselines, achieving promising accuracy and strong robustness across both sitting and supine postures. Notably, the method operates in a fully training-free manner with ultra-low latency (under 3 seconds on an Intel i5-10500 CPU), making it affordable for real-time deployment on resource-constrained Internet of Things (IoT) edge devices.
|
| |
| 14:45-15:00, Paper TuA16.115 | |
| Traditional Chinese Medicine Hand Acupoint Recognition Based on YOLOv11-Pose with FDConv and Scale-Adaptive Loss |
|
| Xu, Guohuan | South China University of Technology |
| Wen, Guihua | South China University of Technology |
Keywords: Image Processing and Pattern Recognition, Medical Informatics, Deep Learning
Abstract: Acupoints in Traditional Chinese Medicine are core for therapies like acupuncture and tuina. Traditional localization methods, relying on physicians' experience, suffer from large errors and poor consistency due to individual anatomical differences and posture changes, failing to meet standardized and automated needs. To address insufficient small-component feature extraction and poor multi-scale adaptability in hand acupoint key point detection, this paper presents an improved YOLOv11-pose model using the established FDConv module for frequency-diverse features and an SD training loss for scale adaptation. Experiments on our hand acupoint dataset show the model achieves 96.2% AP50, 2.3% NME, and 92.6% PCK@0.2, maintains 80 FPS on RTX 3090, and shows improved robustness in complex scenarios, providing an effective solution for automatic TCM hand acupoint location under reported settings.
|
| |
| 14:45-15:00, Paper TuA16.116 | |
| Isomera V2: A Reproducible Open Software for Benchmarks, Training, and Redundancy Detection of Tables in Data Mesh Architectures |
|
| Oliveira, Cayo | Universidade Federal De Pernambuco |
| Dantas, Jamilson | UFPE |
| Araujo, Jean | Universidade Federal Do Agreste De Pernambuco |
| Matos, Rubens | IFSE |
Keywords: Enterprise Information Systems, Machine Learning, Deep Learning
Abstract: Data Mesh architectures distribute ownership across domain teams, but this autonomy also increases the risk of structural data redundancy: repeated table designs that are difficult to audit manually. Isomera v2 extends the original Isomera benchmark into a reproducible Python workflow that connects to PostgreSQL, materialises relational scenarios as lineage graphs, supports validation before training, exports portable GML (Graph Markup Language) artefacts, and trains reusable detector families. Unlike the previous release, which operated on a fixed benchmark package, the new workflow supports scenario creation from relational sources, candidate filtering, manual or LLM-assisted validation, staged model selection, and reuse of trained pickle families in benchmark replay and deployment. This paper focuses on the relational TPC-DS v2 adaptation. Its main contributions are the reproducible path from relational database evidence to benchmarkable graph-learning artefacts, the integration of validation and filtering into training, and the operational separation between reusable clusters, protocol-selected ranks, and the best-of-all diagnostic route.
|
| |
| 14:45-15:00, Paper TuA16.117 | |
| Temporal-Frequency Multimodal Fusion for Occlusion-Robust Giant Panda Gait Identification |
|
| Jiang, Linzhou | Sichuan Normal University |
| Ren, Zhen | Sichuan Normal University |
| He, Mengnan | Chengdu Research Base of Giant Panda Breeding |
| Luo, Gai | Chengdu Research Base of Giant Panda Breeding |
| Ma, Ying | Chengdu Research Base of Giant Panda Breeding |
| Han, Yiming | Chengdu Research Base of Giant Panda Breeding |
| Gong, Cuifeng | Chengdu Research Base of Giant Panda Breeding |
| Chen, Peng | Chengdu Research Base of Giant Panda Breeding |
| Su, Han | Sichuan Normal University |
Keywords: Biometrics and Applications, Image Processing and Pattern Recognition
Abstract: Gait-based individual identification offers a practical way to recognize giant pandas in infrared videos, where frontal facial views are often unavailable and occlusion and motion blur are common. However, real-world panda gait sequences frequently suffer from vegetation occlusion, long-range imaging, unstable keypoints, and frame-level quality variation, all of which weaken identity discrimination. To address this problem, we treat persistent degradation as a sequence-level reference corruption problem and propose TF-MF Gait, a temporal-frequency multimodal fusion framework for occlusion-robust giant panda identification. The method follows a reference-first design by stabilizing a shared sequence reference before reliability-aware modulation and controlled multimodal fusion of silhouette and skeleton cues. We evaluate the method on PandaGait-Occ, a mixed-source infrared gait dataset containing 69 individuals and 870 sequences with substantial occlusion and low-quality samples preserved. Experimental results show that TF-MF Gait achieves the best overall performance, improving Rank-1 accuracy by 5.07 percentage points over a strong baseline while also producing more stable four-fold results. These results demonstrate the effectiveness of reference-first temporal-frequency multimodal fusion for robust giant panda gait identification under degraded infrared conditions.
|
| |
| 14:45-15:00, Paper TuA16.118 | |
| A Programmable Battery Cycler for Time-Varying Current Profile Testing |
|
| Maciel, Otávio | Universidade Federal De Pernambuco |
| Santana, Marcelo | Universidade Federal De Pernambuco |
| Barros, Edna | Federal University of Pernambuco |
| Maciel, Paulo | UFPE |
Keywords: Electric Vehicles and Electric Vehicle Supply Equipment, System Architecture, Energy Systems
Abstract: This paper presents the design and implementation of a programmable battery cycler capable of executing workload-based testing profiles. The proposed system enables automated test routines and supports the standard constant-current constant-voltage (CC-CV) charging protocol. During operation, it estimates key battery parameters such as capacity and state of charge (SOC). Experimental results under standardized drive cycles demonstrate close agreement between measured and reference current profiles, with root-mean-square error (RMSE) of approximately 40 mA and maximum absolute errors below 60 mA, primarily due to offset in the discharge operational amplifier. Additionally, the dataset generated in this study has been made publicly available. Overall, the results validate the feasibility of the proposed architecture for battery characterization in both industrial and research applications.
|
| |
| 14:45-15:00, Paper TuA16.119 | |
| A Lightweight Large Language Model Framework with Parameter-Efficient Fine-Tuning for Method Name Prediction of Industrial Software (I) |
|
| Ouyang, Boyu | Beijing University of Technology |
| Wang, Weidong | Beijing University of Technology |
| Yuan, Haitao | Beihang University |
Keywords: Generative AI, AI and Applications, Application of Artificial Intelligence
Abstract: Accurate method name prediction is essential for improving code readability and maintainability in industrial software; however, achieving high performance in resource constrained environments remains challenging. Although large language models have demonstrated strong capabilities in code understanding and generation, their substantial computational and deployment costs limit their practicality in real world industrial software scenarios. In this work, we propose a parameter-efficient framework for industrial software that leverages a lightweight large language model with QLoRA based fine-tuning. The model is trained on a large scale dataset of 20K method body–name pairs from industrial software, enabling effective learning of task specific semantic patterns. Experimental results show that the proposed approach improves prediction accuracy from 7.6% to over 40% and achieves competitive performance compared to significantly larger models. These findings demonstrate that lightweight models, when properly fine-tuned, can provide an efficient and scalable solu- tion for method name prediction in industrial software deploy- ment environments. The data and source code used in this study are publicly available at: https://github.com/yu373/lm4mnp.
|
| |
| 14:45-15:00, Paper TuA16.120 | |
| Physics-Augmented Hybrid Deep Learning for Bloodstain Impact Angle Estimation |
|
| Tamang, Sonam | University of Central Oklahoma |
| Paudyal, Anish | University of Central Oklahoma |
| Creecy, James | University of Central Oklahoma |
| Gravel, Craig | University of Central Oklahoma |
| Fu, Jicheng | University of Central Oklahoma |
Keywords: Application of Artificial Intelligence, Machine Learning, Deep Learning
Abstract: Bloodstain Pattern Analysis (BPA) is a critical forensic discipline used to reconstruct crime scenes by analyzing the bloodstain distribution pattern. The bloodstain impact angle is a key parameter used in BPA, traditionally calculated by the geometric ellipse method based on the minor-to-major (W/L) axis ratio of the bloodstain. However, this traditional method is unreliable at high impact angles (e.g., 70° to 90°), where the bloodstain appears almost circular, leading to geometric ambiguity. In this paper, we introduce a physics-augmented hybrid deep learning model for estimating the impact angle of bloodstain patterns. First, individual bloodstains are segmented using a computer vision pipeline. Then, tabular features are extracted and fused with visual features learned by a ResNet-18 Convolutional Neural Network (CNN). A series of experiments was conducted to evaluate the proposed approaches and quantify the contributions of their individual components. Model performance was assessed using both exact classification accuracy and the percentage of predictions falling within ±10° of the ground-truth angle. The ±10° metric was used to account for the continuous nature of bloodstain impact angles. Experimental results demonstrate that the physics-only model achieved strong and comparable performance despite its relatively simple design and minimal computational requirements. Unlike CNN-based approaches, it does not require expensive computing hardware, making it a practical and accessible option for bloodstain impact-angle estimation. Integrating physics-based and CNN-derived features can provide additional improvements, although the most effective fusion strategy depends on image quality. For bloodstain images obtained directly through the fully automated pipeline, without image augmentation or manual intervention, gated late fusion was more robust to image imperfections. In contrast, early fusion achieved the best performance on higher-quality bloodstain images obtained through manual selection.
|
| |
| 14:45-15:00, Paper TuA16.121 | |
| Multi-Platform Propagation Uncertainty Modeling for Fake News Detection |
|
| Zhao, Congyuan | Institute of Information Engineering, Chinese Academy of Sciences, Beijing, China |
| Wei, Lingwei | Institute of Information Engineering, Chinese Academy of Sciences |
| Zhou, Wei | Institute of Information Engineering, Chinese Academy of Sciences, Beijing, China |
Keywords: Representation Learning, Machine Learning, Complex Network
Abstract: The propagation of fake news on social media poses substantial societal harm. Detecting fake news with multi-platform propagation points to a promising direction, however, existing approaches insufficiently explore how the news propagates across platforms. Due to cross-platform heterogeneity, such as platform-specific user behaviors, interaction mechanisms, and moderation policies, propagation structures and observations can vary substantially across platforms, which makes it challenging to jointly model cross-platform consensus and platform-unique variability. To bridge this gap, we propose a novel robust multi-platform propagation structure learning network (RMPSL) to sufficiently learn semantic and structural patterns from incomplete propagation across multiple social platforms. RMPSL employs a shared graph encoder with platform-specific uncertainty estimators to extract platform-adaptive robust features. The platform-specific uncertainty estimators model propagation representations as latent distributions, whose covariance quantifies structure uncertainties across different platforms. We deign a joint objective to align propagation consistency and propagation uncertainty learning. It enables the model to learn robust and platform-adaptive discriminative features for fake news detection. Experiments on two public real-world fake news datasets demonstrate that RMPSL achieves competitive performance over strong baselines. Further analysis shows the greater robustness of RMPSL under propagation-missing scenarios.
|
| |
| 14:45-15:00, Paper TuA16.122 | |
| Representation-Enhanced Relative Preference Learning for LLM-Based Fact Verification |
|
| Sun, Jinyang | Institute of Information Engineering, Chinese Academy of Sciences |
| Wei, Lingwei | Institute of Information Engineering, Chinese Academy of Sciences |
| Zhou, Wei | Institute of Information Engineering, Chinese Academy of Sciences, Beijing, China |
Keywords: Decision Support Systems, Application of Artificial Intelligence, Representation Learning
Abstract: Fact verification is an important task for mitigat ing misinformation and improving the reliability of language technologies. Existing LLM-based methods mainly perform verification through direct label prediction, often enhanced by prompting, decomposition, or retrieval-augmented reasoning. However, they still suffer from label boundary ambiguity, making it difficult to stably distinguish competing labels when decisive factual cues are subtle. To address this issue, we reformulate fact verification as a preference learning problem over the label space and propose Representation Enhanced Relative Preference Learning for Fact Verification (RePref Fact), a framework that captures relative relationships among labels for better verification. Instead of relying only on direct classification, RePref-Fact enables the model to make compar ative judgments over competing labels and thus establish a more stable decision margin. In addition, we design a new joint representation enhancement strategy to improve the informa tiveness and discriminability of learned representations through complementary objectives for representation-label alignment and class-wise separability. Experiments on four datasets show that RePref-Fact achieves superior performance across diverse verification settings. Further analysis demonstrates improved robustness under low-resource and noisy supervision scenarios.
|
| |
| 14:45-15:00, Paper TuA16.123 | |
| Neural Memory ODE-Driven Sequence Modeling with Graph-Aware Fusion for Thoracolumbar Fracture Classification |
|
| Li, Dehan | Sichuan University |
| Ma, Litai | Sichuan University |
| Wang, Xi | Hong Kong University of Science and Technology |
| Deng, Yi | Sichuan University |
| Yi, Zhang | Sichuan University |
| Xu, Lei | Sichuan University |
Keywords: Deep Learning, Machine Vision, Application of Artificial Intelligence
Abstract: Thoracolumbar fractures are challenging to diagnose due to diverse presentations and risks of spinal instability. While CT is the standard modality, current methods often ignore inter-vertebral structural context and label interdependencies. We propose a unified CT-based framework for thoracolumbar fracture classification that jointly models spatial and semantic dependencies. First, a neural memory ODE-based spatial feature extraction module captures long-range vertebral interactions. Second, a label dependency module encodes a prior knowledge graph via a hybrid graph neural network to learn explicit and implicit fracture relationships. A Transformer decoder then synergistically fuses the outputs of both modules through learnable queries. Furthermore, a joint loss function combining Balanced Asymmetric Loss and Multi-Level Semantic Discrimination mitigates class imbalance and label similarity. Extensive experiments on a clinical dataset demonstrate the superior performance and clinical potential of our method.
|
| |
| 14:45-15:00, Paper TuA16.124 | |
| Towards Robust Reinforcement Learning for Small-Scale Language Model Agents |
|
| Haque, Md Rezwanul | University of Waterloo |
| Islam, Md. Milon | University of Waterloo |
| Karray, Fakhreddine | University of Waterloo |
Keywords: Hybrid Models of Computational Intelligence, Adaptive Systems, Agent-Based Modeling
Abstract: The alignment of Small Language Models (SLMs) in the 70--500M parameter range using reinforcement learning is often considered unstable, though the underlying failure mechanisms have not been systematically investigated. In the State-of-the-Art (SOTA) research, fifteen (model, corpus) configurations were trained using Proximal Policy Optimization (PPO). The experiments included Pythia-70M, 160M, 410M and SmolLM2-135M, 360M on the TinyStories, CNN/DailyMail, and Wikitext-103 corpora. Three reproducible failure modes were identified in small-scale language models: silent LoRA parameter freezing in standard PEFT/TRL pipelines, numerical overflow in importance ratios when using bfloat16, and catastrophic policy collapse due to reward-model error. These issues were addressed using a merge-and-reinitialize adapter technique, float32 precision during PPO updates, and a three-layer safety mechanism comprising reward whitening, importance-ratio guarding, and weight rollback. In this paper, a capacity-headroom hypothesis is proposed, which states that PPO performance at the SLM scale depends on both a fluent supervised model (PPL<20) and a discriminative reward signal, rather than on the number of model parameters. The proposed system converged stably in all experiments and improved preference win rate over the SFT baseline in configurations with a fluent prior and an informative reward signal. Furthermore, it outperformed instruction-tuned baselines while requiring significantly less training data. All checkpoints, preference datasets, and training scripts are publicly released.
|
| |
| 14:45-15:00, Paper TuA16.125 | |
| Multi-Level Attention-Guided CNN-Autoencoder and BiLSTM Model for Health Anomaly Detection in WBANs |
|
| Agrawal, Hardik | BITS Pilani, Hyderabad Campus, India |
| Bose, Shreea | BITS Pilani, Hyderabad Campus, India |
| Hota, Chittaranjan | BITS Pilani, Hyderabad Campus, India |
Keywords: Human-centered Learning, Machine Learning, Wearable Computing
Abstract: Wireless Body Area Networks (WBANs) have become increasingly prevalent in the medical field to enable wearable or implanted sensors to continuously monitor physiological data. However, the reliability of these systems can be compromised by anomalous data arising from faulty sensors, irregular measurements, or malicious interference. Such anomalies may occur as isolated abnormal readings (point anomalies) or as correlated deviations across multiple signals (contextual anomalies), both of which can lead to misdiagnosis or delayed interventions if not promptly identified. To overcome this problem, we propose a hybrid deep learning architecture that combines a bidirectional long short-term memory (BiLSTM) network augmented with self-attention with a convolutional autoencoder. The autoencoder captures spatial representations of sensor readings and flags point anomalies based on reconstruction errors, while the BiLSTM with attention models temporal dependencies and inter-sensor relationships for contextual anomaly detection. Experiments conducted on the MIMIC-IV dataset, with synthetic anomalies injected to simulate sensor faults and irregular physiological patterns, demonstrate that the proposed framework achieves high accuracy: the CNN-autoencoder reaches 94.2% and the BiLSTM-attention achieves 97.3%. The results presented here illustrate how spatiotemporal deep learning models may provide robust, reliable, and low-latency anomaly detection in WBAN-based healthcare systems.
|
| |
| 14:45-15:00, Paper TuA16.126 | |
| Performance Evaluation of a CMS under Legitimate Traffic Peaks and DDoS-Like Load Using Markov Chains |
|
| Galvão, Nadianne | Universidade Federal De Sergipe |
| Matos, Rubens | IFSE |
| Araujo, Jean | Centro De Informática, Universidade Federal De Pernambuco |
Keywords: Quality and Reliability Engineering, System Modeling and Control, Discrete Event Systems
Abstract: Content Management System (CMS) applications must maintain acceptable performance and availability under highly variable traffic conditions, including both legitimate demand surges and malicious overload events. This work evaluates the performance and operational resilience of a CMS-based e-commerce application under legitimate traffic peaks and DDoS-like load using Discrete-Time Markov Chains (DTMCs). To this end, a WordPress/WooCommerce environment was deployed using Docker Compose and subjected to load scenarios ranging from 1k to 50k target users, considering configurations with and without a page cache. Performance and infrastructure metrics, including p95 latency, 5xx error rate, throughput, and CPU usage, were collected and aggregated into time windows. Each window was labeled as one of three operational states: Normal (N), Peak/Stress (P), and Degraded/Collapse (D). The results indicate that caching improves stability under moderate loads, but does not prevent degradation under extreme loads. In the cached scenarios, the stationary probability of Degraded/Collapse becomes dominant from 5k target users onward, reaching pi_D = 52.57 at 50k. These findings suggest that DTMC-based modeling can support the probabilistic assessment of operational resilience and collapse risk in CMS-based applications.
|
| |
| 14:45-15:00, Paper TuA16.127 | |
| HDI-Diff: A Hierarchical Semantic Decoupling Framework for Controllable Industrial Anomaly Generation Via Bi-Directional Interaction |
|
| Peng, Peng | South China Normal University |
| Wu, Wenliang | South China Normal University |
| Liu, Shouqiang | South China Normal University |
Keywords: Image Processing and Pattern Recognition, Generative AI, Deep Learning
Abstract: Few-shot industrial anomaly generation aims to synthesize realistic defect images from limited samples to bridge the data gap in automated quality inspection. However, existing diffusion-based methods typically learn a monolithic embedding that entangles background texture, defect morphology, and severity. Such entanglement leads to severe background con- tamination and a lack of fine-grained controllability during the synthesis process. In this paper, we propose HDI-Diff, a novel hierarchical semantic decoupling framework designed to resolve these bottlenecks. First, we introduce a Semantic Object Block (SOB) that decomposes the anomaly concept into a Hierarchi- cal Defect Descriptor (HDD) across three disentangled levels: background texture, defect type, and severity. An orthogonal projection constraint is applied to ensure that defect features evolve exclusively within the orthogonal complement of the background space, mathematically guaranteeing semantic isola- tion. Second, a Mask-Aware Guided Cross-Attention (MA-GCA) mechanism implements bi-directional spatial routing within the U-Net, effectively confining anomaly features to designated regions to eliminate feature leakage. Third, a Texture-Frequency Alignment (TFA) loss provides spectral-domain supervision by separately regularizing low-frequency structural fidelity and high-frequency textural realism via 2D FFT decomposition. Crucially, this decoupled architecture enables the smooth in- terpolation of defect intensity through a continuous severity factor α, facilitating the generation of diverse edge-case samples. Extensive experiments on the MVTec AD dataset demonstrate that HDI-Diff achieves state-of-the-art generation quality and significantly bolsters downstream anomaly detection and local- ization performance under challenging few-shot settings.
|
| |
| 14:45-15:00, Paper TuA16.128 | |
| Structure-Guided Online Vectorized HD Map Construction with Instance-Aware Querying and Junction-Aware Curve Refinement |
|
| Keke, Tian | University of Electronic Science and Technology of China |
| Wen, Tao | University of Electronic Science and Technology of China |
| Yizhuo, Ma | University of Electronic Science and Technology of China |
| Ke, Qin | University of Electronic Science and Technology of China |
Keywords: Autonomous Vehicle, Agent-Based Modeling, Application of Artificial Intelligence
Abstract: Online vectorized high-definition (HD) map construction is a key perception component for autonomous driving systems, requiring both accurate localization of map elements and stable geometric reconstruction in complex traffic scenes. However, existing DETR-style detection-based methods often suffer from insufficient instance-aware query initialization and unstable point-set decoding around intersections, dense structures, and sharp turns. To address these issues, we propose MAT-Map, a structure-guided framework for online vectorized HD map construction. Specifically, we design a Mask-Activated Dynamic Instance Decoder (MADD), which predicts BEV instance masks and injects mask-derived instance support into query initialization through mask-weighted pooling and channel-gated fusion, thereby improving instance-aware query initialization in cluttered scenes. We further introduce a Junction-aware Piecewise Bézier Head (JPB-Head), which leverages learned junction heatmaps and tangent fields to guide segment-wise curve refinement and piecewise cubic Bézier reconstruction for more stable and topologically coherent vector outputs. Experiments on nuScenes and Argoverse 2 demonstrate that the proposed method consistently improves strong baselines and produces more stable and visually coherent vectorized map predictions.
|
| |
| 14:45-15:00, Paper TuA16.129 | |
| An Adaptive Parameter Tuning Method Based on PSO-FNN for ARS under GNSS Outages (I) |
|
| Huang, Maoxing | School of Space Exploration, University of Chinese Academy of Sciences |
| Zhang, Qian | Institute of Engineering Thermophysics, Chinese Academy of Sciences |
| Qi, Fei | Institute of Engineering Thermophysics, Chinese Academy of Sciences |
| Meng, Wenyue | Institute of Engineering Thermophysics, Chinese Academy of Sciences |
| Zheng, Huilong | Institute of Engineering Thermophysics, Chinese Academy of Sciences |
Keywords: Hybrid Models of Neural Networks, Fuzzy Systems, and Evolutionary Computing, Neural Networks and their Applications, Swarm Intelligence
Abstract: To address the issue that the parameters of conventional Attitude Reference Systems (ARS) rely on empirical tuning and lack adaptive adjustment capabilities in complex dynamic environments, a dynamic parameter self-adaptive tuning approach based on Particle Swarm Optimization and a Feedforward Neural Network (PSO-FNN) is proposed. By establishing a nonlinear mapping between the motion intensity of the carrier and the cutoff frequency, online adaptive adjustment of key parameters for attitude estimation is achieved. During the parameter optimization process, non-negativity and monotonicity constraints on the cutoff frequency are introduced to incorporate physical prior knowledge into the data-driven framework, thereby enhancing the model’s interpretability and stability. On this basis, a two-stage tuning framework that integrates offline optimization and online implementation is developed, enabling real-time updating of dynamic parameters. Comparative validation is performed using quadrotor flight test data, with GNSS outages artificially introduced during the offline simulation stage. Experimental results demonstrate that, compared with the pure inertial solution and the dynamic classification-based gain scheduling method, the proposed approach reduces attitude estimation errors by 69.9% and 19.3%, respectively, while exhibiting improved dynamic response and enhanced stability under aggressive maneuvers. The results indicate that the proposed method demonstrates strong robustness and significant application potential in complex dynamic environments, particularly under GNSS-degraded conditions.
|
| |
| 14:45-15:00, Paper TuA16.130 | |
| U-Cache: Accelerating Long-Sequence Generative Recommendation Via User-Centric KV Cache Pooling and Management |
|
| Zeng, Chuanming | University of Science and Technology of China |
| Qiu, Ruiqi | Huawei |
| Hu, Minsi | Huawei |
Keywords: System Architecture, Generative AI, Machine Learning
Abstract: Long-sequence generative recommendation makes per-user KV too large for device-only residency; prefix-centric LLM caches also miss user-specific reuse across scoring calls. textbf{U-Cache} pools KV in host DRAM under UserID (textbf{U-Pool}), stages it with DMA, and prefetches layer-wise to overlap transfer with attention---without changing the GR model or training. On HSTU-class serving at 8K-token histories, U-Cache cuts TTFT by up to textbf{71.7%} vs. a vLLM-style baseline and improves QPS by up to textbf{4.05times}, showing that user-grained KV lifecycle management is viable for real-time long-history deployment.
|
| |
| 14:45-15:00, Paper TuA16.131 | |
| A Two-Stage Neuro-Evolution Framework Integrating Generative Graph Grammar and Neuro-Evolution of Augmenting Topologies for Neural Architecture Search and Soft-Robot Design (I) |
|
| Hasibuan, Karimuddin Hakim | Kyushu Institute of Technology |
| Ohnishi, Kei | Kyushu Institute of Technology |
Keywords: Evolutionary Computation, Heuristic Algorithms, Hybrid Models of Neural Networks, Fuzzy Systems, and Evolutionary Computing
Abstract: Neuro-evolution has shown strong potential for automating the design of neural networks and robot morphologies, but a single encoding rarely provides both scalable global exploration and fine-grained local refinement. This paper presents GGG-NEAT, a two-stage framework that combines Kitano’s Generative Graph Grammar (GGG), a compact developmental encoding used here for global exploration, with Neuro-Evolution of Augmenting Topologies (NEAT), whose speciation and historical markings support careful refinement. Stage 1 evolves grammar rule sets whose recursive derivation produces cell architectures for NAS-Bench-201 or voxel-based soft robots for EvoGym. The best individuals are then converted into NEAT genomes and fine-tuned in Stage 2 with Lamarckian local search. Across 20 independent runs, GGG-NEAT reaches the global optimum of NAS-Bench-201 on CIFAR-10, CIFAR 100, and ImageNet16-120 in every run, first hitting the optimum after roughly 500 evaluations on the CIFAR datasets, about 3% of the 15,625-architecture space. On EvoGym, evaluated with real PPO training and reported as mean and standard deviation over 20 seeds, the full framework beats a plain two stage pipeline on six of the eight tasks where both produce a learning signal, with the largest gains on Carrier (+4.21) and Walker (+2.22). On the two remaining tasks, Catcher and Lifter, the sparse task reward defeats both variants. A dense shaped reward used during search restores progress and yields bodies that track and touch the target object, although their final scores remain below the task references. Overall, the main benefit of the combination is reliable and evaluation-efficient search rather than raw peak performance.
|
| |
| 14:45-15:00, Paper TuA16.132 | |
| Continuous Dynamic Facial Action Unit Intensity Estimation with Mixture of Experts |
|
| Gan, Wei | University of Chinese Academy of Sciences |
| Lu, Ke | University of Chinese Academy of Sciences |
| Yan, Li | Pengcheng Laboratory |
| Li, Yuxuan | Teachers College, Columbia University |
| Jiang, Dongmei | Pengcheng Laboratory |
| Xue, Jian | University of Chinese Academy of Sciences |
Keywords: Affective Computing, Cognitive Computing, AI and Applications
Abstract: Accurate estimation of continuous facial action unit (AU) intensities from videos remains challenging due to the strong spatial heterogeneity of AUs and their diverse temporal dynamics. To address these issues, we propose AU-MoE, a spatio-temporal mixture-of-experts framework for dynamic and continuous AU intensity estimation. In spatial domain, a spatial texture MoE adaptively selects among multiple differential convolution experts to capture fine-grained, region-specific, and scale-aware AU textures. In temporal domain, a temporal MoE composed of dilated convolution experts models AU dynamics at different temporal scales, enabling flexible adaptation to varying motion rhythms. Furthermore, we design a comprehensive objective function that combines weighted regression loss, direction consistency constraint, and expert load balancing to ensure accurate, stable, and well-distributed learning. Extensive experiments on DISFA and FEAFA demonstrate that AU-MoE achieves superior performance compared with state-of-the-art methods.
|
| |
| 14:45-15:00, Paper TuA16.133 | |
| An Intraoral Photograph–Based Personal Identification Framework Integrating AR Glasses and Deep Neural Networks |
|
| Wang, Zhenfei | University of Yamanashi |
| Hishikawa, Tomoya | University of Yamanashi |
| Zhu, Zhenyang | University of Yamanashi |
| Kubo, Kotaro | Tokyo Dental College |
| Mao, Xiaoyang | University of Yamanashi |
Keywords: Virtual and Augmented Reality Systems, Wearable Computing, AI and Applications
Abstract: Dental identification is effective for victim identification after large-scale disasters, yet manual matching of postmortem and antemortem records can require substantial time and trained personnel. This paper presents an AR-glasses-based system, in which a photographic guidance interface helps non-experts capture standardized intraoral photographs for a deep-learning-based identification backend. Two guidance UIs are implemented: (1) a 3D dentition model overlay and (2) a grid overlay, combined with a hands-free voice-controlled workflow for capture, preview, and transmission to an identification server. In a user study with six novice photographers and three enrolled subjects, each photographer acquired intraoral photographs under three conditions (no UI, grid overlay, and 3D model overlay). Identification performance was evaluated using Top-1 and Top-3 accuracy, and user workload was assessed using NASA-RTLX and post-experiment questionnaires. The 3D model overlay achieved the highest mean Top-1/Top-3 accuracy (83.3%/92.6%), compared with the grid overlay (79.6%/85.2%) and no UI (61.1%/64.8%). Workload ratings (e.g., effort and frustration) were lowest with the 3D model overlay, and questionnaire responses suggested improved understanding of distance and alignment. Although statistical significance was limited by sample size, the results indicate that an intuitive 3D overlay can improve practical candidate retrieval (Top-3) and reduce user burden, supporting rapid intraoral photography in disaster scenarios.
|
| |
| 14:45-15:00, Paper TuA16.134 | |
| DART-VLN: Test-Time Memory Decay and Anti-Loop Regularization for Discrete Vision-Language Navigation |
|
| Zhang, Shaoheng | Harbin Institute of Technology, Shenzhen |
| Li, Zhichen | Harbin Institute of Technology (Shenzhen) |
| Ma, Guangfu | Harbin Institute of Technology, Shenzhen |
| Mei, Jie | Harbin Insitute of Technology, Shenzhen |
Keywords: AI and Applications, Modeling of Autonomous Systems, Machine Vision
Abstract: Memory-based agents for discrete vision-language navigation (VLN) operate under partial observability and may exhibit systematic inference-time failures even with strong pretrained backbones. This paper addresses two recurring problems: stale historical evidence during memory readout and inefficient local backtracking during action selection. We present DART-VLN, a training-free inference-time framework that combines Test-Time Memory Decay, which reweights stale and redundant memory slots without modifying their stored content, with Anti-Loop Regularization, a lightweight nexthop penalty that discourages immediate reversals. DART-VLN introduces no learnable parameters and leaves the navigation backbone unchanged. Experiments on R2R and REVERIE showed that memory decay preserved or improved task performance while reducing runtime. The addition of anti-loop regularization further shortened trajectories, reduced local backtracking, and achieved the best overall balance between navigation quality and efficiency among the evaluated GridMM variants. These results indicate that lightweight inference-time control can improve the reliability and efficiency of memorybased discrete VLN without retraining.
|
| |
| 14:45-15:00, Paper TuA16.135 | |
| Contrastive-Aware Multimodal Sentiment Analysis with Bidirectional Visual Extraction and Dynamic Attention Fusion |
|
| Zhenming, Li | Dalian University of Technology |
| Yuhao, Zhang | Dalian University of Technology |
| Jiyu, Tian | Dalian University of Technology |
| Shuangjian, Li | Dalian University of Technology |
| LingLing, Fang | Liaoning Normal University |
| Kechadi, Mohand Tahar | University College Dublin |
| Chen, Liming | Dalian University of Technology |
Keywords: Affective Computing, Human Perception in Multimedia, AI and Applications
Abstract: Multimodal sentiment analysis aims to infer human emotions by jointly modeling heterogeneous signals from text, audio, and visual modalities. Despite recent progress, existing approaches often suffer from limited exploitation of fine-grained visual representations and suboptimal fusion strategies that fail to adapt to varying contextual cues across modalities. In addition, insufficient cross-modal representation alignment further restricts effective multimodal interaction. To address these challenges, we propose a contrastive-aware multimodal sentiment analysis framework with bidirectional visual extraction and dynamic attention fusion. Specifically, we introduce a bidirectional visual extraction mechanism that captures complementary spatial dependencies along both horizontal and vertical axes from video frames, enabling a more comprehensive characterization of facial expressions and visual context. We design a contrastive learning strategy is incorporated to enhance cross-modal representation consistency and discriminability. In addition, we develop a dynamic attention fusion to adaptively assign modality-specific importance weights conditioned on the input context, thereby facilitating effective cross-modal interaction and robust multimodal representation learning. Extensive experiments conducted on three widely used benchmark datasets—CMU-MOSI, CMU-MOSEI, and CH-SIMS—demonstrate that the proposed approach consistently outperforms state-of-the-art methods, achieving an accuracy improvement of approximately 3%. These results validate the effectiveness of contrastive-aware representation alignment, bidirectional visual extraction, and dynamic multimodal fusion for robust sentiment prediction.
|
| |
| 14:45-15:00, Paper TuA16.136 | |
| VulnGuard: A Tool-Augmented Distillation Paradigm for Trustworthy and Efficient Vulnerability Repair on Edge Devices |
|
| Yuan, Zisu | Nanjing University of Science and Technology |
| Li, Xiaochao | Nanjing University of Science and Technology |
| Li, Qianmu | Nanjing University of Science and Technology |
Keywords: Information Assurance and Intelligence, Cyber Systems and Engineering, Cyber-physical systems
Abstract: With the growth of IoT and edge computing, ensuring trustworthy vulnerability repair on resource-constrained devices has become a pressing challenge. Edge systems such as industrial controllers, smart medical devices, and automotive control units operate with limited resources and are constantly exposed to cyber threats, which makes timely and reliable repair essential. Although large language models (LLMs) show strong code repair capabilities, their high computational demand and potential “hallucination” issues limit direct deployment on edge devices. To address these challenges, we introduce the Tool-Augmented Distillation (TAD) paradigm and design the VulnGuard framework, where a static analysis tool (CodeQL) serves as a deterministic arbiter to ensure reliable knowledge transfer between teacher and student models. Through a generation–arbitration distillation pipeline, only verified “golden knowledge” is retained for training, bridging both the resource and trust gaps. Experiments show that the lightweight student model Qwen2.5-Coder-7B, distilled under TAD, significantly outperforms baselines in vulnerability detection and repair. VulnGuard achieves an F1-score of 0.755 in detection and reduces CodeQL alerts by 38.8% in repair, with the largest gains in C++. These results demonstrate a practical solution for reliable edge vulnerability repair and reveal TAD’s potential in building lightweight, trustworthy AI models for safety-critical applications.
|
| |
| 14:45-15:00, Paper TuA16.137 | |
| NeuroScribe: Dynamics-Inspired Motion-Primitive Decoding for EEG-To-Trajectory Decoding |
|
| Du, Zonghan | Brown University |
| Ziliqing, Qu | Brown |
| Lai, Zhongyuan | Universiti Tunku Abdul Rahman |
Keywords: Human-Machine Interface, Human-Machine Interaction
Abstract: Non-invasive EEG provides a practical pathway toward continuous brain--computer interfaces, but continuous EEG-to-trajectory decoding remains a highly underconstrained problem. As a result, direct sequence regressors often produce jittery outputs, require high-dimensional predictions, and may generate trajectories that are not dynamically plausible. We present NeuroScribe, an end-to-end EEG-to-trajectory decoding framework that combines a geometry- and band-informed encoder (STFEnc) with an Auto-DMP (Dynamic Movement Primitives) decoder. Instead of predicting every trajectory sample directly, the decoder estimates a compact set of Auto-DMP parameters, including RBF weights, goal, and adaptive scaling, and reconstructs the trajectory through a goal-attractor dynamical system to generate smooth and stable 2D outputs. We evaluate NeuroScribe in offline experiments on two public EEG benchmarks involving continuous cursor control and handwriting-related trajectory decoding. Results show that NeuroScribe improves reconstruction accuracy and trajectory smoothness over strong baseline decoders while substantially reducing jerk. These findings suggest that embedding motion-dynamics priors into EEG decoders is a promising approach for robust continuous neural decoding and may benefit future non-invasive BCI systems for continuous control and assistive communication. All codes are available at https://github.com/gwkuqgfkqe/neuro-scribe.
|
| |
| 14:45-15:00, Paper TuA16.138 | |
| FPLLaVA: A New Dataset and a Chain-Of-Thought Enhanced Large Multimodal Model for Unilateral Peripheral Facial Paralysis Grading |
|
| Hu, Guohong | University of Chinese Academy of Sciences |
| Lyu, Jiayi | University of Chinese Academy of Sciences |
| Gan, Wei | University of Chinese Academy of Sciences |
| Jiang, Hanyu | University of Chinese Academy of Sciences |
| Liu, Peidong | University of Chinese Academy of Sciences |
| Luo, ZiTai | University of Chinese Academy of Sciences |
| Xue, Jian | University of Chinese Academy of Sciences |
Keywords: Medical Informatics, Image Processing and Pattern Recognition
Abstract: Precise assessment of Unilateral Peripheral Facial Paralysis (UPFP) is crucial for determining treatment strategies and evaluating rehabilitation progress. However, current clinical practices rely heavily on subjective grading systems, which suffer from high inter-observer variability, while existing automated methods are constrained by data scarcity and a lack of interpretability. To address these challenges, we propose FPLLaVA, a specialized Large Multimodal Model (LMM) designed for the automatic and objective grading of UPFP. We first construct a comprehensive clinical benchmark dataset comprising 1,841 video samples from 157 patients, meticulously annotated by expert clinicians. To enhance the model's clinical reasoning capabilities, we introduce FPCoT, a novel Chain-of-Thought (CoT) strategy. By integrating optical flow for temporal dynamics and Action Units (AUs) for anatomical priors, FPCoT guides the model to perform a step-by-step analysis of muscle motion before concluding a final severity grade. Extensive experiments demonstrate that FPLLaVA achieves state-of-the-art performance, significantly outperforming both traditional deep learning baselines and advanced general-purpose LMMs in grading accuracy. The code and dataset will be made publicly available.
|
| |
| 14:45-15:00, Paper TuA16.139 | |
| Robust Adaptive Integral Sliding Mode Control for Secure Consensus of Linear MASs Subject to Deception Attacks |
|
| He, Shenghuang | Dongguan University of Technology |
| Liu, Lecong | Dongguan University of Technology |
| Zhong, Wenjian | Guangdong University of Technology |
| Lu, Yongkang | Great Bay University |
Keywords: Cooperative Systems and Control
Abstract: This article studies the secure consensus control problem for multi-agent systems (MASs) subject to both external disturbances and bounded deception attacks. To enhance system resilience against malicious false data injection, a novel adaptive integral sliding mode control (AISMC) scheme is introduced. The framework employs a smooth projection-based adaptive mechanism for the online estimation of unknown attack bounds, which reduces the conservatism commonly observed in fixed-gain controllers. By integrating a nominal finite-time consensus protocol with a discontinuous sliding mode law, finite-time reachability of the sliding surface is guaranteed. Rigorous Lyapunov stability analysis confirms the finite-time convergence of the state error to zero under unknown and time-varying but bounded attack signals. Extensive numerical simulations involving four followers and one leader validate the effectiveness of the AISMC scheme. The results confirm that the proposed method ensures robust consensus and superior tracking performance compared with open-loop and non-adaptive control configurations.
|
| |
| 14:45-15:00, Paper TuA16.140 | |
| A PN-Based A∗ Heuristic Approach with Efficient Data Structures for Scheduling Robotic Cellular Manufacturing Systems |
|
| Xu, Wanhao | Nanjing Universiy of Science and Technology |
| Huang, Bo | Nanjing University of Science and Technology |
| Kashif, Muhammad | Nanjing University of Science and Technology |
Keywords: Manufacturing Automation and Systems, Large-Scale System of Systems, Robotic Systems
Abstract: To reduce the computational cost of optimally scheduling robotic cellular manufacturing (RCM) systems modeled by place-timed Petri nets (PNs), prior work has largely concentrated on developing more effective heuristic functions or sacrificing optimality to accelerate the search. In contrast, this paper introduces an efficient A* scheduling method that combines a new data structure, i.e., Petri net Red-Black Tree (PN-RBT). This enhancement speeds up the search by enabling efficient storage and management of large state lists, which are frequently accessed in PN-based A* search. We present the structure and core operations of PN-RBTs, namely search, insertion, and deletion. Then, the proposed technique is applied to generalized PNs where arc weights may exceed one, accelerates the scheduling process, and retains optimality provided an admissible heuristic is employed. The experimental analysis confirms the effectiveness and efficiency of our approach.
|
| |
| 14:45-15:00, Paper TuA16.141 | |
| Wild Giant Pandas Individual Verification in Real Scenes Based on DBPandaNet |
|
| Ren, Zhen | Sichuan Normal University |
| Jiang, Linzhou | Sichuan Normal University |
| He, Mengnan | Chengdu Research Base of Giant Panda Breeding |
| Luo, Gai | Chengdu Research Base of Giant Panda Breeding |
| Ma, Ying | Chengdu Research Base of Giant Panda Breeding |
| Han, Yiming | Chengdu Research Base of Giant Panda Breeding |
| Gong, Cuifeng | Chengdu Research Base of Giant Panda Breeding |
| Chen, Peng | Chengdu Research Base of Giant Panda Breeding |
| Su, Han | Sichuan Normal University |
Keywords: Biometrics and Applications, Image Processing and Pattern Recognition
Abstract: Timely acquisition of individual information is the key to conserving of wild giant pandas, and reliable individual verification methods are needed for monitoring the panda population. The possibility of individual recognition based on vision has been verified in captive environments through facial individual recognition. However, existing methods, which focus on recognition rather than verification, are difficult to adapt to unknown individuals in the wild and have poor verification effects in real scenarios due to the constraints of the wild environment. Therefore, this paper proposes the DBPandaNet model to solve the problems existing in the current methods for distinguishing individual wild giant pandas. Experiments show that the model performs excellently in complex wild scenes, with an accuracy of 76.59% on the self-built Giant Panda Full-body Individual Verification Dataset(GPFIVD). Additional verifi- cation of the images of wild giant pandas further confirmed the generalization ability of the model in actual monitoring sce- narios. This proves that the method can effectively adapt to real wild scenarios and provides a feasible technical solution for the individual and population monitoring of wild giant pandas.
|
| |
| 14:45-15:00, Paper TuA16.142 | |
| Cross-Modal Iteration Distillation for Robust IHD Screening: The IDNet Framework and a New Benchmark |
|
| Gao, Yongchang | University of Chinese Academy of Sciences |
| Pang, Junjie | University of Chinese Academy of Sciences |
| Shuaiyu, Yang | University of Chinese Academy of Sciences |
| Yang, YuSheng | BGI |
| Jia, Xichao | University of Chinese Academy of Sciences |
| Li, Shao Jie | University of Chinese Academy of Sciences |
| Zhang, Hongfei | Shenzhen University |
| Mu, Jia | MGI Tech Co., Ltd |
Keywords: Medical Informatics, Deep Learning, Image Processing and Pattern Recognition
Abstract: Color Fundus Photography (CFP) offers a lowcost and non-invasive route for ischemic heart disease (IHD) screening, but current studies are limited by scarce public benchmarks and ineffective fusion of retinal images with sparse clinical variables. We propose IDNet, a multimodal framework with a Cross-Modal Distillation Aggregator (CDA) that uses learnable queries to sequentially integrate left-eye, right-eye, and clinical features, mitigating the imbalance between highdimensional visual features and low-dimensional tabular inputs. We also construct a reproducible UK Biobank benchmark with open-source curation and quality-control pipelines, yielding 50,410 images from 25,205 subjects. On this benchmark, IDNet outperforms image-only, clinical-only, and several multimodal baselines, and CDA consistently improves multiple visual encoders as a plug-in fusion module.
|
| |
| 14:45-15:00, Paper TuA16.143 | |
| MST: Aligning Graph-Structured System Representations with Large Language Models for Incident Reasoning |
|
| Xu, Yifei | Institute of Information Engineering, University of Chinese Academy of Sciences |
| Lv, Quanfeng | Institute of Information Engineering, University of Chinese Academy of Sciences |
| Ge, Jingguo | University of Chinese Academy of Sciences |
| Li, Hui | Institute of Information Engineering, Chinese Academy of Sciences |
| Li, Tong | Institute of Information Engineering, Chinese Academy of Sciences |
Keywords: Fault Monitoring and Diagnosis, Distributed Intelligent Systems, Application of Artificial Intelligence
Abstract: Applying Large Language Models (LLMs) to microservice systems is promising for interactive diagnosis and reasoning. However, existing LLM-based AIOps approaches typically rely on textualizing system telemetry, which discards structural dependencies among services in distributed environments. Encoding multimodal telemetry such as metrics, logs, and traces into structured system representations provides an alternative for preserving service dependencies and system dynamics. Yet aligning these topology-aware representations with the discrete semantic space of LLMs remains challenging, and existing graph-to-language alignment mechanisms often introduce substantial computational overhead. To address this problem, we propose the Microservice System Translator (MST), a lightweight alignment framework that enables LLMs to interpret graph-structured system representations for microservice diagnosis. MST adopts a two-stage training strategy. In the alignment stage, structural, directional, and semantic information is aligned through symmetric role-aware random walk positional encoding and a hybrid soft-concept codebook. In the instruction-tuning stage, the aligned representations are injected into a frozen LLM as soft prompts, while LoRA adapters are optimized to support diagnostic reasoning. Experiments on two multimodal microservice datasets demonstrate that MST outperforms the evaluated graph-to-LLM approaches, improving the average reasoning score by 5.4% over the next-best baseline while maintaining strong performance on system diagnosis tasks.
|
| |
| 14:45-15:00, Paper TuA16.144 | |
| Noise in Industrial Cyber Threat Intelligence: An Empirical Study on Its Impact on LLM-Based Reasoning |
|
| Lv, Zuochen | Institute of Information Engineering Chinese Academy of Sciences, Beijing, China |
| Chen, Yu | IIE CAS |
| Wen, Hui | Institute of Information Engineering Chinese Academy of Science |
| Song, Xirui | Institute of Information Engineering,Chinese Academy of Sciences |
| Li, Hong | Chinese Academy of Sciences |
| Yimo, Ren | Institute of Information Engineering, Chinese Academy of Sciences |
| Zhu, Hongsong | Institute of Information Engineering Chinese Academy of Science |
Keywords: AI and Applications, Quality and Reliability Engineering, Cyber Systems and Engineering
Abstract: Cyber Threat Intelligence (CTI) systems are undergoing an intelligent transformation, with Large LanguageModels (LLMs) offering significant potential for enhancingtheir analytical and decision-making capabilities. However, real-world industrial intelligence data often contains various typesof noise, which affect the accuracy and reliability of modelreasoning. Existing research has not systematically exploredthe impact of different noise types on LLM performance inthe threat intelligence processing task. In this paper, we firstdefine five types of noise encountered in real industrial scenariosand construct a QA-style evaluation dataset tailored to thethreat intelligence domain. Through experiments, we find thatnot all noise types negatively affect LLM performance in thethreat intelligence processing task;some noise may occasionallyprovide contextual benefits. Additionally, by controlling noisetype and perturbation intensity, we investigate how differentnoise conditions influence LLM reasoning behavior. Our studyprovides new insights into the impact of noise on LLMperformance and offers practical guidance for designing moreresilient and reliable threat analysis systems.
|
| |
| 14:45-15:00, Paper TuA16.145 | |
| CON-QA: Privacy-Preserving QA Using Cloud LLMs in Contract Domain |
|
| Singh, Ajeet kumar | IIT DELHI |
| Surya, Rajsabi | Info Origin INC |
| Tripathi, Anurag | Info Origin INC |
| Chaudhury, Santanu | IIT Jodhpur |
| Bisane, Sudhir | Info Origin INC |
Keywords: Information Assurance and Intelligence, Generative AI, Trust in Autonomous Systems
Abstract: As enterprises increasingly integrate cloud-based large language models (LLMs) such as ChatGPT and Gemini into their legal document workflows, protecting sensitive contractual information—including Personally Identifiable Information (PII) and commercially sensitive clauses—has emerged as a critical challenge. In this work, we propose CON-QA, a hybrid privacy-preserving framework designed specifically for secure question answering over enterprise contracts, effectively combining local and cloud-hosted LLMs. The CON-QA framework operates through three stages: (i) semantic query decomposition and query-aware document chunk retrieval using a locally deployed LLM analysis, (ii) anonymization of detected sensitive entities via a structured one-to-many mapping scheme, ensuring semantic coherence while preventing cross-session entity inference attacks, and (iii) anonymized response generation by a cloud-based LLM, with accurate reconstruction of the original answer locally using a session-consistent many-to-one reverse mapping. To rigorously evaluate CON-QA, we introduce CUAD-QA, a corpus of 85k question-answer pairs generated over 510 real-world CUAD contract documents, encompassing simple, complex, and summarization-style queries. Empirical evaluations, complemented by detailed human assessments, confirm that CON-QA effectively maintains both privacy and utility, preserves answer quality, maintains fidelity to legal clause semantics, and significantly mitigates privacy risks, demonstrating its practical suitability for secure, enterprise-level contract documents.
|
| |
| 14:45-15:00, Paper TuA16.146 | |
| Stability-Aware Reinforcement Learning for Formulaic Alpha Discovery |
|
| Yang, Xueying | Computer Network Information Center, Chinese Academy of Sciences University of Chinese Academy of Sciences |
| Jiang, Jinrong | Computer Network Information Center, Chinese Academy of Sciences |
| Li, Chen | Computer Network Information Center, Chinese Academy of Sciences |
| Lu, Zhonghua | Computer Network Information Center, Chinese Academy of Sciences |
| Chi, Xuebin | Computer Network Information Center, Chinese Academy of Sciences |
Keywords: Reinforcement Learning, Optimization Control, Computational Intelligence
Abstract: Reinforcement learning has recently been applied to formulaic alpha discovery by casting symbolic factor generation as a sequential decision-making problem. However, existing approaches often focus mainly on predictive reward, while practical quantitative factor mining also requires temporal robustness, low redundancy among selected factors, and reasonable symbolic structure. In this paper, we revisit RL-based formulaic alpha discovery from a factor-quality perspective. Instead of proposing a completely new symbolic generation framework, we redesign the optimization objective and the alpha-pool update mechanism. Specifically, we introduce a stability-aware reward that combines mean RankIC with a temporal variance penalty and structural regularization, encouraging expressions with more consistent predictive behavior and better symbolic validity. We further adopt a marginal-contribution-based alpha pool update to favor complementary rather than redundant expressions. Experimental results on real-market data show that the proposed design improves overall factor quality over a PPO-based AlphaGen baseline, including more temporally robust RankIC performance, lower alpha-pool redundancy, and better structural validity.
|
| |
| 14:45-15:00, Paper TuA16.147 | |
| Regulating Pose-Dependent Cartesian Commanded Increments in Multi-Axis Printing Using Grounded S-CVT System |
|
| Mezonlin, Sywal | FAMU–FSU College of Engineering |
| Rodney, Roberts | Florida State University |
| Moore, Carl | Florida A&M University |
Keywords: Mechatronics, Robotic Systems, System Modeling and Control
Abstract: An articulated manipulator’s kinematics map joint-space increments into pose-dependent Cartesian increments, resulting in nonuniform commanded resolution across the workspace. This paper treats transmission ratio as a configuration-dependent design variable and formulates bounded transmission-ratio scheduling in a grounded spherical continuously variable transmission (S-CVT) RRP architecture. Because the prismatic axis contributes only the constant scale factor r_p, the analysis focuses on the planar 2R subsystem. For the fixed equal-component Cartesian probe direction, the sampled nonsingular and ratio-feasible region comprises 96.78% of the evaluated workspace. Within this region, the fixed-ratio baseline yields H_{1}^{mathrm{fix}}=142.14%, whereas the ideal scheduled mapping recovers the commanded increment magnitude with a numerical residual below 10^{-4}%. Simulations along a circular path indicate that ratio saturation produces localized increment errors while the required steering rates remain below the selected steering-shaft operating speed. These results establish the kinematic consistency, sampled-workspace coverage, and bounded feasibility of S-CVT ratio scheduling for regulating commanded Cartesian increments.
|
| |
| 14:45-15:00, Paper TuA16.148 | |
| Enhancing Clinical Decision Support with LLMs and Blockchain |
|
| Musamih, Ahmad | Khalifa University |
| Salah, Khaled | Khalifa University |
| Simsekler, Mecit Can Emre | Khalifa University of Science & Technology |
| Omar, Mohammed | Khalifa University |
| Jayaraman, Raja | New Mexico State University |
Keywords: Decision Support Systems, Medical Informatics, Generative AI
Abstract: Modern clinical workflows operate within data-dense electronic health record (EHR) systems, where clinicians must interpret observations, laboratory results, medications, and diagnoses under time constraints. This overload increases cognitive burden and complicates episode-level understanding, motivating tools that organize dispersed clinical data while preserving clinician oversight. LLMs can synthesize patient data and external knowledge within clinical decision support (CDS) systems, yet many AI-assisted CDS workflows do not formalize complete interaction states as verifiable artifacts, leaving accountability dependent on documentation rather than embedded technical guarantees. We present a human-centric CDS prototype that integrates LLM-based synthesis with tamper-evident provenance and permissioned blockchain governance. The system retrieves structured EHR data, generates non-prescriptive episode-level summaries, and conditionally surfaces guideline evidence without automating treatment decisions. Each interaction is packaged by hashing inputs, outputs, and retrieval configuration, then anchoring the resulting commitments under multi-organization endorsement without storing identifiable clinical data on-chain. The prototype demonstrates end-to-end execution, ledger read-back verification, and stable anchoring performance under controlled loads. The study evaluates technical feasibility and provenance rather than clinical effectiveness.
|
| |
| 14:45-15:00, Paper TuA16.149 | |
| Cooperative Coevolution Quality Diversity by Dual Representation Archive Based on Different Mixture Splitting Networks (I) |
|
| Fan, Size | The University of Tokyo |
| Iba, Hitoshi | University of Tokyo |
| Takadama, Keiki | The University of Tokyo |
Keywords: Evolutionary Computation, Reinforcement Learning, Cooperative Systems and Control
Abstract: To tackle exploration-exploitation dilemma, this paper focuses on Cooperative Coevolution Quality Diversity (CCQD) as one of approaches for this issue and proposes CCQD with Dual Representation Archive to improve CCQD. CCQD combines Reinforcement Learning(RL) and quality-diversity(QD) by decomposing a policy into the pre-fixed representation and decision modules of Neural Network (NN), but an appropriate split of modules is not known beforehand and more importantly such a fixed split may affect exploration and exploitation. To address this issue, the proposed method is designed to separately have the two archives of the representation and decision modules for maintaining different split configurations of NNs in addition to share one QD archive originally prepared for storing fitness in CCQD. Through the experiments on Walker2D Uni in MuJoCo, the following implications have been revealed: (1) compared with the fixed-split CCQD baselines, the proposed method achieves higher coverage of the search space (as exploration) and a higher QD-Score (as an overall measure of quality and diversity), while maintaining competitive max-fitness performance (as exploitation);(2) the proposed method can find the appropriate different split configurations of NN in each region of the behavior space, which cannot be archived by the same fixed configurations of NN in CCQD.
|
| |
| 14:45-15:00, Paper TuA16.150 | |
| Design and Control of an Interaction-Safe Soft Exosuit for Human Swimming Augmentation |
|
| Xia, Haisheng | Tongji University |
| Chen, Yang | Tongji University |
| Wu, Xiaoyu | Tongji University |
| Li, Guoxin | The Institute of Artificial Intelligence, Hefei Comprehensive National Science Center |
| Yao, Jiajia | Shanghai Yangzhi Rehabilitation Hospital |
Keywords: Human-Machine Interaction, Robotic Systems, Mechatronics
Abstract: Human swimming augmentation remains challenging due to the complex demands of underwater locomotion and the stringent requirements for safe, compatible human–robot interaction. Soft exosuits present a promising solution; however, cable-driven transmission and direct physical coupling introduce considerable difficulties for assistive control. This paper presents an interaction-safe soft exosuit designed to enhance swimming performance. To generate natural assistance aligned with the wearer's motion, a knee-angle-driven assistive planning method is introduced. A novel interaction-control strategy is developed to ensure safety, which combines adaptive residual compensation with an interaction-bound mechanism. Pool experiments with three participants demonstrate that the proposed exosuit provides phase-consistent assistance during swimming. Compared with the exosuit without assistance, the proposed method reduces the 20m swimming completion time by 14.3% and decreases lower-limb muscle activation measured by electromyography. These findings demonstrate the effectiveness of soft exosuit in improving swimming performance.
|
| |
| 14:45-15:00, Paper TuA16.151 | |
| QADE: A Question-Answering Demonstration Enhanced Model for Document-Level Event Argument Extraction |
|
| Liu, Tongshu | The Ohio State University |
| Xie, Jing Ze | Shanghai University |
| Huang, Yukang | Shanghai University |
Keywords: Knowledge Acquisition, Generative AI, Deep Learning
Abstract: Document-level Event Argument Extraction (Doc-EAE) aims to extract event structures, including arguments and their roles, from documents. Recent studies have enhanced extraction by incorporating external knowledge or relevant demonstrations via prompt-guided pre-trained models (PLMs),which fail to semantically align the PLMs, supplementary demonstrations, and contextual texts. Moreover, while some demonstrations reveal inter-event relationships, their semantical alignment to event contexts remains inadequately explored when merely used as concatenated supplementary inputs. We propose a Question-Answering Demonstration Enhanced Approach (QADE) for Doc-EAE. First, we construct template-based domain-specific QA demonstrations and a relational graph linking questions, template slots and context answers to model inherent event structures. Then we adopt a dual-integration strategy with a graph-augmented encoder-decoder and a QA-guided mechanism. The two modules separately inject graph structural features and QA relational knowledge into pre-trained language models to improve event argument generation. Experiments on WikiEvents and RAMS validate our model, it achieves SOTA on WikiEvents and competitive performance on RAMS.
|
| |
| 14:45-15:00, Paper TuA16.152 | |
| Phase-Guided Incremental MaxSAT for Dynamic Routing |
|
| Zha, Aolong | Wakayama University |
| Zhuang, Qianwei | The University of Tokyo |
| Imura, Naoto | The University of Tokyo |
| Chang, Qiong | Institute of Science Tokyo |
| Koshimura, Miyuki | Kyushu University |
Keywords: Logistic and Manufacturing Automation, Application of Artificial Intelligence, Intelligent Transportation Systems
Abstract: Exact routing in dynamic logistics demands high-quality solutions within tight timeframes. While incremental MaxSAT solving offers theoretical advantages over monolithic scratch-solving by harnessing historical states, it faces two critical bottlenecks. First, traditional incremental solvers rely on rigid unit assumptions. As new requests expand the routing network, these assumptions severely over-constrain the search space, frequently triggering catastrophic search stagnation and subspace entrapment. Second, effectively managing a bounded global computational budget is notoriously difficult; uniform time allocation starves late-stage problems while squandering resources on trivial early stages. To overcome these hurdles, we propose a phase-guided incremental MaxSAT framework. We replace hard assumptions with soft phase-saving polarity injection, heuristically guiding the solver without compromising completeness or feasibility. Furthermore, we introduce a complexity-aware time bank methodology. It dynamically assigns base budgets utilizing the theoretical spatial complexity of the order encoding, seamlessly carrying over unspent time to harder late stages via a chess-clock mechanism. Experimental evaluations demonstrate that our phase-guided approach fundamentally bypasses subspace entrapment and achieves rapid anytime convergence, securing near-offline optimality while decisively outperforming traditional incremental architectures.
|
| |
| TuB16 |
Room T1 |
| Virtual Session IV |
Virtual Session |
| Chair: Wang, Jiacun | Monmouth University |
| Co-Chair: Gu, Jason | Dalhousie University |
| |
| 15:30-15:45, Paper TuB16.1 | |
| Semantic-Structure Dual-Channel Expansion: Enhancing Cross-Page Retrieval in Multi-Modal Documents |
|
| Tian, Jinzhao | Academy of Military Science |
| Shi, Dianxi | National Innovation Institute of Defense Technology |
| Wang, Mengzhu | Hebei University of Technology |
Keywords: AI and Applications, Application of Artificial Intelligence, Multimedia Computation
Abstract: Large Vision-Language Models (LVLMs) face significant challenges in multi-modal long-context document question answering, particularly when critical evidence is fragmented across dozens of pages and diverse modalities. While Retrieval-Augmented Generation (RAG) mitigates context window constraints, conventional flat chunking strategies disrupt native document hierarchies and overlook cross-section semantic dependencies, leading to fragmented evidence retrieval. To bridge this gap, we propose a Dual-Channel Document Retrieval framework built upon a novel Semantic-Structure Index. Specifically, we construct an enhanced tree that aggregates fine-grained elements into modality-aware content blocks and explicitly establishes long-range semantic correlations across disjoint sections. During inference, a dual-channel expansion mechanism simultaneously traverses structural neighborhoods to preserve local layout coherence and follows semantic pathways to retrieve cross-page collaborative evidence. This design effectively bridges localized details with global document semantics, enabling robust multi-hop reasoning. Extensive experiments on MMLongBench-Doc and LongDocURL demonstrate that our method achieves state-of-the-art performance, improving accuracy by textbf{3.0%} and F1 by textbf{2.7%} over strong baselines, with particularly significant gains in cross-page and multi-modal reasoning scenarios.
|
| |
| 15:45-16:00, Paper TuB16.2 | |
| NarrativeLoop: Closed-Loop Self-Improvement for Long-Horizon Narrative Generation Via External Grounding |
|
| Hu, Bin | Xinjiang University |
| Kuang, Minchi | Tsinghua University |
| He, Shiyu | Xinjiang University |
| Wang, Mengxian | Xinjiang University |
Keywords: Generative AI, Agent-Based Modeling, Deep Learning
Abstract: 长视野叙事生成系统实现 通过多智能体模拟实现了惊人的连贯性,但 普遍依赖闭源 API 或 作为角色代理,参数超过70B的开源模型 骨干,导致高额推断成本,且频繁 世界观幻觉,以及明显的风格特征 均质化。本文介绍了NarrativeLoop,一种 闭环自我提升框架,使 10B以下的模型,作为一个称职的角色代理骨干。我们的贡献有三方面。首先,我们识别 多样化长视野叙事系统的产出 收敛于一个共同的三原子叙述模式, 角色行动、对话,并正式化这一点 作为通用叙事解析器(UNP)的收敛 统一来自异构来源的训练数据。其次, 我们提出一种外部接地滤波器(EGF),其 参数保持与下模型的参数正交 训练,使稳定的自我提升成为可能 奖励黑客崩溃。第三,迭代
|
| |
| 16:00-16:15, Paper TuB16.3 | |
| SGE-GS: Unified Geometry and Structural Optimization for Sparse-View 3D Gaussian Splatting |
|
| Zeng, Sisi | Xinjiang University |
| Wang, Hongfei | Xinjiang University |
| Yu, Qing | Xinjiang University |
Keywords: Machine Vision, Image Processing and Pattern Recognition, Machine Learning
Abstract: 近年来,三维高斯喷溅(3DGS) 在新颖视角中展示出强有力的性能,预计将进行合成 到高效的训练和实时渲染 能力。然而,在稀疏视图设置下, 3DGS的优化过程通常约束不足, 这可能导致未观测的几何不稳定性 区域,对训练视图进行过拟合,以及 细节恢复不足。为了解决这些问题 局限性,我们提出SGE-GS的统一高斯分布 稀疏视图新颖视图的优化框架 合成。具体来说,SGE-GS利用单眼深度 先验以提供额外的几何约束 这些地区被忽视,从而改善了结构 稳定性;同时,随机不透明度正则化为 在训练期间引入,以缓解 代表以过度拟合有限的训练视角; 此外,采用了细节感知结构细化 在精炼阶段,以增强结构恢复 细节关键区域。实验结果表明 SGE-GS有效提升了几
|
| |
| 16:15-16:30, Paper TuB16.4 | |
| Rethinking Sensor Homogeneity in Remaining Useful Life Prediction: A Differentiable Routing and Asymmetric Modeling Perspective |
|
| Yin, Wangxiandi | University of Electronic Science and Technology of China |
| Zhong, Yaozi | Yunnan University of Finance and Economics |
| Feng, Changqun | University of Electronic Science and Technology of China |
Keywords: Intelligent Industrial Systems, Application of Artificial Intelligence, Big Data Computing
Abstract: Deep learning has revolutionized Remaining Useful Life (RUL) prediction, yet mainstream architectures predominantly assume sensor homogeneity, treating multivariate channels as structurally equivalent. This paradigm overlooks the intrinsic physical heterogeneity of complex systems, where volatile operational contexts often mask degradation signals and cause severe feature dilution. In this paper, we propose the Asymmetric Dual-branch Network (AD-Net) to explicitly decouple health evolution from environmental interference. Central to AD-Net is a Prior-Informed Differentiable Sensor Routing (DSR) mechanism that adaptively partitions sensors into degradation and context subsets via end-to-end learning over physical priors. To address the distinct dynamics of these subsets, we employ an asymmetric modeling strategy: a Trend-Aware Multi-Scale TCN (TA-MSTCN) captures longterm monotonic wear, while a Selective State-Space Model (Mamba) encodes transient regime shifts with linear complexity. These branches are integrated via Asymmetric Context-Guided Cross-Attention (ACGCA), which mathematically simulates the modulation of degradation rates by operating conditions. Extensive experiments on the C-MAPSS benchmark demonstrate that AD-Net achieves superior accuracy and cross-regime robustness.
|
| |
| 16:30-16:45, Paper TuB16.5 | |
| GDD-MKA: Gated Drift Detection and Multi-Layer Knowledge Alignment for Continual Intrusion Detection |
|
| Fei, Zhanbo | Shanghai University of Electric Power |
| Wang, Yong | Shanghai University of Electric Power |
| Fei, Chaoqun | South China Normal University |
Keywords: Systems Safety and Security, Adaptive Systems, Deep Learning
Abstract: 随着网络威胁格局的不断演变,静态入侵检测系统(IDS)在有效处理概念漂移方面遇到了困难。尽管已采用持续学习技术以提升动态适应性,但现有方法仍受稳定性与可塑性困境的限制。他们无法准确区分由正常交通波动引起的虚拟漂移与由新颖攻击引发的真实概念漂移,这很容易导致灾难性的遗忘和误报率上升。为解决这些问题,本文提出了GDD-MKA,一种不确定性感知的自适应持续学习框架。首先,设计了一个门控漂移检测(GDD)引擎,采用结合统计检验和轻量语义对抗分类器(Lite-MCD)的级联决策机制,过滤虚拟漂移并定位真实特征突变点。其次,引入了多层知识对齐(MKA)策略,构建逻辑输出层、特征层和关系流形层的多维蒸馏约束,从
|
| |
| 16:45-17:00, Paper TuB16.6 | |
| Feature-Space Regulation for Pre-Trained Model-Based Class-Incremental Learning |
|
| Jiang, Fengqiang | Xinjiang University |
| Yu, Jiong | Xiniang University |
| Li, Xue | Xinjiang University |
| Liu, Kunyang | Xinjiang University |
| Li, Ziyang | Xinjiang University |
Keywords: Deep Learning, Machine Learning, Representation Learning
Abstract: Class-Incremental Learning (CIL) aims to retain the knowledge of old tasks while learning the knowledge of new tasks. Although pre-trained model-based CIL methods typically achieve incremental learning by freezing the backbone network and adapting to incremental tasks using additional lightweight modules such as adapters, these methods do not take into account the issue that high correlations between semantically similar classes in the feature space may lead to overlapping decision boundaries between tasks. To address this challenge, we introduce a feature space regulation mechanism based on the adapter architecture. By enforcing intra-task compactness and inter-task separation within the adapter-tuned representations, we effectively reduce the risk of decision boundary overlap between tasks. Extensive experiments on various benchmark datasets indicate that our method achieves highly competitive performance compared to existing baselines.
|
| |
| 16:45-17:00, Paper TuB16.7 | |
| A Data Synthesis Pipeline for Elevator Safety Scene Segmentation Based on Prior Knowledge |
|
| Gang, Xu | Ningbo Institute of Materials Technology & Engineering, Chinese Academy of Sciences |
| Ouyang, Wenjun | Ningbo Institute of Materials Technology and Engineering, Chinese Academy of Sciences |
| Qinfeng, Tong | Ningbo Hosting Elevator Co., Ltd |
| Xu, Ziming | Ningbo Special Equipment Inspection and Research Institute |
| Chen, Ruixing | Ningbo Institute of Materials Technology and Engineering, Chinese Academy of Sciences |
| Yue, Cui | Ningbo Institute of Materials Technology & Engineering, Chinese Academy of Sciences |
| Yutong, Li | Ningbo Institute of Materials Technology & Engineering, Chinese Academy of Sciences |
| Luo, Zhaoming | China Telecom Corporation Ltd Ningbo Branch |
| Xiao, Jiangjian | Ningbo Institute of Materials Technology & Engineering |
Keywords: Generative AI, Neural Networks and their Applications, Smart Buildings, Smart Cities and Infrastructures
Abstract: Elevator safety monitoring faces two coupled challenges: real-world data collection is constrained by privacy, and critical interaction patterns involving people, pets, and leashes are long-tailed and structurally difficult to capture. Existing image generation and editing methods often struggle to preserve elevator geometry and the interaction consistency of thin, deformable objects such as leashes. To address this issue, we propose a prior-knowledge-guided synthetic data generation pipeline for elevator safety scene segmentation. First, 3D structural priors and controllable diffusion models are used to generate geometry-consistent elevator backgrounds. Second, an iterative anchor-guided editing strategy is introduced to synthesize person–pet–leash interactions while preserving spatial relations and leash continuity. Third, a LoRA-based domain-adaptive editing stage improves appearance diversity under natural-language control while maintaining scene plausibility. We evaluate the proposed pipeline on a real elevator dataset containing 4000 annotated frames collected from 13 scenarios and 19 viewpoints. When mixed with real training data, the generated synthetic images consistently improve five mainstream segmentation models, with especially clear gains on long-tail categories such as pets and leashes. These results demonstrate that structure-aware synthetic augmentation can effectively alleviate data scarcity and enhance fine-grained perception in privacy-sensitive elevator environments.
|
| |
| 16:45-17:00, Paper TuB16.8 | |
| Synergizing Local Geometric Encoding with Global Mamba Reasoning for 3D Mesh Segmentation of Intracranial Aneurysm |
|
| Li, Shuang | Sichuan Normal University |
| Zhang, Fuhao | Sichuan Normal University |
| Zhang, Yanan | Sichuan Normal University |
| Wang, Chao | Sichuan Normal University |
| Jiang, Jingfeng | Michigan Technological University |
| Wang, Ling | Sichuan Normal University |
| Mu, Nan | Sichuan Normal University |
Keywords: Image Processing and Pattern Recognition, Deep Learning, Machine Learning
Abstract: Accurate segmentation of intracranial aneurysms (IAs) remains challenging due to their complex morphology and indistinct boundaries. Existing mesh-based methods struggle to simultaneously capture fine-grained surface geometry and long-range topological context on irregular vascular surfaces. To address this, we propose GEMR-MSeg, a lightweight U-shaped framework for 3D IA mesh segmentation. Its core GeoMamba block acts as a unified unit, tightly coupling local geometric extraction with global semantic reasoning. Specifically, a Local Geometric Encoding (GE) module employs mesh-aware convolutions to capture boundary-sensitive cues and resolve local ambiguities. Complementing GE, the Mamba Reasoning (MR) module leverages selective state-space modeling for linear-complexity global context propagation, avoiding attention-based efficiency bottlenecks. Fusing GE and MR inherently enhances both local fidelity and global topological coherence. Evaluated on two public IA datasets, GEMR-MSeg achieves superior performance, improving the Dice coefficient by 7.79% and IoU by 12.26% over strong baselines. Averaging 0.98 s inference time per sample, the framework demonstrates high efficiency, confirming its suitability for practical clinical deployment.
|
| |
| 16:45-17:00, Paper TuB16.9 | |
| Training-Free Dialog-Grounded Aerial Endpoint Localization in AVDN |
|
| Wang, Xiaoheng | Shenzhen Institutes of Advanced Technology, Chinese Academy of Sciences |
| Wang, Feng | Southern University of Science and Technology |
| Ye, Kejiang | Shenzhen Institutes of Advanced Technology, Chinese Academy of Sciences |
Keywords: Human-Machine Cooperation and Systems, Generative AI
Abstract: Existing AVDN methods mainly formulate dialog-guided UAV operation as supervised sequential navigation or policy learning, requiring task-specific training and producing outputs that are not directly usable by downstream planners. This creates a practical mismatch for human-in-the-loop aerial workflows, which often need a planner-ready target coordinate rather than a learned action policy. We address this mismatch by reformulating AVDN as training-free dialog-grounded aerial endpoint localization, where a frozen vision-language model maps a satellite image and dialog context directly to a machine-readable target coordinate. This reformulation is realized through a structured prompting-and-parsing interface that preserves dialog structure, uses role/task-aware multimodal prompting, and enforces strict coordinate constraints. Across multiple off-the-shelf vision-language model backends, repeated GPT-5 runs achieve 56.04% ± 0.78% SR@20% on Val Unseen, while ablations show that dialog history, prompt structure, and output constraints materially affect performance. Downstream analyses further indicate that better endpoint predictions are more compatible with a planner, supporting training-free dialog-grounded endpoint localization as a useful upstream module for human-supervised UAV planning workflows.
|
| |
| 16:45-17:00, Paper TuB16.10 | |
| NAPE: A Cybernetics-Inspired Closed-Loop Framework for Adaptive Prompt Evolution in Industrial LLMs |
|
| Chen, Ze | Beijing Normal University |
| Zhang, Haomai | Beijing Normal University |
| Liu, Zhanghua | Beijing Normal University |
| Liu, Kaixuan | China University of Mining and Technology-Beijing |
| Xu, Guohuan | South China University of Technology |
Keywords: Generative AI, Computational Intelligence, Consumer and Industrial Applications
Abstract: Prompt quality critically affects the reliability of large language models (LLMs), yet automatic prompt optimization remains difficult in complex real-world settings. Recent methods have introduced clustered task batches, error taxonomies, or section-local updates, but they do not jointly organize task patterns and recurring failures, protect stable task intent from local corrections, and screen candidate updates for regression. We propose NAPE, a Negative-Case-Aware Prompt Evolution framework that treats prompt optimization as a guarded closed loop. NAPE first uses task-type clusters to synthesize a stable base instruction. It then freezes this instruction and evolves an extra rule set from dominant error-cause clusters. Candidate rules are admitted only when metric guardrails on negative flip, positive gain, and auxiliary-set generalization are satisfied; otherwise, bounded reflection revises or rejects the update. Across three public benchmarks and two industrial datasets, NAPE attains the highest mean score in all five comparisons, with modest gains on public benchmarks and clearer improvements on the two constraint-intensive industrial tasks. On the two representative industrial tasks, NAPE also reduces negative flips and final prompt growth relative to iterative baselines. These results indicate that separating stable task intent from mutable corrective knowledge is particularly useful when prompts combine persistent global specifications with evolving local constraints.
|
| |
| 16:45-17:00, Paper TuB16.11 | |
| CREDO: A Risk-Aware Evidence-Grounded Framework for Multimodal Credit Document Auditing |
|
| Liu, Sizhe | Renmin University of China |
| Luo, Yanxi | Renmin University of China |
| Zhao, Keming | Renmin University of China |
| Zhang, Jiaxuan | Renmin University of China |
| Zhang, Yinuo | Renmin University |
| Huang, Qingzhao | Sino-French Institute, Renmin University of China, Suzhou, China |
| Liu, Xuanying | Renmin University of China |
Keywords: Decision Support Systems, Expert and Knowledge-Based Systems, Image Processing and Pattern Recognition
Abstract: Multimodal credit document auditing is a high-stakes task in financial risk control, demanding cross-document reasoning, robustness to acquisition noise, and auditable evidence for human verification. Existing vision-language approaches commonly treat this problem as an isolated black-box prediction task, limiting their reliability in real-world lending workflows. To address this gap, we propose CREDO, a risk-aware and evidence-grounded framework for credit document auditing. CREDO integrates quality-aware evidence representation, cross-document evidence graph reasoning, and selective auditing to transform noisy inputs into structured evidence and route cases to auto-pass, manual review, or reject. Experiments conducted on the public FCMBench subset and an annotated evidence subset demonstrate that CREDO achieves competitive task performance while reducing false-pass risk and providing reviewable audit traces. These results suggest that trustworthy credit auditing should be formulated as an evidence-supported and human-aware decision process rather than a pure prediction task.
|
| |
| 16:45-17:00, Paper TuB16.12 | |
| Rethinking Adaptive Fusion in Few-Shot Anomaly Detection: When Adaptivity Hurts and How to Fix It |
|
| Guo, Yujie | Yanbian University |
| Piao, Jin-Chun | Yanbian University |
Keywords: Image Processing and Pattern Recognition, Deep Learning, Machine Learning
Abstract: Anomaly detection aims to identify regions that deviate from the normal distribution, and plays a crucial role in industrial inspection and visual analysis. Existing methods typically adopt fixed fusion coefficients when combining multi- source features, multi-branch responses, or multi-scale outputs. Such designs ignore the variations in anomaly patterns and fea- ture distributions across scenes, thereby limiting the flexibility of the fusion strategy. Moreover, under few-shot settings, the quality of support sets varies significantly across categories, causing adaptive strategies to become biased or even fail on unstable categories. To address these issues, we propose a Scene- Adaptive Fusion and Category-Reliability-Aware (SAF-CRAC) method for few-shot anomaly detection. The method first predicts dynamic fusion weights based on the scene statistics and normalized entropy of each branch feature, achieving an adaptive balance between local detail and regional context information. It then evaluates category reliability through three complementary signals: the threshold stability of the support set, the dispersion of normal sample distribution, and the separability between normal and abnormal samples. When the reliability is low, the adaptive fusion result is shrunk toward a fixed prior to enhance inference stability and robustness. The proposed method can serve as a plug-in replacement for fixed fusion coefficients in representative few-shot anomaly detection frameworks. Experiments on MVTec-AD show that integrating our method into ReM-AD brings consistent improvements in overall performance, achieving 97.5% I-AUC and 96.9% P- AUC under the 4-shot setting on MVTec-AD. More importantly, on unstable categories with low-quality support sets (screw, toothbrush, and capsule), the I-AUC is improved by 6.9%, 5.0%, and 1.6% respectively.
|
| |
| 16:45-17:00, Paper TuB16.13 | |
| Explicit Multi-Scale Blind-Spot Denoising with Edge-Aware Spatial Loss |
|
| Cheng, Ming | Hebei University |
| Shi, Qingxuan | Hebei University |
| Yang, Fang | Hebei University |
| Hong, Wanzhi | Hebei University |
Keywords: Image Processing and Pattern Recognition, Neural Networks and their Applications, Machine Vision
Abstract: Blind-spot denoising (BSD) methods have made significant progress in self-supervised image denoising; however, noise in real-world images exhibits substantial heterogeneity across both spatial and scale dimensions. Existing single-scale feature modeling and spatially uniform loss functions often lead to over-smoothing in textured areas and insufficient denoising in smooth regions, struggling to balance detail preservation with noise suppression. To address these challenges, this paper proposes an Explicit Multi-Scale Blind-Spot Denoising (EMBSD) framework. Architecturally, we construct a four-scale multi-resolution network by deploying independent Dilated Blind-Spot Networks at the original resolution, as well as at 1/2, 1/4, and 1/8 scales, simultaneously capturing local fine-grained textures and large-scale noise fluctuations. For optimization, we introduce an edge-aware spatial loss weighting strategy that assigns different reconstruction loss weights to edge and flat regions based on gradient magnitude, thereby achieving spatially differentiated denoising. Experiments on real-world image denoising datasets demonstrate that EMBSD achieves competitive or superior performance across different datasets, with consistent improvements in structural detail preservation and noise suppression.
|
| |
| 16:45-17:00, Paper TuB16.14 | |
| FGP-SAM: Fine-Grained Vision and Language Fusion Reference Prompting for SAM-Aided Few-Shot Segmentation |
|
| Yi, Cong | Chongqing University |
| Yang, Ruilong | Chongqing University |
| Wu, Xing | Chongqing University |
| Wang, Chengliang | Chongqing University |
| Wang, Peng | Southwest Hospital of Army Medical University |
| Wang, Hongqian | The First Affiliated Hospital of Army Medical University |
Keywords: Deep Learning, Neural Networks and their Applications, Image Processing and Pattern Recognition
Abstract: The Segment Anything Model (SAM) demonstrates strong zero-shot segmentation through flexible prompting. However, it requires manual prompts for each target image, making the process cumbersome. SAM-based Few-Shot Segmentation (FSS) addresses this limitation by leveraging annotated reference images to segment specific objects in target images without manual prompts. Nevertheless, existing SAM-based FSS approaches typically rely on a single prototype for pixel-level guidance, which struggles to capture fine-grained semantic details and is prone to unstable guidance due to noisy pixel features. To overcome these issues, we propose FGP-SAM with two components: (1) Fine-grained Multi-Prototype Fusion (FMPF), which fuses fine-grained textual prototypes with patch-level prototypes from reference images to build expressive fine-grained prototypes; and (2) Patch-level Prototype Matching (PLPM), which matches each target pixel with the most relevant fused fine-grained prototype based on the relationship between reference and target patch prototypes. Experiments on COCOtext{-}20^{i} and PASCALtext{-}5^{i} show that FGP-SAM achieves state-of-the-art (SOTA) performance.
|
| |
| 16:45-17:00, Paper TuB16.15 | |
| A Cost-Effective Robotic Apple Harvesting System with In-Hand Multimodal Grading Via Adaptive Gripping Mechanism |
|
| Yang, Yujia | Fudan University |
| Wang, Shaokun | Fudan University |
| Yang, Kaitai | Imperial College London |
| Zou, Jiehan | Fudan University |
| Cheng, Tianyu | Fudan University |
| Lu, Qiujie | Fudan University |
| Gan, Zhongxue | Fudan University |
Keywords: Robotic Systems, Application of Artificial Intelligence, AI and Applications
Abstract: Existing robotic apple harvesting systems mainly focus on target detection, grasping, and fruit detachment, while internal quality grading is still typically performed offline after harvest, which separates harvesting from quality assessment and increases operational cost and system complexity. To address this limitation, this paper presents a cost-effective integrated robotic system for apple harvesting and in-hand grading, which unifies harvesting, sweetness estimation, and grade-based sorting within a closed-loop pipeline. Compared with solutions relying on expensive hyperspectral devices, the proposed system combines a miniature near-infrared sensor with an RGB camera, making it more suitable for integration into a harvesting end-effector for online sweetness sensing. For Brix prediction, a Cross-Modal Calibration and Attention Fusion Network (CMCAF-Net) is proposed to jointly exploit external phenotypic cues from RGB images and internal compositional cues from near-infrared spectra. Experimental results show that the proposed method achieves an R^2 of 0.8965 and an RMSE of 0.5517 on the apple Brix prediction task. To support online measurement, an underactuated adaptive gripper with an integrated spectral sensing unit is further developed. During grasping, the gripper forms a locally light-shielded sensing region and improves probe--fruit coupling through contact-constrained pressing and local compliant fitting, thereby enhancing measurement stability. The developed robotic prototype realizes target perception, close-range image acquisition, in-hand spectral measurement, fruit harvesting, and grade-based placement.
|
| |
| 16:45-17:00, Paper TuB16.16 | |
| Closed-Loop Personalized Upper-Limb Rehabilitation with Digital Human Coaching and Large Language Model Feedback (I) |
|
| Liu, Zhiyun | South China University of Technology |
| Liu, Xinran | South China University of Technology |
| Zhu, Jinghui | South China University of Technology |
| Tu, Haoran | South China University of Technology |
| Zhao, Youran | South China University of Technology |
| Chan, Patrick | South China University of Technology |
Keywords: Medical Informatics, Assistive Technology, Human-Computer Interaction
Abstract: Conventional upper-limb rehabilitation training often suffers from limited personalization, coarse motion assessment, and insufficiently intuitive feedback, which restrict its effectiveness in home-based settings. To address these issues, this paper proposes a closed-loop personalized upper-limb rehabilitation system that integrates personalized standard-action generation, pose-based structured motion evaluation, large-language-model-based feedback, digital human coaching, and adaptive multi-round training update. Specifically, the system first generates personalized demonstration videos from user reference images and standard motion skeletons, thereby improving the familiarity and individual adaptability of rehabilitation guidance. It then performs structured motion evaluation through pose keypoint extraction, temporal alignment, and multi-level motion analysis, producing quantitative indicators and interpretable motion descriptors. Based on these results and paired keyframes from standard and user motions, the system employs a large language model to generate rehabilitation-oriented natural-language feedback, which is further delivered through digital human coaching videos for more intuitive guidance. In addition, the system updates the training target and threshold across rounds according to user performance, enabling adaptive progression in rehabilitation difficulty. Experimental results show that the proposed system can improve users' motion scores and pass rates over multiple training rounds. Moreover, compared with score-only feedback and score-plus-text feedback, the proposed multimodal feedback mechanism achieves better next-round improvement and higher pass rates. These results suggest that the proposed framework provides a feasible and effective solution for personalized intelligent upper-limb rehabilitation in home-based scenarios.
|
| |
| 16:45-17:00, Paper TuB16.17 | |
| PGFusion: Physically Grounded Radar-Camera Fusion for 3D Object Detection |
|
| Zhai, Shuangjiao | North University of China |
| Zhang, Xuan | School of Computer Science and Technology, North University of China |
| Chen, Ying | School of Computer Science and Technology, North University of China |
| Guo, Jiangtao | School of Computer Science and Technology, North University of China |
| Yang, Bo | Taiyuan University of Technology |
| Qin, Pinle | North University of China |
| Qin, Jia | North University of China |
Keywords: Autonomous Vehicle, Connected and Automated Vehicles, Machine Vision
Abstract: Radar-camera fusion has attracted growing attention for 3D object detection. However, existing methods do not fully exploit radar physical cues, limiting radar feature enhancement, accurate image depth estimation, and effective cross-modal fusion. To address this issue, we propose PGFusion, a multimodal fusion framework that incorporates radar physical priors into modality enhancement and cross-modal interaction. Specifically, PGFusion leverages radar physical attributes, including Doppler velocity and Radar Cross Section (RCS), to densify sparse radar features, enhance depth-sensitive image features, and modulate radar-camera fusion. To enhance modality-specific information, we introduce Physics-Guided Radar BEV Enhancement (PRBE), which adaptively densifies sparse radar features according to radar range, Doppler velocity, and RCS, yielding denser and more continuous radar features, and Geometry-Conditioned Depth Enhancement (GCDE), which exploits radar range and azimuth information to enhance depth-sensitive image features and improve geometric alignment. To further improve cross-modal fusion, we design Physics-Modulated Cross-Attention (PMCA), which derives an RCS-distribution-based confidence proxy from the physical attributes of radar returns and uses it to modulate Manhattan-distance-aware cross-attention, enabling the network to emphasize regions with higher proxy values during radar-camera interaction. Experiments on the nuScenes dataset show that PGFusion achieves 57.6% NDS and 46.2% mAP, outperforming the RCBEVDet baseline and demonstrating the effectiveness of the proposed fusion framework.
|
| |
| 16:45-17:00, Paper TuB16.18 | |
| Soft-Reservation-Based Adaptive Redundancy Scheduling for Time-Sensitive Networking |
|
| Liu, Yifan | Hebei University |
| Wang, Chaoyue | Hebei University |
Keywords: Adaptive Systems, Cyber-physical systems, Reinforcement Learning
Abstract: With the development of Industry 4.0, Time-Sensitive Networking (TSN) faces the challenge of balancing reliability and bandwidth efficiency while ensuring deterministic communication. To address the severe bandwidth waste in existing Frame Replication and Elimination for Reliability (FRER) mechanisms, an adaptive redundancy scheduling scheme is proposed. The core of our approach lies in decoupling the physical occupation from logical reservation of redundant resources. First, we design a path selection algorithm based on Deep Reinforcement Learning (DRL), specifically employing Graph Attention Networks (GAT) for topology state encoding combined with Proximal Policy Optimization (PPO) to optimize path decisions, optimizing routes for critical flows and their backup flows during the pre-scheduling phase to maximize path disjointness and balance link load. Second, we propose a soft-reserved backup mechanism that introduces a guard band quantization model and a non-critical flow occupation mapping table, allowing non-critical flows to dynamically reuse backup flow time slots during fault-free periods. Finally, integrating a lightweight fault prediction mechanism based on Long Short-Term Memory (LSTM) and a frame preemption-driven dynamic backup activation strategy, we achieve millisecond-level fault detection and backup flow activation. Joint simulation results based on OMNeT++ and Python demonstrate that, compared to traditional FRER schemes, our approach improves bandwidth utilization by over 30% while maintaining more than 95% reliability, with fault recovery latency meeting industrial control standards.
|
| |
| 16:45-17:00, Paper TuB16.19 | |
| Reconstruction-Generation Synergy for View Extrapolation in Driving Scenes |
|
| Ji, Yangzi | Sun Yat-Sen University |
| Gao, Hui | Sun Yat-Sen University |
| Liu, Yuliang | Huawei |
| Gou, Chao | Sun Yat-Sen University |
Keywords: Autonomous Vehicle, Image Processing and Pattern Recognition
Abstract: Novel view synthesis in driving scenes is critical for advancing the capabilities of end-to-end autonomous driving closed-loop simulation systems. Existing methods primarily focus on interpolated view synthesis but struggle with extrapolation rendering beyond training viewpoints due to sparse driving scene cameras, often suffering from severe artifacts or high computational costs. To alleviate the problem, we propose a progressive refinement method for extrapolated view rendering based on Reconstruction-Generation synergy. Our approach initially reconstructs the driving scene to derive initial, potentially degraded, extrapolated views alongside corresponding uncertainty quantifications. Subsequently, we redesign the denoising process of the Stable Video Diffusion model via dynamically modulating ordinary differential equation (ODE) derivative's direction. This innovative adaptation facilitates the generation of high-fidelity pseudo-supervisory signals for extrapolated views, demonstrably reducing rendering artifacts. An annealed denoising refinement mechanism is further introduced to enhance the rendering quality in extrapolated views. Finally, an asynchronous progressive training strategy is introduced to establish a reconstruction-generation closed loop, which not only enables extrapolated view refinement but also reduces computational cost.
|
| |
| 16:45-17:00, Paper TuB16.20 | |
| DST-CLD: Dual-Stage Trustworthy Contrastive Learning Defense against Backdoor Attacks in Power Systems |
|
| Zhang, JiPeng | Shanghai University of Electric Power |
| Fei, Zhanbo | Shanghai University of Electric Power |
Keywords: Intelligent Power and Energy Systems, Representation Learning, Systems Safety and Security
Abstract: Contrastive Learning (CL) is a self-supervised representation learning paradigm that has been widely used in power-system inspection and monitoring tasks, where labeled data are often limited. However, CL remains vulnerable to data-poisoning backdoor attacks, in which an adversary injects triggered samples during pre-training to implant spurious trigger--representation associations. Existing defenses are often restricted to either pre-training or downstream adaptation, making it difficult to maintain robustness throughout the full training pipeline. To address this issue, we propose DST-CLD, a Dual-Stage Trustworthy Contrastive Learning Defense framework that combines proactive pre-training screening with downstream purification. In Stage I, Mahalanobis distance is used to model the global feature distribution, and a soft-reweighting scheme suppresses suspicious samples. A Residual Bridge then transfers the estimated Stage-I suspicious-sample ratio and high-confidence anchors to Stage II, where Isolation Forest (IForest) removes residual outliers during fine-tuning. Experiments on power-system inspection datasets show that DST-CLD substantially reduces the Attack Success Rate (ASR), reaching the low single-digit range under the standard attack settings while preserving competitive clean accuracy. Additional experiments on minimal baselines, adaptive attacks, and training-time overhead further validate the design.
|
| |
| 16:45-17:00, Paper TuB16.21 | |
| Code Summary Generation Method Based on Self-Refinement |
|
| Xu, Tianyu | Nanjing University |
| Xu, Weili | Beiiing Information Science and Technology University |
| Shi, Qiancheng | Beijing Information Science and Technology University |
| Ji, Shiyu | Beijing Information Science and Technology University |
| Cui, Zhanqi | Beijing Information Science and Technology University |
Keywords: Machine Learning, Generative AI
Abstract: Code summary generation is an important technology for automatically converting source code into natural language descriptions, which plays a crucial role in program comprehension, software maintenance, and improving development efficiency. However, existing code summary generation methods still face several challenges, such as inaccurate semantic representation, lack of explicit feedback mechanisms, and limited ability to further refine generated results. In particular, methods based on large language models mostly adopt a single-pass generation strategy, which lacks effective evaluation and iterative refinement of the generated summaries, thereby restricting further improvements in generation quality. To address these issues, this paper proposes a code summary generation framework named SRCSG (Self-Refinement Code Summary Generation), which emphasizes iterative refinement. First, SRCSG employs a retrieval strategy based on k-Nearest Neighbors (kNN) and BM25 to obtain highly relevant similar examples for the target code. Then, a structured prompt template is designed to guide the large language model in generating an initial code summary. Finally, a self-refinement mechanism is introduced to construct structured feedback signals, enabling the model to iteratively refine the generated summaries and learn a transferable refinement strategy, thereby adaptively improving the target code summary. Experimental results demonstrate that SRCSG significantly outperforms existing methods in terms of BLEU, METEOR, and ROUGE-L metrics, achieving improvements of 392.85%, 83.35%, and 55.05% over the strongest baseline, respectively. The proposed method effectively enhances both the semantic accuracy and the fluency of the generated code summaries.
|
| |
| 16:45-17:00, Paper TuB16.22 | |
| Contrastive Learning with Large Language Models for Missing Modality Challenge |
|
| Zheng, Haolong | Shandong Normal University |
| Wang, Xinyue | Shandong University of Finance and Economics |
| Zhang, Enze | Shandong Normal University |
| Zheng, Tenglong | Hebei University of Science and Technology |
| Li, Yun | China University of Geosciences |
Keywords: Deep Learning, Affective Computing
Abstract: Modality missing is common due to imperfect data collection, posing a major challenge for multimodal learning in open-world settings. Most studies address modality missing via reconstruction, which broadly falls into two paradigms: deterministic reconstruction and distribution-based generation. Both paradigms typically learn cross-modal correspondences from scratch using limited training data. Consequently, under complex conditions, the generated representations often exhibit weak semantic coherence and poor generalization. Moreover, conditional generation for modality recovery is highly sensitive to the quality of observed modalities and can be degraded by noise and bias. To mitigate these limitations, we propose a Contrastive Learning with Large Language Models (CLLM) framework. CLLM uses prompt to generate missing modality representations and employs contrastive learning to supervise them, improving semantic consistency and discriminability. We then combine the generated and observed representations within a fusion graph and a Transformer backbone for multimodal modeling and sentiment prediction. Experiments on three benchmark multimodal sentiment analysis datasets show that CLLM consistently outperforms prior methods across all evaluation metrics. We further conduct systematic ablations to quantify the contribution of each component and assess robustness, confirming effectiveness in missing modality scenarios.
|
| |
| 16:45-17:00, Paper TuB16.23 | |
| Web-Gewu: A Browser-Based Interactive Playground for Robot Reinforcement Learning |
|
| Chen, Kaixuan | Shanghai University |
| Ye, Linqi | Shanghai University |
Keywords: Reinforcement Learning, Cloud, IoT, and Robotics Integration, Human-Machine Interaction
Abstract: With the rapid development of embodied intelligence, robotics education faces a dual challenge: high computational barriers and cumbersome environment configuration. Existing centralized cloud simulation solutions incur substantial GPU and bandwidth costs that preclude large-scale deployment, while pure local computing is severely constrained by learners' hardware limitations. To address these issues, we propose Web-Gewu, an interactive robotics education platform built on a WebRTC cloud-edge-client collaborative architecture. The system offloads all physics simulation and reinforcement learning (RL) training to the edge node, while the cloud server acts exclusively as a lightweight signaling relay, enabling extremely low-cost browser-based peer-to-peer (P2P) real-time streaming. Learners can interact with multi-form robots at low end-to-end latency directly in a web browser without any local installation, and simultaneously observe real-time visualization of multi-dimensional monitoring data, including reinforcement learning reward curves. Combined with a predefined robust command communication protocol, Web-Gewu provides a highly scalable, out-of-the-box, and barrier-free teaching infrastructure for embodied intelligence, significantly lowering the barrier to entry for cutting-edge robotics technology.
|
| |
| 16:45-17:00, Paper TuB16.24 | |
| SimAMM-YOLO: Tomato Keypoint Localization for Robotic Harvesting in Complex Environments |
|
| Hou, Junzhuang | Qilu University of Technology |
| Li, Tianfa | Jinan Institute of Supercomputing Technology |
| Pan, Jingshan | Qilu University of Technology |
| Niu, Liming | Jinan Institute of Supercomputing Technology |
| Ji, Ming | Shandong Province Agricultural Exchange and Cooperation Center |
| Arkhipov, Alexander | Jinan Institute of Supercomputing Technology |
Keywords: Machine Vision, Robotic Systems, Image Processing and Pattern Recognition
Abstract: ,成熟番茄的精 0934;定位至关重要 机器人成功收割 0340;前提。现状 轻量级姿态估计 7169;型在以下有局༈ 0;性 应对以严重为特 4449;的复杂环境 阻塞和生长不规 1017;。为了解决这ߑ 0;问题 我们提出了SimAMM-YOLO的 改进模型,基于 YOLO11n-pose。构建了一个 ;番茄关键点数据 38598;使用真实的温室 2270;像,包括遮挡ࡴ 4;收获场景中的照 6126;变化。首先, 在骨干网络中, 5105;们设计了一个જ 9;块,用于组合 反向深度可分卷 1215;,其中 无参数注意力机 1046;SimAM以替代 原始C3k2瓶颈层,从 ;而减少 在增强局部特征 0340;同时实现计算ࠨ 7;余 撤离。其次,基 0110;State 的 C3k2 模块 空间模型(SSM)集 成到颈部网络中 2290;就是这样 模块通过加强功 3021;融合来提高特ঌ 9;融合的一致性 全局依赖建模, 6377;助于缓解关键 7;问题 遮挡漂移。实'
|
| |
| 16:45-17:00, Paper TuB16.25 | |
| A Surrogate-Assisted Hybrid Genetic Algorithm and Dynamic Programming for Makespan Minimization on Parallel Machines with Maintenance Constraints |
|
| Iken, Fatima | Université De Haute-Alsace, IRIMAS UR 7499, F-68100 Mulhouse, France |
| Abdennour, Azerine | Université De Haute-Alsace, IRIMAS UR 7499, F-68100 Mulhouse, France |
| Golabi, Mahmoud | IRIMAS - University of Haute Alsace |
| Idoumghar, Lhassane | Université De Haute-Alsace |
Keywords: Metaheuristic Algorithms, Evolutionary Computation, Optimization and Self-Organization Approaches
Abstract: This paper studies the unrelated parallel machine scheduling problem with non-resumable maintenance periods under the makespan minimization objective. The problem is addressed through a decomposition that separates job-to-machine assignment from machine-level scheduling decisions induced by maintenance constraints. A genetic algorithm is used to explore the assignment space, while the induced single-machine subproblems reduce to 0–1 knapsack problems and are evaluated exactly using dynamic programming. Although exact evaluation ensures high solution fidelity, it introduces a significant computational bottleneck during evolutionary search. To alleviate this cost, a surrogate-assisted framework based on Random Forest regression is integrated into the genetic algorithm, selectively replacing exact evaluations with predictions while retaining conservative safeguards for reliability. Computational experiments on a diverse benchmark set show that the surrogate-assisted approach achieves substantial reductions in computational time with only moderate, configuration-dependent degradation in solution quality. The results demonstrate that surrogate-assisted evaluation provides an effective trade-off between efficiency and accuracy for maintenance-constrained unrelated parallel machine scheduling problems.
|
| |
| 16:45-17:00, Paper TuB16.26 | |
| Human-Attention-Aware Knowledge Distillation for Edge Vision Systems |
|
| Zhou, Hongyang | CTRI |
| Xue, Junda | CTRI |
| Hu, Jie | CTRI |
| Zhang, Yuan | CTRI |
Keywords: Human-centered Learning, Deep Learning, Machine Learning
Abstract: Vision-based models have achieved remarkable success but face significant deployment challenges in resourceconstrained edge devices within human-machine collaborative systems. Traditional Knowledge Distillation (KD) effectively compresses these models by transferring feature representations from a cumbersome teacher to a lightweight student. However, existing KD methods typically treat all spatial regions equally, neglecting the fact that human perception and task-critical information are highly localized. To bridge this gap and align with human-centric intelligence, we propose a novel HumanAttention-Aware Knowledge Distillation (HAA-KD) framework. HAA-KD introduces a saliency-guided weighting mechanism that dynamically modulates the distillation loss based on human visual attention priors. By forcing the student network to prioritize the emulation of the teacher’s features in highly salient regions while relaxing constraints on task-irrelevant backgrounds, our method optimizes the limited capacity of the student model. Extensive experiments on CIFAR-100, ImageNet-100, and BDD100K demonstrate that HAA-KD consistently outperforms state-of-the-art distillation methods, with the largest gains observed in complex scenes where foregroundbackground discrimination is critical. Saliency alignment evaluation on the SALICON dataset further confirms that the generated attention maps correlate strongly with human visual fixation. Furthermore, deployment tests on edge computing platforms validate its superior inference latency and robustness, highlighting its potential for real-time, human-centric cyberphysical systems.
|
| |
| 16:45-17:00, Paper TuB16.27 | |
| SCNet: Explicit Same-Scale Cross-Channel Modeling for Multi-Scale Multivariate Time Series Forecasting |
|
| Cao, Lei | Nanjing University of Science and Technology |
| Xu, Can | Nanjing University of Science and Technology |
| Yan, Hui | Nanjing University of Science and Technology |
Keywords: Deep Learning, Machine Learning, Neural Networks and their Applications
Abstract: 多尺度分解已被广泛证明能够提升多变长时间序列预测的性能。不同时间尺度下的表征能够捕捉原始序列的多粒度特征。同时,不同变量在同一时间尺度内往往呈现出显著的跨通道相关性。因此,直接建模同尺度下的跨通道依赖关系(即我们所称的显式建模)至关重要。然而,现有基于多尺度分解的方法通常通过融合不同时间尺度的表征来隐式地建模跨通道关系。实证结果表明,与显式建模相比,隐式建模在捕捉跨通道依赖方面的效率低 28%,凸显了现有方法的局限性及其对预测精度的潜在影响。为解决这一问题,我们提出了一种新的多变长时间序列预测框架,称为 SCNet,用于显式建模同尺度跨通道依赖关系与时间依赖关系。具体而言,
|
| |
| 16:45-17:00, Paper TuB16.28 | |
| Semi-Supervised Sound Event Detection with Conditional Mixup and Embedding-Level Contrastive Loss |
|
| Shao, Nian | Zhejiang University |
| Li, Xian | Westlake University |
| Li, Xiaofei | Westlake University |
Keywords: Human Perception in Multimedia, Representation Learning, Deep Learning
Abstract: Sound event detection (SED) is a core module for acoustic environmental analysis, yet its performance is often limited by scarce labeled data. Recent systems therefore leverage large pretrained audio foundation models, but effective fine-tuning remains challenging because labeled data are limited while unlabeled data are abundant. Previously, ATST-SED mitigates this problem with a pseudo-label based semi-supervised fine-tuning framework. In this work, we further improve the framework by adopting an embedding-level self-supervised contrastive loss inspired by ATST-Frame pretraining. This contrastive objective better exploits unlabeled data during fine-tuning. One challenge is that mixup serves different roles in the two objectives: pseudo-label learning uses composition mixup, while contrastive learning treats mixup as a perturbation. To resolve this mismatch, we propose conditional mixup, which combines composition mixup and perturbation mixup in one semi-supervised framework and defines the corresponding embedding-level contrastive losses. The resulting model, ATST-SEDv2, achieves 0.645 PSDS_1 and 0.822 PSDS_2 on the DESED validation set, establishing a new state of the art.
|
| |
| 16:45-17:00, Paper TuB16.29 | |
| ACGF-Net: Asymmetric Context-Aware Gated Fusion for Robust Multi-Modal Analysis in Medical Informatics |
|
| Guo, Yunyan | Lanzhou University |
| Fan, Xianjun | Lanzhou University |
| Yuan, Min | Lanzhou University |
Keywords: Medical Informatics, Deep Learning, Image Processing and Pattern Recognition
Abstract: Precise segmentation of pathological structures from multi-modal Magnetic Resonance Imaging (MRI) data is a fundamental prerequisite for medical informatics and cyber-medical systems. Although integrating complementary information from multiple MRI sequences is essential for comprehensive lesion analysis, effective fusion remains challenging due to the inherent quality disparity between imaging sequences. Existing methods typically adopt symmetric fusion paradigms that treat all modalities equally, often leading to negative transfer, where noise from low-quality auxiliary modalities degrades the robust features of the dominant modality. To address this, we propose the Asymmetric Context-Aware Gated Fusion Network (ACGF-Net), a generalized framework for robust medical image analysis, specifically instantiated and validated on the challenging task of brain tumor segmentation. Unlike conventional approaches, our framework explicitly prioritizes the dominant modality via a weight-shared Siamese encoder and a novel asymmetric fusion mechanism. Specifically, we introduce an Asymmetric Context-Aware Gated Fusion (ACGF) module that utilizes depthwise convolutions to distinguish structural boundaries from background noise based on local spatial patterns. Furthermore, a Zero-Initialized Residual strategy is designed to ensure the model retains the performance lower-bound of the dominant modality, enabling stable full fine-tuning of foundation models. Extensive experiments on the BraTS 2021 benchmark demonstrate that ACGF-Net significantly outperforms a wide range of representative segmentation methods, from classic CNNs to SAM-based foundation models, in segmentation accuracy and boundary delineation. Moreover, our framework exhibits superior robustness across various auxiliary modality combinations, providing a reliable solution for high-fidelity clinical decision support.
|
| |
| 16:45-17:00, Paper TuB16.30 | |
| MSQM: Multi-Scale Prompt Learning and Quality-Aware Memory Bank for Source-Free Unsupervised Domain Adaptation in Fundus Image Segmentation |
|
| Gao, Shangxuan | Inner Mongolia Normal University |
| Xu, Qiaozhi | Inner Mongolia Normal University |
| Yin, Yanjun | Inner Mongolia Normal University,College of Computer Science and Technology |
| Zhi, Min | Inner Mongolia Normal University |
Keywords: Transfer Learning, Image Processing and Pattern Recognition, Deep Learning
Abstract: Abstract— To address the challenges of inadequate heterogeneity modeling and pseudo-label noise in Source-Free Unsupervised Domain Adaptation (SFUDA), this paper proposes a fundus image segmentation method (MSQM) based on multi-scale prompt learning and a quality-aware memory bank.This method utilizes multi-scale prompt learning to perform hierarchical calibration on target domain features to alleviate domain shifts, and constructs a quality-aware memory bank to filter high-quality features and stabilize the self-training process; experiments demonstrate that it significantly improves cross-domain performance and robustness. Index Terms— Source-free unsupervised domain adaptation, fundus image segmentation, multi-scale prompt learning, quality-aware memory bank.
|
| |
| 16:45-17:00, Paper TuB16.31 | |
| Attack Success Rate Is Not All You Need: A Comprehensive Adversarial Vulnerability Assessment in Medical AI |
|
| Curl, Emily | University of Alabama |
| Ampomah, Kofi | PhD Research Student, University of Alabama |
| Erfan, Md | PhD Research Student, University of Alabama |
| Dibbo, Sayanton V. | The University of Alabama |
Keywords: Deep Learning, AI and Applications, Medical Informatics
Abstract: While deep learning systems are becoming increasingly prevalent in medical image analysis, their vulnerabilities to adversarial perturbations raise serious concerns for clinical deployment. These vulnerability evaluations largely rely on Attack Success Rate (ASR), a binary metric that indicates solely whether an attack is successful. However, the ASR metric does not account for other factors, such as perturbation strength, perceptual image quality, and cross-architecture attack transferability, and therefore, the interpretation is incomplete. This gap requires consideration, as complex, large-scale deep learning systems, including Vision Transformers (ViTs), are increasingly challenging the dominance of Convolutional Neural Networks (CNNs). These architectures learn differently, and it is unclear whether a single metric, e.g., ASR, can effectively capture adversarial behavior. To address this, we perform a systematic empirical study on four medical image datasets: PathMNIST, DermaMNIST, RetinaMNIST, and CheXpert. We evaluate seven models (VGG-16, ResNet-50, DenseNet-121, Inception-v3, DeiT, Swin Transformer, and ViT-B/16) against seven attack methods at five perturbation budgets, measuring ASR, Peak Signal-to-Noise Ratio (PSNR), Structural Similarity Index Measure (SSIM), and L_2 perturbation magnitude. Our findings show a consistent pattern: perceptual and distortion metrics are strongly associated with one another and exhibit minimal correlation with ASR. This applies to both CNNs and ViTs. The results demonstrate that ASR alone is an inadequate indicator of adversarial robustness and transferability. Consequently, we argue that a thorough assessment of adversarial risk in medical AI necessitates multi-metric frameworks that encompass not only the attack efficacy but also its methodology and associated overheads.
|
| |
| 16:45-17:00, Paper TuB16.32 | |
| CA-DGCL: Dynamic Graph Continual Learning Via Condensation and Attachment |
|
| Yan, Tingxu | Southwest University |
| Yuan, Ye | Southwest University |
Keywords: Deep Learning, Representation Learning
Abstract: Dynamic graph continual learning (DGCL) is an effective manner for handling catastrophic forgetting in dynamic graphs. However, existing DGCL methods underutilize temporal information across graph snapshots. To address this critical issue, we propose a novel framework for Dynamic Graph Continual Learning via Condensation and Attachment (CA-DGCL). Specifically, CA-DGCL first condenses historical graph snapshots into compact semantic representations efficiently. Further, a cross-timestamp node chains is built to construct a third-order tensor and Tucker decomposition is applied to this tensor for obtaining stable node features, which encapsulate historical knowledge. Finally, these node features are used to generate new nodes and attached to the current graph for replaying of past information without compromising the new patterns. In addtion, a refined forgetting measure is introduced to make it more suitable for dynamic graph settings. Extensive experiments demonstrate that CA-DGCL outperforms baselines in forgetting suppression as well as maintain competitive accuracy, proving its efficacy for dynamic graph continual learning.
|
| |
| 16:45-17:00, Paper TuB16.33 | |
| ATTUNE: Adaptive Tuning for Understanding Neurodivergent Expression in LLM Interactions |
|
| Muniganti, Vyshnavi | University of Essex |
| Doctor, Faiyaz | University of Essex, Essex, UK, |
| Anisi, Mohammad Hossein | University of Essex |
| Bourazeri, Aikaterini | University of Essex |
Keywords: Human-Machine Interaction, Cognitive Computing, Companion Technology
Abstract: Large Language Models are rapidly becoming core components of human-centric intelligent systems. However, their default conversational behaviours often fail to accommodate the heterogeneous cognitive and sensory needs of neurodivergent users, creating barriers to equitable human machine interaction. This paper presents ATTUNE, a proof-of-concept profile-conditioned fine-tuning framework that trains LLMs to adapt their conversational behaviour based on a structured Neurodivergent Communication Profile (NCP). The NCP schema comprises seven empirically grounded adaptation dimensions (p1–p7): literalness, verbosity tolerance, metaphor use, sensory load, interaction pacing, emotional explicitness, and autonomy preservation. We construct a training corpus of 1,447 instances by extracting NCP-annotated instructions from autistic community discourse on Reddit, generating profile conditioned assistant responses through a two-stage pipeline, and integrating the AUTALIC expert-annotated ableist language dataset. We fine-tune Gemma 4 E4B using QLoRA with profile conditioned inputs. A four-condition ablation study demonstrates that NCP conditioning substantially increases communication style differentiation, that the anti-masking constraint reduces masking-associated language, and that finetuning improves autonomy preservation and response completeness beyond prompt engineering alone. Supplementary LLM-as-judge scoring across clarity, helpfulness, autonomy respect, and coherence provides additional evidence of profile appropriate adaptation.
|
| |
| 16:45-17:00, Paper TuB16.34 | |
| Enhanced Federated Learning Via Generative Memory |
|
| Ma, Jun | Tongji University |
| Shi, Lihua | Tongji University |
| Huang, Wangya | Tongji University |
| Kang, Qi | Tongji University |
Keywords: Distributed Intelligent Systems
Abstract: Federated Learning (FL) serves as a decentralized machine-learning paradigm where a global server iteratively collects knowledge by aggregating the model parameters or gradients of local users without requiring direct access to private client data. Simple model aggregation drives the averaged global model away from the globally optimal one. which can greatly limit FL’s applicability and performance. Most existing approaches tackle the heterogeneity challenge during local training or model aggregation while ignoring the performance degradation induced by direct model aggregation and catastrophic forgetting in the global model. In this paper, we propose an Enhanced Federated Learning via Generative Memory (EFedGM) approach designed to relieve the adverse effect of heterogeneity and catastrophic forgetting within the FL framework. At the server level, we introduce a generative training phase that optimizes a generative model to better preserve prior knowledge after models’ aggregation. Furthermore, the server-side generator provides synthetic data to facilitate local model adaptation on the client side. Extensive experiments across a diverse range of benchmarks validate the efficacy of our approach, demonstrating its superiority over state-of-the-art FL baselines
|
| |
| 16:45-17:00, Paper TuB16.35 | |
| MSGFormer: Multi-Scale Graph Transformer with Inference-Free Topology Stabilization for Multivariate Time Series Forecasting |
|
| Wang, Wenhao | Zhengzhou University |
| Xiong, Shufang | Zhengzhou University |
| Li, Qiang | Southeast University |
| Yan, Xiaoqiang | Zhengzhou University |
| Wu, Yunpeng | Zhengzhou University |
Keywords: Machine Learning, Deep Learning, Complex Network
Abstract: Multivariate time-series forecasting requires modeling both temporal dynamics within each variable and structural dependencies across variables. Recent graph-enhanced Transformers improve inter-series modeling, but most of them rely on a single Top-k graph, which imposes one fixed neighborhood scale on heterogeneous dependencies. A small k may miss weak but useful correlations, whereas a large k may introduce noisy edges and over-smoothed propagation. To address this sparsity-integrity dilemma, we propose MSGFormer, a multi-scale graph Transformer with inference-free topology stabilization. MSGFormer constructs two complementary graph views: a local graph for high-confidence interactions and a global graph for broader structural coverage. The two views are adaptively fused and injected into a channel-independent temporal encoder through graph-aware attention and CLS-only propagation. To stabilize graph learning under discrete Top-k sparsification, we further introduce an EMA topology regularization used only during training. Experiments on nine real-world benchmarks show that MSGFormer is consistently competitive, with clearer gains on high-dimensional datasets such as Traffic and Electricity and under longer prediction horizons.
|
| |
| 16:45-17:00, Paper TuB16.36 | |
| A 3D Path Planning Algorithm for UAVs Based on a Two-Layer Evolutionary Architecture and Memory Reorganization |
|
| Wang, Wei | Dongguan University of Technology |
| Li, Huan | Dongguan University of Technology |
| Wei, Wenhong | Dongguan University of Technology |
Keywords: Evolutionary Computation
Abstract: UAV path planning in complex 3D terrain is a high-dimensional nonlinear optimization problem in which conventional PSO-based methods are prone to premature convergence and unsafe terrain penetration. To address these issues, this paper proposes a hybrid differential evolution particle swarm optimization (HDE-PSO) algorithm based on a two-layer evolutionary architecture and memory reorganization. The outer layer retains PSO's global search capability, while the inner layer reorganizes historical best solutions through differential mutation and crossover with a cosine dynamic decay strategy to balance exploration and exploitation. A continuous 3D terrain model combining Gaussian peaks and fractional Brownian motion is constructed, with bilinear interpolation, B-spline smoothing, and hard safety penalties used to enforce obstacle-avoidance constraints. Comparative simulations show that HDE-PSO improves path cost, convergence accuracy, and obstacle-avoidance reliability over representative state-of-the-art algorithms.
|
| |
| 16:45-17:00, Paper TuB16.37 | |
| Decoupling Global Boundary and Local Cohesion: A Dual-Stream Grid Network for Chinese Nested NER |
|
| Liu, Nuoxian | Shanghai University of Electric Power, Shanghai, |
| Wang, Xilong | Shanghai University of Electric Power |
| Lu, Chunyue | Shanghai University of Electric Power |
| Zuo, Wei Xin | Shanghai University of Electric Power |
Keywords: Machine Learning, Knowledge Acquisition, Computational Intelligence
Abstract: Unlike English, Chinese text lacks explicit word boundaries and exhibits complex nested structures, frequently exacerbating boundary confusion and semantic ambiguity in Named Entity Recognition (NER). While recent grid-based methods effectively capture global span interactions, they struggle to encode the local character cohesion crucial for resolving nested entities of varying scales. To address this, we propose a novel Dual-Stream Grid Network designed to simultaneously extract global structural priors and local semantic textures. Specifically, an Axial Boundary Attention module serves as the global stream to capture long-range dependencies, while a Dense Multi-Scale CNN acts as the local stream to model adjacent character cohesion across diverse span lengths. To integrate these heterogeneous representations without inducing boundary feature contamination, we propose a novel Cross-Axial Gating mechanism. By orthogonally decoupling the fusion process into start- and end-boundary gates with channel-aware routing, CAG strictly cross-verifies boundary contexts to adaptively balance local details and global structures. Extensive experiments on multiple Chinese datasets and the English GENIA benchmark demonstrate that our architecture effectively mitigates nesting ambiguity and achieves highly competitive performance, establishing new competitive results particularly in boundary prediction precision.
|
| |
| 16:45-17:00, Paper TuB16.38 | |
| A Hybrid Approach to Program Slicing Using Large Language Models and Static Analysis |
|
| Chiang, Chia-Chu | University of Arkansas at Little Rock |
| Sackey, Samuel | University of Arkansas at Little Rock |
Keywords: AI and Applications, Application of Artificial Intelligence, Intelligence Interaction
Abstract: Abstract— Traditional program slicing techniques are inherently language-dependent because they rely on deep analysis of a program's specific syntax and operational semantics to identify program dependencies. The most recent program slicing techniques using large language models struggle to accurately capture program dependencies because analysis is treated as a statistical reasoning rather than a strict logical reasoning process. This research combines LLMs with traditional analysis tools, such as using LLMs to suggest slices and then using static tools to verify them. This hybrid approach improves scalability and accuracy for program slices than either one alone.
|
| |
| 16:45-17:00, Paper TuB16.39 | |
| Optimal Bipartite Consensus for Heterogeneous UAV-UGV Coordination Via Identifier-Free Critic Learning |
|
| Zhang, Tiehui | Jining University |
| Zhu, Yunhan | Jiningxueyuan |
| Tian, Congfeng | Shantui Construction Machinery Co., Ltd.; Tongji University |
| Zhai, Peng | Jining University |
Keywords: Game Theory and Multi-Agent Systems, Optimization Control, Robotic Systems
Abstract: This paper studies optimal bipartite tracking for heterogeneous unmanned aerial vehicle-unmanned ground vehicle (UAV-UGV) systems over signed communication graphs. A prescribed performance control (PPC) transformation is embedded into the bipartite consensus error so that transient overshoot and steady-state accuracy are explicitly constrained. Then, an identifier-free integral reinforcement learning (IRL) controller is developed. Unlike identifier-critic-actor schemes, the proposed method uses the integral Bellman equation and a single critic network to update the value approximation from measurable data, thereby avoiding the propagation of identifier errors of online neural networks. The stochastic Hamilton-Jacobi-Bellman (HJB) equation and the critic weight update are analyzed under explicitly stated boundedness and interval persistence-of-excitation assumptions. Simulations on a mixed UAV-UGV team verify that the proposed method satisfies the PPC bound and achieves faster convergence than PID, standard actor-critic, and LQR adaptive optimal benchmarks.
|
| |
| 16:45-17:00, Paper TuB16.40 | |
| GeoLMA: A Collaborative Multi-Agent Framework for Geometry Theorem Proving |
|
| Wu, Yuzhuo | East China Normal University |
| Peng, Xiao | East China Normal University |
| Liangyu, Chen | East China Normal University |
Keywords: Generative AI, Application of Artificial Intelligence, Reinforcement Learning
Abstract: Geometric problem solving requires rigorous logical reasoning and precise algebraic computation. Existing neural-symbolic solvers typically follow a unidirectional predict-apply paradigm that cannot recover from incorrect theorem selections, while Large Language Model (LLM) based approaches lack formal verification and often produce logically inconsistent solutions. We propose GeoLMA, a multi-agent framework that integrates Monte Carlo Tree Search (MCTS) with FormalGeo, a formal symbolic reasoning system. GeoLMA employs three collaborative LLM-based agents, an Expander for theorem generation, an Evaluator for progress assessment, and a Reflector that converts rejected theorem applications into structured guidance, enabling the system to learn from failures without costly policy optimization. Experiments on the FormalGeo7k dataset show that GeoLMA achieves 87.02% Overall Accuracy, 75.34% Average Accuracy, and 93.89% Problem Completion Rate (PCR). The gains are most pronounced on problems requiring long reasoning chains: on the Medium difficulty tier, GeoLMA outperforms the strongest neural-symbolic baselines by 2.15% and 4.09% in accuracy, while improving Average Accuracy by 1.55% and PCR by 1.85% overall. The code is available at https://github.com/Ukashi0/GeoLMA.
|
| |
| 16:45-17:00, Paper TuB16.41 | |
| A Global–Local Dual-Path Learning Framework for Multimodal Sentiment Analysis |
|
| Li, Fubin | Shandong Normal University |
| Xu, Fuyong | Shandong Normal University |
| Wang, Ru | Shandong Normal University |
| Liu, Peiyu | Shandong Normal University |
| Xu, Liancheng | Shandong Normal University |
Keywords: Multimedia Computation, Affective Computing, Artificial Social Intelligence
Abstract: Multimodal Sentiment Analysis (MSA) interprets human emotions by integrating linguistic, acoustic, and visual data. However, existing methods often struggle to balance cross-modal consistency with modality-specific characteristics, yielding suboptimal representations. To address this, we propose the Global–Local Dual-Path Learning Framework (GLDPL). GLDPL employs shared and specific encoders to explicitly model global inter-modal consistency and local intra-modal distinctions. Specifically, we introduce a Dual-Domain Attention Interaction (DAI) module to enhance semantic complementarity by refining discriminative cues, and a Cross-Modal Consistency Aggregation Module (CCAM) to effectively integrate emotion-consistent information. By collaboratively fusing these dual-path representations, GLDPL generates robust affective features. Experiments on the CMU-MOSI and CMU-MOSEI datasets validate the effectiveness and robustness of GLDPL compared to state-of-the-art baselines.
|
| |
| 16:45-17:00, Paper TuB16.42 | |
| UGNet: An Uncertainty-Guided Volumetric Context Network for Precise Glioma Segmentation (I) |
|
| Li, Jianqiang | Beijing University of Technology |
| Liu, Fangyi | Beijing University of Technology |
| Cheng, Wenxiu | Beijing University of Technology |
| Zhao, Linna | Beijing University of Technology |
| Dong, Zisu | Beijing University of Technology |
Keywords: Medical Informatics, Image Processing and Pattern Recognition, Deep Learning
Abstract: Precise segmentation of gliomas from Magnetic Resonance Imaging (MRI) is essential for neurosurgical planning and radiotherapy. However, existing deep learning frameworks often produce deterministic outputs that struggle with voxel-level ambiguities at infiltrative tumor margins and are often insufficient in capturing local inter-slice dependencies across the sequence dimension. In this paper, we propose UGNet, a novel uncertainty-guided network that synergizes volumetric modeling with uncertainty-driven feature refinement. Built upon a classic U-Net-style encoder-decoder architecture, our framework introduces two core innovations. Specifically, a bi-directional convolutional gated recurrent unit (Bi-ConvGRU) engine is integrated into the bottleneck to capture adjacent volumetric context and inter-slice dependencies. Furthermore, we introduce a Hybrid Gating module that utilizes predictive uncertainty as an active guidance signal to adaptively fuse target-frame features with volumetric context, thereby refining segmentation in challenging boundary regions. Experimental results on benchmark datasets demonstrate that UGNet significantly improves segmentation accuracy and robustness compared to state-of-the-art deterministic models, providing a more reliable tool for clinical decision support.
|
| |
| 16:45-17:00, Paper TuB16.43 | |
| Multimodal Spatiotemporal-Frequency Fusion with Peak Enhancement for Cellular Traffic Forecasting |
|
| Li, Qingzhong | Xinjiang University |
| Hu, Yue | Xinjiang University |
| Ma, Hui | Xinjiang University |
| Zhang, Yajun | Xinjiang University |
| Pei, Xinjun | Xinjiang University |
| Yan, Ming | Xinjiang University |
| Xing, Fei | Xinjiang University |
Keywords: Communications, Cyber Systems and Engineering, Neural Networks and their Applications
Abstract: Accurate forecasting of cellular network traffic is essential for network planning, resource allocation, and quality-of-service assurance in modern mobile communication systems. Real-world traffic often exhibits bursty endogenous dynamics and disturbances triggered by external urban events, which makes reliable prediction highly challenging. Most existing spatiotemporal traffic forecasting methods primarily focus on intrinsic traffic patterns or structural relationships within a single modality, and rarely model burst behavior together with exogenous contextual signals. To address this issue, we propose textbf{MSPF-Net}, a multimodal cellular traffic forecasting framework that integrates external contextual information. Specifically, MSPF-Net consists of a Spatiotemporal-Frequency Traffic Encoder for capturing temporal, spatial, and spectral traffic patterns, a Peak Enhancement Module for extracting burst-aware representations of sudden spikes, a News Context Representation Module for encoding urban news streams into exogenous contextual embeddings, and a Dynamic Fusion Prediction Module for adaptively integrating these heterogeneous signals to generate forecasts. Experiments on the Milano, Trento, and LTE traffic datasets demonstrate that jointly modeling traffic dynamics, burst patterns, and news contextual signals can effectively improve forecasting performance.
|
| |
| 16:45-17:00, Paper TuB16.44 | |
| FedDOM: A Lightweight Federated Debiased Orthogonal Learning Framework for Highly Heterogeneous Data |
|
| Yuan, Jiaqian | Southwest University of Science and Technology |
| Qin, Renchao | Southwest University of Science & Technology |
| Song, Qingyang | Ya'an Urban Management Information Service Center |
| Li, Peiyi | Southwest University of Science and Technology |
| Yongqi, Yu | Southwest University of Science and Technology |
| Peng, Lijuan | Southwest University of Science and Technology |
Keywords: Machine Learning, Optimization Control, Distributed Intelligent Systems
Abstract: Client drift remains a critical bottleneck for federated learning (FL) in highly heterogeneous data environments. This challenge is particularly pronounced in edge computing scenarios, where resource-constrained lightweight networks often struggle to learn unbiased feature representations. To address this issue, we propose FedDOM (Federated Debiasing with Forward-looking Orthogonal Momentum), a novel cloud-edge collaborative framework. On the server side, we introduce a global momentum mechanism that aggregates historical momentum and current pseudo-gradients to mitigate heterogeneous noise. By extrapolating current optimization trends, this mechanism constructs a predictive "forward-looking anchor" and employs an Exponential Moving Average (EMA) strategy to stabilize convergence. On the client side, FedDOM leverages the Kullback-Leibler (KL) divergence between the local model and the forward-looking anchor to inject orthogonal perturbations along the optimization direction within a constrained parameter space. Furthermore, we formulate the framework from a discrete control system perspective, providing a rigorous system dynamics proof to derive an upper bound on the steady-state residual noise. Extensive experiments on the CIFAR-10, CIFAR-100, and SVHN datasets demonstrate that, under severe Dirichlet non-IID settings and lightweight network constraints, FedDOM and its EMA variant achieve superior convergence accuracy and stability compared to state-of-the-art baselines.
|
| |
| 16:45-17:00, Paper TuB16.45 | |
| A Prompt-Enhanced Adaptive Multi-Expert Fusion Framework for Multimodal Named Entity Recognition with Multiple Images |
|
| Qi, Rongzhi | Hohai University |
| Li, Yadi | Hohai University |
| Li, Shuiyan | Hohai University |
Keywords: Multimedia Computation, Knowledge Acquisition, Deep Learning
Abstract: Multimodal named entity recognition (MNER) with multiple images is important for understanding social media content. Compared with traditional single-image methods, it faces additional challenges from varying image relevance, noisy visual cues, and imbalance between textual and visual modalities. To address these challenges, we propose a Prompt-enhanced Adaptive Multi-Expert Fusion Framework (PAMEF). PAMEF adopts a hierarchical fusion pipeline to integrate multimodal information. First, a Multi-Image Adaptive Adjustment Mechanism estimates image importance and suppresses noise. Then, a Multi-Expert Fusion Module captures intra-modal and inter-modal dependencies through expert-based fusion. Finally, a Dual Feature Enhancement Strategy enhances cross-modal information propagation. Experimental results show that PAMEF improves the F1 score by 2.46% over the best-performing baseline on the multi-image dataset MNER-MI, and remains competitive on the more complex mixed-scenario dataset MNER-MI-Plus. These results demonstrate the effectiveness of PAMEF for multi-image MNER.
|
| |
| 16:45-17:00, Paper TuB16.46 | |
| Scene-Conditioned Relation Routing for Urban Cellular Activity Forecasting |
|
| Li, Qingzhong | Xinjiang University |
| Lin, Jingye | Xinjiang University |
| Ma, Hui | Xinjiang University |
| Zhang, Yajun | Xinjiang University |
| Pei, Xinjun | Xinjiang University |
| Yan, Ming | Xinjiang University |
| Xing, Fei | Xinjiang University |
Keywords: Communications, Cyber Systems and Engineering, Neural Networks and their Applications
Abstract: Urban cellular activity forecasting requires jointly modeling heterogeneous spatiotemporal signals, including SMS usage, mobile network traffic, and call activity. Existing methods often separate temporal modeling, spatial relation learning, and multi-signal prediction, relying on fixed graph structures or static multi-task learning schemes, which limits their adaptability to changing urban scenes. We propose SCRR-Net, a scene-conditioned spatial relation routing framework in which urban contextual information jointly controls spatial dependency selection and cross-task knowledge transfer. SCRR-Net includes a context encoder, a spatial graph expert routing module, a temporal Transformer encoder, and a task knowledge routing module. Experiments on the Milano and Trento datasets demonstrate that SCRR-Net consistently outperforms competing methods on SMS, network traffic, and call activity forecasting, while providing interpretable routing behaviors.
|
| |
| 16:45-17:00, Paper TuB16.47 | |
| TMPP: A Transformer-Based Spatiotemporal Model for High-Accuracy PM2.5 Concentration Prediction |
|
| Song, Wenchao | Sichuan University |
| Qiu, Liping | Sichuan Academy of Environmental Policy and Planning |
| Li, Junyuan | Sichuan University |
| Ye, Qing | College of Computer Science, Sichuan University |
Keywords: Deep Learning, Machine Learning, Neural Networks and their Applications
Abstract: Accurate regional prediction of PM2.5 concentration remains a critical challenge in environmental science, as conventional models often fail to capture complex spatial correlations and long-term temporal dependencies. To address this, we propose TMPP—a novel Transformer-based model to predict the PM2.5 concentration. TMPP employs a heterogeneous data fusion strategy to embed station attributes, meteorological variables, and historical PM2.5 concentrations into a unified representation. Then the model incorporates a dynamic memory mechanism with a sliding window, which efficiently retains and updates relevant long-term spatiotemporal contexts. Furthermore, it utilizes an autoregressive prediction approach to generate accurate, multi-step forecasts. Experimental results show that TMPP achieves competitive performance in both one-step and multi-step forecasting tasks. This work demonstrates the potential of Transformer-based architectures to advance predictive frameworks in environmental monitoring and air quality forecasting.
|
| |
| 16:45-17:00, Paper TuB16.48 | |
| Manifold-Aware Graph Diffusion for Projective Incomplete Multi-View Clustering |
|
| Wu, Haoyuan | Guangdong University of Technology |
| Liu, Peng | Guangdong University of Technology |
| Zhao, Shuping | Guangdong University of Technology |
| Yao, Lian | Guangdong University of Technology |
| Ou, Junfeng | Guangdong University of Technology |
Keywords: Machine Learning, Knowledge Acquisition, Computational Intelligence
Abstract: Multi-view clustering typically significantly degrades when sensor corruption or transmission losses cause over 50% feature missingness, as the consensus representation collapses into a disconnected manifold. Existing methods face a dual dilemma: matrix factorization destroys local geometric structures, while graph learning cannot propagate constraints to unavailable views. We propose MAG-PIMVC (Manifold-Aware Graph Diffusion for Projective Incomplete Multi-view Clustering), a unified framework that treats incompleteness as a structural opportunity rather than data loss. Our key insight is that geometric proximity in observed views implies semantic similarity in missing ones. We construct a hierarchical affinity structure and jointly optimize projection matrices, consensus representation, and Regularized Diffusion Process (RDP) in a unified objective function, enabling the affinity matrix to co-evolve with representation learning to reinforce multi-hop manifold relationships. This manifold-aware graph diffusion propagates reliable constraints through geodesic paths, enabling stable clustering even under extreme incompleteness. On four benchmark datasets (BBCSport, Handwritten, 3Sources, and Caltech7), MAG-PIMVC achieves superior clustering performance at 50% missing rates, surpassing the second-best competitor by over 16% in ACC and 21% in NMI, demonstrating the effectiveness of dynamic manifold constraints for handling severely incomplete views.
|
| |
| 16:45-17:00, Paper TuB16.49 | |
| PFSFNet: Prior-Guided Frequency-Spatial Fusion Network for Underwater Image Enhancement |
|
| Chen, Yonghong | Sanya Oceanographic Institution, Ocean University of China |
| Ding, Yanqing | Sanya Oceanographic Institution, Ocean University of China |
| Liu, Peishun | Faculty of Information Science and Engineering, Ocean University of China |
Keywords: Image Processing and Pattern Recognition, Deep Learning
Abstract: Underwater images suffer from severe color distortion and low contrast due to wavelength-selective at tenuation and scattering. While deep learning methods show promise, they often lack explicit physical guidance. To bridge this gap, we propose the Prior-Guided Frequency-Spatial Fusion Network (PFSFNet), an efficient, physics-aware U shaped framework. PFSFNet integrates frequency and spatial features via a Hybrid Frequency-Spatial Module (HFSM), which leverages Fourier transforms for global illumination and color correction while injecting physical priors for lo cal restoration. Furthermore, a multi-scale detail guidance mechanism is introduced to robustly preserve structural features. Extensive experiments demonstrate that PFSFNet achieves state-of-the-art visual and quantitative performance across standard benchmarks, while requiring significantly fewer parameters and lower computational costs than existing methods.
|
| |
| 16:45-17:00, Paper TuB16.50 | |
| Look Where It Matters: Text-Guided Visual Focusing for Hallucination Mitigation in Large Vision Language Models (I) |
|
| Zhang, Yunfei | Jiangxi University of Finance and Economics |
| Liu, Dexi | Jiangxi University of Finance and Economics |
| Zhao, Sicheng | Tsinghua University |
| Wan, Qizhi | Jiangxi University of Finance and Economics |
| Fang, Yuming | Jiangxi University of Finance and Economics |
| Liu, Jiaming | The University of Chicago |
Keywords: Machine Learning, Deep Learning, Generative AI
Abstract: 视觉语言模型(LVLM)已实现 视觉理解和语言的显著进步 虽然是生成任务,但它们仍然容易产生 与图像不符的幻觉反应 内容涉及视觉问答等场景。 现有的幻觉缓解方法,特别是 对比解码方法通常依赖通用 扰动或固定负面视角,且未能 精准利用细粒度语义信息 嵌入文本提示中,提供针对性的视觉证据 本地化。为解决这一限制,我们提出一个 无训练、文本引导的视觉聚焦对比 解码方法称为文本引导视觉聚焦(TGVF)。 所提方法识别了 查询引导模型聚焦对应的 视觉证据,并构建了一个缺失证据的视觉 解码时查看。结合对比解码 机制,它能够自适应校准预测 全视觉状态与 缺乏证据状况,从而减少幻觉 同时保持 生成文本。基于标准基准测试的ê
|
| |
| 16:45-17:00, Paper TuB16.51 | |
| A Rapid Deployment Pipeline for Autonomous Humanoid Grasping Based on Foundation Models |
|
| Y, Yifei | Shanghai University |
| Liao, Yankai | Shanghai Institute of Technology |
| Ye, Linqi | Shanghai University |
Keywords: Robotic Systems, Machine Learning, Machine Vision
Abstract: Deploying a humanoid robot to manipulate a new object commonly requires object-specific data collection, annotation, model acquisition, and detector training. This paper presents an end-to-end rapid deployment pipeline that reduces this onboarding cycle to approximately 30 minutes by combining (i) Segment Anything Model (SAM)-assisted annotation and short object-specific fine-tuning of YOLOv8, (ii) single-image mesh reconstruction with Meta SAM 3D, and (iii) FoundationPose, which estimates and tracks six-degree-of- freedom (6-DoF) pose without per-object pose-network training. The estimated pose is transformed into a Unity scene for inverse-kinematics planning, and the resulting joint commands are executed on a Unitree G1 through its software development kit (SDK). On the bottle task, the detector reaches mAP@0.5 = 0.995, the static translation dispersion is 1.05 mm, and qualitative end-to-end grasping demonstrations are completed at all three mechanically reachable locations among five selected workspace positions. Reuse of the same system architecture is also demonstrated in an automobile-window glue-application task. These results support rapid, modular deployment with commodity imaging devices while retaining object-specific de- tector adaptation and task-specific trajectory configuration.
|
| |
| 16:45-17:00, Paper TuB16.52 | |
| A Hybrid Sampling Framework for Online Transaction Fraud Detection Via Overlap-Aware Sample Selection and Boundary-Aware Adversarial Learning (I) |
|
| Bian, Zehao | Shanghai Maritime University |
| Xie, Yu | Shanghai Maritime University |
| Qiu, Yanchen | Shanghai Maritime University |
| Jiang, Ziwen | Shanghai Maritime University |
| Zhang, Ying | Beijing Institute of Business and Technology |
| Zhou, Mengchu | New Jersey Institute of Technology |
Keywords: Neural Networks and their Applications, AI and Applications
Abstract: As online transactions have become indispensable in the digital era, Online Transaction Fraud Detection (OTFD) is essential for ensuring financial security. Performing accurate OTFD faces the challenge of class imbalance, i.e., fraudulent transactions being far less frequent than legitimate ones. Although existing methods effectively address class imbalance in many domains, they often fail in OTFD where fraudsters' mimicry of legitimate users induces behavioral overlap among transactions in the transactional feature space and consequently degrades the quality of generated samples. This work proposes a novel Anti-Overlap Hybrid Sampling method to improve sample generation under behavioral overlap. It integrates an Overlap-aware Sample Selection method with a Boundary-aware Generative Adversarial Network. The former prunes ambiguous majority-class samples from overlapping regions, and the latter synthesizes high-fidelity minority-class samples, thereby collectively mitigating the adverse effects of behavioral overlap. Experiments on real-world transaction datasets demonstrate that the proposed method outperforms its state-of-the-art peers with gains of 1.5%–12.2% in average F1-Score and 0.4%–0.6% in average Geometric Mean, highlighting its strong potential for accurate OTFD under class imbalance and behavioral overlap.
|
| |
| 16:45-17:00, Paper TuB16.53 | |
| A Positive Sample Encouraged Contrastive Learning Method for Source-Free Unsupervised Domain Adaptation |
|
| Lu, Xiaoyu, Sean | Nanjing University of Science and Technology |
| You, Yifei | Nanjing University of Science and Technology |
| Yao, Siya | Zhejiang Gongshang University |
| Huang, Bo | Nanjing University of Science and Technology |
Keywords: Transfer Learning, Deep Learning
Abstract: Source-free Unsupervised Domain Adaptation (SFUDA) aims to utilize a pre-trained source model on unlabeled target domains without accessing source data. The emergence of SFUDA has improved the robustness of UDA methods and enables domain adaptation to still perform well in fields with security and privacy considerations. Self-training is one approach to solve the domain gap problem in the SFUDA field, which iteratively selects high-confidence target samples as pseudo-labeled samples to guide target model learning. However, previous works only use the source domain model to generate the first round of pseudo labels before performing denoising tasks. This preprocessing is undoubtedly rough, because it ignores the domain gap between the source domain and the target domain. Given the existence of domain gap, some incorrect pseudo labels may never be corrected by subsequent denoising tasks. Inspired by the teacher-student model, this work proposes a method called Positive Sample Encouragement (PSE) that effectively addresses this issue in a coarse-to-fine manner. Specifically, we first conduct a contrastive learning task that enables the target model to effectively inherit from the source model, while allowing the source model to adapt to target data. Furthermore, we incorporate mutual information-based class balancing, that assigns high weights to high-confidence classes by learning pseudo-label feature distributions. Through extensive experiments on three widely-used benchmarks, we demonstrate that our proposed method achieves competitive performance compared with the state-of-the-art approaches.
|
| |
| 16:45-17:00, Paper TuB16.54 | |
| Multi-Gait Learning for Humanoid Robots Using Reinforcement Learning with Selective Adversarial Motion Prior |
|
| Wu, Yuanye | Shanghai University |
| Wang, Keyi | Shanghai University |
| Ye, Linqi | Shanghai University |
| Xing, Boyang | National and Local Co-Built Humanoid Robotics Innovation Center |
Keywords: Reinforcement Learning, Robotic Systems, Human-Computer Interaction
Abstract: Learning diverse locomotion skills in a unified reinforcement learning framework is challenging due to conflicting stability and expressiveness requirements across gaits. We enable a humanoid robot to master five gaits---walking, goose-stepping, running, stair climbing, and jumping---using a consistent policy structure, action space, and reward formulation. The key contribution is a selective Adversarial Motion Prior (AMP) strategy: AMP is applied to periodic, stability-critical gaits (walking, goose-stepping, stair climbing) where it accelerates convergence, and omitted for highly dynamic gaits (running, jumping) where its regularization would over-constrain the motion. Policies are trained via PPO with domain randomization and deployed on a physical 12-DOF humanoid through zero-shot sim-to-real transfer. Selective AMP outperforms uniform AMP across all five gaits in convergence speed, tracking error, and success rate.
|
| |
| 16:45-17:00, Paper TuB16.55 | |
| Selective State Space Neural Tucker Factorization for Temporal-Aware Traffic Imputation |
|
| Li, Zhenhao | Southwest University |
| Tang, Peng | Southwest University |
Keywords: Neural Networks and their Applications, Deep Learning
Abstract: Accurate spatiotemporal data imputation is critical for Intelligent Transportation Systems (ITS), yet modeling the necessary long-term temporal dynamics remains a challenge. Existing methods suffer from gradient vanishing, high computational costs, and limited capacity for capturing complex temporal correlation. We propose a Selective State Space Neural Tucker Factorization (S3NTF) model designed for temporal-aware traffic data imputation. By leveraging a state space-driven temporal encoder, S3NTF accurately captures long-range temporal dependencies with linear complexity. Subsequently, a latent spatiotemporal feature learning module models high-order, cross-modal interactions via Tucker decomposition to estimate the missing values. Extensive evaluations on six real-world traffic datasets confirm that S3NTF establishes a new state-of-the-art which delivers superior accuracy.
|
| |
| 16:45-17:00, Paper TuB16.56 | |
| Coverage-Based Data Informativity for Boolean Control Networks |
|
| Ge, XIngyu | Zhejiang Normal University |
| Wang, Yinyu | Zhejiang Normal University |
| Fok, Hong Kei Christopher | University of Hong Kong |
| Zhong, Jie | City University of Hong Kong |
Keywords: System Modeling and Control, Complex Network, Control of Uncertain Systems
Abstract: Existing data informativity results for Boolean control networks (BCNs) mainly focus on exact properties such as controllability and stabilizability. This paper investigates how much controllability and stabilizability information can be uniformly certified from partial transition data for BCNs. We introduce the notions of ε-controllability and ε-stabilizability, which require the desired property to hold for at least a 1− ε fraction of state pairs or initial states. A data-induced state transition graph is constructed from the dataset, based on which graph-based certification results are obtained for these relaxed properties. Two algorithms are then proposed to compute the smallest certifiable ε levels induced by the current dataset. Moreover, monotonicity under dataset inclusion and redundancy elimination results are established, showing that the certified information can be preserved by reduced subgraphs with the same reachability structure. Finally, a biological example and random network examples are used to demonstrate the effectiveness of the proposed results.
|
| |
| 16:45-17:00, Paper TuB16.57 | |
| Causal Graph-Guided Knowledge Fusion for Emotional Support Conversations |
|
| Du, Yicheng | University of Science and Technology of China |
| Gao, Chang | University of Science and Technology of China |
| Zhao, Sirui | USTC |
| Xu, Tong | USTC |
Keywords: Affective Computing, Companion Technology, Human-Computer Interaction
Abstract: Emotional Support Conversations (ESC) aim to reduce psychological distress through empathetic responses. A core challenge in this task is accurately inferring the seeker's hidden mental states, which requires integrating external psychological and commonsense knowledge. However, effectively fusing this knowledge is difficult because existing methods mainly treat dialogue history as static sequences, while overlooking the underlying causal dependencies between turns, leading to noisy knowledge integration and insufficient modeling of historical information interactions. Therefore, adequately capturing the historical context's influence on the current response remains challenging, potentially limiting the depth of understanding and resulting in less tailored responses. In this paper, we propose GFESC, a novel framework that anchors knowledge fusion within a causal structure understanding. Specifically, we integrate dual-stream knowledge to enhance semantic perception. By explicitly identifying the causal influence between different dialogue turns and employing a hierarchical information fusion mechanism, our approach optimizes the balance between affective attunement and contextual coherence. Empirical results on the ESConv dataset demonstrate that our method achieves state-of-the-art performance while providing comprehensible causal reasoning pathways.
|
| |
| 16:45-17:00, Paper TuB16.58 | |
| Toward Label-Free Tool Wear Stage Diagnosis: LLM-Guided Multi-Domain Fusion with Monotonic Sequence Constraints |
|
| Zhao, Minhao | Nanjing Agricultural University |
| Li, Hua | Nanjing Agricultural University |
| Liu, Wenbin | Ritsumeikan University |
| Wu, Taohong | Nanjing Agricultural University |
Keywords: Intelligent Industrial Systems, Generative AI, Fault Monitoring and Diagnosis
Abstract: Accurate tool wear stage diagnosis is important for predictive maintenance in precision manufacturing, yet most strong classifiers depend on labeled training data and provide limited human-readable reasoning. This paper studies a label-free alternative in which a large language model (LLM) reasons over engineered signal features through structured prompts. The pipeline combines time-domain assessment, frequency-domain assessment, LLM fusion, experiment-relative feature augmentation, and a monotonic sequence constraint. On the combined PHM2010 and NUAA-Orthogonal benchmark, the strongest configuration (Fusion+Constraint) reaches 0.582 +/- 0.058 macro-F1 across five runs, outperforming other LLM baselines and a no-label heuristic while remaining below supervised baselines. The results show that naive mixed prompting and simple monotonic smoothing are insufficient on their own, whereas the full hybrid sequence-constraint stage yields the strongest label-free performance. The method is therefore best viewed as an auditable cold-start baseline for low-label settings rather than as a replacement for supervised classifiers.
|
| |
| 16:45-17:00, Paper TuB16.59 | |
| Dual-Path Modeling of Formula Structure and Text Semantics for Scientific Document Retrieval |
|
| Zhang, Jianye | Hebei University |
Keywords: AI and Applications, Neural Networks and their Applications, Computational Intelligence
Abstract: A large amount of critical information in scientific documents is conveyed through mathematical expressions. However, most existing scientific document retrieval approaches primarily rely on textual semantics, resulting in a disconnect between mathematical expressions and textual meaning and making it difficult to accurately assess the relevance between a query and candidate documents. To address this problem, this study proposes a dual-path retrieval framework to model the structural similarity of mathematical formulas and the semantic association of related texts. For mathematical expressions, graph contrastive learning is adopted to encode the operator graphs of formulas, and three types of graph data augmentation strategies together with a negative sample sampling method based on expression structural similarity are designed. For textual semantics, a summary extraction algorithm for the mathematical domain and a structure-guided interactive fusion mechanism are designed to capture the semantic correspondences between texts. During retrieval, the two types of information are fused for comprehensive relevance evaluation. Experiments on the public NTCIR-12 dataset show that the proposed method achieves MAP@10 of 0.802 and NDCG@10 of 0.729, which can effectively alleviate the disconnection between mathematical expressions and textual semantics and improve the overall performance of scientific document retrieval.
|
| |
| 16:45-17:00, Paper TuB16.60 | |
| Private Relational Social-State Tracking for Hidden-Role Multi-Agent Language Interaction |
|
| Wang, Haoxi | IA, CAS, School of Advanced Interdisciplinary Sciences, University of Chinese Academy of Sciences |
| Yang, Senhao | UCAS |
| Ma, Xinlei | UCAS |
| Xu, Shuang | Institute of Automation, Chinese Academy of Sciences |
| Xu, Bo | Institute of Automation, Chinese Academy of Sciences |
Keywords: Game Theory and Multi-Agent Systems, Artificial Social Intelligence, Generative AI
Abstract: Hidden-role multi-agent language interaction requires agents to infer others' latent roles and evolving relations from dialogue, public actions, and delayed feedback under partial observability. Existing LLM-based agents mainly rely on raw interaction history, textual summaries, or recursive deliberation, which leave social relationship implicit and make belief updates unstable. We propose Private Relational State (PRS), a framework that equips each agent with an explicit private relational social state for online belief tracking and decision support. PRS maintains node-level beliefs and edge-level relational evidence, updates them with newly observed signals and temporal decay, and uses the resulting state to evaluate candidate actions before guiding final language generation. Experiments on two hidden-role language games, Avalon and Who is the Undercover, show that PRS consistently improves final win rate over strong full-history, summary-based, and recursive-deliberation baselines. On Avalon, PRS improves win rate by 25.0 percentage points on the good side and by 5.0 percentage points on the evil side. On Who is the Undercover, it improves win rate by 4.0 percentage points on the civilian side and by 14.0 percentage points on the undercover side. Process-level analyses further show that PRS yields better social-state tracking and coordination, while ablations confirm the importance of explicit node states, edge relations, and online graph updates. These results suggest that explicit private relational state is an effective inductive bias for hidden-role multi-agent interaction.
|
| |
| 16:45-17:00, Paper TuB16.61 | |
| Multi-Granularity Disentangled Contrastive Learning Framework for Point-Of-Interest Recommendation |
|
| Liang, Jiarui | Tongji University |
| Zuo, Jiankai | Tongji University |
| Zhang, Yaying | Tongji University |
Keywords: Deep Learning, Artificial Social Intelligence, Human Performance Modeling
Abstract: Point-of-Interest (POI) recommendation faces three critical challenges: entangled latent user intents, single-granularity modeling limitations, and severe data sparsity. These issues hinder the effective capture of multifaceted user behaviors. We propose MGDC-Rec, a novel model integrating Multi-Granularity Disentangled Contrastive Learning and Multi-Strategy Enhanced Training to address these issues. Specifically, MGDC-Rec constructs three complementary hypergraphs to comprehensively capture sequential dependencies, global transition patterns, and high-order collaborative signals. A multi-granularity contrastive learning module maximizes mutual information at cross-view and user-POI levels to disentangle complex user intents. reduce sparse data distribution and item popularity deviation, we adopt a multi-strategy training method combining mixed negative sampling and adversarial perturbations for improved generalization. It is demonstrated that MGDC-Rec significantly outperforms state-of-the-art baselines and exhibits superior robustness in sparse scenarios through extensive experiments on two real-world datasets. The codes are available at url{https://github.com/jjhzhp/MGDC-Rec}.
|
| |
| 16:45-17:00, Paper TuB16.62 | |
| SP-GRPO: Self-Play Advantage Reweighting for Diverse Generative Recommendation |
|
| Yang, Yulin | Institute of Automation, Chinese Academy of Sciences |
| Wang, Zikang | Chinese Academy of Sciences |
| Zeng, Daniel | State Key Laboratory of Multimodal Artificial Intelligence Systems, Institute of Automation, Chinese Academy of Sciences; Schoo |
Keywords: Application of Artificial Intelligence, Neural Networks and their Applications, Machine Learning
Abstract: Group Relative Policy Optimization (GRPO) is increasingly used for LLM-based generative recommendation because it supports on-policy sampling and rule-based rewards. We identify a critical failure mode: popularity bias amplification. Popular items are easier to generate and receive positive signals more often, creating a self-reinforcing loop that concen- trates recommendations and degrades diversity. We propose SP-GRPO (Self-Play GRPO), which reweights each group’s advantages after GRPO’s group-wise normalization according to target-item frequencies estimated from the model’s own outputs. This placement avoids normalization cancellation and reallocates gradient resources from over-recommended popular items to under-represented rare items. We analyze the result- ing gradient redistribution and its implicit interaction with KL regularization. Experiments on three real-world datasets show substantial improvements in diversity and fairness while retaining competitive accuracy.
|
| |
| 16:45-17:00, Paper TuB16.63 | |
| Bridging the Alignment Gap: A Multi-Agent Delphi Simulation against Real-World Expert Baselines |
|
| Yang, Xiaohuai | Exploration and Development Research Institute of Daqing Oilfield Company |
| Li, Longbin | Daqing Oilfield Company |
| Zhu, Jijun | Exploration and Development Research Institute of Daqing Oilfield Company |
| Wang, Yinnan | Exploration and Development Research Institute of Daqing Oilfield Company |
| Sun, Jiayin | Harbin Institute of Technology |
| Qin, Zikun | Harbin Institute of Technology |
| Ma, Hungyu | Harbin Institute of Technology |
Keywords: Generative AI, Game Theory and Multi-Agent Systems, Agent-Based Modeling
Abstract: LLM-based multi-agent systems are commonly evaluated through output quality, task performance, and internal consistency, while quantitative alignment with real-world expert judgments remains underexamined. We introduce a criterion referenced, two-stage audit that separates configuration screening from protocol-constrained transfer and diagnoses residual disagreement against an empirical expert benchmark. Using a Delphi study from Oman’s oil and gas industry (7 experts, a 20-factor TOE framework, and 3 rounds), we evaluate eight agent configurations in Stage 1. The best-performing native scale configuration is C2 (7 agents, MAE = 0.323), while C5 is the strongest scaled-up configuration (15 agents, MAE = 0.351). In Stage 2, both configurations undergo repeated three-round replication tests. C2’s MAE increases to 0.656–0.913, with weak rank preservation (Spearman = -0.026–0.014) and partial Top-5 retention (0.4–0.6). C5 reaches a similar MAE range of 0.778–0.871 and remains only partially aligned with the published expert benchmark. Within this benchmark, procedural convergence and expert-benchmark fidelity emerge as empirically distinct evaluation dimensions. The framework therefore enables multi-agent consensus to be audited beyond internal convergence alone.
|
| |
| 16:45-17:00, Paper TuB16.64 | |
| Ambiguity-Robust Cross-Modal Hash Retrieval Via Label Disambiguation |
|
| Li, Mingyu | Qingdao University |
| Liu, Ziyi | Qingdao University |
| Feng, Jian | Qingdao University |
| Wang, Can | Qingdao University |
| Li, Jiangnan | Qingdao University |
| Tian, Runqian | Qingdao University |
| Song, Yining | Qingdao University |
| Ren, Kangrui | TongJi University |
| Fan, Jinfu | Qingdao University |
Keywords: Multimedia Systems, Deep Learning, Representation Learning
Abstract: Cross-modal hashing (CMH) under ambiguous labels often suffers from severe performance degradation, as noisy supervision is easily amplified through cross-modal alignment. To address this challenge, we introduce Partial-Label Learning (PLL) into CMH and propose an ambiguity-robust framework (PLCH) that jointly optimizes label disambiguation and hash learning. Unlike existing noise-robust methods that primarily rely on passive sample re-weighting or noise filtering, our core contribution is a novel Semantic Anchor-guided Hash Alignment Mechanism. Specifically, we design a dual-stream architecture to process images alongside a pseudo-text modality constructed directly from candidate label embeddings, rather than relying on natural language captions. To mitigate label ambiguity, this architecture employs a confidence-weighted exponential moving average (EMA) to proactively extract robust semantic prototypes. Building upon these prototypes, we establish stable hash anchors in the Hamming space. We then introduce a confidence-guided alignment loss to drive the heterogeneous hash codes toward these semantically clean anchors. Furthermore, cross-modal mutual information maximization is incorporated to enhance instance-level discriminability. Extensive experiments demonstrate that PLCH consistently outperforms state-of-the-art noise-robust hashing approaches in both retrieval accuracy and noise tolerance.
|
| |
| 16:45-17:00, Paper TuB16.65 | |
| Don't Just Search, Understand: Semantic Path Planning Agent for Spherical Tensegrity Robots in Unknown Environments |
|
| Zhang, Junwen | Zhejiang University |
| Liu, Changyue | Beihang University |
| Fu, Pengqi | Zhejiang University |
| Guo, Xiang | Zhejiang University of Science and Technology |
| Shi, Ye | Zhejiang University |
| Liang, Xudong | Harbin Institute of Technology |
| Wang, Zhijian | Beihang University |
| Ma, Hanzhi | Zhejiang University |
Keywords: Agent-Based Modeling, Soft Robotics, Robotic Systems
Abstract: Spherical tensegrity robots represent a promising class of hybrid soft-rigid mobile platforms, offering exceptional ruggedness and adaptability. However, their unique and inherently discrete locomotion makes path planning in unknown environments a significant challenge, necessitating a strict tradeoff between exploration efficiency and planning optimality. Traditional path planners, which treat the environment as a geometric grid, often suffer from redundant searches and are prone to failure in complex scenarios due to their lack of semantic understanding. To overcome these limitations, we reframe path planning in unknown environments as a semantic reasoning task and introduce a Semantic Agent for Tensegrity robots (SATPlanner) driven by a Large Language Model (LLM). SATPlanner leverages high-level environmental comprehension to generate efficient and reliable planning strategies. At the core of SATPlanner is an Adaptive Observation Window mechanism, inspired by the “fast” and “slow” thinking paradigms of LLMs. This mechanism dynamically adjusts the observation space of the agent: it narrows for rapid traversal of open spaces and expands to reason about complex obstacle configurations. This enables the construction of a concise semantic representation of the environment, enabling an efficient pruning of search space while maintaining path quality. SATPlanner is extensively evaluate in 1,000 simulation trials, where it achieves a 100% success rate, outperforming other online planning baselines. Notably, SATPlanner reduces the search space by 42.5% compared to the D* algorithm while achieving comparable, near-optimal path lengths. Finally, we validate the practical feasibility of SATPlanner on a physical spherical tensegrity robot prototype.
|
| |
| 16:45-17:00, Paper TuB16.66 | |
| TCPTrack: Predictive Single Object Tracking Exploiting Temporal Context |
|
| Zhang, Yufei | Shanghai University of Electric Power |
| Xu, Man | Shanghai University of Electric Power |
| Fan, Zizhu | Shanghai University of Electric Power |
| Bian, Anqi | Shanghai University of Electric Power |
| Gao, Shunli | Shanghai University of Electric Power |
| Xu, Ji | Shanghai University of Electirc Power |
| Li, WeiKang | Shanghai University of Electric Power |
Keywords: Image Processing and Pattern Recognition, Machine Vision, Deep Learning
Abstract: Most state-of-the-art one-stream trackers formulate visual tracking as a template-search feature matching process.However, their strict reliance on current-frame observations fundamentally limits their ability to capture the target’s dynamic temporal evolution, rendering them vulnerable to severe occlusion and similar background distractors. To overcome these limitations, this paper proposes TCPTrack, which constructs a Predictive Spatio-temporal Interaction Network to fully exploit temporal context and achieve forwardlooking tracking. Specifically, the spatio-temporal encoding network fuses multi-frame states with current observations to generate states and features for future frames. Subsequently, the decoding network refines these states to achieve precise localization and cross-frame prediction. Extensive experiments on the LaSOT, TrackingNet, and GOT-10k datasets demonstrate that TCPTrack yields significant performance improvements, validating the effectiveness of the proposed approach.
|
| |
| 16:45-17:00, Paper TuB16.67 | |
| PDAF: A Physics-Constrained Dual-Branch Adaptive Fusion Network for Airport Visibility Prediction |
|
| Zhao, Yongkang | Civil Aviation University of China, Tianjin 300300, China |
| Xue, Fengxian | School of Computer Science and Artificial Intelligence, Civil Aviation University of China, Tianjin 300300, China |
| Quan, Ruhao | School of Computer Science and Artificial Intelligence, Civil Aviation University of China, Tianjin 300300, China |
| Liu, Zuolong | School of Computer Science and Artificial Intelligence, Civil Aviation University of China, Tianjin 300300, China |
| Feng, Xia | Civil Aviation University of China |
| Liu, Xiangqing | Tengchong Airport Branch Yunnan Airport Group Co., Ltd |
Keywords: Neural Networks and their Applications, AI and Applications, Deep Learning
Abstract: Abstract—Airport visibility varies under coupled multi-feature and multi-scale meteorological forcing, making short- and medium-range forecasting difficult for purely data-driven models.This paper presents a physics-constrained dual-branch adaptive fusion network called PDAF, trained on hourly observations from Tengchong Tuofeng Airport from September 2024 to October 2025. PDAF combines a temporal convolutional network (TCN) branch for rapid local variations with a Transformer branch for long-range context through a learnable fusion weight, and it further uses discrete cosine transform (DCT) enhancement and rule-based soft physics constraints to maintain physically plausible outputs. On the 1-hour horizon, PDAF achieves a mean absolute error of 0.313 km and an R-squared value of 0.9630. For low-visibility cases below 4.5 km, the model attains a mean absolute error of 0.293 km and a critical success index of 0.98, supporting reliable early warning. Results show that PDAF provides accurate and physically interpretable airport visibility prediction across multiple forecast horizons.
|
| |
| 16:45-17:00, Paper TuB16.68 | |
| CoFiFormer: Coarse-To-Fine Cue Refinement Transformer for Uncalibrated Multi-View 3D Human Pose Estimation |
|
| Xiao, Yanwei | Central South University |
| Shang, Xinjian | Central South University |
| Zhang, Liu | Central South University |
| Zhang, Zihao | Central South University |
| Liu, An | China Mobile (Chengdu) Industrial Research Institute |
| Lu, Hongxia | China Mobile (Chengdu) Industrial Research Institute |
| Huang, Weihong | Central South University |
Keywords: Machine Vision, Image Processing and Pattern Recognition, Deep Learning
Abstract: Uncalibrated multi-view 3D human pose estimation aims to recover accurate 3D poses from multi-view observations without camera parameters. Existing methods exploit cross-view complementarity, but still suffer from unreliable fusion and weak representation modeling when observation quality varies across views. To address this issue, we propose CoFiFormer, a cue-preserving framework. Specifically, we design a Cue Fusion Refinement (CFR) module, where Content-Guided Fusion (CGF) preserves reliable pose cues during multi-view aggregation and Temporal Frequency Refinement (TFR) suppresses temporal redundancy and noisy responses. Furthermore, we embed a Frequency-Decoupled Modeling (FDM) module into selected self-attention layers of CoFiFormer to jointly model local details and global context for better pose representations. Experimental results show that CoFiFormer achieves strong performance under clean settings and maintains strong robustness under degraded observations.
|
| |
| 16:45-17:00, Paper TuB16.69 | |
| SGC-Transformer :a 4D Trajectory Prediction Method for Terminal Maneuvering Area |
|
| Zhao, Yongkang | Civil Aviation University of China, Tianjin 300300, China |
| Dai, Qiqi | Civil Aviation University of China |
| Feng, Xia | Civil Aviation University of China |
Keywords: Intelligent Transportation Systems, Deep Learning, Neural Networks and their Applications
Abstract: Abstract-Accurate 4D trajectory prediction within TerminalManeuvering Areas (TMAs) is significantly challenged bydense multi-agent interactions and highly volatile flight intents.Standard spatial graph convolutions suffer from inherent low-pass filtering during feature aggregation, which inadvertentlysmooths out critical high-frequency transient maneuvers andleads to severe trajectory distortion.To tackle these challenges,we propose a novel predictive framework named the SpectralGraph Convolutional Transformer (SGC-Transformer). First,a dual-stream graph mechanism constructs an adaptive topol-ogy by explicitly encoding physical boundaries and implicitlyextracting multi-agent intentions. Second, we design a multi-scale spectral spatio-temporal encoder that exploits Chebyshevpolynomial approximation to capture high-frequency maneu-vers, coupling it with a topologically masked temporal attentionmechanism to filter out spatial noise. Finally, using a non-autoregressive decoder to predict the relative displacementincrement alleviates the cascading amplification of long-termerrors to a certain extent. Evaluations conducted on real-worldAutomatic Dependent Surveillance-Broadcast trajectory datafrom San Francisco International Airport (KSFO) demonstratethe exceptional predictive accuracy of the SGC-Transformermodel. Compared to the best-performing baseline in our exper-iments, SGC-Transformer reduces both the Average Displace-ment Error (ADE) and Final Displacement Error (FDE) by over20% in the horizontal plane, and by over 10% vertically acrossall predictive horizons. Consequently, our method can not onlyachieve high-fidelity reconstruction of micro-maneuvers but alsosatisfy the stringent prerequisite requirements for Short-TermConflict Alerts.
|
| |
| 16:45-17:00, Paper TuB16.70 | |
| Ancient Chinese Character Image Retrieval Based on Dynamic Deformable Feature Fusion and Multi-Scale Adaptation |
|
| Wang, Xiaoyu | HebeiUniversity |
Keywords: Neural Networks and their Applications, Image Processing and Pattern Recognition
Abstract: Abstract—Ancient Chinese character image retrieval is of significant importance for the digitization and organization of ancient books and related research on ancient Chinese characters. However, constrained by factors such as manuscript degradation, massive variant characters and diverse writing styles, traditional retrieval methods fail to meet the requirements for high accuracy and robustness. To this end, this paper proposes an ancient Chinese character image retrieval method based on dynamic deformable feature fusion and multi-scale adaptation. By dynamically weighting and fusing cross-scale semantic features, it enhances the fine-grained discriminative power of feature representation. During feature extraction, a deformable convolutional layer adaptively adjusts the receptive field to enhance feature capture for morphologically distorted characters. This approach focuses on local deformations in ancient Chinese characters, thereby improving the representation of complex stroke structures. Furthermore, to facilitate better multi-scale feature fusion, we construct a Gated Pyramid Select (GPS) adaptive feature learning module. This module acquires texture, stroke, and structural information at different levels from multi-scale features, and adopts the attention mechanism to assign weights to features of various scales, thereby realizing adaptive enhancement of global structural features and local stroke features. This approach adaptively focuses on critical scale information and conducts extensive experimental verification using a self-constructed dataset comprising 37,497 ancient Chinese character images across 633 categories, collected from the Siku Quanshu—demonstrating the superiority of our method. The proposed model achieves a Precision@60 of 0.829, Recall@60 of 0.911, and MAP@all of 0.942, validating the model’s effectiveness.
|
| |
| 16:45-17:00, Paper TuB16.71 | |
| ECH: A Source-Free Domain Adaptation Method through Refined Uncertainty Masking and Adversarial Perturbations |
|
| Zhang, Huiyu | Inner Mongolia Normal University |
| Xu, Qiaozhi | Inner Mongolia Normal University |
| Zhi, Min | Inner Mongolia Normal University |
| Yin, Yanjun | Inner Mongolia Normal University,College of Computer Science and Technology |
Keywords: Image Processing and Pattern Recognition, Transfer Learning
Abstract: Deep learning has shown tremendous potential in medical image-assisted diagnosis. However, in real clinical scenarios, differences in imaging devices and patient populations often result in a significant performance drop of models. Unsupervised domain adaptation (UDA) can alleviate such domain shifts, but it typically requires access to both source and target domain data simultaneously, which is difficult to achieve in clinical practice due to concerns regarding patient privacy and data barriers. To address this, source-free domain adaptation (SFDA) was introduced, which adapts a source model trained on source domain data to unlabelled target domain data. Current SFDA methods predominantly rely on pseudo-label self-training, which faces two major challenges: 1) pseudo-labels are often noisy and lack effective masking constraints, exacerbating the intra-domain class imbalance; 2) the target domain distribution is often simplistic, resulting in insufficient adaptation. To tackle these issues, we propose an improved solution, the ECH framework, with two core innovations: enhanced mask generation and target domain distribution perturbation. The improved uncertainty mask enables more accurate pseudo-label filtering, and the distribution perturbation image branch forces the model to learn domain invariant robust features. Extensive cross-domain segmentation experiments on multiple retinal image benchmark datasets validate the superiority of the ECH framework, demonstrating its strong generalizability and applicability.
|
| |
| 16:45-17:00, Paper TuB16.72 | |
| Prediction-Driven Departure Pushback Optimization Via Spatio-Temporal Graph Convolutional Networks |
|
| Zhao, Yongkang | Civil Aviation University of China, Tianjin 300300, China |
| Wu, Fan | Civil Aviation University of China |
| Feng, Xia | Civil Aviation University of China |
| Zhang, Mingze | Civil Aviation University of China |
| Zuo, Haichao | Civil Aviation University of China |
|
|
| |
| 16:45-17:00, Paper TuB16.73 | |
| DSP-DETR: A Hybrid Context-Aware and Balanced Network for High-Precision Object Detection in Remote Sensing Images |
|
| Chen, Junchi | Chongqing Normal University |
| Wei, Yan | Chongqing Normal University |
Keywords: Deep Learning, Image Processing and Pattern Recognition, Representation Learning
Abstract: 遥感图像中的物体检测面临极端宽高比、密集分布的微小物体以及复杂的背景干扰等关键挑战。现有基于Transformer的检测器通常采用传统的全局特征聚合,这很容易触发严重的“全局平滑”效应。这导致致密物体之间的特征纠缠以及对微小物体的灾难性漏检。为打破这一规模感知瓶颈,我们提出了一种名为DSP-DETR的新型混合上下文感知与平衡网络。通过采用“协作优化”策略,我们的框架深度将特征提取与梯度约束结合起来。在功能层面,多尺度扩展条带池(DSP)模块设计用于实现实例级语义解耦,有效保留微小物体的局部高频梯度,同时捕捉远距离轴向依赖关系。在梯度层面,我们引入带有角度约束的SIoU损失,以精确优化极端宽高比对象的包围盒回
|
| |
| 16:45-17:00, Paper TuB16.74 | |
| BridgeLog: Bridging the Distribution Gap in Cross-System Log Anomaly Detection Via Active Domain Adaptation |
|
| Zhang, Jingyu | Changsha University of Science & Technology |
| Liu, Qinfei | Changsha University of Science & Technology |
| Duan, Yuheng | Xiangnan University |
| Li, Yan | National University of Defense Technology |
Keywords: Fault Monitoring and Diagnosis, Transfer Learning, Deep Learning
Abstract: Log-based anomaly detection is crucial for maintaining the reliability of modern software systems. However, existing methods rely heavily on labor-intensive annotations and are frequently hindered by severe data heterogeneity across disparate systems. Although transfer learning mitigates label dependency, its efficacy is constrained by cross-domain distribution shifts and the target-domain cold-start problem. To overcome the dual bottlenecks of distribution discrepancies and label scarcity, we propose BridgeLog, a novel framework integrating feature decoupling with active domain adaptation. Specifically, BridgeLog employs a System Orthogonal Feature Decoupling (SOFD) mechanism to isolate system-specific noise, extracting pure, system-invariant features to bridge the semantic gap between domains. Concurrently, a dual-scoring active learning strategy precisely selects the most informative target-domain samples under a strictly limited annotation budget. These selected samples serve as essential anchors to guide target domain alignment, effectively mitigating the cold-start issue. Extensive experiments across six cross-system scenarios demonstrate that BridgeLog achieves an average F1-score of 91.65% under a stringent 2% target-label budget, significantly outperforming state-of-the-art baselines by 8.06%.
|
| |
| 16:45-17:00, Paper TuB16.75 | |
| MCaPT: Multi-Caption Aggregation Guided Prompt Tuning for Vision-Language Models |
|
| Yu, Hewei | South China University of Technology |
| Zhou, Yuxi | South China University of Technology |
| Liu, Mingcan | Beijing Normal University |
Keywords: Image Processing and Pattern Recognition, Deep Learning, Representation Learning
Abstract: Prompt tuning enables efficient downstream adaptation of Vision-Language Models (VLMs). Early approaches typically rely on handcrafted prompts that are semantically simple and struggle to capture fine-grained features. Subsequent works leverage Large Language Models (LLMs) for knowledge enhancement to enrich semantics. However, the generated class descriptions originate from linguistic priors, may introduce semantic bias, and incur additional LLM service and prompt engineering costs. Confronting these challenges, we propose a plug-and-play Multi-Caption Aggregation guided Prompt Tuning (MCaPT) framework. The core of MCaPT is to construct a rich and robust semantic supervision signal from downstream image data to guide prompt optimization. Specifically, the proposed method first organizes target-task samples through clustering and uses a lightweight captioner to generate multiple candidate descriptions aligned with the visual content. It then filters these captions and performs weighted aggregation to obtain a more stable semantic representation. Finally, this representation serves as a semantic constraint to guide prompt learning. The main contributions of MCaPT lie in three aspects: cluster-based caption generation captures intra-class visual diversity, robust filtering and weighted aggregation produce stable semantic supervision, and the resulting guidance can be incorporated into multiple existing prompt-tuning methods without additional learnable parameters. We conduct extensive experiments on 11 datasets, demonstrating that MCaPT can be integrated with multiple existing prompt tuning baselines and consistently improves performance.
|
| |
| 16:45-17:00, Paper TuB16.76 | |
| Geometric Ambiguity and Learning-Based Reactive Planning for Deceptive UAV Navigation in Cluttered Environments |
|
| Yao, Ran | Taiyuan University of Technology |
| Shang, Yu | Taiyuan University of Technology |
| Xue, Yuntao | Taiyuan University of Technology |
Keywords: Game Theory and Multi-Agent Systems, Optimization Control, Autonomous Vehicle
Abstract: Unmanned aerial vehicles (UAVs) deployed in adversarial missions must reach their true targets safely while concealing flight intentions from external observers. Existing deceptive path planning methods mainly consider obstacle-free or simplified low-dimensional settings and often assume accurate trajectory tracking, limiting their applicability in cluttered three-dimensional environments where obstacle avoidance may reveal intent. To address this, this work proposes a unified framework that combines geometric ambiguity with learning-based reactive planning. The UAV is guided along the perpendicular bisector of the real and decoy targets to preserve spatial ambiguity, while a lightweight exaggeration penalty is incorporated into the planner to suppress intent-revealing trajectories. An LDP-based phase-switching mechanism further balances ambiguity maintenance and timely convergence. Experiments in randomized 3D forest environments demonstrate near-optimal ambiguity at the deception boundary, positive path completion, and 100% navigation success, validating the effectiveness of the proposed framework.
|
| |
| 16:45-17:00, Paper TuB16.77 | |
| Tree-Of-Thoughts Reasoning for Text-To-Image In-Context Learning |
|
| Alekseeva, Stepanida | Korea University |
| Kalafatovich Espinoza, Jenifer | Korea University |
| Lee, Seong-Whan | Korea University |
Keywords: Generative AI, Image Processing and Pattern Recognition, Deep Learning
Abstract: In text-to-image in-context learning (T2I-ICL), a model has to infer a latent compositional pattern from few-shot demonstrations for generating a query image. Recent studies show that state-of-the-art multimodal large language models struggle with this setting, particularly due to limited compositional reasoning and sensitivity to prompt construction. In this work, we propose a Tree-of-Thoughts (ToT) reasoning framework for T2I-ICL that introduces a multi-stage reasoning and selection layer that generates, evaluates, and selects among multiple candidate hypotheses before constructing the final prompt for image synthesis. By exploring alternative reasoning branches and selecting a coherent interpretation, the proposed approach mitigates prompt ambiguity and compositional errors. We implement the proposed approach in a complete ToT-T2I-ICL inference pipeline and evaluate it on the CoBSAT benchmark. Both qualitative and quantitative results show that structured multi-branch reasoning leads to more consistent and semantically aligned image generation compared to baseline and Chain-of-Thought prompting strategies, without any additional training or fine-tuning.
|
| |
| 16:45-17:00, Paper TuB16.78 | |
| GODiT: Graph-Enhanced Diffusion Transformer for Spatial Transcriptomics Imputation Via Optimal Transport |
|
| Xiao, Boyuan | National University of Defense Technology |
| Yan, XiaoMing | National University of Defense Technology |
| Xu, Zhiwen | National University of Defense Technology |
| Chi, HaoAng | National University of Defense Technology |
| Lan, Long | NUDT |
| Xu, Liyang | NUDT |
Keywords: Deep Learning, Generative AI, Biometrics and Applications
Abstract: Spatial transcriptomics (ST) characterizes gene expression in its native tissue context, but the observed spot- level profiles are often highly sparse due to limited capture efficiency and sequencing depth. A common strategy is to use single-cell RNA sequencing (scRNA-seq) as a reference when imputing missing ST measurements. However, existing methods often insufficiently model spatial neighborhood struc- ture and do not explicitly address the distribution mismatch between scRNA-seq and ST data. To address these issues, we propose GODiT, Graph-Enhanced Diffusion Transformer for Spatial Transcriptomics Imputation via Optimal Transport. GODiT integrates a dual-phase graph encoder—expression- based neighborhood graphs during training and coordinate- based spatial graphs during inference—with optimal-transport regularization for latent cross-modal alignment and a condi- tional diffusion transformer for progressive expression recovery. In this way, GODiT preserves local topology while reducing modality-induced bias. The central goal of GODiT is to learn a complementary representation that jointly leverages the dense transcriptomic coverage of scRNA-seq and the spatial context of ST, so that the imputation model is both cross-modally informed and spatially coherent. Experimental results show that GODiT achieves competitive imputation accuracy and better preserves biologically meaningful spatial structure, indicating that the learned complementary representation transfers effec- tively from scRNA-seq to ST.
|
| |
| 16:45-17:00, Paper TuB16.79 | |
| Joint Optimization of Behavioral and Data Privacy for Computation Offloading in Multi-User Mobile Edge Computing Systems |
|
| Xie, Shengxin | Southwest University of Science and Technology |
| Sun, Haifeng | Southwest University of Science and Technology |
Keywords: Intelligent Internet Systems, Computational Intelligence, Reinforcement Learning
Abstract: In multi-user multi-access-point mobile edge computing (MEC) systems, offloading computation-intensive tasks to edge servers effectively alleviates the limited battery capacity and local computing capability of user devices. However, the offloading process is constrained by stringent energy-delay requirements and severe privacy risks, including sensitive data leakage and behavioral-trajectory exposure. To address these challenges, this paper proposes a joint optimization scheme for terminal energy saving and privacy preservation. First, an information-theoretic dual-dimension privacy metric is established. For internal data privacy, differential privacy (DP) is introduced and the leakage of sensitive data during execution is quantified by mutual information. For external behavioral privacy, behavioral entropy is employed to model long-term offloading patterns and suppress excessive concentration on specific targets, thereby resisting traffic-analysis attacks. Then, under the maximum-delay requirement, the long-term average system-cost minimization problem is formulated as a high-dimensional non-convex optimization problem. To solve it, we develop a semi-distributed federated multi-agent reinforcement learning (MAFRL) framework with local policy learning and parameter-level aggregation. Simulation results demonstrate that, compared with mainstream reinforcement-learning baselines, the proposed method effectively reduces the overall system cost and achieves a favorable trade-off between terminal energy saving and dual-dimension privacy protection.
|
| |
| 16:45-17:00, Paper TuB16.80 | |
| Structure-Aware Just-In-Time Vulnerability Detection with Code Semantic Fusion |
|
| Yuan, Zhihao | Beijing Information Science and Technology University |
| Jianwei, Hou | Data and Technology Support Center of the Cyberspace Administration of China |
| Wang, Xudong | Beijing Information Science and Technology University |
| Zheng, Liwei | Beijing Information Science and Technology University |
| Zeng, Zheng | Beijing Information Science and Technology University |
Keywords: Deep Learning
Abstract: Deep learning-based JIT (just-in-time) vulnerability detection has received increasing attention in recent years.However, existing approaches that model code changes with CTG (Code Transformation Graph) often suffer from structural redundancy, noise interference, and limited semantic expressiveness. These issues hinder their effectiveness in realistic and complex scenarios. To address this problem, we propose SA-JIT (Structure-Aware JIT). SA-JIT is a structure-aware approach for JIT vulnerability detection that integrates structural signals with code semantic features. Specifically, SA-JIT learns node-level weights over CTG to suppress noise and incorporates global semantic context to enhance representation learning.Experimental results on real world project datasets show that SA-JIT consistently outperforms CodeJIT under both cross-project and cross-time settings, improving accuracy by 2%-3%,precision by 3%-4%, recall by 4%-8%, and F1 by 4%-5%.
|
| |
| 16:45-17:00, Paper TuB16.81 | |
| Two-Stage Deep Learning for Multiclass Segmentation of Aortic Aneurysm Lumen and Intraluminal Thrombus across Multiple Aortic Regions on CTA |
|
| Jin, Ye | GMU |
| Spinosa, David | Fairfax Radiological Consultants and Inova Fairfax Hospital |
| Jihui, Li | Inova Fairfax Hospital |
| Tang, Jinshan | George Mason University |
Keywords: Deep Learning, Application of Artificial Intelligence, Machine Learning
Abstract: Accurate segmentation of aortic aneurysms on computed tomography angiography (CTA) is essential for quantitative assessment and treatment planning, yet existing deep learning methods are often region-specific and frequently underperform in cases with low intraluminal thrombus (ILT) burden. This paper presents a unified two-stage deep learning framework for multi-class segmentation of abdominal, thoracic, and thoracoabdominal aortic aneurysms on CTA. In the first stage, lumen and ILT labels are combined into a binary sac target and localized using a low-resolution 3D network to capture global anatomical context over the extended craniocaudal extent of disease. In the second stage, the predicted sac is converted into an adaptive patient-specific region of interest (ROI) for high-resolution multi-class segmentation of lumen and ILT. To enhance delineation of small thrombus regions, the second stage employs a Dice-TopK region loss with an auxiliary ILT-focused focal Tversky term. Five-fold cross-validation on 64 CTA cases showed that the low-resolution first-stage network achieved the best sac localization performance, with a Dice score of 0.940 ± 0.048. The proposed ROI-based second stage with the tailored loss improved lumen segmentation compared with a full-volume full-resolution baseline (Dice: 0.957 vs. 0.940) and also improved overall ILT segmentation (Dice: 0.738 vs. 0.705). The strongest ILT performance was observed in higher-burden cases, where Dice reached 0.871 ± 0.152 for ILT volume percentage ≥9%. These findings support adaptive ROI refinement as an effective strategy for unified multi-region aortic aneurysm analysis on CTA.
|
| |
| 16:45-17:00, Paper TuB16.82 | |
| SCCL: Semantic-Enhanced Causal Contrastive Learning for Cross-Domain Sequential Recommendation |
|
| Ji, ZhongQing | Hangzhou Dianzi University |
| Zhou, Renjie | Hangzhou Dianzi University |
| Yang, Chunyao | University of Science and Technology of China |
| Zhang, Wei | Hangzhou Dianzi University |
| Shi, Jun | Academy of Cyber, Beijing, China |
| Lan, Leyang | Hangzhou Dianzi University |
| Liao, Yong | University of Science and Technology of China |
Keywords: Transfer Learning, Representation Learning, Deep Learning
Abstract: Cross-domain sequential recommendation often suffers from domain-specific biases in interaction data, which obscure intrinsic user preferences. Existing debiasing methods, such as Bayesian modeling debiasing, struggle to fully separate domain noise from genuine preferences, thereby limiting the inference of underlying cross-domain intentions. To address this, we propose SCCL (Semantic-Enhanced Causal Contrastive Learning), which explicitly models the causal mechanisms underlying user interactions to deconfound domain biases. First, by constructing a contrastive learning architecture between a factual view integrating domain biases and ratings and a counterfactual view masking true ratings, we maximize representation consistency to actively filter out spurious correlations and learn bias-invariant user representations. Second, we employ a cross-attention mechanism to incorporate reviews from both domains, semantically complementing the behavioral sequences. This enrichment builds an effective semantic bridge, alleviating data sparsity and representation gaps during crossdomain feature mapping. Experimental results on benchmark datasets indicate that SCCL yields better performance than existing methods, while maintaining consistent generalization in zero-shot settings.
|
| |
| 16:45-17:00, Paper TuB16.83 | |
| IT-MCT: Information-Theoretic Modality-Collaborative Transformer for Robust Emotion Recognition under Extreme Incompleteness |
|
| Bian, Changlong | Qilu University of Technology (Shandong Academy of Sciences) |
| Wang, Xingang | Qilu University of Technology(Shandong Academy of Sciences) |
| Gong, Xi | Qilu University of Technology (Shandong Academy of Sciences) |
| Tang, Panying | Qilu University of Technology (Shandong Academy of Sciences) |
Keywords: Affective Computing, Representation Learning, Multimedia Computation
Abstract: Multimodal Emotion Recognition (MER) focuses on deducing human affective states by synthesizing heterogeneous information streams. However, in real-world applications, extreme data incompleteness caused by sensor failures or environmental noise leads to significant performance degradation. Traditional zero-filling or generative reconstruction methods often introduce noise and impose a heavy structural burden for decoding, failing to effectively bridge the modality gap and risking semantic hallucinations. To address these challenges, this paper proposes a unified Information-Theoretic Modality-Collaborative Transformer (IT-MCT) to achieve robust MER via topological manifold alignment rather than ill-posed feature reconstruction. Specifically, a Hyper-Context Routing mechanism equipped with Adaptive Gating is first designed to dynamically control the cross-modal information flow. It acts as an information valve to block noise propagation from both macro-level modality missing and micro-level signal degradation. Second, a two-stage robust learning paradigm is introduced: (1) an Independent Subspace Contrastive Pre-training stage bridges the modality gap by aligning heterogeneous representations into a unified metric space; and (2) a Confidence-Aware Manifold Alignment stage leverages a parameter-frozen full-modality teacher network to guide the incomplete-modality student. By establishing a strict confidence threshold, this paradigm explicitly prevents negative transfer from ambiguous samples, enabling the recovery of deep emotional semantics without complex generative decoders. Extensive experiments on the IEMOCAP, MSP-IMPROV, and CMU-MOSI benchmark datasets demonstrate that the proposed IT-MCT achieves highly competitive performance, consistently outperforming baselines in Unweighted Accuracy (UA) under diverse incomplete scenarios, validating its effectiveness and robustness with substantially lower spatial and computational complexity.
|
| |
| 16:45-17:00, Paper TuB16.84 | |
| CORAL: Collaborative Knowledge Learning Via Adaptive Discrete Prompt Optimization |
|
| Wang, Zhaokun | University of Electronic Science and Technology of China |
| Pu, Jingwen | University of Electronic Science and Technology of China |
| Chen, Xunlei | University of Electronic Science and Technology of China |
| Guo, Jinyu | University of Electronic Science and Technology of China |
| Tian, Wenhong | University of Electronic Science and Technology of China |
Keywords: Deep Learning, Application of Artificial Intelligence, AI and Applications
Abstract: Distributed cognition and collaborative problem-solving are cornerstones of intelligent systems, yet leveraging centralized Large Language Models (LLMs) remains challenging for organizations with siloed, privacy-sensitive datasets. Individual agents often lack sufficient data to steer these models via discrete prompts, a natural but hard-to-optimize method. To bridge the gap between decentralized knowledge and centralized capability, we introduce CORAL, a federated framework for collaborative discrete prompt optimization. In the CORAL framework, clients use private data to interact with a frozen, black-box large language model (L-LLM), utilizing feedback rewards to update local small language models (S-LLMs) serving as policy networks. A central server aggregates weights of lightweight LoRA modules and distributes global parameters, equipping each client with a globally optimized prompt generator while ensuring privacy. Experiments demonstrate that CORAL enables resource-constrained institutions to collectively harness LLMs, validating a robust mechanism for intelligence in privacy-constrained environments.
|
| |
| 16:45-17:00, Paper TuB16.85 | |
| SpineAware-Net for MRI-Based Differential Diagnosis of Spinal Infections |
|
| Tang, Shimin | Shandong Normal University |
| Wang, Qifei | Shandong Normal University |
| Liu, Chen | Qilu Hospital of Shandong University |
| Chen, Bolin | Shandong Normal University |
| Si, Haipeng | Qilu Hospital of Shandong University |
| Wang, Jingjing | Shandong Normal University |
Keywords: Image Processing and Pattern Recognition, Deep Learning, Medical Informatics
Abstract: Brucellar spondylitis (BS), pyogenic spondylitis (PS), and spinal tuberculosis (STB) often exhibit overlapping imaging characteristics on preoperative MRI scans, making differential diagnosis challenging. Existing deep learning methods mainly rely on spatial modeling and therefore have limited ability to jointly capture complex anatomical structures and fine-grained pathological textures. To address this issue, we propose SpineAware-Net, a dual-stream spatial-frequency collaborative framework for spinal infection classification. In the spatial branch, Parallel Asymmetric Reparameterization Blocks (PARB) are introduced to enhance the representation of irregular lesion morphology. In the frequency branch, Discrete Wavelet Transform (DWT), a Wavelet High-Frequency Enhancement (WHFE) module, and a Spectral-Domain Feature Extraction (SDFE) module are combined to model pathology-related high-frequency textures. The two branches are further integrated through a bilinear interaction mechanism for high-order feature fusion. Experiments on a multi-center MRI dataset show that SpineAware-Net outperforms several representative baselines in the three-class classification task of spinal infections, achieving a patient-level accuracy of 78.26%. Our findings support the potential utility of SpineAware-Net as an MRI-driven diagnostic aid for infectious spinal diseases.
|
| |
| 16:45-17:00, Paper TuB16.86 | |
| MECA-Net: Edge-Guided Multi-Scale Dual-Selective Network for Precise Multi-Class Vertebrae Segmentation in Spinal Medical Images |
|
| Zhang, Changrong | Shandong Normal University |
| Wang, Qifei | Shandong Normal University |
| Wan, HongLin | Shandong Normal University |
| Si, Haipeng | Qilu Hospital of Shandong University |
Keywords: Image Processing and Pattern Recognition, Deep Learning, Medical Informatics
Abstract: Accurate multi-class vertebrae segmentation in spinal medical images is crucial for the diagnosis and treatment planning of spinal disorders, as well as computer-aided spinal image analysis. However, existing methods still struggle with substantial anatomical variation, indistinct boundaries, and strong structural similarity among adjacent vertebrae, which hinders the joint modeling of fine-grained structural details and long-range contextual dependencies. To address these challenges, an Edge-guided Multi-scale Dual-selective Network (MECA-Net) is proposed for precise multi-class vertebrae segmentation in spinal medical images. Specifically, a Dilated Attention Convolutional Block (DACB) is introduced to enhance shallow multi-scale feature representations. A Selective Edge-Contextual Modulator (SECM) is designed to generate reliable edge priors. A Selective Kernel Edge Fusion (SKEF) module is employed to adaptively fuse edge and semantic features. In addition, an Atrous Context Parsing Hybrid (ACPH) module is adopted to capture local details and global anatomical dependencies simultaneously. Experimental results on a self-collected dataset show that MECA-Net achieves a Dice score of 0.9408, an IoU of 0.9023, and an HD95 of 5.16 mm, demonstrating the effectiveness of MECA-Net for multi-class vertebrae segmentation.
|
| |
| 16:45-17:00, Paper TuB16.87 | |
| QHD-KAN: A Phase-Space Aware Quantum-Classical Hybrid Framework for Multivariate Time Series Anomaly Detection |
|
| Dong, Yumin | Chongqing Normal University |
| Jiang, Qihao | Chongqing Normal University |
Keywords: Quantum Machine Learning, AI and Applications, Deep Learning
Abstract: Multivariate Time Series Anomaly Detection (MTS-AD) in Cyber-Physical Systems (CPS) often struggles with complex nonlinear evolution and high-dimensional feature fusion bottlenecks. Additionally, integrating quantum architectures frequently encounters the "barren plateau" optimization dilemma. To address these, we propose QHD-KAN, a novel hybrid quantum-classical framework integrating phase-space dynamics. First, a Phase-Space KAN (PS-KAN) leverages system momentum and fractional-order frequencies to precisely capture microscopic state distortions. Second, a Quantum Hamiltonian evolution Time-domain Mixer (QHTM) simulates multi-body evolution in Hilbert space to physically decouple local trends from global dynamics. Finally, a customized Quantum Collaborative Shape Loss (QCS-Loss) utilizes differential constraints to effectively mitigate gradient vanishing. Extensive experiments on four benchmark datasets demonstrate that QHD-KAN achieves an average F1 score of 0.9341, significantly outperforming mainstream baselines and offering superior accuracy, noise robustness, and physical interpretability for CPS monitoring.
|
| |
| 16:45-17:00, Paper TuB16.88 | |
| Talking Head Synthesis with Facial Landmark Guidance Via 3D Gaussian Splatting |
|
| Yang, Ziheng | Xinjiang University |
| Yu, Yinfeng | Xinjiang University |
| Li, Yongming | Xinjiang University |
Keywords: Deep Learning, Generative AI
Abstract: Audio-driven digital human generation has broad application potential in areas such as virtual reality and remote communication. In recent years, 3D talking head methods based on Neural Radiance Fields (NeRF) and 3D Gaussian Splatting (3DGS) have made significant breakthroughs in modeling 3D facial structures. However, due to the lack of explicit spatial information in audio, audio-driven talking heads face limitations in modeling the relationship between audio and facial motion, leading to unnatural facial animations, particularly in terms of lip synchronization and expression details. To address this issue, we propose a keypoint-guided spatial enhancement module that directs spatial points to focus on structurally critical regions, thereby improving the model’s ability to perceive and model semantically meaningful facial areas. To further enhance the global understanding of the facial structure of the model, we introduce an attribute compensation mechanism based on global key points. Specifically, we encode the keypoints into a global conditioning vector, which is used to refine the attributes of spatial 3DGS points, enabling structural consistency compensation for the underlying shape representation. Extensive experiments demonstrate that our method achieves superior performance on generation quality, visual realism, and lip-sync accuracy.
|
| |
| 16:45-17:00, Paper TuB16.89 | |
| RoleShield: A Secure Guardrail for Large Language Models with Anonymous Auditable Access Control |
|
| Liu, Aodi | Information Engineering University |
| Wei, Yiwei | Information Engineering University |
| Ma, Yingying | Zhengzhou University of Technology |
Keywords: Systems Safety and Security, AI and Applications, Generative AI
Abstract: Large language models (LLMs) face severe challenges in access control security and privacy protection. This paper proposes a secure guardrail for LLMs supporting anonymous auditable access control(RoleShield). RoleShield achieves anonymous identity verification, violation tracing, and semantic-level security management. First, group signature technology enables anonymous user verification and maps users to roles, allowing precise identification of violating users when access is denied. Second, role-permission rules reconstruct user prompts based on prohibition rules, data scope, and capability limitations, ensuring interactive content aligns with user permissions. Finally, a three-layer progressive protection system centered on a streaming semantic security model is constructed, comprising input, streaming generation, and output layers, with a domain knowledge base and session memory mechanism. Experiments verify the effectiveness, achieving 90% interception accuracy for typical attacks in medical vertical domain scenarios.
|
| |
| 16:45-17:00, Paper TuB16.90 | |
| CV-DCLR: Dynamic Label Refinement for Robust Zero-Shot Learning under Semantic Entanglement |
|
| Wang, Can | Qingdao University |
| Li, Jiangnan | Qingdao University |
| Li, Mingyu | Qingdao University |
| Song, Yining | Qingdao University |
| Ren, Kangrui | TongJi University |
| Fan, Jinfu | Qingdao University |
Keywords: Deep Learning, Machine Learning, Transfer Learning
Abstract: Zero-shot learning(ZSL)recognizesunseenclasses byaligningvisual featureswithsemanticprototypes.Inpractice, however, visuallysimilarcategoriesoftenshareattributes, so one imagemay activatemultiple candidate prototypes and yieldambiguouspredictions.Werefertothiseffectassemantic entanglement. Toaddress it,weproposeCV-DCLR, adual streamdynamiclabelrefinementframework.AVisualLikelihood Streammodels image–prototypecompatibility,whileaStruc tural ImportanceStreamestimatesprototypenecessitythrough masking-based cross-attention analysis. AnAdaptiveGating Modulethenfusesthetwostreamsforeachinstance.Experiments onCUB,SUN, andAWA2underbothSemanticEntanglement InjectionandstandardevaluationshowthatCV-DCLRimproves disambiguationunderambiguitywhileremainingcompetitive inthecleansettingwithmodestcomputationaloverhead.
|
| |
| 16:45-17:00, Paper TuB16.91 | |
| Neighborhood-Enhanced Prompting for Knowledge Graph Completion |
|
| Chen, Duxiang | Xinjiang University |
| Kang, Shengguo | Xinjiang University |
| Zheng, Jiong | Xinjiang University |
| Qin, Jiwei | Xinjiang Uinversity |
Keywords: Deep Learning
Abstract: Knowledge graph completion (KGC) aims to infer missing facts in knowledge graphs (KGs) by jointly exploiting structural cues and textual semantics. Recent studies have leveraged pre-trained language models (PLMs) to model textual semantics, yet they still face two challenges: insufficient interaction between structure and text, and limited ability to generate more relevant prompts for effective guidance. To address these issues, we propose Neighborhood-Enhanced Prompting for Knowledge Graph Completion (NEPKGC), a prompt-based framework built upon a PLM, where the PLM parameters are kept fixed and only prompt-related modules and prediction layers are optimized. NEPKGC adopts a dual-branch architecture, in which the structural branch performs neighborhood selection and encodes the selected neighborhoods into prompts, while the textual branch employs a PLM to model textual semantics, enabling their interaction within the PLM. Based on the resulting representations, the model derives text-enhanced structural representations and structure-enhanced textual representations for prediction. Experiments on WN18RR, FB15k-237, and Wikidata5M demonstrate the effectiveness of NEPKGC compared with competitive baselines, and extensive studies further verify its effectiveness.
|
| |
| 16:45-17:00, Paper TuB16.92 | |
| ACCC: A Reliable Method for UAV Control Code Generation Based on a Multi-Agent System |
|
| Wu, Fangbo | Beijing University of Posts and Telecommunications |
| Niu, Kun | Beijing University of Posts and Telecommunications |
| Yang, Tan | Beijing University of Posts and Telecommunications |
| Ma, Sifan | Beijing University of Posts and Telecommunications |
Keywords: Generative AI, Game Theory and Multi-Agent Systems, Robotic Systems
Abstract: Abstract—Unmanned Aerial Vehicles (UAVs) are evolving into multifunctional intelligent platforms. However, directly employing monolithic Large Language Models (LLMs) to generate fine-grained flight control code suffers from fundamental deficiencies, including state tracking failures, weak spatial reasoning, and API mapping errors. To address these issues, we propose ACCC, a reliable flight control code generation method based on multi-agent collaboration consisting of an Action parsing agent, a Code generation agent, and dynamically loadable Constraint verification and Code correction agents. Decoupling action parsing and code generation converts instructions into structured intermediate representations, resolving state tracking and spatial reasoning issues. This transforms code generation into constrained generation, mitigating API mapping errors. Concurrently, a dynamically loadable verification-correction closed-loop enforces physical constraints, eliminating unsafe code. Evaluations on tasks of varying complexities demonstrate that ACCC significantly outperforms state-of-the-art baselines across four core metrics.
|
| |
| 16:45-17:00, Paper TuB16.93 | |
| Spectral Alignment and Multi-Scale Guided Regularization for Weakly-Supervised Whole-Slide Image Classification |
|
| Wu, Jiyang | University of Science and Technology of China |
| Jiang, Dongxun | Tongji University |
Keywords: Medical Informatics, Deep Learning, Application of Artificial Intelligence
Abstract: Whole-slide image (WSI) classification under weak supervision faces two key challenges: (1) diagnostically relevant textural cues are often under-emphasized when learning solely from spatial-domain embeddings, and (2) sparse lesions occupying small tissue regions are easily diluted by global aggregation. To address these issues, we propose a unified multiple instance learning (MIL) framework that couples top-down attention reasoning with two complementary training-time auxiliary modules. First, a spectral feature alignment module (SFAM) constructs band-pooled spectral descriptors from patch embeddings and aligns them with spatial representations through cosine and contrastive objectives, encouraging the model to preserve texture-driven pathological signals that are under-emphasized under weak supervision. Second, a multi-scale guided module (MSGM) constructs focused token subsets via group-wise top-k selection at multiple spatial granularities and enforces perturbation-stable representations through a consistency objective, improving sensitivity to low-prevalence abnormalities. Both modules operate exclusively as training-time regularizers compatible with embedding-based MIL pipelines, adding no inference overhead. Experiments on the TCGA-ESCA datasets demonstrate that the proposed framework consistently outperforms competitive MIL baselines, achieving state-of-the-art performance in weakly supervised WSI classification without requiring instance-level annotations. Code is available at https://github.com/jyatgithub/Spectral-Alignment-and-Multi-Scale-Guided-Regularization-for-Weakly-Supervised-WSI-Classification.
|
| |
| 16:45-17:00, Paper TuB16.94 | |
| CARE: Cost and Risk-Aware Rescheduling for Dynamic UAV Edge Clusters |
|
| Chen, Zhongxiang | Nanjing University of Aeronautics and Astronautics |
| Teng, Meiyan | Nanjing University of Aeronautics and Astronautics |
| Xu, Jianqiu | Nanjing University of Aeronautics and Astronautics |
| Li, Xin | Nanjing University of Aeronautics and Astronautics |
Keywords: Cloud, IoT, and Robotics Integration, Distributed Intelligent Systems
Abstract: Dynamic UAV edge clusters run containerized services on moving aerial nodes, where online rescheduling must cope with multi-resource fragmentation, fluctuating air-to-air links, and bursty workloads. Aggregate idle capacity may exist across the swarm, yet latency-sensitive instances can remain pending because no single UAV exposes a usable resource vector. We propose Cost- and Risk-Aware Rescheduling (CARE), a closed-loop framework that combines cost-aware progressive eviction with risk-aware target selection based on proximal policy optimization (PPO). CARE keeps triggering, pacing, feasibility checks, and recovery as explicit control components, reserving learning only for target-node selection among feasible candidates. We deploy CARE in an end-to-end Kubernetes--KubeEdge testbed with 10 heterogeneous UAV nodes and compare it with five baselines. Across stressed scenarios, CARE improves within-horizon scheduling rate by 13.5%, reduces average waiting time by 56.1%, reduces secondary migration rate by 29.1%, and lowers P95 waiting delay by 55.2% relative to both heuristic and external baselines.
|
| |
| 16:45-17:00, Paper TuB16.95 | |
| Risk-Aware Fault-Tolerant DAG Task Scheduling for UAV-Assisted Edge Computing |
|
| Han, Jian | Nanjing University of Aeronautics and Astronautics |
| Teng, Meiyan | Nanjing University of Aeronautics and Astronautics |
| Xu, Jianqiu | Nanjing University of Aeronautics and Astronautics |
| Li, Xin | Nanjing University of Aeronautics and Astronautics |
Keywords: Cloud, IoT, and Robotics Integration, Distributed Intelligent Systems
Abstract: In edge computing, Unmanned Aerial Vehicles (UAVs) have become key edge nodes due to their flexible deployment capability. In this context, applications are typically modeled as directed acyclic graph (DAG) tasks with dependencies, whose efficient scheduling is critical for achieving low-latency and high-performance services. However, existing studies mainly focus on scheduling optimization under normal conditions, while overlooking task interruptions caused by potential node failures. To address this issue, we investigate the scheduling of UAV-assisted edge DAG tasks and propose a risk-aware fault-tolerant scheduling framework for failure prevention and recovery. In the normal scheduling phase, a Risk-Aware Deep Reinforcement Learning-based Scheduling (RA-DRLS) algorithm is designed to minimize makespan and energy consumption while mitigating the cascading impact of failures. In the fault recovery phase, a Risk-Aware Priority-based Rescheduling (RPRS) algorithm is developed to locally reschedule interrupted and affected tasks. Extensive experiments against state-of-the-art deep reinforcement learning methods, heuristic algorithms, and traditional baselines demonstrate that the proposed method reduces makespan and energy consumption by 20.15% and 10.03% on average, respectively. Under node failure scenarios, the reductions further increase to 23.07% and 12.04%, while the average waiting delay of affected tasks is reduced by 26.46%.
|
| |
| 16:45-17:00, Paper TuB16.96 | |
| Resource-Aware Task Graph Shaping for Microservice Deployment in UAV-Assisted Edge Computing |
|
| Chai, YuTing | Nanjing University of Aeronautics and Astronautics |
| Teng, Meiyan | Nanjing University of Aeronautics and Astronautics |
| Liu, Xiangdong | The University of Sydney |
| Li, Xin | Nanjing University of Aeronautics and Astronautics |
Keywords: Cloud, IoT, and Robotics Integration, Distributed Intelligent Systems
Abstract: With the rise of edge computing, applications are increasingly deployed as microservices in Unmanned Aerial Vehicle (UAV) swarms to exploit distributed computing power. However, microservice scheduling in UAV-assisted edge computing is challenging because network topology, wireless links, computing resources, and battery states vary rapidly over time. Existing deep reinforcement learning (DRL)-based schedulers usually assume fixed task graphs and optimize only task-to-resource mapping, which limits their adaptability under non-stationary UAV resources. To address this issue, we propose a Resource-aware Task Graph Shaping and Scheduling (RTGS) framework, which jointly models microservice graph transformation and task deployment as a coupled decision-making problem. RTGS dynamically performs task split and merge operations according to time-varying resource states, enabling adaptive task granularity and improved task-resource alignment. A dual-graph graph neural network (GNN) with cross-attention captures interactions between task dependencies and UAV resource states, while a PPO-based policy with action masking ensures feasible and stable optimization. Experimental results show that RTGS outperforms strong baselines, achieving 9.8% lower latency, 23.2% fewer deadline violations, and higher task success rate and resource utilization than the best-performing baseline.
|
| |
| 16:45-17:00, Paper TuB16.97 | |
| AG-FPN: An Adaptive Graph-Based Feature Pyramid Network for Micro-Expression Recognition |
|
| Hu, Guohong | University of Chinese Academy of Sciences |
| Xue, Jian | University of Chinese Academy of Sciences |
| Jiang, Hanyu | University of Chinese Academy of Sciences |
| Mao, Shun | University of Chinese Academy of Sciences |
| Liu, Peidong | University of Chinese Academy of Sciences |
| Lu, Ke | University of Chinese Academy of Sciences |
Keywords: Affective Computing, Image Processing and Pattern Recognition
Abstract: Micro-Expression Recognition (MER) is highly valuable yet challenging due to the transient, low-intensity nature of facial movements. While Graph Convolutional Networks (GCNs) could effectively model facial structures, most rely on fixed landmarks or predefined Action Units (AUs). This rigidity limits their adaptation to individual facial variations and subtle muscle coordination. To address this, we propose an Adaptive Graph-based Feature Pyramid Network (AG-FPN) that bypasses manual topological constraints by learning dynamic semantic regions directly from pixel-level features. First, we introduce an Attention-Enhanced Feature Pyramid Network (AFPN) that leverages optical flow to extract robust multi-scale motion representations while suppressing background noise via attention mechanisms. Crucially, we design an Adaptive Graph Interaction Module (AGIM) that autonomously learning latent semantic nodes from pixel-level features. A dual-constraint adjacency matrix is then dynamically constructed to model long-range dependencies based on both spatial proximity and feature semantics. Extensive experiments on four widely used benchmarks (SMIC, CASME II, SAMM, and DFME) demonstrate that AG-FPN achieves state-of-the-art performance compared to existing methods.
|
| |
| 16:45-17:00, Paper TuB16.98 | |
| DDID: A Semi-Supervised Domain Adaptation Model for Medical Image Segmentation Based on Local-Global Dual-Teacher and Dual Discrepancy Integrated Knowledge Distillation |
|
| Zhang, Huiyu | Inner Mongolia Normal University |
| Yuan, Yuyang | Inner Mongolia Normal University |
| Xu, Qiaozhi | Inner Mongolia Normal University |
| Zhi, Min | Inner Mongolia Normal University |
| Yin, Yanjun | Inner Mongolia Normal University,College of Computer Science and Technology |
Keywords: Image Processing and Pattern Recognition
Abstract: Medical image segmentation is a key technique for assisting clinical diagnosis, but it often faces significant domain distribution shifts in cross-center and cross-modality scenarios. Semi-supervised domain adaptation (SSDA) mitigates this issue by leveraging a small amount of labeled data in the target domain. However, existing SSDA methods are limited by rigid integration strategies and weak boundary handling. To address these issues, this paper proposed an optimized framework, termed dual discrepancy integrated knowledge distillation (DDID).The proposed framework introduced a dynamic selective ensemble (DSE) strategy, which used the similarity between dual-teacher predictions and combined it with the real-time performance of the model to adaptively adjust the pseudo-label generation threshold, thereby effectively balancing exploration and exploitation during training. A confidence-driven prediction refinement (CDPR) module was then designed. It performed local patch-level confidence evaluation and applied a cross-teacher patch replacement mechanism, together with a Kullback–Leibler divergence-based semantic discrepancy gating, to selectively repair low-confidence boundary regions. Finally, a confidence-weighted averaging (CWA) fusion strategy was employed to generate high-quality soft labels, which provided more robust distillation supervision for the student model. Cross-modality experiments on the BraTS 2018 dataset demonstrated that DDID not only significantly improved the Dice coefficient under extremely limited annotation settings such as SSDA:1 and SSDA:5,but also markedly enhanced the topological accuracy of segmentation boundaries, as measured by the Hausdorff Distance (HD).Its performance approached that of fully supervised training, which verified the effectiveness and practical value of the proposed method in handling complex clinical data shifts.
|
| |
| 16:45-17:00, Paper TuB16.99 | |
| PA-DPR: Positive-Augmentation for Dense Passage Retrieval |
|
| Chen, Chen | East China Normal University |
| Cao, Guitao | East China Normal University |
Keywords: Representation Learning, Machine Learning, Neural Networks and their Applications
Abstract: Open-Domain Question Answering (ODQA) systems rely heavily on dense retrievers to identify relevant passages within vast, unstructured corpora. However, current retrieval models suffer from semantic brittleness, exhibiting limited generalization to diverse linguistic variations and failing to retrieve accurately in out-of-distribution scenarios. We empirically demonstrate that positive sample augmentation is a key driver for improving generalization. Consequently, we propose Positive-Augmentation Dense Passage Retriever (PA-DPR), a novel training paradigm that harmonizes multi-source positive augmentation with a heterogeneous bi-encoder architecture. Specifically, PA-DPR synthesizes semantically faithful training pairs through back-translation and LLM-guided rewriting, thereby alleviating supervisory sparsity and diversifying the learning signal. To accommodate the inherent structural asymmetry between queries and documents, we introduce a heterogeneous bi-encoder that employs specialized encoders optimized for their respective linguistic properties. Extensive experiments on multiple ODQA benchmarks demonstrate that PA-DPR consistently outperforms state-of-the-art baselines, achieving up to a 4% increase in Hit@20.
|
| |
| 16:45-17:00, Paper TuB16.100 | |
| DCC: Decoder-Internal Certainty Transfer for Late-Stage Correction in Camouflaged Object Detection |
|
| Li, Yanshan | East China Normal University |
| Zeng, Peng | East China Normal University |
Keywords: Image Processing and Pattern Recognition, Machine Vision, Deep Learning
Abstract: Recent camouflaged object detectors localize coarse regions reliably, but residual errors often remain in the final decoder, especially around transition bands and thin structures. Existing uncertainty-aware COD methods mainly regularize final logits, leaving decoder-internal certainty underused for later refinement. We present DCC, a lightweight decoder-side certainty-transfer mechanism instantiated on the image branch of ZoomNeXt. SCPM derives a coarse prior from an intermediate decoder feature and feeds certainty-aware consensus cues back into the decoder stream; UBRM then combines the inherited prior with transferred semantics to refine the final high-resolution feature before prediction. The design reuses the decoder's own intermediate certainty for targeted late-stage correction without changing the backbone or main decoder topology. Under a shared protocol, DCC consistently improves the ZoomNeXt reference on CAMO, CHAMELEON, COD10K, and NC4K. On COD10K and NC4K, Sm increases from 86.2% to 87.5% and from 87.5% to 88.7%, weighted F-measure increases from 77.0% to 79.1% and from 81.7% to 83.6%, and MAE decreases from 2.5% to 2.1% and from 3.6% to 3.3%, respectively, with an overhead of only 0.37M parameters and 3.13G FLOPs.
|
| |
| 16:45-17:00, Paper TuB16.101 | |
| SSAD: Spike-Stable Decomposition and Bidirectional Cross-Attention for Multivariate Time Series Anomaly Detection |
|
| Shi, Qianfeng | Beijing University of Posts and Telecommunications |
| Wang, Ye | Beijing University of Posts and Telecommunications |
| Xiao, Ting | Beijing University of Posts and Telecommunications |
| Zhu, Xinning | Beijing University of Posts and Telecommunications |
| Hu, Zheng | Beijing University of Posts and Telecommunications |
Keywords: Deep Learning, Machine Learning, Neural Networks and their Applications
Abstract: Multivariate time series anomaly detection is of great importance in scenarios such as industrial monitoring and intelligent operations and maintenance. However, time series typically contain rapidly varying local fluctuations (i.e., prominent spikes), which are difficult for existing methods to effectively capture, thereby limiting anomaly detection performance. To address this issue, we propose the SSAD, a framework based on spike-stable decomposition and bidirectional cross-attention. It includes a spike-stable extraction module that decomposes the time series into two complementary components, namely spike and stable. Subsequently, a multilayer perceptron (MLP) and a temporal convolutional network (TCN) are employed as encoders for feature extraction, where the MLP models the spike component corresponding to spike-like local abrupt variations, and the TCN captures the overall temporal features of the stable component after removing prominent spikes. In addition, a bidirectional cross-attention mechanism is introduced to enable information interaction between the two types of features, thereby enhancing overall representation capability. The proposed framework is extensively evaluated using four real-world datasets. Experimental results indicate that incorporating spike-stable decomposition and bidirectional cross-component interaction enables SSAD to achieve highly competitive performance relative to current state-of-the-art solutions.
|
| |
| 16:45-17:00, Paper TuB16.102 | |
| KSBP: Risk-Conditional Conformal Prediction Via Kernel Smoothing and Budget Projection |
|
| Feng, Zishuo | Southwest Minzu University |
| Yan, Xinyue | Southwest Minzu University |
| Li, Weibang | Southwest Minzu University |
Keywords: Machine Learning, Control of Uncertain Systems
Abstract: 共形预测(CP)提& #20379;无分布 不确定性量化, 0294;其保证为 主要为边缘性, 9988;可能掩盖系统ঝ ; 5;覆盖不足 针对高风险样本 2290;这个问题尤为ߐ ; 5;重 在安全敏感的时 8388;序列应用中。ৎ ; 5;们提议 KSBP(核平滑与预算 ; ;投影),一个 风险条件共形预 7979;框架 在连续风险范围 0869;分配保障。KSBP 结合了内核平滑 0340;错覆盖分配共ߝ ; 9; 跨越邻近的风险 1561;级,采用封闭ঁ ; 5;预算 预测以强化全球 1487;行性。理论上ᦁ ; 2; 我们证明 KSBP 相对于 在平滑性下的最 0339;固定可行分配 假设。金融、能 8304;和医疗保健的ऩ ; 4;验 基准测试显示,KSB P通过以下方式减 23569;了覆盖不平衡 平均涨幅为22.6%, ; 2;幅最高可达55%,ࡧ ; 6;时保持稳定 竞争区间宽度和 6793;际效度。
|
| |
| 16:45-17:00, Paper TuB16.103 | |
| SDM-Instructor: An MIL-Based Semantic Decoupling MoE for Navigation Instruction Generation |
|
| Ma, Rui | Tianjin University |
| Niu, Chao | Tianjin University |
| Han, CongWei | Tianjin University |
| Lu, Haojie | Zhengzhou University |
Keywords: Generative AI, Deep Learning, AI and Applications
Abstract: 作为具身人工智能中的关键任务,导航指令生成(NIG)旨在将机器人对导航路径的全景观测和操作转换为高质量的导航指令。尽管现有方法取得了巨大进步,但避免生成歧义或重复的指令仍然是个挑战。因为这些方法共同编码所有路径线索,忽略了语言元素与不同特征之间的联系。例如,名词主要以视觉特征呈现,而动词则主要以运动特征出现。为解决这一问题,我们提出了SDM-Instructor,引入了一种新的语义解耦专家混合(SD-MoE)模块。该方法有效减少了语义干扰——即因视觉信息与动作信息混淆而产生的混淆,例如使用不必要的动作细节生成名词。具体来说,SD-MoE将不同语义线索的特征建模分离开来,利用专业专家独立处理视觉特征和动作特征。
|
| |
| 16:45-17:00, Paper TuB16.104 | |
| Hierarchical Two-Stage Gaussian Mixture Model for Robust Cross-Modal Retrieval |
|
| Huang, Yucheng | Sichuan University |
| Deng, Langxuan | Sichuan University |
| Hu, Wanrou | Sichuan University |
| Wang, Yilin | Sichuan University |
| Wang, Peng | Sichuan University |
Keywords: Multimedia Computation, Multimedia Systems, Deep Learning
Abstract: Cross-modal retrieval aims to align semantically consistent instances across different modalities via learning a common semantic space, and has achieved remarkable progress with broad applications in real-world scenarios. However, traditional methods often rely on perfectly clean annotations which are rarely available in practice, since large-scale multimodal datasets are usually constructed through crowdsourcing or automatic web crawling, thereby introducing inevitable label noise that severely impairs retrieval performance. Moreover, most robust approaches adopt the oversimplified binary partition of clean and noisy samples, which often fails to capture the inherent prediction confidence and the unequal contributions of samples with different confidence, thus fundamentally constraining their effectiveness and robustness against label corruption. To address these limitations, we propose a novel Hierarchical Two-Stage Gaussian Mixture Model for Robust Cross-modal Retrieval (HTGR) framework. Specifically, we design a Hierarchical Probabilistic Pair Clustering (HPPC) module that progressively partitions training samples into four fine-grained clusters with distinct purity and confidence levels based on multimodal joint predictive probabilities to improve clustering reliability. Building upon this fine-grained clustering, a Cluster-Guided Differentiated Learning (CGDL) strategy is developed to assign tailored optimization objectives to each cluster to achieve a delicate balance between exploiting clean semantic information and suppressing label noise interference. Extensive experiments on three widely used benchmark datasets under varying symmetric noise ratios demonstrate the superior effectiveness and robustness of our proposed method.
|
| |
| 16:45-17:00, Paper TuB16.105 | |
| Microservice Scheduling for Software-Defined Satellites with Thermal and Energy Safety Awareness |
|
| Li, Zhongyuan | Nanjing University of Aeronautics and Astronautics |
| Teng, Meiyan | Nanjing University of Aeronautics and Astronautics |
| Qin, Xiaolin | Nanjing University of Aeronautics and Astronautics |
| Li, Xin | Nanjing University of Aeronautics and Astronautics |
Keywords: Cloud, IoT, and Robotics Integration, Distributed Intelligent Systems
Abstract: Low Earth Orbit (LEO) satellites increasingly support onboard intelligent processing. In software-defined satellite environments, multiple command requests may arrive during a ground-station communication window, each inducing a dependency-constrained microservice workflow. To schedule such workflows under resource, thermal, energy, and dependency constraints, we propose Thermal- and Energy-Safety-Aware Proximal Policy Optimization (TESA-PPO), a reinforcement-learning framework for onboard microservice scheduling on heterogeneous satellite platforms. TESA-PPO makes decisions over a dynamic feasible task-board candidate set by combining constraint-aware filtering, shared candidate scoring, and graph-aware representations. Experiments against deep reinforcement learning, heuristic, and traditional baselines show that TESA-PPO achieves the best overall performance, reducing makespan and energy consumption by 11.40% and 12.49% on average.
|
| |
| 16:45-17:00, Paper TuB16.106 | |
| Design and Implementation of an LLM-Driven Group Cognitive Awareness Tool in CSCL |
|
| Song, Sihan | Shanghai Normal University |
| Li, Luqun | Shanghai Normal University |
| Wu, Weizi | Shanghai WisFutura Technology Co., Ltd |
| Wang, Xinming | Shanghai Normal University |
| Chen, Jiawen | Shanghai Normal University Tianhua College |
Keywords: Cooperative Work in Design, Generative AI, Augmented Cognition
Abstract: In Computer-Supported Collaborative Learning (CSCL), learners often struggle to perceive the deep cognitive states of their group in real-time, a challenge that frequently leads to diminished collaborative efficiency. To address the limitations of traditional awareness tools regarding semantic mining depth and interpretability, this paper proposes and implements CogGAware, an LLM-based group cognitive awareness system. The system adheres to a process framework of "Cognitive Mining—Visual Feedback—Group Cognitive Awareness." By leveraging a dual-analysis mechanism within the Large Language Model (LLM)—comprising automated topic mining and directed cognitive statistics—the system transforms unstructured discussion text into multi-dimensional, real-time structured cognitive representations, which are subsequently rendered through interactive visualizations. The system was validated through a classroom application experiment conducted within a graduate-level course in Educational Technology. Experimental results indicate that learners provided high evaluations for the system’s Perceived Ease of Use (PEOU) and Perceived Usefulness (PU), while reporting a relatively low level of cognitive load. Subsequent qualitative analysis of the investigative findings suggests that CogGAware effectively enhances learners' perception of both individual and collective cognitive states, facilitates the formation of group consensus, and triggers Socially Shared Regulation of Learning (SSRL) behaviors. These findings demonstrate the practical feasibility of LLM-based semantic analysis in supporting group cognitive awareness. The proposed system offers a viable pathway for the design of intelligent learning support tools within CSCL environments.
|
| |
| 16:45-17:00, Paper TuB16.107 | |
| COTE: Context-Boundary Temporal Decoupling for Video Moment Retrieval |
|
| Su, Wenwen | Institute of Information Engineering, Chinese Academy of Sciences; University of Chinese Academy of Sciences |
| Li, Min | Institute of Information Engineering, Chinese Academy of Sciences; University of Chinese Academy of Sciences |
| Ren, Junxing | Institute of Information Engineering, Chinese Academy of Sciences |
| Chen, Lin | Institute of Information Engineering, Chinese Academy of Sciences; University of Chinese Academy of Sciences |
| Gao, Chenghua | Institute of Information Engineering, Chinese Academy of Sciences; University of Chinese Academy of Sciences |
| Fu, Jitao | Institute of Information Engineering, Chinese Academy of Sciences; University of Chinese Academy of Sciences |
| Sun, Haobin | Institute of Information Engineering, Chinese Academy of Sciences; University of Chinese Academy of Sciences |
| Luo, Xuelai | Aviation Industry Development Research Center of China |
Keywords: Representation Learning, Multimedia Computation, Deep Learning
Abstract: Video Moment Retrieval (VMR) aims to localize a temporal segment in an untrimmed video according to a natural language query. Recent DETR-based methods achieve strong end-to-end performance, but often use a shared temporal representation for both contextual semantic reasoning and boundary localization. This coupling may weaken boundary-sensitive cues, since contextual reasoning favors temporally smooth semantic aggregation, whereas precise localization requires sensitivity to short-term temporal variations. To address this issue, we propose Context-Boundary Temporal Decoupling (COTE), a DETR-style framework that explicitly separates these two objectives into complementary branches. COTE introduces a Global-Local Context Module (GLCM) for stable long-range and local semantic reasoning, and a Fine-grained Temporal Reasoning Module (FTRM) for modeling short-range temporal transitions. The two representations are fused and fed into a DETR-based prediction head for end-to-end moment localization. Experiments on QVHighlights and Charades-STA show that COTE achieves competitive performance over strong DETR-based baselines, demonstrating the effectiveness of decoupled temporal modeling for video moment retrieval.
|
| |
| 16:45-17:00, Paper TuB16.108 | |
| SRRP: A Spatial Regional Collision Risk Prediction Model Based on STGNN |
|
| Tang, Hainan | Dalian University of Technology |
| Wang, Zhelong | Dalian University of Technology |
| Chu, Qinghao | Dalian University of Technology |
| Hou, Pengrong | Dalian University of Technology |
| Hua, Mingyang | Dalian University of Technology |
Keywords: Situation Assessment, Application of Artificial Intelligence, Environmental Sensing
Abstract: Regional collision risk prediction is crucial for safeguarding the sustainability and security of outer space. Current prediction methods primarily rely on “point-based” conjunction assessment, which evaluates collision risk through pairwise close-approach analysis. Although effective for individual encounters, such methods are inherently limited in capturing multi-object interactions, risk propagation, and the dynamic evolution of the orbital environment. To address these limitations, this paper proposes SRRP, a Regional Collision Risk Prediction model based on Spatio-Temporal Graph Neural Networks (STGNNs). By constructing a spatio-temporal risk field and embedding orbital dynamics constraints into graph learning, SRRP advances collision risk prediction from the “point-based” paradigm toward the “field-based” framework. By simultaneously capturing interactions at the target level and the spatial propagation of risk, SRRP enables a comprehensive characterization of collision risks across large-scale spatial areas. Experimental results demonstrate that SRRP achieves lower RMSE and MAE in regional risk prediction, and exhibits superior performance in high-threat event classification, highrisk object identification, and physical consistency evaluation compared with conventional point-based methods and representative data-driven baselines. These results highlight the potential of SRRP for enhancing space situational awareness and supporting proactive space traffic management.
|
| |
| 16:45-17:00, Paper TuB16.109 | |
| A Compressed-Domain Deep Network for Discharge Event Detection and Localization in Φ-OTDR DAS |
|
| Wang, Jing | Qilu University of Technology |
| Zhang, Faxiang | Qilu University of Technology |
| Jiang, Shaodong | Qilu University of Technology |
| Sun, Zhihui | Qilu University of Technology |
| Yang, Yong | Qi Lu University of Technology (Shandong Academy of Sciences) |
Keywords: Fault Monitoring and Diagnosis, Deep Learning, Smart Sensor Networks
Abstract: ,基于相位敏感的分布式声学传感(DAS) 光学时域反射测量(Φ-OTDR)使得 沿单一光学连续振动监测 但其高空间采样密度和时间特性 分辨率还会产生大量时空数据, 这对存储、传输和 实时推理。为了解决这个问题,本文 提出DGL-CDNet,一个压缩域网络 自动放电事件检测与沿线光纤 定位在Φ-OTDR DAS中。而不是重建 最初的高维数据块,提出的 方法直接从固定数据进行联合推断 低维测量。为了保持瞬态相关 压缩前的信息,补充 构建预压缩表示,然后 通过压缩域自适应处理,检测引导 门控,以及粗细定位。这样, 框架在保持事件识别的同时提升事件辨别能力 在资源受限条件下的高效推断。 基于测量驱动的合成数据集上的实验 基于记录的DAS背景窗和测量þ
|
| |
| 16:45-17:00, Paper TuB16.110 | |
| Geo-Net: Geometric-Aware Restoration Network for Strip-Like Objects in Hazy Scenes |
|
| Fang, Guoyu | North University of China |
| Jin, Zanxia | North University of China |
| Qin, Pinle | North University of China |
| Zeng, Jianchao | North University of China |
Keywords: Image Processing and Pattern Recognition, Deep Learning, Artificial Social Intelligence
Abstract: Single image dehazing remains a highly challenging problem due to severe information degradation. Although existing dehazing methods have achieved significant progress in overall visual quality, they frequently overlook the strip-like geometric structures (e.g., trees, urban building complexes, and traffic markings) that are prevalent in outdoor scenes. The absence of such directional structure priors often leads to texture blurring, loss of detail, and local color distortion when existing models process these features. To address these issues, this paper proposes a novel dehazing network, Geo-Net, designed to precisely capture and restore the geometric features and global color consistency of striped targets in images. Specifically, we design a Striped Feature Attention Module (SFAM) that utilizes multi-scale depth-wise strip convolutions to construct anisotropic receptive fields, thereby effectively strengthening the network's ability to capture directional features while reducing computational overhead. Furthermore, to better distinguish structural details from background noise, we propose the Cross-Attention Selection Module (CASM). This module introduces pre-trained high-level semantic priors as guidance signals to dynamically filter spatial features through a cross-attention mechanism, ensuring that the model focuses on reconstructing striped target details with explicit physical significance. Finally, we integrate SFAM and CASM into the proposed Striped Feature Restoration Block (SFRB) and incorporate a physical model as an output constraint to ensure the model adheres to the degradation mechanism of haze generation. Extensive experiments demonstrate that our proposed method outperforms current state-of-the-art (SOTA) algorithms in restoring slender object structures and maintaining color fidelity, achieving high-fidelity dehazing results.
|
| |
| 16:45-17:00, Paper TuB16.111 | |
| Fixed-Time Synchronized Cooperative Interception of Unauthorized UAVs with Adaptive Obstacle Avoidance |
|
| Zaixin, Han | Taiyuan University of Technology |
| Jiangyu, Liu | Taiyuan University of Technology |
| Xue, Yuntao | Taiyuan University of Technology |
Keywords: Cooperative Systems and Control, Control of Uncertain Systems, Swarm Intelligence
Abstract: Coordinated interception of unauthorized aerial robots in dynamic unknown environments poses significant challenges due to the inherent conflict between time synchronization and collision-free navigation. Existing coupled designs intertwine these two objectives within a single control loop, leading to mutual interference, degraded convergence speed, and increased interception risk. This paper proposes a spatiotemporally decoupled hierarchical control framework that explicitly separates fixed-time synchronization from adaptive obstacle avoidance. At the upper layer, a distributed fixed-time synchronization protocol guarantees global temporal consensus among multiple interceptors within a prescribed bound, independent of initial conditions. At the lower layer, an adaptive artificial potential field (APF) mechanism ensures cooperative maneuvering and collision-free navigation in environments with both static and dynamic obstacles. A composite Lyapunov function is constructed to rigorously establish fixed-time stability of the overall system under safe distance constraints. Simulation results demonstrate that the proposed method achieves synchronization errors below 0.2 s, improves interception success rate by approximately 15%, and reduces convergence time by about 20% compared with conventional coupled approaches, while maintaining a minimum safe distance of 1.8 m throughout all missions.
|
| |
| 16:45-17:00, Paper TuB16.112 | |
| MSIF-Net: Multiscale Spectral Interaction Fusion Network for Fake News Detection |
|
| Zhuang, Yuan | Shandong Normal University |
| Xu, Fuyong | Shandong Normal University |
| Ji, Zhu | Shandong Normal University |
| Wang, Ru | Shandong Normal University |
| Liu, Peiyu | Shandong Normal University |
Keywords: Multimedia Computation, Deep Learning
Abstract: The rapid proliferation of multimodal fake news on social media necessitates advanced detection frameworks capable of identifying subtle deceptive artifacts. Existing approaches predominantly operate within the spatial domain, where information redundancy and high-level noise often obscure the underlying cues required for accurate verification. To overcome these challenges, we propose the Multiscale Spectral Interaction Fusion Network (MSIF-Net), a novel framework that shifts the feature interaction process into the frequency domain to better disentangle noise and aggregate useful information from high-level semantics. Within this architecture, we introduce a Cross-Modal Modulator to address the issue of spectral noise by dynamically leveraging the semantics of one modality to guide and refine feature selection in the complementary modality. To bridge the disconnect between local sequential dependencies and global spectral patterns, we develop a Time-Frequency Mixer that employs a dual-branch mechanism to aggregate information across both domains. Ultimately, to synthesize useful information across diverse semantic scales, we design a Frequency-Division Fusion Module that decomposes features into distinct frequency sub-bands. By facilitating band-wise cross-modal attention, this module aggregates critical components ranging from global structures to fine-grained details, ensuring a robust representation that captures the intricate and multi-scale fingerprints of fake news.
|
| |
| 16:45-17:00, Paper TuB16.113 | |
| Knowledge-Informed Robust Reinforcement Learning Framework for Autonomous Driving Control |
|
| Zhou, Yang | Shandong University of Science and Technology |
| Qi, Liang | Shandong University of Science and Technology |
Keywords: Reinforcement Learning, Autonomous Vehicle
Abstract: Reinforcement learning (RL) has demonstrated its effectiveness in various challenging environments. However, most existing RL-based studies prioritize learning efficiency, often neglecting the simultaneous optimization of both efficiency and robustness. This work proposes a knowledge-informed robust RL framework (KIRRL). First, a neural-network-based controller is trained using imitation learning to provide a high-quality baseline control policy. Then, a novel adversarial training mechanism is proposed, where a generative adversarial network dynamically generates state perturbations adjusted by an adaptive strategy to simulate real-world environmental uncertainties, thereby enhancing policy robustness. KIRRL is tested in mixed traffic flow scenarios using the microscopic traffic simulation software, SUMO. Experimental results show that the proposed algorithm outperforms its peers in terms of both learning efficiency and policy robustness, which highlights the advantage of deploying the framework in complex traffic environments.
|
| |
| 16:45-17:00, Paper TuB16.114 | |
| Edge-Cloud Collaborative Reconstruction Via Structure-Aware Latent Diffusion for Downstream Remote Sensing Perception |
|
| Li, Yun | China University of Geosciences |
| Li, Xianju | China University of Geosciences Wuhan, China |
Keywords: Image Processing and Pattern Recognition, Deep Learning
Abstract: The exponential surge in high-resolution remote sensing data faces a severe bottleneck in satellite-to-ground transmission. Limited downlink bandwidth forces the use of extreme high-ratio compression, which irreversibly destroys high-frequency structural details essential for downstream machine perception tasks like object detection. While current super-resolution techniques attempt to recover these details, regression-based methods often yield over-smoothed textures, and generative diffusion models frequently introduce structural hallucinations that mislead detection systems. To address this trade-off, we propose the Structure-Aware Latent Diffusion (SALD) framework, an asymmetric edge-cloud collaborative SR system. At the resource-constrained edge, the system decouples imagery into a highly compressed low-frequency payload and a lightweight soft structural prior. Transmitting this decoupled representation minimizes bandwidth consumption. On the powerful cloud side, we introduce a Structure-Gated Large Kernel (SGLK) module and a Semantic-Guidance Engine (SGE) within the diffusion backbone. These modules leverage the transmitted structural priors to gate large-kernel convolutions, effectively capturing long-range dependencies inherent in aerial scenes while actively suppressing generative hallucinations. Extensive experiments on both the MSCM and UCMerced datasets demonstrate that, even under extreme bandwidth constraints, SALD achieves superior perceptual quality (LPIPS) and significantly enhances downstream performance in both scene classification and small-target detection.
|
| |
| 16:45-17:00, Paper TuB16.115 | |
| Causal Discovery in Non-Stationary Time Series Via Static and Dynamic Decomposition |
|
| Xiao, Ting | Beijing University of Posts and Telecommunications |
| Wang, Ye | Beijing University of Posts and Telecommunications |
| Shi, Qianfeng | Beijing University of Posts and Telecommunications |
| Chen, Chunyu | Beijing University of Posts and Telecommunications |
| Zhu, Xinning | Beijing University of Posts and Telecommunications |
| Hu, Zheng | Beijing University of Posts and Telecommunications |
Keywords: Neural Networks and their Applications, Deep Learning, AI and Applications
Abstract: Learning causal structures from multivariate time series is an important problem with a wide range of applications. However, most existing methods rely on the stationarity assumption, i.e., causal relationships are assumed to remain invariant over time, making them inadequate for capturing evolving dependencies in non-stationary environments. On the other hand, fully dynamic modeling approaches, due to the lack of constraints on structural stability and temporal variation, tend to produce less reliable causal structures over time. These issues pose significant challenges to the accuracy of causal discovery. To address these challenges, we propose a novel causal discovery framework, termed Static--Dynamic Causal Decomposition(SDCD). The proposed method decomposes causal relationships from a structural perspective into two complementary components: a static graph that captures long-term stable dependencies and a dynamic graph that characterizes time-varying causal mechanisms. To effectively learn such structures, we further design a causal-aware dual-graph prediction model, which jointly leverages the learned causal graph and an auxiliary adaptive graph through a message passing mechanism, thereby enhancing modeling capability under non-stationary settings. Experimental results on both synthetic and real-world datasets demonstrate that SDCD achieves competitive performance, with improved robustness in recovering causal structures under non-stationary conditions.
|
| |
| 16:45-17:00, Paper TuB16.116 | |
| Scene-Aware Gesture-Conditioned Policy Learning for Robot Action Generation |
|
| Ye, Tingyu | South China University of Technology |
| Zhang, Ping | South China University of Technology |
| Wei, Zichen | South China University of Technology |
| Wang, Jiahua | South China University of Technology |
| Li, Fang | South China University of Technology |
Keywords: Generative AI, Neural Networks and their Applications, Human-Machine Interaction
Abstract: In human–robot interaction (HRI), gestures serve as intuitive cues, but conventional systems rely on fixed gesture–action mappings and often ignore contextual ambiguity, where the same gesture may imply different goals depending on the scene. To address this, we propose a scene-aware gesture-conditioned diffusion framework that integrates gesture perception with environmental semantics for robust and context-aware robot control. Specifically, the framework derives object-level scene semantics from RGB inputs and aligns them with gesture features through an uncertainty-aware fusion module, and then the aligned representation conditions a gesture-conditioned diffusion policy to generate goal-directed 6-DoF trajectories. Real-world experiments show that our approach achieves outstanding performance across multiple gesture-based interaction tasks.
|
| |
| 16:45-17:00, Paper TuB16.117 | |
| An Adaptive Differentially Private Federated Learning Framework |
|
| Wang, Jin | School of Software, Xinjiang University |
| Ma, Hui | Xinjiang University |
| Zhang, Yajun | Xinjiang University |
| Pei, Xinjun | Xinjiang University |
| Yan, Ming | Xinjiang University |
| Xing, Fei | Xinjiang University |
| Chen, Yikun | JilinUniversity |
Keywords: Machine Learning, Deep Learning, Distributed Intelligent Systems
Abstract: Federated learning enables collaborative model training across distributed clients while preserving data privacy. However, in practical deployments, device heterogeneity and non-independent and identically distributed (Non-IID) data often lead to unstable and biased gradient. When differen- tial privacy is enforced, conventional fixed gradient clipping and Gaussian noise injection may further amplify gradient perturbations, resulting in training oscillation and degraded model performance. To address these challenges, we propose an adaptive differentially private federated learning framework that explicitly targets model efficiency under heterogeneous and privacy-constrained settings. On the client side, a lightweight local dimensionality reduction module is introduced to learn reduced-dimensional intermediate representations and produce more structured gradients during backpropagation, thereby mitigating noise amplification during local optimization. On the server side, an adaptive gradient clipping strategy dynamically adjusts clipping thresholds based on historical update statistics to avoid over-clipping and noise domination. Furthermore, a constraint-aware robust aggregation mechanism is designed to suppress unreliable or noise-dominated client updates and stabilize global optimization. Extensive experiments on CIFAR- 10, SVHN, and STL-10 demonstrate that the proposed method consistently improves convergence stability and classification performance under differential privacy.
|
| |
| 16:45-17:00, Paper TuB16.118 | |
| Evidence-Aware Knowledge Integration for Fact-Checking |
|
| Zuo, Yayao | Guangdong University of Technology |
| Luo, Shengwei | Guangdong University of Technology |
| Yuan, Jinhao | School of Computer Science and Technology Guangdong University of Technology |
Keywords: AI and Applications, Knowledge Acquisition, Generative AI
Abstract: With the exponential growth of online information, rapid misinformation identification has become increasingly important. Fact-checking assesses whether claims are supported by evidence and is essential for fake news detection and medical claim verification. Although large language models integrated with knowledge graphs have shown great promise for fact-checking, existing approaches often depend on large-scale reasoning models, resulting in substantial computational overhead. Moreover, deep graph interactions and efficient text-knowledge fusion remain underexplored. To address these issues, this paper proposes Evidence-aware Knowledge Integration for Fact-checking (EKIF), which leverages a dual-stage cross-attention mechanism to enhance soft prompts, enabling evidence awareness across graphs and deeper graph-text fusion. Experiments show that EKIF enables Qwen3-8B-GPTQ-Int4 to outperform Grok 4.1 Fast and other advanced models on multiple fact-checking datasets, demonstrating its effectiveness under lightweight constraints.
|
| |
| 16:45-17:00, Paper TuB16.119 | |
| An Adaptive Ant Colony Optimization with Reinforcement Learning for Airport Surface Taxiing Scheduling |
|
| Li, Jing | Civil Aviation University of China |
| Feng, Wentao | Civil Aviation University of China |
| Ding, Jianli | Civil Aviation University of China |
Keywords: Swarm Intelligence, Reinforcement Learning, Intelligent Transportation Systems
Abstract: Efficient airport surface taxiing scheduling is critical to ensuring operational safety and achieving green aviation objectives. Conventional heuristic algorithms, constrained by static parameter configurations, are prone to premature convergence and systemic deadlocks under high-traffic-density conditions. To address these limitations, this paper proposes a Reinforcement-Learning-enhanced Ant Colony Optimization algorithm (RLACO) built upon a two-layer RL-regulation + ACO-pathfinding architecture. The upper layer embeds a Q-Learning agent that dynamically adjusts the pheromone heuristic factor alpha and the desirability heuristic factor beta based on population diversity and evolutionary stagnation signals; the lower layer introduces a dynamic congestion potential field that maps node queuing states to repulsive forces, enabling proactive collision avoidance at the microscopic routing level. Simulation experiments on real operational data from Beijing Capital International Airport (PEK) and Shanghai Hongqiao International Airport (SHA) validate the effectiveness of the proposed approach. In the 100-flight high-saturation scenario at PEK, RLACO reduces total fuel consumption by 60.4% and compresses total waiting time from 2,891 s to 49 s compared with the Genetic Algorithm (GA) baseline, effectively eliminating systemic deadlocks. In the 80-flight generalization experiment at SHA, the average taxiing time stabilizes at 6.71 min, representing a 13.6% improvement over the best-competing improved Q-Learning (I-QL) algorithm, thereby confirming the robustness and cross-scenario adaptability of the proposed method.
|
| |
| 16:45-17:00, Paper TuB16.120 | |
| Weaponizing Vision-Language Models: Zero-Shot Transfer-Based Attacks on Black-Box Face Recognition |
|
| Xu, Jiachen | East China Normal University |
| Zeng, Peng | East China Normal University |
Keywords: Deep Learning, Generative AI, Biometrics and Applications
Abstract: Face Recognition (FR) models are widely deployed, but still show vulnerability to adversarial examples. Existing transfer-based attacks rely on surrogate FR models trained on massive human face datasets. Recently, the zero-shot generalization of Vision-Language Models (VLMs) introduces a new paradigm: using off-the-shelf VLMs as zero-shot surrogates to conduct adversarial attacks on FR models without face data training. However, transferring adversarial examples directly from VLMs into FR models encounters obstruction from the gap in semantic granularity. VLMs extract coarse-grained global representations, whereas FR models inherently depend on fine-grained identity textures. To bridge this gap, we propose a transfer-based targeted attack framework that performs the optimization of perturbations at the global as well as local levels. In the global aspect, we determine the overall attack direction by aligning coarse-grained semantic features. In the local aspect, we introduce Mask-guided Intermediate Feature Alignment (MIFA) to simulate fine-grained facial details. Extensive experiments prove that this dual-level optimization increases adversarial transferability against black-box FR models, and reveals the new security threat brought by foundation models to FR systems. The code is available at https://github.com/LuoChen-LC/MIFA
|
| |
| 16:45-17:00, Paper TuB16.121 | |
| A Study on Task Allocation Methods for Heterogeneous UAV Swarms in Dynamic Fire Scenarios |
|
| Wu, Baoxin | Shenyang Aerospace University |
| Wang, Xianchang | Shenyang Aerospace University |
| Bai, Yu | Shenyang Aerospace University |
Keywords: Reinforcement Learning, Game Theory and Multi-Agent Systems, Cooperative Systems and Control
Abstract: Task allocation for heterogeneous UAV swarms in dynamic fire scenarios is challenged by environmental non-stationarity, sparse rewards, and limited local observations. To address these issues, this paper proposes H-MADDPG, a two-stage multi-agent task allocation framework. A coupled heterogeneous-UAV and dynamic-fire model is first established, and the allocation problem is formulated as a cooperative Dec-POMDP to capture fire spread and asynchronous multi-UAV suppression. To reduce inefficient random exploration in early training, a priority auction initialization strategy is developed to generate high-quality prior samples under capability and dynamic feasibility constraints, improving cold-start exploration and convergence. A Hybrid Action-Probability Experience Replay (HA-PER) mechanism is then introduced to reconstruct the replay distribution by jointly considering sample superiority and temporal-difference errors, thereby improving the utilization of critical experiences under sparse rewards. In addition, an embedded partner modeling network is incorporated to infer neighboring agents' high-level task intentions from local observations, enhancing coordination stability and policy convergence under partial observability. Experiments show that H-MADDPG achieves better convergence speed, task success rate, and completion time than comparative reinforcement learning baselines.
|
| |
| 16:45-17:00, Paper TuB16.122 | |
| CPO-IX-HOPE: A Two-Stage Interpretable Hierarchical Framework for Predicting College Students'Mental Health from Passive Sensing Data |
|
| Dong, Xiaohui | Northwest Normal University |
| Gou, Yijie | Northwest Normal University |
| Lu, Yuanming | Northwest Normal University |
| haoming Su, haoming Su | Northwest Normal University |
Keywords: Affective Computing, Machine Learning, Environmental Sensing
Abstract: Developing highly accurate and interpretable machine learning models is crucial for establishing early warning systems for psychological crises on campus. However, existing studies are limited by insufficient interpretability, inadequate consideration of individual heterogeneity, and performance bottlenecks caused by class imbalance. To address these issues, we propose a two-stage prediction framework, termed CPO-IX-HOPE. In the first stage, passive sensing features are dynamically mapped into five semantically meaningful interaction-label scores. An RF-SHAP attribution mechanism is introduced to effectively capture inter-individual differences in students’ sensitivity to changes in behavioral patterns. In the second stage, an XGBoost classifier is constructed based on the Crested Porcupine Optimizer (CPO), leveraging the global exploration capability of CPO to improve predictive accuracy on small-sample data. Experimental results on the College Experience Study (CES) dataset demonstrate that the proposed framework achieves simultaneous improvements in prediction accuracy and interpretability, significantly outperforming baseline methods. The overall prediction accuracy reaches 94.5%. For the most challenging Severe risk category, the model achieves a recall of 97.96%, substantially reducing the false-negative rate among high-risk individuals.
|
| |
| 16:45-17:00, Paper TuB16.123 | |
| TopoMix: Continuous Spatial Mixing for Long-Tailed Data Augmentation |
|
| Wang, Yefan | University of Shanghai for Science and Technology |
| Wu, Yusen | Fujian University of Technology |
| Ling, Zihui | Shanghai Dianji University |
| Ni, Jianyuan | Juniata College |
Keywords: Image Processing and Pattern Recognition, Deep Learning, Machine Vision
Abstract: Most mixing-based augmentation methods improve generalization through a simple idea: combine two training samples with a fixed global ratio or a hard spatial replacement. While effective, this design leaves little room for local variation, which becomes a more visible limitation in long-tailed recognition, where minority classes are especially sensitive to the quality of augmented samples. We propose TopoMix, a training-free augmentation method that replaces fixed mixing with continuous spatial mixing. TopoMix constructs a smooth spatially varying mask from a low-resolution random control grid, bicubic interpolation, and stochastic non-linear shaping, and uses this mask for element-wise image mixing and label reweighting. Without introducing trainable parameters or auxiliary networks, TopoMix offers a simple way to make mixing more flexible in the input space. Experiments on standard long-tailed benchmarks show that it consistently improves over representative mixing-based baselines, indicating that smooth spatial mixing is an effective augmentation strategy for long-tailed recognition.
|
| |
| 16:45-17:00, Paper TuB16.124 | |
| IGPose: An Illumination-Guided Approach for Human Pose Estimation under Extremely Low-Light Conditions |
|
| Dang, Jiachen | SouthWest Petroleum University |
| Yang, PengJin | Southwest Petroleum University |
| Xun, Han | Sichuan Police College |
| Peng, Bo | Southwest Petroleum University |
Keywords: Image Processing and Pattern Recognition, Machine Vision, Deep Learning
Abstract: Under extremely low-light conditions, severe texture loss and high noise significantly degrade human pose estimation. While existing approaches often train on paired bright-dark images, they usually treat them independently, failing to fully exploit their complementary relationship. Recognizing that well-lit images contain crucial details missing in dark scenes, we propose IGPose, an Illumination-Guided Pose Estimation Network. IGPose utilizes a dual-branch architecture: a light-aware module, driven by normal-light references, provides direct feature-level guidance to the low-light extraction branch. This design enables effective knowledge transfer without explicit image enhancement, allowing the model to generalize robustly to real-world unpaired extreme-dark scenes using limited paired data. Experiments show that IGPose outperforms existing methods on extremely low-light benchmarks, improving keypoint detection accuracy by about 18 AP compared to state-of-the-art methods under the most challenging conditions.
|
| |
| 16:45-17:00, Paper TuB16.125 | |
| Safety-Critical Robotic Policy Optimization with Distribution-Aware Energy Reward Modeling |
|
| Wang, Yijun | Xi'an Jiaotong University |
| Ouyang, Lingtao | Xi’an Jiaotong University |
| Lu, Jiahui | University of Electronic Science and Technology of China |
Keywords: Reinforcement Learning, AI and Applications, Neural Networks and their Applications
Abstract: In human-robot collaboration and autonomous operation scenarios, robotic policies must maximize task performance while satisfying strict safety constraints. In safe reinforcement learning (SafeRL), optimization quickly moves policies into out-of-distribution (OOD) regions, where reward estimators can become over-optimistic and induce unsafe behaviors. This paper proposes textbf{Safe-DARM} (Safe RL with Distribution-Aware Reward Modeling) for textbf{scalar-reward} settings with textbf{environment guidance}. Built on CMDPs with a PPO+EBRM main branch, the method extracts a bounded guidance signal g_t from environment-side information (e.g., progress and safety-margin trends), and learns an energy head E_{theta}(s,r,g) to model compatibility among state, scalar reward, and guidance. The energy head is trained online by in-batch InfoNCE, and reward shaping uses both energy pessimism and guidance while textbf{keeping environment cost and Lagrangian dual updates unchanged}. We provide boundedness analysis for the shaping term and evaluate on Safety Gymnasium navigation and MuJoCo velocity-constrained locomotion tasks. Results show improved return-cost balance in most environments, while task-dependent return-cost trade-offs remain across safety shells.
|
| |
| 16:45-17:00, Paper TuB16.126 | |
| Spiking Router: A Brain-Inspired Spike-Based MoE Router for Interpretable Expert Selection |
|
| Li, Wenyi | University of Electronic Science and Technology of China |
| Guo, Jinyu | University of Electronic Science and Technology of China |
| Liu, Wenxian | University of Electronic Science and Technology of China |
| Zhong, Haowen | University of Electronic Science and Technology of China |
| Xin, Chen | University of Electronic Science and Technology of China |
| Mu, Kefan | University of Electronic Science and Technology of China |
| Wang, Zhaokun | University of Electronic Science and Technology of China |
| Tian, Wenhong | University of Electronic Science and Technology of China |
Keywords: Neural Networks and their Applications, Cognitive Computing, Computational Intelligence
Abstract: Human cognition is often modeled as relying on distributed and competitive mechanisms, in which specialized processing units are selectively recruited based on local evidence rather than centralized control. In contrast, routing in Mixture-of-Experts (MoE) models is typically implemented through centralized, continuous-valued gates with fixed top-k selection, resulting in passive expert assignment and limited interpretability. To bridge this gap between cognitive principles and artificial neural network routing, we propose a spike-based, expert-driven MoE routing framework. Each expert is equipped with an independent spiking routing module that transforms expert-specific representations into binary spike responses, enabling it to actively decide whether to process a given input. A biologically-inspired lateral inhibition mechanism further induces competition among experts and dynamically regulates sparsity, replacing fixed top-k routing. Routing decisions therefore emerge from expert-specific spike responses and inter-expert competition, rather than from a centralized gating network. Experiments on Enwik8 and WikiText-103 demonstrate consistent improvements in bits-per-character and perplexity, while yielding more interpretable, brain-inspired routing behavior.
|
| |
| 16:45-17:00, Paper TuB16.127 | |
| T-CNt: Micro-Action Recognition Via Collaborative Representation of Temporal Dynamics and Spatial Fine-Grained Features |
|
| Cheng, Nuo | Wuhan University of Science and Technology |
| Li, Huan | Wuhan University of Science and Technology |
| Deng, Chunhua | Wuhan University of Science and Technology |
| Luo, Junyi | Sun Yat-Sen University |
| Xu, Xing | Naval University of Engineering |
Keywords: Machine Vision, Image Processing and Pattern Recognition, Deep Learning
Abstract: Aiming at the challenges in video micro-action recognition, including weak motion amplitude, subtle temporal variations, limited modeling capability of single feature, and the deficiency of traditional video-level feature modeling methods in fully capturing key discriminative information, a Temporal Dynamics and Spatial Fine-grained Collaborative Representation Network (T-CNt) is proposed to enhance the model’s ability to characterize and distinguish subtle inter-class differences and critical discriminative clues of micro-actions. The network constructs a Micro-action Temporal Dynamics Module (MTDM) and a Fine-grained Spatial Module (FGSM) to model the short-term weak dynamic changes of micro-actions and local fine-grained differences in key frames respectively, and realizes collaborative representation and fusion of the two features via the Feature-wise Linear Modulation (FiLM) mechanism. Experimental results demonstrate that the proposed method achieves a Top-1 accuracy of 95.24% on the self-built MicroAct-V2 dataset, with a 1.56% improvement over the baseline method, and reaches 68.45% Top-1 accuracy on the public IndustReal dataset. Its comprehensive performance outperforms existing mainstream methods, which effectively boosts micro-action recognition performance and presents favorable cross-scene adaptability.
|
| |
| 16:45-17:00, Paper TuB16.128 | |
| An Agile Time Series Data Annotation System with Credible Cold-Start Recommendation |
|
| Du, Yimin | National University of Defense Technology |
| Wang, Chengyu | Hunan University |
| Zhou, Tongqing | National University of Defense Technology |
| Yuan, Yuan | National University of Defense Technology |
| Zheng, Tengfei | National University of Defense Technology |
| Wei, Ziling | National University of Defense Technology |
Keywords: Human-Machine Cooperation and Systems, Big Data Computing, Machine Learning
Abstract: The ubiquitous adoption of sensor-based monitoring devices has led to explosive growth in time series data. The analysis of time series, for understanding the monitored entities, relies heavily on labeled datasets. However, as featured with weak semantics, time series is prohibitive for manual annotation, while existing efforts on semi-automated annotation tools all require labeled samples to train pre-training models, failing to relieve the tricky part of annotation from scratch. In view of the efficiency gap in practice, this work invents the first open-source time series annotation system (i.e., FastTSA) that supports cold-start label recommendation for agile annotation with no external references. For cold-start recommendations, we adapt unsupervised state detection as the basis and design a smooth merging strategy to mitigate the isolated errors of fragmented segments in raw detection. To avoid the overwhelming burden for humans to assess the recommendation, FastTSA further introduces the component of credibility-guided review, which leverages entropy estimation of multiple subsequence embeddings to lead human attention to uncertain and error-prone regions. We integrate these building blocks in FastTSA and implement it in an interactive way. Extensive experiments on 5 datasets demonstrate the superiority of FastTSA's unsupervised detection performance compared with 3 baselines, whereas a real-world qualitative study shows that it attains significant efficiency improvement (x3) over 2 typical TSA tools.
|
| |
| 16:45-17:00, Paper TuB16.129 | |
| DDC-HFL: Dual-Level Confidence Distillation for Heterogeneous Federated Learning in Agricultural Disease Recognition |
|
| Yang, Shuwei | Xinjiang University |
| Xu, Ruifeng | Xinjiang University |
| He, Liang | Tsinghua University |
Keywords: Machine Learning, Distributed Intelligent Systems, Image Processing and Pattern Recognition
Abstract: Federated plant disease recognition is receiving increasing attention, but existing agricultural federated learning (FL) pipelines are still largely built around homogeneous client models, which limits deployment across farms and devices with different architectures. Heterogeneous federated distillation is a more realistic alternative, yet two challenges remain. First, under non-independent and identically distributed (non-IID) agricultural conditions, heterogeneous clients may produce unreliable soft labels, and directly distilling them can propagate low-quality knowledge across the federation. Second, existing confidence- or uncertainty-aware distillation methods usually use reliability only as an auxiliary filter, rather than explicitly modeling whether a teacher is reliable at the client level and at the sample level. To address these issues, we propose DDC-HFL, a dual-level confidence distillation framework that models knowledge reliability from two complementary perspectives. Client-level confidence determines how strongly a teacher client should contribute to collaborative distillation, while sample-level confidence determines whether that teacher should be trusted on a specific public sample. We evaluate DDC-HFL on an agriculture-oriented, PlantVillage-derived field-style benchmark designed to better reflect realistic acquisition conditions. Experiments under independent and identically distributed (IID) and multiple non-IID settings show that DDC-HFL maintains the strongest overall performance among the compared methods. These results support the central claim of the paper: explicit dual-level confidence control is an effective and practical mechanism for heterogeneous federated learning in agricultural disease recognition.
|
| |
| 16:45-17:00, Paper TuB16.130 | |
| Adversarial Attacks Detection in Medical Imaging with Novel Deep Feature-Based Detection Techniques |
|
| Daniel Ponnan, Christy | University of Alabama Tuscaloosa |
| Dibbo, Sayanton V. | The University of Alabama |
Keywords: Medical Informatics, Systems Safety and Security, Deep Learning
Abstract: Although Deep Learning (DL) models have shown excellent performance in medical image classification, these models are highly vulnerable to various adversarial attacks. This paper examines adversarial robustness and introduces novel approaches for detecting adversarial samples in chest X-ray pneumonia classification using a ResNet34 classifier. We investigate Fast Gradient Sign Method (FGSM) and Projected Gradient Descent (PGD) adversarial attacks on chest X-ray medical images. To detect adversarial inputs, we propose a deep feature representations-based approach, where we extract features from the classifier to train three detectors: Logistic Regression, Mahalanobis distance, and One-Class SVM. In our experiment, the classifier achieves 97.84% clean accuracy, but performance drops to 73.15% under FGSM and 0.23% under PGD. In-distribution adversarial detection is strong with the proposed detectors, reaching 100% accuracy with Logistic Regression, while Mahalanobis Distance and One-Class SVM also perform strongly. However, out-of-distribution (OOD) evaluation on PathMNIST reveals clear generalization failure. These results show that deep features can separate adversarial and clean samples well within the training domain, but current detection mechanisms often learn dataset-specific signatures rather than robust adversarial characteristics. This work highlights both the promise and the limitations of feature-based adversarial detection in medical imaging.
|
| |
| 16:45-17:00, Paper TuB16.131 | |
| RTA: A Reversed Tokenization Algorithm for Stock Data Encoding to Enhance Quantitative Trading Via Reinforcement Learning Model |
|
| Chang, Shin-Hung | Fu Jen Catholic University |
| Hsu, Hao-Hsun | Fu Jen Catholic University |
| Chang, Ray-I | National Taiwan University |
Keywords: Agent-Based Modeling, Machine Learning, Deep Learning
Abstract: In recent years, various forecasting issues of time series data have been studied in various fields. Stock market trend prediction is particularly challenging due to its dynamic nature and noisy characteristics. To enhance the learning capability of trend forecasting models for understanding stock market patterns, extracting key features from historical stock market data is crucial. Inspired by tokenization techniques in natural language processing, this paper proposes a novel Reversed Tokenization Algorithm (RTA) for extracting key feature combinations from stock market data. Additionally, we trained a quantitative trading agent based on the Deep Q-Learning Network (DQN) architecture with these extracted key feature combinations. The proposed quantitative trading agent employs a series of GRU models, known for its expertise in time series forecasting, to learn and make “Buy,” “Sell,” or “Hold” trading decisions. This paper conducts experiments using historical constituent stock data of the Dow Jones Industrial Average (DJIA) for year 2019-2024 and performs quantitative trading revenue through five-year training and one-year testing. Experimental results show that our RTA effectively improves the overall profitability of the quantitative trading agent. Specifically, the annualized return on investment (ROI) reached +26% in 2021, and in 2023, it improved the ROI by +8.55% compared with the Buy and Hold strategy, sufficiently validating the effectiveness of RTA in the process of training quantitative trading agent.
|
| |
| 16:45-17:00, Paper TuB16.132 | |
| DR-TAC: A Confidence-Driven Adaptive Dual-Retrieval Architecture for Large-Scale Tool Access |
|
| Huang, Xueqin | National University of Defense Technology |
| Jiang, RunQing | The Hong Kong University of Science and Technology (Guangzhou) |
| Liu, Changhao | Xiangtan University |
| Zang, Yuechao | Mind Live Technology Co., Ltd,National University of Defense and Technology |
| Li, Qinglin | National University of Defense Technology |
| Zhu, Xianqiang | National University of Defense Technology, National Key Laboratory of Information Systems Engineering |
| Zhu, Cheng | National University of Defense Technology |
| Zhang, Sheng | National University of Defense Technology |
Keywords: Generative AI, AI and Applications, Decision Support Systems
Abstract: In large language model enabled intelligent agent-driven UAV task systems, large-scale access to UAV control and planning tools is a critical system-level bottleneck. As UAV tool inventories expand, tool selection is no longer a simple retrieve-then-dispatch problem, but a coupled optimization among candidate window size, similarity density, LLM discrimination burden, and context budget. Small windows prematurely truncate the correct UAV interface, while large windows expose the model to near-neighbor distractors, increasing context cost and misselection risks. This paper presents DR-TAC (Dual-Retrieval Tool-Access Control), a confidence-driven adaptive architecture. Breaking fixed-window limitations, DR-TAC uses a dual-retrieval backbone of lightweight server-level routing and in-server hybrid ranking, extracting confidence signals to adaptively regulate window size and selectively supplement same-family candidates—achieving an optimal balance between answer reachability and local discrimination burden. Evaluated on our custom multi-scenario benchmark (specifically built for UAV control/planning interface calls) against full exposure, static grouping, and dynamic activation baselines, DR-TAC demonstrates significant advantages. It achieves the highest overall accuracy of 0.8698 while maintaining ultra-low context cost and optimal visible candidates. Empirical analysis confirms that blindly expanding windows improves coverage but does not monotonically improve final selection accuracy. Therefore, DR-TAC innovatively models candidate exposure control as a confidence-driven, system-level decision problem for LLM agent-driven UAV tasks.
|