This paper presents a new edge-counting based method using Word Net to compute the similarity. The method achieves a similarity that perfectly fits with human rating and effectively simulate the human tHought process ...
详细信息
This paper presents a new edge-counting based method using Word Net to compute the similarity. The method achieves a similarity that perfectly fits with human rating and effectively simulate the human tHought process that is people prefer to consider more differences when the semantic distance between two word is closer, and vice versa. At last, we weigh up our model against a benchmark set by human similarity judgment, and obtain a much improved result compared with other methods.
Community structure is one of non-trivial topological properties ubiquitously demonstrated in real-world complex networks. Related theories and approaches are of fundamental importance for understanding the functions ...
详细信息
Community structure is one of non-trivial topological properties ubiquitously demonstrated in real-world complex networks. Related theories and approaches are of fundamental importance for understanding the functions of networks. Previously, we have proposed a probabilistic algorithm called the NCMA to efficiently as well as effectively mine communities from real-world networks. Here, we show that the NCMA can be readily extended and applied to address a wide range of network oriented applications beyond community detection including ranking, characterizing and searching real world networks.
Visual voice lip-reading, so the computer can understand what the speakers want to express direction by looking at their lips. Lip reading is the easiest way to compare the early characters and templates from the froz...
详细信息
Visual voice lip-reading, so the computer can understand what the speakers want to express direction by looking at their lips. Lip reading is the easiest way to compare the early characters and templates from the frozen image is stored. It ignores the very nature and time changes. This method is very simple, but it's just simple elements can be classified, then it may not show significant speech recognition services. Behavior was characterized by more and more common. Because of the hidden Markov model is superior (HMM), which can be widely used in speech recognition. In recent years, is also used to lip reading identification. Classical HMM model, so that the two assumptions: hidden assumptions collected: in t+1 the state can only be in this country is not in the state before t; from the hidden visible state hypothesis: only by regulating the t hide the visible state, rather than the previous state. This hypothesis is not very useful in some applications (such as lip reading) is reasonable. Under certain conditions, in the t state not only limits the t-1, but also t-2. Therefore, this study modified the assumptions of the classical HMM to derive a new HMM model and algorithms, and applied to the lip-reading recognition is increasing discrimination.
Image annotation is a challenging problem due to the rapid growing of real world image archives. In this paper, we propose a novel approach to the solving of this problem based on a variant of the support vector clust...
详细信息
Image annotation is a challenging problem due to the rapid growing of real world image archives. In this paper, we propose a novel approach to the solving of this problem based on a variant of the support vector clustering (SVC) algorithm, i.e., the support vector description of clusters. The system has two major components, the training process and the annotating process. In the training process, clusters of image manually annotated by descriptive words are used as training instances. Each cluster is described by a one-cluster SVC model. The proposed model can exploit the advantage of SVC for its ability to delineate cluster boundaries of arbitrary shape. Moreover, the training process of the one-cluster SVC model is formulated as the process of building density estimator for underlying distribution of the cluster. In the annotating process, for a test image, the probability of this instance being generated by each model is computed. And then the relevant words are selected based on the obtained probabilities. Simulated experiments were conducted on the Corel60k data set. The results demonstrate the performance of the proposed algorithm, compared with the performance of other algorithms.
作者：
LI YONGXU LUCollege of Mathematics
Key Laboratory of Symbolic computation and Knowledge Engineering of Ministry of EducationJilin UniversityChangchun130012
In this paper,we study the persistence of lower dimensional tori for random Hamiltonian systems,which shows that majority of the unperturbed tori persist as Cantor fragments of lower dimensional ones under small *** t...
详细信息
In this paper,we study the persistence of lower dimensional tori for random Hamiltonian systems,which shows that majority of the unperturbed tori persist as Cantor fragments of lower dimensional ones under small *** this result,we can describe the stability of the non-autonomous dynamic systems.
We focus on a special class of ideal projectors, subspaces, which possesses two classes of D -invariant polynomial subspaces. The first is a classical type, while the second is a new class. With matrix computation, we...
We focus on a special class of ideal projectors, subspaces, which possesses two classes of D -invariant polynomial subspaces. The first is a classical type, while the second is a new class. With matrix computation, we discretize this class of ideal projectors into a sequence of Lagrange projectors.
Wireless communication, signal broadcasting, strictly limited resources in tags make RFID systems being confronted with many security attacks and privacy disclosure threats. In this paper, an efficient lightweight RFI...
详细信息
Wireless communication, signal broadcasting, strictly limited resources in tags make RFID systems being confronted with many security attacks and privacy disclosure threats. In this paper, an efficient lightweight RFID mutual authentication protocol is proposed, this protocol only requires O(1) work to identify and authenticate a tag in the backend server and is particularly suitable for the low-cost RFID systems because only one-way hash function, XOR operation and concatenation operation are needed in tags. The security and performance of this protocol are analyzed as well by comparing with the related RFID authentication protocols.
We have studied the AC-4 algorithm and then present ordering heuristic forming the new solving algorithm based on the data structure used in the AC-4 algorithm. These algorithms take full advantage of the state inform...
详细信息
This paper addresses the problem of failure diagnosis in component-based discrete event systems. In this paper we propose a method to obtain the set of components when dealing with diagnosis in large complex discrete ...
详细信息
This paper addresses the problem of failure diagnosis in component-based discrete event systems. In this paper we propose a method to obtain the set of components when dealing with diagnosis in large complex discrete event systems. In the new method, before disassembling the system into components, we need to identify whether insert communication events into the system or not. When analyzing the diagnosability, we treat the system containing communication events as a distributed discrete event system. Otherwise we treat the system as a decentralized discrete event system. For the components which are not diagnosable, we propose a method to reconstruct them by utilizing some other components sharing the same communication events with them. This algorithm provides more accurate information of the diagnosability of the system.
Among those researches in Deep Web, compared to research of data extraction which is more mature, the research of data annotation is still at its preliminary stage. Currently, although the approach of applying ontolog...
详细信息
暂无评论