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 initial value of the KP parameter. In addition, a new diagonal recurrence relation is introduced and used in the proposed algorithm. The diagonal recurrence algorithm was derived from the existing n direction and x direction recurrence algorithms. The diagonal and existing recurrence algorithms were subsequently exploited to compute the KP coefficients. First, the KP coefficients were computed for one partition after dividing the KP plane into four. To compute the KP coefficients in the other partitions, the symmetry relations were exploited. The performance evaluation of the proposed recurrence algorithm was determined through different comparisons which were carried out in state-of-the-art works in terms of reconstruction error, polynomial size, and computation cost. The obtained results indicate that the proposed algorithm is reliable and computes lesser coefficients when compared to the existing algorithms across wide ranges of parameter values of p and polynomial sizes N. The results also show that the improvement ratio of the computed coefficients ranges from 18.64% to 81.55% in comparison to the existing algorithms. Besides this, the proposed algorithm can generate polynomials of an order ∼8.5 times larger than those generated using state-of-the-art algorithms.
Wireless sensor networks (WSNs) represent one of the key technologies in internet of things (IoTs) networks. Since WSNs have finite energy sources, there is ongoing research work to develop new strategies for minimizing power consumption or enhancing traditional techniques. In this paper, a novel Gaussian mixture models (GMMs) algorithm is proposed for mobile wireless sensor networks (MWSNs) for energy saving. Performance evaluation of the clustering process with the GMM algorithm shows a remarkable energy saving in the network of up to 92%. In addition, a comparison with another clustering strategy that uses the K-means algorithm has been made, and the developed method has outperformed K-means with superior performance, saving ener
... Show MoreThis paper presents a hybrid genetic algorithm (hGA) for optimizing the maximum likelihood function ln(L(phi(1),theta(1)))of the mixed model ARMA(1,1). The presented hybrid genetic algorithm (hGA) couples two processes: the canonical genetic algorithm (cGA) composed of three main steps: selection, local recombination and mutation, with the local search algorithm represent by steepest descent algorithm (sDA) which is defined by three basic parameters: frequency, probability, and number of local search iterations. The experimental design is based on simulating the cGA, hGA, and sDA algorithms with different values of model parameters, and sample size(n). The study contains comparison among these algorithms depending on MSE value. One can conc
... Show MoreCredit risk assessment has become an important topic in financial risk administration. Fuzzy clustering analysis has been applied in credit scoring. Gustafson-Kessel (GK) algorithm has been utilised to cluster creditworthy customers as against non-creditworthy ones. A good clustering analysis implemented by good Initial Centres of clusters should be selected. To overcome this problem of Gustafson-Kessel (GK) algorithm, we proposed a modified version of Kohonen Network (KN) algorithm to select the initial centres. Utilising similar degree between points to get similarity density, and then by means of maximum density points selecting; the modified Kohonen Network method generate clustering initial centres to get more reasonable clustering res
... Show MoreBlockchain represents a new promising technology with a huge economic impact resulting from its uses in various fields such as digital currency and banking; malware represents a serious threat to users, and there are many differences in the effectiveness of antivirus software used to deal with the problem of malware. This chapter has developed a coefficient for measuring the effectiveness of antivirus software. This chapter evaluates the effectiveness of antivirus software by conducting tests on a group of protection programs using a folder containing an amount of data. These programs are applied to combat viruses contained in this folder. The study revealed that the effectiveness of antivirus software is as follows: AVG scored 0%,
... Show MoreNowadays, Wheeled Mobile Robots (WMRs) have found many applications as industry, transportation, inspection, and other fields. Therefore, the trajectory tracking control of the nonholonomic wheeled mobile robots have an important problem. This work focus on the application of model-based on Fractional Order PIaDb (FOPID) controller for trajectory tracking problem. The control algorithm based on the errors in postures of mobile robot which feed to FOPID controller to generate correction signals that transport to torque for each driven wheel, and by means of dynamics model of mobile robot these torques used to compute the linear and angular speed to reach the desired pose. In this work a dynamics model of
... Show MoreThis paper proposes a new structure for a Fractional Order Sliding Mode Controller (FOSMC) to control a Twin Rotor Aerodynamic System (TRAS). The new structure is composed by defining two 3-dimensional sliding mode surfaces for the TRAS model and introducing fractional order derivative integral in the state variables as well as in the control action. The parameters of the controller are determined so as to minimize the Integral of Time multiplied by Absolute Error (ITAE) performance index. Through comparison, this controller outperforms its integer counterpart in many specifications, such as reducing the delay time, rise time, percentage overshoot, settling time, time to reach the sliding surface, and amplitude of chattering in control inpu
... Show MoreThis paper presents new modification of HPM to solve system of 3 rd order PDEs with initial condition, for finding suitable accurate solutions in a wider domain.
This paper focuses on developing a self-starting numerical approach that can be used for direct integration of higher-order initial value problems of Ordinary Differential Equations. The method is derived from power series approximation with the resulting equations discretized at the selected grid and off-grid points. The method is applied in a block-by-block approach as a numerical integrator of higher-order initial value problems. The basic properties of the block method are investigated to authenticate its performance and then implemented with some tested experiments to validate the accuracy and convergence of the method.
This paper deals with the thirteenth order differential equations linear and nonlinear in boundary value problems by using the Modified Adomian Decomposition Method (MADM), the analytical results of the equations have been obtained in terms of convergent series with easily computable components. Two numerical examples results show that this method is a promising and powerful tool for solving this problems.