arXiv subjects

Rui Zhang

Publications and source records attributed to Rui Zhang.

At least 937 records · Page 52Linked to original sources

arXiv2021

ProMIPS: Efficient High-Dimensional c-Approximate Maximum Inner Product Search with a Lightweight Index

Due to the wide applications in recommendation systems, multi-class label prediction and deep learning, the Maximum Inner Product (MIP) search problem has received extensive attention in recent years. Faced with large-scale datasets containing high-dimensional feature vectors, the state-of-the-art LSH-based methods usually require a large number of hash tables or long hash codes to ensure the searching quality, which takes up lots of index space and causes excessive disk page accesses. In this paper, we relax the guarantee of accuracy for efficiency and propose an efficient method for c-Approximate Maximum Inner Product (c-AMIP) search with a lightweight iDistance index. We project high-dimensional points to low-dimensional ones via 2-stable random projections and derive probability-guaranteed searching conditions, by which the c-AMIP results can be guaranteed in accuracy with arbitrary probabilities. To further improve the efficiency, we propose Quick-Probe for quickly determining the searching bound satisfying the derived condition in advance, avoiding the inefficient incremental searching process. Extensive experimental evaluations on four real datasets demonstrate that our method requires less pre-processing cost including index size and pre-processing time. In addition, compared to the state-of-the-art benchmark methods, it provides superior results on searching quality in terms of overall ratio and recall, and efficiency in terms of page access and running time.

cs.DB↗

arXiv2021

The scattering of fractional Schrödinger operators with short range potentials

For any positive real number $s$, we study the scattering theory in a unified way for the fractional Schrödinger operator $H=H_0+V$, where $H_0=(-Δ)^\frac s2$ and the real-valued potential $V$ satisfies short range condition. We prove the existence and asymptotic completeness of the wave operators $W_\pm=\mathrm{s-}\lim_{t\rightarrow\pm\infty}e^{itH}e^{-itH_0}$, the discreteness and finite multiplicity of the non-zero pure point spectrum $σ_\mathrm{pp}\setminus\{0\}$ of $H$, and the finite decay property of eigenfunctions. The short range condition is sharp with respect to the allowed decay rate of $V$, and the decay threshold for the existence and non-existence of the wave operators is faster than $|x|^{-1}$ at the infinity in some sense. Our approach is inspired by the theory of limiting absorption principle for simply characteristic operators established by S. Agmon and L. Hörmander in the 1970s.

math-ph↗

arXiv2021

Energy-Efficient UAV Multicasting with Simultaneous FSO Backhaul and Power Transfer

This letter studies an unmanned aerial vehicle (UAV) aided multicasting (MC) system, which is enabled by simultaneous free space optics (FSO) backhaul and power transfer. The UAV applies the power-splitting technique to harvest wireless power and decode backhaul information simultaneously over the FSO link, while at the same time using the harvested power to multicast the backhauled information over the radio frequency (RF) links to multiple ground users (GUs). We derive the UAV's achievable MC rate under the Poisson point process (PPP) based GU distribution. By jointly designing the FSO and RF links and the UAV altitude, we maximize the system-level energy efficiency (EE), which can be equivalently expressed as the ratio of the UAV's MC rate over the optics base station (OBS) transmit power, subject to the UAV's sustainable operation and reliable backhauling constraints. Due to the non-convexity of this problem, we propose suboptimal solutions with low complexity. Numerical results show the close-to-optimal EE performance by properly balancing the power-rate tradeoff between the FSO power and the MC data transmissions.

cs.IT↗

arXiv2021

When Text Simplification Is Not Enough: Could a Graph-Based Visualization Facilitate Consumers' Comprehension of Dietary Supplement Information?

Dietary supplements are widely used but not always safe. With the rapid development of the Internet, consumers usually seek health information including dietary supplement information online. To help consumers access quality online dietary supplement information, we have identified trustworthy dietary supplement information sources and built an evidence-based knowledge base of dietary supplement information-the integrated DIetary Supplement Knowledge base (iDISK) that integrates and standardizes dietary supplement related information across these different sources. However, as information in iDISK was collected from scientific sources, the complex medical jargon is a barrier for consumers' comprehension. To assess how different approaches to simplify and represent dietary supplement information from iDISK will affect lay consumers' comprehension, using a crowdsourcing platform, we recruited participants to read dietary supplement information in four different representations from iDISK: original text, syntactic and lexical text simplification, manual text simplification, and a graph-based visualization. We then assessed how the different simplification and representation strategies affected consumers' comprehension of dietary supplement information in terms of accuracy and response time to a set of comprehension questions. With responses from 690 qualified participants, our experiments confirmed that the manual approach had the best performance for both accuracy and response time to the comprehension questions, while the graph-based approach ranked the second outperforming other representations. In some cases, the graph-based representation outperformed the manual approach in terms of response time. A hybrid approach that combines text and graph-based representations might be needed to accommodate consumers' different information needs and information seeking behavior.

cs.CY↗

arXiv2021

CSTNet: A Dual-Branch Convolutional Network for Imaging of Reactive Flows using Chemical Species Tomography

Chemical Species Tomography (CST) has been widely used for in situ imaging of critical parameters, e.g. species concentration and temperature, in reactive flows. However, even with state-of-the-art computational algorithms the method is limited due to the inherently ill-posed and rank-deficient tomographic data inversion, and by high computational cost. These issues hinder its application for real-time flow diagnosis. To address them, we present here a novel CST-based convolutional neural Network (CSTNet) for high-fidelity, rapid, and simultaneous imaging of species concentration and temperature. CSTNet introduces a shared feature extractor that incorporates the CST measurement and sensor layout into the learning network. In addition, a dual-branch architecture is proposed for image reconstruction with crosstalk decoders that automatically learn the naturally correlated distributions of species concentration and temperature. The proposed CSTNet is validated both with simulated datasets, and with measured data from real flames in experiments using an industry-oriented sensor. Superior performance is found relative to previous approaches, in terms of robustness to measurement noise and millisecond-level computing time. This is the first time, to the best of our knowledge, that a deep learning-based algorithm for CST has been experimentally validated for simultaneous imaging of multiple critical parameters in reactive flows using a low-complexity optical sensor with severely limited number of laser beams.

eess.IV↗

arXiv2021

FeTaQA: Free-form Table Question Answering

Existing table question answering datasets contain abundant factual questions that primarily evaluate the query and schema comprehension capability of a system, but they fail to include questions that require complex reasoning and integration of information due to the constraint of the associated short-form answers. To address these issues and to demonstrate the full challenge of table question answering, we introduce FeTaQA, a new dataset with 10K Wikipedia-based {table, question, free-form answer, supporting table cells} pairs. FeTaQA yields a more challenging table question answering setting because it requires generating free-form text answers after retrieval, inference, and integration of multiple discontinuous facts from a structured knowledge source. Unlike datasets of generative QA over text in which answers are prevalent with copies of short text spans from the source, answers in our dataset are human-generated explanations involving entities and their high-level relations. We provide two benchmark methods for the proposed task: a pipeline method based on semantic-parsing-based QA systems and an end-to-end method based on large pretrained text generation models, and show that FeTaQA poses a challenge for both methods.

cs.CL↗

arXiv2021

Layer-dependent mechanical properties and enhanced plasticity in the van der Waals chromium trihalide magnets

The mechanical properties of magnetic materials are instrumental for the development of the magnetoelastic theory and the optimization of strain-modulated magnetic devices. In particular, two-dimensional (2D) magnets hold promise to enlarge these concepts into the realm of low-dimensional physics and ultrathin devices. However, no experimental study on the intrinsic mechanical properties of the archetypal 2D magnet family of the chromium trihalides has thus far been performed. Here, we report the room temperature layer-dependent mechanical properties of atomically thin CrI3 and CrCl3, finding that bilayers of CrI3 and CrCl3 have Young's moduli of 62.1 GPa and 43.4 GPa, with the highest sustained strain of 6.09% and 6.49% and breaking strengths of 3.6 GPa and 2.2 GPa, respectively. Both the elasticity and strength of the two materials decrease with increased thickness, which is attributed to a weak interlayer interaction that enables interlayer sliding under low levels of applied load. The mechanical properties observed in the few-layer chromium trihalide crystals provide evidence of outstanding plasticity in these materials, which is qualitatively demonstrated in their bulk counterparts. This study will contribute to various applications of the van der Waals magnetic materials, especially for their use in magnetostrictive and flexible devices.

cond-mat.mtrl-sci↗

arXiv2021

Two-timescale Beamforming Optimization for Intelligent Reflecting Surface Aided Multiuser Communication with QoS Constraints

Intelligent reflecting surface (IRS) is an emerging technology that is able to reconfigure the wireless channel via tunable passive signal reflection and thereby enhance the spectral and energy efficiency of wireless networks cost-effectively. In this paper, we study an IRS-aided multiuser multiple-input single-output (MISO) wireless system and adopt the two-timescale (TTS) transmission to reduce the signal processing complexity and channel training overhead as compared to the existing schemes based on the instantaneous channel state information (I-CSI), and at the same time, exploit the multiuser channel diversity in transmission scheduling. Specifically, the long-term passive beamforming is designed based on the statistical CSI (S-CSI) of all links, while the short-term active beamforming is designed to cater to the I-CSI of all users' reconfigured channels with optimized IRS phase shifts. We aim to minimize the average transmit power at the access point (AP), subject to the users' individual quality of service (QoS) constraints. The formulated stochastic optimization problem is non-convex and difficult to solve since the long-term and short-term design variables are complicatedly coupled in the QoS constraints. To tackle this problem, we propose an efficient algorithm, called the primal-dual decomposition based TTS joint active and passive beamforming (PDD-TJAPB), where the original problem is decomposed into a long-term problem and a family of short-term problems, and the deep unfolding technique is employed to extract gradient information from the short-term problems to construct a convex surrogate problem for the long-term problem. The proposed algorithm is proved to converge to a stationary solution of the original problem almost surely. Simulation results are presented which demonstrate the advantages and effectiveness of the proposed algorithm as compared to benchmark schemes.

cs.IT↗

arXiv2021

Enabling Smart Reflection in Integrated Air-Ground Wireless Network: IRS Meets UAV

Intelligent reflecting surface (IRS) and unmanned aerial vehicle (UAV) have emerged as two promising technologies to boost the performance of wireless communication networks, by proactively altering the wireless communication channels via smart signal reflection and maneuver control, respectively. However, they face different limitations in practice, which restrain their future applications. In this article, we propose new methods to jointly apply IRS and UAV in integrated air-ground wireless networks by exploiting their complementary advantages. Specifically, terrestrial IRS is used to enhance the UAV-ground communication performance, while UAV-mounted IRS is employed to assist in the terrestrial communication. We present their promising application scenarios, new communication design issues as well as potential solutions. In particular, we show that it is practically beneficial to deploy both the terrestrial and aerial IRSs in future wireless networks to reap the benefits of smart reflections in three-dimensional (3D) space.

cs.IT↗

arXiv2021

Unsupervised Graph Embedding via Adaptive Graph Learning

Graph autoencoders (GAEs) are powerful tools in representation learning for graph embedding. However, the performance of GAEs is very dependent on the quality of the graph structure, i.e., of the adjacency matrix. In other words, GAEs would perform poorly when the adjacency matrix is incomplete or be disturbed. In this paper, two novel unsupervised graph embedding methods, unsupervised graph embedding via adaptive graph learning (BAGE) and unsupervised graph embedding via variational adaptive graph learning (VBAGE) are proposed. The proposed methods expand the application range of GAEs on graph embedding, i.e, on the general datasets without graph structure. Meanwhile, the adaptive learning mechanism can initialize the adjacency matrix without be affected by the parameter. Besides that, the latent representations are embedded in the laplacian graph structure to preserve the topology structure of the graph in the vector space. Moreover, the adjacency matrix can be self-learned for better embedding performance when the original graph structure is incomplete. With adaptive learning, the proposed method is much more robust to the graph structure. Experimental studies on several datasets validate our design and demonstrate that our methods outperform baselines by a wide margin in node clustering, node classification, and graph visualization tasks.

cs.LG↗

arXiv2021

NameRec*: Highly Accurate and Fine-grained Person Name Recognition

In this paper, we introduce the NameRec* task, which aims to do highly accurate and fine-grained person name recognition. Traditional Named Entity Recognition models have good performance in recognising well-formed person names from text with consistent and complete syntax, such as news articles. However, there are rapidly growing scenarios where sentences are of incomplete syntax and names are in various forms such as user-generated contents and academic homepages. To address person name recognition in this context, we propose a fine-grained annotation scheme based on anthroponymy. To take full advantage of the fine-grained annotations, we propose a Co-guided Neural Network (CogNN) for person name recognition. CogNN fully explores the intra-sentence context and rich training signals of name forms. To better utilize the inter-sentence context and implicit relations, which are extremely essential for recognizing person names in long documents, we further propose an Inter-sentence BERT Model (IsBERT). IsBERT has an overlapped input processor, and an inter-sentence encoder with bidirectional overlapped contextual embedding learning and multi-hop inference mechanisms. To derive benefit from different documents with a diverse abundance of context, we propose an advanced Adaptive Inter-sentence BERT Model (Ada-IsBERT) to dynamically adjust the inter-sentence overlapping ratio to different documents. We conduct extensive experiments to demonstrate the superiority of the proposed methods on both academic homepages and news articles.

cs.CL↗

arXiv2021

Prototypical Representation Learning for Relation Extraction

Recognizing relations between entities is a pivotal task of relational learning. Learning relation representations from distantly-labeled datasets is difficult because of the abundant label noise and complicated expressions in human language. This paper aims to learn predictive, interpretable, and robust relation representations from distantly-labeled data that are effective in different settings, including supervised, distantly supervised, and few-shot learning. Instead of solely relying on the supervision from noisy labels, we propose to learn prototypes for each relation from contextual information to best explore the intrinsic semantics of relations. Prototypes are representations in the feature space abstracting the essential semantics of relations between entities in sentences. We learn prototypes based on objectives with clear geometric interpretation, where the prototypes are unit vectors uniformly dispersed in a unit ball, and statement embeddings are centered at the end of their corresponding prototype vectors on the surface of the ball. This approach allows us to learn meaningful, interpretable prototypes for the final classification. Results on several relation learning tasks show that our model significantly outperforms the previous state-of-the-art models. We further demonstrate the robustness of the encoder and the interpretability of prototypes with extensive experiments.

cs.CL↗

arXiv2021

Enhanced Principal Component Analysis under A Collaborative-Robust Framework

Principal component analysis (PCA) frequently suffers from the disturbance of outliers and thus a spectrum of robust extensions and variations of PCA have been developed. However, existing extensions of PCA treat all samples equally even those with large noise. In this paper, we first introduce a general collaborative-robust weight learning framework that combines weight learning and robust loss in a non-trivial way. More significantly, under the proposed framework, only a part of well-fitting samples are activated which indicates more importance during training, and others, whose errors are large, will not be ignored. In particular, the negative effects of inactivated samples are alleviated by the robust loss function. Then we furthermore develop an enhanced PCA which adopts a point-wise sigma-loss function that interpolates between L_2,1-norm and squared Frobenius-norm and meanwhile retains the rotational invariance property. Extensive experiments are conducted on occluded datasets from two aspects including reconstructed errors and clustering accuracy. The experimental results prove the superiority and effectiveness of our model.

cs.LG↗

arXiv2021

Channel Estimation for Intelligent Reflecting Surface Assisted Backscatter Communication

Intelligent reflecting surface (IRS) is a promising technology to improve the performance of backscatter communication systems by smartly reconfiguring the multi-reflection channel. To fully exploit the passive beamforming gain of IRS in backscatter communication, channel state information (CSI) is indispensable but more practically challenging to acquire than conventional IRS-assisted systems, since IRS passively reflects signals over both the forward and backward (backscattering) links between the reader and tag. To address this issue, we propose in this letter a new and efficient channel estimation scheme for the IRS-assisted backscatter communication system. To minimize the mean-square error (MSE) of channel estimation, we formulate and solve an optimization problem by designing the IRS training reflection matrix for channel estimation under the constraints of unit-modulus elements and full rank. Simulation results verify the effectiveness of the proposed channel estimation scheme as compared to other baseline schemes.

cs.IT↗

arXiv2021

Embedding Graph Auto-Encoder for Graph Clustering

Graph clustering, aiming to partition nodes of a graph into various groups via an unsupervised approach, is an attractive topic in recent years. To improve the representative ability, several graph auto-encoder (GAE) models, which are based on semi-supervised graph convolution networks (GCN), have been developed and they achieve good results compared with traditional clustering methods. However, all existing methods either fail to utilize the orthogonal property of the representations generated by GAE, or separate the clustering and the learning of neural networks. We first prove that the relaxed k-means will obtain an optimal partition in the inner-products used space. Driven by theoretical analysis about relaxed k-means, we design a specific GAE-based model for graph clustering to be consistent with the theory, namely Embedding Graph Auto-Encoder (EGAE). Meanwhile, the learned representations are well explainable such that the representations can be also used for other tasks. To further induce the neural network to produce deep features that are appropriate for the specific clustering model, the relaxed k-means and GAE are learned simultaneously. Therefore, the relaxed k-means can be equivalently regarded as a decoder that attempts to learn representations that can be linearly constructed by some centroid vectors. Accordingly, EGAE consists of one encoder and dual decoders. Extensive experiments are conducted to prove the superiority of EGAE and the corresponding theoretical analyses.

cs.LG↗

arXiv2021

Is your Schema Good Enough to Answer my Query?

Ontology-based data integration has been one of the practical methodologies for heterogeneous legacy database integrated service construction. However, it is neither efficient nor economical to build the cross-domain ontology on top of the schemas of each legacy database for the specific integration application than to reuse the existed ontologies. Then the question lies in whether the existed ontology is compatible with the cross-domain queries and with all the legacy systems. It is highly needed an effective criteria to evaluate the compatibility as it limits the upbound quality of the integrated services. This paper studies the semantic similarity of schemas from the aspect of properties. It provides a set of in-depth criteria, namely coverage and flexibility to evaluate the compatibility among the queries, the schemas and the existing ontology. The weights of classes are extended to make precise compatibility computation. The use of such criteria in the practical project verifies the applicability of our method.

cs.DB↗

arXiv2021

Stand-off magnetometry with directional emission from sodium vapors

Stand-off magnetometry allows measuring magnetic field at a distance, and can be employed in geophysical research, hazardous environment monitoring, and security applications. Stand-off magnetometry based on resonant scattering from atoms or molecules is often limited by the scarce amounts of detected light. The situation would be dramatically improved if the light emitted by excited atoms were to propagate towards the excitation-light-source in a directional manner. Here, we demonstrate that this is possible by means of mirrorless lasing. In a tabletop experiment, we detect free-precession signals of ground-state sodium spins under the influence of a magnetic field by measuring backward-directed light. This method enables scalar magnetometry in the Earth field range, that can be extended to long-baseline sensing.

physics.atom-ph↗

arXiv2021

Efficient Channel Estimation for Double-IRS Aided Multi-User MIMO System

To achieve the more significant passive beamforming gain in the double-intelligent reflecting surface (IRS) aided system over the conventional single-IRS counterpart, channel state information (CSI) is indispensable in practice but also more challenging to acquire, due to the presence of not only the single- but also double-reflection links that are intricately coupled and also entail more channel coefficients for estimation. In this paper, we propose a new and efficient channel estimation scheme for the double-IRS aided multi-user multiple-input multiple-output (MIMO) communication system to resolve the cascaded CSI of both its single- and double-reflection links. First, for the single-user case, the single- and double-reflection channels are efficiently estimated at the multi-antenna base station (BS) with both the IRSs turned ON (for maximal signal reflection), by exploiting the fact that their cascaded channel coefficients are scaled versions of their superimposed lower-dimensional CSI. Then, the proposed channel estimation scheme is extended to the multi-user case, where given an arbitrary user's cascaded channel (estimated as in the single-user case), the other users' cascaded channels can also be expressed as lower-dimensional scaled versions of it and thus efficiently estimated at the BS. Simulation results verify the effectiveness of the proposed channel estimation scheme and joint training reflection design for double IRSs, as compared to various benchmark schemes.

cs.IT↗