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

IEEE Annual Joint Conference: INFOCOM, IEEE computer and Communications Societies

作者： Luying Zhong Yueyang Pi Zheyi Chen Zhengxin Yu Wang Miao Xing Chen Geyong Min College of Computer and Data Science Fuzhou University China Fujian Provincial Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou University China Engineering Research Center of Big Data Intelligence Ministry of Education China School of Computing and Communications University of Lancaster UK School of Engineering Computing and Mathematics University of Plymouth UK Department of Computer Science University of Exeter UK

ISBN: (数字)9798350383508

ISBN: (纸本)9798350383515

Federated Graph Learning (FGL) has garnered widespread attention by enabling collaborative training on multiple clients for semi-supervised classification tasks. However, most existing FGL studies do not well consider the missing inter-client topology information in real-world scenarios, causing insufficient feature aggregation of multi-hop neighbor clients during model training. Moreover, the classic FGL commonly adopts the FedAvg but neglects the high training costs when the number of clients expands, resulting in the overload of a single edge server. To address these important challenges, we propose a novel FGL framework, named SpreadFGL, to promote the information flow in edge-client collaboration and extract more generalized potential relationships between clients. In SpreadFGL, an adaptive graph imputation generator incorporated with a versatile assessor is first designed to exploit the potential links between subgraphs, without sharing raw data. Next, a new negative sampling mechanism is developed to make SpreadFGL concentrate on more refined information in downstream tasks. To facilitate load balancing at the edge layer, SpreadFGL follows a distributed training manner that enables fast model convergence. Using real-world testbed and benchmark graph datasets, extensive experiments demonstrate the effectiveness of the proposed SpreadFGL. The results show that SpreadFGL achieves higher accuracy and faster convergence against state-of-the-art algorithms.

关键词： Training Accuracy Collaboration Benchmark testing Imputation Generators Topology

来源：评论

学校读者我要写书评

暂无评论

AP-S Young Professionals Activities at the 2022 IEEE International Symposium on Antennas and Propagation

AP-S Young Professionals Activities at the 2022 IEEE Interna...

引用

作者： Khan, Mahrukh Lin, Wei Quimby, Jeanne Department of Electrical and Computer Engineering College of New Jersey EwingNJ08628 United States Global Big Data Technologies Center University of Technology Sydney UltimoNSW2007 Australia Communication Technology Laboratory National Institute of Standards and Technology BoulderCO80305 United States

来源：评论

学校读者我要写书评

暂无评论

Quantum Fourier Transform of Atrial Fibrillation

Quantum Fourier Transform of Atrial Fibrillation

引用

Quantum Computing and engineering (QCE), IEEE International Conference on

作者： Yu-Ching Chen Chih-Yu Chen Tsung-Wei Huang Chia-Ho Ou Master Program in Intelligent Computing and Big Data Chung Yuan Christian University Taoyuan Taiwan Quantum Information Center Chung Yuan Christian University Taoyuan Taiwan Department of Computer Science and Information Engineering National Pingtung University Pingtung Taiwan

ISBN: (数字)9798331541378

ISBN: (纸本)9798331541385

Electrocardiograms (ECGs) are crucial for detecting cardiac diseases like atrial fibrillation (AF). Traditional analysis methods like fast Fourier transform (FFT) face challenges with increasing data complexity. This study uses Taipei Veterans General Hospital data to explore quantum Fourier transform (QFT) for ECG analysis. Results show that QFT effectively analyzes ECG signals, matching FFT performance while benefiting from quantum computing's efficiency.

关键词： Heart Quantum computing Fast Fourier transforms Hospitals High performance computing Atrial fibrillation Machine learning Electrocardiography Real-time systems Signal analysis

来源：评论

学校读者我要写书评

暂无评论

Hashgraph-Based Model Parameter Management for Reliable and Secure Deep Learning

Hashgraph-Based Model Parameter Management for Reliable and ...

引用

IEEE International Conference on Consumer Electronics (ICCE)

作者： Eunsung Roh Jinheock Choi Younghoon Park Seung-Woo Seo Big Data Research Center for New Value Creation Sookmyung Women's University Seoul South Korea Department of Electric Engineering Seoul National University Seoul South Korea Division of Computer Science Sookmyung Women's University Seoul South Korea

ISBN: (数字)9798331521165

ISBN: (纸本)9798331521172

Deep learning networks have rapidly developed across various fields, with several high-performing models already being applied in real-world applications. However, even with identical network architectures, variations in parameter values can lead to significantly different outputs, making the security of these parameters crucial for maintaining network performance. Despite their importance, limited research has focused on securing deep learning network parameters. In recent years, distributed ledger technologies, such as blockchain and hashgraph, have been extensively studied. Their applications extend beyond cryptocurrencies to include public services, voting, supply chains, and insurance. This paper proposes a novel approach to enhancing the security of deep learning network parameters by leveraging Hedera Hashgraph, providing a more secure foundation for their deployment and commercialization. With the security offered by hashgraph, model parameters are safely stored, ensuring the reliability and trustworthiness of deep learning systems. Additionally, when these stored parameters are used for further training, such as in transfer learning, the results are expected to be reliable. We demonstrate that our proposed system secures the parameters effectively, guaranteeing both security and reliability in deep learning.

关键词： Deep learning Training Transfer learning Supply chains Insurance Network architecture Security Reliability History Software development management

来源：评论

学校读者我要写书评

暂无评论

Robin: A Novel Method to Produce Robust Interpreters for Deep Learning-Based Code Classifiers

Robin: A Novel Method to Produce Robust Interpreters for Dee...

引用

IEEE International Conference on Automated Software engineering (ASE)

作者： Zhen Li Ruqian Zhang Deqing Zou Ning Wang Yating Li Shouhuai Xu Chen Chen Hai Jin School of Cyber Science and Engineering Huazhong University of Science and Technology Wuhan China Services Computing Technology and System Lab Hubei Key Laboratory of Distributed System Security Cluster and Grid Computing Lab National Engineering Research Center for Big Data Technology and System Hubei Engineering Research Center on Big Data Security Department of Computer Science University of Colorado Colorado Springs USA Center for Research in Computer Vision University of Central Florida USA School of Computer Science and Technology Huazhong University of Science and Technology Wuhan China

Deep learning has been widely used in source code classification tasks, such as code classification according to their functionalities, code authorship attribution, and vulnerability detection. Unfortunately, the black-box nature of deep learning makes it hard to interpret and understand why a classifier (i.e., classification model) makes a particular prediction on a given example. This lack of interpretability (or explainability) might have hindered their adoption by practitioners because it is not clear when they should or should not trust a classifier's prediction. The lack of interpretability has motivated a number of studies in recent years. However, existing methods are neither robust nor able to cope with out-of-distribution examples. In this paper, we propose a novel method to produce Robust interpreters for a given deep learning-based code classifier; the method is dubbed Robin. The key idea behind Robin is a novel hybrid structure combining an interpreter and two approximators, while leveraging the ideas of adversarial training and data augmentation. Experimental results show that on average the interpreter produced by Robin achieves a 6.11% higher fidelity (evaluated on the classifier), 67.22% higher fidelity (evaluated on the approximator), and 15.87x higher robustness than that of the three existing interpreters we evaluated. Moreover, the interpreter is 47.31% less affected by out-of-distribution examples than that of LEMNA.

关键词：

来源：评论

学校读者我要写书评

暂无评论

CT perfusion parameter estimation in stroke using neural network with transformer and physical model priors

引用

computers in Biology and Medicine 2024年 182卷 109134-109134页

作者： Luo, Luyao Liu, Pan Ye, Wanxing Chen, Fengwei Liu, Yu Liu, Ziyang Jing, Jing Xiong, Yunyun Zhu, Wanlin Jiang, Yong Cheng, Jian Wang, Yongjun Liu, Tao Beijing Advanced Innovation Center for Biomedical Engineering School of Biological Science and Medical Engineering Beihang University Beijing China Medical Big Data Research Center Chinese PLA General Hospital Beijing China China National Clinical Research Center for Neurological Diseases Beijing China Department of Neurology Beijing Tiantan Hospital Capital Medical University Beijing China School of Computer Science and Engineering Beihang University Beijing China

Objectives: CT perfusion (CTP) imaging is vital in treating acute ischemic stroke by identifying salvageable tissue and the infarcted core. CTP images allow quantitative estimation of CT perfusion parameters, which can provide information on the degree of tissue hypoperfusion and its salvage potential. Traditional methods for estimating perfusion parameters, such as singular value decomposition (SVD) and its variations, are known to be sensitive to noise and inaccuracies in the arterial input function. To our knowledge, there has been no implementation of deep learning methods for CT perfusion parameter estimation. Materials & methods: In this work, we propose a deep learning method based on the Transformer model, named CTPerformer-Net, for CT perfusion parameter estimation. In addition, our method incorporates some physical priors. We integrate physical consistency prior, smoothness prior and the physical model prior through the design of the loss function. We also generate a simulation dataset based on physical model prior for training the network model. Results: In the simulation dataset, CTPerformer-Net exhibits a 23.4 % increase in correlation coefficients, a 95.2 % decrease in system error, and a 90.7 % reduction in random error when contrasted with block-circulant SVD. CTPerformer-Net successfully identifies hypoperfused and infarcted lesions in 103 real CTP images from the ISLES 2018 challenge dataset. It achieves a mean dice score of 0.36 for the infarct core segmentation, which is slightly higher than the commercially available software (dice coefficient: 0.34) used as a reference level by the challenge. Conclusion: Experimental results on the simulation dataset demonstrate that CTPerformer-Net achieves better performance compared to block-circulant SVD. The real-world patient dataset confirms the validity of CTPerformer-Net. © 2024 Elsevier Ltd

关键词： Image segmentation

来源：评论

学校读者我要写书评

暂无评论

Fast-Convergent and Communication-Alleviated Heterogeneous Hierarchical Federated Learning in Autonomous Driving

引用

IEEE Transactions on Intelligent Transportation Systems 2025年

作者： Kou, Wei-Bin Lin, Qingfeng Tang, Ming Ye, Rongguang Wang, Shuai Zhu, Guangxu Wu, Yik-Chung The University of Hong Kong Department of Electrical and Electronic Engineering Hong Kong Hong Kong Southern University of Science and Technology Department of Computer Science and Engineering Shenzhen518055 China Chinese Academy of Sciences Shenzhen Institute of Advanced Technology Shenzhen518055 China Shenzhen International Center for Industrial and Applied Mathematics Shenzhen Research Institute of Big Data Shenzhen518172 China

Street Scene Semantic Understanding (denoted as TriSU) is a complex task for autonomous driving (AD). However, inference model trained from data in a particular geographical region faces poor generalization when applied in other regions due to inter-city data domain-shift. Hierarchical Federated Learning (HFL) offers a potential solution for improving TriSU model generalization by collaborative privacy-preserving training over distributed datasets from different cities. Unfortunately, it suffers from slow convergence because the data from different cities are with disparate statistical properties. Going beyond existing HFL methods, we propose a Gaussian heterogeneous HFL algorithm (FedGau) to address inter-city data heterogeneity so that convergence can be accelerated. In the proposed FedGau algorithm, both single RGB image and RGB dataset are modelled as Gaussian distributions for aggregation weight design. This approach not only differentiates each RGB image by respective statistical distribution, but also exploits the statistics of dataset from each city in addition to the conventionally considered data volume. With the proposed approach, the convergence is accelerated by 35.5%-40.6% compared to existing state-of-the-art (SOTA) HFL methods. On the other hand, to reduce the involved communication resource, we further introduce a novel performance-aware adaptive resource scheduling (AdapRS) policy. Unlike the traditional static resource scheduling policy that exchanges a fixed number of models between two adjacent aggregations, AdapRS adjusts the number of model aggregation at different levels of HFL so that unnecessary communications are minimized. Extensive experiments demonstrate that AdapRS saves 29.65% communication overhead compared to conventional static resource scheduling policy while maintaining almost the same performance. © 2000-2011 IEEE.

关键词： Gaussian distribution

来源：评论

学校读者我要写书评

暂无评论

Hashgraph-Based Model Parameter Management for Reliable and Secure Deep Learning

Hashgraph-Based Model Parameter Management for Reliable and ...

引用

2025 IEEE International Conference on Consumer Electronics, ICCE 2025

作者： Roh, Eunsung Choi, Jinheock Park, Younghoon Seo, Seung-Woo Big Data Research Center for New Value Creation Sookmyung Women's University Seoul Korea Republic of Department of Electric Engineering Seoul National University Seoul Korea Republic of Division of Computer Science Sookmyung Women's University Seoul Korea Republic of

ISBN: (纸本)9798331521165

关键词： Deep learning

来源：评论

学校读者我要写书评

暂无评论

CLDG: Contrastive Learning on Dynamic Graphs

CLDG: Contrastive Learning on Dynamic Graphs

引用

International Conference on data engineering

作者： Yiming Xu Bin Shi Teng Ma Bo Dong Haoyi Zhou Qinghua Zheng Department of Computer Science and Technology Xi’an Jiaotong University China Shaanxi Provincial Key Laboratory of Big Data Knowledge Engineering Xi’an Jiaotong University China Department of Distance Education Xi’an Jiaotong University China School of Software Beihang University China Advanced Innovation Center for Big Data and Brain Computing Beihang University China

The graph with complex annotations is the most potent data type, whose constantly evolving motivates further exploration of the unsupervised dynamic graph representation. One of the representative paradigms is graph contrastive learning. It constructs self-supervised signals by maximizing the mutual information between the statistic graph’s augmentation views. However, the semantics and labels may change within the augmentation process, causing a significant performance drop in downstream tasks. This drawback becomes greatly magnified on dynamic graphs. To address this problem, we designed a simple yet effective framework named CLDG. Firstly, we elaborate that dynamic graphs have temporal translation invariance at different levels. Then, we proposed a sampling layer to extract the temporally-persistent signals. It will encourage the node to maintain consistent local and global representations, i.e., temporal translation invariance under the timespan views. The extensive experiments demonstrate the effectiveness and efficiency of the method on seven datasets by outperforming eight unsupervised state-of-the-art baselines and showing competitiveness against four semi-supervised methods. Compared with the existing dynamic graph method, the number of model parameters and training time is reduced by an average of 2,001.86 times and 130.31 times on seven datasets, respectively. The code and data are available at: https://***/yimingxu24/CLDG.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Genetic Auto-prompt Learning for Pre-trained Code Intelligence Language Models

arXiv

引用

arXiv 2024年

作者： Feng, Chengzhe Sun, Yanan Li, Ke Zhou, Pan Lv, Jiancheng Lu, Aojun The College of Computer Science Sichuan University Chengdu610065 China The Department of Computer Science University of Exeter ExeterEX4 4QF United Kingdom The Hubei Engineering Research Center on Big Data Security School of Cyber Science and Engineering Huazhong University of Science and Technology Wuhan430074 China

As Pre-trained Language Models (PLMs), a popular approach for code intelligence, continue to grow in size, the computational cost of their usage has become prohibitively expensive. Prompt learning, a recent development in the field of natural language processing, emerges as a potential solution to address this challenge. In this paper, we investigate the effectiveness of prompt learning in code intelligence tasks. We unveil its reliance on manually designed prompts, which often require significant human effort and expertise. Moreover, we discover existing automatic prompt design methods are very limited to code intelligence tasks due to factors including gradient dependence, high computational demands, and limited applicability. To effectively address both issues, we propose Genetic Auto Prompt (GenAP), which utilizes an elaborate genetic algorithm to automatically design prompts. With GenAP, non-experts can effortlessly generate superior prompts compared to meticulously manual-designed ones. GenAP operates without the need for gradients or additional computational costs, rendering it gradient-free and cost-effective. Moreover, GenAP supports both understanding and generation types of code intelligence tasks, exhibiting great applicability. We conduct GenAP on three popular code intelligence PLMs with three canonical code intelligence tasks including defect prediction, code summarization, and code translation. The results suggest that GenAP can effectively automate the process of designing prompts. Specifically, GenAP outperforms all other methods across all three tasks (e.g. improving accuracy by an average of 2.13% for defect prediction). To the best of our knowledge, GenAP is the first work to automatically design prompts for code intelligence PLMs. Copyright © 2024, The Authors. All rights reserved.

关键词： Design

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：