Scalability of efficient parallel K-Means

Clustering is defined as the grouping of similar items in a set, and is an important process within the field of data mining. As the amount of data for various applications continues to increase, in terms of its size and dimensionality, it is necessary to have efficient clustering methods. A popular clustering algorithm is K-Means, which adopts a greedy approach to produce a set of K-clusters with associated centres of mass, and uses a squared error distortion measure to determine convergence. Methods for improving the efficiency of K-Means have been largely explored in two main directions. The amount of computation can be significantly reduced by adopting a more efficient data structure, notably a multi-dimensional binary search tree (KD-Tree) to store either centroids or data points. A second direction is parallel processing, where data and computation loads are distributed over many processing nodes. However, little work has been done to provide a parallel formulation of the efficient sequential techniques based on KD-Trees. Such approaches are expected to have an irregular distribution of computation load and can suffer from load imbalance. This issue has so far limited the adoption of these efficient K-Means techniques in parallel computational environments. In this work, we provide a parallel formulation for the KD-Tree based K-Means algorithm and address its load balancing issues.

Tree Inscriptions: restoring a lost facet of the Graeco-Roman epigraphic habit

This article for the first time considers all extant ancient evidence for the habit of carving inscriptions on tree trunks. It emerges a picture that bears remarkable resemblances to what is known from the habit of graffiti writing (with important addition to that latter field to be derived from the findings), for individual and technical texts.

Efficient tree construction for the multicast problem

A new heuristic for the Steiner Minimal Tree problem is presented here. The method described is based on the detection of particular sets of nodes in networks, the “Hot Spot” sets, which are used to obtain better approximations of the optimal solutions. An algorithm is also proposed which is capable of improving the solutions obtained by classical heuristics, by means of a stirring process of the nodes in solution trees. Classical heuristics and an enumerative method are used CIS comparison terms in the experimental analysis which demonstrates the goodness of the heuristic discussed in this paper.

Efficient tree construction for the multicast problem

A new heuristic for the Steiner minimal tree problem is presented. The method described is based on the detection of particular sets of nodes in networks, the “hot spot” sets, which are used to obtain better approximations of the optimal solutions. An algorithm is also proposed which is capable of improving the solutions obtained by classical heuristics, by means of a stirring process of the nodes in solution trees. Classical heuristics and an enumerative method are used as comparison terms in the experimental analysis which demonstrates the capability of the heuristic discussed

Efficient mining of discriminative molecular fragments

Frequent pattern discovery in structured data is receiving an increasing attention in many application areas of sciences. However, the computational complexity and the large amount of data to be explored often make the sequential algorithms unsuitable. In this context high performance distributed computing becomes a very interesting and promising approach. In this paper we present a parallel formulation of the frequent subgraph mining problem to discover interesting patterns in molecular compounds. The application is characterized by a highly irregular tree-structured computation. No estimation is available for task workloads, which show a power-law distribution in a wide range. The proposed approach allows dynamic resource aggregation and provides fault and latency tolerance. These features make the distributed application suitable for multi-domain heterogeneous environments, such as computational Grids. The distributed application has been evaluated on the well known National Cancer Institute’s HIV-screening dataset.

Comparative analysis by protocol and key of seed storage behaviour of sixty Vietnamese tree species

Seed storage behaviour of 5 1 native and 9 introduced tree species in Vietnam was investigated using a brief protocol developed to aid biodiversity conservation in circumstances where little is known about the seeds. Of the 60 species, 34 appeared to show orthodox (Acacia auriculaeformis, Adenanthera pavonina, Afzelia xylocarpa, Bauhinia purpurea, Callistemon lanceolatus, Cananga odorata, Canarium nigrum, Cassia fistula, Cassia javanica, Cassia splendida, Chukrasia tabularis, Dalbergia bariaensis, Dialium cochinchinensis, Diospyros mollis, Diospyros mun, Dracuntomelon duperreanum, Erythrophleum fordii, Khaya senegalensis, Lagerstroemia speciosa, Leucaena leucocephala, Livistona cochinchinensis, Markhamia stipulata, Melaleuca cajuputi, Millettia ichthyotona, Peltophorum pterocarpum, Peltophorum tonkinensis, Pinus khasya, Pinus massoniana, Pinus merkusii, Pterocarpus macrocarpus, Sindora siamensis, Sophora tonkinense, Sterculia foetida, Swietenia macrophylla), 13 recalcitrant (Avicennia alba, Beilschmiedia roxburghiana, Caryota mitis, Dimocarpus sp., Diospyros malabarica, Dipterocarpus chartaceus, Dypsis pinnatifrons, Hopea odorata, Lithocarpus gigantophylla, Machilus odoratissimus, Melanorrhoea laccifera, Melanorrhea usitata, Syzygium cinereum) and 13 intermediate (Anisoptera cochinchinensis, Aphanamixis polystachya, Averrhoa carambola, Carissa carandas, Chrysopylum cainito, Cinnamomum camphora, Citrofortunella microcarpa, Citrus grandis var. grandis, Elaeis guineensis, Hydnocarpus anthelmintica, Madhuca floribunda, Manilkara achras, Mimusops elengi) seed storage behaviour. A double-criteria key to estimate likely seed storage behaviour showed good agreement with the above: the key can reduce the workload of seed storage behaviour identification considerably.

Seed survival of four tropical tree species in response to environment

The response of seed survival to storage duration and environment (temperature and moisture content) in the four tropical tree species: Cedrela odorata L., Ceiba pentandra (L.) Gaertn., Dalbergia spruceana Benth. and Tabebuia alba (Cham.) Sandwith. from Amazonia conformed to the seed viability equation of Ellis and Roberts. Estimates of the seed viability constants to calculate seed longevity in these species are provided.