International Journal of Mathematical Sciences and Computing最新文献

{"title":"Non-singular Transformation Based Encryption Scheme","authors":"S. Sushanth Kumar, India Drdo, Sandeep Kumar, Gaurav Mittal, Dharminder Dharminder, Shiv Narain","doi":"10.5815/ijmsc.2021.03.04","DOIUrl":"https://doi.org/10.5815/ijmsc.2021.03.04","url":null,"abstract":": In this paper, we propose a novel variant of the Hill cipher based on vector spaces. In the classical Hill cipher, a non-singular matrix is used for encryption but it is well known that this cipher is vulnerable to the known-plaintext attack. In our proposed cryptosystem, we eradicate this problem by encrypting each plaintext block with a new invertible key matrix. This makes our scheme immune to all existing attacks in literature on this type of ciphers and so the resulting cipher can be used as other state-of-art block cipher. To generate the invertible matrices which serve as the dynamic keys, we make use of the vector spaces along with randomly generated basis and non-singular linear transformation. In addition to this, we also study the computational complexity of the proposed cryptosystem and compare this with the computational complexities of other schemes based on Hill cipher.","PeriodicalId":312036,"journal":{"name":"International Journal of Mathematical Sciences and Computing","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-08-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126456709","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":"Novel Quantum Random Number Generator with the Improved Certification Method","authors":"M. Iavich, Georgia Tbilisi, T. Kuchukhidze, G. Iashvili, S. Gnatyuk, R. Bocu","doi":"10.5815/ijmsc.2021.03.05","DOIUrl":"https://doi.org/10.5815/ijmsc.2021.03.05","url":null,"abstract":": Random numbers play an important role in many areas, for example, encryption, cryptography, static analysis, simulations. It is also a fundamental resource in science and engineering. There are algorithmically generated numbers that are similar to random distributions, but are not actually random, called pseudo random number generators. In many cases the tasks to be solved are based on the unpredictability of random numbers, which cannot be guaranteed in the case of pseudo random number generators, true randomness is required. In such situations, we use real random number generators whose source of randomness is unpredictable random events. Quantum Random Number Generators (QRNGs) generate real random numbers based on the inherent randomness of quantum measurements. Our goal is to generate fast random numbers at a lower cost. At the same time, a high level of randomness is essential. Through quantum mechanics, we can obtain true numbers using the unpredictable behavior of a photon, which is the basis of many modern cryptographic protocols. It is essential to trust cryptographic random number generators to generate only true random numbers. This is why certification methods are needed which will check both the operation of the device and the quality of the random bits generated. We present the improved novel quantum random number generator, which is based the on time of arrival QRNG. It uses the simple version of the detectors with few requirements. The novel QRNG produces more than one random bit per each photon detection. It is rather efficient and has a high level of randomness. Self-testing as well as device independent quantum random number generation methods are analyzed. The advantages and disadvantages of both methods are identified. The model of a novel semi self-testing certification method for quantum random number generators (QRNG) is offered in the paper. This method combines different types of certification approaches and is rather secure and efficient. Finally, the novel certification method is integrated into the model of the new quantum random number generator. The paper analyzes its security and efficiency. topics are: cryptography, mathematical simulations.","PeriodicalId":312036,"journal":{"name":"International Journal of Mathematical Sciences and Computing","volume":"438 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-08-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123198378","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":"Accuracy Analysis for the Solution of Initial Value Problem of ODEs Using Modified Euler Method","authors":"Mohammad Asif Arefin, Nazrul Islam, B. Gain, Mohammad Roknujjaman","doi":"10.5815/ijmsc.2021.02.04","DOIUrl":"https://doi.org/10.5815/ijmsc.2021.02.04","url":null,"abstract":"There exist numerous numerical methods for solving the initial value problems of ordinary differential equations. The accuracy level and computational time are not the same for all of these methods. In this article, the Modified Euler method has been discussed for solving and finding the accurate solution of Ordinary Differential Equations using different step sizes. Approximate Results obtained by different step sizes are shown using the result analysis table. Some problems are solved by the proposed method then approximated results are shown graphically compare to the exact solution for a better understanding of the accuracy level of this method. Errors are estimated for each step and are represented graphically using Matlab Programming Language and MS Excel, which reveals that so much small step size gives better accuracy with less computational error. It is observed that this method is suitable for obtaining the accurate solution of ODEs when the taken step sizes are too much small.","PeriodicalId":312036,"journal":{"name":"International Journal of Mathematical Sciences and Computing","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-06-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129279076","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":"Green Computing: An Era of Energy Saving Computing of Cloud Resources","authors":"S. Saxena, M. Zubair Khan, Ravendra Singh","doi":"10.5815/ijmsc.2021.02.05","DOIUrl":"https://doi.org/10.5815/ijmsc.2021.02.05","url":null,"abstract":": Cloud computing is a widely acceptable computing environment, and its services are also widely available. But the consumption of energy is one of the major issues of cloud computing as a green computing. Because many electronic resources like processing devices, storage devices in both client and server site and network computing devices like switches, routers are the main elements of energy consumption in cloud and during computation power are also required to cool the IT load in cloud computing. So due to the high consumption, cloud resources define the high energy cost during the service activities of cloud computing and contribute more carbon emissions to the atmosphere. These two issues inspired the cloud companies to develop such renewable cloud sustainability regulations to control the energy cost and the rate of CO 2 emission. The main purpose of this paper is to develop a green computing environment through saving the energy of cloud resources using the specific approach of identifying the requirement of computing resources during the computation of cloud services. Only required computing resources remain ON (working state), and the rest become OFF (sleep/hibernate state) to reduce the energy uses in the cloud data centers. This approach will be more efficient than other available approaches based on cloud service scheduling or migration and virtualization of services in the cloud network. It reduces the cloud data center's energy usages by applying a power management scheme (ON/OFF) on computing resources. The proposed approach helps to convert the cloud computing in green computing through identifying an appropriate number of cloud computing resources like processing nodes, servers, disks and switches/routers during any service computation on cloud to handle the energy-saving or environmental impact.","PeriodicalId":312036,"journal":{"name":"International Journal of Mathematical Sciences and Computing","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-06-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126526849","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 Based on Kernel Function Controlled Gaussian Process Regression Method for In-depth Extrapolative Analysis of Covid-19 Daily Cases Drift Rates","authors":"J. Isabona, Divine O. Ojuh","doi":"10.5815/ijmsc.2021.02.02","DOIUrl":"https://doi.org/10.5815/ijmsc.2021.02.02","url":null,"abstract":": Precise extrapolative mining and analysis of relevant dataset during or after any disease outbreak can assist the government, stake holders and relevant agencies in the health sector to make important decisions with respect to the disease outbreak control and management. While prior works has concentrated on non-stationary long term data, this work focuses on a short term non-stationary and relatively noisy data. Particularly, a distinctive nonparametric machine learning method based kernel-controlled probabilistic Gaussian process regression model has been proposed and employed to model and analyze Covid-19 pandemic data acquired over a period of approximately six weeks. To accomplish the aim, the MATLAB 2018a computational and machine learning environment was engaged to develop and perform the Gaussian process extrapolative analysis. The results displayed high scalability and optimal performance over the commonly used machine learning methods such as the Neural networks, Neural-Fuzzy networks, Random forest, Regression tree, Support Vector machines, K-nearest neighbor and Discriminant linear regression models. These results offer a solid foundation for conducting research on reliable prognostic estimations and analysis of contagious disease emergence intensity and spread.","PeriodicalId":312036,"journal":{"name":"International Journal of Mathematical Sciences and Computing","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-06-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121326122","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":"Stochastic Rules in Nucleotide Sequences in Genomes of Higher and Lower Organisms","authors":"S. Petoukhov, V. Svirin","doi":"10.5815/ijmsc.2021.02.01","DOIUrl":"https://doi.org/10.5815/ijmsc.2021.02.01","url":null,"abstract":"s : The article presents new stochastic rules of nucleotide sequences in single-stranded DNA of eukaryotic and prokaryotic genomes. These discovered rules are candidates for the role of universal genomic rules. To reveal such rules, the authors represent any of genomic sequences in single-stranded DNA as a set of n parallel texts (or layers), each of which is written based on one of the different n -plets alphabets ( n = 1, 2, 3, ...). Then comparison analysis of percentages of the 4 n kinds of n -plets in the n parallel texts in such sequence is fulfield. In the result, unexpected stochastic rules of invariance of total sums of percentages for certain tetra-groupings of n -plets in different parallel texts of genomic DNA sequences are revealed.The presented rules significantly expand modern knowledge about stochastic regularities in long single-stranded DNA sequences, and they can be considered as generalizations of the second Chargaff's rule. A tensor family of matrix representations of interrelated DNA-alphabets of 4 nucleotides, 16 doublets, 64 triplets, and 256 tetraplets is used in the study. Some analogies of the discovered genetic phenomena with phenomena of Gestalt psychology are noted. The authors connect the received results about the genomic percentages rules with a supposition of P. Jordan, who is one of the creators of quantum mechanics and quantum biology, that life's missing laws are the rules of chance and probability of the quantum world.","PeriodicalId":312036,"journal":{"name":"International Journal of Mathematical Sciences and Computing","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-06-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126505507","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 Verifiable Ring Signature Scheme of Anonymous Signcryption Using ECC","authors":"Pratik Gupta, Manoj Kumar","doi":"10.5815/ijmsc.2021.02.03","DOIUrl":"https://doi.org/10.5815/ijmsc.2021.02.03","url":null,"abstract":": The ring signature does hide the member of actually signature in the all possible signer. This technique was introduced by Rivest, Tauman and Shamir in 2001. This paper presents elliptic curve cryptosystem using signcryption algorithm with the anonymity feature. In the present paper, combines ring signature scheme with signcryption method to produce the anonymity feature for the signcryption scheme and discuss the characteristic of the security. Because elliptic curve cryptosystem yields like as small bandwidth requirements, low computation load, and high security and methodology of ring signature gives without revealing the actual signer to all possible signers. Combining the benefits of these two methodology, the result is an efficient anonymous signcryption algorithm and highly secure.","PeriodicalId":312036,"journal":{"name":"International Journal of Mathematical Sciences and Computing","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-06-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127971355","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":"Concepts of Bezier Polynomials and its Application in Odd Higher Order Non-linear Boundary Value Problems by Galerkin WRM","authors":"Nazrul Islam","doi":"10.5815/IJMSC.2021.01.02","DOIUrl":"https://doi.org/10.5815/IJMSC.2021.01.02","url":null,"abstract":": Many different methods are applied and used in an attempt to solve higher order nonlinear boundary value problems (BVPs). Galerkin weighted residual method (GWRM) are widely used to solve BVPs. The main aim of this paper is to find the approximate solutions of fifth, seventh and ninth order nonlinear boundary value problems using GWRM. A trial function namely, Bezier Polynomials is assumed which is made to satisfy the given essential boundary conditions. Investigate the effectiveness of the current method; some numerical examples were considered. The results are depicted both graphically and numerically. The numerical solutions are in good agreement with the exact result and get a higher accuracy in the solutions. The present method is quit efficient and yields better results when compared with the existing methods. All problems are performed using the software MATLAB R2017a.","PeriodicalId":312036,"journal":{"name":"International Journal of Mathematical Sciences and Computing","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-02-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128815886","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 System to Predict Emotion from Bengali Speech","authors":"Prashengit Dhar, Sunanda Guha","doi":"10.5815/IJMSC.2021.01.04","DOIUrl":"https://doi.org/10.5815/IJMSC.2021.01.04","url":null,"abstract":": Predicting human emotion from speech is now important research topic. One’s mental state can be understood by emotion. The proposed research work is emotion recognition from human speech. Proposed system plays significant role in recognizing emotion while someone is talking. It has a great use for smart home environment. One can understand the emotion of other who is in home or may be in other place. University, service center or hospital can get a valuable decision support system with this emotion prediction system. Features like-MFCC (Mel-Frequency Cepstral Coefficients) and LPC are extracted from audio sample signal. Audios are collected by recording speeches. A test also applied by combining self-collected dataset and popular Ravdees dataset. Self-collected dataset is named as ABEG. MFCC and LPC features are used in this study to train and test for predicting emotion. This study is made on angry, happy and neutral emotion classes. Different machine learning algorithms are applied here and result is compared with each other. Logistic regression performs well as compared to other ML algorithm.","PeriodicalId":312036,"journal":{"name":"International Journal of Mathematical Sciences and Computing","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-02-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133465445","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":"Labeling a kind of Cubic Graphs by Subgraph Embedding Method","authors":"Yujie Bai","doi":"10.5815/IJMSC.2021.01.01","DOIUrl":"https://doi.org/10.5815/IJMSC.2021.01.01","url":null,"abstract":"Based on a problem raised by Gao et. al. (Bull. Malays. Math. Sci. Soc., 41 (2018) 443–453.), we construct a family of cubic graphs which are double-edge blow-up of ladder graphs. We determine the full friendly index sets of these cubic graphs by embedding labeling graph method. At the same time, the corresponding labeling graphs are provided.","PeriodicalId":312036,"journal":{"name":"International Journal of Mathematical Sciences and Computing","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-02-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131256476","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}