Searcharxiv⌕ Search

arXiv subjects

Chao Wang

Publications and source records attributed to Chao Wang.

At least 559 records · Page 31Linked to original sources

An Emotion-controlled Dialog Response Generation Model with Dynamic Vocabulary

In response generation task, proper sentimental expressions can obviously improve the human-like level of the responses. However, for real application in online systems, high QPS (queries per second, an indicator of the flow capacity of on-line systems) is required, and a dynamic vocabulary mechanism has been proved available in improving speed of generative models. In this paper, we proposed an emotion-controlled dialog response generation model based on the dynamic vocabulary mechanism, and the experimental results show the benefit of this model.

cs.CL↗

Securing practical quantum communication systems with optical power limiters

Controlling the energy of unauthorized light signals in a quantum cryptosystem is an essential criterion for implementation security. Here, we propose a passive optical power limiter device based on thermo-optical defocusing effects providing a reliable power limiting threshold which can be readily adjusted to suit various quantum applications. In addition, the device is robust against a wide variety of signal variations (e.g. wavelength, pulse width), which is important for implementation security. Moreover, we experimentally show that the proposed device does not compromise quantum communication signals, in that it has only a very minimal impact (if not, negligible impact) on the intensity, phase, or polarization degrees of freedom of the photon, thus making it suitable for general communication purposes. To show its practical utility for quantum cryptography, we demonstrate and discuss three potential applications: (1) measurement-device-independent quantum key distribution with enhanced security against a general class of Trojan-horse attacks, (2) using the power limiter as a countermeasure against bright illumination attacks, and (3) the application of power limiters to potentially enhance the implementation security of plug-and-play quantum key distribution.

quant-ph↗

High $J_{\rm c}$ and low anisotropy of hydrogen doped NdFeAsO superconducting thin film

The recent realisations of hydrogen doped $Ln$FeAsO ($Ln$=Nd and Sm) superconducting epitaxial thin films call for further investigation of their structural and electrical transport properties. Here, we report on the microstructure of a NdFeAs(O,H) epitaxial thin film and its temperature, field, and orientation dependencies of the resistivity and the critical current density $J_{\rm c}$. The superconducting transition temperature $T_{\rm c}$ is comparable to NdFeAs(O,F). Transmission electron microscopy investigation supported that hydrogen is homogenously substituted for oxygen. A high self-field $J_{\rm c}$ of over 10 MA/cm$^2$ was recorded at 5 K, which is likely to be caused by a short London penetration depth. The anisotropic Ginzburg-Landau scaling for the angle dependence of $J_{\rm c}$ yielded temperature-dependent scaling parameters $γ_{\rm J}$ that decreased from 1.6 at 30 K to 1.3 at 5 K. This is opposite to the behaviour of NdFeAs(O,F). Additionally, $γ_{\rm J}$ of NdFeAs(O,H) is smaller than that of NdFeAs(O,F). Our results indicate that heavily electron doping by means of hydrogen substitution for oxygen in $Ln$FeAsO is highly beneficial for achieving high $J_{\rm c}$ with low anisotropy without compromising $T_{\rm c}$, which is favourable for high-field magnet applications.

cond-mat.supr-con↗

Contrastive Unsupervised Learning for Speech Emotion Recognition

Speech emotion recognition (SER) is a key technology to enable more natural human-machine communication. However, SER has long suffered from a lack of public large-scale labeled datasets. To circumvent this problem, we investigate how unsupervised representation learning on unlabeled datasets can benefit SER. We show that the contrastive predictive coding (CPC) method can learn salient representations from unlabeled datasets, which improves emotion recognition performance. In our experiments, this method achieved state-of-the-art concordance correlation coefficient (CCC) performance for all emotion primitives (activation, valence, and dominance) on IEMOCAP. Additionally, on the MSP- Podcast dataset, our method obtained considerable performance improvements compared to baselines.

cs.SD↗

Data-Driven Synthesis of Provably Sound Side Channel Analyses

We propose a data-driven method for synthesizing a static analyzer to detect side-channel information leaks in cryptographic software. Compared to the conventional way of manually crafting such a static analyzer, which can be labor intensive, error prone and suboptimal, our learning-based technique is not only automated but also provably sound. Our analyzer consists of a set of type-inference rules learned from the training data, i.e., example code snippets annotated with ground truth. Internally, we use syntax-guided synthesis (SyGuS) to generate new features and decision tree learning (DTL) to generate type-inference rules based on these features. We guarantee soundness by formally proving each learned rule via a technique called Datalog query containment checking. We have implemented our technique in the LLVM compiler and used it to detect power side channels in C programs. Our results show that, in addition to being automated and provably sound during synthesis, the learned analyzer also has the same empirical accuracy as two state-of-the-art, manually crafted analyzers while being 300X and 900X faster, respectively.

cs.SE↗

Drug Package Recommendation via Interaction-aware Graph Induction

Recent years have witnessed the rapid accumulation of massive electronic medical records (EMRs), which highly support the intelligent medical services such as drug recommendation. However, prior arts mainly follow the traditional recommendation strategies like collaborative filtering, which usually treat individual drugs as mutually independent, while the latent interactions among drugs, e.g., synergistic or antagonistic effect, have been largely ignored. To that end, in this paper, we target at developing a new paradigm for drug package recommendation with considering the interaction effect within drugs, in which the interaction effects could be affected by patient conditions. Specifically, we first design a pre-training method based on neural collaborative filtering to get the initial embedding of patients and drugs. Then, the drug interaction graph will be initialized based on medical records and domain knowledge. Along this line, we propose a new Drug Package Recommendation (DPR) framework with two variants, respectively DPR on Weighted Graph (DPR-WG) and DPR on Attributed Graph (DPR-AG) to solve the problem, in which each the interactions will be described as signed weights or attribute vectors. In detail, a mask layer is utilized to capture the impact of patient condition, and graph neural networks (GNNs) are leveraged for the final graph induction task to embed the package. Extensive experiments on a real-world data set from a first-rate hospital demonstrate the effectiveness of our DPR framework compared with several competitive baseline methods, and further support the heuristic study for the drug package generation task with adequate performance.

cs.IR↗

Multi-Task Self-Supervised Pre-Training for Music Classification

Deep learning is very data hungry, and supervised learning especially requires massive labeled data to work well. Machine listening research often suffers from limited labeled data problem, as human annotations are costly to acquire, and annotations for audio are time consuming and less intuitive. Besides, models learned from labeled dataset often embed biases specific to that particular dataset. Therefore, unsupervised learning techniques become popular approaches in solving machine listening problems. Particularly, a self-supervised learning technique utilizing reconstructions of multiple hand-crafted audio features has shown promising results when it is applied to speech domain such as emotion recognition and automatic speech recognition (ASR). In this paper, we apply self-supervised and multi-task learning methods for pre-training music encoders, and explore various design choices including encoder architectures, weighting mechanisms to combine losses from multiple tasks, and worker selections of pretext tasks. We investigate how these design choices interact with various downstream music classification tasks. We find that using various music specific workers altogether with weighting mechanisms to balance the losses during pre-training helps improve and generalize to the downstream tasks.

cs.SD↗

The impact of $a_0^0(980)-f_0(980)$ mixing on the localized $CP$ violations of the $B^-\rightarrow K^- π^+π^-$ decay

In the framework of the QCD factorization approach, we study the localized $CP$ violations of the $B^-\rightarrow K^- π^+π^-$ decay with and without $a_0^0(980)-f_0(980)$ mixing mechanism, respectively, and find that the localized $CP$ violation can be enhanced by this mixing effect when the mass of the $π^+π^-$ pair is in the vicinity of the $f_0(980)$ resonance. The corresponding theoretical prediction results are $\mathcal{A}_{CP}(B^-\rightarrow K f_0 \rightarrow K^-π^+π^-)=[0.24, 0.36]$ and $\mathcal{A}_{CP}(B^-\rightarrow K^- f_0(a_0) \rightarrow K^-π^+π^-)=[0.33, 0.52]$, respectively. Meanwhile, we also calculate the branching fraction of the $B^-\rightarrow K^-f_0(980)\rightarrow K^-π^+π^-$ decay, which is consistent with the experimental results. We suggest that $a_0^0(980)-f_0(980)$ mixing mechanism should be considered when studying the $CP$ violation of the $B$ or $D$ mesons decays theoretically and experimentally.

hep-ph↗

Comprehensive Framework of RDMA-enabled Concurrency Control Protocols

In this paper, we develop RCC, the first unified and comprehensive RDMA-enabled distributed transaction processing framework supporting six serializable concurrency control protocols: not only the classical protocols NOWAIT, WAITDIE, and OCC, but also more advanced MVCC and SUNDIAL, and even CALVIN, the deterministic concurrency control protocol. Our goal is to unbiasedly compare the protocols in a common execution environment with the concurrency control protocol being the only changeable component. We focus on the correct and efficient implementation using key techniques, such as co-routines, outstanding requests, and doorbell batching, with two-sided and one-sided communication primitives. Based on RCC, we get the deep insights that cannot be obtained by any existing systems. Most importantly, we obtain the execution stage latency breakdowns with one-sided and two-sided primitive for each protocol, which are analyzed to develop more efficient hybrid implementations. Our results show that three hybrid designs are indeed better than both one-sided and two-sided implementations by up to 17.8%. We believe that RCC is a significant advance over the state-of-the-art; it can both provide performance insights and be used as the common infrastructure for fast prototyping new implementations.

cs.DC↗

A comprehensive study on the semileptonic decay of heavy flavor mesons

The semileptonic decay of heavy flavor mesons offers a clean environment for extraction of the Cabibbo-Kobayashi-Maskawa (CKM) matrix elements, which describes the CP-violating and flavor changing process in the Standard Model. The involved form factors where the dynamical information is encoded play an essential role in achieving any conclusive statement. That is, the knowledge of the form factors should be under good control, requiring one to examine more observables in addition to the branching fraction. In this paper, we provide the mean value and the $q^2$-dependent shape for further observables [differential decay distribution ($dΓ/dq^2$), forward-backward asymmetry ($\mathcal{A}_{FB}^l$), longitudinal ($P_L^l$) and transverse ($P_T^l$) polarization of a charged lepton, longitudinal polarization of a vector meson in the final state ($F_L^l(V)$), leptonic convexity parameter ($C_F^l$), and trigonometric moments ($W_i^l$) in the decay of $D_{(s)}$ and $B_{(s)}$ to $P/V l^+ ν_l$ ($l=e$, $μ$ or $τ$)], based on the predictions of the relevant form factors from the covariant light-front quark model. $P$ and $V$ denote the pseudoscalar and vector meson, respectively. As a comparison, we find a good agreement with the results from the covariant confining quark model and the relativistic quark model in the literature. As it has been observed that the $P_L^l$ and $F_L^l(V)$ are crucial quantities to discriminate various New Physics models, the reexamination of these observables from a different method is also essential and necessary.

hep-ph↗

A Semi-parametric Realized Joint Value-at-Risk and Expected Shortfall Regression Framework

A new realized conditional autoregressive Value-at-Risk (VaR) framework is proposed, through incorporating a measurement equation into the original quantile regression model. The framework is further extended by employing various Expected Shortfall (ES) components, to jointly estimate and forecast VaR and ES. The measurement equation models the contemporaneous dependence between the realized measure (i.e., Realized Variance and Realized Range) and the latent conditional ES. An adaptive Bayesian Markov Chain Monte Carlo method is employed for estimation and forecasting, the properties of which are assessed and compared with maximum likelihood through a simulation study. In a comprehensive forecasting study on 1% and 2.5 % quantile levels, the proposed models are compared to a range of parametric, non-parametric and semi-parametric models, based on 7 market indices and 7 individual assets. One-day-ahead VaR and ES forecasting results favor the proposed models, especially when incorporating the sub-sampled Realized Variance and the sub-sampled Realized Range in the model.

q-fin.RM↗

Realization of epitaxial thin films of the superconductor K-doped BaFe$_\text{2}$As$_\text{2}$

The iron-based superconductor Ba$_{1-x}$K$_x$Fe$_\text{2}$As$_\text{2}$ is emerging as a key material for high magnetic field applications owing to the recent developments in superconducting wires and bulk permanent magnets. Epitaxial thin films play important roles in investigating and artificially tuning physical properties; nevertheless, the synthesis of Ba$_{1-x}$K$_x$Fe$_2$As$_2$ epitaxial thin films remained challenging because of the high volatility of K. Herein, we report the successful growth of epitaxial Ba$_{1-x}$K$_x$Fe$_\text{2}$As$_\text{2}$ thin films by molecular-beam epitaxy with employing a combination of fluoride substrates (CaF$_\text{2}$, SrF$_\text{2}$, and BaF$_\text{2}$) and a low growth temperature (350$-$420$^\circ$C). Our epitaxial thin film grown on CaF$_\text{2}$ showed sharp superconducting transition at an onset critical temperature of 36 K, slightly lower than bulk crystals by ~2 K due presumably to the strain effect arising from the lattice and thermal expansion mismatch. Critical current density ($J$$_\text{c}$) determined by the magnetization hysteresis loop is as high as 2.2 MA/cm$^\text{2}$ at 4 K under self-field. In-field $J$$_\text{c}$ characteristics of the film are superior to the bulk crystals. The realization of epitaxial thin films opens opportunities for tuning superconducting properties by epitaxial strain and revealing intrinsic grain boundary transport of Ba$_{1-x}$K$_x$Fe$_\text{2}$As$_\text{2}$.

cond-mat.supr-con↗

Temporally-Continuous Probabilistic Prediction using Polynomial Trajectory Parameterization

A commonly-used representation for motion prediction of actors is a sequence of waypoints (comprising positions and orientations) for each actor at discrete future time-points. While this approach is simple and flexible, it can exhibit unrealistic higher-order derivatives (such as acceleration) and approximation errors at intermediate time steps. To address this issue we propose a simple and general representation for temporally continuous probabilistic trajectory prediction that is based on polynomial trajectory parameterization. We evaluate the proposed representation on supervised trajectory prediction tasks using two large self-driving data sets. The results show realistic higher-order derivatives and better accuracy at interpolated time-points, as well as the benefits of the inferred noise distributions over the trajectories. Extensive experimental studies based on existing state-of-the-art models demonstrate the effectiveness of the proposed approach relative to other representations in predicting the future motions of vehicle, bicyclist, and pedestrian traffic actors.

cs.CV↗

Quantum Advantage in Cryptography with a Low-Connectivity Quantum Annealer

The application in cryptography of quantum algorithms for prime factorization fostered the interest in quantum computing. However, quantum computers, and particularly quantum annealers, can also be helpful to construct secure cryptographic keys. Indeed, finding robust Boolean functions for cryptography is an important problem in sequence ciphers, block ciphers, and hash functions, among others. Due to the super-exponential size $\mathcal{O}(2^{2^n})$ of the associated space, finding $n$-variable Boolean functions with global cryptographic constraints is computationally hard. This problem has already been addressed employing generic low-connected incoherent D-Wave quantum annealers. However, the limited connectivity of the Chimera graph, together with the exponential growth in the complexity of the Boolean function design problem, limit the problem scalability. Here, we propose a special-purpose coherent quantum annealing architecture with three couplers per qubit, designed to optimally encode the bent function design problem. A coherent quantum annealer with this tree-type architecture has the potential to solve the $8$-variable bent function design problem, which is classically unsolved, with only $127$ physical qubits and $126$ couplers. This paves the way to reach useful quantum supremacy within the framework of quantum annealing for cryptographic purposes.

quant-ph↗

Nematic Antiferromagnetism and Deconfined Criticality from the Interplay between Electron-Phonon and Electron-Electron Interactions

Systems with strong electron-phonon couplings typically exhibit various forms of charge order, while strong electron-electron interactions lead to magnetism. We use determinant quantum Monte Carlo (DQMC) calculations to solve a model on a square lattice with a caricature of these interactions. In the limit where electron-electron interactions dominate it has antiferromagnetic (AF) order, while where electron-phonon coupling dominates there is columnar valence-bond solid (VBS) order. We find a novel intervening phase that hosts coexisting nematic and antiferromagnetic orders. We have also found evidence of a Landau-forbidden continuous quantum phase transition with an emergent $O(4)$ symmetry between the VBS and the nematic antiferromagnetic phases.

cond-mat.str-el↗

Attention Deep Model with Multi-Scale Deep Supervision for Person Re-Identification

In recent years, person re-identification (PReID) has become a hot topic in computer vision duo to it is an important part in intelligent surveillance. Many state-of-the-art PReID methods are attention-based or multi-scale feature learning deep models. However, introducing attention mechanism may lead to some important feature information losing issue. Besides, most of the multi-scale models embedding the multi-scale feature learning block into the feature extraction deep network, which reduces the efficiency of inference network. To address these issue, in this study, we introduce an attention deep architecture with multi-scale deep supervision for PReID. Technically, we contribute a reverse attention block to complement the attention block, and a novel multi-scale layer with deep supervision operator for training the backbone network. The proposed block and operator are only used for training, and discard in test phase. Experiments have been performed on Market-1501, DukeMTMC-reID and CUHK03 datasets. All the experiment results show that the proposed model significantly outperforms the other competitive state-of-the-art methods.

cs.CV↗

Physical Layer Security Enhancement Using Artificial Noise in Cellular Vehicle-to-Everything (C-V2X) Networks

The secure transmission of confidential information in cellular vehicle-to-everything (C-V2X) communication networks is vitally important for user's personal safety. However, for C-V2X there have not been much studies on the physical layer security (PLS). Since artificial noise (AN) and secure beamforming are popular PLS techniques for cellular communications, in this paper we investigate the potential of these PLS techniques for enhancing the security of C-V2X networks. In particular, leveraging stochastic geometry, we study the PLS of an AN assisted C-V2X network, where the locations of legitimate vehicular nodes, malicious vehicular nodes and road side units (RSUs) are modeled by Cox processes driven by a common Poisson line process (PLP), and the locations of cellular base stations (BSs) are modeled by a two-dimensional (2D) Poisson point process (PPP). Based on the maximum signal-to-interference-ratio (SIR) association scheme, we calculate the coverage probability of the network. We also derive bounds on the secrecy probability, which are validated by simulation results. Moreover, we obtain an analytical result of the effective secrecy throughput for characterizing the reliability and security of wiretap channels. Simulation results are given to validate the analytical result, and provide interesting insights into the impact of network parameters on the achievable secrecy performance. Simulation results show that a larger array antenna can provide a better robustness of the secure transmission strategy, and the optimal power allocation ratio between confidential information and AN remains almost unchanged for different numbers of antennas.

cs.IT↗

NeuroDiff: Scalable Differential Verification of Neural Networks using Fine-Grained Approximation

As neural networks make their way into safety-critical systems, where misbehavior can lead to catastrophes, there is a growing interest in certifying the equivalence of two structurally similar neural networks. For example, compression techniques are often used in practice for deploying trained neural networks on computationally- and energy-constrained devices, which raises the question of how faithfully the compressed network mimics the original network. Unfortunately, existing methods either focus on verifying a single network or rely on loose approximations to prove the equivalence of two networks. Due to overly conservative approximation, differential verification lacks scalability in terms of both accuracy and computational cost. To overcome these problems, we propose NeuroDiff, a symbolic and fine-grained approximation technique that drastically increases the accuracy of differential verification while achieving many orders-of-magnitude speedup. NeuroDiff has two key contributions. The first one is new convex approximations that more accurately bound the difference neurons of two networks under all possible inputs. The second one is judicious use of symbolic variables to represent neurons whose difference bounds have accumulated significant error. We also find that these two techniques are complementary, i.e., when combined, the benefit is greater than the sum of their individual benefits. We have evaluated NeuroDiff on a variety of differential verification tasks. Our results show that NeuroDiff is up to 1000X faster and 5X more accurate than the state-of-the-art tool.

cs.LG↗