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

Efficient Sharing of Energy Consumption Data: A Privacy-Preserving Threshold Aggregation Approach

IEEE Internet of Things Journal 2025年

作者： Li, Guohao Zhou, Lu Lian, Jiale Liu, Siyi Yang, Li Zhong, Yantao Li, Qiang Xidian University School of Computer Science and Technology Xi’an China Jilin University Key Laboratory of Symbolic Computation and Knowledge Engineering Ministry of Education Changchun China Co. Ltd Guangdong Shenzhen China

Energy consumption data collected by smart meters is increasingly used by various subscribers in the smart grid for load management, energy monitoring, and policy planning. To protect user privacy, edge-assisted privacy-preserving data aggregation (PPDA) techniques are commonly employed. However, existing methods face several challenges: i) limited scalability, ii) strict trust requirements, and iii) the risk of revealing unique consumption patterns to data collectors. To address these challenges, we propose a privacy-preserving threshold aggregation method that is easily scalable and facilitates efficient energy data sharing under limited trust assumptions. Specifically, we design VFPNTRU, a quantum-resistant homomorphic proxy re-encryption scheme with fault tolerance and re-encryption verification. In VFP-NTRU, smart meters can encrypt data with a public key without the need for prior negotiation of decryption keys with multiple subscribers. Additionally, we develop a privacy threshold collection protocol that uses a verifiable oblivious pseudorandom function to provide privacy guarantees similar to k-anonymity for SM data collection. We further introduce an energy consumption model to determine optimal collection strategies, improving system responsiveness. We provide correctness analysis and prove the security of our scheme. Experimental results demonstrate that our approach outperforms existing PPDA methods, making it particularly suitable for resource-constrained smart meters and central servers managing large-scale energy data. © 2014 IEEE.

关键词： Differential privacy

来源：评论

学校读者我要写书评

暂无评论

Fairness-Aware Budgeted Edge Server Placement for Connected Autonomous Vehicles

引用

IEEE Transactions on Mobile Computing 2025年第6期24卷 4762-4776页

作者： Wu, Jintao Xu, Xiaolong Cui, Guangming Zhang, Yiwen Qi, Lianyong Dou, Wanchun Cai, Zhipeng Nanjing University of Information Science & Technology Jiangsu Province Engineering Research Center of Advanced Computing and Intelligent Services School of Software Nanjing210044 China Jilin University Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Changchun130012 China Nanjing University of Information Science & Technology Jiangsu Province Engineering Research Center of Advanced Computing and Intelligent Services School of Software China Nanjing University State Key Laboratory for Novel Software Technology China Anhui University School of Computer Science and Technology Anhui230031 China College of Computer Science and Technology Qingdao266580 China Nanjing University State Key Laboratory for Novel Software Technology Nanjing210023 China Georgia State University Department of Computer Science United States

Mobile edge computing (MEC) considerably enhances the capabilities and performance of connected autonomous vehicles (CAVs) by deploying edge servers (ESs) on roadside units (RSUs) near CAVs, thereby ensuring low-latency services. Given the constrained and costly nature of ES resources (computing, storage, and bandwidth), equitable ES utilization is critical for CAV operations. However, fairness considerations are often overlooked in current budgeted edge server placement (ESP) strategies, potentially worsening resource imbalances and compromising user experience. This paper investigates the fairness-aware budgeted edge server placement (FESP) problem within RSUs, proving its NP-hardness. To address FESP, we first propose FESP-O, an integer programming-based optimal approach for small-scale problems, followed by FESP-APX, an approximation approach for large-scale scenarios that provides near-optimal solutions. We analyze the time complexity and approximation ratio of our proposed algorithms and validate their efficacy through experiments on real-world datasets. Extensive experimental results demonstrate significant performance improvements over baseline and state-of-the-art methods, indicating practical suitability and efficiency. © 2002-2012 IEEE.

关键词： Integer linear programming

来源：评论

学校读者我要写书评

暂无评论

Enhancing Unsupervised Graph Few-shot Learning via Set Functions and Optimal Transport 25

Enhancing Unsupervised Graph Few-shot Learning via Set Funct...

引用

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

作者： Yonghao Liu Fausto Giunchiglia Ximing Li Lan Huang Xiaoyue Feng Renchu Guan Key Laboratory of Symbolic Computation and Knowledge Engineering of the Ministry of Education College of Computer Science and Technology Jilin University Changchun China Department of Information Engineering and Computer Science University of Trento Trento Italy

ISBN: (纸本)9798400712456

Graph few-shot learning has garnered significant attention for its ability to rapidly adapt to downstream tasks with limited labeled data, sparking considerable interest among researchers. Recent advancements in graph few-shot learning models have exhibited superior performance across diverse applications. Despite their successes, several limitations still exist. First, existing models in the meta-training phase predominantly focus on instance-level features within tasks, neglecting crucial set-level features essential for distinguishing between different categories. Second, these models often utilize query sets directly on classifiers trained with support sets containing only a few labeled examples, overlooking potential distribution shifts between these sets and leading to suboptimal performance. Finally, previous models typically require necessitate abundant labeled data from base classes to extract transferable knowledge, which is typically infeasible in real-world scenarios. To address these issues, we propose a novel model named STAR, which leverages Set funcTions and optimAl tRansport for enhancing unsupervised graph few-shot learning. Specifically, STAR utilizes expressive set functions to obtain set-level features in an unsupervised manner and employs optimal transport principles to align the distributions of support and query sets, thereby mitigating distribution shift effects. Theoretical analysis demonstrates that STAR can capture more task-relevant information and enhance generalization capabilities. Empirically, extensive experiments across multiple datasets validate the effectiveness of STAR. Our code can be found https://***/KEAML-JLU/STAR here.

关键词： few-shot learning

来源：评论

学校读者我要写书评

暂无评论

arXiv

引用

arXiv 2025年

作者： Li, Yangning Kang, Hui Li, Jiahui Sun, Geng Sun, Zemin Wang, Jiacheng Zhao, Changyuan Niyato, Dusit College of Computer Science and Technology Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun130012 China College of Computer Science and Technology Jilin University Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun130012 China College of Computing and Data Science Nanyang Technological University 639798 Singapore College of Computing and Data Science Nanyang Technological University Singapore

An expansion of Internet of Things (IoTs) has led to significant challenges in wireless data harvesting, dissemination, and energy management due to the massive volumes of data generated by IoT devices. These challenges are exacerbated by data redundancy arising from spatial and temporal correlations. To address these issues, this paper proposes a novel data-driven collaborative beamforming (CB)-based communication framework for IoT networks. Specifically, the framework integrates CB with an overlap-based multi-hop routing protocol (OMRP) to enhance data transmission efficiency while mitigating energy consumption and addressing hot spot issues in remotely deployed IoT networks. Based on the data aggregation to a specific node by OMRP, we formulate a node selection problem for the CB stage, with the objective of optimizing uplink transmission energy consumption. Given the complexity of the problem, we introduce a softmax-based proximal policy optimization with long-short-term memory (SoftPPO-LSTM) algorithm to intelligently select CB nodes for improving transmission efficiency. Simulation results show that the proposed OMRP improves network lifetime by 17% compared to benchmark routing protocols, while the SoftPPO-LSTM method for CB node selection achieves an 8.3% increase in throughput over benchmark algorithms. The results also reveal that the combined OMRP with the SoftPPO- Copyright © 2025, The Authors. All rights reserved.

关键词： Deep reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

Boosting Weak-to-Strong Agents in Multiagent Reinforcement Learning via Balanced PPO

引用

IEEE Transactions on Neural Networks and Learning Systems 2025年第5期36卷 9136-9149页

作者： Huang, Sili Chen, Hechang Piao, Haiyin Sun, Zhixiao Chang, Yi Sun, Lichao Yang, Bo Jilin University Key Laboratory of Symbolic Computation and Knowledge Engineer of Ministry of Education School of Artificial Intelligence Changchun130012 China Jilin University School of Artificial Intelligence Changchun130012 China Northwestern Polytechnical University Unmanned System Research Institute Xi’an710068 China Lehigh University Department of Computer Science and Engineering BethlehemPA18015 United States Jilin University Key Laboratory of Symbolic Computation and Knowledge Engineer of Ministry of Education School of Computer Science and Technology Changchun130012 China

Multiagent policy gradients (MAPGs), an essential branch of reinforcement learning (RL), have made great progress in both industry and academia. However, existing models do not pay attention to the inadequate training of individual policies, thus limiting the overall performance. We verify the existence of imbalanced training in multiagent tasks and formally define it as an imbalance between policies (IBPs). To address the IBP issue, we propose a dynamic policy balance (DPB) model to balance the learning of each policy by dynamically reweighting the training samples. In addition, current methods for better performance strengthen the exploration of all policies, which leads to disregarding the training differences in the team and reducing learning efficiency. To overcome this drawback, we derive a technique named weighted entropy regularization (WER), a team-level exploration with additional incentives for individuals who exceed the team. DPB and WER are evaluated in homogeneous and heterogeneous tasks, effectively alleviating the imbalanced training problem and improving exploration efficiency. Furthermore, the experimental results show that our models can outperform the state-of-the-art MAPG methods and boast over 12.1% performance gain on average. © 2012 IEEE.

关键词： Personnel training

来源：评论

学校读者我要写书评

暂无评论

Enhancing Unsupervised Graph Few-shot Learning via Set Functions and Optimal Transport

arXiv

引用

arXiv 2025年

作者： Liu, Yonghao Giunchiglia, Fausto Li, Ximing Huang, Lan Feng, Xiaoyue Guan, Renchu College of Computer Science and Technology Jilin University Changchun China Department of Information Engineering and Computer Science University of Trento Trento Italy Key Laboratory of Symbolic Computation and Knowledge Engineering The Ministry of Education China

关键词： Zero-shot learning

来源：评论

学校读者我要写书评

暂无评论

AHMSA-Net: Adaptive Hierarchical Multi-Scale Attention Network for Micro-Expression Recognition

arXiv

引用

arXiv 2025年

作者： Zhang, Lijun Zhang, Yifan Tang, Weicheng Sun, Xinzhi Wang, Xiaomeng Li, Zhanshan College of Computer Science and Technology Jilin University Changchun Jilin130012 China Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun Jilin130012 China

Micro-expression recognition (MER) presents a significant challenge due to the transient and subtle nature of the motion changes involved. In recent years, deep learning methods based on attention mechanisms have made some breakthroughs in MER. However, these methods still suffer from the limitations of insufficient feature capture and poor dynamic adaptation when coping with the instantaneous subtle movement changes of micro-expressions. Therefore, in this paper, we design an Adaptive Hierarchical Multi-Scale Attention Network (AHMSA-Net) for MER. Specifically, we first utilize the onset and apex frames of the micro-expression sequence to extract threedimensional (3D) optical flow maps, including horizontal optical flow, vertical optical flow, and optical flow strain. Subsequently, the optical flow feature maps are inputted into AHMSA-Net, which consists of two parts: an adaptive hierarchical framework and a multi-scale attention mechanism. Based on the adaptive downsampling hierarchical attention framework, AHMSA-Net captures the subtle changes of micro-expressions from different granularities (fine and coarse) by dynamically adjusting the size of the optical flow feature map at each layer. Based on the multi-scale attention mechanism, AHMSA-Net learns micro-expression action information by fusing features from different scales (channel and spatial). These two modules work together to comprehensively improve the accuracy of MER. Additionally, rigorous experiments demonstrate that the proposed method achieves competitive results on major micro-expression databases, with AHMSA-Net achieving recognition accuracy of up to 78.21% on composite databases (SMIC, SAMM, CASMEII) and 77.08% on the CASME3 database. Copyright © 2025, The Authors. All rights reserved.

关键词： Deep learning

来源：评论

学校读者我要写书评

暂无评论

KSSANet: KAN-Driven Spatial-Spectral Attention Networks for Hyperspectral Image Super-Resolution

KSSANet: KAN-Driven Spatial-Spectral Attention Networks for ...

引用

International Conference on Acoustics, Speech, and Signal Processing (ICASSP)

作者： Baisong Li Xingwang Wang Haixiao Xu College of Computer Science and Technology Jilin University Key Laboratory of Symbolic Computation and Krowledge Engineering of Ministry of Education Jilin University

ISBN: (数字)9798350368741

ISBN: (纸本)9798350368758

Due to the limitations of physical imaging, acquiring high-resolution hyperspectral images (HR-HSIs) has always been a significant challenge. Single hyperspectral image super-resolution (SHSR) technology aims to generate corresponding HR-HSIs by processing low-resolution hyperspectral images (LR-HSIs). Compared to multi-source data fusion methods, SHSR relies solely on a single low-resolution image and does not require additional auxiliary information or multimodal data, making it more flexible and efficient in data acquisition. Recently, Kolmogorov–Arnold Networks (KAN), which derive from the Kolmogorov–Arnold representation theorem, show great potential in modeling long-range dependencies. In this paper, we further investigate the potential of KAN for hyperspectral image restoration. Specifically, we propose a spatial-spectral attention block (SSAB) module, which includes a KAN-based spatial attention module (KAN-SpaAB) and a KAN-based spectral attention module (KAN-SpeAB), designed for the restoration of spatial and spectral information, respectively. Experimental results demonstrate that KSSANet outperforms existing methods in both quantitative evaluation and image generation quality, achieving state-of-the-art (SOTA) performance. Our code is available at: https://***/Baisonm-Li/KSSANet.

关键词： Measurement Visualization Image synthesis Superresolution Imaging Image restoration Speech processing Spatial resolution Signal resolution Hyperspectral imaging

来源：评论

学校读者我要写书评

暂无评论

Dual-level Mixup for Graph Few-shot Learning with Fewer Tasks

arXiv

引用

arXiv 2025年

作者： Liu, Yonghao Li, Mengyu Giunchiglia, Fausto Huang, Lan Li, Ximing Feng, Xiaoyue Guan, Renchu College of Computer Science and Technology Jilin University Changchun China Department of Information Engineering and Computer Science University of Trento Trento Italy Key Laboratory of Symbolic Computation and Knowledge Engineering The Ministry of Education China

Graph neural networks have been demonstrated as a powerful paradigm for effectively learning graph-structured data on the web and mining content from it. Current leading graph models require a large number of labeled samples for training, which unavoidably leads to overfitting in few-shot scenarios. Recent research has sought to alleviate this issue by simultaneously leveraging graph learning and meta-learning paradigms. However, these graph meta-learning models assume the availability of numerous meta-training tasks to learn transferable meta-knowledge. Such assumption may not be feasible in the real world due to the difficulty of constructing tasks and the substantial costs involved. Therefore, we propose a SiMple yet effectIve approach for graph few-shot Learning with fEwer tasks, named SMILE. We introduce a dual-level mixup strategy, encompassing both within-task and across-task mixup, to simultaneously enrich the available nodes and tasks in meta-learning. Moreover, we explicitly leverage the prior information provided by the node degrees in the graph to encode expressive node representations. Theoretically, we demonstrate that SMILE can enhance the model generalization ability. Empirically, SMILE consistently outperforms other competitive models by a large margin across all evaluated datasets with in-domain and cross-domain settings. Our anonymous code can be found here. Copyright © 2025, The Authors. All rights reserved.

关键词： Contrastive Learning

来源：评论

学校读者我要写书评

暂无评论

SSRMamba: Efficient Visual State Space Model for Spectral Super-Resolution

SSRMamba: Efficient Visual State Space Model for Spectral Su...

引用

International Conference on Acoustics, Speech, and Signal Processing (ICASSP)

ISBN: (数字)9798350368741

ISBN: (纸本)9798350368758

Spectral super-resolution, which reconstructs hyperspectral images (HSI) from a single RGB image, has garnered increasing attention. Due to the limitations of CNN structures in spectral modeling and the high computational cost of Transformer structures, existing deep learning (DL)-based methods struggle to balance spectral reconstruction quality and computational efficiency. Recently, Mamba methods base on state-space models (SSM) show great potential in modeling long-range dependencies with linear complexity. Therefore, we introduce the Mamba model into spectral super-resolution (SSR) task. Specifically, we propose a three-stage SSR network base on Mamba, called SSRMamba. We design SpaMamba, SSMamba, and SpeMamba modules for shallow spatial information extraction, mixed information encoding, and spectral information reconstruction, respectively. Extensive experimental results demonstrate that SSRMamba not only surpasses existing methods in terms of quantification and quality, achieving state-of-the-art (SOTA) performance, but also significantly reduces model size and computational cost. The source code of SSRMamba is available at: https://***/Baisonm-Li/SSRMamba.

关键词： Visualization computational modeling Superresolution Information retrieval Transformers computational efficiency State-space methods Speech processing Image reconstruction Hyperspectral imaging

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：