Pub Date : 2022-10-03DOI: 10.1080/09720529.2022.2133251
Md. Rashedul Islam, M. Begum, Md. Nasim Akhtar
Abstract The advancement of technologies demands a sustainable solution. To ensure the software system’s sustainability, diminishing the software faults before the implementation requires utmost attention, along with an effective procedure to predict the faults. A software system’s maximum number of faults can be neutralized if it can be predicted at the earliest possible time. Therefore, we applied Long short-term memory (LSTM) to predict the faults of multi-time stamps ahead using a recursive approach. The Min-Max scaler and one of the power transformation methods, Box-Cox are used to normalize the software fault data. The traditional software reliability growth models (SRGMs) are also used to predict faults. The performance of the LSTM and SRGMs models are compared based on their prediction accuracy evaluation. The observed prediction error of LSTM models is much lower than the SRGMs.
{"title":"Recursive approach for multiple step-ahead software fault prediction through long short-term memory (LSTM)","authors":"Md. Rashedul Islam, M. Begum, Md. Nasim Akhtar","doi":"10.1080/09720529.2022.2133251","DOIUrl":"https://doi.org/10.1080/09720529.2022.2133251","url":null,"abstract":"Abstract The advancement of technologies demands a sustainable solution. To ensure the software system’s sustainability, diminishing the software faults before the implementation requires utmost attention, along with an effective procedure to predict the faults. A software system’s maximum number of faults can be neutralized if it can be predicted at the earliest possible time. Therefore, we applied Long short-term memory (LSTM) to predict the faults of multi-time stamps ahead using a recursive approach. The Min-Max scaler and one of the power transformation methods, Box-Cox are used to normalize the software fault data. The traditional software reliability growth models (SRGMs) are also used to predict faults. The performance of the LSTM and SRGMs models are compared based on their prediction accuracy evaluation. The observed prediction error of LSTM models is much lower than the SRGMs.","PeriodicalId":46563,"journal":{"name":"JOURNAL OF DISCRETE MATHEMATICAL SCIENCES & CRYPTOGRAPHY","volume":null,"pages":null},"PeriodicalIF":1.4,"publicationDate":"2022-10-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"49123172","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}
Pub Date : 2022-10-03DOI: 10.1080/09720529.2022.2133255
Varsha Himthani, V. Dhaka, Manjit Kaur, Prashant Hemrajani
Abstract The visually meaningful image encryption (VMIE) technique is used to offer additional security to the noise-like encrypted image by implanting the secret image in the cover image. Generally, VMIE techniques follow two steps: pre-encryption and embedding. In this paper, an advanced V-Net architecture based VMIE technique is presented. V-Net architecture is based on a Convolution Neural Network (CNN) and offered medical image segmentation, that is utilized in the image into image steganography in the proposed work. In the proposed VMIE technique, the secret image is encrypted by utilizing the 5D chaotic map to provide high security, and the encrypted secret image is implanted into the cover image using a V-Net based embedding method. CNN-based image embedding methods offer high payload capacity and imperceptibility. In these methods, the encoder hides the secret image into the cover and the decoder reconstruct the secret image. Furthermore, a CNN-based efficient decoder is designed in the proposed method. Moreover, to validate the proposed method, standard evaluation parameters are analyzed.
{"title":"V-Net architecture based advanced visually meaningful image encryption technique","authors":"Varsha Himthani, V. Dhaka, Manjit Kaur, Prashant Hemrajani","doi":"10.1080/09720529.2022.2133255","DOIUrl":"https://doi.org/10.1080/09720529.2022.2133255","url":null,"abstract":"Abstract The visually meaningful image encryption (VMIE) technique is used to offer additional security to the noise-like encrypted image by implanting the secret image in the cover image. Generally, VMIE techniques follow two steps: pre-encryption and embedding. In this paper, an advanced V-Net architecture based VMIE technique is presented. V-Net architecture is based on a Convolution Neural Network (CNN) and offered medical image segmentation, that is utilized in the image into image steganography in the proposed work. In the proposed VMIE technique, the secret image is encrypted by utilizing the 5D chaotic map to provide high security, and the encrypted secret image is implanted into the cover image using a V-Net based embedding method. CNN-based image embedding methods offer high payload capacity and imperceptibility. In these methods, the encoder hides the secret image into the cover and the decoder reconstruct the secret image. Furthermore, a CNN-based efficient decoder is designed in the proposed method. Moreover, to validate the proposed method, standard evaluation parameters are analyzed.","PeriodicalId":46563,"journal":{"name":"JOURNAL OF DISCRETE MATHEMATICAL SCIENCES & CRYPTOGRAPHY","volume":null,"pages":null},"PeriodicalIF":1.4,"publicationDate":"2022-10-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"48794236","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}
Pub Date : 2022-10-03DOI: 10.1080/09720529.2022.2139933
Sonam, R. Johari
Abstract Routing is a key to exchange of the messages between the IoT enabled devices. For routing to be effective and efficient the message needs to be delivered instantly between neighboring nodes in IoT enabled network, if they are co-located in the overlapping transmission range of each other or through the cloud if the devices are located remotely. In today’s scenario, optimized routing is the need of the hour. In the proposed research work, an effort has been made to demonstrate the effective routing between publisher and subscriber through a centralized broker using IoT routing protocol such as MQTT (Message Queue Telemetry Transport). The Simulation of the protocol has been accomplished in JAVA Programming language using MOSQUITTO open-source toolkit and the results have been positive and encouraging.
{"title":"MORID: MQTT oriented routing between IoT devices","authors":"Sonam, R. Johari","doi":"10.1080/09720529.2022.2139933","DOIUrl":"https://doi.org/10.1080/09720529.2022.2139933","url":null,"abstract":"Abstract Routing is a key to exchange of the messages between the IoT enabled devices. For routing to be effective and efficient the message needs to be delivered instantly between neighboring nodes in IoT enabled network, if they are co-located in the overlapping transmission range of each other or through the cloud if the devices are located remotely. In today’s scenario, optimized routing is the need of the hour. In the proposed research work, an effort has been made to demonstrate the effective routing between publisher and subscriber through a centralized broker using IoT routing protocol such as MQTT (Message Queue Telemetry Transport). The Simulation of the protocol has been accomplished in JAVA Programming language using MOSQUITTO open-source toolkit and the results have been positive and encouraging.","PeriodicalId":46563,"journal":{"name":"JOURNAL OF DISCRETE MATHEMATICAL SCIENCES & CRYPTOGRAPHY","volume":null,"pages":null},"PeriodicalIF":1.4,"publicationDate":"2022-10-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"43579960","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}
Pub Date : 2022-09-12DOI: 10.1080/09720529.2022.2101601
N. Tahat, M. Shatnawi, S. Shatnawi, O. Ababneh, Obaida M. Al-hazaimeh
Abstract There has been a great deal of interest in researching the behavior of chaotic systems over the past decade. They are distinguished by their sensitivity to initial conditions, continuous broad-band power spectrum, and similarity to random behavior. Chaos has possible applications in the encryption, compression, and modulation blocks of a digital communication system. The possibility of self-synchronization of chaotic oscillations has spawned a deluge of research on the cryptographic applications of chaos. FAC (Factoring) and CM (Chaotic maps) are used in this research to develop a new signature system (CM). Our system has a higher security level than any other based on a single hard number-theoretic problem since it is extremely unlikely that FAC and CM can be solved effectively at the same time. We further demonstrate that the scheme’s performance involves only minimal operations in signing and validating logarithms, and that it is impervious to attack.
{"title":"A signature algorithm based on chaotic maps and factoring problems","authors":"N. Tahat, M. Shatnawi, S. Shatnawi, O. Ababneh, Obaida M. Al-hazaimeh","doi":"10.1080/09720529.2022.2101601","DOIUrl":"https://doi.org/10.1080/09720529.2022.2101601","url":null,"abstract":"Abstract There has been a great deal of interest in researching the behavior of chaotic systems over the past decade. They are distinguished by their sensitivity to initial conditions, continuous broad-band power spectrum, and similarity to random behavior. Chaos has possible applications in the encryption, compression, and modulation blocks of a digital communication system. The possibility of self-synchronization of chaotic oscillations has spawned a deluge of research on the cryptographic applications of chaos. FAC (Factoring) and CM (Chaotic maps) are used in this research to develop a new signature system (CM). Our system has a higher security level than any other based on a single hard number-theoretic problem since it is extremely unlikely that FAC and CM can be solved effectively at the same time. We further demonstrate that the scheme’s performance involves only minimal operations in signing and validating logarithms, and that it is impervious to attack.","PeriodicalId":46563,"journal":{"name":"JOURNAL OF DISCRETE MATHEMATICAL SCIENCES & CRYPTOGRAPHY","volume":null,"pages":null},"PeriodicalIF":1.4,"publicationDate":"2022-09-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"48316621","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}
Pub Date : 2022-08-18DOI: 10.1080/09720529.2022.2060609
F. J. Campena, Melody Mae C. Lunar, Inseok Sung
Abstract The energy and d-energy of a graph is the sum of the absolute values of the graphs’ adjacency and distance matrix respectively. In 2017, S. Vaidya and K. Popat determined the energy of a shadow graph of a connected graph. In this study we determine the eigenvalues and d-eigenvalues of a closed shadow graph. Thus, determining also the energy and distance energy of a closed shadow graph. As a consequence, the closed shadow graph of G is integral whenever G is integral, that is the eigenvalues of the adjacency matrix of the graph are all integers.
{"title":"On the eigenvalues of closed shadow graphs","authors":"F. J. Campena, Melody Mae C. Lunar, Inseok Sung","doi":"10.1080/09720529.2022.2060609","DOIUrl":"https://doi.org/10.1080/09720529.2022.2060609","url":null,"abstract":"Abstract The energy and d-energy of a graph is the sum of the absolute values of the graphs’ adjacency and distance matrix respectively. In 2017, S. Vaidya and K. Popat determined the energy of a shadow graph of a connected graph. In this study we determine the eigenvalues and d-eigenvalues of a closed shadow graph. Thus, determining also the energy and distance energy of a closed shadow graph. As a consequence, the closed shadow graph of G is integral whenever G is integral, that is the eigenvalues of the adjacency matrix of the graph are all integers.","PeriodicalId":46563,"journal":{"name":"JOURNAL OF DISCRETE MATHEMATICAL SCIENCES & CRYPTOGRAPHY","volume":null,"pages":null},"PeriodicalIF":1.4,"publicationDate":"2022-08-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"44944433","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}
Pub Date : 2022-08-18DOI: 10.1080/09720529.2021.1995221
Wei Ren
Abstract We prove Graham conjecture for some cases only by elementary methods in basic number theory. Extensive notes and remarks on new results on searching for the elementary proof of Graham conjecture are presented and discussed, e.g., by induction or directed graph.
{"title":"Notes on elementary proof of Graham conjecture","authors":"Wei Ren","doi":"10.1080/09720529.2021.1995221","DOIUrl":"https://doi.org/10.1080/09720529.2021.1995221","url":null,"abstract":"Abstract We prove Graham conjecture for some cases only by elementary methods in basic number theory. Extensive notes and remarks on new results on searching for the elementary proof of Graham conjecture are presented and discussed, e.g., by induction or directed graph.","PeriodicalId":46563,"journal":{"name":"JOURNAL OF DISCRETE MATHEMATICAL SCIENCES & CRYPTOGRAPHY","volume":null,"pages":null},"PeriodicalIF":1.4,"publicationDate":"2022-08-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"41309093","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}
Pub Date : 2022-08-18DOI: 10.1080/09720529.2021.2000152
Meryem Cherkaoui Semmouni, Abderrahmane Nitaj, M. Belkasmi
{"title":"Cryptanalysis of RSA with smooth prime sum","authors":"Meryem Cherkaoui Semmouni, Abderrahmane Nitaj, M. Belkasmi","doi":"10.1080/09720529.2021.2000152","DOIUrl":"https://doi.org/10.1080/09720529.2021.2000152","url":null,"abstract":"","PeriodicalId":46563,"journal":{"name":"JOURNAL OF DISCRETE MATHEMATICAL SCIENCES & CRYPTOGRAPHY","volume":null,"pages":null},"PeriodicalIF":1.4,"publicationDate":"2022-08-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"46127888","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}
Pub Date : 2022-08-18DOI: 10.1080/09720529.2022.2099060
A. Jabbar, A. H. Hussain
Abstract In this paper, we studied some of the properties of a Q-Samarandache pseudo BH- algebra, a Q-Samarandache pseudo ideal, a pseudo clean ideal and a Q-Samarandache pseudo clean ideal of a Q-Samarandache pseudo BH-algebra respectively and so we presented the relationships between these types of ideals.
{"title":"A Q-smarandache pseudo clean ideals of BH-Algebra","authors":"A. Jabbar, A. H. Hussain","doi":"10.1080/09720529.2022.2099060","DOIUrl":"https://doi.org/10.1080/09720529.2022.2099060","url":null,"abstract":"Abstract In this paper, we studied some of the properties of a Q-Samarandache pseudo BH- algebra, a Q-Samarandache pseudo ideal, a pseudo clean ideal and a Q-Samarandache pseudo clean ideal of a Q-Samarandache pseudo BH-algebra respectively and so we presented the relationships between these types of ideals.","PeriodicalId":46563,"journal":{"name":"JOURNAL OF DISCRETE MATHEMATICAL SCIENCES & CRYPTOGRAPHY","volume":null,"pages":null},"PeriodicalIF":1.4,"publicationDate":"2022-08-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"59648250","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}
Pub Date : 2022-08-18DOI: 10.1080/09720529.2022.2060918
Hasan Abdulraheem Jubair Al-Yasiri, Ali Abd Alhussein Zyarah, Adnan Waseel Kadhim Shubbar
Abstract A gamma ring(Γ− ring) is ΓR-module and W is proper ΓR-submodule. Let W be a proper ΓR-submodule of an ΓR-module is called nearly prime, for short N-P.ΓR-submodule if whenever and rγ m ∈ W implies that either or where is the Jacobson radical of . The goal of this work is to offer an intriguing way of defining and studying nearly P.ΓR-submodule of ΓR-module, for short N-P.ΓR-submodule of ΓR-module result N-P.ΓR-submodule of ΓR-module which represent generalization N-prime submodules.
{"title":"Nearly prime GR-submodules of GR-modules","authors":"Hasan Abdulraheem Jubair Al-Yasiri, Ali Abd Alhussein Zyarah, Adnan Waseel Kadhim Shubbar","doi":"10.1080/09720529.2022.2060918","DOIUrl":"https://doi.org/10.1080/09720529.2022.2060918","url":null,"abstract":"Abstract A gamma ring(Γ− ring) is ΓR-module and W is proper ΓR-submodule. Let W be a proper ΓR-submodule of an ΓR-module is called nearly prime, for short N-P.ΓR-submodule if whenever and rγ m ∈ W implies that either or where is the Jacobson radical of . The goal of this work is to offer an intriguing way of defining and studying nearly P.ΓR-submodule of ΓR-module, for short N-P.ΓR-submodule of ΓR-module result N-P.ΓR-submodule of ΓR-module which represent generalization N-prime submodules.","PeriodicalId":46563,"journal":{"name":"JOURNAL OF DISCRETE MATHEMATICAL SCIENCES & CRYPTOGRAPHY","volume":null,"pages":null},"PeriodicalIF":1.4,"publicationDate":"2022-08-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"41687763","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：