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

datasheet1_Algorithmic Probability-Guided Machine Learning on Non-Differentiable Spaces.pdf by Santiago Hernández-Orozco (5070209)

“…In doing so we use examples which enable the two approaches to be compared (small, given the computational power required for estimations of algorithmic complexity). We find and report that 1) machine learning can successfully be performed on a non-smooth surface using algorithmic complexity; 2) that solutions can be found using an algorithmic-probability classifier, establishing a bridge between a fundamentally discrete theory of computability and a fundamentally continuous mathematical theory of optimization methods; 3) a formulation of an algorithmically directed search technique in non-smooth manifolds can be defined and conducted; 4) exploitation techniques and numerical methods for algorithmic search to navigate these discrete non-differentiable spaces can be performed; in application of the (a) identification of generative rules from data observations; (b) solutions to image classification problems more resilient against pixel attacks compared to neural networks; (c) identification of equation parameters from a small data-set in the presence of noise in continuous ODE system problem, (d) classification of Boolean NK networks by (1) network topology, (2) underlying Boolean function, and (3) number of incoming edges.…”

datasheet2_Algorithmic Probability-Guided Machine Learning on Non-Differentiable Spaces.zip by Santiago Hernández-Orozco (5070209)

“…In doing so we use examples which enable the two approaches to be compared (small, given the computational power required for estimations of algorithmic complexity). We find and report that 1) machine learning can successfully be performed on a non-smooth surface using algorithmic complexity; 2) that solutions can be found using an algorithmic-probability classifier, establishing a bridge between a fundamentally discrete theory of computability and a fundamentally continuous mathematical theory of optimization methods; 3) a formulation of an algorithmically directed search technique in non-smooth manifolds can be defined and conducted; 4) exploitation techniques and numerical methods for algorithmic search to navigate these discrete non-differentiable spaces can be performed; in application of the (a) identification of generative rules from data observations; (b) solutions to image classification problems more resilient against pixel attacks compared to neural networks; (c) identification of equation parameters from a small data-set in the presence of noise in continuous ODE system problem, (d) classification of Boolean NK networks by (1) network topology, (2) underlying Boolean function, and (3) number of incoming edges.…”

datasheet1_Algorithmic Probability-Guided Machine Learning on Non-Differentiable Spaces.pdf by Santiago Hernández-Orozco (5070209)

“…In doing so we use examples which enable the two approaches to be compared (small, given the computational power required for estimations of algorithmic complexity). We find and report that 1) machine learning can successfully be performed on a non-smooth surface using algorithmic complexity; 2) that solutions can be found using an algorithmic-probability classifier, establishing a bridge between a fundamentally discrete theory of computability and a fundamentally continuous mathematical theory of optimization methods; 3) a formulation of an algorithmically directed search technique in non-smooth manifolds can be defined and conducted; 4) exploitation techniques and numerical methods for algorithmic search to navigate these discrete non-differentiable spaces can be performed; in application of the (a) identification of generative rules from data observations; (b) solutions to image classification problems more resilient against pixel attacks compared to neural networks; (c) identification of equation parameters from a small data-set in the presence of noise in continuous ODE system problem, (d) classification of Boolean NK networks by (1) network topology, (2) underlying Boolean function, and (3) number of incoming edges.…”

datasheet2_Algorithmic Probability-Guided Machine Learning on Non-Differentiable Spaces.zip by Santiago Hernández-Orozco (5070209)

“…In doing so we use examples which enable the two approaches to be compared (small, given the computational power required for estimations of algorithmic complexity). We find and report that 1) machine learning can successfully be performed on a non-smooth surface using algorithmic complexity; 2) that solutions can be found using an algorithmic-probability classifier, establishing a bridge between a fundamentally discrete theory of computability and a fundamentally continuous mathematical theory of optimization methods; 3) a formulation of an algorithmically directed search technique in non-smooth manifolds can be defined and conducted; 4) exploitation techniques and numerical methods for algorithmic search to navigate these discrete non-differentiable spaces can be performed; in application of the (a) identification of generative rules from data observations; (b) solutions to image classification problems more resilient against pixel attacks compared to neural networks; (c) identification of equation parameters from a small data-set in the presence of noise in continuous ODE system problem, (d) classification of Boolean NK networks by (1) network topology, (2) underlying Boolean function, and (3) number of incoming edges.…”

Comparison of the performance of both models against 13 other models on the independent test dataset. by Aastha Vatsyayan (9981916)

Subjects:

Python-based Monte Carlo Simulation Tool by Yangfan Jiang (9372782)

Python-Based Algorithm for Estimating NRTL Model Parameters with UNIFAC Model Simulation Results by Se-Hee Jo (20554623)

“…This algorithm conducts a series of procedures: (1) fragmentation of the molecules into functional groups from SMILES, (2) calculation of activity coefficients under predetermined temperature and mole fraction conditions by employing universal quasi-chemical functional group activity coefficient (UNIFAC) model, and (3) regression of NRTL model parameters by employing UNIFAC model simulation results in the differential evolution algorithm (DEA) and Nelder–Mead method (NMM). …”

<b>Opti2Phase</b>: Python scripts for two-stage focal reducer by 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.…”

Multi-Objective Cooperative Paths Planning for Multiple Parafoils System Using a Genetic Algorithm by Chen Qi (2803873)

“…Parafoils’ paths are encoded by real matrix, and the cooperative relationship between parafoils is realized by paths fitness function. The random single point crossover and Gaussian mutation are introduced to accelerate algorithm convergence rate. …”

The comparison for the number of the objective function against the number of iterations. by Jamilu Sabi’u (18794062)

Comparison of algorithms in two cases. by Yi Tao (178829)

Subjects: “…evolutionary genetic algorithm…”

Flow of the NSGA-II algorithm. by Yi Tao (178829)

Subjects: “…evolutionary genetic algorithm…”

A Python Package for the Localization of Protein Modifications in Mass Spectrometry Data by Anthony S. Barente (14035175)

Subjects:

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

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

“…<div>This directory contains Python 3 scripts implementing the Trajectory Adaptive Multilevel Sampling algorithm (TAMS), a variant of Adaptive Multilevel Splitting (AMS), for the study of rare events. …”

The SVM objective function minimization against iterations. by Ali Ahmed (2567584)

Pipeline of the interactor algorithm. by Jose Cleydson F. Silva (8685594)

Performance SDYM against SCGP, SRMIL, and MDY for function evaluations. by Jamilu Sabi’u (18794062)

The comparison for the number of the objective function against processing time (seconds). by Jamilu Sabi’u (18794062)