A comparison of three methods for downscaling daily precipitation in the Punjab region

Many downscaling techniques have been developed in the past few years for projection of station-scale hydrological variables from large-scale atmospheric variables simulated by general circulation models (GCMs) to assess the hydrological impacts of climate change. This article compares the performances of three downscaling methods, viz. conditional random field (CRF), K-nearest neighbour (KNN) and support vector machine (SVM) methods in downscaling precipitation in the Punjab region of India, belonging to the monsoon regime. The CRF model is a recently developed method for downscaling hydrological variables in a probabilistic framework, while the SVM model is a popular machine learning tool useful in terms of its ability to generalize and capture nonlinear relationships between predictors and predictand. The KNN model is an analogue-type method that queries days similar to a given feature vector from the training data and classifies future days by random sampling from a weighted set of K closest training examples. The models are applied for downscaling monsoon (June to September) daily precipitation at six locations in Punjab. Model performances with respect to reproduction of various statistics such as dry and wet spell length distributions, daily rainfall distribution, and intersite correlations are examined. It is found that the CRF and KNN models perform slightly better than the SVM model in reproducing most daily rainfall statistics. These models are then used to project future precipitation at the six locations. Output from the Canadian global climate model (CGCM3) GCM for three scenarios, viz. A1B, A2, and B1 is used for projection of future precipitation. The projections show a change in probability density functions of daily rainfall amount and changes in the wet and dry spell distributions of daily precipitation. Copyright (C) 2011 John Wiley & Sons, Ltd.

Ethnobotany of the Monpa ethnic group at Arunachal Pradesh, India

Background: The present paper documents the uses of plants in traditional herbal medicine for human and veterinary ailments, and those used for dietary supplements, religious purpose, local beverage, and plants used to poison fish and wild animals. Traditional botanical medicine is the primary mode of healthcare for most of the rural population in Arunachal Pradesh. Materials and methods: Field research was conducted between April 2006 and March 2009 with randomly selected 124 key informants using semi-structured questionnaire. The data obtained was analyzed through informant consensus factor (F(IC)) to determine the homogeneity of informant's knowledge on medicinal plants. Results: We documented 50 plants species belonging to 29 families used for treating 22 human and 4 veterinary ailments. Of the medicinal plants reported, the most common growth form was herbs (40%) followed by shrubs, trees, and climbers. Leaves were most frequently used plant parts. The consensus analysis revealed that the dermatological ailments have the highest F(IC) (0.56) and the gastro-intestinal diseases have F(IC) (0.43). F(IC) values indicated that there was high agreement in the use of plants in dermatological and gastro-intestinal ailments category among the users. Gymnocladus assamicus is a critically rare and endangered species used as disinfectant for cleaning wounds and parasites like leeches and lice on livestocks. Two plant species (Illicium griffithii and Rubia cordifolia) are commonly used for traditional dyeing of clothes and food items. Some of the edible plants recorded in this study were known for their treatment against high blood pressure (Clerodendron colebrookianum), diabetes mellitus (Momordica charantia), and intestinal parasitic worms like round and tape worms (Lindera neesiana, Solanum etiopicum, and Solanum indicum). The Monpas of Arunachal Pradesh have traditionally been using Daphne papyracea for preparing hand-made paper for painting and writing religious scripts in Buddhist monasteries. Three plant species (Derris scandens, Aesculus assamica, and Polygonum hydropiper) were frequently used to poison fish during the month of June-July every year and the underground tuber of Aconitum ferrox is widely used in arrow poisoning to kill ferocious animals like bear, wild pigs, gaur and deer. The most frequently cited plant species; Buddleja asiatica and Hedyotis scandens were used as common growth supplements during the preparation of fermentation starter cultures. Conclusion: The traditional pharmacopoeia of the Monpa ethnic group incorporates a myriad of diverse botanical flora. Traditional knowledge of the remedies is passed down through oral traditions without any written document. This traditional knowledge is however, currently threatened mainly due to acculturation and deforestation due to continuing traditional shifting cultivation. This study reveals that the rural populations in Arunachal Pradesh have a rich knowledge of forest-based natural resources and consumption of wild edible plants is still an integral part of their socio-cultural life. Findings of this documentation study can be used as an ethnopharmacological basis for selecting plants for future phytochemical and pharmaceutical studies.

Fast-Group-Decodable STBCs via Codes over GF(4): Further Results

Recently in, a framework was given to construct low ML decoding complexity Space-Time Block Codes (STBCs) via codes over the finite field F4. In this paper, we construct new full-diversity STBCs with cubic shaping property and low ML decoding complexity via codes over F4 for number of transmit antennas N = 2m, m >; 1, and rates R >; 1 complex symbols per channel use. The new codes have the least ML decoding complexity among all known codes for a large set of (N, R) pairs. The new full-rate codes of this paper (R = N) are not only information-lossless and fully diverse but also have the least known ML decoding complexity in the literature. For N ≥ 4, the new full-rate codes are the first instances of full-diversity, information-lossless STBCs with low ML decoding complexity. We also give a sufficient condition for STBCs obtainable from codes over F4 to have cubic shaping property, and a sufficient condition for any design to give rise to a full-diversity STBC when the symbols are encoded using rotated square QAM constellations.

Low ML Decoding Complexity STBCs via Codes Over the Klein Group

In this paper, we give a new framework for constructing low ML decoding complexity space-time block codes (STBCs) using codes over the Klein group K. Almost all known low ML decoding complexity STBCs can be obtained via this approach. New full- diversity STBCs with low ML decoding complexity and cubic shaping property are constructed, via codes over K, for number of transmit antennas N = 2(m), m >= 1, and rates R > 1 complex symbols per channel use. When R = N, the new STBCs are information- lossless as well. The new class of STBCs have the least knownML decoding complexity among all the codes available in the literature for a large set of (N, R) pairs.

Effect of dimerization on dynamics of spin-charge separation in Pariser-Parr-Pople model: A time-dependent density matrix renormalization group study

We investigate the effect of static electron-phonon coupling on real-time dynamics of spin and charge transport in pi-conjugated polyene chains. The polyene chain is modeled by the Pariser-Parr-Pople Hamiltonian with dimerized nearest-neighbor parameter t(0)(1 + delta) for short bonds and t(0)(1 - delta) for long bonds, and long-range electron-electron interactions. We follow the time evolution of the spin and charge using time-dependent density matrix renormalization group technique when a hole is injected at one end of the chain in its ground state. We find that spin and charge dynamics followed through spin and charge velocities depend both on chain length and extent of dimerization delta. Analysis of the results requires focusing on physical quantities such as average spin and charge polarizations, particularly in the large dimerization limit. In the dimerization range 0.0 <= delta <= 0.15, spin-charge dynamics is found to have a well-defined behavior, with spin-charge separation (measured as the ratio of charge velocity to spin velocity) as well as the total amount of charge and spin transported in a given time along the chain decreasing as dimerization increases. However, in the range 0.3 <= delta <= 0.5, it is observed that the dynamics of spin and charge transport becomes complicated. It is observed that, for large delta values, spin-charge separation is suppressed and the injected hole fails to travel the entire length of the chain.

Prototype learning methods for online handwriting recognition

In this paper, we study different methods for prototype selection for recognizing handwritten characters of Tamil script. In the first method, cumulative pairwise- distances of the training samples of a given class are used to select prototypes. In the second method, cumulative distance to allographs of different orientation is used as a criterion to decide if the sample is representative of the group. The latter method is presumed to offset the possible orientation effect. This method still uses fixed number of prototypes for each of the classes. Finally, a prototype set growing algorithm is proposed, with a view to better model the differences in complexity of different character classes. The proposed algorithms are tested and compared for both writer independent and writer adaptation scenarios.

Five-stage Milstein methods for SDEs

In this paper, we consider the problem of computing numerical solutions for Ito stochastic differential equations (SDEs). The five-stage Milstein (FSM) methods are constructed for solving SDEs driven by an m-dimensional Wiener process. The FSM methods are fully explicit methods. It is proved that the FSM methods are convergent with strong order 1 for SDEs driven by an m-dimensional Wiener process. The analysis of stability (with multidimensional Wiener process) shows that the mean-square stable regions of the FSM methods are unbounded. The analysis of stability shows that the mean-square stable regions of the methods proposed in this paper are larger than the Milstein method and three-stage Milstein methods.

Reactive power optimization with different objectives in large power systems including HVDC systems and FACTS devices

Present day power systems are growing in size and complexity of operation with inter connections to neighboring systems, introduction of large generating units, EHV 400/765 kV AC transmission systems, HVDC systems and more sophisticated control devices such as FACTS. For planning and operational studies, it requires suitable modeling of all components in the power system, as the number of HVDC systems and FACTS devices of different type are incorporated in the system. This paper presents reactive power optimization with three objectives to minimize the sum of the squares of the voltage deviations (ve) of the load buses, minimization of sum of squares of voltage stability L-indices of load buses (¿L2), and also the system real power loss (Ploss) minimization. The proposed methods have been tested on typical sample system. Results for Indian 96-bus equivalent system including HVDC terminal and UPFC under normal and contingency conditions are presented.

Density matrix renormalization group algorithm for Bethe lattices of spin-1/2 or spin-1 sites with Heisenberg antiferromagnetic exchange

A density matrix renormalization group (DMRG) algorithm is presented for the Bethe lattice with connectivity Z = 3 and antiferromagnetic exchange between nearest-neighbor spins s = 1/2 or 1 sites in successive generations g. The algorithm is accurate for s = 1 sites. The ground states are magnetic with spin S(g) = 2(g)s, staggered magnetization that persists for large g > 20, and short-range spin correlation functions that decrease exponentially. A finite energy gap to S > S(g) leads to a magnetization plateau in the extended lattice. Closely similar DMRG results for s = 1/2 and 1 are interpreted in terms of an analytical three-site model.

A review of recent developments in parametric based acoustic emission techniques applied to concrete structures

This article presents a review of recent developments in parametric based acoustic emission (AE) techniques applied to concrete structures. It recapitulates the significant milestones achieved by previous researchers including various methods and models developed in AE testing of concrete structures. The aim is to provide an overview of the specific features of parametric based AE techniques of concrete structures carried out over the years. Emphasis is given to traditional parameter-based AE techniques applied to concrete structures. A significant amount of research on AE techniques applied to concrete structures has already been published and considerable attention has been given to those publications. Some recent studies such as AE energy analysis and b-value analysis used to assess damage of concrete bridge beams have also been discussed. The formation of fracture process zone and the AE energy released during the fracture process in concrete beam specimens have been summarised. A large body of experimental data on AE characteristics of concrete has accumulated over the last three decades. This review of parametric based AE techniques applied to concrete structures may be helpful to the concerned researchers and engineers to better understand the failure mechanism of concrete and evolve more useful methods and approaches for diagnostic inspection of structural elements and failure prediction/prevention of concrete structures.

Comparison of the degree of creativity in the design outcomes using different design methods

This work analyses the influence of several design methods on the degree of creativity of the design outcome. A design experiment has been carried out in which the participants were divided into four teams of three members, and each team was asked to work applying different design methods. The selected methods were Brainstorming, Functional Analysis, and SCAMPER method. The `degree of creativity' of each design outcome is assessed by means of a questionnaire offered to a number of experts and by means of three different metrics: the metric of Moss, the metric of Sarkar and Chakrabarti, and the evaluation of innovative potential. The three metrics share the property of measuring the creativity as a combination of the degree of novelty and the degree of usefulness. The results show that Brainstorming provides more creative outcomes than when no method is applied, while this is not proved for SCAMPER and Functional Analysis.

Simple and efficient methods for discrimination of chiral diacids and chiral alpha-methyl amines

The three-component chiral derivatization protocols have been developed for H-1, C-13 and F-19 NMR spectroscopic discrimination of chiral diacids by their coordination and self-assembly with optically active (R)-alpha-methylbenzylamine and 2-formylphenylboronic acid or 3-fluoro-2-formylmethylboronic acid. These protocols yield a mixture of diastereomeric imino-boronate esters which are identified by the well-resolved diastereotopic peaks with significant chemical shift differences ranging up to 0.6 and 2.1 ppm in their corresponding H-1 and F-19 NMR spectra, without any racemization or kinetic resolution, thereby enabling the determination of enantiopurity. A protocol has also been developed for discrimination of chiral alpha-methyl amines, using optically pure trans-1,2-cyclohexanedicarboxylic acid in combination with 2-formylphenylboronic acid or 3-fluoro-2-fluoromethylboronic acid. The proposed strategies have been demonstrated on large number of chiral diacids and chiral alpha-methyl amines.

Nonextremality, chemical potential, and the infrared limit of large N thermal QCD

Nonextremal solution with warped resolved-deformed conifold background is important to study the infrared limit of large N thermal QCD. Earlier works in this direction have not taken into account all the backreactions on the geometry, namely from the branes, fluxes, and black-hole carefully. In the present work we make some progress in this direction by solving explicitly the supergravity equations of motions in the presence of the backreaction from the black hole. The backreactions from the branes and the fluxes on the other hand and to the order that we study, are comparatively suppressed. Our analysis reveal, among other things, how the resolution parameter would depend on the horizon radius and how the renormalization group flows of the coupling constants should be understood in these scenarios, including their effects on the background three-form fluxes. We also study the effect of switching on a chemical potential in the background and, in a particularly simplified scenario, compute the actual value of the chemical potential for our case.

Perturbative expansion of the QCD Adler function improved by renormalization-group summation and analytic continuation in the Borel plane

We examine the large-order behavior of a recently proposed renormalization-group-improved expansion of the Adler function in perturbative QCD, which sums in an analytically closed form the leading logarithms accessible from renormalization-group invariance. The expansion is first written as an effective series in powers of the one-loop coupling, and its leading singularities in the Borel plane are shown to be identical to those of the standard ``contour-improved'' expansion. Applying the technique of conformal mappings for the analytic continuation in the Borel plane, we define a class of improved expansions, which implement both the renormalization-group invariance and the knowledge about the large-order behavior of the series. Detailed numerical studies of specific models for the Adler function indicate that the new expansions have remarkable convergence properties up to high orders. Using these expansions for the determination of the strong coupling from the hadronic width of the tau lepton we obtain, with a conservative estimate of the uncertainty due to the nonperturbative corrections, alpha(s)(M-tau(2)) = 0.3189(-0.0151)(+0.0173), which translates to alpha(s)(M-Z(2)) = 0.1184(-0.0018)(+0.0021). DOI: 10.1103/PhysRevD.87.014008

Efficient Methods for Robust Classification Under Uncertainty in Kernel Matrices

In this paper we study the problem of designing SVM classifiers when the kernel matrix, K, is affected by uncertainty. Specifically K is modeled as a positive affine combination of given positive semi definite kernels, with the coefficients ranging in a norm-bounded uncertainty set. We treat the problem using the Robust Optimization methodology. This reduces the uncertain SVM problem into a deterministic conic quadratic problem which can be solved in principle by a polynomial time Interior Point (IP) algorithm. However, for large-scale classification problems, IP methods become intractable and one has to resort to first-order gradient type methods. The strategy we use here is to reformulate the robust counterpart of the uncertain SVM problem as a saddle point problem and employ a special gradient scheme which works directly on the convex-concave saddle function. The algorithm is a simplified version of a general scheme due to Juditski and Nemirovski (2011). It achieves an O(1/T-2) reduction of the initial error after T iterations. A comprehensive empirical study on both synthetic data and real-world protein structure data sets show that the proposed formulations achieve the desired robustness, and the saddle point based algorithm outperforms the IP method significantly.