Hassan Echoukairi

Prof. Hassan Echoukairi

orcid

Research Focus & Metrics

Academic Career Length

4Years (2023-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
21 March 2023 in International Journal of Interactive Mobile Technologies (iJIM)
Verified
Journal Article
Open access
PDF file
HEHassan Echoukairi
Hassan Echoukairi
MGMohamed El Ghmary
Mohamed El Ghmary
ZSZIANI SAID
ZIANI SAID
AOAli OUACHA
Ali OUACHA
Facial expressions constitute one of the most effective and instinctive methods that allow people to communicate their emotions and intentions. In this context, the both Machine Learning (ML) and Convolutional Neural Networks (CNNs) have been used for emotion recognition. Efficient recognition systems are required for good human-computer interaction. However, facial expression recognition is related to several methods that impact the performance of facial recognition systems. In this paper, we demonstrate a state-of-the-art of 65% accuracy on the FER2013 dataset by leveraging numerous techniques from recent research and we also proposed some new methods for improving accuracy by combining CNN architectures such as VGG-16 and Resnet-50 with auxiliary datasets such as JAFFE and CK. To predict emotions, we used a second approach based on geometric features and facial landmarks to calculate and transmit the feature vector to the SVM model. The results show that the ResNet50 model outperforms all other emotion prediction models in real time by maximizing.

3 May 2025
Verified
Book Chapter
Closed access
PDF file
ZSZIANI SAID
ZIANI SAID
MGMohamed El Ghmary
Mohamed El Ghmary
HEHassan Echoukairi
Hassan Echoukairi

29 May 2026
Verified
Book Chapter
Closed access
PDF file
SFSOUMAYA EL FOUKAHI
SOUMAYA EL FOUKAHI
KHKaoutar El Handri
Kaoutar El Handri
MGMohamed El Ghmary
Mohamed El Ghmary
HEHassan Echoukairi
Hassan Echoukairi

2 August 2026
Verified
Book Chapter
Closed access
PDF file
HEHassan Echoukairi
Hassan Echoukairi
MGMohamed EL Ghmary
Mohamed EL Ghmary
SZSaid Ziani
Said Ziani

8 October 2025
Verified
Book Chapter
Closed access
PDF file
HEHassan Echoukairi
Hassan Echoukairi
WEWafa Ettaki
Wafa Ettaki
MGMohamed EL Ghmary
Mohamed EL Ghmary

6 August 2026 in International Journal of Interactive Mobile Technologies (iJIM)
Verified
Journal Article
Open access
PDF file
WLWijdane Lakhouari
Wijdane Lakhouari
MGMohamed El Ghmary
Mohamed El Ghmary
HEHassan Echoukairi
Hassan Echoukairi
Virtual machine (VM) placement in recent cloud systems remains a challenging and new task due to the challenge of finding the best way to use resources efficiently while also ensuring service reliability. The current study offers an in-depth comparative evaluation of six VM placement algorithms—three established heuristics (Best Fit Decreasing (BFD), First Fit Decreasing (FFD), and Worst Fit (WF)), a baseline RANDOM method, and two metaheuristics (Ant Colony Optimization (ACO) and NSGA-III)—conducted through 2,400 simulation trials. We meticulously evaluate each algorithm across four critical performance metrics: placement success rate, energy consumption, execution time, and service reliability. The statistical analysis confirmed significant differences in performance across all methods using the Kruskal-Wallis and Mann-Whitney tests. Classical heuristics achieve a placement success rate (PSR) of 87.38% with BFD and FFD operating without any service violations. These methods use more energy than other approaches, which is a drawback of their good performance. NSGA-III reduces energy usage by 11% while maintaining acceptable placement performance (71.62%). The execution time (ET) can really vary, from super-fast heuristics to more time-consuming optimization methods. The results indicate that classical heuristics provide the highest reliability. No SLA violations (SLAV) were observed in the scenarios evaluated. Classical heuristics, in particular BFD and FFD, are therefore the most reliable. The study’s findings also show that cloud providers can choose the algorithms that best match their operational priorities. These priorities may include maximizing performance, minimizing energy consumption, or ensuring service stability.