arXiv subjects

Chao Wang

Publications and source records attributed to Chao Wang.

At least 721 records · Page 40Linked to original sources

arXiv2017

Charmless $B_{(s)}\to VV$ Decays in Factorization-Assisted Topological-Amplitude Approach

Within the factorization-assisted topological-amplitude approach, we studied the 33 charmless $B_{(s)} \to VV$ decays, where $V$ stands for a light vector meson. According to the flavor flows, the amplitude of each process can be decomposed into 8 different topologies. In contrast to the conventional flavor diagrammatic approach, we further factorize each topological amplitude into decay constant, form factors and unknown universal parameters. By $χ^2$ fitting 46 experimental observables, we extracted 10 theoretical parameters with $χ^2$ per degree of freedom around 2. Using the fitted parameters, we calculated the branching fractions, polarization fractions, CP asymmetries and relative phases between polarization amplitudes of each decay mode. The decay channels dominated by tree diagram have large branching fractions and large longitudinal polarization fraction. The branching fractions and longitudinal polarization fractions of color-suppressed decays become smaller. Current experimental data of large transverse polarization fractions in the penguin dominant decay channels can be explained by only one transverse amplitude of penguin annihilation diagram. Our predictions of those not yet measured channels can be tested in the ongoing LHCb experiment and the Belle-II experiment in future.

hep-ph↗

arXiv2016

Bayesian Semi-parametric Realized-CARE Models for Tail Risk Forecasting Incorporating Realized Measures

A new model framework called Realized Conditional Autoregressive Expectile (Realized-CARE) is proposed, through incorporating a measurement equation into the conventional CARE model, in a manner analogous to the Realized-GARCH model. Competing realized measures (e.g. Realized Variance and Realized Range) are employed as the dependent variable in the measurement equation and to drive expectile dynamics. The measurement equation here models the contemporaneous dependence between the realized measure and the latent conditional expectile. We also propose employing the quantile loss function as the target criterion, instead of the conventional violation rate, during the expectile level grid search. For the proposed model, the usual search procedure and asymmetric least squares (ALS) optimization to estimate the expectile level and CARE parameters proves challenging and often fails to convergence. We incorporate a fast random walk Metropolis stochastic search method, combined with a more targeted grid search procedure, to allow reasonably fast and improved accuracy in estimation of this level and the associated model parameters. Given the convergence issue, Bayesian adaptive Markov Chain Monte Carlo methods are proposed for estimation, whilst their properties are assessed and compared with ALS via a simulation study. In a real forecasting study applied to 7 market indices and 2 individual asset returns, compared to the original CARE, the parametric GARCH and Realized-GARCH models, one-day-ahead Value-at-Risk and Expected Shortfall forecasting results favor the proposed Realized-CARE model, especially when incorporating the Realized Range and the sub-sampled Realized Range as the realized measure in the model.

q-fin.RM↗

arXiv2016

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

The heavy baryon $Λ_b $ is regarded as composed of a heavy quark and a scalar diquark which has good spin and isospin quantum numbers. In this picture, we calculate the electromagnetic (EM) form factors of $Λ_b$ in the Bethe-Salpeter equation approach. We find that the shapes of the EM form factors of $Λ_b$ are similar to those of $Λ$, which have a peak at about $ω=1$, but the amplitudes are much smaller than those of $Λ$.

hep-ph↗

arXiv2016

Quark chiral condensate from the overlap quark propagator

From the overlap lattice quark propagator calculated in the Landau gauge, we determine the quark chiral condensate by fitting operator product expansion formulas to the lattice data. The quark propagators are computed on domain wall fermion configurations generated by the RBC-UKQCD Collaborations with $N_f=2+1$ flavors. Three ensembles with different light sea quark masses are used at one lattice spacing $1/a=1.75(4)$ GeV. We obtain $\langle\barψψ\rangle^{\overline{\rm MS}}(2\mbox{ GeV})=(-305(15)(21)\mbox{ MeV})^3$ in the SU(2) chiral limit.

hep-lat↗

arXiv2016

Elliptic estimates for Dirichlet-Neumann operator on a corner domain

We consider the elliptic estimates for Dirichlet-Neumann operator related to the water-wave problem on a two-dimensional corner domain in this paper. Due to the singularity of the boundary, there will be singular parts in the solution of the elliptic problem for D-N operator. To begin with, we study elliptic problems with mixed boundary condition to derive singularity decompositions and estimates. Based on the analysis, we present the estimates for both D-N operator and its shape derivative with the existence of singular parts.

math.AP↗

arXiv2016

Impact of Artificial Noise on Cellular Networks: A Stochastic Geometry Approach

This paper studies the impact of artificial noise (AN) on the secrecy performance of a target cell in multi-cell cellular networks. Although AN turns out to be an efficient approach for securing a pointto-point/single cell confidential transmission, it would increase the inter-cell interference in a multi-cell cellular network, which may degrade the network reliability and secrecy performance. For analyzing the average secrecy performance of the target cell which is of significant interest, we employ a hybrid cellular deployment model, where the target cell is a circle of fixed size and the base stations (BSs) outside the target cell are modeled as a homogeneous Poisson point process (PPP). We investigate the impact of AN on the reliability and security of users in the target cell in the presence of pilot contamination using a stochastic geometry approach. The analytical results of the average connection outage and the secrecy outage of its cellular user (CU) in the target cell are given, which facilitates the evaluation of the average secrecy throughput of a randomly chosen CU in the target cell. It shows that with an optimized power allocation between the desired signals and AN, the AN scheme is an efficient solution for securing the communications in a multi-cell cellular network.

cs.IT↗

arXiv2016

Polarization basis tracking scheme for quantum key distribution with revealed sifted key bits

Calibration of the polarization basis between the transmitter and receiver is an important task in quantum key distribution (QKD). An effective polarization-basis tracking scheme will decrease the quantum bit error rate (QBER) and improve the efficiency of a polarization encoding QKD system. In this paper, we proposed a polarization-basis tracking scheme using only unveiled sifted key bits while performing error correction by legitimate users, rather than introducing additional reference light or interrupting the transmission of quantum signals. A polarization-encoding fiber BB84 QKD prototype was developed to examine the validity of this scheme. An average QBER of 2.32% and a standard derivation of 0.87% have been obtained during 24 hours of continuous operation.

quant-ph↗

arXiv2016

Multi-Agent Continuous Transportation with Online Balanced Partitioning

We introduce the concept of continuous transportation task to the context of multi-agent systems. A continuous transportation task is one in which a multi-agent team visits a number of fixed locations, picks up objects, and delivers them to a final destination. The goal is to maximize the rate of transportation while the objects are replenished over time. Examples of problems that need continuous transportation are foraging, area sweeping, and first/last mile problem. Previous approaches typically neglect the interference and are highly dependent on communications among agents. Some also incorporate an additional reconnaissance agent to gather information. In this paper, we present a hybrid of centralized and distributed approaches that minimize the interference and communications in the multi-agent team without the need for a reconnaissance agent. We contribute two partitioning-transportation algorithms inspired by existing algorithms, and contribute one novel online partitioning-transportation algorithm with information gathering in the multi-agent team. Our algorithms have been implemented and tested extensively in the simulation. The results presented in this paper demonstrate the effectiveness of our algorithms that outperform the existing algorithms, even without any communications between the agents and without the presence of a reconnaissance agent.

cs.MA↗

arXiv2016

CNNLab: a Novel Parallel Framework for Neural Networks using GPU and FPGA-a Practical Study with Trade-off Analysis

Designing and implementing efficient, provably correct parallel neural network processing is challenging. Existing high-level parallel abstractions like MapReduce are insufficiently expressive while low-level tools like MPI and Pthreads leave ML experts repeatedly solving the same design challenges. However, the diversity and large-scale data size have posed a significant challenge to construct a flexible and high-performance implementation of deep learning neural networks. To improve the performance and maintain the scalability, we present CNNLab, a novel deep learning framework using GPU and FPGA-based accelerators. CNNLab provides a uniform programming model to users so that the hardware implementation and the scheduling are invisible to the programmers. At runtime, CNNLab leverages the trade-offs between GPU and FPGA before offloading the tasks to the accelerators. Experimental results on the state-of-the-art Nvidia K40 GPU and Altera DE5 FPGA board demonstrate that the CNNLab can provide a universal framework with efficient support for diverse applications without increasing the burden of the programmers. Moreover, we analyze the detailed quantitative performance, throughput, power, energy, and performance density for both approaches. Experimental results leverage the trade-offs between GPU and FPGA and provide useful practical experiences for the deep learning research community.

cs.LG↗

arXiv2016

Embedding surfaces into $S^3$ with maximum symmetry

We restrict our discussion to the orientable category. For $g > 1$, let $OE_g$ be the maximum order of a finite group $G$ acting on the closed surface $Σ_g$ of genus $g$ which extends over $(S^3, Σ_g)$, where the maximum is taken over all possible embeddings $Σ_g\hookrightarrow S^3$. We will determine $OE_g$ for each $g$, indeed the action realizing $OE_g$. In particular, with 23 exceptions, $OE_g$ is $4(g+1)$ if $g\ne k^2$ or $4(\sqrt{g}+1)^2$ if $g=k^2$, and moreover $OE_g$ can be realized by unknotted embeddings for all $g$ except for $g=21$ and $481$.

math.GT↗

arXiv2016

Non-Markovian property of afterpulsing effect in single-photon avalanche detector

The single-photon avalanche photodiode(SPAD) has been widely used in research on quantum optics. The afterpulsing effect, which is an intrinsic character of SPAD, affects the system performance in most experiments and needs to be carefully handled. For a long time, afterpulsing has been presumed to be determined by the pre-ignition avalanche. We studied the afterpulsing effect of a commercial InGaAs/InP SPAD (The avalanche photodiode model is: Princeton Lightwave PGA-300) and demonstrated that its afterpulsing is non-Markovian, with a memory effect in the avalanching history. Theoretical analysis and experimental results clearly indicate that the embodiment of this memory effect is the afterpulsing probability, which increases as the number of ignition-avalanche pulses increase. This conclusion makes the principle of the afterpulsing effect clearer and is instructive to the manufacturing processes and afterpulsing evaluation of high-count-rate SPADs. It can also be regarded as a fundamental premise to handle the afterpulsing signals in many applications, such as quantum communication and quantum random number generation.

physics.ins-det↗

arXiv2016

DLAU: A Scalable Deep Learning Accelerator Unit on FPGA

As the emerging field of machine learning, deep learning shows excellent ability in solving complex learning problems. However, the size of the networks becomes increasingly large scale due to the demands of the practical applications, which poses significant challenge to construct a high performance implementations of deep learning neural networks. In order to improve the performance as well to maintain the low power cost, in this paper we design DLAU, which is a scalable accelerator architecture for large-scale deep learning networks using FPGA as the hardware prototype. The DLAU accelerator employs three pipelined processing units to improve the throughput and utilizes tile techniques to explore locality for deep learning applications. Experimental results on the state-of-the-art Xilinx FPGA board demonstrate that the DLAU accelerator is able to achieve up to 36.1x speedup comparing to the Intel Core2 processors, with the power consumption at 234mW.

cs.LG↗

arXiv2016

Counterexamples to the quadrisecant approximation conjecture

A quadrisecant of a knot is a straight line intersecting the knot at four points. If a knot has finitely many quadrisecants, one can replace each subarc between two adjacent secant points by the line segment between them to get the quadrisecant approximation of the original knot. It was conjectured that the quadrisecant approximation is always a knot with the same knot type as the original knot. We show that every knot type contains two knots, the quadrisecant approximation of one knot has self intersections while the quadrisecant approximation of the other knot is a knot with different knot type.

math.GT↗

arXiv2016

Physical Layer Security in Millimeter Wave Cellular Networks

Recent researches show that millimeter wave (mmWave) communications can offer orders of magnitude increases in the cellular capacity. However, the secrecy performance of a mmWave cellular network has not been investigated so far. Leveraging the new path-loss and blockage models for mmWave channels, which are significantly different from the conventional microwave channel, this paper comprehensively studies the network-wide physical layer security performance of the downlink transmission in a mmWave cellular network under a stochastic geometry framework. We first study the secure connectivity probability and the average number of perfect communication links per unit area in a noise-limited mmWave network for both non-colluding and colluding eavesdroppers scenarios, respectively. Then, we evaluate the effect of the artificial noise (AN) on the secrecy performance, and derive the analysis result of average number of perfect communication links per unit area in an interference-limited mmWave network. Numerical results are demonstrated to show the network-wide secrecy performance, and provide interesting insights into how the secrecy performance is influenced by various network parameters: antenna array pattern, base station (BS) intensity, and AN power allocation, etc.

cs.IT↗

arXiv2016

The most symmetric surfaces in the 3-torus

Suppose an orientation preserving action of a finite group $G$ on the closed surface $Σ_g$ of genus $g>1$ extends over the 3-torus $T^3$ for some embedding $Σ_g\subset T^3$. Then $|G|\le 12(g-1)$, and this upper bound $12(g-1)$ can be achieved for $g=n^2+1, 3n^2+1, 2n^3+1, 4n^3+1, 8n^3+1, n\in \mathbb{Z}_+$. Those surfaces in $T^3$ realizing the maximum symmetries can be either unknotted or knotted. Similar problems in non-orientable category is also discussed. Connection with minimal surfaces in $T^3$ is addressed and when the maximum symmetric surfaces above can be realized by minimal surfaces is identified.

math.GT↗

arXiv2016

Non-Markov property of afterpulsing effect in single-photon avalanche detector

Single-photon avalanche photodiode(SPAD) has been widely used in researching of quantum optics. Afterpulsing effect, which is an intrinsic character of SPAD, affects the system performance in most of the experiments and needs to be carefully handled. For a long time, afterpulsing has been presumed to be determined by the pre-ignition avalanche. We studied the afterpulsing effect of a commercial InGaAs/InP SPAD (APD: Princeton Lightwave PGA-300) and demonstrated that its afterpulsing is non-Markov, which has memory effect of the avalanching history. Theoretical analysis and the experimental results clearly indicate that the embodiment of this memory effect is the afterpulsing probability, which increases as the number of ignition-avalanche pulses increase. The conclusion makes the principle of afterpulsing effect clearer and is instructive to the manufacturing processes and afterpulsing evaluation of high-count-rate SPADs. It can also be regarded as an fundamental premise to handle the afterpulsing signals in many applications, such as quantum communication and quantum random number generator.

physics.ins-det↗

arXiv2016

A novel and automatic pectoral muscle identification algorithm for mediolateral oblique (MLO) view mammograms using ImageJ

Pectoral muscle identification is often required for breast cancer risk analysis, such as estimating breast density. Traditional methods are overwhelmingly based on manual visual assessment or straight line fitting for the pectoral muscle boundary, which are inefficient and inaccurate since pectoral muscle in mammograms can have curved boundaries. This paper proposes a novel and automatic pectoral muscle identification algorithm for MLO view mammograms. It is suitable for both scanned film and full field digital mammograms. This algorithm is demonstrated using a public domain software ImageJ. A validation of this algorithm has been performed using real-world data and it shows promising result.

cs.CV↗

arXiv2016

Opportunistic Jamming for Enhancing Security: Stochastic Geometry Modeling and Analysis

This correspondence studies the secrecy communication of the single-input single-output multi-eavesdropper (SISOME) channel with multiple single-antenna jammers, where the jammers and eavesdroppers are distributed according to the independent two-dimensional homogeneous Poisson point process (PPP). For enhancing the physical layer security, we propose an opportunistic multiple jammer selection scheme, where the jammers whose channel gains to the legitimate receiver less than a threshold, are selected to transmit independent and identically distributed (\emph{i.i.d.}) Gaussian jamming signals to confound the eavesdroppers. We characterize the secrecy throughput achieved by our proposed jammer selection scheme, and show that the secrecy throughput is a quasi-concave function of the selection threshold.

cs.IT↗