Akram M. Zeki

Akram M. Zeki

Auto-generated profile, based on publicly available information

Akram M. Zeki

International Islamic University Malaysia

Research Focus & Metrics

Academic Career Length

14Years (2013-Present)

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

Representative Publications

View All Publications
16 September 2023 in Sustainability
Verified
Journal Article
Open access
PDF file
AAABDULLAH SAID ALI ALAAMRI
ABDULLAH SAID ALI ALAAMRI
RARawad Prof. Dr. Rawad Abdulghafor
Rawad Prof. Dr. Rawad Abdulghafor
Sherzod TuraevSherzod Turaev
Sherzod Turaev
IAImad Al-Shaikhli
Imad Al-Shaikhli
AZAkram Zeki
Akram Zeki
STShuhaili Talib
Shuhaili Talib
Nowadays, countries face a multitude of electronic threats that have permeated almost all business sectors, be it private corporations or public institutions. Among these threats, advanced persistent threats (APTs) stand out as a well-known example. APTs are highly sophisticated and stealthy computer network attacks meticulously designed to gain unauthorized access and persist undetected threats within targeted networks for extended periods. They represent a formidable cybersecurity challenge for governments, corporations, and individuals alike. Recognizing the gravity of APTs as one of the most critical cybersecurity threats, this study aims to reach a deeper understanding of their nature and propose a multi-stage framework for automated APT detection leveraging time series data. Unlike previous models, the proposed approach has the capability to detect real-time attacks based on stored attack scenarios. This study conducts an extensive review of existing research, identifying its strengths, weaknesses, and opportunities for improvement. Furthermore, standardized techniques have been enhanced to enhance their effectiveness in detecting APT attacks. The learning process relies on datasets sourced from various channels, including journal logs, traceability audits, and systems monitoring statistics. Subsequently, an efficient APT detection and prevention system, known as the composition-based decision tree (CDT), has been developed to operate in complex environments. The obtained results demonstrate that the proposed approach consistently outperforms existing algorithms in terms of detection accuracy and effectiveess.

1 September 2020 in Journal of King Saud University Computer and Information Sciences
Verified
Journal Article
Open access
MKMahmoud M. Khattab
Mahmoud M. Khattab
AZAkram M Zeki
Akram M Zeki
Ali A. Alwan Al-jubooriAli A. Alwan Al-juboori
Ali A. Alwan Al-juboori
ABAhmed S. Badawy
Ahmed S. Badawy

4 January 2017 in Multimedia Tools and Applications
Verified
Journal Article
Closed access
PDF file
Saman Shojae ChaeikarSaman Shojae Chaeikar
Saman Shojae Chaeikar
Mazdak ZamaniMazdak Zamani
Mazdak Zamani
AMAzizah Bt Abdul Manaf
Azizah Bt Abdul Manaf
AZAkram M. Zeki
Akram M. Zeki

14 August 2017 in IOP Conference Series: Materials Science and Engineering
Verified
Conference Paper
Open access
PDF file
Umar Bin QushemUmar Bin Qushem
Umar Bin Qushem
AZAkram M. Zeki
Akram M. Zeki
AIAdamu Abubakar Ibrahim
Adamu Abubakar Ibrahim

24 June 2016 in SpringerPlus
Verified
Journal Article
Open access
PDF file
AZAkram Zeki
Akram Zeki
AIAdamu Abubakar Ibrahim
Adamu Abubakar Ibrahim
HCHaruna Chiroma
Haruna Chiroma
Prior research studies have shown that the peak signal to noise ratio (PSNR) is the most frequent watermarked image quality metric that is used for determining the levels of strength and weakness of watermarking algorithms. Conversely, normalised cross correlation (NCC) is the most common metric used after attacks were applied to a watermarked image to verify the strength of the algorithm used. Many researchers have used these approaches to evaluate their algorithms. These strategies have been used for a long time, however, which unfortunately limits the value of PSNR and NCC in reflecting the strength and weakness of the watermarking algorithms. This paper considers this issue to determine the threshold values of these two parameters in reflecting the amount of strength and weakness of the watermarking algorithms. We used our novel watermarking technique for embedding four watermarks in intermediate significant bits (ISB) of six image files one-by-one through replacing the image pixels with new pixels and, at the same time, keeping the new pixels very close to the original pixels. This approach gains an improved robustness based on the PSNR and NCC values that were gathered. A neural network model was built that uses the image quality metrics (PSNR and NCC) values obtained from the watermarking of six grey-scale images that use ISB as the desired output and that are trained for each watermarked image’s PSNR and NCC. The neural network predicts the watermarked image’s PSNR together with NCC after the attacks when a portion of the output of the same or different types of image quality metrics (PSNR and NCC) are obtained. The results indicate that the NCC metric fluctuates before the PSNR values deteriorate.

1 January 2016 in Open Mathematics
Verified
Journal Article
Open access
PDF file
RARawad Prof. Dr. Rawad Abdulghafor
Rawad Prof. Dr. Rawad Abdulghafor
FSFarruh Shahidi
Farruh Shahidi
AZAkram Zeki
Akram Zeki
Sherzod TuraevSherzod Turaev
Sherzod Turaev
The present paper focuses on the dynamics of doubly stochastic quadratic operators (d.s.q.o) on a finite-dimensional simplex. We prove that if a d.s.q.o. has no periodic points then the trajectory of any initial point inside the simplex is convergent. We show that if d.s.q.o. is not a permutation then it has no periodic points on the interior of the two dimensional (2D) simplex. We also show that this property fails in higher dimensions. In addition, the paper also discusses the dynamics classifications of extreme points of d.s.q.o. on two dimensional simplex. As such, we provide some examples of d.s.q.o. which has a property that the trajectory of any initial point tends to the center of the simplex. We also provide and example of d.s.q.o. that has infinitely many fixed points and has infinitely many invariant curves. We therefore came-up with a number of evidences. Finally, we classify the dynamics of extreme points of d.s.q.o. on 2D simplex.