Venn diagrams showing overlap of the total of overrepresented/underrepresented kinases for both cohorts. by Erica A. K. DePasquale (11851483)

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

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

Subjects:

Bioinformatic Analysis Reveals both Oversampled and Underexplored Biosynthetic Diversity in Nonribosomal Peptides by Bo-Siyuan Jian (14669996)

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

“…The average running time of the proposed algorithm in Sphere function and Griebank function was 2.67s and 1.64s, respectively. …”

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

“…The average running time of the proposed algorithm in Sphere function and Griebank function was 2.67s and 1.64s, respectively. …”

Comparison of scores obtained by our interpenetration and scoring algorithm (ISA) and ROSETTA for a subset of structures. by Kevin Sawade (16726527)

“…However, our algorithm was 1000 times faster than pyROSETTA (both algorithms have been parallelized on a per-structure basis using the Python package joblib [<a href="http://www.ploscompbiol.org/article/info:doi/10.1371/journal.pcbi.1010531#pcbi.1010531.ref069" target="_blank">69</a>]).…”

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

Comparison of the performance of both models against 13 other models on the independent test dataset. by Aastha Vatsyayan (9981916)

Varietal predicted parameters under both water conditions per groups of varieties. by Maud Delattre (19106551)

Evolution of the rescaled hydraulic diameter () and complexity () in both simulations and seal tomograms as a function of simulation timestep and relative age (). by Jonathan E Kings (20818367)

Continuous Probability Distributions generated by the PIPE Algorithm by LUIS G.B. PINHO (14073372)

“…The PIPE algorithm can generate several candidate functions to fit the empirical distribution of data. …”

Efficient Algorithms for GPU Accelerated Evaluation of the DFT Exchange-Correlation Functional by Ryan Stocks (16867476)

“…Kohn–Sham density functional theory (KS-DFT) has become a cornerstone for studying the electronic structure of molecules and materials. …”

The impact of extrinsic noise sources on the measured SNR is plotted for both CW and TG against varying optical filter magnitudes. by Nicholas H. Vitale (20469289)

Schematics for gmxapi operations. by M. Eric Irrgang (4487278)

Fuzzy membership functions for yaw with Δ<i>ρ</i>_<i>u</i>. by Yasir Mehmood (744452)

The pseudocode for the NAFPSO algorithm. by Huichao Guo (14515171)

“…The experimental results show that compared with the traditional particle swarm optimization algorithm, NACFPSO performs well in both convergence speed and scheduling time, with an average convergence speed of 81.17 iterations and an average scheduling time of 200.00 minutes; while the average convergence speed of the particle swarm optimization algorithm is 82.17 iterations and an average scheduling time of 207.49 minutes. …”

PSO algorithm flowchart. by Huichao Guo (14515171)

“…The experimental results show that compared with the traditional particle swarm optimization algorithm, NACFPSO performs well in both convergence speed and scheduling time, with an average convergence speed of 81.17 iterations and an average scheduling time of 200.00 minutes; while the average convergence speed of the particle swarm optimization algorithm is 82.17 iterations and an average scheduling time of 207.49 minutes. …”

Parselmouth for bioacoustics: automated acoustic analysis in Python by Yannick Jadoul (11498813)

“…Five years ago, the Python package Parselmouth was released to provide easy and intuitive access to all functionality in the Praat software. …”