To address the limitations of the sand cat swarm optimization(SCSO) algorithm which are slow convergence and low accuracy in complex problems,this study proposes an improved SCSO(ISCSO) algorithm that integrates multi...To address the limitations of the sand cat swarm optimization(SCSO) algorithm which are slow convergence and low accuracy in complex problems,this study proposes an improved SCSO(ISCSO) algorithm that integrates multiple enhancement strategies.Firstly,Kent chaotic mapping initializes the population for uniform distribution.Secondly,somersault foraging strategy is introduced during the search and attack phases,allowing the algorithm to escape local optima by intercepting evasive prey.Simultaneously,an adaptive Lévy flight strategy is incorporated into the attack phase to bolster global exploration.Finally,the vertical and horizontal crossover strategy is implemented to enhance population diversity.The performance of the proposed algorithm is evaluated using 16 benchmark test functions.The experimental results demonstrate that ISCSO significantly outperforms the original SCSO and shows notable advantages over other metaheuristic algorithms.Furthermore,application to a pressure vessel design problem verifies ISCSO's effectiveness in solving practical engineering optimization challenges.展开更多
Fountain codes provide an efficient way to transfer information over erasure channels like the Internet. LT codes are the first codes fully realizing the digital fountain concept. They are asymptotically optimal ratel...Fountain codes provide an efficient way to transfer information over erasure channels like the Internet. LT codes are the first codes fully realizing the digital fountain concept. They are asymptotically optimal rateless erasure codes with highly efficient encoding and decoding algorithms. In theory, for each encoding symbol of LT codes, its degree is randomly chosen according to a predetermined degree distribution, and its neighbours used to generate that encoding symbol are chosen uniformly at random. Practical implementation of LT codes usually realizes the randomness through pseudo-randomness number generator like linear congruential method. This paper applies the pseudo-randomness of chaotic sequence in the implementation of LT codes. Two Kent chaotic maps are used to determine the degree and neighbour（s） of each encoding symbol. It is shown that the implemented LT codes based on chaos perform better than the LT codes implemented by the traditional pseudo-randomness number generator.展开更多
基金Supported by the National Key R&D Program of China (No.2022ZD0119000)the Natural Science Foundation of Shaanxi Province (No.2025JC-YBMS-736,2025JC-YBMS-343)Shaanxi Province Key Research and Development Project (2025CY-YBXM-061)。
文摘To address the limitations of the sand cat swarm optimization(SCSO) algorithm which are slow convergence and low accuracy in complex problems,this study proposes an improved SCSO(ISCSO) algorithm that integrates multiple enhancement strategies.Firstly,Kent chaotic mapping initializes the population for uniform distribution.Secondly,somersault foraging strategy is introduced during the search and attack phases,allowing the algorithm to escape local optima by intercepting evasive prey.Simultaneously,an adaptive Lévy flight strategy is incorporated into the attack phase to bolster global exploration.Finally,the vertical and horizontal crossover strategy is implemented to enhance population diversity.The performance of the proposed algorithm is evaluated using 16 benchmark test functions.The experimental results demonstrate that ISCSO significantly outperforms the original SCSO and shows notable advantages over other metaheuristic algorithms.Furthermore,application to a pressure vessel design problem verifies ISCSO's effectiveness in solving practical engineering optimization challenges.
基金Project supported in part by the National Natural Science Foundation of China (Grant Nos 60774088 and 10772135)the Program for New Century Excellent Talents in University of China (NCET)the Foundation of the Application Base and Frontier Technology Research Project of Tianjin (Grant Nos 08JCZDJC21900 and 07CYBJC05800)
文摘Fountain codes provide an efficient way to transfer information over erasure channels like the Internet. LT codes are the first codes fully realizing the digital fountain concept. They are asymptotically optimal rateless erasure codes with highly efficient encoding and decoding algorithms. In theory, for each encoding symbol of LT codes, its degree is randomly chosen according to a predetermined degree distribution, and its neighbours used to generate that encoding symbol are chosen uniformly at random. Practical implementation of LT codes usually realizes the randomness through pseudo-randomness number generator like linear congruential method. This paper applies the pseudo-randomness of chaotic sequence in the implementation of LT codes. Two Kent chaotic maps are used to determine the degree and neighbour（s） of each encoding symbol. It is shown that the implemented LT codes based on chaos perform better than the LT codes implemented by the traditional pseudo-randomness number generator.
