Datasets and their properties. by Olaide N. Oyelade (14047002)

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

Subjects: “…differential evolution algorithm…”

RMSE on the test data when fitting (logistic) quadratic models to binary data across increasing measurement error values . by Jakub Stoklosa (3315042)

Data_Sheet_1_A Global Optimizer for Nanoclusters.PDF by Maya Khatun (7437011)

“…This method is implemented in PyAR (https://github.com/anooplab/pyar) program. The global optimization in PyAR involves two parts, generation of several trial geometries and gradient-based local optimization of the trial geometries. …”

Validation of image processing steps and metric results using images of a microfluidic device. by Gavrielle R. Untracht (11820311)

tUbenet Foundation Model Weights by Natalie Holroyd (7099391)

Flowchart of software workflow. by Gavrielle R. Untracht (11820311)

Pressure-Stabilized Zinc Trifluoride by Shiyin Ma (5793191)

“…By combining the particle swarm optimization algorithm with first-principles calculation, the high-pressure phase diagram of Zn–F binary compounds was established. …”

Improved support vector machine classification algorithm based on adaptive feature weight updating in the Hadoop cluster environment by Jianfang Cao (1881379)

“…The MapReduce parallel programming model on the Hadoop platform is used to perform an adaptive fusion of hue, local binary pattern (LBP) and scale-invariant feature transform (SIFT) features extracted from images to derive optimal combinations of weights. …”

Supplementary Material for: Penalized Logistic Regression Analysis for Genetic Association Studies of Binary Phenotypes by Yu Y. (3096192)

“…Our estimate of m is the maximizer of a marginal likelihood obtained by integrating the latent log-ORs out of the joint distribution of the parameters and observed data. We consider two approximate approaches to maximizing the marginal likelihood: (i) a Monte Carlo EM algorithm (MCEM) and (ii) a Laplace approximation (LA) to each integral, followed by derivative-free optimization of the approximation. …”

Experimental observation of gastruloids and shape quantification using LOCO-EFA. by Martijn A. de Jong (17896732)

Fig 3 - by Ali Ahmed (2567584)

Sample image for illustration. by Indhumathi S. (19173013)

“…The results demonstrate that CBFD achieves a average precision of 0.97 for the test image, outperforming Superpoint, Directional Intensified Tertiary Filtering (DITF), Binary Robust Independent Elementary Features (BRIEF), Binary Robust Invariant Scalable Keypoints (BRISK), Speeded Up Robust Features (SURF), and Scale Invariant Feature Transform (SIFT), which achieve scores of 0.95, 0.92, 0.72, 0.66, 0.63 and 0.50 respectively. …”

Quadratic polynomial in 2D image plane. by Indhumathi S. (19173013)

“…The results demonstrate that CBFD achieves a average precision of 0.97 for the test image, outperforming Superpoint, Directional Intensified Tertiary Filtering (DITF), Binary Robust Independent Elementary Features (BRIEF), Binary Robust Invariant Scalable Keypoints (BRISK), Speeded Up Robust Features (SURF), and Scale Invariant Feature Transform (SIFT), which achieve scores of 0.95, 0.92, 0.72, 0.66, 0.63 and 0.50 respectively. …”

Steps in the extraction of 14 coordinates from the CT slices for the curved MPR. by Linus Woitke (22783534)

“…The image is then cleaned in c) using morphological filtering with an <i>opening</i> operation to remove small-scale noise. …”

Image1_Applying the Hubbard-Stratonovich Transformation to Solve Scheduling Problems Under Inequality Constraints With Quantum Annealing.TIF by Sizhuo Yu (11429743)

Image3_Applying the Hubbard-Stratonovich Transformation to Solve Scheduling Problems Under Inequality Constraints With Quantum Annealing.TIF by Sizhuo Yu (11429743)

Image2_Applying the Hubbard-Stratonovich Transformation to Solve Scheduling Problems Under Inequality Constraints With Quantum Annealing.TIF by Sizhuo Yu (11429743)

Comparison analysis of computation time. by Indhumathi S. (19173013)

“…The results demonstrate that CBFD achieves a average precision of 0.97 for the test image, outperforming Superpoint, Directional Intensified Tertiary Filtering (DITF), Binary Robust Independent Elementary Features (BRIEF), Binary Robust Invariant Scalable Keypoints (BRISK), Speeded Up Robust Features (SURF), and Scale Invariant Feature Transform (SIFT), which achieve scores of 0.95, 0.92, 0.72, 0.66, 0.63 and 0.50 respectively. …”

Process flow diagram of CBFD. by Indhumathi S. (19173013)

“…The results demonstrate that CBFD achieves a average precision of 0.97 for the test image, outperforming Superpoint, Directional Intensified Tertiary Filtering (DITF), Binary Robust Independent Elementary Features (BRIEF), Binary Robust Invariant Scalable Keypoints (BRISK), Speeded Up Robust Features (SURF), and Scale Invariant Feature Transform (SIFT), which achieve scores of 0.95, 0.92, 0.72, 0.66, 0.63 and 0.50 respectively. …”