in this paper, an unsupervised classification method using spatial contextual information for polarimetric sar (polsar) image classification is proposed. first, an unsupervised classification based on 2d h/▁α plane was performed, using cloude/pottier target decomposition algorithm. in order to compute the initial values of the cluster centers and hence a rapid convergence of the algorithm, the ...

Given a set  of  points in the plane and a constant ,-center problem is to find two closed disks which each covers the whole , the diameter of the bigger one is minimized, and the distance of the two centers is at least . Constrained -center problem is the -center problem in which the centers are forced to lie on a given line . In this paper, we first introduce -center problem and its constrain...

 This paper present unequal-sized facilities layout solutions generated by a genetic search program named LADEGA (Layout Design using a Genetic Algorithm). The generalized quadratic assignment problem requiring pre-determined distance and material flow matrices as the input data and the continuous plane model employing a dynamic distance measure and a material flow matrix are discussed. Computa...

The paper deals with devising the combination of fuzzy inference systems (FIS) and neural networks called the adaptive network fuzzy inference system (ANFIS) to determine the forming limit diagram (FLD). In this paper, FLDs are determined experimentally for two grades of low carbon steel sheets using out-of-plane (dome) formability test. The effect of different parameters such as work hardening...

We introduce discrete time Markov chains that preserve uniform measures on boxed plane partitions. Elementary Markov steps change the size of the box from a × b × c to (a − 1)× (b + 1)× c or (a + 1)× (b − 1)× c. Algorithmic realization of each step involves O((a+ b)c) operations. One application is an efficient perfect random sampling algorithm for uniformly distributed boxed plane partitions. ...