Abstract

n this paper, we have proposed speculative locking (SL) protocols to improve the performance of distributed databasesystems (DDBSs) by trading extra processing resources. In SL, a transaction releases the lock on the data object whenever itproduces corresponding after-image during its execution. By accessing both before and after-images, the waiting transaction carriesout speculative executions and retains one execution based on the termination (commit or abort) mode of the preceding transactions.By carrying out multiple executions for a transaction, SL increases parallelism without violating serializability criteria. Under the naiveversion of SL, the number of speculative executions of the transaction explodes with data contention. By exploiting the fact that asubmitted transaction is more likely to commit than abort, we propose the SL variants that process transactions efficiently bysignificantly reducing the number of speculative executions. The simulation results indicate that even with manageable extraresources, these variants significantly improve the performance over two-phase locking in the DDBS environments where transactionsspend longer time for processing and transaction-aborts occur frequently.

Abstract

No Results Found

Abstract

In this papcr, wc propose an approach for continuous speech recognition by spotting consonant-vowel (CV) units. The niain issues in spotting CV units are the location of anchor points and labelling the regions around these anchor points using suitable classifiers. The vowel onset points (VOPs) trave bcen used as an- chor points. The distribution capturing ability of autoassociative neural network (AA”) models is explored for detection of VOPs in continnous speech. We consider support vector machine (SVM) based classifiers due to their ability of generalisation from limited training data and also due to their inherent discriminative learn- ing. The CV spotting approach for continuous speech recognition has bccn dcmonstratcd for scntcnccs in Indian languages

Abstract

When an active bedrock fault ruptures, the movement along the fault propagates through the overlying soil and produces zones of intense shear. If the fault movement propagates upto or near the ground surface, the damage to constructed facilities due to faulting, in conjunction with that induced by strong ground motion, can be significant. This paper contributes to the understanding of the response of soil deposits to the underlying bedrock fault displacement. In the conventional attenuation relationship, peak ground acceleration shows maximum value at the closest distance from the fault. However, in the real observations, sometimes it is found that the damage near to the surface fault is not maximum, instead it is high little away from the surface rupture zone. To understand the above-mentioned response of soil deposits, we attempted to develop a new application to Applied Element Method (AEM) by modeling the fault rupture zone. In this, we study the behavior of dip-slip faults. The effect of the slip velocity on the ground motion is studied first and then the attenuation of PGA in the near fault zone is studied. Effect of the material properties is also discussed.

Abstract

This paper presents a software tool for performing the static and dynamic analysis of regular and simple multi-storied structures. This analysis procedure is based on IS 1893:2002 (Part I), Criteria for Earthquake Resistant Design of Structures. This tool is a windows based software program developed in Visual Basic. The tool provides a userfriendly GUI for the calculation of base shear and its distribution over the height of the structure, depending on the input parameters. Usual input parameters are structural dimensions, type of structure, soil type, purpose of structure and location. Though this tool is simple, can be used for verification of design within short time. This tool is aimed to help students, architects and engineers during design of earthquake resistant structures.

Abstract

Sketch matching algorithms are commonly used for indexing and retrieval of documents based on printed or hand-drawn sketches. One could use a hand-held computer to do sketch-based queries to a database containing hand-drawn and printed sketches. We present an on-line hand-drawn sketch matching algorithm based on a line-based representation of sketches. A distance measure is defined for comparing two sketches based on this representation. The algorithm is computationally efficient and achieves a recall rate of 88.44% at the same precision, when tested on a database of 150 sketches collected from 5 users.

Abstract

Development of OCRs for Indian script is an active area of activity today. Indian scripts present great challenges to an OCR designer due to the large number of letters in the alphabet, the sophisticated ways in which they combine, and the complicated graphemes they result in. The problem is compounded by the unstructured manner in which popular fonts are designed. There is a lot of common structure in the different Indian scripts. In this paper, we argue that a number of automatic and semi-automatic tools can ease the development of recognizers for new font styles and new scripts. We discuss briefly three such tools we developed and show how they have helped build new OCRs. An integrated approach to the design of OCRs for all Indian scripts has great benefits. We are building OCRs for all Indian languages following this approach as part of a system to provide tools to create content in them.

Abstract

This paper describes the character recognition process from printed documents containing Hindi and Telugu text. Hindi and Telugu are among the most popular languages in India. The bilingual recognizer is based on Principal Component Analysis followed by support vector classification. This attains an overall accuracy of approximately 96.7%. Extensive experimentation is carried out on an independent test set of approximately 200000 c

Abstract

In this paper, a rule-based approach is introduced for retrieving images from an image database. Compared to image-based queries, this approach allows the user to query in a more natural language. Performance is demonstrated with simple queries on a generic image database and sophisticated queries on a database of face images.

Abstract

—In this paper, we propose a novel method for compression of multiple view images using algebraic constraints. The redundancy present in multiview images is considerably different from that in isolated images or video streams. A three view relationship based on a Trilinear Tensor is employed for view prediction and residual computation. The geometric redundancy in the form of common world structure is exploited during this.