Searcharxiv⌕ Search

arXiv subjects

Shanshan Wang

Publications and source records attributed to Shanshan Wang.

209 records · Page 12Linked to original sources

On Spectrum and Infrastructure Sharing in Multi-Operator Cellular Networks

In this paper, we introduce a mathematical framework for analyzing and optimizing multi-operator cellular networks that are allowed to share spectrum licenses and infrastructure elements. The proposed approach exploits stochastic geometry for modeling the locations of cellular base stations and for computing the aggregate average rate. The trade-offs that emerge from sharing spectrum frequencies and cellular base stations are quantified and discussed.

cs.IT↗

Cross Domain Adaptation by Learning Partially Shared Classifiers and Weighting Source Data Points in the Shared Subspaces

Transfer learning is a problem defined over two domains. These two domains share the same feature space and class label space, but have significantly different distributions. One domain has sufficient labels, named as source domain, and the other domain has few labels, named as target do- main. The problem is to learn a effective classifier for the target domain. In this paper, we propose a novel transfer learning method for this problem by learning a partially shared classifier for the target domain, and weighting the source domain data points. We learn some shared subspaces for both the data points of the two domains, and a shared classifier in the shared subspaces. We hope that in the shared subspaces, the distributions of two domain can match each other well, and to match the distributions, we weight the source domain data points with different weighting factors. Moreover, we adapt the shared classifier to each domain by learning different adaptation functions. To learn the subspace transformation matrices, the classifier parameters, and the adaptation parameters, we build a objective function with weighted clas- sification errors, parameter regularization, local reconstruction regularization, and distribution matching. This objective function is minimized by an itera- tive algorithm. Experiments show its effectiveness over benchmark data sets, including travel destination review data set, face expression data set, spam email data set, etc.

cs.LG↗

Cross-response in correlated financial markets: individual stocks

Previous studies of the stock price response to trades focused on the dynamics of single stocks, i.e. they addressed the self-response. We empirically investigate the price response of one stock to the trades of other stocks in a correlated market, i.e. the cross-responses. How large is the impact of one stock on others and vice versa? -- This impact of trades on the price change across stocks appears to be transient instead of permanent as we discuss from the viewpoint of market efficiency. Furthermore, we compare the self-responses on different scales and the self- and cross-responses on the same scale. We also find that the cross-correlation of the trade signs turns out to be a short-memory process.

q-fin.ST↗

Price response in correlated financial markets: empirical results

Previous studies of the stock price response to individual trades focused on single stocks. We empirically investigate the price response of one stock to the trades of other stocks. How large is the impact of one stock on others and vice versa? -- This impact of trades on the price change across stocks appears to be transient instead of permanent. Performing different averages, we distinguish active and passive responses. The two average responses show different characteristic dependences on the time lag. The passive response exhibits a shorter response period with sizeable volatilities, and the active response a longer period. We also study the response for a given stock with respect to different sectors and to the whole market. Furthermore, we compare the self-response with the various cross-responses. The correlation of the trade signs is a short-memory process for a pair of stocks, but it turns into a long-memory process when averaged over different pairs of stocks.

q-fin.ST↗

Distributed Power Allocation and Channel Access Probability Assignment for Cognitive Radio

In this paper, we present a framework for distributively optimizing the transmission strategies of secondary users in an ad hoc cognitive radio network. In particular, the proposed approach allows secondary users to set their transmit powers and channel access probabilities such that, on average, the quality of service of both the primary and secondary networks are satisfied. The system under consideration assumes several primary and secondary transceiver pairs and assumes no cooperation or information exchange between neither primary and secondary users nor among secondary users. The outage probability, and consequently the connection probability, is derived for the system and is used in defining a new performance metric in the optimization problem using tools from stochastic geometry. We refer to this metric as the spatial density of successful transmission. We corroborate our derivations through numerical evaluations. We further demonstrate that even in the absence of any form of cooperation, an acceptable quality of service can be attained in the cognitive radio environment.

cs.NI↗

Directional antennas improve the link-connectivity of interference limited ad hoc networks

We study wireless ad hoc networks in the absence of any channel contention or transmit power control and ask how antenna directivity affects network connectivity in the interference limited regime. We answer this question by deriving closed-form expressions for the outage probability, capacity and mean node degree of the network using tools from stochastic geometry. These novel results provide valuable insights for the design of future ad hoc networks. Significantly, our results suggest that the more directional the interfering transmitters are, the less detrimental are the effects of interference to individual links. We validate our analytical results through computer simulations.

cs.NI↗

Location, location, location: Border effects in interference limited ad hoc networks

Wireless networks are fundamentally limited by the intensity of the received signals and by their inherent interference. It is shown here that in finite ad hoc networks where node placement is modelled according to a Poisson point process and no carrier sensing is employed for medium access, the SINR received by nodes located at the border of the network deployment/operation region is on average greater than the rest. This is primarily due to the uneven interference landscape of such networks which is particularly kind to border nodes giving rise to all sorts of performance inhomogeneities and access unfairness. Using tools from stochastic geometry we quantify these spatial variations and provide closed form communication-theoretic results showing why the receiver's location is so important.

cs.NI↗

Er3+-doped Na0.5Bi0.5TiO3 Ferroelectric Thin Films with Enhanced Electrical Properties and Strong Green Up-conversion Luminescence

Ferroelectric materials with up-conversion luminescence (UCL) properties have potential opto-electric applications for display and sensing etc. Here, we demonstrate strong green UCL and enhanced electrical properties in Er3+-doped Na0.5Bi0.5TiO3 thin films. The thin films are prepared via using a modified chemical solution deposition method. These thin films are phase-pure and crystallized in perovskite structure. The largest remnant polarization (Pr) and highest dielectric constant are obtained from Na0.5Bi0.49Er0.01TiO3 thin films, and their values are 0.22 C/m2 and 1166, respectively. Meanwhile, strong green UCL at 525 nm and 548 nm are observed in Er3+-doped thin films. They are attributed to 2H11/2 to 4I15/2 and 4S3/2 to 4I15/2 transitions of Er3+ ions. These thin films have potentials in optoelectrical device applications.

cond-mat.mtrl-sci↗

Partial Penalized Likelihood Ratio Test under Sparse Case

This work is concern with testing the low-dimensional parameters of interest with divergent dimensional data and variable selection for the rest under the sparse case. A consistent test via the partial penalized likelihood approach, called the partial penalized likelihood ratio test statistic is derived, and its asymptotic distributions under the null hypothesis and the local alternatives of order $n^{-1/2}$ are obtained under some regularity conditions. Meanwhile, the oracle property of the partial penalized likelihood estimator also holds. The proposed partial penalized likelihood ratio test statistic outperforms the full penalized likelihood ratio test statistic in term of size and power, and performs as well as the classical likelihood ratio test statistic. Moreover, the proposed method obtains the variable selection results as well as the p-values of testing. Numerical simulations and an analysis of Prostate Cancer data confirm our theoretical findings and demonstrate the promising performance of the proposed partial penalized likelihood in hypothesis testing and variable selection.

stat.ME↗

Exploiting Channel Correlation and PU Traffic Memory for Opportunistic Spectrum Scheduling

We consider a cognitive radio network with multiple primary users (PUs) and one secondary user (SU), where a spectrum server is utilized for spectrum sensing and scheduling the SU to transmit over one of the PU channels opportunistically. One practical yet challenging scenario is when \textit{both} the PU occupancy and the channel fading vary over time and exhibit temporal correlations. Little work has been done for exploiting such temporal memory in the channel fading and the PU occupancy simultaneously for opportunistic spectrum scheduling. A main goal of this work is to understand the intricate tradeoffs resulting from the interactions of the two sets of system states - the channel fading and the PU occupancy, by casting the problem as a partially observable Markov decision process. We first show that a simple greedy policy is optimal in some special cases. To build a clear understanding of the tradeoffs, we then introduce a full-observation genie-aided system, where the spectrum server collects channel fading states from all PU channels. The genie-aided system is used to decompose the tradeoffs in the original system into multiple tiers, which are examined progressively. Numerical examples indicate that the optimal scheduler in the original system, with observation on the scheduled channel only, achieves a performance very close to the genie-aided system. Further, as expected, the optimal policy in the original system significantly outperforms randomized scheduling, pointing to the merit of exploiting the temporal correlation structure in both channel fading and PU occupancy.

cs.IT↗

Spectrum Shaping via Network Coding in Cognitive Radio Networks

We consider a cognitive radio network where primary users (PUs) employ network coding for data transmissions. We view network coding as a spectrum shaper, in the sense that it increases spectrum availability to secondary users (SUs) and offers more structure of spectrum holes that improves the predictability of the primary spectrum. With this spectrum shaping effect of network coding, each SU can carry out adaptive channel sensing by dynamically updating the list of the PU channels predicted to be idle while giving priority to these channels when sensing. This dynamic spectrum access approach with network coding improves how SUs detect and utilize temporal spectrum holes over PU channels. Our results show that compared to the existing approaches based on retransmission, both PUs and SUs can achieve higher stable throughput, thanks to the spectrum shaping effect of network coding.

cs.NI↗