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

STARS Assisted Semi-Grant-Free NOMA Communications

IEEE Transactions on Wireless Communications 2025年

作者： Xie, Jin Yue, Xinwei Zhao, Jingjing Zou, Yixuan Liu, Yuanwei Liu, Rongke Ding, Zhiguo Key Laboratory of Information and Communication Systems China Beijing Information Science and Technology University Key Laboratory of Modern Measurement and Control Technology Ministry of Education Beijing100101 China Beihang University School of Electronic and Information Engineering Beijing100191 China Queen Mary University of London School of Electronic Engineering and Computer Science LondonE1 4NS United Kingdom The University of Hong Kong Department of Electrical and Electronic Engineering Hong Kong Hong Kong Kyung Hee University Department of Electronic Engineering Gyeonggi-do Yongin-si17104 Korea Republic of Khalifa University Department of Computer and Information Engineering Abu Dhabi United Arab Emirates

This paper investigates the performance of simultaneously transmitting and reflecting surface (STARS) assisted semi-grant-free non-orthogonal multiple access network with randomly distributed users. By deploying STARS, the transmit signals of grant-based user (GBU) and grant-free users (GFUs) can be exquisitely adjusted to reduce interference. We propose a maximum channel scheduling (MCS) protocol that allows a GFU to access GBU’s channel with the assistance of STARS. In particular, the impacts of perfect/imperfect successive interference cancellation (pSIC/ipSIC) on MCS protocol are taken into account. To characterize the performance of STARS aided MCS (STARS-MCS) network, we derive the expressions of outage probability for GBU and GFU with pSIC/ipSIC. By applying convolution theorem and Laplace transform, the asymptotic expressions of outage probability and diversity orders for GBU and GFU are attained. We further design a STARS-based power control (SPC) strategy to eliminate the outage probability error floor and improve the outage performance. Numerical results show that: 1) The performance of STARS-MCS outperforms the existing benchmarks in terms of outage probability and system throughput;2) The SPC strategy can effectively improve the performance of the STARS-MCS network and eliminate the outage probability error floor at high signal-to-noise ratios;and 3) By adjusting reflection and transmission coefficients of STARS, the outage performance of GBU and GFU can be greatly enhanced. © 2025 IEEE. All rights reserved.

关键词： Laplace transforms

来源：评论

学校读者我要写书评

暂无评论

Seamless Graph Task Scheduling over Dynamic Vehicular Clouds: A Hybrid Methodology for Integrating Pilot and Instantaneous Decisions

arXiv

引用

arXiv 2025年

作者： Guo, Bingshuo Liwang, Minghui Xia, Xiaoyu Li, Li Jiao, Zhenzhen Hosseinalipour, Seyyedali Wang, Xianbin School of Informatics Xiamen University Fujian China School of Computing Technologies RMIT University MelbourneVIC Australia Department of Control Science and Engineering Tongji University Shanghai China iF-Labs Beijing Teleinfo Technology Co. Ltd. CAICT China Department of Electrical Engineering University at Buffalo-SUNY NY United States Department of Electrical and Computer Engineering Western University ON Canada

Vehicular clouds (VCs) play a crucial role in the Internet-of-Vehicles (IoV) ecosystem by securing essential computing resources for a wide range of tasks. This paPertackles the intricacies of resource provisioning in dynamic VCs for computation-intensive tasks, represented by undirected graphs for parallel processing over multiple vehicles. We model the dynamics of VCs by considering multiple factors, including varying communication quality among vehicles, fluctuating computing capabilities of vehicles, uncertain contact duration among vehicles, and dynamic data exchange costs between vehicles. Our primary goal is to obtain feasible assignments between task components and nearby vehicles, called templates, in a timely manner with minimized task completion time and data exchange overhead. To achieve this, we propose a hybrid graph task scheduling (P-HTS) methodology that combines offline and online decision-making modes. For the offline mode, we introduce an approach called risk-aware pilot isomorphic subgraph searching (RA-PilotISS), which predicts feasible solutions for task scheduling in advance based on historical information. Then, for the online mode, we propose time-efficient instantaneous isomorphic subgraph searching (TE-InstaISS), serving as a backup approach for quickly identifying new optimal scheduling template when the one identified by RA-PilotISS becomes invalid due to changing conditions. Through comprehensive experiments, we demonstrate the superiority of our proposed hybrid mechanism compared to state-of-the-art methods in terms of various evaluative metrics, e.g., time efficiency such as the delay caused by seeking for possible templates and task completion time, as well as cost function, upon considering different VC scales and graph task topologies. Copyright © 2025, The Authors. All rights reserved.

关键词： Cost functions

来源：评论

学校读者我要写书评

暂无评论

NFV-Enabled Service Recovery in Space-Air-Ground Integrated Networks: A Matching Game Based Approach

arXiv

引用

arXiv 2025年

作者： Jia, Ziye Cao, Yilu He, Lijun Li, Guangxia Zhou, Fuhui Wu, Qihui Han, Zhu College of Electronic and Information Engineering Nanjing University of Aeronautics and Astronautics Nanjing211106 China State Key Laboratory of ISN Xidian University Xian710071 China School of Information and Control Engineering China University of Mining and Technology Xuzhou221116 China Department of Electrical and Computer Engineering University of Houston HoustonTX77004 United States Department of Computer Science and Engineering Kyung Hee University Seoul446-701 Korea Republic of

To achieve ubiquitous connectivity of the sixth generation communication, the space-air-ground integrated network (SAGIN) is a popular topic. However, the dynamic nodes in SAGIN such as satellites and unmanned aerial vehicles, may be fragile and out of operation, which can potentially cause service failure. Therefore, the research on service recovery in SAGIN under situations of resource failure is critical. In order to facilitate the flexible resource utilization of SAGIN, the network function virtualization technology (NFV) is proposed to be employed. Firstly, the task management is transformed into the deployment of service function chains (SFCs). Then, we design an NFV-based SFC recovery model in SAGIN in the face of resource failure, so that tasks can quickly select alternative resources to complete deployments. Moreover, the problem of SFC recovery is formulated to minimize the total time consumption for all completed SFCs. Since it is an NP-hard integer linear programming problem, we propose the efficient recovery algorithm based on the matching game. Finally, via various simulations, the effectiveness of the proposed algorithm and its advantages are verified, where the total time consumption is optimized by about 25%, compared with other benchmark methods. Copyright © 2025, The Authors. All rights reserved.

关键词： Network function virtualization

来源：评论

学校读者我要写书评

暂无评论

A Benchmark and Frequency Compression Method for Infrared Few-Shot Object Detection

引用

IEEE Transactions on Geoscience and Remote Sensing 2025年 63卷

作者： Zhang, Ruiheng Yang, Biwen Xu, Lixin Huang, Yan Xu, Xiaofeng Zhang, Qi Jiang, Zhizhuo Liu, Yu Beijing Institute of Technology State Key Laboratory of Electromechanical Dynamic Control Beijing100081 China University of Technology Sydney School of Electrical and Data Engineering UltimoNSW2007 Australia Anhui Polytechnic University School of Computer and Information Wuhan241000 China Technical University of Munich Data Science in Earth Observation Munich85521 Germany Tsinghua University Shenzhen International Graduate School Shenzhen518055 China Tsinghua University Department of Electronic Engineering Beijing100084 China

Infrared few-shot object detection (IFSOD) aims to detect infrared objects with limited labeled examples. Current infrared datasets, however, suffer from limited diversity in object types and classes, hindering robust evaluation of model generalization on novel classes. To systematically assess dataset quality, we propose metrics for class diversity, instance variability, and object density. By integrating three widely used infrared datasets, we construct the first dataset specifically tailored for IFSOD, increasing instance density to 4.8 (a 1.1 improvement) and expanding the number of classes to 18 (a 5-class increase) compared to the source datasets. Furthermore, frequency analysis of spatial features reveals that sparse annotations introduce spectral bias in the frequency domain. Directly transforming spatial features to the frequency domain, however, mixes background noise with object features, causing spectral leakage and impairing the learning of discriminative features for novel classes. To address these issues, we propose the frequency compression few-shot detection (FC-fsd) method, which incorporates a frequency compression (FC) module. The FC module leverages Discrete Cosine Transform (DCT) within localized windows to reduce spectral leakage and enhance feature clarity. With minimal additional computational overhead, FC-fsd significantly outperforms state-of-the-art methods, achieving nAP50 scores of 28.57 (+13.37) and 35.63 (+2.59) in 1-shot and 2-shot settings, respectively. Our dataset is published at https://***/RuihengZhang/IFSOD-dataset. © 2025 IEEE.

关键词： Zero-shot learning

来源：评论

学校读者我要写书评

暂无评论

Joint high-resolution feature learning and vessel-shape aware convolutions for efficient vessel segmentation

引用

computers in Biology and Medicine 2025年 191卷 109982-109982页

作者： Zhang, Xiang Zhu, Qiang Hu, Tao Guo, Song Bian, Genqing Dong, Wei Hong, Rao Lin, Xia Ling Wu, Peng Zhou, Meili Yan, Qingsen Mohi-ud-din, Ghulam Ai, Chen Li, Zhou College of Information and Control Engineering Xi'an University of Architecture and Technology Xi'an China Shaanxi Provincial Key Lab of Bigdata of Energy and Intelligence Processing School of Physics and Electronic Information Yanan University Yanan China School of Computer Science and Engineering Northwestern Polytechnical University Xi'an China School of Software Nanchang University Nanchang China School of Cyber Security Zhejiang University Hangzhou China Department of Basic Education and Research Jiangxi Police College Nanchang China Northwestern Polytechnical University China

Clear imagery of retinal vessels is one of the critical shreds of evidence in specific disease diagnosis and evaluation, including sophisticated hierarchical topology and plentiful-and-intensive capillaries. In this work, we propose a new topology- and shape-aware model named Multi-branch Vessel-shaped Convolution Network (MVCN) to adaptively learn high-resolution representations from retinal vessel imagery and thereby capture high-quality topology and shape information thereon. Two steps are involved in our pipeline. The former step is proposed as Multiple High-resolution Ensemble Module (MHEM) to enhance high-resolution characteristics of retinal vessel imagery via fusing scale-invariant hierarchical topology thereof. The latter is a novel vessel-shaped convolution that captures the retinal vessel topology to emerge from unrelated fundus structures. Moreover, our MVCN of separating such topology from the fundus is a dynamical multiple sub-label generation via using epistemic uncertainty, instead of manually separating raw labels to distinguish definitive and uncertain vessels. Compared to other existing methods, our method achieves the most advanced AUC values of 98.31%, 98.80%, 98.83%, and 98.65%, and the most advanced ACC of 95.83%, 96.82%, 97.09%,and 96.66% in DRIVE, CHASE_DB1, STARE, and HRF datasets. We also employ correctness, completeness, and quality metrics to evaluate skeletal similarity. Our method's evaluation metrics have doubled compared to previous methods, thereby demonstrating the effectiveness thereof. © 2025 Elsevier Ltd

关键词： Ophthalmology

来源：评论

学校读者我要写书评

暂无评论

Semantic Feature Division Multiple Access for Digital Semantic Broadcast Channels

引用

IEEE Internet of Things Journal 2025年

作者： Ma, Shuai Sun, Zhiye Shen, Bin Wu, Youlong Li, Hang Shi, Guangming Li, Shiyin Al-Dhahir, Naofal Peng Cheng Laboratory Shenzhen518066 China China University of Mining and Technology School of Information and Control Engineering Xuzhou221116 China ShanghaiTech University School of Information Science and Technology Shanghai201210 China Shenzhen Research Institute of Big Data Guangdong Shenzhen518172 China Xidian University School of Artificial Intelligence Shaanxi Xi'an710071 China The University of Texas at Dallas Department of Electrical and Computer Engineering RichardsonTX75080 United States

In this paper, we propose a digital semantic feature division multiple access (SFDMA) paradigm in multi-user broadcast (BC) networks for the inference and the image reconstruction tasks. In this SFDMA scheme, the multi-user semantic information is encoded into discrete approximately orthogonal representations, and the encoded semantic features of multiple users can be simultaneously transmitted in the same time-frequency resource. Specifically, for inference tasks, we design a SFDMA digital BC network based on robust information bottleneck (RIB), which can achieve a tradeoff between inference performance, data compression and multi-user interference. Moreover, for image reconstruction tasks, we develop a SFDMA digital BC network by utilizing a Swin Transformer, which significantly reduces multi-user interference. More importantly, SFDMA can protect the privacy of users' semantic information, in which each receiver can only decode its own semantic information. Furthermore, we establish a relationship between performance and signal to interference plus noise ratio (SINR), which is fitted by an Alpha-Beta-Gamma (ABG) function. Furthermore, an optimal power allocation method is developed for the inference and reconstruction tasks. Extensive simulations verify the effectiveness and superiority of our proposed SFDMA scheme. © 2014 IEEE.

关键词： Image reconstruction

来源：评论

学校读者我要写书评

暂无评论

A Reducing Iteration Orthogonal Matching Pursuit Algorithm for Compressive Sensing

引用

Tsinghua science and Technology 2016年第1期21卷 71-79页

作者： Rui Wang Jinglei Zhang Suli Ren Qingjuan Li School of Computer and Communication Engineering University of Science and Technology Beijing School of Computer and Control Engineering University of Chinese Academy of Sciences

In recent years, Compressed Sensing（CS） has been a hot research topic. It has a wide range of applications, such as image processing and speech signal processing owing to its characteristic of removing redundant information by reducing the sampling rate. The disadvantage of CS is that the number of iterations in a greedy algorithm such as Orthogonal Matching Pursuit（OMP） is fixed, thus limiting reconstruction ***, in this study, we present a novel Reducing Iteration Orthogonal Matching Pursuit（RIOMP） algorithm that calculates the correlation of the residual value and measurement matrix to reduce the number of *** conditions for successful signal reconstruction are derived on the basis of detailed mathematical *** compared with the OMP algorithm, the RIOMP algorithm has a smaller reconstruction error. Moreover, the proposed algorithm can accurately reconstruct signals in a shorter running time.

关键词： compressed sensing signal processing wireless sensor networks

来源：评论

学校读者我要写书评

暂无评论

Collaborative target tracking in WSNs using the combination of maximum likelihood estimation and Kalman filtering

引用

控制理论与应用（英文版） 2013年第1期11卷 27-34页

作者： Xingbo WANG Huanshui ZHANG Minyue FU School of Control Science and Engineering Shandong University School of Electrical Engineering and Computer Science University of Newcastle

Target tracking using wireless sensor networks requires efficient collaboration among sensors to tradeoff between energy consumption and tracking accuracy. This paper presents a collaborative target tracking approach in wire- less sensor networks using the combination of maximum likelihood estimation and the Kalman filter. The cluster leader converts the received nonlinear distance measurements into linear observation model and approximates the covariance of the converted measurement noise using maximum likelihood estimation, then applies Kalman filter to recursively update the target state estimate using the converted measurements. Finally, a measure based on the Fisher information matrix of maximum likelihood estimation is used by the leader to select the most informative sensors as a new tracking cluster for further tracking. The advantages of the proposed collaborative tracking approach are demonstrated via simulation results.

关键词： Target tracking Wireless sensor network Maximum likelihood estimation Kalman filtering Fisher information matrix Sensor selection

来源：评论

学校读者我要写书评

暂无评论

Small-Scale Testbeds for Connected and Automated Vehicles and Robot Swarms: Challenges and a Roadmap

arXiv

引用

arXiv 2025年

作者： Xu, Jianye Alrifaee, Bassam Betz, Johannes Mokhtarian, Armin Mittal, Archak Cai, Mengchi Mangharam, Rahul Shehata, Omar M. Elias, Catherine M. Zaech, Jan-Nico Scheffe, Patrick Jahncke, Felix Ulhas, Sangeet Sankaramangalam Arfvidsson, Kaj Munhoz Department of Computer Science RWTH Aachen University Germany Department of Aerospace Engineering University of the Bundeswehr Munich Germany Professorship of Autonomous Vehicle Systems Technical University of Munich Germany Department of Civil Engineering Indian Institute of Technology Bombay India School of Vehicle and Mobility Tsinghua University China Department of Electrical and Systems Engineering University of Pennsylvania United States Mechatronics Engineering Department Faculty of Engineering and Materials Science The German University in Cairo Egypt Department of Computer Science Engineering The German University in Cairo Egypt INSAIT Sofia University "St. Kliment Ohridski" Bulgaria School for Engineering of Matter Transport and Energy Arizona State University United States Division of Decision and Control Systems KTH Royal Institute of Technology Sweden

This article proposes a roadmap to address the current challenges in small-scale testbeds for Connected and Automated Vehicles (CAVs) and robot swarms. The roadmap is a joint effort of participants in the workshop "1st Workshop on Small-Scale Testbeds for Connected and Automated Vehicles and Robot Swarms," held on June 2 at the IEEE Intelligent Vehicles Symposium (IV) 2024 in Jeju, South Korea. The roadmap contains three parts: 1) enhancing accessibility and diversity, especially for underrepresented communities, 2) sharing best practices for the development and maintenance of testbeds, and 3) connecting testbeds through an abstraction layer to support collaboration. The workshop features eight invited speakers, four contributed papers [1]–[4], and a presentation of a survey paper on testbeds [5]. The survey paper provides an online comparative table of more than 25 testbeds, available at https://***/testbeds-survey. The workshop’s own website is available at https://***/iv24-workshop. Copyright © 2025, The Authors. All rights reserved.

关键词： Testbeds

来源：评论

学校读者我要写书评

暂无评论

Semantic Feature Division Multiple Access for Digital Semantic Multiple Access Channels

引用

IEEE Transactions on Cognitive Communications and Networking 2025年

作者： Shen, Bin Ma, Shuai Chen, Rui Wu, Youlong Li, Hang Shi, Guangming Li, Shiyin Al-Dhahir, Naofal China University of Mining and Technology School of Information and Control Engineering Xuzhou221116 China Xidian University State Key Laboratory of Integrated Service Networks School of Telecommunications Engineering Shaanxi Xi'an710071 China ShanghaiTech University School of Information Science and Technology Shanghai201210 China Shenzhen Research Institute of Big Data Guangdong Shenzhen518172 China Xidian University School of Artificial Intelligence Shaanxi Xi'an710071 China Peng cheng Laboratory Shenzhen518066 China The University of Texas at Dallas Department of Electrical and Computer Engineering RichardsonTX75080 United States

To solve the multi-user semantic communication network capacity bottlenecks, this paper proposes a semantic feature domain multiple access (SFDMA) scheme. By extracting and encoding semantic features and jointly processing multi-user data, the scheme can realize the encoding and transmission of multi-user semantic information in the separated feature subspace. Based on this scheme, a semantic digital multiple access network model is proposed to perform multi-user inference tasks, and an efficient semantic encoding and decoding scheme is developed by using variational information bottleneck (VIB) theory to ensure both the orthogonality in the feature domain and the classification accuracy. Furthermore, a SFDMA model for image reconstruction is designed based on the Swin Transformer. The modified model also considers the reconstruction quality and orthogonality of semantic feature domain. In addition, we design an optimization target for multiple access to implement an adaptive power allocation method for multi-user semantic communications. Simulation results show that our proposed SFDMA scheme exhibits semantic feature domain orthogonality in different applications, and the adaptive power allocation method shows excellent performance in the classification task, and effectively guarantee the quality of service (QoS) of the semantic communications. © 2015 IEEE.

关键词： Image reconstruction

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：