Parallel SPICi

2011-05-05
Hashemikhabir, Seyedsasan
Can, Tolga
In this paper, a concurrent implementation of the SPICi algorithm is proposed for clustering large-scale protein-protein interaction networks. This method is motivated by selecting a defined number of protein seed pairs and expanding multiple clusters concurrently using the selected pairs in each run; and terminates when there is no more protein node to process. This approach can cluster large PPI networks with considerable performance gain in comparison with sequential SPICi algorithm. Experiments show that this parallel approach can achieve nearly three times faster clustering time on the STRING human dataset on a system with 4-core CPU while maintaining high clustering quality.

Suggestions

A temporal neural network model for constructing connectionist expert system knowledge bases
Alpaslan, Ferda Nur (Elsevier BV, 1996-04-01)
This paper introduces a temporal feedforward neural network model that can be applied to a number of neural network application areas, including connectionist expert systems. The neural network model has a multi-layer structure, i.e. the number of layers is not limited. Also, the model has the flexibility of defining output nodes in any layer. This is especially important for connectionist expert system applications.
Direction of arrival estimation algorithm with uniform linear and circular array
Caylar, Selcuk; Leblebicioğlu, Mehmet Kemal; Dural, Guelbin (2007-01-01)
In this paper mutual coupling effects on Modified Neural Multiple Source Tracking Algorithm (MN-MUST) has been studied. MN-MUST algorithm applied to the Uniform Circular Array (UCA) geometry for the first time. The validity of MN-MUST algorithm in the presence of mutual coupling has been proved for both Uniform Linear Array (ULA) and UCA. Simulation results of MN-MUST algorithm are provided for UCA for the first time. The presence of mutual coupling degraded the MN-MUST algorithm performed in the absence of...
An interactive preference based multiobjective evolutionary algorithm for the clustering problem
Demirtaş, Kerem; Özdemirel, Nur Evin; Karasakal, Esra; Department of Industrial Engineering (2011)
We propose an interactive preference-based evolutionary algorithm for the clustering problem. The problem is highly combinatorial and referred to as NP-Hard in the literature. The goal of the problem is putting similar items in the same cluster and dissimilar items into different clusters according to a certain similarity measure, while maintaining some internal objectives such as compactness, connectivity or spatial separation. However, using one of these objectives is often not sufficient to detect differ...
Analysis of three block cipher based hash functions : Whirpool, Grøstl and Grindahl
Ismailova, Rita; Diker Yücel, Melek; Department of Cryptography (2012)
The subject of this thesis is the study of cryptographic hash functions, which utilize block ciphers as underlying chain functions. It is mainly concerned with the analysis of the three hash algorithms, the Whirlpool, Grøstl and Grindahl. All these hash functions have underlying block ciphers that are modified versions of the Advance Encryption Standard and we investigate the behavior of these block ciphers under the integral attack. Statistical tests, such as the avalanche test and the collision test, are ...
A 2-0 navier-stokes solution method with overset moving grids
Tuncer, İsmail Hakkı (1996-01-01)
A simple, robust numerical algorithm to localize moving boundary points and to interpolate uniteady solution variables across 2-D, arbitrarily overset computational grids is presented. Overset grids are allowed to move in time relative to each other. The intergrid boundary points are localized in terms of three grid points on the donor grid by a directional search algorithm. The parameters of the search algorithm give the interpolation weights at the localized boundary point. The method is independent of nu...
Citation Formats
S. Hashemikhabir and T. Can, “Parallel SPICi,” 2011, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/55376.