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

    In this work, we use the explicit and the implicit finite-difference methods to solve the nonlocal problem that consists of the diffusion equations together with nonlocal conditions. The nonlocal conditions for these partial differential equations are approximated by using the composite trapezoidal rule, the composite Simpson's 1/3 and 3/8 rules. Also, some numerical examples are presented to show the efficiency of these methods.

In this paper the Galerkin method is used to prove the existence and uniqueness theorem for the solution of the state vector of the triple linear elliptic partial differential equations for fixed continuous classical optimal control vector. Also, the existence theorem of a continuous classical optimal control vector related with the triple linear equations of elliptic types is proved. The existence of a unique solution for the triple adjoint equations related with the considered triple of the state equations is studied. The Fréchet derivative of the cost function is derived. Finally the theorem of necessary conditions for optimality of the considered problem is proved.

This manuscript presents several applications for solving special kinds of ordinary and partial differential equations using iteration methods such as Adomian decomposition method (ADM), Variation iterative method (VIM) and Taylor series method. These methods can be applied as well as to solve nonperturbed problems and 3rd order parabolic PDEs with variable coefficient. Moreover, we compare the results using ADM, VIM and Taylor series method. These methods are a commination of the two initial conditions.

 In this paper, we introduce and discuss an algorithm for the numerical solution of two- dimensional fractional partial differential equation with parameter. The algorithm for the numerical solution of this equation is based on implicit and an explicit difference method. Finally, numerical example is provided to illustrate that the numerical method for solving this equation is an effective solution method.