Data pre-processing and identification of DEGs. by Ziyang Liu (242055)

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)

Functional Projection <i>K</i>-means by Roberto Rocci (16022201)

“…In contrast to existing literature, which largely considers the smoothing as a pre-processing step, in our proposal regularization is integrated with the identification of both subspace and cluster partition. …”

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

Comprehensive Re, F1 and Pre values of FcaNet-CycleGAN model. by Xiaojun Wang (50332)

Spike sorting performance dependence on pre-recording duration. by Tjitse van der Molen (20391106)

A detailed process of iterative simulation coupled with bone density algorithm; (a) a function of stimulus and related bone density changes, and (b) iterative calculations of finit... by Hassan Mehboob (8960273)

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

Code snippets to add user-specific custom functionality in PyNoetic. by Gursimran Singh (575288)

Subjects:

Comparison of optimization performance of six ABC algorithms. 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. …”

Mathematical expressions, weight functions, domains, and orthogonality conditions of various orthogonal polynomials. by Abeer Aljohani (18497914)

Subjects:

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

Modular architecture design of PyNoetic showing all its constituent functions. by Gursimran Singh (575288)

Subjects: