Scheduled System Maintenance:
On May 6th, system maintenance will take place from 8:00 AM - 12:00 PM ET (12:00 - 16:00 UTC). During this time, there may be intermittent impact on performance. We apologize for the inconvenience.
By Topic

Advanced Computing and Communications, 2006. ADCOM 2006. International Conference on

Date 20-23 Dec. 2006

Filter Results

Displaying Results 1 - 25 of 152
  • [Front cover]

    Publication Year: 2006 , Page(s): C1
    Save to Project icon | Request Permissions | PDF file iconPDF (1619 KB)  
    Freely Available from IEEE
  • [Title page]

    Publication Year: 2006 , Page(s): C2
    Save to Project icon | Request Permissions | PDF file iconPDF (46 KB)  
    Freely Available from IEEE
  • Welcome message

    Publication Year: 2006 , Page(s): nil1
    Save to Project icon | Request Permissions | PDF file iconPDF (77 KB)  
    Freely Available from IEEE
  • Conference organization

    Publication Year: 2006 , Page(s): nil2
    Save to Project icon | Request Permissions | PDF file iconPDF (63 KB)  
    Freely Available from IEEE
  • Advisory Committee

    Publication Year: 2006 , Page(s): nil3
    Save to Project icon | Request Permissions | PDF file iconPDF (53 KB)  
    Freely Available from IEEE
  • Program Committee

    Publication Year: 2006 , Page(s): nil3
    Save to Project icon | Request Permissions | PDF file iconPDF (53 KB)  
    Freely Available from IEEE
  • Reviewers list

    Publication Year: 2006 , Page(s): nil4
    Save to Project icon | Request Permissions | PDF file iconPDF (54 KB)  
    Freely Available from IEEE
  • CDAC - ACS Foundation Lecture Automatic and Seamless Multi-service in 3G and Beyond

    Publication Year: 2006 , Page(s): nil5
    Save to Project icon | Request Permissions | PDF file iconPDF (89 KB)  
    Freely Available from IEEE
  • Other Invited Keynote Lectures, Tutorials and Workshop Sessions

    Publication Year: 2006 , Page(s): nil6
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (106 KB)  

    Provides an abstract for each of the keynote presentations and a brief professional biography of each presenter. The complete presentations were not made available for publication as part of the conference proceedings. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Copyright page

    Publication Year: 2006 , Page(s): nil7
    Save to Project icon | Request Permissions | PDF file iconPDF (41 KB)  
    Freely Available from IEEE
  • Table of contents

    Publication Year: 2006 , Page(s): nil8 - nil15
    Save to Project icon | Request Permissions | PDF file iconPDF (156 KB)  
    Freely Available from IEEE
  • Restructuring and Extensible Simulator for Shared Memory and Message Passing Parallel Programs

    Publication Year: 2006 , Page(s): 2 - 7
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (141 KB) |  | HTML iconHTML  

    This paper presents an object-oriented simulation environment to evaluate and restructure parallel programs for software distributed shared memory (DSM) systems. This simulator provides a toolbox for various network topologies and communication parameters. The simulator models a software DSM system that can support shared memory as well as message passing. Prediction of performance of parallel programs helps the compilers to analyze, transform and to generate efficient and highly parallel code. The performance characteristics like speedup and message passing delays help also in the design of a parallel machine under development by predicting its performance using benchmark programs. This simulator is designed to study the performance characteristics of the shared memory parallel programs and also message passing parallel programs. Four popular parallel algorithms - Reduction, Radix sort (SPLASH-2), Block matrix multiplication and Hyper quicksort have been studied using this simulator and the results are presented. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Permutation Capability and Connectivity of Enhanced Multistage Interconnection Network(E-MIN)

    Publication Year: 2006 , Page(s): 8 - 11
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (150 KB) |  | HTML iconHTML  

    In this paper permutation capability of enhanced multistage interconnection network (E-MIN) has been presented. E-MIN network comes under the category of Banyan type, which is a fault tolerant. In this paper new permutation capability technique called semi permutation is considered. Bandwidth and probability of acceptance of E-MIN is evaluated and compared with crossbar and delta networks. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Parallel Solution for the Unconstrained Maximum Elements Problem

    Publication Year: 2006 , Page(s): 12 - 15
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (116 KB) |  | HTML iconHTML  

    This paper proposes a new parallel algorithm for the maximal elements problem with no constraints. It is proposed for a linear array with reconfigurable pipelined bus system (LARPBS) model and on its latest variant, LARPBS(p) model also. It runs in O(log log n ldr log n) time with O(n) processors. Its significance is that it works for any instance of the problem with no constraint laid in [2]. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Scheduling Parallel Job on Param Padma with Mpich

    Publication Year: 2006 , Page(s): 16 - 18
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (132 KB) |  | HTML iconHTML  

    We have implemented a job scheduling system for massively parallel system with Mpich that supports different scheduling policies for execution of parallel jobs. The system is available on C-DAC HPC cluster Param Padma. It is highly modular scalable and can easily be adapted to variety of other MPP systems. Conventional job scheduler daemons take a part of resources continuously for its own activity that reduces the overall computational metric of the cluster. The scheduler minimized this resource usage by eliminating scheduler acceptor and resource monitoring daemons on the each compute nodes. This idea provides better utilization of resources on the cluster. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Evolutionary Selection of Kernels in Support Vector Machines

    Publication Year: 2006 , Page(s): 19 - 24
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (256 KB) |  | HTML iconHTML  

    A machine learning algorithm using evolutionary algorithms and Support Vector Machines is presented. The kernel function of support vector machines are evolved using recently introduced Gene Expression Programming algorithms. This technique trains a support vector machine with the kernel function most suitable for the training data set rather than pre-specifying the kernel function. The fitness of the kernel is measured by calculating cross validation accuracy. SVM trained with the fittest kernels is then used to classify previously unseen data. The algorithm is elucidated using preliminary case studies for classification of cancer data and bank transaction data set. It is shown that the Evolutionary Support Vector Machine has good generalization properties when compared with Support Vector Machines using standard (polynomial and radial basis) kernel functions. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Middleware for Multimedia Streaming in a Heterogeneous Distributed Environment

    Publication Year: 2006 , Page(s): 26 - 31
    Cited by:  Patents (1)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (2415 KB) |  | HTML iconHTML  

    Advanced, large-scale applications targeted for the next generation Internet are motivating advances in scalable and adaptive highspeed networks and middleware. This paper provides a framework and middleware for heterogeneous distributed applications. And also describes how they have been applied successfully in practice to improve the reusability and quality of software system. An application written in one language is capable of playing media files and giving a request to an intermediate server, which is written in another language. The communications between these two different languages are established by converting the requesting application in to intermediate form. Therefore the converted application seems to be same language application as Intermediate Server. Finally the intermediate server, streams the requested media file to the client from the servers group which are under the control of the intermediate server. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Web Document Clustering Using Document Index Graph

    Publication Year: 2006 , Page(s): 32 - 37
    Cited by:  Patents (1)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (188 KB) |  | HTML iconHTML  

    Document Clustering is an important tool for many Information Retrieval (IR) tasks. The huge increase in amount of information present on Web poses new challenges in clustering regarding to underlying data model and nature of clustering algorithm. Document clustering techniques mostly rely on single term analysis of document data set. To achieve more accurate document clustering, more informative feature such as phrases are important in this scenario. Hence first part of the paper presents phrase-based model, Document Index Graph (DIG), which allows incremental phrase-based encoding of documents and efficient phrase matching. It emphasizes on effectiveness of phrase-based similarity measure over traditional single term based similarities. In the second part, a Document Index Graph based Clustering (DIGBC) algorithm is proposed to enhance the DIG model for incremental and soft clustering. This algorithm incrementally clusters documents based on proposed cluster-document similarity measure. It allows assignment of a document to more than one cluster. The DIGBC algorithm is more efficient as compared to existing clustering algorithms such as single pass, K-NN and Hierarchical Agglomerative Clustering (HAC) algorithm. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Adaptive Overlays for Event Based Middleware: A case for Chordal Reliability Rings

    Publication Year: 2006 , Page(s): 38 - 43
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (164 KB) |  | HTML iconHTML  

    Distributed, event based applications executing on publish-subscribe middleware (a.k.a. event based middleware or EBM) are subject to many disruptive changes at runtime. These changes can be caused either by a change in environmental conditions such as the failure of an event broker node or can be caused by dynamically evolving application needs such as the sudden need to route events securely from a specific publisher to a set of subscribers. Ideally, the middleware should facilitate uninterrupted execution of applications without costly redeployment in the face of these changes. We formally study the requirements of such an "adaptive" middleware infrastructure and analyze adaptation in existing efforts. An adaptive overlay for a core level adaptive middleware with a chordal reliability ring is proposed on the basis of the study. We illustrate and prove that two of the adaptation triggers -node and link failures can be handled by the middleware in O(log n) time with the help of the chordal reliability ring. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Aggregating Content and Connectivity based Techniques for Measure of Web Search Quality

    Publication Year: 2006 , Page(s): 44 - 49
    Cited by:  Patents (3)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (3759 KB) |  | HTML iconHTML  

    Web Searching is very much popular among the Internet users. A large number of public search engines are available for this purpose. So, there must be some procedure to measure the quality of web search. In this paper, classical content-based retrieval techniques such as Vector Space Model and Boolean Similarity Measures are combined with connectivity-based techniques such as PageRank for measure of web search quality. These techniques are combined using Modified Shimura technique of Rank aggregation. The aggregated ranking obtained in the process is compared with the original ranking given by the search engine. The correlation coefficient thus obtained is averaged for a set of queries. We show our experimental results pertaining to seven public search engines and fifteen queries. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Web-Based Counselling System

    Publication Year: 2006 , Page(s): 50 - 53
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (92 KB) |  | HTML iconHTML  

    This paper introduces a Web-based counselling system (hereafter called E-Counsellor), a non-profit online counselling Web portal that was built to provide a platform for counsellors to reach out to the general public. We examine the background that induced the conceptualization of the portal, the system's architecture and design as well as the implementation of the working system. The paper closes with an evaluation of the system. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Design and Implementation of Peer-to-Peer E-Mail System

    Publication Year: 2006 , Page(s): 54 - 57
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (2266 KB) |  | HTML iconHTML  

    E-mail has become the most widely used communication facility for all institutions and individuals in the present era. Existing E-mail systems employ a server-centric design in which the user is critically dependent on the mail server. Insecurity due to mail sever failures is a major problem faced by many users. Design and implementation of a secure Peer-to-Peer E-mail facility is addressed in this work. Locating the specific computer that stores the emails of a specific user is the critical design requirement for which a solution is offered through the implementation of Chord protocol, which maps an E-mail entity onto a specific node. The architectural design and implementation also provides for better confidentiality. The prototype implementation has been observed to provide a good scope for improved anonymity. We present our prototype implementation and discuss the scope of future extensions. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Qualitative Parametric Comparison of Load Balancing Algorithms in Distributed Computing Environment

    Publication Year: 2006 , Page(s): 58 - 61
    Cited by:  Papers (1)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (91 KB) |  | HTML iconHTML  

    Substantive research in the field of distributed computing has shown that in a multi-processor system the probability of one of the processor being idle while other processor has multiple jobs queued up can be very high. Such imbalances in system load suggest that performance can be improved by either transferring jobs from the currently heavily loaded processors to the lightly loaded ones or distributing load evenly or fairly among the processors. The algorithms known as load balancing algorithms, helps to achieve the above said goal(s). These algorithms come into two basic categories -static and dynamic. While static load balancing algorithms (SLB) take decisions regarding assignment of tasks to processors based on the average estimated values of process execution times and communication delays at compile time, Dynamic load balancing algorithms (DLB) are adaptive to changing situations and take decisions at run time. The objective of this paper work is Firstly, to identify qualitative parameters for the comparison of above said algorithms and Secondly, to carry out comparison between SLB and DLB algorithms based on these identified parameters. In future this work can be extended to develop a virtual experimental environment to study these load balancing algorithms based on identified comparative parameters quantitatively. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Enhancing the Performance of XML Query Processing - Semantic Cache System

    Publication Year: 2006 , Page(s): 62 - 65
    Cited by:  Papers (1)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (2509 KB) |  | HTML iconHTML  

    With the advent of XML, great challenges arise from the demand for efficiently retrieving information from remote XML sources across the Internet. Recently, the advance of extensible Markup Language (XML) as the lingua franca of the Web meets the needs for an interoperable data exchange format on the Web. The semantic caching technology can help to improve the efficiency of XML query processing in the Web environment. Unlike from the traditional tuple or page-based caching systems, semantic caching systems exploit the idea of reusing cached query results to answer new queries based on the query containment and rewriting techniques. Fundamental results on the containment of relational queries have been determined. The results show that some of our measures outperform the traditional measures in certain situations. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Demonstrating the feasibility of an Autonomic Communication- Targeted Cross-Layer Architecture

    Publication Year: 2006 , Page(s): 67 - 72
    Cited by:  Papers (2)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (161 KB) |  | HTML iconHTML  

    Layered architectures are not sufficiently flexible to cope with the dynamics of wireless-dominated next generation communications. Cross-layer architectures may provide a better solution: allowing interactions between two or more non-adjacent layers in the protocol stack. Architectures based on purely local information will not be able to support autonomic communications like self-behaving systems. A new cross-layer architecture which provides a hybrid local and global view, using gossiping to maintain consistency has been proposed in [1]. This paper demonstrates the feasibility of that architecture through two different prototype implementations. Context-awareness is a key issue in autonomic communications and both the implementations directly or indirectly uses it. The first implementation uses contextual information to control Transmission Power of a mobile node and the second one uses it to manage traffic automatically. Results show that context-awareness is possible through our architecture and proves the potential of the proposed architecture. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.