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).

Abstract

Urbanization is rapidly increasing all over the world. Past two decades in India many cities have attracted large population. Reasons being the belief of better education health care job/business prospects etc. For meeting the demands of population density many high-rise structures and large public gathering places are emerging in cities. Places where few thousands of people can meet are quite common in major cities. It is due to this reason evacuation at the public gathering places has gained a lot of importance

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

Shortest path computation has always been a subject of study and research in the history of computer science. In this paper we introduce and initiate the study of the problem of finding the shortest path in a privacy preserving manner, in presence of single convex polygonal obstacle. We also propose an efficient, elegant and simple solution for the problem.

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 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

The growth of Internet has opened up new avenues for business and corporate model. Information sharing over Internet can help business houses in better cooperative strategic planning and growth. However despite such an impact, business houses are quite reluctant to share information because of the fear of information leakage. In this paper we study and propose an elegant, simple and practical solution for the problem of how can one party avail the data clustering service of another party without affecting each other's privacy. In our solution, we introduce the following two problems: (a) Secure multiparty computation of a depth of a query point, (b) Secure multiparty computation of whether a query point is a hull vertex. To the best of our knowledge this is the first time in literature that the aforementioned problems have been considered in privacy preserving framework.

Abstract

Automatic identification of a script in a given document image facilitates many important applications such as automatic archiving of multilingual documents, searching online archives of document images and for the selection of script specific OCR in a multilingual environment. In this paper, we model script identification as a texture classification problem and examine a global approach inspired by human visual perception. A generalised, hierarchical framework is proposed for script identification. A set of energy and intensity space features for this task is also presented. The framework serves to establish the utility of a global approach to the classification of scripts. The framework has been tested on two datasets: 10 Indian and 13 world scripts. The obtained accuracy of identification across the two datasets is above 94%. The results demonstrate that the framework can be used to develop solutions for script identification from document images across a large set of script classes.

Abstract

Unsupervised methods for automatic vessel segmentation from retinal images are attractive when only small datasets, with associated ground truth markings, are available. We present an unsupervised, curvature-based method for segmenting the complete vessel tree from colour retinal images. The vessels are modeled as trenches and the medial lines of the trenches are extracted using the curvature information derived from a novel curvature estimate. The complete vessel structure is then extracted using a modified region growing method. Testresults of the algorithm using the DRIVE dataset are superior to previously reported unsupervised methods and comparable to those obtained with the supervised methods.

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.