arXiv subjects

Xin Jin

Publications and source records attributed to Xin Jin.

417 records · Page 24Linked to original sources

arXiv2012

Precoder Design for Orthogonal Space-Time Block Coding based Cognitive Radio with Polarized Antennas

The spectrum sharing has recently passed into a mainstream Cognitive Radio (CR) strategy. We investigate the core issue in this strategy: interference mitigation at Primary Receiver (PR).We propose a linear precoder design which aims at alleviating the interference caused by Secondary User (SU) from the source for Orthogonal Space-Time Block Coding (OSTBC) based CR. We resort to Minimum Variance (MV) approach to contrive the precoding matrix at Secondary Transmitter (ST) in order to maximize the Signal to Noise Ratio (SNR) at Secondary Receiver (SR) on the premise that the orthogonality of OSTBC is kept, the interference introduced to Primary Link (PL) by Secondary Link (SL) is maintained under a tolerable level and the total transmitted power constraint at ST is satisfied. Moreover, the selection of polarization mode for SL is incorporated in the precoder design. In order to provide an analytic solution with low computational cost, we put forward an original precoder design algorithm which exploits an auxiliary variable to treat the optimization problem with a mixture of linear and quadratic constraints. Numerical results demonstrate that our proposed precoder design enable SR to have an agreeable SNR on the prerequisite that the interference at PR is maintained below the threshold.

cs.NI↗

arXiv2012

Optimal Algorithms for Crawling a Hidden Database in the Web

A hidden database refers to a dataset that an organization makes accessible on the web by allowing users to issue queries through a search interface. In other words, data acquisition from such a source is not by following static hyper-links. Instead, data are obtained by querying the interface, and reading the result page dynamically generated. This, with other facts such as the interface may answer a query only partially, has prevented hidden databases from being crawled effectively by existing search engines. This paper remedies the problem by giving algorithms to extract all the tuples from a hidden database. Our algorithms are provably efficient, namely, they accomplish the task by performing only a small number of queries, even in the worst case. We also establish theoretical results indicating that these algorithms are asymptotically optimal -- i.e., it is impossible to improve their efficiency by more than a constant factor. The derivation of our upper and lower bound results reveals significant insight into the characteristics of the underlying problem. Extensive experiments confirm the proposed techniques work very well on all the real datasets examined.

cs.DB↗

arXiv2011

Trivariate monomial complete intersections and plane partitions

We consider the homogeneous components U_r of the map on R = k[x,y,z]/(x^A, y^B, z^C) that multiplies by x + y + z. We prove a relationship between the Smith normal forms of submatrices of an arbitrary Toeplitz matrix using Schur polynomials, and use this to give a relationship between Smith normal form entries of U_r. We also give a bijective proof of an identity proven by J. Li and F. Zanello equating the determinant of the middle homogeneous component U_r when (A, B, C) = (a + b, a + c, b + c) to the number of plane partitions in an a by b by c box. Finally, we prove that, for certain vector subspaces of R, similar identities hold relating determinants to symmetry classes of plane partitions, in particular classes 3, 6, and 8.

math.CO↗