Water pollution as a result of contamination with dye-contaminating effluents is a severe issue for water reservoirs, which instigated the study of biodegradation of Reactive Red 195 and Reactive Blue dyes by E. coli and Bacillus sp. The effects of occupation time, solution pH, initial dyes concentrations, biomass loading, and temperature were investigated via batch-system experiments by using the Design of Experiment (DOE) for 2 levels and 5 factors response surface methodology (RSM). The operational conditions used for these factors were optimized using quadratic techniques by reducing the number of experiments. The results revealed that the two types of bacteria had a powerful effect on biodegradable dyes. The regression analysis reveale

This paper presents an improved technique on Ant Colony Optimization (ACO) algorithm. The procedure is applied on Single Machine with Infinite Bus (SMIB) system with power system stabilizer (PSS) at three different loading regimes. The simulations are made by using MATLAB software. The results show that by using Improved Ant Colony Optimization (IACO) the system will give better performance with less number of iterations as it compared with a previous modification on ACO. In addition, the probability of selecting the arc depends on the best ant performance and the evaporation rate.

     The North Central Coast of Vietnam has a wide distribution of loose sand which is often exposed on the surface. The thickness changes from a few meters to over ten meters. This sand with the loose state can be sensitive to the dynamic loads, such as earthquakes, traffic load, or machine foundations. It can be liquefied under these loadings, which might destroy the ground and buildings. The Standard Penetration Test (SPT) is widely used in engineering practice and its values can be useful for the assessment of soil liquefaction potential. Thus, this article presents some ground profiles in some sites in the North Central Coast of Vietnam and determines the liquefaction potential of sand based on SPT

The aim of this article, we define new iterative methods called three-step type in which Jungck resolvent CR-iteration and resolvent Jungck SP-iteration are discussed and study rate convergence and strong convergence in Banach space to reach the fixed point which is differentially solve of nonlinear equations. The studies also expanded around it to find the best solution for nonlinear operator equations in addition to the varying inequalities in Hilbert spaces and Banach spaces, as well as the use of these iterative methods to approximate the difference between algorithms and their images, where we examined the necessary conditions that guarantee the unity and existence of the solid point. Finally, the results show that resolvent CR-iter

The paper aims to propose Teaching Learning based Optimization (TLBO) algorithm to solve 3-D packing problem in containers. The objective which can be presented in a mathematical model is optimizing the space usage in a container. Besides the interaction effect between students and teacher, this algorithm also observes the learning process between students in the classroom which does not need any control parameters. Thus, TLBO provides the teachers phase and students phase as its main updating process to find the best solution. More precisely, to validate the algorithm effectiveness, it was implemented in three sample cases. There was small data which had 5 size-types of items with 12 units, medium data which had 10 size-types of items w

     Optimization is the task of minimizing or maximizing an objective function f(x) parameterized by x. A series of effective numerical optimization methods have become popular for improving the performance and efficiency of other methods characterized by high-quality solutions and high convergence speed. In recent years, there are a lot of interest in hybrid metaheuristics, where more than one method is ideally combined into one new method that has the ability to solve many problems rapidly and efficiently. The basic concept of the proposed method is based on the addition of the acceleration part of the Gravity Search Algorithm (GSA) model in the Firefly Algorithm (FA) model and creating new individuals. Some stan

Extractive multi-document text summarization – a summarization with the aim of removing redundant information in a document collection while preserving its salient sentences – has recently enjoyed a large interest in proposing automatic models. This paper proposes an extractive multi-document text summarization model based on genetic algorithm (GA). First, the problem is modeled as a discrete optimization problem and a specific fitness function is designed to effectively cope with the proposed model. Then, a binary-encoded representation together with a heuristic mutation and a local repair operators are proposed to characterize the adopted GA. Experiments are applied to ten topics from Document Understanding Conference DUC2002 datas