In this paper we proposes the philosophy of the Darwinian selection as synthesis method called Genetic algorithm ( GA ), and include new merit function with simple form then its uses in other works for designing one of the kinds of multilayer optical filters called high reflection mirror. Here we intend to investigate solutions for many practical problems. This work appears designed high reflection mirror that have good performance with reduction the number of layers, which can enable one to controlling the errors effect of the thickness layers on the final product, where in this work we can yield such a solution in a very shorter time by controlling the length of the chromosome and optimal genetic operators . Res

    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

Objective of this work is the mixing between human biometric characteristics and unique attributes of the computer in order to protect computer networks and resources environments through the development of authentication and authorization techniques. In human biometric side has been studying the best methods and algorithms used, and the conclusion is that the fingerprint is the best, but it has some flaws. Fingerprint algorithm has been improved so that their performance can be adapted to enhance the clarity of the edge of the gully structures of pictures fingerprint, taking into account the evaluation of the direction of the nearby edges and repeat. In the side of the computer features, computer and its components like human have uniqu

Traffic management at road intersections is a complex requirement that has been an important topic of research and discussion. Solutions have been primarily focused on using vehicular ad hoc networks (VANETs). Key issues in VANETs are high mobility, restriction of road setup, frequent topology variations, failed network links, and timely communication of data, which make the routing of packets to a particular destination problematic. To address these issues, a new dependable routing algorithm is proposed, which utilizes a wireless communication system between vehicles in urban vehicular networks. This routing is position-based, known as the maximum distance on-demand routing algorithm (MDORA). It aims to find an optimal route on a hop-by-ho

Today’s academics have a major hurdle in solving combinatorial problems in the actual world. It is nevertheless possible to use optimization techniques to find, design, and solve a genuine optimal solution to a particular problem, despite the limitations of the applied approach. A surge in interest in population-based optimization methodologies has spawned a plethora of new and improved approaches to a wide range of engineering problems. Optimizing test suites is a combinatorial testing challenge that has been demonstrated to be an extremely difficult combinatorial optimization limitation of the research. The authors have proposed an almost infallible method for selecting combinatorial test cases. It uses a hybrid whale–gray wol

<p>In combinatorial testing development, the fabrication of covering arrays is the key challenge by the multiple aspects that influence it. A wide range of combinatorial problems can be solved using metaheuristic and greedy techniques. Combining the greedy technique utilizing a metaheuristic search technique like hill climbing (HC), can produce feasible results for combinatorial tests. Methods based on metaheuristics are used to deal with tuples that may be left after redundancy using greedy strategies; then the result utilization is assured to be near-optimal using a metaheuristic algorithm. As a result, the use of both greedy and HC algorithms in a single test generation system is a good candidate if constructed correctly. T

Linear motor offers several features in many applications that require linear motion. Nevertheless, the presence of cogging force can deteriorate the thrust of a permanent magnet linear motor. Using several methodologies, a design of synchronous single sided linear iron-core motor was proposed. According to exact formulas with surface-mounted magnets and concentrated winding specification, which are relying on geometrical parameters. Two-dimensional performance analysis of the designed model and its multi-objective optimization were accomplished as a method to reduce the motor cogging force using MAXWELL ANSYS. The optimum model design results showed that the maximum force ripple was approximatrly reduced by 81.24%compared to the origina

The purpose of this paper is applying the robustness in Linear programming(LP) to get rid of uncertainty problem in constraint parameters, and find the robust optimal solution, to maximize the profits of the general productive company of vegetable oils for the year 2019, through the modify on a mathematical model of linear programming when some parameters of the model have uncertain values, and being processed it using robust counterpart of linear programming to get robust results from the random changes that happen in uncertain values ​​of the problem, assuming these values belong to the uncertainty set and selecting the values that cause the worst results and to depend buil