As a typical representative of the NP-complete problem, the traveling salesman problem(TSP) is widely utilized in computer networks, logistics distribution, and other fields. In this paper, a discrete lion swarm optim...As a typical representative of the NP-complete problem, the traveling salesman problem(TSP) is widely utilized in computer networks, logistics distribution, and other fields. In this paper, a discrete lion swarm optimization(DLSO) algorithm is proposed to solve the TSP. Firstly, we introduce discrete coding and order crossover operators in DLSO. Secondly, we use the complete 2-opt(C2-opt) algorithm to enhance the local search ability.Then in order to enhance the efficiency of the algorithm, a parallel discrete lion swarm optimization(PDLSO) algorithm is proposed.The PDLSO has multiple populations, and each sub-population independently runs the DLSO algorithm in parallel. We use the ring topology to transfer information between sub-populations. Experiments on some benchmarks TSP problems show that the DLSO algorithm has a better accuracy than other algorithms, and the PDLSO algorithm can effectively shorten the running time.展开更多
In audio stream containing multiple speakers, speaker diarization aids in ascertaining "who speak when". This is an unsupervised task as there is no prior information about the speakers. It labels the speech...In audio stream containing multiple speakers, speaker diarization aids in ascertaining "who speak when". This is an unsupervised task as there is no prior information about the speakers. It labels the speech signal conforming to the identity of the speaker, namely, input audio stream is partitioned into homogeneous segments. In this work, we present a novel speaker diarization system using the Tangent weighted Mel frequency cepstral coefficient(TMFCC) as the feature parameter and Lion algorithm for the clustering of the voice activity detected audio streams into particular speaker groups. Thus the two main tasks of the speaker indexing, i.e., speaker segmentation and speaker clustering, are improved. The TMFCC makes use of the low energy frame as well as the high energy frame with more effect, improving the performance of the proposed system. The experiments using the audio signal from the ELSDSR corpus datasets having three speakers, four speakers and five speakers are analyzed for the proposed system. The evaluation of the proposed speaker diarization system based on the tracking distance, tracking time as the evaluation metrics is done and the experimental results show that the speaker diarization system with the TMFCC parameterization and Lion based clustering is found to be superior over existing diarization systems with 95% tracking accuracy.展开更多
对于小电流接地系统的单相接地故障选线,传统方法普遍采用基于一维信号的选线模型,存在选线准确率低、抗噪性弱等问题。为此提出一种改进的变分模态分解及Conv Ne Xt的小电流接地系统单相接地故障选线方法。首先引入蚁狮算法优化变分模...对于小电流接地系统的单相接地故障选线,传统方法普遍采用基于一维信号的选线模型,存在选线准确率低、抗噪性弱等问题。为此提出一种改进的变分模态分解及Conv Ne Xt的小电流接地系统单相接地故障选线方法。首先引入蚁狮算法优化变分模态分解算法,通过蚁狮算法自动寻优选取合适的分解次数和惩罚因子,计算分解得到的各分量的分布熵,将其中的噪声分量筛选去除,将其余有效分量进行线性重构得到降噪后的零序电流信号;其次,将经过降噪处理后的一维零序电流信号经格拉姆角场转换为二维图像,制备故障选线数据集;然后,引入预训练的ConvNeXt模型,根据该研究数据模型特征,在其已有权重基础上对模型参数进行对应微调,从而提高模型精度并形成最终的选线模型;最后引入绝对平均误差、均方根误差作为评价指标验证所提降噪算法有效性。分别在加入噪声与否的前提下,将所提模型与3种选线模型相比较。实验结果表明该模型的准确率最高、抗噪性方面更好,其中该研究算法准确率达到了99.82%并且在不同噪声条件下都能维持91%以上的准确率,高于其他选线模型,克服了传统故障选线方法准确率低、抗噪性差的问题。展开更多
This paper mainly studied the problem of energy conserving in wireless sensor networks for target tracking in defensing combats. Firstly, the structures of wireless sensor nodes and networks were illustrated;Secondly,...This paper mainly studied the problem of energy conserving in wireless sensor networks for target tracking in defensing combats. Firstly, the structures of wireless sensor nodes and networks were illustrated;Secondly, the analysis of existing energy consuming in the sensing layer and its calculation method were provided to build the energy conserving objective function;What’s more, the other two indicators in target tracking, including target detection probability and tracking accuracy, were combined to be regarded as the constraints of the energy conserving objective function. Fourthly, the three energy conserving approaches, containing optimizing the management scheme, prolonging the time interval between two adjacent observations, and transmitting the observations selectively, were introduced;In addition, the improved lion algorithm combined with the Logistic chaos sequence was proposed to obtain sensor management schemes. Finally, simulations had been made to prove the effectiveness of the proposed methods and algorithm.展开更多
Vehicular ad-hoc networks (VANETs) are a significant field in the intelligent transportation system (ITS) for improving road security. The interaction among the vehicles is enclosed under VANETs. Many experiments ...Vehicular ad-hoc networks (VANETs) are a significant field in the intelligent transportation system (ITS) for improving road security. The interaction among the vehicles is enclosed under VANETs. Many experiments have been performed in the region of VANET improvement. A familiar challenge that occurs is obtaining various constrained quality of service (QoS) metrics. For resolving this issue, this study obtains a cost design for the vehicle routing issue by focusing on the QoS metrics such as collision, travel cost, awareness, and congestion. The awareness of QoS is fuzzified into a price design that comprises the entire cost of routing. As the genetic algorithm (GA) endures from the most significant challenges such as complexity, unassisted issues in mutation, detecting slow convergence, global maxima, multifaceted features under genetic coding, and better fitting, the currently established lion algorithm (LA) is employed. The computation is analyzed by deploying three well-known studies such as cost analysis, convergence analysis, and complexity investigations. A numerical analysis with quantitative outcome has also been studied based on the obtained correlation analysis among various cost functions. It is found that LA performs better than GA with a reduction in complexity and routing cost.展开更多
基金supported by the National Natural Science Foundation of China(61771293)the Key Project of Shangdong Province(2019JZZY010111)。
文摘As a typical representative of the NP-complete problem, the traveling salesman problem(TSP) is widely utilized in computer networks, logistics distribution, and other fields. In this paper, a discrete lion swarm optimization(DLSO) algorithm is proposed to solve the TSP. Firstly, we introduce discrete coding and order crossover operators in DLSO. Secondly, we use the complete 2-opt(C2-opt) algorithm to enhance the local search ability.Then in order to enhance the efficiency of the algorithm, a parallel discrete lion swarm optimization(PDLSO) algorithm is proposed.The PDLSO has multiple populations, and each sub-population independently runs the DLSO algorithm in parallel. We use the ring topology to transfer information between sub-populations. Experiments on some benchmarks TSP problems show that the DLSO algorithm has a better accuracy than other algorithms, and the PDLSO algorithm can effectively shorten the running time.
文摘In audio stream containing multiple speakers, speaker diarization aids in ascertaining "who speak when". This is an unsupervised task as there is no prior information about the speakers. It labels the speech signal conforming to the identity of the speaker, namely, input audio stream is partitioned into homogeneous segments. In this work, we present a novel speaker diarization system using the Tangent weighted Mel frequency cepstral coefficient(TMFCC) as the feature parameter and Lion algorithm for the clustering of the voice activity detected audio streams into particular speaker groups. Thus the two main tasks of the speaker indexing, i.e., speaker segmentation and speaker clustering, are improved. The TMFCC makes use of the low energy frame as well as the high energy frame with more effect, improving the performance of the proposed system. The experiments using the audio signal from the ELSDSR corpus datasets having three speakers, four speakers and five speakers are analyzed for the proposed system. The evaluation of the proposed speaker diarization system based on the tracking distance, tracking time as the evaluation metrics is done and the experimental results show that the speaker diarization system with the TMFCC parameterization and Lion based clustering is found to be superior over existing diarization systems with 95% tracking accuracy.
文摘对于小电流接地系统的单相接地故障选线,传统方法普遍采用基于一维信号的选线模型,存在选线准确率低、抗噪性弱等问题。为此提出一种改进的变分模态分解及Conv Ne Xt的小电流接地系统单相接地故障选线方法。首先引入蚁狮算法优化变分模态分解算法,通过蚁狮算法自动寻优选取合适的分解次数和惩罚因子,计算分解得到的各分量的分布熵,将其中的噪声分量筛选去除,将其余有效分量进行线性重构得到降噪后的零序电流信号;其次,将经过降噪处理后的一维零序电流信号经格拉姆角场转换为二维图像,制备故障选线数据集;然后,引入预训练的ConvNeXt模型,根据该研究数据模型特征,在其已有权重基础上对模型参数进行对应微调,从而提高模型精度并形成最终的选线模型;最后引入绝对平均误差、均方根误差作为评价指标验证所提降噪算法有效性。分别在加入噪声与否的前提下,将所提模型与3种选线模型相比较。实验结果表明该模型的准确率最高、抗噪性方面更好,其中该研究算法准确率达到了99.82%并且在不同噪声条件下都能维持91%以上的准确率,高于其他选线模型,克服了传统故障选线方法准确率低、抗噪性差的问题。
基金funded by (Defense Pre-Research Fund Project of China), grant number 012015012600A2203NSFC (Natural Science Foundation of China), grant number 61573374。
文摘This paper mainly studied the problem of energy conserving in wireless sensor networks for target tracking in defensing combats. Firstly, the structures of wireless sensor nodes and networks were illustrated;Secondly, the analysis of existing energy consuming in the sensing layer and its calculation method were provided to build the energy conserving objective function;What’s more, the other two indicators in target tracking, including target detection probability and tracking accuracy, were combined to be regarded as the constraints of the energy conserving objective function. Fourthly, the three energy conserving approaches, containing optimizing the management scheme, prolonging the time interval between two adjacent observations, and transmitting the observations selectively, were introduced;In addition, the improved lion algorithm combined with the Logistic chaos sequence was proposed to obtain sensor management schemes. Finally, simulations had been made to prove the effectiveness of the proposed methods and algorithm.
文摘Vehicular ad-hoc networks (VANETs) are a significant field in the intelligent transportation system (ITS) for improving road security. The interaction among the vehicles is enclosed under VANETs. Many experiments have been performed in the region of VANET improvement. A familiar challenge that occurs is obtaining various constrained quality of service (QoS) metrics. For resolving this issue, this study obtains a cost design for the vehicle routing issue by focusing on the QoS metrics such as collision, travel cost, awareness, and congestion. The awareness of QoS is fuzzified into a price design that comprises the entire cost of routing. As the genetic algorithm (GA) endures from the most significant challenges such as complexity, unassisted issues in mutation, detecting slow convergence, global maxima, multifaceted features under genetic coding, and better fitting, the currently established lion algorithm (LA) is employed. The computation is analyzed by deploying three well-known studies such as cost analysis, convergence analysis, and complexity investigations. A numerical analysis with quantitative outcome has also been studied based on the obtained correlation analysis among various cost functions. It is found that LA performs better than GA with a reduction in complexity and routing cost.