37515044
ECSP: An Efficient Cluster Based P2P Architecture
40619710
An efficient clustered architecture for P2P networks
Peer-to-peer (P2P) computing offers many attractive features, such as self-organization, load-balancing, availability, fault tolerance, and anonymity. However, it also faces some serious challenges. In this paper, we propose an Efficient Clustered Super-Peer P2P architecture (ECSP) to overcome the scalability and efficiency problems of existing unstructured P2P system. With ECSP, peers are grouped into clusters according to their topological proximity, and super-peers are selected from regular peers to act as cluster leaders and service providers. These super-peers are also connected to each other, forming a backbone overlay network operating as a distinct, yet integrated, application. To maintain the dynamically adaptive overlay network and to manage the routing on it, we propose an application level broadcasting protocol: Efa. Applying only a small amount of information about the topology of a network, Efa is as simple as flooding, a conventional method used in unstructured P2P systems. By eliminating many duplicated messages, Efa is much more efficient and scalable than flooding, and furthermore, it is completely decentralized and self-organized. Our experimental results prove that ESCP architecture, combined with the super-peer backbone protocol, can generate impressive levels of performance and scalability.
14435501
Efa: an efficient content routing algorithm in large peer-to-peer overlay networks
An important issue for peer-to-peer application is to locate content within the network. There are many existing solutions to this problem, however, each of them addresses different aspects and each has its deficiencies. We focus on the unstructured peer-to-peer scenario and present a constrained flooding routing algorithm, Efa, which overcomes some of the deficiencies of those existing strategies. Efa performs application level broadcasting in a potentially very large peer-to-peer network overlaid on the Internet. Efa is completely decentralized and self-organized. It is a more scalable alternative to flooding, which is commonly used in unstructured peer-to-peer systems. Utilizing just a small amount of topology info, Efa is almost as simple as flooding, but it is much more efficient and scalable.
17673951
A semantics-based routing scheme for grid resource discovery
Grid technologies enable the sharing of a wide variety of distributed resources. To fully utilize these resources, effective resource discovery mechanisms are necessities. However, the complicated and dynamic characteristics of grid resources make sharing and discovering them a challenging issue. In this paper, we propose a peer-to-peer (P2P) based overlay network to assist the efficient resource discovery and query. The framework is based on the RDF metadata infrastructure, allowing a rich and extensible description of resources. To avoid flooding the network with a query, we propose a comprehensive semantics-based query forwarding strategy, which only forwards queries to semantically related nodes. After the related nodes have been located, the original RDF query is used to do the final query and retrieval. Results from simulation experiments demonstrate that this architecture is scalable and efficient
60653417
FedGrid: An HLA Approach to Federating Grids
Research on Grids has received considerable attention in recent years. Whereas existing work on connecting the grids primarily focused on grid services, in our work we propose a unified approach, so-called FederationGrid (or FedGrid for short), which integrates both virtual organization (VO) and grid services, thus enabling formation of virtual communities on top of grids. FedGrid is based on the standard High Level Architecture (HLA) that enjoys the advantages of high-level information modeling, including re-usability of software components and real-time performance of the overall systems. In addition, FedGrid is a fractal grid, comprised of hierarchical HLA federations, e.g. Realms and Lobby, which supports well the concept of virtual communities and scalability.
14840245
Grid Resource Discovery Using Semantic Communities
Grid technologies enable the sharing and collaborating of a wide variety of resources. To fully utilize these resources, effective resource discovery mechanisms are necessities. However, the complicated and dynamic characteristics of the grid resources make sharing and discovering them a challenging issue. In this paper, we propose a semantic community approach to assisting the efficient resource discovery and query in grids. Semantic community is a natural arrangement of distributed systems. It prunes the searching space and reduces the cost of searching. Moreover, it exhibits many desirable properties, including being fully decentralized and supporting complex queries. Our simulation results show how searching the girds can take advantage of semantic communities to reduce the searching cost and improve the quality of search results.
3756004
Parameter estimation of multi-dimensional hidden Markov models - a scalable approach
Parameter estimation is a key computational issue in all statistical image modeling techniques. In this paper, we explore a computationally efficient parameter estimation algorithm for multi-dimensional hidden Markov models. 2-D HMM has been applied to supervised aerial image classification and comparisons have been made with the first proposed estimation algorithm. An extensive parametric study has been performed with 3-D HMM and the scalability of the estimation algorithm has been discussed. Results show the great applicability of the explored algorithm to multi-dimensional HMM based image modeling applications.
195883433
Genescene: biomedical text and data mining
To access the content of digital texts efficiently, it is necessary to provide more sophisticated access than keyword based searching. Genescene provides biomedical researchers with research findings and background relations automatically extracted from text and experimental data. These provide a more detailed overview of the information available. The extracted relations were evaluated by qualified researchers and are precise. A qualitative ongoing evaluation of the current online interface indicates that this method to search the literature is more useful and efficient than keyword based searching.
14076397
The Empirical Studies on Quality Benefits of Reusing Software Components
The benefits of reusing software components have been studied for many years. Several previous studies have concluded that reused components have fewer defects in general than non-reusable components. However, few of these studies have gone a further step, i.e., investigating which type of defects has been reduced because of reuse. Thus, it is suspected that making a software component reusable will automatically improve its quality. This paper presents an on-going industrial empirical study on the quality benefits of reuse. We are going to compare the defects types, which are classified by ODC (orthogonal defect classification), of the reusable component vs. the non-reusable components in several large and medium software systems. The intention is to figure out which defects have been reduced because of reuse and the reasons of the reduction.
42647198
Evolutionary Optimisation of Distributed Energy Resources
Genetic optimisation is used to minimise operational costs across a system of electrical loads and generators controlled by local intelligent agents and connected to the electricity grid at market rates. Experimental results in a simulated environment show that coordinated market-sensitive behaviours are achieved. A large network of 500 loads and generators, each characterised by different randomly selected parameters, was optimised using a two-stage genetic algorithm to achieve scalability.
15144335
Discovery of stable and significant binding motif pairs from PDB complexes and protein interaction datasets
MOTIVATION
Discovery of binding sites is important in the study of protein-protein interactions. In this paper, we introduce stable and significant motif pairs to model protein-binding sites. The stability is the pattern's resistance to some transformation. The significance is the unexpected frequency of occurrence of the pattern in a sequence dataset comprising known interacting protein pairs. Discovery of stable motif pairs is an iterative process, undergoing a chain of changing but converging patterns. Determining the starting point for such a chain is an interesting problem. We use a protein complex dataset extracted from the Protein Data Bank to help in identifying those starting points, so that the computational complexity of the problem is much released.


RESULTS
We found 913 stable motif pairs, of which 765 are significant. We evaluated these motif pairs using comprehensive comparison results against random patterns. Wet-experimentally discovered motifs reported in the literature were also used to confirm the effectiveness of our method.


SUPPLEMENTARY INFORMATION
http://sdmc.i2r.a-star.edu.sg/BindingMotifPairs.