MAMohammed Abbas Fadhil Al-Husainy

Mohammed Abbas Fadhil Al-Husainy

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article

Previous Organizations / Institutes

The organizations / institutes from the scholar's other articles in the past ten years


Mohammed Abbas Fadhil Al-Husainy has a total of 22 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    Label Noise and the Accuracy Ceiling in Arabic Sentiment Benchmarks: A Reconciled Error Audit of HARD with Replication on ASTD and ArSAS

    by Mohammad O. Alhawarat, Ayman J. Alnsour, Khalil M. Abdelnaby, Mohammed A. F. Al-Husainy

    Arabic sentiment benchmarks are widely used to rank models, yet how much of their residual error reflects genuine model failure rather than incorrect ground-truth labels is rarely audited directly. We report a reconciled, two-annotator audit of every error (n = 401) made by the best-performing model on the Hotel Arabic Reviews Dataset (HARD), with moderate item-level agreement (Cohen’s κ = 0.41–0.42), categorizing each as label noise, genuine model error, or irreducibly ambiguous. We find that 43.4% of residual errors (49.2% of false positives, 32.6% of false negatives) are attributable to incorrect ground truth. Instantiating the random classification noise model with this measurement implies, for any classifier whose errors are independent of the label noise (a conditional assumption we flag, not a demonstrated fact), a measurable-accuracy ceiling of about 98.35% on HARD derived from a lower-bound noise estimate, leaving at most roughly 2.11 points of headroom for future work. Against that ceiling we place a five-seed comparison of four ensemble-combination rules over four Arabic transformer backbones, in which stacking’s gain over the best single model is modest and not robust: 96.40% vs. 96.24% macro-F1, nominally p = 0.023 but not significant after multiple-comparison correction, and no ensemble rule reliably beats the best backbone. Replicating the full protocol on ASTD and ArSAS shows that neither the backbone ranking nor the ensemble benefit generalizes to informal-register data. We release the reconciled annotations, protocol, and evaluation code.

  • Open Access

    Optimizing Energy-Efficient Resource Allocation in 5G Autonomous Vehicle Networks Through Deep Reinforcement Learning

    by Khalil M. Abdelnaby, Mohammed A. F. Al-Husainy, Mohammad O. Alhawarat, Mohamed A. Rohaim, Khairy M. Assar, Khaled A. Elshafey

    AVs are also bound to capitalize on 5G networks, which creates crucial challenges in the adaptable management of resources because they need very low latency, a high-speed connection, and energy-efficient functionality. Older approaches to optimizing resource allocation in the high-frequency changing vehicle environment fail to deliver as mobility trends and network status constantly adapt and change. To overcome these problems, we suggest a new Deep Reinforcement Learning (DRL)-based algorithm, which is aimed at optimizing the allocation of resources to AVs. This model combines a Spatiotemporal Graph Convolution Network (ST-GCN), Gated Recurrent Units (GRU), and Multi-Agent Deep Deterministic Policy Gradient (MADDPG) to create a unified model. The ST-GCN is successful at both capturing the dynamic space relationship between vehicles and between vehicles and roadside infrastructure, and also gives a complete picture of network topology. GRU uses traffic and communication information to forecast future mobility patterns and bandwidth demand of each agent and therefore allocate resources proactively. The MADDPG algorithm is used to enable decentralized but coordinated decision-making among AVs, which enables the realization of dynamic policies of bandwidth allocation in real-time. Simulations using such aspects as a realistic Rayleigh fading channel model, a node density of 100 vehicles/km2, and 100 MHz of bandwidth prove the effectiveness of the framework extensively. We find that the end-to-end latency increase is reduced by up to 30%, and the system throughput is increased by up to 28, and the energy efficiency is increased by an average of 40 percent in comparison with the baseline techniques. Such results confirm our framework to be a plausible solution to building effective and sustainable communication systems to enable AVs to cooperate in the information exchange of important data.

  • Open Access

    Limit-Cycle Proliferation Under Parametric Delayed Feedback in a Conductance-Based Neuron: Bifurcation Landscape, Orbit Catalog, and Capacity Analysis

    by Mohammad O. Alhawarat, Ayman J. Alnsour, Mohammed A. F. Al-Husainy, Khalil M. Abdelnaby

    We show that a single Hodgkin–Huxley (HH) neuron with Pyragas-type delayed feedback control (DFC) can store multiple symbols as stable periodic orbits, where the specific orbit is selected by tuning the DFC gain K and time delay τ. Sweeping the (K,τ) parameter plane at fixed bias current Ibias = 10.0 μA/cm2 reveals 207 orbit types across 12 topological categories, with inter-spike interval (ISI) means from 5.9 to 56.9 ms. We establish: (i) a write protocol that reliably locks orbits with 13.9 ms median settling time; (ii) a novel Pattern-Oriented Limit-cycle Decoder (POLD) that reads orbits at 100% accuracy from only five observed ISIs (1200 trials across 12 orbits; Wilson 95% CI: 99.7–100%); (iii) a complete single-symbol write–read–erase (W–R–E) cycle with 100% read accuracy, 92% erase verification, and no decay over hold durations up to 50 s; and (iv) a fully validated 12-symbol memory capacity with a read-discriminable upper bound of 67 symbols (11.2× over rate coding; write viability confirmed only for the conservative 12-symbol subset). Reliable orbit addressing needs delay precision of ±2%, which constitutes a write-precision specification and not a fundamental capacity limit. These findings show that parametric delayed feedback is a viable mechanism for limit-cycle-based information storage in conductance-based spiking neurons. The biological interpretation is analogical, not direct: the ±2% delay-precision requirement exceeds what has been demonstrated for biological autaptic variability, and the orbit-coded memory framing is best understood as a computational proof-of-principle aimed at neuromorphic engineering, not as a claim about biological working memory.


  • Open Access

    Limit-Cycle Proliferation Under Parametric Delayed Feedback in a Conductance-Based Neuron: Bifurcation Landscape, Orbit Catalog, and Capacity Analysis

    by Mohammad O. Alhawarat, Ayman J. Alnsour, Mohammed A. F. Al-Husainy, Khalil M. Abdelnaby

    We show that a single Hodgkin–Huxley (HH) neuron with Pyragas-type delayed feedback control (DFC) can store multiple symbols as stable periodic orbits, where the specific orbit is selected by tuning the DFC gain K and time delay τ. Sweeping the (K,τ) parameter plane at fixed bias current Ibias=10.0μA/cm2 reveals 207 orbit types across 12 topological categories, with inter-spike interval (ISI) means from 5.9 to 56.9 ms. We establish: (i) a write protocol that reliably locks orbits with 13.9 ms median settling time; (ii) a novel Pattern-Oriented Limit-cycle Decoder (POLD) that reads orbits at 100% accuracy from only 5 observed ISIs; (iii) a full write–read–erase (W–R–E) cycle with 100% read accuracy, 92% erase verification, and no decay over hold durations up to 50 s; and (iv) a fully validated 12-symbol memory capacity, with a read-discriminable upper bound of 67 symbols (11.2× over rate coding) pending write-viability confirmation for the extended set. Reliable orbit addressing needs delay precision of ±2%, which constitutes a write-precision specification and not a fundamental capacity limit. These findings show that parametric delayed feedback is a viable mechanism for limit-cycle-based information storage in conductance-based spiking neurons. The biological interpretation is analogical, not direct: the ±2% delay-precision requirement exceeds what has been demonstrated for biological autaptic variability, and the orbit-coded memory framing is best understood as a computational proof-of-principle aimed at neuromorphic engineering, not as a claim about biological working memory.

  • Open Access

    The Intelligent Home: A Systematic Review of Technological Pillars, Emerging Paradigms, and Future Directions

    by Khalil M. Abdelnaby, Mohammed A. F. Al-Husainy, Mohammad O. Alhawarat, Mohamed A. Rohaim, Khairy M. Assar, Khaled A. Elshafey

    Home automation is undergoing a paradigm shift from connected IoT environments with rule-based control to intelligent homes exhibiting ambient intelligence and proactive adaptation. Artificial intelligence, privacy-preserving sensing, and converging connectivity standards are the primary forces driving this transition. This systematic literature review synthesizes the technological foundations, architectural developments, emerging paradigms, and socio-technical challenges characterizing the next generation of smart homes, evaluated against the original Ambient Intelligence (AmI) vision. Following PRISMA 2020 guidelines, searches were conducted across four databases—IEEE Xplore, ACM Digital Library, Scopus, and Web of Science—covering studies published between January 2020 and June 2025. From 3450 records, 113 studies were selected through a two-reviewer screening procedure with inter-rater reliability assessments. Quality was assessed using a modified JBI Critical Appraisal Checklist, and findings were synthesized through thematic analysis. Three converging technological pillars were identified: multi-modal privacy-preserving sensing including mmWave radar; a hierarchical cloud-edge-TinyML intelligence engine; and unified connectivity through the Matter/Thread standard. Emerging paradigms include LLM-based cognitive orchestration, hyper-personalization, Digital Twin simulation, and grid-interactive prosumer energy management. Realizing that the intelligent home vision requires addressing the privacy–security–trust trilemma, algorithmic bias, system reliability, and human–agent collaboration, a research roadmap encompassing explainable AI, privacy-by-design, lifelong learning, and standardized ethical auditing is proposed.


  • Open Access

    Super Encryption Standard (SES): A Key-Dependent Block Cipher for Image Encryption

    by Mohammed Abbas Fadhil Al-Husainy, Bassam Al-Shargabi, Omar Sabri

    Data encryption is a core mechanism in modern security services for protecting confidential data at rest and in transit. This work introduces the Super Encryption Standard (SES), a symmetric block cipher that follows the overall workflow of the Advanced Encryption Standard (AES) but adopts a key-dependent design to enlarge the effective key space and improve execution efficiency. The SES accepts a user-supplied key file and a selectable block dimension, from which it derives per-block round material and a dynamic substitution box generated using SHA-512. Each round relies only on XOR and a conditional half-byte swap driven by key-derived row and column vectors, enabling lightweight diffusion and confusion with low implementation cost. Experimental evaluation using multiple color images of different sizes shows that the proposed SES algorithm achieves faster encryption than the AES baseline and produces a ciphertext that behaves statistically like random noise. The encrypted images exhibit very low correlation between adjacent pixels, strong sensitivity to even minor changes in the plaintext and in the key, and resistance to standard statistical and differential attacks. Analysis of the SES substitution box also indicates favorable differential and linear properties that are comparable to those of the AES. The SES further supports a very wide key range, scaling well beyond typical fixed-length keys, which substantially increases brute-force difficulty. Therefore, the SES is a promising cipher for image encryption and related data-protection applications.


  • Open Access

    Comparative Assessment of Hash Functions in Securing Encrypted Images

    by Ghayth Al-Asad, Mohammed Al-Husainy, Mohammad Bani-Hani, Ala’eDdin Al-Zu’bI, Sara Albatienh, Hazem Abuoliem

    Different encryption methods have been developed to securely transmit confidential images over the Internet and combat the increasing cybercrime. Many of these methods use hash functions to enhance encryption strength. Due to the lack of a comprehensive evaluation of how different hash functions affect image encryption, this study presents a comparative analysis of the performance of various hash functions as encryption keys and analyzes their security, speed, and efficiency. The source image is first processed as a series of bytes. The bytes are divided into byte vectors, each with a length that matches the length of the hash value of a specified hash function. An XOR operation is performed between the hash value bytes and the associated byte vector. The bytes are reordered in each vector according to the ascending order of the associated hash value. Several metrics, such as Normalized Mean Absolute Error (NMAE), Peak Signal to Noise Ratio (PSNR), entropy, key size, and hash time, were used to evaluate the performance of different hash functions in image encryption. The results showed a clear variation in using various hash functions in terms of security, speed, and efficiency. With NMAE>72%, PSNR7.999 bpp, the use of the SHA family and MD5 is recommended in applications that need to achieve a high level of distortion in encrypted images. To resist brute-force attacks on the key, Blake2b, SHA512, and Whirlpool are the best choices with a key size of 512 bits. The Tiger is the fastest hash function, requiring the least average time of 0.372 seconds to complete the encryption process, making it the best choice for real-time applications. These findings help to choose the appropriate hash function in developing cryptographic techniques for a particular area.


  • Open Access

    Using the 3D Protein Structure as Key to Encrypt Images

    by Mohammed Abbas Fadhil Al-Husainy, Hamza A. A. Al-Sewadi, Ahmed M. Sayed

    In the digital world, information is exposed anytime, anywhere, to everybody, hence itsprivacy is a crucial matter. No matter how complicated the encryption algorithm is, itrequires a strong and hard-to-break encryption key. Since the three-dimensional proteinsequence structures are usually highly conserved, even better than DNA sequences, thiswork presents an innovative scheme for implementing the protein sequence andstructural to build protein data tables that are then used to generate extremely strongencryption-keys. An image-encryption scheme designed to implement such encryptionkeys is developed and produced compatible security strength with existing encryptionschemes. Prototype experiments resulted in an average normalized mean absolute errorof 66.84%, an average peak signal to noise ratio of 6.85 dB, and comparable entropywith other cryptosystems. The obtained results make this scheme a promising colorimage protection technique for various applications.


  • Open Access

    Multi-round encryption for COVID-19 data using the DNA key

    by Bassam Al-Shargabi, Mohammed Abbas Fadhil Al-Husainy

    The need for a reliable and fast encryption algorithm to encrypt medical data for patients is an extremely important topic to be considered especially during pandemic times such as the pandemic COVID-19. This pandemic forced governments and healthcare institutions to monitor COVID-19 patients. All the patient's data or records are also shared among healthcare researchers to be used to help them find vaccines or cures for this pandemic. Therefore, protecting such data (images, text) or records face an everincreasing number of risks. In this paper, a novel multi-round encryption algorithm based on deoxyribonucleic acid (DNA) is proposed. The significance of the proposed algorithm comes from using a different random key to perform simple and fast encryption operations on multiple rounds to achieve a high level of confusion and diffusion effects in encrypted data. Experiments were conducted using a set of datasets of various types such as Excel sheets, images, and database tables. The experiments were conducted to test the performance and security level of the proposed encryption algorithm against well-known algorithms such as data encryption standard (DES) and advanced encryption standard (AES). The experiments show an outstanding performance regarding the encryption time, key size, information entropy, and the avalanche effects.


  • Lightweight cryptography system for IoT devices using DNA

    by Mohammed Abbas Fadhil Al-Husainy, Bassam Al-Shargabi, Shadi Aljawarneh