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

Learning Adaptive Jamming and Beamforming for Hybrid IRS-assisted Secure NOMA Transmissions

学校读者我要写书评

暂无评论

IEEE Transactions on Communications 2025年

作者： Zhou, Defeng Li, Lanhua Gong, Shimin Gu, Bo Chen, Gaojie Niyato, Dusit School of Intelligent Systems Engineering Shenzhen Campus of Sun Yat-sen University China State Key Laboratory of Optoelectronic Materials and Technologies Guangdong Guangzhou510275 China Nanyang Technological University College of Computing and Data Science Singapore Singapore

In this paper, we investigate hybrid passive and active intelligent reflecting surface (IRS)-assisted secure non-orthogonal multiple access (NOMA) networks. Multiple users concurrently transmit sensitive data to an access point (AP) in the presence of an eavesdropper (Eve). The hybrid IRS is employed to enhance the NOMA users’ sum rates while simultaneously performing jamming beamforming against the Eve by optimizing the communication channels of NOMA users and injecting controllable noise into the Eve’s channel. We formulate a sum secrecy rate maximization problem by jointly optimizing the users’ scheduling policy, the hybrid IRS’s working mode and beamforming, and the AP’s receiving beamforming. To address combinatorial user scheduling and high-dimensional beamforming design, we develop a dual-cycling deep reinforcement learning (DRL) framework. We first determine the NOMA users’ scheduling strategy and the hybrid IRS’s working mode using a proximal policy optimization (PPO)-based learning algorithm. Then, we optimize the AP’s receiving beamforming and hybrid IRS’s beamforming strategies using an alternating optimization (AO) algorithm. The joint beamforming optimization can significantly enhance the DRL’s learning efficiency by limiting its action space. Moreover, we propose a lightweight two-phase algorithm with approximation techniques to reduce computational complexity by eliminating double-nested loops in AO, while maintaining secrecy performance close to optimum. Numerical results demonstrate that the proposed dual-cycling DRL scheme achieves 54.85% gains in the secrecy rate compared to traditional DRL schemes. © 1972-2012 IEEE.

关键词： Beamforming

Slimmable transformer with hybrid axial-attention for medical image segmentation

学校读者我要写书评

暂无评论

Computers in Biology and Medicine 2024年 173卷 108370-108370页

作者： Hu, Yiyue Mu, Nan Liu, Lei Zhang, Lei Jiang, Jingfeng Li, Xiaoning College of Computer Science Sichuan Normal University Chengdu610101 China School of Science and Engineering The Chinese University of Hong Kong Shenzhen Shenzhen518172 China Department of Biomedical Engineering Michigan Technological University HoughtonMI49931 United States Visual Computing and Virtual Reality Key Laboratory of Sichuan Sichuan Normal University Chengdu610068 China Education Big Data Collaborative Innovation Center of Sichuan 2011 Chengdu610101 China

The transformer architecture has achieved remarkable success in medical image analysis owing to its powerful capability for capturing long-range dependencies. However, due to the lack of intrinsic inductive bias in modeling visual structural information, the transformer generally requires a large-scale pre-training schedule, limiting the clinical applications over expensive small-scale medical data. To this end, we propose a slimmable transformer to explore intrinsic inductive bias via position information for medical image segmentation. Specifically, we empirically investigate how different position encoding strategies affect the prediction quality of the region of interest (ROI) and observe that ROIs are sensitive to different position encoding strategies. Motivated by this, we present a novel Hybrid Axial-Attention (HAA) that can be equipped with pixel-level spatial structure and relative position information as inductive bias. Moreover, we introduce a gating mechanism to achieve efficient feature selection and further improve the representation quality over small-scale datasets. Experiments on LGG and COVID-19 datasets prove the superiority of our method over the baseline and previous works. Internal workflow visualization with interpretability is conducted to validate our success better;the proposed slimmable transformer has the potential to be further developed into a visual software tool for improving computer-aided lesion diagnosis and treatment planning. © 2024 Elsevier Ltd

关键词： COVID-19

NSPG-Miner: Mining Repetitive Negative Sequential Patterns

学校读者我要写书评

暂无评论

arXiv 2025年

作者： Li, Yan Wang, Zhulin Liu, Jing Guo, Lei Fournier-Viger, Philippe Wu, Youxi Wu, Xindong School of Economics and Management Hebei University of Technology Tianjin300401 China School of Artificial Intelligence Hebei University of Technology Tianjin300401 China State Key Laboratory of Reliability and Intelligence of Electrical Equipment Hebei University of Technology Tianjin300401 China College of Computer Science and Software Engineering Shenzhen University Shenzhen518061 China Hebei Key Laboratory of Big Data Computing 300401 China Key Laboratory of Knowledge Engineering with Big Data The Ministry of Education of China Hefei University of Technology Hefei230009 China

Sequential pattern mining (SPM) with gap constraints (or repetitive SPM or tandem repeat discovery in bioinformatics) can find frequent repetitive subsequences satisfying gap constraints, which are called positive sequential patterns with gap constraints (PSPGs). However, classical SPM with gap constraints cannot find the frequent missing items in the PSPGs. To tackle this issue, this paper explores negative sequential patterns with gap constraints (NSPGs). We propose an efficient NSPG-Miner algorithm that can mine both frequent PSPGs and NSPGs simultaneously. To effectively reduce candidate patterns, we propose a pattern join strategy with negative patterns which can generate both positive and negative candidate patterns at the same time. To calculate the support (frequency of occurrence) of a pattern in each sequence, we explore a NegPair algorithm that employs a key-value pair array structure to deal with the gap constraints and the negative items simultaneously and can avoid redundant rescanning of the original sequence, thus improving the efficiency of the algorithm. To report the performance of NSPG-Miner, 11 competitive algorithms and 11 datasets are employed. The experimental results not only validate the effectiveness of the strategies adopted by NSPG-Miner, but also verify that NSPG-Miner can discover more valuable information than the state-ofthe-art algorithms. Algorithms and datasets can be downloaded from https://***/wuc567/PatternMining/tree/master/NSPG-Miner. Copyright © 2025, The Authors. All rights reserved.

关键词： Miners

GAEM: Graph-driven Attention-based Entropy Model for LiDAR Point Cloud Compression

学校读者我要写书评

暂无评论

IEEE Transactions on Circuits and Systems for Video Technology 2025年

作者： Cui, Mingyue Zhong, Yuyang Feng, Mingjian Long, Junhua Ling, Yehua Xu, Jiahao Huang, Kai Sun Yat-sen University School of Computer Science and Engineering Guangzhou400100 China Sun Yat-sen University key Laboratory of Machine Intelligence and Advanced Computing Guangzhou400100 China Nanyang Technological University College of Computing and Data Science 639798 Singapore Guangxi Transportation Science and Technology Group Co. Ltd Nanning530029 China

High-quality LiDAR point cloud (LPC) coding is essential for efficiently transmitting and storing the vast amounts of data required for accurate 3D environmental representation. The Octree-based entropy coding framework has emerged as the predominant method, however, previous study usually overly relies on large-scale attention-based context prediction to encode Octree nodes, overlooking the inherent correlational properties of this structure. In this paper, we propose a novel Graph-driven Attention-based Entropy Model (GAEM), which adopts partitioned graph attention mechanisms to uncover contextual dependencies among neighboring nodes. Different from the Cartesian coordinate-based coding mode with higher redundancy, GAEM uses the multi-level spherical Octree to organize point clouds, improving the quality of LPC reconstruction. GAEM combines graph convolution for node feature embedding and grouped-graph attention for exploiting dependency among contexts, which preserves performance in low-computation using localized nodes. Besides, to further increase the receptive field, we design a high-resolution cross-attention module introducing sibling nodes. Experimental results show that our method achieves state-of-the-art performance on the LiDAR benchmark SemanticKITTI and MPEG-specified dataset Ford, compared to all baselines. Compared to the benchmark GPCC, our method achieves gains of up to 53.9% and 53.6% on SemanticKITTI and Ford while compared to the sibling-introduced methods, we achieve up to 42.3% and 44.7% savings in encoding/decoding time. In particular, our GAEM allows for extension to downstream tasks (i.e., vehicle detection and semantic segmentation), further demonstrating the practicality of the method. (Figure presented) © 1991-2012 IEEE.

关键词： Semantic Segmentation

DEGSTalk: Decomposed Per-Embedding Gaussian Fields for Hair-Preserving Talking Face Synthesis

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Deng, Kaijun Zheng, Dezhi Xie, Jindong Wang, Jinbao Xie, Weicheng Shen, Linlin Song, Siyang Computer Vision Institute School of Computer Science and Software Engineering Shenzhen University China National Engineering Laboratory for Big Data System Computing Technology Shenzhen University China Guangdong Provincial Key Laboratory of Intelligent Information Processing China Department of Computer Science University of Exeter United Kingdom

Accurately synthesizing talking face videos and capturing fine facial features for individuals with long hair presents a significant challenge. To tackle these challenges in existing methods, we propose a decomposed per-embedding Gaussian fields (DEGSTalk), a 3D Gaussian Splatting (3DGS)-based talking face synthesis method for generating realistic talking faces with long hairs. Our DEGSTalk employs Deformable Pre-Embedding Gaussian Fields, which dynamically adjust pre-embedding Gaussian primitives using implicit expression coefficients. This enables precise capture of dynamic facial regions and subtle expressions. Additionally, we propose a Dynamic Hair-Preserving Portrait Rendering technique to enhance the realism of long hair motions in the synthesized videos. Results show that DEGSTalk achieves improved realism and synthesis quality compared to existing approaches, particularly in handling complex facial dynamics and hair preservation. Our code will be publicly available at https://***/CVI-SZU/DEGSTalk. Copyright © 2024, The Authors. All rights reserved.

关键词： Gaussian distribution

CA-Edit: Causality-Aware Condition Adapter for High-Fidelity Local Facial Attribute Editing

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Xian, Xiaole He, Xilin Niu, Zenghao Zhang, Junliang Xie, Weicheng Song, Siyang Yu, Zitong Shen, Linlin Computer Vision Institute School of Computer Science & Software Engineering Shenzhen University China National Engineering Laboratory for Big Data System Computing Technology Shenzhen University China Guangdong Key Laboratory of Intelligent Information Processing China University of Exeter United Kingdom Great Bay University China

For efficient and high-fidelity local facial attribute editing, most existing editing methods either require additional finetuning for different editing effects or tend to affect beyond the editing regions. Alternatively, inpainting methods can edit the target image region while preserving external areas. However, current inpainting methods still suffer from the generation misalignment with facial attributes description and the loss of facial skin details. To address these challenges, (i) a novel data utilization strategy is introduced to construct datasets consisting of attribute-text-image triples from a data-driven perspective, (ii) a Causality-Aware Condition Adapter is proposed to enhance the contextual causality modeling of specific details, which encodes the skin details from the original image while preventing conflicts between these cues and textual conditions. In addition, a Skin Transition Frequency Guidance technique is introduced for the local modeling of contextual causality via sampling guidance driven by low-frequency alignment. Extensive quantitative and qualitative experiments demonstrate the effectiveness of our method in boosting both fidelity and editability for localized attribute editing. The code is available at https://***/connorxian/CA-Edit. © 2024, CC BY.

关键词：

Efficient Resource Allocation in computing Power Networks Considering Similar Task Merging: A Lyapunov Optimization-Based DRL Approach

学校读者我要写书评

暂无评论

IEEE Internet of Things Journal 2025年

作者： Jia, Zhonghai Xue, Junxiao Shi, Lei Li, Jie He, Mengyang Zhejiang Lab Research Center for Space Computing System Hangzhou310000 China Zhengzhou University School of Cyber Science and Engineering Zhengzhou450002 China SongShan Laboratory Zhengzhou450040 China Shanghai Jiao Tong University Department of Computer Science and Engineering Shanghai200240 China Shanghai Key Laboratory of Trusted Data Circulation and Governance Web3 Shanghai China

The cloud-edge-terminal architecture relies on hierarchy for resource allocation but lacks global optimization. The computing power network (CPN) introduces a new distributed computing paradigm, integrating cross-domain, heterogeneous resources for global scheduling. However, most CPN research focuses on task optimization during resource allocation, while neglecting the similarity of random tasks before the allocation stage. Additionally, fragmented CPN resources and complex task demands pose challenges to global load balancing. This paper proposes a deep reinforcement learning framework with task merging and congestion avoidance for on-demand resource allocation. Specifically, a low-complexity similar task merging algorithm reduces redundant resource consumption during task preprocessing. In task offloading, the principal neighborhood aggregated graph neural network captures CPN's intricate features. Lyapunov optimization, integrated into a multi-threaded training framework, minimizes resource backlog congestion. A carefully designed reward function balances multiple objectives, enhancing computing resource utilization efficiency and ensuring system stability. Theoretical analysis shows that with control parameter V, the trade-off between resource utilization efficiency and system stability follows the relationship O(1/V), O(V). Extensive experiments demonstrate a 33.5% improvement in resource utilization efficiency and a 62.7% increase in task offloading success rates with respect to those in state-of-the-art algorithms. The proposed algorithm exhibits robustness and effectiveness, particularly in high-load and real network topologies. © 2014 IEEE.

关键词： computing power

HairDiffusion: Vivid Multi-Colored Hair Editing via Latent Diffusion

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Zeng, Yu Zhang, Yang Liu, Jiachen Shen, Linlin Deng, Kaijun He, Weizhao Wang, Jinbao Computer Vision Institute School of Computer Science & Software Engineering Shenzhen University China Shenzhen Institute of Artificial Intelligence and Robotics for Society China National Engineering Laboratory for Big Data System Computing Technology Shenzhen University China Guangdong Provincial Key Laboratory of Intelligent Information Processing China

Hair editing is a critical image synthesis task that aims to edit hair color and hairstyle using text descriptions or reference images, while preserving irrelevant attributes (e.g., identity, background, cloth). Many existing methods are based on StyleGAN to address this task. However, due to the limited spatial distribution of StyleGAN, it struggles with multiple hair color editing and facial preservation. Considering the advancements in diffusion models, we utilize Latent Diffusion Models (LDMs) for hairstyle editing. Our approach introduces Multi-stage Hairstyle Blend (MHB), effectively separating control of hair color and hairstyle in diffusion latent space. Additionally, we train a warping module to align the hair color with the target region. To further enhance multi-color hairstyle editing, we fine-tuned a CLIP model using a multi-color hairstyle dataset. Our method not only tackles the complexity of multi-color hairstyles but also addresses the challenge of preserving original colors during diffusion editing. Extensive experiments showcase the superiority of our method in editing multi-color hairstyles while preserving facial attributes given textual descriptions and reference images. © 2024, CC BY.

关键词： Color image processing

PUTraceAD: Trace Anomaly Detection with Partial Labels based on GNN and PU Learning

学校读者我要写书评

暂无评论

PUTraceAD: Trace Anomaly Detection with Partial Labels based...

International Symposium on Software Reliability engineering (ISSRE)

作者： Ke Zhang Chenxi Zhang Xin Peng Chaofeng Sha School of Computer Science Fudan University China Shanghai Key Laboratory of Data Science Fudan University China Shanghai Collaborative Innovation Center of Intelligent Visual Computing China

ISBN: (数字)9781665451321

ISBN: (纸本)9781665451338

Distributed tracing has been an important part of microservice infrastructure and learning-based trace analysis has been used to detect anomalies in microservice systems. Existing learning-based trace anomaly detection approaches ei-ther assume that trace patterns can be learned from normal execution or rely on fault injection to produce labeled traces (i.e., normal/anomalous ones). However, in practice it is often difficult to ensure that the normal execution does not involve anomalous traces or obtain a large variety of normal and anomalous traces through fault injection. In this paper, we propose PUTraceAD, a trace anomaly detection approach that can alleviate the above problems. PUTraceAD represents a trace as a span causal graph with node features such as operation name, response code, duration time. Based on the graph representation, PUTraceAD trains a GNN- and PU learning-based trace anomaly detection model. During the process, PU (Positive and Unlabeled) learning optimizes model parameters through estimating the data distribution. Therefore, PUTraceAD can train the model based on a small set of labeled anomalous traces and a large set of unlabeled traces. Our evaluation shows that PUTraceAD outperforms existing unsupervised trace anomaly detection approaches and only slightly underperforms a supervised learning-based approach that takes full advantage of labeled traces.

关键词： Codes Microservice architectures data models Software reliability Time factors Anomaly detection