With the rapid growth of data and computational needs, distributed systems and computational Grids are gaining more and more attention. Grids are playing an important and growing role in today networks. The huge amount of computations a Grid can fulfill in a specificc time cannot be done by the best super computers. However, Grid performance can still be improved by making sure all the resources available in the Grid are utilized by a good load balancing algorithm. The purpose of such algorithms is to make sure all nodes are equally involved in Grid computations. This research proposes two new distributed swarm intelligence inspired load balancing algorithms. One is based on ant colony optimization and is called AntZ, the other one is based on particle swarm optimization and is called ParticleZ. Distributed load balancing does not incorporate a single point of failure in the system. In the AntZ algorithm, an ant is invoked in response to submitting a job to the Grid and this ant surfs the network to find the best resource to deliver the job to. In the ParticleZ algorithm, each node plays a role as a particle and moves toward other particles by sharing its workload among them. We will be simulating our proposed approaches using a Grid simulation toolkit (GridSim) dedicated to Grid simulations. The performance of the algorithms will be evaluated using several performance criteria (e.g. makespan and load balancing level). A comparison of our proposed approaches with a classical approach called State Broadcast Algorithm and two random approaches will also be provided. Experimental results show the proposed algorithms (AntZ and ParticleZ) can perform very well in a Grid environment. In particular, the use of particle swarm optimization, which has not been addressed in the literature, can yield better performance results in many scenarios than the ant colony approach.

In direct-sequence code division multiple access (DS-CDMA) systems, the heuristic optimization algorithms for multiuser detection include genetic algorithms (GA) and simulated annealing (SA) algorithm. In this thesis, we use particle swarm optimization (PSO) algorithms to solve the optimization problem of multiuser detection (MUD). PSO algorithm has several advantages, such as fast convergence, low computational complexity, and good performance in searching optimum solution. In order to enhance the performance and reduce the number of parameters, we propose two modified PSO algorithms, inertia weighting controlled PSO (W-PSO) and reduced-parameter PSO (R-PSO). From simulation results, the performance of our proposed algorithms can achieve that of optimal solution. Furthermore, our proposed algorithms have faster convergence performance and lower complexity when compared with other conventional algorithms.

The construction of Gene Regulatory Networks (GRNs) is one of the most important issues in systems biology. To infer a large-scale GRN with a nonlinear mathematical model, researchers need to encounter the time-consuming problem due to the large number of network parameters involved. In recent years, the cloud computing technique has been widely used to solve large-scale problems. Among others, Hadoop is currently the most well-known and reliable cloud computing framework, which allows users to analyze large amount of data in a distributed environment (i.e., MapReduce). It also supports data backup and data recovery mechanisms. This study proposes an Island-based GAPSO algorithm under the Hadoop cloud computing environment to infer large-scale GRNs. GAPSO exploited the position and velocity functions of PSO, and integrated the operations of Genetic Algorithm. This approach is often used to derive the optimal solution in nonlinear mathematical models. Several sets of experiments have been conducted, in which the number of network nodes varied from 50 to 125. The experiments were executed in the Hadoop distributed environment with 10, 20, and 26 computers, respectively. In the experiments of inferring the network with 125 gene nodes on the largest Hadoop cluster (i.e. 26 computers), the proposed framework performed up to 9.7 times faster than the stand-alone computer. It means that our work can successfully reduce 90% of the computation time in a single experimental run.

Due to the recent interest in broadband antennas a microstrip patch antenna was developed to meet the need for a cheap, low profile, broadband antenna. This antenna could be used in a wide range of applications such as in the communications industry for cell phones or satellite communication. Particle Swarm Optimization was used to design the dual-linear polarization broadband microstrip antenna and impedance matching network. This optimization method greatly reduced the time needed to find viable antenna parameters. A dual input patch antenna with over 30% bandwidth in the X-band was simulated using Ansoft's High Frequency Structural Simulator (HFSS) in conjunction with Particle Swarm Optimization. A single input and a dual input antenna was then fabricated. The fabricated antennas were composed of stacked microstrip patches over a set of bowtie apertures in the ground plane that were perpendicular to one another. A dual offset microstrip feedline was used to feed the aperture. Two different layers were used for the microstrip feedline of each polarization. The resulting measured impedance bandwidth was even wider than predicted. The antenna pattern was measured at several frequencies over the antenna bandwidth and was found to have good gain, consistent antenna patterns and low cross polarization.

In this dissertation, particle swarm optimization (PSO) is utilized for fractal image compression (FIC) and active contour model (ACM). The dissertation is divided into two parts. The first part is concerned with the FIC and the second part with ACM. FIC is promising both theoretically and practically for image compression. However, since the encoding speed of the traditional full search method is very time-consuming, FIC with full search is unsuitable for real-time applications. In this dissertation, several novel PSO-based approaches incorporating the edge property of the image blocks are proposed to speedup the encoder and preserve the image quality. Instead of the full search, a direction map is built according to the edge type of the image blocks, which directs the particles in the swarm to regions consisting of candidates of higher similarity. Therefore, the searching space is reduced and the speedup can be achieved. Also, since the strategy is performed according to the edge property, better visual effect can be preserved. Experimental results show that the visual-based particle swarm optimization speeds up the encoder 125 times faster with only 0.89 dB decay of image quality in comparison to the full search method. The second part of the dissertation is concerned with the active contour model for automatic object boundary identification. In the traditional methods for ACM, each control point searches its new position in a small nearby window. Consequently, the boundary concavities cannot be searched accurately. Some improvements have been made in the past to enlarge the searching space, yet they are still time-consuming. To overcome these drawbacks, a novel multi-population PSO technique is adopted in this dissertation to enhance the concavity searching capability and reduce the search time but in a larger searching window. In the proposed scheme, to each control point in the contour there is a corresponding swarm of particles with the best swarm particle as the new control point. The proposed optimizer not only inherits the spirit of the original PSO in each swarm but also shares information of the surrounding swarms. Experimental results demonstrate that the proposed method can improve the search of object concavities without extra computation time.

The gradual changes in the world development have brought energy issues back into high profile. An ongoing challenge for countries around the world is to balance the development gains against its effects on the environment. The energy management is the key factor of any sustainable development program. All the aspects of development in agriculture, power generation, social welfare and industry in Iran are crucially related to the energy and its revenue. Forecasting end-use natural gas consumption is an important Factor for efficient system operation and a basis for planning decisions. In this thesis, particle swarm optimization (PSO) used to forecast long run natural gas consumption in Iran. Gas consumption data in Iran for the previous 34 years is used to predict the consumption for the coming years. Four linear and nonlinear models proposed and six factors such as Gross Domestic Product (GDP), Population, National Income (NI), Temperature, Consumer Price Index (CPI) and yearly Natural Gas (NG) demand investigated.

Morphing an aircraft wingtip can provide substantial performance improvement. Most civil transport aircraft are optimized for range but for other flight conditions such as take-off and climb they are used as constraints. These constraints could potentially reduce the performance of an aircraft at cruise. By altering the shape of the wingtip, we can force the load distribution to adapt to the required flight condition to improve performance. Using a Variable Geometry Truss Mechanism (VGTM) concept to morph the wingtip of an aircraft with a Multidisciplinary Design Optimization (MDO) framework, the current work will attempt to find an optimal wing and wingtip shape to minimize fuel consumption for multiple morphing stages during cruise. This optimization routine was conducted with a Particle Swarm Optimization (PSO) algorithm using different fidelity tools to analyze the aerodynamic and structural disciplines.

Morphing an aircraft wingtip can provide substantial performance improvement. Most civil transport aircraft are optimized for range but for other flight conditions such as take-off and climb they are used as constraints. These constraints could potentially reduce the performance of an aircraft at cruise. By altering the shape of the wingtip, we can force the load distribution to adapt to the required flight condition to improve performance. Using a Variable Geometry Truss Mechanism (VGTM) concept to morph the wingtip of an aircraft with a Multidisciplinary Design Optimization (MDO) framework, the current work will attempt to find an optimal wing and wingtip shape to minimize fuel consumption for multiple morphing stages during cruise. This optimization routine was conducted with a Particle Swarm Optimization (PSO) algorithm using different fidelity tools to analyze the aerodynamic and structural disciplines.

This thesis describes the development and experimental results of a system to explore cloning of facial expressions between dissimilar face models, so new faces can be animated using the animations from existing faces. The system described in this thesis uses fuzzy membership functions and subtractive clustering to represent faces and expressions in an intermediate space. This intermediate space allows expressions for face models with different resolutions to be compared. The algorithm is trained for each pair of faces using particle swarm optimization, which selects appropriate weights and radii to construct the intermediate space. These techniques allow the described system to be more flexible than previous systems, since it does not require prior knowledge of the underlying implementation of the face models to function.

In this thesis, a Particle Swarm Optimization (PSO) method combined with a ray propagation method is presented as a means to optimally locate multiple antennas in an indoor environment. This novel approach uses Particle Swarm Optimisation combined with geometric partitioning. The PSO algorithm uses swarm intelligence to determine the optimal transmitter location within the building layout. It uses the Keenan-Motley indoor propagation model to determine the fitness of a location. If a transmitter placed at that optimum location, transmitting a maximum power is not enough to meet the coverage requirements of the entire indoor space, then the space is geometrically partitioned and the PSO initiated again independently in each partition. The method outputs the number of antennas, their effective isotropic radiated power (EIRP) and physical location required to meet the coverage requirements. An example scenario is presented for a real building at Loughborough University and is compared against a conventional planning technique used widely in practice.