arXiv subjects

Chao Wang

Publications and source records attributed to Chao Wang.

At least 685 records · Page 38Linked to original sources

arXiv2018

UltraFast Optical Imaging using Multimode Fiber based Compressed Sensing and Photonic Time Stretch

An ultrafast single-pixel optical 2D imaging system using a single multimode fiber (MF) is proposed. The MF acted as the all-optical random pattern generator. Light with different wavelengths pass through a single MF will generator all-optical random speckle patterns, which have a low correlation of 0.074 with 0.1nm wavelength step from 1518.0nm to 1567.9nm. The all-optical random speckle patterns are perfect for compressive sensing (CS) imaging with the advantage of low cost in comparison with the conventional expensive pseudorandom binary sequence (PRBS). Besides, with the employment of photonic time stretch (PTS), light of different wavelengths will go through a single capsuled MF in time serial within a short pulse time, which makes ultrafast single-pixel all-optical CS imaging possible. In our work, the all-optical random speckle patterns are analyzed and used to perform CS imaging in our proposed system and the results shows a single-pixel photo-detector can be employed in CS imaging system and a 27 by 27 pixels image is reconstructed within 500 measurements. In our proposed imaging system, the fast Fourier transform (FFT) spatial resolution, which is a combination of multiple Gaussians, is analyzed. Considering 4 optical speckle patterns, the FFT spatial resolution is 50 by 50 pixels. This resolution limit has been obtained by removing the central low frequency components and observing the significant spectral power along all the radial directions.

physics.optics↗

arXiv2018

NMR Evidence of Charge Fluctuations in Multiferroic CuBr2

We report combined magnetic susceptibility, dielectric constant, nuclear quadruple resonance (NQR) and zero-field nuclear magnetic resonance (NMR) measurements on single crystals of multiferroics CuBr$_2$. High quality of the sample is demonstrated by the sharp magnetic and magnetic-driven ferroelectric transition at $T_N=T_C\approx$ 74~K. The zero-field $^{79}$Br and $^{81}$Br NMR are resolved below $T_N$. The spin-lattice relaxation rates reveal charge fluctuations when cooled below 60~K. Evidences of an increase of NMR linewidth, a reduction of dielectric constant, and an increase of magnetic susceptibility are also seen at low temperatures. These data suggest an emergent instability which competes with the spiral magnetic ordering and the ferroelectricity. Candidate mechanisms are discussed based on the quasi-one-dimensional (1D) nature of the magnetic system.

cond-mat.str-el↗

arXiv2018

Instance Map based Image Synthesis with a Denoising Generative Adversarial Network

Semantic layouts based Image synthesizing, which has benefited from the success of Generative Adversarial Network (GAN), has drawn much attention in these days. How to enhance the synthesis image equality while keeping the stochasticity of the GAN is still a challenge. We propose a novel denoising framework to handle this problem. The overlapped objects generation is another challenging task when synthesizing images from a semantic layout to a realistic RGB photo. To overcome this deficiency, we include a one-hot semantic label map to force the generator paying more attention on the overlapped objects generation. Furthermore, we improve the loss function of the discriminator by considering perturb loss and cascade layer loss to guide the generation process. We applied our methods on the Cityscapes, Facades and NYU datasets and demonstrate the image generation ability of our model.

cs.CV↗

arXiv2017

Andreev reflection in a Y-shaped graphene-superconductor device

Using the non-equilibrium Green function method, we study the Andreev reflection in a Y-shaped graphene-superconductor device by tight-binding model. Considering both the zigzag and armchair terminals, we confirm that the zigzag terminals are the better choice for detecting the Andreev reflection without no external field. Due to scattering from the boundaries of the finite-size centre region, the difference between Andreev retroreflection and specular reflection is hard to be distinguished. Although adjusting the size of the device makes the difference visible, to distinguish them quantitatively is still impossible through the transport conductance. The problem is circumvented when applying a perpendicular magnetic field on the centre region, which makes the incident electrons and the reflected holes propagate along the edge or the interface. In this case, the retroreflected and specular reflected holes from the different bands have opposite effective masses, therefore the moving direction of one is opposite to the other. Which external terminal the reflected holes flow into depends entirely on the kind of the Andreev reflection. Therefore, the specular Andreev reflection can be clearly distinguished from the retroreflected one in the presence of strong magnetic field, even for the device with finite size.

cond-mat.mes-hall↗

arXiv2017

Exact Boson-Fermion Duality on a 3D Euclidean Lattice

The idea of statistical transmutation plays a crucial role in descriptions of the fractional quantum Hall effect. However, a recently conjectured duality between a critical boson and a massless 2-component Dirac fermion extends this notion to gapless systems. This duality sheds light on highly non-trivial problems such as the half-filled Landau level, the superconductor-insulator transition, and surface states of strongly coupled topological insulators. Although this boson-fermion duality has undergone many consistency checks, it has remained unproven. We describe the duality in a non-perturbative fashion using an exact UV mapping of partition functions on a 3D Euclidean lattice.

cond-mat.str-el↗

arXiv2017

Reconfigurable Hardware Accelerators: Opportunities, Trends, and Challenges

With the emerging big data applications of Machine Learning, Speech Recognition, Artificial Intelligence, and DNA Sequencing in recent years, computer architecture research communities are facing the explosive scale of various data explosion. To achieve high efficiency of data-intensive computing, studies of heterogeneous accelerators which focus on latest applications, have become a hot issue in computer architecture domain. At present, the implementation of heterogeneous accelerators mainly relies on heterogeneous computing units such as Application-specific Integrated Circuit (ASIC), Graphics Processing Unit (GPU), and Field Programmable Gate Array (FPGA). Among the typical heterogeneous architectures above, FPGA-based reconfigurable accelerators have two merits as follows: First, FPGA architecture contains a large number of reconfigurable circuits, which satisfy requirements of high performance and low power consumption when specific applications are running. Second, the reconfigurable architectures of employing FPGA performs prototype systems rapidly and features excellent customizability and reconfigurability. Nowadays, in top-tier conferences of computer architecture, emerging a batch of accelerating works based on FPGA or other reconfigurable architectures. To better review the related work of reconfigurable computing accelerators recently, this survey reserves latest high-level research products of reconfigurable accelerator architectures and algorithm applications as the basis. In this survey, we compare hot research issues and concern domains, furthermore, analyze and illuminate advantages, disadvantages, and challenges of reconfigurable accelerators. In the end, we prospect the development tendency of accelerator architectures in the future, hoping to provide a reference for computer architecture researchers.

cs.AR↗

arXiv2017

Pipeline Generative Adversarial Networks for Facial Images Generation with Multiple Attributes

Generative Adversarial Networks are proved to be efficient on various kinds of image generation tasks. However, it is still a challenge if we want to generate images precisely. Many researchers focus on how to generate images with one attribute. But image generation under multiple attributes is still a tough work. In this paper, we try to generate a variety of face images under multiple constraints using a pipeline process. The Pip-GAN (Pipeline Generative Adversarial Network) we present employs a pipeline network structure which can generate a complex facial image step by step using a neutral face image. We applied our method on two face image databases and demonstrate its ability to generate convincing novel images of unseen identities under multiple conditions previously.

cs.CV↗

arXiv2017

Three-body decays $B \to ϕ(ρ) K γ$ in perturbative QCD approach

We study the three-body radiative decays $B\to ϕ(ρ) Kγ$ induced by a flavor-changing neutral current in the perturbative QCD approach. Pseudoscalar-vector ($PV$) distribution amplitudes (DAs) are introduced for the final-state $ϕK$ ($ρK$) pair to capture important infrared dynamics in the region with a small $PV$-pair invariant mass. The dependence of these $PV$ DAs on the parton momentum fraction is parametrized in terms of the Gegenbauer polynomials, and the dependence on the meson momentum fraction is derived through their normalizations to time-like $PV$ form factors. In addition to the dominant electromagnetic penguin, the subleading chromomagnetic penguin, quark-loop and annihilation diagrams are also calculated. After determining the $PV$ DAs from relevant branching-ratio data, the direct $CP$ asymmetries and decay spectra in the $PV$-pair invariant mass are predicted for each $B\to ϕ(ρ) Kγ$ mode.

hep-ph↗

arXiv2017

Global stability of large solutions to the 3D compressible Navier-Stokes equations

The present paper aims at the investigation of the global stability of large solutions to the compressible Navier-Stokes equations in the whole space. Our main results and innovations can be concluded as follows: Under the assumption that the density $ρ(t,x)$ verifies $ρ(0,x)\ge c>0$ and $\sup_{t\ge0}\|ρ(t)\|_{C^α}\le M$ with $α$ sufficiently small, we establish a new mechanism for the convergence of the solution to its associated equilibrium with an explicit decay rate which is as the same as that for the heat equation. The main idea of the proof relies on the basic energy identity, techniques from blow-up criterion and a new estimate for the low frequency part of the solution. We prove the global-in-time stability for the equations, i.e, any perturbed solution will remain close to the reference solution if initially they are close to each other. Our result implies that the set of the smooth and bounded solutions is an open set. Going beyond the close-to-equilibrium setting, we construct the global large solutions to the equations with a class of initial data in $L^p$ type critical spaces. Here the "large solution" means that the vertical component of the velocity could be arbitrarily large initially.

math.AP↗

arXiv2017

Graphs in the 3--sphere with maximum symmetry

We consider the orientation-preserving actions of finite groups $G$ on pairs $(S^3, Γ)$, where $Γ$ is a connected graph of genus $g>1$, embedded in $S^3$. For each $g$ we give the maximum order $m_g$ of such $G$ acting on $(S^3, Γ)$ for all such $Γ\subset S^3$. Indeed we will classify all graphs $Γ\subset S^3$ which realize these $m_g$ in different levels: as abstract graphs and as spatial graphs, as well as their group actions. Such maximum orders without the condition "orientation-preserving" are also addressed.

math.GT↗

arXiv2017

Bordered surfaces in the 3-sphere with maximum symmetry

We consider orientation-preserving actions of finite groups $G$ on pairs $(S^3, Σ)$, where $Σ$ denotes a compact connected surface embedded in $S^3$. In a previous paper, we considered the case of closed, necessarily orientable surfaces, determined for each genus $g>1$ the maximum order of such a $G$ for all embeddings of a surface of genus $g$, and classified the corresponding embeddings. In the present paper we obtain analogous results for the case of bordered surfaces $Σ$ (i.e. with non-empty boundary, orientable or not). Now the genus $g$ gets replaced by the algebraic genus $α$ of $Σ$ (the rank of its free fundamental group); for each $α> 1$ we determine the maximum order $m_α$ of an action of $G$, classify the topological types of the corresponding surfaces (topological genus, number of boundary components, orientability) and their embeddings into $S^3$. For example, the maximal possibility $12(α- 1)$ is obtained for the finitely many values $α= 2, 3, 4, 5, 9, 11, 25, 97, 121$ and $241$.

math.GT↗

arXiv2017

Optimal Nested Test Plan for Combinatorial Quantitative Group Testing

We consider the quantitative group testing problem where the objective is to identify defective items in a given population based on results of tests performed on subsets of the population. Under the quantitative group testing model, the result of each test reveals the number of defective items in the tested group. The minimum number of tests achievable by nested test plans was established by Aigner and Schughart in 1985 within a minimax framework. The optimal nested test plan offering this performance, however, was not obtained. In this work, we establish the optimal nested test plan in closed form. This optimal nested test plan is also order optimal among all test plans as the population size approaches infinity. Using heavy-hitter detection as a case study, we show via simulation examples orders of magnitude improvement of the group testing approach over two prevailing sampling-based approaches in detection accuracy and counter consumption. Other applications include anomaly detection and wideband spectrum sensing in cognitive radio systems.

cs.IT↗

arXiv2017

X(3872) as a molecular $D\bar{D}^*$ state in the Bethe-Salpeter equation approach

We discuss the possibility that the X(3872) can be a $D\bar{D}^*$ molecular bound state in the Bethe-Salpeter equation approach in the ladder and instantaneous approximations. We show that the $D\bar{D}^*$ bound state with quantum numbers $J^{PC}=1^{++}$ exists. We also calculate the decay width of $X(3872) \rightarrow γJ/ψ$ channel and compare our result with those from previous calculations.

hep-ph↗

arXiv2017

Thread-Modular Static Analysis for Relaxed Memory Models

We propose a memory-model-aware static program analysis method for accurately analyzing the behavior of concurrent software running on processors with weak consistency models such as x86-TSO, SPARC-PSO, and SPARC-RMO. At the center of our method is a unified framework for deciding the feasibility of inter-thread interferences to avoid propagating spurious data flows during static analysis and thus boost the performance of the static analyzer. We formulate the checking of interference feasibility as a set of Datalog rules which are both efficiently solvable and general enough to capture a range of hardware-level memory models. Compared to existing techniques, our method can significantly reduce the number of bogus alarms as well as unsound proofs. We implemented the method and evaluated it on a large set of multithreaded C programs. Our experiments showthe method significantly outperforms state-of-the-art techniques in terms of accuracy with only moderate run-time overhead.

cs.PL↗

arXiv2017

Modular Verification of Interrupt-Driven Software

Interrupts have been widely used in safety-critical computer systems to handle outside stimuli and interact with the hardware, but reasoning about interrupt-driven software remains a difficult task. Although a number of static verification techniques have been proposed for interrupt-driven software, they often rely on constructing a monolithic verification model. Furthermore, they do not precisely capture the complete execution semantics of interrupts such as nested invocations of interrupt handlers. To overcome these limitations, we propose an abstract interpretation framework for static verification of interrupt-driven software that first analyzes each interrupt handler in isolation as if it were a sequential program, and then propagates the result to other interrupt handlers. This iterative process continues until results from all interrupt handlers reach a fixed point. Since our method never constructs the global model, it avoids the up-front blowup in model construction that hampers existing, non-modular, verification techniques. We have evaluated our method on 35 interrupt-driven applications with a total of 22,541 lines of code. Our results show the method is able to quickly and more accurately analyze the behavior of interrupts.

cs.PL↗

arXiv2017

Flow-Sensitive Composition of Thread-Modular Abstract Interpretation

We propose a constraint-based flow-sensitive static analysis for concurrent programs by iteratively composing thread-modular abstract interpreters via the use of a system of lightweight constraints. Our method is compositional in that it first applies sequential abstract interpreters to individual threads and then composes their results. It is flow-sensitive in that the causality ordering of interferences (flow of data from global writes to reads) is modeled by a system of constraints. These interference constraints are lightweight since they only refer to the execution order of program statements as opposed to their numerical properties: they can be decided efficiently using an off-the-shelf Datalog engine. Our new method has the advantage of being more accurate than existing, flow-insensitive, static analyzers while remaining scalable and providing the expected soundness and termination guarantees even for programs with unbounded data. We implemented our method and evaluated it on a large number of benchmarks, demonstrating its effectiveness at increasing the accuracy of thread-modular abstract interpretation.

cs.PL↗

arXiv2017

On Iterative Algorithms for Quantitative Photoacoustic Tomography in the Radiative Transport Regime

In this paper, we describe the numerical reconstruction method for quantitative photoacoustic tomography (QPAT) based on the radiative transfer equation (RTE), which models light propagation more accurately than diffusion approximation (DA). We investigate the reconstruction of absorption coefficient and/or scattering coefficient of biological tissues. Given the scattering coefficient, an improved fixed-point iterative method is proposed to retrieve the absorption coefficient for its cheap computational cost. And we prove the convergence. To retrieve two coefficients simultaneously, Barzilai-Borwein (BB) method is applied. Since the reconstruction of optical coefficients involves the solution of original and adjoint RTEs in the framework of optimization, an efficient solver with high accuracy is improved from~\cite{Gao}. Simulation experiments illustrate that the improved fixed-point iterative method and the BB method are the comparative methods for QPAT in two cases.

q-bio.QM↗

arXiv2017

Studying the bound state of the $K^-p$ system in the Bethe-Salpeter formalism

We study the $s$-wave kaon-nucleon bound state with the strangeness $S=-1$ in the Bethe-Salpeter formalism in the ladder and instantaneous approximations. We solve the Bethe-Salpeter equation of the bound state and obtain the Bethe-Salpeter amplitude. It is shown that the $K^-p$ bound state exists in this formalism. We also study the decay width of the bound state based on the Bethe-Salpeter techniques. The mass of this bound state is 1422 MeV and its decay width is obviously smaller than that of $Λ(1405)$. These results indicate that there may be some other structures in the observed resonance.

hep-ph↗