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.
Word embeddings encode semantic meanings of words into low-dimension word vectors. In most word embeddings, one cannot interpret the meanings of specific dimensions of those word vectors. Nonnegative matrix factorizat...
详细信息
This study focuses on the application of large models to deal with imbalanced data problems in text classification. In view of the central position of text in web data and the negative impact of class imbalance on cla...
详细信息
Distributed knowledge representation (KR) encodes both entities and relations in a lowdimensional semantic space, which has significantly promoted the performance of relation extraction and knowledge reasoning. In man...
详细信息
Distributed knowledge representation (KR) encodes both entities and relations in a lowdimensional semantic space, which has significantly promoted the performance of relation extraction and knowledge reasoning. In many knowledge graphs (KG), some relations indicate attributes of entities (attributes) and others indicate relations between entities (relations). Existing KR models regard all relations equally, and usually suffer from poor accuracies when modeling one-to-many and many-to-one relations, mostly composed of attribute. In this paper, we distinguish existing KGrelations into attributes and relations, and propose a new KR model with entities, attributes and relations (KR-EAR). The experiment results show that, by special modeling of attribute, KR-EAR can significantly outperform state-of-the-art KR models in prediction of entities, attributes and relations. The source code of this paper can be obtained from https://***/thunlp/KR-EAR.
In (k,m) -DOT1n scheme, 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, the...
详细信息
In (k,m) -DOT1n scheme, 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.
In general,Chinese event factuality is determined by the specific vocabularies and syntactic structures of *** Chinese event factuality corpus is to annotate these specific vocabularies and syntactic *** these informa...
详细信息
In general,Chinese event factuality is determined by the specific vocabularies and syntactic structures of *** Chinese event factuality corpus is to annotate these specific vocabularies and syntactic *** these information is raw and complex,it will result in high computation complexity and low correct rate if we use these information to compute factuality *** paper proposes a 3D representation of Chinese event factuality based on the annotated factual information in a Chinese event factuality *** also presents the transformation rules between the factual information and 3D representation and those between the 3D representation and event *** experimental results demonstrate the effectiveness of our 3D representation.
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.
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.
暂无评论