Статьи журнала - International Journal of Mathematical Sciences and Computing
Все статьи: 198
A Proposed Linear Programming Based Algorithm to Solve Arc Routing Problems
Статья научная
A new linear programming-based algorithm has been demonstrated to find the best way for arc routing. In most arc routing problems, the main goal is to minimize the total cost on the lane. To find the minimum cost giving lane, the existing algorithms find the smallest possible sum of weights by ticking the shortest paths [7-12]. The proposed computer-based algorithm is based on focusing the minimized total cost with some constraint criteria of fixed values. The routes are marked with a series of variables that may differ according to the lane choice and more accurately estimates the exact total cost considering the remaining weight. Finally, a stochastic model for a private company vehicle transport has been discussed with some possible solution expectations.
Бесплатно
Статья научная
In this paper, we have presented a new technique for solving scenario based multi-period stochastic programming problems and presented a case study for the business policy of a super shop market in Bangladesh. We have developed our technique based on decomposition based pricing method which is the latest and faster decomposition technique in use. To our knowledge, this is the first work in the field of stochastic programming for solving multi-period stochastic optimization problems by using decomposition based pricing method. We have also developed a model by collecting data of a year from a super shop market of Bangladesh and analyzed their profit by dividing the whole year into four periods for different scenarios of an uncertainty. We have developed a computer code by using mathematical programming language AMPL and analyzed the model by using our developed technique.
Бесплатно
Статья научная
Quantum computing is a computational framework based on the Quantum Mechanism, which has gotten a lot of attention in the past few decades. In comparison to traditional computers, it has achieved amazing performance on several specialized tasks. Quantum computing is the study of quantum computers that use quantum mechanics phenomena such as entanglement, superposition, annealing, and tunneling to solve problems that humans cannot solve in their lifetime. This article offers a brief outline of what is happening in the field of quantum computing, as well as the current state of the art. It also summarizes the features of quantum computing in terms of major elements such as qubit computation, quantum parallelism, and reverse computing. The study investigates the cause of a quantum computer's great computing capabilities by utilizing quantum entangled states. It also emphasizes that quantum computer research requires a combination of the most sophisticated sciences, such as computer technology, micro-physics, and advanced mathematics.
Бесплатно
A Robotic Path Planning by Using Crow Swarm Optimization Algorithm
Статья научная
One of the most common problem in the design of robotic technology is the path planning. The challenge is choosing the robotics’ path from source to destination with minimum cost. Meta-heuristic algorithms are popular tools used in a search process to get optimal solution. In this paper, we used Crow Swarm Optimization (CSO) to overcome the problem of choosing the optimal path without collision. The results of CSO compared with two meta-heuristic algorithms: PSO and ACO in addition to a hybrid method between these algorithms. The comparison process illustrates that the CSO better than PSO and ACO in path planning, but compared to hybrid method CSO was better whenever the smallest population. Consequently, the importance of research lies in finding a new method to use a new meta-humanistic algorithm to solve the problem of robotic path planning.
Бесплатно
Статья научная
Tuberculosis is one of the most destructive bacteria in human being and the second cause of mortality after HIV/AIDS in the whole world. In this research work, a SEIRS of mathematical model for the transmission of tuberculosis incorporating vital dynamics, early therapy of patient with tuberculosis were studied and a model for treatment of infective as controls was developed. The effective reproduction number and the disease-free equilibrium was also analysed for the stability. The results revealed that the two controls reduce effective number below unity. Furthermore, it shows that early therapy of patient with tuberculosis is more effective in mitigating the spread of tuberculosis burden.
Бесплатно
A Subspace Inclusion Graph of a Finite Dimensional Vector Space
Статья научная
The combination of algebraic structures and graphs was carried out by investigating thoroughly the relation among the algebraic structure and the graph theoretic properties. Moreover, it needs to explore algebraic structure. The results of the combination of algebraic structures and graphs have many applications in the fields of Internet modeling, coding, etc. For example, the famous Cayley graph was constructed from groups and widely used in network models. Das introduced the subspace inclusion graph on finite-dimensional vector space over a finite filed, and studied that the graph is bipartite and some special properties if the dimension of the vector space is 3. In this paper, this bipartite inclusion graph in the case of 3-dimensional is extended to more general dimensional bipartite inclusion graph. The diameter, girth, clique number, covering number, independence number and matching number are studied and the properties are shown, such as regular, planar and Eulerian. Moreover, the authors also introduce a new results about the structure and the number of 1-dimensional and n-1-dimensional subspaces on n-dimensional vector space.
Бесплатно
A System to Predict Emotion from Bengali Speech
Статья научная
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.
Бесплатно
A Verifiable Ring Signature Scheme of Anonymous Signcryption Using ECC
Статья научная
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.
Бесплатно
A facial expression recognition model using support vector machines
Статья научная
Facial Expression Recognition (FER) has gained interest among researchers due to its inevitable role in the human computer interaction. In this paper, an FER model is proposed using principal component analysis (PCA) as the dimensionality reduction technique, Gabor wavelets and Local binary pattern (LBP) as the feature extraction techniques and support vector machine (SVM) as the classification technique. The experimentation was done on Cohn-Kanade, JAFFE, MMI Facial Expression datasets and real time facial expressions using a webcam. The proposed methods outperform the existing methods surveyed.
Бесплатно
A mathematical model for capturing cholera spread and containment options
Статья научная
The explosive nature of cholera epidemic over the years in different parts of the world has been a subject of interest to scientists in proffering interventions towards controlling its spread. Over the years many models has been created by the following people Capaso and Pavari – Fontana (1973), Codeco (2001), Hartley, Tien (2009), Mukandivare (2009) etc. In the present study, we modify the Cholera model proposed by Mukandivare incorporating three (3) containment options such as vaccination, Therapeutic treatment and water treatment and solved the system analytically using Homotopy Perturbation Method. The results shows that with improved use of vaccination, therapy and proper sanitation we have a more healthy population. This research is therefore recommended to modelers who desire to know how homotopy perturbation methods works. The computations were done and further analyzed mathematically using a computer symbolic package MAPLE 13.
Бесплатно
A new approach to the design of a finite automaton that accepts class of IPV4 addresses
Статья научная
Theory of computation is characterized as calculation through the conceptual machines. The three essential unique machines utilized are Finite Automata, Pushdown Automata and Turing Machine. In this paper we propose an outline of Finite Automata that accepts the class of IPV4 Addresses.
Бесплатно
A new credibilistic clustering method with mahalanobis distance
Статья научная
The fuzzy c-means (FCM) is the best known clustering and use the degree of membership fuzzy to data clustering. But the membership is not always for all data correctly. That is, at scattered dataset belonging is less and noisy dataset belonging is more assigned and local optimization problem occurs. Possibility c-means (PCM) was introduced to correspond weaknesses FCM approach. In PCM was not self-duality property. In other words, a sample membership for all clusters be assigned more than one and basic condition FCM were violated. One of the new method is Credibilistic clustering and based on credibility theory proposed that is used to study the behavior of fuzzy phenomenon. The aim is to provide new Credibilistic clustering approach with replacing credibility measure instead of the fuzzy membership and Mahalanobis distance use in FCM objective function. Credibility measure has self-duality property and solves coincident clustering problem. Mahalanobis distance used instead of Euclidian distance to separate cluster centers from each other and dens samples of each cluster. The result of proposed method is evaluated with three numeric dataset and Iris dataset. The most important challenge will be how to choose the initial cluster centers in the noisy dataset. In the future, we can be used FCM combined with particle swarm optimization.
Бесплатно
A numerical approach for solving high-order boundary value problems
Статья научная
In this paper, a numerical method which produces an approximate solution is presented for the numerical solutions of sixth,eighth,ninth and twelfth order boundary value problems. With the aid of derivatives of power series which slightly perturbe and collocate, eventually converts boundary value problems into the square matrix equations with the unknown coefficients obtain using MAPLE 18 software. This method gives the approximate solutions and compare with the exact solutions. Finally, some examples and their numerical solutions are given by comparing the numerical results obtained to other methods available in the literature, show a good agreement and efficiency.
Бесплатно
Статья научная
A new scheme for secure information transmission is proposed using the generalized modified projective synchronization (GMPS) method. The linear transformation of the modified Colpitts oscillator, first introduced in Cristinel and Radu (Low-Power Realizations of Secure Chaotic Communication Schemes. IEEE Asia Pacific Conference on Circuits and Systems, 2000) is investigated prior to the more detailed study by Kammogne et al. (Journal of chaos. (2014). doi: 10.1155/2014/659647). This circuit is employed to encrypt the information signal. In the receiver end, by designing the controllers and the parameter update rule, GMPS between the transmitter and receiver systems is achieved and the unknown parameters are estimated simultaneously. Based on the Lyapunov stability theory, the controllers and corresponding parameters update rule are constructed to achieve generalized modified projective synchronization between the transmitter and receiver system with uncertain parameters. The original information signal can be recovered successfully through some simple operations by the estimated parameter. The message signal can be finally recovered by the identified parameter and the corresponding demodulation method. Numerical simulations are performed to show the validity and feasibility of the presented secure communication scheme.
Бесплатно
A systematic expository review of Schmidt-Samoa cryptosystem
Статья научная
Public key cryptographic schemes are vastly used to ensure confidentiality, integrity, authentication and non-repudiation. Schmidt-Samoa cryptosystem (SSC) is a public key cryptosystem, which depends on the difficulty of large integer factorization problem. The implementation of SSC to secure different recent communication technologies such as cloud and fog computing is on demand due to the assorted security services offered by SSC such as data encryption/decryption, digital signature and data integrity. In this paper, we provide a systematic review of SSC public key cryptosystem to help crypto-designers to implement SSC efficiently and adopt it in hardware or software-based applications. According to the literature, the effective utilization and design SSC can place it as a viable alternative of RSA cryptosystems and many others.
Бесплатно
Accuracy Analysis for the Solution of Initial Value Problem of ODEs Using Modified Euler Method
Статья научная
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.
Бесплатно
Action Recognition Based on the Modified Twostream CNN
Статья научная
Human action recognition is an important research direction in computer vision areas. Its main content is to simulate human brain to analyze and recognize human action in video. It usually includes individual actions, interactions between people and the external environment. Space-time dual-channel neural network can represent the features of video from both spatial and temporal perspectives. Compared with other neural network models, it has more advantages in human action recognition. In this paper, a action recognition method based on improved space-time two-channel convolutional neural network is proposed. First, the video is divided into several equal length non-overlapping segments, and a frame image representing the static feature of the video and a stacked optical flow image representing the motion feature are sampled at random part from each segment. Then these two kinds of images are input into the spatial domain and the temporal domain convolutional neural network respectively for feature extraction, and then the segmented features of each video are fused in the two channels respectively to obtain the category prediction features of the spatial domain and the temporal domain. Finally, the video action recognition results are obtained by integrating the predictive features of the two channels. Through experiments, various data enhancement methods and transfer learning schemes are discussed to solve the over-fitting problem caused by insufficient training samples, and the effects of different segmental number, pre-training network, segmental feature fusion scheme and dual-channel integration strategy on action recognition performance are analyzed. The experiment results show that the proposed model can better learn the human action features in a complex video and better recognize the action.
Бесплатно
Adaptive Social Acceleration Constant Based Particle Swarm Optimization
Статья научная
In this paper, an attempt has been made to develop an Adaptive Social Acceleration Constant based PSO (ASACPSO). ASACPSO converge faster in comparison to basic PSO. The best value has been selected based on the minimum number of kounts required to minimize the function. Adaptive Social Acceleration Constant based PSO (ASACPSO) has been developed using the best value of adaptive social acceleration constant. The Adaptive Social Acceleration Constant has been searched using three formulations which led to the development of three algorithms-ALDPSO, AELDPSO-I and AELDPSO-II. All three were implemented on Rosenbrock function to get the best value of adaptive social acceleration constant. Similarly it has been implemented on seven mathematical benchmark functions and its performance has been compared to Basic Particle Swarm Optimization (BPSO). ASACPSO was observed to converge faster and give better accuracy. Results show that Kounts required for convergence of mathematical function is lesser for ASACPSO in comparison to basic PSO.ASACPSO reduces the computational time to optimize the function.
Бесплатно
An Application of the Two-Factor Mixed Model Design in Educational Research
Статья научная
As with any ANOVA, a repeated measure ANOVA tests the equality of means. However, a repeated measure ANOVA is used when all members of a random sample are measured under a number of different conditions. As the sample is exposed to each condition in turn, the measurement of the dependent variable is repeated. Using a standard ANOVA in this case is not appropriate because it fails to model the correlation between the repeated measures: the data violate the ANOVA assumption of independence. Some ANOVA designs combine repeated measures factors and independent group factors. These types of designs are called mixed-model ANOVA and they have a split plot structure since they involve a mixture of one between-groups factor and one within-subjects factor. The work present an application of the mixed model factorial ANOVA, using scores obtained by 120 secondary school students in mathematics. The between group factor is the different categories of students (science, commercial humanities) with three levels while the within group factor is the three years spent in senior secondary School.
Бесплатно
An Approach of Securing Data using Combined Cryptography and Steganography
Статья научная
The recent advance in information technology field forcing us to ensure the privacy of the digital data. It is very important to develop the method that may satisfy the needs. Many methods/techniques applied to reach that goal. One of efficient way to reach that secrecy can be achieved by combining Cryptography and Steganography. In this paper, a new RGB shuffling method proposed. The concept of encryption using RGB Shuffling is shuffling all of RGB element to distort the image. RGB Shuffling method will shuffle the RGB each pixel of image depends on the input password from user. The basic step of RGB shuffling is adding RGB element with ASCII password, invers and shuffle it.
Бесплатно
