By Topic

Information Technology, 2008. ICIT '08. International Conference on

Date 17-20 Dec. 2008

Filter Results

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

    Publication Year: 2008, Page(s): C1
    Request permission for commercial reuse | PDF file iconPDF (1911 KB)
    Freely Available from IEEE
  • [Title page i]

    Publication Year: 2008, Page(s): i
    Request permission for commercial reuse | PDF file iconPDF (43 KB)
    Freely Available from IEEE
  • [Title page iii]

    Publication Year: 2008, Page(s): iii
    Request permission for commercial reuse | PDF file iconPDF (120 KB)
    Freely Available from IEEE
  • [Copyright notice]

    Publication Year: 2008, Page(s): iv
    Request permission for commercial reuse | PDF file iconPDF (148 KB)
    Freely Available from IEEE
  • Table of contents

    Publication Year: 2008, Page(s):v - ix
    Request permission for commercial reuse | PDF file iconPDF (124 KB)
    Freely Available from IEEE
  • Message from the General Chairs

    Publication Year: 2008, Page(s): x
    Request permission for commercial reuse | PDF file iconPDF (92 KB) | HTML iconHTML
    Freely Available from IEEE
  • Message from the Technical Program Chairs

    Publication Year: 2008, Page(s): xi
    Request permission for commercial reuse | PDF file iconPDF (102 KB) | HTML iconHTML
    Freely Available from IEEE
  • Organizing Committee

    Publication Year: 2008, Page(s): xii
    Request permission for commercial reuse | PDF file iconPDF (84 KB)
    Freely Available from IEEE
  • Technical Program Committee and Program Committee Members

    Publication Year: 2008, Page(s):xiii - xiv
    Request permission for commercial reuse | PDF file iconPDF (88 KB)
    Freely Available from IEEE
  • Additional reviewers

    Publication Year: 2008, Page(s): xv
    Request permission for commercial reuse | PDF file iconPDF (87 KB)
    Freely Available from IEEE
  • Finding a Box Representation for a Graph in O(n2Δ2lnn) Time

    Publication Year: 2008, Page(s):3 - 8
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (170 KB) | HTML iconHTML

    An axis-parallel box in b-dimensional space is a Cartesian product R1×R2×...×Rb where Ri (for 1⩽i⩽b) is a closed interval of the form [ai, bi] on the real line. For a graph G, its boxicity is the minimum dimension b, such that G is representable as the intersection graph of (axis-parallel) boxes in b-dimensional s... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A New Heuristic for the Minimum Routing Cost Spanning Tree Problem

    Publication Year: 2008, Page(s):9 - 13
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (217 KB) | HTML iconHTML

    Given a connected, weighted, and undirected graph, the minimum routing cost spanning tree problem seeks on this graph a spanning tree of minimum routing cost, where routing cost is defined as the sum of the costs of all the paths connecting two distinct vertices in a spanning tree. In this paper we have proposed a perturbation based local search for this problem. We have compared our approach agai... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Fast Image Segmentation Using Modified CLARA Algorithm

    Publication Year: 2008, Page(s):14 - 18
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (152 KB) | HTML iconHTML

    The CLARA algorithm is one of the popular clustering algorithms in use nowadays. This algorithm works on a randomly selected subset of the original data and produces near accurate results at a faster rate than other clustering algorithms. CLARA is basically used in data mining applications. We have used this algorithm for color image segmentation.The original CLARA is modified for producing better... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An Efficient ID Based Proxy Signature, Proxy Blind Signature and Proxy Partial Blind Signature

    Publication Year: 2008, Page(s):19 - 23
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (230 KB) | HTML iconHTML

    Identity-based (ID based) public key cryptosystem gives an efficient alternative for key management as compared to certificate based public key settings. A proxy signature is a method for an entity to delegate signing capabilities to other participants so that they can sign on behalf of the entity with in a given context. In this paper, we have proposed a new ID-based proxy signature which is more... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Honey Bee Behavior: A Multi-agent Approach for Multiple Campaigns Assignment Problem

    Publication Year: 2008, Page(s):24 - 29
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (141 KB) | HTML iconHTML

    This paper address a multi-agent approach using the behavior of honey bee to find out an optimal customer-campaign relationship under certain restrictions for the problem of multiple campaigns assignment. This NP-hard problem is one of the key issues in marketing when producing the optimal campaign. In personalized marketing it is very important to optimize the customer satisfaction and targeting ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On Development of a Generalized Visual Stochastic Optimizer

    Publication Year: 2008, Page(s):30 - 35
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (218 KB) | HTML iconHTML

    Visual optimization is a very interesting topic to the application users for many purposes. It enables the user with an interactive platform where, by varying different parameter settings, one can customize a solution. Several attempts of developing generalized evolutionary optimizers are found in literature. In this paper, we have tried to develop a generalized visual platform for stochastic opti... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Topological Properties of a New Fault Tolerant Interconnection Network for Parallel Computer

    Publication Year: 2008, Page(s):36 - 40
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (174 KB) | HTML iconHTML

    In this paper we introduce a new interconnection network, the extended varietal hypercube with cross connection denoted by EVHC(n,k). This network has hierarchical structure and it overcomes the poor fault tolerant properties of extended varietal hypercube. This network has low diameter, constant degree connectivity and low message traffic density. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An Improved Algorithm for Distributed Mutual Exclusion by Restricted Message Exchange in Voting Districts

    Publication Year: 2008, Page(s):41 - 44
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (260 KB) | HTML iconHTML

    This paper presents an improvement to the Maekawa¿s distributed mutual exclusion algorithm. The number of messages required by the improvised algorithm is in the range 3 M to 5 M per critical section invocation where M is the number of Intersection nodes in the system. This improvement does not introduce any additional overheads over the existing Maekawa¿s algorithm which requires 3 K to 5 K num... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Development of a New Optimization Algorithm Based on Artificial Immune System and Its Application

    Publication Year: 2008, Page(s):45 - 48
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (235 KB) | HTML iconHTML

    In resent years, research has taken an interest in design of approximation algorithms due to the requirement of these algorithms for solving many problems of science and engineering like system modeling, identification of plants, controller design, fault detection, computer security, prediction of data sets etc. The area of Artificial Immune System (AIS) is emerging as an active and attractive fie... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Audio Watermarking Based on BCH Coding Using CT and DWT

    Publication Year: 2008, Page(s):49 - 50
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (240 KB) | HTML iconHTML

    A blind cepstrum transform-discrete wavelet transform (CT-DWT) composite audio watermarking based on BCH coding is proposed. It takes the advantages of error correcting coding and cepstrum transform to lower the bit error rate (BER) of the extracted watermark. Experimental results show that the watermark embedded with our proposed watermarking scheme is robust and invisible. Moreover the performan... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Novel Technique for Input Vector Compression in System-on-Chip Testing

    Publication Year: 2008, Page(s):53 - 58
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (301 KB) | HTML iconHTML

    A software based hybrid test vector compression technique for testing system-on-chip integrated circuits using an embedded processor core was previously discussed by the authors. In this approach, a software program is loaded into the on-chip processor memory along with the compressed test data sets. To minimize on-chip storage besides testing time, the test data volume is first reduced by compact... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Virtual Computing Grid Using Resource Pooling

    Publication Year: 2008, Page(s):59 - 64
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (219 KB) | HTML iconHTML

    Cluster and grid computing are becoming very popular, particularly for scientific and engineering applications. Higher bandwidth of computer networks has further boosted development of cluster computing. Local and geographically dispersed deployment of computing resources is the most prominent differentiating issue between a cluster and grid computing based setups. Cluster necessarily requires dep... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Semantics Preserving Micro-Instant Implementation of Synchronous Programs

    Publication Year: 2008, Page(s):65 - 70
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (231 KB) | HTML iconHTML

    Implementations of synchronous programs on distributed hardware modules are infeasible if the totality of hardware is viewed as a single monster circuit. The zero execution time semantics that govern the interaction between the system and the environment has to be adapted to the inter module interaction. This interaction is at micro-instants and the signals exchanged are tentative at the start and... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Synchronous Replica Consistency Protocol with Notification and Response

    Publication Year: 2008, Page(s):71 - 74
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (231 KB) | HTML iconHTML

    Data grids provide geographically distributed resources for large-scale data-intensive applications that generate and share large data sets. Replication has been used to reduce the access latencies and ensure fault tolerance for such large scale data sharing. In spite of the advantages offered, Replication results in consistency problems if the applications are allowed to modify the data in an unc... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Folded Dualcube: A New Interconnection Topology for Parallel Systems

    Publication Year: 2008, Page(s):75 - 78
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (269 KB) | HTML iconHTML

    With the advent of VLSI technology, the demand for higher processing has increased to a large extent. Study of parallel computer interconnection topology has been made along with the various interconnection networks emphasizing the cube based topologies in particular. This paper proposes a new cube based topology called the Folded dualcube with better features such as reduced diameter, cost and im... View full abstract»

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