Bar chart comparing the average fitness values of various feature selection algorithms. by Doaa Sami Khafaga (21463870)

Box plots with swarm overlays for six feature selection algorithms, annotated with mean and standard deviation values. by Doaa Sami Khafaga (21463870)

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

“…In addition, we designed nested transfer (NT) functions and investigated the influence of the function on the level-1 optimizer. The binary Ebola optimization search algorithm (BEOSA) is applied for the level-1 mutation, while the simulated annealing (SA) and firefly (FFA) algorithms are investigated for the level-2 optimizer. …”

Parameter settings. by Olaide N. Oyelade (14047002)

“…In addition, we designed nested transfer (NT) functions and investigated the influence of the function on the level-1 optimizer. The binary Ebola optimization search algorithm (BEOSA) is applied for the level-1 mutation, while the simulated annealing (SA) and firefly (FFA) algorithms are investigated for the level-2 optimizer. …”

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

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

UK Biobank data wrangling statistics and results. by Simeone Marino (81051)

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

Data_Sheet_1_A Data-Driven Framework for Identifying Intensive Care Unit Admissions Colonized With Multidrug-Resistant Organisms.docx by Çaǧlar Çaǧlayan (12253934)

“…We performed threshold optimization for converting predicted probabilities into binary predictions and identified the cut-off maximizing the sum of sensitivity and specificity.…”

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

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

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

“…Noteworthy is CBFD’s recall value of 0.87 representing at the maximum of a 13.6% improvement over Superpoint, DITF, BRIEF, BRISK, SURF, and SIFT. …”

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

“…Noteworthy is CBFD’s recall value of 0.87 representing at the maximum of a 13.6% improvement over Superpoint, DITF, BRIEF, BRISK, SURF, and SIFT. …”

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

“…Noteworthy is CBFD’s recall value of 0.87 representing at the maximum of a 13.6% improvement over Superpoint, DITF, BRIEF, BRISK, SURF, and SIFT. …”

Precision recall curve. by Indhumathi S. (19173013)

“…Noteworthy is CBFD’s recall value of 0.87 representing at the maximum of a 13.6% improvement over Superpoint, DITF, BRIEF, BRISK, SURF, and SIFT. …”

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

“…Noteworthy is CBFD’s recall value of 0.87 representing at the maximum of a 13.6% improvement over Superpoint, DITF, BRIEF, BRISK, SURF, and SIFT. …”

Seed mix selection model by Bethanne Bruninga-Socolar (10923639)

“…For each data set, we initialized a starting population of plant species equal to the desired number of plant species in the mix. The genetic algorithm then operated over 1000 iterations, applying crossover and mutation processes to optimize bee richness. …”

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

“…The accuracy of the optimal scenario for classifying samples with a cooking time of 30 minutes reached RCal2  = 0.86 and RVal2 = 0.84, with a Kappa value of 0.53. …”