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]

    Page(s): C1
    Save to Project icon | Request Permissions | PDF file iconPDF (1911 KB)  
    Freely Available from IEEE
  • [Title page i]

    Page(s): i
    Save to Project icon | Request Permissions | PDF file iconPDF (43 KB)  
    Freely Available from IEEE
  • [Title page iii]

    Page(s): iii
    Save to Project icon | Request Permissions | PDF file iconPDF (120 KB)  
    Freely Available from IEEE
  • [Copyright notice]

    Page(s): iv
    Save to Project icon | Request Permissions | PDF file iconPDF (148 KB)  
    Freely Available from IEEE
  • Table of contents

    Page(s): v - ix
    Save to Project icon | Request Permissions | PDF file iconPDF (124 KB)  
    Freely Available from IEEE
  • Message from the General Chairs

    Page(s): x
    Save to Project icon | Request Permissions | PDF file iconPDF (92 KB)  
    Freely Available from IEEE
  • Message from the Technical Program Chairs

    Page(s): xi
    Save to Project icon | Request Permissions | PDF file iconPDF (102 KB)  
    Freely Available from IEEE
  • Organizing Committee

    Page(s): xii
    Save to Project icon | Request Permissions | PDF file iconPDF (84 KB)  
    Freely Available from IEEE
  • Technical Program Committee and Program Committee Members

    Page(s): xiii - xiv
    Save to Project icon | Request Permissions | PDF file iconPDF (88 KB)  
    Freely Available from IEEE
  • Additional reviewers

    Page(s): xv
    Save to Project icon | Request Permissions | PDF file iconPDF (87 KB)  
    Freely Available from IEEE
  • Finding a Box Representation for a Graph in O(n2Δ2lnn) Time

    Page(s): 3 - 8
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | 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 space. The concept of boxicity finds application in various areas of research like ecology, operation research etc. Chandran, Francis and Sivadasan gave an O(Δn2ln2n) randomized algorithm to construct a box representation for any graph G on n vertices in [(Δ+2)lnn] dimensions, where ¿ is the maximum degree of the graph. They also came up with a deterministic algorithm that runs in O(n4Δ) time. Here, we present an O(n2Δ2lnn) deterministic algorithm that constructs the box representation for any graph in [(Δ+2)lnn] dimensions. 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

    Page(s): 9 - 13
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | 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 against three methods reported in the literature - two genetic algorithms and a stochastic hill climber.Computational results show the effectiveness of our approach. 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

    Page(s): 14 - 18
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | 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 outputs. We used a technique of averaging of simulation results to reduce error due to sampling. We applied this algorithm for segmentation of color images due to the large amount of spatial coherency present in the image. The modified algorithm is also suitable for general data mining applications. From experimental results,we see that the suggested modification is a faster version of CLARA as well as able to produce better results. 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

    Page(s): 19 - 23
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | 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 efficient than. Then we have extended our study in developing a blind -signature and partial blind signature using the above proxy signing key. We also have analyzed security of our new scheme briefly. 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

    Page(s): 24 - 29
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | 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 efficiency. Using the behavior of honey bee a multi-agent approach is proposed to overcome the multiple recommendations problem that occur when several personalized campaigns conducting simultaneously. We measure the effectiveness of the propose method with two other methods known as RANDOM and INDEPENDENT using an artificially created customer-campaign preference matrix. Further a generalized Gaussian response suppression function is introduced and it differs among customer classes. An extensive simulation studies are carried out varying on the small to large scale of the customer-campaign assignment matrix and the percentage of recommendations. Computational result of the proposed method shows a clear edge vis-a-vis RANDOM and INDEPENDENT. 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

    Page(s): 30 - 35
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | 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 optimization algorithms that encompass both single objective and multi objective problems. 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

    Page(s): 36 - 40
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | 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

    Page(s): 41 - 44
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | 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 number of messages per critical section invocation, where K is the number of nodes in the voting district (M ¿ K). This reduction in number of messages is achieved by restricting the communication of any node which wants to execute critical section with the Intersection nodes of the voting district, without causing any modification of the basic structure of the algorithm. This improvisation preserves all the advantages of the original Maekawa¿s algorithm. 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

    Page(s): 45 - 48
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | 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 field involving models, techniques and applications of greater diversity. In this paper a new optimization algorithm based on AIS is developed. The proposed algorithm has been suitably applied to develop practical applications like design of a new model for efficient approximation of nonlinear functions and identification of nonlinear systems in noisy environments. Simulation study of few benchmark function approximation and system identification problems are carried out to show superior performance of the proposed model over the standard methods in terms of response matching, accuracy of identification and convergence speed achieved. 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

    Page(s): 49 - 50
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | 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 performance of the BCH-coding scheme is superior to non BCH-coding scheme. 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

    Page(s): 53 - 58
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | 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 compaction in a hybrid manner before downloading into the processor. The proposed method utilizes a set of adaptive coding techniques for realizing lossless compression. The compaction program need not be loaded into the embedded processor, as only the decompression of test data is required for the automatic test equipment. The developed scheme necessitates minimal hardware overhead, while the on-chip embedded processor can be reused for normal operation on completion of testing. As an extension of this prior work, this paper reports further results on studies of the problem based on the use of Limpel-Ziv-Walsh coding besides Burrows-Wheeler transformation and demonstrates the feasibility of the suggested methodology with simulation results on ISCAS 85 combinational and ISCAS 89 full-scan sequential benchmark circuits. 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

    Page(s): 59 - 64
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | 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 deployment of multiple nodes at a single location connected via a high speed switch, while grid computing is based on access to remote computing resources, which may be a cluster. Integrating software with multi-layer integration has been the main thrust of research and development in the field of cluster and grid computing. In this paper a novel idea of building a virtual grid over a local area network, deploying resources by pooling has been suggested. The system uses one monitoring server to keep track of various parameters pertaining to the pooled resources and tasks deployed on the system. Software module for integrating the pooled resource has been developed and a prototype model of virtual computing grid using resource pooling (VCGuRP) has been deployed. The paper describes various design and implementation details of the system and also discusses performance issues and their evaluation. 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

    Page(s): 65 - 70
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | 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 firm up to final values micro-instant by micro-instant. This micro-instant protocol is derived from Maliks iterative algorithm used to analyze cyclic digital circuits for being combinational. 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

    Page(s): 71 - 74
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | 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 uncontrolled manner. In this paper a synchronous replica consistency protocol with notification and response is proposed. It deals with keeping the replicas coherent in an effective manner. It can increase the performance and will achieve optimal bandwidth utilization for file replications. The protocol is simulated in Java. It has been compared with other consistency protocols and the experimental results shows that the proposed scheme offers better performance in terms of replication time still maintaining the consistency among replicas. 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

    Page(s): 75 - 78
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | 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 improved broadcast time in comparison to its parent topologies: viz: Folded hypercube and Dualcube. Two separate routing algorithms one-to-one and one-to-all broadcast have been proposed for the new network. View full abstract»

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