Finding point correspondences plays an important role in automatically building statistical shape models from a training set of 3D surfaces. For the point correspondence problem, Davies et al. [1] proposed a minimum-description-length-based objective function to balance the training errors and generalization ability. A recent evaluation study [2] that compares several well-known 3D point corres...

Inductive inference techniques are showing signs of maturity as applications with real-world data are emerging. Techniques that allow symbolic representation of the acquired knowledge allow for its validation, revision and understanding by human experts. EFOPREL v 1.1(Evolutionary First Order PREdicate Logic) is an inductive and supervised learning system of rst order predicate logic rules usin...

Previous work applying genetic algorithms to solve the school timetabling problem have generally used a direct representation, in which each chromosome represents a timetable directly. This study proposes and evaluates a genetic algorithm employing an indirect chromosome representation. Each chromosome is a string comprised of instructions which are used to build a timetable. The fitness of eac...

Over the past few decades great efforts were made to solve uncertain hybrid optimization problems. The n-Queen problem is one of such problems that many solutions have been proposed for. The traditional methods to solve this problem are exponential in terms of runtime and are not acceptable in terms of space and memory complexity. In this study, parallel genetic algorithms are proposed to solve...

Background and Aims: Azoospermia factor (AZF) region of the Y-chromosome has several genes which are responsible for normal spermatogenesis. Microdeletions of these genes are associated with azoospermia and oligospermia. These microdeletions are too small to be detected by karyotyping. They can be easily identified using polymerase chain reaction. The aim of this study is to determine the frequ...

The traditional evolutionary algorithms dividing the complex networks community have some inevitable deficiencies such as low searching accuracy, high computing time complexity, local optimal solution and so on. To address this issue, this paper proposes a novel community structure partition algorithm based on multi-gene families (MGF). First, this algorithm respectively encodes the network ent...

In this paper, effect of the islands number variation in restoration process is investigated and a graph based method for determination of optimum islands boundaries is presented. Also, the effect of number and location of black-start units on the restoration process is evaluated. In optimization process, objective function is minimizing Energy Not Supplied (ENS) and constraints are voltage mar...

Understanding the evolution of a complex genetic algorithm is a non-trivial problem, however, genetic-algorithm visualization is in its infancy. This paper reviews some of the current approaches and presents a new visualization approach based on Sammon mapping. Sammon mapping is a nonlinear mapping of a set of vectors in pdimensional space to a set in r-dimensional space, where r < p. The mappi...

Meiosis is a special type of cell division that produces haploid gametes from diploid parental cells. Chromosome number is reduced during meiosis because a single round of DNA replication is followed by two rounds of chromosome segregation (Fig. 1). Fusion of two gametes during sexual reproduction restores the diploid chromosome complement. The second division of meiosis (the equational divisio...

Clustering is a division of data into groups of similar objects. Each group, called cluster, consists of objects that are similar between themselves and dissimilar to objects of other groups. The clustering algorithm attempts to find natural groups of components, based on some similarity. Traditional clustering algorithms will search only a small sub-set of all possible clustering and consequen...