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

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

NONMONOTONE LOCAL MINIMAX METHODS FOR FINDING MULTIPLE SADDLE POINTS

引用

Journal of Computational Mathematics 2024年第3期42卷 851-884页

作者： Wei Liu Ziqing Xie Wenfan Yi South China Research Center for Applied Mathematics and Interdisciplinary Studies South China Normal UniversityGuangzhou 510631China Key Laboratory of Computing and Stochastic Mathematics(Ministry of Education) Hunan Normal UniversityChangshaHunan 410081China Hunan Provincial Key Laboratory of Intelligent Information Processing and Applied Mathematics School of MathematicsHunan UniversityChangshaHunan 410082China

In this paper,by designing a normalized nonmonotone search strategy with the BarzilaiBorwein-type step-size,a novel local minimax method(LMM),which is a globally convergent iterative method,is proposed and analyzed to find multiple(unstable)saddle points of nonconvex functionals in Hilbert *** to traditional LMMs with monotone search strategies,this approach,which does not require strict decrease of the objective functional value at each iterative step,is observed to converge faster with less ***,based on a normalized iterative scheme coupled with a local peak selection that pulls the iterative point back onto the solution submanifold,by generalizing the Zhang-Hager(ZH)search strategy in the optimization theory to the LMM framework,a kind of normalized ZH-type nonmonotone step-size search strategy is introduced,and then a novel nonmonotone LMM is *** feasibility and global convergence results are rigorously carried out under the relaxation of the monotonicity for the functional at the iterative ***,in order to speed up the convergence of the nonmonotone LMM,a globally convergent Barzilai-Borwein-type LMM(GBBLMM)is presented by explicitly constructing the Barzilai-Borwein-type step-size as a trial step-size of the normalized ZH-type nonmonotone step-size search strategy in each ***,the GBBLMM algorithm is implemented to find multiple unstable solutions of two classes of semilinear elliptic boundary value problems with variational structures:one is the semilinear elliptic equations with the homogeneous Dirichlet boundary condition and another is the linear elliptic equations with semilinear Neumann boundary *** numerical results indicate that our approach is very effective and speeds up the LMMs significantly.

关键词： Multiple saddle points Local minimax method Barzilai-Borwein gradient method Normalized nonmonotone search strategy Global convergence

来源：评论

学校读者我要写书评

暂无评论

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

引用

IEEE Transactions on Fuzzy Systems 2025年第6期33卷 1992-2005页

作者： 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.

关键词： Rough sets Noise Feature extraction Classification algorithms Accuracy Machine learning Information systems Data models Computational efficiency Approximation algorithms

来源：评论

学校读者我要写书评

暂无评论

Noise-tolerant fixed-time leader-follower consensus controller design for multi-agent systems via fuzzy-neural-network

引用

Neural computing and Applications 2025年 1-23页

作者： Dai, Jianhua Tan, Ping Xiao, Lin Wang, Zidong He, Yongjun Zuo, Qiuyue Hunan Provincial Key Laboratory of Intelligent Computing and Language Information Processing MOE-LCSM Hunan Normal University Hunan Changsha410081 China Department of Computer Science Brunel University London UxbridgeUB8 3PH United Kingdom

The leader-follower consensus control problem in multi-agent systems (MASs) is critical and has received significant attention. However, the simultaneous achievement of fixed-time stability and robustness is often challenging in MASs due to their inherent complexity and uncertainty. This paper developed a controller based on the proposed noise-tolerant fixed-time fuzzy neural network (NF-FNN) model to realize the leader-follower consensus of MASs. Specifically, the introduction of an integral error term makes the NF-FNN model have powerful noise tolerance, and a fuzzy gain parameter generated by the Takagi-Sugeno fuzzy logic system makes the NF-FNN model have fuzzy adaptiveness. In addition, a new partition-sign-by-power activation function is developed to ensure fixed-time stability of the NF-FNN model. Theoretical analysis and comparative simulations confirm the superb swift stability and excellent noise tolerance of controllers based on the NF-FNN model for achieving the leader-follower consensus of MASs, as compared with existing methods. © The Author(s), under exclusive licence to Springer-Verlag London Ltd., part of Springer Nature 2025.

关键词： Fuzzy neural networks

来源：评论

学校读者我要写书评

暂无评论

Exploiting Multi-Decision and Deep Refinement for Ultrasound Image Segmentation 48

Exploiting Multi-Decision and Deep Refinement for Ultrasound...

引用

48th IEEE International Conference on Acoustics, Speech and Signal processing, ICASSP 2023

作者： Liu, Wenjing Li, Xuanya Hu, Kai Gao, Xieping Xiangtan University Key Laboratory of Intelligent Computing and Information Processing of Ministry of Education Xiangtan411105 China Baidu Inc Beijing100085 China Hunan Normal University Hunan Provincial Key Laboratory of Intelligent Computing and Language Information Processing Changsha410081 China

ISBN: (纸本)9781728163277

In this paper, we propose a novel convolutional neural network (MDR-Net) for ultrasound image segmentation by exploiting multi-decision and deep refinement of the target. Our MDR-Net consists of two main parts, i.e., a multi-decision module (MDM) and a deep refinement module (DRM). Specifically, the MDM effectively addresses the issue of inconspicuous target regions in ultrasound images by combining multi-scale features and multi-receptive field self-attention to enhance the discriminative representation of features and diagnose feature points multiple times. In addition, to alleviate the problem of blurred boundaries and severe speckle noise, the DRM progressively fuses multi-scale features and makes the fused features interact with higher-level features to refine the target details step by step. Finally, we evaluate the proposed method on two publicly available datasets, namely BUSI and UDIAT. We achieve a Dice of 0.8265 and 0.8827 on the two datasets, which are at least 2% and 1.24% higher than other state-of-the-art ultrasound image segmentation methods. © 2023 IEEE.

关键词： Convolutional neural network Deep refinement Multi-decision Ultrasound image segmentation

来源：评论

学校读者我要写书评

暂无评论

Pseudo Multi-Source Domain Extension and Selective Pseudo-Labeling for Unsupervised Domain Adaptive Medical Image Segmentation 48

Pseudo Multi-Source Domain Extension and Selective Pseudo-La...

引用

48th IEEE International Conference on Acoustics, Speech and Signal processing, ICASSP 2023

作者： Liu, Xiaokang Wang, Zhiqiang Hu, Kai Gao, Xieping Xiangtan University Key Laboratory of Intelligent Computing and Information Processing of Ministry of Education Xiangtan411105 China Xiangnan University College of Medical Imaging Laboratory and Rehabilitation Chenzhou423000 China Hunan Normal University Hunan Provincial Key Laboratory of Intelligent Computing and Language Information Processing Changsha410081 China

ISBN: (纸本)9781728163277

Unsupervised domain adaptation (UDA) attracts extra attention in medical image processing because no additional labels are required when adapting to different distributions. In this work, we propose a novel unsupervised domain adaptation framework named as Domain Expansion and PseudoLabeling (DEPL). We extend the domain of a labeled source domain data to four different distributed domains and use adversarial learning to align the image appearance level and feature level from the four different domains to the unlabeled target domain. In addition, we propose a selective pseudolabeling mechanism, namely using strong confidence pseudolabeling to boost model performance. We evaluate our model for the MR to CT adaptation segmentation task on the public dataset MMWHS. Compared to seven other state-of-the-art segmentation methods, our DEPL achieves the best Dice similarity coefficient by 82.4%, which is at least 3.9% higher than the other UDA segmentation methods. © 2023 IEEE.

关键词： Adversarial learning domain extension Image segmentation Selective pseudo-labeling Unsupervised domain adaptive

来源：评论

学校读者我要写书评

暂无评论

Multimodal Graph Neural Network for Recommendation with Dynamic De-redundancy and Modality-Guided Feature De-noisy

arXiv

引用

arXiv 2024年

作者： Mo, Feng Xiao, Lin Song, Qiya Gao, Xieping Liang, Eryao Hunan Provincial Key Laboratory of Intelligent Computing and Language Information Processing Hunan Normal University China

Graph neural networks (GNNs) have become crucial in multimodal recommendation tasks because of their powerful ability to capture complex relationships between neighboring nodes. However, increasing the number of propagation layers in GNNs can lead to feature redundancy, which may negatively impact the overall recommendation performance. In addition, the existing recommendation task method directly maps the preprocessed multimodal features to the low-dimensional space, which will bring the noise unrelated to user preference, thus affecting the representation ability of the model. To tackle the aforementioned challenges, we propose Multimodal Graph Neural Network for Recommendation (MGNM) with Dynamic De-redundancy and Modality-Guided Feature De-noisy, which is divided into local and global interaction. Initially, in the local interaction process,we integrate a dynamic de-redundancy (DDR) loss function which is achieved by utilizing the product of the feature coefficient matrix and the feature matrix as a penalization factor. It reduces the feature redundancy effects of multimodal and behavioral features caused by the stacking of multiple GNN layers. Subsequently, in the global interaction process, we developed modality-guided global feature purifiers for each modality to alleviate the impact of modality noise. It is a two-fold guiding mechanism eliminating modality features that are irrelevant to user preferences and captures complex relationships within the modality. Experimental results demonstrate that MGNM achieves superior performance on multimodal information denoising and removal of redundant information compared to the state-of-the-art methods. Copyright © 2024, The Authors. All rights reserved.

关键词： Graph neural networks

来源：评论

学校读者我要写书评

暂无评论

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

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：