Subjects: Computer Science >> Integration Theory of Computer Science submitted time 2019-01-03 Cooperative journals: 《计算机应用研究》
Abstract： Aiming at the sparseness and low prediction accuracy of traditional collaborative filtering algorithms, this paper proposed a hybrid recommendation algorithm based on restricted Boltzmann machine and weighted Slope One. Firstly, it use the preliminary filling of the scoring matrix by the restricted Boltzmann machine to alleviate the sparseness problem of the data. Then, it introduced the project attribute information through a hybrid project similarity calculation method. Finally, it adopted the second prediction by the weighted Slope One algorithm to improve the recommended effect. Experiments on the MovieLens100K dataset show that the combination of the two algorithms increases the accuracy of the recommendation.
Subjects: Computer Science >> Integration Theory of Computer Science submitted time 2018-12-13 Cooperative journals: 《计算机应用研究》
Abstract： In order to solve the shortcomings of current Hadoop cluster inherent scheduling distributed methods in heterogeneous resource environments, this paper proposed an adaptive scheduling algorithm NCAS (Node Capacity Adaptive Scheduling) based on the node capability. Firstly, NCAS algorithm calculated the scheduling factor based on node performance and task characteristics; Secondly, the scheduling factor determined the amount of data and the number of task slot that each node should be assigned; Finally, NCAS algorithm dispatched data and tasks more into fast nodes and less into slow nodes. Experimental results show that, compared with the traditional scheduling algorithm, NCAS algorithm can greatly reduce the number of speculative tasks, significantly reduce the job completion time. It also can improve the task execution efficiency .
Subjects: Computer Science >> Integration Theory of Computer Science submitted time 2018-11-29 Cooperative journals: 《计算机应用研究》
Abstract： The location-based hierarchical access scheme based on attribute encryption allows users to flexibly set their own location access information according to their own situation. Not only solving the problem of location sharing in social networks, but also improving the algorithm to improve the decryption efficiency. However, during the operation of the system, there is a possibility that the user has corrected his own attribute information or the private key may be leaked during the operation, supporting the withdrawal is very necessary for system security. Based on this, a location hierarchical attribute encryption scheme supporting undo is proposed, which outsources part of the decryption operation to the decryption server and combines the method of two-factor identity authentication. This solution reduces the user's computational cost and improves the security of the algorithm.
Subjects: Computer Science >> Integration Theory of Computer Science submitted time 2018-05-20 Cooperative journals: 《计算机应用研究》
Abstract： The attribute encryption scheme based on file hierarchy is efficient and low in the cloud storage environment, but the access structure itself contains sensitive information, there is the risk of user information leakage and easy to be stolen. Aiming at this problem, this paper proposed a file-level attribute encryption scheme with hidden access structure. The scheme improved the security of the encryption algorithm without affecting the encryption and decryption efficiency, and adopted a two-factor authentication mechanism to achieve a more secure and efficient access control. The results of the study are based on the deterministic bilinear Diffie-Hellman hypothesis, which is proved to be safe under the standard model.
Hits
Hits
Downloads
Comment