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

A survey on cross-user federated recommendation

science China(Information sciences) 2025年第4期68卷 7-32页

作者： Enyue YANG Yudi XIONG Wei YUAN Weike PAN Qiang YANG Zhong MING College of Computer Science and Software Engineering Shenzhen University School of Electrical Engineering and Computer Science The University of Queensland WeBank AI Lab WeBank Department of Computer Science and Engineering Hong Kong University of Science and Technology College of Big Data and Internet Shenzhen Technology University Guangdong Laboratory of Artificial Intelligence and Digital Economy (SZ)

Recommender systems are effective in mitigating information overload, yet the centralized storage of user data raises significant privacy concerns. Cross-user federated recommendation(CUFR) provides a promising distributed paradigm to address these concerns by enabling privacy-preserving recommendations directly on user devices. In this survey, we review and categorize current progress in CUFR, focusing on four key aspects: privacy, security, accuracy, and efficiency. Firstly,we conduct an in-depth privacy analysis, discuss various cases of privacy leakage, and then review recent methods for privacy protection. Secondly, we analyze security concerns and review recent methods for untargeted and targeted *** untargeted attack methods, we categorize them into data poisoning attack methods and parameter poisoning attack methods. For targeted attack methods, we categorize them into user-based methods and item-based methods. Thirdly,we provide an overview of the federated variants of some representative methods, and then review the recent methods for improving accuracy from two categories: data heterogeneity and high-order information. Fourthly, we review recent methods for improving training efficiency from two categories: client sampling and model compression. Finally, we conclude this survey and explore some potential future research topics in CUFR.

关键词： cross-user federated recommendation federated recommendation federated learning recommender systems user privacy

来源：评论

学校读者我要写书评

暂无评论

An infrastructure software perspective toward computation offloading between executable specifications and foundation models

引用

science China(Information sciences) 2025年第4期68卷 380-382页

作者： Dezhi RAN Mengzhou WU Yuan CAO Assaf MARRON David HAREL Tao XIE Key Laboratory of High Confidence Software Technologies (PKU) Ministry of Education School of Computer SciencePeking University School of Electronics Engineering and Computer Science Peking University Department of Computer Science and Applied Mathematics Weizmann Institute of Science

Foundation models(FMs) [1] have revolutionized software development and become the core components of large software systems. This paradigm shift, however, demands fundamental re-imagining of software engineering theories and methodologies [2]. Instead of replacing existing software modules implemented by symbolic logic, incorporating FMs' capabilities to build software systems requires entirely new modules that leverage the unique capabilities of ***, while FMs excel at handling uncertainty, recognizing patterns, and processing unstructured data, we need new engineering theories that support the paradigm shift from explicitly programming and maintaining user-defined symbolic logic to creating rich, expressive requirements that FMs can accurately perceive and implement.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Ethical Aspects of ChatGPT in software engineering Research

IEEE Transactions on Artificial Intelligence

引用

IEEE Transactions on Artificial Intelligence 2025年第2期6卷 254-267页

作者： Akbar, Muhammad Azeem Khan, Arif Ali Liang, Peng Lappeenranta-Lahti University of Technology Software Engineering Department Lappeenranta15210 Finland University of Oulu M3S Empirical Software Engineering Research Unit Oulu90014 Finland Wuhan University School of Computer Science Wuhan430072 China

ChatGPT can improve software engineering (SE) research practices by offering efficient, accessible information analysis, and synthesis based on natural language interactions. However, ChatGPT could bring ethical challenges, encompassing plagiarism, privacy, data security, and the risk of generating biased or potentially detrimental data. This research aims to fill the given gap by elaborating on the key elements: motivators, demotivators, and ethical principles of using ChatGPT in SE research. To achieve this objective, we conducted a literature survey, identified the mentioned elements, and presented their relationships by developing a taxonomy. Furthermore, the identified literature-based elements (motivators, demotivators, and ethical principles) were empirically evaluated by conducting a comprehensive questionnaire-based survey involving SE researchers. In addition, we employed an interpretive structure modeling approach to analyze the relationships between the ethical principles of using ChatGPT in SE research and develop a level-based decision model. We further conducted a cross-impact matrix multiplication applied to classification analysis to create a cluster-based decision model. These models aim to help SE researchers devise effective strategies for ethically integrating ChatGPT into SE research by following the identified principles by adopting the motivators and addressing the demotivators. The findings of this study will establish a benchmark for incorporating ChatGPT services in SE research with an emphasis on ethical considerations. © 2020 IEEE.

关键词： software engineering

来源：评论

学校读者我要写书评

暂无评论

Clustered Reinforcement Learning

引用

Frontiers of computer science 2025年第4期19卷 43-57页

作者： Xiao MA Shen-Yi ZHAO Zhao-Heng YIN Wu-Jun LI National Key Laboratory for Novel Software Technology Department of Computer Science and TechnologyNanjing UniversityNanjing 210023China Department of Electrical Engineering and Computer Sciences University of CaliforniaBerkeleyCA 94720-1770USA

Exploration strategy design is a challenging problem in reinforcement learning(RL),especially when the environment contains a large state space or sparse *** exploration,the agent tries to discover unexplored(novel)areas or high reward(quality)*** existing methods perform exploration by only utilizing the novelty of *** novelty and quality in the neighboring area of the current state have not been well utilized to simultaneously guide the agent’s *** address this problem,this paper proposes a novel RL framework,called clustered reinforcement learning(CRL),for efficient exploration in *** adopts clustering to divide the collected states into several clusters,based on which a bonus reward reflecting both novelty and quality in the neighboring area(cluster)of the current state is given to the *** leverages these bonus rewards to guide the agent to perform efficient ***,CRL can be combined with existing exploration strategies to improve their performance,as the bonus rewards employed by these existing exploration strategies solely capture the novelty of *** on four continuous control tasks and six hard-exploration Atari-2600 games show that our method can outperform other state-of-the-art methods to achieve the best performance.

关键词： deep reinforcement learning exploration count-based method clustering K-means

来源：评论

学校读者我要写书评

暂无评论

Migrant Resettlement by Evolutionary Multiobjective Optimization

IEEE Transactions on Artificial Intelligence

引用

IEEE Transactions on Artificial Intelligence 2025年第1期6卷 51-65页

作者： Liu, Dan-Xuan Gu, Yu-Ran Qian, Chao Mu, Xin Tang, Ke Nanjing University National Key Laboratory for Novel Software Technology School of Artificial Intelligence Nanjing210023 China Peng Cheng Laboratory Shenzhen518000 China Southern University of Science and Technology Department of Computer Science and Engineering Shenzhen518055 China

Migration has been a universal phenomenon, which brings opportunities as well as challenges for global development. As the number of migrants (e.g., refugees) increases rapidly, a key challenge faced by each country is the problem of migrant resettlement. This problem has attracted scientific research attention, from the perspective of maximizing the employment rate. Previous works mainly formulated migrant resettlement as an approximately submodular optimization problem subject to multiple matroid constraints and employed the greedy algorithm, whose performance, however, may be limited due to its greedy nature. In this article, we propose a new framework called migrant resettlement by evolutionary multiobjective optimization (MR-EMO), which reformulates migrant resettlement as a biobjective optimization problem that maximizes the expected number of employed migrants and minimizes the number of dispatched migrants simultaneously, and employs a multiobjective evolutionary algorithm (MOEA) to solve the biobjective problem. We implement MR-EMO using three MOEAs: the popular nondominated sorting genetic algorithm II (NSGA-II), MOEA based on decomposition (MOEA/D) as well as the theoretically grounded global simple evolutionary multiobjective optimizer (GSEMO). To further improve the performance of MR-EMO, we propose a specific MOEA, called GSEMO using matrix-swap mutation and repair mechanism (GSEMO-SR), which has a better ability to search for feasible solutions. We prove that MR-EMO using either GSEMO or GSEMO-SR can achieve better theoretical guarantees than the previous greedy algorithm. Experimental results under the interview and coordination migration models clearly show the superiority of MR-EMO (with either NSGA-II, MOEA/D, GSEMO or GSEMO-SR) over previous algorithms, and that using GSEMO-SR leads to the best performance of MR-EMO. © 2024 IEEE.

关键词： Multiobjective optimization

来源：评论

学校读者我要写书评

暂无评论

MA-MFIF: When misaligned multi-focus Image fusion meets deep homography estimation

引用

Multimedia Tools and Applications 2025年第12期84卷 10877-10898页

作者： Zhao, Baojun Luo, Fei Fuentes, Joel Ding, Weichao Gu, Chunhua School of Information Science and Engineering East China University of Science and Technology Shanghai200237 China Shanghai Key Laboratory of Computer Software Evaluating and Testing Shanghai China Department of Computer Science and Information Technologies Universidad del Bio-Bio Chillán3780000 Chile

Multi-focus image fusion is a technique that combines multiple out-of-focus images to enhance the overall image quality. It has gained significant attention in recent years, thanks to the advancements in deep learning. However, one of the persistent challenges in this field is the processing of misaligned data, which can negatively impact the fusion results. To overcome this problem, a novel fusion framework with pre-registration is proposed for the fusion of misaligned multi-focus images. For pre-registration, content-aware deep homography estimation is used, which performs transfer learning on a real multi-focus image dataset to adapt to registration under defocused conditions. For fusion, a fusion module with dual-branch feature interaction is utilized to avoid invalid feature fusion and trained on real light field dataset to achieve better fusion performance. Qualitative and quantitative experimental results show that the proposed method has a 2-3 percentage point improvement in multiple evaluation metrics compared to existing advanced registration and fusion methods, and a maximum improvement of 4.83 percentage points in fusion performance when tested independently on the Lytro dataset. Additionally, We find that the value of the Qcv metric is greatly influenced by the alignment status of the input images, leading to its inability to reflect the fusion quality of aligned images. © The Author(s), under exclusive licence to Springer science+Business Media, LLC, part of Springer Nature 2024.

关键词： Image enhancement

来源：评论

学校读者我要写书评

暂无评论

MLPFormer: MLP-integrated transformer for colorectal histopathology whole slide image segmentation

引用

Neural Computing and Applications 2025年第6期37卷 4651-4661页

作者： Wang, Yuxuan Li, Dan Li, Xuechen Guo, Yan Zuo, Yanfei Shen, Linlin Department of Computer Science Wenzhou-Kean University Wenzhou China School of Electronics and Information Engineering Wuyi University Jiangmen China Department of Histo Pathology Shanghai Histo Pathology Diagnostic Center Shanghai China College of Computer Sicence and Software Engineering Shenzhen University Shenzhen China National Engineering Laboratory for Big Data System Computing Technology Shenzhen University Shenzhen China

Colorectal intraepithelial neoplasia is a precancerous lesion of colorectal cancer, which is mainly diagnosed using pathological images. According to the characteristics of lesions, precancerous lesions can be classified into four different grades, i.e., background, normal, low and high level. However, due to the continuity of lesion development, tissue in different stages has high similarity. Recently, visual transformers have achieved impressive results in different visual tasks, due to their capacity of capturing long-range dependencies. However, due to computational cost, transformer cannot well extract detailed feature, which is important for lesion grading. To accurately segment pathological tissues with high similarity, in this work, we embed the multi-head MLP mixer module in the transformer network to extract cell and edge information. Furthermore, we propose a hierarchical MLP decoder to facilitate multi-scale feature fusion. The proposed transformer, namely MLPFormer, achieves remarkable results against competitive baselines on the Histo-CRC Biopsy dataset. The experimental results demonstrate that MLPFormer significantly outperforms the competitive baselines, i.e., a 3% dice improvement is achieved over the SegFormer series. © The Author(s), under exclusive licence to Springer-Verlag London Ltd., part of Springer Nature 2024.

关键词： Image segmentation

来源：评论

学校读者我要写书评

暂无评论

Layout Decomposition via Boolean Satisfiability

引用

IEEE Transactions on computer-Aided Design of Integrated Circuits and Systems 2025年第3期44卷 1112-1125页

作者： Liu, Hongduo Liao, Peiyu Zou, Mengchuan Pang, Bowen Li, Xijun Yuan, Mingxuan Ho, Tsung-Yi Yu, Bei The Chinese University of Hong Kong Department of Computer Science and Engineering Hong Kong Hong Kong Huawei Noah's Ark Lab Hong Kong Hong Kong Institute of Software Chinese Academy of Sciences State Key Laboratory of Computer Science Beijing100190 China

Multiple patterning lithography (MPL) has been introduced in the integrated circuits manufacturing industry to enhance feature density as the technology node advances. A crucial step of MPL is assigning layout features to different masks, namely layout decomposition. Exact algorithms like integer linear programming (ILP) can solve layout decomposition to optimality but lack scalability for dense patterns. Relaxation algorithms (e.g., linear programming and semi-definite programming) and heuristics (e.g., exact cover) are capable of handling large cases at the cost of inferior solution quality. These methods rely on different mathematical solvers and expert-designed heuristics to offer a balance between solution quality and computational efficiency. In this article, we propose a unified layout decomposition framework comprising three algorithms: 1) satisfiability (SAT)-exact;2) SAT-bilevel;and 3) SAT-fast, all leveraging the capabilities of Boolean SAT solvers. The SAT-exact ensures optimality, but with faster convergence than ILP, SAT-bilevel addresses the decomposition as a bilevel optimization problem for rapid near-optimal solutions, and SAT-fast handles very large layouts in an incremental manner. Experimental results demonstrate our framework's superiority over existing state-of-the-art methods in terms of solution quality and runtime. © 2024 IEEE.

关键词： Integer linear programming

来源：评论

学校读者我要写书评

暂无评论

Cost-Optimized Task Offloading for Dependent Applications in Collaborative Edge and Cloud Computing

引用

IEEE Internet of Things Journal 2025年第9期12卷 12975-12988页

作者： Yuan, Haitao Hu, Qinglong Wang, Shen Bi, Jing Buyya, Rajkumar Lu, Jinhu Yang, Jinhong Zhang, Jia Zhou, MengChu Beihang University School of Automation Science and Electrical Engineering Beijing100191 China City University of Hong Kong Department of Computer Science Kowloon Tong Hong Kong Beijing University of Technology School of Software Engineering Faculty of Information Technology Beijing100124 China Laboratory School of Computing and Information Systems MelbourneVIC3010 Australia CSSC Systems Engineering Research Institute Beijing100036 China Southern Methodist University Lyle School of Engineering Department of Computer Science DallasTX75205 United States New Jersey Institute of Technology Department of Electrical and Computer Engineering NewarkNJ07102 United States

A collaborative system that includes mobile devices (MDs), edge nodes (ENs), and the cloud is needed where ENs at the network edge can run offloaded tasks of MDs with limited resources and energy for timely processing for latency-sensitive applications. Unlike existing studies, we formulate a total cost minimization problem for the system for applications, which can be divided into several interdependent subtasks. Each subtask can be executed in MDs, ENs, and the cloud. This work formulates a mixed-integer nonlinear program to minimize the total system cost. To address it, a novel meta-heuristic optimization algorithm called Genetic Simulated-annealing-based Particle swarm optimization with Auto-Encoder (GSPAE) is proposed, which innovatively combines feature extraction of deep learning and global search of meta-heuristic optimization. Genetic operations provide diverse solutions, the Metropolis acceptance of annealing offers a robust global search, and autoencoders (AEs) extract distribution characteristics of particles toward high-quality regions for fast convergence. Thus, GSPAE optimizes the associations between ENs and MDs and the scheduling of subtasks among MDs, ENs, and the cloud. Experiments with large-scale Google cluster datasets show that compared to state-of-the-art benchmark methods, GSPAE reduces the total cost by at least 17% while strictly meeting limits of application latency, available energy, computing, and communication resources of ENs and MDs. © 2014 IEEE.

关键词： Mobile edge computing

来源：评论

学校读者我要写书评

暂无评论

Introduction to the Special Issue on Formal Methods and Models for System Design

引用

ACM Transactions on Embedded Computing Systems 2025年第3期24卷 1-3页

作者： Brandt, Jens Saha, Indranil Zhang, Lijun Hochschule Niederrhein Krefeld Germany Department of Computer Science and Engineering Indian Institute of Technology Kanpur Kanpur India State Key Laboratory of Computer Science Institute of Software Chinese Academy of Sciences Beijing China

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：