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

Recently, numerous the generalizations of Hurwitz-Lerch zeta functions are investigated and introduced. In this paper, by using the extended generalized Hurwitz-Lerch zeta function, a new Salagean’s differential operator is studied. Based on this new operator, a new geometric class and yielded coefficient bounds, growth and distortion result, radii of convexity, star-likeness, close-to-convexity, as well as extreme points are discussed.

Recently, new generalizations have been presented for the hyponormal operators, which are (N, k)-hyponormal operators and (h, M)-hyponormal operators. Some properties of these concepts have also been proved, one of these properties is that the product of two (N, k)-hyponormal operator is also (N, k)- hyponormal operator and the product of two (h, M)-hyponormal operators is (h, M)-hyponormal operator. In our research, we will reprove these properties by using the (l,m)-commuting operator equations, in addition to that we will solve the (l, m)-commuting operator equations for (N, k)-hyponormal operators and (h, M)-hyponormal operators.

  Necessary and sufficient conditions for the operator equation I AXAX n  * , to have a real positive definite solution X are given. Based on these conditions, some properties of the operator A as well as relation between the solutions X andAare given.

    In this work, we study a new class of meromorphicmultivalent functions, defined by fractional differ-integral operator.We obtain some geometricproperties, such ascoefficient inequality, growth and distortion bounds, convolution properties, integral representation, radii of starlikeness, convexity, extreme pointsproperties, weighted mean and arithmetic meanproperties.

     In the complex field, special functions are closely related to geometric holomorphic functions. Koebe function is a notable contribution to the study of the geometric function theory (GFT), which is a univalent function. This sequel introduces a new class that includes a more general Koebe function which is holomorphic in a complex domain. The purpose of this work is to present a new operator correlated with GFT. A new generalized Koebe operator is proposed in terms of the convolution principle. This Koebe operator refers to the generality of a prominent differential operator, namely the Ruscheweyh operator. Theoretical investigations in this effort lead to a number of implementations in the subordination function theory. The ti

The quality of Global Navigation Satellite Systems (GNSS) networks are considerably influenced by the configuration of the observed baselines. Where, this study aims to find an optimal configuration for GNSS baselines in terms of the number and distribution  of baselines to improve the quality criteria of the GNSS networks. First order design problem (FOD) was applied in this research to optimize GNSS network baselines configuration, and based on sequential adjustment method to solve its objective functions.

FOD for optimum precision (FOD-p) was the proposed model which based on the design criteria of A-optimality and E-optimality. These design criteria were selected as objective functions of precision, whic

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

The approximate solution of a nonlinear parabolic boundary value problem with variable coefficients (NLPBVPVC) is found by using mixed Galekin finite element method (GFEM) in space variable with Crank Nicolson (C-N) scheme in time variable. The problem is reduced to solve a Galerkin nonlinear algebraic system (NLAS), which is solved by applying the predictor and the corrector method (PCM), which transforms the NLAS into a Galerkin linear algebraic system (LAS). This LAS is solved once using the Cholesky technique (CHT) as it appears in the MATLAB package and once again using the General Cholesky Reduction Order Technique (GCHROT), the GCHROT is employed here at first time to play an important role for saving a massive time. Illustrative

    Clustering is an unsupervised learning method that classified data according to similarity probabilities. DBScan as a high-quality algorithm has been introduced for clustering spatial data due to its ability to remove noise (outlier) and constructing arbitrarily shapes. However, it has a problem in determining a suitable value of Eps parameter. This paper proposes a new clustering method, termed as DBScanBAT, that it optimizes DBScan algorithm by BAT algorithm. The proposed method automatically sets the DBScan parameters (Eps) and finds the optimal value for it. The results of the proposed DBScanBAT automatically generates near original number of clusters better than DBScanPSO and original DBScan. Furthermore, the proposed method