Illustration of the transformed binary images of normal, benign, and malignant samples into grayscale. by Tehnan I. A. Mohamed (16846175)

Python-Based Algorithm for Calculating Physical Properties of Aqueous Mixtures Composed of Substances Not Available in Databases by Jina Lee (3138492)

“…To validate the accuracy of the model, the results obtained from the proposed algorithm were compared to experimental data for 37 binary aqueous mixture systems covering properties such as density, heat capacity, viscosity, and thermal conductivity. …”

Python-Based Algorithm for Calculating Physical Properties of Aqueous Mixtures Composed of Substances Not Available in Databases by Jina Lee (3138492)

“…To validate the accuracy of the model, the results obtained from the proposed algorithm were compared to experimental data for 37 binary aqueous mixture systems covering properties such as density, heat capacity, viscosity, and thermal conductivity. …”

MARGO workflow, tracking algorithm, and sample behavioral box. by Zach Werkhoven (6473165)

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

“…Furthermore, the matching score for the test image is 0.975. The computation time for CBFD is 2.8 ms, which is at least 6.7% lower than that of other algorithms. …”

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

“…Furthermore, the matching score for the test image is 0.975. The computation time for CBFD is 2.8 ms, which is at least 6.7% lower than that of other algorithms. …”

Analysis of geo-spatiotemporal data using machine learning algorithms and reliability enhancement for urbanization decision support by Kwame O. Hackman (9289505)

“…Two classification algorithms – random forest (RF) and support vector machines (SVM) – were used to produce binary (built-up / non-built up) maps for all years within the temporal span. …”

Cell classification. by Adam L. Tyson (10892822)

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

“…Furthermore, the matching score for the test image is 0.975. The computation time for CBFD is 2.8 ms, which is at least 6.7% lower than that of other algorithms. …”

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

“…Furthermore, the matching score for the test image is 0.975. The computation time for CBFD is 2.8 ms, which is at least 6.7% lower than that of other algorithms. …”

Precision recall curve. by Indhumathi S. (19173013)

“…Furthermore, the matching score for the test image is 0.975. The computation time for CBFD is 2.8 ms, which is at least 6.7% lower than that of other algorithms. …”

Fortran & C++: design fractal-type optical diffractive element by I-Lin Ho (13768960)

“…</p> <p>(2) calculate diffraction fields for fractal and/or grid-matrix (binary) phase-holograms.</p> <p>(3) optimize the fractal and/or grid-matrix holograms for given target diffraction images, using annealing algorithms. …”

Data_Sheet_1_Multiclass Classification Based on Combined Motor Imageries.pdf by Cecilia Lindig-León (7889777)

“…And we propose two new multilabel uses of the Common Spatial Pattern (CSP) algorithm to optimize the signal-to-noise ratio, namely MC2CMI and MC2SMI approaches. …”

Thesis-RAMIS-Figs_Slides by Felipe Santibañez-Leal (10967991)

“…<br><br>Finally, although the developed concepts, ideas and algorithms have been developed for inverse problems in geostatistics, the results are applicable to a wide range of disciplines where similar sampling problems need to be faced, included but not limited to design of communication networks, optimal integration and communication of swarms of robots and drones, remote sensing.…”

PathOlOgics_RBCs Python Scripts.zip by Ahmed Elsafty (16943883)

“…<p dir="ltr">The first algorithm for segmentation and localization (see PathOlOgics_script_1; segment & localize using a pen) relied on manually tracing the borders of each cell using a digital pen tool on a big touchscreen display showing source images/patches. …”