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

Generalized Fourier Transform Pair Codes

IEEE Communications Letters 2025年第5期29卷 933-937页

作者： Lv, Yaping Cai, Suihua Ma, Xiao Sun Yat-sen University School of Computer Science and Engineering Guangdong Key Laboratory of Information Security Technology MoE Key Laboratory of Information Technology Guangzhou510006 China

This letter is concerned with Fourier transform pair (FTP) codes over finite fields. Given any element of order n in a finite field, we can construct an FTP code with length 2n , dimension n, and minimum distance at least 2√n. Distinguishingly, an FTP code defined with any element (if it exists) of order 2, 3 or 5 in a finite field is a maximum distance separable code. In this letter, we extend the FTP codes to generalized FTP (GFTP) codes. To show the superiority of the GFTP codes over the FTP codes, we compute the binary weight spectra of the GFTP codes, approaching more close than the FTP codes to that of the random codes. We also apply the ordered statistic decoding with local constraints (LC-OSD) algorithm to the binary image of GFTP codes. Numerical results show that the GFTP codes perform better than the FTP codes as the code length increases. Numerical results also show that GFTP codes are comparable with existing codes of the same code rate and similar code length. © 1997-2012 IEEE.

关键词： Binary images

来源：评论

学校读者我要写书评

暂无评论

RoPe-Door: Toward Robust and Persistent Backdoor Data Poisoning Attacks in Federated Learning

引用

IEEE Network 2025年第3期39卷 302-310页

作者： Liu, Ye Chang, Shan Li, Denghui Shi, Shaohuai Li, Bo Jiangxi Normal University School of Computer and Information Engineering Nanchang330022 China Donghua University School of Computer Science and Technology Shanghai201620 China Harbin Institute of Technology School of Computer Science and Technology Shenzhen518057 China The Hong Kong University of Science and Technology Department of Computer Science and Engineering Sai Kung Hong Kong

Federated Learning (FL) enables privacy-preserving collaborative training and builds a federation through exchanges of immutable data such as model parameters or gradient updates. FL remains vulnerable to a variety of attacks during critical processes like local model training and parameter transmission, in which the backdoor attack is particularly evident. In this paper, we propose a novel backdoor data poisoning attack method, RoPe-Door, using a trigger generation algorithm to improve the robustness and persistence of attacks even under Byzantine aggregation methods. We conduct extensive experiments on four image classification tasks to evaluate the effectiveness of RoPe-Door. The experimental results demonstrate that, compared to backdoor attacks using random triggers, RoPe-Door exhibits significant advantages in robustness, persistence, and attack effectiveness under both IID and Non-IID data settings. © 1986-2012 IEEE.

关键词： Federated learning

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Chinese Medical Named Entity Recognition Using Pre-Trained Language Models and an Efficient Global Pointer Mechanism

Informatica (Slovenia)

引用

Informatica (Slovenia) 2025年第19期49卷 97-114页

作者： Zhang, Xu Li, Feihong Li, Chenlong Yu, Xufeng College of Software Engineering Xiamen University of Technology Xiamen361000 China College of Computer and Information Engineering Xiamen University of Technology Xiamen361000 China

Medical Named Entity Recognition (MNER) is a critical task in medical text mining, serving as a foundation for intelligent diagnosis, disease prediction, and related tasks. However, Chinese medical texts present unique challenges, such as diverse entity classifications, varying entity lengths, and complex entity nesting, which hinder NER performance. To address these issues, we propose a Chinese MNER method leveraging pre-trained models and the efficient global pointer (EGP). Our approach incorporates three key innovations: (1) data augmentation techniques, including easy data augmentation and remote supervision with a medical entity dictionary, to address imbalanced entity types distribution and varying entity lengths;(2) a character-word fusion strategy that integrates RoBERTa-generated character vectors and Word2Vec-generated word vectors, enhancing semantic representation;and (3) an improved decoding layer based on EGP, enabling efficient recognition of both nested and flat entities while reducing computational costs. Experimentals show that our method achieves F1 scores of 75.87% and 92.77% on the CMeEE-V2 and CCKS2020 datasets, respectively, outperforming the RoBERTa-BiLSTM-CRF baseline by 3.06% and 4.38%, respectively. © 2025 Slovene Society Informatika. All rights reserved.

关键词： data augmentation EGP MNER RoBERTa Word2Vec

来源：评论

学校读者我要写书评

暂无评论

An ensemble approach for classification of diabetic retinopathy in fundus image

引用

Multimedia Tools and Applications 2025年第12期84卷 10567-10586页

作者： Prakash, J. Vinoth kumar, B. Department of Computer Science & Engineering PSG College of Technology Tamil Nadu Coimbatore India Department of Information Technology PSG College of Technology Tamil Nadu Coimbatore India

Diabetes-oriented diabetic retinopathy impacts the blood vessels in the region of the retina to enlarge and leak blood and other fluids. In most cases, diabetic retinopathy affects both eyes. If left untreated, it would eventually lead to blindness. Diabetic Retinopathy is so widespread that around 93 million adults are affected by it on a worldwide scale. Early identification and treatment would reduce the danger of serious diabetic retinopathy visual impairment. To achieve early detection, we can make use of our advancement in image processing to diagnose how severely the patient is affected by diabetic retinopathy. Using a patient’s fundus image and modern deep learning methods, we will be able to classify the result into five categories of severity: unaffected, severe, mild, moderate, and proliferate. Based on the results, the doctor would be able to determine what type of treatment is required to further avoid vision loss. The strategy outlined in this work is to employ five well-known deep learning models, namely Inception ResNet V2, VGG19, Xception, ResNet50, DenseNet112, and integrate their outcomes successfully utilizing ensemble learning. The experimentation outcome displays that the proposed approach classifies all the classes of Diabetic Retinopathy and performs better compared to other methods with a Specificity of 92.02%. © The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature 2024.

关键词： Blood vessels

来源：评论

学校读者我要写书评

暂无评论

A Survey of Distributed Algorithms for Aggregative Games

引用

IEEE/CAA Journal of Automatica Sinica 2025年第5期12卷 859-871页

作者： Li, Huaqing Li, Jun Ran, Liang Zheng, Lifeng Huang, Tingwen College of Electronic and Information Engineering Southwest University Chongqing Key Laboratory of Nonlinear Circuits and Intelligent Information Processing Chongqing400715 China College of Computer Science and Engineering Chongqing University of Technology Chongqing400054 China School of Computer Science and Control Engineering Shenzhen University of Advanced Technology Shenzhen518107 China

Game theory-based models and design tools have gained substantial prominence for controlling and optimizing behavior within distributed engineering systems due to the inherent distribution of decisions among individuals. In non-cooperative settings, aggregative games serve as a mathematical framework model for the interdependent optimal decision-making problem among a group of non-cooperative players. In such scenarios, each player's decision is influenced by an aggregation of all players' decisions. Nash equilibrium (NE) seeking in aggregative games has emerged as a vibrant topic driven by applications that harness the aggregation property. This paper presents a comprehensive overview of the current research on aggregative games with a focus on communication topology. A systematic classification is conducted on distributed algorithm research based on communication topologies such as undirected networks, directed networks, and time-varying networks. Furthermore, it sorts out the challenges and compares the algorithms' convergence performance. It also delves into real-world applications of distributed optimization techniques grounded in aggregative games. Finally, it proposes several challenges that can guide future research directions. © 2014 Chinese Association of Automation.

关键词： Nash equilibrium

来源：评论

学校读者我要写书评

暂无评论

Few-Shot Referring Video Single- and Multi-Object Segmentation Via Cross-Modal Affinity with Instance Sequence Matching

引用

International Journal of computer Vision 2025年 1-19页

作者： Liu, Heng Li, Guanghui Gao, Mingqi Zhen, Xiantong Zheng, Feng Wang, Yang School of Computer Science and Technology Anhui University of Technology Maxiang Road Ma’anshan243032 China Department of Computer Science and Engineering Southern University of Science and Technology Xueyuan Avenue Shenzhen518055 China School of Computer Science and Information Engineering Hefei University of Technology Feicui Road Hefei230601 China

Referring Video Object Segmentation (RVOS) aims to segment specific objects in videos based on the provided natural language descriptions. As a new supervised visual learning task, achieving RVOS for a given scene requires a substantial amount of annotated data. However, only minimal annotations are usually available for new scenes in realistic scenarios. Another practical problem is that, apart from a single object, multiple objects of the same category coexist in the same scene. Both of these issues may significantly reduce the performance of existing RVOS methods in handling real-world applications. In this paper, we propose a simple yet effective model to address these issues by incorporating a newly designed cross-modal affinity (CMA) module based on a Transformer architecture. The CMA module facilitates the establishment of multi-modal affinity over a limited number of samples, allowing the rapid acquisition of new semantic information while fostering the model’s adaptability to diverse scenarios. Furthermore, we extend our FS-RVOS approach to multiple objects through a new instance sequence matching module over CMA, which filters out all object trajectories with similarity to language features that exceed a matching threshold, thereby achieving few-shot referring multi-object segmentation (FS-RVMOS). To foster research in this field, we establish a new dataset based on currently available datasets, which covers many scenarios in terms of single-object and multi-object data, hence effectively simulating real-world scenes. Extensive experiments and comparative analyses underscore the exceptional performance of our proposed FS-RVOS and FS-RVMOS methods. Our method consistently outperforms existing related approaches through practical performance evaluations and robustness studies, achieving optimal performance on metrics across diverse benchmark tests. © The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature 2025.

关键词： Modal analysis

来源：评论

学校读者我要写书评

暂无评论

Enhanced Multi-Scale Object Detection Algorithm for Foggy Traffic Scenarios

引用

computers, Materials & Continua 2025年第2期82卷 2451-2474页

作者： Honglin Wang Zitong Shi Cheng Zhu School of Artificial Intelligence Nanjing University of Information Science and TechnologyNanjing210044China School of Computer Science Nanjing University of Information Science and TechnologyNanjing210044China School of Electrical&Computer Engineering University of Illinois at Urbana ChampaignUrbanaIL 61801USA

In foggy traffic scenarios, existing object detection algorithms face challenges such as low detection accuracy, poor robustness, occlusion, missed detections, and false detections. To address this issue, a multi-scale object detection algorithm based on an improved YOLOv8 has been proposed. Firstly, a lightweight attention mechanism, Triplet Attention, is introduced to enhance the algorithm’s ability to extract multi-dimensional and multi-scale features, thereby improving the receptive capability of the feature maps. Secondly, the Diverse Branch Block (DBB) is integrated into the CSP Bottleneck with two Convolutions (C2F) module to strengthen the fusion of semantic information across different layers. Thirdly, a new decoupled detection head is proposed by redesigning the original network head based on the Diverse Branch Block module to improve detection accuracy and reduce missed and false detections. Finally, the Minimum Point Distance based Intersection-over-Union (MPDIoU) is used to replace the original YOLOv8 Complete Intersection-over-Union (CIoU) to accelerate the network’s training convergence. Comparative experiments and dehazing pre-processing tests were conducted on the RTTS and VOC-Fog datasets. Compared to the baseline YOLOv8 model, the improved algorithm achieved mean Average Precision (mAP) improvements of 4.6% and 3.8%, respectively. After defogging pre-processing, the mAP increased by 5.3% and 4.4%, respectively. The experimental results demonstrate that the improved algorithm exhibits high practicality and effectiveness in foggy traffic scenarios.

关键词： Deep learning object detection foggy scenes traffic detection YOLOv8

来源：评论

学校读者我要写书评

暂无评论

Improved employee bee algorithm for team formation

引用

Evolving Systems 2025年第2期16卷 1-20页

作者： Shingade, Sandip Niyogi, Rajdeep Shelke, Sushila Department of Computer Science and Engineering Indian Institute of Technology Roorkee Uttarakhand Roorkee247667 India Department of Computer Engineering and Information Technology Veermata Jijabai Technological Institute Matunga Maharashtra Mumbai400019 India Department of Computer Engineering Cummins College of Engineering for Women Karve Nagar Maharashtra Pune411052 India

Finding an appropriate subset of agents (a team) from a larger pool of agents (the source set) so that the team exhibits a desired quality is the essence of the team formation problem. This problem is recognized to have high computational complexity, classified as NP-hard. In order to reduce the state space, this research paper incorporates techniques including vertical and horizontal reductions, which convert data to binary representation. To simplify the data representation for analysis, these methods use vertical and horizontal reductions to convert data to binary format, generating a subgraph. With this, the Honeybee Optimization algorithm’s Employee Bee phase (EBP) swap operation characteristic is used to efficiently optimize team communication costs by making it easier to determine a team with a minimum communication costs (MCC). The proposed approach is assessed using two well-known real-world data sets, the ACM data set and the DBLP data set, demonstrating an improvement of 79% in the ACM dataset and 68% in the DBLP dataset compared to existing literature approaches like Improved Jaya Modified Swap Operation, Improved Grey Wolf Optimization, and State Space Reduction Techniques for Team Formation. This highlights the significant positive impact of state space reduction techniques combined with the IEB on team performance, particularly enhancing communication efficiency and overall team effectiveness, as measured by MCC metrics. © The Author(s), under exclusive licence to Springer-Verlag GmbH Germany, part of Springer Nature 2025.

关键词： NP-hard

来源：评论

学校读者我要写书评

暂无评论

UAV-Assisted Zero Knowledge Model Proof for Generative AI: A Multiagent Deep Reinforcement Learning Approach

引用

IEEE Internet of Things Journal 2025年第10期12卷 13441-13454页

作者： Hao, Min Shang, Chen Wang, Siming Jiang, Wenchao Nie, Jiangtian Information Systems Technology and Design Singapore University of Technology and Design 487372 Singapore School of Computer Science and Engineering Nanyang Technological University 638788 Singapore

As more users seek generative AI (GAI) models to enhance work efficiency, GAI and Model-as-a-Service will drive transformative changes and upgrades across all industries. However, when users utilize GAI models provided by the service provider, they cannot be certain that the model’s quality matches the provider’s claims. Considering the need to protect intellectual property, the service provider will not disclose model details for user verification. To this end, we take the Internet of Vehicles as research background, proposing a zero knowledge model proof architecture based on UAVs. We also introduce a multiagent reinforcement learning algorithm to optimize the verification process. In specific, we first propose a verification scheme for the key operations of generative adversarial networks based on noninteractive zero knowledge proof. The zero knowledge proof architecture ensures that model parameters cannot be stolen during the verification process. After that, we propose an Age of Verification (AoV) metric to ensure the timeliness and freshness of zero knowledge proof. We also construct a tradeoff optimization problem between the energy consumption of UAV as a verifier and the AoV of edge servers as service providers, and transform the problem based on Lyapunov optimization theory. Following that, we propose an enhanced multiagent proximal policy optimization algorithm to enable the collaborative verification of edge servers by multiple UAVs. The algorithm simulation results demonstrate that the reward value of our proposed algorithm is over 10% higher than that of the standard algorithm, with a faster and more stable overall convergence speed. Additionally, the zero knowledge proof performance test results indicate that the verification delay in our proposed architecture is less than 500 ms during the verification phase, meeting practical requirements. © 2014 IEEE.

关键词： Generative adversarial networks

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：