Scattering on two Aharonov-Bohm vortices with opposite fluxes

The scattering of an incident plane wave on two Aharonov-Bohm vortices with opposite fluxes is considered in detail. The presence of the vortices imposes non-trivial boundary conditions for the partial waves on a cut joining the two vortices. These conditions result in an infinite system of equations for scattering amplitudes between incoming and outgoing partial waves, which can be solved numerically. The main focus of the paper is the analytic determination of the scattering amplitude in two limits, the small flux limit and the limit of small vortex separation. In the latter limit the dominant contribution comes from the S-wave amplitude. Calculating it, however, still requires solving an infinite system of equations, which is achieved by the Riemann-Hilbert method. The results agree well with the numerical calculations

A new class of (2+1)(2+1)-d topological superconductor with Z8\mathbb{Z}_8 topological classification

The classification of topological states of matter depends on spatial dimension and symmetry class. For non-interacting topological insulators and superconductors the topological classification is obtained systematically and nontrivial topological insulators are classified by either integer or $Z_2$. The classification of interacting topological states of matter is much more complicated and only special cases are understood. In this paper we study a new class of topological superconductors in $(2+1)$ dimensions which has time-reversal symmetry and a $\mathbb{Z}_2$ spin conservation symmetry. We demonstrate that the superconductors in this class is classified by $\mathbb{Z}_8$ when electron interaction is considered, while the classification is $\mathbb{Z}$ without interaction.Comment: 5 pages main text and 3 pages appendix. 1 figur

Algorithms on Minimizing the Maximum Sensor Movement for Barrier Coverage of a Linear Domain

In this paper, we study the problem of moving $n$ sensors on a line to form a barrier coverage of a specified segment of the line such that the maximum moving distance of the sensors is minimized. Previously, it was an open question whether this problem on sensors with arbitrary sensing ranges is solvable in polynomial time. We settle this open question positively by giving an $O(n^2 \log n)$ time algorithm. For the special case when all sensors have the same-size sensing range, the previously best solution takes $O(n^2)$ time. We present an $O(n \log n)$ time algorithm for this case; further, if all sensors are initially located on the coverage segment, our algorithm takes $O(n)$ time. Also, we extend our techniques to the cycle version of the problem where the barrier coverage is for a simple cycle and the sensors are allowed to move only along the cycle. For sensors with the same-size sensing range, we solve the cycle version in $O(n)$ time, improving the previously best $O(n^2)$ time solution.Comment: This version corrected an error in the proof of Lemma 2 in the previous version and the version published in DCG 2013. Lemma 2 is for proving the correctness of an algorithm (see the footnote of Page 9 for why the previous proof is incorrect). Everything else of the paper does not change. All algorithms in the paper are exactly the same as before and their time complexities do not change eithe

Effects of bagging on sugar metabolism and the activity of sugar metabolism related enzymes during fruit development of Qingzhong loquat

To investigate the effects of bagging on sugar metabolism and the activity of sugar metabolism related enzymes in Qingzhong loquat fruit development, the contents of sucrose, glucose and soluble solids as well as the activities of sugar metabolism related enzymes were evaluated. The content of sucrose, glucose and soluble solids increased, while the content of fructose, sorbitol and titratable acidity decreased in ripe fruit in response to bagging. In addition, the activities of acid invertase (AI) and neutral invertase (NI) in the bagged fruit were lower than that in the non-bagged fruit, and the activities of sucrose synthase (SS) and sucrose-phosphate synthase (SPS) in the bagged fruit were higher than that in the non-bagged fruit. The activities of SDH (sorbitol dehydrogenase) and SOX (sorbitol oxidase) in the bagged fruit were lower than those in the non-bagged fruit, but there was no significant difference, whereas the activities of SS and SPS in the bagged fruit were significantly higher than that in the non-bagged fruit, suggesting that bagging mainly increased the products of photosynthesis by enhancing the activities of SS and SPS.Key words: Loquat, bagging, sugar metabolism

Multi-step iterative process with errors for common fixed points of a finite family of nonexpansive mappings

In this paper, we study a multi-step iterative scheme with errors involving N nonexpansive mappings in the Banach space. Some weak and strong convergence theorems for approximation of common fixed points of nonexpansive mappings are proved using this iteration scheme. The results extend and improve the corresponding results of [1]

Top-N Recommendation on Graphs

Recommender systems play an increasingly important role in online applications to help users find what they need or prefer. Collaborative filtering algorithms that generate predictions by analyzing the user-item rating matrix perform poorly when the matrix is sparse. To alleviate this problem, this paper proposes a simple recommendation algorithm that fully exploits the similarity information among users and items and intrinsic structural information of the user-item matrix. The proposed method constructs a new representation which preserves affinity and structure information in the user-item rating matrix and then performs recommendation task. To capture proximity information about users and items, two graphs are constructed. Manifold learning idea is used to constrain the new representation to be smooth on these graphs, so as to enforce users and item proximities. Our model is formulated as a convex optimization problem, for which we need to solve the well-known Sylvester equation only. We carry out extensive empirical evaluations on six benchmark datasets to show the effectiveness of this approach.Comment: CIKM 201

Multi-aspect, robust, and memory exclusive guest os fingerprinting

Precise fingerprinting of an operating system (OS) is critical to many security and forensics applications in the cloud, such as virtual machine (VM) introspection, penetration testing, guest OS administration, kernel dump analysis, and memory forensics. The existing OS fingerprinting techniques primarily inspect network packets or CPU states, and they all fall short in precision and usability. As the physical memory of a VM always exists in all these applications, in this article, we present OS-Sommelier+, a multi-aspect, memory exclusive approach for precise and robust guest OS fingerprinting in the cloud. It works as follows: given a physical memory dump of a guest OS, OS-Sommelier+ first uses a code hash based approach from kernel code aspect to determine the guest OS version. If code hash approach fails, OS-Sommelier+ then uses a kernel data signature based approach from kernel data aspect to determine the version. We have implemented a prototype system, and tested it with a number of Linux kernels. Our evaluation results show that the code hash approach is faster but can only fingerprint the known kernels, and data signature approach complements the code signature approach and can fingerprint even unknown kernels