Binary encoding scheme. by Binh Thanh Dang (12368831)

SHAP bar plot. by Meng Cao (105914)

SHAP summary plot. by Meng Cao (105914)

Homomorphic binary tree. by Jianhua He (341366)

A radar plot illustrating the comparison of the classification accuracy, cost values, and fitness values for the hybrids of BEOSA when applied to some high-dimensional datasets usi... by Olaide N. Oyelade (14047002)

A radar plot illustrating the comparison of the classification accuracy, cost values, and fitness values for the hybrids of BEOSA when applied to some medium-sized dimensional data... by Olaide N. Oyelade (14047002)

A radar plot illustrating the comparison of the classification accuracy, cost values, and fitness values for the hybrids of BEOSA when applied to some small-sized dimensional datas... by Olaide N. Oyelade (14047002)

Fig 4 - by Olaide N. Oyelade (14047002)

Fig 7 - by Olaide N. Oyelade (14047002)

Optimal Timings Codebook.xlsx by Emma Spillane (11249121)

Optimal Time Intervals of Breech Births Dataset by Emma Spillane (11249121)

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

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

“…The computation time for CBFD is 2.8 ms, which is at least 6.7% lower than that of other algorithms. Finally, the plot of location feature distance illustrates that CBFD exhibits minimal distance compared to DITF and Histogram of Oriented Gradients (HOG). …”

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

“…The computation time for CBFD is 2.8 ms, which is at least 6.7% lower than that of other algorithms. Finally, the plot of location feature distance illustrates that CBFD exhibits minimal distance compared to DITF and Histogram of Oriented Gradients (HOG). …”

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

“…The computation time for CBFD is 2.8 ms, which is at least 6.7% lower than that of other algorithms. Finally, the plot of location feature distance illustrates that CBFD exhibits minimal distance compared to DITF and Histogram of Oriented Gradients (HOG). …”

Precision recall curve. by Indhumathi S. (19173013)

“…The computation time for CBFD is 2.8 ms, which is at least 6.7% lower than that of other algorithms. Finally, the plot of location feature distance illustrates that CBFD exhibits minimal distance compared to DITF and Histogram of Oriented Gradients (HOG). …”

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

“…The computation time for CBFD is 2.8 ms, which is at least 6.7% lower than that of other algorithms. Finally, the plot of location feature distance illustrates that CBFD exhibits minimal distance compared to DITF and Histogram of Oriented Gradients (HOG). …”

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

“…Fifteen roots from five plants per plot, featuring diameters ranging from 4 to 7 cm, were randomly chosen for cooking analysis and spectral data collection. …”

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

“…Fifteen roots from five plants per plot, featuring diameters ranging from 4 to 7 cm, were randomly chosen for cooking analysis and spectral data collection. …”

Flow diagram of the automatic animal detection and background reconstruction. by David Tadres (9120564)

“…(E) The threshold value is calculated based on the histogram: it is the mean of the image subtracted by 4 (optimal value defined by trial and error). …”