9665993
Closed-loop cross-layer SDMA designs with outdated CSIT
In this paper, we propose a novel closed-loop approach for robust downlink multi-antenna cross-layer design with outdated channel state information at the transmitter (CSIT). Based on the ACK/NAK feedbacks from the mobiles, the proposed cross-layer design does not require the knowledge of CSIT error statistics. We formulate the cross-layer design as a mixed combinatorial search and Markov decision process (MDP). While it is well-known that general solutions for MDP are very complex, one important contribution of this paper is that we obtain simple closed-form power, rate and user allocation policies which are asymptotically optimal for small target frame error rate (FER). Simulation results illustrate that the performance of the proposed closed-loop cross-layer design is very robust with respect to the outdated CSIT, CSIT error model mismatch as well as channel variations due to Doppler.
2730430
Robust Optimal Cross-Layer Designs for TDD-OFDMA Systems with Imperfect CSIT and Unknown Interference: State-Space Approach Based on 1-bit ACK/NAK Feedbacks
Cross-layer designs for OFDMA systems have been shown to offer significant gains of spectral efficiency by exploiting the multiuser diversity over the temporal and frequency domains. In this paper, we shall propose a robust optimal cross-layer design for downlink TDD-OFDMA systems with imperfect channel state information at the base station (CSIT) and unknown interference in slow fading channels. Exploiting the ACK/NAK (1-bit) feedbacks from the mobiles, the proposed cross-layer design does not require knowledge of the CSIT error statistics or interference statistics. To take into account of the potential packet error due to the imperfect CSIT and unknown interference, we define average system goodput (which measures the average b/s/Hz successfully delivered to the mobile) as our optimization objective. We formulate the cross-layer design as a state-space control problem. The optimal power, optimal rate and optimal user allocations are determined as the output equations from the system states based on dynamic programming approach. Simulation results illustrate that the performance of the proposed closed-loop cross-layer design is very robust with respect to imperfect CSIT, unknown interference, model mismatch as well as channel variations due to Doppler.
32959076
Combined Cross Layer Design and HARQ for TDD Multiuser Systems with Outdated CSIT
Cross-layer scheduling and hybrid ARQ (HARQ) are effective means to improve the spectral efficiency of wireless systems and have been widely adopted in next generation wireless systems. However, most of the existing works handle HARQ and cross-layer scheduling in a decoupled manner based on heuristic approach. In this paper, we propose an integrated design framework for cross-layer scheduling and HARQ design in TDD multiuser systems with outdated knowledge of channel state information at the base station (CSIT). We focus on incremental redundancy in HARQ and derive the asymptotically optimal cross-layer policy (power allocation, rate allocation and user selection policies) to optimize the system goodput. In addition, we derive analytically closed-form expressions for the average system goodput where we can obtain useful design insights. For instance, the average system goodput scales in the order of O(In L) where L is the maximum transmission number of a packet, illustrating how the HARQ can enhance the cross-layer system goodput gain.
7822446
Cross Layer Design of Downlink Multi-Antenna OFDMA Systems with Imperfect CSIT for Slow Fading Channels
In most existing works, perfect knowledge of channel state information at the transmitter (CSIT) is assumed to realize the potential benefit of cross-layer scheduling and spatial multiplexing gains of MIMO/OFDMA systems. However, perfect knowledge of CSIT is not easy to achieve in practice due to estimation noise or delay in feedback. In this paper, we shall focus on the cross-layer design of downlink multi-antenna OFDMA systems with imperfect CSIT for slow fading channels. We shall show that our proposed cross-layer scheduler can exploit the multiuser diversity and spatial multiplexing gain even in the presence of moderate CSIT error.
30010609
A Cognitive Study on the Effectiveness of an Augmented Virtuality-Based Collaborative Design Space
This paper presents one empirical study on an Augmented Virtuality (AV)-based virtual environment dedicated for remote collaboration. This AV-based system enables a remote designer to explore a virtual counterpart of a remote built environment that needs to be re-designed. Results of the study demonstrate that the AV system is effective and achieves good overall satisfaction, but involves some issues. Results also reveals that the participants all gain a similar sense in the AV environment as experienced in the real space.
8121247
On the hardness of minimizing space for all-shortest-path interval routing schemes
k-Interval Routing Scheme (k-IRS) is a compact routing method that allows up to k interval labels to be assigned to an arc; and global k-IRS allows not more than a total of k interval labels in the whole network. A fundamental problem is to characterize the networks that admit k-IRS (or global k-IRS). Many of the problems related to single-shortest-path k-IRS have already been shown to be NP-complete. For all-shortest-path k-IRS, the characterization problem remains open for k>=1. In this paper, we study the time complexity of devising minimal-space all-shortest-path k-IRSs and show that it is NP-complete to decide whether a graph admits an all-shortest-path k-IRS, for every integer k>=3, and so is that of deciding whether a graph admits an all-shortest-path k-strict IRS, for every integer k>=4. These are the first NP-completeness results for all-shortest-path k-IRS where k is a constant and the graph is unweighted. The NP-completeness holds also for the linear case. We also prove that it is NP-complete to decide whether an unweighted graph admits an all-shortest-path IRS with global compactness of at most k, which also holds for the linear and strict cases.
8148064
Ontology-based Query Construction for GeoCLEF
This paper describes experiments with geographical information retrieval (GIR). Being different from the traditional information IR, we focus more on the query expansion instead of document ranking. We parse each topic into the event part and the geographic part and use different ontologies to expand both parts respectively. The results show promising results of our strategy for this task.
42332174
Experimental Investigation of Co-Presence Factors in a Mixed Reality-Mediated Collaborative Design System
This paper argues how a Mixed Reality-Mediated collaborative design system should be featured after considering co-presence factors. This paper also presents an experiment to examine some of the co-presence factors, with a focus on the image size and viewing distance. The experimental results show that larger images and appropriate viewing distance could bring better sense of being in the Mixed Reality space and participants feel more involved in the design tasks. Therefore, by considering the co-presence factors, higher level of copresence and better effects in the Mixed Reality-mediated collaborative design system could be achieved.
8091014
Learning your identity and disease from research papers: information leaks in genome wide association study
Genome-wide association studies (GWAS) aim at discovering the association between genetic variations, particularly single-nucleotide polymorphism (SNP), and common diseases, which is well recognized to be one of the most important and active areas in biomedical research. Also renowned is the privacy implication of such studies, which has been brought into the limelight by the recent attack proposed by Homer et al. Homer's attack demonstrates that it is possible to identify a GWAS participant from the allele frequencies of a large number of SNPs. Such a threat, unfortunately, was found in our research to be significantly understated. In this paper, we show that individuals can actually be identified from even a relatively small set of statistics, as those routinely published in GWAS papers. We present two attacks. The first one extends Homer's attack with a much more powerful test statistic, based on the correlations among different SNPs described by coefficient of determination (r2). This attack can determine the presence of an individual from the statistics related to a couple of hundred SNPs. The second attack can lead to complete disclosure of hundreds of participants' SNPs, through analyzing the information derived from published statistics. We also found that those attacks can succeed even when the precisions of the statistics are low and part of data is missing. We evaluated our attacks on the real human genomes and concluded that such threats are completely realistic.