Journal of Advances in Mathematics and Computer Science 2020-08-11T10:23:55+00:00 Journal of Advances in Mathematics and Computer Science Open Journal Systems <p style="text-align: justify;"><strong>Journal of Advances in Mathematics and Computer Science (ISSN:&nbsp;2456-9968) </strong>aims to publish original research articles, review articles and short communications, in all areas of mathematics and computer science. Subject matters cover pure and applied mathematics, mathematical foundations, statistics and game theory, use of mathematics in natural science, engineering, medicine, and the social sciences, theoretical computer science, algorithms and data structures, computer elements and system architecture, programming languages and compilers, concurrent, parallel and distributed systems, telecommunication and networking, software engineering, computer graphics, scientific computing, database management, computational science, artificial Intelligence, human-computer interactions, etc. This is a quality controlled, OPEN peer reviewed, open access INTERNATIONAL journal.</p> A Comparative Study of Solving Methods of Transportation Problem in Linear Programming Problem 2020-08-11T10:23:53+00:00 Farzana Sultana Rafi Safiqul Islam <p>The paper is related with the basic transportation problem (TP)which is one kind of linear programming problem (LPP). There are some existing methods for solving transportation problem and in this paper all the standard existing methods has been discussed to understand which one is the best method among them. Among all of existing methods, the Vogel’s Approximation Method (VAM) is considered the best method which gives the better optimal result then other methods and North-West Corner Rule is considered as simplest but gives worst result. A C programming code for Vogel’s Approximation Method have been added in the appendix.</p> 2020-07-30T00:00:00+00:00 ##submission.copyrightStatement## On A Class of Idealized Near-Rings Admitting Frobenius Derivations 2020-08-11T10:23:55+00:00 Ojiema M. Onyango Onyango B. Achieng Abuga J. Motanya <p>In this paper, we use the idealization procedure for finite rings to construct a class of quasi-3 prime Near-Rings N with a Jordan ideal J(N) and admitting a Frobenius derivation. The structural characterization of N; J(N) and commutation of N via the Frobenius derivations have been explicitly determined.</p> 2020-07-15T00:00:00+00:00 ##submission.copyrightStatement## Mean Square Asymptotic Boundedness of Stochastic Complex Networks via Impulsive Control 2020-08-11T10:23:54+00:00 Xiaoyi Zhu Danhua He <p>In this paper, the mean square asymptotic boundedness of a class of stochastic complex systems with different dynamic nodes represented by Ito stochastic differential equations is studied.&nbsp; By using the Lyapunov function and Ito formula, the mean square asymptotic boundedness and mean square asymptotic stability conditions of stochastic complex systems with different dynamic nodes are obtained.</p> 2020-07-17T00:00:00+00:00 ##submission.copyrightStatement## Improved Model for Facial Expression Classification for Fear and Sadness Using Local Binary Pattern Histogram 2020-08-11T10:23:54+00:00 Adebola K. Ojo Temitope Ololade Idowu <p>In this study, a Local Binary Pattern Histogram model was proposed for Facial expression classification for fear and sadness. There have been a number of supervised machine models developed and used for facial recognition in past researches. The classifier requires human effort to perform feature extraction which has led to unknown changes in the expression of human face and incomplete feature extraction and low accuracy. This study proposed a model for improving the accuracies for fear and sadness and to extract features to distinguish between fear and sadness. Images of different people of varying ages were extracted from two datasets got from Japanese female facial expression (jaffe) dataset and Cohn cade got from Kaggle. In other to achieve an incremental development, classification was done using Linear Support Vector Machine (LSVM) and Random Forest Classifier (RFC). The accuracy rates for the LSVM models, LSVM1 and LSVM2 were 88% and 87% respectively while the RFC models, RFC1 and RFC2, were 81% and 82% respectively.</p> 2020-07-24T00:00:00+00:00 ##submission.copyrightStatement## Combined PCA-Daugman Method : An Effcient Technique for Face and Iris Recognition 2020-08-11T10:23:54+00:00 Md. Mahbubul Alam Md. Ashikur Rahman Khan Zayed Us Salehin Main Uddin Sultana Jahan Soheli Tanvir Zaman Khan <p>Face and iris are very common individual bio-metric features for person identification. Face recognition is the method of identification a person uniquely using face. Principal component analysis is one of the algorithms for face recognition. Iris recognition in another method of person identification using iris. Very popular iris recognition method is Daugman algorithm. Unimodal biometric system has various difficulties to detect a person like noisy and unusual data. Multimodal biometric system combined more than one individual modalities like face and iris to increase the efficiency. In this work, we combined principal component analysis and Daugman algorithm with ORL, YALE, CASIA and Real face dataset to combine face and iris recognition to improve the recognition efficiency.</p> 2020-07-27T00:00:00+00:00 ##submission.copyrightStatement## Experimental and Mathematical Model for the Antimalarial Activity of Methanolic Root Extract of Azadirachta indica (Dongoyaro) in Mice Infected with Plasmodium berghei NK65 2020-08-11T10:23:52+00:00 Adeniyi Michael Olaniyi Momoh Johnson Oshiobugie Aderele Oluwaseun Raphael <p>The study determines the experimental and mathematical model for the anti-plasmodial activity of methanolic root extract of <em>Azadirachta indica </em>in Swiss mice infected with <em>Plasmodium berghei NK65. </em>Phytochemical analyses, antimalarial activity of the methanolic root extract of <em>A. indica</em> was determined in mice infected with <em>Plasmodium berghei NK65</em> using standard procedure. Liver biomarker enzymes were also determined. The model <em>P. berghei</em> induced free and <em>P. berghei</em> infected equilibrium were determined. The stability of the model equilibrium points was rigorously analyzed. The phytochemicals present in the extract include: alkaloid, flavonoid, saponin and phenolic compounds etc. The experimental study consists of five groups of five mice each per group. Group A, B, C, D and E were healthy, infected without treatment, infected mice treated with fansidar (10 mg/kg), chloroquine (10 mg/kg) and 250 mg/kg body weight of <em>A. indica </em>methanolic root extract respectively. The extract showed anti-plasmodial activity of 73.96%. The result was significant when compared with group B mice, though it was lower than that exhibited by fansidar (88.91%) and chloroquine (92.18%) for suppressive test. There were significant decrease (P&lt;0.05) in plasma AST and ALT levels in the treated infected mice compared to the infected untreated mice. The results of the model showed that the <em>P.berghei</em> induced free equilibrium is locally and globally asymptotically stable at threshold parameter, &nbsp;less than unity and unstable when &nbsp;is greater than unity. Numerical simulations were carried out to validate the analytic results which are in agreement with the experimental analysis of this work.</p> 2020-08-03T00:00:00+00:00 ##submission.copyrightStatement## A Modified Ant Colony Optimization Algorithm for Solving a Transportation Problem 2020-08-10T10:44:21+00:00 E. M. U. S. B. Ekanayake S. P. C. Perera W. B. Daundasekara Z. A. M. S. Juman <p>Transportation of products from sources to destinations with minimal total cost plays a key role in logistics and supply chain management. The transportation problem (TP) is an extraordinary sort of Linear Programming problem where the objective is to minimize the total cost of disseminating resources from several various sources to several destinations. Initial feasible solution (IFS) acts as a foundation of an optimal cost solution technique to any TP. Better is the IFS lesser is the number of iterations to reach the final optimal solution. This paper presents a meta-heuristic algorithm, modified ant colony optimization algorithm (MACOA) to attain an IFS to a Transportation Problem. The proposed algorithm is straightforward, simple to execute, and gives us closeness optimal solutions in a finite number of iterations. The efficiency of this algorithm is likewise been advocated by solving validity and applicability examples An extensive numerical study is carried out to see the potential significance of our modified ant colony optimization algorithm (MACOA). The comparative assessment shows that both the MACOA and the existing JHM are efficient as compared to the studied approaches of this paper in terms of the quality of the solution. However, in practice, when researchers and practitioners deal with large-sized transportation problems, we urge them to use our proposed MACOA due to the time-consuming computation of JHM. Therefore this finding is important in saving time and resources for minimization of transportation costs and optimizing transportation processes which could help significantly to improve the organization’s position in the market.</p> 2020-08-10T00:00:00+00:00 ##submission.copyrightStatement## Simulation Study of H1N1 Transmission through Immigrants and Vaccination 2020-08-10T10:51:48+00:00 Nita H. Shah Nehal Shukla Foram Thakkar Moksha Satia <p>H1N1 influenza, is a disease caused by the Type A strain of negative-sense single stranded RNA virus which has unique characteristics of reassortment making it different and difficult to control. Due to the unique nature of the virus, the constant globalization of the international population, and the lack of effective immunization, this virus is a great threat to public health. There is only limited data available on impacts of immigrants on H1N1 transmission. So, there is real need to study impacts of immigrants on H1N1 transmission as well as vaccination. We have studied a mathematical model for simulation study of H1N1 transmission through immigrants and vaccination. The class of susceptible people is divided in two types: vaccinated immigrants and non-vaccinated immigrants. The medications and hospitalizations are the remedial steps to get cured. The rate at which people get medicated or hospitalized is analyzed using SEIR model. The system of non-linear ordinary differential equation is formulated for the given model and the reproduction number is then calculated using next generation matrix method which indicates the recovery rate of an individual stability. Numerical simulations are then carried out. Our study showed that increasing the awareness among the general population, immigrants about clinical features and modes of transmission of H1N1 and improving the vaccination rate helps decrease the transmission of H1N1.</p> 2020-08-10T00:00:00+00:00 ##submission.copyrightStatement##