Najem N. Sirhan

Dr. Najem N. Sirhan

orcid

Research Focus & Metrics

Academic Career Length

12Years (2015-Present)

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

Representative Publications

View All Publications
20 December 2024 in Algorithms
Verified
Journal Article
Open access
PDF file
HFhussam fakhouri
hussam fakhouri
MAMohannad Alkhalaileh
Mohannad Alkhalaileh
FHFaten Hamad
Faten Hamad
NSNajem N. Sirhan
Najem N. Sirhan
SFSandi Fakhouri
Sandi Fakhouri
This study presents an innovative hybrid evolutionary algorithm that combines the Arctic Puffin Optimization (APO) algorithm with the JADE dynamic differential evolution framework. The APO algorithm, inspired by the foraging patterns of Arctic puffins, demonstrates certain challenges, including a tendency to converge prematurely at local minima, a slow rate of convergence, and an insufficient equilibrium between the exploration and exploitation processes. To mitigate these drawbacks, the proposed hybrid approach incorporates the dynamic features of JADE, which enhances the exploration–exploitation trade-off through adaptive parameter control and the use of an external archive. By synergizing the effective search mechanisms modeled after the foraging behavior of Arctic puffins with JADE’s advanced dynamic strategies, this integration significantly improves global search efficiency and accelerates the convergence process. The effectiveness of APO-JADE is demonstrated through benchmark tests against well-known IEEE CEC 2022 unimodal and multimodal functions, showing superior performance over 32 compared optimization algorithms. Additionally, APO-JADE is applied to complex engineering design problems, including the optimization of engineering structures and mechanisms, revealing its practical utility in navigating challenging, multi-dimensional search spaces typically encountered in real-world engineering problems. The results confirm that APO-JADE outperformed all of the compared optimizers, effectively addressing the challenges of unknown and complex search areas in engineering design optimization.

10 March 2025 in Algorithms
Verified
Journal Article
Open access
PDF file
AHAhmad K. Al Hwaitat
Ahmad K. Al Hwaitat
HFhussam fakhouri
hussam fakhouri
JZJamal Zraqou
Jamal Zraqou
NSNajem N. Sirhan
Najem N. Sirhan
This paper presents JADEDO, a hybrid optimization method that merges the dandelion optimizer’s (DO) dispersal-inspired stages with JADE’s (adaptive differential evolution) dynamic mutation and crossover operators. By integrating these complementary mechanisms, JADEDO effectively balances global exploration and local exploitation for both unimodal and multimodal search spaces. Extensive benchmarking against classical and cutting-edge metaheuristics on the IEEE CEC2022 functions—encompassing unimodal, multimodal, and hybrid landscapes—demonstrates that JADEDO achieves highly competitive results in terms of solution accuracy, convergence speed, and robustness. Statistical analysis using Wilcoxon sum-rank tests further underscores JADEDO’s consistent advantage over several established optimizers, reflecting its proficiency in navigating complex, high-dimensional problems. To validate its real-world applicability, JADEDO was also evaluated on three engineering design problems (pressure vessel, spring, and speed reducer). Notably, it achieved top-tier or near-optimal designs in constrained, high-stakes environments. Moreover, to demonstrate suitability for security-oriented tasks, JADEDO was applied to an attack-response optimization scenario, efficiently identifying cost-effective, low-risk countermeasures under stringent time constraints. These collective findings highlight JADEDO as a robust, flexible, and high-performing framework capable of tackling both benchmark-oriented and practical optimization challenges.

24 April 2015
Verified
Conference Paper
Open access
NSNajem N. Sirhan
Najem N. Sirhan
GHGregory L. Heileman
Gregory L. Heileman
Christopher LambChristopher Lamb
Christopher Lamb
RPRicardo Piro-Rael
Ricardo Piro-Rael

9 January 2026 in Intelligent Systems with Applications
Verified
Journal Article
Open access
HFhussam fakhouri
hussam fakhouri
RARiyad Alrousan
Riyad Alrousan
NHNiveen Z. Halalsheh
Niveen Z. Halalsheh
NSNajem N. Sirhan
Najem N. Sirhan
JZJamal Zraqou
Jamal Zraqou
KOKhalil Omar
Khalil Omar

2 May 2026 in Computation
Verified
Journal Article
Open access
PDF file
NSNajem N. Sirhan
Najem N. Sirhan
RARiyad Alrousan
Riyad Alrousan
SASamar Al-Saqqa
Samar Al-Saqqa
FHFaten Hamad
Faten Hamad
Zaid KhrisatZaid Khrisat
Zaid Khrisat
Accurate short-horizon downlink throughput prediction is essential for automation in high-density 5G deployments (e.g., stadiums and events), where user load, scheduling decisions, and interference conditions change rapidly and produce highly variable user-perceived rates. This paper benchmarks lightweight regression models for per-user throughput prediction from readily available radio access network (RAN) key performance indicators (KPIs) and studies a risk-aware extension that augments point forecasts with calibrated uncertainty and an abstention (deferral) rule. Experiments use a strictly time-ordered train/calibration/test protocol on the Liverpool 5G High-Density Demand (L5GHDD) dataset. The target is strongly zero-inflated (about 62% of samples at 0 Mbps) and heavy-tailed, creating regimes where average-error optimization can mask rare but operationally important bursts. In the point-prediction benchmark, the best model is a tuned two-stage support vector regressor with a mean absolute error (MAE) of 0.452 Mbps, while the strongest single-stage model attains a weighted mean absolute percentage error (WMAPE) of 56.200%. For uncertainty quantification, we compare standard split conformal prediction against two input-adaptive alternatives. Constant-width split conformal attains 88.900% marginal coverage for a nominal 90% target with an average interval width of 2.288 Mbps, but width-based deferral is degenerate because all intervals have the same size. Variable-length conformal intervals preserve near-nominal coverage (91.100%) while producing informative width variation: normalized conformal reduces the average width to 1.344 Mbps, and conformalized quantile regression reduces it to 0.641 Mbps. At a deferral threshold of 1.500 Mbps, constant-width conformal defers all samples, whereas normalized conformal still acts on 61.200% of samples with selective MAE 0.219 Mbps. These results show that input-adaptive uncertainty is necessary for meaningful selective prediction in heteroscedastic 5G throughput dynamics.

15 October 2026 in Network
Verified
Journal Article
Open access
PDF file
NSNajem N. Sirhan
Najem N. Sirhan
Mobile applications that must commit to a data rate—video streaming, guaranteed-rate admission, uplink scheduling—can stall or breach a service-level agreement whenever they promise more than the radio link can deliver. What protects them is not an accurate average-throughput forecast but a trustworthy lower bound on the rate that will actually be available. Conformal prediction (CP) can produce such bounds without distributional assumptions, but mobile 5G throughput is piecewise non-stationary: it jumps at cell handovers and radio-access-technology (RAT) transitions, exactly where a rate decision is most fragile. A natural fix is to condition the CP calibration on the mobility-regime state (RAT and time since the last handover). Using 188,711 s of real commercial 5G traces, we show that whether this conditioning helps is task-dependent. It helps two-sided prediction intervals, whose error scale varies by an order of magnitude across RATs, and it removes the post-handover under-coverage of online adaptive CP at no width cost. But for the one-sided lower bound that actually governs rate selection, a single global CP bound is better: it delivers higher link utilization at the same stall budget, and this advantage is robust to the data’s zero-inflation. The practical lesson for rate-control designers is to match the conditioning to the tail the decision uses, and to judge uncertainty methods by the operational outcome rather than by coverage alone. All results are reproducible from a released pipeline.