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.
The flexible joint robot manipulators provide various benefits, but also present many control challenges such as nonlinearities, strong coupling, vibration, etc. This paper proposes optimal second order integral sliding mode control (OSOISMC) for a single link flexible joint manipulator to achieve robust and smooth performance. Firstly, the integral sliding mode control is designed, which consists of a linear quadratic regulator (LQR) as a nominal control, and switching control. This control guarantees the system robustness for the entire process. Then, a nonsingularterminal sliding surface is added to give a second order integral sliding mode control (SOISMC), which reduces chartering effect and gives the finite time convergence as well. S
... 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 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 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.
Blockchain 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 MoreThis 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.
As s widely use of exchanging private information in various communication applications, the issue to secure it became top urgent. In this research, a new approach to encrypt text message based on genetic algorithm operators has been proposed. The proposed approach follows a new algorithm of generating 8 bit chromosome to encrypt plain text after selecting randomly crossover point. The resulted child code is flipped by one bit using mutation operation. Two simulations are conducted to evaluate the performance of the proposed approach including execution time of encryption/decryption and throughput computations. Simulations results prove the robustness of the proposed approach to produce better performance for all evaluation metrics with res
... Show MoreThe most popular medium that being used by people on the internet nowadays is video streaming. Nevertheless, streaming a video consumes much of the internet traffics. The massive quantity of internet usage goes for video streaming that disburses nearly 70% of the internet. Some constraints of interactive media might be detached; such as augmented bandwidth usage and lateness. The need for real-time transmission of video streaming while live leads to employing of Fog computing technologies which is an intermediary layer between the cloud and end user. The latter technology has been introduced to alleviate those problems by providing high real-time response and computational resources near to the
... Show MoreThis paper proposes a new strategy to enhance the performance and accuracy of the Spiral dynamic algorithm (SDA) for use in solving real-world problems by hybridizing the SDA with the Bacterial Foraging optimization algorithm (BFA). The dynamic step size of SDA makes it a useful exploitation approach. However, it has limited exploration throughout the diversification phase, which results in getting trapped at local optima. The optimal initialization position for the SDA algorithm has been determined with the help of the chemotactic strategy of the BFA optimization algorithm, which has been utilized to improve the exploration approach of the SDA. The proposed Hybrid Adaptive Spiral Dynamic Bacterial Foraging (HASDBF)
... Show More