Traditionally, in IEEE 802.15.4 wireless sensor networks (WSN), cluster trees are constructed by connecting cluster heads. Though this way may reduce the number of routers, excess clusters may cause extra data transmission delay and will reduce the collection efficiency of sensing data. In this paper, we proposed a method that can effectively reduce the data transmission delay by minimizing the...

This paper presents a new clustering technique named as the Olary algorithm, which is suitable to cluster nominal data sets. This algorithm uses a new code with the name of the Olary code to transform nominal attributes into integer ones through a process named as the Olary transformation. The number of integer attributes we get through the Olary transformation is usually different from that of...

The concepts of a dissolution point (which is an adaptation of the breakdown point concept to cluster analysis) and isolation robustness are introduced for general clustering methods, generating possibly overlapping clusterings. Robustness theorems for fixed point clusters (Hennig (2002, 2003, 2005)) are shown.

During the last decade, the advance of Internet has enabled the emergence of previously nonexistent type of human social structures virtual 'online' communities. As compared to the traditional communities, online communities are distinguished by the drastic reduction of the requirement for the physical proximity and geographical clustering of their members. The primary cause of this shift away ...

In this work we study the Θ+(1540) in the framework of QCD sum rules based on (ud)2s̄ diquark clustering as suggested by Jaffe and Wilczek. Within errors, the mass of the pentaquark is compatible with the experimentally measured value. The mass difference between the Θ+ and the pentaquark with the quantum numbers of the nucleon amounts to 70 MeV, consistent with the interpretation of the N(1440)...

Comprising 34 groundnut genotypes an experiment was conducted in a randomized block design with three replication at the Research farm of Regional Agricultural Research Station, BARI, Hathazari, Chittagong during Rabi season (December 2009 to April 2010) for estimation of the multivariate analysis of divergence. The genotypes were grouped into five clusters. Cluster III contained the highest nu...

Based on the observation that most of the orphan clusters are generated from boundary nodes, we propose a Boundary-First Cluster-Minimized (BFCM) clustering algorithm to minimize the number of generated orphan cluster by boundary node. The proposed algorithm is compared to the well known IDbased and Degree-based algorithms. The simulation results show that with the same message and time complex...

Vector Quantization (VQ) plays important role in codebook generation such that the distortion between the original image and the reconstructed image is the minimum. In this paper we present an effective clustering algorithm to generate codebook for vector quantization. In existing algorithm KEVR while splitting the cluster every time new orientation is introduced using error vector sequence. Th...