A numerical study of variable coefficient elliptic Cauchy problem via projection method

In this paper, we investigate a numerical method for the solution of an inverse problem of recovering lacking data on some part of the boundary of a domain from the Cauchy data on other part for a variable coefficient elliptic Cauchy problem. In the process, the Cauchy problem is transformed into the problem of solving a compact linear operator equation. As a remedy to the ill-posedness of the problem, we use a projection method which allows regularization solely by discretization. The discretization level plays the role of regularization parameter in the case of projection method. The balancing principle is used for the choice of an appropriate discretization level. Several numerical examples show that the method produces a stable good approximate solution.

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.

Reconstruction from incomplete data in cone-beam tomography

A method for reconstruction of an object f(x) x=(x,y,z) from a limited set of cone-beam projection data has been developed. This method uses a modified form of convolution back-projection and projection onto convex sets (POCS) for handling the limited (or incomplete) data problem. In cone-beam tomography, one needs to have a complete geometry to completely reconstruct the original three-dimensional object. While complete geometries do exist, they are of little use in practical implementations. The most common trajectory used in practical scanners is circular, which is incomplete. It is, however, possible to recover some of the information of the original signal f(x) based on a priori knowledge of the nature of f(x). If this knowledge can be posed in a convex set framework, then POCS can be utilized. In this report, we utilize this a priori knowledge as convex set constraints to reconstruct f(x) using POCS. While we demonstrate the effectiveness of our algorithm for circular trajectories, it is essentially geometry independent and will be useful in any limited-view cone-beam reconstruction.

Electroluminescence from modulation-doped pseudomorphic AlGaAs/InGaAs/GaAs quantum wells

Low-temperature electroluminescence (EL) is observed in n-type modulation-doped AlGaAs/InGaAs/GaAs quantum well samples by applying a positive voltage between the semitransparent Au gate and alloyed Au–Ge Ohmic contacts made on the top surface of the samples. We attribute impact ionization in the InGaAs QW to the observed EL from the samples. A redshift in the EL spectra is observed with increasing gate bias. The observed redshift in the EL spectra is attributed to the band gap renormalization due to many-body effects and quantum-confined Stark effect.

An algebraic theory of functional and multivalued dependencies in relational databases

Computation of the dependency basis is the fundamental step in solving the membership problem for functional dependencies (FDs) and multivalued dependencies (MVDs) in relational database theory. We examine this problem from an algebraic perspective. We introduce the notion of the inference basis of a set M of MVDs and show that it contains the maximum information about the logical consequences of M. We propose the notion of a dependency-lattice and develop an algebraic characterization of inference basis using simple notions from lattice theory. We also establish several interesting properties of dependency-lattices related to the implication problem. Founded on our characterization, we synthesize efficient algorithms for (a): computing the inference basis of a given set M of MVDs; (b): computing the dependency basis of a given attribute set w.r.t. M; and (c): solving the membership problem for MVDs. We also show that our results naturally extend to incorporate FDs also in a way that enables the solution of the membership problem for both FDs and MVDs put together. We finally show that our algorithms are more efficient than existing ones, when used to solve what we term the ‘generalized membership problem’.

The Implication Problem for Functional and Multivalued Dependencies

Computation of the dependency basis is the fundamental step in solving the implication problem for MVDs in relational database theory. We examine this problem from an algebraic perspective. We introduce the notion of the inference basis of a set M of MVDs and show that it contains the maximum information about the logical consequences of M. We propose the notion of an MVD-lattice and develop an algebraic characterization of the inference basis using simple notions from lattice theory. We also establish several properties of MVD-lattices related to the implication problem. Founded on our characterization, we synthesize efficient algorithms for (a) computing the inference basis of a given set M of MVDs; (b) computing the dependency basis of a given attribute set w.r.t. M; and (c) solving the implication problem for MVDs. Finally, we show that our results naturally extend to incorporate FDs also in a way that enables the solution of the implication problem for both FDs and MVDs put together.

Geometry Of Proline And Hydroxyproline .1. An Analysis Of X-Ray Crystal-Structure Data

We have carried out an analysis of crystal structure data on prolyl and hydroxyprolyl moieties in small molecules. The flexibility of the pyrrolidine ring due to the pyramidal character of nitrogen has been defined in terms of two projection angles δ1 and δ2. The distribution of these parameters in the crystal structures is found to be consistent with results of the energy calculations carried out on prolyl moieties in our laboratory.

Access path query language for relational database systems

Database management systems offer a very reliable and attractive data organization for fast and economical information storage and processing for diverse applications. It is much more important that the information should be easily accessible to users with varied backgrounds, professional as well as casual, through a suitable data sublanguage. The language adopted here (APPLE) is one such language for relational database systems and is completely nonprocedural and well suited to users with minimum or no programming background. This is supported by an access path model which permits the user to formulate completely nonprocedural queries expressed solely in terms of attribute names. The data description language (DDL) and data manipulation language (DML) features of APPLE are also discussed. The underlying relational database has been implemented with the help of the DATATRIEVE-11 utility for record and domain definition which is available on the PDP-11/35. The package is coded in Pascal and MACRO-11. Further, most of the limitations of the DATATRIEVE-11 utility have been eliminated in the interface package.

Low-temperature and high-pressure Raman and x-ray studies of pyrochlore Tb2Ti2O7: Phonon anomalies and possible phase transition

We have carried out temperature- and pressure-dependent Raman and x-ray measurements on single crystals of Tb2Ti2O7. We attribute the observed anomalous temperature dependence of phonons to phonon-phonon anharmonic interactions. The quasiharmonic and anharmonic contributions to the temperature-dependent changes in phonon frequencies are estimated quantitatively using mode Grüneisen parameters derived from pressure-dependent Raman experiments and bulk modulus from high-pressure x-ray measurements. Further, our Raman and x-ray data suggest a subtle structural deformation of the pyrochlore lattice at ~9 GPa. We discuss possible implications of our results on the spin-liquid behavior of Tb2Ti2O7.