Abstract In hierarchical cluster analysis dendrogram graphs are used to visualize how clusters are formed. I propose an alternative graph named “clustergram” to examine how cluster members are assigned to clusters as the number of clusters increases. This graph is useful in exploratory analysis for non-hierarchical clustering algorithms like k-means and for hierarchical cluster algorithms when ...

This paper presents a novel architecture of a single system image built on cluster system, named Glosim. This system orientates to cluster system middleware, which provides global system image support. It not only supports global IPC objects including message queue, semaphore and shared memory, but also presents a new concept of global working process and provides it SSI support smoothly and tr...

The aim of the present study was to determine whether under-reporting rates vary between dietary pattern clusters. Subjects were sixty-five Brazilian women. During 3 weeks, anthropometric data were collected, total energy expenditure (TEE) was determined by the doubly labelled water method and diet was measured. Energy intake (EI) and the daily frequency of consumption per 1000 kJ of twenty-two...

To identifying of the high yielding wheat lines with optimal characteristics and to determine the traits which could be used as the selection index for increasing of grain yield, 40 recombinant inbred lines derived from a cross between Norstar and Zagros cultivars were evaluated in a randomized complete block design with three replications. The measured characters consisted of peduncle weight, ...

We introduce a low-complexity method for acquiring fine-grained classes of named entities from the Web. The method exploits the large amounts of textual data available on the Web, while avoiding the use of any expensive text processing techniques or tools. The quality of the extracted classes is encouraging with respect to both the precision of the sets of named entities acquired within various...

BACKGROUND The development of robust methods for chemical named entity recognition, a challenging natural language processing task, was previously hindered by the lack of publicly available, large-scale, gold standard corpora. The recent public release of a large chemical entity-annotated corpus as a resource for the CHEMDNER track of the Fourth BioCreative Challenge Evaluation (BioCreative IV)...

We present a parallel improvement heuristic for solving vehicle routing problems with additional constraints. The algorithm was implemented on a parallel transputer machine and on a cluster of workstations using PVM 1]. The computational results obtained with sequential and parallel Simulated Trading show that our approach is superior compared to all heuristics known to the authors by now.