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

Accelerating Blockchain-Enabled Federated Learning with Clustered Clients

IEEE Transactions on Big Data 2024年 1-14页

作者： Cui, Laizhong Li, Yinghao Zhou, Yipeng Qu, Youyang Liu, Jiangchuan College of Computer Science and Software Engineering Shenzhen University Shenzhen China School of Computing FSE Macquarie University Macquare Park NSW Australia Data61 CSIRO VIC Australia School of Computing Science Simon Fraser University Burnaby BC Canada

With the rapid development of big data, Federated learning (FL) has found numerous applications, enabling machine learning (ML) on edge devices while preserving privacy. However, FL still faces crucial challenges, such as single point of failure and poisoning attacks, which motivate the integration of blockchain-enabled FL (BeFL). Beyond that, the efficiency issue still limits the further application of BeFL. To address these issues, we propose a novel decentralized framework: Accelerating Blockchain-Enabled Federated Learning with Clustered Clients (ABFLCC), who utilize actual training time for clustering clients to achieve hierarchical FL and solve the single point of failure problem through blockchain. Additionally, the framework clusters edge devices considering their actual training times, which allows for synchronous FL within clusters and asynchronous FL across clusters simultaneously. This approach guarantees that devices with a similar training time have a consistent global model version, improving the stability of the converging process, while the asynchronous learning between clusters enhances the efficiency of convergence. The proposed framework is evaluated through simulations on three real-world public datasets, demonstrating a training efficiency improvement of 30% to 70% in terms of convergence time compared to existing BeFL systems. IEEE

关键词： Big data

来源：评论

学校读者我要写书评

暂无评论

Structural Invariant Feature Segmentation Based Apple Fruit Disease Detection Using Deep Spectral Generative Adversarial Networks

引用

SN computer science 2024年第5期5卷 1-11页

作者： Subha, V. Kasturi, K. Department of Computer Science School of Computing Sciences Vels Institute of Science Technology and Advanced Studies Tamilnadu Chennai India

In Indian economy agriculture, Crop cultivation plays an important role in the fruit production agricultural sector. At present, crop loss is primarily due to infested crops, resulting in reduced production rates for affecting various diseases. Manual monitoring of the disease is very difficult to analyze the type. It requires a huge amount of work, expertise, and excessive processing *** tackle this problem, we introduce Deep Spectral Generative Adversarial Networks (DSGANs) algorithm to categorize the apple disease. Initially, the preprocessing was carried out through Median and Gabor Filters to enhance the frequency of the Image. Then the boundary regions are adaptively filtered with a canny edge detector. This supports the exact boundary regions of the object to get the affected region. The color variance and the contours are different from the affected and non-effected regions. To optimize this, the Self-Adaptive Plateau Histogram Equalization (SAPHE) technique is applied to find the difference between affected and non-affected regions. Modified Gabor kernels are applied to choose the invariance of the affected region which supports segmentation using Invariant Sliding Window Segmentation (ISWS). This makes optimized segmentation by extracting the features in the affected boundary region. By intent, a ReLu activation for Logical decision to activate the logical decision depends on max successive threshold weights from convoluted margins. The non-linearity substitutive feature margins are extracted to enhance the performance of the output to process the adaptive GAN output layers. Finally, the classification part uses the DSGANs. The gated features get the marginal threshold values based on the feature extraction weights to get trained into classifier layers. This iteratively verifies the feature margins on affected regions get trained in Deep SpectralGenerative Adversarial Networks (DSGANs). © The Author(s), under exclusive licence to Springer Nature Singap

关键词： Apple disease Boundary region Classification Histogram Pre-processing Segmentation Segmentation

来源：评论

学校读者我要写书评

暂无评论

Predictive Modelling of Rice Blast Disease Utilizing Ensemble Voting Classifiers in Machine Learning 8

Predictive Modelling of Rice Blast Disease Utilizing Ensembl...

引用

8th International Conference on Inventive Systems and Control, ICISC 202

作者： Revathi, A. Poonguzhali, S. School of Computing Sciences Department of Computer Science Tamil Nadu Chennai India

ISBN: (纸本)9798350386578

Rice is the second-most significant cereal plant, next to wheat, and the most commonly cultivated staple food in India. Rice production has declined in recent years due to the spread of several rice diseases, changes in weather conditions, and soil quality. Rice blast, also known as RB, is the most devastating of all rice plant diseases and causes a vast amount of annual loss. The key challenge is to minimize crop loss due to rice blast disease while also increasing agricultural output. It is critical to predict the disease ahead of time so that the required safeguards can be taken. As manual prediction of rice blast disease requires a huge amount of labor and time, it is a must to implement an automated system using machine learning (ML) techniques, which are widely used artificial intelligence (AI) methods for prediction models. In the proposed system, the sample data set of 15,400 has been fed as an input to the ML algorithms via Nïve Bayes, random forest, KNN, and voting classifiers for prediction. The results show that the ensemble method of combining the machine learning algorithm-based prediction technique offers improved accuracy than the random forest algorithm, with an accuracy of 99.5%. The proposed methodology will greatly benefit agriculturalists with increased profits and safeguard food for the country. © 2024 IEEE.

关键词： Agriculture Artificial Intelligence Disease Prediction Machine Learning Supervised Learning

来源：评论

学校读者我要写书评

暂无评论

A Privacy Preservation Method for Attributed Social Network Based on Negative Representation of Information

引用

computer Modeling in Engineering & sciences 2024年第7期140卷 1045-1075页

作者： Hao Jiang Yuerong Liao Dongdong Zhao Wenjian Luo Xingyi Zhang Key Laboratory of Intelligent Computing and Signal Processing of Ministry of Education School of Computer Science and TechnologyAnhui UniversityHefei230601China Chongqing Research Institute School of Computer Science and Artificial IntelligenceWuhan University of TechnologyWuhan430070China Guangdong Provincial Key Laboratory of Novel Security Intelligence Technologies School of Computer Science and TechnologyHarbin Institute of TechnologyShenzhen518055China

Due to the presence of a large amount of personal sensitive information in social networks,privacy preservation issues in social networks have attracted the attention of many *** by the self-nonself discrimination paradigmin the biological immune system,the negative representation of information indicates features such as simplicity and efficiency,which is very suitable for preserving social network ***,we suggest a method to preserve the topology privacy and node attribute privacy of attribute social networks,called ***,a negative survey-based method is developed to disturb the relationship between nodes in the social network so that the topology structure can be kept ***,a negative database-based method is proposed to hide node attributes,so that the privacy of node attributes can be preserved while supporting the similarity estimation between different node attributes,which is crucial to the analysis of social *** evaluate the performance of the AttNetNRI,empirical studies have been conducted on various attribute social networks and compared with several state-of-the-art methods tailored to preserve the privacy of social *** experimental results show the superiority of the developed method in preserving the privacy of attribute social networks and demonstrate the effectiveness of the topology disturbing and attribute hiding *** experimental results show the superiority of the developed methods in preserving the privacy of attribute social networks and demonstrate the effectiveness of the topological interference and attribute-hiding components.

关键词： Attributed social network topology privacy node attribute privacy negative representation of information negative survey negative database

来源：评论

学校读者我要写书评

暂无评论

Model-Heterogeneous Federated Graph Learning With Prototype Propagation

IEEE Transactions on Artificial Intelligence

引用

IEEE Transactions on Artificial Intelligence 2025年第3期6卷 676-689页

作者： Liu, Zhi Zhou, Hanlin He, Xiaohua Yuan, Haopeng Du, Jiaxin Wang, Mengmeng Shen, Guojiang Kong, Xiangjie Xia, Feng Zhejiang University of Technology College of Computer Science & Technology Hangzhou310023 China RMIT University School of Computing Technologies MelbourneVIC3000 Australia

Federated graph learning (FGL) enables clients to collaboratively train a robust graph neural network (GNN) while ensuring their private graph data never leaves the local. However, existing FGL frameworks require all clients to train the identical GNN model, which limits their real-world applicability. Although many model-heterogenous frameworks have been proposed for traditional nongraph federated learning settings, directly transferring them to the FGL setting typically results in suboptimal performance. To fill the gap, this article presents federated prototype propagation network (FedPPN), a lightweight FGL framework that supports clients to train fully customized models. FedPPN only transmits prototypes between clients and the server for knowledge sharing. The core idea is propagating global prototypes on each client's local graph, generating prototype-based node representations and predictions. The prototype-based prediction can then be ensembled with the prediction of local GNN, allowing clients to achieve accurate prediction. We evaluate our FedPPN on six benchmark datasets with different heterogeneous model setups. Experimental results show that our FedPPN outperforms advanced baselines in model accuracy without adding any trainable parameters on clients or the server. Besides, FedPPN's communication cost is significantly lower than methods that rely on model parameter exchange. © 2024 IEEE.

关键词： Federated learning

来源：评论

学校读者我要写书评

暂无评论

Characterization of Exact One-Query Quantum Algorithms for Partial Boolean Functions

引用

Journal of computer science & Technology 2023年第6期38卷 1423-1430页

作者：叶泽坤李绿周 Institute of Quantum Computing and Computer Theory School of Computer Science and EngineeringSun Yat-sen UniversityGuangzhou 510006China Ministry of Education Key Laboratory of Machine Intelligence and Advanced Computing Sun Yat-sen UniversityGuangzhou 510006China

The query model(or black-box model)has attracted much attention from the communities of both classical and quantum ***,quantum advantages are revealed by presenting a quantum algorithm that has a better query complexity than its classical *** the history of quantum algorithms,the Deutsch algorithm and the Deutsch-Jozsa algorithm play a fundamental role and both are exact one-query quantum *** leads us to con-sider the problem:what functions can be computed by exact one-query quantum algorithms?This problem has been ad-dressed in the literature for total Boolean functions and symmetric partial Boolean functions,but is still open for general partial Boolean ***,in this paper,we continue to characterize the computational power of exact one-query quantum algorithms for general partial Boolean ***,we present several necessary and sufficient conditions for a partial Boolean function to be computed by exact one-query quantum ***,inspired by these conditions,we discover some new representative functions that can be computed by exact one-query quantum algorithms but have an essential difference from the already known ***,it is worth pointing out that before our work,the known func-tions that can be computed by exact one-query quantum algorithms are all symmetric functions and the quantum algo-rithm used is essentially the Deutsch-Jozsa algorithm,whereas the functions discovered in this paper are generally asym-metric and new algorithms to compute these functions are ***,this expands the class of functions that can be computed by exact one-query quantum algorithms.

关键词： quantum computing quantum query complexity quantum algorithm

来源：评论

学校读者我要写书评

暂无评论

P3DC:Reducing DRAM Cache Hit Latency by Hybrid Mappings

引用

Journal of computer science & Technology 2024年第6期39卷 1341-1360页

作者： Ye Chi Ren-Tong Guo Xiao-Fei Liao Hai-Kun Liu Jianhui Yue National Engineering Research Center for Big Data Technology and System Wuhan 430074China Services Computing Technology and System Laboratory Wuhan 430074China Cluster and Grid Computing Laboratory Wuhan 430074China School of Computer Science and Technology Huazhong University of Science and TechnologyWuhan 430074China School of Big Data and Internet Shenzhen Technology UniversityShenzhen 518118China Department of Computer Science Michigan Technological UniversityHoughton 49931-1295U.S.A.

Die-stacked dynamic random access memory(DRAM)caches are increasingly advocated to bridge the performance gap between the on-chip cache and the main *** fully realize their potential,it is essential to improve DRAM cache hit rate and lower its cache hit *** order to take advantage of the high hit-rate of set-association and the low hit latency of direct-mapping at the same time,we propose a partial direct-mapped die-stacked DRAM cache called *** design is motivated by a key observation,i.e.,applying a unified mapping policy to different types of blocks cannot achieve a high cache hit rate and low hit latency *** address this problem,P3DC classifies data blocks into leading blocks and following blocks,and places them at static positions and dynamic positions,respectively,in a unified set-associative *** also propose a replacement policy to balance the miss penalty and the temporal locality of different *** addition,P3DC provides a policy to mitigate cache thrashing due to block type *** results demonstrate that P3DC can reduce the cache hit latency by 20.5%while achieving a similar cache hit rate compared with typical set-associative caches.P3DC improves the instructions per cycle(IPC)by up to 66%(12%on average)compared with the state-of-the-art direct-mapped cache—BEAR,and by up to 19%(6%on average)compared with the tag-data decoupled set-associative cache—DEC-A8.

关键词： die-stacked dynamic random access memory(DRAM) cache set-associative direct-mapped hit latency

来源：评论

学校读者我要写书评

暂无评论

Denoising Graph Inference Network for Document-Level Relation Extraction

引用

Big Data Mining and Analytics 2023年第2期6卷 248-262页

作者： Hailin Wang Ke Qin Guiduo Duan Guangchun Luo School of Computer Science and Engineering University of Electronic Science and Technology of ChinaChengdu 611731China School of Computing and Artificial Intelligence Southwestern University of Finance and EconomicsChengdu 611130China

Relation Extraction(RE)is to obtain a predefined relation type of two entities mentioned in a piece of text,e.g.,a sentence-level or a document-level *** existing studies suffer from the noise in the text,and necessary pruning is of great *** conventional sentence-level RE task addresses this issue by a denoising method using the shortest dependency path to build a long-range semantic dependency between entity ***,this kind of denoising method is scarce in document-level *** this work,we explicitly model a denoised document-level graph based on linguistic knowledge to capture various long-range semantic dependencies among *** first formalize a Syntactic Dependency Tree forest(SDT-forest)by introducing the syntax and discourse dependency ***,the Steiner tree algorithm extracts a mention-level denoised graph,Steiner Graph(SG),removing linguistically irrelevant words from the *** then devise a slide residual attention to highlight word-level evidence on text and ***,the classification is established on the SG to infer the relations of entity *** conduct extensive experiments on three public *** results evidence that our method is beneficial to establish long-range semantic dependency and can improve the classification performance with longer texts.

关键词： Relation Eextraction(RE) document-level denoising linguistic knowledge attention mechanism

来源：评论

学校读者我要写书评

暂无评论

A Reinforcement Learning Based Approach to Partition Testing

引用

计算机科学技术学报（英文版） 2025年第1期40卷 99-118页

作者：孙昌爱肖明俊代贺鹏刘淮 1School of Computer and Communication Engineering University of Science and Technology Beijing Beijing 100083 China 2Department of Computing Technologies Swinburne University of Technology Hawthorn VIC 3122 Australia

Partition testing is one of the most fundamental and popularly used software testing *** first di-vides the input domain of the program under test into a set of disjoint partitions,and then creates test cases based on these *** by the theory of software cybernetics,some strategies have been proposed to dynamically se-lect partitions based on the feedback information gained during *** basic intuition of these strategies is to assign higher probabilities to those partitions with higher fault-detection potentials,which are judged and updated mainly ac-cording to the previous test *** a feedback-driven mechanism can be considered as a learning process—it makes decisions based on the observations acquired in the test ***,advanced learning techniques could be leveraged to empower the smart partition selection,with the purpose of further improving the effectiveness and efficiency of partition *** this paper,we particularly leverage reinforcement learning to enhance the state-of-the-art adaptive partition testing *** algorithms,namely RLAPT_Q and RLAPT_S,have been developed to implement the proposed *** studies have been conducted to evaluate the performance of the proposed approach based on seven object programs with 26 *** experimental results show that our approach outperforms the existing partition testing techniques in terms of the fault-detection capability as well as the overall testing *** study demonstrates the applicability and effectiveness of reinforcement learning in advancing the performance of software testing.

关键词： partition testing reinforcement learning temporal-difference learning intelligent software engineering

来源：评论

学校读者我要写书评

暂无评论

Code Reviewer Intelligent Prediction in Open Source Industrial Software Project

引用

computer Modeling in Engineering & sciences 2023年第10期137卷 687-704页

作者： Zhifang Liao Bolin Zhang Xuechun Huang Song Yu Yan Zhang School of Computer Science and Engineering Central South UniversityChangsha410083China Department of Computing School of ComputingEngineering and Built EnvironmentGlasgow Caledonian UniversityGlasgowG40BAUK

Currently, open-source software is gradually being integrated into industrial software, while industry protocolsin industrial software are also gradually transferred to open-source community development. Industrial protocolstandardization organizations are confronted with fragmented and numerous code PR (Pull Request) and informalproposals, and differentworkflowswill lead to increased operating costs. The open-source community maintenanceteam needs software that is more intelligent to guide the identification and classification of these issues. To solvethe above problems, this paper proposes a PR review prediction model based on multi-dimensional features. Weextract 43 features of PR and divide them into five dimensions: contributor, reviewer, software project, PR, andsocial network of developers. The model integrates the above five-dimensional features, and a prediction model isbuilt based on a Random Forest Classifier to predict the review results of PR. On the other hand, to improve thequality of rejected PRs, we focus on problems raised in the review process and review comments of similar *** a PR revision recommendation model based on the PR review knowledge graph. Entity information andrelationships between entities are extracted from text and code information of PRs, historical review comments,and related issues. PR revisions will be recommended to code contributors by graph-based similarity *** experimental results illustrate that the above twomodels are effective and robust in PR review result predictionand PR revision recommendation.

关键词： Open source software pull request random forest knowledge graph

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：