Abstract

This paper presents an efficient indexing and retrieval scheme for searching in document image databases. In many non-European languages, optical character recognizers are not very accurate. Word spotting - word image matching - may instead be used to retrieve word images in response to a word image query. The approaches used for word spotting so far, dynamic time warping and/or nearest neighbor search, tend to be slow. Here indexing is done using locality sensitive hashing (LSH) - a technique which computes multiple hashes - using word image features computed at word level. Efficiency and scalability is achieved by content-sensitive hashing implemented through approximate nearest neighbor computation. We demonstrate that the technique achieves high precision and recall (in the 90% range), using a large image corpus consisting of seven Kalidasa’s (a well known Indian poet of antiquity) books in the Telugu language. The accuracy is comparable to using dynamic time warping and nearest neighbor search while the speed is orders of magnitude better - 20000 word images can be searched in milliseconds.

Abstract

In this paper, we explain a personalized agricultural advisory system called eSagu, which has been developed to improve the performance and utilization of agriculture technology and help Indian farmers. In eSagu, rather than visiting the crop in person, the agricultural expert delivers the expert advice at regular intervals (once in one or two weeks) to each farm by getting the crop status in the form of digital photographs and other information. During 2004-06, through eSagu, agricultural expert advices delivered for about 6000 farms covering six crops. The results show that the expert advices helped the farmers to achieve savings in capital investment and improved the crop yield. Mainly, the data warehouse of farm histories has been developed which is providing the crop related information to the agricultural expert in an integrated manner for generating a quality agricultural expert advice. In this paper, after explaining eSagu and its advantages, we discuss how data warehouse of farm histories is enabling agricultural expert to deliver a quality expert advice. We also discuss some research issues to improve the performance of eSagu.

Abstract

Abstract The trans Watson-Crick/Watson-Crick family of base pairs represent a geometric class which play important structural and possible functional roles in the ribosome, tRNA and other functional RNA molecules. They nucleate base triplets and quartets, participate as loop closing terminal base pairs in hair pin motifs and are also responsible for several tertiary interactions which enable sequentially distant regions to interact with each other in. Eleven representative examples spanning nine systems belonging to this geometric family of RNA base pairs, having widely different occurrence statistics in the PDB database, were studied at the HF/6-31G (d, p) level using Morokuma decomposition, Atoms in Molecule as well as Natural Bond Orbital methods in the optimized gas phase geometries and in their crystal structure geometries respectively. The BSSE and deformation energy corrected interaction energy values for the optimized geometries for non protonated base pairs ranged from -8.19 kcal/mol to -21.84 kcal/mol and compared favorably with those of canonical base pairs. The interaction energies of these base pairs, in their respective crystal geometries, were however lesser to varying extents and in one case, that of A:A W:W trans, it was actually found to be positive. The variation in RMSD between the two geometries was also large and ranged from 0.32 2.19 . Our analysis shows that the hydrogen bonding characteristics and interaction energies obtained, correlated with the nature and type of hydrogen bonds between base pairs; but the occurrence frequencies, interaction energies and geometric variabilities were conspicuous by the absence of any apparent correlation. Instead, the functional geometry of base pairs and the nature of their local interaction energy hyperspace, in conjunction with tertiary and neighboring group interaction potentials in the global context, could be correlated with the identities of free and bound hydrogen bond donor/acceptor groups present in interacting bases. It also suggests that the concept of isostericity alone may not always determine covariation potentials for base pairs, particularly those which may be participating in functional dynamics. These considerations are more important than the absolute values of the interaction energies in their respective optimized geometries in rationalizing their occurrences in functional RNAs. They highlight the importance of revising some of the existing DNA based structure analysis approaches and may have significant implications for RNA structure and dynamics, especially in the context of structure prediction algorithms.

Abstract

In this paper, we focus on the information in speech data and discuss the research issues involved in collecting, organizing,indexing, retrieving and summarization of speech data. We share our experience about the problems and prospects in collection of spoken language data. We highlight some of the procedures,standards that need to be adapted in collecting the speech data, and discuss our plan to collect the speech data for all the languages in Indian sub-continent and from the neighboring countries

Abstract

A distribution-based classification approach and a set of recently developed texture measures are applied to rotation-invariant texture classification. The performance is compared to that obtained with the well-known circular-symmetric autoregressive random field (CSAR) model approach. A difficult classification problem of 15 different Brodatz textures and seven rotation angles is used in experiments. The results show much better performance for our approach than for the CSAR features. A detailed analysis of the confusion matrices and the rotation angles of misclassified samples produces several interesting observations about the classification problem and the features used in this study

Abstract

This paper presents a multi-component; distributed system (MuDiS) based solution for building a virtual learning environment which combines a wide range of technology, tools and digital gaming concepts to create an interactive tool for science education. MuDiS has been designed to be an extensible and easy-to-use system. The proposed environment is intended for designing and monitoring of educational content as well as creating a platform for exploring ideas. The system allows exchange of educational content and integrate different pedagogical approaches to learning and teaching under the same environment. We have developed a virtual physics lab that serves as an exemplar for the proposed virtual environment. We present the design details of the physics lab and discuss its performance.

Abstract

This work deals with the problem of fault-tolerant communication over networks, some of whose nodes are corrupted by a centralized byzantine adversary. The extant literature’s perspective of the problem of reliable communication, especially in networks whose topology is known, is that of a simple problem to which even some naive solutions (like message-flooding etc.) turn out to be reasonably efficient. In this paper, we give an example of a directed graph and a non threshold adversary structure, which will require every protocol for perfect reliable unicast to transmit exponential number of bits in order to reliably transmit a single bit.

Abstract

In the perfectly secure message transmission (PSMT) problem, two synchronized non-faulty players (or processors), the Sender S and the Receiver R are connected by n wires (each of which facilitates 2-way communication); S has a message, represented by a sequence oft elements from a finite field, that he wishes to send to R; after exchanging messages in phases R should correctly obtain S 's message, while an adversary listening on and actively controlling any set of t (or less) wires should have no information about S 's message. Similarly, in the problem of perfect reliable message transmission (PRMT), the receiver R should correctly obtain S's message, in spite of the adversary actively controlling any set oft (or less) wires.

Abstract

This paper considers the problem of unicasting in wireless ad hoc networks. Unicasting is the problem of finding a route between a source and a destination and forwarding the message from the source to the destination. In theory, models that have been used oversimplify the problem of route discovery in ad hoc networks. The achievement of this paper is threefold. First we use a more general model in which nodes can have different transmission and interference ranges and we present a new routing algorithm for wireless ad hoc networks that has several nice features. We then combine our algorithm with that of known greedy algorithms to arrive at an average case efficient routing algorithm in the situation that GPS information is available. Finally we show how to schedule unicast traffic between a set of source-destination pairs by providing a proper vertex coloring of the nodes in the wireless ad hoc network. Our coloring algorithm achieves a O(Δ)–coloring that is locally distinct within the 2-hop neighborhood of any node.

Abstract

This paper describes the procedure of vulnerability assessment for building structures in AP India. The objective of this paper is to define the building classification and development of damage probability matrix using fragility curve parameters of the building structures in Andhra Pradesh by using the avaiable information in Vulnerability Atlas of India developed by Building Materials and Technology promotion council Govt. of India (BMTPC).