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

2021 CIE International Conference on Radar, Radar 2021

作者： Zhang, Di Wan, Qun School of Information and Communication Engineering University of Electronic Science and Technology of China Chengdu China Agile and Intelligent Computing Key Laboratory of Sichuan Province Chengdu China

ISBN: (纸本)9781665498142

In this paper we study the problem of hypothesis testing for detection of a block-sparse signal, which consists of clusters of non-zero elements, from the magnitude-only measurements. As a typical phase retrieval problem, the detection is solved by a method based on convex programming. We derive a detector for the measurement model of this paper and analyze the theoretical performance of the proposed detector. The advantages of our method are indicated in numerical experiments of region of convergence and noise-robustness, etc.. Specifically, the number of requiring measurements of our method for a successful detection is apparently lower than counterparts. © 2021 IEEE.

关键词： block-sparse signal convex programming detection phase retrieval

来源：评论

学校读者我要写书评

暂无评论

St-Tnet: An Spatio-Temporal Joint Transformer Network for Csi Feedback in Fdd-Mimo Systems

SSRN

引用

SSRN 2024年

作者： Wang, Linyu Cao, Yize Xiang, Jianhong Harbin Engineering University China College of Information and Communication Engineering Harbin Engineering University Harbin150001 China Key Laboratory of Advanced Ship Communication and Information Technology Harbin Engineering University Harbin150001 China Agile and Intelligent Computing Key Laboratory Chengdu610000 China

In recent years, deep learning methods have been shown to have strong potential and superiority in reducing channel state information (CSI) feedback overhead and further improving feedback accuracy to maximize the performance benefits of massive MIMO in frequency division duplex (FDD) mode. As the CSI matrices are transformed into sequences for input to the Transformer model, the rearrangement leads to the loss of the original physical location relationships. Based on this problem, this paper proposes a transformer decoder based on spatio-temporal joint (ST-T). We employ a spatial attention mechanism to compensate for this information loss and focus on key spatial features more accurately, further exploiting the potential of single- and two-layer transformers in reconstructing CSI matrices. The results are validated by simulations based on DCRNet and CLNet encoders, which show that higher performance can be achieved with lower computational load compared to other lightweight models. © 2024, The Authors. All rights reserved.

关键词： Channel state information

来源：评论

学校读者我要写书评

暂无评论

Joint classification of hyperspectral and SAR data using asymmetric residual cross transformer

Joint classification of hyperspectral and SAR data using asy...

引用

IET International Radar Conference (IRC 2023)

作者： Yaxiu Sun Minhui Wang Rui Sun Lihong Hao Jianhong Xiang National Key Laboratory of Communication Anti-Jamming Technology College of Information and Communication Engineering Harbin Engineering University Harbin People's Republic of China Agile and Intelligent Computing Key Laboratory Chengdu People's Republic of China

ISBN: (数字)9781837240982

With the increasing amount of remote sensing (RS) data obtained from satellites or airborne platforms, The combined use of multimodal remote sensing data to improve classification performance has been widely concerned. Therefore, a new transformer-based hyperspectral and synthetic aperture radar (HS-SAR) data joint classification network ACCT was proposed in the paper. Combining the strengths of convolutional neural networks (CNN) and transformer, focus on extracting specific and common features from HS and SAR data. In addition, adding layer scale to the output of each residual block can learn diagonal matrix and improve the dynamics of training. Then, combining the advantages of residual join and asymmetric convolution kernel, the parameters are reduced while the feature information is fully learned. Experiments in this paper are carried out on two famous multimodal fusion datasets: Augsburg (AU), and Berlin (BL) datasets. Results show that ACCT achieves better classification accuracy than several existing models. OA reaches 97.20%, and 85.02% on the two datasets.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Cross-Silo Heterogeneous Model Federated Multitask Learning

arXiv

引用

arXiv 2022年

作者： Cao, Xingjian Li, Zonghang Sun, Gang Yu, Hongfang Guizani, Mohsen UESTC China Pengcheng Laboratory Shenzhen China Agile and Intelligent Computing Key Laboratory of Sichuan Province Chengdu China Abu Dhabi United Arab Emirates

Federated learning (FL) is a machine learning technique that enables participants to collaboratively train high-quality models without exchanging their private data. Participants utilizing cross-silo federated learning (CS-FL) settings are independent organizations with different task needs, and they are concerned not only with data privacy but also with independently training their unique models due to intellectual property considerations. Most existing FL methods are incapable of satisfying the above scenarios. In this study, we present a novel federated learning method CoFED based on unlabeled data pseudolabeling via a process known as cotraining. CoFED is a federated learning method that is compatible with heterogeneous models, tasks, and training processes. The experimental results suggest that the proposed method outperforms competing ones. This is especially true for non-independent and identically distributed settings and heterogeneous models, where the proposed method achieves a 35% performance improvement. Copyright © 2022, The Authors. All rights reserved.

关键词： Data privacy

来源：评论

学校读者我要写书评

暂无评论

SecureShare: Blockchain based Secure and Verifiable Knowledge Sharing for AI-Generated Content (AIGC) Services

引用

IEEE Transactions on Vehicular Technology 2025年

作者： Fan, Mochan Li, Zonghang Sun, Gang Du, Hongyang Yu, Hongfang Niyato, Dusit University of Electronic Science and Technology of China School of Information and Communication Engineering Chengdu610054 China Agile and Intelligent Computing Key Laboratory of Sichuan Province Chengdu China Department of Electrical and Electronic Engineering 999077 Hong Kong Peng Cheng Laboratory Shenzhen China Nanyang Technological University School of Computer Science and Engineering 639798 Singapore

Benefiting from the rapidly expanding Internet of Things (IoT) data and powerful computing devices, AI-generated content (AIGC) trains models with vast knowledge to provide automated content generation services. Sharing knowledge through the ciphertext-policy attribute-based encryption (CP-ABE) algorithm is beneficial for training high-quality AIGC models to offer better services. However, existing CP-ABE sharing schemes often involve untrusted third parties, which can result in issues such as knowledge deletion, unverifiable access, and single points of failure. To address these challenges, some blockchain-based sharing schemes have been developed. However, they still face privacy leakage problems. In this paper, we propose SecureShare, a secure and verifiable knowledge sharing scheme based on a consortium blockchain for AIGC services. We begin by outlining a blockchain knowledge sharing architecture and optimizing the Delegated Proof of Stake (DPOS) committee node selection method to ensure that entities can achieve verifiable access control. Additionally, to achieve fine-grained access to knowledge ciphertext while preserving privacy, we propose a CP-ABE scheme with Policy Hiding, attribute privacy preservation, and Revocation, referred to as PHR-CP-ABE. PHR-CP-ABE ensures the privacy of access policies and attributes, and users whose attributes have been revoked cannot decrypt knowledge further. A case study on Dall-E clearly illustrates the operational mechanism of the proposed scheme. We provide theoretical analysis of the security of both the AIGC knowledge sharing scheme and PHR-CP-ABE. Through extensive performance analysis and comparisons with existing schemes, our approach demonstrates significant advantages in terms of computation and communication overhead. © 1967-2012 IEEE.

关键词： Ciphertext

来源：评论

学校读者我要写书评

暂无评论

Image encryption based on 2D-SAHM chaotic system and a novel DNA operation rule

引用

The European Physical Journal Special Topics 2023年第6期233卷 1311-1330页

作者： Huang, Lilian Ye, Youxin Liu, Yang College of Information and Communication Engineering Harbin Engineering University Harbin China Key Laboratory of Advanced Marine Communication and Information Technology Harbin Engineering University Ministry of Industry and Information Technology Harbin China National Key Laboratory of Underwater Acoustic Technology Harbin Engineering University Harbin China Sichuan Key Laboratory of Agile Intelligent Computing Southwest China Institute of Electronic Technology Chengdu China

With the continuous development of information technology, ensuring information security has become an important issue. As a widely used multimedia tool, images often face the risk of leakage. Therefore, this paper proposes an image encryption algorithm based on 2D-SAHM chaotic system and a new DNA operation rule. The algorithm first constructs a new chaotic system 2D-SAHM, which has better chaotic characteristics and can generate more random chaotic sequences than the traditional low-dimensional chaotic system. And then, on the basis of this system, the algorithm scrambles and diffuses the image. In the scrambling stage, the whole image is converted into a one-dimensional pixel matrix and divided into several sub-images by double Joseph scrambling. In the diffusion stage, to solve the problem that traditional DNA encryption relies too much on chaotic sequences, this paper proposes a new DNA operation rule. This rule determines the operation symbol of DNA by the type of amino acid, which improves the randomness of the algorithm. The final simulation results and performance analysis show that the algorithm has high security and strong anti-interference ability.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Maximize the Long-term Average Revenue of Network Slice Provider via Admission Control Among Heterogeneous Slices

arXiv

引用

arXiv 2023年

作者： Dai, Miao Sun, Gang Yu, Hongfang Niyato, Dusit University of Electronic Science and Technology of China Chengdu611731 China Agile and Intelligent Computing Key Laboratory of Sichuan Province Chengdu610036 China Peng Cheng Laboratory Shenzhen518066 China School of Computer Science and Engineering Nanyang Technological University Singapore

Network slicing endows 5G/B5G with differentiated and customized capabilities to cope with the proliferation of diversified services, whereas limited physical network resources may not be able to support all service requests. Slice admission control is regarded as an essential means to ensure service quality and service isolation when the network is under burden. Herein, the scenario where rational tenants coexist with partially competitive network slice providers is adopted. We aim to maximize the long-term average revenue of the network operators through slice admission control, with the feasibility of multidimensional resource requirements, the priority differences among heterogeneous slices, and the admission fairness within each slice taken into account concurrently. We prove the intractability of our problem by a reduction from the Multidimensional Knapsack Problem (MKP), and propose a two-stage algorithm called MPSAC to make a sub-optimal solution efficiently. The principle of MPSAC is to split the original problem into two sub-problems;inter-slice decision-making and intra-slice quota allocation, which are solved using a heuristic method and a tailored auction mechanism respectively. Extensive simulations are carried out to demonstrate the efficacy of our algorithm, the results show that the long-term average revenue of ours is at least 9.6% higher than comparisons while maintaining better priority relations and achieving improved fairness performance. Copyright © 2023, The Authors. All rights reserved.

关键词： Heuristic methods

来源：评论

学校读者我要写书评

暂无评论

Design and Analysis of Inter-RBs Hopping SCMA System under Jamming Attacks

Design and Analysis of Inter-RBs Hopping SCMA System under J...

引用

International Conference on Communication Technology (ICCT)

作者： Kun Yang Qi Zeng Xing Liu Ke Fang Xianhua Niu College of Electrical Engineering Sichuan University Chengdu China Agile and Intelligent Computing Key Laboratory of Sichuan Province Chengdu China College of Computer Xihua University Chengdu China

Sparse code division multiple access (SCMA) technology has superior time-frequency resource utilization, which can support a large-scale connectivity in B5G/6G cellular. However, the prototypical SCMA always transmits the non-zero code-words over the fixed resource-blocks (RBs), thus likely suffering from severe performance degradation due to the external jamming threats. To address this issue, an improved SCMA system based on inter-RBs hopping is proposed in this paper, where physical RBs utilized by codewords are randomly hopped over the RB-group (i.e., frequency-hopped (FH) subcarriers). To implement the optimal inter-RB hopping SCMA, a pseudo-random hopping strategy is designed via prime code and interleavering operations. By such a hopping strategy, the instantaneous RB of SCMA is uniformly operated over the whole RB-group. Followed by the transceiver of proposed inter-RB hopping SCMA, the signal processing is derived in details. The signal processing and simulation results show that, under the jamming scenarios, the proposed inter-RB hopping SCMA system can reduce/average the effect of jamming on bit-error-rate performance, compared to the traditional SCMA systems.

关键词： Degradation Time-frequency analysis Codes Simulation Signal processing Transceivers Complexity theory

来源：评论

学校读者我要写书评

暂无评论

PSACCF: Prioritized Online Slice Admission Control Considering Fairness in 5G/B5G Networks

arXiv

引用

arXiv 2022年

作者： Dai, Miao Luo, Long Ren, Jing Yu, Hongfang Sun, Gang University of Electronic Science and Technology of China Chengdu China Peng Cheng Laboratory Shenzhen China University of Electronic Science and Technology of China Chengdu China Agile and Intelligent Computing Key Laboratory of Sichuan Province Chengdu China

5G/B5G is envisioned to support various services with the assistance of network slices, each slice instance asks for adequate resources to provide the pre-negotiated service quality to its subscribers. Slice Admission Control (SAC) algorithm is a necessity for Slice Providers (SPs) to guarantee the QoS and QoE of each admitted request with limited resources. In that circumstance, the priority concern of services and the fairness of resource allocation arise as meaningful topics for researchers. The former originates from the innate characteristics of various services supported by 5G networks, and the latter matters because slices are instantiated on shared physical equipment. However, the two issues are mainly investigated separately in the literature or do not receive sufficient research simultaneously. In this work, we study the SAC problem in 5G/B5G networks, aiming at enhancing the fairness degree on the premise of satisfying the necessary priority requirements. We first reinterpret priority as a higher cumulative service acceptance ratio (CSAR), and adopt the uniformity of adjacent CSAR gaps to reflect the fairness. Based on these adjustments, the SAC problem is formulated as a non-linear and non-convex multi-objective optimization. Thus, we propose a heuristic algorithm called Prioritized Slice Admission Control Considering Fairness (PSACCF) to solve it. It introduces the resource efficiency of services to amend priority violations, then promotes fairness by setting the target CSARs for each service type and pushing their actual CSARs toward. Numerous simulations are carried out to compare the performance of PSACCF with two existing algorithms, termed MHPF and AHPF. Results show that our algorithm can achieve a nearly identical priority indicator to the comparisons, as well as at least a 33.6% improvement in fairness degree and a higher minimum average resource utilization. Copyright © 2022, The Authors. All rights reserved.

关键词： 5G mobile communication systems

来源：评论

学校读者我要写书评

暂无评论

An Attitude and Altitude Determination Algorithm Based on Doppler Spectrum and Time Delay 6

An Attitude and Altitude Determination Algorithm Based on Do...

引用

6th IEEE International Conference on Computer and Communications, ICCC 2020

作者： Zhang, Yuting Qi, Jingchen Wan, Qun Agile and Intelligent Computing Key Laboratory of Sichuan Province University of Electronic Science and Technology of China Dept. of Electronic Engineering Chengdu China

ISBN: (纸本)9781728186351

Doppler shift is one of the echo information received by the radio altimeter, which contains the attitude of the aircraft. In current altimeter methods, the earliest time delay is generally used to calculate altitude. Here we build a wide beam, high altitude altimeter model, use the echo Doppler spectrum to judge and correct the aircraft's attitude, and then improve the altitude measurement accuracy. Firstly, according to the definition of Doppler shift, the ground target is divided into equidistance rings and equiDoppler bands, and the face target is divided into a set of multiple point targets. Then, the attitude model includes three cases: the beam center points vertically to the ground, attitude angle is greater than the half beam angle, and attitude angle is less than the half beam angle. Under these three models, the aircraft attitude is measured and corrected separately, and the altitude was measured. Finally, the results are simulated to verify the effectiveness of the algorithm. © 2020 IEEE.

关键词： Doppler effect

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：