Search

Traditional federated learning faces challenges such as high communication costs, structural heterogeneity,and insufficient privacy protection. To address these issues, this paper proposes a federated learning evolutionary algorithm that applies sparse evolutionary training algorithm to reduce communication costs and integrates local differential privacy protection for participants’ privacy. Additionally, it utilizes the NSGA-Ⅲ algorithm to optimize the network structure and sparsity of the global federated learning model, adjusting the relationship between data availability and privacy protection. This achieves a balance between the effectiveness, communication costs, and privacy of the global federated learning model. Experimental results under unstable communication environments demonstrate that, on the MNIST and CIFAR-10 datasets, compared to the solution with the lowest error rate using the FNSGA-Ⅲ algorithm, the proposed algorithm improves communication efficiency by 57. 19% and 52. 17%, respectively. The participants also achieved（3. 46, 10-4） and（6. 52, 10-4）-local differential privacy. This algorithm can effectively reduce communication costs and protect participant privacy without significantly compromising the accuracy of the global model. [ABSTRACT FROM AUTHOR]

In view of the problems of data sparsity and the diversity in academic paper recom-mender systems,based on CONVNCF, this paper proposed an algorithm of convolution with word and heterogeneous information network for academic paper recommendation ( WN -APR) . Firstly, WN -APR algorithm learned user and paper' s diverse features from different semantics to alleviate the sparsity problem. Then it designed an outer product fusing way to seamlessly combine user features with paper features. Replacing of 2D CNN, this algorithm applied 3 D convolution to mine the influence of different features on the performance. Finally, it modified the BPR loss function to enhance diversity in recommendations. Experimental results on CiteULike-a and CiteULike-t datasets show that WN-APR improves the performance of accuracy and diversity over the baseline models. [ABSTRACT FROM AUTHOR]

This paper proposed a collaborative topic regression model based on the preference for frequent topic sets to address the item-cold-start problem in academic paper recommendation. The algorithm took into account the user' s preference for research hotspots when selected academic papers, and used frequent topic sets to represent research hotspots. So, it expressed user' s preference for research hotspots as the user's preference for frequent topic sets. Firstly, it obtained the papers-topic probability distribution matrix through LDA algorithm and filter out the topics with higher probability. Then, the algorithm mined the frequently-occurring topic sets and gets the relationships between papers and frequent topic sets. Finally, it used the user's preference for frequent topic sets for the prediction of unknown scores. Experiments on CiteULike datasets show that the algorithm improves the recall, accuracy and RMSE over the matrix factorization model and the collaborative topic regression model. [ABSTRACT FROM AUTHOR]

There are many problems in the process of collecting paper data using single data source, such as insufficient data comprehensiveness and limited data collection speed due to website access frequency limitation. Aiming at these problems, this paper proposed a paper data crawling technology for multi-data sources. Firstly, it used the four Chinese document service websites-How Net, Wanfang Data, Weipu, and Chaoxing as data sources, completed the task of crawling and parsing list page data for the search keywords. Then it used the task scheduling strategy to remove repeated data and balance the tasks. Finally, it used multi-threads for each data source to crawl, parse and store the detail information of the papers, and built a website for search and display. Experiments show that under the same crawling and parsing speed, this technology can complete the paper information collection task more comprehensively and efficiently, which proves the effectiveness of this technology. [ABSTRACT FROM AUTHOR]

Considering the unique users of scholars' social networks, this paper proposed a collaborative association model of paper and project data based on scholars' social networks. Firstly, the proposed model used the two-step feature selection method to preprocess the data, removed the irrelevant and redundant features and obtained the effective features that affected the association between the paper and the project. Then it would adopt TVSM to calculate the text similarity between the paper and the project, then formed recommendation sets for different papers/projects. Through the social network (SCHOLAT) data for researchers, the model was implemented and applied to SCHOLAT. The online application situation and user feedback show that the model has good accuracy and practicability. Furthermore, it can more fully explore the potential relationship between the paper and the project, provide users with better academic research management services, and propose a novel research method for analyzing the academic big data. [ABSTRACT FROM AUTHOR]

Aiming at the low efficiency caused by massive academic paper data, this paper proposed a recommendation algorithm method based on the hierarchical mixed model named WSVD ++. According to the structural features of academic papers, the model constructed a weighted bipartite graph model. Firstly, this method extracted the features of each paper and constructed the composite relation graph according to the ratio of different features. Secondly, it used an improved PPR algorithm on the graph to calculate the importance weight of each paper, and then weighed the relation between the user and the paper. Finally, it recommend on the weighted bipartite graph by using SVD + + graph algorithm. The result shows that the proposed algorithm improves the recommended accuracy. The whole process implemented in distributed graph calculation system, that means the method has good expansibility and is suitable for big data processing. [ABSTRACT FROM AUTHOR]

Copyright of Application Research of Computers / Jisuanji Yingyong Yanjiu is the property of Application Research of Computers Edition and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

In order to solve the problems of the current art circulation information is not transparent and the centralized trading authority is asymmetric, this paper proposed a art blockchain certificate traceability model based on three chains. First, in view of the large amount of data in a single piece of artwork information, this paper proposed a blockchain-based symmetric searchable encryption algorithm, and used the interplanetary file system to securely store artwork circulation records on-chain and off-chain. Secondly, for the characteristics of the increasing effective data of artwork information, this paper proposed a blockchain-based inverted fast query and traceability algorithm to help data users realize fast traceability and positioning. At the same time, this paper proposed for the first time that the false information alliance chain stores false art circulation records to realize the processing of false information. Finally, experiments verify the feasibility of the model for big data security storage and fast query traceability. Experiments show that the model is feasible and the query method is efficient. [ABSTRACT FROM AUTHOR]

In view of the problem of fuzziness of rating and tag in traditional collaborative filtering algorithms,this paper used trapezoidal fuzzy number to describe the mapping relationship between rating and satisfaction.The algorithm considered the impact of sparseness of the rating,constructed a new trapezoidal fuzzy rating model to determine the similarity based on fuzzy rating,analyzed the degree of membership between the tag and the item,and constructed a fuzzy item-tag matrix to measure the similarity based on the degree of tag membership.Finally,it used the improved scoring prediction strategy to estimate the score.The experimental results on the MovieLens dataset show that the proposed algorithm improves the prediction accuracy while suppressing the cold start of the project,alleviating the problems of fuzziness and sparseness,which indicates the effectiveness of the proposed algorithm. [ABSTRACT FROM AUTHOR]

In recent years, the number of papers in scientific social network had grown at an explosive rate. It was difficult for users to find papers related to their requirement. And the paper recommendation is one of the key methods to solve this problem. However, most of the existing methods only focus on rating prediction, ignoring the ranking problem between papers. In addition, a lot of social information in scientific social network were not fully considered in the traditional recommendation method. Therefore, this paper proposed an improved List-wise method for scientific paper recommendation. It systematically analyzed The friendship information between users , the titles , abstracts and tags of scientific papers and incorporated theses information into the improved List-wise method. In order to verify the validity of the proposed method , this paper crawled data from a scientific social network , i. e. , CiteULike , to conduct experiments. Experimental results show that the proposed method gets the best recommendation results and performs well in scalability compared to the other traditional recommendation methods. [ABSTRACT FROM AUTHOR]

Paper folding is a common phenomenon. This paper could be referred to as the shell, and the model was the key for efficient simulation of thin shell. Based on the high cost and more complex of physical modeling and based on the accuracy of deformation was not enough of geometric modeling. Therefore, in order to realize the simulation of paper folding, this paper proposed a paper folding simulation based on physical model and geometric model. First of all, based on the hinge model and the mass spring model of paper thin shell model. Second, updating the position of the particle by the implicit integration method, it determined the initial deformation of the paper,and increased the deformation constraint. Lastly, according to Poisson deformation determining the final deformation state. The experimental results show that the hybrid model has the advantages of high speed and high stability. [ABSTRACT FROM AUTHOR]

This paper proposed an electronic voting scheme based on one-time ring signature and blockchain to solve the problems of the current e-voting system in terms of anonymity, transparency and open vote-counting. This paper introduced one-time ring signature, blockchain and stealth address technology. The one-time ring signature technology solved the problem of voter anonymity, repeated voting and public verification. The blockchain technology could ensure the openness and transparency of the e-voting system. The one-time ring signature technology could ensure no one or institution could obtain the voting intermediate result before the voting ends. In order to improve the efficiency of vote-counting,it used the method of key sharing to improve the vote-counting algorithm. Through security and performance analysis, the scheme conforms to the basic security standards of an electronic voting system. [ABSTRACT FROM AUTHOR]

The digital trunking system has the characteristics that the calling mode is mainly group calling and the communication mode is mostly half duplex. For the problem that the traditional user classification method couldn't meet the classification requirements of digital cluster users, this paper proposed a digital cluster user classification method based on improved RFM model. Firstly, it introduced the average speech duration attribute to establish the recency vitality speak (RVS) model. Then, it used the analytic hierarchy process to determine the weight of each parameter in the model. Finally, it used the K-means + + clustering algorithm to classify digital cluster users. The simulation result shows that, by using the user classification method proposed in this paper, the accuracy of digital cluster user classification can reach more than 87. 9% . [ABSTRACT FROM AUTHOR]

Copyright of Application Research of Computers / Jisuanji Yingyong Yanjiu is the property of Application Research of Computers Edition and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

For the security problem of the spread of digital image and the digital image encryption from plaintext and too depend on the chaotic systems, this paper proposed a digital image encryption and monitoring algorithm combined with plaintext-related chaotic mapping and SHA-256. The algorithm used the SHA-256 algorithm to calculate the hash value as record to monitor the spread of digital image. Lorenz chaotic mapping generated the corresponding cryptogram by using forward diffusion, associated plaintext scrambling and backward diffusion to encrypt the digital image. The results show that the algorithm can resist many attacks and achieve the security and concealment of image propagation. [ABSTRACT FROM AUTHOR]

In order to overcome the existing exam management system on the speed and quality of test paper generating links exist defects, the coarse-grained parallel genetic algorithm combined with the adaptive technology, this paper proposed a fast parallel genetic algorithm of adaptive adjustment of population migration. Respectively from the examination of coding scheme, the optimization of genetic strategy, fitness function, crossover mutation operator selection and the selection of fitness value function, etc to carry on the design, had obtained the very good fitness, adopted the tactics of parallel at the same time, improved the running speed of the algorithm. Simulation experiment results show that the algorithm is successfully applied to the automatic group volume, volume and group to improve the efficiency and success rate are obvious, has the very good generality. The algorithm used in the intelligent fast automatic group volume is feasible and effective. [ABSTRACT FROM AUTHOR]

Copyright of Application Research of Computers / Jisuanji Yingyong Yanjiu is the property of Application Research of Computers Edition and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Copyright of Application Research of Computers / Jisuanji Yingyong Yanjiu is the property of Application Research of Computers Edition and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

In order to enhance the security and embedding efficiency and to avert the localization of WPC, this paper presented WSC. The scheme used the generator matrix to create coset, and presented WSC coding scheme based on the mapping of syndrome and coset. At the last, with the image adaptive steganography, this paper provided the stego-flow based on WSC and analysed the capability of WSC. Experiment and analysis show that, compared to WPC, WSC has the higher embedding efficiency, and lower of compute complexity when k is less than or equal to 16. [ABSTRACT FROM AUTHOR]

Copyright of Application Research of Computers / Jisuanji Yingyong Yanjiu is the property of Application Research of Computers Edition and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)