Abstract

The present study outlines an approach to classify forest density and to estimate canopy closure of the forest of the Andaman and Nicobar archipelago. The vector layers generated for the study area using satellite data was validated with the field knowledge of the surveyed ground control points. The methodology adopted in this present analysis is three-tiered. First, the density stratification into five zones using visual

Abstract

In this paper, we study the inherent tradeoff between the network connectivity, phase complexity and communication complexity of perfectly reliable message transmission (PRMT) problem in undirected synchronous network, tolerating a mixed adversary A^ b, t,) i who has unbounded computing power and can corrupt£(, and tf nodes in the network in Byzantine and fail-stop fashion respectively.

Abstract

In the problem of USMT [1, 2] 1, a sender S and a receiver R. are connected by n= 2t+ 1 bi-directional synchronous channels (also called as wires) such that any t out of the n channels are corrupted in Byzantine fashion by an adversary jA. t, having unbounded computing power. S intends to communicate a message m to R (where m£ F and I> 1 with F being a finite field) by executing a protocol such that after interacting in terms of phases, 2 R outputs m with probability at least (1—2~") and At gets no information about m. In [2], it shown that in any single phase USMT protocol with n= 2t+ 1,Xi>'J'+ 1, where 5 denotes the message space of S, X, denotes the set of possible data sent through the ith wire and 0< 6<^ is the error probability. 4 In [2], a single phase inefficient USMT protocol with communication complexity approximately matching the above bound has been proposed. We present a single phase polynomial time USMT protocol whose communication complexity is

Abstract

Protocols for Generalized Oblivious Transfer(GOT) were introduced by Ishai and Kushilevitz [10]. They built it by reducing GOT protocols to standard 1-out-of-2 oblivious transfer protocols based on private protocols. In our protocols, we provide alternative reduction by using secret sharing schemes instead of private protocols. We therefore show that there exist a natural correspondence between GOT and general secret sharing schemes and thus the techniques and tools developed for the latter can be applied equally well to the former.

Abstract

(URMT) problem, two non-faulty players, the sender S and the receiver R are part of a synchronous network modeled as a directed graph. S has a message that he wishes to send to R; the challenge is to design a protocol such that after exchanging messages as per the protocol, the receiver R should correctly obtain S’s message with arbitrarily small error probability δ, in spite of the influence of a Byzantine adversary that may actively corrupt up to t nodes in the network (we denote such a URMT protocol as (t,(1− δ))-reliable). While it is known that (2t+ 1) vertex disjoint directed paths from S to R are necessary and sufficient for (t, 1)-reliable URMT (that is with zero error probability), we prove that a strictly weaker condition, which we define and denote as (2t, t)-special-connectivity, together with just (t+ 1) vertex disjoint directed paths from S to R, is necessary and sufficient for (t,(1− δ))-reliable URMT with arbitrarily small (but non-zero) error probability, δ. Thus, we demonstrate the power of randomization in the context of reliable message transmission. In fact, for any positive integer k> 0, we show that there always exists a digraph Gk such that (k, 1)-reliable URMT is impossible over Gk whereas there exists a (2k,(1− δ))-reliable URMT protocol, δ> 0 in Gk. In a digraph G on which (t,(1− δ))-reliable URMT is possible, an edge is called critical if the deletion of that edge renders (t,(1− δ))-reliable URMT impossible. We give an example of a digraph G on n vertices such that G has Ω (n2) critical edges. This is quite baffling since no such graph exists for the case of perfect reliable message transmission (or equivalently (t, 1)-reliable URMT) or when the underlying graph is undirected. Such is the anomalous behavior of URMT protocols (when “randomness meet directedness”) that it makes it extremely hard to design efficient protocols over arbitrary digraphs. However, if URMT is possible between every pair of vertices in the network, then we present efficient protocols for the same.

Abstract

For content level access, very often database needs the query as a sample image. However, the image may contain private information and hence the user does not wish to reveal the image to the database. Private content based image retrieval (PCBIR) deals with retrieving similar images from an image database without revealing the content of the query image - not even to the database server. We propose algorithms for PCBIR, when the database is indexed using hierarchical index structure or hash based indexing scheme. Experiments are conducted on real datasets with popular features and state of the art data structures. It is observed that specialty and subjectivity of image retrieval (unlike SQL queries to a relational database) enables in computationally efficient yet private solutions.

Abstract

Extraction of anatomical structures (landmarks), such as optic disk (OD), fovea and blood vessels, from fundus images is useful in automatic diagnosis. Current approaches largely use spatial relationship among the landmarks’ position for detection. In this paper, we present an appearance-based method for detecting fovea and OD from colour images. The strategy used for detection is based on improving the local contrast which is achieved by combining information from two spectral channels of the given image. The proposed method has been successfully tested on different datasets and the results show 96% detection for fovea and 91% detection for OD (a total of 502 and 531 images for fovea and OD are taken respectively).

Abstract

Capillary Non-Perfusion (CNP) is a condition in diabetic retinopathy where blood ceases to flow to certain parts of the retina, potentially leading to blindness. This paper presents a solution for automatically detecting and segmenting CNP regions from fundus fluorescein angiograms (FFAs). CNPs are modelled as valleys, and a novel multiresolution technique for trough-based valley detection is presented. The proposed algorithm has been tested on 40 images and validated against expert-marked ground truth. Obtained results are presented as a receiver operating characteristic (ROC) curve. The area under this curve is 0.842 and the distance of ROC from the ideal point (0,1) is 0.31.

Abstract

Projection of a Markov process with constant rates of transition to a small number of observable aggregated states can result in complex kinetics with memory. Here, we define the entropy production along a single sequence of aggregated states and show that it obeys detailed and integral fluctuation theorems. More importantly, we prove that projection shifts the distribution of entropy production over the ensemble of paths for a nonequilibrium process toward one characteristic of a system at equilibrium. This statement represents an analog of the second law of thermodynamics for path-dependent entropies and thus a new form of constraint of irreversible systems. Numeric examples are presented to illustrate these ideas.

Abstract

DNA structures and their variations are important in several contexts such as chromatin remodeling and transcriptional initiation and regulation etc. Theneed for computational characterization of DNA structures associated with DNA bending/binding, B ? A transitions in protein-DNA complexes, molecular dynamics trajectory analysis and also in the context of strand orientation, especially in DNA triplexes and quadruplexes, have given rise to several fine grained parameters, such as backbone conformations, sugar pucker and ? angle, local strand orientation, base pair and base pair step parameters, backbone base inclination etc. With their unpaired bases, extensive non helical regions, non-canonical base pairs and tertiary interactions, RNA molecules host a large variety of recurrent structural and functional motifs and parameters such as zp, defined in the context of double helical DNA base pairs and base pair steps and effectively used for A and B DNA differentiations, can not be used for computationally driven automated mining of complex RNA motifs. Thus for RNA structures, though several motif mining algorithms based on backbone conformational parameters and involving computational detection and analysis of base pairs and their parameters are available, there are no reports of studies involving parameters which simultaneously involve backbone conformation as well as base pairing geometry. In this work, we propose a novel set of parameters, Omega Torsions and Omega Distances, which captures backbone geometries at base(i) ? base(j) interaction points and which can be used to computationally characterize structural features both in RNA and DNA. Pseudo torsion angles: Omega ?: P(i)-C4'(i)-C4'(j)-P(j); Omega ?: P(i+1)-C4'(i)-C4'(j)-P(j+1) Omega 1: P(i)-C4'(i)-C4'(j)-P(j+1); Omega 2: P(i+1)-C4'(i)-C4'(j)-P(j) Pseudo bond distance: Omega distance: C4'(i)-C4'(j) Where 'i' and 'j' are bases interacting through hydrogen bonds. We report the results of our benchmarking studies of Omega parameters, as applied to protein DNA complexes including e.g. TATA box-TBP complexes and nucleosomal DNA, with standard DNA structure classification parameters, such as zp, and of our preliminary studies on their effectiveness in classifying local geometries of RNA strands in different base pairing contexts. We conclude that omega parameters can potentially lead to the development of a single set of parameters which can be used to characterize both DNA as well as RNA structures.