XML file comparison and clustering are two challenging tasks still accomplished predominantly manually. XML schema contains information about data structure, types, and labels found in an XML file. By reducing the XML schema tree to its significant nodes the task of finding structural equivalent schemas, and implicit XML files that refer to the same entities, is simplified.

The aim of this paper is a reduction algorithm for a basis b1, b2, b3 of a 3-dimensional lattice in R n for fixed n ≥ 3. We give a definition of the reduced basis which is equivalent to that of the Minkowski reduced basis of a 3-dimensional lattice. We prove that for b1, b2, b3 ∈ Z, n ≥ 3 and |b1|, |b2|, |b3| ≤ M , our algorithm takes O(log M) binary operations, without using fast integer arith...

Finding an efficient data reduction method for largescale problems is an imperative task. In this paper, we propose a similarity-based self-constructing fuzzy clustering algorithm to do the sampling of instances for the classification task. Instances that are similar to each other are grouped into the same cluster. When all the instances have been fed in, a number of clusters are formed automat...

Understanding a linguistic theory within OT requires an exact characterization of the ranking conditions necessitated by data. These conditions determine the formal shape of the grammar while providing the crucial link between the data and its interpretation. We introduce an algorithm (‘Fusional Reduction’, FRed) which calculates the necessary and sufficient ranking conditions inherent in any c...

In this paper, we present a new parallel block-reduction algorithm for reducing lattice bases which allows the use of an arbitrarily chosen block-size between two and n where n denotes the dimension of the lattice. Thus, we are building a hierarchy of parallel lattice basis reduction algorithms between the known parallel all-swap algorithm which is a parallelization for block-size two and the r...

The PageRank is used by search engines to reflect the popularity and importance of a page based on its reference ranking. Since the web changes very fast, the PageRank has to be regularly updated. Such updates is an challenging task due to the huge size of the World Wide Web. Consequently, the analysis of the PageRank has become a hot topic with vast literature ranging from the original paper b...

Today power consumption is considered to be one of the important issues. Therefore, its reduction plays a considerable role in developing systems. Previous studies have shown that approximately 50% of total power consumption is used in cache memories. There is a direct relationship between power consumption and replacement quantity made in cache. The less the number of replacements is, the less...

Assigning facilities to locations is one of the important problems, which significantly is influence in transportation cost reduction. In this study, we solve quadratic assignment problem (QAP), using a meta-heuristic algorithm with deterministic tasks and equality in facilities and location number. It should be noted that any facility must be assign to only one location. In this paper, first o...

We propose a new dimensionality reduction method, the elastic embedding (EE), that optimises an intuitive, nonlinear objective function of the low-dimensional coordinates of the data. The method reveals a fundamental relation betwen a spectral method, Laplacian eigenmaps, and a nonlinear method, stochastic neighbour embedding; and shows that EE can be seen as learning both the coordinates and t...

Advancements in technology have led to the development of various services. This in turn has led to the user being connected anywhere and everywhere. Necessity has come for the services to be integrated and used. When a single service cannot provide the necessary signal strength, probability is provided for the user to switch over to a service that has better signal strength. This process is ca...