arXiv subjects

Chao Wang

Publications and source records attributed to Chao Wang.

At least 667 records · Page 37Linked to original sources

arXiv2018

R-CRNN: Region-based Convolutional Recurrent Neural Network for Audio Event Detection

This paper proposes a Region-based Convolutional Recurrent Neural Network (R-CRNN) for audio event detection (AED). The proposed network is inspired by Faster-RCNN, a well known region-based convolutional network framework for visual object detection. Different from the original Faster-RCNN, a recurrent layer is added on top of the convolutional network to capture the long-term temporal context from the extracted high level features. While most of the previous works on AED generate predictions at frame level first, and then use post-processing to predict the onset/offset timestamps of events from a probability sequence; the proposed method generates predictions at event level directly and can be trained end-to-end with a multitask loss, which optimizes the classification and localization of audio events simultaneously. The proposed method is tested on DCASE 2017 Challenge dataset. To the best of our knowledge, R-CRNN is the best performing single-model method among all methods without using ensembles both on development and evaluation sets. Compared to the other region-based network for AED (R-FCN) with an event-based error rate (ER) of 0.18 on the development set, our method reduced the ER to half.

cs.SD↗

arXiv2018

A simple model for detection of rare sound events

We propose a simple recurrent model for detecting rare sound events, when the time boundaries of events are available for training. Our model optimizes the combination of an utterance-level loss, which classifies whether an event occurs in an utterance, and a frame-level loss, which classifies whether each frame corresponds to the event when it does occur. The two losses make use of a shared vectorial representation the event, and are connected by an attention mechanism. We demonstrate our model on Task 2 of the DCASE 2017 challenge, and achieve competitive performance.

cs.SD↗

arXiv2018

Information-Directed Random Walk for Rare Event Detection in Hierarchical Processes

The problem of detecting a few anomalous processes among a large number of data streams is considered. At each time, aggregated observations can be taken from a chosen subset of the processes, where the chosen subset conforms to a given tree structure. The random observations are drawn from a general distribution that may depend on the size of the chosen subset and the number of anomalous processes in the subset. We propose a sequential search strategy by devising an information-directed random walk (IRW) on the tree-structured observation hierarchy. Subject to a reliability constraint, the proposed policy is shown to be asymptotically optimal with respect to the detection accuracy. Furthermore, it achieves the optimal logarithmic-order sample complexity with respect to the size of the search space provided that the Kullback-Leibler divergence between aggregated observations in the presence and the absence of anomalous processes are bounded away from zero at all levels of the tree structure as the size of the search space approaches infinity. Sufficient conditions on the decaying rate of the aggregated observations to pure noise under which a sublinear scaling in the size of the search space is preserved are also identified for the Bernoulli case.

cs.IT↗

arXiv2018

Discriminative Region Proposal Adversarial Networks for High-Quality Image-to-Image Translation

Image-to-image translation has been made much progress with embracing Generative Adversarial Networks (GANs). However, it's still very challenging for translation tasks that require high quality, especially at high-resolution and photorealism. In this paper, we present Discriminative Region Proposal Adversarial Networks (DRPAN) for high-quality image-to-image translation. We decompose the procedure of image-to-image translation task into three iterated steps, first is to generate an image with global structure but some local artifacts (via GAN), second is using our DRPnet to propose the most fake region from the generated image, and third is to implement "image inpainting" on the most fake region for more realistic result through a reviser, so that the system (DRPAN) can be gradually optimized to synthesize images with more attention on the most artifact local part. Experiments on a variety of image-to-image translation tasks and datasets validate that our method outperforms state-of-the-arts for producing high-quality translation results in terms of both human perceptual studies and automatic quantitative measures.

cs.CV↗

arXiv2018

Phases of a phenomenological model of twisted bilayer graphene

We propose a lattice scale two-band generalized Hubbard model as a caricature of the electronic structure of twisted bilayer graphene. Various possible broken symmetry phases can arise, including a nematic phase (which is a form of orbital ferromagnet) and an orbital-triplet spin-singlet superconducting phase. Concerning the mechanism of superconductivity -- we propose an analogy with superconductivity in alkali-doped C$_{60}$ in which a violation of Hund's first rule plays a central role.

cond-mat.supr-con↗

arXiv2018

Eliminating Timing Side-Channel Leaks using Program Repair

We propose a method, based on program analysis and transformation, for eliminating timing side channels in software code that implements security-critical applications. Our method takes as input the original program together with a list of secret variables (e.g., cryptographic keys, security tokens, or passwords) and returns the transformed program as output. The transformed program is guaranteed to be functionally equivalent to the original program and free of both instruction- and cache-timing side channels. Specifically, we ensure that the number of CPU cycles taken to execute any path is independent of the secret data, and the cache behavior of memory accesses, in terms of hits and misses, is independent of the secret data. We have implemented our method in LLVM and validated its effectiveness on a large set of applications, which are cryptographic libraries with 19,708 lines of C/C++ code in total. Our experiments show the method is both scalable for real applications and effective in eliminating timing side channels.

cs.CR↗

arXiv2018

Datalog-based Scalable Semantic Diffing of Concurrent Programs

When an evolving program is modified to address issues related to thread synchronization, there is a need to confirm the change is correct, i.e., it does not introduce unexpected behavior. However, manually comparing two programs to identify the semantic difference is labor intensive and error prone, whereas techniques based on model checking are computationally expensive. To fill the gap, we develop a fast and approximate static analysis for computing synchronization differences of two programs. The method is fast because, instead of relying on heavy-weight model checking techniques, it leverages a polynomial-time Datalog-based program analysis framework to compute differentiating data-flow edges, i.e., edges allowed by one program but not the other. Although approximation is used our method is sufficiently accurate due to careful design of the Datalog inference rules and iterative increase of the required data-flow edges for representing a difference. We have implemented our method and evaluated it on a large number of multithreaded C programs to confirm its ability to produce, often within seconds, the same differences obtained by human; in contrast, prior techniques based on model checking take minutes or even hours and thus can be 10x to 1000x slower.

cs.SE↗

arXiv2018

Adversarial Symbolic Execution for Detecting Concurrency-Related Cache Timing Leaks

The timing characteristics of cache, a high-speed storage between the fast CPU and the slowmemory, may reveal sensitive information of a program, thus allowing an adversary to conduct side-channel attacks. Existing methods for detecting timing leaks either ignore cache all together or focus only on passive leaks generated by the program itself, without considering leaks that are made possible by concurrently running some other threads. In this work, we show that timing-leak-freedom is not a compositional property: a program that is not leaky when running alone may become leaky when interleaved with other threads. Thus, we develop a new method, named adversarial symbolic execution, to detect such leaks. It systematically explores both the feasible program paths and their interleavings while modeling the cache, and leverages an SMT solver to decide if there are timing leaks. We have implemented our method in LLVM and evaluated it on a set of real-world ciphers with 14,455 lines of C code in total. Our experiments demonstrate both the efficiency of our method and its effectiveness in detecting side-channel leaks.

cs.CR↗

arXiv2018

CANAL: A Cache Timing Analysis Framework via LLVM Transformation

A unified modeling framework for non-functional properties of a program is essential for research in software analysis and verification, since it reduces burdens on individual researchers to implement new approaches and compare existing approaches. We present CANAL, a framework that models the cache behaviors of a program by transforming its intermediate representation in the LLVM compiler. CANAL inserts auxiliary variables and instructions over these variables, to allow standard verification tools to handle a new class of cache related properties, e.g., for computing the worst-case execution time and detecting side-channel leaks. We demonstrate the effectiveness of CANAL using three verification tools: KLEE, SMACK and Crab-llvm. We confirm the accuracy of our cache model by comparing with CPU cycle-accurate simulation results of GEM5. CANAL is available on GitHub and YouTube.

cs.SE↗

arXiv2018

Minimal surfaces in the three dimensional sphere with high symmetry

Using the Lawson's existence theorem of minimal surfaces and the symmetries of the Hopf fibration, we will construct symmetric embedded closed minimal surfaces in the three dimensional sphere. These surfaces contain the Clifford torus, the Lawson's minimal surfaces, and seven new minimal surfaces with genera 9, 25, 49, 121, 121, 361 and 841. We will also discuss the relation between such surfaces and the maximal extendable group actions on subsurfaces of the three dimensional sphere.

math.GT↗

arXiv2018

A Hybrid Reconstruction Approach for Absorption Coefficient by Fluorescence Photoacoustic Tomography

In this paper, we propose a hybrid method to reconstruct the absorption coefficient by fluorescence photoacoustic tomography (FPAT), which combines a squeeze iterative method (SIM) and a nonlinear optimization method. The SIM is to use two monotonic sequences to squeeze the exact coefficient, and it quickly locates near the exact coefficient. The nonlinear optimization method is utilized to attain a higher accuracy. The hybrid method inherits the advantages of each method with higher accuracy and faster convergence. The hybrid reconstruction method is also suitable for multi-measurement. Numerical experiments show that the hybrid method converges faster than the optimization method in multi-measurement case, and that the accuracy is also higher in one-measurement case.

math.NA↗

arXiv2018

Gapless spin liquid ground state of spin-1/2 $J_1$-$J_2$ Heisenberg model on square lattices

The spin-1/2 $J_1$-$J_2$ Heisenberg model on square lattices are investigated via the finite projected entangled pair states (PEPS) method. Using the recently developed gradient optimization method combining with Monte Carlo sampling techniques, we are able to obtain the ground states energies that are competitive to the best results. The calculations show that there is no Néel order, dimer order and plaquette order in the region of 0.42 $\lesssim J_2/J_1\lesssim$ 0.6, suggesting a single spin liquid phase in the intermediate region. Furthermore, the calculated staggered spin, dimer and plaquette correlation functions all have power law decay behaviours, which provide strong evidences that the intermediate nonmagnetic phase is a single gapless spin liquid state.

cond-mat.str-el↗

arXiv2018

PEPS++: Towards Extreme-scale Simulations of Strongly Correlated Quantum Many-particle Models on Sunway TainhuLight

The study of strongly frustrated magnetic systems has drawn great attentions from both theoretical and experimental physics. Efficient simulations of these models are essential for understanding their exotic properties. Here we present PEPS++, a novel computational paradigm for simulating frustrated magnetic systems and other strongly correlated quantum many-body systems. PEPS++ can accurately solve these models at the extreme scale with low cost and high scalability on modern heterogeneous supercomputers. We implement PEPS++ on Sunway TaihuLight based on a carefully designed tensor computation library for manipulating high-rank tensors and optimize it by invoking various high-performance matrix and tensor operations. By solving a 2D strongly frustrated $J_1$-$J_2$ model with over ten million cores, PEPS++ demonstrates the capability of simulating strongly correlated quantum many-body problems at unprecedented scales with accuracy and time-to-solution far beyond the previous state of the art.

cond-mat.str-el↗

arXiv2018

Practical gigahertz quantum key distribution robust against channel disturbance

Quantum key distribution (QKD) provides an attractive solution for secure communication. However, channel disturbance severely limits its application when a QKD system is transfered from the laboratory to the field. Here, a high-speed Faraday-Sagnac-Michelson QKD system is proposed that can automatically compensate for the channel polarization disturbance, which largely avoids the intermittency limitations of environment mutation. Over a 50-km fiber channel with 30-Hz polarization scrambling, the practicality of this phase-coding QKD system was characterized with an interference fringe visibility of 99:35% over 24 hours, and a stable secure key rate of 306k bits/s over 7 days without active polarization alignment.

quant-ph↗

arXiv2018

Semi-parametric Dynamic Asymmetric Laplace Models for Tail Risk Forecasting, Incorporating Realized Measures

The joint Value at Risk (VaR) and expected shortfall (ES) quantile regression model of Taylor (2017) is extended via incorporating a realized measure, to drive the tail risk dynamics, as a potentially more efficient driver than daily returns. Both a maximum likelihood and an adaptive Bayesian Markov Chain Monte Carlo method are employed for estimation, whose properties are assessed and compared via a simulation study; results favour the Bayesian approach, which is subsequently employed in a forecasting study of seven market indices and two individual assets. The proposed models are compared to a range of parametric, non-parametric and semi-parametric models, including GARCH, Realized-GARCH and the joint VaR and ES quantile regression models in Taylor (2017). The comparison is in terms of accuracy of one-day-ahead Value-at-Risk and Expected Shortfall forecasts, over a long forecast sample period that includes the global financial crisis in 2007-2008. The results favor the proposed models incorporating a realized measure, especially when employing the sub-sampled Realized Variance and the sub-sampled Realized Range.

q-fin.RM↗

arXiv2018

Electromagnetic form factors of $Λ_c$ in the Bethe-Salpeter equation approach

We study the electromagnetic form factors (EMFFs) of $Λ_c$ and the quark and diquark current contributes to the EMFFs of $Λ_c$ in the space-like (SL) region in the Bethe-Salpeter equation approach. In this picture, the heavy baryon $Λ_c $ is regarded as composed of a heavy quark and a scalar diquark. We find that for different values of parameters the quark and diquark current contribute to the EMFFs of $Λ_c$ is very different, but the total contribute to the EMFFs of $Λ_c$ is similarly. The EMFFs of $Λ_c$ are similar to those of other baryons (proton, $Ξ^-$, $Σ^+$) with a peak at $ω=1$ ($ω=v^\prime \cdot v $ is the velocity transfer between the initial state (with velocity $v$) and the final state (with velocity $v^\prime$) of $Λ_c$).

hep-ph↗

arXiv2018

Weak Lensing Study in VOICE Survey II: Shear Bias Calibrations

The VST Optical Imaging of the CDFS and ES1 Fields (VOICE) Survey is proposed to obtain deep optical $ugri$ imaging of the CDFS and ES1 fields using the VLT Survey Telescope (VST). At present, the observations for the CDFS field have been completed, and comprise in total about 4.9 deg$^2$ down to $r_\mathrm{AB}$$\sim$26 mag. In the companion paper by Fu et al. (2018), we present the weak lensing shear measurements for $r$-band images with seeing $\le$ 0.9 arcsec. In this paper, we perform image simulations to calibrate possible biases of the measured shear signals. Statistically, the properties of the simulated point spread function (PSF) and galaxies show good agreements with those of observations. The multiplicative bias is calibrated to reach an accuracy of $\sim$3.0%. We study the bias sensitivities to the undetected faint galaxies and to the neighboring galaxies. We find that undetected galaxies contribute to the multiplicative bias at the level of $\sim$0.3%. Further analysis shows that galaxies with lower signal-to-noise ratio (SNR) are impacted more significantly because the undetected galaxies skew the background noise distribution. For the neighboring galaxies, we find that although most have been rejected in the shape measurement procedure, about one third of them still remain in the final shear sample. They show a larger ellipticity dispersion and contribute to $\sim$0.2% of the multiplicative bias. Such a bias can be removed by further eliminating these neighboring galaxies. But the effective number density of the galaxies can be reduced considerably. Therefore efficient methods should be developed for future weak lensing deep surveys.

astro-ph.CO↗

arXiv2018

Reply to "Comment on 'Modified quantum-speed-limit bounds for open quantum dynamics in quantum channels'"

The authors of the comment[Phys. Rev. A 97, 046101 (2018)] raise that the inconsistency in calculating some common quantum-speed-limit (QSL) bounds, which is presented in our paper [Phys. Rev. A 95, 052118 (2017)], does not exist in their paper [Phys. Rev. A 94, 052125 (2016)]. Therefore they insist that their criticism to some QSL bounds is still valid. We demonstrate all the QSL bounds mentioned in the comment are similar in essence. We also show the inconsistency which is presented in their original paper can not be used to support their criticism. Furthermore, we exhibit although the inconsistency presented in our paper is not a same one to which is presented by the authors of the comment, it exists and be unavoidable in their example. Accordingly, we believe the result in our paper is usable in numerical calculations.

quant-ph↗