arXiv subjects

Chi Zhang

Publications and source records attributed to Chi Zhang.

At least 667 records · Page 37Linked to original sources

arXiv2022

Scenario-based Multi-product Advertising Copywriting Generation for E-Commerce

In this paper, we proposed an automatic Scenario-based Multi-product Advertising Copywriting Generation system (SMPACG) for E-Commerce, which has been deployed on a leading Chinese e-commerce platform. The proposed SMPACG consists of two main components: 1) an automatic multi-product combination selection module, which itself is consisted of a topic prediction model, a pattern and attribute-based selection model and an arbitrator model; and 2) an automatic multi-product advertising copywriting generation module, which combines our proposed domain-specific pretrained language model and knowledge-based data enhancement model. The SMPACG is the first system that realizes automatic scenario-based multi-product advertising contents generation, which achieves significant improvements over other state-of-the-art methods. The SMPACG has been not only developed for directly serving for our e-commerce recommendation system, but also used as a real-time writing assistant tool for merchants.

cs.AI↗

arXiv2022

Steady-state entanglement generation for non-degenerate qubits

We propose a scheme to dissipatively produce steady-state entanglement in a two-qubit system, via an interaction with a bosonic mode. The system is driven into a stationary entangled state, while we compensate the mode dissipation by injecting energy via a coherent pump field. We also present a scheme which allows us to adiabatically transfer all the population to the desired entangled state. The dynamics leading to the entangled state in these schemes can be understood in analogy with electromagnetically induced transparency (EIT) and stimulated Raman adiabatic passage (STIRAP), respectively.

quant-ph↗

arXiv2022

Weight-dependent Gates for Network Pruning

In this paper, a simple yet effective network pruning framework is proposed to simultaneously address the problems of pruning indicator, pruning ratio, and efficiency constraint. This paper argues that the pruning decision should depend on the convolutional weights, and thus proposes novel weight-dependent gates (W-Gates) to learn the information from filter weights and obtain binary gates to prune or keep the filters automatically. To prune the network under efficiency constraints, a switchable Efficiency Module is constructed to predict the hardware latency or FLOPs of candidate pruned networks. Combined with the proposed Efficiency Module, W-Gates can perform filter pruning in an efficiency-aware manner and achieve a compact network with a better accuracy-efficiency trade-off. We have demonstrated the effectiveness of the proposed method on ResNet34, ResNet50, and MobileNet V2, respectively achieving up to 1.33/1.28/1.1 higher Top-1 accuracy with lower hardware latency on ImageNet. Compared with state-of-the-art methods, W-Gates also achieves superior performance.

cs.CV↗

arXiv2022

Review on Smoothed Particle Hydrodynamics: Methodology development and recent achievement

Since its inception, the full Lagrangian meshless smoothed particle hydrodynamics (SPH) method has experienced a tremendous enhancement in methodology and impacted a range of multi-physics applications in science and engineering. The paper presents a concise review on latest developments and achievements of the SPH method, including (1) brief review of theory and fundamental with kernel corrections, (2) the Riemann-based SPH method with dissipation limiting and high-order data reconstruction by using MUSCL, WENO and MOOD schemes, (3) particle neighbor searching with particle sorting and efficient dual-criteria time stepping schemes, (4) total Lagrangian formulation with stablized, dynamics relaxation and hourglass control schemes, (5) fluid-structure interaction scheme with interface treatments and multi-resolution discretizations, (6) novel applications of particle relaxation for mesh and particle generations. Last but not least, benchmark tests for validating computational accuracy, convergence, robustness and efficiency are also supplied accordingly.

physics.comp-ph↗

arXiv2022

A multi-resolution SPH framework: Application to multi-phase fluid-structure interactions

In the previous work, Zhang et al. proposed a multi-resolution smoothed particle hydrodynamics (SPH) method for fluid-structure interactions (FSI) with achieving an optimized computational efficiency meanwhile maintaining good numerical robustness and accuracy. In the present paper, this multi-resolution SPH framework where different spatial-temporal discretizations are applied for different sub-systems is extended to multi-phase flows involving large density ratio and interacting with rigid or flexible structure. To this end, a simple and efficient multi-phase model is introduced by exploiting different density reinitialization strategies other than applying different formulations to implement mass conservation to the light and heavy phases, respectively, to realize the target of using same artificial speed of sound for the both. To eliminate the unnatural voids and unrealistic phase separation meanwhile decrease the numerical dissipation, the transport velocity formulation are rewritten by applying temporal local flow state dependent background pressure. To handle the FSI coupling in both single- and multi-resolution scenarios in the triple point, the one-sided Riemann-based solid boundary condition is adopted. A set of examples involving multi-phase flows with high density ratio and complex interface and multi-phase FSI are studied to demonstrate the efficiency, accuracy and robustness of the present method. The validations presented herein and those reported in the original paper of Zhang et al. where single-phase FSI is studied put the present multi-resolution SPH framework in good stead in terms of computational efficiency for multi-physics applications.

physics.flu-dyn↗

arXiv2022

Minimization of Secrecy Outage Probability in Reconfigurable Intelligent Surface-Assisted MIMOME System

This article investigates physical layer security (PLS) in reconfigurable intelligent surface (RIS)-assisted multiple-input multiple-output multiple-antenna-eavesdropper (MIMOME) channels. Existing researches ignore the problem that secrecy rate can not be calculated if the eavesdropper's instantaneous channel state information (CSI) is unknown. Furthermore, without the secrecy rate expression, beamforming and phase shifter optimization with the purpose of PLS enhancement is not available. To address these problems, we first give the expression of secrecy outage probability for any beamforming vector and phase shifter matrix as the RIS-assisted PLS metric, which is measured based on the eavesdropper's statistical CSI. Then, with the aid of the expression, we formulate the minimization problem of secrecy outage probability that is solved via alternately optimizing beamforming vectors and phase shift matrices. In the case of single-antenna transmitter or single-antenna legitimate receiver, the proposed alternating optimization (AO) scheme can be simplified to reduce computational complexity. Finally, it is demonstrated that the secrecy outage probability is significantly reduced with the proposed methods compared to current RIS-assisted PLS systems.

cs.IT↗

arXiv2022

Double-End Queues with Non-Poisson Inputs and Their Effective Algorithms

It is interesting and challenging to study double-ended queues with First-Come-First-Match discipline under customers' impatient behavior and non-Poisson inputs. The system stability can be guaranteed by the customers' impatient behavior, while the existence of impatient customers makes analysis of such double-ended queues more difficult or even impossible to find an explicitly analytic solution, thus it becomes more and more important to develop effective numerical methods in a variety of practical matching problems. This paper studies a block-structured double-ended queue, whose block structure comes from two independent Markovian arrival processes (MAPs), which are non-Poisson inputs. We show that such a queue can be expressed as a new bilateral quasi birth-and-death (QBD) process which has its own interest. Based on this, we provide a detailed analysis for both the bilateral QBD process and the double-ended queue, including the system stability, the queue size distributions, the average stationary queue lengths, and the sojourn time of any arriving customers. Furthermore, we develop three effective algorithms for computing the performance measures (i.e., the probabilities of stationary queue lengths, the average stationary queue lengths, and the average sojourn times) of the double-ended queue with non-Poisson inputs. Finally, we use some numerical examples in tabular and graphical to illustrate how the performance measures are influenced by some key system parameters. We believe that the methodology and results described in this paper can be applicable to deal with more general double-ended queues in practice, and develop some effective algorithms for the purpose of many actual uses.

math.PR↗

arXiv2022

Learning the Pedestrian-Vehicle Interaction for Pedestrian Trajectory Prediction

In this paper, we study the interaction between pedestrians and vehicles and propose a novel neural network structure called the Pedestrian-Vehicle Interaction (PVI) extractor for learning the pedestrian-vehicle interaction. We implement the proposed PVI extractor on both sequential approaches (long short-term memory (LSTM) models) and non-sequential approaches (convolutional models). We use the Waymo Open Dataset that contains real-world urban traffic scenes with both pedestrian and vehicle annotations. For the LSTM-based models, our proposed model is compared with Social-LSTM and Social-GAN, and using our proposed PVI extractor reduces the average displacement error (ADE) and the final displacement error (FDE) by 7.46% and 5.24%, respectively. For the convolutional-based models, our proposed model is compared with Social-STGCNN and Social-IWSTCNN, and using our proposed PVI extractor reduces the ADE and FDE by 2.10% and 1.27%, respectively. The results show that the pedestrian-vehicle interaction influences pedestrian behavior, and the models using the proposed PVI extractor can capture the interaction between pedestrians and vehicles, and thereby outperform the compared methods.

cs.CV↗

arXiv2022

Inner-shell excitation in the YbF molecule and its impact on laser cooling

The YbF molecule is a sensitive system for measuring the electron's electric dipole moment. The precision of this measurement can be improved by direct laser cooling of the molecules to ultracold temperature. However, low-lying electronic states arising from excitation of a 4f electron may hinder laser cooling. One set of these "4f hole" states lies below the $A^2Π_{1/2}$ excited state used for laser cooling, and radiative decay to these intermediate levels, even with branching ratios as small as $10^{-5}$, can be a hindrance. Other 4f hole states lie very close to the $A^2Π_{1/2}$ state, and a perturbation results in states of mixed character that are involved in the laser cooling cycle. This perturbation may enhance the loss of molecules to states outside of the laser cooling cycle. We model the perturbation of the $A^2Π_{1/2}$ state to determine the strength of the coupling between the states, the de-perturbed potential energy curves, and the radiative branching ratios to various vibrational levels of the ground state, $X ^{2}Σ^+$. We use electronic structure calculations to characterise the 4f hole states and the strengths of transitions between these states and the $A^2Π_{1/2}$ and $X ^{2}Σ^+$ states. We identify a leak out of the cooling cycle with a branching ratio of roughly $5 \times 10^{-4}$, dominated by the contribution of the ground state configuration in a 4f hole state. Finally, we assess the impact of these results for laser cooling of YbF and molecules with similar structure.

physics.atom-ph↗

arXiv2022

Four-Family ${\cal N}=1$ Supersymmetric Pati-Salam Models from Intersecting D6-Branes

We investigate the construction of four-family ${\cal N}=1$ supersymmetric Pati-Salam models from Type IIA $\mathbb{T}^6/(\mathbb{Z}_2 \times \mathbb{Z}_2)$ orientifold with intersecting D6-branes. Utilizing the deterministic algorithm introduced in Ref. \cite{heCompleteSearchSupersymmetric2021}, we obtain $274$ types of models with three rectangular tori and distinct gauge coupling relations at string scale, while $6$ types of models with two rectangular tori and one titled torus. In both cases, there exists a class of models with gauge coupling unification at string scale. In particular, for the models with two rectangular tori, one tilted torus and gauge coupling unification, the gaugino condensations are allowed, and thus supersymmetry breaking and moduli stabilization are possible for further phenomenological study.

hep-th↗

arXiv2022

Functions Beyond Multiple Polylogarithms for Precision Collider Physics

Feynman diagrams constitute one of the essential ingredients for making precision predictions for collider experiments. Yet, while the simplest Feynman diagrams can be evaluated in terms of multiple polylogarithms -- whose properties as special functions are well understood -- more complex diagrams often involve integrals over complicated algebraic manifolds. Such diagrams already contribute at NNLO to the self-energy of the electron, $t \bar{t}$ production, $γγ$ production, and Higgs decay, and appear at two loops in the planar limit of maximally supersymmetric Yang-Mills theory. This makes the study of these more complicated types of integrals of phenomenological as well as conceptual importance. In this white paper contribution to the Snowmass community planning exercise, we provide an overview of the state of research on Feynman diagrams that involve special functions beyond multiple polylogarithms, and highlight a number of research directions that constitute essential avenues for future investigation.

hep-ph↗

arXiv2022

On Frobenius-Perron Dimension

We propose a notion of Frobenius-Perron dimension for certain free $\mathbb{Z}$-modules of infinite rank and compute it for the $\mathbb{Z}$-modules of finite dimensional complex representations of unitary groups with nonnegative dominant weights. We also provide a lower bound for the Frobenius-Perron dimension of Schubert classes in the quantum cohomology of complex Grassmannians.

math.AG↗

arXiv2022

Optimization and implementation of a surface-electrode ion trap junction

We describe the design of a surface-electrode ion trap junction, which is a key element for large-scale ion trap arrays. A bi-objective optimization method is used for designing the electrodes, which maintains the total pseudo-potential curvature while minimizing the axial pseudo-potential gradient along the ion transport path. To facilitate the laser beam delivery for parallel operations in multiple trap zones, we implemented integrated optics on each arm of this X-junction trap. The layout of the trap chip for commercial foundry fabrication is presented. This work suggests routes to improving ion trap junction performance in scalable implementations. Together with integrated optical addressing, this contributes to modular trapped-ion quantum computing in interconnected 2-dimensional arrays.

quant-ph↗

arXiv2022

Tree Representation, Growth Rate of Blockchain and Reward Allocation in Ethereum with Multiple Mining Pools

It is interesting but difficult and challenging to study Ethereum with multiple mining pools. One of the main difficulties comes from not only how to represent such a general tree with multiple block branches (or sub-chains) related to the multiple mining pools, but also how to analyze a multi-dimensional stochastic system due to the mining competition among the multiple mining pools. In this paper, we first set up a mathematical representation for the tree with multiple block branches. Then we provide a block classification of Ethereum: Regular blocks (in the main chain), orphan blocks, uncle blocks, stale blocks, and nephew blocks, and give some key probabilities of generating the different types of blocks by applying the law of large numbers. Based on this, we further discuss the growth rate of blockchain, and the reward allocation among the multiple mining pools through applying the renewal reward theorem. Finally, we use some simulation experiments to verify our theoretical results, and show that the approximate computation approaches developed, such as the key probabilities, the long-term growth rate of blockchain, and the long-term reward allocation (rate) among the multiple mining pools, can have a faster convergence. Therefore, we provide a powerful tool for observing and understanding the influence of the selfish mining attacks on the performance of Ethereum with multiple mining pools. We believe that the methodology and results developed in this paper will shed light on the study of Ethereum with multiple mining pools, such that a series of promising research can be inspired potentially.

cs.CR↗

arXiv2022

The elliptic double box and symbology beyond polylogarithms

We study the elliptic double-box integral, which contributes to generic massless QFTs and is the only contribution to a particular 10-point scattering amplitude in N=4 SYM theory. Based on a Feynman parametrization, we express this integral in terms of elliptic polylogarithms. We then study its symbol, finding a rich structure and remarkable similarity with the non-elliptic case. In particular, the first entry of the symbol is expressible in terms of logarithms of dual-conformal cross-ratios, and elliptic letters only occur in the last two entries. Moreover, the symbol makes manifest a differential equation relating the double-box integral to a 6D hexagon integral, suggesting that it can be bootstrapped based on the latter integral alone.

hep-th↗

arXiv2021

Parallel Actors and Learners: A Framework for Generating Scalable RL Implementations

Reinforcement Learning (RL) has achieved significant success in application domains such as robotics, games and health care. However, training RL agents is very time consuming. Current implementations exhibit poor performance due to challenges such as irregular memory accesses and thread-level synchronization overheads on CPU. In this work, we propose a framework for generating scalable reinforcement learning implementations on multi-core systems. Replay Buffer is a key component of RL algorithms which facilitates storage of samples obtained from environmental interactions and data sampling for the learning process. We define a new data structure for Prioritized Replay Buffer based on $K$-ary sum tree that supports asynchronous parallel insertions, sampling, and priority updates. To address the challenge of irregular memory accesses, we propose a novel data layout to store the nodes of the sum tree that reduces the number of cache misses. Additionally, we propose $\textit{lazy writing}$ mechanism to reduce thread-level synchronization overheads of the Replay Buffer operations. Our framework employs parallel actors to concurrently collect data via environmental interactions, and parallel learners to perform stochastic gradient descent using the collected data. Our framework supports a wide range of reinforcement learning algorithms including DQN, DDPG, etc. We demonstrate the effectiveness of our framework in accelerating RL algorithms by performing experiments on CPU + GPU platform using OpenAI benchmarks.

cs.LG↗

arXiv2021

Multi-Centroid Representation Network for Domain Adaptive Person Re-ID

Recently, many approaches tackle the Unsupervised Domain Adaptive person re-identification (UDA re-ID) problem through pseudo-label-based contrastive learning. During training, a uni-centroid representation is obtained by simply averaging all the instance features from a cluster with the same pseudo label. However, a cluster may contain images with different identities (label noises) due to the imperfect clustering results, which makes the uni-centroid representation inappropriate. In this paper, we present a novel Multi-Centroid Memory (MCM) to adaptively capture different identity information within the cluster. MCM can effectively alleviate the issue of label noises by selecting proper positive/negative centroids for the query image. Moreover, we further propose two strategies to improve the contrastive learning process. First, we present a Domain-Specific Contrastive Learning (DSCL) mechanism to fully explore intradomain information by comparing samples only from the same domain. Second, we propose Second-Order Nearest Interpolation (SONI) to obtain abundant and informative negative samples. We integrate MCM, DSCL, and SONI into a unified framework named Multi-Centroid Representation Network (MCRN). Extensive experiments demonstrate the superiority of MCRN over state-of-the-art approaches on multiple UDA re-ID tasks and fully unsupervised re-ID tasks.

cs.CV↗

arXiv2021

DSGPT: Domain-Specific Generative Pre-Training of Transformers for Text Generation in E-commerce Title and Review Summarization

We propose a novel domain-specific generative pre-training (DS-GPT) method for text generation and apply it to the product titleand review summarization problems on E-commerce mobile display.First, we adopt a decoder-only transformer architecture, which fitswell for fine-tuning tasks by combining input and output all to-gether. Second, we demonstrate utilizing only small amount of pre-training data in related domains is powerful. Pre-training a languagemodel from a general corpus such as Wikipedia or the CommonCrawl requires tremendous time and resource commitment, andcan be wasteful if the downstream tasks are limited in variety. OurDSGPT is pre-trained on a limited dataset, the Chinese short textsummarization dataset (LCSTS). Third, our model does not requireproduct-related human-labeled data. For title summarization task,the state of art explicitly uses additional background knowledgein training and predicting stages. In contrast, our model implic-itly captures this knowledge and achieves significant improvementover other methods, after fine-tuning on the public Taobao.comdataset. For review summarization task, we utilize JD.com in-housedataset, and observe similar improvement over standard machinetranslation methods which lack the flexibility of fine-tuning. Ourproposed work can be simply extended to other domains for a widerange of text generation tasks.

cs.CL↗