On optimal timer-based distributed selection for rate-adaptive multi-user diversity systems

We develop an optimal, distributed, and low feedback timer-based selection scheme to enable next generation rate-adaptive wireless systems to exploit multi-user diversity. In our scheme, each user sets a timer depending on its signal to noise ratio (SNR) and transmits a small packet to identify itself when its timer expires. When the SNR-to-timer mapping is monotone non-decreasing, timers of users with better SNRs expire earlier. Thus, the base station (BS) simply selects the first user whose timer expiry it can detect, and transmits data to it at as high a rate as reliably possible. However, timers that expire too close to one another cannot be detected by the BS due to collisions. We characterize in detail the structure of the SNR-to-timer mapping that optimally handles these collisions to maximize the average data rate. We prove that the optimal timer values take only a discrete set of values, and that the rate adaptation policy strongly influences the optimal scheme's structure. The optimal average rate is very close to that of ideal selection in which the BS always selects highest rate user, and is much higher than that of the popular, but ad hoc, timer schemes considered in the literature.

DMT of multi-hop cooperative networks

Some basic results that help in determining the Diversity-Multiplexing Tradeoff (DMT) of cooperative multihop networks are first identified. As examples, the maximum achievable diversity gain is shown to equal the min-cut between source and sink, whereas the maximal multiplexing gain is shown to equal the minimum rank of the matrix characterizing the MIMO channel appearing across a cut in the network. Two multi-hop generalizations of the two-hop network are then considered, namely layered networks as well as a class of networks introduced here and termed as K-parallel-path (KPP) networks. The DMT of KPP networks is characterized for K > 3. It is shown that a linear DMT between the maximum diversity dmax and the maximum multiplexing gain of 1 is achievable for fully-connected, layered networks. Explicit coding schemes achieving the DMT that make use of cyclic-division-algebra-based distributed space-time codes underlie the above results. Two key implications of the results in the paper are that the half-duplex constraint does not entail any rate loss for a large class of cooperative networks and that simple, amplify-and-forward protocols are often sufficient to attain the optimal DMT.

Diperoxovanadate can substitute for H(2)O(2) at much lower concentration in inducing features of premature cellular senescence in mouse fibroblasts (NIH3T3)

Stress induced premature senescence (SIPS) in mammalian cells is an accelerated ageing response and experimentally obtained on treatment of cells with high concentrations of H(2)O(2), albeit at sub-lethal doses, because H(2)O(2) gets depleted by abundant cellular catalase. In the present study diperoxovanadate (DPV) was used as it is known to be stable at physiological pH, to be catalase-resistant and to substitute for H(2)O(2) in its activities at concentrations order of magnitudes lower. On treating NIH3T3 cells with DPV, SIPS-like morphology was observed along with an immediate response of rounding of the cells by disruption of actin cytoskeleton and transient G2/M arrest. DPV could bring about growth arrest and senescence associated features at 25 mu M dose, which were not seen with similar doses of either H(2)O(2) or vanadate. A minimal dose of 150 mu M of H(2)O(2) was required to induce similar affects as 25 mu M DPV. Increase in senescent associated markers such as p21, HMGA2 and PAI-1 was more prominent in DPV treated cells compared to similar dose of H(2)O(2). DPV-treated cells showed marked relocalization of Cyclin D1 from nucleus to cytoplasm. These results indicate that DPV, stable inorganic peroxide, is more efficient in inducing SIPS at lower concentrations compared to H(2)O(2). (C) 2011 Elsevier Ireland Ltd. All rights reserved.

Transformation in heterokaryons of Neurospora crassa is nuclear rather than cellular phenomenon

In Neurospora crassa, multinucleate macroconidia are used for genetic transformation. The barrier for such a transformation can be either at the cell membrane level or at the nuclear membrane level. For assessment of these possibilities, a forced heterokaryon (containing two genetically marked nuclei and auxotrophic for histidine) of Neurospora crassa was transformed with a plasmid containing his-3(+) gene. The transformants, which could grow without histidine supplementation, were then resolved into component homokaryons to determine into which nucleus or nuclei the plasmid had entered. Our results suggest that the barrier for transformation in Neurospora crassa is at the nuclear level, not at the cell membrane level. In a heterokaryon containing two genetically distinct nuclei, plasmid DNA integrated into only one of the nuclear types at any instance, but never into both nuclear types. Thus, in Neurospora crassa, the competent nucleus is essential for the transformation event to take place, and at a given time only one type of nucleus is competent to take up the exogenous DNA. Genomic Southern analysis showed that the transformants harbor both ectopic and homologous integrations of the plasmid DNA. The type and number of integrations were reflected at the post-translational level, since the specific activity of histidinol dehydrogenase (the translation product of his-3+ gene) was variable among several transformants and always less than the level of the wild type.

Twisted aromatics, 9-anthryl and 1-pyrenyl terpyridines organize into novel multi-directional 'ladder-like' motifs in the solid state

9-Anthryl and 1-pyrenyl terpyridines (1 and 2, respectively), key precursors for the design of novel fluorescent sensors have been synthesized and characterized by H-1 NMR, mass spectroscopy and X-ray crystallography. Twisted molecular conformations for each 1 and 2 were observed in their single crystal structures. Energy minimization calculations for the 1 and 2 using the semi-empirical AM1 method show that the 'twisted' conformation is intrinsic to these systems. We observe interconnected networks of edge-to-face CH...pi interactions, which appear to be cooperative in nature, in each of the crystal structures. The two twisted molecules, although having differently shaped polyaromatic hydrocarbon substituents, show similar patterns of edge-to-face CH...pi interactions.The presently described systems comprise of two aromatic surfaces that are almost orthogonal to each other. This twisted or orthogonal nature of the molecules leads to the formation of interesting multi-directional ladder like supramolecular organizations. A combination of edge-to-face and face-to-face packing modes helps to stabilize these motifs. The ladder like architecture in 1 is helical in nature. (C) 2002 Published by Elsevier Science B.V.

Multi-Armed Bandit Mechanisms for Multi-Slot Sponsored Searth Auctions

In pay-per click sponsored search auctions which are currently extensively used by search engines, the auction for a keyword involves a certain number of advertisers (say k) competing for available slots (say m) to display their ads. This auction is typically conducted for a number of rounds (say T). There are click probabilities mu_ij associated with agent-slot pairs. The search engine's goal is to maximize social welfare, for example, the sum of values of the advertisers. The search engine does not know the true value of an advertiser for a click to her ad and also does not know the click probabilities mu_ij s. A key problem for the search engine therefore is to learn these during the T rounds of the auction and also to ensure that the auction mechanism is truthful. Mechanisms for addressing such learning and incentives issues have recently been introduced and would be referred to as multi-armed-bandit (MAB) mechanisms. When m = 1,characterizations for truthful MAB mechanisms are available in the literature and it has been shown that the regret for such mechanisms will be O(T^{2/3}). In this paper, we seek to derive a characterization in the realistic but nontrivial general case when m > 1 and obtain several interesting results.

Strategies for Rescheduling Tightly-Coupled Parallel Applications in Multi-Cluster Grids

As computational Grids are increasingly used for executing long running multi-phase parallel applications, it is important to develop efficient rescheduling frameworks that adapt application execution in response to resource and application dynamics. In this paper, three strategies or algorithms have been developed for deciding when and where to reschedule parallel applications that execute on multi-cluster Grids. The algorithms derive rescheduling plans that consist of potential points in application execution for rescheduling and schedules of resources for application execution between two consecutive rescheduling points. Using large number of simulations, it is shown that the rescheduling plans developed by the algorithms can lead to large decrease in application execution times when compared to executions without rescheduling on dynamic Grid resources. The rescheduling plans generated by the algorithms are also shown to be competitive when compared to the near-optimal plans generated by brute-force methods. Of the algorithms, genetic algorithm yielded the most efficient rescheduling plans with 9-12% smaller average execution times than the other algorithms.