Surprising observation of large anthropogenic aerosol fraction over the ``near-pristine'' southern Bay of Bengal: Climate implications

The Bay of Bengal (BoB), a small oceanic region surrounded by landmasses with distinct natural and anthropogenic activities and under the influence of seasonally changing airmass types, is characterized by a rather complex and highly heterogeneous aerosol environment. Concurrent measurements of the physical, optical, and chemical (offline analysis) properties of BoB aerosols, made onboard extensive ship-cruises and aircraft sorties during Integrated Campaign for Aerosols, gases and Radiation Budget of March-April 2006, and satellite-retrieved aerosol optical depths and derived parameters, were synthesized following a synergistic approach to delineate the anthropogenic fraction to the composite aerosol parameters and its spatial variation. Quite interestingly and contrary to the general belief, our studies revealed that, despite of the very high aerosol loading (in the marine atmospheric boundary layer as well as in the vertical column) over the northern BoB and a steep decreasing gradient toward the southern latitudes, the anthropogenic fraction showed a steady increase from North to South (where no obvious anthropogenic source regions exist). Consequently, the direct radiative forcing at the top of the atmosphere due to anthropogenic aerosols remained nearly constant over the entire BoB with values in the range from -3.3 to -3.6 Wm(-2). This interesting finding, beyond doubts calls for a better understanding of the complex aerosol system over the BoB through more focused field campaigns.

Hydrologic drought prediction under climate change: Uncertainty modeling with Dempster-Shafer and Bayesian approaches

Representation and quantification of uncertainty in climate change impact studies are a difficult task. Several sources of uncertainty arise in studies of hydrologic impacts of climate change, such as those due to choice of general circulation models (GCMs), scenarios and downscaling methods. Recently, much work has focused on uncertainty quantification and modeling in regional climate change impacts. In this paper, an uncertainty modeling framework is evaluated, which uses a generalized uncertainty measure to combine GCM, scenario and downscaling uncertainties. The Dempster-Shafer (D-S) evidence theory is used for representing and combining uncertainty from various sources. A significant advantage of the D-S framework over the traditional probabilistic approach is that it allows for the allocation of a probability mass to sets or intervals, and can hence handle both aleatory or stochastic uncertainty, and epistemic or subjective uncertainty. This paper shows how the D-S theory can be used to represent beliefs in some hypotheses such as hydrologic drought or wet conditions, describe uncertainty and ignorance in the system, and give a quantitative measurement of belief and plausibility in results. The D-S approach has been used in this work for information synthesis using various evidence combination rules having different conflict modeling approaches. A case study is presented for hydrologic drought prediction using downscaled streamflow in the Mahanadi River at Hirakud in Orissa, India. Projections of n most likely monsoon streamflow sequences are obtained from a conditional random field (CRF) downscaling model, using an ensemble of three GCMs for three scenarios, which are converted to monsoon standardized streamflow index (SSFI-4) series. This range is used to specify the basic probability assignment (bpa) for a Dempster-Shafer structure, which represents uncertainty associated with each of the SSFI-4 classifications. These uncertainties are then combined across GCMs and scenarios using various evidence combination rules given by the D-S theory. A Bayesian approach is also presented for this case study, which models the uncertainty in projected frequencies of SSFI-4 classifications by deriving a posterior distribution for the frequency of each classification, using an ensemble of GCMs and scenarios. Results from the D-S and Bayesian approaches are compared, and relative merits of each approach are discussed. Both approaches show an increasing probability of extreme, severe and moderate droughts and decreasing probability of normal and wet conditions in Orissa as a result of climate change. (C) 2010 Elsevier Ltd. All rights reserved.

Indigenous Knowledge for Biodiversity Conservation

Indigenous peoples with a historical continuity of resource-use practices often possess a broad knowledge base of the behavior of complex ecological systems in their own localities. This knowledge has accumulated through a long series of observations transmitted from generation to generation. Such ''diachronic'' observations can be of great value and complement the ''synchronic''observations on which western science is based. Where indigenous peoples have depended, for long periods of time, on local environments for the provision of a variety of resources, they have developed a stake in conserving, and in some cases, enhancing, biodiversity. They are aware that biological diversity is a crucial factor in generating the ecological services and natural resources on which they depend. Some indigenous groups manipulate the local landscape to augment its heterogeneity, and some have been found to be motivated to restore biodiversity in degraded landscapes. Their practices for the conservation of biodiversity were grounded in a series of rules of thumb which are apparently arrived at through a trial and error process over a long historical time period. This implies that their knowledge base is indefinite and their implementation involves an intimate relationship with the belief system. Such knowledge is difficult for western science to understand. It is vital, however, that the value of the knowledge-practice-belief complex of indigenous peoples relating to conservation of biodiversity is fully recognized if ecosystems and biodiversity are to be managed sustainably. Conserving this knowledge would be most appropriately accomplished through promoting the community-based resource-management systems of indigenous peoples.

Local polynomial convexity of the union of two totally-real surfaces at their intersection

We consider the following question: Let S (1) and S (2) be two smooth, totally-real surfaces in C-2 that contain the origin. If the union of their tangent planes is locally polynomially convex at the origin, then is S-1 boolean OR S-2 locally polynomially convex at the origin? If T (0) S (1) a (c) T (0) S (2) = {0}, then it is a folk result that the answer is yes. We discuss an obstruction to the presumed proof, and provide a different approach. When dim(R)(T0S1 boolean AND T0S2) = 1, we present a geometric condition under which no consistent answer to the above question exists. We then discuss conditions under which we can expect local polynomial convexity.

Context based service discovery for ubiquitous applications

Service discovery is vital in ubiquitous applications, where a large number of devices and software components collaborate unobtrusively and provide numerous services without user intervention. Existing service discovery schemes use a service matching process in order to offer services of interest to the users. Potentially, the context information of the users and surrounding environment can be used to improve the quality of service matching. To make use of context information in service matching, a service discovery technique needs to address certain challenges. Firstly, it is required that the context information shall have unambiguous representation. Secondly, the devices in the environment shall be able to disseminate high level and low level context information seamlessly in the different networks. And thirdly, dynamic nature of the context information be taken into account. We propose a C-IOB(Context-Information, Observation and Belief) based service discovery model which deals with the above challenges by processing the context information and by formulating the beliefs based on the observations. With these formulated beliefs the required services will be provided to the users. The method has been tested with a typical ubiquitous museum guide application over different cases. The simulation results are time efficient and quite encouraging.

An inventory of the ethnobotanicals used as anti-diabetic by a rural community of Dhemaji district of Assam, Northeast India

Ethnopharmacological relevance: Traditional remedies used for treating diabetic ailments are very important in the primary health care of the people living in rural Dhemaji district of Assam, north-east India. Novel information gathered from the current survey is important in preserving folk indigenous knowledge. Materials and methods: Interviews were conducted amongst 80 households comprising of 240 individuals using semi-structured questionnaires. The focus was on plants used in treating diabetes mellitus. Results: The current survey documented 21 plant species (20 families) which are reportedly used to treat diabetes mellitus by the rural people in the study area. To the best of our knowledge, Amomum linguiforme, Cinnamomum impressinervium, Colocasia esculenta, Dillenia indica, Euphorbia ligularia, Garcinia pedunculata, Solanum indicum, Sterculia villosa and Tabernaemontana divaricata are recorded for the first time based on globally published literature as medicinal plants used for treating diabetes mellitus and related symptoms. Conclusions: The wide variety of plants that are used to treat diabetes mellitus in this area supports the traditional value that medicinal plants have in the primary health care system of the rural people of Dhemaji district of Assam. The finding of new plant uses in the current study reveals the importance of the documentation of such ethnobotanical knowledge. (C) 2011 Elsevier Ireland Ltd. All rights reserved.

Mini Forest - An experiment to evaluate the adaptability of Western Ghats species for afforestation

Saplings of forty nine species of trees from Western Ghats forests were planted on a 1.5 hectare tract of Deccan plateau (in the campus of Indian Institute of Science, Bangalore) and their performance monitored for 23 years. The objective was to evaluate their adaptability to a habitat and conditions apparently alien to these species. The study was also meant to understand the linkages of these trees with the surrounding environment. Contrary to the belief that tree species are very sensitive to change of location and conditions, the introduced trees have grown as good as they would do in their native habitat and maintained their phenology. Further, they have grown in perfect harmony with trees native to the location. The results show that the introduced species are opportunistic and readily acclimatized and grew well overcoming the need for the edaphic and other factors that are believed to be responsible for their endemicity. Besides ex situ conservation, the creation of miniforest has other accrued ecosystem benefits. For instance, the ground water level has risen and the ambient temperature has come down by two degrees.

Herbal medicines used in the treatment of diabetes mellitus in Arunachal Himalaya, northeast, India

Ethnopharmacological relevance: Medicinal plants have played an important role in treating and preventing a variety of diseases throughout the world. Khampti tribal people living in the far-flung Lohit district of the Eastern Arunachal Himalaya, India still depend on medicinal plants and most of them have a general knowledge of medicinal plants which are used for treating a variety of ailments. This survey was undertaken in Lohit district in order to inventory the medicinal plants used in folk medicine to treat diabetes mellitus. Materials and methods: Field investigations were conducted in seventeen remote villages of Lohit district starting from April 2002 to May 2004 through interviews among 251 key informants who were selected randomly during our household survey. To elucidate community domains and determine differences in indigenous traditional knowledge of medicinal plants with anti-diabetic efficacy, we repeated our field survey starting from April 2008 to May 2010 with one hundred traditional healers locally called as ``Chau ya'' in Khampti of Lohit district. ``Chau ya'' traditional healers who know and use medicinal plants for treating diabetes mellitus were interviewed using a semi-structured questionnaire. Results: This study reports an ethnobotanical survey of medicinal plants in Lohit district of Arunachal Pradesh reputed for the treatment of diabetes mellitus. Forty-six plant species were identified in the study area to treat diabetes mellitus by the Khamptis ``Chau ya'' traditional healers. Comparative published literature survey analysis of this study with other ethnobotanical surveys of plants used traditionally in treating diabetes mellitus suggests that eleven plant species make claims of new reports on antidiabetic efficacy. These plant species are Begonia roxburghii, Calamus tenuis, Callicarpa arborea, Cuscuta reflexa, Dillenia indica, Diplazium esculentum, Lectuca gracilis, Millingtonia hortensis, Oxalis griffithii, Saccharum spontaneum, and Solanum viarum. Some of the plants reported in this study have an antidiabetic effect on rodent models but none have sufficient clinical evidence of effectiveness. Conclusions: The wide variety of medicinal plants that are used to treat diabetes mellitus in this area supports the importance of plants in the primary healthcare system of the rural people of Lohit district of Arunachal Pradesh. The finding of new plant uses in the current study reveals the importance of the documentation of such ethnobotanical knowledge. (C) 2012 Elsevier Ireland Ltd. All rights reserved.

Theory and Algorithms for Hop-Count-Based Localization with Random Geometric Graph Models of Dense Sensor Networks

Wireless sensor networks can often be viewed in terms of a uniform deployment of a large number of nodes in a region of Euclidean space. Following deployment, the nodes self-organize into a mesh topology with a key aspect being self-localization. Having obtained a mesh topology in a dense, homogeneous deployment, a frequently used approximation is to take the hop distance between nodes to be proportional to the Euclidean distance between them. In this work, we analyze this approximation through two complementary analyses. We assume that the mesh topology is a random geometric graph on the nodes; and that some nodes are designated as anchors with known locations. First, we obtain high probability bounds on the Euclidean distances of all nodes that are h hops away from a fixed anchor node. In the second analysis, we provide a heuristic argument that leads to a direct approximation for the density function of the Euclidean distance between two nodes that are separated by a hop distance h. This approximation is shown, through simulation, to very closely match the true density function. Localization algorithms that draw upon the preceding analyses are then proposed and shown to perform better than some of the well-known algorithms present in the literature. Belief-propagation-based message-passing is then used to further enhance the performance of the proposed localization algorithms. To our knowledge, this is the first usage of message-passing for hop-count-based self-localization.

A Two Stage Selective Averaging LDPC Decoding

Low density parity-check (LDPC) codes are a class of linear block codes that are decoded by running belief propagation (BP) algorithm or log-likelihood ratio belief propagation (LLR-BP) over the factor graph of the code. One of the disadvantages of LDPC codes is the onset of an error floor at high values of signal to noise ratio caused by trapping sets. In this paper, we propose a two stage decoder to deal with different types of trapping sets. Oscillating trapping sets are taken care by the first stage of the decoder and the elementary trapping sets are handled by the second stage of the decoder. Simulation results on the regular PEG (504,252,3,6) code and the irregular PEG (1024,518,15,8) code shows that the proposed two stage decoder performs significantly better than the standard decoder.

Context aware M-commerce services: C-IOB model approach

Context-aware computing is useful in providing individualized services focusing mainly on acquiring surrounding context of user. By comparison, only very little research has been completed in integrating context from different environments, despite of its usefulness in diverse applications such as healthcare, M-commerce and tourist guide applications. In particular, one of the most important criteria in providing personalized service in a highly dynamic environment and constantly changing user environment, is to develop a context model which aggregates context from different domains to infer context of an entity at the more abstract level. Hence, the purpose of this paper is to propose a context model based on cognitive aspects to relate contextual information that better captures the observation of certain worlds of interest for a more sophisticated context-aware service. We developed a C-IOB (Context-Information, Observation, Belief) conceptual model to analyze the context data from physical, system, application, and social domains to infer context at the more abstract level. The beliefs developed about an entity (person, place, things) are primitive in most theories of decision making so that applications can use these beliefs in addition to history of transaction for providing intelligent service. We enhance our proposed context model by further classifying context information into three categories: a well-defined, a qualitative and credible context information to make the system more realistic towards real world implementation. The proposed model is deployed to assist a M-commerce application. The simulation results show that the service selection and service delivery of the system are high compared to traditional system.

A hybrid RTS-BP algorithm for improved detection of large-MIMO M-QAM signals

Low-complexity near-optimal detection of large-MIMO signals has attracted recent research. Recently, we proposed a local neighborhood search algorithm, namely reactive tabu search (RTS) algorithm, as well as a factor-graph based belief propagation (BP) algorithm for low-complexity large-MIMO detection. The motivation for the present work arises from the following two observations on the above two algorithms: i) Although RTS achieved close to optimal performance for 4-QAM in large dimensions, significant performance improvement was still possible for higher-order QAM (e.g., 16-, 64-QAM). ii) BP also achieved near-optimal performance for large dimensions, but only for {±1} alphabet. In this paper, we improve the large-MIMO detection performance of higher-order QAM signals by using a hybrid algorithm that employs RTS and BP. In particular, motivated by the observation that when a detection error occurs at the RTS output, the least significant bits (LSB) of the symbols are mostly in error, we propose to first reconstruct and cancel the interference due to bits other than LSBs at the RTS output and feed the interference cancelled received signal to the BP algorithm to improve the reliability of the LSBs. The output of the BP is then fed back to RTS for the next iteration. Simulation results show that the proposed algorithm performs better than the RTS algorithm, and semi-definite relaxation (SDR) and Gaussian tree approximation (GTA) algorithms.

Performance improvement of short-length regular low-density parity-check codes with low-complexity post-processing

It is well known that extremely long low-density parity-check (LDPC) codes perform exceptionally well for error correction applications, short-length codes are preferable in practical applications. However, short-length LDPC codes suffer from performance degradation owing to graph-based impairments such as short cycles, trapping sets and stopping sets and so on in the bipartite graph of the LDPC matrix. In particular, performance degradation at moderate to high E-b/N-0 is caused by the oscillations in bit node a posteriori probabilities induced by short cycles and trapping sets in bipartite graphs. In this study, a computationally efficient algorithm is proposed to improve the performance of short-length LDPC codes at moderate to high E-b/N-0. This algorithm makes use of the information generated by the belief propagation (BP) algorithm in previous iterations before a decoding failure occurs. Using this information, a reliability-based estimation is performed on each bit node to supplement the BP algorithm. The proposed algorithm gives an appreciable coding gain as compared with BP decoding for LDPC codes of a code rate equal to or less than 1/2 rate coding. The coding gains are modest to significant in the case of optimised (for bipartite graph conditioning) regular LDPC codes, whereas the coding gains are huge in the case of unoptimised codes. Hence, this algorithm is useful for relaxing some stringent constraints on the graphical structure of the LDPC code and for developing hardware-friendly designs.

Superbubble breakout and galactic winds from disc galaxies

We study the conditions for disc galaxies to produce superbubbles that can break out of the disc and produce a galactic wind. We argue that the threshold surface density of supernovae rate for seeding a wind depends on the ability of superbubble energetics to compensate for radiative cooling. We first adapt Kompaneets formalism for expanding bubbles in a stratified medium to the case of continuous energy injection and include the effects of radiative cooling in the shell. With the help of hydrodynamic simulations, we then study the evolution of superbubbles evolving in stratified discs with typical disc parameters. We identify two crucial energy injection rates that differ in their effects, the corresponding breakout ranging from being gentle to a vigorous one. (a) Superbubbles that break out of the disc with a Mach number of the order of 2-3 correspond to an energy injection rate of the order of 10(-4) erg cm(-2) s(-1), which is relevant for disc galaxies with synchrotron emitting gas in the extra-planar regions. (b) A larger energy injection threshold, of the order of 10(-3) erg cm(-2) s(-1), or equivalently, a star formation surface density of similar to 0.1 M-circle dot yr(-1) kpc(-2), corresponds to superbubbles with a Mach number similar to 5-10. While the milder superbubbles can be produced by large OB associations, the latter kind requires super-starclusters. These derived conditions compare well with observations of disc galaxies with winds and the existence of multiphase halo gas. Furthermore, we find that contrary to the general belief that superbubbles fragment through Rayleigh-Taylor (RT) instability when they reach a vertical height of the order of the scaleheight, the superbubbles are first affected by thermal instability for typical disc parameters and that RT instability takes over when the shells reach a distance of approximately twice the scaleheight.

Does linear separability really matter? Complex visual search is explained by simple search

Visual search in real life involves complex displays with a target among multiple types of distracters, but in the laboratory, it is often tested using simple displays with identical distracters. Can complex search be understood in terms of simple searches? This link may not be straightforward if complex search has emergent properties. One such property is linear separability, whereby search is hard when a target cannot be separated from its distracters using a single linear boundary. However, evidence in favor of linear separability is based on testing stimulus configurations in an external parametric space that need not be related to their true perceptual representation. We therefore set out to assess whether linear separability influences complex search at all. Our null hypothesis was that complex search performance depends only on classical factors such as target-distracter similarity and distracter homogeneity, which we measured using simple searches. Across three experiments involving a variety of artificial and natural objects, differences between linearly separable and nonseparable searches were explained using target-distracter similarity and distracter heterogeneity. Further, simple searches accurately predicted complex search regardless of linear separability (r = 0.91). Our results show that complex search is explained by simple search, refuting the widely held belief that linear separability influences visual search.