Searcharxiv⌕ Search

arXiv subjects

Jian Zhang

Publications and source records attributed to Jian Zhang.

At least 721 records · Page 40Linked to original sources

Coupling Tension and Shear for Highly Sensitive Graphene-Based Strain Sensors

We report, based on its variation in electronic transport to coupled tension and shear deformation, a highly sensitive graphene-based strain sensor consisting of an armchair graphene nanoribbon (AGNR) between metallic contacts. As the nominal strain at any direction increases from 2.5 to 10%, the conductance decreases, particularly when the system changes from the electrically neutral region. At finite bias voltage, both the raw conductance and the relative proportion of the conductance depends smoothly on the gate voltage with negligible fluctuations, which is in contrast to that of pristine graphene. Specifically, when the nominal strain is 10% and the angle varies from 0 degree to 90 degree, the relative proportion of the conductance changes from 60 to 90%.

cond-mat.mes-hall↗

Coherence times of precisely depth controlled NV centers in diamond

We investigated the depth dependence of coherence times of nitrogen-vacancy (NV) centers through precisely depth controlling by a moderately oxidative at 580°C in air. By successive nanoscale etching, NV centers could be brought close to the diamond surface step by step, which enable us to trace the evolution of the number of NV centers remained in the chip and to study the depth dependence of coherence times of NV centers with the diamond etching. Our results showed that the coherence times of NV centers declined rapidly with the depth reduction in their last about 22 nm before they finally disappeared, revealing a critical depth for the influence of rapid fluctuating surface spin bath. By monitoring the coherence time variation with depth, we could make a shallow NV center with long coherence time for detecting external spins with high sensitivity.

quant-ph↗

A Tool for Computing and Estimating the Volume of the Solution Space of SMT(LA)

There are already quite a few tools for solving the Satisfiability Modulo Theories (SMT) problems. In this paper, we present \texttt{VolCE}, a tool for counting the solutions of SMT constraints, or in other words, for computing the volume of the solution space. Its input is essentially a set of Boolean combinations of linear constraints, where the numeric variables are either all integers or all reals, and each variable is bounded. The tool extends SMT solving with integer solution counting and volume computation/estimation for convex polytopes. Effective heuristics are adopted, which enable the tool to deal with high-dimensional problem instances efficiently and accurately.

cs.AI↗

Broken Time Reversal Symmetry in Superconducting Pr1-xCexPt4Ge12

We report results of zero-field muon spin relaxation experiments on the filled-skutterudite superconductors~Pr$_{1-x}$Ce$_{x}$Pt$_4$Ge$_{12}$, $x = 0$, 0.07, 0.1, and 0.2, to investigate the effect of Ce doping on broken time-reversal symmetry (TRS) in the superconducting state. In these alloys broken TRS is signaled by the onset of a spontaneous static local magnetic field~$B_s$ below the superconducting transition temperature. We find that $B_s$ decreases linearly with $x$ and $\to 0$ at $x \approx 0.4$, close to the concentration above which superconductivity is no longer observed. The (Pr,Ce)Pt$_4$Ge$_{12}$ and isostructural (Pr,La)Os$_4$Sb$_{12}$ alloy series both exhibit superconductivity with broken TRS, and in both the decrease of $B_s$ is proportional to the decrease of Pr concentration. This suggests that Pr-Pr intersite interactions are responsible for the broken TRS\@. The two alloy series differ in that the La-doped alloys are superconducting for all La concentrations, suggesting that in (Pr,Ce)Pt$_4$Ge$_{12}$ pair-breaking by Ce doping suppresses superconductivity. For all $x$ the dynamic muon spin relaxation rate decreases somewhat in the superconducting state. This may be due to Korringa relaxation by conduction electrons, which is reduced by the opening of the superconducting energy gap.

cond-mat.supr-con↗

Abrupt Motion Tracking via Nearest Neighbor Field Driven Stochastic Sampling

Stochastic sampling based trackers have shown good performance for abrupt motion tracking so that they have gained popularity in recent years. However, conventional methods tend to use a two-stage sampling paradigm, in which the search space needs to be uniformly explored with an inefficient preliminary sampling phase. In this paper, we propose a novel sampling-based method in the Bayesian filtering framework to address the problem. Within the framework, nearest neighbor field estimation is utilized to compute the importance proposal probabilities, which guide the Markov chain search towards promising regions and thus enhance the sampling efficiency; given the motion priors, a smoothing stochastic sampling Monte Carlo algorithm is proposed to approximate the posterior distribution through a smoothing weight-updating scheme. Moreover, to track the abrupt and the smooth motions simultaneously, we develop an abrupt-motion detection scheme which can discover the presence of abrupt motions during online tracking. Extensive experiments on challenging image sequences demonstrate the effectiveness and the robustness of our algorithm in handling the abrupt motions.

cs.CV↗

High-Sensitivity Temperature Sensing Using an Implanted Single Nitrogen-Vacancy Center Array in Diamond

We presented a high-sensitivity temperature detection using an implanted single Nitrogen-Vacancy center array in diamond. The high-order Thermal Carr-Purcell-Meiboom-Gill (TCPMG) method was performed on the implanted single nitrogen vacancy (NV) center in diamond in a static magnetic field. We demonstrated that under small detunings for the two driving microwave frequencies, the oscillation frequency of the induced fluorescence of the NV center equals approximately to the average of the detunings of the two driving fields. On basis of the conclusion, the zero-field splitting D for the NV center and the corresponding temperature could be determined. The experiment showed that the coherence time for the high-order TCPMG was effectively extended, particularly up to 108 μs for TCPMG-8, about 14 times of the value 7.7 μs for thermal Ramsey method. This coherence time corresponded to a thermal sensitivity of 10.1 mK/Hz1/2. We also detected the temperature distribution on the surface of a diamond chip in three different circumstances by using the implanted NV center array with the TCPMG-3 method. The experiment implies the feasibility for using implanted NV centers in high-quality diamonds to detect temperatures in biology, chemistry, material science and microelectronic system with high-sensitivity and nanoscale resolution.

quant-ph↗

Quantum Pfaffians and Hyper-Pfaffians

The concept of the quantum Pfaffian is rigorously examined and refurbished using the new method of quantum exterior algebras. We derive a complete family of Plücker relations for the quantum linear transformations, and then use them to give an optimal set of relations required for the quantum Pfaffian. We then give the formula between the quantum determinant and the quantum Pfaffian and prove that any quantum determinant can be expressed as a quantum Pfaffian. Finally the quantum hyper-Pfaffian is introduced, and we prove a similar result of expressing quantum determinants in terms of quantum hyper-Pfaffians at modular cases.

math.QA↗

Group-based Sparse Representation for Image Restoration

Traditional patch-based sparse representation modeling of natural images usually suffer from two problems. First, it has to solve a large-scale optimization problem with high computational complexity in dictionary learning. Second, each patch is considered independently in dictionary learning and sparse coding, which ignores the relationship among patches, resulting in inaccurate sparse coding coefficients. In this paper, instead of using patch as the basic unit of sparse representation, we exploit the concept of group as the basic unit of sparse representation, which is composed of nonlocal patches with similar structures, and establish a novel sparse representation modeling of natural images, called group-based sparse representation (GSR). The proposed GSR is able to sparsely represent natural images in the domain of group, which enforces the intrinsic local sparsity and nonlocal self-similarity of images simultaneously in a unified framework. Moreover, an effective self-adaptive dictionary learning method for each group with low complexity is designed, rather than dictionary learning from natural images. To make GSR tractable and robust, a split Bregman based technique is developed to solve the proposed GSR-driven minimization problem for image restoration efficiently. Extensive experiments on image inpainting, image deblurring and image compressive sensing recovery manifest that the proposed GSR modeling outperforms many current state-of-the-art schemes in both PSNR and visual perception.

cs.CV↗

Image Restoration Using Joint Statistical Modeling in Space-Transform Domain

This paper presents a novel strategy for high-fidelity image restoration by characterizing both local smoothness and nonlocal self-similarity of natural images in a unified statistical manner. The main contributions are three-folds. First, from the perspective of image statistics, a joint statistical modeling (JSM) in an adaptive hybrid space-transform domain is established, which offers a powerful mechanism of combining local smoothness and nonlocal self-similarity simultaneously to ensure a more reliable and robust estimation. Second, a new form of minimization functional for solving image inverse problem is formulated using JSM under regularization-based framework. Finally, in order to make JSM tractable and robust, a new Split-Bregman based algorithm is developed to efficiently solve the above severely underdetermined inverse problem associated with theoretical proof of convergence. Extensive experiments on image inpainting, image deblurring and mixed Gaussian plus salt-and-pepper noise removal applications verify the effectiveness of the proposed algorithm.

cs.MM↗

Image Compressive Sensing Recovery Using Adaptively Learned Sparsifying Basis via L0 Minimization

From many fewer acquired measurements than suggested by the Nyquist sampling theory, compressive sensing (CS) theory demonstrates that, a signal can be reconstructed with high probability when it exhibits sparsity in some domain. Most of the conventional CS recovery approaches, however, exploited a set of fixed bases (e.g. DCT, wavelet and gradient domain) for the entirety of a signal, which are irrespective of the non-stationarity of natural signals and cannot achieve high enough degree of sparsity, thus resulting in poor CS recovery performance. In this paper, we propose a new framework for image compressive sensing recovery using adaptively learned sparsifying basis via L0 minimization. The intrinsic sparsity of natural images is enforced substantially by sparsely representing overlapped image patches using the adaptively learned sparsifying basis in the form of L0 norm, greatly reducing blocking artifacts and confining the CS solution space. To make our proposed scheme tractable and robust, a split Bregman iteration based technique is developed to solve the non-convex L0 minimization problem efficiently. Experimental results on a wide range of natural images for CS recovery have shown that our proposed algorithm achieves significant performance improvements over many current state-of-the-art schemes and exhibits good convergence property.

cs.CV↗

Structural Group Sparse Representation for Image Compressive Sensing Recovery

Compressive Sensing (CS) theory shows that a signal can be decoded from many fewer measurements than suggested by the Nyquist sampling theory, when the signal is sparse in some domain. Most of conventional CS recovery approaches, however, exploited a set of fixed bases (e.g. DCT, wavelet, contourlet and gradient domain) for the entirety of a signal, which are irrespective of the nonstationarity of natural signals and cannot achieve high enough degree of sparsity, thus resulting in poor rate-distortion performance. In this paper, we propose a new framework for image compressive sensing recovery via structural group sparse representation (SGSR) modeling, which enforces image sparsity and self-similarity simultaneously under a unified framework in an adaptive group domain, thus greatly confining the CS solution space. In addition, an efficient iterative shrinkage/thresholding algorithm based technique is developed to solve the above optimization problem. Experimental results demonstrate that the novel CS recovery strategy achieves significant performance improvements over the current state-of-the-art schemes and exhibits nice convergence.

cs.CV↗

Spatially Directional Predictive Coding for Block-based Compressive Sensing of Natural Images

A novel coding strategy for block-based compressive sens-ing named spatially directional predictive coding (SDPC) is proposed, which efficiently utilizes the intrinsic spatial cor-relation of natural images. At the encoder, for each block of compressive sensing (CS) measurements, the optimal pre-diction is selected from a set of prediction candidates that are generated by four designed directional predictive modes. Then, the resulting residual is processed by scalar quantiza-tion (SQ). At the decoder, the same prediction is added onto the de-quantized residuals to produce the quantized CS measurements, which is exploited for CS reconstruction. Experimental results substantiate significant improvements achieved by SDPC-plus-SQ in rate distortion performance as compared with SQ alone and DPCM-plus-SQ.

cs.CV↗

A Fast and Practical Method to Estimate Volumes of Convex Polytopes

The volume is an important attribute of a convex body. In general, it is quite difficult to calculate the exact volume. But in many cases, it suffices to have an approximate value. Volume estimation methods for convex bodies have been extensively studied in theory, however, there is still a lack of practical implementations of such methods. In this paper, we present an efficient method which is based on the Multiphase Monte-Carlo algorithm to estimate volumes of convex polytopes. It uses the coordinate directions hit-and-run method, and employs a technique of reutilizing sample points. The experiments show that our method can efficiently handle instances with dozens of dimensions with high accuracy.

cs.CG↗

Slow foliation of a slow-fast stochastic evolutionary system

This work is concerned with the dynamics of a slow-fast stochastic evolutionary system quantified with a scale parameter. An invariant foliation decomposes the state space into geometric regions of different dynamical regimes, and thus helps understand dynamics. A slow invariant foliation is established for this system. It is shown that the slow foliation converges to a critical foliation (i.e., the scale parameter is zero) in probability distribution, as the scale parameter tends to zero. The approximation of slow foliation is also constructed with error estimate in distribution. Furthermore, the geometric structure of the slow foliation is investigated: every fiber of the slow foliation parallels each other, with the slow manifold as a special fiber. In fact, when an arbitrarily chosen point of a fiber falls in the slow manifold, the fiber must be the slow manifold itself.

math.AP↗

Investigation of GEM-Micromegas Detector on X-ray Beam of Synchrotron Radiation

To solve the discharge of the standard Bulk Micromegas and GEM detector, the GEM-Micromegas detector was developed in Institute of High Energy Physics. Taking into account the advantages of the two detectors, one GEM foil was set as a preamplifier on the mesh of Micromegas in the structure and the GEM preamplification decreased the working voltage of Micromegas to reduce the effect of the discharge significantly. In the paper, the performance of detector in X-ray beam was studied at 1W2B laboratory of Beijing Synchrotron Radiation Facility. Finally, the result of the energy resolution under various X-ray energies was given in different working gases. It indicated that the GEM-Micromegas detector had the energy response capability in all the energy range and it could work better than the standard Bulk-Micromegas.

physics.ins-det↗

Characterizing A Database of Sequential Behaviors with Latent Dirichlet Hidden Markov Models

This paper proposes a generative model, the latent Dirichlet hidden Markov models (LDHMM), for characterizing a database of sequential behaviors (sequences). LDHMMs posit that each sequence is generated by an underlying Markov chain process, which are controlled by the corresponding parameters (i.e., the initial state vector, transition matrix and the emission matrix). These sequence-level latent parameters for each sequence are modeled as latent Dirichlet random variables and parameterized by a set of deterministic database-level hyper-parameters. Through this way, we expect to model the sequence in two levels: the database level by deterministic hyper-parameters and the sequence-level by latent parameters. To learn the deterministic hyper-parameters and approximate posteriors of parameters in LDHMMs, we propose an iterative algorithm under the variational EM framework, which consists of E and M steps. We examine two different schemes, the fully-factorized and partially-factorized forms, for the framework, based on different assumptions. We present empirical results of behavior modeling and sequence classification on three real-world data sets, and compare them to other related models. The experimental results prove that the proposed LDHMMs produce better generalization performance in terms of log-likelihood and deliver competitive results on the sequence classification problem.

stat.ML↗

Double exchange model on triangular lattice: non-coplanar spin configuration and phase transition near quarter filling

Unconventional anomalous Hall effect in frustrated pyrochlore oxides is originated from spin chirality of non-coplanar localized spins, which can also be induced by the competition between ferromagnetic (FM) double exchange interaction $J_{H}$ and antiferromagnetic superexchange interaction $J_{AF}$. Here truncated polynomial expansion method and Monte Carlo simulation are adopted to investigate the above model on two-dimensional triangular lattice. We discuss the influence of the range of FM-type spin-spin correlation and strong electron-spin correlation on the truncation error of spin-spin correlation near quarter filling. Two peaks of the probability distribution of spin-spin correlation in non-coplanar spin configuration clearly show that non-coplanar spin configuration is an intermediate phase between FM and 120-degree spin phase. Near quarter filling, there is a phase transition from FM into non-coplanar and further into 120-degree spin phase when $J_{AF}$ continually increases. Finally the effect of temperature on magnetic structure is discussed.

cond-mat.str-el↗