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

An Optimal Algorithm for HTML Page Building Process

The data communication has been growing in present day. Therefore, the data encryption became very essential in secured data transmission and storage and protecting data contents from intruder and unauthorized persons. In this paper, a fast technique for text encryption depending on genetic algorithm is presented. The encryption approach is achieved by the genetic operators Crossover and mutation. The encryption proposal technique based on dividing the plain text characters into pairs, and applying the crossover operation between them, followed by the mutation operation to get the encrypted text. The experimental results show that the proposal provides an important improvement in encryption rate with comparatively high-speed Process

In this research a new system identification algorithm is presented for obtaining an optimal set of mathematical models for system with perturbed coefficients, then this algorithm is applied practically by an “On Line System Identification Circuit”, based on real time speed response data of a permanent magnet DC motor. Such set of mathematical models represents the physical plant against all variation which may exist in its parameters, and forms a strong mathematical foundation for stability and performance analysis in control theory problems.

This paper proposes a novel meta-heuristic optimization algorithm called the fine-tuning meta-heuristic algorithm (FTMA) for solving global optimization problems. In this algorithm, the solutions are fine-tuned using the fundamental steps in meta-heuristic optimization, namely, exploration, exploitation, and randomization, in such a way that if one step improves the solution, then it is unnecessary to execute the remaining steps. The performance of the proposed FTMA has been compared with that of five other optimization algorithms over ten benchmark test functions. Nine of them are well-known and already exist in the literature, while the tenth one is proposed by the authors and introduced in this article. One test trial was shown t

In many video and image processing applications, the frames are partitioned into blocks, which are extracted and processed sequentially. In this paper, we propose a fast algorithm for calculation of features of overlapping image blocks. We assume the features are projections of the block on separable 2D basis functions (usually orthogonal polynomials) where we benefit from the symmetry with respect to spatial variables. The main idea is based on a construction of auxiliary matrices that virtually extends the original image and makes it possible to avoid a time-consuming computation in loops. These matrices can be pre-calculated, stored and used repeatedly since they are independent of the image itself. We validated experimentally th

Examining and comparing the image quality of degenerative cervical spine diseases through the application of three MRI sequences; the Two-Dimension T2 Weighed Turbo Spin Echo (2D T2W TSE), the Three-Dimension T2 Weighted Turbo Spin Echo (3D T2W TSE), and the T2 Turbo Field Echo (T2_TFE). Thirty-three patients who were diagnosed as having degenerative cervical spine diseases were involved in this study. Their age range was 40-60 years old. The images were produced via a 1.5 Tesla MRI device using (2D T2W TSE, 3D T2W TSE, and T2_TFE) sequences in the sagittal plane. The image quality was examined by objective and subjective assessments. The MRI image characteristics of the cervical spines (C4-C5, C5-C6, C6-C7) showed significant difference

The root-mean square-radius of proton, neutron, matter and charge radii, energy level, inelastic longitudinal form factors, reduced transition probability from the ground state to first-excited 2⁺ state of even-even isotopes, quadrupole moments, quadrupole deformation parameter, and the occupation numbers for some calcium isotopes for A=42,44,46,48,50 are computed using fp-model space and FPBM interaction. ⁴⁰Ca nucleus is regarded as the inert core for all isotopes under this model space with valence nucleons are moving throughout the fp-shell model space involving 1f_7/2, 2p_3/2, 1f_5/2, and 2p_1/2 orbits. Model space is used to present calculations using FPBM intera