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

Secure data rate maximization for full-duplex UAV-enabled base station

Digital Communications and Networks 2024年第5期10卷 1387-1393页

作者： Chunlong He Xinjie Li Yin Huang Jianzhen Lin Gongbin Qian Xingquan Li Guangdong Key Laboratory of Intelligent Information Processing Shenzhen UniversityShenzhenChina National Mobile Communications Research Laboratory Southeast UniversityNanjing211189China Shenzhen Institute of Information Technology ShenzhenChina

Unmanned Aerial Vehicle(UAV)is an air base station featuring flexible deployment and *** can significantly improve the communication quality of the system due to its line-of-sight channel connection with ground ***,due to the openness of UAV-to-Ground channels,the communication between ground users'devices and UAV is easily *** this paper,we aim to improve the security of communication system by using full-duplex UAV as a mobile air base *** UAV sends interference signals to eavesdroppers and receives signals from ground *** jointly optimize the scheduling between the UAV and ground devices,the transmission power of the UAV and ground devices,as well as the trajectory of the UAV to maximize the minimum average security communication data *** optimization problem is mixed with integers and nonconvex ***,this problem is not a standard convex optimization problem,which can not be solved with standard *** this in mind,we propose an effective algorithm which solves this problem iteratively by applying Successive Convex Approximation(SCA),variable relaxation and ***,numerical results demonstrate the effectiveness of the proposed algorithm.

关键词： UAV relay Physical layer security Full-duplex UAV Power optimization Trajectory optimization

来源：评论

学校读者我要写书评

暂无评论

Dual Averaging for Distributed Unbalanced Optimization with Delayed information

引用

IEEE Transactions on Signal and information processing over Networks 2025年 11卷 366-377页

作者： Huang, Qing Fan, Yuan Cheng, Songsong Anhui University Key Laboratory of Intelligent Computing and Signal Processing of Ministry of Education School of Electrical Engineering and Automation Anhui Hefei230601 China

In this paper, we study a category of distributed constrained optimization problems where each agent has access to local information, communicates with its neighbors, and cooperatively minimizes the aggregated cost functions over time-varying unbalanced graphs. To address the considered problems, we propose a distributed dual averaging algorithm based on a row-stochastic weighted matrix (DDAR), which improves the robustness of network topology compared to conventional push-sum algorithms. Moreover, we develop a modified version of DDAR with delayed information (DDARD), which considers the delays of both network communication and gradient calculation, enhancing the algorithm's flexibility in communication and iteration. Our analysis demonstrates that the DDAR and DDARD achieve the optimal value at rates of O(N/(1-λ)√T) and O(τ2N/(1-λ}})√T}), respectively. Finally, the theoretical results are confirmed by simulation on a logistic regression problem. © 2015 IEEE.

关键词： Cost functions

来源：评论

学校读者我要写书评

暂无评论

Graph neural link predictor based on cycle structure

引用

CAAI Transactions on Intelligence Technology 2025年第2期10卷 615-632页

作者： Yanlin Yang Zhonglin Ye Lei Meng Mingyuan Li Haixing Zhao College of Computer Qinghai Normal UniversityXiningQinghaiChina The State Key Laboratory of Tibetan Intelligent Information Processing and Application XiningQinghaiChina

Currently,the link prediction algorithms primarily focus on studying the interaction between nodes based on chain structure and star structure,which predominantly rely on low-order structural information and do not explore the multivariate interactions between nodes from the perspective of higher-order structural information present in the *** cycle structure is a higher-order structure that lies between the star and clique structures,where all nodes within the same cycle can interact with each other,even in the absence of direct *** a node is encompassed by multiple cycles,it indicates that the node interacts and associates with a greater number of nodes in the network,and it means the node is more important in the network to some ***,if two nodes are included in multiple cycles,it signifies the two nodes are more likely to be ***,firstly,a multi-information fusion node importance algorithm based on the cycle structure information is proposed,which integrates both high-order and low-order structural ***,the obtained integrated structure information and node feature information is regarded as the input features,a two-channel graph neural network model is designed to learn the cycle structure ***,the cycle structure information is utilised for the task of link prediction,and a graph neural link predictor with multi-information interactions based on the cycle structure is ***,extensive experimental validation and analysis show that the node ranking result of the proposed node importance index is more consistent with the actual situation,the proposed graph neural network model can effectively learn the cycle structure information,and using higher-order structural information—cycle information proves to significantly enhance the overall link prediction performance.

关键词： cycle structure higher-order structure link prediction multi-information interactions neural network

来源：评论

学校读者我要写书评

暂无评论

Echo state network based symbol detection in chaotic baseband wireless communication

引用

Digital Communications and Networks 2023年第6期9卷 1319-1330页

作者： Huiping Yin Chao Bai Haipeng Ren Shaanxi Key Laboratory of Complex System Control and Intelligent Information Processing Xi'an University of TechnologyXi'an710048China Xi'an Key Laboratory of Intelligent Equipment Xi'an Technological UniversityXi'an710021China

The Chaotic Baseband Wireless Communication System(CBWCS)is expected to eliminate the Inter-Symbol Interference(ISI)caused by multipath propagation by using the optimal decoding threshold that is the sum of the ISI caused by past decoded bits and the ISI caused by future transmitting ***,the current technique is only capable of removing partial effects of the ISI,because only past decoded bits are available for the suboptimal decoding threshold *** unavailability of the future information needed for the optimal decoding threshold is an obstacle to further improve the Bit Error Rate(BER)*** contrast to the previous method using Echo State Network(ESN)to predict one future bit,the proposed method in this paper predicts the optimal decoding threshold directly using *** proposed ESN-based threshold prediction method simplifies the symbol decoding operation by avoiding the iterative prediction of the output waveform points using ESN and accumulated error caused by the iterative *** this approach,the calculation complexity is reduced compared to the previous ESN-based *** proposed method achieves better BER performance compared to the previous *** reason for this superior result is ***,the proposed ESN is capable of using more future symbols information conveyed by the ESN input to obtain more accurate threshold rather than the previous method in which only one future symbol was ***,the proposed method here does not need to estimate the channel information using Least Squared(LS)method,which avoids the extra error caused by inaccurate channel information *** results and experiment based on a wireless open-access research platform under a practical wireless channel show the effectiveness and superiority of the proposed method.

关键词： Chaotic baseband wireless communication system(CBWCS) Inter-symbol interference(ISI) Echo state network(ESN) Threshold prediction

来源：评论

学校读者我要写书评

暂无评论

An Improved Compressive Sensing-Based Model for Efficient Analysis of Monostatic Electromagnetic Scattering Problems

引用

IEEE Microwave and Wireless Technology Letters 2025年第4期35卷 388-391页

作者： Qi, Qi Fan, Yunuo Cao, Xinyuan Liu, Yi Kong, Meng Huang, Zhixiang Wu, Xianliang Hefei Normal University Anhui Province Key Laboratory of Simulation Calculation and Design for Electronic Information System Hefei230601 China Anhui University Key Laboratory of Intelligent Computing and Signal Processing Ministry of Education Hefei230601 China

To further accelerate the analysis of monostatic electromagnetic (EM) scattering problems of objects, an improved compressive sensing (CS)-based model is proposed. First, an orthogonal subspace spanned by the wide-angle induced currents is identified by means of the wide-angle incident sources. Then, the sparse transform of the induced currents is replaced by the subspace projection. In addition, an optimal number of measurements is determined, only slightly larger than the dimension of the subspace. Finally, the recovery algorithm is simplified to the least-squares method to solve the resulting overdetermined system. Compared with the traditional CS-based model, the proposed model significantly improves the efficiency of the recovery step and optimizes both the requirement for and the way of determining the number of measurements. © 2023 IEEE.

关键词： Least squares approximations

来源：评论

学校读者我要写书评

暂无评论

L_(1)-Smooth SVM with Distributed Adaptive Proximal Stochastic Gradient Descent with Momentum for Fast Brain Tumor Detection

引用

Computers, Materials & Continua 2024年第5期79卷 1975-1994页

作者： Chuandong Qin Yu Cao Liqun Meng School of Mathematics and Information Science North Minzu UniversityYinchuan750021China Ningxia Key Laboratory of Intelligent Information and Big Data Processing Yinchuan750021China

Brain tumors come in various types,each with distinct characteristics and treatment approaches,making manual detection a time-consuming and potentially ambiguous *** tumor detection is a valuable tool for gaining a deeper understanding of tumors and improving treatment *** learning models have become key players in automating brain tumor *** descent methods are the mainstream algorithms for solving machine learning *** this paper,we propose a novel distributed proximal stochastic gradient descent approach to solve the L_(1)-Smooth Support Vector Machine(SVM)classifier for brain tumor ***,the smooth hinge loss is introduced to be used as the loss function of *** avoids the issue of nondifferentiability at the zero point encountered by the traditional hinge loss function during gradient descent ***,the L_(1) regularization method is employed to sparsify features and enhance the robustness of the ***,adaptive proximal stochastic gradient descent(PGD)with momentum,and distributed adaptive PGDwithmomentum(DPGD)are proposed and applied to the L_(1)-Smooth *** computing is crucial in large-scale data analysis,with its value manifested in extending algorithms to distributed clusters,thus enabling more efficient processing ofmassive amounts of *** DPGD algorithm leverages Spark,enabling full utilization of the computer’s multi-core *** to its sparsity induced by L_(1) regularization on parameters,it exhibits significantly accelerated convergence *** the perspective of loss reduction,DPGD converges faster than *** experimental results show that adaptive PGD withmomentumand its variants have achieved cutting-edge accuracy and efficiency in brain tumor ***-trained models,both the PGD andDPGD outperform other models,boasting an accuracy of 95.21%.

关键词： Support vector machine proximal stochastic gradient descent brain tumor detection distributed computing

来源：评论

学校读者我要写书评

暂无评论

On Isodual Double Toeplitz Codes

引用

Journal of Systems Science & Complexity 2024年第5期37卷 2196-2206页

作者： SHI Minjia XU Li SOLÉ Patrick Key Laboratory of Intelligent Computing and Signal Processing Ministry of EducationSchool of Mathematical SciencesAnhui UniversityHefei 230601China State Key Laboratory of Information Security Institute of Information EngineeringChinese Academy of SciencesBeijing 100093China CNRS University of Aix MarseilleCentrale MarseilleI2MMarseille 13284France

Double Toeplitz(shortly DT)codes are introduced here as a generalization of double circulant *** authors show that such a code is isodual,hence formally self-dual(FSD).FSD codes form a far-reaching generalization of self-dual codes,the most important class of codes of rate ***-dual DT codes are characterized as double circulant or double ***,even binary DT codes are characterized as double *** examples obtained by exhaustive search show that the codes constructed have best-known minimum distance,up to one unit,amongst formally self-dual codes,and sometimes improve on the known *** q=2,the authors find four improvements on the best-known values of the minimum distance of FSD *** F4 an explicit construction of DT codes,based on quadratic residues in a prime field,performs equally *** authors show that DT codes are asymptotically good over ***,the authors construct DT codes arbitrarily close to the asymptotic Varshamov-Gilbert bound for codes of rate one half.

关键词： Double circulant codes double Toeplitz codes isodual codes formally self-dual codes

来源：评论

学校读者我要写书评

暂无评论

APFA:Ameliorated Pathfinder Algorithm for Engineering Applications

引用

Journal of Bionic Engineering 2024年第3期21卷 1592-1616页

作者： keyu Zhong Fen Xiao Xieping Gao Key Laboratory of Computing and Stochastic Mathematics of Ministry of Education Hunan Normal UniversityChangsha410081China School of Mathematics and Statistics Hunan Normal UniversityChangsha410081China School of Computer Science Xiangtan UniversityXiangtan411105China Hunan Provincial Key Laboratory of Intelligent Computing and Language Information Processing Hunan Normal UniversityChangsha410081China

Pathfinder algorithm(PFA)is a swarm intelligent optimization algorithm inspired by the collective activity behavior of swarm animals,imitating the leader in the population to guide followers in finding the best food *** algorithm has the characteristics of a simple structure and high ***,PFA faces challenges such as insufficient population diversity and susceptibility to local optima due to its inability to effectively balance the exploration and exploitation *** paper proposes an Ameliorated Pathfinder Algorithm called APFA to solve complex engineering optimization ***,a guidance mechanism based on multiple elite individuals is presented to enhance the global search capability of the ***,to improve the exploration efficiency of the algorithm,the Logistic chaos mapping is introduced to help the algorithm find more high-quality potential solutions while avoiding the worst ***,a comprehensive following strategy is designed to avoid the algorithm falling into local optima and further improve the convergence *** three strategies achieve an effective balance between exploration and exploitation overall,thus improving the optimization performance of the *** performance evaluation,APFA is validated by the CEC2022 benchmark test set and five engineering optimization problems,and compared with the state-of-the-art metaheuristic *** numerical experimental results demonstrated the superiority of APFA.

关键词： Pathfinder algorithm Swarm intelligent Metaheuristic Engineering problems

来源：评论

学校读者我要写书评

暂无评论

An Efficient Multi-objective Approach Based on Golden Jackal Search for Dynamic Economic Emission Dispatch

引用

Journal of Bionic Engineering 2024年第3期21卷 1541-1566页

Dynamic Economic Emission Dispatch(DEED)aims to optimize control over fuel cost and pollution emission,two conflicting objectives,by scheduling the output power of various units at specific *** many methods well-performed on the DEED problem,most of them fail to achieve expected results in practice due to a lack of effective trade-off mechanisms between the convergence and diversity of non-dominated optimal dispatching *** address this issue,a new multi-objective solver called Multi-Objective Golden Jackal Optimization(MOGJO)algorithm is proposed to cope with the DEED *** proposed algorithm first stores non-dominated optimal solutions found so far into an ***,it chooses the best dispatching solution from the archive as the leader through a selection mechanism designed based on elite selection strategy and Euclidean distance index *** mechanism can guide the algorithm to search for better dispatching solutions in the direction of reducing fuel costs and pollutant ***,the basic golden jackal optimization algorithm has the drawback of insufficient search,which hinders its ability to effectively discover more Pareto *** this end,a non-linear control parameter based on the cosine function is introduced to enhance global exploration of the dispatching space,thus improving the efficiency of finding the optimal dispatching *** proposed MOGJO is evaluated on the latest CEC benchmark test functions,and its superiority over the state-of-the-art multi-objective optimizers is highlighted by performance ***,empirical results on 5-unit,10-unit,IEEE 30-bus,and 30-unit systems show that the MOGJO can provide competitive compromise scheduling solutions compared to published DEED ***,in the analysis of the Pareto dominance relationship and the Euclidean distance index,the optimal dispatching solutions provided by MOGJO are the closest to the ideal solutions for minimizing fuel costs

关键词： Dynamic economic emission dispatch Multi-objective optimization Golden jackal Euclidean distance index

来源：评论

学校读者我要写书评

暂无评论

Surface-PMSM Sensorless Control Strategy Based on Reduced-Order Linear Kalman Filter Cooperating with Prediction Error Rolling Compensation

引用

IEEE Transactions on Power Electronics 2025年第8期40卷 10804-10815页

作者： Xu, Sang Shen, Anwen Tang, Qipeng Wang, Miaomiao Luo, Pan Luo, Xin Xu, Jinbang National Key Laboratory of Science and Technology on Multispectral Information Processing Key Laboratory of Image Processing and Intelligent Control School of Artificial Intelligence and Automation Wuhan430074 China Science and Technology on Reactor System Design Technology Laboratory Chengdu China

Kalman filter (KF) is increasingly attracted for sensorless control of surface permanent magnet synchronous motors (SPMSMs) due to its strong robustness against measurement and system noise. However, conventional method suffers from poor position and speed estimation accuracy under dynamic conditions, and high computational cost. In order to solve these problems, an enhanced sensorless control strategy based on reduced-order linear Kalman filter (RLKF) cooperating with prediction error rolling compensation is introduced in this paper. Differing from conventional method, a reduced-order linear state equation encompassing rotor position, speed and torque disturbance is constructed. Then, by obtaining the prediction error of system output using the motor current equation in the predictive reference frame, the optimal estimation of rotor position and speed in KF algorithm is achieved based on the reduced-order model. This not only simplifies the calculation process, but also enhances the position and speed estimation accuracy under dynamic conditions. Meanwhile, a prediction error rolling compensation algorithm is developed to minimize the estimation deviations caused by motor parameters variations. Additionally, the system's dynamic performance is further improved with an adopted speed controller based on torque disturbance feedforward and acceleration feedback. Finally, experimental results verify the effectiveness and feasibility of the proposed strategy.1 © 1986-2012 IEEE.

关键词： Permanent magnets

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：