In this paper, we introduce two concepts of service semantic relation and semantic relation chain to figure out service composition relation and sequentially service composition. For parallel service composition, we p...
详细信息
In this paper, we introduce two concepts of service semantic relation and semantic relation chain to figure out service composition relation and sequentially service composition. For parallel service composition, we propose Web service community (WSC) model which corresponding to a Split+Join structure, So we introduce a kind of divide and conquer method to convert parallel service composition into sequentially service composition based on WSC chains and which can solve sequential and parallel service composition problems in an agreement way. Finally, a parallel composition example illustrations the execution process of our method.
Suffix tree clustering is a fast, incremental, linear time clustering algorithm, but there are synonymous and label-contained relations among the result clusters. So just return these results to the users directly, wo...
详细信息
Suffix tree clustering is a fast, incremental, linear time clustering algorithm, but there are synonymous and label-contained relations among the result clusters. So just return these results to the users directly, would give them an added burden. In response to this problem, this paper presents a method that merging the semantic duplicate clusters and hierarchicalizing the label-contained clusters. The experimental results show that this method can effectively remove semantic duplication and hierarchicalize label-contained clusters clearly. It improves the organization of clustering results. To the STC search engine, this will provide users with better results and better classification.
Automatic deep Web query results extraction is a key step of deep Web query results processing. Extracting the query results correctly is the precondition and guarantee of realizing semantic annotation and data integr...
详细信息
Automatic deep Web query results extraction is a key step of deep Web query results processing. Extracting the query results correctly is the precondition and guarantee of realizing semantic annotation and data integration. In this paper, a simple method for extracting deep Web query results automatically based on tag trees is proposed according to the features of deep Web query results page. The method first builds a tag tree of the given result page. Then finds minimal data regions in the tag tree from top to down, and extracts data records included by them. The experiment has shown that the method is effective.
Ontology definition is the base of ontology engineering, however, ontology definition currently seldom provides the accurate mathematical characteristics, namely, most of the ontology definitions cannot be described i...
详细信息
Ontology definition is the base of ontology engineering, however, ontology definition currently seldom provides the accurate mathematical characteristics, namely, most of the ontology definitions cannot be described in a formal way, and the existing ontology definitions aren't complete enough. In this paper, it reviews and sums up the ontology definitions and the formal descriptions of ontology. And, it proposes a novel method of formal ontology definition by analyzing existing ontology definitions, which can make the ontology modeling primitives precise by delimiting the data types with functional description language. Lastly, puts forward the closed definition of ontology algebra, and gives a formal description of ontology algebra based on the new formal description of ontology.
Modeling Internet topology is necessary for analyzing of network characteristics for the large and even growing network size. For example, the evolution of network structure and node attributes in the network is a key...
详细信息
Modeling Internet topology is necessary for analyzing of network characteristics for the large and even growing network size. For example, the evolution of network structure and node attributes in the network is a key issue for us to understand the network properties and to design appropriate internetworking technology. In this paper, we define ¿favorability degree¿ to quantity the attributes of a node in the network. Then, a new modeling algorithm for Internet router-level topology is proposed by considering the influence of both node static and dynamic properties. By means of simulations and power-law, the presented modeling algorithm is demonstrated to be capable of precisely modeling the Internet router-level topology.
K-harmonic means clustering algorithm (KHM) is a center-based like K-means (KM), which uses the harmonic averages of the distances from each data point to the centers as components to its performance function and over...
详细信息
K-harmonic means clustering algorithm (KHM) is a center-based like K-means (KM), which uses the harmonic averages of the distances from each data point to the centers as components to its performance function and overcomes KM's one major drawback that is highly dependent on the initial identification of elements that represent the clusters. However, KHM is also easily trapped in local optima. In this paper, a hybrid data clustering algorithm DEKHM based on Differential Evolution (DE) and KHM is proposed, which makes full use of the merits of both algorithms. The DEHKM algorithm not only helps KHM clustering escape from local optima but also overcomes the shortcoming of the slow convergence speed of the DE algorithm. The experiment results on three popular data sets illustrate the superiority and the robustness of the DEKHM clustering algorithm.
Semantic retrieval is a hot area of Web search technology constantly because of the growing information. This paper proposed a creative semantic retrieval method with Path Weight Semantic Distance (PWSD) algorithm whi...
详细信息
Semantic retrieval is a hot area of Web search technology constantly because of the growing information. This paper proposed a creative semantic retrieval method with Path Weight Semantic Distance (PWSD) algorithm which is improved from current model. Based on the domain ontology built by protege, PWSD considers both the hierarchy and the property restrictions of the concepts synthetically, and provides an accurate computation of semantic distance between conceptions. We have investigated the feasibilities, advantages and statistical significances from the comparison between our system and personalized categorization system (PCAT) and found that our system has high performances with 95% or higher statistical significance for short queries tasks.
Vehicular ad hoc networks (VANETs) have many new characteristics unlike traditional network, such as centriclessness, mobility and multi-hop transmission, which invalidate conventional key managements. The fast develo...
详细信息
Vehicular ad hoc networks (VANETs) have many new characteristics unlike traditional network, such as centriclessness, mobility and multi-hop transmission, which invalidate conventional key managements. The fast development and successful application of trusted computing technology provide a potential solution to achieve effective authentication and trust evaluation. According to the VANETs with hierarchy organization structure like tank group, a new authentication and trust evaluation framework is proposed based on trusted computing technology, the concepts of "trusted attribute" and "trusted grade" are introduced, and the key management architecture as well as authentication process of mobile node are explained in detail. Moreover, the real applications of the presented framework in tank fight are discussed, and the trust evaluation methods and its argumentations in the presented framework are given.
Theorem proving based on the extension rule is a new reasoning method. It is, in a sense, potentially a complementary method to resolution based method. HRIER is a very fast extension rule algorithm with reduction rul...
详细信息
Theorem proving based on the extension rule is a new reasoning method. It is, in a sense, potentially a complementary method to resolution based method. HRIER is a very fast extension rule algorithm with reduction rules and heuristic function. DR is a fast ordering-based restricted resolution method in proposition logic. In order to make best use of the respective characteristic of the extension rule method and resolution method, this paper proposes a combined algorithm CDE based on HRIER and DR. And then the soundness and completeness of it are proved. The experiment results show CDE is a fast SAT solver.
One of the most prevalent security problems in network is the rampant propagation of email worms. Unlike active worms, the email worm has to be activated by user action in order to spread further. This paper deals wit...
详细信息
One of the most prevalent security problems in network is the rampant propagation of email worms. Unlike active worms, the email worm has to be activated by user action in order to spread further. This paper deals with modeling email worm propagation by analyzing and combining human factors. Impact of human factors on email worm propagation is investigated and discussed. Results of email worm propagation under a practical simulation environment show that the presented model well describes the email worm behavior. Conclusions are also drawn that infection probability decreases during evolution of worm infection due to the security consciousness rising, and highly connected nodes are more susceptible.
暂无评论