arXiv subjects

Rui Dong

Publications and source records attributed to Rui Dong.

At least 37 records · Page 2Linked to original sources

arXiv2023

Tunable interfacial chemisorption with atomic-level precision in a graphene WSe2 heterostructure

It has long been an ultimate goal to introduce chemical doping at the atomic level to precisely tune properties of materials. Two-dimensional materials have natural advantage because of its highly-exposed surface atoms, however, it is still a grand challenge to achieve this goal experimentally. Here, we demonstrate the ability to introduce chemical doping in graphene with atomic-level precision by controlling chemical adsorption of individual Se atoms, which are extracted from the underneath WSe2, at the interface of graphene-WSe2 heterostructures. Our scanning tunneling microscopy (STM) measurements, combined with first-principles calculations, reveal that individual Se atoms can chemisorbed on three possible positions in graphene, which generate distinct pseudospin-mediated atomic-scale vortices in graphene. We demonstrate that the chemisorbed positions of individual Se atoms can be manipulated by STM tip, which enables us to achieve atomic-scale controlling quantum interference of the pseudospin-mediated vortices in graphene. This result offers the promise of controlling properties of materials through chemical doping with atomic-level precision.

cond-mat.mtrl-sci↗

arXiv2023

Efficient Bottom-Up Synthesis for Programs with Local Variables

We propose a new synthesis algorithm that can efficiently search programs with local variables (e.g., those introduced by lambdas). Prior bottom-up synthesis algorithms are not able to evaluate programs with free local variables, and therefore cannot effectively reduce the search space of such programs (e.g., using standard observational equivalence reduction techniques), making synthesis slow. Our algorithm can reduce the space of programs with local variables. The key idea, dubbed lifted interpretation, is to lift up the program interpretation process, from evaluating one program at a time to simultaneously evaluating all programs from a grammar. Lifted interpretation provides a mechanism to systematically enumerate all binding contexts for local variables, thereby enabling us to evaluate and reduce the space of programs with local variables. Our ideas are instantiated in the domain of web automation. The resulting tool, Arborist, can automate a significantly broader range of challenging tasks more efficiently than state-of-the-art techniques including WebRobot and Helena.

cs.PL↗

arXiv2023

DiLogics: Creating Web Automation Programs With Diverse Logics

Knowledge workers frequently encounter repetitive web data entry tasks, like updating records or placing orders. Web automation increases productivity, but translating tasks to web actions accurately and extending to new specifications is challenging. Existing tools can automate tasks that perform the same logical trace of UI actions (e.g., input text in each field in order), but do not support tasks requiring different executions based on varied input conditions. We present DiLogics, a programming-by-demonstration system that utilizes NLP to assist users in creating web automation programs that handle diverse specifications. DiLogics first semantically segments input data to structured task steps. By recording user demonstrations for each step, DiLogics generalizes the web macros to novel but semantically similar task requirements. Our evaluation showed that non-experts can effectively use DiLogics to create automation programs that fulfill diverse input instructions. DiLogics provides an efficient, intuitive, and expressive method for developing web automation programs satisfying diverse specifications.

cs.HC↗

arXiv2023

Contrastive Learning for Conversion Rate Prediction

Conversion rate (CVR) prediction plays an important role in advertising systems. Recently, supervised deep neural network-based models have shown promising performance in CVR prediction. However, they are data hungry and require an enormous amount of training data. In online advertising systems, although there are millions to billions of ads, users tend to click only a small set of them and to convert on an even smaller set. This data sparsity issue restricts the power of these deep models. In this paper, we propose the Contrastive Learning for CVR prediction (CL4CVR) framework. It associates the supervised CVR prediction task with a contrastive learning task, which can learn better data representations exploiting abundant unlabeled data and improve the CVR prediction performance. To tailor the contrastive learning task to the CVR prediction problem, we propose embedding masking (EM), rather than feature masking, to create two views of augmented samples. We also propose a false negative elimination (FNE) component to eliminate samples with the same feature as the anchor sample, to account for the natural property in user behavior data. We further propose a supervised positive inclusion (SPI) component to include additional positive samples for each anchor sample, in order to make full use of sparse but precious user conversion events. Experimental results on two real-world conversion datasets demonstrate the superior performance of CL4CVR. The source code is available at https://github.com/DongRuiHust/CL4CVR.

cs.IR↗

arXiv2023

STREET: A Multi-Task Structured Reasoning and Explanation Benchmark

We introduce STREET, a unified multi-task and multi-domain natural language reasoning and explanation benchmark. Unlike most existing question-answering (QA) datasets, we expect models to not only answer questions, but also produce step-by-step structured explanations describing how premises in the question are used to produce intermediate conclusions that can prove the correctness of a certain answer. We perform extensive evaluation with popular language models such as few-shot prompting GPT-3 and fine-tuned T5. We find that these models still lag behind human performance when producing such structured reasoning steps. We believe this work will provide a way for the community to better train and test systems on multi-step reasoning and explanations in natural language.

cs.CL↗

arXiv2022

Improving Cross-task Generalization of Unified Table-to-text Models with Compositional Task Configurations

There has been great progress in unifying various table-to-text tasks using a single encoder-decoder model trained via multi-task learning (Xie et al., 2022). However, existing methods typically encode task information with a simple dataset name as a prefix to the encoder. This not only limits the effectiveness of multi-task learning, but also hinders the model's ability to generalize to new domains or tasks that were not seen during training, which is crucial for real-world applications. In this paper, we propose compositional task configurations, a set of prompts prepended to the encoder to improve cross-task generalization of unified models. We design the task configurations to explicitly specify the task type, as well as its input and output types. We show that this not only allows the model to better learn shared knowledge across different tasks at training, but also allows us to control the model by composing new configurations that apply novel input-output combinations in a zero-shot manner. We demonstrate via experiments over ten table-to-text tasks that our method outperforms the UnifiedSKG baseline by noticeable margins in both in-domain and zero-shot settings, with average improvements of +0.5 and +12.6 from using a T5-large backbone, respectively.

cs.CL↗

arXiv2022

The Gauge Group and Perturbation Semigroup of an Operator System

The perturbation semigroup was first defined in the case of $*$-algebras by Chamseddine, Connes and van Suijlekom. In this paper, we take $\mathcal{E}$ as a concrete operator system with unit. We first give a definition of gauge group $\mathcal{G}(\mathcal{E})$ of $\mathcal{E}$, after that we give the definition of perturbation semigroup of $\mathcal{E}$, and the closed perturbation semigroup of $\mathcal{E}$ with respect to the Haagerup tensor norm. We also show that there is a continuous semigroup homomorphism from the closed perturbation semigroup to the collection of unital completely bounded Hermitian maps over $\mathcal{E}$. Finally we compute the gauge group and perturbation semigroup of the Toeplitz system as an example.

math.OA↗

arXiv2022

Entailment Tree Explanations via Iterative Retrieval-Generation Reasoner

Large language models have achieved high performance on various question answering (QA) benchmarks, but the explainability of their output remains elusive. Structured explanations, called entailment trees, were recently suggested as a way to explain and inspect a QA system's answer. In order to better generate such entailment trees, we propose an architecture called Iterative Retrieval-Generation Reasoner (IRGR). Our model is able to explain a given hypothesis by systematically generating a step-by-step explanation from textual premises. The IRGR model iteratively searches for suitable premises, constructing a single entailment step at a time. Contrary to previous approaches, our method combines generation steps and retrieval of premises, allowing the model to leverage intermediate conclusions, and mitigating the input size limit of baseline encoder-decoder models. We conduct experiments using the EntailmentBank dataset, where we outperform existing benchmarks on premise retrieval and entailment tree generation, with around 300% gain in overall correctness.

cs.CL↗

arXiv2022

WebRobot: Web Robotic Process Automation using Interactive Programming-by-Demonstration

It is imperative to democratize robotic process automation (RPA), as RPA has become a main driver of the digital transformation but is still technically very demanding to construct, especially for non-experts. In this paper, we study how to automate an important class of RPA tasks, dubbed web RPA, which are concerned with constructing software bots that automate interactions across data and a web browser. Our main contributions are twofold. First, we develop a formal foundation which allows semantically reasoning about web RPA programs and formulate its synthesis problem in a principled manner. Second, we propose a web RPA program synthesis algorithm based on a new idea called speculative rewriting. This leads to a novel speculate-and-validate methodology in the context of rewrite-based program synthesis, which has also shown to be both theoretically simple and practically efficient for synthesizing programs from demonstrations. We have built these ideas in a new interactive synthesizer called WebRobot and evaluate it on 76 web RPA benchmarks. Our results show that WebRobot automated a majority of them effectively. Furthermore, we show that WebRobot compares favorably with a conventional rewrite-based synthesis baseline implemented using egg. Finally, we conduct a small user study demonstrating WebRobot is also usable.

cs.PL↗

arXiv2021

Stiffness and atomic-scale friction in superlubricant MoS$_2$ bilayers

By using ab-initio-accurate force fields and molecular dynamics simulations we demonstrate that the layer stiffness has profound effects on the superlubricant state of two-dimensional van der Waals heterostructures. These are engineered to have identical inter-layer sliding energy surfaces, but layers of different rigidity, so that the effects of the stiffness on the microscopic friction in the superlubricant state can be isolated. A twofold increase in the intra-layer stiffness reduces the friction by approximately a factor six. Most importantly, we find two sliding regimes as a function of the sliding velocity. At low velocity the heat generated by the motion is efficiently exchanged between the layers and the friction is independent on whether the sliding layer is softer or harder than the substrate. In contrast, at high velocity the friction heat flux cannot be exchanged fast enough, and the build up of significant temperature gradients between the layers is observed. In this situation the temperature profile depends on whether the slider is softer than the substrate.

cond-mat.mtrl-sci↗

arXiv2020

Second Quantization and the Spectral Action

We consider both the bosonic and fermionic second quantization of spectral triples in the presence of a chemical potential. We show that the von Neumann entropy and the average energy of the Gibbs state defined by the bosonic and fermionic grand partition function can be expressed as spectral actions. It turns out that all spectral action coefficients can be given in terms of the modified Bessel functions. In the fermionic case, we show that the spectral coefficients for the von Neumann entropy, in the limit when the chemical potential $μ$ approaches $0,$ can be expressed in terms of the Riemann zeta function. This recovers a result of Chamseddine-Connes-van Suijlekom.

math-ph↗

arXiv2020

Deep Learning for Radio Resource Allocation with Diverse Quality-of-Service Requirements in 5G

To accommodate diverse Quality-of-Service (QoS) requirements in the 5th generation cellular networks, base stations need real-time optimization of radio resources in time-varying network conditions. This brings high computing overheads and long processing delays. In this work, we develop a deep learning framework to approximate the optimal resource allocation policy that minimizes the total power consumption of a base station by optimizing bandwidth and transmit power allocation. We find that a fully-connected neural network (NN) cannot fully guarantee the QoS requirements due to the approximation errors and quantization errors of the numbers of subcarriers. To tackle this problem, we propose a cascaded structure of NNs, where the first NN approximates the optimal bandwidth allocation, and the second NN outputs the transmit power required to satisfy the QoS requirement with given bandwidth allocation. Considering that the distribution of wireless channels and the types of services in the wireless networks are non-stationary, we apply deep transfer learning to update NNs in non-stationary wireless networks. Simulation results validate that the cascaded NNs outperform the fully connected NN in terms of QoS guarantee. In addition, deep transfer learning can reduce the number of training samples required to train the NNs remarkably.

eess.SP↗

arXiv2020

Deep Learning for Ultra-Reliable and Low-Latency Communications in 6G Networks

In the future 6th generation networks, ultra-reliable and low-latency communications (URLLC) will lay the foundation for emerging mission-critical applications that have stringent requirements on end-to-end delay and reliability. Existing works on URLLC are mainly based on theoretical models and assumptions. The model-based solutions provide useful insights, but cannot be directly implemented in practice. In this article, we first summarize how to apply data-driven supervised deep learning and deep reinforcement learning in URLLC, and discuss some open problems of these methods. To address these open problems, we develop a multi-level architecture that enables device intelligence, edge intelligence, and cloud intelligence for URLLC. The basic idea is to merge theoretical models and real-world data in analyzing the latency and reliability and training deep neural networks (DNNs). Deep transfer learning is adopted in the architecture to fine-tune the pre-trained DNNs in non-stationary networks. Further considering that the computing capacity at each user and each mobile edge computing server is limited, federated learning is applied to improve the learning efficiency. Finally, we provide some experimental and simulation results and discuss some future directions.

eess.SP↗

arXiv2020

Morphological Word Segmentation on Agglutinative Languages for Neural Machine Translation

Neural machine translation (NMT) has achieved impressive performance on machine translation task in recent years. However, in consideration of efficiency, a limited-size vocabulary that only contains the top-N highest frequency words are employed for model training, which leads to many rare and unknown words. It is rather difficult when translating from the low-resource and morphologically-rich agglutinative languages, which have complex morphology and large vocabulary. In this paper, we propose a morphological word segmentation method on the source-side for NMT that incorporates morphology knowledge to preserve the linguistic and semantic information in the word structure while reducing the vocabulary size at training time. It can be utilized as a preprocessing tool to segment the words in agglutinative languages for other natural language processing (NLP) tasks. Experimental results show that our morphologically motivated word segmentation method is better suitable for the NMT model, which achieves significant improvements on Turkish-English and Uyghur-Chinese machine translation tasks on account of reducing data sparseness and language complexity.

cs.CL↗

arXiv2019

Deep Learning for Hybrid 5G Services in Mobile Edge Computing Systems: Learn from a Digital Twin

In this work, we consider a mobile edge computing system with both ultra-reliable and low-latency communications services and delay tolerant services. We aim to minimize the normalized energy consumption, defined as the energy consumption per bit, by optimizing user association, resource allocation, and offloading probabilities subject to the quality-of-service requirements. The user association is managed by the mobility management entity (MME), while resource allocation and offloading probabilities are determined by each access point (AP). We propose a deep learning (DL) architecture, where a digital twin of the real network environment is used to train the DL algorithm off-line at a central server. From the pre-trained deep neural network (DNN), the MME can obtain user association scheme in a real-time manner. Considering that real networks are not static, the digital twin monitors the variation of real networks and updates the DNN accordingly. For a given user association scheme, we propose an optimization algorithm to find the optimal resource allocation and offloading probabilities at each AP. Simulation results show that our method can achieve lower normalized energy consumption with less computation complexity compared with an existing method and approach to the performance of the global optimal solution.

eess.SP↗

arXiv2018

The Ricci Curvature for Noncommutative Three Tori

We compute the Ricci curvature of a curved noncommutative three torus. The computation is done both for conformal and non-conformal perturbations of the flat metric. To perturb the flat metric, the standard volume form on the noncommutative three torus is perturbed and the corresponding perturbed Laplacian is analyzed. Using Connes' pseudodifferential calculus for the noncommutative tori, we explicitly compute the second term of the short time heat kernel expansion for the perturbed Laplacians on functions and on 1-forms. The Ricci curvature is defined by localizing heat traces suitably. Equivalerntly, it can be defined through special values of localized spectral zeta functions. We also compute the scalar curvatures and compare our results with previous calculations in the conformal case. Finally we compute the classical limit of our formulas and show that they coincide with classical formulas in the commutative case.

math.QA↗

arXiv2013

Wafer bonding solution to epitaxial graphene - silicon integration

The development of graphene electronics requires the integration of graphene devices with Si-CMOS technology. Most strategies involve the transfer of graphene sheets onto silicon, with the inherent difficulties of clean transfer and subsequent graphene nano-patterning that degrades considerably the electronic mobility of nanopatterned graphene. Epitaxial graphene (EG) by contrast is grown on an essentially perfect crystalline (semi-insulating) surface, and graphene nanostructures with exceptional properties have been realized by a selective growth process on tailored SiC surface that requires no graphene patterning. However, the temperatures required in this structured growth process are too high for silicon technology. Here we demonstrate a new graphene to Si integration strategy, with a bonded and interconnected compact double-wafer structure. Using silicon-on-insulator technology (SOI) a thin monocrystalline silicon layer ready for CMOS processing is applied on top of epitaxial graphene on SiC. The parallel Si and graphene platforms are interconnected by metal vias. This method inspired by the industrial development of 3d hyper-integration stacking thin-film electronic devices preserves the advantages of epitaxial graphene and enables the full spectrum of CMOS processing.

cond-mat.mtrl-sci↗

arXiv2013

Record Maximum Oscillation Frequency in C-face Epitaxial Graphene Transistors

The maximum oscillation frequency (fmax) quantifies the practical upper bound for useful circuit operation. We report here an fmax of 70 GHz in transistors using epitaxial graphene grown on the C-face of SiC. This is a significant improvement over Si-face epitaxial graphene used in the prior high frequency transistor studies, exemplifying the superior electronics potential of C-face epitaxial graphene. Careful transistor design using a high κ dielectric T-gate and self-aligned contacts, further contributed to the record-breaking fmax.

cond-mat.mtrl-sci↗