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

arXiv 2023年

作者： Wang, Zhe Zhang, Jiayi Ngo, Hien Quoc Ai, Bo Debbah, Mérouane The School of Electronic and Information Engineering Beijing Jiaotong University Beijing100044 China The Frontiers Science Center for Smart High-speed Railway System Beijing Jiaotong University Beijing100044 China The Institute of Electronics Communications and Information Technology Queen’s University BelfastBT3 9DT United Kingdom The State Key Laboratory of Rail Traffic Control and Safety Beijing Jiaotong University Beijing100044 China Frontiers Science Center for Smart High-Speed Railway System The Henan Joint International Research Laboratory of Intelligent Networking and Data Analysis Zhengzhou University Zhengzhou450001 China The Research Center of Networks and Communications Peng Cheng Laboratory Shenzhen518066 China The Technology Innovation Institute Abu Dhabi United Arab Emirates CentraleSupélec University Paris-Saclay Gif-sur-Yvette91192 France

In this paper, we investigate a cell-free massive multiple-input multiple-output system with both access points and user equipments equipped with multiple antennas over the Weichselberger Rayleigh fading channel. We study the uplink spectral efficiency (SE) for the fully centralized processing scheme and large-scale fading decoding (LSFD) scheme. To further improve the SE performance, we design the uplink precoding schemes based on the weighted sum SE maximization. Since the weighted sum SE maximization problem is not jointly over all optimization variables, two efficient uplink precoding schemes based on Iteratively Weighted sum-Minimum Mean Square Error (I-WMMSE) algorithms, which rely on the iterative minimization of weighted MSE, are proposed for two processing schemes investigated. Furthermore, with maximum ratio combining applied in the LSFD scheme, we derive novel closed-form achievable SE expressions and optimal precoding schemes. Numerical results validate the proposed results and show that the I-WMMSE precoding schemes can achieve excellent sum SE performance with a large number of UE antennas. Copyright © 2023, The Authors. All rights reserved.

关键词： MIMO systems

来源：评论

学校读者我要写书评

暂无评论

Flight Path Optimization for UAVs to Provide Location Service to Ground Targets

Flight Path Optimization for UAVs to Provide Location Servic...

引用

IEEE Conference on Wireless Communications and Networking

作者： Youpeng Wang Xiaojun Zhu Lijie Xu College of Computer Science and Technology Nanjing University of Aeronautics and Astronautics Nanjing China Jiangsu Key Laboratory of Big Data Security & Intelligent Processing Nanjing University of Posts and Telecommunications China

ISBN: (数字)9781728131061

ISBN: (纸本)9781728131078

We consider using UAVs to provide location service to ground targets. UAVs fly over the target area and broadcast their locations periodically via wireless signals. When a UAV flies along a straight line, a target will observe the strongest signal when the UAV is at the closest location, based on which it can infer its location. The problem is to minimize the flight length subject to the constraint that the transmission range of a UAV is limited and all targets in the area should be located. We formulate the problem and give an optimal flight path to cover a square with side length no greater than a certain value. In the general case when the given area cannot be covered by the square, we propose to divide UAVs into two groups, whose flight paths are either parallel or orthogonal. We conduct simulations to compare our approach with existing approaches. Results verify the superiority of our approach in terms of flight length and localization error.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Reconfigurable intelligent Surface Assisted High-Speed Train Communications: Coverage Performance Analysis and Placement Optimization

arXiv

引用

arXiv 2023年

作者： Liu, Changzhu He, Ruisi Niu, Yong Han, Zhu Ai, Bo Gao, Meilin Ma, Zhangfeng Wang, Gongpu Zhong, Zhangdui The State Key Laboratory of Advanced Rail Autonomous Operation The School of Electronics and Information Engineering The Frontiers Science Center for Smart High-speed Railway System The Beijing Engineering Research Center of High-Speed Railway Broadband Mobile Communications Beijing Jiaotong University Beijing100044 China The State Key Laboratory of Advanced Rail Autonomous Operation Beijing Jiaotong University Beijing100044 China The National Mobile Communications Research Laboratory Southeast University Nanjing211189 China The Department of Electrical and Computer Engineering The University of Houston HoustonTX77004 United States The Department of Computer Science and Engineering Kyung Hee University Seoul446-701 Korea Republic of Henan Joint International Research Laboratory of Intelligent Networking and Data Analysis Zhengzhou University Zhengzhou450001 China Research Center of Networks and Communications Peng Cheng Laboratory Shenzhen China The Tsinghua Space Center the Beijing National Research Center for Information Science and Technology Tsinghua University Beijing100091 China The College of Information Engineering Shaoyang University Shaoyang422000 China The Beijing Key Lab of Transportation Data Analysis and Mining School of Computer and Information Technology Beijing Jiaotong University Beijing100044 China

Reconfigurable intelligent surface (RIS) emerges as maximization problem is formulated to facilitate RIS discrete an efficient and promising technology for the next wireless phase design and RIS placement optimization, which is subject generation networks and has attracted a lot of attention owing to coverage probability constraint. Simulation results validate to the capability of extending wireless coverage by reflecting that better coverage performance and higher travel distance signals toward targeted receivers. In this paper, we consider can be achieved with deployment of RIS. The impacts of some a RIS-assisted high-speed train (HST) communication system key system parameters including transmission power, signal-to-to enhance wireless coverage and improve coverage probability. noise ratio threshold, number of RIS elements, number of RIS First, coverage performance of the downlink single-input-single- quantization bits, horizontal distance between base station and output system is investigated, and the closed-form expression RIS, and speed of HST on system performance are investigated. of coverage probability is derived. Moreover, travel distance In addition, it is found that RIS can well improve coverage probability with limited power consumption for HST communications. Copyright © 2023, The Authors. All rights reserved.

关键词： Railroads

来源：评论

学校读者我要写书评

暂无评论

APDPk-means: A new differential privacy clustering algorithm based on arithmetic progression privacy budget allocation 21

APDPk-means: A new differential privacy clustering algorithm...

引用

21st IEEE International Conference on High Performance Computing and Communications, 17th IEEE International Conference on Smart City and 5th IEEE International Conference on data Science and systems, HPCC/SmartCity/DSS 2019

作者： Fan, Zexuan Xu, Xiaolong Jiangsu Key Laboratory of Big Data Security AND Intelligent Processing Nanjing University of Posts and Telecommunications Nanjing China School of Computer Science Nanjing University of Posts and Telecommunications Nanjing China

ISBN: (纸本)9781728120584

How to protect users' private data during network data mining has become a hot issue in the fields of big data and network information security. Most current researches on differential privacy k-means clustering algorithms focus on optimizing the selection of initial centroids. However, the traditional privacy budget allocation has the problem that the random noise becomes too large as the number of iterations increases, which will reduce the performance of data clustering. To solve the problem, we improved the way of privacy budget allocation in differentially private clustering algorithm DPk-means, and proposed APDPk-means, a new differential privacy clustering algorithm based on arithmetic progression privacy budget allocation. APDPk-means decomposes the total privacy budget into a decreasing arithmetic progression, allocating the privacy budgets from large to small in the iterative process, so as to ensure the rapid convergence in early iteration. The experiment results show that compared with the other differentially private k-means algorithms, APDPk-means has better performance in availability and quality of the clustering result under the same level of privacy protection. © 2019 IEEE.

关键词： data mining

来源：评论

学校读者我要写书评

暂无评论

Area Charging for Wireless Rechargeable Sensors

Area Charging for Wireless Rechargeable Sensors

引用

International Conference on Computer Communications and Networks (ICCCN)

作者： Haipeng Dai Xiaoyu Wang Lijie Xu Chao Dong Qian Liu Lei Meng Guihai Chen State Key Laboratory for Novel Software Technology Nanjing University Nanjing CHINA Jiangsu Key Laboratory of Big Data Security & Intelligent Processing Nanjing University of Posts and Telecommunications Nanjing CHINA Nanjing University of Aeronautics and Astronautics Nanjing CHINA

ISBN: (数字)9781728166070

ISBN: (纸本)9781728166087

In this paper, we consider the problem of area charging, that is, assuming that there is a mobile charger (MC) equipped with a directional wireless charger whose charging area is in the shape of a sector, and the MC can only recharge sensors on the boundary of an Area of Interest (AOI), how to design an efficient charging scheme for the MC to recharge any sensor inside the AOI with efficient energy while its overall charging time is minimized. To address this problem, we first partition the AOI into two types of subareas, i.e., rectangle-like subareas and sector-like subareas, based on the Medial Axis of the AOI. Second, we propose rectangle-based moving strategy for the rectangle-like subareas, and sector-based rotating strategy for the sector-like subareas, respectively, for the MC. Finally, we calculate charging time of all subareas based on the above two moving strategies, and prove that our algorithm achieves a constant approximation ratio. We evaluate our algorithm by conducting extensive simulation. The results show that on average, other comparison algorithms require at least 18:70 times of charging time of that of our algorithm.

关键词： Sensors Wireless sensor networks Wireless communication Communication system security Approximation algorithms Shape security

来源：评论

学校读者我要写书评

暂无评论

Uncertainty-Aware Deep Co-training for Semi-supervised Medical Image Segmentation

arXiv

引用

arXiv 2021年

作者： Zheng, Xu Fu, Chong Xie, Haoyu Chen, Jialei Wang, Xingwei Sham, Chiu-Wing School of Computer Science and Engineering Northeastern University Shenyang110819 China Engineering Research Center of Security Technology of Complex Network System Ministry of Education China Key Laboratory of Intelligent Computing in Medical Image Ministry of Education Northeastern University Shenyang110819 China School of Computer Science The University of Auckland New Zealand

Semi-supervised learning has made significant strides in the medical domain since it alleviates the heavy burden of collecting abundant pixel-wise annotated data for semantic segmentation tasks. Existing semi-supervised approaches enhance the ability to extract features from unlabeled data with prior knowledge obtained from limited labeled data. However, due to the scarcity of labeled data, the features extracted by the models are limited in supervised learning, and the quality of predictions for unlabeled data also cannot be guaranteed. Both will impede consistency training. To this end, we proposed a novel uncertainty-aware scheme to make models learn regions purposefully. Specifically, we employ Monte Carlo Sampling as an estimation method to attain an uncertainty map, which can serve as a weight for losses to force the models to focus on the valuable region according to the characteristics of supervised learning and unsupervised learning. Simultaneously, in the backward process, we joint unsupervised and supervised losses to accelerate the convergence of the network via enhancing the gradient flow between different tasks. Quantitatively, we conduct extensive experiments on three challenging medical datasets. Experimental results show desirable improvements to state-of-the-art counterparts. Copyright © 2021, The Authors. All rights reserved.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Corrigendum to “Methods to balance the exploration and exploitation in Differential Evolution from different scales: A survey” [Neurocomputing 561 (2023) 126899]

引用

Neurocomputing 2024年 571卷

作者： Yanyun Zhang Guanyu Chen Li Cheng Quanyu Wang Qi Li School of Computer Science and Information Engineering Hubei University No. 368 Youyi Road Wuhan 430062 Hubei China Key Laboratory of Intelligent Sensing System and Security (Hubei University) Ministry of Education China Informatization Office China University of Geosciences No. 388 Lumo Road Wuhan 430074 Hubei China

来源：评论

学校读者我要写书评

暂无评论

Practical prescribed time tracking control with user pre-determinable precision for uncertain nonlinear systems

Practical prescribed time tracking control with user pre-det...

引用

IEEE Conference on Decision and Control

作者： Ye Cao Yongduan Song Energy and Electricity Research Center Jinan University Zhuhai China State Key Laboratory of Power Transmission Equipment & System Security and New Technology Chongqing Key Laboratory of Intelligent Unmanned Systems School of Automation Chongqing University Chongqing China

ISBN: (数字)9781728174471

ISBN: (纸本)9781728174488

In this paper we present a practical prescribed time (PPT) control for a class of uncertain nonlinear systems to achieve pre-assignable precision within a finite time that can be specified in advance irrespective of initial condition or any design parameter. Specifically, by introducing a novel time-varying constraining function, we convert the original finite-time tracking control problem into one with a deferred constraint on tracking error, then by stabilizing of which, we solve the problem with the following appealing features: 1) both settling time and tracking accuracy can be explicitly specified in advance regardless of initial conditions; 2) the proposed control is based upon regular (rather than fractional power) state feedback, thus is continuous and smooth everywhere; and 3) the results are global in that the prescribed time tracking is ensured for states starting from anywhere within physically possible domain.

关键词： Control systems Time-varying systems Steady-state State feedback Control design Stability analysis Nonlinear systems

来源：评论

学校读者我要写书评

暂无评论

LDGCN: An Edge-End Lightweight Dual GCN Based on Single-Channel EEG for Driver Drowsiness Monitoring

引用

IEEE Transactions on Consumer Electronics 2025年

作者： Huang, Jingwei Wang, Chuansheng Huang, Jiayan Fan, Haoyi Xue, Xingsi Zhang, Fuquan Fuzhou University College of Computer and Big Data Fuzhou China Polytechnic University of Catalonia Department of Automatic Control Barcelona Spain Putian University New Engineering Industry College Putian China Fujian University of Technology Fujian Provincial Key Laboratory of Big Data Mining and Applications Fujian Fuzhou350118 China Minjiang University Fujian Provincial Key Laboratory of Information Processing and Intelligent Control Fuzhou China Minjiang University College of Computer and Control Engineering Fuzhou China Sichuan Conservatory of Music Digital Media Art Key Laboratory of Sichuan Province Chengdu China Minjiang University Fuzhou Technology Innovation Center of Intelligent Manufacturing information System Fuzhou China Fuzhou China

Driver drowsiness electroencephalogram (EEG) signal monitoring can promptly alert drivers of their drowsiness in edge-end Consumer Electronics (CE), thereby reducing the probability of traffic accidents. Graph convolutional networks (GCNs) have shown significant advancements in processing the non-stationary, time-varying, and non-Euclidean nature of EEG signals. However, the existing single-channel EEG adjacency graph construction process lacks interpretability, which hinders the ability of GCNs to effectively extract adjacency graph features, thus affecting the performance of drowsiness monitoring. To address this issue, we propose an edge-end Lightweight Dual Graph Convolutional Network (LDGCN). Specifically, we are the first to incorporate neurophysiological knowledge to design a Baseline Drowsiness Status Adjacency Graph (BDSAG), which characterizes driver drowsiness status. Additionally, to express more features within limited EEG data, we introduce the Augmented Graph-level Module (AGM). This module captures global and local information at the graph level, ensuring that BDSAG features remain intact while enhancing effective feature expression capability. To further enhance the application of CE, we apply Adaptive Pruning Optimization (APO) to the channels and neurons of LDGCN, which nearly halves the inference latency. Experiments on benchmark datasets demonstrate that LDGCN offers the best trade-off between monitoring performance and hardware resource utilization, outperforming existing state-of-the-art algorithms. © 1975-2011 IEEE.

关键词： Neurons

来源：评论

学校读者我要写书评

暂无评论

G-Strong Chain Recurrent Point And G-Chain Equivalent Point of Topological G-Conjugacy On Metric G-Space

G-Strong Chain Recurrent Point And G-Chain Equivalent Point ...

引用

2019虚拟现实与智能系统国际会议

作者： Ji Zhan-jiang Tu Jing-xian School of Data Science and Software Engineering Wuzhou University Guangxi Colleges and Universities Key Laboratory of Image Processing and Intelligent Information System Wuzhou University Guangxi Colleges and Universities Key Laboratory of Professional Software Technology Wuzhou University

ISBN: (纸本)9781728150505

In this paper,we study the dynamical properties of Gstrong chain recurrent point,G-chain point set and G-chain equivalent point of topological G-conjugacy on metric *** inference,we give the following conclusions that if let f:X→X and f:Y→Y be two continous map of metric G-space X and *** the map h:X→Y is a topogical G-conjugacy from f to f,then（1） h(SCR（f）)=SCR（f）;（2） h(S（x,f）)=S(h（x）,f);（3）h(CE（x,f）)=CE(h（x）,f).These results will enrich the theory of G-strong chain recurrent point,G-chain point and G-chain equivalent point of topological G-conjugacy on metric G-space

关键词： metric G-space topological G-conjugacy G-strong chain recurrent point G-chain point G-chain equivalent point

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：