Bounds on the sum-rate capacity of the Gaussian MIMO X channel

We consider the MIMO X channel (XC), a system consisting of two transmit-receive pairs, where each transmitter communicates with both the receivers. Both the transmitters and receivers are equipped with multiple antennas. First, we derive an upper bound on the sum-rate capacity of the MIMO XC under individual power constraint at each transmitter. The sum-rate capacity of the two-user multiple access channel (MAC) that results when receiver cooperation is assumed forms an upper bound on the sum-rate capacity of the MIMO XC. We tighten this bound by considering noise correlation between the receivers and deriving the worst noise covariance matrix. It is shown that the worst noise covariance matrix is a saddle-point of a zero-sum, two-player convex-concave game, which is solved through a primal-dual interior point method that solves the maximization and the minimization parts of the problem simultaneously. Next, we propose an achievable scheme which employs dirty paper coding at the transmitters and successive decoding at the receivers. We show that the derived upper bound is close to the achievable region of the proposed scheme at low to medium SNRs.

Decode-and-forward relay beamforming for secrecy with imperfect CSI and multiple eavesdroppers

In this paper, we evaluate secrecy rates in cooperative relay beamforming in the presence of imperfect channel state information (CSI) and multiple eavesdroppers. A source-destination pair aided by.. out of.. relays, 1 <= k <= M, using decode-and-forward relay beamforming is considered. We compute the worst case secrecy rate with imperfect CSI in the presence of multiple eavesdroppers, where the number of eavesdroppers can be more than the number of relays. We solve the optimization problem for all possible relay combinations to find the secrecy rate and optimum source and relay weights subject to a total power constraint. We relax the rank-1 constraint on the complex semi-definite relay weight matrix and use S-procedure to reformulate the optimization problem that can be solved using convex semi-definite programming.

Scalar transport in diffusion flame wrapped up by an air and fuel side vortex

The present work involves a computational study of soot (chosen as a scalar which is a primary pollutant source) formation and transport in a laminar acetylene diffusion flame perturbed by a convecting line vortex. The topology of soot contours resulting from flame vortex interactions has been investigated. More soot was produced when vortex was introduced from the air side in comparison to the fuel side. Also, the soot topography was spatially more diffuse in the case of air side vortex. The computational model was found to be in good agreement with the experimental work previously reported in the literature. The computational simulation enabled a study of various parameters like temperature, equivalence ratio and temperature gradient affecting the soot production and transport. Temperatures were found to be higher in the case of air side vortex in contrast to the fuel side one. In case of fuel side vortex, abundance of fuel in the vortex core resulted in fuel-rich combustion zone in the core and a more discrete soot topography. Besides, the overall soot production was observed to be low in the fuel side vortex. However, for the air side vortex, air abundance in the core resulted in higher temperatures and greater soot production. Probability density functions (PDFs) have been introduced to investigate the spatiotemporal variation of soot yield and transport and their dependence on temperature and acetylene concentration from statistical view point. In addition, the effect of flame curvature on soot production is also studied. The regions convex to fuel stream side witnessed thicker soot layer. All numerical simulations have been carried out on Fluent 6.3.26. (C) 2013 Elsevier Ltd. All rights reserved.

On the Erdos-Szekeres n-interior-point problem

The n-interior-point variant of the Erdos Szekeres problem is the following: for every n, n >= 1, does there exist a g(n) such that every point set in the plane with at least g(n) interior points has a convex polygon containing exactly n interior points. The existence of g(n) has been proved only for n <= 3. In this paper, we show that for any fixed r >= 2, and for every n >= 5, every point set having sufficiently large number of interior points and at most r convex layers contains a subset with exactly n interior points. We also consider a relaxation of the notion of convex polygons and show that for every n, n >= 1, any point set with at least n interior points has an almost convex polygon (a simple polygon with at most one concave vertex) that contains exactly n interior points. (C) 2013 Elsevier Ltd. All rights reserved.

Majorana fermions in superconducting wires: Effects of long-range hopping, broken time-reversal symmetry, and potential landscapes

We present a comprehensive study of two of the most experimentally relevant extensions of Kitaev's spinless model of a one-dimensional p-wave superconductor: those involving (i) longer-range hopping and superconductivity and (ii) inhomogeneous potentials. We commence with a pedagogical review of the spinless model and, as a means of characterizing topological phases exhibited by the systems studied here, we introduce bulk topological invariants as well as those derived from an explicit consideration of boundary modes. In time-reversal symmetric systems, we find that the longer range hopping leads to topological phases characterized by multiple Majorana modes. In particular, we investigate a spin model that respects a duality and maps to a fermionic model with multiple Majorana modes; we highlight the connection between these topological phases and the broken symmetry phases in the original spin model. In the presence of time-reversal symmetry breaking terms, we show that the topological phase diagram is characterized by an extended gapless regime. For the case of inhomogeneous potentials, we explore phase diagrams of periodic, quasiperiodic, and disordered systems. We present a detailed mapping between normal state localization properties of such systems and the topological phases of the corresponding superconducting systems. This powerful tool allows us to leverage the analyses of Hofstadter's butterfly and the vast literature on Anderson localization to the question of Majorana modes in superconducting quasiperiodic and disordered systems, respectively. We briefly touch upon the synergistic effects that can be expected in cases where long-range hopping and disorder are both present.

On piercing (pseudo)lines and boxes

We say a family of geometric objects C has (l;k)-property if every subfamily C0C of cardinality at most lisk- piercable. In this paper we investigate the existence of g(k;d)such that if any family of objects C in Rd has the (g(k;d);k)-property, then C is k-piercable. Danzer and Gr̈ unbaum showed that g(k;d)is infinite for fami-lies of boxes and translates of centrally symmetric convex hexagons. In this paper we show that any family of pseudo-lines(lines) with (k2+k+ 1;k)-property is k-piercable and extend this result to certain families of objects with discrete intersections. This is the first positive result for arbitrary k for a general family of objects. We also pose a relaxed ver-sion of the above question and show that any family of boxes in Rd with (k2d;k)-property is 2dk- piercable.

Classification calibration dimension for general multiclass losses

We study consistency properties of surrogate loss functions for general multiclass classification problems, defined by a general loss matrix. We extend the notion of classification calibration, which has been studied for binary and multiclass 0-1 classification problems (and for certain other specific learning problems), to the general multiclass setting, and derive necessary and sufficient conditions for a surrogate loss to be classification calibrated with respect to a loss matrix in this setting. We then introduce the notion of \emph{classification calibration dimension} of a multiclass loss matrix, which measures the smallest `size' of a prediction space for which it is possible to design a convex surrogate that is classification calibrated with respect to the loss matrix. We derive both upper and lower bounds on this quantity, and use these results to analyze various loss matrices. In particular, as one application, we provide a different route from the recent result of Duchi et al.\ (2010) for analyzing the difficulty of designing `low-dimensional' convex surrogates that are consistent with respect to pairwise subset ranking losses. We anticipate the classification calibration dimension may prove to be a useful tool in the study and design of surrogate losses for general multiclass learning problems.

Entanglement entropy from the holographic stress tensor

We consider entanglement entropy in the context of gauge/gravity duality for conformal field theories in even dimensions. The holographic prescription due to Ryu and Takayanagi (RT) leads to an equation describing how the entangling surface extends into the bulk geometry. We show that setting to zero, the timetime component of the Brown-York stress tensor evaluated on the co-dimension 1 entangling surface, leads to the same equation. By considering a spherical entangling surface as an example, we observe that the Euclidean actionmethods in AdS/CFT will lead to the RT area functional arising as a counterterm needed to regularize the stress tensor. We present arguments leading to a justification for the minimal area prescription.

Fractional Hilbert transform extensions and associated analytic signal construction

The analytic signal (AS) was proposed by Gabor as a complex signal corresponding to a given real signal. The AS has a one-sided spectrum and gives rise to meaningful spectral averages. The Hilbert transform (HT) is a key component in Gabor's AS construction. We generalize the construction methodology by employing the fractional Hilbert transform (FrHT), without going through the standard fractional Fourier transform (FrFT) route. We discuss some properties of the fractional Hilbert operator and show how decomposition of the operator in terms of the identity and the standard Hilbert operators enables the construction of a family of analytic signals. We show that these analytic signals also satisfy Bedrosian-type properties and that their time-frequency localization properties are unaltered. We also propose a generalized-phase AS (GPAS) using a generalized-phase Hilbert transform (GPHT). We show that the GPHT shares many properties of the FrHT, in particular, selective highlighting of singularities, and a connection with Lie groups. We also investigate the duality between analyticity and causality concepts to arrive at a representation of causal signals in terms of the FrHT and GPHT. On the application front, we develop a secure multi-key single-sideband (SSB) modulation scheme and analyze its performance in noise and sensitivity to security key perturbations. (C) 2013 Elsevier B.V. All rights reserved.

ENTANGLEMENT ENTROPY FROM SURFACE TERMS IN GENERAL RELATIVITY

Entanglement entropy in local quantum field theories is typically ultraviolet divergent due to short distance effects in the neighborhood of the entangling region. In the context of gauge/gravity duality, we show that surface terms in general relativity are able to capture this entanglement entropy. In particular, we demonstrate that for 1+1-dimensional (1 + 1d) conformal field theories (CFTs) at finite temperature whose gravity dual is Banados-Teitelboim-Zanelli (BTZ) black hole, the Gibbons-Hawking-York term precisely reproduces the entanglement entropy which can be computed independently in the field theory.

Curvature based mobility analysis and form closure of smooth planar curves with multiple contacts

This paper presents a simple second-order, curvature based mobility analysis of planar curves in contact. The underlying theory deals with penetration and separation of curves with multiple contacts, based on relative configuration of osculating circles at points of contact for a second-order rotation about each point of the plane. Geometric and analytical treatment of mobility analysis is presented for generic as well as special contact geometries. For objects with a single contact, partitioning of the plane into four types of mobility regions has been shown. Using point based composition operations based on dual-number matrices, analysis has been extended to computationally handle multiple contacts scenario. A novel color coded directed line has been proposed to capture the contact scenario. Multiple contacts mobility is obtained through intersection of the mobility half-spaces. It is derived that mobility region comprises a pair of unbounded or a single bounded convex polygon. The theory has been used for analysis and synthesis of form closure configurations, revolute and prismatic kinematic pairs. (C) 2013 Elsevier Ltd. All rights reserved.

Scalable sequential alternating proximal methods for sparse structural SVMs and CRFs

Structural Support Vector Machines (SSVMs) and Conditional Random Fields (CRFs) are popular discriminative methods used for classifying structured and complex objects like parse trees, image segments and part-of-speech tags. The datasets involved are very large dimensional, and the models designed using typical training algorithms for SSVMs and CRFs are non-sparse. This non-sparse nature of models results in slow inference. Thus, there is a need to devise new algorithms for sparse SSVM and CRF classifier design. Use of elastic net and L1-regularizer has already been explored for solving primal CRF and SSVM problems, respectively, to design sparse classifiers. In this work, we focus on dual elastic net regularized SSVM and CRF. By exploiting the weakly coupled structure of these convex programming problems, we propose a new sequential alternating proximal (SAP) algorithm to solve these dual problems. This algorithm works by sequentially visiting each training set example and solving a simple subproblem restricted to a small subset of variables associated with that example. Numerical experiments on various benchmark sequence labeling datasets demonstrate that the proposed algorithm scales well. Further, the classifiers designed are sparser than those designed by solving the respective primal problems and demonstrate comparable generalization performance. Thus, the proposed SAP algorithm is a useful alternative for sparse SSVM and CRF classifier design.

Sensitivity of Water Dynamics to Biologically Significant Surfaces of Monomeric Insulin: Role of Topology and Electrostatic Interactions

In addition to the biologically active monomer of the protein insulin circulating in human blood, the molecule also exists in dimeric and hexameric forms that are used as storage. The insulin monomer contains two distinct surfaces, namely, the dimer forming surface (DFS) and the hexamer forming surface (HFS), that are specifically designed to facilitate the formation of the dimer and the hexamer, respectively. In order to characterize the structural and dynamical behavior of interfacial water molecules near these two surfaces (DFS and HFS), we performed atomistic molecular dynamics simulations of insulin with explicit water. Dynamical characterization reveals that the structural relaxation of the hydrogen bonds formed between the residues of DFS and the interfacial water molecules is faster than those formed between water and that of the HFS. Furthermore, the residence times of water molecules in the protein hydration layer for both the DFS and HFS are found to be significantly higher than those for some of the other proteins studied so far, such as HP-36 and lysozyme. In particular, we find that more structured water molecules, with higher residence times (similar to 300-500 ps), are present near HFS than those near DFS. A significant slowing down is observed in the decay of associated rotational auto time correlation functions of O-H bond vector of water in the vicinity of HFS. The surface topography and the arrangement of amino acid residues work together to organize the water molecules in the hydration layer in order to provide them with a preferred orientation. HFS having a large polar solvent accessible surface area and a convex extensive nonpolar region, drives the surrounding water molecules to acquire predominantly an outward H-atoms directed, clathrate-like structure. In contrast, near the DFS, the surrounding water molecules acquire an inward H-atoms directed orientation owing to the flat curvature of hydrophobic surface and the interrupted hydrophilic residual alignment. We have followed escape trajectory of several such quasi-bound water molecules from both the surfaces that reveal the significant differences between the two hydration layers.

Static shear strength and fatigue life of refill friction stir spot welded AA 6061-T6 sheets

This study was aimed at evaluating the static shear strength and fatigue properties of the newly developed refilled friction stir spot welded AA 6061-T6 joints. The keyhole, the process disadvantage of conventional friction stir spot welding, was refilled successfully, using an additional filler plate, with specially designed tools. Two different tool profiles, namely, convex and concave, were used for the refilling process. Sound and defect free joints were obtained by the refilling process. Joints refilled with convex tools showed better static shear strength than those with the concave ones. The variation of microhardness in different regions of the weld was analysed. Fatigue tests were conducted on the lap shear specimens at a stress ratio of R=0.1. The optical micrographs of the welds after fatigue failure in both the conventional and refilled processes were examined to study the fatigue crack propagation and failure modes.

Optimal sequential wireless relay placement on a random lattice path

Our work is motivated by impromptu (or ``as-you-go'') deployment of wireless relay nodes along a path, a need that arises in many situations. In this paper, the path is modeled as starting at the origin (where there is the data sink, e.g., the control center), and evolving randomly over a lattice in the positive quadrant. A person walks along the path deploying relay nodes as he goes. At each step, the path can, randomly, either continue in the same direction or take a turn, or come to an end, at which point a data source (e.g., a sensor) has to be placed, that will send packets to the data sink. A decision has to be made at each step whether or not to place a wireless relay node. Assuming that the packet generation rate by the source is very low, and simple link-by-link scheduling, we consider the problem of sequential relay placement so as to minimize the expectation of an end-to-end cost metric (a linear combination of the sum of convex hop costs and the number of relays placed). This impromptu relay placement problem is formulated as a total cost Markov decision process. First, we derive the optimal policy in terms of an optimal placement set and show that this set is characterized by a boundary (with respect to the position of the last placed relay) beyond which it is optimal to place the next relay. Next, based on a simpler one-step-look-ahead characterization of the optimal policy, we propose an algorithm which is proved to converge to the optimal placement set in a finite number of steps and which is faster than value iteration. We show by simulations that the distance threshold based heuristic, usually assumed in the literature, is close to the optimal, provided that the threshold distance is carefully chosen. (C) 2014 Elsevier B.V. All rights reserved.