Latent state estimations for experimental data with time limit for subject 8. by Samiul Alam (18563323)

Latent state estimations for experimental data with time limit for subject 6. by Samiul Alam (18563323)

Latent state estimations for experimental data with time limit for subject 1. by Samiul Alam (18563323)

Latent state estimations for experimental data with time limit for subject 15. by Samiul Alam (18563323)

Latent state estimations for experimental data with time limit for subject 9. by Samiul Alam (18563323)

Latent state estimations for experimental data with time limit for subject 12. by Samiul Alam (18563323)

Latent state estimations for experimental data with time limit for subject 2. by Samiul Alam (18563323)

Symmetry test result. by Jiyong Moon (16819302)

Presentation_1_Modified GAN Augmentation Algorithms for the MRI-Classification of Myocardial Scar Tissue in Ischemic Cardiomyopathy.PPTX by Umesh C. Sharma (10785063)

“…Currently, there are no optimized deep-learning algorithms for the automated classification of scarred vs. normal myocardium. …”

Algoritmo de clasificación de expresiones de odio por tipos en español (Algorithm for classifying hate expressions by type in Spanish) by Daniel Pérez Palau (11097348)

“…</li></ul><p dir="ltr"><b>File Structure</b></p><p dir="ltr">The code generates and saves:</p><ul><li>Weights of the trained model (.h5)</li><li>Configured tokenizer</li><li>Training history in CSV</li><li>Requirements file</li></ul><p dir="ltr"><b>Important Notes</b></p><ul><li>The model excludes category 2 during training</li><li>Implements transfer learning from a pre-trained model for binary hate detection</li><li>Includes early stopping callbacks to prevent overfitting</li><li>Uses class weighting to handle category imbalances</li></ul><p dir="ltr">The process of creating this algorithm is explained in the technical report located at: Blanco-Valencia, X., De Gregorio-Vicente, O., Ruiz Iniesta, A., & Said-Hung, E. (2025). …”

Event-driven data flow processing. by Yixian Wen (12201388)

“…Subsequently, we implement an optimal binary tree decision-making algorithm, grounded in dynamic programming, to achieve precise allocation of elastic resources within data streams, significantly bolstering resource utilization. …”

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

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

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

“…In addition, the practical benefits for \emph{<i>MPS</i>} in the context of simulating channelized facies models is demonstrated using synthetic data and real geological facies. …”

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

Models and Dataset by M RN (9866504)

“…</p><p dir="ltr"><br></p><p dir="ltr"><b>TJO (Tom and Jerry Optimization):</b><br>TJO is a nature-inspired metaheuristic algorithm that models the predator-prey dynamics of the cartoon characters Tom (predator) and Jerry (prey). …”

Confusion matrix. by Yixian Wen (12201388)

“…Subsequently, we implement an optimal binary tree decision-making algorithm, grounded in dynamic programming, to achieve precise allocation of elastic resources within data streams, significantly bolstering resource utilization. …”

Parameter settings. by Yixian Wen (12201388)

“…Subsequently, we implement an optimal binary tree decision-making algorithm, grounded in dynamic programming, to achieve precise allocation of elastic resources within data streams, significantly bolstering resource utilization. …”

Dynamic resource allocation process. by Yixian Wen (12201388)

“…Subsequently, we implement an optimal binary tree decision-making algorithm, grounded in dynamic programming, to achieve precise allocation of elastic resources within data streams, significantly bolstering resource utilization. …”

DataSheet_1_Near infrared spectroscopy for cooking time classification of cassava genotypes.docx by Massaine Bandeira e Sousa (7866242)

“…Two NIRs devices, the portable QualitySpec® Trek (QST) and the benchtop NIRFlex N-500 were used to collect spectral data. Classification of genotypes was carried out using the K-nearest neighbor algorithm (KNN) and partial least squares (PLS) models. …”