Josephson effect in spin-singlet superconductor/ferromagnetic insulator/spin-triplet superconductor junctions with helical pp-wave states

We study the Josephson effect in spin-singlet superconductor/helical $p$-wave superconductor junctions with a ferromagnetic barrier using the quasiclassical Green function method. It is found that both $\sin{\phi}$-type and $\cos{\phi}$-type current-phase relations always exist, irrespective of the gap symmetries in superconductors. The indispensable condition for the $\sin{\phi}$-type and $\cos{\phi}$-type current is that the magnetization must have a component parallel to the crystallographic $a$ or $b$ axis, which is distinct from the case of $p$-wave superconductor described by a \vect{d}-vector with a uniform direction. The relation between the condition and the symmetries of the gap functions is analysed. We investigate in detail the symmetries and the sign reversal of the Josephson current when the magnetization is rotated.Comment: 9 pages,7 figure

Top-N Recommender System via Matrix Completion

Top-N recommender systems have been investigated widely both in industry and academia. However, the recommendation quality is far from satisfactory. In this paper, we propose a simple yet promising algorithm. We fill the user-item matrix based on a low-rank assumption and simultaneously keep the original information. To do that, a nonconvex rank relaxation rather than the nuclear norm is adopted to provide a better rank approximation and an efficient optimization strategy is designed. A comprehensive set of experiments on real datasets demonstrates that our method pushes the accuracy of Top-N recommendation to a new level.Comment: AAAI 201

Twin Learning for Similarity and Clustering: A Unified Kernel Approach

Many similarity-based clustering methods work in two separate steps including similarity matrix computation and subsequent spectral clustering. However, similarity measurement is challenging because it is usually impacted by many factors, e.g., the choice of similarity metric, neighborhood size, scale of data, noise and outliers. Thus the learned similarity matrix is often not suitable, let alone optimal, for the subsequent clustering. In addition, nonlinear similarity often exists in many real world data which, however, has not been effectively considered by most existing methods. To tackle these two challenges, we propose a model to simultaneously learn cluster indicator matrix and similarity information in kernel spaces in a principled way. We show theoretical relationships to kernel k-means, k-means, and spectral clustering methods. Then, to address the practical issue of how to select the most suitable kernel for a particular clustering task, we further extend our model with a multiple kernel learning ability. With this joint model, we can automatically accomplish three subtasks of finding the best cluster indicator matrix, the most accurate similarity relations and the optimal combination of multiple kernels. By leveraging the interactions between these three subtasks in a joint framework, each subtask can be iteratively boosted by using the results of the others towards an overall optimal solution. Extensive experiments are performed to demonstrate the effectiveness of our method.Comment: Published in AAAI 201