Abstract In order to eliminate data redundancy of spatiotemporal database, and flexibly create spatiotemporal association patterns, and fast discover spatiotemporal association rules, firstly, this paper adopts event-coverage to create spatiotemporal mining database; the method can divide the spatiotemporal domain into some spatiotemporal transaction cells, where each cell is made of attribute values and spatiotemporal predicate values created by the concept generalization method. Then we propose... In order to eliminate data redundancy of spatiotemporal database, and flexibly create spatiotemporal association patterns, and fast discover spatiotemporal association rules, firstly, this paper adopts event-coverage to create spatiotemporal mining database; the method can divide the spatiotemporal domain into some spatiotemporal transaction cells, where each cell is made of attribute values and spatiotemporal predicate values created by the concept generalization method. Then we propose a novel algorithm of spatiotemporal association rules mining based on event-coverage, which can make each spatiotemporal association pattern be mapped to a mixed radix numeral, and uses power set to compute the support. The algorithm adopts simple data structure to discover frequent spatiotemporal association patterns, it only needs to read the database once, and need not generate candidate for mining spatiotemporal association patterns. Because of them, the algorithm overcomes these disadvantages of traditional classical algorithms for discovering frequent patterns. Finally, we discuss the optimal application environments of the algorithm to mine spatiotemporal association rules. For discovering frequent spatiotemporal association patterns on the application environments, these experimental results indicate that the algorithm is better than these traditional classical mining frameworks, particularly, the Apriori framework and the FP-growth framework. Read More Read Less

Abstract In view of the deficiency of the present attribute weight methods based on the rough sets theory, the author proposes one new comprehensive attribute weight method through studying deeply attribute importance on the basis of rough sets theory. The proposed method considers objective weight and subjective weight. The objective weight includes three factors, named as the importance of the attribute itself, the increment... In view of the deficiency of the present attribute weight methods based on the rough sets theory, the author proposes one new comprehensive attribute weight method through studying deeply attribute importance on the basis of rough sets theory. The proposed method considers objective weight and subjective weight. The objective weight includes three factors, named as the importance of the attribute itself, the increment of mutual information, and its own information entropy. The subjective weight is obtained by the experts with prior knowledge in the field. Experiment results prove that the new method not only overcomes the deficiency of the existing weight methods, but also is more in line with the actual situation. Read More Read Less

Abstract This paper proposes two integrity verification schemes based on Schnorr Signature Scheme, which are named Safety Integrity Verification Scheme (SIVS) and Efficient Integrity Verification Scheme (EIVS). In the two verification schemes, for the user’s each challenge, the cloud storage server chooses randomly the sets of file blocks and verification blocks to generate response values, and the user uses the set of signatures to... This paper proposes two integrity verification schemes based on Schnorr Signature Scheme, which are named Safety Integrity Verification Scheme (SIVS) and Efficient Integrity Verification Scheme (EIVS). In the two verification schemes, for the user’s each challenge, the cloud storage server chooses randomly the sets of file blocks and verification blocks to generate response values, and the user uses the set of signatures to verify response values. That is to check whether the cloud storage server preserves perfectly the user’s file or not. SIVS gives double integrity verification guarantee to cloud storage data. EIVS has more efficient verification guarantee in computational costs than SIVS. According to the different needs of users, EIVS cooperates with SIVS to improve efficiency when checking the integrity of cloud storage data. Compared with other schemes, at the same level of security, the two cooperative schemes get better integrity verification guarantee, and pay lower computational costs. Read More Read Less