The spectrum of a graph has been widely used to characterize the properties of a graph and extract information from its structure. In this paper, we investigate the performance of Laplacian spectrum and multidimension...
详细信息
The spectrum of a graph has been widely used to characterize the properties of a graph and extract information from its structure. In this paper, we investigate the performance of Laplacian spectrum and multidimensional scaling (MDS) as shape recognition and clustering. Firstly, we extract boundary points to characterize the shape and to construct the Laplacian matrix. Secondly, the structural information about graph is described by using the eigenvalues of the Laplacian matrix. Finally, the given shapes are projected onto the low-dimensional space by performing MDS. Meanwhile, the clustering is achieved via analyzing the distribution of shapes. Comparative experiments on the public data sets demonstrate the validation of the proposed algorithm.
Granular computing which imitates the manner of human thinking is the foundation of artificial intelligence. This paper discusses some operations of granules including quotient intersection, quotient union, quotient c...
详细信息
ISBN:
(纸本)9781615676583
Granular computing which imitates the manner of human thinking is the foundation of artificial intelligence. This paper discusses some operations of granules including quotient intersection, quotient union, quotient complement and quotient difference. Then defines a knowledge space and presents it by a group of basis. Besides we introduce granule spaces and their main properties.
A novel watermarking sharing system having the ability of sharing gray-level secret images with multi-user is proposed. Multiple-based number system is used to split the secret into n meaningless shares, each share is...
详细信息
A multiuser detector based on Schur algorithm is studied in this paper. Because the computational complexity of the conventional decorrelating detector is high while computing the inverse of system matrices, especiall...
详细信息
A multiuser detector based on Schur algorithm is studied in this paper. Because the computational complexity of the conventional decorrelating detector is high while computing the inverse of system matrices, especially when the system is asynchronous and the number of users is huge. The simulation results show that the performance of the multiuser detector based on Schur algorithm is similar to that of decorrelating detector, but it's computational complexity is much lower than decorrelating detector's.
Bandelet transform is an efficient image sparse representation approach which can adaptively approximate the geometrical regularity of image structures. In this paper, a multi-bandelets based method for SAR image comp...
详细信息
In this paper, we investigate the problem of increasing the threshold value of the Shamirpsilas (t, n)-threshold scheme without the dealerpsilas helps, and present a new secret sharing scheme with the threshold value ...
详细信息
In this paper, we investigate the problem of increasing the threshold value of the Shamirpsilas (t, n)-threshold scheme without the dealerpsilas helps, and present a new secret sharing scheme with the threshold value increasing. In this scheme, the dealer needs not to pre-compute or publish any information in advance, all participants cooperate to take on the dealerpsilas role and to complete the share renewing, and each participant only stores one share as the same size of the secret. The results of analysis show that the proposed scheme is secure, and it is perfect and ideal.
With the popularity of wireless communication application in a wide range of industry and daily life, it is more and more important to solve security problems of wireless local area network (WLAN). In this paper, we p...
详细信息
With the popularity of wireless communication application in a wide range of industry and daily life, it is more and more important to solve security problems of wireless local area network (WLAN). In this paper, we propose a new architecture of Wireless Intrusion Detection System (WIDS) for IEEE 802.11 wireless infrastructure networks. The WIDS detect man-in-the-middle-attacks by analyzing the channel gap. Moreover, it can defense the SYN flood attack. The results indicate that the WIDS proposed in this paper is superior at precisely detecting a man-in-thc-middle attack and successfully protecting AP from SYN Flood attack than other existing approaches.
Finding a good similarity algorithm for the use on ontology is important to some techniques such as semantic retrieval, data mining, ontology translations etc. Similarity computation has special characters when applie...
详细信息
Finding a good similarity algorithm for the use on ontology is important to some techniques such as semantic retrieval, data mining, ontology translations etc. Similarity computation has special characters when applied in different domains. However after we learned most of the similarity measures based on ontology, we found that most researchers did not deal with these characters. In this paper we work at the similarity computation based on ontology applied in semantic retrieval. We analyze the characters about this application and problems to be improved, and then we propose an improved semantic similarity computation model. At last, we demonstrate the improvement of this model through experiments.
Identifying protein-protein interaction sites have important connotations ranging from rational drug design to analysis metabolic and signal transduction networks. In this paper, we presented an adapted Bayesian class...
详细信息
Recently, the key of network security is turning from passive detection to active defense. However, most works focused on how fast it can detect the DDoS attack and start defence, and existing methods for differentiat...
详细信息
Recently, the key of network security is turning from passive detection to active defense. However, most works focused on how fast it can detect the DDoS attack and start defence, and existing methods for differentiating DDoS attack packets, especially SYN flooding attacks, are too time-expensive. When SYN flooding started, victim servers have to call for a lot of memory, usually more than 500 MB, to store the attack packets. To make the differentiating scheme more robust, we record the TCP session statistics (IP-TTL) of SYN packets in a traceback-based bloom filter (TBF), and as the attacks start, we match the SYN packets and IP-TTL statistics to differentiate the attacks packets. In addition, we introduce the trace-back strategy to filter the frequently attacked TBF's IP. In comparison with current methods, the proposed approach can both hold back large-scale fake IP and defend IP spoofing. Experiments verify that once applied the proposed method in Snort_inline, the hold back precision is 98.65% and the semi-join queue is almost empty, otherwise, the precision is near to zero and the semi-join queue is full.
暂无评论