The smugglers : the odyssey of Zipporah Katti, being some chronicles of the last raiders of Solway /

A novel.

Dynamic group communication for large-scale parallel data mining

Exascale systems are the next frontier in high-performance computing and are expected to deliver a performance of the order of 10^18 operations per second using massive multicore processors. Very large- and extreme-scale parallel systems pose critical algorithmic challenges, especially related to concurrency, locality and the need to avoid global communication patterns. This work investigates a novel protocol for dynamic group communication that can be used to remove the global communication requirement and to reduce the communication cost in parallel formulations of iterative data mining algorithms. The protocol is used to provide a communication-efficient parallel formulation of the k-means algorithm for cluster analysis. The approach is based on a collective communication operation for dynamic groups of processes and exploits non-uniform data distributions. Non-uniform data distributions can be either found in real-world distributed applications or induced by means of multidimensional binary search trees. The analysis of the proposed dynamic group communication protocol has shown that it does not introduce significant communication overhead. The parallel clustering algorithm has also been extended to accommodate an approximation error, which allows a further reduction of the communication costs. The effectiveness of the exact and approximate methods has been tested in a parallel computing system with 64 processors and in simulations with 1024 processing elements.

Scalable and fault tolerant failure detection and consensus

Future extreme-scale high-performance computing systems will be required to work under frequent component failures. The MPI Forum's User Level Failure Mitigation proposal has introduced an operation, MPI_Comm_shrink, to synchronize the alive processes on the list of failed processes, so that applications can continue to execute even in the presence of failures by adopting algorithm-based fault tolerance techniques. This MPI_Comm_shrink operation requires a fault tolerant failure detection and consensus algorithm. This paper presents and compares two novel failure detection and consensus algorithms. The proposed algorithms are based on Gossip protocols and are inherently fault-tolerant and scalable. The proposed algorithms were implemented and tested using the Extreme-scale Simulator. The results show that in both algorithms the number of Gossip cycles to achieve global consensus scales logarithmically with system size. The second algorithm also shows better scalability in terms of memory and network bandwidth usage and a perfect synchronization in achieving global consensus.

Partitions selection strategy for set of clustering solutions

Clustering is a difficult task: there is no single cluster definition and the data can have more than one underlying structure. Pareto-based multi-objective genetic algorithms (e.g., MOCK Multi-Objective Clustering with automatic K-determination and MOCLE-Multi-Objective Clustering Ensemble) were proposed to tackle these problems. However, the output of such algorithms can often contains a high number of partitions, becoming difficult for an expert to manually analyze all of them. In order to deal with this problem, we present two selection strategies, which are based on the corrected Rand, to choose a subset of solutions. To test them, they are applied to the set of solutions produced by MOCK and MOCLE in the context of several datasets. The study was also extended to select a reduced set of partitions from the initial population of MOCLE. These analysis show that both versions of selection strategy proposed are very effective. They can significantly reduce the number of solutions and, at the same time, keep the quality and the diversity of the partitions in the original set of solutions. (C) 2010 Elsevier B.V. All rights reserved.

Multi-objective clustering ensemble for gene expression data analysis

In this paper, we present an algorithm for cluster analysis that integrates aspects from cluster ensemble and multi-objective clustering. The algorithm is based on a Pareto-based multi-objective genetic algorithm, with a special crossover operator, which uses clustering validation measures as objective functions. The algorithm proposed can deal with data sets presenting different types of clusters, without the need of expertise in cluster analysis. its result is a concise set of partitions representing alternative trade-offs among the objective functions. We compare the results obtained with our algorithm, in the context of gene expression data sets, to those achieved with multi-objective Clustering with automatic K-determination (MOCK). the algorithm most closely related to ours. (C) 2009 Elsevier B.V. All rights reserved.

The assessment of the quality of sugar using electronic tongue and machine learning algorithms

The correct classification of sugar according to its physico-chemical characteristics directly influences the value of the product and its acceptance by the market. This study shows that using an electronic tongue system along with established techniques of supervised learning leads to the correct classification of sugar samples according to their qualities. In this paper, we offer two new real, public and non-encoded sugar datasets whose attributes were automatically collected using an electronic tongue, with and without pH controlling. Moreover, we compare the performance achieved by several established machine learning methods. Our experiments were diligently designed to ensure statistically sound results and they indicate that k-nearest neighbors method outperforms other evaluated classifiers and, hence, it can be used as a good baseline for further comparison. © 2012 IEEE.

Molecular Surface Features in Modeling the HIV-1 RT Inhibitory Activity of 2-(2,6-Disubstituted phenyl)-3-(substituted pyrimidin-2-yl)-thiazolidin-4-ones

The human immunodeficiency virus-1 reverse transcriptase inhibitory activity of 2-(2,6-disubstituted phenyl)-3-(substituted pyrimidin-2-yl)-thiazolidin-4-ones have been analyzed using combinatorial protocol in multiple linear regression (CP-MLR) with several electronic and molecular surface area features of the compounds obtained from Molecular Operating Environment (MOE) software. The study has indicated the role of different charged molecular surface areas in modeling the inhibitory activity of the compounds. The derived models collectively suggested that the compounds should be compact without bulky substitutions on its peripheries for better HIV-1 RT inhibitory activity. It also emphasized the necessity of hydrophobicity and compact structural features for their activity. The scope of the descriptors identified for these analogues have been verified by extending the dataset with different 2-(disubstituted phenyl)-3-(substituted pyridin-2-yl)-thiazolidin-4-ones. The joint analysis of extended dataset highlighted the information content of identified descriptors in modeling the HIV-1 RT inhibitory activity of the compounds.

Topological Descriptors in Modeling the HIV Inhibitory Activity of 2-Aryl-3-pyridyl-thiazolidin-4-ones

The HIV-1 RT inhibitory activity of 2-(2,6-dihalophenyl)-3-(substituted pyridin-2-yl)-thiazolidin-4-ones has been analyzed with different topological descriptors obtained from DRAGON software. Here, simple topological descriptors (TOPO), Galvez topological charge indices (GVZ) and 2D autocorrelation descriptors (2DAUTO) have been found to yield good predictive models for the activity of these compounds. The correlations obtained from the TOPO class descriptors suggest that less extended or compact saturated structural templates would be better for the activity. The participating GVZ class descriptors suggest that they have same degree of influence on the activity. In 2DAUTO class, the large participation of descriptors of lags seven and three indicate the association of activity information with the seven and three centered structural fragments of these compounds. The physicochemical weighting components of these descriptors suggest homogeneous influence of mass, volume, electronegativity and/ or polarizability on the activity.

QSAR Studies on Thiazolidines: A Biologically Privileged Scaffold

A large number of drugs and biologically relevant molecules contain heterocyclic systems. Often the presence of hetero atoms or groupings imparts preferential specificities in their biological responses. Amongst the heterocyclic systems, thiazolidine is a biologically important scaffold known to be associated with several biological activities. Some of the prominent biological responses attributed to this skeleton are antiviral, antibacterial, antifungal, antihistaminic, hypoglycemic, anti-inflammatory activities. This diversity in the biological response profiles of thiazolidine has attracted the attention of many researchers to explore this skeleton to its multiple potential against several activities. Many of these synthetic and biological explorations have been subsequently analyzed in detailed quantitative structure-activity relationship (QSAR) studies to correlate the respective structural features and physicochemical properties with the activities to identify the important structural components in deciding their activity behavior. In this, drugs or any biologically active molecules may be viewed as structural frames consisting of strategically positioned functional groups that will interact effectively with the complementary groups/sites of the receptor. With this in focus, the present article reviews the QSAR studies of diverse biological activities of the thiazolidines published during the past decade.