A link density clustering algorithm based on automatically selecting density peaks for overlapping community detection

Peer reviewedPostprin

Low magnetic field reversal of electric polarization in a Y-type hexaferrite

Magnetoelectric multiferroics in which ferroelectricity and magnetism coexist have attracted extensive attention because they provide great opportunities for the mutual control of electric polarization by magnetic fields and magnetization by electric fields. From a practical point view, the main challenge in this field is to find proper multiferroic materials with a high operating temperature and great magnetoelectric sensitivity. Here we report on the magnetically tunable ferroelectricity and the giant magnetoelectric sensitivity up to 250 K in a Y-type hexaferrite, BaSrCoZnFe11AlO22. Not only the magnitude but also the sign of electric polarization can be effectively controlled by applying low magnetic fields (a few hundreds of Oe) that modifies the spiral magnetic structures. The magnetically induced ferroelectricity is stabilized even in zero magnetic field. Decayless reproducible flipping of electric polarization by oscillating low magnetic fields is shown. The maximum linear magnetoelectric coefficient reaches a high value of ~ 3.0\times10^3 ps/m at 200 K.Comment: 9 pages, 5 figures, a couple of errors are correcte

Reversal of Thermal Rectification in Quantum Systems

We study thermal transport in anisotropic Heisenberg spin chains using the quantum master equation. It is found that thermal rectification changes sign when the external homogeneous magnetic field is varied. This reversal also occurs when the magnetic field becomes inhomogeneous. Moreover, we can tune the reversal of rectification by temperatures of the heat baths, the anisotropy and size of the spin chains.Comment: 4 pages, 7 figure

Generalized Second Price Auction with Probabilistic Broad Match

Generalized Second Price (GSP) auctions are widely used by search engines today to sell their ad slots. Most search engines have supported broad match between queries and bid keywords when executing GSP auctions, however, it has been revealed that GSP auction with the standard broad-match mechanism they are currently using (denoted as SBM-GSP) has several theoretical drawbacks (e.g., its theoretical properties are known only for the single-slot case and full-information setting, and even in this simple setting, the corresponding worst-case social welfare can be rather bad). To address this issue, we propose a novel broad-match mechanism, which we call the Probabilistic Broad-Match (PBM) mechanism. Different from SBM that puts together the ads bidding on all the keywords matched to a given query for the GSP auction, the GSP with PBM (denoted as PBM-GSP) randomly samples a keyword according to a predefined probability distribution and only runs the GSP auction for the ads bidding on this sampled keyword. We perform a comprehensive study on the theoretical properties of the PBM-GSP. Specifically, we study its social welfare in the worst equilibrium, in both full-information and Bayesian settings. The results show that PBM-GSP can generate larger welfare than SBM-GSP under mild conditions. Furthermore, we also study the revenue guarantee for PBM-GSP in Bayesian setting. To the best of our knowledge, this is the first work on broad-match mechanisms for GSP that goes beyond the single-slot case and the full-information setting