Results of DE algorithms with our scheme and original DE algorithms when function dimensionality is set 30. by Haiming Du (6691646)

Results of DE algorithms with our scheme and original DE algorithms when function dimensionality is set 50. by Haiming Du (6691646)

The image of the Aekley function. by Zhengyu Xu (8550660)

Discovery of Protein Modifications Using Differential Tandem Mass Spectrometry Proteomics by Paolo Cifani (1575613)

“…Termed SAMPEI for spectral alignment-based modified peptide identification, this open-source algorithm is designed for the discovery of functional protein and peptide signaling modifications, without prior knowledge of their identities. …”

Discovery of Protein Modifications Using Differential Tandem Mass Spectrometry Proteomics by Paolo Cifani (1575613)

“…Termed SAMPEI for spectral alignment-based modified peptide identification, this open-source algorithm is designed for the discovery of functional protein and peptide signaling modifications, without prior knowledge of their identities. …”

Simultaneous point-spread function optimization in two optical arms with a single deformable mirror. by nikita vladimirov (9726569)

“…The two point-spread functions (PSFs) correspond to the same fluorescent bead, as seen in two orthogonal views of the microscope. …”

The ALO algorithm optimization flowchart. by Wenjing Wang (181404)

“…The average running time of the proposed algorithm in Sphere function and Griebank function was 2.67s and 1.64s, respectively. …”

The IALO algorithm solution flowchart. by Wenjing Wang (181404)

“…The average running time of the proposed algorithm in Sphere function and Griebank function was 2.67s and 1.64s, respectively. …”

The experimental geometric placement adopted to assess metal artifact reduction employing the new denoising convolutional neural network metal artifact reduction hybrid reconstruct... by Tsutomu Gomi (7382183)

Subjects:

Comparisons among the denoising convolutional neural network metal artifact reduction hybrid reconstruction (DnCNN-MARHR) algorithm and the traditional reconstruction algorithms wi... by Tsutomu Gomi (7382183)

Subjects:

Values of the objective function and its non-normalized terms , obtained by using different weights in the optimization process. by Roberto Castro-Medina (21484990)

Benchmarking functions. by Guilin Yang (583364)

“…Introducing nonlinear convergence factors based on positive cut functions to changing the convergence of algorithms, the early survey capabilities and later development capabilities of the algorithm are balanced. …”

The results of Friedman and Kruskal-Wallis tests for DEGH and its variants with different <i>CR</i> values. by Xuxu Zhong (10099054)

Swarm intelligence algorithms for width and length on influence games by Francisco Muñoz (9455441)

“…<br><br><div>usage: Main.py [-h] [-a] [-r] [-d D] [-t T] [-i I] [-q Q] [--shape SHAPE] [--sym] [--folder FOLDER] [--seed SEED] [--sum SUM] [--mh MH] [--tagsfile TAGSFILE] [--notags] [--prune] [--excludenodes EXCLUDENODES]<br><br>Calculates the best Influence Spread set on a Weighted Symmetric Graph using PSO<br></div><div><br></div><div><div>positional arguments:</div><div> file</div><div><br></div><div>optional arguments:</div><div> -h, --help: show this help message and exit</div><div> -a: threat file input contents as an Adjacency Matrix</div><div> -r: reverse order of nodes, from (a,b,w) a -> b will be b -> a</div><div> -d D: line separator to use while parsing</div><div> -t T: number of times to execute</div><div> -i I: number of metaheuristic iterations per execution</div><div> -q Q: fixed quota, use 0 = floor(n/2)+1</div><div> --shape SHAPE: shape functions for binarization - list of implemented shape functions: s2,s2_neg,v2,v4</div><div> --sym: consider graph as symmetric instead of directed</div><div> --folder FOLDER: output folder</div><div> --seed SEED: use custom seed for metaheuristic calcs</div><div> --sum SUM: adds a value to all node labels</div><div> --mh MH: metaheuristic to use - list of implemented metaheuristics: {1: 'Swarm', 2: 'Swarm2', 3: 'Swarm_W', 4:</div><div> 'Swarm_L'}</div><div> --tagsfile TAGSFILE: use first row as node tags instead of using plurality criteria</div><div> --notags: do not use first row as node tags - tags will be calculated</div><div> --prune: nodes with outdegree = 0 and indegree > 0, and with outdegree = 1 and neighbor's outdegree > 0 will be excluded</div><div> --excludenodes EXCLUDENODES: nodes to skip, comma separated</div></div>…”

Revisiting the “satisfaction of spatial restraints” approach of MODELLER for protein homology modeling by Giacomo Janson (8138517)

“…This program implements the “modeling by satisfaction of spatial restraints” strategy and its core algorithm has not been altered significantly since the early 1990s. …”

Efficient algorithms to discover alterations with complementary functional association in cancer by Rebecca Sarto Basso (6728921)

“…We provide analytic evidence of the effectiveness of UNCOVER in finding high-quality solutions and show experimentally that UNCOVER finds sets of alterations significantly associated with functional targets in a variety of scenarios. In particular, we show that our algorithms find sets which are better than the ones obtained by the state-of-the-art method, even when sets are evaluated using the statistical score employed by the latter. …”

Bioinformatics pipeline for circadian function. by Patrick B. Schwartz (14782608)

“…CYCLOPS (cyclic ordering by periodic structure) is an algorithm that can identify rhythmic (longitudinal) data from population data where sample time acquisition is unknown. …”

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)

Convergent curves of EOSA and related optimization algorithms benchmark functions over 1, 50, 100, 200, 300, 400 and 500 epochs. by Tehnan I. A. Mohamed (16846175)