Barriers to plantation activities in different agro-ecological zones of Southern India

This paper analyses environmental and socio-economic barriers for plantation activities on local and regional level and investigates the potential for carbon finance to stimulate the increased rates of forest plantation on wasteland, i.e., degraded lands, in southern India. Building on multidisciplinary field work and results from the model GCOMAP, the aim is to (1) identify and characterize the barriers to plantation activities in four agro-ecological zones in the state of Karnataka and (2) investigate what would be required to overcome these barriers and enhance the plantation rate and productivity. The results show that a rehabilitation of the wasteland based on plantation activities is not only possible but also anticipated by the local population and would lead to positive environmental and socio-economic effects at a local level. However, in many cases, the establishment of plantation activities is hindered by a lack of financial resources, low land productivity and water scarcity. Based on the model used and the results from the field work, it can be concluded that certified emission reductions such as carbon credits or other compensatory systems may help to overcome the financial barrier; however, the price needs to be significantly increased if these measures are to have any large-scale impact.

A System-C based Micro architectural Exploration Framework for Latency, Power and Performance Trade-offs of On-Chip Interconnection

We describe a System-C based framework we are developing, to explore the impact of various architectural and microarchitectural level parameters of the on-chip interconnection network elements on its power and performance. The framework enables one to choose from a variety of architectural options like topology, routing policy, etc., as well as allows experimentation with various microarchitectural options for the individual links like length, wire width, pitch, pipelining, supply voltage and frequency. The framework also supports a flexible traffic generation and communication model. We provide preliminary results of using this framework to study the power, latency and throughput of a 4x4 multi-core processing array using mesh, torus and folded torus, for two different communication patterns of dense and sparse linear algebra. The traffic consists of both Request-Response messages (mimicing cache accesses)and One-Way messages. We find that the average latency can be reduced by increasing the pipeline depth, as it enables higher link frequencies. We also find that there exists an optimum degree of pipelining which minimizes energy-delay product.

Trade determination in multi-attribute exchanges

Electronic exchanges are double-sided marketplaces that allow multiple buyers to trade with multiple sellers, with aggregation of demand and supply across the bids to maximize the revenue in the market. Two important issues in the design of exchanges are (1) trade determination (determining the number of goods traded between any buyer-seller pair) and (2) pricing. In this paper we address the trade determination issue for one-shot, multi-attribute exchanges that trade multiple units of the same good. The bids are configurable with separable additive price functions over the attributes and each function is continuous and piecewise linear. We model trade determination as mixed integer programming problems for different possible bid structures and show that even in two-attribute exchanges, trade determination is NP-hard for certain bid structures. We also make some observations on the pricing issues that are closely related to the mixed integer formulations.

Solution of a class of surface water wave scattering problems involving non-reflecting vertical barriers

A large class of scattering problems of surface water waves by vertical barriers lead to mixed boundary value problems for Laplace equation. Specific attentions are paid, in the present article, to highlight an analytical method to handle this class of problems of surface water wave scattering, when the barriers in question are non-reflecting in nature. A new set of boundary conditions is proposed for such non-reflecting barriers and tile resulting boundary value problems are handled in the linearized theory of water waves. Three basic poblems of scattering by vertical barriers are solved. The present new theory of non-reflecting vertical barriers predict new transmission coefficients and tile solutions of tile mathematical problems turn out to be extremely simple and straight forward as compared to the solution for other types of barriers handled previously.

Free Energy Barriers for Escape of Water Molecules from Protein Hydration Layer

Free energy barriers separating interfacial water molecules from the hydration layer at the surface of a protein to the bulk are obtained by using the umbrella sampling method of free energy calculation. We consider hydration layer of chicken villin head piece (HP-36) which has been studied extensively by molecular dynamics simulations. The free energy calculations reveal a strong sensitivity to the secondary structure. In particular, we find a region near the junction of first and second helix that contains a cluster of water molecules which are slow in motion, characterized by long residence times (of the order of 100 ps or more) and separated by a large free energy barrier from the bulk water. However, these ``slow'' water molecules constitute only about 5-10% of the total number of hydration layer water molecules. Nevertheless, they play an important role in stabilizing the protein conformation. Water molecules near the third helix (which is the important helix for biological function) are enthalpically least stable and exhibit the fastest dynamics. Interestingly, barrier height distributions of interfacial water are quite broad for water surrounding all the three helices (and the three coils), with the smallest barriers found for those near the helix-3. For the quasi-bound water molecules near the first and second helices, we use well-known Kramers' theory to estimate the residence time from the free energy surface, by estimating the friction along the reaction coordinate from the diffusion coefficient by using Einstein relation. The agreement found is satisfactory. We discuss the possible biological function of these slow, quasi-bound (but transient) water molecules on the surface.

Performance and variability trade-off with gate-to-source/drain overlap length

The impact of gate-to-source/drain overlap length on performance and variability of 65 nm CMOS is presented. The device and circuit variability is investigated as a function of three significant process parameters, namely gate length, gate oxide thickness, and halo dose. The comparison is made with three different values of gate-to-source/drain overlap length namely 5 nm, 0 nm, and -5 nm and at two different leakage currents of 10 nA and 100 nA. The Worst-Case-Analysis approach is used to study the inverter delay fluctuations at the process corners. The drive current of the device for device robustness and stage delay of an inverter for circuit robustness are taken as performance metrics. The design trade-off between performance and variability is demonstrated both at the device level and circuit level. It is shown that larger overlap length leads to better performance, while smaller overlap length results in better variability. Performance trades with variability as overlap length is varied. An optimal value of overlap length of 0 nm is recommended at 65 nm gate length, for a reasonable combination of performance and variability.

Diversity-Rate Trade-off for Fading Channels with Power Control

We consider a complex, additive, white Gaussian noise channel with flat fading. We study its diversity order vs transmission rate for some known power allocation schemes. The capacity region is divided into three regions. For one power allocation scheme, the diversity order is exponential throughout the capacity region. For selective channel inversion (SCI) scheme, the diversity order is exponential in low and high rate region but polynomial in mid rate region. For fast fading case we also provide a new upper bound on block error probability and a power allocation scheme that minimizes it. The diversity order behaviour of this scheme is same as for SCI but provides lower BER than the other policies.

Free energy barriers for homogeneous crystal nucleation in a eutectic system of binary hard spheres

In this study, the free energy barriers for homogeneous crystal nucleation in a system that exhibits a eutectic point are computed using Monte Carlo simulations. The system studied is a binary hard sphere mixture with a diameter ratio of 0.85 between the smaller and larger hard spheres. The simulations of crystal nucleation are performed for the entire range of fluid compositions. The free energy barrier is found to be the highest near the eutectic point and is nearly five times that for the pure fluid, which slows down the nucleation rate by a factor of 10(-31). These free energy barriers are some of highest ever computed using simulations. For most of the conditions studied, the composition of the critical nucleus corresponds to either one of the two thermodynamically stable solid phases. However, near the eutectic point, the nucleation barrier is lowest for the formation of the metastable random hexagonal closed packed (rhcp) solid phase with composition lying in the two-phase region of the phase diagram. The fluid to solid phase transition is hypothesized to proceed via formation of a metastable rhcp phase followed by a phase separation into respective stable fcc solid phases.

Threats and trade-fffs in resource critical crowdsourcing tasks over networks

In recent times, crowdsourcing over social networks has emerged as an active tool for complex task execution. In this paper, we address the problem faced by a planner to incen-tivize agents in the network to execute a task and also help in recruiting other agents for this purpose. We study this mecha-nism design problem under two natural resource optimization settings: (1) cost critical tasks, where the planner’s goal is to minimize the total cost, and (2) time critical tasks, where the goal is to minimize the total time elapsed before the task is executed. We define a set of fairness properties that should beideally satisfied by a crowdsourcing mechanism. We prove that no mechanism can satisfy all these properties simultane-ously. We relax some of these properties and define their ap-proximate counterparts. Under appropriate approximate fair-ness criteria, we obtain a non-trivial family of payment mech-anisms. Moreover, we provide precise characterizations of cost critical and time critical mechanisms.

Regenerating codes: A reformulated storage-bandwidth trade-off and a new construction

In this paper, the storage-repair-bandwidth (SRB) trade-off curve of regenerating codes is reformulated to yield a tradeoff between two global parameters of practical relevance, namely information rate and repair rate. The new information-repair-rate (IRR) tradeoff provides a different and insightful perspective on regenerating codes. For example, it provides a new motivation for seeking to investigate constructions corresponding to the interior of the SRB tradeoff. Interestingly, each point on the SRB tradeoff corresponds to a curve in the IRR tradeoff setup. We characterize completely, functional repair under the IRR framework, while for exact repair, an achievable region is presented. In the second part of this paper, a rate-half regenerating code for the minimum storage regenerating point is constructed that draws upon the theory of invariant subspaces. While the parameters of this rate-half code are the same as those of the MISER code, the construction itself is quite different.

A trade-off between maxima in efficiency and specific work output of super- and trans-critical CO2 Brayton cycles

Several operational aspects for thermal power plants in general are non-intuitive and involve simultaneous optimization of a number of operational parameters. In the case of solar operated power plants, it is even more difficult due to varying heat source temperatures induced by variability in insolation levels. This paper introduces a quantitative methodology for load regulation of a CO2 based Brayton cycle power plant using the `thermal efficiency and specific work output' coordinate system. The analysis shows that a transcritical CO2 cycle offers more flexibility under part load performance than the supercritical cycle in case of non-solar power plants. However, for concentrated solar power, where efficiency is important, supercritical CO2 cycle fares better than transcritical CO2 cycle. A number of empirical equations relating heat source temperature, high side pressure with efficiency and specific work output are proposed which could assist in generating control algorithms. (C) 2015 Elsevier B.V. All rights reserved.

Energy Harvesting WSNs for Accurately Estimating the Maximum Sensor Reading: Trade-Offs and Optimal Design

Computing the maximum of sensor readings arises in several environmental, health, and industrial monitoring applications of wireless sensor networks (WSNs). We characterize the several novel design trade-offs that arise when green energy harvesting (EH) WSNs, which promise perpetual lifetimes, are deployed for this purpose. The nodes harvest renewable energy from the environment for communicating their readings to a fusion node, which then periodically estimates the maximum. For a randomized transmission schedule in which a pre-specified number of randomly selected nodes transmit in a sensor data collection round, we analyze the mean absolute error (MAE), which is defined as the mean of the absolute difference between the maximum and that estimated by the fusion node in each round. We optimize the transmit power and the number of scheduled nodes to minimize the MAE, both when the nodes have channel state information (CSI) and when they do not. Our results highlight how the optimal system operation depends on the EH rate, availability and cost of acquiring CSI, quantization, and size of the scheduled subset. Our analysis applies to a general class of sensor reading and EH random processes.