The Fuzzy Adaptive Neighborhood Search (FANS) method was previously presented and succesfully compared against a genetic algorithm and simulated annealing doing minimization of functions in Rn. Here we propose to evaluate FANS on instances of knapsack with multiple restrictions problems, making comparison against the cited algorithms in order to gain knowledge about the behaviour of our method.

Using a D0-brane as a probe, we study the spacetime geometry in the neighborhood of N D-branes in matrix theory. We find that due to fermionic zero modes, the coordinates of the probe in the transverse directions are noncommutative, and the angular part is a fuzzy sphere.

A theory of granular computing is presented. Some classical example are examined to obtain the hint of new directions Obvious examples are dynamic programming, fuzzy numbers, infinitesimal number and access control model, (pre)topological spaces are examined; Localized multi-level granulation can be modeled by generalized topological spaces, called neighborhood systems. For most general granula...

A new feature description method based on the fusion of fast retina keypoint (FREAK) and rotation-aware binary robust independent elementary features (rRBRIEF) is proposed to realize effective combination efficiency accuracy two descriptions. In addition, in elimination stage mismatched point pairs, by setting base its neighborhood, an improved neighborhood parallel random sample consensus (RAN...

based on a complete heyting algebra, we modify the definition oflattice-valued fuzzifying convergence space using fuzzy inclusionorder and construct in this way a cartesian-closed category, calledthe category of $l-$ordered fuzzifying convergence spaces, in whichthe category of $l-$fuzzifying topological spaces can be embedded.in addition, two new categories are introduced, which are called the...

We describe here a sensibility analysis to help tune the parameters of an ant colony model where ants leave a fuzzy trace of pheromone to mark their track and its neighborhood. We test it with different parameters on classical numeric and symbolic problems.

This paper proposes an image analysis system to segment multiple sclerosis lesions of magnetic resonance (MR) brain volumes consisting of 3 mm thick slices using three channels (images showing T1-, T2and PD -weighted contrast). The method uses the statistical model of Markov Random Fields (MRF) both at low and high levels. The neighborhood system used in this MRF is defined in three types: (1) ...

However, in general, the parameters of density-based clustering algorithms are usually difficult to select. So, in order to make the density-based clustering algorithms more robust, the extension with fuzzy set theory has attracted a lot of attentions recently. The fuzzy neighborhood DBSCAN (FNDBSCAN) is a typical one with this idea. But FN-DBSCAN usually requires a time complexity of O(n2) whe...

Based on the observation that rough sets and mathematical morphology are both using dual operators sharing similar properties, we investigate more closely the links existing between both the domains. We establish the equivalence between some morphological operators and rough sets de"ned from either a relation, or a pair of dual operators or a neighborhood system. Then we suggest some extensions...

Regional co-location patterns represent subsets of object types that are located together in space (i.e. region). Discovering regional spatial co-location patterns is an important problem with many application domains. There are different methods in this field but they encounter a big problem: finding a unique optimum neighborhood radius or finding an optimum k value for nearest neighbor featur...