Adaptation neighborhoods of self-organizing maps for image restoration are presented in this study. Generally, self-organizing maps have been studied for the ordering process and the convergence phase of weight vectors. As a new approach of self-organizing maps, some methods of adaptation neighborhoods for image restoration are proposed. The present algorithm creates a map containing one unit f...

Topological spaces can be induced by various algebraic ordering relations such as, linear, partial and the inclusion-ordering of open sets forming chains chain complexes. In general, classifications covering are made using fundamental groups lifting. However, Riesz ordered n-spaces Urysohn interpretations real-valued continuous functions as provide new perspectives. This paper proposes formulat...

optimizing the database queries is one of hard research problems. exhaustive search techniques like dynamic programming is suitable for queries with a few relations, but by increasing the number of relations in query, much use of memory and processing is needed, and the use of these methods is not suitable, so we have to use random and evolutionary methods. the use of evolutionary methods, beca...

Many algorithms for processing probabilistic networks are dependent on the topological properties of the problem's structure. Such algorithms (e.g., clustering, conditioning) are e ective only if the problem has a sparse graph captured by parameters such as tree width and cycle-cutset size. In this paper we initiate a study to determine the potential of structure-based algorithms in real-life a...

The influence of a stationary shear flow on the crystallization in a glassy system is studied by means of molecular dynamics simulations and subsequent cluster analysis. The results reveal two opposite effects of the shear flow on the processes of topological ordering in the system. Shear promotes the formation of separated crystallites and suppresses the appearance of the large clusters. The s...

A theorem of Håstad shows that for every constraint satisfaction problem (CSP) over a fixed size domain, instances where each variable appears in at most O(1) constraints admit a non-trivial approximation algorithm, in the sense that one can beat (by an additive constant) the approximation ratio achieved by the naive algorithm that simply picks a random assignment. We consider the analogous que...

Given a multidimensional data set, a skyline query returns the interesting points that are not dominated by other points. The actual cardinality (s) of a skyline query result may vary substantially from the desired result cardinality (k). An approach called skyline ordering is used that forms a skyline based partitioning of a given data set, it provides an ordering among the partitions. The con...

Texture formation in a binary mixture of a flexible polymer and a liquid crystal has been studied using a nonlocal kinetic model for phase separation in the presence of liquid crystalline order. The model takes into account couplings between phase separation, phase ordering, and texture formation. The phase separation-phase ordering coupling leads to orientation normal to local concentration gr...

Decomposition ordering is a well-founded monotonic ordering on terms. Because it has the subterm and the deletion properties, decomposition ordering is useful to prove termination of rewriting systems. An algorithm comparing two terms is given.

We propose a linear time recognition algorithm for proper interval graphs. The algorithm is based on certain ordering of vertices, called bicompatible elimination ordering (BCO). Given a BCO of a biconnected proper interval graph G, we also propose a linear time algorithm to construct a Hamiltonian cycle of G.