Complex dynamical behaviors of compact solitary waves in the perturbed mKdV equationYin, Jiu-Li; Xing, Qian-Qian; Tian, Li-Xin
doi: 10.1088/1674-1056/23/8/080201pmid: N/A
In this paper, we give a detailed discussion about the dynamical behaviors of compact solitary waves subjected to the periodic perturbation. By using the phase portrait theory, we find one of the nonsmooth solitary waves of the mKdV equation, namely, a compact solitary wave, to be a weak solution, which can be proved. It is shown that the compact solitary wave easily turns chaotic from the Melnikov theory. We focus on the sufficient conditions by keeping the system stable through selecting a suitable controller. Furthermore, we discuss the chaotic threshold for a perturbed system. Numerical simulations including chaotic thresholds, bifurcation diagrams, the maximum Lyapunov exponents, and phase portraits demonstrate that there exists a special frequency which has a great influence on our system; with the increase of the controller strength, chaos disappears in the perturbed system. But if the controller strength is sufficiently large, the solitary wave vibrates violently.
Improved locality-sensitive hashing method for the approximate nearest neighbor problemLu, Ying-Hua; Ma, Ting-Huai; Zhong, Shui-Ming; Cao, Jie; Wang, Xin; Al-Dhelaan, Abdullah
doi: 10.1088/1674-1056/23/8/080203pmid: N/A
In recent years, the nearest neighbor search (NNS) problem has been widely used in various interesting applications. Locality-sensitive hashing (LSH), a popular algorithm for the approximate nearest neighbor problem, is proved to be an efficient method to solve the NNS problem in the high-dimensional and large-scale databases. Based on the scheme of p-stable LSH, this paper introduces a novel improvement algorithm called randomness-based locality-sensitive hashing (RLSH) based on p-stable LSH. Our proposed algorithm modifies the query strategy that it randomly selects a certain hash table to project the query point instead of mapping the query point into all hash tables in the period of the nearest neighbor query and reconstructs the candidate points for finding the nearest neighbors. This improvement strategy ensures that RLSH spends less time searching for the nearest neighbors than the p-stable LSH algorithm to keep a high recall. Besides, this strategy is proved to promote the diversity of the candidate points even with fewer hash tables. Experiments are executed on the synthetic dataset and open dataset. The results show that our method can cost less time consumption and less space requirements than the p-stable LSH while balancing the same recall.
Discrete event model-based simulation for train movement on a single-line railwayXu, Xiao-Ming; Li, Ke-Ping; Yang, Li-Xing
doi: 10.1088/1674-1056/23/8/080205pmid: N/A
The aim of this paper is to present a discrete event model-based approach to simulate train movement with the considered energy-saving factor. We conduct extensive case studies to show the dynamic characteristics of the traffic flow and demonstrate the effectiveness of the proposed approach. The simulation results indicate that the proposed discrete event model-based simulation approach is suitable for characterizing the movements of a group of trains on a single railway line with less iterations and CPU time. Additionally, some other qualitative and quantitative characteristics are investigated. In particular, because of the cumulative influence from the previous trains, the following trains should be accelerated or braked frequently to control the headway distance, leading to more energy consumption.
Security of a practical semi-device-independent quantum key distribution protocol against collective attacksWang, Yang; Bao, Wan-Su; Li, Hong-Wei; Zhou, Chun; Li, Yuan
doi: 10.1088/1674-1056/23/8/080303pmid: N/A
Similar to device-independent quantum key distribution (DI-QKD), semi-device-independent quantum key distribution (SDI-QKD) provides secure key distribution without any assumptions about the internal workings of the QKD devices. The only assumption is that the dimension of the Hilbert space is bounded. But SDI-QKD can be implemented in a one-way prepare-and-measure configuration without entanglement compared with DI-QKD. We propose a practical SDI-QKD protocol with four preparation states and three measurement bases by considering the maximal violation of dimension witnesses and specific processes of a QKD protocol. Moreover, we prove the security of the SDI-QKD protocol against collective attacks based on the min-entropy and dimension witnesses. We also show a comparison of the secret key rate between the SDI-QKD protocol and the standard QKD.
An autobias control system for the electrooptic modulator used in a quantum key distribution systemChen, Wen-Fen; Wei, Zheng-Jun; Guo, Li; Hou, Li-Yan; Wang, Geng; Wang, Jin-Dong; Zhang, Zhi-Ming; Guo, Jian-Ping; Liu, Song-Hao
doi: 10.1088/1674-1056/23/8/080304pmid: N/A
In a quantum key distribution system, it is crucial to keep the extinction ratio of the coherent pulses stable. This means that the direct current bias point of the electrooptic modulator (EOM) used for generating coherent pulses must be locked. In this paper, an autobias control system based on a lock-in-amplifier for the EOM is introduced. Its drift information extracting theory and control method are analyzed comprehensively. The long term drift of the extinction ratio of the coherent pulses is measured by a single photon detector, which indicates that the autobias control system is effective for stabilizing the bias point of the EOM.