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

IEEE Conference on Global Communications (GLOBECOM)

作者： Nannan Zhang Yao Zhao Y. Neil Qu Bruce Gu Keshav Sood Longxiang Gao Shui Yu Key Laboratory of Computing Power Network and Information Security Ministry of Education Shandong Computer Science Center (National Supercomputer Center in Jinan) Qilu University of Technology (Shandong Academy of Sciences) Jinan China Shandong Provincial Key Laboratory of Computing Power Internet and Service Computing Shandong Fundamental Research Center for Computer Science Jinan China School of IT Deakin University VIC Australia School of Computer Science University of Technology Sydney NSW Australia

ISBN: (数字)9798350351255

ISBN: (纸本)9798350351262

Federated Learning (FL) is a distributed machine learning (ML) approach that enables multiple edge nodes to collaboratively train ML models by sharing model parameters, thus addressing privacy concerns. However, in highly distributed, dynamic, and volatile FL environments, the global model is vulnerable to various corruptions. For instance, edge nodes might falsely claim that the received global model is incomplete, or the channel that transmits the global model is untrustworthy. Effectively verifying the integrity of the global model poses a critical challenge. To tackle this issue, we introduce a method for verifying model integrity called Federated learning global Model Integrity Verification (FMIV). It leverages Merkle Hash Tree (MHT) to generate integrity proofs of the global model during verification. To improve security, we integrate random security codes during proof generation. FMIV is capable of verifying the global model updated by the central server and shared with untrusted edge nodes, while efficiently identifying the edge node caching the incomplete global model. Furthermore, we conduct theoretical analysis and extensive experiments to validate the performance of FMIV. Compared to the two state-of-the-art approaches, FMIV consistently exhibits a notable improvement in verification efficiency and effectiveness in detecting model corruption.

关键词： Analytical models Privacy Codes Federated learning Computational modeling Image edge detection Data integrity Data models security Servers

来源：评论

学校读者我要写书评

暂无评论

Unleashing the Power of Visual Foundation Models for Generalizable Semantic Segmentation 39

Unleashing the Power of Visual Foundation Models for General...

引用

39th Annual AAAI Conference on Artificial Intelligence, AAAI 2025

作者： Tang, PeiYuan Zhang, Xiaodong Yang, Chunze Yuan, Haoran Sun, Jun Shan, Danfeng Yang, Zijiang James School of Computer Science and Technology Xi’an Jiaotong University China School of Computer Science and Technology Xidian University China Shaanxi Key Laboratory of Network and System Security Xidian University China Synkrotron Inc. United States Singapore Management University Singapore University of Science and Technology of China China

ISBN: (纸本)157735897X

Deep learning models often suffer from performance degradation in unseen domains, posing a risk for safety-critical applications such as autonomous driving. To tackle this problem, recent studies have leveraged pre-trained Visual Foundation Models (VFMs) to enhance generalization. However, exsiting works mainly focus on designing intricate networks for VFMs, neglecting their inherent strong generalization potential. Moreover, these methods typically perform inference on low-resolution images. The loss of detail hinders accurate predictions in unseen domains, especially for small objects. In this paper, we argue that simply fine-tuning VFMs and leveraging high-resolution images unleash the power of VFMs for generalizable semantic segmentation. Therefore, we design a VFM-based segmentation network (VFMNet) that adapts VFMs to this task with minimal fine-tuning, preserving their generalizable knowledge. Then, to fully utilize high-resolution images, we train a Mask-guided Refinement network (MGRNet) to refine VFMNet’s predictions combining detailed image features. Furthermore, we adopt a two-stage coarse-to-fine inference approach. MGRNet is used to refine the low-confidence regions predicted by VFMNet to obtain fine-grained results. Extensive experiments demonstrate the effectiveness of our method, outperforming state-of-the-art methods by 3.3% on the average mIoU in synthetic-to-real domain generalization. Copyright © 2025, Association for the Advancement of Artificia Intelligence (***). All rights reserved.

关键词： Semantic Segmentation

来源：评论

学校读者我要写书评

暂无评论

Social-enhanced recommendation using graph-based contrastive learning 25

Social-enhanced recommendation using graph-based contrastive...

引用

25th IEEE International Conferences on High Performance computing and Communications, 9th International Conference on Data Science and Systems, 21st IEEE International Conference on Smart City and 9th IEEE International Conference on Dependability in Sensor, Cloud and Big Data Systems and Applications, HPCC/DSS/SmartCity/DependSys 2023

作者： Xue, Peng Gao, Qian Fan, Jun Qilu University of Technology Shandong Academy of Sciences Key Laboratory of Computing Power Network and Information Security Ministry of Education Shandong Computer Science Center Shandong Jinan250014 China Qilu University of Technology Shandong Academy of Sciences Shandong Engineering Research Center of Big Data Applied Technology Faculty of Computer Science and Technology Shandong Jinan250353 China Shandong Provincial Key Laboratory of Computer Networks Shandong Fundamental Research Center for Computer Science Shandong Jinan250014 China China Telecom Digital Intelligence Techonology Co Ltd Shandong Jinan250101 China

ISBN: (纸本)9798350330014

The social network-based recommendation model use social network information to mitigate data sparsity issues and improve the accuracy of recommendation models. However, In most social network-based recommendation algorithms, the social neighbors' contributions are difficult to distinguish from the central user's, neglecting hidden correlations in social infor-mation. In order to solve this problem, this paper presents a graph-based contrastive learning framework for social-enhanced recommendation (SoGCLR) that utilizes implicit social information captured by a new social relation attention mechanism, en-rich user representations, and improve model robustness through graph-based contrastive learning. Specifically, the paper captures the degree of contribution of each neighbor in the social graph to the central user through a social relation attention layer, thus obtaining hidden correlations in social information, and further integrates this with user information in the user-item interaction graph to enrich user representations. In addition, the paper incorporates graph-based contrastive learning into the recommendation task using cross-layer contrastive learning, calculating contrastive loss and mapping nodes with similar but different exposure rates to nearby regions to mitigate exposure bias issues. Results from Ciao and Epinions demonstrate that SoGCLR reduces RMSE and MAE by 1.33% to 1.84% compared with baseline models. © 2023 IEEE.

关键词： Recommender systems

来源：评论

学校读者我要写书评

暂无评论

Enhanced Practical Byzantine Fault Tolerance for Service Function Chain Deployment: Advancing Big Data Intelligence in Control Systems

引用

Computers, Materials and Continua 2025年第3期83卷 4393-4409页

作者： Peiying Zhang Yihong Yu Jing Liu Chong Lv Lizhuang Tan Yulin Zhang Qingdao Institute of Software College of Computer Science and Technology China University of Petroleum (East China) Qingdao 266580 China Shandong Key Laboratory of Intelligent Oil & Gas Industrial Software Qingdao 266580 China Library of Shanghai Lixin University of Accounting and Finance Shanghai 201209 China Key Laboratory of Computing Power Network and Information Security Ministry of Education Shandong Computer Science Center (National Supercomputer Center in Jinan) Qilu University of Technology (Shandong Academy of Sciences) Jinan 250014 China Shandong Provincial Key Laboratory of Computing Power Internet and Service Computing Shandong Fundamental Research Center for Computer Science Jinan 250014 China Key Laboratory of Ethnic Language Intelligent Analysis and Security Governance of MOE Minzu University of China Beijing 100081 China Key Laboratory of Intelligent Game Yangtze River Delta Research Institute of NPU Taicang 215400 China Key Laboratory of Education Informatization for Nationalities (Yunnan Normal University) Ministry of Education Kunming 650092 China

As Internet of Things (IoT) technologies continue to evolve at an unprecedented pace, intelligent big data control and information systems have become critical enablers for organizational digital transformation, facilitating data-driven decision making, fostering innovation ecosystems, and maintaining operational stability. In this study, we propose an advanced deployment algorithm for Service Function Chaining (SFC) that leverages an enhanced Practical Byzantine Fault Tolerance (PBFT) mechanism. The main goal is to tackle the issues of security and resource efficiency in SFC implementation across diverse network settings. By integrating blockchain technology and Deep Reinforcement Learning (DRL), our algorithm not only optimizes resource utilization and quality of service but also ensures robust security during SFC deployment. Specifically, the enhanced PBFT consensus mechanism (VRPBFT) significantly reduces consensus latency and improves Byzantine node detection through the introduction of a Verifiable Random Function (VRF) and a node reputation grading model. Experimental results demonstrate that compared to traditional PBFT, the proposed VRPBFT algorithm reduces consensus latency by approximately 30% and decreases the proportion of Byzantine nodes by 40% after 100 rounds of consensus. Furthermore, the DRL-based SFC deployment algorithm (SDRL) exhibits rapid convergence during training, with improvements in long-term average revenue, request acceptance rate, and revenue/cost ratio of 17%, 14.49%, and 20.35%, respectively, over existing algorithms. Additionally, the CPU resource utilization of the SDRL algorithm reaches up to 42%, which is 27.96% higher than other algorithms. These findings indicate that the proposed algorithm substantially enhances resource utilization efficiency, service quality, and security in SFC deployment.

关键词： Big data intelligent transformation heterogeneous networks service function chain blockchain deep reinforcement learning trusted deployment

来源：评论

学校读者我要写书评

暂无评论

LEGNN: A Label Ensemble Perspective for Training a Label-Noise-Resistant GNN with Reduced Complexity

arXiv

引用

arXiv 2024年

作者： Zhao, Rui Shi, Bin Liang, Zhiming Ruan, Jianfei Dong, Bo Lin, Lu School of Computer Science and Technology Xi'an Jiaotong University China Ministry of Education Key Laboratory of Intelligent Networks and Network Security China Shaanxi Province Key Laboratory of Big Data Knowledge Engineering China School of Distance Education Xi'an Jiaotong University China College of Information Sciences and Technology Penn State University United States

Graph Neural networks (GNNs) have been widely employed for semi-supervised node classification tasks on graphs. However, the performance of GNNs is significantly affected by label noise, that is, a small amount of incorrectly labeled nodes can substantially misguide model training. Mainstream solutions define node classification with label noise (NCLN) as a reliable labeling task, often introducing node similarity with quadratic computational complexity to more accurately assess label reliability. To this end, in this paper, we introduce the Label Ensemble Graph Neural network (LEGNN), a lower complexity method for robust GNNs training against label noise. LEGNN reframes NCLN as a label ensemble task, gathering informative multiple labels instead of constructing a single reliable label, avoiding high-complexity computations for reliability assessment. Specifically, LEGNN conducts a two-step process: bootstrapping neighboring contexts and robust learning with gathered multiple labels. In the former step, we apply random neighbor masks for each node and gather the predicted labels as a high-probability label set. This mitigates the impact of inaccurately labeled neighbors and diversifies the label set. In the latter step, we utilize a partial label learning based strategy to aggregate the high-probability label information for model training. Additionally, we symmetrically gather a low-probability label set to counteract potential noise from the bootstrapped high-probability label set. Extensive experiments on six datasets demonstrate that LEGNN achieves outstanding performance while ensuring efficiency. Moreover, it exhibits good scalability on dataset with over one hundred thousand nodes and one million edges. Copyright © 2024, The Authors. All rights reserved.

关键词： Graph neural networks

来源：评论

学校读者我要写书评

暂无评论

T-M Net: A Fusion Convolutional Neural network Method for Lung Aging Assessment

T-M Net: A Fusion Convolutional Neural Network Method for Lu...

引用

Medical Artificial Intelligence (MedAI), IEEE International Conference on

作者： Tangbin Tian Jingshan Pan Jing Ge Na Li Dexin Yu Liping Zuo Key Laboratory of Computing Power Network and Information Security Ministry of Education Shandong Computer Science Center (National Supercomputer Center in Jinan) Qilu University of Technology (Shandong Academy of Sciences) Jinan China Shandong Provincial Key Laboratory of Computing Power Internet and Service Computing Shandong Fundamental Research Center for Computer Science Jinan China Department of Radiology Qilu Hospital of Shandong University Jinan China

ISBN: (数字)9798350377613

ISBN: (纸本)9798350377620

As the population ages, the precise assessment of pulmonary senescence becomes essential for the diagnosis and management of chronic respiratory diseases. However, existing medical imaging analysis techniques encounter significant chal-lenges due to data scarcity, especially in the domain of lung CT imaging. This research proposes an innovative method for assessing lung aging in CT images-T-M Net. This method combines transfer learning and MS-CNN to improve the accuracy and efficiency of lung aging assessment in CT images. We employed a pretrained ResNet18 model, capitalizing on transfer learning to harness the insights from extensive datasets, thereby minimizing the computational demands of model training. Furthermore, a channel attention mechanism is integrated within the transfer learning framework to heighten the model's focus on critical pulmonary regions, thus augmenting its predictive accuracy and interpretability. To accommodate the distinctive characteristics of lung CTs, a MS CNN architecture was developed, capturing multi-dimensional information ranging from microscopic details to macroscopic structures through variously sized convolutional kernels. Testing on a lung CT dataset revealed that our approach surpasses traditional methods in accuracy and generalizability, underscoring its potential utility in the early diagnosis and effective treatment of pulmonary ailments.

关键词： Training Accuracy Attention mechanisms Lungs Computational modeling Computed tomography Transfer learning Aging Convolutional neural networks Load modeling

来源：评论

学校读者我要写书评

暂无评论

Age of Information Analysis for CR-NOMA Aided Uplink Systems with Randomly Arrived Packets

引用

IEEE Transactions on Communications 2024年

作者： Sun, Yanshi Ye, Yanglin Ding, Zhiguo Zhou, Momiao Liu, Lei Hefei University of Technology School of Computer Science and Information Engineering Hefei230009 China Khalifa University Department of Computer and Information Engineering Abu Dhabi United Arab Emirates Xi'an University of Posts and Telecommunications Shaanxi Key Laboratory of Information Communication Network and Security Xi'an710121 China

This paper studies the application of cognitive radio inspired non-orthogonal multiple access (CR-NOMA) to reduce age of information (AoI) for uplink transmission. In particular, a time division multiple access (TDMA) based legacy network is considered, where each user is allocated with a dedicated time slot to transmit its status update information. The CR-NOMA is implemented as an add-on to the TDMA legacy network, which enables each user to have more opportunities to transmit by sharing other user's time slots. A rigorous analytical framework is developed to obtain the expressions for AoIs achieved by CR-NOMA with and without re-transmission, by taking the randomness of the status update generating process into consideration. Numerical results are presented to verify the accuracy of the developed analysis. It is shown that the AoI can be significantly reduced by applying CR-NOMA compared to TDMA. Moreover, the use of re-transmission is helpful to reduce AoI, especially when the status arrival rate is low. © 1972-2012 IEEE.

关键词： Markov chains

来源：评论

学校读者我要写书评

暂无评论

Domain Connection based Unsupervised Domain Adaptation for Semantic Segmentation

Domain Connection based Unsupervised Domain Adaptation for S...

引用

International Conference on Acoustics, Speech, and Signal Processing (ICASSP)

作者： Chunze Yang Xiaodong Zhang Peiyuan Tang Haoran Yuan Haojie Xin Zijiang James Yang School of Computer Science and Technology Xi ’an Jiaotong University Xi’an China School of Computer Science and Technology Shaanxi Key Laboratory of Network and System Security Xidian University Xi’an China Technology R&D Department Synkrotron Inc. Hefei China School of Computer Science and Technology University of Science and Technology of China Hefei China

ISBN: (数字)9798350368741

ISBN: (纸本)9798350368758

Collecting and annotating data for semantic segmentation can end up costing a lot of time and energy. Unsupervised Domain Adaptation (UDA) for semantic segmentation allows models trained on certain source domain data (such as the GTA synthetic dataset) to be applied to certain target data (like the Cityscapes real dataset), significantly decreasing the requirement for target-domain manual pixel-level *** this paper, we suggest a cross-domain unified semantic segmentation network training framework, the Attention Distribution Adaptation network (ADAN). It (1) proposes the Content Consistency Transformation (CCT), which maps source domain data to an intermediate domain that has a data distribution that is comparable to that of the target domain, and (2) introduces the Attention Adaptation Module (AAM), which bolsters the synchronization of attention between the intermediate domain and the target domain. ADAN achieved unprecedented mIoUs of 77.2 and 68.8 on GTA→Cityscapes and Synthia→Cityscapes, respectively, corresponding to improvements of +1.3 and +0.6 over the state of the art.

关键词： Training Adaptation models Semantic segmentation Manuals Signal processing Data models Active appearance model Synchronization Speech processing Synthetic data

来源：评论

学校读者我要写书评

暂无评论

GNN-ASG: A Double Feature Selection-based Adversarial Sample Generation Method in Industrial Control System

GNN-ASG: A Double Feature Selection-based Adversarial Sample...

引用

International Conference on Computer Supported Cooperative Work in Design

作者： Lijuan Xu Zhiang Yao Dawei Zhao Xin Li Ministry of Education Shandong Computer Science Center (National Supercomputer Center in Jinan) Key Laboratory of Computing Power Network and Information Security Qilu University of Technology (Shandong Academy of Sciences) Jinan China Shandong Provincial Key Laboratory of Computer Networks Shandong Fundamental Research Center for Computer Science Jinan China

ISBN: (数字)9798350349184

ISBN: (纸本)9798350349191

Due to the unique constraints of industrial control data, industrial control adversarial sample attacks are particularly challenging. Existing methods strive to conduct adversarial sample attacks under the conditions of satisfying industrial control data constraints, however, the results are not ideal. Therefore, this study proposes a new adversarial sample generation method GNN-ASG based on double feature selection. GNN-ASG uses data constraints to ensure the rationality of generated data, and uses Graph Deviation network (GDN) and Autoencoder to improve the quality and versatility of adversarial samples. A new adversarial sample evaluation metrics Adversarial Sample Attack Impact Rate (ASAIR) is proposed to address the problem that existing evaluation metrics are difficult to accurately judge the effectiveness of adversarial sample attacks. This method considers the principle and application environment of adversarial samples, and fully demonstrates the practical effect of adversarial samples. In a comprehensive experiment conducted on three public datasets, GNN-ASG achieves an impressive ASAIR of 21.83%, higher than existing methods of 13.94%. This paper demonstrates the versatility and effectiveness of GNN-ASG by comparing its performance with three state-of-the-art adversarial sample generation methods on four anomaly detection models. GNN-ASG can maximally reduce the F1-Score of the detection model by 0.7605.

关键词： Measurement Federated learning Industrial control Feature extraction Anomaly detection Glass box

来源：评论

学校读者我要写书评

暂无评论

A Triangular Stable Node network based on Self-supervised Learning for personalized prediction

A Triangular Stable Node Network based on Self-supervised Le...

引用

International Conference on Acoustics, Speech, and Signal Processing (ICASSP)

作者： Qing Liu Qian Gao Jun Fan Zhiqiang Zhang Key Laboratory of Computing Power Network and Information Security Ministry of Education Shandong Computer Science Center (National Supercomputer Center in Jinan) Qilu University of Technology (Shandong Academy of Sciences) Jinan China Shandong Engineering Research Center of Big Data Applied Technology Faculty of Computer Science and Technology Qilu University of Technology (Shandong Academy of Sciences) Jinan China Shandong Provincial Key Laboratory of Industrial Network and Information System Security Shandong Fundamental Research Center for Computer Science Jinan China China Telecom Digital Intelligence Techonology Co Ltd Jinan China

ISBN: (数字)9798350368741

ISBN: (纸本)9798350368758

In recent years, research has illuminated the potency of implicit data processing in enhancing user preferences. Nevertheless, barriers remain in breaking through the constraints of implicit information. This study aims to bridge this gap by firstly constructing a triangular stable node network model, tailored to manage implicit information with precision. Recognizing the challenge of pinpointing novel structures within large-scale graphs, we propose SLTSNN— a triangular stable node network based on self-supervised learning for personalized prediction. SLTSNN innovates by maximizing mutual information between graph-level and patch-level representations, while augmenting graph representations through extended enhanced representations. Additionally, it incorporates triangular data associations and introduces a triangular allocation attention network, which emphasizes strongly correlated preference features among similar users. Furthermore, SLTSNN employs contrastive learning to maximize mutual information between graph vectors and hidden representations, distinguishing between high-order global and local representations. The model’s effectiveness in enhancing user preferences and capturing new graph structures is evidenced by its performance on hit rate and normalized discounted cumulative gain metrics across three datasets.

关键词： Measurement Bridges Contrastive learning Signal processing Data processing Vectors Space exploration Resource management Speech processing Mutual information

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：