Search arXiv⌕ Search

arXiv subjects

Shuo Zhang

Publications and source records attributed to Shuo Zhang.

At least 289 records · Page 16Linked to original sources

Molecular Mechanics-Driven Graph Neural Network with Multiplex Graph for Molecular Structures

The prediction of physicochemical properties from molecular structures is a crucial task for artificial intelligence aided molecular design. A growing number of Graph Neural Networks (GNNs) have been proposed to address this challenge. These models improve their expressive power by incorporating auxiliary information in molecules while inevitably increase their computational complexity. In this work, we aim to design a GNN which is both powerful and efficient for molecule structures. To achieve such goal, we propose a molecular mechanics-driven approach by first representing each molecule as a two-layer multiplex graph, where one layer contains only local connections that mainly capture the covalent interactions and another layer contains global connections that can simulate non-covalent interactions. Then for each layer, a corresponding message passing module is proposed to balance the trade-off of expression power and computational complexity. Based on these two modules, we build Multiplex Molecular Graph Neural Network (MXMNet). When validated by the QM9 dataset for small molecules and PDBBind dataset for large protein-ligand complexes, MXMNet achieves superior results to the existing state-of-the-art models under restricted resources.

cs.LG↗

IAI MovieBot: A Conversational Movie Recommender System

Conversational recommender systems support users in accomplishing recommendation-related goals via multi-turn conversations. To better model dynamically changing user preferences and provide the community with a reusable development framework, we introduce IAI MovieBot, a conversational recommender system for movies. It features a task-specific dialogue flow, a multi-modal chat interface, and an effective way to deal with dynamically changing user preferences. The system is made available open source and is operated as a channel on Telegram.

cs.IR↗

Multi-Dimension Fusion Network for Light Field Spatial Super-Resolution using Dynamic Filters

Light field cameras have been proved to be powerful tools for 3D reconstruction and virtual reality applications. However, the limited resolution of light field images brings a lot of difficulties for further information display and extraction. In this paper, we introduce a novel learning-based framework to improve the spatial resolution of light fields. First, features from different dimensions are parallelly extracted and fused together in our multi-dimension fusion architecture. These features are then used to generate dynamic filters, which extract subpixel information from micro-lens images and also implicitly consider the disparity information. Finally, more high-frequency details learned in the residual branch are added to the upsampled images and the final super-resolved light fields are obtained. Experimental results show that the proposed method uses fewer parameters but achieves better performances than other state-of-the-art methods in various kinds of datasets. Our reconstructed images also show sharp details and distinct lines in both sub-aperture images and epipolar plane images.

eess.IV↗

Scatting theory for reflective Fourier ptychographic diffraction tomography

A forward model is presented to an inverse scattering problem that arises in the application of reflective Fourier ptychographic microscopy. The model allows us to determine the 3D distributions of refractive index for weakly scattering semi-transparent objects using Fourier ptychographic tomography. The derivation results show that both transmission types reported previously and reflective type present in this article are corresponding to a specific application in Wolf's work (Emil Wolf, Opt. Commun. 1969 1(4) pp. 153-156). The transmission type measures the forward scattering field while the reflective type measures the backward scattering field. This model is also available for holographic method

physics.optics↗

Generating Categories for Sets of Entities

Category systems are central components of knowledge bases, as they provide a hierarchical grouping of semantically related concepts and entities. They are a unique and valuable resource that is utilized in a broad range of information access tasks. To aid knowledge editors in the manual process of expanding a category system, this paper presents a method of generating categories for sets of entities. First, we employ neural abstractive summarization models to generate candidate categories. Next, the location within the hierarchy is identified for each candidate. Finally, structure-, content-, and hierarchy-based features are used to rank candidates to identify by the most promising ones (measured in terms of specificity, hierarchy, and importance). We develop a test collection based on Wikipedia categories and demonstrate the effectiveness of the proposed approach.

cs.IR↗

Summarizing and Exploring Tabular Data in Conversational Search

Tabular data provide answers to a significant portion of search queries. However, reciting an entire result table is impractical in conversational search systems. We propose to generate natural language summaries as answers to describe the complex information contained in a table. Through crowdsourcing experiments, we build a new conversation-oriented, open-domain table summarization dataset. It includes annotated table summaries, which not only answer questions but also help people explore other information in the table. We utilize this dataset to develop automatic table summarization systems as SOTA baselines. Based on the experimental results, we identify challenges and point out future research directions that this resource will support.

cs.IR↗

Lowest-degree robust finite element scheme for a fourth-order elliptic singular perturbation problem on rectangular grids

In this paper, a piecewise quadratic nonconforming finite element method on rectangular grids for a fourth-order elliptic singular perturbation problem is presented. This proposed method is robustly convergent with respect to the perturbation parameter. Numerical results are presented to verify the theoretical findings. The new method uses piecewise quadratic polynomials, and is of the lowest degree possible. Optimal order approximation property of the finite element space is proved by means of a locally-averaged interpolation operator newly constructed. This interpolator, however, is not a projection. Indeed, we establish a general theory and show that no locally defined interpolation associated with the locally supported basis functions can be projective for the finite element space in use. Particularly, the general theory gives an answer to a long-standing open problem presented in [Demko, J. Approx. Theory, $\bf{43}$(2):151--156, 1985].

math.NA↗

Lowest-degree piecewise polynomial de Rham complex on general quadrilateral grids

This paper is devoted to the construction of finite elements on grids that consist of general quadrilaterals not limited in parallelograms. Two finite elements defined as Ciarlet's triple are established for the $H^1$ and $H(\rm rot)$ elliptic problems, respectively. An $\mathcal{O}(h)$ order convergence rate in energy norm for both of them and an $\mathcal{O}(h^2)$ order convergence in $L^2$ norm for the $H^1$ scheme are proved under the asymptotic-parallelogram assumption on the grids. Further, the two finite element spaces on general quadrilateral grids, together with the space of piecewise constant functions, formulate a discretized de Rham complex. The finite element spaces consist of piecewise polynomial functions, and, thus, are nonconforming on general quadrilateral grids. Indeed, a rigorous analysis is given in this paper that it is impossible to construct a practically useful finite element defined as Ciarlet's triple that can formulate a finite element space which consists of continuous piecewise polynomial functions on a grid that may include arbitrary quadrilaterals.

math.NA↗

On the Secrecy of UAV Systems With Linear Trajectory

By observing the fact that moving in a straight line is a common flying behavior of unmanned aerial vehicles (UAVs) in normal applications, e.g., power line inspections, and air patrols along with highway/streets/borders, in this paper we investigate the secrecy outage performance of a UAV system with linear trajectory, where a UAV ($S$) flies in a straight line and transmits its information over the downlink to a legitimate receiver ($D$) on the ground while an eavesdropping UAV ($E$) trying to overhear the information delivery between $S$ and $D$. Meanwhile, some information is delivered to $S$ over the uplink from $D$, such as commanding messages to control $S$'s detecting operations, which can also be eavesdropped by $E$. The locations of $S$, $D$, and $E$ are randomly distributed. We first characterize the statistical characteristics (including cumulative distribution functions and probability density function) of the received signal-to-noise ratio over both downlink and uplink, and then the closed-form analytical expressions for the lower boundary of the secrecy outage probability of both downlink and uplink have also been derived accordingly. Finally, Monte-Carlo simulations are given to testify our proposed analytical models.

eess.SP↗

Evaluating Conversational Recommender Systems via User Simulation

Conversational information access is an emerging research area. Currently, human evaluation is used for end-to-end system evaluation, which is both very time and resource intensive at scale, and thus becomes a bottleneck of progress. As an alternative, we propose automated evaluation by means of simulating users. Our user simulator aims to generate responses that a real human would give by considering both individual preferences and the general flow of interaction with the system. We evaluate our simulation approach on an item recommendation task by comparing three existing conversational recommender systems. We show that preference modeling and task-specific interaction models both contribute to more realistic simulations, and can help achieve high correlation between automatic evaluation measures and manual human assessments.

cs.IR↗

3D Lidar Mapping Relative Accuracy Automatic Evaluation Algorithm

HD (High Definition) map based on 3D lidar plays a vital role in autonomous vehicle localization, planning, decision-making, perception, etc. Many 3D lidar mapping technologies related to SLAM (Simultaneous Localization and Mapping) are used in HD map construction to ensure its high accuracy. To evaluate the accuracy of 3D lidar mapping, the most common methods use ground truth of poses to calculate the error between estimated poses and ground truth, however it's usually so difficult to get the ground truth of poses in the actual lidar mapping for autonomous vehicle. In this paper, we proposed a relative accuracy evaluation algorithm that can automatically evaluate the accuracy of HD map built by 3D lidar mapping without ground truth. A method for detecting the degree of ghosting in point cloud map quantitatively is designed to reflect the accuracy indirectly, which takes advantage of the principle of light traveling in a straight line and the fact that light can not penetrate opaque objects. Our experimental results confirm that the proposed evaluation algorithm can automatically and efficiently detect the bad poses whose accuracy are less than the set threshold such as 0.1m, then calculate the bad poses percentage P_bad in all estimated poses to obtain the final accuracy metric P_acc = 1 - P_bad.

cs.CV↗

Accelerating Neural Network Inference by Overflow Aware Quantization

The inherent heavy computation of deep neural networks prevents their widespread applications. A widely used method for accelerating model inference is quantization, by replacing the input operands of a network using fixed-point values. Then the majority of computation costs focus on the integer matrix multiplication accumulation. In fact, high-bit accumulator leads to partially wasted computation and low-bit one typically suffers from numerical overflow. To address this problem, we propose an overflow aware quantization method by designing trainable adaptive fixed-point representation, to optimize the number of bits for each input tensor while prohibiting numeric overflow during the computation. With the proposed method, we are able to fully utilize the computing power to minimize the quantization loss and obtain optimized inference performance. To verify the effectiveness of our method, we conduct image classification, object detection, and semantic segmentation tasks on ImageNet, Pascal VOC, and COCO datasets, respectively. Experimental results demonstrate that the proposed method can achieve comparable performance with state-of-the-art quantization methods while accelerating the inference process by about 2 times.

cs.CV↗

Direct imaging of liquid-nanoparticle interface with atom probe tomography

Understanding the structure and chemical composition at the liquid-nanoparticle (NP) interface is crucial for a wide range of physical, chemical and biological processes. In this study, direct imaging of the liquid-NP interface by atom probe tomography (APT) is reported for the first time, which reveals the distributions and the interactions of key atoms and molecules in this critical domain. The APT specimen is prepared by controlled graphene encapsulation of the solution containing nanoparticles on a metal tip, with an end radius in the range of 50 nm to allow field ionization and evaporation. Using Au nanoparticles (AuNPs) in suspension as an example, analysis of the mass spectrum and three-dimensional (3D) chemical maps from APT provides a detailed image of the water-gold interface with near-atomic resolution. At the water-gold interface, the formation of an electrical double layer (EDL) rich in water (H2O) molecules has been observed, which results from the charge from the binding between the trisodium-citrate layer and the AuNP. In the bulk water region, the density of reconstructed H2O has been shown to be consistent, reflecting a highly packed density of H2O molecules after graphene encapsulation. This study is the first demonstration of direct imaging of liquid-NP interface using APT with results providing an atom-by-atom 3D dissection of the liquid-NP interface.

cond-mat.mtrl-sci↗

Improving Attention Mechanism in Graph Neural Networks via Cardinality Preservation

Graph Neural Networks (GNNs) are powerful to learn the representation of graph-structured data. Most of the GNNs use the message-passing scheme, where the embedding of a node is iteratively updated by aggregating the information of its neighbors. To achieve a better expressive capability of node influences, attention mechanism has grown to be popular to assign trainable weights to the nodes in aggregation. Though the attention-based GNNs have achieved remarkable results in various tasks, a clear understanding of their discriminative capacities is missing. In this work, we present a theoretical analysis of the representational properties of the GNN that adopts the attention mechanism as an aggregator. Our analysis determines all cases when those attention-based GNNs can always fail to distinguish certain distinct structures. Those cases appear due to the ignorance of cardinality information in attention-based aggregation. To improve the performance of attention-based GNNs, we propose cardinality preserved attention (CPA) models that can be applied to any kind of attention mechanisms. Our experiments on node and graph classification confirm our theoretical analysis and show the competitive performance of our CPA models.

cs.LG↗

NuSTAR and Chandra Observation of the Galactic Center Non-thermal X-ray Filament G0.13-0.11: A Pulsar Wind Nebula Driven Magnetic Filament

One of the most unique phenomena in the Galactic center region is the existence of numerous long and narrow filamentary structures within a few hundred parsecs of Sgr A$^{\star}$. While more than one than one hundred radio filaments have been revealed by MeerKAT, about two dozens X-ray filaments have been discovered so far. In this article, we report our analysis on the deep Chandra and NuSTAR observations of a non-thermal X-ray filament, G0.13-0.11, which is located adjacent to the Radio arc. Chandra revealed a unique morphology of G0.13-0.11, which is an elongated (0.1 pc in width and 3.2 pc in length) structure slightly bended towards the Radio arc. A pulsar candidate ($Γ\sim 1.4$) is detected in the middle of the filament, with a tail of diffuse non-thermal X-ray emission on one side of the filament. The filament is detected by NuSTAR up to 79 keV, with the hard X-ray centroid consistent with the pulsar candidate. We found that the X-ray intensity decays along the filament farther away from the pulsar candidate, dropping to half of its peak value at 2.2 pc away. This system is mostly likely a Pulsar Wind Nebula interacting with ambient interstellar magnetic field, where the filaments are kinetic jets from PWN as recently proposed. The nature of this filament adds to complex origin of the X-ray filaments, which serve as powerful tools to probe local and global powerful particle accelerators in the Galactic center.

astro-ph.HE↗

An optimal piecewise cubic nonconforming finite element scheme for the planar biharmonic equation on general triangulations

This paper presents a nonconforming finite element scheme for the planar biharmonic equation which applis piecewise cubic polynomials ($P_3$) and possesses $\mathcal{O}(h^2)$ convergence rate in energy norm on general shape-regular triangulations. Both Dirichlet and Navier type boundary value problems are studied. The basis for the scheme is a piecewise cubic polynomial space, which can approximate the $H^4$ functions with $\mathcal{O}(h^2)$ accuracy in broken $H^2$ norm. Besides, an equivalence $(\nabla_h^2\ \cdot,\nabla_h^2\ \cdot)=(Δ_h\ \cdot,Δ_h\ \cdot)$, which is usually not true for nonconforming finite element spaces, is proved on the newly designed spaces. The finite element space does not correspond to a finite element defined with Ciarlet's triple; however, a set of locally supported basis functions of the finite element space is still figured out. The notion of the finite element Stokes complex plays an important role in the analysis and also the construction of the basis functions.

math.NA↗

Web Table Extraction, Retrieval and Augmentation: A Survey

Tables are a powerful and popular tool for organizing and manipulating data. A vast number of tables can be found on the Web, which represents a valuable knowledge resource. The objective of this survey is to synthesize and present two decades of research on web tables. In particular, we organize existing literature into six main categories of information access tasks: table extraction, table interpretation, table search, question answering, knowledge base augmentation, and table augmentation. For each of these tasks, we identify and describe seminal approaches, present relevant resources, and point out interdependencies among the different tasks.

cs.IR↗

Auto-completion for Data Cells in Relational Tables

We address the task of auto-completing data cells in relational tables. Such tables describe entities (in rows) with their attributes (in columns). We present the CellAutoComplete framework to tackle several novel aspects of this problem, including: (i) enabling a cell to have multiple, possibly conflicting values, (ii) supplementing the predicted values with supporting evidence, (iii) combining evidence from multiple sources, and (iv) handling the case where a cell should be left empty. Our framework makes use of a large table corpus and a knowledge base as data sources, and consists of preprocessing, candidate value finding, and value ranking components. Using a purpose-built test collection, we show that our approach is 40\% more effective than the best baseline.

cs.IR↗