{"title":"Enhancing the Performance of Generative Adversarial Networks with Identity Blocks and Revised Loss Function to Improve Training Stability","authors":"Mohamed Salem, Mohamed Sakr, Sherif Eletriby","doi":"10.21608/ijci.2023.200402.1101","DOIUrl":"https://doi.org/10.21608/ijci.2023.200402.1101","url":null,"abstract":"Generative adversarial networks (GANs) are a powerful deep learning model for synthesizing realistic images; however, they can be difficult to train and are prone to instability and mode collapse. This paper presents a modified deep learning model called Identity Generative Adversarial Network (IGAN) to address the challenges of training and instability faced by generative adversarial models in synthesizing realistic images. The IGAN model includes three modifications to improve the performance of DCGAN: a non-linear identity block to ease complex data fitting and reduce training time; a modified loss function with label smoothing to smooth the standard GAN loss function; and minibatch training to use other examples from the same minibatch as side information for better quality and variety of generated images. The effectiveness of IGAN was evaluated and compared with other state-of-the-art generative models using the inception score (IS) and Fréchet inception distance (FID) on CelebA and stacked MNIST datasets. The experiments demonstrated that IGAN outperformed the other models in terms of convergence speed, stability, and diversity of results. Specifically, in 200 epochs, IGAN achieved an IS of 13.6 and an FID of 46.2. Furthermore, the IGAN collapsed modes were compared with other generative models using a stacked MNIST dataset, showing the superiority of IGAN in producing all the modes while the other models failed to do so. These results demonstrate that the modifications implemented in IGAN can significantly enhance the performance of GANs in synthesizing realistic images, providing a more stable, high-quality, and diverse output.","PeriodicalId":137729,"journal":{"name":"IJCI. International Journal of Computers and Information","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133547627","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Security Evaluation of Different Hashing Functions with RSA for Digital Signature","authors":"M. Badawy","doi":"10.21608/ijci.2023.208602.1108","DOIUrl":"https://doi.org/10.21608/ijci.2023.208602.1108","url":null,"abstract":"The emergence of the Internet of Things (IoT) represents a significant trend, where integrating IP, data, and wireless technologies onto a single network yields substantial advantages that are both essential and appealing. However, the amalgamation of these entities introduces novel susceptibilities and opportunities for infiltrating IoT networks, thereby necessitating the perpetual advancement of integrated security methodologies. This study investigates the feasibility of utilizing the Rivest–Shamir–Adleman (RSA) method, based on the Miller-Rabin technique, as a stream key generator with five distinct hashing functions to attain robust digital signatures. The RSA encryption method underwent a comprehensive battery of tests to assess its validity, and its encryption efficacy was evaluated through mathematical analysis. This research examines the assessment of digital signatures by utilizing five distinct hash functions in conjunction with RSA keys. Each signature file was assessed based on four tests: entropy, floating frequency, autocorrelation, and histogram analysis. The tests were conducted on a document with a size of 256 bytes. In addition, nine hash algorithms were utilized, namely SHA224, SHA256, SHA384, SHA512, BLAKE2B, BLAKE2S, MD5, MD2, and RIPEMD160. Different algorithms were used for varying key sizes and word counts for hashing. The experiment was repeated 100 times to obtain precise measurements of the average time and entropy. The findings indicate that when implemented with an appropriate key length, RSA exhibits both efficiency and sufficient security to be deployed in IoT networks.","PeriodicalId":137729,"journal":{"name":"IJCI. International Journal of Computers and Information","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131384429","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Comparative Study of Intelligent Scheduling Algorithms for Heterogeneous Systems","authors":"A. Kafafy, abla elsayed, O. Abdel Raouf","doi":"10.21608/ijci.2023.213534.1114","DOIUrl":"https://doi.org/10.21608/ijci.2023.213534.1114","url":null,"abstract":"","PeriodicalId":137729,"journal":{"name":"IJCI. International Journal of Computers and Information","volume":"160 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-08-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133082379","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Machine Learning Algorithms for Enhancing Emotion Recognition from EEG Signals","authors":"Aseel Attia, Khalid Amin, Mina I. S. Ibrahim","doi":"10.21608/ijci.2023.199502.1099","DOIUrl":"https://doi.org/10.21608/ijci.2023.199502.1099","url":null,"abstract":"","PeriodicalId":137729,"journal":{"name":"IJCI. International Journal of Computers and Information","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122031886","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Mohamed Wageh, Khalid Amin, A. Zytoon, Mina Ibrahim
{"title":"Brain Tumor Detection Based on A Combination of GLCM and LBP Features with PCA and IG","authors":"Mohamed Wageh, Khalid Amin, A. Zytoon, Mina Ibrahim","doi":"10.21608/ijci.2023.205444.1107","DOIUrl":"https://doi.org/10.21608/ijci.2023.205444.1107","url":null,"abstract":"","PeriodicalId":137729,"journal":{"name":"IJCI. International Journal of Computers and Information","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-05-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134225998","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Q-rank Metric to measure Search Engine Optimization","authors":"Dina Shafiq, Hayam Mousa, Khalid Amin","doi":"10.21608/ijci.2023.170064.1090","DOIUrl":"https://doi.org/10.21608/ijci.2023.170064.1090","url":null,"abstract":"","PeriodicalId":137729,"journal":{"name":"IJCI. International Journal of Computers and Information","volume":"11 4","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-05-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121000259","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Historical Isolated Forest for detecting and adaptation concept drifts in nonstationary data streaming","authors":"Ahmed H. Madkour","doi":"10.21608/ijci.2023.185429.1095","DOIUrl":"https://doi.org/10.21608/ijci.2023.185429.1095","url":null,"abstract":"","PeriodicalId":137729,"journal":{"name":"IJCI. International Journal of Computers and Information","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-03-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122477509","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A New Approach To Suicide Ideation Detection from Text Content","authors":"Abdallah Basyouni, Hatem Abdelkader, Asmaa Ali","doi":"10.21608/ijci.2023.173255.1092","DOIUrl":"https://doi.org/10.21608/ijci.2023.173255.1092","url":null,"abstract":"","PeriodicalId":137729,"journal":{"name":"IJCI. International Journal of Computers and Information","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-02-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133763414","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Mohammed Attya, M. El-Sayed, Ahmed S. Sakr, Hatem Ahmed
{"title":"An evaluation framework for selecting cloud service provider in neutrosophic environment and Modified Generative Adversarial Network","authors":"Mohammed Attya, M. El-Sayed, Ahmed S. Sakr, Hatem Ahmed","doi":"10.21608/ijci.2022.164289.1088","DOIUrl":"https://doi.org/10.21608/ijci.2022.164289.1088","url":null,"abstract":"","PeriodicalId":137729,"journal":{"name":"IJCI. International Journal of Computers and Information","volume":"92 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-11-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128433612","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Improved version of explainable decision forest: Forest-Based Tree","authors":"Faten Khalifa, Asmaa Ali, Hatem Abdel-Kader","doi":"10.21608/ijci.2022.155977.1082","DOIUrl":"https://doi.org/10.21608/ijci.2022.155977.1082","url":null,"abstract":"","PeriodicalId":137729,"journal":{"name":"IJCI. International Journal of Computers and Information","volume":"76 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-11-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115618648","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}