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

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

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

Subjects:

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

“…<i>(b)</i> Metabolic byproducts move the relevant unperturbed state from <b>R</b>⁰ (gray ‘x’) to (black ‘x’), which is itself a function of the current environmental conditions. …”

<b>Algorithm Pseudocode</b> by Yibin Zhao (22425801)

Verification of the in-line PS function. by Raul Castañeda (13932971)

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

“…Inertia was calculated using the scikit learn module in Python. B) Resulting cluster distance from hierarchical clustering to averaged functional connectivity from healthy subjects, with different numbers of clusters. …”

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

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

ROI setting diagram for AI calculation and optimization verification results. by Tsutomu Gomi (7382183)

Subjects:

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

A detailed process of iterative simulation coupled with bone density algorithm; (a) a function of stimulus and related bone density changes, and (b) iterative calculations of finite element analysis coupled with user’s subroutine for changes in bone density. by Hassan Mehboob (8960273)

“…<p>A detailed process of iterative simulation coupled with bone density algorithm; (a) a function of stimulus and related bone density changes, and (b) iterative calculations of finite element analysis coupled with user’s subroutine for changes in bone density.…”

A) Ranking of models trained on different feature sets across all tested algorithms, sorted by their F1-score. by Jose Cleydson F. Silva (8685594)

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:

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

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