Use of climate information for farm-level decision making: rainfed groundnut in southern India

The production of rainfed crops in semi-arid tropics exhibits large variation in response to the variation in seasonal rainfall. There are several farm-level decisions such as the choice of cropping pattern, whether to invest in fertilizers, pesticides etc., the choice of the period for planting, plant population density etc. for which the appropriate choice (associated with maximum production or minimum risk) depends upon the nature of the rainfall variability or the prediction for a specific year. In this paper, we have addressed the problem of identifying the appropriate strategies for cultivation of rainfed groundnut in the Anantapur region in a semi-arid part of the Indian peninsula. The approach developed involves participatory research with active collaboration with farmers, so that the problems with perceived need are addressed with the modern tools and data sets available. Given the large spatial variation of climate and soil, the appropriate strategies are necessarily location specific. With the approach adopted, it is possible to tap the detailed location specific knowledge of the complex rainfed ecosystem and gain an insight into the variety of options of land use and management practices available to each category of stakeholders. We believe such a participatory approach is essential for identifying strategies that have a favourable cost-benefit ratio over the region considered and hence are associated with a high chance of acceptance by the stakeholders. (C) 2002 Elsevier Science Ltd. All rights reserved.

Doubly spectral stochastic finite element method (DSSFEM) for random field problems

Uncertainties in complex dynamic systems play an important role in the prediction of a dynamic response in the mid- and high-frequency ranges. For distributed parameter systems, parametric uncertainties can be represented by random fields leading to stochastic partial differential equations. Over the past two decades, the spectral stochastic finite-element method has been developed to discretize the random fields and solve such problems. On the other hand, for deterministic distributed parameter linear dynamic systems, the spectral finite-element method has been developed to efficiently solve the problem in the frequency domain. In spite of the fact that both approaches use spectral decomposition (one for the random fields and the other for the dynamic displacement fields), very little overlap between them has been reported in literature. In this paper, these two spectral techniques are unified with the aim that the unified approach would outperform any of the spectral methods considered on their own. An exponential autocorrelation function for the random fields, a frequency-dependent stochastic element stiffness, and mass matrices are derived for the axial and bending vibration of rods. Closed-form exact expressions are derived by using the Karhunen-Loève expansion. Numerical examples are given to illustrate the unified spectral approach.

Location and conformation of pantothenate and its derivatives in Mycobacterium tuberculosis pantothenate kinase: insights into enzyme action

Previous studies of complexes of Mycobacterium tuberculosis PanK (MtPanK) with nucleotide diphosphates and non-hydrolysable analogues of nucleoside triphosphates in the presence or the absence of pantothenate established that the enzyme has dual specificity for ATP and GTP, revealed the unusual movement of ligands during enzyme action and provided information on the effect of pantothenate on the location and conformation of the nucleotides at the beginning and the end of enzyme action. The X-ray analyses of the binary complexes of MtPanK with pantothenate, pantothenol and N-nonylpantothenamide reported here demonstrate that in the absence of nucleotide these ligands occupy, with a somewhat open conformation, a location similar to that occupied by phosphopantothenate in the `end' complexes, which differs distinctly from the location of pantothenate in the closed conformation in the ternary `initiation' complexes. The conformation and the location of the nucleotide were also different in the initiation and end complexes. An invariant arginine appears to play a critical role in the movement of ligands that takes place during enzyme action. The work presented here completes the description of the locations and conformations of nucleoside diphosphates and triphosphates and pantothenate in different binary and ternary complexes, and suggests a structural rationale for the movement of ligands during enzyme action. The present investigation also suggests that N-alkylpantothenamides could be phosphorylated by the enzyme in the same manner as pantothenate.

Efficient Algorithms for Computing All Low s-t Edge Connectivities and Related Problems

Given an undirected unweighted graph G = (V, E) and an integer k ≥ 1, we consider the problem of computing the edge connectivities of all those (s, t) vertex pairs, whose edge connectivity is at most k. We present an algorithm with expected running time Õ(m + nk3) for this problem, where |V| = n and |E| = m. Our output is a weighted tree T whose nodes are the sets V1, V2,..., V l of a partition of V, with the property that the edge connectivity in G between any two vertices s ε Vi and t ε Vj, for i ≠ j, is equal to the weight of the lightest edge on the path between Vi and Vj in T. Also, two vertices s and t belong to the same Vi for any i if and only if they have an edge connectivity greater than k. Currently, the best algorithm for this problem needs to compute all-pairs min-cuts in an O(nk) edge graph; this takes Õ(m + n5/2kmin{k1/2, n1/6}) time. Our algorithm is much faster for small values of k; in fact, it is faster whenever k is o(n5/6). Our algorithm yields the useful corollary that in Õ(m + nc3) time, where c is the size of the global min-cut, we can compute the edge connectivities of all those pairs of vertices whose edge connectivity is at most αc for some constant α. We also present an Õ(m + n) Monte Carlo algorithm for the approximate version of this problem. This algorithm is applicable to weighted graphs as well. Our algorithm, with some modifications, also solves another problem called the minimum T-cut problem. Given T ⊆ V of even cardinality, we present an Õ(m + nk3) algorithm to compute a minimum cut that splits T into two odd cardinality components, where k is the size of this cut.

Modeling of active fiber composite for delamination sensing

In order to demonstrate the feasibility of Active Fiber Composites (AFC) as sensors for detecting damage, a pretwisted strip made of AFC with symmetric free-edge delamination is considered in this paper. The strain developed on the top/bottom of the strip is measured to detect and assess delamination. Variational Asymptotic Method (VAM) is used in the development of a non-classical non-linear cross sectional model of the strip. The original three dimensional (3D) problem is simplified by the decomposition into two simpler problems: a two-dimensional (2D) problem, which provides in a compact form the cross-sectional properties using VAM, and a non-linear one-dimensional (1D) problem along the length of the beam. This procedure gives the non-linear stiffnesses, which are very sensitive to damage, at any given cross-section of the strip. The developed model is used to study a special case of cantilevered laminated strip with antisymmetric layup, loaded only by an axial force at the tip. The charge generated in the AFC lamina is derived in closed form in terms of the 1D strain measures. It is observed that delamination length and location have a definite influence on the charge developed in the AFC lamina. Also, sensor voltage output distribution along the length of the beam is obtained using evenly distributed electrode strip. These data could in turn be used to detect the presence of damage.