Azo dyes like methyl orange (MO) are very toxic components due to their recalcitrant properties which makes their removal from wastewater of textile industries a significant issue. The present study aimed to study their removal by utilizing aluminum and Ni foam (NiF) as anodes besides Fe foam electrodes as cathodes in an electrocoagulation (EC) system. Primary experiments were conducted using two Al anodes, two NiF anodes, or Al-NiF anodes to predict their advantages and drawbacks. It was concluded that the Al-NiF anodes were very effective in removing MO dye without long time of treatment or Ni leaching at in the case of adopting the Al-Al or NiF-NiF anodes, respectively. The structure and surface morphology of the NiF electrode were inves

Purpose: To use the L25 Taguchi orthogonal array for optimizing the three main solvothermal parameters that affect the synthesis of metal-organic frameworks-5 (MOF-5). Methods: The L25 Taguchi methodology was used to study various parameters that affect the degree of crystallinity (DOC) of MOF-5. The parameters comprised temperature of synthesis, duration of synthesis, and ratio of the solvent, N,N-dimethyl formamide (DMF) to reactants. For each parameter, the volume of DMF was varied while keeping the weight of reactants constant. The weights of 1,4-benzodicarboxylate (BDC) and Zn(NO3)2.6H2O used were 0.390 g and 2.166 g, respectively. For each parameter investigated, five different levels were used. The MOF-5 samples were synthesi

Nurse scheduling problem is one of combinatorial optimization problems and it is one of NP-Hard problems which is difficult to be solved as optimal solution. In this paper, we had created an proposed algorithm which it is hybrid simulated annealing algorithm to solve nurse scheduling problem, developed the simulated annealing algorithm and Genetic algorithm. We can note that the proposed algorithm (Hybrid simulated Annealing Algorithm(GS-h)) is the best method among other methods which it is used in this paper because it satisfied minimum average of the total cost and maximum number of Solved , Best and Optimal problems. So we can note that the ratios of the optimal solution are 77% for the proposed algorithm(GS-h), 28.75% for Si

Abstract

Hexapod robot is a flexible mechanical robot with six legs. It has the ability to walk over terrain. The hexapod robot look likes the insect so it has the same gaits. These gaits are tripod, wave and ripple gaits. Hexapod robot needs to stay statically stable at all the times during each gait in order not to fall with three or more legs continuously contacts with the ground. The safety static stability walking is called (the stability margin). In this paper, the forward and inverse kinematics are derived for each hexapod’s leg in order to simulate the hexapod robot model walking using MATLAB R2010a for all gaits and the geometry in order to derive the equations of the sub-constraint workspaces for each

Gumbel distribution was dealt with great care by researchers and statisticians. There are traditional methods to estimate two parameters of Gumbel distribution known as Maximum Likelihood, the Method of Moments and recently the method of re-sampling called (Jackknife). However, these methods suffer from some mathematical difficulties in solving them analytically. Accordingly, there are other non-traditional methods, like the principle of the nearest neighbors, used in computer science especially, artificial intelligence algorithms, including the genetic algorithm, the artificial neural network algorithm, and others that may to be classified as meta-heuristic methods. Moreover, this principle of nearest neighbors has useful statistical featu

<p>Energy and memory limitations are considerable constraints of sensor nodes in wireless sensor networks (WSNs). The limited energy supplied to network nodes causes WSNs to face crucial functional limitations. Therefore, the problem of limited energy resource on sensor nodes can only be addressed by using them efficiently. In this research work, an energy-balancing routing scheme for in-network data aggregation is presented. This scheme is referred to as Energy-aware and load-Balancing Routing scheme for Data Aggregation (hereinafter referred to as EBR-DA). The EBRDA aims to provide an energy efficient multiple-hop routing to the destination on the basis of the quality of the links between the source and destination. In