Task scheduling in an important element in a distributed system. It is vital how the jobs are correctly assigned for each computer’s processor to improve performance. The presented approaches attempt to reduce the expense of optimizing the use of the CPU. These techniques mostly lack planning and in need to be comprehensive. To address this fault, a hybrid optimization scheduling technique is proposed for the hybridization of both First-Come First-Served (FCFS), and Shortest Job First (SJF). In addition, we propose to apply Simulated Annealing (SA) algorithm as an optimization technique to find optimal job’s execution sequence considering both job’s entrance time and job’s execution time to balance them to reduce the job’s waiting time to be executed. As a result, this research proves that the proposed technique achieves an optimization efficiency with a percentage average 45.5 % according to the FCFS algorithm and 54.5% according to SJF method.
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
... Show MoreThis 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
... Show MoreIn 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
... Show MoreFor several applications, it is very important to have an edge detection technique matching human visual contour perception and less sensitive to noise. The edge detection algorithm describes in this paper based on the results obtained by Maximum a posteriori (MAP) and Maximum Entropy (ME) deblurring algorithms. The technique makes a trade-off between sharpening and smoothing the noisy image. One of the advantages of the described algorithm is less sensitive to noise than that given by Marr and Geuen techniques that considered to be the best edge detection algorithms in terms of matching human visual contour perception.
Meerkat Clan Algorithm (MCA) is a nature-based metaheuristic algorithm which imitates the intelligent behavior of the meerkat animal. This paper presents an improvement on the MCA based on a chaotic map and crossover strategy (MCA-CC). These two strategies increase the diversification and intensification of the proposed algorithm and boost the searching ability to find more quality solutions. The 0-1 knapsack problem was solved by the basic MCA and the improved version of this algorithm (MCA-CC). The performance of these algorithms was tested on low and high dimensional problems. The experimental results demonstrate that the proposed algorithm had overcome the basic algorithm in terms of solution quality, speed a
... Show MoreAccurate calculation of transient overvoltages and dielectric stresses from fast-front excitations is required to obtain an optimal dielectric design of power components subjected to these conditions, which are commonly due to switching and lightning, as well as utilization of power-electronic devices. Toroidal transformers are generally used at the low voltage level. However, recent investigations and developments have explored their use at the medium voltage level. This paper analyzes the model-based improvement of the insulation design of medium voltage toroidal transformers. Lumped and distributed parameter models are used and compared to predict the transient response and dielectric stress along the transformer winding. The parameters
... Show MoreModern automation robotics have replaced many human workers in industrial factories around the globe. The robotic arms are used for several manufacturing applications, and their responses required optimal control. In this paper, a robust approach of optimal position control for a DC motor in the robotic arm system is proposed. The general component of the automation system is first introduced. The mathematical model and the corresponding transfer functions of a DC motor in the robotic arm system are presented. The investigations of using DC motor in the robotic arm system without controller lead to poor system performance. Therefore, the analysis and design of a Proportional plus Integration plus Divertive (PID) controller is illustrated.
... Show MoreTo reduce the effects of discharging heated water disposed into a river flow by a single thermal source, two parameters were changed to get the minimum effect using optimization. The first parameter is to distribute the total flow of the heated water between two disposal points (double source) instead of one and the second is to change the distance between these two points. In order to achieve the solution, a two dimensional numerical model was developed to simulate and predict the changes in temperature distribution in the river due to disposal of the heated water using these two points of disposal.
MATLAB-7 software was used to build a program that could solve the governing partial equations of thermal pollution in rivers by using t
In this paper, the classical continuous triple optimal control problem (CCTOCP) for the triple nonlinear parabolic boundary value problem (TNLPBVP) with state vector constraints (SVCs) is studied. The solvability theorem for the classical continuous triple optimal control vector CCTOCV with the SVCs is stated and proved. This is done under suitable conditions. The mathematical formulation of the adjoint triple boundary value problem (ATHBVP) associated with TNLPBVP is discovered. The Fréchet derivative of the Hamiltonian" is derived. Under suitable conditions, theorems of necessary and sufficient conditions for the optimality of the TNLPBVP with the SVCs are stated and proved.