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

“…This penalty was proposed by Verzelen et al. and achieves optimal rates for changepoint detection and changepoint localization in a non-asymptotic scenario. Our proposed algorithm, Multiscale Functional Pruning Optimal Partitioning (Ms.FPOP), extends functional pruning ideas presented in Rigaill and Maidstone et al. to multiscale penalties. …”

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:

Reward function related parameters. by Honglei Pang (22693724)

Subjects:

Results of the application of different clustering algorithms to average functional connectivity from healthy subjects. by Francisco Páscoa dos Santos (16510676)

“…<p>A) Resulting cluster inertia from applying the k-means algorithm described in the methods to empirical averaged functional connectivity from healthy subjects, with different numbers of clusters. …”

Adaptive H-REMD simulation algorithm. by Danial Pourjafar-Dehkordi (7165523)

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:

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

WheresWalker pipeline utilizes WGS data to identify segregating SNPs and indels. by McKenna Feltes (11242085)

Subjects:

Bulk Segregant Analysis (BSA) homozygosity mapping mirrors WheresWalker output. by McKenna Feltes (11242085)

Subjects:

WheresWalker identifies the correct chromosomal region for three dark yolk loci. by McKenna Feltes (11242085)

Subjects:

Listed python codes of our algorithm with explanations (Python 3.9 recommended). by Takayuki Niizato (162226)

One iteration of the NSGA-II algorithm. by Erick Axel Padilla-García (16839233)

Convergence curve of each test function. 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.…”

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

Artificial colony algorithm flow. by Jianpeng Zhang (528185)

“…In the neighborhood intervals where the nectar sources are firmly connected and relatively independent, the algorithm then conducts a chaotic traversal search. …”