Novel Transmit Precoding Methods for Rayleigh Fading Multiuser TDD-MIMO Systems With CSIT and No CSIR

In this paper, we present novel precoding methods for multiuser Rayleigh fading multiple-input-multiple-output (MIMO) systems when channel state information (CSI) is available at the transmitter (CSIT) but not at the receiver (CSIR). Such a scenario is relevant, for example, in time-division duplex (TDD) MIMO communications, where, due to channel reciprocity, CSIT can be directly acquired by sending a training sequence from the receiver to the transmitter(s). We propose three transmit precoding schemes that convert the fading MIMO channel into a fixed-gain additive white Gaussian noise (AWGN) channel while satisfying an average power constraint. We also extend one of the precoding schemes to the multiuser Rayleigh fading multiple-access channel (MAC), broadcast channel (BC), and interference channel (IC). The proposed schemes convert the fading MIMO channel into fixed-gain parallel AWGN channels in all three cases. Hence, they achieve an infinite diversity order, which is in sharp contrast to schemes based on perfect CSIR and no CSIT, which, at best, achieve a finite diversity order. Further, we show that a polynomial diversity order is retained, even in the presence of channel estimation errors at the transmitter. Monte Carlo simulations illustrate the bit error rate (BER) performance obtainable from the proposed precoding scheme compared with existing transmit precoding schemes.

Rainbow matchings in strongly edge-colored graphs

A rainbow matching of an edge-colored graph G is a matching in which no two edges have the same color. There have been several studies regarding the maximum size of a rainbow matching in a properly edge-colored graph G in terms of its minimum degree 3(G). Wang (2011) asked whether there exists a function f such that a properly edge-colored graph G with at least f (delta(G)) vertices is guaranteed to contain a rainbow matching of size delta(G). This was answered in the affirmative later: the best currently known function Lo and Tan (2014) is f(k) = 4k - 4, for k >= 4 and f (k) = 4k - 3, for k <= 3. Afterwards, the research was focused on finding lower bounds for the size of maximum rainbow matchings in properly edge-colored graphs with fewer than 4 delta(G) - 4 vertices. Strong edge-coloring of a graph G is a restriction of proper edge-coloring where every color class is required to be an induced matching, instead of just being a matching. In this paper, we give lower bounds for the size of a maximum rainbow matching in a strongly edge-colored graph Gin terms of delta(G). We show that for a strongly edge-colored graph G, if |V(G)| >= 2 |3 delta(G)/4|, then G has a rainbow matching of size |3 delta(G)/4|, and if |V(G)| < 2 |3 delta(G)/4|, then G has a rainbow matching of size |V(G)|/2] In addition, we prove that if G is a strongly edge-colored graph that is triangle-free, then it contains a rainbow matching of size at least delta(G). (C) 2015 Elsevier B.V. All rights reserved.

Mixed Mode Analysis of Obliquely Oriented Edge Cracked Semicircular Disk Under Compression

A new mixed-mode compression fracture specimen, obliquely oriented edge cracked semicircular disk (OECSD) is analyzed by extending pure opening mode configuration of edge cracked semicircular disk (ECSD) under Hertzian compression. Photoelastic experiments are conducted on two different specimens of OECSD of same size and different crack lengths and inclinations. Finite element method (FEM) is used to solve a number of cases of the problem varying crack length and crack inclination. FE results show a good match with experiments. Inclination of edge crack in OECSD can be so made as to obtain any mode-mixity ratio between zero and one and beyond for any crack length. The new specimen can be used for fracture testing under compression more conveniently than the existing ones in several ways.

Heterochromatic paths in edge colored graphs without small cycles and heterochromatic-triangle-free graphs

Conditions for the existence of heterochromatic Hamiltonian paths and cycles in edge colored graphs are well investigated in literature. A related problem in this domain is to obtain good lower bounds for the length of a maximum heterochromatic path in an edge colored graph G. This problem is also well explored by now and the lower bounds are often specified as functions of the minimum color degree of G - the minimum number of distinct colors occurring at edges incident to any vertex of G - denoted by v(G). Initially, it was conjectured that the lower bound for the length of a maximum heterochromatic path for an edge colored graph G would be 2v(G)/3]. Chen and Li (2005) showed that the length of a maximum heterochromatic path in an edge colored graph G is at least v(G) - 1, if 1 <= v(G) <= 7, and at least 3v(G)/5] + 1 if v(G) >= 8. They conjectured that the tight lower bound would be v(G) - 1 and demonstrated some examples which achieve this bound. An unpublished manuscript from the same authors (Chen, Li) reported to show that if v(G) >= 8, then G contains a heterochromatic path of length at least 120 + 1. In this paper, we give lower bounds for the length of a maximum heterochromatic path in edge colored graphs without small cycles. We show that if G has no four cycles, then it contains a heterochromatic path of length at least v(G) - o(v(G)) and if the girth of G is at least 4 log(2)(v(G)) + 2, then it contains a heterochromatic path of length at least v(G) - 2, which is only one less than the bound conjectured by Chen and Li (2005). Other special cases considered include lower bounds for the length of a maximum heterochromatic path in edge colored bipartite graphs and triangle-free graphs: for triangle-free graphs we obtain a lower bound of 5v(G)/6] and for bipartite graphs we obtain a lower bound of 6v(G)-3/7]. In this paper, it is also shown that if the coloring is such that G has no heterochromatic triangles, then G contains a heterochromatic path of length at least 13v(G)/17)]. This improves the previously known 3v(G)/4] bound obtained by Chen and Li (2011). We also give a relatively shorter and simpler proof showing that any edge colored graph G contains a heterochromatic path of length at least (C) 2015 Elsevier Ltd. All rights reserved.

Robust design of multiple trailing edge flaps for helicopter vibration reduction: A multi-objective bat algorithm approach

The objective of this study is to determine an optimal trailing edge flap configuration and flap location to achieve minimum hub vibration levels and flap actuation power simultaneously. An aeroelastic analysis of a soft in-plane four-bladed rotor is performed in conjunction with optimal control. A second-order polynomial response surface based on an orthogonal array (OA) with 3-level design describes both the objectives adequately. Two new orthogonal arrays called MGB2P-OA and MGB4P-OA are proposed to generate nonlinear response surfaces with all interaction terms for two and four parameters, respectively. A multi-objective bat algorithm (MOBA) approach is used to obtain the optimal design point for the mutually conflicting objectives. MOBA is a recently developed nature-inspired metaheuristic optimization algorithm that is based on the echolocation behaviour of bats. It is found that MOBA inspired Pareto optimal trailing edge flap design reduces vibration levels by 73% and flap actuation power by 27% in comparison with the baseline design.

Fermionic edge states and new physics

We investigate the properties of the Dirac operator on manifolds with boundaries in the presence of the Atiyah-Patodi-Singer boundary condition. An exact counting of the number of edge states for boundaries with isometry of a sphere is given. We show that the problem with the above boundary condition can be mapped to one where the manifold is extended beyond the boundary and the boundary condition is replaced by a delta function potential of suitable strength. We also briefly highlight how the problem of the self-adjointness of the operators in the presence of moving boundaries can be simplified by suitable transformations which render the boundary fixed and modify the Hamiltonian and the boundary condition to reflect the effect of moving boundary.

Asymptotic Bounds on the Power-Delay Tradeoff for Fading Point-to-Point Links From Geometric Bounds on the Stationary Distribution of the Queue Length

The optimal power-delay tradeoff is studied for a time-slotted independently and identically distributed fading point-to-point link, with perfect channel state information at both transmitter and receiver, and with random packet arrivals to the transmitter queue. It is assumed that the transmitter can control the number of packets served by controlling the transmit power in the slot. The optimal tradeoff between average power and average delay is analyzed for stationary and monotone transmitter policies. For such policies, an asymptotic lower bound on the minimum average delay of the packets is obtained, when average transmitter power approaches the minimum average power required for transmitter queue stability. The asymptotic lower bound on the minimum average delay is obtained from geometric upper bounds on the stationary distribution of the queue length. This approach, which uses geometric upper bounds, also leads to an intuitive explanation of the asymptotic behavior of average delay. The asymptotic lower bounds, along with previously known asymptotic upper bounds, are used to identify three new cases where the order of the asymptotic behavior differs from that obtained from a previously considered approximate model, in which the transmit power is a strictly convex function of real valued service batch size for every fade state.

Supersymmetry: Boundary conditions and edge states

When spatial boundaries are inserted, supersymmetry (SUSY) can be broken. We have shown that in an N = 2 supersymmetric theory, all local boundary conditions allowed by self-adjointness of the Hamiltonian break N = 2 SUSY, while only a few of these boundary conditions preserve N = 1 SUSY. We have also shown that for a subset of the boundary conditions compatible with N = 1 SUSY, there exist fermionic ground states which are localized near the boundary. We also show that only very few nonlocal boundary conditions like periodic boundary conditions preserve full N = 2 supersymmetry, but none of them exhibits edge states.

Near-Optimal Detection Thresholds for Bayesian Spectrum Sensing Under Fading

This paper considers the problem of energy-based, Bayesian spectrum sensing in cognitive radios under various fading environments. Under the well-known central limit theorem based model for energy detection, we derive analytically tractable expressions for near-optimal detection thresholds that minimize the probability of error under lognormal, Nakagami-m, and Weibull fading. For the Suzuki fading case, a generalized gamma approximation is provided, which saves on the computation of an integral. In each case, the accuracy of the theoretical expressions as compared to the optimal thresholds are illustrated through simulations.

Many-Body Localization in the Presence of a Single-Particle Mobility Edge

In one dimension, noninteracting particles can undergo a localization-delocalization transition in a quasiperiodic potential. Recent studies have suggested that this transition transforms into a many-body localization (MBL) transition upon the introduction of interactions. It has also been shown that mobility edges can appear in the single particle spectrum for certain types of quasiperiodic potentials. Here, we investigate the effect of interactions in two models with such mobility edges. Employing the technique of exact diagonalization for finite-sized systems, we calculate the level spacing distribution, time evolution of entanglement entropy, optical conductivity, and return probability to detect MBL. We find that MBL does indeed occur in one of the two models we study, but the entanglement appears to grow faster than logarithmically with time unlike in other MBL systems.

Error exponent analysis of energy-based Bayesian decentralized spectrum sensing under fading

This paper considers decentralized spectrum sensing, i.e., detection of occupancy of the primary users' spectrum by a set of Cognitive Radio (CR) nodes, under a Bayesian set-up. The nodes use energy detection to make their individual decisions, which are combined at a Fusion Center (FC) using the K-out-of-N fusion rule. The channel from the primary transmitter to the CR nodes is assumed to undergo fading, while that from the nodes to the FC is assumed to be error-free. In this scenario, a novel concept termed as the Error Exponent with a Confidence Level (EECL) is introduced to evaluate and compare the performance of different detection schemes. Expressions for the EECL under general fading conditions are derived. As a special case, it is shown that the conventional error exponent both at individual sensors, and at the FC is zero. Further, closed-form lower bounds on the EECL are derived under Rayleigh fading and lognormal shadowing. As an example application, it answers the question of whether to use pilot-signal based narrowband sensing, where the signal undergoes Rayleigh fading, or to sense over the entire bandwidth of a wideband signal, where the signal undergoes lognormal shadowing. Theoretical results are validated using Monte Carlo simulations. (C) 2015 Elsevier B.V. All rights reserved.

Edge states, spin transport, and impurity-induced local density of states in spin-orbit coupled graphene

We study graphene, which has both spin-orbit coupling (SOC), taken to be of the Kane-Mele form, and a Zeeman field induced due to proximity to a ferromagnetic material. We show that a zigzag interface of graphene having SOC with its pristine counterpart hosts robust chiral edge modes in spite of the gapless nature of the pristine graphene; such modes do not occur for armchair interfaces. Next we study the change in the local density of states (LDOS) due to the presence of an impurity in graphene with SOC and Zeeman field, and demonstrate that the Fourier transform of the LDOS close to the Dirac points can act as a measure of the strength of the spin-orbit coupling; in addition, for a specific distribution of impurity atoms, the LDOS is controlled by a destructive interference effect of graphene electrons which is a direct consequence of their Dirac nature. Finally, we study transport across junctions, which separates spin-orbit coupled graphene with Kane-Mele and Rashba terms from pristine graphene both in the presence and absence of a Zeeman field. We demonstrate that such junctions are generally spin active, namely, they can rotate the spin so that an incident electron that is spin polarized along some direction has a finite probability of being transmitted with the opposite spin. This leads to a finite, electrically controllable, spin current in such graphene junctions. We discuss possible experiments that can probe our theoretical predictions.

Advancing Edge Speeds of Epithelial Monolayers Depend on Their Initial Confining Geometry

Collective cell migrations are essential in several physiological processes and are driven by both chemical and mechanical cues. The roles of substrate stiffness and confinement on collective migrations have been investigated in recent years, however few studies have addressed how geometric shapes influence collective cell migrations. Here, we address the hypothesis that the relative position of a cell within the confinement influences its motility. Monolayers of two types of epithelial cells-MCF7, a breast epithelial cancer cell line, and MDCK, a control epithelial cell line-were confined within circular, square, and cross-shaped stencils and their migration velocities were quantified upon release of the constraint using particle image velocimetry. The choice of stencil geometry allowed us to investigate individual cell motility within convex, straight and concave boundaries. Cells located in sharp, convex boundaries migrated at slower rates than those in concave or straight edges in both cell types. The overall cluster migration occurred in three phases: an initial linear increase with time, followed by a plateau region and a subsequent decrease in cluster speeds. An acto-myosin contractile ring, present in the MDCK but absent in MCF7 monolayer, was a prominent feature in the emergence of leader cells from the MDCK clusters which occurred every similar to 125 mu m from the vertex of the cross. Further, coordinated cell movements displayed vorticity patterns in MDCK which were absent in MCF7 clusters. We also used cytoskeletal inhibitors to show the importance of acto-myosin bounding cables in collective migrations through translation of local movements to create long range coordinated movements and the creation of leader cells within ensembles. To our knowledge, this is the first demonstration of how bounding shapes influence long-term migratory behaviours of epithelial cell monolayers. These results are important for tissue engineering and may also enhance our understanding of cell movements during developmental patterning and cancer metastasis.