Monsoon circulation interaction with Western Ghats orography under changing climate - Projection by a 20-km mesh AGCM

In this study, the authors have investigated the likely future changes in the summer monsoon over the Western Ghats (WG) orographic region of India in response to global warming, using time-slice simulations of an ultra high-resolution global climate model and climate datasets of recent past. The model with approximately 20-km mesh horizontal resolution resolves orographic features on finer spatial scales leading to a quasi-realistic simulation of the spatial distribution of the present-day summer monsoon rainfall over India and trends in monsoon rainfall over the west coast of India. As a result, a higher degree of confidence appears to emerge in many aspects of the 20-km model simulation, and therefore, we can have better confidence in the validity of the model prediction of future changes in the climate over WG mountains. Our analysis suggests that the summer mean rainfall and the vertical velocities over the orographic regions of Western Ghats have significantly weakened during the recent past and the model simulates these features realistically in the present-day climate simulation. Under future climate scenario, by the end of the twenty-first century, the model projects reduced orographic precipitation over the narrow Western Ghats south of 16A degrees N that is found to be associated with drastic reduction in the southwesterly winds and moisture transport into the region, weakening of the summer mean meridional circulation and diminished vertical velocities. We show that this is due to larger upper tropospheric warming relative to the surface and lower levels, which decreases the lapse rate causing an increase in vertical moist static stability (which in turn inhibits vertical ascent) in response to global warming. Increased stability that weakens vertical velocities leads to reduction in large-scale precipitation which is found to be the major contributor to summer mean rainfall over WG orographic region. This is further corroborated by a significant decrease in the frequency of moderate-to-heavy rainfall days over WG which is a typical manifestation of the decrease in large-scale precipitation over this region. Thus, the drastic reduction of vertical ascent and weakening of circulation due to `upper tropospheric warming effect' predominates over the `moisture build-up effect' in reducing the rainfall over this narrow orographic region. This analysis illustrates that monsoon rainfall over mountainous regions is strongly controlled by processes and parameterized physics which need to be resolved with adequately high resolution for accurate assessment of local and regional-scale climate change.

GFT projection NMR for efficient H-1/C-13 sugar spin system identification in nucleic acids

A newly implemented G-matrix Fourier transform (GFT) (4,3)D HC(C)CH experiment is presented in conjunction with (4,3)D HCCH to efficiently identify H-1/C-13 sugar spin systems in C-13 labeled nucleic acids. This experiment enables rapid collection of highly resolved relay 4D HC(C)CH spectral information, that is, shift correlations of C-13-H-1 groups separated by two carbon bonds. For RNA, (4,3)D HC(C)CH takes advantage of the comparably favorable 1'- and 3'-CH signal dispersion for complete spin system identification including 5'-CH. The (4,3)D HC(C)CH/HCCH based strategy is exemplified for the 30-nucleotide 3'-untranslated region of the pre-mRNA of human U1A protein.

Projection-based atom selection in orthogonal matching pursuit for compressive sensing

For compressive sensing, we endeavor to improve the atom selection strategy of the existing orthogonal matching pursuit (OMP) algorithm. To achieve a better estimate of the underlying support set progressively through iterations, we use a least squares solution based atom selection method. From a set of promising atoms, the choice of an atom is performed through a new method that uses orthogonal projection along-with a standard matched filter. Through experimental evaluations, the effect of projection based atom selection strategy is shown to provide a significant improvement for the support set recovery performance, in turn, the compressive sensing recovery.

A NEAR OPTIMAL PROJECTION FOR SPARSE REPRESENTATION BASED CLASSIFICATION

Sparse representation based classification (SRC) is one of the most successful methods that has been developed in recent times for face recognition. Optimal projection for Sparse representation based classification (OPSRC)1] provides a dimensionality reduction map that is supposed to give optimum performance for SRC framework. However, the computational complexity involved in this method is too high. Here, we propose a new projection technique using the data scatter matrix which is computationally superior to the optimal projection method with comparable classification accuracy with respect OPSRC. The performance of the proposed approach is benchmarked with various publicly available face database.

Projection Error Propagation-based Regularization (PEPR) method for resistivity reconstruction in Electrical Impedance Tomography (EIT)

A novel Projection Error Propagation-based Regularization (PEPR) method is proposed to improve the image quality in Electrical Impedance Tomography (EIT). PEPR method defines the regularization parameter as a function of the projection error developed by difference between experimental measurements and calculated data. The regularization parameter in the reconstruction algorithm gets modified automatically according to the noise level in measured data and ill-posedness of the Hessian matrix. Resistivity imaging of practical phantoms in a Model Based Iterative Image Reconstruction (MoBIIR) algorithm as well as with Electrical Impedance Diffuse Optical Reconstruction Software (EIDORS) with PEPR. The effect of PEPR method is also studied with phantoms with different configurations and with different current injection methods. All the resistivity images reconstructed with PEPR method are compared with the single step regularization (STR) and Modified Levenberg Regularization (LMR) techniques. The results show that, the PEPR technique reduces the projection error and solution error in each iterations both for simulated and experimental data in both the algorithms and improves the reconstructed images with better contrast to noise ratio (CNR), percentage of contrast recovery (PCR), coefficient of contrast (COC) and diametric resistivity profile (DRP). (C) 2013 Elsevier Ltd. All rights reserved.

Minimization Problems Based on Relative alpha-Entropy I: Forward Projection

Minimization problems with respect to a one-parameter family of generalized relative entropies are studied. These relative entropies, which we term relative alpha-entropies (denoted I-alpha), arise as redundancies under mismatched compression when cumulants of compressed lengths are considered instead of expected compressed lengths. These parametric relative entropies are a generalization of the usual relative entropy (Kullback-Leibler divergence). Just like relative entropy, these relative alpha-entropies behave like squared Euclidean distance and satisfy the Pythagorean property. Minimizers of these relative alpha-entropies on closed and convex sets are shown to exist. Such minimizations generalize the maximum Renyi or Tsallis entropy principle. The minimizing probability distribution (termed forward I-alpha-projection) for a linear family is shown to obey a power-law. Other results in connection with statistical inference, namely subspace transitivity and iterated projections, are also established. In a companion paper, a related minimization problem of interest in robust statistics that leads to a reverse I-alpha-projection is studied.

Minimization Problems Based on Relative alpha-Entropy II: Reverse Projection

In part I of this two-part work, certain minimization problems based on a parametric family of relative entropies (denoted I-alpha) were studied. Such minimizers were called forward I-alpha-projections. Here, a complementary class of minimization problems leading to the so-called reverse I-alpha-projections are studied. Reverse I-alpha-projections, particularly on log-convex or power-law families, are of interest in robust estimation problems (alpha > 1) and in constrained compression settings (alpha < 1). Orthogonality of the power-law family with an associated linear family is first established and is then exploited to turn a reverse I-alpha-projection into a forward I-alpha-projection. The transformed problem is a simpler quasi-convex minimization subject to linear constraints.