In this paper, we present some numerical methods for solving systems of linear FredholmVolterra integral equations of the second kind. These methods namely are the Repeated Trapezoidal Method (RTM) and the Repeated Simpson's 1/3 Method (RSM). Also some numerical examples are presented to show the efficiency and the accuracy of the presented work.  
 

In this paper, cubic trigonometric spline is used to solve nonlinear Volterra integral equations of second kind. Examples are illustrated to show the presented method’s efficiency and convenience.

With the growth of mobile phones, short message service (SMS) became an essential text communication service. However, the low cost and ease use of SMS led to an increase in SMS Spam. In this paper, the characteristics of SMS spam has studied and a set of features has introduced to get rid of SMS spam. In addition, the problem of SMS spam detection was addressed as a clustering analysis that requires a metaheuristic algorithm to find the clustering structures. Three differential evolution variants viz DE/rand/1, jDE/rand/1, jDE/best/1, are adopted for solving the SMS spam problem. Experimental results illustrate that the jDE/best/1 produces best results over other variants in terms of accuracy, false-positive rate and false-negative

This paper presents the implementation of a complex fractional order proportional integral derivative (CPID) and a real fractional order PID (RPID) controllers. The analysis and design of both controllers were carried out in a previous work done by the author, where the design specifications were classified into easy (case 1) and hard (case 2) design specifications. The main contribution of this paper is combining CRONE approximation and linear phase CRONE approximation to implement the CPID controller. The designed controllers-RPID and CPID-are implemented to control flowing water with low pressure circuit, which is a first order plus dead time system. Simulation results demonstrate that while the implemented RPID controller fails to stabi

Recently Genetic Algorithms (GAs) have frequently been used for optimizing the solution of estimation problems. One of the main advantages of using these techniques is that they require no knowledge or gradient information about the response surface. The poor behavior of genetic algorithms in some problems, sometimes attributed to design operators, has led to the development of other types of algorithms. One such class of these algorithms is compact Genetic Algorithm (cGA), it dramatically reduces the number of bits reqyuired to store the poulation and has a faster convergence speed. In this paper compact Genetic Algorithm is used to optimize the maximum likelihood estimator of the first order moving avergae model MA(1). Simulation results

Krawtchouk polynomials (KPs) and their moments are promising techniques for applications of information theory, coding theory, and signal processing. This is due to the special capabilities of KPs in feature extraction and classification processes. The main challenge in existing KPs recurrence algorithms is that of numerical errors, which occur during the computation of the coefficients in large polynomial sizes, particularly when the KP parameter (p) values deviate away from 0.5 to 0 and 1. To this end, this paper proposes a new recurrence relation in order to compute the coefficients of KPs in high orders. In particular, this paper discusses the development of a new algorithm and presents a new mathematical model for computing the

     Optimization is the task of minimizing or maximizing an objective function f(x) parameterized by x. A series of effective numerical optimization methods have become popular for improving the performance and efficiency of other methods characterized by high-quality solutions and high convergence speed. In recent years, there are a lot of interest in hybrid metaheuristics, where more than one method is ideally combined into one new method that has the ability to solve many problems rapidly and efficiently. The basic concept of the proposed method is based on the addition of the acceleration part of the Gravity Search Algorithm (GSA) model in the Firefly Algorithm (FA) model and creating new individuals. Some stan