Totally geodesic discs in strongly convex domains

We prove that every isometry from the unit disk Delta in , endowed with the Poincar, distance, to a strongly convex bounded domain Omega of class in , endowed with the Kobayashi distance, is the composition of a complex geodesic of Omega with either a conformal or an anti-conformal automorphism of Delta. As a corollary we obtain that every isometry for the Kobayashi distance, from a strongly convex bounded domain of class in to a strongly convex bounded domain of class in , is either holomorphic or anti-holomorphic.

Robust formulations for clustering-based large-scale classification

Chebyshev-inequality-based convex relaxations of Chance-Constrained Programs (CCPs) are shown to be useful for learning classifiers on massive datasets. In particular, an algorithm that integrates efficient clustering procedures and CCP approaches for computing classifiers on large datasets is proposed. The key idea is to identify high density regions or clusters from individual class conditional densities and then use a CCP formulation to learn a classifier on the clusters. The CCP formulation ensures that most of the data points in a cluster are correctly classified by employing a Chebyshev-inequality-based convex relaxation. This relaxation is heavily dependent on the second-order statistics. However, this formulation and in general such relaxations that depend on the second-order moments are susceptible to moment estimation errors. One of the contributions of the paper is to propose several formulations that are robust to such errors. In particular a generic way of making such formulations robust to moment estimation errors is illustrated using two novel confidence sets. An important contribution is to show that when either of the confidence sets is employed, for the special case of a spherical normal distribution of clusters, the robust variant of the formulation can be posed as a second-order cone program. Empirical results show that the robust formulations achieve accuracies comparable to that with true moments, even when moment estimates are erroneous. Results also illustrate the benefits of employing the proposed methodology for robust classification of large-scale datasets.

Ozone and carbon trioxide synthesis by low energy ion implantation onto solid carbon dioxide and implications to astrochemistry

Ion implantation experiments were carried out on amorphous (30 K) and crystalline (80 K) solid CO2 using both reactive (D+, H+) and non-reactive (He+) ions, simulating different irradiation environments on satellite and dust grain surfaces. Such ion irradiation synthesized several new species in the ice including ozone (O-3), carbon trioxide (CO3), and carbon monoxide (CO) the main dissociation product of carbon dioxide. The yield of these products was found to be strongly dependent upon the ion used for irradiation and the sample temperature. Ion implantation changes the chemical composition of the ice with recorded infrared spectra clearly showing the coexistence of D-3h and C-2v isomers of CO3, for the first time, in ion irradiated CO2 ice. (C) 2013 AIP Publishing LLC.

Role of outer membrane exopolymers of Acidithiobacillus ferrooxidans in adsorption of cells onto pyrite and chalcopyrite

Bacterial surface polymers play a major role in the adhesion of bacterial cells to solid surfaces. Lipopolysaccharides (LPS) are essential constituents of the cell walls of almost all Gram-negative bacteria. This paper reports the results of the investigations on the role of outer membrane exopolymers (LPS) of the chemolithotroph, Acidithiobacillus ferrooxidans, in adsorption of the cells onto pyrite and chalcopyrite. Optimization of EDTA treatment for removal of LPS from cell surface and the surface characterization of EDTA-treated cells are outlined. There was no change in cell morphology or loss in cell motility upon treatment with upto 0.04 mM EDTA for 1 h. Partial removal of LPS by EDTA treatment resulted in reduced adsorption of the cells on both pyrite and chalcopyrite. The protein profile of the EDTA-extractable fraction showed presence of certain outer membrane proteins indicating that EDTA treatment results in temporary gaps in the outer membrane. Also, specificity towards pyrite compared to chalcopyrite that was exhibited by untreated cells was lost when their exopolymer layers were stripped off, which could be attributed to the role of outer membrane proteins in the mineral-specificity exhibited by the bacteria. (C) 2013 Elsevier B.V. All rights reserved.

Antenna selection for time-varying channels based on slepian subspace projections

Single receive antenna selection (AS) allows single-input single-output (SISO) systems to retain the diversity benefits of multiple antennas with minimum hardware costs. We propose a single receive AS method for time-varying channels, in which practical limitations imposed by next-generation wireless standards such as training, packetization and antenna switching time are taken into account. The proposed method utilizes low-complexity subspace projection techniques spanned by discrete prolate spheroidal (DPS) sequences. It only uses Doppler bandwidth knowledge, and does not need detailed correlation knowledge. Results show that the proposed AS method outperforms ideal conventional SISO systems with perfect CSI but no AS at the receiver and AS using the conventional Fourier estimation/prediction method. A closed-form expression for the symbol error probability (SEP) of phase-shift keying (MPSK) with symbol-by-symbol receive AS is derived.

Glacial mass balance changes in the Karakoram and Himalaya based on CMIP5 multi-model climate projections

The impact of future climate change on the glaciers in the Karakoram and Himalaya (KH) is investigated using CMIP5 multi-model temperature and precipitation projections, and a relationship between glacial accumulation-area ratio and mass balance developed for the region based on the last 30 to 40 years of observational data. We estimate that the current glacial mass balance (year 2000) for the entire KH region is -6.6 +/- 1 Gta(-1), which decreases about sixfold to -35 +/- 2 Gta(-1) by the 2080s under the high emission scenario of RCP8.5. However, under the low emission scenario of RCP2.6 the glacial mass loss only doubles to -12 +/- 2 Gta(-1) by the 2080s. We also find that 10.6 and 27 % of the glaciers could face `eventual disappearance' by the end of the century under RCP2.6 and RCP8.5 respectively, underscoring the threat to water resources under high emission scenarios.

Fixed-orientation equilateral triangle matching of point sets

Given a point set P and a class C of geometric objects, G(C)(P) is a geometric graph with vertex set P such that any two vertices p and q are adjacent if and only if there is some C is an element of C containing both p and q but no other points from P. We study G(del)(P) graphs where del is the class of downward equilateral triangles (i.e., equilateral triangles with one of their sides parallel to the x-axis and the corner opposite to this side below that side). For point sets in general position, these graphs have been shown to be equivalent to half-Theta(6) graphs and TD-Delaunay graphs. The main result in our paper is that for point sets P in general position, G(del)(P) always contains a matching of size at least vertical bar P vertical bar-1/3] and this bound is tight. We also give some structural properties of G(star)(P) graphs, where is the class which contains both upward and downward equilateral triangles. We show that for point sets in general position, the block cut point graph of G(star)(P) is simply a path. Through the equivalence of G(star)(P) graphs with Theta(6) graphs, we also derive that any Theta(6) graph can have at most 5n-11 edges, for point sets in general position. (C) 2013 Elsevier B.V. All rights reserved.

Combining data sets of satellite-retrieved products for basin-scale water balance study: 2. Evaluation on the Mississippi Basin and closure correction model

In this study, we applied the integration methodology developed in the companion paper by Aires (2014) by using real satellite observations over the Mississippi Basin. The methodology provides basin-scale estimates of the four water budget components (precipitation P, evapotranspiration E, water storage change Delta S, and runoff R) in a two-step process: the Simple Weighting (SW) integration and a Postprocessing Filtering (PF) that imposes the water budget closure. A comparison with in situ observations of P and E demonstrated that PF improved the estimation of both components. A Closure Correction Model (CCM) has been derived from the integrated product (SW+PF) that allows to correct each observation data set independently, unlike the SW+PF method which requires simultaneous estimates of the four components. The CCM allows to standardize the various data sets for each component and highly decrease the budget residual (P - E - Delta S - R). As a direct application, the CCM was combined with the water budget equation to reconstruct missing values in any component. Results of a Monte Carlo experiment with synthetic gaps demonstrated the good performances of the method, except for the runoff data that has a variability of the same order of magnitude as the budget residual. Similarly, we proposed a reconstruction of Delta S between 1990 and 2002 where no Gravity Recovery and Climate Experiment data are available. Unlike most of the studies dealing with the water budget closure at the basin scale, only satellite observations and in situ runoff measurements are used. Consequently, the integrated data sets are model independent and can be used for model calibration or validation.

Reconstruction of Two-Dimensional Spectra from One-Dimensional Projections-Examples from Solid State NMR

The use of Projection Reconstruction (PR) to obtain two-dimensional (2D) spectra from one-dimensional (1D) data in the solid state is illustrated. The method exploits multiple 1D spectra obtained using magic angle spinning and off-magic angle spinning. The spectra recorded under the influence of scaled heteronuclear scalar and dipolar couplings in the presence of homonuclear dipolar decoupling sequences have been used to reconstruct J/D Resolved 2D-NMR spectra. The use of just two 1D spectra is observed sufficient to reconstruct a J-resolved 2D-spectrum while a Separated Local Field (SLF) 2D-NMR spectrum could be obtained from three 1D spectra. The experimental techniques for recording the 10 spectra and procedure of reconstruction are discussed and the reconstructed results are compared with 20 experiments recorded in traditional methods. The application of the technique has been made to a solid polycrystalline sample and to a uniaxially oriented liquid crystal. Implementation of PR-NMR in solid state provides high-resolution spectra as well as leads to significant reduction in experimental time. The experiments are relatively simple and are devoid of several technical complications involved in performing the 2D experiments.

Tailoring the interface of an immiscible polymer blend by a mutually miscible homopolymer grafted onto graphene oxide: outstanding mechanical properties

A unique strategy was adopted here to improve the compatibility between the components of an immiscible polymer blend and strengthen the interface. PMMA, a mutually miscible polymer to both PVDF and ABS, improved the compatibility between the phases by localizing at the blends interface. This was supported by the core-shell formation with PMMA as the shell and ABS as the core as observed from the SEM micrographs. This phenomenon was strongly contingent on the concentration of PMMA in the blends. This strategy was further extended to localize graphene oxide (GO) sheets at the blends interface by chemically coupling it to PMMA (PMMA-g-GO). A dramatic increment of ca. 84% in the Young's modulus and ca. 124% in the yield strength was observed in the presence of PMMA-g-GO with respect to the neat blends. A simultaneous increment in both the strength and the modulus was observed in the presence of PMMA-g-GO whereas, only addition of GO resulted in a moderate improvement in the yield strength. This study reveals that a mutually miscible polymer can render compatibility between the immiscible pair and can improve the stress transfer at the interface.

A unique strategy towards high dielectric constant and low loss with multiwall carbon nanotubes anchored onto graphene oxide sheets

Multiwall carbon nanotubes (MWNTs) were anchored onto graphene oxide sheets (GOs) via diazonium and C-C coupling reactions and characterized by spectroscopic and electron microscopic techniques. The thus synthesized MWNT-GO hybrid was then melt mixed with 50/50 polyamide6-maleic anhydride-modified acrylonitrile-butadiene-styrene (PA6-mABS) blend to design materials with high dielectric constant (30) and low dielectric loss. The phase morphology was studied by SEM and it was observed that the MWNT-GO hybrid was selectively localized in the PA6 phase of the blend. The 30 scales with the concentration of MWNT-GO in the blends, which interestingly showed a very low dielectric loss (< 0.2) making them potential candidate for capacitors. In addition, the dynamic storage modulus scales with the fraction of MWNT-GO in the blends, demonstrating their reinforcing capability as well.

Optimal power allocation for protective jamming in wireless networks: A flow based model

We address the problem of passive eavesdroppers in multi-hop wireless networks using the technique of friendly jamming. The network is assumed to employ Decode and Forward (DF) relaying. Assuming the availability of perfect channel state information (CSI) of legitimate nodes and eavesdroppers, we consider a scheduling and power allocation (PA) problem for a multiple-source multiple-sink scenario so that eavesdroppers are jammed, and source-destination throughput targets are met while minimizing the overall transmitted power. We propose activation sets (AS-es) for scheduling, and formulate an optimization problem for PA. Several methods for finding AS-es are discussed and compared. We present an approximate linear program for the original nonlinear, non-convex PA optimization problem, and argue that under certain conditions, both the formulations produce identical results. In the absence of eavesdroppers' CSI, we utilize the notion of Vulnerability Region (VR), and formulate an optimization problem with the objective of minimizing the VR. Our results show that the proposed solution can achieve power-efficient operation while defeating eavesdroppers and achieving desired source-destination throughputs simultaneously. (C) 2015 Elsevier B.V. All rights reserved.

A Polymatroid Approach to Separable Convex Optimization with Linear Ascending Constraints

We revisit a problem studied by Padakandla and Sundaresan SIAM J. Optim., August 2009] on the minimization of a separable convex function subject to linear ascending constraints. The problem arises as the core optimization in several resource allocation problems in wireless communication settings. It is also a special case of an optimization of a separable convex function over the bases of a specially structured polymatroid. We give an alternative proof of the correctness of the algorithm of Padakandla and Sundaresan. In the process we relax some of their restrictions placed on the objective function.

Construction of Singer Subgroup Orbit Codes Based on Cyclic Difference Sets

A recent approach for the construction of constant dimension subspace codes, designed for error correction in random networks, is to consider the codes as orbits of suitable subgroups of the general linear group. In particular, a cyclic orbit code is the orbit of a cyclic subgroup. Hence a possible method to construct large cyclic orbit codes with a given minimum subspace distance is to select a subspace such that the orbit of the Singer subgroup satisfies the distance constraint. In this paper we propose a method where some basic properties of difference sets are employed to select such a subspace, thereby providing a systematic way of constructing cyclic orbit codes with specified parameters. We also present an explicit example of such a construction.

Novel Biobjective Clustering (BiGC) Based on Cooperative Game Theory

We propose a new approach to clustering. Our idea is to map cluster formation to coalition formation in cooperative games, and to use the Shapley value of the patterns to identify clusters and cluster representatives. We show that the underlying game is convex and this leads to an efficient biobjective clustering algorithm that we call BiGC. The algorithm yields high-quality clustering with respect to average point-to-center distance (potential) as well as average intracluster point-to-point distance (scatter). We demonstrate the superiority of BiGC over state-of-the-art clustering algorithms (including the center based and the multiobjective techniques) through a detailed experimentation using standard cluster validity criteria on several benchmark data sets. We also show that BiGC satisfies key clustering properties such as order independence, scale invariance, and richness.