In this paper, two of the local search algorithms are used (genetic algorithm and particle swarm optimization), in scheduling number of products (n jobs) on a single machine to minimize a multi-objective function which is denoted as (total completion time, total tardiness, total earliness and the total late work). A branch and bound (BAB) method is used for comparing the results for (n) jobs starting from (5-18). The results show that the two algorithms have found the optimal and near optimal solutions in an appropriate times.
A Simple, rapid and sensitive extractive and spectrophotometric method has been described for the analysis of diphenhyldramine –HCl (DPH) in pure form and in pharmaceutical formulations. The method is based on the formation of chloroform soluble ion-pair complex with Bromophenol blue(BPB) in a phthalate buffer at pH 3.0.The extracted complex shows maximum absorbance at 410 nm. Beer's law is obeyed in the concentration range 0.2-25.0 µg.ml-1. The molar absorptivity and Sandell's sensitivity for the system being 2.416x104 L.mol-1.cm-1 and 0.012µg.cm-2, respectively. The limit of detection was found to be 0.155 µg.ml-1. The proposed me
... Show MoreThis paper demonstrates a new technique based on a combined form of the new transform method with homotopy perturbation method to find the suitable accurate solution of autonomous Equations with initial condition. This technique is called the transform homotopy perturbation method (THPM). It can be used to solve the problems without resorting to the frequency domain.The implementation of the suggested method demonstrates the usefulness in finding exact solution for linear and nonlinear problems. The practical results show the efficiency and reliability of technique and easier implemented than HPM in finding exact solutions.Finally, all algorithms in this paper implemented in MATLAB version 7.12.
Due to restrictions and limitations on agricultural water worldwide, one of the most effective ways to conserve water in this sector is to reduce the water losses and improve irrigation uniformity. Nowadays, the low-pressure sprinkler has been widely used to replace the high-pressure impact sprinklers in lateral move sprinkler irrigation systems due to its low operating cost and high efficiency. However, the hazard of surface runoff represents the biggest obstacle for low-pressure sprinkler systems. Most researchers have used the pulsing technique to apply variable-rate irrigation to match the crop water needs within a normal application rate that does not produce runoff. This research introduces a variable pulsed irrigation algorit
... Show MoreHiding technique for dynamic encryption text using encoding table and symmetric encryption method (AES algorithm) is presented in this paper. The encoding table is generated dynamically from MSB of the cover image points that used as the first phase of encryption. The Harris corner point algorithm is applied on cover image to generate the corner points which are used to generate dynamic AES key to second phase of text encryption. The embedded process in the LSB for the image pixels except the Harris corner points for more robust. Experimental results have demonstrated that the proposed scheme have embedding quality, error-free text recovery, and high value in PSNR.
In the present work, an image compression method have been modified by combining The Absolute Moment Block Truncation Coding algorithm (AMBTC) with a VQ-based image coding. At the beginning, the AMBTC algorithm based on Weber's law condition have been used to distinguish low and high detail blocks in the original image. The coder will transmit only mean of low detailed block (i.e. uniform blocks like background) on the channel instate of transmit the two reconstruction mean values and bit map for this block. While the high detail block is coded by the proposed fast encoding algorithm for vector quantized method based on the Triangular Inequality Theorem (TIE), then the coder will transmit the two reconstruction mean values (i.e. H&L)
... Show MoreIn this paper, we deal with the problem of general matching of two images one of them has experienced geometrical transformations, to find the correspondence between two images. We develop the invariant moments for traditional techniques (moments of inertia) with new approach to enhance the performance for these methods. We test various projections directional moments, to extract the difference between Block Distance Moment (BDM) and evaluate their reliability. Three adaptive strategies are shown for projections directional moments, that are raster (vertical and horizontal) projection, Fan-Bean projection and new projection procedure that is the square projection method. Our paper started with the description of a new algorithm that is low
... Show MoreMetaheuristics under the swarm intelligence (SI) class have proven to be efficient and have become popular methods for solving different optimization problems. Based on the usage of memory, metaheuristics can be classified into algorithms with memory and without memory (memory-less). The absence of memory in some metaheuristics will lead to the loss of the information gained in previous iterations. The metaheuristics tend to divert from promising areas of solutions search spaces which will lead to non-optimal solutions. This paper aims to review memory usage and its effect on the performance of the main SI-based metaheuristics. Investigation has been performed on SI metaheuristics, memory usage and memory-less metaheuristics, memory char
... Show MoreThe aim of this paper is to study the quaternary classical continuous optimal control for a quaternary linear parabolic boundary value problems(QLPBVPs). The existence and uniqueness theorem of the continuous quaternary state vector solution for the weak form of the QLPBVPs with given quaternary classical continuous control vector (QCCCV) is stated and proved via the Galerkin Method. In addition, the existence theorem of a quaternary classical continuous optimal control vector governinig by the QLPBVPs is stated and demonstrated. The Fréchet derivative for the cost function is derived. Finally, the necessary conditions for the optimality theorem of the proposed problem is stated and demonstrated.
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
... Show More