Recently Genetic Algorithms (GAs) have frequently been used for optimizing the solution of estimation problems. One of the main advantages of using these techniques is that they require no knowledge or gradient information about the response surface. The poor behavior of genetic algorithms in some problems, sometimes attributed to design operators, has led to the development of other types of algorithms. One such class of these algorithms is compact Genetic Algorithm (cGA), it dramatically reduces the number of bits reqyuired to store the poulation and has a faster convergence speed. In this paper compact Genetic Algorithm is used to optimize the maximum likelihood estimator of the first order moving avergae model MA(1). Simulation results

Bearing capacity of soil is an important factor in designing shallow foundations. It is directly related to foundation dimensions and consequently its performance. The calculations for obtaining the bearing capacity of a soil needs many varying parameters, for example soil type, depth of foundation, unit weight of soil, etc. which makes these calculation very variable–parameter dependent. This paper presents the results of comparison between the theoretical equation stated by Terzaghi and the Artificial Neural Networks (ANN) technique to estimate the ultimate bearing capacity of the strip shallow footing on sandy soils. The results show a very good agreement between the theoretical solution and the ANN technique. Results revealed that us

Abstract

     Machining residual stresses correlate very closely with the cutting parameters and the tool geometries. This research work aims to investigate the effect of cutting speed, feed rate and depth of cut on the surface residual stress of steel AISI 1045 after face milling operation. After each milling test, the residual stress on the surface of the workpiece was measured by using X-ray diffraction technique. Design of Experiment (DOE) software was employed using the response surface methodology (RSM) technique with a central composite rotatable design to build a mathematical model to determine the relationship between the input variables and the response. The results showed that both

The objective of an Optimal Power Flow (OPF) algorithm is to find steady state operation point which minimizes generation cost, loss etc. while maintaining an acceptable system performance in terms of limits on generators real and reactive powers, line flow limits etc. The OPF solution includes an objective function. A common objective function concerns the active power generation cost. A Linear programming method is proposed to solve the OPF problem. The Linear Programming (LP) approach transforms the nonlinear optimization problem into an iterative algorithm that in each iteration solves a linear optimization problem resulting from linearization both the objective function and constrains. A computer program, written in MATLAB environme

The influx of data in bioinformatics is primarily in the form of DNA, RNA, and protein sequences. This condition places a significant burden on scientists and computers. Some genomics studies depend on clustering techniques to group similarly expressed genes into one cluster. Clustering is a type of unsupervised learning that can be used to divide unknown cluster data into clusters. The k-means and fuzzy c-means (FCM) algorithms are examples of algorithms that can be used for clustering. Consequently, clustering is a common approach that divides an input space into several homogeneous zones; it can be achieved using a variety of algorithms. This study used three models to cluster a brain tumor dataset. The first model uses FCM, whic