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

Secure beamforming and deployment design for rate-splitting multiple access-based UAV communications

Science China(Information Sciences) 2025年第1期68卷 342-356页

作者： Bing WANG Xiaofeng TAO Shujun HAN Huici WU Kai YANG Zhu HAN National Engineering Research Center of Mobile Network Technologies Beijing University of Posts and Telecommunications Peng Cheng Laboratory Department of Electrical and Computer Engineering University of Houston

Rate-splitting multiple access(RSMA) has recently gained attention as a potential robust multiple access(MA)scheme for upcoming wireless networks. Given its ability to efficiently utilize wireless resources and design interference management strategies, it can be applied to unmanned aerial vehicle(UAV) networks to provide convenient services for large-scale access ground users. However, due to the line-of-sight(LoS) broadcast nature of UAV transmission, information is susceptible to eavesdropping in RSMA-based UAV networks. Moreover, the superposition of signals at the receiver in such networks becomes complicated. To cope with the challenge, we propose a two-user multi-input single-output(MISO) RSMA-based UAV secure transmission framework in downlink communication networks. In a passive eavesdropping scenario, our goal is to maximize the sum secrecy rate by optimizing the transmit beamforming and deployment location of the UAV-base station(UAV-BS),while considering quality-of-service(QoS) constraints, maximum transmit power, and flight space limitations. To address the non-convexity of the proposed problem, the optimization problem is first decoupled into two subproblems. Then, the successive convex approximation(SCA) method is employed to solve each subproblem using different propositions. In addition, an alternating optimization(AO)-based location RSMA(L-RSMA) beamforming algorithm is developed to implement joint optimization to obtain the suboptimal solution. Numerical results demonstrate that(1) the proposed L-RSMA scheme yields a28.97% higher sum secrecy rate than the baseline L-space division multiple access(SDMA) scheme;(2) the proposed L-RSMA scheme improves the security performance by 42.61% compared to the L-non-orthogonal multiple access(NOMA) scheme.

关键词： rate-splitting multiple access UAV communication precoding optimization deployment location physical layer security

来源：评论

学校读者我要写书评

暂无评论

Multi‐granularity re‐ranking for visible‐infrared person re‐identification

引用

CAAI Transactions on Intelligence Technology 2023年第3期8卷 770-779页

作者： Yadi Wang Hongyun Zhang Duoqian Miao Witold Pedrycz Department of Computer Science and Technology Tongji UniversityShanghaiChina Key Laboratory of Embedded System and Service Computing Ministry of EducationShanghaiChina Department of Electrical and Computer Engineering University of AlbertaEdmontonAlbertaCanada System Research Institute Polish Academy of SciencesWarsawPoland

Visible‐infrared person re‐identification(VI‐ReID)is a supplementary task of single‐modality re‐identification,which makes up for the defect of conventional re‐identification under insufficient *** is more challenging than single‐modality ReID because,in addition to difficulties in pedestrian posture,camera shoot-ing angle and background change,there are also difficulties in the cross‐modality *** works only involve coarse‐grained global features in the re‐ranking calculation,which cannot effectively use fine‐grained ***,fine‐grained features are particularly important due to the lack of information in cross‐modality re‐*** this end,the Q‐center Multi‐granularity K‐reciprocal Re‐ranking Algorithm(termed QCMR)is proposed,including a Q‐nearest neighbour centre encoder(termed QNC)and a Multi‐granularity K‐reciprocal Encoder(termed MGK)for a more comprehensive feature *** converts the probe‐corresponding modality features into gallery corresponding modality features through modality transfer to narrow the modality *** takes a coarse‐grained mutual nearest neighbour as the dominant and combines a fine‐grained nearest neighbour as a supplement for similarity *** experiments on two widely used VI‐ReID benchmarks,SYSU‐MM01 and RegDB have shown that our method achieves state‐of‐the‐art ***,the mAP of SYSU‐MM01 is increased by 5.9%in all‐search mode.

关键词： computer vision recognition

来源：评论

学校读者我要写书评

暂无评论

Automated object recognition in high-resolution optical remote sensing imagery

引用

National Science Review 2023年第6期10卷 38-41页

作者： Yazhou Yao Tao Chen Hanbo Bi Xinhao Cai Gensheng Pei Guoye Yang Zhiyuan Yan Xian Sun Xing Xu Hai Zhang School of Computer Science and Engineering Nanjing University of Science and Technology Aerospace Information Research Institute Chinese Academy of Sciences School of Electronic Electrical and Communication Engineering University of Chinese Academy of Sciences Key Laboratory of Network Information System Technology (NIST) Aerospace Information Research Institute Chinese Academy of Sciences Department of Computer Science and Technology Tsinghua University School of Computer Science and Engineering University of Electronic Science and Technology of China Pazhou Laboratory (Huangpu) School of Mathematics Northwest University

INTRODUCTION With the rapid development of remote sensing technology,high-quality remote sensing images have become widely *** automated object detection and recognition of these images,which aims to automatically locate objects of interest in remote sensing images and distinguish their specific categories,is an important fundamental task in the *** provides an effective means for geospatial object monitoring in many social applications,such as intelligent transportation,urban planning,environmental monitoring and homeland security.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Cluster-preserving sampling algorithm for large-scale graphs

引用

Science China(Information Sciences) 2023年第1期66卷 60-76页

作者： Jianpeng ZHANG Hongchang CHEN Dingjiu YU Yulong PEI Yingjun DENG National Digital Switching System E&T Research Center Information Engineering University Network Systems Department of the Strategic Support Force School of Computer Science and Technology Eindhoven University of Technology Center for Applied Mathematics Tianjin University

Graph sampling is a very effective method to deal with scalability issues when analyzing largescale graphs. Lots of sampling algorithms have been proposed, and sampling qualities have been quantified using explicit properties(e.g., degree distribution) of the sample. However, the existing sampling techniques are inadequate for the current sampling task: sampling the clustering structure, which is a crucial property of the current networks. In this paper, using different expansion strategies, two novel top-leader sampling methods(i.e., TLS-e and TLS-i) are proposed to obtain representative samples, and they are capable of effectively preserving the clustering structure. The rationale behind them is to select top-leader nodes of most clusters into the sample and then heuristically incorporate peripheral nodes into the sample using specific expansion strategies. Extensive experiments are conducted to investigate how well sampling techniques preserve the clustering structure of graphs. Our empirical results show that the proposed sampling algorithms can preserve the population's clustering structure well and provide feasible solutions to sample the clustering structure from large-scale graphs.

关键词： graph sampling clustering structure top-leader nodes expansion strategies large-scale graphs

来源：评论

学校读者我要写书评

暂无评论

Discriminative feature encoding for intrinsic image decomposition

引用

Computational Visual Media 2023年第3期9卷 597-618页

作者： Zongji Wang Yunfei Liu Feng Lu Key Laboratory of Network Information System Technology(NIST) Aerospace Information Research InstituteChinese Academy of SciencesBeijing 100190China State Key Laboratory of Virtual Reality Technology and Systems School of Computer Science and EngineeringBeihang UniversityBeijing 100191China Peng Cheng Laboratory Shenzhen 518000China

Intrinsic image decomposition is an important and long-standing computer vision *** an input image,recovering the physical scene properties is *** physically motivated priors have been used to restrict the solution space of the optimization problem for intrinsic image *** work takes advantage of deep learning,and shows that it can solve this challenging computer vision problem with high *** focus lies in the feature encoding phase to extract discriminative features for different intrinsic layers from an input *** achieve this goal,we explore the distinctive characteristics of different intrinsic components in the high-dimensional feature embedding *** define feature distribution divergence to efficiently separate the feature vectors of different intrinsic *** feature distributions are also constrained to fit the real ones through a feature distribution *** addition,a data refinement approach is provided to remove data inconsistency from the Sintel dataset,making it more suitable for intrinsic image *** method is also extended to intrinsic video decomposition based on pixel-wise correspondences between adjacent *** results indicate that our proposed network structure can outperform the existing state-of-the-art.

关键词： intrinsic image decomposition deep learning feature distribution data refinement

来源：评论

学校读者我要写书评

暂无评论

P3DC:Reducing DRAM Cache Hit Latency by Hybrid Mappings

引用

Journal of computer Science & Technology 2024年第6期39卷 1341-1360页

作者： Ye Chi Ren-Tong Guo Xiao-Fei Liao Hai-Kun Liu Jianhui Yue National Engineering Research Center for Big Data Technology and System Wuhan 430074China Services Computing Technology and System Laboratory Wuhan 430074China Cluster and Grid Computing Laboratory Wuhan 430074China School of Computer Science and Technology Huazhong University of Science and TechnologyWuhan 430074China School of Big Data and Internet Shenzhen Technology UniversityShenzhen 518118China Department of Computer Science Michigan Technological UniversityHoughton 49931-1295U.S.A.

Die-stacked dynamic random access memory(DRAM)caches are increasingly advocated to bridge the performance gap between the on-chip cache and the main *** fully realize their potential,it is essential to improve DRAM cache hit rate and lower its cache hit *** order to take advantage of the high hit-rate of set-association and the low hit latency of direct-mapping at the same time,we propose a partial direct-mapped die-stacked DRAM cache called *** design is motivated by a key observation,i.e.,applying a unified mapping policy to different types of blocks cannot achieve a high cache hit rate and low hit latency *** address this problem,P3DC classifies data blocks into leading blocks and following blocks,and places them at static positions and dynamic positions,respectively,in a unified set-associative *** also propose a replacement policy to balance the miss penalty and the temporal locality of different *** addition,P3DC provides a policy to mitigate cache thrashing due to block type *** results demonstrate that P3DC can reduce the cache hit latency by 20.5%while achieving a similar cache hit rate compared with typical set-associative caches.P3DC improves the instructions per cycle(IPC)by up to 66%(12%on average)compared with the state-of-the-art direct-mapped cache—BEAR,and by up to 19%(6%on average)compared with the tag-data decoupled set-associative cache—DEC-A8.

关键词： die-stacked dynamic random access memory(DRAM) cache set-associative direct-mapped hit latency

来源：评论

学校读者我要写书评

暂无评论

Games for Artificial Intelligence research: A Review and Perspectives

IEEE Transactions on Artificial Intelligence

引用

IEEE Transactions on Artificial Intelligence 2024年第12期5卷 5949-5968页

作者： Hu, Chengpeng Zhao, Yunlong Wang, Ziqi Du, Haocheng Liu, Jialin Research Institute of Trustworthy Autonomous System Guangdong Provincial Key Laboratory of Brain-Inspired Intelligent Computation Department of Computer Science and Engineering Shenzhen518055 China LightSpeed Studios Tencent Shenzhen518057 China

Games have been the perfect test beds for artificial intelligence (AI) research for the characteristics that widely exist in real-world scenarios. Learning and optimization, decision-making in dynamic and uncertain environments, game theory, planning and scheduling, design, and education are common research areas shared between games and real-world problems. Numerous open-source games or game-based environments have been implemented to study AI. In addition to single- or multiplayer, collaborative, and adversarial games, there has also been growing interest in implementing platforms for creative design in recent years. Those platforms provide ideal benchmarks for exploring and comparing AI ideas and techniques. This article reviews the games and game-based platforms for AI research, provides guidance on matching particular types of AI with suitable games for testing and matching particular needs in games with suitable AI techniques, discusses the research trend induced by the evolution of those games and platforms, and gives an outlook. © 2024 IEEE.

关键词： Reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

SpectrumChain: a disruptive dynamic spectrum-sharing framework for 6G

引用

Science China(Information Sciences) 2023年第3期66卷 26-39页

作者： Qihui WU Wei WANG Zuguang LI Bo ZHOU Yang HUANG Xianbin WANG College of Electronic and Information Engineering Nanjing University of Aeronautics and Astronautics Key Laboratory of Dynamic Cognitive System of Electromagnetic Spectrum Space Ministry of Industry and Information Technology No.8511 Research Institute of CASIC Department of Electrical and Computer Engineering Western University

The sixth-generation(6G) wireless network will support ubiquitous connectivity and diversified scenarios to satisfy the requirements of various emerging applications. Full spectrum is a key enabler for6G to achieve the ambitious goal of a Tbps-scale data rate. In this paper, we first review the scenario and potential spectrum plan for 6G and then focus on SpectrumChain, a blockchain-based dynamic spectrumsharing(DSS) framework for 6G. The unique characteristics of blockchain for DSS are presented along with key technologies. Finally, the conclusion and future development trends are discussed.

关键词： dynamic spectrum sharing blockchain 6G

来源：评论

学校读者我要写书评

暂无评论

Multi-Label Text Classification for Judicial Texts via Dual Graph and Label Feature Fusion 10

Multi-Label Text Classification for Judicial Texts via Dual ...

引用

10th IEEE Smart World Congress, SWC 2024

作者： Gu, Qiliang Lu, Qin Shandong Engineering Research Center of Big Data Applied Technology Faculty of Computer Science and Technology Jinan China Key Laboratory of Computing Power Network and Information Security Ministry of Education Shandong Computer Science Center Jinan China Shandong Fundamental Research Center for Computer Science Shandong Provincial Key Laboratory of Industrial Network and Information System Security Jinan China

ISBN: (纸本)9798331520861

The legal judgement prediction (LJP) of judicial texts represents a multi-label text classification (MLTC) problem, which in turn involves three distinct tasks: the prediction of charges, legal articles, and terms of penalty. Nevertheless, extant multi-label text classification models tend to eschew the consideration of multiple correlations and semantic information between labels when predicting judicial texts, which may result in the loss of pertinent information. Furthermore, these models do not take full advantage of the local and overall information of the labels in the process of selecting appropriate labels for the text using the multi-head attention mechanism. To address these issues, we propose a new model, BGFLFF, which explores label correlation and semantics among the three tasks by employing Graph Convolutional network (GCN) and multi-head attention mechanisms. In particular, we propose a Bi-Graph Fusion GCN (BGF-GCN), which fuses the co-occurrence matrix of labels with the cosine similarity matrix, thereby fully exploiting the multiple correlations between labels. Furthermore, prior to embedding the tags, the interpretations of the labels are obtained via Google in order to enhance the semantic information between the labels. To further reinforce the interconnections between labels and text and more effectively comprehend the interrelationships between the three tasks, we propose a Multi-Head Label Feature Fusion Attentional Mechanism (MH-LFFAtt), which assigns distinct weights to the pertinent label information in the text by fusing the local and overall features of the labels. The experimental results demonstrate that the F1 score exhibits an improvement of up to 2. 2 8 % and a minimum of 1. 2 9 % across the various tasks of the two datasets. This evidence substantiates the assertion that BGFLFF outperforms the existing baseline model. © 2024 IEEE.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Online Queue-Aware Service Migration and Resource Allocation in Mobile Edge Computing

引用

IEEE Transactions on Vehicular Technology 2025年第5期74卷 8063-8078页

作者： Du, An Jia, Jie Chen, Jian Wang, Xingwei Huang, Min Northeastern University School of Computer Science and Engineering The Engineering Research Center of Security Technology of Complex Network System Shenyang110819 China Northeastern University Key Laboratory of Intelligent Computing in Medical Image Ministry of Education Shenyang110819 China Northeastern University College of Information Science and Engineering State Key Laboratory of Synthetical Automation for Process Industries Shenyang110819 China

Mobile edge computing (MEC) integrated with network Functions Virtualization (NFV) helps run a wide range of services implemented by Virtual network Functions (VNFs) deployed at MEC networks. This emerging paradigm offers flexible edge resource management for Internet Service Providers (ISPs) and improves service satisfaction of diverse applications. However, a critical challenge lies in processing extremely unpredictable and bursty traffic flow, especially in event-trigger sensing tasks. In this paper, we study queue-aware service migration and resource allocation in an MEC network, where different devices with different arrival patterns request different network services. To this end, we first formulate a novel long-term operation cost minimization problem subject to the stability of multiple queues by adopting a simultaneous migration scheme and determining resource allocation dynamically. To address the problem efficiently, we propose an online control framework to make decisions without any prior system *** first adopt the Lyapunov optimization technique to decompose the long-term optimization problem into multiper-slot subproblems. Then, we adopt a decoupled optimization algorithm based on the coordinate descent method and augmented Lagrangian method to solve the offline mixed integer non-linear programming (MINLP) subproblems. Extensive results reveal that the proposed online optimization framework can efficiently balance queue stability and cost consumption. © 1967-2012 IEEE.

关键词： Mobile edge computing

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：