检索结果-内蒙古大学图书馆

DPEM: Dual-Perspective Enhanced Mamba for multivariate time series forecasting

Information Fusion 2025年 123卷

作者： Hou, Rui Liu, Qiao He, Peng Liu, Yao Huang, Yanwen Xie, Jun Xie, Yang Dai, Tingting School of Computer Science and Engineering University of Electronic Science and Technology of China Sichuan Chengdu611731 China School of Information and Software Engineering University of Electronic Science and Technology of China Sichuan Chengdu610054 China Shenzhen Institute for Advanced Study University of Electronic Science and Technology of China Guangdong Shenzhen518000 China 54th Research Institute China Electronics Technology Group Corporation Hebei Shijiazhuang050000 China

Multivariate time series forecasting (MTSF) aims to uncover hidden data patterns from historical sequences to predict future states. In practical scenarios, multivariate time series often exhibit different period patterns along the temporal perspective and complex inter-variable spatial dependencies across the variable perspective. Despite significant advancements in existing methods, explicitly capturing spatiotemporal dependence patterns with heterogeneity remains a fundamental challenge. To address these limitations, we propose a novel framework, Dual-Perspective Enhanced Mamba (DPEM), for multivariate time series forecasting. Specifically, we design the Multi-Scale Convolution Mamba (MSCM) module to capture complex periodic patterns from the Channel-Dependent (CD) perspective and the Adaptive Graph Convolution Mamba (AGCM) module to model intricate spatial dependencies among variables from the Channel-Independent (CI) perspective. These two modules explicitly extract heterogeneous temporal and spatial dependencies while mitigating potential interference during feature extraction. Furthermore, to facilitate bidirectional interactions between temporal and spatial features, we introduce a multi-head cross-attention mechanism, seamlessly integrating spatiotemporal dependencies captured from different perspectives. Finally, extensive experiments on 8 widely used benchmark datasets demonstrate that our proposed method achieves state-of-the-art (SOTA) performance and further validate that using Mamba as the backbone network significantly reduces computational costs. The implementation code is available at: https://***/HRFarsighted/DPEM. © 2025

关键词： Feature Selection

来源：评论

学校读者我要写书评

暂无评论

HMGS: Hierarchical Matching Graph Neural Network for Session-Based Recommendation

引用

computers, Materials and Continua 2025年第3期83卷 5413-5428页

作者： Pengfei Zhang Rui Xin Xing Xu Yuzhen Wang Xiaodong Li Xiao Zhang Meina Song Zhonghong Ou State Grid Hebei Information and Telecommunication Branch Shijiazhuang 050000 China School of Computer Science (National Pilot Software Engineering School) Beijing University of Posts and Telecommunications Beijing 100876 China State Key Laboratory of Networking and Switching Technology Beijing University of Posts and Telecommunications Beijing 100876 China

Session-based recommendation systems (SBR) are pivotal in suggesting items by analyzing anonymized sequences of user interactions. Traditional methods, while competent, often fall short in two critical areas: they fail to address potential inter-session item transitions, which are behavioral dependencies that extend beyond individual session boundaries, and they rely on monolithic item aggregation to construct session representations. This approach does not capture the multi-scale and heterogeneous nature of user intent, leading to a decrease in modeling accuracy. To overcome these limitations, a novel approach called HMGS has been introduced. This system incorporates dual graph architectures to enhance the recommendation process. A global transition graph captures latent cross-session item dependencies, while a heterogeneous intra-session graph encodes multi-scale item embeddings through localized feature propagation. Additionally, a multi-tier graph matching mechanism aligns user preference signals across different granularities, significantly improving interest localization accuracy. Empirical validation on benchmark datasets (Tmall and Diginetica) confirms HMGS’s efficacy against state-of-the-art baselines. Quantitative analysis reveals performance gains of 20.54% and 12.63% in Precision@10 on Tmall and Diginetica, respectively. Consistent improvements are observed across auxiliary metrics, with MRR@10, Precision@20, and MRR@20 exhibiting enhancements between 4.00% and 21.36%, underscoring the framework’s robustness in multi-faceted recommendation scenarios.

关键词： Session-based recommendation graph network multi-level matching

来源：评论

学校读者我要写书评

暂无评论

Contextual Graph Reconstruction and Emotional Variation Learning for Conversational Emotion Recognition

引用

IEEE Transactions on Affective Computing 2025年

作者： Rao, Yujing Cao, Min Ye, Mang Wuhan University National Engineering Research Center for Multimedia Software Institute of Artificial Intelligence Hubei Key Laboratory of Multimedia and Network Communication Engineering School of Computer Science Wuhan430072 China Soochow University School of Computer Science and Technology Suzhou215006 China

Conversational Emotion Recognition (CER) significantly benefits from the integration of multiple modalities. However, real-world scenarios are often plagued by hardware malfunctions and network failures that lead to missing modalities and incomplete emotional representations. Existing methods primarily focus on modeling inter-modal relationships within isolated utterances to generate missing data, so they do not adequately capture conversational context and dynamic emotional evolution. In conversations, emotional expressions are inherently context-dependent and dynamic. Insufficient modeling of these properties can substantially degrade performance. To address these challenges, we propose Contextual Graph Reconstruction and Emotional Variation Learning (CGR-EVL). Our approach flexibly constructs an utterance graph with diverse coverage based on speaker activity and modality availability, thereby capturing more contextual information. To enhance the handling of missing modalities, we further integrate temporal relations through a relational graph convolutional network to reconstruct missing features and introduce a speaker emotion-aware constraint to ensure emotional coherence. Additionally, we propose the concept of emotional entropy to quantify variation patterns and develop a novel loss function that aligns predicted and actual variations. Experiments on the IEMOCAP and MELD datasets show that CGR-EVL outperforms state-of-the-art methods, particularly under conditions of incomplete modalities. © 2010-2012 IEEE.

关键词： Graph neural networks

来源：评论

学校读者我要写书评

暂无评论

Searching for an Accurate Robot Calibration via Improved Levenberg–Marquardt and Radial Basis Function System

引用

Journal of Field Robotics 2025年第0期

作者： Li, Zhibin Deng, Xun Chen, Tinghui Yang, Yuhang Chen, Linlin Yang, Xiwen Hu, Zhenzhen Hu, Lun Hu, Pengwei Li, Shuai Luo, Xin Xinjiang Technical Institute of Physics & Chemistry Chinese Academy of Sciences Urumqi China School of Software Engineering Chengdu University of Information Technology Chengdu China Dazhou Key Laboratory of Government Data Security Sichuan University of Arts and Science Dazhou China School of Software Engineering Xinjiang University Urumqi China Faculty of Information Technology and Electrical Engineering University of Oulu Oulu Finland VTT-Technical Research Centre of Finland Oulu Finland College of Computer and Information Science Southwest University Chongqing China

Robots are frequently utilized in manufacturing, aviation, and other industries, which enhance industrial production efficiency and quality. Specifically, robots perform high-precision tasks like welding, assembly and material handling, which reduce the intensity of manual labor in factories. In the logistics field, robots automatically sort and deliver goods, thereby speeding up supply chain operations. However, the prolonged operation of robots suffers from a decline in positioning accuracy, which makes them unable to satisfy task requirements. To address this challenging issue, this study designs an efficient calibration system integrating the Levenberg–Marquardt algorithm with fuzzy proportion integration differentiation controller and radial basis function neural network. The innovations of this method include: (1) integrating the fuzzy proportion integration differentiation controller into the updating rules of Levenberg–Marquardt algorithm, which further enhances the identification performance of kinematic errors;(2) adopting the radial basis function neural network to handle the robot dynamic errors, which addresses the complexity of dynamic error sources. Extensively experimental robot positioning points are gathered on an HSR JR680 robot, and then experimental validations are conducted by using the designed calibration system. The experiments indicate that the developed algorithm outperforms these existing advanced algorithms. © 2025 Wiley Periodicals LLC.

关键词： Radial basis function networks

来源：评论

学校读者我要写书评

暂无评论

Traffic Prediction Using Lightweight Large Model in UAV-Assisted Mobile Computing for Time-Critical Consumer Electronics

引用

IEEE Transactions on Consumer Electronics 2025年

作者： Jiang, Yunzhe Liu, Yinqiu Cui, Huajun Liu, Jinghuan Mao, Yingchi He, Xiaoming University of Electronic Science and Technology of China College of Communication and Information Engineering Chengdu China Nanyang Technological University School of Computer Science and Engineering Singapore PowerChina Beijing Engineering Corporation Limited Digital Intelligence Research Institute Beijing China Hohai University College of Computer Science and Software Engineering Nanjing China Nanjing University of Posts and Telecommunications College of Internet of Things Nanjing China

Unmanned Aerial Vehicles (UAVs) have emerged as an important category of consumer electronics, offering versatile applications and enhanced operational efficiency. In the context of Mobile Edge Computing (MEC), UAVs can improve task execution and service quality by providing dynamic allocation of computational and data processing resources at the network edge. However, one critical issue in UAV-assisted MEC is task traffic prediction, which directly impacts the efficiency of task offloading strategies. Inspired by the recent success of large models, we propose a novel Lightweight Large Model with Temporal-Spatial Attention (L-LMTSA), designed to maximize task traffic prediction accuracy and minimize the overall computation latency. Specifically, L-LMTSA integrates a Temporal Attention Model (TAM) and a Spatial Attention Model (SAM) to capture multi-dimensional information, such as task flow location and temporal characteristics. In addition, we develop a pre-trained lightweight GPT-2 model by employing a one-dimensional convolutional input encoding layer and fine-tuning its parameters for predictive accuracy. Additionally, we optimize the UAV's trajectory and task offloading strategy using a three-dimensional artificial potential field informed by the predicted task traffic. Extensive experiments demonstrate that L-LMTSA not only improves training speed and prediction accuracy but also significantly reduces computational latency, resulting in more efficient UAV-assisted MEC experiences for consumers. © 2024 IEEE.

关键词： Unmanned aerial vehicles (UAV)

来源：评论

学校读者我要写书评

暂无评论

Resource Allocation Driven by Large Models in Future Semantic-Aware Networks

arXiv

引用

arXiv 2025年

作者： Zhang, Haijun Ni, Jiaxin Wu, Zijun Liu, Xiangnan Leung, V.C.M. Beijing Engineering and Technology Research Center for Convergence Networks and Ubiquitous Services University of Science and Technology Beijing Beijing10083 China School of Electrical Engineering and Computer Science KTH Royal Institute of Technology Stockholm11428 Sweden College of Computer Science and Software Engineering Shenzhen University Shenzhen51806 China VancouverBCV6T 1Z4 Canada

Large model has emerged as a key enabler for the popularity of future networked intelligent applications. However, the surge of data traffic brought by intelligent applications puts pressure on the resource utilization and energy consumption of the future networks. With efficient content understanding capabilities, semantic communication holds significant potential for reducing data transmission in intelligent applications. In this article, resource allocation driven by large models in semantic-aware networks is investigated. Specifically, a semantic-aware communication network architecture based on scene graph models and multimodal pre-trained models is designed to achieve efficient data transmission. On the basis of the proposed network architecture, an intelligent resource allocation scheme in semantic-aware network is proposed to further enhance resource utilization efficiency. In the resource allocation scheme, the semantic transmission quality is adopted as an evaluation metric and the impact of wireless channel fading on semantic transmission is analyzed. To maximize the semantic transmission quality for multiple users, a diffusion model-based decision-making scheme is designed to address the power allocation problem in semantic-aware networks. Simulation results demonstrate that the proposed large-model-driven network architecture and resource allocation scheme achieve high-quality semantic transmission. Copyright © 2025, The Authors. All rights reserved.

关键词： Semantic Web

来源：评论

学校读者我要写书评

暂无评论

Leapfrog Polymorphic Neural Ordinary Differential Equation

引用

IEEE Signal Processing Letters 2025年 32卷 2139-2143页

作者： Zhang, Xiao Wei, Wei Zhang, Zhen Zhang, Lei Northwestern Polytechnical University School of Software Xi'an710072 China Northwestern Polytechnical University Shaanxi Provincial Key Laboratory of Speech and Image Information Processing School of Computer Science Xi'an710072 China Northwestern Polytechnical University National Engineering Laboratory for Integrated Aero-Space-Ground-Ocean Big Data Application Technology School of Computer Science Xi'an710072 China The University of Adelaide school of computer science AdelaideSA5005 Australia

Neural Ordinary Differential Equations (NODEs) revolutionize the way we view residual networks as solvers for initial value problems (IVPs), with layer depth serving as the time step. In this study, we propose a more efficient extension of NODEs called Leap-Frog Polymorphic Neural ODEs (LF-NODEs). LF-NODEs introduce the leap-frog updating scheme, breaking free from the specific structure of time-evolving mixtures of multiple dynamical systems. In each time step (corresponding to each residual network layer), LF-NODEs integrate the features of multiple dynamical systems (residual network layers) by employing time-variant weights from different dynamical systems. Our LF-NODEs not only overcome the limitations in the representation power of individual residual networks but also provide a more flexible and effective structure for residual networks based on multiple dynamical systems. The efficiency of the leap-frog updating scheme is theoretically derived and demonstrated. Furthermore, we expand the model by incorporating a multi-scale approach (LF-MSNODEs) to achieve even more accurate model representations. Empirical results showcase the improvements provided by our proposed methods in 2D concentric spheres task, irregularly sampled time series prediction, and classification tasks. Additionally, the results provide empirical evidence that the learned feature space enhances system efficiency with fewer parameters and function evaluations compared to the baseline methods. © 1994-2012 IEEE.

关键词： Ordinary differential equations

来源：评论

学校读者我要写书评

暂无评论

GIRP: Energy-Efficient QoS-Oriented Microservice Resource Provisioning via Multi-Objective Multi-Task Reinforcement Learning

引用

IEEE Transactions on Mobile Computing 2025年

作者： Yuan, Honggang Wang, Ting Fu, Min Shi, Yuanming East China Normal University MoE Engineering Research Center of Software/Hardware Co-design Technology and Application Shanghai Key Laboratory of Trustworthy Computing Shanghai200062 China National University of Singapore Department of Electrical and Computer Engineering 117583 Singapore ShanghaiTech University School of Information Science and Technology Shanghai201210 China

Microservice architecture has revolutionized web service development by facilitating loosely coupled and independently developable components distributed as containers or virtual machines. While existing studies emphasize end-to-end latency, this paper investigates energy-efficient quality-of-service (QoS)-oriented microservice provisioning, focusing on both QoS satisfaction and power consumption (PC) conservation. We propose the Green and Intelligent Resource Provision (GIRP) architecture, integrating a data-driven energy-latency-aware resource allocation and scheduling manager to balance latency and PC. To reconcile the trade-offs involved, a dual-objective optimization problem is formulated to minimize latency and energy use by selecting proper servers, allocating CPU cores, and determining service replicas. To address challenges with discrete variables, dual objectives, and implicit mappings, we leverage a model-free deep deterministic policy gradient-based reinforcement learning algorithm. Specifically, we develop a multi-task agent via the Multi-gate Mixture-of-Experts model to simultaneously make two separate actions regarding CPU core numbers and service replica numbers, followed by a single-task agent to determine service scheduling. Extensive experiments on the DeathStarBenchmark testbed validate GIRP's effectiveness, demonstrating approximately 52% resource savings and a 43% reduction in PC compared to leading methods like Sinan, Firm, and heuristic-based algorithms. These results highlight GIRP's capability to optimize microservice orchestration by balancing end-to-end latency and power efficiency. © 2025 IEEE. All rights reserved.

关键词： Quality of service

来源：评论

学校读者我要写书评

暂无评论

Learnable Prompt as Pseudo-Imputation: Rethinking the Necessity of Traditional EHR Data Imputation in Downstream Clinical Prediction 25

Learnable Prompt as Pseudo-Imputation: Rethinking the Necess...

引用

Proceedings of the 31st ACM SIGKDD Conference on Knowledge Discovery and Data Mining V.1

作者： Weibin Liao Yinghao Zhu Zhongji Zhang Yuhang Wang Zixiang Wang Xu Chu Yasha Wang Liantao Ma School of Computer Science Peking University Beijing China & Key Laboratory of High Confidence Software Technologies Ministry of Education Beijing China National Engineering Research Center for Software Engineering Peking University Beijing China School of Software and Microelectronics Peking University Beijing China & Key Laboratory of High Confidence Software Technologies Ministry of Education Beijing China School of Computer Science Peking University Beijing China Center on Frontiers of Computing Studies Peking University Beijing China Key Laboratory of High Confidence Software Technologies Ministry of Education Beijing China & Peking University Information Technology Institute (Tianjin Binhai) Peking University Tianjin China National Engineering Research Center for Software Engineering Peking University Beijing China & Key Laboratory of High Confidence Software Technologies Ministry of Education Beijing China

ISBN: (纸本)9798400712456

Analyzing the health status of patients based on Electronic Health Records (EHR) is a fundamental research problem in medical informatics. The presence of extensive missing values in EHR makes it challenging for deep neural networks (DNNs) to directly model the patient's health status. Existing DNNs training protocols, including Impute-then-Regress Procedure and Jointly Optimizing of Impute-n-Regress Procedure, require the additional imputation models to reconstruction missing values. However, Impute-then-Regress Procedure introduces the risk of injecting imputed, non-real data into downstream clinical prediction tasks, resulting in power loss, biased estimation, and poorly performing models, while Jointly Optimizing of Impute-n-Regress Procedure is also difficult to generalize due to the complex optimization space and demanding data requirements. Inspired by the recent advanced literature of learnable prompt in the fields of NLP and CV, in this work, we rethought the necessity of the imputation model in downstream clinical tasks, and proposed Learnable Prompt as Pseudo-Imputation (PAI) as a new training protocol to assist EHR analysis. PAI no longer introduces any imputed data but constructs a learnable prompt to model the implicit preferences of the downstream model for missing values, resulting in a significant performance improvement for all state-of-the-arts EHR analysis models on four real-world datasets across two clinical prediction tasks. Further experimental analysis indicates that PAI exhibits higher robustness in situations of data insufficiency and high missing rates. More importantly, as a plug-and-play protocol, PAI can be easily integrated into any existing or even imperceptible future EHR analysis models. The code of this work is deployed publicly available at https://***/MrBlankness/PAI to help the research community reproduce the results and assist the EHR analysis tasks.

关键词： electronic health records

来源：评论

学校读者我要写书评

暂无评论

Joint Optimization of Dynamic Service Selection and Request Routing in Cloud-Edge Collaborative Environments

引用

IEEE Internet of Things Journal 2025年

作者： Tang, Bing Xu, Wei Zhang, Li Cao, Buqing Yang, Qing Li, Kuanching Hunan University of Science and Technology School of Computer Science and Engineering Xiangtan411201 China Guangzhou Maritime University School of Computer Science Guangzhou510725 China Huaihua University School of Computer and Artificial Intelligence Huaihua418000 China Hunan Institute of Engineering School of Information Science and Engineering Xiangtan411104 China Hunan University of Technology School of Computer Zhuzhou412007 China Hunan University of Science and Technology Sanya Research Institute Sanya572024 China Hunan Key Laboratory for Service Computing and Novel Software Technology Xiangtan411201 China

Optimizing multi-instance service composition and dynamic request routing has become a critical challenge in cloud-edge collaborative systems. Existing solutions struggle with effectively balancing performance, cost, and bandwidth constraints in dynamic and resource-constrained environments. In this work, we address these challenges by proposing the Removed Minimum Cost Flow (RMCF) algorithm, aiming to minimize average response time while considering constraints such as budget and bandwidth, making it well-suited for time-sensitive services in a cloud-edge collaborative service provision system. Simulations were conducted using real-world data from China Telecom’s base stations in Shanghai, and experiments in various scenarios were considered, including time-sensitive services and general application services, with key performance indicators such as time utility, cost-utility, request completion rate, and timeout rate. The experimental results demonstrate that RMCF achieves lower response times, superior performance, and improved cost-effectiveness compared to other baseline algorithms. © 2014 IEEE.

关键词： Edge computing

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：