Abstract: Fine-grained data replication over the Internet allows duplication of frequently accessed data objects, as opposed to entire sites, to certain locations so as to improve the performance of largescale content distribution systems. In a distributed system, agents representing their sites try to maximize their own benefit since they are driven by different goals such as to minimize their communication costs, latency, etc. In this paper, we will use game theoretical techniques and in particular auctions to identify a bidding mechanism that encapsulates the selfishness of the agents, while having a controlling hand over them. In essence, the proposed game theory based mechanism is the study of what happens when independent agents act selfishly and how to control them to maximize the overall performance. A bidding mechanism asks how one can design systems so that agents- selfish behavior results in the desired system-wide goals. Experimental results reveal that this mechanism provides excellent solution quality, while maintaining fast execution time. The comparisons are recorded against some well known techniques such as greedy, branch and bound, game theoretical auctions and genetic algorithms.
Abstract: Automated discovery of hierarchical structures in
large data sets has been an active research area in the recent past.
This paper focuses on the issue of mining generalized rules with crisp
hierarchical structure using Genetic Programming (GP) approach to
knowledge discovery. The post-processing scheme presented in this
work uses flat rules as initial individuals of GP and discovers
hierarchical structure. Suitable genetic operators are proposed for the
suggested encoding. Based on the Subsumption Matrix(SM), an
appropriate fitness function is suggested. Finally, Hierarchical
Production Rules (HPRs) are generated from the discovered
hierarchy. Experimental results are presented to demonstrate the
performance of the proposed algorithm.
Abstract: Nowadays, biometrical characterizations of Artemia
cysts are used as one of the most important factors in the study of
Artemia populations and intraspecific particularity; meanwhile these
characters can be used as economical indices. For example, typically
high hatching efficiency is possible due to the small diameter of
cysts (high number per gram); therefore small diameter of cysts
show someway high quality of cysts. This study was performed
during a ten year period, including two different ecological
conditions: rainy and drought. It is important from two different
aspects because it covers alteration of A. urmiana during ten years
also its variation in the best and worst environmental situations in
which salinity increased from 173.8 ppt in 1994 to 280.8 ppt in
2003/4. In this study the biometrical raw data of Artemia urmiana
cysts at seven stations from the Urmia Lake in 1994 and their seven
identical locations at 26 studied stations in 2003/4 were reanalyzed
again and compared together. Biometrical comparison of untreated
and decapsulated cysts in each of the seven similar stations showed a
highly significant variation between 1994 and 2003/4. Based on this
study, in whole stations the untreated and decapsulated cysts from
1994 were larger than cysts of 2003/4 without any exception. But
there was no logical relationship between salinity and chorion
thickness in the Urmia Lake. With regard to PCA analyses the
stations of two different studied years certainly have been separated
with factor 1 from each other. In conclusion, the interaction between
genetic and environmental factors can determine and explain
variation in the range of cysts diameter in Artemia.
Abstract: Project managers are the ultimate responsible for the
overall characteristics of a project, i.e. they should deliver the project
on time with minimum cost and with maximum quality. It is vital for
any manager to decide a trade-off between these conflicting
objectives and they will be benefited of any scientific decision
support tool. Our work will try to determine optimal solutions (rather
than a single optimal solution) from which the project manager will
select his desirable choice to run the project. In this paper, the
problem in project scheduling notated as
(1,T|cpm,disc,mu|curve:quality,time,cost) will be studied. The
problem is multi-objective and the purpose is finding the Pareto
optimal front of time, cost and quality of a project
(curve:quality,time,cost), whose activities belong to a start to finish
activity relationship network (cpm) and they can be done in different
possible modes (mu) which are non-continuous or discrete (disc), and
each mode has a different cost, time and quality . The project is
constrained to a non-renewable resource i.e. money (1,T). Because
the problem is NP-Hard, to solve the problem, a meta-heuristic is
developed based on a version of genetic algorithm specially adapted
to solve multi-objective problems namely FastPGA. A sample project
with 30 activities is generated and then solved by the proposed
method.
Abstract: A computational platform is presented in this
contribution. It has been designed as a virtual laboratory to be used
for exploring optimization algorithms in biological problems. This
platform is built on a blackboard-based agent architecture. As a test
case, the version of the platform presented here is devoted to the
study of protein folding, initially with a bead-like description of the
chain and with the widely used model of hydrophobic and polar
residues (HP model). Some details of the platform design are
presented along with its capabilities and also are revised some
explorations of the protein folding problems with different types of
discrete space. It is also shown the capability of the platform to
incorporate specific tools for the structural analysis of the runs in
order to understand and improve the optimization process.
Accordingly, the results obtained demonstrate that the ensemble of
computational tools into a single platform is worthwhile by itself,
since experiments developed on it can be designed to fulfill different
levels of information in a self-consistent fashion. By now, it is being
explored how an experiment design can be useful to create a
computational agent to be included within the platform. These
inclusions of designed agents –or software pieces– are useful for the
better accomplishment of the tasks to be developed by the platform.
Clearly, while the number of agents increases the new version of the
virtual laboratory thus enhances in robustness and functionality.
Abstract: In this contribution, the use of a new genetic operator is proposed. The main advantage of using this operator is that it is able to assist the evolution procedure to converge faster towards the optimal solution of a problem. This new genetic operator is called ''intuition'' operator. Generally speaking, one can claim that this operator is a way to include any heuristic or any other local knowledge, concerning the problem, that cannot be embedded in the fitness function. Simulation results show that the use of this operator increases significantly the performance of the classic Genetic Algorithm by increasing the convergence speed of its population.
Abstract: Topology Optimization is a defined as the method of
determining optimal distribution of material for the assumed design
space with functionality, loads and boundary conditions [1].
Topology optimization can be used to optimize shape for the
purposes of weight reduction, minimizing material requirements or
selecting cost effective materials [2]. Topology optimization has been
implemented through the use of finite element methods for the
analysis, and optimization techniques based on the method of moving
asymptotes, genetic algorithms, optimality criteria method, level sets
and topological derivatives. Case study of Typical “Fuselage design"
is considered for this paper to explain the benefits of Topology
Optimization in the design cycle. A cylindrical shell is assumed as
the design space and aerospace standard pay loads were applied on
the fuselage with wing attachments as constraints. Then topological
optimization is done using Finite Element (FE) based software. This
optimization results in the structural concept design which satisfies
all the design constraints using minimum material.
Abstract: In this paper we present, propose and examine
additional membership functions for the Smoothing Transition
Autoregressive (STAR) models. More specifically, we present the
tangent hyperbolic, Gaussian and Generalized bell functions.
Because Smoothing Transition Autoregressive (STAR) models
follow fuzzy logic approach, more fuzzy membership functions
should be tested. Furthermore, fuzzy rules can be incorporated or
other training or computational methods can be applied as the error
backpropagation or genetic algorithm instead to nonlinear squares.
We examine two macroeconomic variables of US economy, the
inflation rate and the 6-monthly treasury bills interest rates.
Abstract: This paper proposes a new methodology for the
optimal allocation and sizing of Embedded Generation (EG)
employing Real Coded Genetic Algorithm (RCGA) to minimize the
total power losses and to improve voltage profiles in the radial
distribution networks. RCGA is a method that uses continuous
floating numbers as representation which is different from
conventional binary numbers. The RCGA is used as solution tool,
which can determine the optimal location and size of EG in radial
system simultaneously. This method is developed in MATLAB. The
effect of EG units- installation and their sizing to the distribution
networks are demonstrated using 24 bus system.
Abstract: To evaluate genetic variation of wheat (Triticum aestivum) affected by heat and drought stress on eight Australian wheat genotypes that are parents of Doubled Haploid (HD) mapping populations at the vegetative stage, the water stress experiment was conducted at 65% field capacity in growth room. Heat stress experiment was conducted in the research field under irrigation over summer. Result show that water stress decreased dry shoot weight and RWC but increased osmolarity and means of Fv/Fm values in all varieties except for Krichauff. Krichauff and Kukri had the maximum RWC under drought stress. Trident variety was shown maximum WUE, osmolarity (610 mM/Kg), dry mater, quantum yield and Fv/Fm 0.815 under water stress condition. However, the recovery of quantum yield was apparent between 4 to 7 days after stress in all varieties. Nevertheless, increase in water stress after that lead to strong decrease in quantum yield. There was a genetic variation for leaf pigments content among varieties under heat stress. Heat stress decreased significantly the total chlorophyll content that measured by SPAD. Krichauff had maximum value of Anthocyanin content (2.978 A/g FW), chlorophyll a+b (2.001 mg/g FW) and chlorophyll a (1.502 mg/g FW). Maximum value of chlorophyll b (0.515 mg/g FW) and Carotenoids (0.234 mg/g FW) content belonged to Kukri. The quantum yield of all varieties decreased significantly, when the weather temperature increased from 28 ÔùªC to 36 ÔùªC during the 6 days. However, the recovery of quantum yield was apparent after 8th day in all varieties. The maximum decrease and recovery in quantum yield was observed in Krichauff. Drought and heat tolerant and moderately tolerant wheat genotypes were included Trident, Krichauff, Kukri and RAC875. Molineux, Berkut and Excalibur were clustered into most sensitive and moderately sensitive genotypes. Finally, the results show that there was a significantly genetic variation among the eight varieties that were studied under heat and water stress.
Abstract: This paper presents a systematic approach for the
design of power system stabilizer using genetic algorithm and
investigates the robustness of the GA based PSS. The proposed
approach employs GA search for optimal setting of PSS parameters.
The performance of the proposed GPSS under small and large
disturbances, loading conditions and system parameters is tested.
The eigenvalue analysis and nonlinear simulation results show the
effectiveness of the GPSS to damp out the system oscillations. It is
found tat the dynamic performance with the GPSS shows improved
results, over conventionally tuned PSS over a wide range of
operating conditions.
Abstract: This paper presents the results of enhancing images from a left and right stereo pair in order to increase the resolution of a 3D representation of a scene generated from that same pair. A new neural network structure known as a Self Delaying Dynamic Network (SDN) has been used to perform the enhancement. The advantage of SDNs over existing techniques such as bicubic interpolation is their ability to cope with motion and noise effects. SDNs are used to generate two high resolution images, one based on frames taken from the left view of the subject, and one based on the frames from the right. This new high resolution stereo pair is then processed by a disparity map generator. The disparity map generated is compared to two other disparity maps generated from the same scene. The first is a map generated from an original high resolution stereo pair and the second is a map generated using a stereo pair which has been enhanced using bicubic interpolation. The maps generated using the SDN enhanced pairs match more closely the target maps. The addition of extra noise into the input images is less problematic for the SDN system which is still able to out perform bicubic interpolation.
Abstract: In this paper, a pipelined version of genetic algorithm,
called PLGA, and a corresponding hardware platform are described.
The basic operations of conventional GA (CGA) are made pipelined
using an appropriate selection scheme. The selection operator, used
here, is stochastic in nature and is called SA-selection. This helps
maintaining the basic generational nature of the proposed pipelined
GA (PLGA). A number of benchmark problems are used to compare
the performances of conventional roulette-wheel selection and the
SA-selection. These include unimodal and multimodal functions with
dimensionality varying from very small to very large. It is seen that
the SA-selection scheme is giving comparable performances with
respect to the classical roulette-wheel selection scheme, for all the
instances, when quality of solutions and rate of convergence are considered.
The speedups obtained by PLGA for different benchmarks
are found to be significant. It is shown that a complete hardware
pipeline can be developed using the proposed scheme, if parallel
evaluation of the fitness expression is possible. In this connection
a low-cost but very fast hardware evaluation unit is described.
Results of simulation experiments show that in a pipelined hardware
environment, PLGA will be much faster than CGA. In terms of
efficiency, PLGA is found to outperform parallel GA (PGA) also.
Abstract: This paper presents a genetic algorithm based
approach for solving security constrained optimal power flow
problem (SCOPF) including FACTS devices. The optimal location of
FACTS devices are identified using an index called overload index
and the optimal values are obtained using an enhanced genetic
algorithm. The optimal allocation by the proposed method optimizes
the investment, taking into account its effects on security in terms of
the alleviation of line overloads. The proposed approach has been
tested on IEEE-30 bus system to show the effectiveness of the
proposed algorithm for solving the SCOPF problem.
Abstract: In this paper, we propose a morphing method by which face color images can be freely transformed. The main focus of this work is the transformation of one face image to another. This method is fully automatic in that it can morph two face images by automatically detecting all the control points necessary to perform the morph. A face detection neural network, edge detection and medium filters are employed to detect the face position and features. Five control points, for both the source and target images, are then extracted based on the facial features. Triangulation method is then used to match and warp the source image to the target image using the control points. Finally color interpolation is done using a color Gaussian model that calculates the color for each particular frame depending on the number of frames used. A real coded Genetic algorithm is used in both the image warping and color blending steps to assist in step size decisions and speed up the morphing. This method results in ''very smooth'' morphs and is fast to process.
Abstract: This is a genetic comparison study of Arabian Oryx
(Oryx leucoryx) population at two different locations (A &B) based
on nuclear microsatellite DNA markers. Arabian Oryx is listed as
vulnerable and endanger by the World Conservation Union (IUCN).
Thirty microsatellite markers from bovine family were applied to
investigate the genetic diversity of the Arabian Oryx and to set up a
molecular inventory. Among 30 microsatellite markers used, 13
markers were moderately polymorphic. Arabian Oryx at location A
has shown better gene diversity over location B. However, mean
number of alleles were less than location B. Data of within
population inbreeding coefficient indicates inbreeding at both
locations (A&B). Based on the analysis of polymorphic microsatellite
markers, the study revealed that Arabian Oryx need a genetically
designed breeding program.
Abstract: Set covering problem is a classical problem in
computer science and complexity theory. It has many applications,
such as airline crew scheduling problem, facilities location problem,
vehicle routing, assignment problem, etc. In this paper, three
different techniques are applied to solve set covering problem.
Firstly, a mathematical model of set covering problem is introduced
and solved by using optimization solver, LINGO. Secondly, the
Genetic Algorithm Toolbox available in MATLAB is used to solve
set covering problem. And lastly, an ant colony optimization method
is programmed in MATLAB programming language. Results
obtained from these methods are presented in tables. In order to
assess the performance of the techniques used in this project, the
benchmark problems available in open literature are used.
Abstract: In this paper, the optimum weight and cost of a laminated composite plate is seeked, while it undergoes the heaviest load prior to a complete failure. Various failure criteria are defined for such structures in the literature. In this work, the Tsai-Hill theory is used as the failure criterion. The theory of analysis was based on the Classical Lamination Theory (CLT). A newly type of Genetic Algorithm (GA) as an optimization technique with a direct use of real variables was employed. Yet, since the optimization via GAs is a long process, and the major time is consumed through the analysis, Radial Basis Function Neural Networks (RBFNN) was employed in predicting the output from the analysis. Thus, the process of optimization will be carried out through a hybrid neuro-GA environment, and the procedure will be carried out until a predicted optimum solution is achieved.
Abstract: This paper describes a practical approach to design
and develop a hybrid learning with acceleration feedback control
(HLC) scheme for input tracking and end-point vibration suppression
of flexible manipulator systems. Initially, a collocated proportionalderivative
(PD) control scheme using hub-angle and hub-velocity
feedback is developed for control of rigid-body motion of the system.
This is then extended to incorporate a further hybrid control scheme
of the collocated PD control and iterative learning control with
acceleration feedback using genetic algorithms (GAs) to optimize the
learning parameters. Experimental results of the response of the
manipulator with the control schemes are presented in the time and
frequency domains. The performance of the HLC is assessed in terms
of input tracking, level of vibration reduction at resonance modes and
robustness with various payloads.
Abstract: Travelling salesman problem (TSP) is a combinational
optimization problem and solution approaches have been applied
many real world problems. Pure TSP assumes the cities to visit are
fixed in time and thus solutions are created to find shortest path
according to these point. But some of the points are canceled to visit
in time. If the problem is not time crucial it is not important to
determine new routing plan but if the points are changing rapidly and
time is necessary do decide a new route plan a new approach should
be applied in such cases. We developed a route plan transfer method
based on transfer learning and we achieved high performance against
determining a new model from scratch in every change.