ASAP : towards accurate, stable and accelerative penetrating-rank estimation on large graphs

Pervasive web applications increasingly require a measure of similarity among objects. Penetrating-Rank (P-Rank) has been one of the promising link-based similarity metrics as it provides a comprehensive way of jointly encoding both incoming and outgoing links into computation for emerging applications. In this paper, we investigate P-Rank efficiency problem that encompasses its accuracy, stability and computational time. (1) We provide an accuracy estimate for iteratively computing P-Rank. A symmetric problem is to find the iteration number K needed for achieving a given accuracy ε. (2) We also analyze the stability of P-Rank, by showing that small choices of the damping factors would make P-Rank more stable and well-conditioned. (3) For undirected graphs, we also explicitly characterize the P-Rank solution in terms of matrices. This results in a novel non-iterative algorithm, termed ASAP , for efficiently computing P-Rank, which improves the CPU time from O(n 4) to O( n 3 ). Using real and synthetic data, we empirically verify the effectiveness and efficiency of our approaches

Reverse-domain superconductivity in superconductor-ferromagnet hybrids: effect of a vortex-free channel on the symmetry of I-V characteristics

We demonstrate experimentally that the presence of a single domain wall in an underlying ferromagnetic BaFe_{12}O_{19} substrate can induce a considerable asymmetry in the current (I) - voltage (V) characteristics of a superconducting Al bridge. The observed diode-like effect, i.e. polarity-dependent critical current, is associated with the formation of a vortex-free channel inside the superconducting area which increases the total current flowing through the superconducting bridge without dissipation. The vortex-free region appears only for a certain sign of the injected current and for a limited range of the external magnetic field

Probing GPDs in photoproduction processes at hadron colliders

Generalized parton distributions (GPDs) enter QCD factorization theorems for hard exclusive reactions. They encode rich information about hadron partonic structure. We explore a possibility to constrain GPDs in experiments at LHC considering two different exclusive processes: the timelike Compton scattering and the photoproduction of heavy vector mesons.Comment: 6 pages, 2 figures; presented at PHOTON 2015: International Conference on the Structure and the Interactions of the Photon, Novosibirsk, Russia, 15 - 19 June, 2015. arXiv admin note: text overlap with arXiv:1411.375