Journal editors are putting a lot of effort into selecting appropriate reviewers for fair and reliable peer review of submitted manuscripts. Editors consider whether the reviewers have no affinity with any of the authors of manuscripts and have sufficient expertise in reviewing the manuscripts. The affinity can be evaluated by whether any of the reviewers has been a coauthor and/or a coworker in a common institution with any of the authors of the manuscript. The expertise depends on the similarity of the research topic between the reviewer's published papers and the submitted manuscripts. In this paper we propose an algorithm to recommend appropriate reviewers to editors, based on the assessment of these scholarly activities and achievements. To implement this algorithm, TextRank and GenSim library are used to extract feature sets from abstract and introduction sections of both submitted manuscripts and the reviewer candidates' papers. Based on the extracted feature sets, affinity and expertise check are implemented. An experiment has been conducted with a data set of over 1,000 papers in the field of DB research to evaluate the performance of this algorithm. The experiment consists of affinity check by using 2-mode network matrix operations and expertise check based on Max Similarity and/or topic clustering. Experimental results show that the recommendation algorithm is reasonable on the basis of scholarly activity assessment and achievements. Our method is designed to optimize the reviewer pool for each journal, client, and this algorithm is designed with an open license and has the advantage of being free to use and operate. In addition, our algorithm has the advantage of journal-specific optimization by designing to adjust the expertise of the reviewer selection and the weights for exclusion of interests to reflect journal-specific policies.
In this paper, we take an algebraic approach to the generalized DGHV scheme without using bootstrapping technique. We investigate the homomorphic evaluation algorithm in detail and provide several sufficient conditions for correct homomorphic evaluation of arbitrary polynomial circuits. Compared with the bootstrapping procedure, we show that our approach is much simpler and more efficient. Moreover, we prove that both of the key sizes are actually bounded above and that these upper-bounds depend only on the plaintext space and the security parameter. Hence we need only one pair of secret key and public key for correct homomorphic evaluation of all polynomial circuits, which implies the generalized DGHV scheme is a fully homomorphic encryption in itself. Thus our approach shows that the generalized DGHV scheme provides extremely simple and efficient algorithms.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.
hi@scite.ai
10624 S. Eastern Ave., Ste. A-614
Henderson, NV 89052, USA
Copyright © 2024 scite LLC. All rights reserved.
Made with 💙 for researchers
Part of the Research Solutions Family.