Interaction-driven topological phase diagram of twisted bilayer MoTe2_2

Twisted bilayer MoTe$_2$ is a promising platform to investigate the interplay between topology and many-body interaction. We present a theoretical study of its interaction-driven quantum phase diagrams based on a three-orbital model, which can be viewed as a generalization of the Kane-Mele-Hubbard model with an additional orbital and realistic Coulomb repulsion. We predict a cascade of phase transitions tuned by the twist angle $\theta$. At the hole filling factor $\nu=1$ (one hole per moir\'e unit cell), the ground state can be in the multiferroic phase with coexisting spontaneous layer polarization and magnetism, the quantum anomalous Hall phase, and finally the topologically trivial magnetic phases, as $\theta$ increases from $1.5^{\circ}$ to $5^{\circ}$. At $\nu=2$, the ground state can have a second-order phase transition between an antiferromagnetic phase and the quantum spin Hall phase as $\theta$ passes through a critical value. The dependence of the phase boundaries on model parameters such as the gate-to-sample distance, the dielectric constant, and the moir\'e potential amplitude is examined. The predicted phase diagrams can guide the search for topological phases in twisted transition metal dichalcogenide homobilayers.Comment: 12 pages, 7 figures. Comments and Collaborations are Welcome

Assessing the Effectiveness of Direct Data Merging Strategy in Long-Term and Large-Scale Pharmacometabonomics

Because of the extended period of clinic data collection and huge size of analyzed samples, the long-term and large-scale pharmacometabonomics profiling is frequently encountered in the discovery of drug/target and the guidance of personalized medicine. So far, integration of the results (ReIn) from multiple experiments in a large-scale metabolomic profiling has become a widely used strategy for enhancing the reliability and robustness of analytical results, and the strategy of direct data merging (DiMe) among experiments is also proposed to increase statistical power, reduce experimental bias, enhance reproducibility and improve overall biological understanding. However, compared with the ReIn, the DiMe has not yet been widely adopted in current metabolomics studies, due to the difficulty in removing unwanted variations and the inexistence of prior knowledges on the performance of the available merging methods. It is therefore urgently needed to clarify whether DiMe can enhance the performance of metabolic profiling or not. Herein, the performance of DiMe on 4 pairs of benchmark datasets was comprehensively assessed by multiple criteria (classification capacity, robustness and false discovery rate). As a result, integration/merging-based strategies (ReIn and DiMe) were found to perform better under all criteria than those strategies based on single experiment. Moreover, DiMe was discovered to outperform ReIn in classification capacity and robustness, while the ReIn showed superior capacity in controlling false discovery rate. In conclusion, these findings provided valuable guidance to the selection of suitable analytical strategy for current metabolomics

Real-time Monitoring for the Next Core-Collapse Supernova in JUNO

Core-collapse supernova (CCSN) is one of the most energetic astrophysical events in the Universe. The early and prompt detection of neutrinos before (pre-SN) and during the SN burst is a unique opportunity to realize the multi-messenger observation of the CCSN events. In this work, we describe the monitoring concept and present the sensitivity of the system to the pre-SN and SN neutrinos at the Jiangmen Underground Neutrino Observatory (JUNO), which is a 20 kton liquid scintillator detector under construction in South China. The real-time monitoring system is designed with both the prompt monitors on the electronic board and online monitors at the data acquisition stage, in order to ensure both the alert speed and alert coverage of progenitor stars. By assuming a false alert rate of 1 per year, this monitoring system can be sensitive to the pre-SN neutrinos up to the distance of about 1.6 (0.9) kpc and SN neutrinos up to about 370 (360) kpc for a progenitor mass of 30$M_{\odot}$ for the case of normal (inverted) mass ordering. The pointing ability of the CCSN is evaluated by using the accumulated event anisotropy of the inverse beta decay interactions from pre-SN or SN neutrinos, which, along with the early alert, can play important roles for the followup multi-messenger observations of the next Galactic or nearby extragalactic CCSN.Comment: 24 pages, 9 figure

Electrically tuned topology and magnetism in twisted bilayer MoTe2_2 at νh=1\nu_h=1

We present a theoretical study of an interaction-driven quantum phase diagram of twisted bilayer MoTe$_2$ at hole filling factor $\nu_h=1$ as a function of twist angle $\theta$ and layer potential difference $V_z$, where $V_z$ is generated by an applied out-of-plane electric field. At $V_z=0$, the phase diagram includes quantum anomalous Hall insulators in the intermediate $\theta$ regime and topologically trivial multiferroic states with coexisting ferroelectricity and magnetism in both small and large $\theta$ regimes. There can be two transitions from the quantum anomalous Hall insulator phase to topologically trivial out-of-plane ferromagnetic phase, and finally to in-plane 120$^\circ$ antiferromagnetic phase as $|V_z|$ increases, or a single transition without the intervening ferromagnetic phase. We show explicitly that the spin vector chirality of various 120$^\circ$ antiferromagnetic states can be electrically switched. We discuss the connection between the experimentally measured Curie-Weiss temperature and the low-temperature magnetic order based on an effective Heisenberg model with magnetic anisotropy.Comment: 6 pages, 4 figure

Harmonics and Interharmonics Detection Based on Synchrosqueezing Adaptive S-Transform

The integration of renewable energy generation and nonlinear power electronic equipment into the grid brings about complex harmonics and interharmonics problems. The amplitude and frequency of harmonics and interharmonics should be detected by high time-frequency (T-F) resolution methods owing to their time-varying transient features. In this paper, a synchrosqueezing adaptive S-transform (SAST) method is proposed to detect the parameters of harmonics. Firstly, the time-frequency spectrum (TFS) of the harmonic signals is acquired by an adaptive S-transform (AST) algorithm. The TFS results are then subjected to synchronous compression, so as to achieve higher time-frequency representation precision. The detection results of the simulation signals show that SAST can achieve a better time-frequency resolution than the S-transform (ST) and synchrosqueezing short-time Fourier transform (SSTFT). In addition, the application of SAST to the analysis of experimental signals also suggests its superiority in the parameter detection of harmonics, especially for the time-varying interharmonics

Harmonics and Interharmonics Detection Based on Synchrosqueezing Adaptive S-Transform

The integration of renewable energy generation and nonlinear power electronic equipment into the grid brings about complex harmonics and interharmonics problems. The amplitude and frequency of harmonics and interharmonics should be detected by high time-frequency (T-F) resolution methods owing to their time-varying transient features. In this paper, a synchrosqueezing adaptive S-transform (SAST) method is proposed to detect the parameters of harmonics. Firstly, the time-frequency spectrum (TFS) of the harmonic signals is acquired by an adaptive S-transform (AST) algorithm. The TFS results are then subjected to synchronous compression, so as to achieve higher time-frequency representation precision. The detection results of the simulation signals show that SAST can achieve a better time-frequency resolution than the S-transform (ST) and synchrosqueezing short-time Fourier transform (SSTFT). In addition, the application of SAST to the analysis of experimental signals also suggests its superiority in the parameter detection of harmonics, especially for the time-varying interharmonics

effective map-matching on the most simplified road network

The effectiveness of map-matching algorithms highly depends on the accuracy and correctness of underlying road networks. In practice, the storage capacity of certain hardware, e.g. mobile devices and embedded systems, is sometimes insufficient to maintain a large digital map for map-matching. Unfortunately, most existing map-matching approaches consider little about this problem. They only apply to environments with information-rich maps, but turn out to be unacceptable for map-matching on simplified road networks. In this paper, we propose a novel map-matching algorithm called Passby to work on most simplified road networks. The storage size of a digital map in disk or memory can be greatly reduced after the simplification. Even under the most simplified situation, i.e., each road segment only consists of a couple of intersection points and omits any other information of it, the experimental results on real dataset show that our Passby algorithm significantly maintains high matching accuracy. Benefiting from the small size of map, simple index structure and heuristic foresight strategy, Passby improves matching accuracy as well as efficiency. © 2012 ACM.Google; Esri; Microsoft; Nokia; NVIDIAThe effectiveness of map-matching algorithms highly depends on the accuracy and correctness of underlying road networks. In practice, the storage capacity of certain hardware, e.g. mobile devices and embedded systems, is sometimes insufficient to maintain a large digital map for map-matching. Unfortunately, most existing map-matching approaches consider little about this problem. They only apply to environments with information-rich maps, but turn out to be unacceptable for map-matching on simplified road networks. In this paper, we propose a novel map-matching algorithm called Passby to work on most simplified road networks. The storage size of a digital map in disk or memory can be greatly reduced after the simplification. Even under the most simplified situation, i.e., each road segment only consists of a couple of intersection points and omits any other information of it, the experimental results on real dataset show that our Passby algorithm significantly maintains high matching accuracy. Benefiting from the small size of map, simple index structure and heuristic foresight strategy, Passby improves matching accuracy as well as efficiency. © 2012 ACM