K. K. Jabbar, Hussain A. Hailal, Aysar Thamer Naser
Information security is the biggest and most complex problem at present because of its great impact on modern software in all fields. Therefore, many researchers are working to develop modern methods of protecting data from modification or theft or even accessing it in one way or another. As dealing with data is a very sensitive matter in terms of sending this data from one party to another through the Internet or social media. The protection of that data requires the use of algorithms to encrypt or conceal the data with the proposed and used algorithms, and these algorithms work based on the proposed key exchange principle, so many of these algorithms need a key generator to work with other than the key is public or private for encryption or decryption the blade. Our proposed developed a key generation sub-system, as this system consists of two parts, the first part aimed to generate the first key (the first 64-bit subkey), while the second part (the second subsystem) will generate the second key (the second subkey is 64-bit). As the two sub-systems work to generate keys in different ways, the first system uses the principle of electronic gates to generate the keys randomly, while the second system uses binary text and LFSR. The idea in these sub-systems is that they work together in encrypting and decrypting data, requiring that the sender and receiver have the keys to complete the process. The results obtained from the two subsystems show the power in protecting data from reading or decoding its code, as the message consists of only a part of the key and the second part is at the receiver, and this gives stronger immunity in this encrypted data.
{"title":"Information security based on sub-system keys generator by utilizing polynomials method and logic gate","authors":"K. K. Jabbar, Hussain A. Hailal, Aysar Thamer Naser","doi":"10.47974/jdmsc-1549","DOIUrl":"https://doi.org/10.47974/jdmsc-1549","url":null,"abstract":"Information security is the biggest and most complex problem at present because of its great impact on modern software in all fields. Therefore, many researchers are working to develop modern methods of protecting data from modification or theft or even accessing it in one way or another. As dealing with data is a very sensitive matter in terms of sending this data from one party to another through the Internet or social media. The protection of that data requires the use of algorithms to encrypt or conceal the data with the proposed and used algorithms, and these algorithms work based on the proposed key exchange principle, so many of these algorithms need a key generator to work with other than the key is public or private for encryption or decryption the blade. Our proposed developed a key generation sub-system, as this system consists of two parts, the first part aimed to generate the first key (the first 64-bit subkey), while the second part (the second subsystem) will generate the second key (the second subkey is 64-bit). As the two sub-systems work to generate keys in different ways, the first system uses the principle of electronic gates to generate the keys randomly, while the second system uses binary text and LFSR. The idea in these sub-systems is that they work together in encrypting and decrypting data, requiring that the sender and receiver have the keys to complete the process. The results obtained from the two subsystems show the power in protecting data from reading or decoding its code, as the message consists of only a part of the key and the second part is at the receiver, and this gives stronger immunity in this encrypted data.","PeriodicalId":46563,"journal":{"name":"JOURNAL OF DISCRETE MATHEMATICAL SCIENCES & CRYPTOGRAPHY","volume":null,"pages":null},"PeriodicalIF":1.4,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"70464947","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}
SPM, Software Project Management is an engineering process for scheduling, developing, testing, and maintaining a software system. The size of a software is one of the important attributes in determining all the activities of SPM. Price, time, and effort are the basic factors for developing software in a successful and profitable manner. The fast explosions in technological development of software systems attracted all the fields that existed in the universe. The modern software system uses many programming languages, domains, operating systems, technologies, development cycles, topologies, etc. So, the industry is expecting a new, versatile, and highly updated sizing technique for modern software. Modern Metrics (MM) is a new anticipated size estimation technique for present software systems with updated functional values and metrics using Function Point (FP). This article analyzed the functional unit metric values (effort modifiers) of the MM with real world applications. MM is a novel method for determining the solution to the SPM challenges.
{"title":"Modern Metrics (MM): Software size estimation using function points for artificial intelligence and data analytics applications and finding the effort modifiers of the functional units using indian software industry","authors":"J. T. M. Dhas, J. Midhunchakravarthy","doi":"10.47974/jdmsc-1734","DOIUrl":"https://doi.org/10.47974/jdmsc-1734","url":null,"abstract":"SPM, Software Project Management is an engineering process for scheduling, developing, testing, and maintaining a software system. The size of a software is one of the important attributes in determining all the activities of SPM. Price, time, and effort are the basic factors for developing software in a successful and profitable manner. The fast explosions in technological development of software systems attracted all the fields that existed in the universe. The modern software system uses many programming languages, domains, operating systems, technologies, development cycles, topologies, etc. So, the industry is expecting a new, versatile, and highly updated sizing technique for modern software. Modern Metrics (MM) is a new anticipated size estimation technique for present software systems with updated functional values and metrics using Function Point (FP). This article analyzed the functional unit metric values (effort modifiers) of the MM with real world applications. MM is a novel method for determining the solution to the SPM challenges.","PeriodicalId":46563,"journal":{"name":"JOURNAL OF DISCRETE MATHEMATICAL SCIENCES & CRYPTOGRAPHY","volume":null,"pages":null},"PeriodicalIF":1.4,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"70464852","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}
The aim of this paper is to introduce the terms fuzzy RG-subalgebra of RG -algebra, provide a few important examples, and look at a few aspects in this paper. The image and pre-image of fuzzy RG-subalgebra of RG-algebra are presented, as well as an introduction to the concept of fuzzy RG-ideal of RG-algebra, and several properties and theorems are proved.
{"title":"Fuzzy RG-ideals of RG-algebra","authors":"A. Hameed, Show Mohammed Abraham, A. Abed","doi":"10.47974/jdmsc-1552","DOIUrl":"https://doi.org/10.47974/jdmsc-1552","url":null,"abstract":"The aim of this paper is to introduce the terms fuzzy RG-subalgebra of RG -algebra, provide a few important examples, and look at a few aspects in this paper. The image and pre-image of fuzzy RG-subalgebra of RG-algebra are presented, as well as an introduction to the concept of fuzzy RG-ideal of RG-algebra, and several properties and theorems are proved.","PeriodicalId":46563,"journal":{"name":"JOURNAL OF DISCRETE MATHEMATICAL SCIENCES & CRYPTOGRAPHY","volume":null,"pages":null},"PeriodicalIF":1.4,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"70465007","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}
Hader Baqer Shelash, Hasanain Hamid Ahmad, Ahmed J. Obaid
The finite group M is an H-group if every subgroup in M is an M-subgroup, and we say M is a j-group if every subgroup in M is a j-subgroup. In this study, we look at some of the characteristics of some dihedral group subgroups. As a result, we have student relationships between several subgroups, the quantity demand and investment in research and development, while the other model focuses on a more realistic relationship between the quantity demand and the price.
{"title":"On characterizations some of subgroups of the dihedral group D2n","authors":"Hader Baqer Shelash, Hasanain Hamid Ahmad, Ahmed J. Obaid","doi":"10.47974/jdmsc-1553","DOIUrl":"https://doi.org/10.47974/jdmsc-1553","url":null,"abstract":"The finite group M is an H-group if every subgroup in M is an M-subgroup, and we say M is a j-group if every subgroup in M is a j-subgroup. In this study, we look at some of the characteristics of some dihedral group subgroups. As a result, we have student relationships between several subgroups, the quantity demand and investment in research and development, while the other model focuses on a more realistic relationship between the quantity demand and the price.","PeriodicalId":46563,"journal":{"name":"JOURNAL OF DISCRETE MATHEMATICAL SCIENCES & CRYPTOGRAPHY","volume":null,"pages":null},"PeriodicalIF":1.4,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"70465104","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}
In this research, one of the non-classical sets, the permutation set, is utilized to analyze a new class of topological groups induced by β-sets, it is named permutation topological groups, and investigates some of its basic features. In addition, several results are applied to our permutation topological group class.
{"title":"On permutation topological groups with their basic properties","authors":"Abu Firas Muhammad Jawad Al Musawi, E. Suleiman","doi":"10.47974/jdmsc-1551","DOIUrl":"https://doi.org/10.47974/jdmsc-1551","url":null,"abstract":"In this research, one of the non-classical sets, the permutation set, is utilized to analyze a new class of topological groups induced by β-sets, it is named permutation topological groups, and investigates some of its basic features. In addition, several results are applied to our permutation topological group class.","PeriodicalId":46563,"journal":{"name":"JOURNAL OF DISCRETE MATHEMATICAL SCIENCES & CRYPTOGRAPHY","volume":null,"pages":null},"PeriodicalIF":1.4,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"70464964","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}
Apps, networks, frameworks, and services are all made possible by the cloud. In order to get the most out of the improved accessibility and computational capabilities, the Service Providers can offer an optimal use of current services. Application services have been revolutionised as their launch since they are useful and cost-effective for both suppliers and users. Increasingly, cyber defence is a vital research area in today’s environment, where networks are essential. The software and hardware of a network are constantly monitored by an intrusion detection framework (IDF), which is an essential part of any cyber defence plan. Many of the current IDSs are still struggling to improve detection performance, reduce false alarm rates and detect new threats. Based on parametric computation analysis, this study provides a deep learning approach to optimize cloud networks and to identify intruders. Results of suggested approach have been displayed from data compared to current methods in the conclusion section.
{"title":"Optimized deep learning methodology for intruder behavior detection and classification in cloud","authors":"","doi":"10.47974/jdmsc-1516","DOIUrl":"https://doi.org/10.47974/jdmsc-1516","url":null,"abstract":"Apps, networks, frameworks, and services are all made possible by the cloud. In order to get the most out of the improved accessibility and computational capabilities, the Service Providers can offer an optimal use of current services. Application services have been revolutionised as their launch since they are useful and cost-effective for both suppliers and users. Increasingly, cyber defence is a vital research area in today’s environment, where networks are essential. The software and hardware of a network are constantly monitored by an intrusion detection framework (IDF), which is an essential part of any cyber defence plan. Many of the current IDSs are still struggling to improve detection performance, reduce false alarm rates and detect new threats. Based on parametric computation analysis, this study provides a deep learning approach to optimize cloud networks and to identify intruders. Results of suggested approach have been displayed from data compared to current methods in the conclusion section.","PeriodicalId":46563,"journal":{"name":"JOURNAL OF DISCRETE MATHEMATICAL SCIENCES & CRYPTOGRAPHY","volume":null,"pages":null},"PeriodicalIF":1.4,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"70464882","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}
Manal Ali Sagban, Ali Abd Alhussein Zyarah, A. H. Hussain
In this paper, we introduce a new generalization of prime F.S.M (P.F.S), called I- prime F.S.M and I be any ideal of a commutative ring R also, we study some properties of it and giving some characterizations of I-P.F.S. We establish the situation of I-P.F.Ss in F.M of the R-module and, we show that I-P.F.S and P.F.S are coincident under certain conditions.
本文引入了素数F.S.M的一种新的推广(P.F.S)，称为I-素数F.S.M, I是交换环R的任意理想，研究了它的一些性质，给出了I-P.F.S的一些刻画。我们建立i - p - f的情况。s在r模的F.M中，我们证明了I-P.F。S和P.F.S在一定条件下是一致的。
{"title":"I-prime fuzzy submodules","authors":"Manal Ali Sagban, Ali Abd Alhussein Zyarah, A. H. Hussain","doi":"10.47974/jdmsc-1563","DOIUrl":"https://doi.org/10.47974/jdmsc-1563","url":null,"abstract":"In this paper, we introduce a new generalization of prime F.S.M (P.F.S), called I- prime F.S.M and I be any ideal of a commutative ring R also, we study some properties of it and giving some characterizations of I-P.F.S. We establish the situation of I-P.F.Ss in F.M of the R-module and, we show that I-P.F.S and P.F.S are coincident under certain conditions.","PeriodicalId":46563,"journal":{"name":"JOURNAL OF DISCRETE MATHEMATICAL SCIENCES & CRYPTOGRAPHY","volume":null,"pages":null},"PeriodicalIF":1.4,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"70464910","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}
Dakhole Dipali, Thiruselvan Subramanian, G. Kumaran
Oyster mushroom cultivation is an eco-friendly, profitable agribusiness because of its nutritious and medicinal value but it is labor-intensive, and it grows in a sensitive environment. It must use an autonomous environment control system to optimize and offer the necessary growing conditions. To optimize the temperature and humidity and consequently maximize mushroom production, a smart mushroom watering, monitoring, and controlling system using fuzzy logic controllers (FLC) have been developed. This study suggests installing an Internet of Things (IoT) node that uses DHT22 sensors, an ESP32 board, and relays to control actuators (sprinkler, cooling fan, humidifier, and heater) in a smart oyster mushroom house. The controller on sensing current temperature and humidity values using the fuzzy logic technique switches on/off the actuators automatically. The data collected at each IoT node is collected and visualized on the ThingSpeak platform. The computed response time for actuators using FLC is compared with that calculated using a simple ON-OFF method. The findings demonstrate that response time calculation using fuzzy logic is significantly accurate and faster than a simple ON-OFF approach. Additionally, the graphs created in live on ThingSpeak, demonstrate that the FLC algorithm is more robust and effective than the simple ON-OFF algorithm.
{"title":"A smart oyster mushroom cultivation using automatic fuzzy logic controller","authors":"Dakhole Dipali, Thiruselvan Subramanian, G. Kumaran","doi":"10.47974/jdmsc-1731","DOIUrl":"https://doi.org/10.47974/jdmsc-1731","url":null,"abstract":"Oyster mushroom cultivation is an eco-friendly, profitable agribusiness because of its nutritious and medicinal value but it is labor-intensive, and it grows in a sensitive environment. It must use an autonomous environment control system to optimize and offer the necessary growing conditions. To optimize the temperature and humidity and consequently maximize mushroom production, a smart mushroom watering, monitoring, and controlling system using fuzzy logic controllers (FLC) have been developed. This study suggests installing an Internet of Things (IoT) node that uses DHT22 sensors, an ESP32 board, and relays to control actuators (sprinkler, cooling fan, humidifier, and heater) in a smart oyster mushroom house. The controller on sensing current temperature and humidity values using the fuzzy logic technique switches on/off the actuators automatically. The data collected at each IoT node is collected and visualized on the ThingSpeak platform. The computed response time for actuators using FLC is compared with that calculated using a simple ON-OFF method. The findings demonstrate that response time calculation using fuzzy logic is significantly accurate and faster than a simple ON-OFF approach. Additionally, the graphs created in live on ThingSpeak, demonstrate that the FLC algorithm is more robust and effective than the simple ON-OFF algorithm.","PeriodicalId":46563,"journal":{"name":"JOURNAL OF DISCRETE MATHEMATICAL SCIENCES & CRYPTOGRAPHY","volume":null,"pages":null},"PeriodicalIF":1.4,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"70465077","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}
Assume that G is a finite group and X = tG where t is non-identity element with t3 = 1. The simple graph with node set being X such that a, b ∈ X, are adjacent if ab-1 is an involution element, is called the A4-graph, and designated by A4(G, X). In this article, the construction of A4(G, X) is analyzed for G is the twisted group of Lie type 3D4(3).
{"title":"A4-graph for the twisted group 3D4 (3)","authors":"Salwa Mohammed Hamid, A. Aubad","doi":"10.47974/jdmsc-1562","DOIUrl":"https://doi.org/10.47974/jdmsc-1562","url":null,"abstract":"Assume that G is a finite group and X = tG where t is non-identity element with t3 = 1. The simple graph with node set being X such that a, b ∈ X, are adjacent if ab-1 is an involution element, is called the A4-graph, and designated by A4(G, X). In this article, the construction of A4(G, X) is analyzed for G is the twisted group of Lie type 3D4(3).","PeriodicalId":46563,"journal":{"name":"JOURNAL OF DISCRETE MATHEMATICAL SCIENCES & CRYPTOGRAPHY","volume":null,"pages":null},"PeriodicalIF":1.4,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"70464694","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-11-17DOI: 10.1080/09720529.2022.2059921
D. Savin
Abstract In this paper, we obtain a certain class of diagonalizable matrices, starting from a certain difference equation of degree 3, which is related to Pell’s numbers.
摘要本文从一个与Pell数有关的3阶差分方程出发，得到了一类可对角化矩阵。
{"title":"Some diagonalizable matrices, connected with difference equations of degree 3","authors":"D. Savin","doi":"10.1080/09720529.2022.2059921","DOIUrl":"https://doi.org/10.1080/09720529.2022.2059921","url":null,"abstract":"Abstract In this paper, we obtain a certain class of diagonalizable matrices, starting from a certain difference equation of degree 3, which is related to Pell’s numbers.","PeriodicalId":46563,"journal":{"name":"JOURNAL OF DISCRETE MATHEMATICAL SCIENCES & CRYPTOGRAPHY","volume":null,"pages":null},"PeriodicalIF":1.4,"publicationDate":"2022-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"49251551","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
扫码关注我们
求助内容：
应助结果提醒方式：