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

Regression testing being expensive, requires optimization notion. Typically, the optimization of test cases results in selecting a reduced set or subset of test cases or prioritizing the test cases to detect potential faults at an earlier phase. Many former studies revealed the heuristic-dependent mechanism to attain optimality while reducing or prioritizing test cases. Nevertheless, those studies were deprived of systematic procedures to manage tied test cases issue. Moreover, evolutionary algorithms such as the genetic process often help in depleting test cases, together with a concurrent decrease in computational runtime. However, when examining the fault detection capacity along with other parameters, is required, the method falls sh

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

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 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.

An Optimal Algorithm for HTML Page Building Process

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

The chronic renal disease is a principle common medical dilemma in Iraq. Peripheral arterial disease (PAD) is a prevalent infirmity in the hemodialysis people. The aim of present study was to estimate the prevalence of PAD in subjects with end-stage renal disease (ESRD). This cross-sectional study was done between January 2016 and May 2017 on ESRD subjects regularly attending renal dialysis unit in Al-Kindy teaching hospital in Baghdad, Iraq. PAD was diagnosed on the base of the ankle-brachial index (ABI) measured by using a hand-held Doppler ultrasound. Subjects with ABI ≤0.9 were supposed positive for PAD. A total of 150 ESRD cases were analyzed. The mean age of the subject was 49.52±15 years. Majority of them were males 87(58%). Most

Background: There are many congenital anomalies associated with cleft lip and/or palate. This research is to study the prevalence of congenitally missing teeth and supernumerary teeth in this population group. Materials and Method: One hundred eight cleft lip and/or palate Iraqi patients had participated in this study (57 male, 51 female), 3-12 years of age. 26 of them had orthopantomogram were within (6-12) years of age were inspected for congenitally missing teeth and supernumerary teeth. Patients whom age range 3-5 years were checked for the congenitally missing teeth by clinical examination with strongly insisting the teeth were not missed due to caries or trauma. Results: There were 19(73.076%) patients with 41 congenitally missing tee