By Topic

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

Date 18-21 Dec. 2007

Filter Results

Displaying Results 1 - 25 of 138
  • 15th International Conference on Advanced Computing and Communications - Cover

    Page(s): c1
    Save to Project icon | Request Permissions | PDF file iconPDF (355 KB)  
    Freely Available from IEEE
  • 15th International Conference on Advanced Computing and Communications - Title page

    Page(s): i - iii
    Save to Project icon | Request Permissions | PDF file iconPDF (106 KB)  
    Freely Available from IEEE
  • 15th International Conference on Advanced Computing and Communications - Copyright

    Page(s): iv
    Save to Project icon | Request Permissions | PDF file iconPDF (44 KB)  
    Freely Available from IEEE
  • 15th International Conference on Advanced Computing and Communications - TOC

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

    Page(s): xiv - xv
    Save to Project icon | Request Permissions | PDF file iconPDF (122 KB)  
    Freely Available from IEEE
  • Message from the Program Chair

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

    Page(s): xvii - xviii
    Save to Project icon | Request Permissions | PDF file iconPDF (102 KB)  
    Freely Available from IEEE
  • Program Committee

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

    Page(s): xxi - xxii
    Save to Project icon | Request Permissions | PDF file iconPDF (113 KB)  
    Freely Available from IEEE
  • Tutorial 1: Utility-Oriented Grid Computing and the Gridbus Middleware

    Page(s): xxiii - xxiv
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (142 KB) |  | HTML iconHTML  

    In this paper, we carry out the performance evaluation of satellite image resampling software, which follows service-oriented architecture and the service executes on a distributed operating system. The parameters, which are used for performance evaluation, include load balancing under multiple instance execution, overheads of process migration, effect of file caching and replication and performance of resampling service under different file access modes. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Tutorial 2: Search Engines in Indian Languages

    Page(s): xxv
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (111 KB)  

    This paper extends the idea of presenting multimedia information through presentation by developing a PowerPoint Annotation Tool (PPAT) for teachers to insert various annotations into PowerPoint slides. The tool is built on multi-monitor technologies, aiming to make the presentations more instructional. Many studies have shown that annotations can support remembering, thinking, and clarifying to promote learning. In this paper, we use the PPAT to build up the referential connections of visual and verbal learning contents in PowerPoint presentation. Thus, learners can easily comprehend the learning contents through those additional annotations embedded into the slideshow of PowerPoint presentation. In fact, The PPAT is a teaching-aided tool that can extend the comment features of PowerPoint presentation and it also provides a multi-monitor mechanism to display teaching materials and annotations on the same projection screen or the different projection screens according to instructional arrangement for reaching the desired learning effectiveness. The PPAT supports two operational modes: one is authoring mode and the other is presentation mode. A teacher can insert various annotations containing some instructional purposes into a well-designed PowerPoint file in authoring mode, and then the teacher operates presentation mode to present this PowerPoint file. Those annotations will be orderly displayed on PowerPoint presentation among the desired instructional arrangements during authoring mode. From the information displaying viewpoints of PowerPoint presentation by using the PPAT, there are two different displaying views, a teaching view and a learning view, to show teaching contents and learning contents for teacher and students respectively. In the teaching view, the teacher can control all of the thumbnails of PowerPoint slides and their embedded annotations on his/her computer monitor, and display the PowerPoint slides and their embedded annotations in sequence or - in parallel on the projection screen. In the learning view, students can see the slides and annotations, if needed, in learning activity. Through the cognitive connection between main learning contents shown by PowerPoint slides and various annotation illustrating instructional comments on the slides, learners can easily and quickly comprehend the learning content to enhance the teaching and learning effectiveness. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Tutorial 3: Infrastructure Protection from Distributed Denial of Service Attacks

    Page(s): xxvi
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (120 KB)  

    This paper presents a new method for solving planted-motif problem, which is a well-known motif-finding problem in the field of computational molecular biology. Motif-finding problem is considered to be a NP-complete problem and constant research is being carried out to solve the stated problem using some deterministic algorithm in polynomial time. This paper is an attempt to solve the plated-motif problem using a deterministic method in polynomial time. The method presented is not an exact algorithm but the probability of success is quite high. Significance of the technique is its simplicity and time efficiency. The presented technique is implemented as one of the modules in our general-purpose tool by the name "Sequence Comparison and Analysis Tool" for solving a number of sequence comparison problems encountered in the field of bioinformatics. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Tutorial 4: Multicores: Architectures, Programming and Beyond

    Page(s): xxvii
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (110 KB) |  | HTML iconHTML  

    In this paper, we present a simple and novel technique for classification of multiple channel electro-oculogram signals (EOG) using VHDL based hardware. The classifier is based on deterministic finite automata (DFA). The system is capable of classifying sixteen different EOG signals. The viability of the system was tested by performing online experiments with able bodied subjects. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Tutorial 5: Management of Transactions on Mobile Database Systems

    Page(s): xxviii
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (112 KB) |  | HTML iconHTML  

    This tutorial is all about the management of mobile transactions- clean and malicious-on Mobile Database System. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • CDAC-ACS Lecture Award 2007 Talk: Petaflop Computing

    Page(s): xxix
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (103 KB) |  | HTML iconHTML  

    Padmashree Dr Vijay Bhatkar pioneered India's massively parallel processing initiative and built the first of the country's supercomputers in the PARAM series at the Centre for Development of Advanced Computing that he set up. Dr. Vijay P. Bhaskar is Founder Executive Director of Centre for Development of Advanced Computing Organization (C-DAC). View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Cryptography and security - future challenges and issues

    Page(s): xxxii - xxxiii
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (138 KB) |  | HTML iconHTML  

    We live in an era of unimaginably rapidly advancing and amazing technologies that enable instantaneous flow of information - anytime, anywhere. The convergence of computers and networks has been the key force behind the development of these awe inspiring technologies. Increasing use of systems built using these information technologies (IT) is having a profound impact on our everyday lives. These technologies are becoming all pervasive and ubiquitous. An illustration of this is provided by the development of mobile communication. There is a flurry of activity in the development of novel applications that run on this infrastructure. Phones have gone from wireless to small to smart to a situation where they can be used as entertainment devices (games, radios, mp3 players, cameras and now television), for serious personal applications(for location services, messaging and authentication, banking) in addition to being used also to talk to people. The fast paced development of these applications has been enabled by the flexibility of the underlying computing platform and the communication infrastructure. The key perquisite for the continued development and successful exploitation of IT is the notion of assurance. Information Assurance involves - Conducting those operations that protect and defend information and information systems by ensuring availability, integrity, authentication, confidentiality, and non-repudiation. This includes providing for restoration of information systems by incorporating protection, detection, and reaction capabilities. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Handwriting Recognition Paradigms in Interpretation, Transcription, and Search Applications

    Page(s): xxxiv - xxxv
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (136 KB) |  | HTML iconHTML  

    Recognition of handwritten documents has been a success in well-constrained domains, such as automatic recognition of handwritten postal addresses and validating bank check amounts. However, unconstrained offline handwriting recognition is still a very challenging task when lexicon size is very large. Thus, the large amount of handwritten material of the world, historical manuscripts and contemporary documents, are still inaccessible by search engines. We will describe our seminal work in real-time handwriting recognition which paved the way for the first deployment of end-to-end handwritten address interpretation system. We will also present loosely constrained applications such as indexing and searching hand-filled forms and unconstrained handwritten documents. We will conclude with an overview of our current research in transcription of historical manuscripts and using handwriting for web security. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A New Approach for Test Pattern Generation for Digital Cores in Mixed Signal Circuits

    Page(s): 3 - 8
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (593 KB) |  | HTML iconHTML  

    This paper proposes a new algorithm in an optical network using online routing with the application of optical buffers comprising of delay-lines (FDLs). The model for the algorithm has been theoretically developed and the corresponding call connection probability has been calculated. The limitation on the amount of delay permitted per packet has been addressed by limiting the number of delay-lines used in switch fabric of the network. The algorithm proposed is deterministic. It employs the concept of online routing to implement 'look ahead' characteristics and thus aims to design an intelligent optical network. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Scheduling of Cores for Power Constrained System-on-Chip Testing

    Page(s): 9 - 14
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (220 KB) |  | HTML iconHTML  

    A system-on-chip (SOC) may contain numerous cores. If each core has its own distinct set of tests then in order to reduce the total testing time some of these cores may be tested in parallel. The order of such testing is determined by a schedule. An efficient scheduling algorithm can bring about a considerable reduction in the total test time of chips for large scale testing. This paper proposes a heuristic for scheduling large number of cores in SOC testing. The scheduling algorithm is very fast and hence can tackle the problem of scheduling in SOCs having numerous cores. It works with constrained power and limited SOC TAM width and aims to reduce total test time. The elegance of the heuristic is supported by the extensive experimental results. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Preventing the Side-Channel Leakage of Masked AES S-Box

    Page(s): 15 - 20
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (176 KB) |  | HTML iconHTML  

    Masking of gates is one of the most popular techniques to prevent Differential Power Analysis (DPA) of AES S- Boxes. However due to the presence of glitches in circuits even masked circuits leak side-channel information. Moti- vated by this fact, we proposed a balanced masked multi- plier where the inputs are synchronized either by sequential components or controlled AND logic, that can be a possible solution for preventing DPA attack on masked implementa- tion of AES S-Boxes. Detailed SPICE results are shown to support the claim that the modifications indeed reduce the vulnerability of the masked multiplier against DPA attacks. Keywords: Side Channel Attacks, Masked Multiplier, AES S-box, Differential Power Analysis View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An Efficient Approach to Develop Secure Scan Tree for Crypto-Hardware

    Page(s): 21 - 26
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (284 KB) |  | HTML iconHTML  

    Scan chain based test has been a common and useful method for testing VLSI designs due to its high controllability and observability. However scan chains have recently been shown to pose security threat to cryptographic chips. Researchers have proposed various prevention architectures like scan tree followed by a compactor, locking and TAP architecture. But these solutions lead to huge hardware overhead and slow the process of testing. In this paper we propose a novel secured scan tree architecture which has very low gate overhead, high fault coverage and is amenable to fast online testing. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Modification to Circular-Scan Architecture to Improve Test Data Compression

    Page(s): 27 - 33
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (2709 KB) |  | HTML iconHTML  

    The authors in (B. Arslan and A. Orailuglu, 2004) propose circular-scan chain architecture to reduce test time and cost in SOCs. The technique presented in this paper is based on circular-scan architecture (B. Arslan and A. Orailuglu, 2004). The basic idea of circular-scan architecture is use of the captured response of the previously applied pattern as a template for the next pattern while allowing the full observation of the captured response. Proposed architecture achieves further compression by updating conflicting bits internally instead of using data Input pin. Experimental results showed an improvement between 3.5% to 7.8% in test data compression in 5 largest ISCAS89 circuits. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Applying Aspect-Oriented Approach for Instance Adaptation for Object-Oriented Databases

    Page(s): 35 - 40
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (243 KB) |  | HTML iconHTML  

    Developing object-oriented database for web applications may not remain constant and may vary to a large extent due to a variety of reasons like correcting mistakes, adding new features or any changes in the structure of the real world artifacts modeled in the database. Class versioning is one of the evolution strategy employed that addressing the above issues. The existing strategy for instance adaptation introduces the adaptation code directly into the class versions upon evolution. Consequently, if the behavior of a routine needs to be changed and maintenance has to be performed on all the class versions it was introduced. A new approach for instance adaptation is achieved by encapsulating the instance adaptation code through aspects - abstractions introduced by aspect-oriented programming that localize cross-cutting concerns. A web-based student database system was developed with different versions and the versioning problem was solved using update/backdate aspects with selective lazy conversion. The update/backdate aspects are invoked whenever version incompatibility arises and selective lazy conversion aspect is invoked when the condition for converting objects into new version is satisfied and this converts only a subset of the old version objects into new version. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An Agile Technique for Agent Based Goal Refinement to Elicit Soft Goals in Goal Oriented Requirements Engineering

    Page(s): 41 - 47
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (278 KB) |  | HTML iconHTML  

    Goal oriented requirements engineering methods have gained significance because they define the requirements in terms of goals which are well understood by the stakeholders. Although the goals are extracted from the stakeholders having good domain knowledge, but extracting these goals is a challenging task in the goal oriented methods, especially the soft goals about which even the stakeholders have very little knowledge. To extract the soft goals, the high level goals are decomposed and a guiding model for goal refinement involving active participation of stakeholders, is essential. We propose a methodology driven approach involving maximum participation of stakeholders for eliciting the soft goals, where the soft goals are elicited by the stakeholders from the high-level goals through the process of Goal Refinement, involving Agents. The elicited goals are compiled through a software program called Activity Card Compiler. The methodology is used for Soft Goal Elicitation for the development of an Web Based News Application. We present an analysis of our results. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Static Analysis Based Application Specific Dispatch Table Compaction

    Page(s): 48 - 53
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (197 KB) |  | HTML iconHTML  

    Object oriented programming languages are increasingly used in software development for embedded systems as they support elegant programming and easier extensibility. Dispatch table is introduced to support message passing mechanism. For a large number of classes and methods the dispatch table is also larger and needs substantial amount of memory space. But memory size is the main constraint in embedded systems. To overcome this bottleneck we have proposed a static analysis based approach for application specific customization of the dispatch table by removing redundant entries. Hence the size of the table is smaller. Our scheme is independent of underlying storage structure of the table. We have tested our proposed approach on real life applications. We have found that our proposed method can safely remove significant number redundant entries during dispatch table construction and hence enhancing the system performance. View full abstract»

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