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

Hyperparameters of the LSTM Model. حسب Ahmed M. Elshewey (21463867)

"…The capacity to confront and overcome this obstacle is where machine learning and metaheuristic algorithms shine. This study introduces the Adaptive Dynamic Particle Swarm Optimization enhanced with the Guided Whale Optimization Algorithm (AD-PSO-Guided WOA) for rainfall prediction. …"

The AD-PSO-Guided WOA LSTM framework. حسب Ahmed M. Elshewey (21463867)

"…The capacity to confront and overcome this obstacle is where machine learning and metaheuristic algorithms shine. This study introduces the Adaptive Dynamic Particle Swarm Optimization enhanced with the Guided Whale Optimization Algorithm (AD-PSO-Guided WOA) for rainfall prediction. …"

Prediction results of individual models. حسب Ahmed M. Elshewey (21463867)

"…The capacity to confront and overcome this obstacle is where machine learning and metaheuristic algorithms shine. This study introduces the Adaptive Dynamic Particle Swarm Optimization enhanced with the Guided Whale Optimization Algorithm (AD-PSO-Guided WOA) for rainfall prediction. …"

Sample image for illustration. حسب 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. حسب 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. …"

Comparison analysis of computation time. حسب 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. حسب 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. حسب 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 حسب 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 حسب 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 حسب 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.…"