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

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

来源：评论

学校读者我要写书评

暂无评论

Two kinds of average approximation accuracy

引用

CAAI Transactions on Intelligence Technology 2024年第2期9卷 481-490页

作者： Qingzhao Kong Wanting Wang Dongxiao Zhang Wenbin Zhang Department of Science Jimei UniversityXiamenChina Digital Fujian Big Data Modeling and Intelligent Computing Institute Jimei UniversityXiamenChina Department of Computer Science Michigan Technological UniversityHoughtonMichiganUSA

Rough set theory places great importance on approximation accuracy,which is used to gauge how well a rough set model describes a target ***,traditional approximation accuracy has limitations since it varies with changes in the target concept and cannot evaluate the overall descriptive ability of a rough set *** overcome this,two types of average approximation accuracy that objectively assess a rough set model’s ability to approximate all information granules is *** first is the relative average approximation accuracy,which is based on all sets in the universe and has several basic *** second is the absolute average approximation accuracy,which is based on undefinable sets and has yielded significant *** also explore the relationship between these two types of average approximation ***,the average approximation accuracy has practical applications in addressing missing attribute values in incomplete information tables.

关键词： rough sets rough set theory

来源：评论

学校读者我要写书评

暂无评论

Completed Feature Disentanglement Learning for Multimodal MRIs Analysis

引用

IEEE Journal of Biomedical and Health Informatics 2025年第6期29卷 4325-4334页

作者： Liu, Tianling Liu, Hongying Shang, Fanhua Yu, Lequan Han, Tong Wan, Liang Tianjin University College of Intelligence and Computing Tianjin China Medical School of Tianjin University Tianjin China The University of Hong Kong Department of Statistics and Actuarial Science School of Computing and Data Science Hong Kong Brain Medical Center of Tianjin University Huanhu Hospital Tianjin China

Multimodal MRIs play a crucial role in clinical diagnosis and treatment. Feature disentanglement (FD)-based methods, aiming at learning superior feature representations for multimodal data analysis, have achieved significant success in multimodal learning (MML). Typically, existing FD-based methods separate multimodal data into modality-shared and modality-specific features, and employ concatenation or attention mechanisms to integrate these features. However, our preliminary experiments indicate that these methods could lead to a loss of shared information among subsets of modalities when the inputs contain more than two modalities, and such information is critical for prediction accuracy. Furthermore, these methods do not adequately interpret the relationships between the decoupled features at the fusion stage. To address these limitations, we propose a novel Complete Feature Disentanglement (CFD) strategy that recovers the lost information during feature decoupling. Specifically, the CFD strategy not only identifies modality-shared and modality-specific features, but also decouples shared features among subsets of multimodal inputs, termed as modality-partial-shared features. We further introduce a new Dynamic Mixture-of-Experts Fusion (DMF) module that dynamically integrates these decoupled features, by explicitly learning the local-global relationships among the features. The effectiveness of our approach is validated through classification tasks on three multimodal MRI datasets. Extensive experimental results demonstrate that our approach outperforms other state-of-the-art MML methods with obvious margins, showcasing its superior performance. © 2025 IEEE.

关键词： Contrastive Learning

来源：评论

学校读者我要写书评

暂无评论

Big data analytics for privacy through ND-homomorphic encryption

引用

Journal of Control and Decision 2023年第1期10卷 64-71页

作者： S.Saravanan N.Poornima Department of CSE SRM Institute of Science and TechnologyChennaiIndia Department of Data Science and Business Systems School of ComputingSRM Institute of Science and TechnologyKattankulathurIndia

Rapidly rising the quantity of Big data is an opportunity to flout the privacy of people. Whenhigh processing capacity and massive storage are required for Big data, distributed networkshave been used. There are several people involved in these activities, the system may contributeto privacy infringements frameworks have been developed for the preservation of privacy atvarious levels (e.g. information age, information the executives and information preparing) asfor the existing pattern of huge information. We plan to frame this paper as a literature surveyof these classifications, including the Privacy Processes in Big data and the presentation of theAssociate Challenges. Homomorphic encryption is particularised aimed at solitary single actionon the ciphered information. Homomorphic enciphering is restrained to an honest operation onthe encoded data. The reference to encryption project fulfils many accurate trading operationson coded numerical data;therefore, it protects the written in code-sensible information evenmore.

关键词： Security and confidentiality vast statistics data encryption nondeterministic fully homomorphic encryption

来源：评论

学校读者我要写书评

暂无评论

Efficient allocation of independent gridlet on small, medium, and large grid

引用

Personal and Ubiquitous computing 2023年第3期27卷 1029-1037页

作者： Rajeswari, D. Ramamoorthy, S. Srinivasan, R. Department of Data Science and Business Systems School of Computing College of Engineering and Technology SRM Institute of Science and Technology Tamil Nadu Kattankulathur603203 India Department of Computing Technologies School of Computing College of Engineering and Technology SRM Institute of Science and Technology Tamil Nadu Kattankulathur603203 India

Gridlet allocation in a computational grid environment is a major research issue to obtain not only the efficient gridlet allocation technique but also the time needed to obtain the efficient allocation technique. Grid computing networks have various nodes to process user jobs. To achieve the high performance of computational grid, task scheduling is an important issue. The users who are using services of grid systems are more cautious about time to complete their job. Hence, this work concentrates on gridlet allocation method used for time reduction by a genetic algorithm with the MapReduce programming model for independent tasks in computational grid. In computational grid environment, multi-objective problem formulation minimization of makespan and flowtime is considered. In this proposed technique, fitness function formulation for makespan and flowtime has been formulated mathematically. The genetic algorithm with the MapReduce programming model is implemented using MapReduce written in Java and then combined with GridSim. The experimental outcome with regard to time needed, flowtime, and makespan clearly reveals that the genetic algorithm with the MapReduce model effectively optimizes time, makespan, and flowtime in computational grid environment. A comparative study of performance efficiency among genetic algorithm with the MapReduce and sequential genetic algorithm (SGA) and parallel genetic algorithm (PGA) depicts the usefulness of the model. The execution time achieved by GA with the MapReduce model in small grid is 10.48 s, medium grid is 18.76 s, and large grid is 33.73 s. © 2023, The Author(s), under exclusive licence to Springer-Verlag London Ltd., part of Springer Nature.

关键词： MapReduce

来源：评论

学校读者我要写书评

暂无评论

Media Power Measuring via Emotional Contagion

引用

Journal of Social computing 2024年第1期5卷 15-35页

作者： Xue Lin Hong Huang Zongya Li Hai Jin National Engineering Research Center for Big Data Technology and System Services Computing Technology and System LabCluster and Grid Computing LabSchool of Computer Science and TechnologyHuazhong University of Science and TechnologyWuhan 430074China School of Journalism Huazhong University of Science and TechnologyWuhan 430074China

Media power,the impact that media have on public opinion and perspectives,plays a significant role in maintaining internal stability,exerting external influence,and shaping international dynamics for nations/***,prior research has primarily concentrated on news content and reporting time,resulting in limitations in evaluating media *** more accurately assess media power,we use news content,news reporting time,and news emotion simultaneously to explore the emotional contagion between *** use emotional contagion to measure the mutual influence between media and regard the media with greater impact as having stronger media *** propose a framework called Measuring Media Power via Emotional Contagion(MMPEC)to capture emotional contagion among media,enabling a more accurate assessment of media power at the media and national/regional *** also interprets experimental results through correlation and causality analyses,ensuring *** analyses confirm the higher accuracy of MMPEC compared to other baseline models,as demonstrated in the context of COVID-19-related news,yielding compelling and interesting insights.

关键词： explainability media power emotional contagion

来源：评论

学校读者我要写书评

暂无评论

Reasoning with Trees: Faithful Question Answering over Knowledge Graph 31

Reasoning with Trees: Faithful Question Answering over Knowl...

引用

31st International Conference on Computational Linguistics, COLING 2025

作者： Shen, Tiesunlong Wang, Jin Zhang, Xuejie Cambria, Erik School of Information Science and Engineering Yunnan University Kunming China College of Computing and Data Science Nanyang Technological University Singapore

ISBN: (纸本)9798891761964

Recent advancements in large language models (LLMs) have shown remarkable progress in reasoning capabilities, yet they still face challenges in complex, multi-step reasoning tasks. This study introduces Reasoning with Trees (RwT), a novel framework that synergistically integrates LLMs with knowledge graphs (KGs) to enhance reasoning performance and interpretability. RwT reformulates knowledge graph question answering (KGQA) as a discrete decision-making problem, leveraging Monte Carlo Tree Search (MCTS) to iteratively refine reasoning paths. This approach mirrors human-like reasoning by dynamically integrating the LLM's internal knowledge with external KG information. We propose a real-data guided iteration technique to train an evaluation model that assesses action values, improving the efficiency of MCTS. Experimental results on two benchmark KGQA datasets demonstrate that RwT significantly outperforms existing state-of-the-art methods, with an average performance improvement of 9.81%. Notably, RwT achieves these improvements without requiring complete LLM retraining, offering a more efficient and adaptable approach to enhancing LLM reasoning capabilities. © 2025 Association for Computational Linguistics.

关键词： Knowledge graph

来源：评论

学校读者我要写书评

暂无评论

End-to-end Compilation is All FPGAs Need: A Unified Overlay-based FPGA Compiler for Deep Learning 25

End-to-end Compilation is All FPGAs Need: A Unified Overlay-...

引用

30th Asia and South Pacific Design Automation Conference, ASP-DAC 2025

作者： Qian, Kai Lu, Haodong Liu, Yinqiu Zhang, Zexu Wang, Kun School of Microelectronics Fudan University China College of Computing and Data Science Nanyang Technological University Singapore

ISBN: (纸本)9798400706356

Field-Programmable Gate Array (FPGA) has shown great application potential in deploying Neural Networks (NNs) due to the characteristics of programmability, low power consumption, etc. However, deploying NNs on FPGA is non-trivial because (1) Mainstream NNs pose significant FPGA architecture design challenges due to their large number of parameters, complex operations, and the need for data optimization, and (2) Supporting the deployment of different machine learning frameworks to FPGA requires significant manual effort, consuming a large amount of time. In this paper, we propose AutoCompiler, a unified compiler for mapping NNs to different FPGAs, along with overlay techniques to enable fast and efficient implementation. To the best of our knowledge, we are the first work to support both Deep Neural Networks (DNNs) and Transformer-based networks for overlay-based FPGA deployment. AutoCompiler comprises three integrated enablers: (1) Model Translator, built on top of a topology-based NNs representation, which can optimize the topology and data representation of the models from an algorithmic level based on different hardware configurations, e.g., DSP utilization, (2) Instruction Generator, which generates pipeline data streams according to various FPGA resource configurations by manipulating the instruction set at the upper level rapidly, and (3) End-to-end optimization, which moves as much of the computational processes as possible onto the FPGA chip and minimizes the interaction between CPU and FPGA. Extensive experiments on various Xilinx FPGAs show that AutoCompiler outperforms state-of-the-art overlay-based compiler by 1.2× - 1.35× and same-level GPUs by 1.15× - 1.59× for classic DNN models, and ViT inference, respectively. © 2025 Copyright is held by the owner/author(s). Publication rights licensed to ACM.

关键词： Program compilers

来源：评论

学校读者我要写书评

暂无评论

CRP: A Cluster-Based Routing Protocol for Lightweight Nodes in Payment Channel Networks

引用

IEEE Transactions on Network and Service Management 2025年第3期22卷 2663-2678页

作者： Chen, Jinghui Cai, Qingqing Sun, Gang Yu, Hongfang Niyato, Dusit University of Electronic Science and Technology of China Key Laboratory of Optical Fiber Sensing and Communications Ministry of Education Chengdu611731 China Nanyang Technological University College of Computing and Data Science Jurong West Singapore

Although blockchain empowers the IoT trading market and presents new development opportunities for IoT, scalability issues of blockchain limit its application in this area. Payment Channel Networks (PCNs) have emerged as a promising solution to address the scalability issues. With the help of routing protocols, two users can utilize payment channels to conduct off-chain transactions. However, most Payment Channel Network (PCN) routing protocols overlook the scalability of PCNs, resulting in substantial storage, communication, and computational overhead for lightweight nodes, such as IoT devices. Additionally, frequent utilization of a payment channel can quickly exhaust the channel’s balance, leading to congestion and causing subsequent payments to fail. Channel congestion restricts the throughput of PCNs, yet most PCN routing protocols lack designs for channel congestion control. In this paper, we propose a Cluster-based scalable and high-throughput Routing Protocol (CRP), to enhance the scalability and throughput of PCNs. CRP organizes PCNs into clusters to reduce the average routing table size, thereby alleviating users’ storage, communication, and computational overhead. Furthermore, CRP aims to minimize maximum channel congestion when selecting payment routes, thereby improving throughput. Extensive simulations demonstrate that CRP achieves high scalability and throughput compared to state-of-the-art PCN routing protocols. © 2004-2012 IEEE.

关键词： Scalability

来源：评论

学校读者我要写书评

暂无评论

Adaptive sail fish optimizer based optimized region selection for robust video steganography

引用

International Journal of Information Technology (Singapore) 2025年第4期17卷 2417-2427页

作者： Babu, J. Suresh Niranjana, G. Ramana, Kadiyala Department of Computing Science & Engineering School of Computing College of Engineering and Technology SRM Institute of Science and Technology Tamil Nadu Kattankulathur Chengalpattu India Department of Computing Technologies SRM Institute of Science and Technology Kattankulathur Chengalpattu India Department of Artificial Intelligence and Data Science Chaitanya Bharathi Institute of Technology (Autonomous) Hyderabad India

Securing data transmission in a digital era is a difficult one due to the broad application of the Internet, personal computers, and mobile phones for communication. Traditional video steganography techniques sometimes fail to identify the best pixels for encoding hidden data, resulting in lowerquality and robustness. To solve this issue, this article proposes an innovative steganography technique that improves the security and quality of data hiding. The proposed method takes cover video and secret images as input. The Structural Similarity Index Measurement (SSIM) first collects key frames from the input video. The adaptive sailfish optimizer (ASFO) is then used to find the best regions within these keyframes to insert the secret data in. To improve security, the discrete wavelet transform (DWT) is applied to the specified region, and the LL band is used for the hiding process. The secret image is encrypted by Adaptive elliptical curve cryptography (AECC) and transformed to binary bits, which then get embedded in the chosen band. This method leads to the construction of a stego-video. The extraction procedure is repeated using the same approach, which ensures secure and robust data transmission. Performance metrics, including PSNR, BER, NAE, TAF, and NC are analyzed to compare each method's efficacy. © Bharati Vidyapeeth's Institute of Computer Applications and Management 2025.

关键词： Adaptive elliptical curve cryptography And stego-video Discrete wavelet transform Structural similarity index measurement Video steganography

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：