Python implementation of the Trajectory Adaptive Multilevel Sampling algorithm for rare events and improvements حسب Pascal Wang (10130612)

"…In `main.py`, the parameters for the TAMS algorithm are specified (trajectory time, time step, score function, number of particles, type of score threshold, maximum number of iterations, noise level etc.). …"

FAR-1: A Fast Integer Reduction Algorithm Compared to Collatz and Half-Collatz حسب Faizan Ali (21689861)

الموضوعات:

<b>Opti2Phase</b>: Python scripts for two-stage focal reducer حسب Morgan Najera (21540776)

"…</li></ul><p dir="ltr">The scripts rely on the following Python packages. Where available, repository links are provided:</p><ol><li><b>NumPy</b>, version 1.22.1</li><li><b>SciPy</b>, version 1.7.3</li><li><b>PyGAD</b>, version 3.0.1 — https://pygad.readthedocs.io/en/latest/#</li><li><b>bees-algorithm</b>, version 1.0.2 — https://pypi.org/project/bees-algorithm</li><li><b>KrakenOS</b>, version 1.0.0.19 — https://github.com/Garchupiter/Kraken-Optical-Simulator</li><li><b>matplotlib</b>, version 3.5.2</li></ol><p dir="ltr">All scripts are modular and organized to reflect the design stages described in the manuscript.…"

An expectation-maximization algorithm for finding noninvadable stationary states. حسب Robert Marsland (8616483)

"…<p><i>(a)</i> Noninvadable states by definition can only exist in the region Ω of resource space where the growth rate <i>dN</i>_<i>i</i>/<i>dt</i> of each species <i>i</i> is zero or negative. …"

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

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

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

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

الموضوعات:

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

الموضوعات:

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

Step by step comparison of enrichment algorithms. حسب Nicholas Markarian (18251668)

Background heterogeneity and sequencing depth improve WheresWalker SNPindex. حسب McKenna Feltes (11242085)

الموضوعات:

WheresWalker outperforms homozygosity density mapping for Maize mutant. حسب McKenna Feltes (11242085)

الموضوعات:

Example of the CNF function for off-axis DHM holograms recorded in a non-telecentric configuration. حسب Raul Castañeda (13932971)

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

الموضوعات:

Bulk Segregant Analysis (BSA) homozygosity mapping mirrors WheresWalker output. حسب McKenna Feltes (11242085)

الموضوعات:

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

الموضوعات:

Algorithm detection steps. حسب José M. Rivera-Arbeláez (12418512)

Execution Steps of the EOF Algorithm. حسب Zezhi Lin (22521663)

If datasets are small and/or noisy, linear-regression-based algorithms for identifying functional groups outperform more complex versions. حسب Yuanchen Zhao (12905580)

"…More specifically, we plot the <i>R</i>² of the best linear model minus the <i>R</i>² of the best quadratic, where “best” refers to the model identified by the corresponding Metropolis algorithm over its finite runtime (10000 steps). …"