The result of Wilcoxon signed-rand test. by Yi Tao (178829)

Subjects: “…evolutionary genetic algorithm…”

The Simulation and optimization process of pipe diameter selection. by Yi Tao (178829)

Subjects: “…evolutionary genetic algorithm…”

Optional pipe diameter and unit price of NYN. by Yi Tao (178829)

Subjects: “…evolutionary genetic algorithm…”

Optional pipe diameter and unit price of HN. by Yi Tao (178829)

Subjects: “…evolutionary genetic algorithm…”

The topology of HN. by Yi Tao (178829)

Subjects: “…evolutionary genetic algorithm…”

Information of nodes and pipes of HN. by Yi Tao (178829)

Subjects: “…evolutionary genetic algorithm…”

List of selected ranges of movements(ROM), from which features were then counted. by Jindřich Adolf (17334216)

Smoothing curve from GAM model in which the survival of smaller cluster has been modeled as a smooth function of the sample size. by Muhammad Atif (2575789)

Smoothing curve from GAM model in which the survival of smaller cluster has been modeled as a smooth function of the sample size. by Muhammad Atif (2575789)

Practical rules for summing the series of the Tweedie probability density function with high-precision arithmetic by NELSON L. DIAS (8078003)

“…With these practical rules, simple summation algorithms provide sufficiently robust results for the calculation of the density function and its definite integrals. …”

Ranking distribution and average ranking on 23 benchmark functions. by Yuqi Xiong (12343771)

Subjects:

Flowchart of DAPF-RRT algorithm. by Zhenggang Wang (1753657)

“…<div><p>In response to the widely used RRT-Connect path planning algorithm in the field of robotic arms, which has problems such as long search time, random node growth, multiple and unsmooth path turns, a path planning algorithm combining dynamic step size and artificial potential field is proposed. …”

Performance comparison of different algorithms. by Zhenggang Wang (1753657)

“…<div><p>In response to the widely used RRT-Connect path planning algorithm in the field of robotic arms, which has problems such as long search time, random node growth, multiple and unsmooth path turns, a path planning algorithm combining dynamic step size and artificial potential field is proposed. …”

Video of the experimental trial which is shown in Fig 1. by Pratik Mullick (12851011)

The image of the Aekley function. by Zhengyu Xu (8550660)

Ranking distribution and average ranking on CEC2022 benchmark functions. by Yuqi Xiong (12343771)

Subjects:

The ALO algorithm optimization flowchart. by Wenjing Wang (181404)

“…The total objective function was 1542.54 $/hr, which was an average reduction of 53.55 $/hr compared to the other five algorithms. …”

The IALO algorithm solution flowchart. by Wenjing Wang (181404)

“…The total objective function was 1542.54 $/hr, which was an average reduction of 53.55 $/hr compared to the other five algorithms. …”

Comparison of UACI among different algorithms. by Feixian Liu (22477943)

“…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. …”

Comparison of NPCR among different algorithms. by Feixian Liu (22477943)

“…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. …”