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

arXiv 2025年

作者： You, Zhichao Dong, Xuewen Li, Shujun Liu, Ximeng Ma, Siqi Shen, Yulong School of Computer Science & Technology Xidian University China Shaanxi Key Laboratory of Network and System Security Xi’an China University of Kent Canterbury United Kingdom College of Computer and Data Science Fuzhou University Fuzhou China School of System and Computing University of New South Wales CanberraACT2612 Australia

Reconstruction attacks against federated learning (FL) aim to reconstruct users’ samples through users’ uploaded gradients. Local differential privacy (LDP) is regarded as an effective defense against various attacks, including sample reconstruction in FL, where gradients are clipped and perturbed. Existing attacks are ineffective in FL with LDP since clipped and perturbed gradients obliterate most sample information for reconstruction. Besides, existing attacks embed additional sample information into gradients to improve the attack effect and cause gradient expansion, leading to a more severe gradient clipping in FL with LDP. In this paper, we propose a sample reconstruction attack against LDP-based FL with any target models to reconstruct victims’ sensitive samples to illustrate that FL with LDP is not flawless. Considering gradient expansion in reconstruction attacks and noise in LDP, the core of the proposed attack is gradient compression and reconstructed sample denoising. For gradient compression, an inference structure based on sample characteristics is presented to reduce redundant gradients against LDP. For reconstructed sample denoising, we artificially introduce zero gradients to observe noise distribution and scale confidence interval to filter the noise. Theoretical proof guarantees the effectiveness of the proposed attack. Evaluations show that the proposed attack is the only attack that reconstructs victims’ training samples in LDP-based FL and has little impact on the target model’s accuracy. We conclude that LDP-based FL needs further improvements to defend against sample reconstruction attacks effectively. Copyright © 2025, The Authors. All rights reserved.

关键词： Federated learning

来源：评论

学校读者我要写书评

暂无评论

Spatio-temporal GNN-Based Cell-Free Massive MIMO network with Maximal Benefit-Cost Ratio

引用

IEEE Transactions on Vehicular Technology 2025年

作者： Jiang, Jing Li, Yanni Ye, Yinghui Feng, Dan Zhang, Jiayi Sutthiphan, Worakrin Niyato, Dusit Xi'an Uni versity of Posts and Telecommunications Shaanxi Key Laboratory of Information Communication Network and Security Xi'an710121 China Beijing Jiaotong University Frontiers Science Center for Smart High-Speed Railway System Beijing100044 China National Telecommunication Public Company Mobile System Development Department Bangkok10210 Thailand Nanyang Technological University College of Computing and Data Science Singapore

Due to the network's rapid expansion, mobile networks bear extra high deployment costs. Being a key enabler of 6th generation (6G) mobile networks, it is crucial that cell-free massive MIMO (CF mMIMO) networks achieve green and cost-effective development. In this correspondence, we propose spatio-temporal graph neural networks (STGNN)-based CF mMIMO networks with a maximal benefit-cost ratio. First, we formulate a new coverage cost metric named benefit-cost ratio (BCR), which can evaluate the deployment cost while fulfilling various traffic requirements. Next, CF mMIMO networks are modeled as a spatio-temporal graph to utilize STGNN to extract the spatial-temporal properties of traffic demands. Finally, STGNN optimizes the number and location of access points (APs) based on the maximal BCR criterion so that the CF mMIMO networks can achieve on-demand service capability with minimum deployment cost. Numerical results demonstrate that the proposed algorithm can significantly reduce the deployment cost while providing on-demand and high-quality mobile service. © 1967-2012 IEEE.

关键词： Mobile telecommunication systems

来源：评论

学校读者我要写书评

暂无评论

Software Module Clustering Algorithm Using Probability Selection

引用

Wuhan University Journal of Natural Sciences 2018年第2期23卷 93-102页

作者： SUN Jiaze LING Beilei School of Computer Science and Technology Xi'anUniversity of Posts and Telecommunications Xi'an 710121 ShaanxiChina Shaanxi Key Laboratory of Network Data IntelligentProcessing Xi'an University of Posts and TelecommunicationsXi'an 710121 Shaanxi China

Software module clustering problem is an important and challenging problem in software reverse engineering whose main goal is to obtain a good modular structure of the software system. The large complex software system can be divided into some subsystems that are easy to understand and maintain through the software module clustering. Aiming at solving the problem of slow convergence speed, the poor clustering result, and the complex algorithm, a software module clustering algorithm using probability selection is proposed. Firstly, we convert the software system into complex network diagram, and then we use the operation of merger, adjustment and optimization to get the software module clustering scheme. To evaluate the effectiveness of the algorithm, a set of experiments was performed on 5 real-world module clustering problems. The comparison of the experimental results proves the simplicity of the algorithm as well as the low time complexity and fast convergence speed. This algorithm provides a simple and effective engineering method for software module clustering problem.

关键词： software module clustering complex network merger adjustment optimization probability selection

来源：评论

学校读者我要写书评

暂无评论

An attention-based cascade R-CNN model for sternum fracture detection in X-ray images

引用

CAAI Transactions on Intelligence Technology 2022年第4期7卷 658-670页

作者： Yang Jia Haijuan Wang Weiguang Chen Yagang Wang Bin Yang School of Computer Xi'an University of Posts and TelecommunicationsXi'anShaanxiChina Shaanxi Key Laboratory of Network Data Intelligent Processing Xi'an University of Posts and TelecommunicationsXi'anShaanxiChina Xi'an Key Laboratory of Big Data and Intelligent Computing Xi'anShaanxiChina Department of Radiology Xi'an Honghui HospitalXi'anChina

Fracture is one of the most common and unexpected *** not treated in time,it may cause serious consequences such as joint stiffness,traumatic arthritis,and nerve *** computer vision technology to detect fractures can reduce the workload and misdiagnosis of fractures and also improve the fracture detection ***,there are still some problems in sternum fracture detection,such as the low detection rate of small and occult *** this work,the authors have constructed a dataset with 1227 labelled X-ray images for sternum fracture *** authors designed a fully automatic fracture detection model based on a deep convolution neural network(CNN).The authors used cascade R-CNN,attention mechanism,and atrous convolution to optimise the detection of small fractures in a large X-ray image with big local *** authors compared the detection results of YOLOv5 model,cascade R-CNN and other state-of-the-art *** authors found that the convolution neural network based on cascade and attention mechanism models has a better detection effect and arrives at an mAP of 0.71,which is much better than using the YOLOv5 model(mAP=0.44)and cascade R-CNN(mAP=0.55).

关键词： attention mechanism cascade R-CNN fracture detection X-ray image

来源：评论

学校读者我要写书评

暂无评论

Density PSO-based software module clustering algorithm

引用

The Journal of China Universities of Posts and Telecommunications 2018年第4期25卷 38-47页

作者： Sun Jiaze Ling Beilei School of Computer Science and Technology Xi'an University of Posts and Telecommunications Shaanxi Key Laboratory of Network Data Intelligent Processing Xi'an University of Posts and Telecommunications

Software module clustering is to divide the complex software system into many subsystems to enhance the intelligibility and maintainability of software systems. To increase convergence speed and optimize clustering solution,density PSO-based( DPSO) software module clustering algorithm is proposed. Firstly,the software system is converted into complex network diagram,and then the particle swarm optimization( PSO) algorithm is *** shortest path method is used to initialize the swarm,and the probability selection approach is used to update the particle positions. Furthermore,density-based modularization quality( DMQ) function is designed to evaluate the clustering quality. Five typical open source projects are selected as benchmark programs to verify the efficiency of the DPSO algorithm. Hill climbing( HC) algorithm,genetic algorithm( GA),PSO and DPSO algorithm are compared in the modularization quality( MQ) and DMQ. The experimental results show that the DPSO is more stable and more convergent than the other three traditional algorithms. The DMQ standard is more reasonable than MQ standard in guiding software module clustering.

关键词： software module clustering complex network PSO MQ modularity density

来源：评论

学校读者我要写书评

暂无评论

Edge Computing Task Scheduling with Joint Blockchain and Task Caching in Industrial Internet

引用

Computers, Materials & Continua 2023年第4期75卷 2101-2117页

作者： Yanping Chen Xuyang Bai Xiaomin Jin Zhongmin Wang Fengwei Wang Li Ling School of Computer Science and Technology Xi’an University of Posts and TelecommunicationsXi’an710121China Shaanxi Key Laboratory of Network Data Analysis and Intelligent Processing Xi’an710121China Xi’an Key Laboratory of Big Data and Intelligent Computing Xi’anShaanxi710121China ZTE Corporation Shenzhen51805China

Deploying task caching at edge servers has become an effectiveway to handle compute-intensive and latency-sensitive tasks on the industrialinternet. However, how to select the task scheduling location to reduce taskdelay and cost while ensuring the data security and reliable communicationof edge computing remains a challenge. To solve this problem, this paperestablishes a task scheduling model with joint blockchain and task cachingin the industrial internet and designs a novel blockchain-assisted cachingmechanism to enhance system security. In this paper, the task schedulingproblem, which couples the task scheduling decision, task caching decision,and blockchain reward, is formulated as the minimum weighted cost problemunder delay constraints. This is a mixed integer nonlinear problem, which isproved to be nonconvex and NP-hard. To solve the optimal solution, thispaper proposes a task scheduling strategy algorithm based on an improvedgenetic algorithm (IGA-TSPA) by improving the genetic algorithm initializationand mutation operations to reduce the size of the initial solutionspace and enhance the optimal solution convergence speed. In addition,an Improved Least Frequently Used algorithm is proposed to improve thecontent hit rate. Simulation results show that IGA-TSPA has a faster optimalsolution-solving ability and shorter running time compared with the existingedge computing scheduling algorithms. The established task scheduling modelnot only saves 62.19% of system overhead consumption in comparison withlocal computing but also has great significance in protecting data security,reducing task processing delay, and reducing system cost.

关键词： Edge computing task scheduling blockchain task caching industrial security

来源：评论

学校读者我要写书评

暂无评论

FortisAVQA and MAVEN: a Benchmark dataset and Debiasing Framework for Robust Multimodal Reasoning

arXiv

引用

arXiv 2025年

作者： Ma, Jie Gao, Zhitao Chai, Qi Liu, Jun Wang, Pinghui Tao, Jing Su, Zhou Ministry of Education of Key Laboratory for Intelligent Networks and Network Security School of Cyber Science and Engineering Xi’an Jiaotong University Shaanxi Xi’an710049 China Shannxi Provincial Key Laboratory of Big Data Knowledge Engineering School of Computer Science and Technology Xi’an Jiaotong University Shaanxi Xi’an710049 China Guangdong Guangzhou510000 China

Audio-Visual Question Answering (AVQA) is a challenging multimodal reasoning task requiring intelligent systems to answer natural language queries based on paired audio-video inputs accurately. However, existing AVQA approaches often suffer from overfitting to dataset biases, leading to poor robustness. Moreover, current datasets may not effectively diagnose these methods. To address these challenges, we first introduce a novel dataset, FortisAVQA, constructed in two stages: (1) rephrasing questions in the test split of the public MUSIC-AVQA dataset and (2) introducing distribution shifts across questions. The first stage expands the test space with greater diversity, while the second enables a refined robustness evaluation across rare, frequent, and overall question distributions. Second, we introduce a robust Multimodal Audio-Visual Epistemic network (MAVEN) that leverages a multifaceted cycle collaborative debiasing strategy to mitigate bias learning. Experimental results demonstrate that our architecture achieves state-of-the-art performance on FortisAVQA, with a notable improvement of 7.81%. Extensive ablation studies on both datasets validate the effectiveness of our debiasing components. Additionally, our evaluation reveals the limited robustness of existing multimodal QA methods. We also verify the plug-and-play capability of our strategy by integrating it with various baseline models across both datasets. Our dataset and code are available at https://***/reml-group/fortisavqa. Copyright © 2025, The Authors. All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Moving Forward Together: A Multi-User Pattern Extraction Neural Model for Sequential Recommendations 6

Moving Forward Together: A Multi-User Pattern Extraction Neu...

引用

6th International Conference on Artificial Intelligence and Pattern Recognition, AIPR 2023

作者： Du, Xiangpeng Li, Xiaoge Shaanxi Key Laboratory of Network Data Analysis and Intelligent Processing Xian University of Posts and Telecommunications Shaanxi Xi'an710121 China

ISBN: (纸本)9798400707674

The sequential recommendation is a very important task in recommendation systems. The aim of it is to dynamic predict user's interests based on their historical behaviors. Despite recent progress, most of deep learning approaches focus on extracting the behavioral patterns of a single user. Pulling multiple users can increase the diversity of historical information. In this paper, we propose multi-user behavioral pattern extraction model (TMGN) via a combination of traditional behavioral pattern extraction and graph convolutional aggregation. Concretely, TMGN first learns the graph structure of users and items. Then it performs graph convolution aggregation to derive a representation of users to extract user interest features. We recall the users with the highest similarity by calculating the cosine similarity of each candidate user. Finally, we inject multiple users' sequence patterns and time information into the muti-head attention mechanism. Experiments on actual data (Movielens1m, Movielen20m and Amazon beauty) show that the proposed method outperforms current state-of-the-art sequential recommendation methods. TMGN achieves an average improvement of 5.67%, 5.75%, 7.32%, and 7.19% over the most robust baseline in Hit@5, Hit@10, NDCG@5, and NDCG@10, respectively. We provide extensive ablation studies to analyze the impact of each model component on TMGN. © 2023 ACM.

关键词： Convolution

来源：评论

学校读者我要写书评

暂无评论

Multimodal Sentiment Analysis of Graphic Texts Based on Multicategorical Relative Fusion 6

Multimodal Sentiment Analysis of Graphic Texts Based on Mult...

引用

6th International Conference on Artificial Intelligence and Pattern Recognition, AIPR 2023

作者： Zhai, Sheping Gao, Mingyang Yang, Rui Kang, Xinnian Shaanxi Key Laboratory of Network Data Analysis and Intelligent Processing Xi'an University of Posts and Telecommunications China

ISBN: (纸本)9798400707674

Unlike the traditional unimodal sentiment analysis, multimodal sentiment analysis can jointly process features between different modalities. Existing multimodal sentiment analysis methods simply extract features from text and images ignoring the influence of emoticons that may be contained in text and scene information in images on sentiment polarity judgment. At the same time, the unimodal feature fusion stage does not fully fuse the features of each modality resulting in low accuracy of sentiment analysis. Therefore, this paper proposes a multimodal sentiment analysis model based on multicategorical relative fusion of images and texts. which separates text content and emoji in the word embedding stage in the feature extraction stage, the traditional emoji sentiment dictionary is queried to obtain their sentiment scores and attention mechanism is introduced to extract scene features and object features of images respectively;in the feature fusion stage, the emoji sentiment scores. mixed image. The final multimodal features are obtained by fusion the emoji sentiment scores. mixed image features and text features with layer normalization. The experiments on the dataset Yelp show that the improvement of the model in the feature extraction and feature fusion stages effectively improves the accuracy and F1 value of multimodal sentiment analysis in which the accuracy increases by 4.7 percentage points on the New York dataset and the F1 value reaches 85.7% on the San Francisco dataset. © 2023 ACM.

关键词： Sentiment analysis

来源：评论

学校读者我要写书评

暂无评论

Application study of oil pipe entity recognition combined with Deep Reinforcement Learning: Named Entity Recognition combined with Deep Reinforcement Learning 6

Application study of oil pipe entity recognition combined wi...

引用

6th International Conference on Artificial Intelligence and Pattern Recognition, AIPR 2023

作者： Guan, Wei Liu, Shijie Ma, Li Xi'an University of Posts and Telecommunications Shaanxi Provincial Key Laboratory of Network Data Analysis and Intelligent Processing China

ISBN: (纸本)9798400707674

Aiming at the problems of inaccurate extraction of entity feature information and mislabeling of recognition results in the construction of knowledge graphs in the field of oil pipe failure using traditional methods, this paper proposes a research method of BERT-BiLSTM-CRF named entity recognition combined with deep reinforcement learning. The method firstly uses the BERT (Bidirectional encoder representations from transformers) pre-training model to obtain the word vectors of the input sequence semantics;secondly, the trained word vectors are fed into the bi-directional long short- term memory network (BiLSTM) to further obtain contextual features and output the maximum probability sequence annotation results according to the labeling rules of conditional random fields (CRF) and sequence decoding ability;finally, the BERT-BiLSTM-CRF model is supplemented with the deep reinforcement learning-based labeling Finally, the BERT-BiLSTM-CRF-DRL model is added to the BERT-BiLSTM-CRF model to form the framework of named entity recognition model in oil pipe failure domain. The model is compared with other 2 named entity recognition models on a self-built oil pipe data-set, and the experimental results show that the accuracy, recall and F1 values of the model reach 90.5%, 92.7% and 91.9%, respectively, and the entity recognition is better than the other 2 models. © 2023 ACM.

关键词： Long short-term memory

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：