With the development of the Internet, user-generated data has been growing tremendously in Web 2.0 era. Facing such a big volume of resources in folksonomy, people need a method of fast exploration and indexing to fin...
详细信息
With the development of the Internet, user-generated data has been growing tremendously in Web 2.0 era. Facing such a big volume of resources in folksonomy, people need a method of fast exploration and indexing to find their demanded data. To achieve this goal, contextual information is indispensable and valuable to understand user preference and purpose. In sociolinguistics, context can be mainly categorized as verbal context and social context. Comparing with verbal context, social context not only requires domain knowledge to pre-define contextual attributes but also acquires additional data from users. However, there is no research of addressing irrelevant contextual factors for verbal context model so far. The dominating set from verbal context proposed in this paper is to fill this blank. We present the verbal context in folksonomy to capture the user intention, and propose a dominating set discovering method for this verbal context model to prune the irrelevant contextual factors and keep the major characteristics at the same time. Furthermore, the experiments, which are conducted on a public data set, show that the proposed method gives convincing results.
Though many hierarchical structures have been proposed to analyze the finer or coarser relationships between two granulation spaces, these structures can only be used to compare the single granulation spaces. However,...
详细信息
Though many hierarchical structures have been proposed to analyze the finer or coarser relationships between two granulation spaces, these structures can only be used to compare the single granulation spaces. However, it should be noticed that the concept of multigranulation plays a fundamental role in the development of granular computing. Therefore, the comparison between two multigranulation spaces has become a necessity. To solve such problem, two types of the multigranulation spaces are considered： one is the partition-based multigranulation space, the other is the covering-based multigranulation space. Three different hierarchical structures are then proposed on such two multigranulation spaces, respectively. Not only the properties about these hierarchical structures are discussed, but also the relationships between these hierarchical structures and the multigranulation rough sets are deeply investigated. It is shown that the first hierarchical structure is consistent with the monotonic varieties of optimistic multigranulation rough set, and the second hierarchical structure is consistent to the monotonic varieties of pessimistic multigranulation rough set, the third hierarchical structure is consistent to the monotonic varieties of both optimistic and pessimistic multigranulation rough sets.
The social network is a main tunnel of rumor spreading. Previous studies concentrated on a static rumor spreading. The content of the rumor is invariable during the whole spreading process. Indeed, the rumor evolves c...
详细信息
The social network is a main tunnel of rumor spreading. Previous studies concentrated on a static rumor spreading. The content of the rumor is invariable during the whole spreading process. Indeed, the rumor evolves constantly in its spreading process, which grows shorter, more concise, more easily grasped, and told. In an early psychological experiment, researchers found about 70% of details in a rumor were lost in the first six mouth-to-mouth transmissions. Based on these observations, we investigate rumor spreading on social networks, where the content of the rumor is modified by the individuals with a certain probability. In the scenario, they have two choices, to forward or to modify. As a forwarder, an individual disseminates the rumor directly to their neighbors. As a modifier, conversely, an individual revises the rumor before spreading it out. When the rumor spreads on the social networks, for instance, scale-free networks and small-world networks, the majority of individuals actually are infected by the multirevised version of the rumor, if the modifiers dominate the networks. The individuals with more social connections have a higher probability to receive the original rumor. Our observation indicates that the original rumor may lose its influence in the spreading process. Similarly, a true information may turn out to be a rumor as well. Our result suggests the rumor evolution should not be a negligible question, which may provide a better understanding of the generation and destruction of a rumor.
We construct a general Verifiable Fully Homomorphic Encryption, using the existed Fully Homomorphic Encryption schemes. The main appeal of the scheme is the verifiability of Evaluate function. Its security and other p...
详细信息
Answer set programming (ASP) has become an important tool for knowledge representation and reasoning. Inconsistency processing in ASP provides a way for reasoning of inconsistent knowledge. In this paper, we present a...
详细信息
ISBN:
(纸本)9781849195379
Answer set programming (ASP) has become an important tool for knowledge representation and reasoning. Inconsistency processing in ASP provides a way for reasoning of inconsistent knowledge. In this paper, we present a minimal principle based method to process inconsistency in ASP. The method is able to ensure maximum retention of certain knowledge by removing the fewest defeasible rules preferentially. Then, we propose corresponding algorithms for simple logic programs and extended logic programs, and analyze the complexity of our method. After that, we compare this method with related work. Finally, we conclude and indicate the prospect of the further research.
Intermittently Connected Mobile Ad Hoc Networks (ICMANs) are mobile networks in which complete source-to-destination paths do not exist most of the time. This paper proposed a Predictable Adaptive Seed Spray routing (...
详细信息
Intermittently Connected Mobile Ad Hoc Networks (ICMANs) are mobile networks in which complete source-to-destination paths do not exist most of the time. This paper proposed a Predictable Adaptive Seed Spray routing (PASS) for intermittently connected mobile Ad Hoc networks. PASS is a cost-efficient delay-bounded routing protocol without network parameters and provides acceptable and resilient service in the face of challenged environments. Simulations have shown that PASS outperforms existing schemes such as Epidemic, binary spray & wait and AMR with respect to routing cost and adaptability.
YCH scheme is a multi-secret sharing scheme based on two-variable one-way function and Shamir's threshold secret sharing scheme,but the scheme does not have the property of *** paper presents a verifiable multi-se...
详细信息
YCH scheme is a multi-secret sharing scheme based on two-variable one-way function and Shamir's threshold secret sharing scheme,but the scheme does not have the property of *** paper presents a verifiable multi-secret sharing scheme based on YCH scheme,RSA cryptosystem,and Schnorr *** dose not need a secure channel and each participant chooses his secret shadow by himself,and it can defend positive attack of dealer and participants.
In（k,m）-DOT~nScheme,the sender's privacy can not be guaranteed,even if the protocol itself is security,if we can not ensure that a receiver gets information from at most k *** Naor and Pinkas' s scheme,they ...
详细信息
In（k,m）-DOT~nScheme,the sender's privacy can not be guaranteed,even if the protocol itself is security,if we can not ensure that a receiver gets information from at most k *** Naor and Pinkas' s scheme,they give two solutions that are applicable for the case k>m/2,in Nikov et al.'s scheme,they avoid this problem by means of implementing a m-out-of-m access *** this paper,we put forward a settlement for arbitrary k,in which the receiver only can choose k servers to interactive and solve the problem getting the desired security.
Fault-tolerant recovery in Multicast communication is an important issue. An ideal multicast fault-tolerant approach can save network resources, reduce the delay and cost, realize quick recovery. In this paper, we pro...
详细信息
ISBN:
(纸本)9787900769428
Fault-tolerant recovery in Multicast communication is an important issue. An ideal multicast fault-tolerant approach can save network resources, reduce the delay and cost, realize quick recovery. In this paper, we propose a new multicast fault-tolerant approach-FH-TFTM based on proposed multicast fault-tolerant algorithms. It can go over problems faced in traditional approaches, for example node failure, unpredictable problems, time delay, network cost and loop avoidance. FH-TFTM can reduce consuming network resources, and carry out effectively setting up backup paths.
A novel sliding mode control (SMC) method for indirect current controlled three-phase parallel active power filter is presented in this paper. There are two designed closed-loops in the system, one is the DC voltage c...
详细信息
暂无评论