检索结果-南通市图书馆

同方期刊数据库

Enhanced Acceleration for Generalized Nonconvex Low-Rank Matrix Learning

在线全文

学校读者我要写书评

暂无评论

Chinese Journal of Electronics 2025年第1期34卷 98-113页

作者： Hengmin Zhang Jian Yang Wenli Du Bob Zhang Zhiyuan Zha Bihan Wen school of Electrical and Electronic engineering Nanyang Technological University school of computer science and engineering Nanjing University of Science and Technology school of Information science and engineering East China University of Science and Technology Department of Electrical and computer engineering University of Macau

Matrix minimization techniques that employ the nuclear norm have gained recognition for their applicability in tasks like image inpainting, clustering, classification, and reconstruction. However, they come with inherent biases and computational burdens, especially when used to relax the rank function, making them less effective and efficient in real-world scenarios. To address these challenges, our research focuses on generalized nonconvex rank regularization problems in robust matrix completion, low-rank representation, and robust matrix regression. We introduce innovative approaches for effective and efficient low-rank matrix learning, grounded in generalized nonconvex rank relaxations inspired by various substitutes for the ?0-norm relaxed functions. These relaxations allow us to more accurately capture low-rank structures. Our optimization strategy employs a nonconvex and multi-variable alternating direction method of multipliers, backed by rigorous theoretical analysis for complexity and *** algorithm iteratively updates blocks of variables, ensuring efficient convergence. Additionally, we incorporate the randomized singular value decomposition technique and/or other acceleration strategies to enhance the computational efficiency of our approach, particularly for large-scale constrained minimization problems. In conclusion, our experimental results across a variety of image vision-related application tasks unequivocally demonstrate the superiority of our proposed methodologies in terms of both efficacy and efficiency when compared to most other related learning methods.

关键词： Learning systems Image recognition Minimization Computational efficiency Complexity theory Matrix decomposition Optimization Image reconstruction Singular value decomposition Convergence

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

LoRa Sense:Sensing and Optimization of LoRa Link Behavior Using Path-Loss Models in Open-Cast Mines

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

computer Modeling in engineering & sciences 2025年第1期142卷 425-466页

作者： Bhanu Pratap Reddy Bhavanam Prashanth Ragam school of computer science and engineering VIT-AP UniversityAmaravati52237India

The Internet of Things(IoT)has orchestrated various domains in numerous applications,contributing significantly to the growth of the smart world,even in regions with low literacy rates,boosting socio-economic *** study provides valuable insights into optimizing wireless communication,paving the way for a more connected and productive future in the mining *** IoT revolution is advancing across industries,but harsh geometric environments,including open-pit mines,pose unique challenges for reliable *** advent of IoT in the mining industry has significantly improved communication for critical operations through the use of Radio Frequency(RF)protocols such as Bluetooth,Wi-Fi,GSM/GPRS,Narrow Band(NB)-IoT,SigFox,ZigBee,and Long Range Wireless Area Network(LoRaWAN).This study addresses the optimization of network implementations by comparing two leading free-spreading IoT-based RF protocols such as ZigBee and *** field tests are conducted in various opencast mines to investigate coverage potential and signal *** is tested in the Tadicherla open-cast coal mine in ***,LoRaWAN field tests are conducted at one of the associated cement companies(ACC)in the limestone mine in Bargarh,India,covering both Indoor-toOutdoor(I2O)and Outdoor-to-Outdoor(O2O)environments.A robust framework of path-loss models,referred to as Free space,Egli,Okumura-Hata,Cost231-Hata and Ericsson models,combined with key performance metrics,is employed to evaluate the patterns of signal *** field testing and careful data analysis revealed that the Egli model is the most consistent path-loss model for the ZigBee protocol in an I2O environment,with a coefficient of determination(R^(2))of 0.907,balanced error metrics such as Normalized Root Mean Square Error(NRMSE)of 0.030,Mean Square Error(MSE)of 4.950,Mean Absolute Percentage Error(MAPE)of 0.249 and Scatter Index(SI)of *** the O2O scenario,the Ericsson model

关键词： Internet of things long range wireless area network ZigBee mining environments path-loss models coefficient of determination mean square error

Partial multi-label learning via label-specific feature corrections

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

science China(Information sciences) 2025年第03期68卷 95-109页

作者： Jun-Yi HANG Min-Ling ZHANG school of computer science and engineering Southeast University Key Laboratory of computer Network and Information Integration(Southeast University) Ministry of Education

Partial multi-label learning（PML） allows learning from rich-semantic objects with inaccurate annotations, where a set of candidate labels are assigned to each training example but only some of them are valid. Existing approaches rely on disambiguation to tackle the PML problem, which aims to correct noisy candidate labels by recovering the ground-truth labeling information ahead of prediction model induction. However, this dominant strategy might be suboptimal as it usually needs extra assumptions that cannot be fully satisfied in real-world scenarios. Instead of label correction, we investigate another strategy to tackle the PML problem, where the potential ambiguity in PML data is eliminated by correcting instance features in a label-specific manner. Accordingly, a simple yet effective approach named PASE, i.e., partial multi-label learning via label-specific feature corrections, is proposed. Under a meta-learning framework, PASElearns to exert label-specific feature corrections so that potential ambiguity specific to each class label can be eliminated and the desired prediction model can be induced on these corrected instance features with the provided candidate labels. Comprehensive experiments on a wide range of synthetic and real-world data sets validate the effectiveness of the proposed approach.

关键词： machine learning multi-label learning partial multi-label learning label-specific features feature correction

同方期刊数据库

Embedding prescribed-time adaptive control protocol unveiling distributed consensus in multirobot systems via directed topology

在线全文

学校读者我要写书评

暂无评论

science China(Information sciences) 2025年第2期68卷 383-384页

作者： Yonghao XIE Xinru MA Hengyu LI Shaorong XIE school of computer engineering and science Shanghai University school of Mechatronic engineering and Automation Shanghai University

Recently, multirobot systems(MRSs) have found extensive applications across various domains, including industrial manufacturing, collaborative formation of unmanned equipment, emergency disaster relief, and war scenarios [1]. These advancements are largely supported by the development of consistency control theory. However, traditional dynamicsfree models may cause instability in complex robotic systems. Lagrangian dynamics offers a better approach for modeling these systems, as it facilitates controller design and optimization analysis. Despite this, challenges persist with unknown parameters and nonlinear friction within the systems.

关键词： Microrobots

同方期刊数据库

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

Edge-aware Feature Aggregation Network for Polyp Segmentation

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Machine Intelligence Research 2025年第1期22卷 101-116页

作者： Tao Zhou Yizhe Zhang Geng Chen Yi Zhou Ye Wu Deng-Ping Fan PCA Lab Key Laboratory of Intelligent Perception and Systems for High-dimensional Information of Ministry of EducationSchool of Computer Science and EngineeringNanjing University of Science and TechnologyNanjing210094China school of computer science and engineering Northwestern Polytechnical University(NPU)Xi’an710129China school of computer science and engineering Southeast UniversityNanjing211189China computer Vision Lab ETH ZürichZürich8092Switzerland

Precise polyp segmentation is vital for the early diagnosis and prevention of colorectal cancer(CRC)in clinical ***,due to scale variation and blurry polyp boundaries,it is still a challenging task to achieve satisfactory segmentation performance with different scales and *** this study,we present a novel edge-aware feature aggregation network(EFA-Net)for polyp segmentation,which can fully make use of cross-level and multi-scale features to enhance the performance of polyp ***,we first present an edge-aware guidance module(EGM)to combine the low-level features with the high-level features to learn an edge-enhanced feature,which is incorporated into each decoder unit using a layer-by-layer ***,a scale-aware convolution module(SCM)is proposed to learn scale-aware features by using dilated convolutions with different ratios,in order to effectively deal with scale ***,a cross-level fusion module(CFM)is proposed to effectively integrate the cross-level features,which can exploit the local and global contextual ***,the outputs of CFMs are adaptively weighted by using the learned edge-aware feature,which are then used to produce multiple side-out segmentation *** results on five widely adopted colonoscopy datasets show that our EFA-Net outperforms state-of-the-art polyp segmentation methods in terms of generalization and *** implementation code and segmentation maps will be publicly at https://***/taozh2017/EFANet.

关键词： Colorectal cancer polyp segmentation edge-aware guidance module scale-aware convolution module cross-level fusion module

When Software Security Meets Large Language Models:A Survey

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

IEEE/CAA Journal of Automatica Sinica 2025年第2期12卷 317-334页

作者： Xiaogang Zhu Wei Zhou Qing-Long Han Wanlun Ma Sheng Wen Yang Xiang IEEE the school of computer and Mathematical sciences the University of Adelaide the school of science Computing and Engineering Technologies Swinburne University of Technology

Software security poses substantial risks to our society because software has become part of our life. Numerous techniques have been proposed to resolve or mitigate the impact of software security issues. Among them, software testing and analysis are two of the critical methods, which significantly benefit from the advancements in deep learning technologies. Due to the successful use of deep learning in software security, recently,researchers have explored the potential of using large language models(LLMs) in this area. In this paper, we systematically review the results focusing on LLMs in software security. We analyze the topics of fuzzing, unit test, program repair, bug reproduction, data-driven bug detection, and bug triage. We deconstruct these techniques into several stages and analyze how LLMs can be used in the stages. We also discuss the future directions of using LLMs in software security, including the future directions for the existing use of LLMs and extensions from conventional deep learning research.

关键词： Large language models (LLMs) software analysis software security software testing

Optimizing local search-based partial MaxSAT solving via initial assignment prediction

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

science China(Information sciences) 2025年第2期68卷 59-73页

作者： Chanjuan LIU Guangyuan LIU Chuan LUO Shaowei CAI Zhendong LEI Wenjie ZHANG Yi CHU Guojing ZHANG school of computer science and Technology Dalian University of Technology school of Software Beihang University Institute of Software Chinese Academy of Sciences school of computer science Peking University

Partial maximum satisfiability(PMS) is a significant generalization of Boolean satisfiability(SAT) and maximum satisfiability(MaxSAT), by introducing hard clauses and soft clauses. Compared with SAT and MaxSAT, the PMS problem has more real-world applications where both hard and soft constraints are involved. Local search is an effective incomplete method for solving PMS and is useful for important domains where good-quality solutions are desired within reasonable *** local search PMS solvers, the approach for initial assignment generation is crucial because its effectiveness significantly affects practical performance. In this study, we propose a novel initial assignment prediction approach, called InitPMS. When predicting an assignment for PMS, InitPMS considers the specific structure of PMS instances, i.e., distinguishing hard and soft clauses. Our experiments on extensive PMS instances from MaxSAT evaluations(MSEs) 2020 and 2021 show that InitPMS significantly boosts the performance of five state-of-the-art local search PMS solvers, demonstrating its generality. In addition,our results indicate that incorporating InitPMS could improve the performance of one of the best incomplete PMS solvers in MaxSAT Evaluation 2021, indicating that InitPMS might help advance the state of the art in PMS solving.

关键词： MaxSAT local search initial assignment incomplete method assignment prediction