Searcharxiv⌕ Search

arXiv subjects

Jian Zhang

Publications and source records attributed to Jian Zhang.

At least 703 records · Page 39Linked to original sources

Refining Image Categorization by Exploiting Web Images and General Corpus

Studies show that refining real-world categories into semantic subcategories contributes to better image modeling and classification. Previous image sub-categorization work relying on labeled images and WordNet's hierarchy is not only labor-intensive, but also restricted to classify images into NOUN subcategories. To tackle these problems, in this work, we exploit general corpus information to automatically select and subsequently classify web images into semantic rich (sub-)categories. The following two major challenges are well studied: 1) noise in the labels of subcategories derived from the general corpus; 2) noise in the labels of images retrieved from the web. Specifically, we first obtain the semantic refinement subcategories from the text perspective and remove the noise by the relevance-based approach. To suppress the search error induced noisy images, we then formulate image selection and classifier learning as a multi-class multi-instance learning problem and propose to solve the employed problem by the cutting-plane algorithm. The experiments show significant performance gains by using the generated data of our way on both image categorization and sub-categorization tasks. The proposed approach also consistently outperforms existing weakly supervised and web-supervised approaches.

cs.MM↗

Multi-Label Image Classification with Regional Latent Semantic Dependencies

Deep convolution neural networks (CNN) have demonstrated advanced performance on single-label image classification, and various progress also have been made to apply CNN methods on multi-label image classification, which requires to annotate objects, attributes, scene categories etc. in a single shot. Recent state-of-the-art approaches to multi-label image classification exploit the label dependencies in an image, at global level, largely improving the labeling capacity. However, predicting small objects and visual concepts is still challenging due to the limited discrimination of the global visual features. In this paper, we propose a Regional Latent Semantic Dependencies model (RLSD) to address this problem. The utilized model includes a fully convolutional localization architecture to localize the regions that may contain multiple highly-dependent labels. The localized regions are further sent to the recurrent neural networks (RNN) to characterize the latent semantic dependencies at the regional level. Experimental results on several benchmark datasets show that our proposed model achieves the best performance compared to the state-of-the-art models, especially for predicting small objects occurred in the images. In addition, we set up an upper bound model (RLSD+ft-RPN) using bounding box coordinates during training, the experimental results also show that our RLSD can approach the upper bound without using the bounding-box annotations, which is more realistic in the real world.

cs.CV↗

Multiparameter quantum Pfaffians

The multiparameter quantum Pfaffian of the $(p, λ)$-quantum group is introduced and studied together with the quantum determinant, and an identity relating the two invariants is given. Generalization to the multiparameter hyper-Pfaffian and relationship with the quantum minors are also considered.

math.QA↗

Quantum Hyperdeterminants and Hyper-Pfaffians

The notion of generalized quantum monoids is introduced. It is proved that the quantum coordinate ring of the monoid can be lifted to a quantum hyper-algebra, in which the quantum determinant and quantum Pfaffian are sent to the quantum hyperdeterminant and quantum hyper-Pfaffian respectively. The quantum hyperdeterminant in even dimension is shown to be a $q$-analog of Cayley's first hyperdeterminant.

math.QA↗

Study on temperature coefficient of CdTe detector used for X-rays detection

The temperature of the working environment is a key factor in determining the properties of semiconductor detectors, and it affects the absolute accuracy and stability of the standard detector. In order to determine the temperature coefficient of CdTe detector used for X-rays detection, a precise temperature control system was designed. In this experiment, detectors and radiographic source were set inside the thermostat with temperature of 0-40 Celsius degree, so that the temperature can be regulated for the test of the temperature coefficient of CdTe detector. Studies had shown that, with the increase of the temperature, the energy resolution and detection efficiency of the CdTe detector would deteriorate, and under 10 Celsius degree the detectors have better performance with the 8 keV X-rays.

physics.ins-det↗

Real-time kinematic positioning of LEO satellites using a single-frequency GPS receiver

Due to their low cost and low power consumption, single-frequency GPS receivers are considered suitable for low-cost space applications such as small satellite missions. Recently, requirements have emerged for real-time accurate orbit determination at sub-meter level in order to carry out onboard geocoding of high-resolution imagery, open-loop operation of altimeters and radio occultation. This study proposes an improved real-time kinematic positioning method for LEO satellites using single-frequency receivers. The C/A code and L1 phase are combined to eliminate ionospheric effects. The epoch-differenced carrier phase measurements are utilized to acquire receiver position changes which are further used to smooth the absolute positions. A kinematic Kalman filter is developed to implement kinematic orbit determination. Actual flight data from China small satellite SJ-9A are used to test the navigation performance. Results show that the proposed method outperforms traditional kinematic positioning method in terms of accuracy. A 3D position accuracy of 0.72 m and 0.79 m has been achieved using the predicted portion of IGS ultra-rapid products and broadcast ephemerides, respectively.

astro-ph.IM↗

Spin-Valley Beam Splitter in Graphene

The fourfold spin-valley degenerate degrees of freedom in bulk graphene can support rich physics and novel applications associated with multicomponent quantum Hall effects and linear conductance filtering. In this work, we study how to break the spin-valley degeneracy of electron beams spatially. We propose a spin-valley beam splitter in a gated ferromagnetic/pristine/strained graphene structure. We demonstrate that, in a full resonant tunneling regime for all spin-valley beam components, the formation of quasi-standing waves can lead four giant lateral Goos-Hänchen shifts as large as the transverse beam width, while the interplay of the two modulated regions can lead difference of resonant angles or energies for the four spin-valley flavors, manifesting an effective spin-valley beam splitting effect. The beam splitting effect is found to be controllable by the gating and strain.

cond-mat.mes-hall↗

Superconducting gap structure in ambient-pressure-grown $\mathrm{LaO_{0.5}F_{0.5}BiS_{2}}$

We have performed transverse-field muon spin relaxation (TF-$μ$SR) measurements on ambient-pressure-grown polycrystalline $\mathrm{LaO_{0.5}F_{0.5}BiS_{2}}$. From these measurements, no signature of magnetic order is found down to 25 mK. The value of the magnetic penetration depth extrapolated to 0 K is 0.89 (5) $μ$m. The temperature dependence of superconducting penetration depth is best described by either a multigap s + s-wave model with $Δ_{1}$ = 0.947 (7) meV and $Δ_{2}$ = 0.22 (4) meV or the ansiotropic s-wave model with $Δ(0)$ = 0.776 meV and anisotropic gap amplitude ratio $Δ_{min}/Δ_{max}$ = 0.34. Comparisons with other potentially multigap $\mathrm{BiS_{2}}$-based superconductors are discussed. We find that these $\mathrm{BiS_{2}}$-based superconductors, including $\mathrm{Bi_{4}O_{4}S_3}$ and the high-pressure synthesized $\mathrm{LaO_{0.5}F_{0.5}BiS_{2}}$, generally conform to the Uemura relation.

cond-mat.supr-con↗

A coarse-to-fine algorithm for registration in 3D street-view cross-source point clouds

With the development of numerous 3D sensing technologies, object registration on cross-source point cloud has aroused researchers' interests. When the point clouds are captured from different kinds of sensors, there are large and different kinds of variations. In this study, we address an even more challenging case in which the differently-source point clouds are acquired from a real street view. One is produced directly by the LiDAR system and the other is generated by using VSFM software on image sequence captured from RGB cameras. When it confronts to large scale point clouds, previous methods mostly focus on point-to-point level registration, and the methods have many limitations.The reason is that the least mean error strategy shows poor ability in registering large variable cross-source point clouds. In this paper, different from previous ICP-based methods, and from a statistic view, we propose a effective coarse-to-fine algorithm to detect and register a small scale SFM point cloud in a large scale Lidar point cloud. Seen from the experimental results, the model can successfully run on LiDAR and SFM point clouds, hence it can make a contribution to many applications, such as robotics and smart city development.

cs.CV↗

SQuAD: 100,000+ Questions for Machine Comprehension of Text

We present the Stanford Question Answering Dataset (SQuAD), a new reading comprehension dataset consisting of 100,000+ questions posed by crowdworkers on a set of Wikipedia articles, where the answer to each question is a segment of text from the corresponding reading passage. We analyze the dataset to understand the types of reasoning required to answer the questions, leaning heavily on dependency and constituency trees. We build a strong logistic regression model, which achieves an F1 score of 51.0%, a significant improvement over a simple baseline (20%). However, human performance (86.8%) is much higher, indicating that the dataset presents a good challenge problem for future research. The dataset is freely available at https://stanford-qa.com

cs.CL↗

A Systematic Approach for Cross-source Point Cloud Registration by Preserving Macro and Micro Structures

We propose a systematic approach for registering cross-source point clouds. The compelling need for cross-source point cloud registration is motivated by the rapid development of a variety of 3D sensing techniques, but many existing registration methods face critical challenges as a result of the large variations in cross-source point clouds. This paper therefore illustrates a novel registration method which successfully aligns two cross-source point clouds in the presence of significant missing data, large variations in point density, scale difference and so on. The robustness of the method is attributed to the extraction of macro and micro structures. Our work has three main contributions: (1) a systematic pipeline to deal with cross-source point cloud registration; (2) a graph construction method to maintain macro and micro structures; (3) a new graph matching method is proposed which considers the global geometric constraint to robustly register these variable graphs. Compared to most of the related methods, the experiments show that the proposed method successfully registers in cross-source datasets, while other methods have difficulty achieving satisfactory results. The proposed method also shows great ability in same-source datasets.

cs.CV↗

Quantum permanents and Hafnians via Pfaffians

Quantum determinants and Pfaffians or permanents and Hafnians are introduced on the two parameter quantum general linear group. Fundamental identities among quantum Pf, Hf, and det are proved in the general setting. We show that there are two special quantum algebras among the quantum groups, where the quantum Pfaffians have integral Laurent polynomials as coefficients. As a consequence, the quantum Hafnian is computed by a closely related quantum permanent and identical to the quantum Pfaffian on this special quantum algebra.

math.QA↗

Multiplicity and concentration behavior of solutions to the critical Kirchhoff type problem

In this paper, we study the multiplicity and concentration of the positive solutions to the following critical Kirchhoff type problem: \begin{equation*} -\left(\varepsilon^2 a+\varepsilon b\int_{\R^3}|\nabla u|^2\mathrm{d} x\right)Δu + V(x) u = f(u)+u^5\ \ {\rm in } \ \ \R^3, \end{equation*} where $\varepsilon$ is a small positive parameter, $a$, $b$ are positive constants, $V \in C(\mathbb{R}^3)$ is a positive potential, $f \in C^1(\R^+, \R)$ is a subcritical nonlinear term, $u^5$ is a pure critical nonlinearity. When $\varepsilon>0$ small, we establish the relationship between the number of positive solutions and the profile of the potential $V$. The exponential decay at infinity of the solution is also obtained. In particular, we show that each solution concentrates around a local strict minima of $V$ as $\varepsilon \rightarrow 0$.

math.AP↗

Parallel SGD: When does averaging help?

Consider a number of workers running SGD independently on the same pool of data and averaging the models every once in a while -- a common but not well understood practice. We study model averaging as a variance-reducing mechanism and describe two ways in which the frequency of averaging affects convergence. For convex objectives, we show the benefit of frequent averaging depends on the gradient variance envelope. For non-convex objectives, we illustrate that this benefit depends on the presence of multiple globally optimal points. We complement our findings with multicore experiments on both synthetic and real data.

stat.ML↗

On Pollaczek-Khinchine Formula for Peer-to-Peer Networks

The performance analysis of peer-to-peer (P2P) networks calls for a new kind of queueing model, in which jobs and service stations arrive randomly. Except in some simple special cases, in general, the queueing model with varying service rate is mathematically intractable. Motivated by the P-K formula for M/G/1 queue, we developed a limiting analysis approach based on the connection between the fluctuation of service rate and the mean queue length. Considering the two extreme service rates, we proved the conjecture on the lower bound and upper bound of mean queue length previously postulated. Furthermore, an approximate P-K formula to estimate the mean queue length is derived from the convex combination of these two bounds and the conditional mean queue length under the overload condition. We confirmed the accuracy of our approximation by extensive simulation studies with different system parameters. We also verified that all limiting cases of the system behavior are consistent with the predictions of our formula.

cs.PF↗

Quantum Criticality and Inhomogeneous Magnetic Order in Fe-doped alpha-YbAlB4

The intermediate-valent polymorphs $α$- and $β$-YbAlB$_4$ exhibit quantum criticality and other novel properties not usually associated with intermediate valence. Iron doping induces quantum criticality in $α$-YbAlB$_4$ and magnetic order in both compounds. We report results of muon spin relaxation ($μ$SR) experiments in the intermediate-valent alloys $α$-YbAl$_{1-x}$Fe$_x$B$_4$, $x = 0.014$ and 0.25. For $x = 0.014$ we find no evidence for magnetic order down to 25 mK\@. The dynamic muon spin relaxation rate $λ_d$ exhibits a power-law temperature dependence $λ_d \propto T^{-a}$, $a = 0.40(4)$, in the temperature range 100 mK--2 K, in disagreement with predictions by theories of antiferromagnetic (AFM) or valence quantum critical behavior. For $x = 0.25$, where AFM order develops in the temperature range 7.5--10 K, where we find coexistence of meso- or macroscopically segregated paramagnetic and AFM phases, with considerable disorder in the latter down to 2 K.

cond-mat.str-el↗

Quantum cloning attacks against PUF-based quantum authentication systems

With the advent of Physical Unclonable Functions (PUFs), PUF-based quantum authentication systems (QAS) have been proposed for security purposes and recently proof-of-principle experiment has been demonstrated. As a further step towards completing the security analysis, we investigate quantum cloning attacks against PUF-based quantum authentication systems and prove that quantum cloning attacks outperform the so-called challenge-estimation attacks. We present the analytical expression of the false accept probability by use of the corresponding optimal quantum cloning machines and extend the previous results in the literature. In light of these findings, an explicit comparison is made between PUF-based quantum authentication systems and quantum key distribution (QKD) protocols in the context of cloning attacks. Moreover, from an experimental perspective, a trade-off between the average photon number and the detection efficiency is discussed in detail.

quant-ph↗