检索结果-南通市图书馆

Deep learning-based software engineering: progress,challenges, and opportunities

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Science China(Information Sciences) 2025年第1期68卷 57-144页

作者： Xiangping CHEN Xing HU Yuan HUANG He JIANG Weixing JI Yanjie JIANG Yanyan JIANG Bo LIU Hui LIU Xiaochen LI Xiaoli LIAN Guozhu MENG Xin PENG Hailong SUN Lin SHI Bo WANG Chong WANG Jiayi WANG Tiantian WANG Jifeng XUAN Xin XIA Yibiao YANG Yixin YANG Li ZHANG Yuming ZHOU Lu ZHANG school of Journalism and Communication Sun Yat-sen University school of software Technology Zhejiang University school of software Engineering Sun Yat-sen University school of software Dalian University of Technology school of computer Science and Technology Beijing Institute of Technology Key Laboratory of High Confidence software Technologies (Peking University) Ministry of EducationSchool of Computer Science Peking University State Key Laboratory for Novel software Technology Nanjing University school of computer Science and Engineering Beihang University Institute of Information Engineering Chinese Academy of Sciences school of computer Science Fudan University State Key Laboratory of Complex & Critical software Environment (CCSE) School of Software Beihang University school of computer and Information Technology Beijing Jiaotong University school of computer Science and Technology Harbin Institute of Technology school of computer Science Wuhan University Huawei Technologies

Researchers have recently achieved significant advances in deep learning techniques, which in turn has substantially advanced other research disciplines, such as natural language processing, image processing, speech recognition, and software engineering. Various deep learning techniques have been successfully employed to facilitate software engineering tasks, including code generation, software refactoring, and fault localization. Many studies have also been presented in top conferences and journals, demonstrating the applications of deep learning techniques in resolving various software engineering tasks. However,although several surveys have provided overall pictures of the application of deep learning techniques in software engineering,they focus more on learning techniques, that is, what kind of deep learning techniques are employed and how deep models are trained or fine-tuned for software engineering tasks. We still lack surveys explaining the advances of subareas in software engineering driven by deep learning techniques, as well as challenges and opportunities in each subarea. To this end, in this study, we present the first task-oriented survey on deep learning-based software engineering. It covers twelve major software engineering subareas significantly impacted by deep learning techniques. Such subareas spread out through the whole lifecycle of software development and maintenance, including requirements engineering, software development, testing, maintenance, and developer collaboration. As we believe that deep learning may provide an opportunity to revolutionize the whole discipline of software engineering, providing one survey covering as many subareas as possible in software engineering can help future research push forward the frontier of deep learning-based software engineering more systematically. For each of the selected subareas,we highlight the major advances achieved by applying deep learning techniques with pointers to the available datasets i

关键词： deep learning software engineering software benchmark software artifact representation survey

Channel pruning on frequency response

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Science China(Information Sciences) 2025年第1期68卷 159-170页

作者： Hang LIN Yifan PENG Lin BIE Chenggang YAN Xibin ZHAO Yue GAO school of software Tsinghua University school of Automation Hangzhou Dianzi University

Network pruning has a significant role in reducing network parameters and accelerating the inference time of the network. Some existing methods prune the network based on the frequency of the data, and finally obtain a sub-network with high accuracy. However, according to our experimental analysis, different frequencies of information in the data contribute differently to the accuracy of the model, and using this information directly for pruning without making a selection will lead to incorrect results. We believe that pruning should retain the convolutional kernels in the network that process important information, while those kernels that process unimportant information should be removed. In this paper, we first investigate the meaning of each frequency band information in the spectrum and their contribution to the prediction accuracy of the network,and according to these results, we propose a new pruning method based on frequency response(PFR). Our PFR finds and removes the convolutional kernels in the network that specialize in processing unimportant information, resulting in a compact neural network model. PFR obtains significant experimental results on different datasets, for example, a 56.0% raduction of float points operations(FLOPs) on Res Net-50 and only 0.37% of Top-1 accuracy degradation on the Image Net dataset.

关键词： deep learning model compression filter pruning channel pruning frequency response

同方期刊数据库

Personalized federated few-shot node classification

在线全文

学校读者我要写书评

暂无评论

Science China(Information Sciences) 2025年第1期68卷 204-218页

作者： Yunfeng ZHAO Xintong HE Guoxian YU Jun WANG Yongqing ZHENG Carlotta DOMENICONI school of software Shandong University Joint SDU-NTU Centre for Artificial Intelligence Research Shandong University Department of Mathematics National University of Singapore Department of computer Science George Mason University

Personalized federated learning(PFL) aims to train customized models for individual clients in a decentralized setting, with the account of non-independent and identically distributed data across clients. However, most PFL methods adopt uniform classification layers for diverse clients and give rise to error-prone predictions, due to the task heterogeneity notably prominent in decentralized graph data scenarios. Although some PFL solutions setup client-specific classification layers for each client and optimize them only locally, they are corrupted with limited local training data. We propose an innovative solution called federated parameter decoupling and node augmentation(Fed PANo) to address these problems and to achieve personalized federated few-shot node classification, which is a prevalent and challenging but unexplored topic. Specifically, Fed PANo first separates the local model into the GNN and classifier to handle unique client-specific task variations. The GNN is trained through federated learning to capture shared knowledge of graph nodes across clients, while the classifier is custom-designed and trained individually for each client. Additionally, a generic classifier shared among clients is adopted to encourage the GNN's grasp of shared information. Then Fed PANo further proposes the node generator along with its local and collaborative training strategies to deal with the node scarcity of clients. Extensive experimental results on benchmark datasets confirm that Fed PANo outperforms eight competitive baselines across different settings.

关键词： personalized federated learning few-shot learning node classification task heterogeneity parameter decoupling node augmentation

A Generative Model-Based Network Framework for Ecological Data Reconstruction

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

computers, Materials & Continua 2025年第1期82卷 929-948页

作者： Shuqiao Liu Zhao Zhang Hongyan Zhou Xuebo Chen school of Electronic and Information Engineering University of Science and Technology LiaoningAnshan114051China school of computer Science and software Engineering University of Science and Technology LiaoningAnshan114051China

This study examines the effectiveness of artificial intelligence techniques in generating high-quality environmental data for species introductory site selection *** Strengths,Weaknesses,Opportunities,Threats(SWOT)analysis data with Variation Autoencoder(VAE)and Generative AdversarialNetwork(GAN)the network framework model(SAE-GAN),is proposed for environmental data *** model combines two popular generative models,GAN and VAE,to generate features conditional on categorical data embedding after SWOT *** model is capable of generating features that resemble real feature distributions and adding sample factors to more accurately track individual sample *** data is used to retain more semantic information to generate *** model was applied to species in Southern California,USA,citing SWOT analysis data to train the *** show that the model is capable of integrating data from more comprehensive analyses than traditional methods and generating high-quality reconstructed data from them,effectively solving the problem of insufficient data collection in development *** model is further validated by the Technique for Order Preference by Similarity to an Ideal Solution(TOPSIS)classification assessment commonly used in the environmental data *** study provides a reliable and rich source of training data for species introduction site selection systems and makes a significant contribution to ecological and sustainable development.

关键词： Convolutional Neural Network(CNN) VAE GAN TOPSIS data reconstruction

Federated local causal structure learning

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Science China(Information Sciences) 2025年第03期68卷 110-124页

作者： Kui YU Chen RONG Hao WANG Fuyuan CAO Jiye LIANG school of computer and Information Hefei University of Technology school of computer and Information Technology Shanxi University

Local causal structure learning(LCS) efficiently identifies a set of direct neighbors of a specified variable from observational data. Additionally, it distinguishes direct causes and direct effects of this variable without learning the entire causal structure. While many LCS algorithms have been proposed, they do not consider the data privacy-preserving problem,which has attracted extensive attention from academia and industry. To address this issue, we propose a federated local causal structure learning(FedLCS) algorithm to learn local causal structures in privacy-preserving data in a federated ***, FedLCS introduces a layer-wise federated local skeleton learning algorithm to construct the local skeleton. Based on this skeleton, it introduces a federated local skeleton orientation algorithm and an extension-and-backtracking orientation algorithm to orient the edges. Finally, FedLCS uses a federated local extension-and-backtracking orientation algorithm to orient the remaining edges. Extensive experiments on benchmark, synthetic, and real datasets demonstrate that FedLCS can learn the local causal structure of a given variable in a federated setting.

关键词： local causal structure learning federated learning directed acyclic graph privacy-preserving data federated layer-wise strategy

同方期刊数据库

AsyCo: an asymmetric dual-task co-training model for partial-label learning

在线全文

学校读者我要写书评

暂无评论

Science China(Information Sciences) 2025年

作者： Beibei LI Yiyuan ZHENG Beihong JIN Tao XIANG Haobo WANG Lei FENG College of computer Science Chongqing University State Key Laboratory of computer Science Institute of Software Chinese Academy of Sciences University of Chinese Academy of Sciences school of software Technology Zhejiang University school of computer Science and Engineering Nanyang Technological University

Partial-label learning (PLL) is a typical problem of weakly supervised learning, where each training instance is annotated with a set of candidate labels. Self-training PLL models achieve state-of-the-art performance but suffer from error accumulation problems caused by mistakenly disambiguated instances. Although co-training can alleviate this issue by training two networks simultaneously and allowing them to interact with each other, most existing co-training methods train two structurally identical networks with the same task, i.e., are symmetric, rendering it insufficient for them to correct each other due to their similar limitations. Therefore, in this paper, we propose an asymmetric dual-task co-training PLL model called AsyCo,which forces its two networks, i.e., a disambiguation network and an auxiliary network, to learn from different views explicitly by optimizing distinct tasks. Specifically, the disambiguation network is trained with a self-training PLL task to learn label confidence, while the auxiliary network is trained in a supervised learning paradigm to learn from the noisy pairwise similarity labels that are constructed according to the learned label confidence. Finally, the error accumulation problem is mitigated via information distillation and confidence refinement. Extensive experiments on both uniform and instance-dependent partially labeled datasets demonstrate the effectiveness of AsyCo.

关键词：

Classifying extended,localized and critical states in quasiperiodic lattices via unsupervised learning

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Chinese Physics B 2025年第1期34卷 422-427页

作者： Bohan Zheng Siyu Zhu Xingping Zhou Tong Liu school of computer Science and Technology School of SoftwareNanjing University of Posts and TelecommunicationsNanjing 210023China Institute of Quantum Information and Technology Nanjing University of Posts and TelecommunicationsNanjing 210003China Department of Applied Physics School of ScienceNanjing University of Posts and TelecommunicationsNanjing 210003China

Classification of quantum phases is one of the most important areas of research in condensed matter *** this work,we obtain the phase diagram of one-dimensional quasiperiodic models via unsupervised ***,we choose two advanced unsupervised learning algorithms,namely,density-based spatial clustering of applications with noise(DBSCAN)and ordering points to identify the clustering structure(OPTICS),to explore the distinct phases of the Aubry–André–Harper model and the quasiperiodic p-wave *** unsupervised learning results match well with those obtained through traditional numerical ***,we assess similarity across different algorithms and find that the highest degree of similarity between the results of unsupervised learning algorithms and those of traditional algorithms exceeds 98%.Our work sheds light on applications of unsupervised learning for phase classification.

关键词： quantum phase quasiperiodic machine learning

维普期刊数据库

Privacy-preserving explainable AI: a survey

在线全文

学校读者我要写书评

暂无评论

Science China(Information Sciences) 2025年第1期68卷 23-56页

作者： Thanh Tam NGUYEN Thanh Trung HUYNH Zhao REN Thanh Toan NGUYEN Phi Le NGUYEN Hongzhi YIN Quoc Viet Hung NGUYEN school of Information and Communication Technology Griffith University school of computer and Communication Sciences Ecole Polytechnique Federale de Lausanne Faculty of Mathematics and computer Science University of Bremen Faculty of Information Technology HUTECH University Department of computer Science Hanoi University of Science and Technology school of Electrical Engineering and computer Science The University of Queensland

As the adoption of explainable AI(XAI) continues to expand, the urgency to address its privacy implications intensifies. Despite a growing corpus of research in AI privacy and explainability, there is little attention on privacy-preserving model explanations. This article presents the first thorough survey about privacy attacks on model explanations and their countermeasures. Our contribution to this field comprises a thorough analysis of research papers with a connected taxonomy that facilitates the categorization of privacy attacks and countermeasures based on the targeted explanations. This work also includes an initial investigation into the causes of privacy leaks. Finally, we discuss unresolved issues and prospective research directions uncovered in our analysis. This survey aims to be a valuable resource for the research community and offers clear insights for those new to this domain. To support ongoing research, we have established an online resource repository, which will be continuously updated with new and relevant findings.

关键词： privacy-preserving explainable AI privacy attacks privacy defences PrivEx PPXAI

Predefined-Time Constrained Optimization of Multi-Agent Systems Under Impulsive Effects

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

IEEE/CAA Journal of Automatica Sinica 2025年第1期12卷 255-257页

作者： Zhuyan Jiang Xiaoyang Liu Xiang Jiang Jinde Cao the school of computer Science and Technology Jiangsu Normal University IEEE the school of Mathematics Southeast University

Dear Editor,This letter investigates predefined-time optimization problems(OPs) of multi-agent systems(MASs), where the agent of MASs is subject to inequality constraints, and the team objective function accounts for impulse effects. Firstly, to address the inequality constraints,the penalty method is introduced. Then, a novel optimization strategy is developed, which only requires that the team objective function be strongly convex.

关键词： Constrained optimization