Search alternatives:
algorithm three » algorithm where (Expand Search), algorithm pre (Expand Search)
three function » three functional (Expand Search), tree functional (Expand Search), time function (Expand Search)
algorithm etc » algorithm _ (Expand Search), algorithm b (Expand Search), algorithm a (Expand Search)
etc function » spc function (Expand Search), npc function (Expand Search), beach function (Expand Search)
algorithm fc » algorithm pca (Expand Search), algorithms mc (Expand Search), algorithm _ (Expand Search)
fc function » _ function (Expand Search), a function (Expand Search), 1 function (Expand Search)
algorithm three » algorithm where (Expand Search), algorithm pre (Expand Search)
three function » three functional (Expand Search), tree functional (Expand Search), time function (Expand Search)
algorithm etc » algorithm _ (Expand Search), algorithm b (Expand Search), algorithm a (Expand Search)
etc function » spc function (Expand Search), npc function (Expand Search), beach function (Expand Search)
algorithm fc » algorithm pca (Expand Search), algorithms mc (Expand Search), algorithm _ (Expand Search)
fc function » _ function (Expand Search), a function (Expand Search), 1 function (Expand Search)
-
1
Comparison between different PSO algorithms on function 1–3.
Published 2019“…<p>Comparison between different PSO algorithms on function 1–3.</p>…”
-
2
-
3
Comparison of UACI among different algorithms.
Published 2025“…Based on the 2D-SQSM, this paper further designs a highly robust color image encryption algorithm. First, by introducing different hash functions multiple times, the correlation between the key and plaintext is enhanced, significantly improving resistance against brute-force attacks; second, cyclic shifting and segmentation-recombination operations are applied separately to the three RGB channels to effectively disrupt pixel distribution and significantly reduce spatial correlation between pixels; finally, the chaotic sequence generated by the 2D-SQSM is utilized for XOR diffusion, further enhancing the randomness and diffusion capability of the ciphertext. …”
-
4
Comparison of NPCR among different algorithms.
Published 2025“…Based on the 2D-SQSM, this paper further designs a highly robust color image encryption algorithm. First, by introducing different hash functions multiple times, the correlation between the key and plaintext is enhanced, significantly improving resistance against brute-force attacks; second, cyclic shifting and segmentation-recombination operations are applied separately to the three RGB channels to effectively disrupt pixel distribution and significantly reduce spatial correlation between pixels; finally, the chaotic sequence generated by the 2D-SQSM is utilized for XOR diffusion, further enhancing the randomness and diffusion capability of the ciphertext. …”
-
5
-
6
-
7
-
8
-
9
Three-dimensional function image for testing algorithm performance.
Published 2024“…<p>Three-dimensional function image for testing algorithm performance.…”
-
10
-
11
Average function evaluation times of the three optimization algorithms.
Published 2025“…<p>Average function evaluation times of the three optimization algorithms.…”
-
12
Convergence curves of three algorithms under different test functions.
Published 2024“…<p>Convergence curves of three algorithms under different test functions.</p>…”
-
13
PR curves of three algorithms under different test functions.
Published 2024“…<p>PR curves of three algorithms under different test functions.</p>…”
-
14
-
15
Changes in the relative abundances of signaling functions across initial GA-LR pairs.
Published 2022“…Changes were computed from the fold change (FC) between the relative abundance in each of the 100 runs of the genetic algorithm (GA) with respect to the corresponding relative abundance in the complete list of LR pairs (<a href="http://www.ploscompbiol.org/article/info:doi/10.1371/journal.pcbi.1010715#pcbi.1010715.s002" target="_blank">S1 Table</a>), and shown as the log10(FC+1) transformation (x-axis). …”
-
16
-
17
-
18
-
19
-
20
Convergence curves obtained by different algorithms on 23 benchmark functions.
Published 2025Subjects: