Block Sparse Estimator for Grid Matching in Single Snapshot DoA Estimation

In this work, the grid mismatch problem for a single snapshot direction of arrival estimation problem is studied. We derive a Bayesian Cramer-Rao bound for the grid mismatch problem with the errors in variables model and propose a block sparse estimator for grid matching and sparse recovery.

Antelope mating strategies facilitate invasion of grasslands by a woody weed

Intra and interspecific variation in frugivore behaviour can have important consequences for seed dispersal outcomes. However, most information comes from among-species comparisons, and within-species variation is relatively poorly understood. We examined how large intraspecific differences in the behaviour of a native disperser, blackbuck antelope Antilope cervicapra, influence dispersal of a woody invasive, Prosopis juliflora, in a grassland ecosystem. Blackbuck disperse P. juliflora seeds through their dung. In lekking blackbuck populations, males defend clustered or dispersed mating territories. Territorial male movement is restricted, and within their territories males defecate on dung-piles. In contrast, mixed-sex herds range over large areas and do not create dung-piles. We expected territorial males to shape seed dispersal patterns, and seed deposition and seedling recruitment to be spatially localized. Territorial males had a disproportionately large influence on seed dispersal. Adult males removed twice as much fruit as females, and seed arrival was disproportionately high on territories. Also, because lek-territories are clustered, seed arrival was spatially highly concentrated. Seedling recruitment was also substantially higher on territories compared with random sites, indicating that the local concentration of seeds created by territorial males continued into high local recruitment of seedlings. Territorial male behaviour may, thus, result in a distinct spatial pattern of invasion of grasslands by the woody P. juliflora. An ex situ experiment showed no beneficial effect of dung and a negative effect of light on seed germination. We conclude that large intraspecific behavioural differences within frugivore populations can result in significant variation in their effectiveness as seed dispersers. Mating strategies in a disperser could shape seed dispersal, seedling recruitment and potentially plant distribution patterns. These mating strategies may aid in the spread of invasives, such as P. juliflora, which could, in turn, negatively influence the behaviour and ecology of native dispersers.

6PANview: Application performance conscious network monitoring for 6LoWPAN based WSNs

6PANview[1] is a Wireless Sensor Network(WSN) monitoring system for 6LoWPAN/RPL networks which we developed as an overlay network for a WSN application. A monitoring system, while performing its operations for maintaining the health of the monitored network, must also be conscious of its impact on the application performance, and must strive to minimize this impact. To this end, we propose a centralized scheduling algorithm within 6PANview which non-intrusively analyzes application traffic arrival patterns at the base station, identifies network idle periods and schedules monitoring activities. The proposed algorithm finds those periodic sequences which are likely to have given rise to the pattern of arrivals seen at the base station. Parts of those sequences are then extended to coarsely predict future traffic and find epochs where low traffic is predicted, in order to schedule monitoring traffic or other activities at these times. We present simulation results for the proposed prediction and scheduling algorithm and its implementation as part of 6PANview. As an enhancement, we briefly talk about using 6PANview's overlay network architecture for distributed scheduling.

Delay optimal scheduling of a discrete-time batch service queue for point-to-point channel code rate selection

We consider the problem of characterizing the minimum average delay, or equivalently the minimum average queue length, of message symbols randomly arriving to the transmitter queue of a point-to-point link which dynamically selects a (n, k) block code from a given collection. The system is modeled by a discrete time queue with an IID batch arrival process and batch service. We obtain a lower bound on the minimum average queue length, which is the optimal value for a linear program, using only the mean (λ) and variance (σ2) of the batch arrivals. For a finite collection of (n, k) codes the minimum achievable average queue length is shown to be Θ(1/ε) as ε ↓ 0 where ε is the difference between the maximum code rate and λ. We obtain a sufficient condition for code rate selection policies to achieve this optimal growth rate. A simple family of policies that use only one block code each as well as two other heuristic policies are shown to be weakly optimal in the sense of achieving the 1/ε growth rate. An appropriate selection from the family of policies that use only one block code each is also shown to achieve the optimal coefficient σ2/2 of the 1/ε growth rate. We compare the performance of the heuristic policies with the minimum achievable average queue length and the lower bound numerically. For a countable collection of (n, k) codes, the optimal average queue length is shown to be Ω(1/ε). We illustrate the selectivity among policies of the growth rate optimality criterion for both finite and countable collections of (n, k) block codes.

Scheduling for Stable and Reliable Communication Over Multiaccess Channels and Degraded Broadcast Channels

We model communication of bursty sources: 1) over multiaccess channels, with either independent decoding or joint decoding and 2) over degraded broadcast channels, by a discrete-time multiclass processor sharing queue. We utilize error exponents to give a characterization of the processor sharing queue. We analyze the processor sharing queue model for the stable region of message arrival rates, and show the existence of scheduling policies for which the stability region converges to the information-theoretic capacity region in an appropriate limiting sense.

Selective growth of single phase VO2(A, B, and M) polymorph thin films

We demonstrate the growth of high quality single phase films of VO2(A, B, and M) on SrTiO3 substrate by controlling the vanadium arrival rate (laser frequency) and oxidation of the V atoms. A phase diagram has been developed (oxygen pressure versus laser frequency) for various phases of VO2 and their electronic properties are investigated. VO2(A) phase is insulating VO2(B) phase is semi-metallic, and VO2(M) phase exhibits a metal-insulator transition, corroborated by photoelectron spectroscopic studies. The ability to control the growth of various polymorphs opens up the possibility for novel (hetero) structures promising new device functionalities. (C) 2015 Author(s). All article content, except where otherwise noted, is licensed under a Creative Commons Attribution 3.0 Unported License.

Detection of a quantum particle on a lattice under repeated projective measurements

We consider a quantum particle, moving on a lattice with a tight-binding Hamiltonian, which is subjected to measurements to detect its arrival at a particular chosen set of sites. The projective measurements are made at regular time intervals tau, and we consider the evolution of the wave function until the time a detection occurs. We study the probabilities of its first detection at some time and, conversely, the probability of it not being detected (i.e., surviving) up to that time. We propose a general perturbative approach for understanding the dynamics which maps the evolution operator, which consists of unitary transformations followed by projections, to one described by a non-Hermitian Hamiltonian. For some examples of a particle moving on one-and two-dimensional lattices with one or more detection sites, we use this approach to find exact expressions for the survival probability and find excellent agreement with direct numerical results. A mean-field model with hopping between all pairs of sites and detection at one site is solved exactly. For the one-and two-dimensional systems, the survival probability is shown to have a power-law decay with time, where the power depends on the initial position of the particle. Finally, we show an interesting and nontrivial connection between the dynamics of the particle in our model and the evolution of a particle under a non-Hermitian Hamiltonian with a large absorbing potential at some sites.

Effects of site stiffness and source to receiver distance on surface wave tests' results

By using six 4.5 Hz geophones, surface wave tests were performed on four different sites by dropping freely a 65 kg mass from a height of 5 m. The receivers were kept far away from the source to eliminate the arrival of body waves. Three different sources to nearest receiver distances (S), namely, 46 m, 56 m and 66 m, were chosen. Dispersion curves were drawn for all the sites. The maximum wavelength (lambda(max)), the maximum depth (d(max)) up to which exploration can be made and the frequency content of the signals depends on the site stiffness and the value of S. A stiffer site yields greater values of lambda(max) and d(max). For stiffer sites, an increase in S leads to an increase in lambda(max). The predominant time durations of the signals increase from stiffer to softer sites. An inverse analysis was also performed based on the stiffness matrix approach in conjunction with the maximum vertical flexibility coefficient of ground surface to establish the governing mode of excitation. For the Site 2, the results from the surface wave tests were found to compare reasonably well with that determined on the basis of cross boreholes seismic tests. (C) 2015 Elsevier Ltd. All rights reserved.

An approximation to the QoS aware throughput region of a tree network under IEEE 802.15.4 CSMA/CA with application to wireless sensor network design

In the context of wireless sensor networks, we are motivated by the design of a tree network spanning a set of source nodes that generate packets, a set of additional relay nodes that only forward packets from the sources, and a data sink. We assume that the paths from the sources to the sink have bounded hop count, that the nodes use the IEEE 802.15.4 CSMA/CA for medium access control, and that there are no hidden terminals. In this setting, starting with a set of simple fixed point equations, we derive explicit conditions on the packet generation rates at the sources, so that the tree network approximately provides certain quality of service (QoS) such as end-to-end delivery probability and mean delay. The structures of our conditions provide insight on the dependence of the network performance on the arrival rate vector, and the topological properties of the tree network. Our numerical experiments suggest that our approximations are able to capture a significant part of the QoS aware throughput region (of a tree network), that is adequate for many sensor network applications. Furthermore, for the special case of equal arrival rates, default backoff parameters, and for a range of values of target QoS, we show that among all path-length-bounded trees (spanning a given set of sources and the data sink) that meet the conditions derived in the paper, a shortest path tree achieves the maximum throughput. (C) 2015 Elsevier B.V. All rights reserved.

Efficient Low Complexity Power Allocation Policies for Wireless Communication Systems Guaranteeing QoS

We consider near-optimal policies for a single user transmitting on a wireless channel which minimize average queue length under average power constraint. The power is consumed in transmission of data only. We consider the case when the power used in transmission is a linear function of the data transmitted. The transmission channel may experience multipath fading. Later, we also extend these results to the multiuser case. We show that our policies can be used in a system with energy harvesting sources at the transmitter. Next we consider data users which require minimum rate guarantees. Finally we consider the system which has both data and real time users. Our policies have low computational complexity, closed form expression for mean delays and require only the mean arrival rate with no queue length information.

Position-dependent velocity of an effective temperature point for the estimation of the thermal diffusivity of solids

A new approach is proposed to estimate the thermal diffusivity of optically transparent solids at ambient temperature based on the velocity of an effective temperature point (ETP), and by using a two-beam interferometer the proposed concept is corroborated. 1D unsteady heat flow via step-temperature excitation is interpreted as a `micro-scale rectilinear translatory motion' of an ETP. The velocity dependent function is extracted by revisiting the Fourier heat diffusion equation. The relationship between the velocity of the ETP with thermal diffusivity is modeled using a standard solution. Under optimized thermal excitation, the product of the `velocity of the ETP' and the distance is a new constitutive equation for the thermal diffusivity of the solid. The experimental approach involves the establishment of a 1D unsteady heat flow inside the sample through step-temperature excitation. In the moving isothermal surfaces, the ETP is identified using a two-beam interferometer. The arrival-time of the ETP to reach a fixed distance away from heat source is measured, and its velocity is calculated. The velocity of the ETP and a given distance is sufficient to estimate the thermal diffusivity of a solid. The proposed method is experimentally verified for BK7 glass samples and the measured results are found to match closely with the reported value.