3,018 research outputs found

    How Much Multiuser Diversity is Required for Energy Limited Multiuser Systems?

    Full text link
    Multiuser diversity (MUDiv) is one of the central concepts in multiuser (MU) systems. In particular, MUDiv allows for scheduling among users in order to eliminate the negative effects of unfavorable channel fading conditions of some users on the system performance. Scheduling, however, consumes energy (e.g., for making users' channel state information available to the scheduler). This extra usage of energy, which could potentially be used for data transmission, can be very wasteful, especially if the number of users is large. In this paper, we answer the question of how much MUDiv is required for energy limited MU systems. Focusing on uplink MU wireless systems, we develop MU scheduling algorithms which aim at maximizing the MUDiv gain. Toward this end, we introduce a new realistic energy model which accounts for scheduling energy and describes the distribution of the total energy between scheduling and data transmission stages. Using the fact that such energy distribution can be controlled by varying the number of active users, we optimize this number by either (i) minimizing the overall system bit error rate (BER) for a fixed total energy of all users in the system or (ii) minimizing the total energy of all users for fixed BER requirements. We find that for a fixed number of available users, the achievable MUDiv gain can be improved by activating only a subset of users. Using asymptotic analysis and numerical simulations, we show that our approach benefits from MUDiv gains higher than that achievable by generic greedy access algorithm, which is the optimal scheduling method for energy unlimited systems.Comment: 28 pages, 9 figures, submitted to IEEE Trans. Signal Processing in Oct. 200

    Authentication of newly established human esophageal squamous cell carcinoma cell line (YM-1) using short tandem repeat (STR) profiling method

    Get PDF
    Cross-contamination during or early after establishment of a new cell line could result in the worldwide spread of a misidentified cell line. Therefore, newly established cell lines need to be authenticated by a reference standard method. This study was conducted to investigate the authenticity of a newly established epithelial cell line of human esophageal squamous cell carcinoma (ESCC) called YM-1 using short tandem repeat (STR) DNA profiling method. Primary human ESCC epithelial cells were cultured from the fresh tumor tissue of an adult female patient. Growth characteristics and epithelial originality of YM-1 cells were studied. Genomic DNA was isolated from YM-1 cells harvested at passage 22 and ESCC donor tumor sample on two different days to prevent probable DNA contamination. STR profiling was performed using AmpFℓSTR® Identifiler® Plus PCR Amplification Kit. To address whether YM-1 cells undergo genetic alteration as the passage number increases, STR profiling was performed again on harvested cells at passage 51. YM-1 cells grew as a monolayer with a population doubling time of 40.66Â h. Epithelial originality of YM-1 cells was confirmed using ICC/IF staining of cytokeratins AE1/AE3. The STR profile of the ESCC donor tumor sample was the same with YM-1 cells at passage 22. However, STR profile of the donor tumor sample showed an off-ladder (OL) allele in their D7S820 locus. Also, re-profiling of YM-1 cells at passage 51 showed a loss of heterozygosity (LOH) at D18S51 locus. This suggests that long-term culture of cell lines may alter their DNA profile. Comparison of the DNA fingerprinting results in DSMZ, and ATCC STR profiling databases confirmed unique identity of YM-1 cell line. This study provides an easy, fast, and reliable procedure for authentication of newly established cell lines, which helps in preventing the spread of misidentified cells and improving the reproducibility and validity of experiments, consequently. © 2015, International Society of Oncology and BioMarkers (ISOBM)

    Throughput Scaling Laws for Wireless Networks with Fading Channels

    Full text link
    A network of n communication links, operating over a shared wireless channel, is considered. Fading is assumed to be the dominant factor affecting the strength of the channels between transmitter and receiver terminals. It is assumed that each link can be active and transmit with a constant power P or remain silent. The objective is to maximize the throughput over the selection of active links. By deriving an upper bound and a lower bound, it is shown that in the case of Rayleigh fading (i) the maximum throughput scales like logn\log n (ii) the maximum throughput is achievable in a distributed fashion. The upper bound is obtained using probabilistic methods, where the key point is to upper bound the throughput of any random set of active links by a chi-squared random variable. To obtain the lower bound, a decentralized link activation strategy is proposed and analyzed.Comment: Submitted to IEEE Transactions on Information Theory (Revised
    corecore