arXiv subjects

Xiao Han

Publications and source records attributed to Xiao Han.

At least 181 records · Page 10Linked to original sources

arXiv2020

Twisted Ehresmann Schauenburg bialgebroids

We construct an invertible normalised 2 cocycle on the Ehresmann Schauenburg bialgebroid of a cleft Hopf Galois extension under the condition that the corresponding Hopf algebra is cocommutative and the image of the unital cocycle corresponding to this cleft Hopf Galois extension belongs to the centre of the coinvariant subalgebra. Moreover, we show that any Ehresmann Schauenburg bialgebroid of this kind is isomorphic to a 2-cocycle twist of the Ehresmann Schauenburg bialgebroid corresponding to a Hopf Galois extension without cocycle, where comodule algebra is an ordinary smash product of the coinvariant subalgebra and the Hopf algebra (i.e. $\C(B/#_σH, H)\simeq \C(B\#H, H)^{\tildeσ}$). We also study the theory in the case of a Galois object where the base is trivial but without requiring the Hopf algebra to be cocommutative.

math.QA↗

arXiv2020

IEEE 802.11be-Wi-Fi 7: New Challenges and Opportunities

With the emergence of 4k/8k video, the throughput requirement of video delivery will keep grow to tens of Gbps. Other new high-throughput and low-latency video applications including augmented reality (AR), virtual reality (VR), and online gaming, are also proliferating. Due to the related stringent requirements, supporting these applications over wireless local area network (WLAN) is far beyond the capabilities of the new WLAN standard -- IEEE 802.11ax. To meet these emerging demands, the IEEE 802.11 will release a new amendment standard IEEE 802.11be -- Extremely High Throughput (EHT), also known as Wireless-Fidelity (Wi-Fi) 7. This article provides the comprehensive survey on the key medium access control (MAC) layer techniques and physical layer (PHY) techniques being discussed in the EHT task group, including the channelization and tone plan, multiple resource units (multi-RU) support, 4096 quadrature amplitude modulation (4096-QAM), preamble designs, multiple link operations (e.g., multi-link aggregation and channel access), multiple input multiple output (MIMO) enhancement, multiple access point (multi-AP) coordination (e.g., multi-AP joint transmission), enhanced link adaptation and retransmission protocols (e.g., hybrid automatic repeat request (HARQ)). This survey covers both the critical technologies being discussed in EHT standard and the related latest progresses from worldwide research. Besides, the potential developments beyond EHT are discussed to provide some possible future research directions for WLAN.

eess.SP↗

arXiv2020

Covidex: Neural Ranking Models and Keyword Search Infrastructure for the COVID-19 Open Research Dataset

We present Covidex, a search engine that exploits the latest neural ranking models to provide information access to the COVID-19 Open Research Dataset curated by the Allen Institute for AI. Our system has been online and serving users since late March 2020. The Covidex is the user application component of our three-pronged strategy to develop technologies for helping domain experts tackle the ongoing global pandemic. In addition, we provide robust and easy-to-use keyword search infrastructure that exploits mature fusion-based methods as well as standalone neural ranking models that can be incorporated into other applications. These techniques have been evaluated in the ongoing TREC-COVID challenge: Our infrastructure and baselines have been adopted by many participants, including some of the highest-scoring runs in rounds 1, 2, and 3. In round 3, we report the highest-scoring run that takes advantage of previous training data and the second-highest fully automatic run.

cs.IR↗

arXiv2020

Eigen selection in spectral clustering: a theory guided practice

Based on a Gaussian mixture type model , we derive an eigen selection procedure that improves the usual spectral clustering in high-dimensional settings. Concretely, we derive the asymptotic expansion of the spiked eigenvalues under eigenvalue multiplicity and eigenvalue ratio concentration results, giving rise to the first theory-backed eigen selection procedure in spectral clustering. The resulting eigen-selected spectral clustering (ESSC) algorithm enjoys better stability and compares favorably against canonical alternatives. We demonstrate the advantages of ESSC using extensive simulation and multiple real data studies.

math.ST↗

arXiv2020

SK-Unet: an Improved U-net Model with Selective Kernel for the Segmentation of Multi-sequence Cardiac MR

In the clinical environment, myocardial infarction (MI) as one com-mon cardiovascular disease is mainly evaluated based on the late gadolinium enhancement (LGE) cardiac magnetic resonance images (CMRIs). The auto-matic segmentations of left ventricle (LV), right ventricle (RV), and left ven-tricular myocardium (LVM) in the LGE CMRIs are desired for the aided diag-nosis in clinic. To accomplish this segmentation task, this paper proposes a modified U-net architecture by combining multi-sequence CMRIs, including the cine, LGE, and T2-weighted CMRIs. The cine and T2-weighted CMRIs are used to assist the segmentation in the LGE CMRIs. In this segmentation net-work, the squeeze-and-excitation residual (SE-Res) and selective kernel (SK) modules are inserted in the down-sampling and up-sampling stages, respective-ly. The SK module makes the obtained feature maps more informative in both spatial and channel-wise space, and attains more precise segmentation result. The utilized dataset is from the MICCAI challenge (MS-CMRSeg 2019), which is acquired from 45 patients including three CMR sequences. The cine and T2-weighted CMRIs acquired from 35 patients and the LGE CMRIs acquired from 5 patients are labeled. Our method achieves the mean dice score of 0.922 (LV), 0.827 (LVM), and 0.874 (RV) in the LGE CMRIs.

eess.IV↗

arXiv2019

Semi-Supervised Deep Learning Using Improved Unsupervised Discriminant Projection

Deep learning demands a huge amount of well-labeled data to train the network parameters. How to use the least amount of labeled data to obtain the desired classification accuracy is of great practical significance, because for many real-world applications (such as medical diagnosis), it is difficult to obtain so many labeled samples. In this paper, modify the unsupervised discriminant projection algorithm from dimension reduction and apply it as a regularization term to propose a new semi-supervised deep learning algorithm, which is able to utilize both the local and nonlocal distribution of abundant unlabeled samples to improve classification performance. Experiments show that given dozens of labeled samples, the proposed algorithm can train a deep network to attain satisfactory classification results.

cs.LG↗

arXiv2019

High-Freedom Inverse Design with Deep Neural Network for Metasurface Filter in the Visible

In order to obtain a metasurface structure capable of filtering the light of a specific wavelength in the visible band, traditional method usually traverses the space consisting of possible designs, searching for a potentially satisfying device by performing iterative calculations to solve Maxwell's equations. In this paper, we propose a neural network that can complete an inverse design process to solve the problem. Compared with the traditional method, our method is much faster while competent of generating better devices with the desired spectrum. One of the most significant advantages is that it can handle a real spectrum as well as an artificial one. Besides, our method encompasses a high degree of freedom to generate devices, ensuring their generated spectra resemble desired ones and meeting the accuracy requirements without losing practicability in the manufacturing process.

cs.OH↗

arXiv2019

CreditPrint: Credit Investigation via Geographic Footprints by Deep Learning

Credit investigation is critical for financial services. Whereas, traditional methods are often restricted as the employed data hardly provide sufficient, timely and reliable information. With the prevalence of smart mobile devices, peoples' geographic footprints can be automatically and constantly collected nowadays, which provides an unprecedented opportunity for credit investigations. Inspired by the observation that locations are somehow related to peoples' credit level, this research aims to enhance credit investigation with users' geographic footprints. To this end, a two-stage credit investigation framework is designed, namely CreditPrint. In the first stage, CreditPrint explores regions' credit characteristics and learns a credit-aware embedding for each region by considering both each region's individual characteristics and cross-region relationships with graph convolutional networks. In the second stage, a hierarchical attention-based credit assessment network is proposed to aggregate the credit indications from a user's multiple trajectories covering diverse regions. The results on real-life user mobility datasets show that CreditPrint can increase the credit investigation accuracy by up to 10% compared to baseline methods.

cs.LG↗

arXiv2019

Joint Transmit and Reflective Beamforming Design for IRS-Assisted Multiuser MISO SWIPT Systems

This paper studies an intelligent reflecting surface (IRS)-assisted multiuser multiple-input single-output (MISO) simultaneous wireless information and power transfer (SWIPT) system. In this system, a multi-antenna access point (AP) uses transmit beamforming to send both information and energy signals to a set of receivers each for information decoding (ID) or energy harvesting (EH), and a dedicatedly deployed IRS properly controls its reflecting phase shifts to form passive reflection beams for facilitating both ID and EH at receivers. Under this setup, we jointly optimize the (active) information and energy transmit beamforming at the AP together with the (passive) reflective beamforming at the IRS, to maximize the minimum power received at all EH receivers, subject to individual signal-to-interference-plus-noise ratio (SINR) constraints at ID receivers, and the maximum transmit power constraint at the AP. Although the formulated SINR-constrained min-energy maximization problem is highly non-convex, we present an efficient algorithm to obtain a high-quality solution by using the techniques of alternating optimization and semi-definite relaxation (SDR). Numerical results show that the proposed IRS-assisted SWIPT system with both information and energy signals achieves significant performance gains over benchmark schemes without IRS deployed and/or without dedicated energy signals used.

eess.SP↗

arXiv2018

A volatility-of-volatility expansion of the option prices in the SABR stochastic volatility model

We propose a general, very fast method to quickly approximate the solution of a parabolic Partial Differential Equation (PDEs) with explicit formulas. Our method also provides equaly fast approximations of the derivatives of the solution, which is a challenge for many other methods. Our approach is based on a computable series expansion in terms of a "small" parameter. As an example, we treat in detail the important case of the SABR PDE for $β= 1$, namely $\partial_τu = σ^2 \big [ \frac{1}{2} (\partial^2_xu - \partial_xu) + νρ\partial_x\partial_σu + \frac{1}{2} ν^2 \partial^2_σu \, \big ] + κ(θ- σ) \partial_σ$, by choosing $ν$ as small parameter. This yields $u = u_0 + νu_1 + ν^2 u_2 + \ldots$, with $u_j$ independent of $ν$. The terms $u_j$ are explicitly computable, which is also a challenge for many other, related methods. Truncating this expansion leads to computable approximations of $u$ that are in "closed form," and hence can be evaluated very quickly. Most of the other related methods use the "time" $τ$ as a small parameter. The advantage of our method is that it leads to shorter and hence easier to determine and to generalize formulas. We obtain also an explicit expansion for the implied volatility in the SABR model in terms of $ν$, similar to Hagan's formula, but including also the {\em mean reverting term.} We provide several numerical tests that show the performance of our method. In particular, we compare our formula to the one due to Hagan. Our results also behave well when used for actual market data and show the mean reverting property of the volatility.

q-fin.CP↗

arXiv2018

Principal fibrations over noncommutative spheres

We present examples of noncommutative four-spheres that are base spaces of $SU(2)$-principal bundles with noncommutative seven-spheres as total spaces. The noncommutative coordinate algebras of the four-spheres are generated by the entries of a projection which is invariant under the action of $SU(2)$. We give conditions for the components of the Connes--Chern character of the projection to vanish but the second (the top) one. The latter is then a non zero Hochschild cycle that plays the role of the volume form for the noncommutative four-spheres.

math.QA↗

arXiv2018

IEEE 802.11ay based mmWave WLANs: Design Challenges and Solutions

Millimeter-wave (mmWave) with large spectrum available is considered as the most promising frequency band for future wireless communications. The IEEE 802.11ad and IEEE 802.11ay operating on 60 GHz mmWave are the two most expected wireless local area network (WLAN) technologies for ultra-high-speed communications. For the IEEE 802.11ay standard still under development, there are plenty of proposals from companies and researchers who are involved with the IEEE 802.11ay task group. In this survey, we conduct a comprehensive review on the medium access control layer (MAC) related issues for the IEEE 802.11ay, some cross-layer between physical layer (PHY) and MAC technologies are also included. We start with MAC related technologies in the IEEE 802.11ad and discuss design challenges on mmWave communications, leading to some MAC related technologies for the IEEE 802.11ay. We then elaborate on important design issues for IEEE 802.11ay. Specifically, we review the channel bonding and aggregation for the IEEE 802.11ay, and point out the major differences between the two technologies. Then, we describe channel access and channel allocation in the IEEE 802.11ay, including spatial sharing and interference mitigation technologies. After that, we present an in-depth survey on beamforming training (BFT), beam tracking, single-user multiple-input-multiple-output (SU-MIMO) beamforming and multi-user multiple-input-multiple-output (MU-MIMO) beamforming. Finally, we discuss some open design issues and future research directions for mmWave WLANs. We hope that this paper provides a good introduction to this exciting research area for future wireless systems.

cs.NI↗

arXiv2017

Geographic Differential Privacy for Mobile Crowd Coverage Maximization

For real-world mobile applications such as location-based advertising and spatial crowdsourcing, a key to success is targeting mobile users that can maximally cover certain locations in a future period. To find an optimal group of users, existing methods often require information about users' mobility history, which may cause privacy breaches. In this paper, we propose a method to maximize mobile crowd's future location coverage under a guaranteed location privacy protection scheme. In our approach, users only need to upload one of their frequently visited locations, and more importantly, the uploaded location is obfuscated using a geographic differential privacy policy. We propose both analytic and practical solutions to this problem. Experiments on real user mobility datasets show that our method significantly outperforms the state-of-the-art geographic differential privacy methods by achieving a higher coverage under the same level of privacy protection.

cs.CR↗

arXiv2017

Limiting Laws for Divergent Spiked Eigenvalues and Largest Non-spiked Eigenvalue of Sample Covariance Matrices

We study the asymptotic distributions of the spiked eigenvalues and the largest nonspiked eigenvalue of the sample covariance matrix under a general covariance matrix model with divergent spiked eigenvalues, while the other eigenvalues are bounded but otherwise arbitrary. The limiting normal distribution for the spiked sample eigenvalues is established. It has distinct features that the asymptotic mean relies on not only the population spikes but also the nonspikes and that the asymptotic variance in general depends on the population eigenvectors. In addition, the limiting Tracy-Widom law for the largest nonspiked sample eigenvalue is obtained. Estimation of the number of spikes and the convergence of the leading eigenvectors are also considered. The results hold even when the number of the spikes diverges. As a key technical tool, we develop a Central Limit Theorem for a type of random quadratic forms where the random vectors and random matrices involved are dependent. This result can be of independent interest.

math.ST↗

arXiv2017

Enhanced Random Access and Beam Training for mmWave Wireless Local Networks with High User Density

As low frequency band becomes more and more crowded, millimeter-wave (mmWave) has attracted significant attention recently. IEEE has released the 802.11ad standard to satisfy the demand of ultra-high-speed communication. It adopts beamforming technology that can generate directional beams to compensate for high path loss. In the Association Beamforming Training (A-BFT) phase of beamforming (BF) training, a station (STA) randomly selects an A-BFT slot to contend for training opportunity. Due to the limited number of A-BFT slots, A-BFT phase suffers high probability of collisions in dense user scenarios, resulting in inefficient training performance. Based on the evaluation of the IEEE 802.11ad standard and 802.11ay draft in dense user scenarios of mmWave wireless networks, we propose an enhanced A-BFT beam training and random access mechanism, including the Separated A-BFT (SA-BFT) and Secondary Backoff A-BFT (SBA-BFT). The SA-BFT can provide more A-BFT slots and divide A-BFT slots into two regions by defining a new `E-A-BFT Length' field compared to the legacy 802.11ad A-BFT, thereby maintaining compatibility when 802.11ay devices are mixed with 802.11ad devices. It can also reduce the collision probability in dense user scenarios greatly. The SBA-BFT performs secondary backoff with very small overhead of transmission opportunities within one A-BFT slot, which not only further reduces collision probability, but also improves the A-BFT slots utilization. Furthermore, we propose a three-dimensional Markov model to analyze the performance of the SBA-BFT. The analytical and simulation results show that both the SA-BFT and the SBA-BFT can significantly improve BF training efficiency, which are beneficial to the optimization design of dense user wireless networks based on the IEEE 802.11ay standard and mmWave technology.

cs.NI↗

arXiv2017

How far is Facebook from me? Facebook network infrastructure analysis

Facebook is today the most popular social network with more than one billion subscribers worldwide. To provide good quality of service (e.g., low access delay) to their clients, FB relies on Akamai, which provides a worldwide content distribution network with a large number of edge servers that are much closer to FB subscribers. In this article we aim to depict a global picture of the current FB network infrastructure deployment taking into account both native FB servers and Akamai nodes. Toward this end, we have performed a measurement-based analysis during a period of two weeks using 463 Planet- Lab nodes distributed across 41 countries. Based on the obtained data we compare the average access delay that nodes in different countries experience accessing both native FB servers and Akamai nodes. In addition, we obtain a wide view of the deployment of Akamai nodes serving FB users worldwide. Finally, we analyze the geographical coverage of those nodes, and demonstrate that in most of the cases Akamai nodes located in a particular country service not only local FB subscribers, but also FB users located in nearby countries.

cs.NI↗

arXiv2017

Analysis of publicly disclosed information in Facebook profiles

Facebook, the most popular Online social network is a virtual environment where users share information and are in contact with friends. Apart from many useful aspects, there is a large amount of personal and sensitive information publicly available that is accessible to external entities/users. In this paper we study the public exposure of Facebook profile attributes to understand what type of attributes are considered more sensitive by Facebook users in terms of privacy, and thus are rarely disclosed, and which attributes are available in most Facebook profiles. Furthermore, we also analyze the public exposure of Facebook users by accounting the number of attributes that users make publicly available on average. To complete our analysis we have crawled the profile information of 479K randomly selected Facebook users. Finally, in order to demonstrate the utility of the publicly available information in Facebook profiles we show in this paper three case studies. The first one carries out a gender-based analysis to understand whether men or women share more or less information. The second case study depicts the age distribution of Facebook users. The last case study uses data inferred from Facebook profiles to map the distribution of worldwide population across cities according to its size.

cs.SI↗

arXiv2017

Automatic Liver Lesion Segmentation Using A Deep Convolutional Neural Network Method

Liver lesion segmentation is an important step for liver cancer diagnosis, treatment planning and treatment evaluation. LiTS (Liver Tumor Segmentation Challenge) provides a common testbed for comparing different automatic liver lesion segmentation methods. We participate in this challenge by developing a deep convolutional neural network (DCNN) method. The particular DCNN model works in 2.5D in that it takes a stack of adjacent slices as input and produces the segmentation map corresponding to the center slice. The model has 32 layers in total and makes use of both long range concatenation connections of U-Net [1] and short-range residual connections from ResNet [2]. The model was trained using the 130 LiTS training datasets and achieved an average Dice score of 0.67 when evaluated on the 70 test CT scans, which ranked first for the LiTS challenge at the time of the ISBI 2017 conference.

cs.CV↗