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

Convergence curve of shift function. by Yong Gao (29929)

Out-of-sample accuracy vs. weighted <i>F</i>-score (comparison to ground-truth) for various clustering algorithms. by James Anibal (13899712)

Convergence curves on the functions CL4, CL11, CL13, CL14, CL18, CL19, C17F1, C17F2, and C17F4. by Mahmood A. Jumaah (22272371)

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)

Flowchart for Algorithm 1. by Sagvan Y. Musa (17797611)

Flowchart for Algorithm 2. by Sagvan Y. Musa (17797611)

Algorithm of the brightness scale calibration experiment. by Krzysztof Petelczyc (3954203)

“…<p>In the algorithm, the following variables were used: “I” denotes the current luminous intensity of the reference diode, “inc” denotes the current difference between reference and target diode luminous intensity; “cnt” is the current number of performed trials, while “correct” is a counter of correct answers in cnt trials, both of them are counted separately for every settings of I and inc. …”

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

PathOlOgics_RBCs Python Scripts.zip by Ahmed Elsafty (16943883)