Maher Abuhamdeh

Dr. Maher Abuhamdeh

AI, Middle East University, Amman, Al ‘Āşimah, Jordan
orcid

Research Focus & Metrics

Academic Career Length

3Years (2024-Present)

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

Representative Publications

View All Publications
1 December 2024 in International Journal of Electrical and Computer Engineering (IJECE)
Verified
Journal Article
Open access
PDF file
HKHasan Kanaker
Hasan Kanaker
MTMonther Tarawneh
Monther Tarawneh
NKNader Abdel Karim
Nader Abdel Karim
AAAdeeb Alsaaidah
Adeeb Alsaaidah
MAMaher Abuhamdeh
Maher Abuhamdeh
ZAZaid Alhalhouli
Zaid Alhalhouli
Cloud computing offers several advantages, including cost savings and easy access to resources, it is also could be vulnerable to serious security attacks such as cloud Trojan horse infection attacks. To address this issue, machine learning is a promising approach for detecting these threats. Thus, different machine learning tools and models have been employed to detect Trojan horse infection such as Weka and Python Colab. This study aims to compare the performance of Weka and Python Colab, as popular tools for building machine learning models. This study evaluates the recall, accuracy, and F1-score of machine learning models built with Weka and Python Colab and compares their computational resources required employing several machine learning algorithms. The dataset collected and analyzed using dynamic analysis of Trojan horse infection in control lab environment. The findings of this study can help determine the decision about which tool to use to detect Trojan horse infections and provide insights into the strengths and limitations of Weka and Python Colab for building machine-learning models in general.

25 April 2026 in Computation
Verified
Journal Article
Open access
PDF file
HKHasan Kanaker
Hasan Kanaker
HFhussam fakhouri
hussam fakhouri
NKNader Abdel Karim
Nader Abdel Karim
MAMaher Abuhamdeh
Maher Abuhamdeh
NINurul Halimatul Asmak Ismail
Nurul Halimatul Asmak Ismail
SFSandi Fakhouri
Sandi Fakhouri
Tool-using AI agents couple a language model with controller logic, memory, and external tools such as browsers, email, calendars, file systems, and transaction APIs. This architecture expands capability, but it also enlarges the security boundary: agents routinely ingest untrusted content while holding privileges that can reveal private data and trigger external side effects. The resulting failures are not limited to poor text generation; they include prompt injection, indirect injection through tool outputs, confused-deputy behavior, unauthorized actions, and misleading claims about the tool state. Because large-scale testing on deployed products is difficult, vendor-specific, and ethically sensitive, we present a transparent, theoretical simulation-based framework for evaluating user-facing risk in tool-using agents. The methodological contribution is a formal threat model that separates compromise, harm, and severity, and a Monte Carlo evaluation pipeline that maps architectural choices (permissions, retrieval, memory exposure, and approvals) and defensive controls to comparable outcome metrics. We instantiate the framework for six representative threat scenarios and nine defense configurations, reporting attack success rate (ASR), benign task success, latency overhead, and severity-weighted harm. Across scenarios, the least-privilege tool design is the strongest single broad control, human-in-the-loop approvals sharply reduce high-impact actions and exports but degrade under user error and habituation, retrieval allowlisting nearly eliminates indirect injection while leaving other channels largely unaffected, and rate limiting reduces tail severity more than ASR. These results position agent safety as an architectural and operational problem and because they arise from an assumption-explicit simulator rather than field measurements, should be read as comparative design guidance rather than incident-rate estimates for any deployed product.

3 May 2026 in Eng
Verified
Journal Article
Open access
PDF file
HKHasan Kanaker
Hasan Kanaker
EAEssam Alhroob
Essam Alhroob
HAHammoudeh Alamri
Hammoudeh Alamri
MAMaher Abuhamdeh
Maher Abuhamdeh
SASamar Al-Saqqa
Samar Al-Saqqa
This paper introduced the Enhanced Puzzle Optimization Algorithm (EPOA), a hybrid metaheuristic that augmented the original Puzzle Optimization Algorithm (POA) with uniform crossover, random-resetting mutation, and explicit elitism. The contribution does not lie in inventing these operators individually, since they are classical search components, but in integrating them into POA’s two-phase search dynamics to address premature convergence, diversity loss, and best-solution preservation in a targeted manner. This paper formalized EPOA’s update rules, provided pseudocode and flow diagrams, and enforced bound handling for box-constrained problems. Comprehensive tests on the CEC2022 single-objective benchmark suite (F1–F12) showed that EPOA attained rank 1 on 11 of 12 functions and rank 3 on the remaining case, with large error reductions relative to baseline POA (e.g., on F1, the mean error dropped from 62.836 to 0.004; on F6, the mean error dropped from 2370.962 to 7.239). The method was further evaluated on six classical constrained engineering design problems (welded beam, tension/compression spring, speed reducer, pressure vessel, three-bar truss, and cantilever beam). Statistical indicators such as the mean and standard deviation were used to assess robustness. The results showed that EPOA delivered a strong exploration–exploitation balance and robust solution quality across rugged landscapes and real-world constraints.