In this paper, an intelligent tracking control system of both single- and double-axis Piezoelectric Micropositioner stage is designed using Genetic Algorithms (GAs) method for the optimal Proportional-Integral-Derivative (PID) controller tuning parameters. The (GA)-based PID control design approach is a methodology to tune a (PID) controller in an optimal control sense with respect to specified objective function. By using the (GA)-based PID control approach, the high-performance trajectory tracking responses of the Piezoelectric Micropositioner stage can be obtained. The (GA) code was built and the simulation results were obtained using MATLAB environment. The Piezoelectric Micropositioner simulation model with th

In this paper, we proposed to zoom Volterra equations system Altfazlah linear complementarity of the first type in this approximation were first forming functions notch Baschtdam matrix and then we discussed the approach and stability, to notch functions

A fixed firefighting system is a key component of fire safeguarding and reducing fire danger. It is installed as a permanent component in a structure to protect the entire or a portion of the building and its contents. The study aims to review the previous studies that deal with the evaluation of fire safety measures and their use in resolving problems associated with fire threats in buildings. For this reason, a number of previous studies in this field were reviewed compared with the NFPA code. The findings revealed that regulatory developments over the last several decades had created an atmosphere conducive to innovation. This has resulted in a growth in the number of fixed firefighting system types now obtainable. Th

The aim of this paper is to derive a posteriori error estimates for semilinear parabolic interface problems. More specifically, optimal order a posteriori error analysis in the - norm for semidiscrete semilinear parabolic interface problems is derived by using elliptic reconstruction technique introduced by Makridakis and Nochetto in (2003). A key idea for this technique is the use of error estimators derived for elliptic interface problems to obtain parabolic estimators that are of optimal order in space and time.

 According to the circumstances experienced by our country which led to Occurrence of many crises that are the most important crisis is gaining fuel therefore , the theory of queue ( waiting line ) had been used to solve this crisis and as the relevance of this issue indirect and essential role in daily life  .

This research aims to conduct a study of the distribution of gasoline station in (both sides AL – kharkh and AL Rusafa, for the purpose of reducing wasting time and services time through the criteria of the theory of queues and work to improve the efficiency of these stations by the other hand. we are working to reduce the cost of station and increase profits by reducing the active serv

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