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 researcher [1-10] proposed a method for computing the numerical solution to quasi-linear parabolic p.d.e.s using a Chebyshev method. The purpose of this paper is to extend the method to problems with mixed boundary conditions. An error analysis for the linear problem is given and a global element Chebyshev method is described. A comparison of various chebyshev methods is made by applying them to two-point eigenproblems. It is shown by analysis and numerical examples that the approach used to derive the generalized Chebyshev method is comparable, in terms of the accuracy obtained, with existing Chebyshev methods.

The spectroscopic properties, potential energy curve, dipole moments, total charge density, Electrostatic potential as well as the thermodynamic properties of selenium diatomic halides have been studied using code Mopac.7.21 and hyperchem, semi-empirical molecular orbital of MNDO-method (modified neglected of differential overlap) of parameterization PM3 involving quantum mechanical semi-empirical Hamiltonian. The relevant molecular parameters like interatomic distance, bond angle, dihedral angle and net charge were also calculated.

<span>Distributed denial-of-service (DDoS) attack is bluster to network security that purpose at exhausted the networks with malicious traffic. Although several techniques have been designed for DDoS attack detection, intrusion detection system (IDS) It has a great role in protecting the network system and has the ability to collect and analyze data from various network sources to discover any unauthorized access. The goal of IDS is to detect malicious traffic and defend the system against any fraudulent activity or illegal traffic. Therefore, IDS monitors outgoing and incoming network traffic. This paper contains a based intrusion detection system for DDoS attack, and has the ability to detect the attack intelligently, dynami

In this paper, a compact genetic algorithm (CGA) is enhanced by integrating its selection strategy with a steepest descent algorithm (SDA) as a local search method to give I-CGA-SDA. This system is an attempt to avoid the large CPU time and computational complexity of the standard genetic algorithm. Here, CGA dramatically reduces the number of bits required to store the population and has a faster convergence. Consequently, this integrated system is used to optimize the maximum likelihood function lnL(φ1, θ1) of the mixed model. Simulation results based on MSE were compared with those obtained from the SDA and showed that the hybrid genetic algorithm (HGA) and I-CGA-SDA can give a good estimator of (φ1, θ1) for the ARMA(1,1) model. Anot