A syntactic and structural matching mechanism for service discovery was put forward, which tries to exploit the underlying semantics of web services to enhance tbe traditional syntactic service discovery. We commit WS...
详细信息
A syntactic and structural matching mechanism for service discovery was put forward, which tries to exploit the underlying semantics of web services to enhance tbe traditional syntactic service discovery. We commit WSDL （Web Service Description Language） as service description language. The syntactic matching mechanism is based on the textual similarity among WSDL documents using VSM （ Vector Space Model）. The structural information is extracted from WSDL document tree or the invocation sequence of a series of services which can be viewed as the problem of graph isomorphism. Then we combine the syntactic and structural similarity linearly to calculate the service similarity. Finally we provide a novel web services discovery framework named SG^＊ to find the exact services meeting the users＇ goals based on service similarity.
software is an important component of Large Information Weapon (LIW). We propose a data-driven distributed automatic testing framework, which is based on the analysis of LIW testing requirements, and it supports the w...
详细信息
The discovery of community structure in a large number of complex networks has attracted lots of interest in recent *** category of algorithms for detecting community structure,the divisive algorithms,has been propose...
详细信息
The discovery of community structure in a large number of complex networks has attracted lots of interest in recent *** category of algorithms for detecting community structure,the divisive algorithms,has been proposed and improved *** this paper,we propose an improved divisive algorithm,the basic idea of which is to take more than one parameters into consideration to describe the networks from different points of *** its basic idea appears to be a little simple,it is shown experimentally that it outperforms some other algorithms when it is applied to the networks with a relatively obscure community *** also demonstrate its effectiveness by applying it to IPv6 backbone *** communities detected by our algorithm indicate that although underdeveloped compared with IPv4 network,IPv6 network has already exhibited a preliminary community ***,our algorithm can be further extended and adapted in the *** fact,it suggests a simple yet possibly efficient way to improve algorithms.
The need for safety critical systems （SCS） is both important and urgent, and their evaluation and verification are test-dependent. SCS are usually complex and very large, so manual testing of SCS are infeasible in p...
详细信息
The need for safety critical systems （SCS） is both important and urgent, and their evaluation and verification are test-dependent. SCS are usually complex and very large, so manual testing of SCS are infeasible in practice, and develop- ing automatic test approaches for SCS has become an impor- tant trend. This paper defines a formal semantics model for automatic test of SCS, called AutTMSCS, which describes behaviors in SCS testing. The model accommodates the high order collab.ration in real time and temporariness of SCS testing. Testing tasks, test equipment and products under test are abstracted and architected in three layers, and a method for automatic testing is given. Based on extended lab.l tran- sition system （LTS）, the convergency and correctness of the model are proved to demonstrate the computability of the model, indicating that the testing process of SCS can be au- tomatic.
A new approach for dynamic Web services discovery based on similarity computation in the treatment of massive Web information resource is put forward. Firstly, three kinds of service description information, textual, ...
详细信息
A new approach for dynamic Web services discovery based on similarity computation in the treatment of massive Web information resource is put forward. Firstly, three kinds of service description information, textual, semantic and structural information, were modeled to compute the similarity of services. Then a novel dynamic Web services discovery mechanism was provided and the experiment on it was carried out. Results show that the new approach achieves considerable performance on precision and efficiency metrics for dynamic Web services discovery.
In most information retrieval models, keyword frequency plays a major role. However, these models are less context dependent, the main disadvantage is that they don't have a deeper understanding of the documents. ...
详细信息
We propose a predictive handoff mechanism which can predict the occurrence of link layer handoff precisely. It can be used as a trigger for Mobile IP to start network layer handoff ahead or pre-allocate resources. Usi...
详细信息
Threat intelligence contains valuable information for cyber security;however, usually the intelligence is from multiple sources and is described with different data formats and schemas, which not only leads to the ine...
详细信息
ISBN:
(纸本)9781538605349;9781538605332
Threat intelligence contains valuable information for cyber security;however, usually the intelligence is from multiple sources and is described with different data formats and schemas, which not only leads to the inefficiency of intelligence integration and analysis, but also makes threat intelligence sharing difficult. Therefore, the unified representation of the threat intelligence becomes a crucial challenge. This paper presents an ontologybased unified model for describing the multi-source and heterogeneous threat intelligence. In our model, we first propose the cyber security ontology and the unified model. Hence, the threat intelligence from different sources can be mapped to our unified model to achieve unified representation, which makes threat intelligence sharing and analysis more efficient. Furthermore, we propose and implement an intelligence integration framework based on our unified intelligence model and the open source intelligence collection tool Intel MQ. The feasibility and effectiveness of our model is verified by the performance of this framework.
H.264/AVC achieves higher compression efficiency but needs more computational load comparing with previous video codecs. Motion estimation (ME) is the most time-consuming modules in encoder. Although lots of fast ME a...
详细信息
This paper describes a kernel based Web Services (abbrevi-ated as service) matching mechanism for service discoveryand integration. The matching mechanism tries to exploitthe latent semantics by the structure of servi...
详细信息
ISBN:
(纸本)1595936548
This paper describes a kernel based Web Services (abbrevi-ated as service) matching mechanism for service discoveryand integration. The matching mechanism tries to exploitthe latent semantics by the structure of services. Using textual similarity and n-spectrum kernel values as features of low-level and mid-level, we build up a model to estimate thefunctional similarity between services, whose parameters arelearned by a Ranking-SVM. The experiment results showedthat several metrics for the retrieval of services have beenimproved by our approach.
暂无评论