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

MACLSTM: A Weather Attributes Enabled Recurrent Approach to Appliance-Level Energy Consumption Forecasting

Computers, Materials & Continua 2025年第2期82卷 2969-2984页

作者： Ruoxin Li Shaoxiong Wu Fengping Deng Zhongli Tian Hua Cai Xiang Li Xu Xu Qi Liu NARI-TECH Nanjing Control System Co. Ltd.Nanjing211106China School of Software Nanjing University of Information Science&TechnologyNanjing210044China Jiangsu Province Engineering Research Center of Advanced Computing and Intelligent Services Nanjing210044China

Studies to enhance the management of electrical energy have gained considerable momentum in recent years. The question of how much energy will be needed in households is a pressing issue as it allows the management plan of the available resources at the power grids and consumer levels. A non-intrusive inference process can be adopted to predict the amount of energy required by appliances. In this study, an inference process of appliance consumption based on temporal and environmental factors used as a soft sensor is proposed. First, a study of the correlation between the electrical and environmental variables is presented. Then, a resampling process is applied to the initial data set to generate three other subsets of data. All the subsets were evaluated to deduce the adequate granularity for the prediction of the energy demand. Then, a cloud-assisted deep neural network model is designed to forecast short-term energy consumption in a residential area while preserving user privacy. The solution is applied to the consumption data of four appliances elected from a set of real household power data. The experiment results show that the proposed framework is effective for estimating consumption with convincing accuracy.

关键词： Electrical load forecasting cloud computing smart grid weather attributes energy consumption time-series analysis

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Generative AI-Aided Multimodal Parallel Offloading for AIGC Metaverse Service in IoT Networks

引用

IEEE Internet of Things Journal 2025年第10期12卷 13273-13285页

作者： Zeng, Weizhe Zheng, Jie Gao, Ling Niu, Jinping Ren, Jie Wang, Hai Cao, Rui Ji, Shuo Northwest University State-Province Joint Engineering and Research Center of Advanced Networking and Intelligent Information Services School of Information Science and Technology Shaanxi Xi'an710127 China Shaanxi Normal University School of Computer Science Xi'an710119 China

Mobile edge computing (MEC) enabled artificial intelligence-generated content (AIGC) has garnered considerable attention. To support AIGC metaverse applications within MEC in internet of things (IoT) networks, it is effective to offload computation tasks, particularly those involving neural networks generative in AIGC, from mobile devices to edge clouds. Existing solutions typically assume the availability of a dedicated and powerful edge server for each user with single modal data, which can handle the entire AIGC service offloading. However, the practical availability of such dedicated and powerful servers may be limited, necessitating the utilization of less capable alternatives. Thus, we propose the multimodal parallel offloading AIGC framework which partitions multimodal content and offloads partial diffusion tasks to multiple servers. Our proposed scheme accelerates mobile deep vision multimodal metaverse applications through parallel offloading provided by multiple servers. We further utilize generative AI scheme to solve offloading problems to adapt the dynamic and available communication and computing resource in wireless IoT network. Our framework proposed a multimodal parallel diffusion offloading scheme with integrating the recurrent region proposal prediction algorithm to optimize communication and computing resources while minimizing delay. Simulation results show that our approach can significantly reduce delay compared to conventional algorithms. © 2025 IEEE.

关键词： Generative adversarial networks

来源：评论

学校读者我要写书评

暂无评论

Blockchain-Enabled Secure, Fair and Scalable Data Sharing in Zero-Trust Edge-End Environment

引用

IEEE Journal on Selected Areas in Communications 2025年

作者： Xu, Xiaolong Meng, Ke Xiang, Haolong Cui, Guangming Xia, Xiaoyu Dou, Wanchun Nanjing210044 China Nanjing University of Information Science and Technology School of Software and the Jiangsu Province Engineering Research Center of Advanced Computing and Intelligent Services Nanjing210044 China RMIT University School of Computing Technologies MelbourneVIC3000 Australia Nanjing University State Key Laboratory for Novel Software Technology Nanjing210023 China

In edge computing, the Zero-Trust Security Model (ZTSM), as a key enabling technology for next-generation networks, plays a crucial role in providing authentication for addressing data sharing concerns, such as frequent data breaches, data misuse, and cyberattacks. However, due to the complexity and diversity of edge environments, ZTSM struggles to meet the security requirements of data sharing frameworks solely through enhanced authentication. Consequently, such frameworks with ZTSM still face challenges in ensuring data integrity, evaluating various node behaviors, and coping with the increasing complexity of node attributes. To address these issues, we propose a blockchain-enabled secure, fair and scalable data sharing framework in a zero-trust edge-end environment in this paper. Specifically, we first propose a Merkle forest-based data storage model for the classified storage of loosely coupled data, consequently enhancing the scalability of the model. Then, we design a node behavior-based reputation assessment mechanism to ensure fairness during data sharing. Moreover, a data sharing protocol supervised by smart contract is proposed, working with the aforementioned storage and assessment schemes, to ensure the security of data sharing. Finally, comprehensive security analysis validates the security, fairness and scalability of the proposed framework. Extensive experimental results show that, as transaction volume grows, the time cost of data traversal in the storage model becomes progressively more efficient. Additionally, when the size of the smart contract is increased tenfold, the maximum time cost of the data sharing protocol rises by only 4.98 times. © 1983-2012 IEEE.

关键词： Data integrity

来源：评论

学校读者我要写书评

暂无评论

A Multi-tier Offloading Optimization Strategy for Consumer Electronics in Vehicular Edge computing

引用

IEEE Transactions on Consumer Electronics 2025年

作者： Lin, Haiyang Xiao, Bo Zhou, Xiaokang Zhang, Yonghong Liu, Xiaodong the School of Software Nanjing University of Information Science and Technology Nanjing210044 China Jiangsu Province Engineering Research Center of Advanced Computing and Intelligent Services Nanjing210044 China the School of Chemistry and Materials Science Nanjing University of Information Science and Technology Nanjing210044 China the Faculty of Business Data Science Kansai University Osaka565-0823 Japan the School of Automation Nanjing University of Information Science and Technology Nanjing210044 China the School of Computing Edinburgh Napier University EdinburghEH10 5DT United Kingdom

—In the domain of consumer electronics, vehicular edge computing (VEC) technology is emerging as a novel data processing paradigm within vehicular networks. By sending tasks related to vehicular applications to the edge, this model makes it easier for computing power to be spread out. This lets interactive services respond quickly. Nevertheless, the computational resources at edge servers are inherently limited and often tasked with handling multiple concurrent operations. The inefficacious allocation of these resources significantly impairs the efficiency of task offloading. Additionally, indiscriminate offloading could overwhelm the servers, detrimentally impacting the performance of subsequent tasks. To circumvent these challenges, this study introduces a multi-tier offloading model predicated on game theory principles. This framework aims to optimize resource utilization at the edge while accounting for server load to ensure the timely execution of latency-sensitive tasks. To evaluate this model, this paper created a simulation environment specifically for video game tasks in consumer electronics. The experimental results show that the multi-tier offloading model can effectively relieve the load pressure on the edge server. The task failure rate of the multi-tier offloading model remains at the lowest level compared with several state-of-the-art algorithms, significantly reducing the execution delay of tasks and being able to meet the requirements of consumer electronics applications. © 2025 IEEE.

关键词： Computation offloading

来源：评论

学校读者我要写书评

暂无评论

RsDiff: Rational score based knowledge graph diffusion for recommendation

引用

Information Sciences 2025年 717卷

作者： Mengmeng Cui Siyu Wu Hao Chen Xiangnan Zhang School of Software Nanjing University of Information Science and Technology Nanjing 210044 Jiangsu China Jiangsu Province Engineering Research Center of Advanced Computing and Intelligent Services Nanjing Jiangsu China National Research Facility For Phenotypic and Genotypic Analysis of Model Animals China Agricultural University Beijing China

The Knowledge graph (KG) provides auxiliary information to improve the recommendation system performance. However, the knowledge graph includes a large number of triplets that have nothing to do with the recommendation task, leading to suboptimal results. To address this challenge, we propose a knowledge graph diffusion model based on rationality score for recommendation, called RsDiff. Firstly, we design a rational scoring mechanism for the knowledge graph triplets. Then, we propose a knowledge graph diffusion model based on rational scores to mitigate the impact of noise. Finally, we employ cross-view contrastive learning to align collaborative signals across different graphs. Experiments show that our proposed RsDiff outperforms the most advanced recommendation models in terms of NDCG@20 and Recall@20 indicators in the Last-FM, Alibaba-iFashion, and MIND datasets.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Trust Online Over-the-air Computation for Wireless Federated Learning

引用

IEEE Transactions on Mobile computing 2025年

作者： Sun, Mingjie Zheng, Jie Du, Hongyang Zhang, Haijun Niyato, Dusit Kang, Jiawen Wang, Jiacheng Ren, Jie Gao, Ling Wang, Zheng Northwest University State-Province Joint Engineering and Research Center of Advanced Networking and Intelligent Information Services School of Information Science and Technology Shaanxi Xian710127 China University of Hong Kong department of electrical and electronic engineering Hong Kong University of Science and Technology Beijing Institute of Artificial Intelligence Beijing100083 China Nanyang Technological University School of Computer Science and Engineering 639798 Singapore Guangdong University of Technology Automation of School Guangzhou510006 China Shaanxi Normal University School of Computer Science Xi'an710062 China University of Leeds School of Computing LS2 9JT United Kingdom

Using the wireless waveform superposition property, over-the-air computation (OAC) enables federated learning (FL) to achieve fast model aggregation. However, this computing paradigm is vulnerable to poisoning attacks due to the openness of a wireless channel over time, where malicious mobile devices can introduce cumulative errors for the global FL model in a time-varying wireless environment for each communication round. This article presents a trust online OAC (TO-OAC) scheme to minimize impacts on the global model introduced by malicious devices adjusting to dynamic attack and wireless channel fluctuations over time. TO-OAC achieves this by utilizing trustworthy security quantification of OAC for each FL training round. To optimize the cumulative training loss at the aggregation node with the long-term power and trust constraints of mobile devices, we propose a joint trust, power, and channel-aware algorithm to flexibly update local and global models in response to the dynamic changes in the wireless and secure environment. We analyze the performance limits for the aggregation of trust models, considering metrics for computation and communication through time. We then propose another trust online regularization over-the-air computation (TOR-OAC) as an improved version of the TO-OAC scheme to decrease convergence time while ensuring long-term trust and power limitation. Experimental results performed on real-life datasets show that the two proposed schemes (TO-OAC and TOR-OAC) outperform prior works, especially in noisy, time-varying wireless channels and malicious attacks. 2002-2012 IEEE.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Chaotic Map-Based Authentication and Key Agreement Protocol with Low-Latency for Metasystem

引用

Computers, Materials & Continua 2024年第3期78卷 4471-4488页

作者： Guojun Wang Qi Liu School of Electronics&Information Engineering Nanjing University of Information Science&TechnologyNanjing210044China Yancheng Polytechnic College Yancheng224000China Jiangsu Province Engineering Research Center of Advanced Computing and Intelligent Services School of SoftwareNanjing University of Information Science and TechnologyNanjingChina

With the rapid advancement in exploring perceptual interactions and digital twins,metaverse technology has emerged to transcend the constraints of space-time and reality,facilitating remote AI-based *** this dynamic metasystem environment,frequent information exchanges necessitate robust security measures,with Authentication and Key Agreement(AKA)serving as the primary line of defense to ensure communication ***,traditional AKA protocols fall short in meeting the low-latency requirements essential for synchronous interactions within the *** address this challenge and enable nearly latency-free interactions,a novel low-latency AKA protocol based on chaotic maps is *** protocol not only ensures mutual authentication of entities within the metasystem but also generates secure session *** security of these session keys is rigorously validated through formal proofs,formal verification,and informal *** confronted with the Dolev-Yao(DY)threat model,the session keys are formally demonstrated to be secure under the Real-or-Random(ROR)*** proposed protocol is further validated through simulations conducted using VMware workstation compiled in HLPSL language and C *** simulation results affirm the protocol’s effectiveness in resisting well-known attacks while achieving the desired low latency for optimal metaverse interactions.

关键词： Metasystem authentication and key agreement chaotic map secure communication

来源：评论

学校读者我要写书评

暂无评论

An OP-TEE Energy-Efficient Task Scheduling Approach Based on Mobile Application Characteristics

引用

intelligent Automation & Soft computing 2023年第8期37卷 1621-1635页

作者： Hai Wang Xuan Hao Shuo Ji Jie Zheng Yuhui Ma Jianfeng Yang State-Province Joint Engineering and Research Center of Advanced Networking and Intelligent Information Services School of Information Science and TechnologyNorthwest UniversityXi’an710127China

Trusted Execution Environment(TEE)is an important part of the security architecture of modern mobile devices,but its secure interaction process brings extra computing burden to mobile *** paper takes open portable trusted execution environment(OP-TEE)as the research object and deploys it to Raspberry Pi 3B,designs and implements a benchmark for OP-TEE,and analyzes its program ***,the application execution time,energy consumption and energy-delay product(EDP)are taken as the optimization objectives,and the central processing unit(CPU)frequency scheduling strategy of mobile devices is dynamically adjusted according to the characteristics of different applications through the combined *** experimental result shows that compared with the default strategy,the scheduling method proposed in this paper saves 21.18%on average with the Line Regression-Decision Tree scheduling model with the shortest delay as the optimization *** Decision Tree-Support Vector Regression(SVR)scheduling model,which takes the lowest energy consumption as the optimization goal,saves 22%energy on *** Decision Tree-K-Nearest Neighbor(KNN)scheduling model with the lowest EDP as the optimization objective optimizes about 33.9%on average.

关键词： Trusted execution environment energy efficiency optimization CPU scheduling governor machine learning

来源：评论

学校读者我要写书评

暂无评论

Enhanced Multi-Intent Recognition with BERT Embeddings and Graph-based Decoding 22

Enhanced Multi-Intent Recognition with BERT Embeddings and G...

引用

22nd IEEE International Symposium on Parallel and Distributed Processing with Applications, ISPA 2024

作者： Cui, Mengmeng Zhang, Rui Xiang, Haolong Xue, Shengjun Nanjing University of Information Science and Technology Nanjing China Jiangsu Province Engineering Research Center of Advanced Computing and Intelligent Services Nanjing China Silicon Lake College Suzhou China

ISBN: (纸本)9798331509712

In the question-answering system, users frequently express multiple intents within a single utterance. The majority of intent recognition models tend to either primarily address single-intent scenarios or simply aggregate the overall intent context vectors of all tokens, neglecting the integration of multi-intent information. However, current methods suffer from slow inference speed, limited generalization capability, and the relatively independent treatment of multi-intent recognition tasks, leading to suboptimal model performance. In this paper, we design a novel model based on BERT, employing a non-autoregressive approach for the task of multi-intent recognition. This model achieves enhanced speed and accuracy. Additionally, this model introduces a global slot-intent interaction layer, simulating interactions between multiple intents and slots within an utterance. Experimental results on a series of benchmarking datasets demonstrate that this model outperforms the state-of-the-art methods, improving both the effectiveness and efficiency of the overall system. © 2024 IEEE.

关键词： Graph embeddings

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：