Summary of the contrasts obtained from the normalized images for both inclusions as a function of the host type and the wavelength. by María Victoria Waks-Serra (21578611)

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

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)

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

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)

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

The traffic flow distribution diagram when traffic lights in both entrance and exit of the short-distance road section are red. by Yulin Tian (1457986)

The traffic flow distribution diagram when traffic lights in both entrance and exit of the short-distance road section are green. by Yulin Tian (1457986)

Comparison of different algorithms. by Dawei Wang (471687)

“…A sophisticated optimization model has been developed to simulate the optimal operation of machinery, aiming to maximize equipment utilization efficiency while addressing the challenges posed by worker fatigue. An innovative algorithm, the improved hybrid gray wolf and whale algorithm fused with a penalty function for construction machinery optimization (IHWGWO), is introduced, incorporating a penalty function to handle constraints effectively. …”

The benchmark functions. by Shuhui Yu (1535500)

Study proposed algorithm. by Ainhoa Pérez-Guerrero (21377457)

“…The index of microvascular resistance (IMR) is a specific physiological parameter used to assess microvascular function. Invasive coronary assessment has been shown to be both feasible and safe. …”

Gillespie algorithm simulation parameters. by Nicholas H. Vitale (20469289)

“…Both the ensemble and stochastic models presented in this work have been verified using Monte Carlo molecular dynamic simulations that utilize the Gillespie algorithm. …”

Scheduling time of five algorithms. 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. …”

Convergence speed of five algorithms. 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. …”

EFGs: A Complete and Accurate Implementation of Ertl’s Functional Group Detection Algorithm in RDKit by Gonzalo Colmenarejo (650249)

“…In this paper, a new RDKit/Python implementation of the algorithm is described, that is both accurate and complete. …”

A Genetic Algorithm Approach for Compact Wave Function Representations in Spin-Adapted Bases by Maru Song (22593561)

“…Crucially, we propose fitness functions based on approximate measures of the wave function compactness, which enable inexpensive genetic algorithm searches. …”

Multi-algorithm comparison figure. by Dawei Wang (471687)

“…A sophisticated optimization model has been developed to simulate the optimal operation of machinery, aiming to maximize equipment utilization efficiency while addressing the challenges posed by worker fatigue. An innovative algorithm, the improved hybrid gray wolf and whale algorithm fused with a penalty function for construction machinery optimization (IHWGWO), is introduced, incorporating a penalty function to handle constraints effectively. …”