2011
DOI: 10.1016/j.jnca.2010.07.014
|View full text |Cite
|
Sign up to set email alerts
|

Multi-granularity context model for dynamic Web service composition

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
7
0

Year Published

2012
2012
2021
2021

Publication Types

Select...
5
4
1

Relationship

3
7

Authors

Journals

citations
Cited by 22 publications
(7 citation statements)
references
References 21 publications
0
7
0
Order By: Relevance
“…In such attack, the spoofing is just a causing factor, while the mechanism of COP algorithm is the key. In comparison, for GPS spoofing attack, our work focuses on the revealing of algorithm-level security analysis caused by spoofing, not the security of GPS spoofing or context-aware sensing [21][22][23][24] itself.…”
Section: Defense Discussionmentioning
confidence: 99%
“…In such attack, the spoofing is just a causing factor, while the mechanism of COP algorithm is the key. In comparison, for GPS spoofing attack, our work focuses on the revealing of algorithm-level security analysis caused by spoofing, not the security of GPS spoofing or context-aware sensing [21][22][23][24] itself.…”
Section: Defense Discussionmentioning
confidence: 99%
“…By introducing a dynamic dimension into the description logic, DDL supports uniformly representing and reasoning about dynamic applications domains, which can be used as a basis of Web service composition [13]. DDL includes TBox, ABox, and ActBox.…”
Section: Dynamic Description Logicmentioning
confidence: 99%
“…Due to the popularity, billions of socialnet users share their personal data and connect with friends and family through various devices and applications. Since the socialnet can be abstracted to a simple kind of graph with features of nodes and edges, many researchers have contributed their efforts to study socialnet and corresponding services based on graphand workflow-related approaches [4][5][6][7][8]. One of the most frequently applied tasks on graph data is node classification, the goal of which is to predict the labels of the remaining nodes when given a single large graph and the class labels of a few nodes [9].…”
Section: Introductionmentioning
confidence: 99%