CARNOT: a Fragment-Based Direct Molecular Dynamics and Virtual–Reality Simulation Package for Reactive Systems by Xin Chen (14149)

“…A graph-data structure algorithm was incorporated in CARNOT for the analysis of reaction networks, suitable for reaction mechanism reduction. …”

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)

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

Prediction performance of different optimization algorithms. by Ali-Kemal Aydin (10968731)

“…<p>(A) 3 algorithms were compared in terms of the residuals of the cost function of the optimized TF on 7 mice datasets (Derivative free algorithm failed in optimizing a TF in a mouse). …”

Standard functions to test. by Kemal Gökhan Nalbant (18858009)

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

libEnsemble: New capabilities for coordinating dynamic ensembles of calculations by John-Luke Navarro (9024008)

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

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)

ADT: A Generalized Algorithm and Program for Beyond Born–Oppenheimer Equations of “<i>N</i>” Dimensional Sub-Hilbert Space by Koushik Naskar (7510592)

“…In order to overcome such shortcoming, we develop a generalized algorithm, “ADT” to generate the nonadiabatic equations through symbolic manipulation and to construct highly accurate diabatic surfaces for molecular processes involving excited electronic states. …”

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)