{"title":"Randamization Technique for Desiging of Substitution Box in Data Encryption Standard Algorithm","authors":"S. Nilima, Alind Alind, N. Arora","doi":"10.5815/ijmsc.2019.03.03","DOIUrl":"https://doi.org/10.5815/ijmsc.2019.03.03","url":null,"abstract":"A new approach for the generation of randomized substitution box (S-box) based on the concept of a redesign of S-box with fewer numbers of input bits processed at a time as compared to existing S-box in Data Encryption Standard (DES) Algorithm. The results of experimentation prove that proposed randomized approach also generate promising results, which can be particularly useful for devices with less processing power. Proposed approach retains the diffusion and confusion property of a good cryptosystem algorithm.","PeriodicalId":312036,"journal":{"name":"International Journal of Mathematical Sciences and Computing","volume":"79 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-07-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116476950","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":"Signature-Based Malware Detection Using Approximate Boyer Moore String Matching Algorithm","authors":"A. Ojugo, A. Eboka","doi":"10.5815/ijmsc.2019.03.05","DOIUrl":"https://doi.org/10.5815/ijmsc.2019.03.05","url":null,"abstract":"Adversaries to any system restlessly continues to sought effective, non-detectable means to aid them successful penetrate secure systems, either for fun or commercial gains. They achieve these feats easily through the use of malware, which keeps on the rise, an ever-growing and corresponding overpopulated malware zoo. As such, information technology industry will continue to encounter via these escapades, both monetary and prestigious losses. Malware by design aims to alter the behaviour of its host by self-replicating its genome or codes unto it. They are quite fascinating in that on execution, some malware change their own structure so that its copies have same functionality but differ in signature and syntax from the original or parent virus. This makes signature detection quite unreliable. Study investigates detection of metamorphic malware attacks using the Boyer Moore algorithm for string-based signature detection scheme.","PeriodicalId":312036,"journal":{"name":"International Journal of Mathematical Sciences and Computing","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-07-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125981163","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":"Study of Memory Effect in an Inventory Model with Linear Demand and Shortage","authors":"Rituparna Pakhira, U. Ghosh, S. Sarkar","doi":"10.5815/IJMSC.2019.02.05","DOIUrl":"https://doi.org/10.5815/IJMSC.2019.02.05","url":null,"abstract":"For real market studies of any business, inclusion of memory or past experience in inventory model has great impact. Memory means it depends on the past state of the process not only current state of the process. Indeed, the inventory system is an appropriate example as a memory affected system. Presence of long past experiences or short past experiences of any company or shop has different importance on increasing or decreasing profit. The description of the memory dependent inventory model is more appropriate process compared to the memory less inventory model. Depending on demand rate, a comparison between the minimized total average costs of different numerical example has been presented. Fractional order derivative and integration have been used to establish the model. Our considered numerical example establishes that if linear type demand rate is only time proportional, profit of the business is high compared to the linear type demand rate.","PeriodicalId":312036,"journal":{"name":"International Journal of Mathematical Sciences and Computing","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-04-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128754663","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":"Edge Stable Sets and Secured Edge Stable Sets in Hypergraphs","authors":"D. Thakkar, V. Dave","doi":"10.5815/IJMSC.2019.02.6","DOIUrl":"https://doi.org/10.5815/IJMSC.2019.02.6","url":null,"abstract":"In this paper, we have proved several results regarding edge stable sets and maximal edge stable sets in hypergraphs. We have also proved various results regarding edge stable sets and maximal edge stable sets in partial subhypergraphs. We have introduced the concept of secured edge stable set, maximum secured edge stable set and is 1 Set in this paper and proved several results about them.","PeriodicalId":312036,"journal":{"name":"International Journal of Mathematical Sciences and Computing","volume":"80 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-04-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117028100","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 Analysis of Personnel Distributions in the Local Government Service in Ekiti-State, Nigeria, for Service Delivery","authors":"Olaniyan Joseph Olawale, Ademuyiwa A. Justus","doi":"10.5815/IJMSC.2019.02.04","DOIUrl":"https://doi.org/10.5815/IJMSC.2019.02.04","url":null,"abstract":"It’s is no longer news that the Local Government (Third-tier of government in Nigeria) has not been able to optimally discharge its responsibilities according to its mandate. This had raised serious policy and research concerns that resulted to several reformative approaches in a bid to restructuring the system for efficient service delivery in the past decade. One major unpopular reason for inefficient service delivery was poor administration in the Local Government as a result of unbalanced distribution of personnel by cadre and gender in each local government in the state. This had not only hampered local government administration but also impeded adequate provision of expected services to local populace in line with its mandate as enshrined in the fourth schedule of the 1999 Constitution of the Federal Republic of Nigeria. Application of Statistical analysis using Chi-square Test of Independence showed that distribution of employees by cadre depends on local government in post in the year under study. Percentage distributions employed revealed that some local governments that are located around the capital city had more workers than those located outside the state capital city except some local governments with more viable socio-economic benefits. Sex ratio showed that there was gender imbalance as female personnel are more than their male counterpart in the local government service is.","PeriodicalId":312036,"journal":{"name":"International Journal of Mathematical Sciences and Computing","volume":"5 2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-04-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124446255","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":"Stability Analysis of Equilibrium Points of Newcastle Disease Model of Village Chicken in the Presence of Wild Birds Reservoir","authors":"F. Chuma, G. G. Mwanga","doi":"10.5815/IJMSC.2019.02.01","DOIUrl":"https://doi.org/10.5815/IJMSC.2019.02.01","url":null,"abstract":"Newcastle is a viral disease of chicken and other avian species. In this paper, the stability analysis of the disease free and endemic equilibrium points of the Newcastle disease model of the village chicken in the absence of any control are studied. The Hurwitz matrix criterion is applied to study the stability of the Newcastle disease free equilibrium point, . 0 Q The result shows that the disease free equilibrium point is locally asymptotically stable iff the principle leading minors of the Hurwitz Matrix, n G (for nR ) are all positive. Using the Castillo Chavez Theorem we showed that, the disease free equilibrium point is globally asymptotically when . 1 0 R Furthermore, using the logarithmic function and the LaSalle’s Theorem, the endemic equilibrium point is found globally asymptotically stable for . 1 0 R Finally the numerical simulations confirm the existence and stability of the equilibrium points of the model. This reveals that, proper interventions are needed so as to decrease the frequently occurrence of the Newcastle disease in the village chicken population.","PeriodicalId":312036,"journal":{"name":"International Journal of Mathematical Sciences and Computing","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-04-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130694759","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":"Sorting using a combination of Bubble Sort, Selection Sort & Counting Sort","authors":"Sahil Kumar, Prerna Singla","doi":"10.5815/IJMSC.2019.02.03","DOIUrl":"https://doi.org/10.5815/IJMSC.2019.02.03","url":null,"abstract":"One of the most important problems in computer science is the ordering of the data. Although sorting is a very old computer science problem, it still attracts a great deal of research. Usually, when we face a problem, we’re concerned with finding the solution, then getting it out of our heads and into a text editor, white-board, or down on a piece of paper. Eventually, we start transforming that idea into code, and the code is pretty terrible the first time around. But at some point, once we’ve made it work and made it right, we find ourselves asking: Can I make it fast? Can I make it better? This paper presents an enhanced sorting algorithm which comprises of a combination of Bubble Sort, Selection Sort, and Counting Sort. The new algorithm is analyzed, implemented, tested, compared and the results were promising.","PeriodicalId":312036,"journal":{"name":"International Journal of Mathematical Sciences and Computing","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-04-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115286179","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}
S. A. Chowdhury, Tanbirul Hashan, A. A. Rahman, A. Saif
{"title":"Category Specific Prediction Modules for Visual Relation Recognition","authors":"S. A. Chowdhury, Tanbirul Hashan, A. A. Rahman, A. Saif","doi":"10.5815/IJMSC.2019.02.02","DOIUrl":"https://doi.org/10.5815/IJMSC.2019.02.02","url":null,"abstract":"Object classification in an image does not provide a complete understanding of the information contained in it. Visual relation information such as “person playing with dog” provides substantially more understanding than just “person, dog”. The visual inter-relations of the objects can provide substantial insight for truly understanding the complete picture. Due to the complex nature of such combinations, conventional computer vision techniques have not been able to show significant promise. Monolithic approaches are lacking in precision and accuracy due to the vastness of possible relation combinations. Solving this problem is crucial to development of advanced computer vision applications that impact every sector of the modern world. We propose a model using recent advances in novel applications of Convolution Neural Networks (Deep Learning) combined with a divide and conquer approach to relation detection. The possible relations are broken down to categories such as spatial (left, right), vehicle-related (riding, driving), etc. Then the task is divided to segmenting the objects, estimating possible relationship category and performing recognition on modules specially built for that relation category. The training process can be done for each module on significantly smaller datasets with less computation required. Additionally this approach provides recall rates that are comparable to state of the art research, while still being precise and accurate for the specific relation categories.","PeriodicalId":312036,"journal":{"name":"International Journal of Mathematical Sciences and Computing","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-04-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123905185","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 the Design of a Finite Automaton that accepts Class of IPV4 Addresses","authors":"P. Chandra, K. Sravan, M. Chakravarthy","doi":"10.5815/IJMSC.2019.01.06","DOIUrl":"https://doi.org/10.5815/IJMSC.2019.01.06","url":null,"abstract":"","PeriodicalId":312036,"journal":{"name":"International Journal of Mathematical Sciences and Computing","volume":"84 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-01-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126213621","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}
Vishal Kumar, A. Laghari, Shahid Karim, M. Shakir, Ali Anwar Brohi
{"title":"Comparison of Fog Computing & Cloud Computing","authors":"Vishal Kumar, A. Laghari, Shahid Karim, M. Shakir, Ali Anwar Brohi","doi":"10.5815/IJMSC.2019.01.03","DOIUrl":"https://doi.org/10.5815/IJMSC.2019.01.03","url":null,"abstract":"Fog computing is extending cloud computing by transferring computation on the edge of networks such as mobile collaborative devices or fixed nodes with built-in data storage, computing, and communication devices. Fog gives focal points of enhanced proficiency, better security, organize data transfer capacity sparing and versatility. With a specific end goal to give imperative subtle elements of Fog registering, we propose attributes of this region and separate from cloud computing research. Cloud computing is developing innovation which gives figuring assets to a specific assignment on pay per utilize. Cloud computing gives benefit three unique models and the cloud gives shoddy; midway oversaw assets for dependable registering for performing required errands. This paper gives correlation and attributes both Fog and cloud computing differs by outline, arrangement, administrations and devices for associations and clients. This comparison shows that Fog provides more flexible infrastructure and better service of data processing by consuming low network bandwidth instead of shifting whole data to the cloud.","PeriodicalId":312036,"journal":{"name":"International Journal of Mathematical Sciences and Computing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-01-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131099919","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}