Generalizing the Amplify-and-Forward Relay Gain Model: An Optimal SEP Perspective

Two models for AF relaying, namely, fixed gain and fixed power relaying, have been extensively studied in the literature given their ability to harness spatial diversity. In fixed gain relaying, the relay gain is fixed but its transmit power varies as a function of the source-relay channel gain. In fixed power relaying, the relay transmit power is fixed, but its gain varies. We revisit and generalize the fundamental two-hop AF relaying model. We present an optimal scheme in which an average power constrained AF relay adapts its gain and transmit power to minimize the symbol error probability (SEP) at the destination. Also derived are insightful and practically amenable closed-form bounds for the optimal relay gain. We then analyze the SEP of MPSK, derive tight bounds for it, and characterize the diversity order for Rayleigh fading. Also derived is an SEP approximation that is accurate to within 0.1 dB. Extensive results show that the scheme yields significant energy savings of 2.0-7.7 dB at the source and relay. Optimal relay placement for the proposed scheme is also characterized, and is different from fixed gain or power relaying. Generalizations to MQAM and other fading distributions are also discussed.

Cubicity and Bandwidth

A unit cube in (or a k-cube in short) is defined as the Cartesian product R (1) x R (2) x ... x R (k) where R (i) (for 1 a parts per thousand currency sign i a parts per thousand currency sign k) is a closed interval of the form a (i) , a (i) + 1] on the real line. A k-cube representation of a graph G is a mapping of the vertices of G to k-cubes such that two vertices in G are adjacent if and only if their corresponding k-cubes have a non-empty intersection. The cubicity of G is the minimum k such that G has a k-cube representation. From a geometric embedding point of view, a k-cube representation of G = (V, E) yields an embedding such that for any two vertices u and v, ||f(u) - f(v)||(a) a parts per thousand currency sign 1 if and only if . We first present a randomized algorithm that constructs the cube representation of any graph on n vertices with maximum degree Delta in O(Delta ln n) dimensions. This algorithm is then derandomized to obtain a polynomial time deterministic algorithm that also produces the cube representation of the input graph in the same number of dimensions. The bandwidth ordering of the graph is studied next and it is shown that our algorithm can be improved to produce a cube representation of the input graph G in O(Delta ln b) dimensions, where b is the bandwidth of G, given a bandwidth ordering of G. Note that b a parts per thousand currency sign n and b is much smaller than n for many well-known graph classes. Another upper bound of b + 1 on the cubicity of any graph with bandwidth b is also shown. Together, these results imply that for any graph G with maximum degree Delta and bandwidth b, the cubicity is O(min{b, Delta ln b}). The upper bound of b + 1 is used to derive upper bounds for the cubicity of circular-arc graphs, cocomparability graphs and AT-free graphs in terms of the maximum degree Delta.

Cramer-Rao-Type Bounds for Sparse Bayesian Learning

In this paper, we derive Hybrid, Bayesian and Marginalized Cramer-Rao lower bounds (HCRB, BCRB and MCRB) for the single and multiple measurement vector Sparse Bayesian Learning (SBL) problem of estimating compressible vectors and their prior distribution parameters. We assume the unknown vector to be drawn from a compressible Student-prior distribution. We derive CRBs that encompass the deterministic or random nature of the unknown parameters of the prior distribution and the regression noise variance. We extend the MCRB to the case where the compressible vector is distributed according to a general compressible prior distribution, of which the generalized Pareto distribution is a special case. We use the derived bounds to uncover the relationship between the compressibility and Mean Square Error (MSE) in the estimates. Further, we illustrate the tightness and utility of the bounds through simulations, by comparing them with the MSE performance of two popular SBL-based estimators. We find that the MCRB is generally the tightest among the bounds derived and that the MSE performance of the Expectation-Maximization (EM) algorithm coincides with the MCRB for the compressible vector. We also illustrate the dependence of the MSE performance of SBL based estimators on the compressibility of the vector for several values of the number of observations and at different signal powers.

Realistic minimum desorption temperatures and compressor sizing for activated carbon + HFC 134a adsorption coolers

A low thermal diffusivity of adsorption beds induces a large thermal gradient across cylindrical adsorbers used in adsorption cooling cycles. This reduces the concentration difference across which a thermal compressor operates. Slow adsorption kinetics in conjunction with the void volume effect further diminishes throughputs from those adsorption thermal compressors. The problem can be partially alleviated by increasing the desorption temperatures. The theme of this paper is the determination the minimum desorption temperature required for a given set of evaporating/condensing temperatures for an activated carbon + HFC 134a adsorption cooler. The calculation scheme is validated from experimental data. Results from a parametric analysis covering a range of evaporating/condensing/desorption temperatures are presented. It is found that the overall uptake efficiency and Carnot COP characterize these bounds. A design methodology for adsorber sizing is evolved. (c) 2012 Elsevier Ltd. All rights reserved.

Quantitative interactions between the A-type K+ current and inositol trisphosphate receptors regulate intraneuronal Ca2+ waves and synaptic plasticity

Key points center dot Active calcium signal propagation occurs when an initial calcium trigger elicits calcium release through endoplasmic reticulum (ER) receptors. A high concentration of the calcium trigger in thin-calibre dendrites would suppress release of calcium through hippocampal inositol trisphosphate receptors (InsP3Rs). center dot Could the high-density expression of A-type K+ channels in thin-calibre dendrites be a mechanism for inhibiting this suppression, thereby restoring the utility of the ER as a substrate for active calcium propagation? center dot Quantitative analyses involving experimentally constrained models reveal a bell-shaped dependence of calcium released through InsP3Rs on the A-type K+ channel density, during the propagation of a calcium wave. center dot A-type K+ channels regulated the relative contribution of ER calcium to the induction of synaptic plasticity in the presence of model metabotropic glutamate receptors. center dot These results identify a novel form of interaction between active dendrites and the ER membrane and suggest that A-type K+ channels are ideally placed for inhibiting the suppression of InsP3Rs in thin-calibre dendrites. Abstract The A-type potassium current has been implicated in the regulation of several physiological processes. Here, we explore a role for the A-type potassium current in regulating the release of calcium through inositol trisphosphate receptors (InsP3R) that reside on the endoplasmic reticulum (ER) of hippocampal pyramidal neurons. To do this, we constructed morphologically realistic, conductance-based models equipped with kinetic schemes that govern several calcium signalling modules and pathways, and constrained the distributions and properties of constitutive components by experimental measurements from these neurons. Employing these models, we establish a bell-shaped dependence of calcium release through InsP3Rs on the density ofA-type potassium channels, during the propagation of an intraneuronal calcium wave initiated through established protocols. Exploring the sensitivities of calcium wave initiation and propagation to several underlying parameters, we found that ER calcium release critically depends on dendritic diameter and that wave initiation occurred at branch points as a consequence of a high surface area to volume ratio of oblique dendrites. Furthermore, analogous to the role ofA-type potassium channels in regulating spike latency, we found that an increase in the density ofA-type potassium channels led to increases in the latency and the temporal spread of a propagating calcium wave. Next, we incorporated kinetic models for the metabotropic glutamate receptor (mGluR) signalling components and a calcium-controlled plasticity rule into our model and demonstrate thatthe presence of mGluRs induced a leftward shift in a BienenstockCooperMunro-like synaptic plasticity profile. Finally, we show that the A-type potassium current could regulate the relative contribution of ER calcium to synaptic plasticity induced either through 900 pulses of various stimulus frequencies or through theta burst stimulation. Our results establish a novel form of interaction between active dendrites and the ER membrane, uncovering a powerful mechanism that could regulate biophysical/biochemical signal integration and steer the spatiotemporal spread of signalling microdomains through changes in dendritic excitability.

Evidence for the role of Mycobacteriumtuberculosis RecG helicase in DNA repair and recombination

In order to survive and replicate in a variety of stressful conditions during its life cycle, Mycobacteriumtuberculosis must possess mechanisms to safeguard the integrity of the genome. Although DNA repair and recombination related genes are thought to play key roles in the repair of damaged DNA in all organisms, so far only a few of them have been functionally characterized in the tubercle bacillus. In this study, we show that M.tuberculosis RecG (MtRecG) expression was induced in response to different genotoxic agents. Strikingly, expression of MtRecG in Escherichiacoli recG mutant strain provided protection against mitomycin C, methyl methane sulfonate and UV induced cell death. Purified MtRecG exhibited higher binding affinity for the Holliday junction (HJ) compared with a number of canonical recombinational DNA repair intermediates. Notably, although MtRecG binds at the core of the mobile and immobile HJs, and with higher binding affinity for the immobile HJ, branch migration was evident only in the case of the mobile HJ. Furthermore, immobile HJs stimulate MtRecG ATPase activity less efficiently than mobile HJs. In addition to HJ substrates, MtRecG exhibited binding affinity for a variety of branched DNA structures including three-way junctions, replication forks, flap structures, forked duplex and a D-loop structure, but demonstrated strong unwinding activity on replication fork and flap DNA structures. Together, these results support that MtRecG plays an important role in processes related to DNA metabolism under normal as well as stress conditions.

SEP-optimal adaptive gain and transmit power amplify-and-forward relaying

Amplify-and-forward (AF) relay based cooperation has been investigated in the literature given its simplicity and practicality. Two models for AF, namely, fixed gain and fixed power relaying, have been extensively studied. In fixed gain relaying, the relay gain is fixed but its transmit power varies as a function of the source-relay (SR) channel gain. In fixed power relaying, the relay's instantaneous transmit power is fixed, but its gain varies. We propose a general AF cooperation model in which an average transmit power constrained relay jointly adapts its gain and transmit power as a function of the channel gains. We derive the optimal AF gain policy that minimizes the fading- averaged symbol error probability (SEP) of MPSK and present insightful and tractable lower and upper bounds for it. We then analyze the SEP of the optimal policy. Our results show that the optimal scheme is up to 39.7% and 47.5% more energy-efficient than fixed power relaying and fixed gain relaying, respectively. Further, the weaker the direct source-destination link, the greater are the energy-efficiency gains.

Phylogenetic analysis and molecular dating suggest that hemidactylus anamallensis is not a member of the hemidactylus radiation and has an ancient late cretaceous origin

Background of the Work: The phylogenetic position and evolution of Hemidactylus anamallensis (family Gekkonidae) has been much debated in recent times. In the past it has been variously assigned to genus Hoplodactylus (Diplodactylidae) as well as a monotypic genus `Dravidogecko' (Gekkonidae). Since 1995, this species has been assigned to Hemidactylus, but there is much disagreement between authors regarding its phylogenetic position within this genus. In a recent molecular study H. anamallensis was sister to Hemidactylus but appeared distinct from it in both mitochondrial and nuclear markers. However, this study did not include genera closely allied to Hemidactylus, thus a robust evaluation of this hypothesis was not undertaken. Methods: The objective of this study was to investigate the phylogenetic position of H. anamallensis within the gekkonid radiation. To this end, several nuclear and mitochondrial markers were sequenced from H. anamallensis, selected members of the Hemidactylus radiation and genera closely allied to Hemidactylus. These sequences in conjunction with published sequences were subjected to multiple phylogenetic analyses. Furthermore the nuclear dataset was also subjected to molecular dating analysis to ascertain the divergence between H. anamallensis and related genera. Results and Conclusion: Results showed that H. anamallensis lineage was indeed sister to Hemidactylus group but was separated from the rest of the Hemidactylus by a long branch. The divergence estimates supported a scenario wherein H. anamallensis dispersed across a marine barrier to the drifting peninsular Indian plate in the late Cretaceous whereas Hemidactylus arrived on the peninsular India after the Indian plate collided with the Eurasian plate. Based on these molecular evidence and biogeographical scenario we suggest that the genus Dravidogecko should be resurrected.

Capacity bounds for the Gaussian X channel

We consider bounds for the capacity region of the Gaussian X channel (XC), a system consisting of two transmit-receive pairs, where each transmitter communicates with both the receivers. We first classify the XC into two classes, the strong XC and the mixed XC. In the strong XC, either the direct channels are stronger than the cross channels or vice-versa, whereas in the mixed XC, one of the direct channels is stronger than the corresponding cross channel and vice-versa. After this classification, we give outer bounds on the capacity region for each of the two classes. This is based on the idea that when one of the messages is eliminated from the XC, the rate region of the remaining three messages are enlarged. We make use of the Z channel, a system obtained by eliminating one message and its corresponding channel from the X channel, to bound the rate region of the remaining messages. The outer bound to the rate region of the remaining messages defines a subspace in R-+(4) and forms an outer bound to the capacity region of the XC. Thus, the outer bound to the capacity region of the XC is obtained as the intersection of the outer bounds to the four combinations of the rate triplets of the XC. Using these outer bounds on the capacity region of the XC, we derive new sum-rate outer bounds for both strong and mixed Gaussian XCs and compare them with those existing in literature. We show that the sum-rate outer bound for strong XC gives the sum-rate capacity in three out of the four sub-regions of the strong Gaussian XC capacity region. In case of mixed Gaussian XC, we recover the recent results in 11] which showed that the sum-rate capacity is achieved in two out of the three sub-regions of the mixed XC capacity region and give a simple alternate proof of the same.

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.

Splicing Functions and Global Dependency on Fission Yeast Slu7 Reveal Diversity in Spliceosome Assembly

The multiple short introns in Schizosaccharomyces pombe genes with degenerate cis sequences and atypically positioned polypyrimidine tracts make an interesting model to investigate canonical and alternative roles for conserved splicing factors. Here we report functions and interactions of the S. pombe slu7(+) (spslu7(+)) gene product, known from Saccharomyces cerevisiae and human in vitro reactions to assemble into spliceosomes after the first catalytic reaction and to dictate 3' splice site choice during the second reaction. By using a missense mutant of this essential S. pombe factor, we detected a range of global splicing derangements that were validated in assays for the splicing status of diverse candidate introns. We ascribe widespread, intron-specific SpSlu7 functions and have deduced several features, including the branch nucleotide-to-3' splice site distance, intron length, and the impact of its A/U content at the 5' end on the intron's dependence on SpSlu7. The data imply dynamic substrate-splicing factor relationships in multiintron transcripts. Interestingly, the unexpected early splicing arrest in spslu7-2 revealed a role before catalysis. We detected a salt-stable association with U5 snRNP and observed genetic interactions with spprp1(+), a homolog of human U5-102k factor. These observations together point to an altered recruitment and dependence on SpSlu7, suggesting its role in facilitating transitions that promote catalysis, and highlight the diversity in spliceosome assembly.

Maximum likelihood algorithms for joint estimation of synchronisation impairments and channel in multiple input multiple output-orthogonal frequency division multiplexing system

Maximum likelihood (ML) algorithms, for the joint estimation of synchronisation impairments and channel in multiple input multiple output-orthogonal frequency division multiplexing (MIMO-OFDM) system, are investigated in this work. A system model that takes into account the effects of carrier frequency offset, sampling frequency offset, symbol timing error and channel impulse response is formulated. Cramer-Rao lower bounds for the estimation of continuous parameters are derived, which show the coupling effect among different impairments and the significance of the joint estimation. The authors propose an ML algorithm for the estimation of synchronisation impairments and channel together, using the grid search method. To reduce the complexity of the joint grid search in the ML algorithm, a modified ML (MML) algorithm with multiple one-dimensional searches is also proposed. Further, a stage-wise ML (SML) algorithm using existing algorithms, which estimate less number of parameters, is also proposed. Performance of the estimation algorithms is studied through numerical simulations and it is found that the proposed ML and MML algorithms exhibit better performance than SML algorithm.

Hybrid Energy Harvesting Wireless Systems: Performance Evaluation and Benchmarking

Energy harvesting sensor (EHS) nodes provide an attractive and green solution to the problem of limited lifetime of wireless sensor networks (WSNs). Unlike a conventional node that uses a non-rechargeable battery and dies once it runs out of energy, an EHS node can harvest energy from the environment and replenish its rechargeable battery. We consider hybrid WSNs that comprise of both EHS and conventional nodes; these arise when legacy WSNs are upgraded or due to EHS deployment cost issues. We compare conventional and hybrid WSNs on the basis of a new and insightful performance metric called k-outage duration, which captures the inability of the nodes to transmit data either due to lack of sufficient battery energy or wireless fading. The metric overcomes the problem of defining lifetime in networks with EHS nodes, which never die but are occasionally unable to transmit due to lack of sufficient battery energy. It also accounts for the effect of wireless channel fading on the ability of the WSN to transmit data. We develop two novel, tight, and computationally simple bounds for evaluating the k-outage duration. Our results show that increasing the number of EHS nodes has a markedly different effect on the k-outage duration than increasing the number of conventional nodes.

BER Analysis of Space Shift Keying in Cooperative Multi-hop Multi-branch DF Relaying

Space shift keying (SSK) is an attractive modulation technique for multi-antenna communications. In SSK, only one among the available transmit antennas is activated during one channel use, and the index of the chosen transmit antenna conveys information. In this paper, we analyze the performance of SSK in multi-hop, multi-branch cooperative relaying systems. We consider the decode-and-forward relaying protocol, where a relay forwards the decoded symbol if it decodes the symbol correctly from the received signal. We derive closed-form expressions for the end-to-end bit error rate of SSK in this system. Analytical and simulation results match very well.

Charge and color breaking constraints in MSSM after the Higgs discovery at LHC

We revisit the constraints on the parameter space of the Minimal Supersymmetric Standard Model (MSSM), from charge and color breaking minima in the light of information on the Higgs from the LHC so far. We study the behavior of the scalar potential keeping two light sfermion fields along with the Higgs in the pMSSM framework and analyze the stability of the vacuum. We find that for lightest stops a parts per thousand(2) 1 TeV and small mu a parts per thousand(2) 500 GeV, the absolute stability of the potential can be attained only for . The bounds become stronger for larger values of the mu parameter. Note that this is approximately the value of Xt which maximizes the Higgs mass. Our bounds on the low scale MSSM parameters are more stringent than those reported earlier in literature. We reanalyze the stau sector as well, keeping both staus. We study the connections between the observed Higgs rates and vacuum (meta)stability. We show how a precision study of the ratio of signal strengths, (mu (gamma gamma) /mu (ZZ) ) can shed further light.