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

SSRN 2023年

作者： Sun, Haichao Wang, Guoyin Liu, Qun Guo, Yike Chongqing Key Laboratory of Computational Intelligence Chongqing University of Posts and Telecommunications Chongqing400065 China Key Laboratory of Big Data Intelligent Computing Chongqing University of Posts and Telecommunications Chongqing400065 China Key Laboratory of Cyberspace Big Data Intelligent Security Ministry of Education Chongqing University of Posts and Telecommunications Chongqing400065 China Department of Computer Science and Engineering The Hong Kong University of Science and Technology 999077 Hong Kong School of Computer Engineering and Science Shanghai University Shanghai200444 China

Graph neural networks (GNNs) have gained significant attention and have been applied in various domain tasks. Currently, numerous pooling approaches have been proposed to aggregate node features and obtain node embeddings. However, current GNNs are almost black-box models that typically use a flat or single pooling step to aggregate nodes by only considering the similarity between nodes within the cluster. These approaches ignore the influence of relationships within and between clusters. To address this issue, we propose a novel multi-granular pooling method to aggregate nodes by simultaneously considering density and relationships among nodes and clusters. This method allows to obtain multi-granular node embedding clusters. The clusters in the current layer are built upon the previous layer, and these clusters change from fine to coarse as the number of clusters decreases, which is achieved by using multi-granular pooling (MgrPool for short). Additionally, the node representation of each layer is established through the ratio of node distance within clusters to that of between clusters. Finally, we conduct several experiments on node and graph classification tasks by this pooling approach. The results demonstrate that our GNN-MgrPool model outperforms the state-of-the-art similar algorithms and largely improves the interpretability of the learning process. © 2023, The Authors. All rights reserved.

关键词： Graph neural networks

来源：评论

学校读者我要写书评

暂无评论

Fast Coding Mode Prediction for Intra Prediction in VVC SCC

Fast Coding Mode Prediction for Intra Prediction in VVC SCC

引用

IEEE International Conference on Image Processing

作者： Dayong Wang Junyi Yu Xin Lu Frederic Dufaux Hongwei Guo Hui Guo Ce Zhu Chongqing Key Laboratory on Big Data for Bio Intelligence Chongqing University of Posts and Telecommunications Guangxi Key Laboratory of Machine Vision and Intelligent Control Wuzhou University Chongqing Key Laboratory of Image Cognition Chongqing University of Posts and Telecommunications Faculty of Computing Engineering and Media (CEM) De Montfort University Université Paris-Saclay CNRS CentraleSupélec Laboratoire des signaux et systèmes School of Engineering Honghe University Mengzi Yunnan China University of Electronic Science and Technology of China

ISBN: (数字)9798350349399

ISBN: (纸本)9798350349405

Currently, screen content video applications are increasingly widespread in our daily lives. The latest Screen Content Coding (SCC) standard, known as Versatile Video Coding (VVC) SCC, employs screen content Coding Modes (CMs) selection. While VVC SCC achieves high coding efficiency, its coding complexity poses a significant obstacle to the further widespread adoption of screen content video. Hence, it is crucial to enhance the coding speed of VVC SCC. In this paper, we propose a fast mode and splitting decision for Intra prediction in VVC SCC. Specifically, we initially exploit deep learning techniques to predict content types for all CUs. Subsequently, we examine CM distributions of different content types to predict candidate CMs for CUs. We then introduce early skip and early terminate CM decisions for different content types of CUs to further eliminate unlikely CMs. Finally, we develop Block-based Differential Pulse-Code Modulation (BDPCM) early termination to improve coding speed. Experimental results demonstrate that the proposed algorithm can improve coding speed by $34.95 \%$ on average while maintaining almost the same coding efficiency.

关键词： Video coding Deep learning Image coding Modulation Prediction algorithms Complexity theory Copper

来源：评论

学校读者我要写书评

暂无评论

FedLMT: tackling system heterogeneity of federated learning via low-rank model training with theoretical guarantees 24

FedLMT: tackling system heterogeneity of federated learning ...

引用

Proceedings of the 41st International Conference on Machine Learning

作者： Jiahao Liu Yipeng Zhou Di Wu Miao Hu Mohsen Guizani Quan Z. Sheng School of Computer Science and Engineering Sun Yat-sen University Guangzhou China and Guangdong Key Laboratory of Big Data Analysis and Processing Guangzhou China School of Computing Faculty of Science and Engineering Macquarie University Sydney Australia Mohamed bin Zayed University of Artificial Intelligence (MBZUAI) Abu Dhabi UAE

Federated learning (FL) is an emerging machine learning paradigm for preserving data privacy. However, diverse client hardware often has varying computation resources. Such system heterogeneity limits the participation of resource-constrained clients in FL, and hence degrades the global model accuracy. To enable heterogeneous clients to participate in and contribute to FL training, previous works tackle this problem by assigning customized sub-models to individual clients with model pruning, distillation, or low-rank based techniques. Unfortunately, the global model trained by these methods still encounters performance degradation due to heterogeneous sub-model aggregation. Besides, most methods are heuristic-based and lack convergence analysis. In this work, we propose the FedLMT framework to bridge the performance gap, by assigning clients with a homogeneous pre-factorized low-rank model to substantially reduce resource consumption without conducting heterogeneous aggregation. We theoretically prove that the convergence of the low-rank model can guarantee the convergence of the original full model. To further meet clients' personalized resource needs, we extend FedLMT to pFedLMT, by separating model parameters into common and custom ones. Finally, extensive experiments are conducted to verify our theoretical analysis and show that FedLMT and pFedLMT outperform other baselines with much less communication and computation costs.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Study on Improved YOLOv7-based Algorithm for Detecting Crack Defects in Ancient Buildings 24

Study on Improved YOLOv7-based Algorithm for Detecting Crack...

引用

3rd International Conference on Computer, Artificial Intelligence and Control engineering, CAICE 2024

作者： Fang, Tianke Hui, Zhenxing Rey, William P Xie, Zhiying Yang, Aihua He, Yuanrong School of Information Technology Mapua University Manila1200 Philippines Big Data Institute of Digital Natural Disaster Monitoring in Fujian Xiamen University of Technology Xiamen Fujian361024 China School of Computing and Information Engineering Xiamen University of Technology Xiamen Fujian361024 China School of Information Media Zhangzhou Vocational College of Science and Technology Zhangzhou Fujian363200 China Hunan Key Laboratory of Remote Sensing Monitoring of Ecological Environment Dongting Lake Area Changsha Hunan410004 China

ISBN: (纸本)9798400716942

In the protection and restoration work of ancient buildings, the detection and analysis of the cracks and defects of the exterior walls of ancient buildings is a crucial task. In this paper, an improved YOLOv7 algorithm is proposed to detect the defects of ancient external walls, aiming to achieve efficient and accurate detection of the defects of ancient external walls. The method involves preprocessing the image using a rectangle clipping algorithm, graying the image using the maximum method, and denoising the image with a median filter. Next, the image is labeled using the LabelImg tool, and the data is split into training, validation, and test sets. During model training, a CBAM-Net module is inserted after several CBS modules in the backbone network, the GIOU loss function is replaced by CIOU, and feature task extraction is performed. The realized attention mechanism is added to the Yolov7 model. The results show that the mAP value of crack detection after the improved algorithm reaches 81.2%. In contrast to the initial YOLOv7 algorithm, the precision of the model has been boosted to 87.2%, exhibiting a 6.0% enhancement in accuracy and an 85.2% improvement in recall rate. The improved YOLOv7 crack detection algorithm reduces network calculation and improves crack classification and recognition ability. This approach is crucial in safeguarding ancient buildings as it enables varying levels of maintenance depending on the severity of cracks. © 2024 ACM.

关键词： Attention mechanism Deep learning Defect detection Image processing YOLOv7

来源：评论

学校读者我要写书评

暂无评论

Fil-Cad: A Fault Detection Method for Iiot Based on Federated Incremental Learning with Class Accuracy Distillation

SSRN

引用

SSRN 2024年

作者： Liu, Yanhua Fang, Wenyu Huang, Wei Wang, Xiaofeng Zhao, Baokang Liu, Ximeng College of Computer and Data Science Fuzhou University Fuzhou350108 China Engineering Research Center of Big Data Intelligence Ministry of Education Fuzhou350108 China Fujian Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou University Fuzhou350108 China College of Computer National University of Defense Technology Changsha410073 China

Fault detection is a research topic attracting much attention in IIoT. However, the continuous accumulation and growth of IIoT data leads to the catastrophic forgetting problem in the fault detection model and data heterogeneity, which creates a bottleneck for the performance and generalization of federated learning in fault detection. To improve the fault detection performance of federated learning models in data incremental scenarios, we propose a federatedincremental-learning-based fault detection method for IIoT, namely FIL-CAD. Firstly, comparing the knowledge distillation, the accuracies of different data classes in the global and local models are chosen as the model lightweight learning features, and the loss function is weighted. Secondly, we introduce the concept of data learning depth. It computes different model weights in the aggregation based on their degrees of data sample learning and model training participation and obtains the global model through weighted aggregation. Additionally, FIL-CAD supports the combination of differential privacy to protect data privacy. The proposed method is compared with four benchmark methods on four datasets, which include CWRU and MFPT bearing datasets. Then, the experimental results show that FIL-CAD performs optimally in accuracy and F1-Score, and the average accuracy is improved by 1.32%-18.52%, demonstrating the superiority of FIL-CAD. © 2024, The Authors. All rights reserved.

关键词： Fault detection

来源：评论

学校读者我要写书评

暂无评论

Improved RUL prediction method of wind turbine gearbox bearings under strong noises

Improved RUL prediction method of wind turbine gearbox beari...

引用

Youth Academic Annual Conference of Chinese Association of Automation (YAC)

作者： Sheng Xiang Penghua Li Jie Hou Mamadsho Ilolov Jiwei Wang Deqi Huang Lirong Xie School of Automation& Key Laboratory of Intelligent Computing for Big Data Chongqing University of Posts and Telecommunications Chongqing China Center for Innovative Development of Science and New Technologies National Academy of Sciences of Tajikistan Dushanbe Tajikistan School of Electrical Engineering Xinjiang University Urumqi China

ISBN: (数字)9798350379228

ISBN: (纸本)9798350390780

As essential components within the wind turbine gearbox, bearings are critical, and forecasting their Remaining Useful Life (RUL) is paramount. To enhance the integration of current inputs with historical data in Recurrent Neural Network (RNN) models, the Mogrifier Long Short-Term Memory (LSTM) approach has been devised. It interacts with inputs and recurrent data in a predetermined fashion, marking its initial application in wind turbine gearbox bearing RUL prediction. Furthermore, the Relative Standard Deviation of Envelope Spectrum (RSDES), a reliable health indicator (HI) under high noise conditions, is introduced for precise evaluation of the gearbox bearing health. Consequently, a novel RUL prediction technique is introduced. Initially, RSDES from vibration data serves as HIs. Subsequently, utilizing these HIs, the Mogrifier LSTM predicts future HIs, and the bearing’s RUL is determined once the predicted HI surpasses the failure threshold. Empirical outcomes underscore the proposed method’s superiority over existing techniques in bearing RUL prediction.

关键词： Vibrations Recurrent neural networks Accuracy Noise data models Wind turbines Reliability

来源：评论

学校读者我要写书评

暂无评论

CLDG: Contrastive Learning on Dynamic Graphs

arXiv

引用

arXiv 2024年

作者： Xu, Yiming Shi, Bin Ma, Teng Dong, Bo Zhou, Haoyi Zheng, Qinghua 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. © 2024, CC BY.

关键词： Contrastive Learning

来源：评论

学校读者我要写书评

暂无评论

Social Internet of Tings Trust Management Based on Implicit Social Relationship 5th

Social Internet of Tings Trust Management Based on Implicit ...

引用

5th International Conference on Security and Privacy in New computing Environments, SPNCE 2022

作者： Zhang, Hongbin Fan, Fan Zhao, Dongmei Liu, Bin Wang, Yanxia Liu, Jian School of Information Science and Engineering Hebei University of Science and Technology Shijiazhuang050000 China Hebei Key Laboratory of Network and Information Security Hebei Normal University Hebei Shijiazhuang050024 China School of Economics and Management Hebei University of Science and Technology Shijiazhuang050000 China Research Center of Big Data and Social Computing Hebei University of Science Shijiazhuang China Hebei Geological Workers’ University Shijiazhuang050081 China

ISBN: (纸本)9783031306228

The "Social Internet of Things (SIoT)" is a combination of the Internet of Things (IoT) and social networks to form a new paradigm. The SIoT promotes the development of smart cities, smart transportation, and many other fields. In SIoT, the openness and mobility of objects are enhanced. However, this tends to lead to network data sparsity problems. By distinguishing explicit and implicit social relationships, we introduce an implicit social relationship-based trust management model (IRTM) for reliable service delivery in SIoT. IRTM establishes implicit social relationships among nodes by mining their latent characteristics and trust transitivity. It models SIoT by creating sub-networks for each social relationship as a way to fuse the impact of different types of social relationships on trust management. To address the problem of malicious attacks by malicious nodes in the network to protect their interests, it considers two metrics, node relationship strength, and recommendation reliability, to filter malicious recommendations. Experiments conducted in the presence of data sparsity and malicious objects show that IRTM can improve the accuracy and convergence of trust evaluation compared to other methods that ignore implicit social relationships when computing trust. In addition, our scheme can improve resistance to trust-related attacks. © 2023, ICST Institute for Computer Sciences, Social Informatics and Telecommunications engineering.

关键词： Internet of things

来源：评论

学校读者我要写书评

暂无评论

Realizing Emotional Interactions to Learn User Experience and Guide Energy Optimization for Mobile Architectures 22

Realizing Emotional Interactions to Learn User Experience an...

引用

Proceedings of the 55th Annual IEEE/ACM International Symposium on Microarchitecture

作者： Xueliang Li Zhuobin Shi Junyang Chen Yepang Liu National Engineering Laboratory for Big Data System Computing Technology Shenzhen University China College of Computer Science and Software Engineering Shenzhen University China Research Institute of Trustworthy Autonomous Systems Guangdong Provincial Key Laboratory of Brain-inspired Intelligent Computation and Department of Computer Science and Engineering Southern University of Science and Technology China

ISBN: (纸本)9781665462723

In the age of AI, mobile architectures such as smartphones are still "cold machines"; machines do not feel. If the architecture is able to feel users' feelings and runtime user experience (UX), it will accordingly adapt performance/energy to find the optimal system-operating state that consumes the least energy to satisfy users. In this paper, we will utilize users' facial expressions (FEs) to learn their runtime UX. We know that FEs are the natural and direct way for humans to convey their emotions and feelings. Our study reveals that FEs also reflect UX. Our research for the first time quantifies the link between FEs and UX. Leveraging this link, the architecture will be able to use the front camera to see FEs and feel users' UX. Based on UX, the architecture can appropriately provision computing resources. We propose Vi-energy system to realize the above idea. Our evaluation shows that Vi-energy reduces energy consumption by 52.9% at maximum and secures UX.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Ascl: Accelerating Semi-Supervised Learning Via Contrastive Learning

SSRN

引用

SSRN 2024年

作者： Liu, Haixiong Li, Zuoyong Wu, Jiawei Zeng, Kun Hu, Rong Zeng, Wei Fujian Provincial Key Laboratory of Big Data Mining and Applications School of Computer Science and Mathematics Fujian University of Technology Fuzhou350118 China Fujian Provincial Key Laboratory of Information Processing and Intelligent Control College of Computer and Data Science Minjiang University Fuzhou350121 China School of Intelligent Systems Engineering Shenzhen Campus of Sun Yat-sen University Guangdong Shenzhen518107 China The Key Laboratory of Cognitive Computing and Intelligent Information Processing of Fujian Education Institutions Wuyi University Wuyishan354300 China School of Physics and Mechanical and Electrical Engineering Longyan University Longyan364012 China

SSL(Semi-supervised learning) is widely used in machine learning, which leverages labeled and unlabeled data to improve model performance. SSL aims to optimize class mutual information, but noisy pseudo-labels introduce false class information due to the scarcity of labels. Therefore, these algorithms often need significant training time to refine pseudo-labels for performance improvement iteratively. To tackle this challenge, we propose a novel plug-and-play method named ASCL(Accelerating Semi-Supervised Learning via Contrastive Learning). This method combines contrastive learning with uncertainty-based selection for performance improvement and accelerates the convergence of SSL algorithms. Contrastive learning initially emphasizes the mutual information between samples as a means to decrease dependence on pseudo-labels. Subsequently, it gradually turns to maximizing the mutual information between classes, aligning with the objective of semi-supervised learning. Uncertainty-based selection provides a robust mechanism for acquiring pseudo-labels. The combination of the contrastive learning module and the uncertainty-based selection module forms a virtuous cycle to improve the performance of the proposed model. Extensive experiments demonstrate that ASCL outperforms state-of-the-art methods in terms of both convergence efficiency and performance. In the experimental scenario where only one label is assigned per class in the CIFAR-10 dataset, the application of ASCL to Pseudo-label, UDA (Unsupervised data Augmentation for Consistency Training), and Fixmatch benefits substantial improvements in classification accuracy. Specifically, the results demonstrate notable improvements in respect of 16.32%, 6.9%, and 24.43% when compared to the original outcomes. Moreover, the required training time is reduced by almost 50%. © 2024, The Authors. All rights reserved.

关键词： Image classification

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：