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

arXiv 2025年

作者： Dong, Li Jiang, Feibo Peng, Yubo School of Computer Science Hunan University of Technology and Business Changsha410205 China Xiangjiang Laboratory Changsha410205 China Hunan Provincial Key Laboratory of Intelligent Computing and Language Information Processing Hunan Normal University Changsha410081 China School of Intelligent Software and Engineering Nanjing University Suzhou215163 China

Unmanned Aerial Vehicles (UAVs) in Wireless Power Transfer (WPT)-assisted Internet of Things (IoT) systems face the following challenges: limited resources and suboptimal trajectory planning. Reinforcement learning-based trajectory planning schemes face issues of low search efficiency and learning instability when optimizing large-scale systems. To address these issues, we present an Attention-based UAV Trajectory Optimization (AUTO) framework based on the graph transformer, which consists of an Attention Trajectory Optimization Model (ATOM) and a Trajectory lEarNing Method based on Actor-critic (TENMA). In ATOM, a graph encoder is used to calculate the self-attention characteristics of all IoTDs, and a trajectory decoder is developed to optimize the number and trajectories of UAVs. TENMA then trains the ATOM using an improved Actor-Critic method, in which the real reward of the system is applied as the baseline to reduce variances in the critic network. This method is suitable for high-quality and large-scale multi-UAV trajectory planning. Finally, we develop numerous experiments, including a hardware experiment in the field case, to verify the feasibility and efficiency of the AUTO framework. Copyright © 2025, The Authors. All rights reserved.

关键词： Antennas

来源：评论

学校读者我要写书评

暂无评论

A Bi-selection Method Based on Consistent Matrix for Large-Scale Datasets

引用

IEEE Transactions on Fuzzy Systems 2025年

作者： Quan, Jinsheng Qiao, Fengcai Yang, Tian Shen, Shuo Qian, Yuhua Hunan Normal University Hunan Provincial Key Laboratory of Intelligent Computing and Language Information Processing Institute of Interdisciplinary Studies Changsha410081 China National University of Defense Technology College of Advanced Interdisciplinary Studies Changsha410081 China Shanxi University Institute of Big Data Science and Industry Taiyuan030006 China

Biselection (feature and sample selection) enhances the efficiency and accuracy of machine learning models when handling large-scale data. Fuzzy rough sets, an uncertainty mathematics model known for its excellent interpretability, are widely used in machine learning, particularly for feature selection. While the consistent matrix has significantly improved the computational efficiency and scalability of feature selection, like most fuzzy rough set-based methods, it focuses only on feature selection and seldom incorporates sample selection. This feature-centric approach can limit classification performance, particularly in noisy and large-scale datasets where both features and samples require judicious selection. To overcome these limitations, this article explores the integration of sample selection with feature selection. First, we introduce a β-consistent granulation method to generate more accurate and concise fuzzy information granules, reducing the impact of noisy samples. In addition, a novel membership function is employed to distinguish noise while simultaneously evaluating both features and samples. As a result, a biselection algorithm with linear computation complexity is proposed to select high-quality features and samples. Numerical experiments demonstrate that, compared to eleven representative algorithms, our proposed method achieves an average accuracy improvement of 9.66% and a 933-fold increase in efficiency. © 2025 IEEE.

关键词： Biselection consistent matrix (CM) fuzzy sets granular computing rough sets

来源：评论

学校读者我要写书评

暂无评论

An Efficient WRF Framework for Discovering Risk Genes and Abnormal Brain Regions in Parkinson's Disease Based on Imaging Genetics Data

引用

Journal of Computer Science & Technology 2021年第2期36卷 361-374页

作者： Xia-An Bi Zhao-Xu Xing Rui-Hui Xu Xi Hu College of Information Science and Engineering Hunan Normal UniversityChangsha 410006China Hunan Provincial Key Laboratory of Intelligent Computing and Language Information Processing Hunan Normal UniversityChangsha 410006China

As an emerging research field of brain science,multimodal data fusion analysis has attracted broader attention in the study of complex brain diseases such as Parkinson's disease(PD).However,current studies primarily lie with detecting the association among different modal data and reducing data *** data mining method after fusion and the overall analysis framework are *** this study,we propose a weighted random forest(WRF)model as the feature screening *** interactions between genes and brain regions are detected as input multimodal fusion features by the correlation analysis *** implement sample classification and optimal feature selection based on WRF,and construct a multimodal analysis framework for exploring the pathogenic factors of *** experimental results in Parkinson's Progression Markers Initiative(PPMI)database show that WRF performs better compared with some advanced methods,and the brain regions and genes related to PD are *** fusion of multi-modal data can improve the classification of PD patients and detect the pathogenic factors more comprehensively,which provides a novel perspective for the diagnosis and research of *** also show the great potential of WRF to perform the multimodal data fusion analysis of other brain diseases.

关键词： multimodal fusion feature Parkinson's disease pathogenic factor detection sample classification weighted random forest model

来源：评论

学校读者我要写书评

暂无评论

Lightweight Vision Model-based Multi-user Semantic Communication Systems

arXiv

引用

arXiv 2025年

作者： Jiang, Feibo Tu, Siwei Dong, Li Wang, Kezhi Yang, Kun Liu, Ruiqi Pan, Cunhua Wang, Jiangzhou Hunan Provincial Key Laboratory of Intelligent Computing and Language Information Processing Hunan Normal University Changsha410081 China School of Information Science and Engineering Hunan Normal University Changsha410081 China School of Computer Science Hunan University of Technology and Business Changsha410205 China Xiangjiang Laboratory Changsha410205 China Department of Computer Science Brunel University London United Kingdom School of Computer Science and Electronic Engineering University of Essex ColchesterCO4 3SQ United Kingdom Changchun Institute of Technology China Wireless and Computing Research Institute ZTE Corporation Beijing100029 China National Mobile Communications Research Laboratory Southeast University Nanjing210096 China National Mobile Communications Research Laboratory Southeast University Nanjing China Purple Mountain Laboratories Nanjing China

Semantic Communication (SemCom) is a promising new paradigm for next-generation communication systems, emphasizing the transmission of core information, particularly in environments characterized by uncertainty, noise, and bandwidth constraints. However, existing image SemCom systems face several challenges, such as inefficient knowledge base construction, insufficient semantic encoding, and lack of multi-user semantic sharing. To address these issues, we propose a Lightweight Vision Model-based Multi-user Semantic Communication System (LVM-MSC). First, we construct a Lightweight Knowledge Base (LKB) based on the fast Segment Anything Model (SAM). LKB incorporates the extensive image knowledge of the SAM model while significantly reducing the number of parameters through its convolutional architecture. Next, we design an Efficient Semantic Codec (ESC) based on the Masked AutoEncoder (MAE) architecture. ESC enhances semantic compression at both the pixel and semantic levels and implements lightweight semantic decoding tailored for user devices. Furthermore, we propose a Multi-user Semantic Sharing (MSS) transmission for the multi-user SemCom. By calculating the similarity of semantic information among different users in the sharing semantic space, we unify the transmissions of similar semantic information through broadcasting, further improving the transmission efficiency. Finally, simulation results demonstrate the feasibility and effectiveness of the proposed LVM-MSC system. Copyright © 2025, The Authors. All rights reserved.

关键词： Latent semantic analysis

来源：评论

学校读者我要写书评

暂无评论

Security-Reliability Analysis and Optimization for Cognitive Two-Way Relay Network with Energy Harvesting

引用

China Communications 2024年第11期21卷 163-179页

作者： Luo Yi Zhou Lihua Dong Jian Sun Yang Xu Jiahui Xi Kaixin Hunan Provincial Key Laboratory of Intelligent Computing and Language Information Processing Hunan Normal UniversityChangsha 410081China School of Electronic Information Central South UniversityChangsha 410075China

This paper investigates the security and reliability of information transmission within an underlay wiretap energy harvesting cognitive two-way relay *** the network,energy-constrained secondary network(SN)nodes harvest energy from radio frequency signals of a multi-antenna power *** SN sources exchange their messages via a SN decode-and-forward relay in the presence of a multiantenna eavesdropper by using a four-phase time division broadcast protocol,and the hardware impairments of SN nodes and eavesdropper are *** alleviate eavesdropping attacks,the artificial noise is applied by SN *** physical layer security performance of SN is analyzed and evaluated by the exact closed-form expressions of outage probability(OP),intercept probability(IP),and OP+IP over quasistatic Rayleigh fading ***,due to the complexity of OP+IP expression,a self-adaptive chaotic quantum particle swarm optimization-based resource allocation algorithm is proposed to jointly optimize energy harvesting ratio and power allocation factor,which can achieve security-reliability tradeoff for *** simulations demonstrate the correctness of theoretical analysis and the effectiveness of the proposed optimization algorithm.

关键词： artificial noise energy harvesting cognitive two-way relay network hardware impairments physical layer security security-reliability tradeoff self-adaptive quantum particle swarm optimization

来源：评论

学校读者我要写书评

暂无评论

Identification of differential brain regions in MCI progression via clustering-evolutionary weighted SVM ensemble algorithm

引用

Frontiers of Computer Science 2021年第6期15卷 165-173页

作者： Xia-an BI Yiming XIE Hao WU Luyun XU Hunan Provincial Key Laboratory of Intelligent Computing and Language Information Processing Hunan Normal UniversityChangsha 410081China College of Information Science and Engineering Hunan Normal UniversityChangsha 410081China Business School of Hunan Normal University Changsha 410081China

Mild cognitive impairment(MCI)as the potential sign of serious cognitive decline could be divided into two stages,i.e.,late MCI(LMCI)and early MCI(EMCI).Although the different cognitive states in the MCI progression have been clinically defined,effective and accurate identification of differences in neuroimaging data between these stages still needs to be further *** this paper,a new method of clustering-evolutionary weighted support vector machine ensemble(CEWSVME)is presented to investigate the alterations from cognitively normal(CN)to EMCI to *** CEWSVME mainly includes two *** first step is to build multiple SVM classifiers by randomly selecting samples and *** second step is to introduce the idea of clustering evolution to eliminate inefficient and highly similar SVMs,thereby improving the final classification ***,we extracted the optimal features to detect the differential brain regions in MCI progression,and confirmed that these differential brain regions changed dynamically with the development of *** exactly,this study found that some brain regions only have durative effects on MCI progression,such as parahippocampal gyrus,posterior cingulate gyrus and amygdala,while the superior temporal gyrus and the middle temporal gyrus have periodic effects on the *** work contributes to understanding the pathogenesis of MCI and provide the guidance for its timely diagnosis.

关键词： machine learning MCI progression optimal feature extraction differential brain regions functional magnetic resonance imaging

来源：评论

学校读者我要写书评

暂无评论

Scheduling optimization for upstream dataflows in edge computing

引用

Digital Communications and Networks 2023年第6期9卷 1448-1457页

作者： Haohao Wang Mengmeng Sun Lianming Zhang Pingping Dong Yehua Wei Jing Mei College of Information Science and Engineering Hunan Normal UniversityChangsha410081China Hunan Provincial Key Laboratory of Intelligent Computing and Language Information Processing Hunan Normal UniversityChangsha410081China Hunan Xiangjiang Artificial Intelligence Academy Hunan Normal UniversityChangsha410081China

Edge computing can alleviate the problem of insufficient computational resources for the user equipment,improve the network processing environment,and promote the user *** computing is well known as a prospective method for the development of the Internet of Things(IoT).However,with the development of smart terminals,much more time is required for scheduling the terminal high-intensity upstream dataflow in the edge server than for scheduling that in the downstream *** this paper,we study the scheduling strategy for upstream dataflows in edge computing networks and introduce a three-tier edge computing network *** propose a Time-Slicing Self-Adaptive Scheduling(TSAS)algorithm based on the hierarchical queue,which can reduce the queuing delay of the dataflow,improve the timeliness of dataflow processing and achieve an efficient and reasonable performance of dataflow *** experimental results show that the TSAS algorithm can reduce latency,minimize energy consumption,and increase system throughput.

关键词： Edge computing Time-slicing Dataflow scheduling Dynamic analysis

来源：评论

学校读者我要写书评

暂无评论

GTK:A Hybrid-Search Algorithm of Top-Rank-k Frequent Patterns Based on Greedy Strategy

引用

Computers, Materials & Continua 2020年第6期63卷 1445-1469页

作者： Yuhang Long Wensheng Tang Bo Yang Xinyu Wang Hua Ma Hang Shi Xueyu Cheng Hunan Provincial Key Laboratory of Intelligent Computing and Language Information Processing Hunan Normal UniversityChangsha410081China College of Information Science and Engineering Hunan UniversityChangsha410082China Clayton State University MorrowGA 30260USA

Currently,the top-rank-k has been widely applied to mine frequent patterns with a rank not exceeding *** the existing algorithms,although a level-wise-search could fully mine the target patterns,it usually leads to the delay of high rank patterns generation,resulting in the slow growth of the support threshold and the mining *** at this problem,a greedy-strategy-based top-rank-k frequent patterns hybrid mining algorithm(GTK)is proposed in this *** this algorithm,top-rank-k patterns are stored in a static doubly linked list called RSL,and the patterns are divided into short patterns and long *** short patterns generated by a rank-first-search always joins the two patterns of the highest rank in RSL that have not yet been *** the basis of the short patterns satisfying specific conditions,the long patterns are extracted through *** reduce redundancy,GTK improves the generation method of subsume index and designs the new pruning strategies of *** algorithm also takes the use of reasonable pruning strategies to reduce the amount of computation to improve the computational *** datasets and synthetic datasets are adopted in experiments to evaluate the proposed *** experimental results show the obvious advantages in both time efficiency and space efficiency of GTK.

关键词： Top-rank-k frequent patterns greedy strategy hybrid-search

来源：评论

学校读者我要写书评

暂无评论

A Short Flows Fast Transmission Algorithm Based on MPTCP Congestion Control 6th

A Short Flows Fast Transmission Algorithm Based on MPTCP Con...

引用

6th International Conference on Artificial Intelligence and Security, ICAIS 2020

作者： Zhong, Hua Dong, PingPing Tang, WenSheng Yang, Bo Xie, JingYun Hunan Provincial Key Laboratory of Intelligent Computing and Language Information Processing Hunan Normal University Changsha410081 China

ISBN: (纸本)9783030578831

With the development of cloud computing and big data technology, traffic in the network presents new features. Real-time online interactive applications are increasing, mainly including web services, instant messaging, online commerce, advertising systems. They have very stringent latency requirements. However, the data traffic generated by data backup, movie download, data mining require high bandwidth. When large and small flows are transmitted concurrently, a series of problems will arise. MPTCP treats long and short flows equally. In this way, packets of long flows will preempt bandwidth at the bottleneck link, fill the router’s whole queue buffer. This will cause the short flows transmission timeout. To solve these problems, we propose a novel algorithm named MPTCP-SPTA (MPTCP short flows fast transmission algorithm). The algorithm give high priority to short flows based on the congestion control algorithm, then introduce the Explicit Congestion Notification mechanism(ECN) in MPTCP. Through extensive network simulator (NS-3) simulations, we demonstrate that MPTCP-SPTA outperforms TCP and MPTCP in three typical network topology, which can significantly reduce the completion time of the small flow and effectively improving the total throughput of the network. © 2020, Springer Nature Switzerland AG.

关键词： Web services

来源：评论

学校读者我要写书评

暂无评论

Parameterized Algorithms for Fixed-Order Book Drawing with Bounded Number of Crossings per Edge 14th

Parameterized Algorithms for Fixed-Order Book Drawing with B...

引用

14th International Conference on Combinatorial Optimization and Applications, COCOA 2020

作者： Liu, Yunlong Chen, Jie Huang, Jingui Hunan Provincial Key Laboratory of Intelligent Computing and Language Information Processing Hunan Normal University Changsha410081 China

ISBN: (纸本)9783030648428

Given a graph G= (V, E) and a fixed linear order of V, the problem fixed-order book drawing with bounded number of crossings per edge asks whether there is a k-page book drawing of G such that the maximum number of crossings per edge is upper-bounded by an integer b. This problem was posed by Bhore et al. (GD 2019;J. Graph Algorithms Appl. 2020) and thought to be interesting for further investigation. In this paper, we study the fixed-parameter tractable algorithms for this problem. More precisely, we show that this problem parameterized by both the bounded number b of crossings per edge and the vertex cover number τ of the graph admits an algorithm running in time (b+2)O(τ3)·|V|, and this problem parameterized by both the bounded number b of crossings per edge and the pathwidth κ of the vertex ordering admits an algorithm running in time (b+2)O(κ2)·|V|. Our results provide a specifical answer to Bhore et al.’s question. © 2020, Springer Nature Switzerland AG.

关键词： Parameter estimation

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：