This paper presents a hybrid genetic algorithm (hGA) for optimizing the maximum likelihood function ln(L(phi(1),theta(1)))of the mixed model ARMA(1,1). The presented hybrid genetic algorithm (hGA) couples two processes: the canonical genetic algorithm (cGA) composed of three main steps: selection, local recombination and mutation, with the local search algorithm represent by steepest descent algorithm (sDA) which is defined by three basic parameters: frequency, probability, and number of local search iterations. The experimental design is based on simulating the cGA, hGA, and sDA algorithms with different values of model parameters, and sample size(n). The study contains comparison among these algorithms depending on MSE value. One can conclude that (hGA) can give good estimators (phi(1),theta(1)) of ARMA(1,1)parameters and more reliable than estimators obtained by cGA and SDA algorithm
The issue of increasing the range covered by a wireless sensor network with restricted sensors is addressed utilizing improved CS employing the PSO algorithm and opposition-based learning (ICS-PSO-OBL). At first, the iteration is carried out by updating the old solution dimension by dimension to achieve independent updating across the dimensions in the high-dimensional optimization problem. The PSO operator is then incorporated to lessen the preference random walk stage's imbalance between exploration and exploitation ability. Exceptional individuals are selected from the population using OBL to boost the chance of finding the optimal solution based on the fitness value. The ICS-PSO-OBL is used to maximize coverage in WSN by converting r
... Show MoreThis paper discusses an optimal path planning algorithm based on an Adaptive Multi-Objective Particle Swarm Optimization Algorithm (AMOPSO) for two case studies. First case, single robot wants to reach a goal in the static environment that contain two obstacles and two danger source. The second one, is improving the ability for five robots to reach the shortest way. The proposed algorithm solves the optimization problems for the first case by finding the minimum distance from initial to goal position and also ensuring that the generated path has a maximum distance from the danger zones. And for the second case, finding the shortest path for every robot and without any collision between them with the shortest time. In ord
... Show MoreIn this paper, the construction of Hermite wavelets functions and their operational matrix of integration is presented. The Hermite wavelets method is applied to solve nth order Volterra integro diferential equations (VIDE) by expanding the unknown functions, as series in terms of Hermite wavelets with unknown coefficients. Finally, two examples are given
Most of the medical datasets suffer from missing data, due to the expense of some tests or human faults while recording these tests. This issue affects the performance of the machine learning models because the values of some features will be missing. Therefore, there is a need for a specific type of methods for imputing these missing data. In this research, the salp swarm algorithm (SSA) is used for generating and imputing the missing values in the pain in my ass (also known Pima) Indian diabetes disease (PIDD) dataset, the proposed algorithm is called (ISSA). The obtained results showed that the classification performance of three different classifiers which are support vector machine (SVM), K-nearest neighbour (KNN), and Naïve B
... Show MoreEmergency vehicle (EV) services save lives around the world. The necessary fast response of EVs requires minimising travel time. Preempting traffic signals can enable EVs to reach the desired location quickly. Most of the current research tries to decrease EV delays but neglects the resulting negative impacts of the preemption on other vehicles in the side roads. This paper proposes a dynamic preemption algorithm to control the traffic signal by adjusting some cycles to balance between the two critical goals: minimal delay for EVs with no stop, and a small additional delay to the vehicles on the side roads. This method is applicable to preempt traffic lights for EVs through an Intelli
Evolutionary algorithms (EAs), as global search methods, are proved to be more robust than their counterpart local heuristics for detecting protein complexes in protein-protein interaction (PPI) networks. Typically, the source of robustness of these EAs comes from their components and parameters. These components are solution representation, selection, crossover, and mutation. Unfortunately, almost all EA based complex detection methods suggested in the literature were designed with only canonical or traditional components. Further, topological structure of the protein network is the main information that is used in the design of almost all such components. The main contribution of this paper is to formulate a more robust E
... Show MoreA new Mannich base ligand was prepared by reacting the 2-chloro.-N-(5-mercapto-1, 3, 4-thiadazol -2-yl) acetamide and Piperidine in the presence (formaldehyde) (L) ligand. A series of ligand complexes were prepared from (L) with the metal ion Co (II), Ni (II), Cu (II), Pd (II), Pt (IV), and Au (III). Various spectroscopic techniques such as C.H.N.S, FTIR, UV-VIS, , 1HNMR, 13CNMR, Magnetic moment, and molar conductivity successfully characterize the obtained compounds. The M: L ratio was determined using the molar ratio method in solution. All prepared compounds' antibacterial and antifungal activity was studied against two types of bacteria and one type of fungi at a rate of 0.02M. The standard ΔH° f and ΔEb of the ligands an
... Show MoreABSTRACT : This research involves the synthesis of five to seven heterocyclic compounds starting with Schiff’s bases which derived from oxime as a starting material. 1.3-oxazepine derivatives were prepared from adding different anhydrides to the Schiff bases, tetrazole and thiazolidinone derivatives synthesized from add sodium azide and thioglycolic acid to the same Schiff’s bases as a five members ring. Pyrimidine derivatives were prepared after the reaction of the azomethine group with acetyl chloride and then urea and thiourea to synthesis on derivatives contain the six members ring. Another step included identified and confirmed these compounds by FT- IR, 1HNMR, TLC and 13CNMR finally, step included the assay of biological activity
... Show More