Search arXiv⌕ Search

arXiv subjects

Tao Zhang

Publications and source records attributed to Tao Zhang.

At least 613 records · Page 34Linked to original sources

"Mask and Infill" : Applying Masked Language Model to Sentiment Transfer

This paper focuses on the task of sentiment transfer on non-parallel text, which modifies sentiment attributes (e.g., positive or negative) of sentences while preserving their attribute-independent content. Due to the limited capability of RNNbased encoder-decoder structure to capture deep and long-range dependencies among words, previous works can hardly generate satisfactory sentences from scratch. When humans convert the sentiment attribute of a sentence, a simple but effective approach is to only replace the original sentimental tokens in the sentence with target sentimental expressions, instead of building a new sentence from scratch. Such a process is very similar to the task of Text Infilling or Cloze, which could be handled by a deep bidirectional Masked Language Model (e.g. BERT). So we propose a two step approach "Mask and Infill". In the mask step, we separate style from content by masking the positions of sentimental tokens. In the infill step, we retrofit MLM to Attribute Conditional MLM, to infill the masked positions by predicting words or phrases conditioned on the context1 and target sentiment. We evaluate our model on two review datasets with quantitative, qualitative, and human evaluations. Experimental results demonstrate that our models improve state-of-the-art performance.

cs.CL↗

An Improved Evaluation of the Neutron Background in the PandaX-II Experiment

In dark matter direct detection experiments, neutron is a serious source of background, which can mimic the dark matter-nucleus scattering signals. In this paper, we present an improved evaluation of the neutron background in the PandaX-II dark matter experiment by a novel approach. Instead of fully relying on the Monte Carlo simulation, the overall neutron background is determined from the neutron-induced high energy signals in the data. In addition, the probability of producing a dark-matter-like background per neutron is evaluated with a complete Monte Carlo generator, where the correlated emission of neutron(s) and $γ$(s) in the ($α$, n) reactions and spontaneous fissions is taken into consideration. With this method, the neutron backgrounds in the Run 9 (26-ton-day) and Run 10 (28-ton-day) data sets of PandaX-II are estimated to be 0.66$\pm$0.24 and 0.47$\pm$0.25 events, respectively.

hep-ex↗

ARMIN: Towards a More Efficient and Light-weight Recurrent Memory Network

In recent years, memory-augmented neural networks(MANNs) have shown promising power to enhance the memory ability of neural networks for sequential processing tasks. However, previous MANNs suffer from complex memory addressing mechanism, making them relatively hard to train and causing computational overheads. Moreover, many of them reuse the classical RNN structure such as LSTM for memory processing, causing inefficient exploitations of memory information. In this paper, we introduce a novel MANN, the Auto-addressing and Recurrent Memory Integrating Network (ARMIN) to address these issues. The ARMIN only utilizes hidden state ht for automatic memory addressing, and uses a novel RNN cell for refined integration of memory information. Empirical results on a variety of experiments demonstrate that the ARMIN is more light-weight and efficient compared to existing memory networks. Moreover, we demonstrate that the ARMIN can achieve much lower computational overhead than vanilla LSTM while keeping similar performances. Codes are available on github.com/zoharli/armin.

cs.LG↗

Searching for Neutrino-less Double Beta Decay of $^{136}$Xe with PandaX-II Liquid Xenon Detector

We report the Neutrino-less Double Beta Decay (NLDBD) search results from PandaX-II dual-phase liquid xenon time projection chamber. The total live time used in this analysis is 403.1 days from June 2016 to August 2018. With NLDBD-optimized event selection criteria, we obtain a fiducial mass of 219 kg of natural xenon. The accumulated xenon exposure is 242 kg$\cdot$yr, or equivalently 22.2 kg$\cdot$yr of $^{136}$Xe exposure. At the region around $^{136}$Xe decay Q-value of 2458 keV, the energy resolution of PandaX-II is 4.2%. We find no evidence of NLDBD in PandaX-II and establish a lower limit for decay half-life of 2.4 $ \times 10^{23} $ yr at the 90% confidence level, which corresponds to an effective Majorana neutrino mass $m_{ββ} < (1.3 - 3.5)$ eV. This is the first NLDBD result reported from a dual-phase xenon experiment.

hep-ex↗

Data-Driven Machine Learning Techniques for Self-healing in Cellular Wireless Networks: Challenges and Solutions

For enabling automatic deployment and management of cellular networks, the concept of self-organizing network (SON) was introduced. SON capabilities can enhance network performance, improve service quality, and reduce operational and capital expenditure (OPEX/CAPEX). As an important component in SON, self-healing is defined as a network paradigm where the faults of target networks are mitigated or recovered by automatically triggering a series of actions such as detection, diagnosis and compensation. Data-driven machine learning has been recognized as a powerful tool to bring intelligence into network and to realize self-healing. However, there are major challenges for practical applications of machine learning techniques for self-healing. In this article, we first classify these challenges into five categories: 1) data imbalance, 2) data insufficiency, 3) cost insensitivity, 4) non-real-time response, and 5) multi-source data fusion. Then we provide potential technical solutions to address these challenges. Furthermore, a case study of cost-sensitive fault detection with imbalanced data is provided to illustrate the feasibility and effectiveness of the suggested solutions.

cs.NI↗

PandaX-II Constraints on Spin-Dependent WIMP-Nucleon Effective Interactions

We present PandaX-II constraints on candidate WIMP-nucleon effective interactions involving the nucleon or WIMP spin, including, in addition to standard axial spin-dependent (SD) scattering, various couplings among vector and axial currents, magnetic and electric dipole moments, and tensor interactions. The data set corresponding to a total exposure of 54-ton-days is reanalyzed to determine constraints as a function of the WIMP mass and isospin coupling. We obtain WIMP-nucleon cross section bounds of $\rm 1.6 \times 10^{-41} cm^2$ and $\rm 9.0 \times 10^{-42} cm^2$ ($90\%$ c.l.) for neutron-only SD and tensor coupling, respectively, for a mass $M_\mathrm{WIMP} \sim {\rm 40~GeV}/c^2$. The SD limits are the best currently available for $M_\mathrm{WIMP} > {\rm 40~GeV}/c^2$. We show that PandaX-II has reached a sensitivity sufficient to probe a variety of other candidate spin-dependent interactions at the weak scale.

hep-ex↗

Some extremal results on K_{s,t}-free graphs

For graphs $H$ and $F$, let $\text{ex}(n,H,F)$ be the maximum possible number of copies of $H$ in an $F$-free graph on $n$ vertices. The study of this function, which generalizes the well-known Turán number of graphs, was systematically studied by Alon and Shikhelman recently. In this paper, we show that for any $m$ and $t\ge 2m-3\ge3$, \[\text{ex}(n,K_{m},K_{2,t})=Θ(n^{\frac{3}{2}}).\] This result improves some results of Alon and Shikhelman (J. Combin. Theory Ser. B, 121:146-172, 2016). We also study the $k$-partite $K_{s,t}$-free graph, we show that for any $k\ge3$ and $t\ge(k-1)(s-1)!+1$, \[\text{ex}_{χ\le k}(n,K_{s,t})\ge\frac{k-1}{2k}n^{2-1/s}+o(n^{2-1/s}).\] Moreover, we give a new construction of $3$-partite $K_{2,2t+1}$-free graphs with many edges.

math.CO↗

Imbalanced Sentiment Classification Enhanced with Discourse Marker

Imbalanced data commonly exists in real world, espacially in sentiment-related corpus, making it difficult to train a classifier to distinguish latent sentiment in text data. We observe that humans often express transitional emotion between two adjacent discourses with discourse markers like "but", "though", "while", etc, and the head discourse and the tail discourse 3 usually indicate opposite emotional tendencies. Based on this observation, we propose a novel plug-and-play method, which first samples discourses according to transitional discourse markers and then validates sentimental polarities with the help of a pretrained attention-based model. Our method increases sample diversity in the first place, can serve as a upstream preprocessing part in data augmentation. We conduct experiments on three public sentiment datasets, with several frequently used algorithms. Results show that our method is found to be consistently effective, even in highly imbalanced scenario, and easily be integrated with oversampling method to boost the performance on imbalanced sentiment classification.

cs.CL↗

Profile and Globe Tests of Mean Surfaces for Two-Sample Bivariate Functional Data

Multivariate functional data has received considerable attention but testing for equality of mean surfaces and its profile has limited progress. The existing literature has tested equality of either mean curves of univariate functional samples directly, or mean surfaces of bivariate functional data samples but turn into functional curves comparison again. In this paper, we aim to develop both the profile and globe tests of mean surfaces for two-sample bivariate functional data. We present valid approaches of tests by employing the idea of pooled projection and by developing a novel profile functional principal component analysis tool. The proposed methodology enjoys the merit of readily interpretability and implementation. Under mild conditions, we derive the asymptotic behaviors of test statistics under null and alternative hypotheses. Simulations show that the proposed tests have a good control of the type I error by the size and can detect difference in mean surfaces and its profile effectively in terms of power in finite samples. Finally, we apply the testing procedures to two real data sets associated with the precipitation change affected jointly by time and locations in the Midwest of USA, and the trends in human mortality from European period life tables.

stat.ME↗

SEGAN: Structure-Enhanced Generative Adversarial Network for Compressed Sensing MRI Reconstruction

Generative Adversarial Networks (GANs) are powerful tools for reconstructing Compressed Sensing Magnetic Resonance Imaging (CS-MRI). However most recent works lack exploration of structure information of MRI images that is crucial for clinical diagnosis. To tackle this problem, we propose the Structure-Enhanced GAN (SEGAN) that aims at restoring structure information at both local and global scale. SEGAN defines a new structure regularization called Patch Correlation Regularization (PCR) which allows for efficient extraction of structure information. In addition, to further enhance the ability to uncover structure information, we propose a novel generator SU-Net by incorporating multiple-scale convolution filters into each layer. Besides, we theoretically analyze the convergence of stochastic factors contained in training process. Experimental results show that SEGAN is able to learn target structure information and achieves state-of-the-art performance for CS-MRI reconstruction.

cs.CV↗

On the nonexistence of linear perfect Lee codes

In 1968, Golomb and Welch conjectured that there does not exist perfect Lee code in $\mathbb{Z}^{n}$ with radius $r\ge2$ and dimension $n\ge3$. Besides its own interest in coding theory and discrete geometry, this conjecture is also strongly related to the degree-diameter problems of abelian Cayley graphs. Although there are many papers on this topic, the Golomb-Welch conjecture is far from being solved. In this paper, we prove the nonexistence of linear perfect Lee codes by introducing some new algebraic methods. Using these new methods, we show the nonexistence of linear perfect Lee codes of radii $r=2,3$ in $\mathbb{Z}^n$ for infinitely many values of the dimension $n$. In particular, there does not exist linear perfect Lee codes of radius $2$ in $\mathbb{Z}^n$ for all $3\le n\le 100$ except 8 cases.

math.CO↗

Game-Theoretic Analysis of Cyber Deception: Evidence-Based Strategies and Dynamic Risk Mitigation

Deception is a technique to mislead human or computer systems by manipulating beliefs and information. For the applications of cyber deception, non-cooperative games become a natural choice of models to capture the adversarial interactions between the players and quantitatively characterizes the conflicting incentives and strategic responses. In this chapter, we provide an overview of deception games in three different environments and extend the baseline signaling game models to include evidence through side-channel knowledge acquisition to capture the information asymmetry, dynamics, and strategic behaviors of deception. We analyze the deception in binary information space based on a signaling game framework with a detector that gives off probabilistic evidence of the deception when the sender acts deceptively. We then focus on a class of continuous one-dimensional information space and take into account the cost of deception in the signaling game. We finally explore the multi-stage incomplete-information Bayesian game model for defensive deception for advanced persistent threats (APTs). We use the perfect Bayesian Nash equilibrium (PBNE) as the solution concept for the deception games and analyze the strategic equilibrium behaviors for both the deceivers and the deceivees.

cs.CR↗

Acceleration of the NVT-flash calculation for multicomponent mixtures using deep neural network models

Phase equilibrium calculation, also known as flash calculation, has been extensively applied in petroleum engineering, not only as a standalone application for separation process but also an integral component of compositional reservoir simulation. It is of vital importance to accelerate flash calculation without much compromise in accuracy and reliability, turning it into an active research topic in the last two decades. In this study, we establish a deep neural network model to approximate the iterative NVT-flash calculation. A dynamic model designed for NVT flash problems is iteratively solved to produce data for training the neural network. In order to test the model's capacity to handle complex fluid mixtures, three real reservoir fluids are investigated, including one Bakken oil and two Eagle Ford oils. Compared to previous studies that follow the conventional flash framework in which stability testing precedes phase splitting calculation, we incorporate stability test and phase split calculation together and accomplish both two steps by a single deep learning model. The trained model is able to identify the single vapor, single liquid and vapor-liquid state under the subcritical region of the investigated fluids. A number of examples are presented to show the accuracy and efficiency of the proposed deep neural network. It is found that the trained model makes predictions at most 244 times faster than the iterative flash calculation under the given cases. Even though training a multi-level network model does take a large amount of time that is comparable to the computational time of flash calculations, the one-time offline training process gives the deep learning model great potential to speed up compositional reservoir simulation.

physics.comp-ph↗

Single MR Image Super-Resolution via Channel Splitting and Serial Fusion Network

Spatial resolution is a critical imaging parameter in magnetic resonance imaging (MRI). Acquiring high resolution MRI data usually takes long scanning time and would subject to motion artifacts due to hardware, physical, and physiological limitations. Single image super-resolution (SISR), especially that based on deep learning techniques, is an effective and promising alternative technique to improve the current spatial resolution of magnetic resonance (MR) images. However, the deeper network is more difficult to be effectively trained because the information is gradually weakened as the network deepens. This problem becomes more serious for medical images due to the degradation of training examples. In this paper, we present a novel channel splitting and serial fusion network (CSSFN) for single MR image super-resolution. Specifically, the proposed CSSFN network splits the hierarchical features into a series of subfeatures, which are then integrated together in a serial manner. Thus, the network becomes deeper and can deal with the subfeatures on different channels discriminatively. Besides, a dense global feature fusion (DGFF) is adopted to integrate the intermediate features, which further promotes the information flow in the network. Extensive experiments on several typical MR images show the superiority of our CSSFN model over other advanced SISR methods.

cs.CV↗

Laser Calibration System in JUNO

A UV laser calibration system is developed for the Jiangmen Underground Neutrino Observatory (JUNO), a 20-kton liquid scintillator-based, long baseline reactor anti-neutrino experiment. This system is capable of delivering fast laser pulses (<1 ns) into the detector with a photon intensity ranging from hundreds of keV to a few TeV equivalent energy. An independent intensity monitoring system is developed for this laser, which has achieved a < 0.3% relative uncertainty. Such a system will be used to calibrate the response of the JUNO photosensors and electronics in situ to a sub-percent precision.

physics.ins-det↗

$3D$ Crystal Image Analysis based on Fast Synchrosqueezed Transforms

We propose an efficient algorithm to analyze $3D$ atomic resolution crystal images based on a fast $3D$ synchrosqueezed wave packet transform. The proposed algorithm can automatically extract microscopic information from $3D$ atomic resolution crystal images, e.g., crystal orientation, defects, and deformation, which are important information for characterizing material properties. The effectiveness of our algorithms is illustrated by experiments of synthetic datasets and real $3$D microscopic colloidal images.

math.NA↗

Dynamics of cold pulses induced by super-sonic molecular beam injection in the EAST tokamak

Evolution of electron temperature, electron density and its fluctuation with high spatial and temporal resolutions are presented for the cold pulse propagation induced by super-sonic molecular beam injection (SMBI) in ohmic plasmas in the EAST tokamak. The non-local heat transport occurs for discharges with plasma current $I_p$=450 kA ($q_{95}\sim5.55$), and electron density $n_{e0}$ below a critical value of $(1.35\pm0.25)\times10^{19}~\mathrm{m^{-3}}$. In contrary to the response of core electron temperature and electron density (roughly 10 ms after SMBI), the electron density fluctuation in the plasma core increases promptly after SMBI and reaches its maximum around 15 ms after SMBI. The electron density fluctuation in the plasma core begins to decrease before the core electron temperature reaches its maximum (roughly 30 ms). It was also observed that the turbulence perpendicular velocity close to the inversion point of the temperature perturbation changes sign after SMBI.

physics.plasm-ph↗

A Game-Theoretic Foundation of Deception: Knowledge Acquisition and Fundamental Limits

Deception is a technique to mislead human or computer systems by manipulating beliefs and information. Successful deception is characterized by the information-asymmetric, dynamic, and strategic behaviors of the deceiver and the deceivee. This paper proposes a game-theoretic framework of a deception game to model the strategic behaviors of the deceiver and deceivee and construct strategies for both attacks and defenses over a continuous one-dimensional information space. We use the signaling game model to capture the information-asymmetric, dynamic, and strategic behaviors of deceptions by modeling the deceiver as a privately-informed player called sender and the deceivee as an uninformed player called receiver. We characterize perfect Bayesian Nash equilibrium (PBNE) solution of the game and study the deceivability. We highlight the condition of deceivee's knowledge enhancement through evidences to maintain the equilibrium and analyze the impacts of direct deception costs and players' conflict of interest on the deceivability.

cs.CR↗