Searcharxiv⌕ Search

arXiv subjects

Chao Lu

Publications and source records attributed to Chao Lu.

At least 73 records · Page 4Linked to original sources

Kondo scenario of the γ-α phase transition in single crystalline Cerium thin films

The physical mechanism driving the $γ$-$α$ phase transition of face-centre-cubic (fcc) cerium (Ce) remains controversial until now. In this work, high quality single crystalline fcc-Ce thin films were grown on Graphene/6$H$-SiC(0001) substrate, and explored by XRD and ARPES measurement. XRD spectra showed a clear $γ$-$α$ phase transition at $T_{γ-α}\approx$ 50 K, which is retarded by strain effect from substrate comparing with $T_{γ-α}$ (about 140 K) of the bulk Ce metal. However, APRES spectra did not show any signature of $α$-phase emerging in the surface-layer from 300 K to 17 K, which implied that $α$-phase might form at the bulk-layer of our Ce thin films. Besides, an evident Kondo dip near Fermi energy was observed in the APRES spectrum at 80 K, indicting the formation of Kondo singlet states in $γ$-Ce. Furthermore, the DFT+DMFT calculations were performed to simulate the electronic structures and the theoretical spectral functions agreed well with the experimental ARPES spectra. In $γ$-Ce, the behavior of the self-energy's imaginary part at low frequency not only confirmed that the Kondo singlet states emerged at $T_{\rm KS} \geq 80$ K, but also implied that they became coherent states at a lower characteristic temperature ($T_{\rm coh}\sim 40$ K) due to the indirect RKKY interaction among $f$-$f$ electrons. Besides, $T_{\rm coh}$ from the theoretical simulation was close to $T_{γ-α}$ from the XRD spectra. These issues suggested that the Kondo scenario might play an important role in the $γ$-$α$ phase transition of cerium thin films.

cond-mat.str-el↗

MOTS: Multiple Object Tracking for General Categories Based On Few-Shot Method

Most modern Multi-Object Tracking (MOT) systems typically apply REID-based paradigm to hold a balance between computational efficiency and performance. In the past few years, numerous attempts have been made to perfect the systems. Although they presented favorable performance, they were constrained to track specified category. Drawing on the ideas of few shot method, we pioneered a new multi-target tracking system, named MOTS, which is based on metrics but not limited to track specific category. It contains two stages in series: In the first stage, we design the self-Adaptive-matching module to perform simple targets matching, which can complete 88.76% assignments without sacrificing performance on MOT16 training set. In the second stage, a Fine-match Network was carefully designed for unmatched targets. With a newly built TRACK-REID data-set, the Fine-match Network can perform matching of 31 category targets, even generalizes to unseen categories.

cs.CV↗

Achieving 50 femtosecond resolution in MeV ultrafast electron diffraction with a double bend achromat compressor

We propose and demonstrate a novel scheme to produce ultrashort and ultrastable MeV electron beam. In this scheme, the electron beam produced in a photocathode radio-frequency (rf) gun first expands under its own Coulomb force with which a positive energy chirp is imprinted in the beam longitudinal phase space. The beam is then sent through a double bend achromat with positive longitudinal dispersion where electrons at the bunch tail with lower energies follow shorter paths and thus catch up with the bunch head, leading to longitudinal bunch compression. We show that with optimized parameter sets, the whole beam path from the electron source to the compression point can be made isochronous such that the time of flight for the electron beam is immune to the fluctuations of rf amplitude. With a laser-driven THz deflector, the bunch length and arrival time jitter for a 20 fC beam after bunch compression are measured to be about 29 fs (FWHM) and 22 fs (FWHM), respectively. Such an ultrashort and ultrastable electron beam allows us to achieve 50 femtosecond (FWHM) resolution in MeV ultrafast electron diffraction where lattice oscillation at 2.6 THz corresponding to Bismuth A1g mode is clearly observed without correcting both the short-term timing jitter and long-term timing drift. Furthermore, oscillating weak diffuse scattering signal related to phonon coupling and decay is also clearly resolved thanks to the improved temporal resolution and increased electron flux. We expect that this technique will have a strong impact in emerging ultrashort electron beam based facilities and applications.

physics.acc-ph↗

Learning Enabled Dense Space-division Multiplexing through a Single Multimode Fibre

Space-division multiplexing is a promising technology in optical fibre communication to improve the transmission capacity of a single optical fibre. However, the number of channels that can be multiplexed is limited by the crosstalks between channels, and the multiplexing is only applied to few-mode or multi-core fibres. Here, we propose a high-spatial-density channel multiplexing framework employing deep learning for standard multimode fibres (MMF). We present a proof-of-concept experimental system, consisting of a single light source, a single digital-micromirror-device modulator, a single detection camera, and a deep convolutional neural network (CNN) to demonstrate up to 400-channel simultaneous data transmission with accuracy close to 100% over MMFs of different types, diameters and lengths. A novel scalable semi-supervised learning model is proposed to adapt the CNN to the time-varying MMF information channels in real-time, to overcome the environmental changes such as temperature variations and vibrations, and to reconstruct the input data from complex crosstalks among hundreds of channels. This deep-learning based approach is promising to maximize the use of the spatial dimension of MMFs, and to break the present number-of-channel limit in space-division multiplexing for future high-capacity MMF transmission data links.

physics.optics↗

A Study on the Block Relocation Problem: Lower Bound Derivations and Strong Formulations

The block relocation problem (BRP) is a fundamental operational issue in modern warehouse and yard management, which, however, is very challenging to solve. In this paper, to advance our understanding on this problem and to provide a substantial assistance to practice, we (i) introduce a classification scheme and present a rather comprehensive review on all 16 BRP variants; (ii) develop a general framework to derive lower bounds on the number of necessary relocations and demonstrate its connection to existing lower bounds of the unrestricted BRP variants; (iii) propose and employ a couple of new critical substructures concepts to analyze the BRP and obtain a lower bound that dominates all existing ones; (iv) build a new and strong mixed integer programming (MIP) formulation that is adaptable to compute 8 BRP variants, and design a novel MIP-formulation-based iterative procedure to compute exact BRP solutions; (v) extend the MIP formulation to address four typical industrial considerations. Computational results on standard test instances show that the new lower bound is significantly stronger, and our new MIP computational methods have superior performances over a state-of-the-art formulation.

math.OC↗

Co-contributorship Network and Division of Labor in Individual Scientific Collaborations

Collaborations are pervasive in current science. Collaborations have been studied and encouraged in many disciplines. However, little is known how a team really functions from the detailed division of labor within. In this research, we investigate the patterns of scientific collaboration and division of labor within individual scholarly articles by analyzing their co-contributorship networks. Co-contributorship networks are constructed by performing the one-mode projection of the author-task bipartite networks obtained from 138,787 papers published in PLoS journals. Given a paper, we define three types of contributors: Specialists, Team-players, and Versatiles. Specialists are those who contribute to all their tasks alone; team-players are those who contribute to every task with other collaborators; and versatiles are those who do both. We find that team-players are the majority and they tend to contribute to the five most common tasks as expected, such as "data analysis" and "performing experiments". The specialists and versatiles are more prevalent than expected by a random-graph null model. Versatiles tend to be senior authors associated with funding and supervisions. Specialists are associated with two contrasting roles: the supervising role as team leaders or marginal and specialized contributions.

cs.SI↗

Bit-level Optimized Neural Network for Multi-antenna Channel Quantization

Quantized channel state information (CSI) plays a critical role in precoding design which helps reap the merits of multiple-input multiple-output (MIMO) technology. In order to reduce the overhead of CSI feedback, we propose a deep learning based CSI quantization method by developing a joint convolutional residual network (JCResNet) which benefits MIMO channel feature extraction and recovery from the perspective of bit-level quantization performance. Experiments show that our proposed method substantially improves the performance.

cs.IT↗

Analyzing Linguistic Complexity and Scientific Impact

The number of publications and the number of citations received have become the most common indicators of scholarly success. In this context, scientific writing increasingly plays an important role in scholars' scientific careers. To understand the relationship between scientific writing and scientific impact, this paper selected 12 variables of linguistic complexity as a proxy for depicting scientific writing. We then analyzed these features from 36,400 full-text Biology articles and 1,797 full-text Psychology articles. These features were compared to the scientific impact of articles, grouped into high, medium, and low categories. The results suggested no practical significant relationship between linguistic complexity and citation strata in either discipline. This suggests that textual complexity plays little role in scientific impact in our data sets.

cs.CL↗

Distributed vibration sensing based on forward transmission and coherent detection

A novel ultra-long distributed vibration sensing (DVS) system using forward transmission and coherent detection is proposed and experimentally demonstrated. In the proposed scheme, a pair of multi-span optical fibers are deployed for sensing, and a loop-back configuration is used by connecting the two fibers at the far end. The homodyne coherent detection is used to retrieve the phase and state-of-polarization (SOP) fluctuations caused by a vibration while the localization of the vibration is realized by tracking the phase changes along the two fibers. The proposed scheme has the advantage of high signal-to-noise ratio (SNR) and ultra-long sensing range due to the nature of forward transmission and coherent detection. In addition, using forward rather than backward scattering allows detection of high frequency vibration signal over a long sensing range. More than 50dB sensing SNR can be obtained after long-haul transmission. Meanwhile, localization of 400 Hz, 1 kHz and 10 kHz vibrations has been experimentally demonstrated with a spatial resolution of less than 50 m over a total of 1008 km sensing fiber. The sensing length can be further extended to even trans-oceanic distances using more fiber spans and erbium-doped fiber amplifiers (EDFAs), making it a promising candidate for proactive fault detection and localization in long-haul and ultra-long-haul fiber links.

eess.SP↗

Femtosecond relativistic electron beam with reduced timing jitter from THz-driven beam compression

We propose and demonstrate a novel method to reduce the pulse width and timing jitter of a relativistic electron beam through THz-driven beam compression. In this method the longitudinal phase space of a relativistic electron beam is manipulated by a linearly polarized THz pulse in a dielectric tube such that the bunch tail has a higher velocity than the bunch head, which allows simultaneous reduction of both pulse width and timing jitter after passing through a drift. In this experiment, the beam is compressed by more than a factor of four from 130 fs to 28 fs with the arrival time jitter also reduced from 97 fs to 36 fs, opening up new opportunities in using pulsed electron beams for studies of ultrafast dynamics. This technique extends the well known rf buncher to the THz frequency and may have a strong impact in accelerator and ultrafast science facilities that require femtosecond electron beams with tight synchronization to external lasers.

physics.acc-ph↗

Terahertz oscilloscope for recording time information of ultrashort electron beams

We propose and demonstrate a Terahertz (THz) oscilloscope for recording time information of an ultrashort electron beam. By injecting a laser-driven THz pulse with circular polarization into a dielectric tube, the electron beam is swept helically such that the time information is uniformly encoded into the angular distribution that allows one to characterize both the temporal profile and timing jitter of an electron beam. The dynamic range of the measurement in such a configuration is significantly increased compared to deflection with a linearly polarized THz pulse. With this THz oscilloscope, nearly 50-fold longitudinal compression of a relativistic electron beam to about 15 fs (rms) is directly visualized with its arrival time determined with 3 fs accuracy. This technique bridges the gap between streaking of photoelectrons with optical lasers and deflection of relativistic electron beams with radio-frequency deflectors, and should have wide applications in many ultrashort electron beam based facilities.

physics.acc-ph↗

Dual Path Multi-Scale Fusion Networks with Attention for Crowd Counting

The task of crowd counting in varying density scenes is an extremely difficult challenge due to large scale variations. In this paper, we propose a novel dual path multi-scale fusion network architecture with attention mechanism named SFANet that can perform accurate count estimation as well as present high-resolution density maps for highly congested crowd scenes. The proposed SFANet contains two main components: a VGG backbone convolutional neural network (CNN) as the front-end feature map extractor and a dual path multi-scale fusion networks as the back-end to generate density map. These dual path multi-scale fusion networks have the same structure, one path is responsible for generating attention map by highlighting crowd regions in images, the other path is responsible for fusing multi-scale features as well as attention map to generate the final high-quality high-resolution density maps. SFANet can be easily trained in an end-to-end way by dual path joint training. We have evaluated our method on four crowd counting datasets (ShanghaiTech, UCF CC 50, UCSD and UCF-QRNF). The results demonstrate that with attention mechanism and multi-scale feature fusion, the proposed SFANet achieves the best performance on all these datasets and generates better quality density maps compared with other state-of-the-art approaches.

cs.CV↗

On the blow up phenomenon for the mass critical focusing Hartree equation with inverse-square potential

In this paper, we consider the dynamics of the solution to the mass critical focusing Hartree equation with inverse-square potential in the energy space $H^{1}(\mathbb{R}^d)$. The main difficulties are the equation is \emph{not} space-translation invariant and the nonlinearity is non-local. We first prove that if the mass of the initial data is less than that of ground states, then the solution will be global. Although we don't know whether the ground state is unique, we can verify all the ground states have the same, minimal mass threshold. Then at the minimal mass threshold, we can construct the finite-time blow up solution, which is a pseudo-conformal transformation of the ground state, up to the symmetries of the equation. Finally, we establish an mass concentration phenomenon of the finite-time blow up solution to the equation.

math.AP↗

BOTDA Fiber Sensor System Based on FPGA Accelerated Support Vector Regression

Brillouin optical time domain analyzer (BOTDA) fiber sensors have shown strong capability in static long haul distributed temperature/strain sensing. However, in applications such as structural health monitoring and leakage detection, real-time measurement is quite necessary. The measurement time of temperature/strain in a BOTDA system includes data acquisition time and post-processing time. In this work, we propose to use hardware accelerated support vector regression (SVR) for the post-processing of the collected BOTDA data. Ideal Lorentzian curves under different temperatures with different linewidths are used to train the SVR model to determine the linear SVR decision function. The performance of SVR is evaluated under different signal-to-noise ratios (SNRs) experimentally. After the model coefficients are determined, algorithm-specific hardware accelerators based on field programmable gate arrays (FPGAs) are used to realize SVR decision function. During the implementation, hardware optimization techniques based on loop dependence analysis and batch processing are proposed to reduce the execution latency. Our FPGA implementations can achieve up to 42x speedup compared with software implementation on an i7-5960x computer. The post-processing time for 96,100 BGSs along 38.44-km FUT is only 0.46 seconds with FPGA board ZCU104, making the post-processing time no longer a limiting factor for dynamic sensing. Moreover, the energy efficiency of our FPGA implementation can reach up to 226.1x higher than software implementation based on CPU.

eess.SP↗

Learning and Generalizing Motion Primitives from Driving Data for Path-Tracking Applications

Considering the driving habits which are learned from the naturalistic driving data in the path-tracking system can significantly improve the acceptance of intelligent vehicles. Therefore, the goal of this paper is to generate the prediction results of lateral commands with confidence regions according to the reference based on the learned motion primitives. We present a two-level structure for learning and generalizing motion primitives through demonstrations. The lower-level motion primitives are generated under the path segmentation and clustering layer in the upper-level. The Gaussian Mixture Model(GMM) is utilized to represent the primitives and Gaussian Mixture Regression (GMR) is selected to generalize the motion primitives. We show how the upper-level can help to improve the prediction accuracy and evaluate the influence of different time scales and the number of Gaussian components. The model is trained and validated by using the driving data collected from the Beijing Institute of Technology (BIT) intelligent vehicle platform. Experiment results show that the proposed method can extract the motion primitives from the driving data and predict the future lateral control commands with high accuracy.

cs.LG↗

MIMO Channel Information Feedback Using Deep Recurrent Network

In a multiple-input multiple-output (MIMO) system, the availability of channel state information (CSI) at the transmitter is essential for performance improvement. Recent convolutional neural network (NN) based techniques show competitive ability in realizing CSI compression and feedback. By introducing a new NN architecture, we enhance the accuracy of quantized CSI feedback in MIMO communications. The proposed NN architecture invokes a module named long short-term memory (LSTM) which admits the NN to benefit from exploiting temporal and frequency correlations of wireless channels. Compromising performance with complexity, we further modify the NN architecture with a significantly reduced number of parameters to be trained. Finally, experiments show that the proposed NN architectures achieve better performance in terms of both CSI compression and recovery accuracy.

cs.IT↗

A Time Efficient Approach for Decision-Making Style Recognition in Lane-Change Behavior

Fast recognizing driver's decision-making style of changing lanes plays a pivotal role in safety-oriented and personalized vehicle control system design. This paper presents a time-efficient recognition method by integrating k-means clustering (k-MC) with K-nearest neighbor (KNN), called kMC-KNN. The mathematical morphology is implemented to automatically label the decision-making data into three styles (moderate, vague, and aggressive), while the integration of kMC and KNN helps to improve the recognition speed and accuracy. Our developed mathematical morphology-based clustering algorithm is then validated by comparing to agglomerative hierarchical clustering. Experimental results demonstrate that the developed kMC-KNN method, in comparison to the traditional KNN, can shorten the recognition time by over 72.67% with recognition accuracy of 90%-98%. In addition, our developed kMC-KNN method also outperforms the support vector machine (SVM) in recognition accuracy and stability. The developed time-efficient recognition approach would have great application potential to the in-vehicle embedded solutions with restricted design specifications.

eess.SP↗

Examining Scientific Writing Styles from the Perspective of Linguistic Complexity

Publishing articles in high-impact English journals is difficult for scholars around the world, especially for non-native English-speaking scholars (NNESs), most of whom struggle with proficiency in English. In order to uncover the differences in English scientific writing between native English-speaking scholars (NESs) and NNESs, we collected a large-scale data set containing more than 150,000 full-text articles published in PLoS between 2006 and 2015. We divided these articles into three groups according to the ethnic backgrounds of the first and corresponding authors, obtained by Ethnea, and examined the scientific writing styles in English from a two-fold perspective of linguistic complexity: (1) syntactic complexity, including measurements of sentence length and sentence complexity; and (2) lexical complexity, including measurements of lexical diversity, lexical density, and lexical sophistication. The observations suggest marginal differences between groups in syntactical and lexical complexity.

cs.CL↗