Xuejun Yang
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Xuejun Yang has a total of 61 co-authors. Here are the top co-authors by number of shared publications:
- Xinhai Xu
Academy of Military Sciences, Beijing, China
4 shared publications Tao Tang
3 shared publications- Yi-Song Lin
PLA General Logistics Department, Logistics Science Research Institute, Beijing 100071, China
3 shared publications Gui-Bin Wang
2 shared publications- Hui-Zhan Yi
National University of Defense Technology
2 shared publications - Jinshu Su
National university of defense technology, Changsha, China
2 shared publications
Latest Publications
- Open Access
Wave-Particle Duality Relation with a Quantum Which-Path Detector
According to the relevant theories on duality relation, the summation of the extractable information of a quanton’s wave and particle properties, which are characterized by interference visibility V and path distinguishability D, respectively, is limited. However, this relation is violated upon quantum superposition between the wave-state and particle-state of the quanton, which is caused by the quantum beamsplitter (QBS). Along another line, recent studies have considered quantum coherence C in the -norm measure as a candidate for the wave property. In this study, we propose an interferometer with a quantum which-path detector (QWPD) and examine the generalized duality relation based on C. We find that this relationship still holds under such a circumstance, but the interference between these two properties causes the full-particle property to be observed when the QWPD system is partially present. Using a pair of polarization-entangled photons, we experimentally verify our analysis in the two-path case. This study extends the duality relation between coherence and path information to the quantum case and reveals the effect of quantum superposition on the duality relation.Open AccessWave-Particle Duality Relation with a Quantum Which-Path Detector
According to the relevant theories on duality relation, the summation of the extractable information of a quanton’s wave and particle properties, which are characterized by interference visibility V and path distinguishability D, respectively, is limited. However, this relation is violated upon quantum superposition between the wave-state and particle-state of the quanton, which is caused by the quantum beamsplitter (QBS). Along another line, recent studies have considered quantum coherence C in the -norm measure as a candidate for the wave property. In this study, we propose an interferometer with a quantum which-path detector (QWPD) and examine the generalized duality relation based on C. We find that this relationship still holds under such a circumstance, but the interference between these two properties causes the full-particle property to be observed when the QWPD system is partially present. Using a pair of polarization-entangled photons, we experimentally verify our analysis in the two-path case. This study extends the duality relation between coherence and path information to the quantum case and reveals the effect of quantum superposition on the duality relation. - Open Access
- 25 November 2016
- Published by Springer Nature in Robotics and Biomimetics
- Vol. 3 (1) , 21
micROS: a morphable, intelligent and collective robot operating system
Robots are developing in much the same way that personal computers did 40 years ago, and robot operating system is the critical basis. Current robot software is mainly designed for individual robots. We present in this paper the design of micROS, a morphable, intelligent and collective robot operating system for future collective and collaborative robots. We first present the architecture of micROS, including the distributed architecture for collective robot system as a whole and the layered architecture for every single node. We then present the design of autonomous behavior management based on the observe–orient–decide–act cognitive behavior model and the design of collective intelligence including collective perception, collective cognition, collective game and collective dynamics. We also give the design of morphable resource management, which first categorizes robot resources into physical, information, cognitive and social domains, and then achieve morphability based on self-adaptive software technology. We finally deploy micROS on NuBot football robots and achieve significant improvement in real-time performance.
- 25 November 2016
- Published by Springer Nature in Robotics and Biomimetics
- Vol. 3 (1) , 21
Open AccessmicROS: a morphable, intelligent and collective robot operating system
Robots are developing in much the same way that personal computers did 40 years ago, and robot operating system is the critical basis. Current robot software is mainly designed for individual robots. We present in this paper the design of micROS, a morphable, intelligent and collective robot operating system for future collective and collaborative robots. We first present the architecture of micROS, including the distributed architecture for collective robot system as a whole and the layered architecture for every single node. We then present the design of autonomous behavior management based on the observe–orient–decide–act cognitive behavior model and the design of collective intelligence including collective perception, collective cognition, collective game and collective dynamics. We also give the design of morphable resource management, which first categorizes robot resources into physical, information, cognitive and social domains, and then achieve morphability based on self-adaptive software technology. We finally deploy micROS on NuBot football robots and achieve significant improvement in real-time performance.
- 1 September 2016
- Published by Elsevier in Neurocomputing
- Vol. 204, 162-171
Online graph regularized non-negative matrix factorization for large-scale datasets
- 1 September 2016
- Published by Elsevier in Neurocomputing
- Vol. 204, 162-171
Online graph regularized non-negative matrix factorization for large-scale datasets
- Open Access
Computing Permanents for Boson Sampling on Tianhe-2 Supercomputer
Boson sampling, a specific quantum computation problem, is widely regarded to be one of the most achievable fields in which quantum machine will outperform the most powerful classical computer in the near term, although up to now no upper-bound of how fast the classical computers can compute matrix permanents, core problem of Boson sampling, has been reported. Here we test the computing of the matrix permanent on Tianhe-2, a supercomputer retaining its position as the world's No. 1 system for six times since June 2013. We arrived at the time (about 77.41~112.44 minutes) to compute the permanent of a $50\times 50$ matrix in an acceptable precision. In addition, we have found that Ryser's algorithm will produce an unacceptable error with the increase of problem scale, compared to Balasubramanian-Bax/Franklin-Glynn's algorithm in the same complexity. The precision issue suggests carefully check in future research of Boson sampling, and comprehensive comparison between quantum computer and classical computer.Open AccessComputing Permanents for Boson Sampling on Tianhe-2 Supercomputer
Boson sampling, a specific quantum computation problem, is widely regarded to be one of the most achievable fields in which quantum machine will outperform the most powerful classical computer in the near term, although up to now no upper-bound of how fast the classical computers can compute matrix permanents, core problem of Boson sampling, has been reported. Here we test the computing of the matrix permanent on Tianhe-2, a supercomputer retaining its position as the world's No. 1 system for six times since June 2013. We arrived at the time (about 77.41~112.44 minutes) to compute the permanent of a $50\times 50$ matrix in an acceptable precision. In addition, we have found that Ryser's algorithm will produce an unacceptable error with the increase of problem scale, compared to Balasubramanian-Bax/Franklin-Glynn's algorithm in the same complexity. The precision issue suggests carefully check in future research of Boson sampling, and comprehensive comparison between quantum computer and classical computer. - 19 March 2015
- Published by Springer Nature
- p. 802-817
Activity Recognition in Still Images with Transductive Non-negative Matrix Factorization
- 19 March 2015
- Published by Springer Nature
- p. 802-817
Activity Recognition in Still Images with Transductive Non-negative Matrix Factorization
- Open Access
- 1 September 2014
- Published by Oxford University Press (OUP) in National Science Review
- Vol. 1 (3) , 332-333
Thoughts on high-performance computing
Parallel computing is the main technical approach for achieving very high performance computing. In the history of parallel computing, there have been three phases, i.e. moderate parallelism described by Amdahl's law [1], large-scale parallelism described by Gustafson's law [2], and high-productivity parallelism described by the productivity evaluation model [3]. In April 2010, IBM Inc. in their report ‘Some Challenges on Road from Petascale to Exascale’ presented five challenges in an exascale system; these stem from power consumption, memory access, communication, reliability, and programming [4], respectively referred to as the energy wall, memory wall, communication wall, reliability wall, and programming wall.
- 1 September 2014
- Published by Oxford University Press (OUP) in National Science Review
- Vol. 1 (3) , 332-333
Open AccessThoughts on high-performance computing
Parallel computing is the main technical approach for achieving very high performance computing. In the history of parallel computing, there have been three phases, i.e. moderate parallelism described by Amdahl's law [1], large-scale parallelism described by Gustafson's law [2], and high-productivity parallelism described by the productivity evaluation model [3]. In April 2010, IBM Inc. in their report ‘Some Challenges on Road from Petascale to Exascale’ presented five challenges in an exascale system; these stem from power consumption, memory access, communication, reliability, and programming [4], respectively referred to as the energy wall, memory wall, communication wall, reliability wall, and programming wall.
- 5 March 2012
- Published by Springer Nature in Journal of Computer Science and Technology
- Vol. 27 (2) , 240-255
PartialRC: A Partial Recomputing Method for Efficient Fault Recovery on GPGPUs
- 5 March 2012
- Published by Springer Nature in Journal of Computer Science and Technology
- Vol. 27 (2) , 240-255
PartialRC: A Partial Recomputing Method for Efficient Fault Recovery on GPGPUs
- 20 January 2012
- Published by China Science Publishing & Media Ltd. in Chinese Journal of Computers
- Vol. 35 (1) , 123-133
An Integrated Energy Optimization Approach for CPU-GPU Heterogeneous Systems Based on Critical Path Analysis
- 20 January 2012
- Published by China Science Publishing & Media Ltd. in Chinese Journal of Computers
- Vol. 35 (1) , 123-133
An Integrated Energy Optimization Approach for CPU-GPU Heterogeneous Systems Based on Critical Path Analysis
- 20 October 2011
- Published by China Science Publishing & Media Ltd. in Journal of Software
- Vol. 22 (10) , 2538-2552
Fault-Torlerance Method for CPU-GPU Heterogeneous System
- 20 October 2011
- Published by China Science Publishing & Media Ltd. in Journal of Software
- Vol. 22 (10) , 2538-2552
Fault-Torlerance Method for CPU-GPU Heterogeneous System
- 14 September 2011
- Published by China Science Publishing & Media Ltd. in Journal of Software
- Vol. 22 (9) , 2222-2234
Power-Aware Parallel Loop Scheduling Method for Heterogeneous System
- 14 September 2011
- Published by China Science Publishing & Media Ltd. in Journal of Software
- Vol. 22 (9) , 2222-2234
Power-Aware Parallel Loop Scheduling Method for Heterogeneous System