Range estimation with multifrequency phases is a common practice in localization *** challenge of this method is the phase *** Chinese remainder theorem(CRT)based phase unwrapping algorithms have been proposed to solv...
详细信息
Range estimation with multifrequency phases is a common practice in localization *** challenge of this method is the phase *** Chinese remainder theorem(CRT)based phase unwrapping algorithms have been proposed to solve the problem,where the wavelengths of the multifrequency signals need to be pair-wisely co-prime after they are divided by their greatest common divisor(gcd).This condition may limit the application in *** this paper,a novel way based on a dual-band robust CRT is presented to reconstruct the distance from dual-band wrapped phases,where the pair-wisely co-prime condition is not necessarily *** more wrapped phases are involved to reconstruct the distance,the method can significantly enlarge the reconstruction range compared to the single band solution.
The model for improving the robustness of sparse principal component analysis(PCA)is proposed in this *** of the l2-norm variance utilized in the conventional sparse PCA model,the proposed model maximizes the l1-norm ...
详细信息
The model for improving the robustness of sparse principal component analysis(PCA)is proposed in this *** of the l2-norm variance utilized in the conventional sparse PCA model,the proposed model maximizes the l1-norm variance,which is less sensitive to noise and *** ensure sparsity,lp-norm(0 p 1)constraint,which is more general and effective than l1-norm,is considered.A simple yet efficient algorithm is developed against the proposed *** complexity of the algorithm approximately linearly increases with both of the size and the dimensionality of the given data,which is comparable to or better than the current sparse PCA *** proposed algorithm is also proved to converge to a reasonable local optimum of the *** efficiency and robustness of the algorithm is verified by a series of experiments on both synthetic and digit number image data.
Till today, the study of performance of security protocols of WLAN has been one of research focuses. Whereas, owing to enormous complexity and low efficiency of modeling security protocols, there has been by now no un...
详细信息
A non-interactive, simple and efficient publicly verifiable secret sharing (PVSS) is constructed based on the bi-linear pairing on elliptic curves, which has all advan-tages of Schoenmakers' PVSS in [15]. Moreover...
详细信息
A non-interactive, simple and efficient publicly verifiable secret sharing (PVSS) is constructed based on the bi-linear pairing on elliptic curves, which has all advan-tages of Schoenmakers' PVSS in [15]. Moreover, in the scheme's distribution of shares phase, only using bilinear-ity of bilinear paring, anybody can verify that the par-ticipants received whether correct shares without imple-menting interactive or the non-interactive protocol and without construction so called witness of shares applying Fiat-Shamir's technique. Subsequently, in the scheme's reconstruction of secret phase, the released shares may be verified by anybody with the same method. Since the PVSS need not to implement non-interactive protocol and construct witness in order to prevent malicious players, hence it reduces the overhead of communication. Finally, the PVSS has been extensions to the case without a dealer (or without a trusted center). A distributive publicly ver-ifiable secret sharing (DPVSS) is proposed, which also reduces the overhead of communication. Analysis shows that these schemes are more secure and e®ective than oth-ers, and it can be more applicable in special situation.
Trust management is an important issue in wireless sensor networks (WSNs). In this paper, we introduce the concept of trust and design a distributed eventtriggered trust management model for WSNs. It combines cryptogr...
详细信息
The problem of counting the number of spanning trees is an old topic in graph theory with important applications to reliable network design. Usually, it is desirable to put forward a formula of the number of spanning ...
详细信息
The problem of counting the number of spanning trees is an old topic in graph theory with important applications to reliable network design. Usually, it is desirable to put forward a formula of the number of spanning trees for various graphs, which is not only interesting in its own right but also in practice. Since some large graphs can be composed of some existing smaller graphs by using the product of graphs, the number of spanning trees of such large graph is also closely related to that of the corresponding smaller ones. In this article, we establish a formula for the number of spanning trees in the lexicographic product of two graphs, in which one graph is an arbitrary graph G and the other is a complete multipartite graph. The results extend some of the previous work, which is closely related to the number of vertices and Lapalacian eigenvalues of smaller graphs only.
In the traditional DRM(Digital Rights Management) scheme, each user must buy a license for a digital content ,and can not share this content with his friends. But,with the development of digital content industry ,this...
详细信息
In this paper, an improved Biohashing algorithm is proposed, mainly related to the security issue of the base Biohashing algorithm when an "impostor" steals the Token. At first, based on the principle of the...
详细信息
High Technology Research and Development Program of the China(No.2007AA01Z429,No.20O7AA01z405),the key Program of National Natural Science Foundation of China(No.60633020).334 Chinese Journal of Electronics 2011 (3)Co...
详细信息
High Technology Research and Development Program of the China(No.2007AA01Z429,No.20O7AA01z405),the key Program of National Natural Science Foundation of China(No.60633020).334 Chinese Journal of Electronics 2011 (3)Computability:V(a bP)∈G*G,4(a Pj bP)is efi-ciently *** Difile-Hellman f CDH)in *** P'aP,6P ∈G a8 input,compute abP ∈*** Difile-Hellman (DDH1 in *** P'aP,b P,cP ∈G as input,output yes if c= ab,and no oth-erwise.
This paper introduces a new security property, the transaction anonymity, to extend the existing security properties of privacy protection for biometrics, i.e., biometric irreversibility and indistinguishability. Base...
详细信息
暂无评论