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

Resilient Collaborative Caching for Multi-Edge Systems with Robust Federated Deep Learning

IEEE/ACM Transactions on Networking 2024年

作者： Chen, Zheyi Liang, Jie Yu, Zhengxin Cheng, Hongju Min, Geyong Li, Jie Fuzhou University College of Computer and Data Science Fujian Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou350116 China Ministry of Education Engineering Research Center of Big Data Intelligence Fuzhou350002 China Lancaster University School of Computing and Communications LancasterLA1 4YW United Kingdom University of Exeter Faculty of Environment Science and Economy Department of Computer Science ExeterEX4 4QF United Kingdom Shanghai Jiao Tong University Department of Computer Science and Engineering Shanghai200240 China

As a key technique for future networks, the performance of emerging multi-edge caching is often limited by inefficient collaboration among edge nodes and improper resource configuration. Meanwhile, achieving optimal cache hit rates poses substantive challenges without effectively capturing the potential relations between discrete user features and diverse content libraries. These challenges become further sophisticated when caching schemes are exposed to adversarial attacks that seriously impair cache performance. To address these challenges, we introduce RoCoCache, a resilient collaborative caching framework that uniquely integrates robust federated deep learning with proactive caching strategies, enhancing performance under adversarial conditions. First, we design a novel partitioning mechanism for multi-dimensional cache space, enabling precise content recommendations in user classification intervals. Next, we develop a new Discrete-Categorical Variational Auto-Encoder (DC-VAE) to accurately predict content popularity by overcoming posterior collapse. Finally, we create an original training mode and proactive cache replacement strategy based on robust federated deep learning. Notably, the residual-based detection for adversarial model updates and similarity-based federated aggregation are integrated to avoid the model destruction caused by adversarial updates, which enables the proactive cache replacement adapting to optimized cache resources and thus enhances cache performance. Using the real-world testbed and datasets, extensive experiments verify that the RoCoCache achieves higher cache hit rates and efficiency than state-of-the-art methods while ensuring better robustness. Moreover, we validate the effectiveness of the components designed in RoCoCache for improving cache performance via ablation studies. © 1993-2012 IEEE.

关键词： cache space partitioning content popularity prediction Multi-edge collaborative caching proactive cache replacement robust federated deep learning

来源：评论

学校读者我要写书评

暂无评论

Movable-Antenna Position Optimization: A Graph-based Approach

arXiv

引用

arXiv 2024年

作者： Mei, Weidong Wei, Xin Ning, Boyu Chen, Zhi Zhang, Rui National Key Laboratory of Wireless Communications University of Electronic Science and Technology of China Chengdu611731 China School of Science and Engineering Shenzhen Research Institute of Big Data The Chinese University of Hong Kong Guangdong Shenzhen518172 China Department of Electrical and Computer Engineering National University of Singapore Singapore117583 Singapore

Fluid antennas (FAs) and movable antennas (MAs) have emerged as promising technologies in wireless communications, which offer the flexibility to improve channel conditions by adjusting transmit/receive antenna positions within a spatial region. In this letter, we focus on an MA-enhanced multiple-input single-output (MISO) communication system, aiming to optimize the positions of multiple transmit MAs to maximize the received signal power. Unlike the prior works on continuously searching for the optimal MA positions, we propose to sample the transmit region into discrete points, such that the continuous antenna position optimization problem is transformed to a discrete sampling point selection problem based on the point-wise channel information. However, such a point selection problem is combinatory and challenging to be optimally solved. To tackle this challenge, we ingeniously recast it as an equivalent fixed-hop shortest path problem in graph theory and propose a customized algorithm to solve it optimally in polynomial time. To further reduce the complexity, a linear-time sequential update algorithm is also proposed to obtain a high-quality suboptimal solution. Numerical results demonstrate that the proposed algorithms can yield considerable performance gains over the conventional fixed-position antennas with/without antenna selection. Copyright © 2024, The Authors. All rights reserved.

关键词： Graph theory

来源：评论

学校读者我要写书评

暂无评论

Sparse Aggregation-Based Channel Estimation For Massive Mimo Systems With Decentralized Baseband Processing

Sparse Aggregation-Based Channel Estimation For Massive Mimo...

引用

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

作者： Yanqing Xu Enbin Song Qingjiang Shi Tsung-Hui Chang School of Science & Engineering The Chinese University of Hong Kong Shenzhen China Shenzhen Research Institute of Big Data Shenzhen China College of Mathematics Sichuan University Chengdu China School of Software Engineering Tongji University Shanghai China

To cope with the bottlenecks of the high computational complexity and excessive inter-connection communication in the conventional centralized baseband processing architecture, the decentralized baseband processing (DBP) architecture has been proposed, where the antennas are partitioned into multiple clusters, each connected to a local baseband unit (BBU). In this paper, we are interested in the distributed channel estimation (DCE) method under such DBP architecture, which is rarely studied in the literature. Our goal is to devise a DCE algorithm that can perform as well as the centralized scheme but with a small inter-connection communication cost. Specifically, based on the low-complexity diagonal minimum mean square error channel estimator, we propose an aggregate-then-estimate based DCE algorithm. In contrast to the existing DCE algorithm which requires iterative information exchanges among BBUs, our algorithm only requires one round-trip communication between the nodes. Experiment results are presented to demonstrate the efficacy of the proposed DCE algorithm.

关键词： Baseband Signal processing algorithms Channel estimation Computer architecture Mean square error methods Massive MIMO Signal processing

来源：评论

学校读者我要写书评

暂无评论

GAUSSIAN KERNEL-BASED CROSS MODAL NETWORK FOR SPATIO-TEMPORAL VIDEO GROUNDING

arXiv

引用

arXiv 2022年

作者： Xiong, Zeyu Liu, Daizong Zhou, Pan The Hubei Engineering Research Center on Big Data Security School of Cyber Science and Engineering Huazhong University of Science and Technology China Wangxuan Institute of Computer Technology Peking University China

Spatial-Temporal Video Grounding (STVG) is a challenging task which aims to localize the spatio-temporal tube of the interested object semantically according to a natural language query. Most previous works not only severely rely on the anchor boxes extracted by Faster R-CNN, but also simply regard the video as a series of individual frames, thus lacking their temporal modeling. Instead, in this paper, we are the first to propose an anchor-free framework for STVG, called Gaussian Kernel-based Cross Modal Network (GKCMN). Specifically, we utilize the learned Gaussian Kernel-based heatmaps of each video frame to locate the query-related object. A mixed serial and parallel connection network is further developed to leverage both spatial and temporal relations among frames for better grounding. Experimental results on VidSTG dataset demonstrate the effectiveness of our proposed GKCMN. Copyright © 2022, The Authors. All rights reserved.

关键词： Gaussian distribution

来源：评论

学校读者我要写书评

暂无评论

Incomplete Multi-view Clustering Based on Joint Concept Decomposition and Anchor Graph Learning 11th

Incomplete Multi-view Clustering Based on Joint Concept Dec...

引用

11th International Joint Conference on Rough Sets, IJCRS 2025

作者： Li, Zhuowen Chen, Hongmei Xiang, Biao Yuan, Zhong Luo, Chuan Li, Tianrui School of Computing and Artificial Intelligence Southwest Jiaotong University Chengdu611756 China National Engineering Laboratory of Integrated Transportation Big Data Application Technology Southwest Jiaotong University Chengdu611756 China Engineering Research Center of Sustainable Urban Intelligent Transportation Ministry of Education Chengdu611756 China Manufacturing Industry Chains Collaboration and Information Support Technology Key Laboratory of Sichuan Province Southwest Jiaotong University Chengdu611756 China College of Computer Science Sichuan University Chengdu610065 China

ISBN: (纸本)9783031927430

The main objective of incomplete multi-view clustering is to effectively utilize the existing view information to fill in the missing data and to mine the complementary information and potential associations between multiple views to effectively group samples. The existing primary means for recovering missing information are classified into two parts: one uses matrix decomposition or low-rank constraints to fill in the missing views, and the other constructs multiple graph structures and uses graph regularization to recover the corresponding missing parts. However, the two methods are relatively independent and are not used jointly to improve the model performance. This paper proposes an incomplete multi-view clustering method with complete clustering metrics and complete anchor graphs (CFAG). Specifically, each view’s missing samples are recovered by a matrix of consistent clustering metrics and represented by an anchor graph. The recovered complete data performs anchor graph construction and anchor learning and utilizes the orthogonal variation principle to learn the consistency structure of multiple anchor graphs to mine the complementary information among multiple views. The clustering metrics are obtained based on the consistency structure, and the consistency of the clustering metrics is also considered to obtain the final clustering results. The effectiveness of the proposed method is verified on multiple datasets. © The Author(s), under exclusive license to Springer Nature Switzerland AG 2025.

关键词： Graphic methods

来源：评论

学校读者我要写书评

暂无评论

6D Movable Antenna Based on User Distribution: Modeling and Optimization

arXiv

引用

arXiv 2024年

作者： Shao, Xiaodan Jiang, Qijun Zhang, Rui The Institute for Digital Communications Friedrich-Alexander-University Erlangen-Nuremberg Erlangen91054 Germany The School of Science and Engineering Chinese University of Hong Kong Shenzhen518172 China School of Science and Engineering Shenzhen Research Institute of Big Data The Chinese University of Hong Kong Guangdong Shenzhen518172 China The Department of Electrical and Computer Engineering National University of Singapore 117583 Singapore

In this paper, we propose a new six-dimensional (6D) movable antenna (6DMA) system for future wireless networks to improve the communication performance. Unlike the traditional fixed-position antenna (FPA) and existing fluid antenna/two-dimensional (2D) movable antenna (FA/2DMA) systems that adjust the positions of antennas only, the proposed 6DMA system consists of distributed antenna surfaces with independently adjustable three-dimensional (3D) positions as well as 3D rotations within a given space. In particular, this paper applies the 6DMA to the base station (BS) in wireless networks to provide full degrees of freedom (DoFs) for the BS to adapt to the dynamic user spatial distribution in the network. However, a challenging new problem arises on how to optimally control the 6D positions and rotations of all 6DMA surfaces at the BS to maximize the network capacity based on the user spatial distribution, subject to the practical constraints on 6D antennas' movement. To tackle this problem, we first model the 6DMA-enabled BS and the user channels with the BS in terms of 6D positions and rotations of all 6DMA surfaces. Next, we propose an efficient alternating optimization algorithm to search for the best 6D positions and rotations of all 6DMA surfaces by leveraging the Monte Carlo simulation technique. Specifically, we sequentially optimize the 3D position/3D rotation of each 6DMA surface with those of the other surfaces fixed in an iterative manner. Numerical results show that our proposed 6DMA-BS can significantly improve the network capacity as compared to the benchmark BS architectures with FPAs or MAs with limited/partial movability, especially when the user distribution is more spatially non-uniform. Copyright © 2024, The Authors. All rights reserved.

关键词： Rotation

来源：评论

学校读者我要写书评

暂无评论

Rethinking the Video Sampling and Reasoning Strategies for Temporal Sentence Grounding

Rethinking the Video Sampling and Reasoning Strategies for T...

引用

2022 Findings of the Association for Computational Linguistics: EMNLP 2022

作者： Zhu, Jiahao Liu, Daizong Zhou, Pan Di, Xing Cheng, Yu Yang, Song Xu, Wenzheng Xu, Zichuan Wan, Yao Sun, Lichao Xiong, Zeyu Hubei Key Laboratory of Distributed System Security Hubei Engineering Research Center on Big Data Security School of Cyber Science and Engineering Huazhong University of Science and Technology China ProtagoLabs Inc Microsoft Research Wangxuan Institute of Computer Technology Peking University China Beijing Institute of Technology China School of Sichuan University China Dalian University of Technology China Lehigh University United States School of Computer Sci. & Tech. Huazhong University of Science and Technology China

Temporal sentence grounding (TSG) aims to identify the temporal boundary of a specific segment from an untrimmed video by a sentence query. All existing works first utilize a sparse sampling strategy to extract a fixed number of video frames and then conduct multimodal interactions with query sentence for reasoning. However, we argue that these methods have overlooked two indispensable issues: 1) Boundary-bias: The annotated target segment generally refers to two specific frames as corresponding start and end timestamps. The video downsampling process may lose these two frames and take the adjacent irrelevant frames as new boundaries. 2) Reasoning-bias: Such incorrect new boundary frames also lead to the reasoning bias during frame-query interaction, reducing the generalization ability of model. To alleviate above limitations, in this paper, we propose a novel Siamese Sampling and Reasoning Network (SSRN) for TSG, which introduces a siamese sampling mechanism to generate additional contextual frames to enrich and refine the new boundaries. Specifically, a reasoning strategy is developed to learn the inter-relationship among these frames and generate soft labels on boundaries for more accurate frame-query reasoning. Such mechanism is also able to supplement the absent consecutive visual semantics to the sampled sparse frames for fine-grained activity understanding. Extensive experiments demonstrate the effectiveness of SSRN on three challenging datasets. © 2022 Association for Computational Linguistics.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Enhancing EEG-Based Cross-Subject Emotion Recognition via Adaptive Source Joint Domain Adaptation

引用

IEEE Transactions on Affective Computing 2024年

作者： Liu, Ke Luo, Xin Zhu, Wenrui Yu, Zhuliang Yu, Hong Xiao, Bin Wu, Wei Chongqing University of Posts and Telecommunications School of Computer Science and Technology Chongqing400065 China Chongqing University of Posts and Telecommunications Key Laboratory of Big Data Intelligent Computing China South China University of Technology College of Automation Science and Engineering Guangzhou510641 China Shanghai Jiao Tong University School of Medicine Department of Neurology Songjjiang Hospital and Songjiang Research Institute Shanghai Key Laboratory of Emotions and Affective Disorders Shanghai201600 China

EEG emotion recognition is crucial in both human-machine interaction and healthcare. However, recognizing emotions across different subjects remains challenging due to individual variability. While existing multi-source domain adaptation methods have been utilized for cross-subject EEG emotion decoding, they often struggle with irrelevant or weakly relevant source domains, leading to negative transfer. Additionally, variations within subdomains are often neglected in these studies. We propose a joint domain adaptation method, Adaptive Source Joint Domain Adaptation (ASJDA) to address these issues. ASJDA utilizes an unsupervised adaptive source selection strategy to select a subset of source domains by evaluating the Jensen-Shannon divergence between the source and target domains, choosing those most relevant to the target. Subsequently, it implements joint domain adaptation with these chosen sources at both the domain and category subdomain levels. Our proposed method outperforms existing state-of-the-art methods, achieving cross-subject accuracies of 96.81% in SEED, 89.69% in SEED-IV, and 69.31% in DEAP. This work significantly advances the state of the art in EEG emotion recognition by effectively addressing the challenges of cross-subject variability. The source code for ASJDA is available at https://***/Pam098/ASJDA. © 2010-2012 IEEE.

关键词： adaptive source selection cross-subject domain adaptation EEG emotion recognition

来源：评论

学校读者我要写书评

暂无评论

MSI-UNet: A Flexible UNet-Based Multi-Scale Interactive Framework for 3D Gastric Tumor Segmentation on CT Scans

MSI-UNet: A Flexible UNet-Based Multi-Scale Interactive Fram...

引用

IEEE International Symposium on Biomedical Imaging

作者： Heyun Chen Zifan Chen Jie Zhao Haoshen Li Jiazheng Li Yiting Liu Mingze Yuan Peng Bao Xinyu Nan Bin Dong Lei Tang Li Zhang Center for Data Science Peking University China National Engineering Laboratory for Big Data Analysis and Applications Peking University China Peking University Changsha Institute for Computing and Digital Economy China Peking University Cancer Hospital&Institute China Beijing International Center for Mathematical Research Peking University China Center for Machine Learning Research Peking University China

ISBN: (数字)9798350313338

ISBN: (纸本)9798350313345

Accurate segmentation of gastric tumors is critical yet presents a formidable challenge in medical imaging, where conventional UNet-based frameworks, despite their prevalence, falter on intricate tumor samples due to their limited interactive capacities. The SAM-based segmentation methods address this shortcoming yet with insufficient accuracy. By ingeniously blending images with mask inputs, our MSI-UNet leverages a U-shaped design to deliver pixel-perfect segmentation accuracy, while a novel multi-scale attention module adeptly harnesses interaction points for refined information extraction. When benchmarked on gastric tumor segmentation tasks, MSI-UNet surpasses existing state-of-the-art methods, elevating the Dice Similarity Coefficient (DSC) from 74.82% to 79.3% and minimizing Average Surface Distance (ASD) from 6.46 to 1.98, achieving a comparable accuracy with inter-radiologist consistency of 79.7% DSC. Furthermore, our framework demonstrates superior predictive prowess in survival analysis, enhancing the C-index from 61.7% to 68.68%. Ample experimental comparisons have substantiated that MSI-UNet holds the potential to offer considerable assistance to healthcare professionals in managing and decoding subsequent medical procedures.

关键词： Image segmentation Accuracy Three-dimensional displays Medical services Predictive models Information retrieval Decoding

来源：评论

学校读者我要写书评

暂无评论

Predicting CircRNA-Disease Associations Through Non-negative Matrix Factorization and Adversarially Regularized Variational Graph Autoencoder

Predicting CircRNA-Disease Associations Through Non-negative...

引用

IEEE International Conference on Bioinformatics and Biomedicine (BIBM)

作者： Mianshuo Lu Lei Wang Jinzhu Sun Yang Li Mengmeng Wei Yu Wei Changchun Liu Zhengwei Li School of Computer Science and Technology China University of Mining and Technology Xuzhou China Big Data and Intelligent Computing Research Center Guangxi Academy of Sciences Nanning China Zaozhuang Mental Health Center Zaozhuang China School of Computer Science and Information Engineering Hefei University of Technology Hefei China College of Information Science and Enginnering Zaozhuang Univerity China

ISBN: (数字)9798350386226

ISBN: (纸本)9798350386233

Circular RNA (circRNA) is an RNA molecule that plays an important role in both pathology and physiology. Accurate identification of associations between circRNAs and diseases is crucial for further physiology research. However, verifying the circRNA-disease associations (CDA) through biological experimental methods is time-consuming. Here, we propose a novel method combines Non-negative Matrix Factorization (NMF) and Adversarially Regularized Variational Graph Autoencoder (ARVGA) to accurately predict CDA. Our model first fuses multi-source information in order to build circRNA similarity, disease similarity and circRNA-disease association matrices. Thereby our model constructs graphs for circRNA and disease respectively and optimize them using a K-means clustering algorithm. We obtain linear features using NMF and non-linear features using ARVGA. Finally, an Extremely Randomized Trees classifier is employed to predict CDA. On the gold standard dataset CircR2Disease, our model achieved a prediction accuracy of 94.8% and an AUC of 0.984 under 5-fold cross-validation. In case study, 19 of top 20 predicted circRNAs associated with Hepatocellular Carcinoma were confirmed in relevant literature. Furthermore, ablation experiment, classifier experiment and independent datasets test fully demonstrate the effectiveness and robustness of our model.

关键词： Biological system modeling RNA Autoencoders Clustering algorithms Predictive models Feature extraction Prediction algorithms Robustness Physiology Diseases

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：