This paper presents a novel representation and matching method for deformable shapes. The proposed approach finds most expressive segments of a deformable shape category called similar and discriminative parts, which ...
详细信息
LS 2 is the logic to reason about the property of trusted computing. However, it lacks the capability of modeling the isolation provided by virtualization which is often involved in previous trusted computing system....
详细信息
LS 2 is the logic to reason about the property of trusted computing. However, it lacks the capability of modeling the isolation provided by virtualization which is often involved in previous trusted computing system. With the support of changed LS 2 , we model three types of isolation. Moreover, we formally analyze the integrity measurement property of TrustVisor proposed recently which provides the isolated execution environment for security-sensitive code.
Trusted platform module (TPM) has little computation capability, and it is the performance bottleneck of remote attestation. In the scenario where the server is the attestation-busy entity which answers attestation re...
详细信息
Trusted platform module (TPM) has little computation capability, and it is the performance bottleneck of remote attestation. In the scenario where the server is the attestation-busy entity which answers attestation requirement frequently, the massive delay is inevitable. Without the modification to TPM, we propose Batch Integrity Report Protocol (BIRP) to overcome the performance bottleneck. B-IRP bundles these requirements in interval as a batch requirement, and creates the response messages for these requirements with one expensive TPM operation. Discussion shows that B-IRP has improved the performance without loss of security.
A novel constant tamper-proofing software watermark technique based on H encryption function is presented. First we split the watermark into smaller pieces before encoding them using CLOC scheme. With the watermark pi...
详细信息
Collective classification, which is represented to classify unobserved nodes simultaneously in networked data is becoming an important research area with applications in several domains, such as the classification of ...
详细信息
Collective classification, which is represented to classify unobserved nodes simultaneously in networked data is becoming an important research area with applications in several domains, such as the classification of documents, image processing. Most algorithms are based on the hypothesis that nearby nodes tend to have the same label. However, there are many networks that do not necessarily satisfy this hypothesis. In this paper, we present a new method based on random walk and link pattern of the network. It adopts the pseudoinverse laplacian matrix of the graph as similarity measure to identify nearby nodes and assigns an initial label for each unlabeled node, then iteratively update the label of unlabeled nodes based on the link pattern. The experimental results on two real world datasets demonstrate that the proposed method outperforms the other state-of-art approaches for this problem.
Visualization technique is a powerful method used by science and technology intelligence analysis experts to identify technical competitor groups. Common visualization methods tend to create graphs meeting the aesthet...
详细信息
Visualization technique is a powerful method used by science and technology intelligence analysis experts to identify technical competitor groups. Common visualization methods tend to create graphs meeting the aesthetic criteria instead of finding better clusters, and their analysis results may provide misleading information. A process model of technical group identification method was presented using LinLog graph clustering algorithm to find better competitor groups. In the model, technical similarity value of each pair of competitors is measured based on their R&D output in sub-fields, and two competitors have a link when they have high similarity value; LinLog algorithm, which is aimed at producing better clusters, was employed to layout graph with competitors as nodes, their links as edges and technology similarity values as weights of edges. Experiment results show the efficiency of presented method.
Visual speech-lip reading, making the computer understands what do speakers want to express through observing the lip direction of them. The most simply method of lip reading in early stage is to compare between chara...
详细信息
Visual speech-lip reading, making the computer understands what do speakers want to express through observing the lip direction of them. The most simply method of lip reading in early stage is to compare between chara...
详细信息
Visual speech-lip reading, making the computer understands what do speakers want to express through observing the lip direction of them. The most simply method of lip reading in early stage is to compare between characters from the frozen pictures and templates being stored. It neglects the character is changing with time. This method is very simply, but it only can classify the simple elements not the words, so it couldn't render great serves to speech recognition. Afterwards the adoption of behavioral characteristics is becoming more widespread. Because of the superior of Hidden Markov model (HMM), it can be applied in speech recognition widely. In recent years, it is also used in the research of lip-reading recognition. The classical HMM model makes two hypotheses: hidden expropriation hypothesis: the state at t+1 is only conditioned by the state at t, not the state before; the expropriation hypothesis from hidden state to visible state: the visible state at t only conditioned by the hidden state at t, not the state before. Such kind of hypothesis is not very reasonable in some practical application (such as lip-reading). In some kind condition, the state at t is not only conditioned by t-1, but also t-2. Therefore this thesis revises the assumed condition classical HMM to derive a new HMM model and algorithm, and applying it into lip-reading recognition to increase the discrimination.
Community mining has been the focus of many recent researches on dynamic social networks. In this paper, we propose a clustering based improved ant colony algorithm (CIACA) for community mining in social networks. The...
详细信息
Community mining has been the focus of many recent researches on dynamic social networks. In this paper, we propose a clustering based improved ant colony algorithm (CIACA) for community mining in social networks. The CIACA combines the local pheromone update rule with the global update rule and utilizes heuristic function to adjust the clustering solution dynamically, assisted by decay coefficient of dynamic network model. In order to improve clustering accuracy and convergence rate in the process of ant migration, a structure tightness between nodes based clustering centers initializing method is proposed, which can provide us initial clustering centers with certain clustering precision and high diversity. In addition, random number and specific parameter are used in the ant transition probability, which strengthens the search stochastic properties of CIACA effectively. The proposed CIACA is tested on some benchmark social networks, and is compared with current representative algorithms in community mining. Experimental results show the feasibility and validity of CIACA.
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.
暂无评论