Identification-method research for open-source software ecosystems

In recent years, open-source software (OSS) development has grown, with many developers around the world working on different OSS projects. A variety of open-source software ecosystems have emerged, for instance, GitHub, StackOverflow, and SourceForge. One of the most typical social-programming and code-hosting sites, GitHub, has amassed numerous open-source-software projects and developers in the same virtual collaboration platform. Since GitHub itself is a large open-source community, it hosts a collection of software projects that are developed together and coevolve. The great challenge here is how to identify the relationship between these projects, i.e., project relevance. Software-ecosystem identification is the basis of other studies in the ecosystem. Therefore, how to extract useful information in GitHub and identify software ecosystems is particularly important, and it is also a research area in symmetry. In this paper, a Topic-based Project Knowledge Metrics Framework (TPKMF) is proposed. By collecting the multisource dataset of an open-source ecosystem, project-relevance analysis of the open-source software is carried out on the basis of software-ecosystem identification. Then, we used our Spectral Clustering algorithm based on Core Project (CP-SC) to identify software-ecosystem projects and further identify software ecosystems. We verified that most software ecosystems usually contain a core software project, and most other projects are associated with it. Furthermore, we analyzed the characteristics of the ecosystem, and we also found that interactive information has greater impact on project relevance. Finally, we summarize the Topic-based Project Knowledge Metrics Framework

A novel data analytic model for mining user insurance demands from microblogs

This paper proposes a method based on LDA model and Word2Vec for analyzing Microblog users' insurance demands. First of all, we use LDA model to analyze the text data of Microblog user to get their candidate topic. Secondly, we use CBOW model to implement topic word vectorization and use word similarity calculation to expand it. Then we use K-means model to cluster the expanded words and redefine the topic category. Then we use the LDA model to extract the keywords of various insurance information on the “Pingan Insurance” website and analyze the possibility of users with different demands to purchase various types of insurance with the help of word vector similarity. Finally, the validity of the method in this paper is verified against Microblog user information. The experimental results show that the accuracy, recall rate and F1 value of the LDA-CBOW extending method have been proposed compared with that of the traditional LDA model, respectively, which proves the feasibility of this method. The results of this paper will help insurance companies to accurately grasp the preferences of Microblog users, understand the potential insurance needs of users timely, and lay a foundation for personalized recommendation of insurance products

Cryptanalysis of a multi-party quantum key agreement protocol with single particles

Recently, Sun et al. [Quant Inf Proc DOI: 10.1007/s11128-013-0569-x] presented an efficient multi-party quantum key agreement (QKA) protocol by employing single particles and unitary operations. The aim of this protocol is to fairly and securely negotiate a secret session key among $N$ parties with a high qubit efficiency. In addition, the authors claimed that no participant can learn anything more than his/her prescribed output in this protocol, i.e., the sub-secret keys of the participants can be kept secret during the protocol. However, here we points out that the sub-secret of a participant in Sun et al.'s protocol can be eavesdropped by the two participants next to him/her. In addition, a certain number of dishonest participants can fully determine the final shared key in this protocol. Finally, we discuss the factors that should be considered when designing a really fair and secure QKA protocol.Comment: 7 page

Number-resolved master equation approach to quantum transport under the self-consistent Born approximation

We construct a particle-number(n)-resolved master equation (ME) approach under the self-consistent Born approximation (SCBA) for quantum transport through mesoscopic systems. The formulation is essentially non-Markovian and incorporates the interlay of the multi-tunneling processes and many-body correlations. The proposed n-SCBA-ME goes completely beyond the scope of the Born-Markov master equation, being applicable to transport under small bias voltage, in non-Markovian regime and with strong Coulomb correlations. For steady state, it can recover not only the exact result of noninteracting transport under arbitrary voltages, but also the challenging nonequilibrium Kondo effect. Moreover, the n-SCBA-ME approach is efficient for the study of shot noise.We demonstrate the application by a couple of representative examples, including particularly the nonequilibrium Kondo system.Comment: arXiv admin note: substantial text overlap with arXiv:1302.638

Self-Learning Determinantal Quantum Monte Carlo Method

Self-learning Monte Carlo method [arXiv:1610.03137, 1611.09364] is a powerful general-purpose numerical method recently introduced to simulate many-body systems. In this work, we implement this method in the framework of determinantal quantum Monte Carlo simulation of interacting fermion systems. Guided by a self-learned bosonic effective action, our method uses a cumulative update [arXiv:1611.09364] algorithm to sample auxiliary field configurations quickly and efficiently. We demonstrate that self-learning determinantal Monte Carlo method can reduce the auto-correlation time to as short as one near a critical point, leading to $\mathcal{O}(N)$-fold speedup. This enables to simulate interacting fermion system on a $100\times 100$ lattice for the first time, and obtain critical exponents with high accuracy.Comment: 5 pages, 4 figure