As for Fig 2, we present failure rates as a function of the cohort size (vertical axis) versus the number of distractors (horizontal axis), for the Smyth and McClave baseline algorithm from [76]. by Daniela Huppenkothen (9174507)

“…In the middle left, the converse case, where the embedded cohort is skewed, but the distractors balanced, and finally in the middle right a case where both the embedded cohort to be selected and the distractors have a highly skewed distribution. …”

Comparison of deconvolution and optimization algorithms on a batch of data. by Ali-Kemal Aydin (10968731)

“…Both experimental data have been resampled at 50ms and used to compute a set of TFs (in orange) either with direct deconvolution approaches (Fourier or Toeplitz methods, middle-upper panel TFs) or with 1-Γ function optimization performed by 3 different algorithms (middle-lower panel TFs). …”

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

The benchmark functions. by Shuhui Yu (1535500)

Where to Handle an Exception? Recommending Exception Handling Locations from a Global Perspective by Xiangyang Jia (10026932)

Table_1_Clinical Functional Seizure Score (CFSS): a simple algorithm for clinicians to suspect functional seizures.DOCX by Mohammad Dashtkoohi (15417886)

Using synthetic data to test group-searching algorithms in a context where the correct grouping of species is known and uniquely defined. by Yuanchen Zhao (12905580)

“…The reaction network is assumed to form a linear degradation chain 1 → 2 → ⋯ → <i>N</i> with the end-product concentration (metabolite <i>N</i>, orange) taken as the function of interest (shown with <i>N</i> = 3 as an example). …”

Pipeline of the interactor algorithm. by Jose Cleydson F. Silva (8685594)

Proposed algorithm. by Keenjhar Ayoob (22339616)

Indel markers generated by WheresWalker for each mutant. by McKenna Feltes (11242085)

Subjects:

Candidate lists generated by WheresWalker for each mutant. by McKenna Feltes (11242085)

Subjects:

HIV exposure risk algorithm. HIV exposure risk algorithm based on available data from the Tonse Padmozi trial. by Anna M. Leone (22486372)

Background heterogeneity and sequencing depth improve WheresWalker SNPindex. by McKenna Feltes (11242085)

Subjects:

WheresWalker outperforms homozygosity density mapping for Maize mutant. by McKenna Feltes (11242085)

Subjects:

Explained variance ration of the PCA algorithm. by Abeer Aljohani (18497914)

Subjects:

Flowchart of one iteration of the CE-Symm algorithm. by Spencer E. Bliven (6672755)

Algorithm parameter setting. by Tianrui Zhang (2294542)

“…Experimental results show that the PSCACO algorithm proposed in this paper is compared with MOPSO, CACO and NSGA-II algorithms, and the convergence effect of the algorithm is concluded to be more effective to verify the effectiveness and feasibility of chaotic particle ant colony algorithm for solving multi-objective functions, which proposes a new feasible solution for the supply chain management.…”

Algorithm parameter setting. by Tianrui Zhang (2294542)

“…Experimental results show that the PSCACO algorithm proposed in this paper is compared with MOPSO, CACO and NSGA-II algorithms, and the convergence effect of the algorithm is concluded to be more effective to verify the effectiveness and feasibility of chaotic particle ant colony algorithm for solving multi-objective functions, which proposes a new feasible solution for the supply chain management.…”

Benchmark functions. by Peiwen Zhang (1863202)

Membership function of each target. by Tianrui Zhang (2294542)

“…Experimental results show that the PSCACO algorithm proposed in this paper is compared with MOPSO, CACO and NSGA-II algorithms, and the convergence effect of the algorithm is concluded to be more effective to verify the effectiveness and feasibility of chaotic particle ant colony algorithm for solving multi-objective functions, which proposes a new feasible solution for the supply chain management.…”