Automatic identification systems (AIS) provides massive ship trajectory data for maritime traffic management, route planning, and other research. In order to explore the valuable characteristics contained implicitly in AIS data, a clustering method based on resampling enhanced BIRCH (Balanced Iterative Reducing Clustering using Hierarchies) algorithm is proposed. The has been tested 764,393 poi...

background: this study was conducted to detect clusters of pulmonary tb cases in hamadan province, west of iran. methods: all patients with pulmonary tuberculosis recorded in the surveillance system from 2005 to 2013 were studied. the spatial scan statistic was used to detect significant clusters in status of unadjusted and adjusted for age, sex and location residence variables. results: cluste...

We consider the problem of reducing a potentially very large dataset to a subset of representative prototypes. Rather than searching over the entire space of prototypes, we first roughly divide the data into balanced clusters using bisecting k-means and spectral cuts, and then find the prototypes for each cluster by affinity propagation. We apply our algorithm to text data, where we perform an ...

The eecient usage of parallel computers and workstation clusters for biologically motivated simulations depends rst of all on a dynamic redistribution of the workload. For the development of a parallel algorithm for the Penna model of aging we have used a dynamic load balancing library , called PLB. It turns out that PLB manages a nearly balanced load situation during runtime taking only a low ...

We present a method for load balancing parallel sorting on heterogeneous networks of workstations and clusters. Load balancing is achieved by exploiting information about the available throughput of the processors. First, the problem is partitioned into subproblems such that the times taken by the processors to solve the subproblems are balanced. Determining the partition involves solving a non...

A unique delayed self-inhibitory pathway mediated by layer 5 Martinotti Cells was studied in a biologically inspired neural network simulation. Inclusion of this pathway along with layer 5 basket cell lateral inhibition caused balanced competitive learning, which led to the formation of neuronal clusters as were indeed reported in the same region. Martinotti pathway proves to act as a learning ...

Cluster computing is becoming an accepted form of supercomputing in the academe, government and industries around the world. The Ateneo High Performance Computing Group (AHPCG) proposes a design for building a 192processor cluster using a symmetric and flat networking neighborhood. A routing schema will also be developed to maximize this network topology. This design aims to demonstrate this ne...

The transductive SVM is a semi-supervised learning algorithm that searches for a large margin hyperplane in feature space. By withholding the training labels and adding a constraint that favors balanced clusters, it can be turned into a clustering algorithm. The Normalized Cuts clustering algorithm of Shi and Malik, although originally presented as spectral relaxation of a graph cut problem, ca...

We apply statistical physics to study the task of resource allocation in random sparse networks with limited bandwidths for the transportation of resources along the links. Recursive relations from the Bethe approximation are converted into useful algorithms. Bottlenecks emerge when the bandwidths are small, causing an increase in the fraction of idle links. For a given total bandwidth per node...

We prove a geometric version of the graph separator theorem for the unit disk intersection graph: for any set of n unit disks in the plane there exists a line ` such that ` intersects at most O( √ (m+ n) logn) disks and each of the halfplanes determined by ` contains at most 2n/3 unit disks from the set, where m is the number of intersecting pairs of disks. We also show that an axis-parallel li...