Cleavage time as a function of scaled fiber diameter. by Roukayatou R. Ouedraogo (20460980)

Effect of the transmission probability function on epidemic spread. by Soler Gabriela Bayolo (21011810)

SP results of algorithms in the CEC 2009 test functions. by Vahid Goodarzimehr (21343124)

MS results of algorithms in the CEC 2009 test functions. by Vahid Goodarzimehr (21343124)

M2 spread and upper ECD spread for the reruns. by Samuel Eriksson Lidbrink (21616146)

Median fiber cleavage time (black) and the fraction of successful runs (red) for different parameter values. by Roukayatou R. Ouedraogo (20460980)

Probability density functions (PDFs) of the simulated surveillance noise. by Sandor Beregi (22177739)

Flowchart of MOSRS algorithm. by Vahid Goodarzimehr (21343124)

“…Inverted Generational Distance, Spacing, Maximum Spread, and Hypervolume are used to identify the best algorithm. …”

Observed adjusted Rand index x100 between the methods for the partitions found setting <i>K</i> = 10 clusters in the data set with mean gene expressions spread in one day. by Susana Conde (5495675)

Observed adjusted Rand index x100 between the methods for the partitions found setting <i>K</i> = 10 clusters in the data set with mean gene expressions spread in one day. by Susana Conde (5495675)

Summary: Dipole-spread-function engineering for simultaneously measuring the 3D orientations and 3D positions of fluorescent molecules by Tingting Wu (21440889)

“…However, spatial and angular information are mixed within the image of a fluorescent molecule–the microscope’s dipole-spread function (DSF). We demonstrate the pixOL algorithm to simultaneously optimize all pixels within a phase mask to produce an engineered Green’s tensor–the dipole extension of point-spread function engineering. …”

Ms.FPOP: A Fast Exact Segmentation Algorithm with a Multiscale Penalty by Arnaud Liehrmann (10970682)

“…<p>Given a time series in <math><mrow><mrow><mi>R</mi></mrow><mi>n</mi></mrow></math> with a piecewise constant mean and independent noises, we propose an exact dynamic programming algorithm for minimizing a least-squares criterion with a multiscale penalty, favoring well-spread changepoints. …”

Mean HV. by Vahid Goodarzimehr (21343124)

“…Inverted Generational Distance, Spacing, Maximum Spread, and Hypervolume are used to identify the best algorithm. …”

IGD results. by Vahid Goodarzimehr (21343124)

“…Inverted Generational Distance, Spacing, Maximum Spread, and Hypervolume are used to identify the best algorithm. …”

Commonly used metaheuristics Hyperparameters. by Vahid Goodarzimehr (21343124)

“…Inverted Generational Distance, Spacing, Maximum Spread, and Hypervolume are used to identify the best algorithm. …”

MOSRS’s pseudocode. by Vahid Goodarzimehr (21343124)

“…Inverted Generational Distance, Spacing, Maximum Spread, and Hypervolume are used to identify the best algorithm. …”

The radius of this circular motion. by Vahid Goodarzimehr (21343124)

“…Inverted Generational Distance, Spacing, Maximum Spread, and Hypervolume are used to identify the best algorithm. …”

Hardest general multi-objective problems. by Vahid Goodarzimehr (21343124)

“…Inverted Generational Distance, Spacing, Maximum Spread, and Hypervolume are used to identify the best algorithm. …”

Friedman test for the Engineering problems. by Vahid Goodarzimehr (21343124)

“…Inverted Generational Distance, Spacing, Maximum Spread, and Hypervolume are used to identify the best algorithm. …”

Schematic of some engineering problems [34]. by Vahid Goodarzimehr (21343124)

“…Inverted Generational Distance, Spacing, Maximum Spread, and Hypervolume are used to identify the best algorithm. …”