Searcharxiv⌕ Search

arXiv subjects

Yu Guo

Publications and source records attributed to Yu Guo.

At least 217 records · Page 12Linked to original sources

AdaCompress: Adaptive Compression for Online Computer Vision Services

With the growth of computer vision based applications and services, an explosive amount of images have been uploaded to cloud servers which host such computer vision algorithms, usually in the form of deep learning models. JPEG has been used as the {\em de facto} compression and encapsulation method before one uploads the images, due to its wide adaptation. However, standard JPEG configuration does not always perform well for compressing images that are to be processed by a deep learning model, e.g., the standard quality level of JPEG leads to 50\% of size overhead (compared with the best quality level selection) on ImageNet under the same inference accuracy in popular computer vision models including InceptionNet, ResNet, etc. Knowing this, designing a better JPEG configuration for online computer vision services is still extremely challenging: 1) Cloud-based computer vision models are usually a black box to end-users; thus it is difficult to design JPEG configuration without knowing their model structures. 2) JPEG configuration has to change when different users use it. In this paper, we propose a reinforcement learning based JPEG configuration framework. In particular, we design an agent that adaptively chooses the compression level according to the input image's features and backend deep learning models. Then we train the agent in a reinforcement learning way to adapt it for different deep learning cloud services that act as the {\em interactive training environment} and feeding a reward with comprehensive consideration of accuracy and data size. In our real-world evaluation on Amazon Rekognition, Face++ and Baidu Vision, our approach can reduce the size of images by 1/2 -- 1/3 while the overall classification accuracy only decreases slightly.

cs.MM↗

Discrete Element Method Model of Elastic Fiber Uniaxial Compression

A flexible fiber model based on the discrete element method (DEM) is presented and validated for the simulation of uniaxial compression of flexible fibers in a cylindrical container. It is found that the contact force models in the DEM simulations have a significant impact on compressive forces exerted on the fiber bed. Only when the geometry-dependent normal contact force model and the static friction model are employed, the simulation results are in good agreement with experimental results. Systematic simulation studies show that the compressive force initially increases and eventually saturates with an increase in the fiber-fiber friction coefficient, and the fiber-fiber contact forces follow a similar trend. The compressive force and lateral shear-to-normal stress ratio increase linearly with increasing fiber-wall friction coefficient. In uniaxial compression of frictional fibers, more static friction contacts occur than dynamic friction contacts with static friction becoming more predominant as the fiber-fiber friction coefficient increases.

cond-mat.soft↗

Magnetic Field Induced Polarization Difference between Hyperons and Anti-hyperons

Recent STAR measurements suggest a difference in the global spin polarization between hyperons and anti-hyperons, especially at relatively low collision beam energy. One possible cause of this difference is the potential presence of in-medium magnetic field. In this study, we investigate the phenomenological viability of this interpretation. Using the AMPT model framework, we quantify the influence of different magnetic field evolution scenarios on the size of the polarization difference in a wide span of collision beam energies. We find that such difference is very sensitive to the lifetime of the magnetic field. For the same lifetime, the computed polarization difference only mildly depends on the detailed form of its evolution. Assuming magnetic polarization as the mechanism to enhance anti-hyperon signal while suppress hyperon signal, we phenomenologically extract an upper limit on the needed magnetic field lifetime in order to account for the experimental data. The so-obtained lifetime values are in a quite plausible ballpark and follow approximately the scaling relation of being inversely proportional to the beam energy. Possible implications on other magnetic field related effects are also discussed.

nucl-th↗

Constructions of unextendible entangled bases

We provide several constructions of special unextendible entangled bases with fixed Schmidt number $k$ (SUEB$k$) in $\mathbb{C}^{d}\otimes \mathbb{C}^{d'}$ for $2\leq k\leq d\leq d'$. We generalize the space decomposition method in Guo [Phys. Rev. A 94, 052302 (2016)], by proposing a systematic way of constructing new SUEB$k$s in $\mathbb{C}^{d}\otimes \mathbb{C}^{d'}$ for $2\leq k < d \leq d'$ or $2\leq k=d< d'$. In addition, we give a construction of a $(pqdd'-p(dd'-N))$-number SUEB$pk$ in $\mathbb{C}^{pd}\otimes \mathbb{C}^{qd'}$ from an $N$-number SUEB$k$ in $\mathbb{C}^{d}\otimes \mathbb{C}^{d'}$ for $p\leq q$ by using permutation matrices. We also connect a $(d(d'-1)+m)$-number UMEB in $\mathbb{C}^{d}\otimes \mathbb{C}^{d'}$ with an unextendible partial Hadamard matrix $H_{m\times d}$ with $m<d$, which extends the result in [Quantum Inf. Process. 16(3), 84 (2017)].

math.CO↗

Partial Computing Offloading Assisted Cloud Point Registration in Multi-robot SLAM

Multi-robot visual simultaneous localization and mapping (SLAM) system is normally consisted of multiple mobile robots equipped with camera and/or other visual sensors. The networked robots work independently or cooperatively in an unknown scene in order to solve autonomous localization and mapping problem. One of the most critical issues in Multi-robot visual SLAM is the intensive computation that is normally required yet overwhelming for inexpensive mobile robots with limited on-board resources. To address this problem, a novel task offloading strategy and dense point cloud map construction method is proposed in this paper. First, we develop a novel strategy to remotely offload computation-intensive tasks to cloud center, so that the tasks that could not originally be achieved locally on the resource-limited robot systems become possible. Second, a modified iterative closest point algorithm (ICP), named fitness score hierarchical ICP algorithm (FS-HICP), is developed to accelerate point cloud registration. The correctness, efficiency, and scalability of the proposed strategy are evaluated with both theoretical analysis and experimental simulations. The results show that the proposed method can effectively reduce the energy consumption while increase the computation capability and speed of the multi-robot visual SLAM system, especially in indoor environment.

cs.RO↗

Advances in quantum dense coding

Quantum dense coding is one of the most important protocols in quantum communication. It derives from the idea of using quantum resources to boost the communication capacity and now serves as a key primitive across a variety of quantum information protocols. Here, we focus on the basic theoretical ideas behind quantum dense coding, discussing its development history from discrete and continuous variables to quantum networks, then to its variant protocols and applications in quantum secure communication. With this basic background in hand, we then review the main experimental achievements, from photonic qubits and qudits to optical modes, nuclear magnetic resonance, and atomic systems. Besides the state of the art, we finally discuss potential future steps.

quant-ph↗

Meron Spin Textures in Momentum Space

We reveal the meron and antimeron spin textures in momentum space in a photonic crystal slab. These spin textures in momentum space have not been previously noted either in electronic or photonic systems. Breaking the inversion symmetry of a honeycomb photonic crystal gaps out the Dirac cones at the corners of Brillouin zone. The spin textures of photonic bands near the gaps exhibit a meron or antimeron. Unlike the electronic systems, the spin texture of the photonic modes manifests directly in the polarization of the leakage radiation, as the Dirac points can be above the light line. The spin texture provides a direct approach to visualize the local Berry curvature. Our work highlights the significant opportunities of using photonic structures for the exploration of topological spin textures, with potential applications towards topologically robust ways to manipulate polarizations and other modal characteristics of light.

physics.optics↗

Yielding and hardening of flexible fiber packings during triaxial compression

This paper examines the mechanical response of flexible fiber packings subject to triaxial compression. Short fibers yield in a manner similar to typical granular materials in which the deviatoric stress remains nearly constant with increasing strain after reaching a peak value. Interestingly, long fibers exhibit a hardening behavior, where the stress increases rapidly with increasing strain at large strains and the packing density continuously increases. Phase diagrams for classifying the bulk mechanical response as yielding, hardening, or a transition regime are generated as a function of the fiber aspect ratio, fiber-fiber friction coefficient, and confining pressure. Large fiber aspect ratio, large fiber-fiber friction coefficient, and large confining pressure promote hardening behavior. The hardening packings can support much larger loads than the yielding packings contributing to the stability and consolidation of the granular structure, but larger internal axial forces occur within fibers.

cond-mat.soft↗

Strict entanglement monotonicity under local operations and classical communication

Entanglement monotone is defined as a convex measure of entanglement that does not increase on average under local operations and classical communication (LOCC). Here we call an entanglement monotone a strict entanglement monotone (SEM) if it decreases strictly on average under LOCC. We show that, for any convex roof extended entanglement monotone that on pure states is given by a function of the reduced states, if the function is strictly concave, then it is a SEM. Moreover, we prove that the negativity and the relative entropy of entanglement, which are not defined by the convex roof structure, are also SEMs. In addition, if the squashed entanglement could be obtained by some optimal extension, then it is a SEM as well. Our results imply that entanglement is strictly decreasing on average under LOCC.

quant-ph↗

Monogamy of the Entanglement of Formation

We show that any measure of entanglement that on pure bipartite states is given by a strictly concave function of the reduced density matrix is monogamous on pure tripartite states. This includes the important class of bipartite measures of entanglement that reduce to the (von Neumann) entropy of entanglement. Moreover, we show that the convex roof extension of such measures (e.g., entanglement of formation) are monogamous also on \emph{mixed} tripartite states. To prove our results, we use the definition of monogamy without inequalities, recently put forward[Gour and Guo, Quantum \textbf{2}, 81 (2018)]. Our results promote the theme that monogamy of entanglement is a property of quantum entanglement and not an attribute of some particular measures of entanglement.

quant-ph↗

MSFD:Multi-Scale Receptive Field Face Detector

We aim to study the multi-scale receptive fields of a single convolutional neural network to detect faces of varied scales. This paper presents our Multi-Scale Receptive Field Face Detector (MSFD), which has superior performance on detecting faces at different scales and enjoys real-time inference speed. MSFD agglomerates context and texture by hierarchical structure. More additional information and rich receptive field bring significant improvement but generate marginal time consumption. We simultaneously propose an anchor assignment strategy which can cover faces with a wide range of scales to improve the recall rate of small faces and rotated faces. To reduce the false positive rate, we train our detector with focal loss which keeps the easy samples from overwhelming. As a result, MSFD reaches superior results on the FDDB, Pascal-Faces and WIDER FACE datasets, and can run at 31 FPS on GPU for VGA-resolution images.

cs.CV↗

Multi-Matrix Post-Processing for Quantum Key Distribution

Post-processing is a significant step in quantum key distribution(QKD), which is used for correcting the quantum-channel noise errors and distilling identical corrected keys between two distant legitimate parties. Efficient error reconciliation protocol, which can lead to an increase in the secure key generation rate, is one of the main performance indicators of QKD setups. In this paper, we propose a multi-low-density parity-check codes based reconciliation scheme, which can provide remarkable perspectives for highly efficient information reconciliation. With testing our approach through data simulation, we show that the proposed scheme combining multi-syndrome-based error rate estimation allows a more accurate estimation about the error rate as compared with random sampling and single-syndrome estimation techniques before the error correction, as well as a significant increase in the efficiency of the procedure without compromising security and sacrificing reconciliation efficiency.

quant-ph↗

TechKG: A Large-Scale Chinese Technology-Oriented Knowledge Graph

Knowledge graph is a kind of valuable knowledge base which would benefit lots of AI-related applications. Up to now, lots of large-scale knowledge graphs have been built. However, most of them are non-Chinese and designed for general purpose. In this work, we introduce TechKG, a large scale Chinese knowledge graph that is technology-oriented. It is built automatically from massive technical papers that are published in Chinese academic journals of different research domains. Some carefully designed heuristic rules are used to extract high quality entities and relations. Totally, it comprises of over 260 million triplets that are built upon more than 52 million entities which come from 38 research domains. Our preliminary ex-periments indicate that TechKG has high adaptability and can be used as a dataset for many diverse AI-related applications. We released TechKG at: http://www.techkg.cn.

cs.AI↗

Dynamics of spin-orbit-coupled cold atomic gases in a Floquet lattice with an impurity

In this study, we have studied the quantum tunneling of a single spin-orbit-coupled atom held in a periodically modulated optical lattice with an impurity. At the pseudocollapse points of quasienergy bands, where the dynamical localization takes place globally, two types of local second-order tunneling processes appear beyond expectation between the two nearest-neighbor sites of the impurity with the spin unchanged and with impurity site population negligible all the time, when the impurity potential is far off-resonant with the driving field. Though tunneling behaviors of the two types seem to be the same, they are believed to involve two distinct mechanisms: one is related to spin-independent process, while the other is to spin-dependent tunneling process. The two types of second-order processes can be identified by means of resonant tunneling with or without spin-flipping by tuning the impurity potential to be in resonance with the driving field. In the Floquet picture, the second-order processes are manifested as subtle and fine avoided crossings of quasienergy spectrums near the pseudocollapse region. These results are confirmed analytically on the basis of effective three-site model and multiple-time-scale asymptotic perturbative method, and may be exploited for engineering the spin-dependent quantum transport in realistic experiments.

quant-ph↗

Monogamy of entanglement without inequalities

We provide a fine-grained definition for monogamous measure of entanglement that does not invoke any particular monogamy relation. Our definition is given in terms an equality, as oppose to inequality, that we call the "disentangling condition". We relate our definition to the more traditional one, by showing that it generates standard monogamy relations. We then show that all quantum Markov states satisfy the disentangling condition for any entanglement monotone. In addition, we demonstrate that entanglement monotones that are given in terms of a convex roof extension are monogamous if they are monogamous on pure states, and show that for any quantum state that satisfies the disentangling condition, its entanglement of formation equals the entanglement of assistance. We characterize all bipartite mixed states with this property, and use it to show that the G-concurrence is monogamous. In the case of two qubits, we show that the equality between entanglement of formation and assistance holds if and only if the state is a rank 2 bipartite state that can be expressed as the marginal of a pure 3-qubit state in the W class.

quant-ph↗

Beating the channel capacity limit for superdense coding with entangled ququarts

Quantum superdense coding protocols enhance channel capacity by using shared quantum entanglement between two users. The channel capacity can be as high as 2 when one uses entangled qubits. However, this limit can be surpassed by using high-dimensional entanglement. We report an experiment that exceeds the limit using high-quality entangled ququarts with fidelities up to 0.98, demonstrating a channel capacity of $2.09\pm0.01$. The measured channel capacity is also higher than that obtained when transmitting only one ququart. We use the setup to transmit a five-color image with a fidelity of 0.952. Our experiment shows the great advantage of high-dimensional entanglement and will stimulate research on high-dimensional quantum information processes.

quant-ph↗

Any entanglement of assistance is polygamous

We propose a condition for a measure of quantum correlation to be polygamous without the traditional polygamy inequality. It is shown to be equivalent to the standard polygamy inequalities for any continuous measure of quantum correlation with the polygamy power. We then show that any entanglement of assistance is polygamous but not monogamous and any faithful entanglement measure is not polygamous.

quant-ph↗

Observation of stronger-than-binary correlations with entangled photonic qutrits

We present the first experimental confirmation of the quantum-mechanical prediction of stronger-than-binary correlations. These are correlations that cannot be explained under the assumption that the occurrence of a particular outcome of an $n \ge 3$-outcome measurement is due to a two-step process in which, in the first step, some classical mechanism precludes $n-2$ of the outcomes and, in the second step, a binary measurement generates the outcome. Our experiment uses pairs of photonic qutrits distributed between two laboratories, where randomly chosen three-outcome measurements are performed. We report a violation by {9.3} standard deviations of the optimal inequality for nonsignaling binary correlations.

quant-ph↗