Optimal Trajectory Generation for Convergence to a Rectilinear Path

This paper presents a strategy to determine the shortest path of a fixed-wing Miniature Air Vehicle (MAV), constrained by a bounded turning rate, to eventually fly along a given straight line, starting from an arbitrary but known initial position and orientation. Unlike the work available in the literature that solves the problem using the Pontryagin's Minimum Principle (PMP) the trajectory generation algorithm presented here considers a geometrical approach which is intuitive and easy to understand. This also computes the explicit solution for the length of the optimal path as a function of the initial configuration. Further, using a 6-DOF model of a MAV the generated optimal path is tracked by an autopilot consisting of proportional-integral-derivative (PID) controllers. The simulation results show the path generation and tracking for different cases.

Optimal sequential wireless relay placement on a random lattice path

Our work is motivated by impromptu (or ``as-you-go'') deployment of wireless relay nodes along a path, a need that arises in many situations. In this paper, the path is modeled as starting at the origin (where there is the data sink, e.g., the control center), and evolving randomly over a lattice in the positive quadrant. A person walks along the path deploying relay nodes as he goes. At each step, the path can, randomly, either continue in the same direction or take a turn, or come to an end, at which point a data source (e.g., a sensor) has to be placed, that will send packets to the data sink. A decision has to be made at each step whether or not to place a wireless relay node. Assuming that the packet generation rate by the source is very low, and simple link-by-link scheduling, we consider the problem of sequential relay placement so as to minimize the expectation of an end-to-end cost metric (a linear combination of the sum of convex hop costs and the number of relays placed). This impromptu relay placement problem is formulated as a total cost Markov decision process. First, we derive the optimal policy in terms of an optimal placement set and show that this set is characterized by a boundary (with respect to the position of the last placed relay) beyond which it is optimal to place the next relay. Next, based on a simpler one-step-look-ahead characterization of the optimal policy, we propose an algorithm which is proved to converge to the optimal placement set in a finite number of steps and which is faster than value iteration. We show by simulations that the distance threshold based heuristic, usually assumed in the literature, is close to the optimal, provided that the threshold distance is carefully chosen. (C) 2014 Elsevier B.V. All rights reserved.

A shortest path tree based algorithm for relay placement in a wireless sensor network and its performance analysis

In this paper, we study a problem of designing a multi-hop wireless network for interconnecting sensors (hereafter called source nodes) to a Base Station (BS), by deploying a minimum number of relay nodes at a subset of given potential locations, while meeting a quality of service (QoS) objective specified as a hop count bound for paths from the sources to the BS. The hop count bound suffices to ensure a certain probability of the data being delivered to the BS within a given maximum delay under a light traffic model. We observe that the problem is NP-Hard. For this problem, we propose a polynomial time approximation algorithm based on iteratively constructing shortest path trees and heuristically pruning away the relay nodes used until the hop count bound is violated. Results show that the algorithm performs efficiently in various randomly generated network scenarios; in over 90% of the tested scenarios, it gave solutions that were either optimal or were worse than optimal by just one relay. We then use random graph techniques to obtain, under a certain stochastic setting, an upper bound on the average case approximation ratio of a class of algorithms (including the proposed algorithm) for this problem as a function of the number of source nodes, and the hop count bound. To the best of our knowledge, the average case analysis is the first of its kind in the relay placement literature. Since the design is based on a light traffic model, we also provide simulation results (using models for the IEEE 802.15.4 physical layer and medium access control) to assess the traffic levels up to which the QoS objectives continue to be met. (C) 2014 Elsevier B.V. All rights reserved.

Species and acoustic diversity of bats in a palaeotropical wet evergreen forest in southern India

The Western Ghats of India is among the top 25 biodiversity hotspots in the world. About 43% of the reported 117 bat species in India are found in this region, but few quantitative studies of bat echolocation calls and diversity have been carried out here thus far. A quantitative study of bat diversity was therefore conducted using standard techniques, including mist-netting, acoustical and roost surveys in the wet evergreen forests of Kudremukh National Park in the Western Ghats of Karnataka. A total of 106 bats were caught over 108 sampling nights, representing 17 species, 3 belonging to Megachiroptera and 14 to Microchiroptera. Acoustical and roost surveys added three more species, two from Microchiroptera and one from Megachiroptera. Of these 20 species, 4 belonged to the family Pteropodidae, 10 to Vespertilionidae, 3 to Rhinolophidae, 2 to Megadermatidae and 1 to Hipposideridae. We recorded the echolocation calls of 13 of the 16 microchiropteran species, of which the calls of 4 species (Pipistrellus coromandra, Pipistrellus affinis, Pipistrellus ceylonicus and Harpiocephalus harpia) have been recorded for the first time. Discriminant function analyses of the calls of 11 species provided 91.7% correct classification of individuals to their respective species, indicating that the echolocation calls could be used successfully for non-invasive acoustic surveys and monitoring of bat species in the future.

AN OPTIMUM SHRINKAGE ESTIMATOR BASED ON MINIMUM-PROBABILITY-OF-ERROR CRITERION AND APPLICATION TO SIGNAL DENOISING

We address the problem of designing an optimal pointwise shrinkage estimator in the transform domain, based on the minimum probability of error (MPE) criterion. We assume an additive model for the noise corrupting the clean signal. The proposed formulation is general in the sense that it can handle various noise distributions. We consider various noise distributions (Gaussian, Student's-t, and Laplacian) and compare the denoising performance of the estimator obtained with the mean-squared error (MSE)-based estimators. The MSE optimization is carried out using an unbiased estimator of the MSE, namely Stein's Unbiased Risk Estimate (SURE). Experimental results show that the MPE estimator outperforms the SURE estimator in terms of SNR of the denoised output, for low (0 -10 dB) and medium values (10 - 20 dB) of the input SNR.

A phylogeny of the only ground-dwelling radiation of Cyrtodactylus (Squamata, Gekkonidae): diversification of Geckoella across peninsular India and Sri Lanka

The subgenus Geckoella, the only ground-dwelling radiation within Cyrtodactylus, closely overlaps in distribution with brookii group Hemidactylus in peninsular India and Sri Lanka. Both groups have Oligocene origins, the latter with over thrice as many described species. The striking difference in species richness led us to believe that Geckoella diversity is underestimated, and we sampled for Geckoella across peninsular India. A multi-locus phylogeny reveals Geckoella diversity is hugely underestimated, with at least seven undescribed species, doubling previously known richness. Strikingly, the new species correspond to cryptic lineages within described Indian species (complexes); a number of these endemic lineages from the hills of peninsular India outside the Western Ghats, highlighting the undocumented diversity of the Indian dry zone. The Geckoella phylogeny demonstrates deep splits between the Indian species and Sri Lankan G. triedrus, and between Indian dry and wet zone clades, dating back to the late Oligocene. Geckoella and brookii group Hemidactylus show contrasting diversification patterns. Geckoella shows signals of niche conservatism and appears to have retained its ancestral forest habitat. The late Miocene burst in speciation in Geckoella may be linked to the expansion of rain forests during the mid-Miocene climatic optimum and subsequent fragmentation with increasing late Miocene aridification. (C) 2014 Elsevier Inc. All rights reserved.

Local spatial structure of forest biomass and its consequences for remote sensing of carbon stocks

Advances in forest carbon mapping have the potential to greatly reduce uncertainties in the global carbon budget and to facilitate effective emissions mitigation strategies such as REDD+ (Reducing Emissions from Deforestation and Forest Degradation). Though broad-scale mapping is based primarily on remote sensing data, the accuracy of resulting forest carbon stock estimates depends critically on the quality of field measurements and calibration procedures. The mismatch in spatial scales between field inventory plots and larger pixels of current and planned remote sensing products for forest biomass mapping is of particular concern, as it has the potential to introduce errors, especially if forest biomass shows strong local spatial variation. Here, we used 30 large (8-50 ha) globally distributed permanent forest plots to quantify the spatial variability in aboveground biomass density (AGBD in Mgha(-1)) at spatial scales ranging from 5 to 250m (0.025-6.25 ha), and to evaluate the implications of this variability for calibrating remote sensing products using simulated remote sensing footprints. We found that local spatial variability in AGBD is large for standard plot sizes, averaging 46.3% for replicate 0.1 ha subplots within a single large plot, and 16.6% for 1 ha subplots. AGBD showed weak spatial autocorrelation at distances of 20-400 m, with autocorrelation higher in sites with higher topographic variability and statistically significant in half of the sites. We further show that when field calibration plots are smaller than the remote sensing pixels, the high local spatial variability in AGBD leads to a substantial ``dilution'' bias in calibration parameters, a bias that cannot be removed with standard statistical methods. Our results suggest that topography should be explicitly accounted for in future sampling strategies and that much care must be taken in designing calibration schemes if remote sensing of forest carbon is to achieve its promise.

Texture Evolution in Nanocrystalline Nickel: Critical Role of Strain Path

The effect of strain path change during rolling on the evolution of deformation texture has been studied for nanocrystalline (nc) nickel. An orthogonal change in strain path, as imparted by alternating rolling and transverse directions, leads to a texture with a strong Bs {110}aOE (c) 112 > component. The microstructural features, after large deformation, show distinct grain morphology for the cross-rolled material. Crystal plasticity simulations, based on viscoplastic self-consistent model, indicate that slip involving partial dislocation plays a vital role in accommodating plastic deformation during the initial stages of rolling. The brass-type texture evolved after cross rolling to large strains is attributed to change in strain path.

And yet it shrinks: A novel method for correcting bias in forest tree growth estimates caused by water-induced fluctuations

Accuracy in tree woody growth estimates is important to global carbon budget estimation and climate-change science. Tree growth in permanent sampling plots (PSPs) is commonly estimated by measuring stem diameter changes, but this method is susceptible to bias resulting from water-induced reversible stem shrinkage. In the absence of bias correction, temporal variability in growth is likely to be overestimated and incorrectly attributed to fluctuations in resource availability, especially in forests with high seasonal and inter-annual variability in water. We propose and test a novel approach for estimating and correcting this bias at the community level. In a 50-ha PSP from a seasonally dry tropical forest in southern India, where tape measurements have been taken every four years from 1988 to 2012, for nine trees we estimated bias due to reversible stem shrinkage as the difference between woody growth measured using tree rings and that estimated from tape. We tested if the bias estimated from these trees could be used as a proxy to correct bias in tape-based growth estimates at the PSP scale. We observed significant shrinkage-related bias in the growth estimates of the nine trees in some censuses. This bias was strongly linearly related to tape-based growth estimates at the level of the PSP, and could be used as a proxy. After bias was corrected, the temporal variance in growth rates of the PSP decreased, while the effect of exceptionally dry or wet periods was retained, indicating that at least a part of the temporal variability arose from reversible shrinkage-related bias. We also suggest that the efficacy of the bias correction could be improved by measuring the proxy on trees that belong to different size classes and census timing, but not necessarily to different species. Our approach allows for reanalysis - and possible reinterpretation of temporal trends in tree growth, above ground biomass change, or carbon fluxes in forests, and their relationships with resource availability in the context of climate change. (C) 2014 Elsevier B.V. All rights reserved.

A Grassmann path from AdS(3) to flat space

We show that interpreting the inverse AdS(3) radius 1/l as a Grassmann variable results in a formal map from gravity in AdS(3) to gravity in flat space. The underlying reason for this is the fact that ISO(2, 1) is the Inonu-Wigner contraction of SO(2, 2). We show how this works for the Chern-Simons actions, demonstrate how the general (Banados) solution in AdS(3) maps to the general flat space solution, and how the Killing vectors, charges and the Virasoro algebra in the Brown-Henneaux case map to the corresponding quantities in the BMS3 case. Our results straightforwardly generalize to the higher spin case: the recently constructed flat space higher spin theories emerge automatically in this approach from their AdS counterparts. We conclude with a discussion of singularity resolution in the BMS gauge as an application.

Path Following Using Trajectory Shaping Guidance

Unmanned vehicle path following by pursuing a virtual target moving along the path is considered. Limitations for pure pursuit guidance are analyzed while following the virtual target on curved paths. Trajectory shaping guidance is proposed as an alternate guidance scheme for a general curvature path. It is proven that under certain tenable assumptions trajectory shaping guidance yields an identical path as that of the virtual target. By linear analysis it is shown that the convergence to the path for trajectory shaping guidance is twice as fast as pure pursuit. Simulations highlight significant improvement in position errors by using trajectory shaping guidance. Comparative simulation studies comply with analytic findings and present better performance as compared with pure pursuit and a nonlinear guidance methodology from the literature. Experimental validation supports the analytic and simulations studies as the guidance laws are implemented on a radio-controlled car in a laboratory environment.

Operand Isolation Circuits with Reduced Overhead for Low Power Data-Path Design

Dynamic power dissipation due to redundant switching is an important metric in data-path design. This paper focuses on the use of ingenious operand isolation circuits for low power design. Operand isolation attempts to reduce switching by clamping or latching the output of a first level of combinational circuit. This paper presents a novel method using power supply switching wherein both PMOS and NMOS stacks of a circuit are connected to the same power supply. Thus, the output gets clamped or latched to the power supply value with minimal leakage. The proposed circuits make use of only two transistors to clamp the entire Multiple Input Multiple Output (MIMO) block. Also, the latch-based designs have higher drive strength in comparison to the existing methods. Simulation results have shown considerable area reduction in comparison to the existing techniques without increasing timing overhead.

Reduced Hornbill Abundance Associated with Low Seed Arrival and Altered Recruitment in a Hunted and Logged Tropical Forest

Logging and hunting are two key direct threats to the survival of wildlife in the tropics, and also disrupt important ecosystem processes. We investigated the impacts of these two factors on the different stages of the seed dispersal cycle, including abundance of plants and their dispersers and dispersal of seeds and recruitment, in a tropical forest in north-east India. We focused on hornbills, which are important seed dispersers in these forests, and their food tree species. We compared abundances of hornbill food tree species in a site with high logging and hunting pressures (heavily disturbed) with a site that had no logging and relatively low levels of hunting (less disturbed) to understand logging impacts on hornbill food tree abundance. We compared hornbill abundances across these two sites. We, then, compared the scatter-dispersed seed arrival of five large-seeded tree species and the recruitment of four of those species. Abundances of hornbill food trees that are preferentially targeted by logging were two times higher in the less disturbed site as compared to the heavily disturbed site while that of hornbills was 22 times higher. The arrival of scatter-dispersed seeds was seven times higher in the less disturbed site. Abundances of recruits of two tree species were significantly higher in the less disturbed site. For another species, abundances of younger recruits were significantly lower while that of older recruits were higher in the heavily disturbed site. Our findings suggest that logging reduces food plant abundance for an important frugivore-seed disperser group, while hunting diminishes disperser abundances, with an associated reduction in seed arrival and altered recruitment of animal-dispersed tree species in the disturbed site. Based on our results, we present a conceptual model depicting the relationships and pathways between vertebrate-dispersed trees, their dispersers, and the impacts of hunting and logging on these pathways.

Regeneration of Juvenile Woody Plants after Fire in a Seasonally Dry Tropical Forest of Southern India

Woody tree species in seasonally dry tropical forests are known to have traits that help them to recover from recurring disturbances such as fire. Two such traits are resprouting and rapid post-fire growth. We compared survival and growth rates of regenerating small-sized individuals (juveniles) of woody tree species after dry season fire (February-March) at eight adjacent pairs of burnt and unburnt transects in a seasonally dry tropical forest in southern India. Juveniles were monitored at 3-mo intervals between August 2009 and August 2010. High juvenile survivorship (>95%) was observed in both burnt and unburnt areas. Growth rates of juveniles, analyzed at the community level as well as for a few species individually (especially fast-growing ones), were distinctly higher in burnt areas compared to unburnt areas after a fire event, particularly during the pre-monsoon season immediately after a fire. Rapid growth by juveniles soon after a fire may be due to lowered competition from other vegetative forms such as grasses, possibly aided by the availability of resources stored belowground. Such an adaptation would allow a juvenile bank to be retained in the understory of a dry forest, from where individuals can grow to a possible fire-tolerant size during favorable conditions.

Path Sensitive Cache Analysis Using Cache Miss Paths

Cache analysis plays a very important role in obtaining precise Worst Case Execution Time (WCET) estimates of programs for real-time systems. While Abstract Interpretation based approaches are almost universally used for cache analysis, they fail to take advantage of its unique requirement: it is not necessary to find the guaranteed cache behavior that holds across all executions of a program. We only need the cache behavior along one particular program path, which is the path with the maximum execution time. In this work, we introduce the concept of cache miss paths, which allows us to use the worst-case path information to improve the precision of AI-based cache analysis. We use Abstract Interpretation to determine the cache miss paths, and then integrate them in the IPET formulation. An added advantage is that this further allows us to use infeasible path information for cache analysis. Experimentally, our approach gives more precise WCETs as compared to AI-based cache analysis, and we also provide techniques to trade-off analysis time with precision to provide scalability.