Sigmoid function calculating rain probability. حسب Niccolo Pescetelli (7000043)

Swarm intelligence algorithms for multi-objective max-min-ISP حسب Francisco Muñoz (9455441)

"…<p>Algorithms implemented on article "<strong>On the max-min influence spread problem: A multi-objective optimization approach</strong>"</p> <p><br></p> <p>usage: Main.py [-h] [-a] [-r] [-d D] [-t T] [-i I] [-q Q] [--shape SHAPE] [--sym] [--folder FOLDER] [--seed SEED] [--spread SPREAD] [--sum SUM] [--mh MH] [--tagsfile TAGSFILE] [--notags] [--prune] [--prunelowdeg] [--excludenodes EXCLUDENODES] [--includeindegzero] [--nodepthcriteria] [--memfile MEMFILE] file</p> <p><br></p> <p>Calculates the best Influence Spread set on a Weighted Graph using PSO</p> <p><br></p> <p>positional arguments:</p> <p>file</p> <p><br></p> <p>options:</p> <p>-h, --help: show this help message and exit</p> <p>-a: read file input contents as an Adjacency Matrix</p> <p>-r: reverse nodes order, reads (b,a,w) instead of (a,b,w)</p> <p>-d D: line separator to use on file parsing</p> <p>-t T: number of times to execute this solver</p> <p>-i I: number of metaheuristic iterations per execution</p> <p>-q Q: fixed quota, use 0 = floor(n/2)+1</p> <p>--shape SHAPE: shape functions for binarization - list of implemented shape functions: s2, s2_neg, v2, v4</p> <p>--sym: consider graph as symmetric instead of directed</p> <p>--folder FOLDER: output folder</p> <p>--seed SEED: use custom seeds for metaheuristic pseudo RNG</p> <p>--spread SPREAD: use specific influence spread model funcion - list of implemented models: LT, IC</p> <p>--sum SUM: adds an extra value to all edge's weight</p> <p>--mh MH: metaheuristic to use - list of implemented metaheuristics: 1 (Swarm3), 3 (Swarm3_W), 4 (Swarm3_L), 5 (Swarm4)</p> <p>--tagsfile TAGSFILE: use first row as node tags instead of using plurality criteria</p> <p>--notags: do not use first row as node tags, instead tags will be calculated</p> <p>--prune: nodes with (1) outdegree = 0 and indegree > 0, and (2) with outdegree = 1 and neighbor's outdegree > 0 will be excluded</p> <p>--prunelowdeg: nodes with low outdegree or degree will be excluded</p> <p>--excludenodes EXCLUDENODES: nodes to skip, must be comma separated</p> <p>--includeindegzero: forces to include nodes with indegree = 0 on all executions</p> <p>--nodepthcriteria: particles will not tie off with spread depth in case of having same fitness and spread</p> <p>--memfile MEMFILE: memory dump of other execution</p>…"

The optimal contact/quarantine rates from the family of functions (4) and (5) for Xi’an, Guangzhou and Yangzhou. حسب Mengqi He (5753525)

الموضوعات:

Comparisons of the artifact indices (AIs) determined for in-focus plane images procured via the denoising convolutional neural network metal artifact reduction hybrid reconstructio... حسب Tsutomu Gomi (7382183)

الموضوعات:

Algorithm operation steps. حسب Junyan Wang (4738518)

"…To address these issues, this paper proposes an improved object detection algorithm named SCI-YOLO11, which optimizes the YOLO11 framework from three aspects: feature extraction, attention mechanism, and loss function. …"

Flowchart of the denoising convolutional neural network metal artifact reduction hybrid reconstruction (DnCNN-MARHR) algorithm. حسب Tsutomu Gomi (7382183)

الموضوعات:

Multimodal test functions. حسب HaoCheng Wang (6089567)

Unimodal test functions. حسب HaoCheng Wang (6089567)

Mean HV. حسب Vahid Goodarzimehr (21343124)

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

IGD results. حسب Vahid Goodarzimehr (21343124)

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

Commonly used metaheuristics Hyperparameters. حسب Vahid Goodarzimehr (21343124)

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

MOSRS’s pseudocode. حسب Vahid Goodarzimehr (21343124)

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

The radius of this circular motion. حسب Vahid Goodarzimehr (21343124)

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

Hardest general multi-objective problems. حسب Vahid Goodarzimehr (21343124)

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

Friedman test for the Engineering problems. حسب Vahid Goodarzimehr (21343124)

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

Schematic of some engineering problems [34]. حسب Vahid Goodarzimehr (21343124)

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

The direction of the magnetic force [1]. حسب Vahid Goodarzimehr (21343124)

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

Friedman tests for the CEC 2009 problems. حسب Vahid Goodarzimehr (21343124)

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

Schematics for gmxapi operations. حسب M. Eric Irrgang (4487278)

gmxapi usage examples. حسب M. Eric Irrgang (4487278)