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

Flexible Privacy-Preserving Data computing With Bilateral Access Control for Cloud-Assisted IoT

学校读者我要写书评

暂无评论

IEEE Transactions on Dependable and Secure computing 2025年第3期22卷 3166-3178页

作者： Zhang, Yijian Chen, Jie Ning, Jianting Chu, Qiaohan Wang, Luping Zhang, Guang East China Normal University Software Engineering Institute Shanghai200062 China East China Normal University Shanghai Key Laboratory of Trustworthy Computing China Fujian Normal University Fuzhou350007 China City University of Macau Macao999078 China Suzhou University of Science and Technology School of Electronic and Information Engineering Jiangsu215009 China Jiangsu Key Laboratory for Elevator Intelligent Safety Jiangsu215506 China

Cloud-assisted Internet of Things (IoT) is a new paradigm to compensate for the disadvantage of limited resources in IoT and extend the functional boundary of IoT. How to preserve the data privacy while identifying the data source in cloud-assisted IoT is a huge challenge and many cryptographic primitives such as matchmaking encryption (ME) are hence introduced to reach this goal. However, we observe that these tools fail to deal with some rigorous cases in which the data owner does not want anyone to disclose the entire data and even authorized users can only obtain a specified part. In this paper, to address such issue, we design a privacy-preserving data computing system with bilateral access control (PDCS-BAC) for cloud-assisted IoT based on a new primitive called identity-based matchmaking functional encryption (IB-MFE). We give the formal definition and security model of IB-MFE, then present two concrete IB-MFE schemes for inner-product function. Thus, PDCS-BAC manages to simultaneously provide flexible privacy computation with enhanced data privacy, bilateral access control, and data authenticity. Finally, we conduct comprehensive performance evaluations to demonstrate the practicability of our schemes for cloud-assisted IoT. © 2004-2012 IEEE.

关键词： Differential privacy

Fuzzy Information Entropy and Region Biased Matrix Factorization for Web Service QoS Prediction

学校读者我要写书评

暂无评论

arXiv 2025年

作者： Tang, Guoxing Du, Yugen Chen, Xia Luo, Yingwei Ma, Benchi Shanghai Key Laboratory of Trustworthy Computing Software Engineering Institute East China Normal University Shanghai200062 China

Nowadays, there are many similar services available on the internet, making Quality of Service (QoS) a key concern for users. Since collecting QoS values for all services through user invocations is impractical, predicting QoS values is a more feasible approach. Matrix factorization is considered an effective prediction method. However, most existing matrix factorization algorithms focus on capturing global similarities between users and services, overlooking the local similarities between users and their similar neighbors, as well as the non-interactive effects between users and services. This paper proposes a matrix factorization approach based on user information entropy and region bias, which utilizes a similarity measurement method based on fuzzy information entropy to identify similar neighbors of users. Simultaneously, it integrates the region bias between each user and service linearly into matrix factorization to capture the non-interactive features between users and services. This method demonstrates improved predictive performance in more realistic and complex network environments. Additionally, numerous experiments are conducted on real-world QoS datasets. The experimental results show that the proposed method outperforms some of the state-of-the-art methods in the field at matrix densities ranging from 5% to 20%. Copyright © 2025, The Authors. All rights reserved.

关键词： Matrix factorization

RAHN: A Reputation Based Hourglass Network for Web Service QoS Prediction

学校读者我要写书评

暂无评论

arXiv 2025年

作者： Chen, Xia Du, Yugen Tang, Guoxing Luo, Yingwei Ma, Benchi Software Engineering Institute East China Normal University Shanghai200062 China Shanghai Key Laboratory of Trustworthy Computing Shanghai200062 China

As the homogenization of Web services becomes more and more common, the difficulty of service recommendation is gradually increasing. How to predict Quality of Service (QoS) more efficiently and accurately becomes an important challenge for service recommendation. Considering the excellent role of reputation and deep learning (DL) techniques in the field of QoS prediction, we propose a reputation and DL based QoS prediction network, RAHN, which contains the Reputation Calculation Module (RCM), the Latent Feature Extraction Module (LFEM), and the QoS Prediction Hourglass Network (QPHN). RCM obtains the user reputation and the service reputation by using a clustering algorithm and a Logit model. LFEM extracts latent features from known information to form an initial latent feature vector. QPHN aggregates latent feature vectors with different scales by using Attention Mechanism, and can be stacked multiple times to obtain the final latent feature vector for prediction. We evaluate RAHN on a real QoS dataset. The experimental results show that the Mean Absolute Error (MAE) and Root Mean Square Error (RMSE) of RAHN are smaller than the six baseline methods. Copyright © 2025, The Authors. All rights reserved.

关键词： Web services

Optimizing Bevy-ECS Using Predictive JSSP Approach

学校读者我要写书评

暂无评论

Optimizing Bevy-ECS Using Predictive JSSP Approach

Power Electronics, Computer Applications (ICPECA), IEEE International Conference on

作者： Benchi Ma Yugen Du Software Engineering Institution East China Normal University Shanghai China Shanghai Key Laboratory of Trustworthy Computing Shanghai China

ISBN: (数字)9798331533694

ISBN: (纸本)9798331533700

关键词： Schedules Adaptation models Runtime Prefetching Games Predictive models Mathematical models Power electronics Complexity theory Engines

Error Classification of Large Language Models on Math Word Problems: A Dynamically Adaptive Framework

学校读者我要写书评

暂无评论

arXiv 2025年

作者： Sun, Yuhong Yin, Zhangyue Huang, Xuanjing Qiu, Xipeng Zhao, Hui Software Engineering Institute East China Normal University China School of Computer Science Fudan University China Shanghai Key Laboratory of Trustworthy Computing Shanghai China

Large Language Models (LLMs) have demonstrated remarkable capabilities across various domains. Math Word Problems (MWPs) serve as a crucial benchmark for evaluating LLMs’ reasoning abilities. While most research primarily focuses on improving accuracy, it often neglects understanding and addressing the underlying patterns of errors. Current error classification methods rely on static and predefined categories, which limit their ability to capture the full spectrum of error patterns in mathematical reasoning. To enable systematic error analysis, we collect error samples from 15 different LLMs of varying sizes across four distinct MWP datasets using multiple sampling strategies. Based on this extensive collection, we introduce MWPES-300K, a comprehensive dataset containing 304,865 error samples that cover diverse error patterns and reasoning paths. To reduce human bias and enable fine-grained analysis of error patterns, we propose a novel framework for automated dynamic error classification in mathematical reasoning. Experimental results demonstrate that dataset characteristics significantly shape error patterns, which evolve from basic to complex manifestations as model capabilities increase. With deeper insights into error patterns, we propose error-aware prompting that incorporates common error patterns as explicit guidance, leading to significant improvements in mathematical reasoning performance. Copyright © 2025, The Authors. All rights reserved.

关键词： Systematic errors

Heterogeneity-aware Personalized Federated Learning via Adaptive Dual-Agent Reinforcement Learning

学校读者我要写书评

暂无评论

arXiv 2025年

作者： Chen, Xi Li, Qin Cai, Haibin Wang, Ting MoE Engineering Research Center of Software/Hardware Co-design Technology and Application Shanghai Key Laboratory of Trustworthy Computing East China Normal University Shanghai200062 China

Federated Learning (FL) empowers multiple clients to collaboratively train machine learning models without sharing local data, making it highly applicable in heterogeneous Internet of Things (IoT) environments. However, intrinsic heterogeneity in clients’ model architectures and computing capabilities often results in model accuracy loss and the intractable straggler problem, which significantly impairs training effectiveness. To tackle these challenges, this paper proposes a novel Heterogeneity-aware Personalized Federated Learning method, named HAPFL, via multi-level Reinforcement Learning (RL) mechanisms. HAPFL optimizes the training process by incorporating three strategic components: 1) An RL-based heterogeneous model allocation mechanism. The parameter server employs a Proximal Policy Optimization (PPO)-based RL agent to adaptively allocate appropriately sized, differentiated models to clients based on their performance, effectively mitigating performance disparities. 2) An RL-based training intensity adjustment scheme. The parameter server leverages another PPO-based RL agent to dynamically fine-tune the training intensity for each client to further enhance training efficiency and reduce straggling latency. 3) A knowledge distillation-based mutual learning mechanism. Each client deploys both a heterogeneous local model and a homogeneous lightweight model named LiteModel, where these models undergo mutual learning through knowledge distillation. This uniform LiteModel plays a pivotal role in aggregating and sharing global knowledge, significantly enhancing the effectiveness of personalized local training. Experimental results across multiple benchmark datasets demonstrate that HAPFL not only achieves high accuracy but also substantially reduces the overall training time by 20.9%-40.4% and decreases straggling latency by 19.0%-48.0% compared to existing solutions. © 2025, CC BY.

关键词： Federated learning

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

TDiffSal: Text-Guided Diffusion Saliency Prediction Model for Images 27th

学校读者我要写书评

暂无评论

TDiffSal: Text-Guided Diffusion Saliency Prediction Model fo...

27th International Conference on Pattern Recognition, ICPR 2024

作者： Zhang, Nana Xiong, Min Zhu, Dandan Zhu, Kun Zhai, Guangtao School of Computer Science and Technology Donghua University No. 2999 Renmin North Road Songjiang District Shanghai201620 China State Key Laboratory for Novel Software Technology Nanjing University Nanjing210093 China Institute of AI Education Shanghai East China Normal University No. 3663 Zhongshan North Road Putuo District Shanghai200333 China Key Laboratory of Embedded System and Service Computing Ministry of Education Tongji University No. 4800 Cao’an Highway Jiading District Shanghai201804 China Institute of Image Communication and Network Engineering Shanghai Jiao Tong University No. 800 Dongchuan Road Minhang District Shanghai200240 China

ISBN: (纸本)9783031781858

Existing visual saliency prediction methods mainly focus on single-modal visual saliency prediction, while ignoring the significant impact of text on visual saliency. To more comprehensively explore the influence of text on human attention in images, we propose a text-guided diffusion saliency prediction model, named TDiffSal. In specific, recent studies on stable diffusion models have shown promising performance in unifying tasks due to their inherent generalization ability. Inspired by this, a novel diffusion model for generalized visual-text saliency prediction is proposed, which formulates the prediction issue as a conditional generative task of the saliency map by employing input visual and text as the conditions. Meanwhile, we introduce a multi-head fusion module to effectively integrate text features and image features, which can efficiently guide the image denoising process and progressively refine the generated saliency map to make it semantically relevant to the text. Additionally, we employ an efficient pre-training strategy to enhance the robustness and generalization of the proposed model. We conduct extensive experiments on benchmark datasets to demonstrate its superior performance compared to other state-of-the-art methods. © The Author(s), under exclusive license to Springer Nature Switzerland AG 2025.

关键词： Prediction models

SAFL: Structure-Aware Personalized Federated Learning via Client-Specific Clustering and SCSI-Guided Model Pruning

学校读者我要写书评

暂无评论

arXiv 2025年

作者： Li, Nan Wang, Xiaolu Du, Xiao Cai, Puyu Wang, Ting Engineering Research Center of Software/Hardware Co-Design Technology and Application Ministry of Education the Shangh ai Key Laboratory of Trustworthy Computing East China Normal University Shanghai200062 China Software Engineering Institute East China Normal University Shanghai200050 China Computer Science Department New York University New YorkNY10012 United States

Federated Learning (FL) enables clients to collaboratively train machine learning models without sharing local data, preserving privacy in diverse environments. While traditional FL approaches preserve privacy, they often struggle with high computational and communication overhead. To address these issues, model pruning is introduced as a strategy to streamline computations. However, existing pruning methods, when applied solely based on local data, often produce sub-models that inadequately reflect clients’ specific tasks due to data insufficiency. To overcome these challenges, this paper introduces SAFL (Structure-Aware Federated Learning), a novel framework that enhances personalized federated learning through client-specific clustering and Similar Client Structure Information (SCSI)-guided model pruning. SAFL employs a two-stage process: initially, it groups clients based on data similarities and uses aggregated pruning criteria to guide the pruning process, facilitating the identification of optimal sub-models. Subsequently, clients train these pruned models and engage in server-based aggregation, ensuring tailored and efficient models for each client. This method significantly reduces computational overhead while improving inference accuracy. Extensive experiments demonstrate that SAFL markedly diminishes model size and improves performance, making it highly effective in federated environments characterized by heterogeneous data. Copyright © 2025, The Authors. All rights reserved.

关键词： Federated learning