Vegetation structure and composition of tropical evergreen and deciduous forests in Uttara Kannada District, Western Ghats under different disturbance regimes

In the present paper, we present the structure and composition of tropical evergreen and deciduous forests in the Western Ghats monitored under a long-term programme involving Indian Institute of Science, Earthwatch and volunteer investigators from HSBC. Currently, there is limited evidence on the status and dynamics of tropical forests in the context of human disturbance and climate change. Observations made in this study show that the `more disturbed' evergreen and one of the deciduous plots have low species diversity compared to the less-disturbed forests. There are also variations in the size class structure in the more and `less disturbed' forests of all the locations. The variation is particularly noticeable in the DBH size class 10 - 15 cm category. When biomass stock estimates are considered, there was no significant difference between evergreen and deciduous forests. The difference in biomass stocks between `less disturbed' and `more disturbed' forests within a forest type is also low. Thus, the biomass and carbon stock has not been impacted despite the dependence of communities on the forests. Periodic and long-term monitoring of the status and dynamics of the forests is necessary in the context of potential increased human pressure and climate change. There is, therefore, a need to inform the communities of the impact of extraction and its effect on regeneration so as to motivate them to adopt what may be termed as ``adaptive resource management'', so as to sustain the flow of forest products.

Asymptotic Bounds on the Power-Delay Tradeoff for Fading Point-to-Point Links From Geometric Bounds on the Stationary Distribution of the Queue Length

The optimal power-delay tradeoff is studied for a time-slotted independently and identically distributed fading point-to-point link, with perfect channel state information at both transmitter and receiver, and with random packet arrivals to the transmitter queue. It is assumed that the transmitter can control the number of packets served by controlling the transmit power in the slot. The optimal tradeoff between average power and average delay is analyzed for stationary and monotone transmitter policies. For such policies, an asymptotic lower bound on the minimum average delay of the packets is obtained, when average transmitter power approaches the minimum average power required for transmitter queue stability. The asymptotic lower bound on the minimum average delay is obtained from geometric upper bounds on the stationary distribution of the queue length. This approach, which uses geometric upper bounds, also leads to an intuitive explanation of the asymptotic behavior of average delay. The asymptotic lower bounds, along with previously known asymptotic upper bounds, are used to identify three new cases where the order of the asymptotic behavior differs from that obtained from a previously considered approximate model, in which the transmit power is a strictly convex function of real valued service batch size for every fade state.

Unique Covering Problems with Geometric Sets

The Exact Cover problem takes a universe U of n elements, a family F of m subsets of U and a positive integer k, and decides whether there exists a subfamily(set cover) F' of size at most k such that each element is covered by exactly one set. The Unique Cover problem also takes the same input and decides whether there is a subfamily F' subset of F such that at least k of the elements F' covers are covered uniquely(by exactly one set). Both these problems are known to be NP-complete. In the parameterized setting, when parameterized by k, Exact Cover is W1]-hard. While Unique Cover is FPT under the same parameter, it is known to not admit a polynomial kernel under standard complexity-theoretic assumptions. In this paper, we investigate these two problems under the assumption that every set satisfies a given geometric property Pi. Specifically, we consider the universe to be a set of n points in a real space R-d, d being a positive integer. When d = 2 we consider the problem when. requires all sets to be unit squares or lines. When d > 2, we consider the problem where. requires all sets to be hyperplanes in R-d. These special versions of the problems are also known to be NP-complete. When parameterizing by k, the Unique Cover problem has a polynomial size kernel for all the above geometric versions. The Exact Cover problem turns out to be W1]-hard for squares, but FPT for lines and hyperplanes. Further, we also consider the Unique Set Cover problem, which takes the same input and decides whether there is a set cover which covers at least k elements uniquely. To the best of our knowledge, this is a new problem, and we show that it is NP-complete (even for the case of lines). In fact, the problem turns out to be W1]-hard in the abstract setting, when parameterized by k. However, when we restrict ourselves to the lines and hyperplanes versions, we obtain FPT algorithms.

Computer generated hologram with geometric occlusion using GPU-accelerated depth buffer rasterization for three-dimensional display

We present a method of rapidly producing computer-generated holograms that exhibit geometric occlusion in the reconstructed image. Conceptually, a bundle of rays is shot from every hologram sample into the object volume.We use z buffering to find the nearest intersecting object point for every ray and add its complex field contribution to the corresponding hologram sample. Each hologram sample belongs to an independent operation, allowing us to exploit the parallel computing capability of modern programmable graphics processing units (GPUs). Unlike algorithms that use points or planar segments as the basis for constructing the hologram, our algorithm's complexity is dependent on fixed system parameters, such as the number of ray-casting operations, and can therefore handle complicated models more efficiently. The finite number of hologram pixels is, in effect, a windowing function, and from analyzing the Wigner distribution function of windowed free-space transfer function we find an upper limit on the cone angle of the ray bundle. Experimentally, we found that an angular sampling distance of 0:01' for a 2:66' cone angle produces acceptable reconstruction quality. © 2009 Optical Society of America.

Geometric optimization methods for the analysis of gene expression data

DNA microarrays provide such a huge amount of data that unsupervised methods are required to reduce the dimension of the data set and to extract meaningful biological information. This work shows that Independent Component Analysis (ICA) is a promising approach for the analysis of genome-wide transcriptomic data. The paper first presents an overview of the most popular algorithms to perform ICA. These algorithms are then applied on a microarray breast-cancer data set. Some issues about the application of ICA and the evaluation of biological relevance of the results are discussed. This study indicates that ICA significantly outperforms Principal Component Analysis (PCA).

Receptivity To Free-Stream Disturbance Waves For Hypersonic Flow Over A Blunt Cone

A high-order shock-fitting finite difference scheme is studied and used to do direction numerical simulation (DNS) of hypersonic unsteady flow over a blunt cone with fast acoustic waves in the free stream, and the receptivity problem in the blunt cone hypersonic boundary layers is studied. The results show that the acoustic waves are the strongest disturbance in the blunt cone hypersonic boundary layers. The wave modes of disturbance in the blunt cone boundary layers are first, second, and third modes which are generated and propagated downstream along the wall. The results also show that as the frequency decreases, the amplitudes of wave modes of disturbance increase, but there is a critical value. When frequency is over the critial value, the amplitudes decrease. Because of the discontinuity of curvature along the blunt cone body, the maximum amplitudes as a function of frequencies are not monotone.