2006 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology Workshops最新文献_第4页

Discernibility Matrix Based Algorithm for Reduction of Attributes 基于差别矩阵的属性约简算法

2006 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology Workshops Pub Date : 2006-12-18 DOI: 10.1109/WI-IATW.2006.58

Ruizhi Wang, D. Miao, Guirong Hu

引用次数: 15

Integrating Processes of Logistics Outsourcing Risk Management in e-Business 电子商务环境下物流外包风险管理的集成流程

2006 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology Workshops Pub Date : 2006-12-18 DOI: 10.1109/WI-IATW.2006.81

Juan Xu, Zhixue Liu, Yan Li

引用次数: 8

CCML: A Novel Service Composition Language 一种新颖的服务组合语言

2006 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology Workshops Pub Date : 2006-12-18 DOI: 10.1109/WI-IATW.2006.52

Xiuguo Zhang, Weishi Zhang

引用次数: 2

Process Matchmaking on a P2P Environment P2P环境下的进程配对

2006 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology Workshops Pub Date : 2006-12-18 DOI: 10.1109/WI-IATW.2006.106

R. Çelebi, Huseyin Ellezer, Cem Baylam, I. Cereci, H. Kiliç

引用次数: 4

Exploiting Data Mining Techniques for Improving the Efficiency of a Supply Chain Management Agent 利用数据挖掘技术提高供应链管理代理的效率

2006 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology Workshops Pub Date : 2006-12-18 DOI: 10.1109/WI-IATW.2006.69

A. Symeonidis, V. Nikolaidou, P. Mitkas

引用次数: 9

Trust Negotiations with Customizable Anonymity 可自定义匿名的信任协商

2006 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology Workshops Pub Date : 2006-12-18 DOI: 10.1109/WI-IATW.2006.138

A. Squicciarini, Abhilasha Bhargav-Spantzel, E. Bertino, E. Ferrari, I. Ray

{"title":"Trust Negotiations with Customizable Anonymity","authors":"A. Squicciarini, Abhilasha Bhargav-Spantzel, E. Bertino, E. Ferrari, I. Ray","doi":"10.1109/WI-IATW.2006.138","DOIUrl":"https://doi.org/10.1109/WI-IATW.2006.138","url":null,"abstract":"Trust negotiation makes it possible for two parties to carry on secure transactions by first establishing trust through a bilateral, iterative process of requesting and disclosing digital credentials and policies. Credentials, exchanged during trust negotiations, often contain sensitive attributes that attest to the properties of the credential owner. Uncontrolled disclosure of such sensitive attributes may cause grave damage to the credential owner. Research has shown that disclosing non-sensitive attributes only can cause identity to be revealed as well. Consequently, we impose a stronger requirement: our negotiations should have the k-anonymity property the set of credentials submitted by a subject during a negotiation should be equal to k other such sets received by the counterpart during earlier negotiations. In this paper we propose a protocol that ensures k-anonymity. Our protocol has a number of important features. First, a credential submitter before submitting its set of credentials has the assurance that its set will be identical to k other sets already stored with the counterpart. Second, we provide a cryptographic protocol ensuring that the credentials submitted by the submitter during different negotiations cannot be linked to each other. Third, we ensure that the critical data exchanged during the protocol is valid. Fourth, the major part of the protocol involves the negotiating parties only; the protocol invokes the validator only when some critical information needs to be validated","PeriodicalId":358971,"journal":{"name":"2006 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology Workshops","volume":"79 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126730746","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 2

leK, Dge-Interleaving Structuring Technique for Peer-Peer Overlay Network leK， D ge -对等覆盖网络的交错结构技术

2006 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology Workshops Pub Date : 2006-12-18 DOI: 10.1109/WI-IATW.2006.1

K. Ragab, A. Yonezawa

{"title":"leK, Dge-Interleaving Structuring Technique for Peer-Peer Overlay Network","authors":"K. Ragab, A. Yonezawa","doi":"10.1109/WI-IATW.2006.1","DOIUrl":"https://doi.org/10.1109/WI-IATW.2006.1","url":null,"abstract":"Rendezvous overlay network (RvON) enables the smaller/medium service providers (SP) to publish their services' advertisements. Moreover, it allows end-users to discover the services associated with these advertisements. An autonomic K-interleaving step-step construction scheme is proposed (K. Ragab and A. Yonezawa, 2006) that autonomously organizes RvON into RvON-Clusters, where (K+1) is the physical number of hops between any two rendezvous nodes stored the same advertisement in RvON. Thus, end-users accessing from different areas are able to discover services' advertisements within a constant K physical number of hops. However in dense networks, increasing the size of RvON-Clusters induces a long diameter that manifests high stress per physical links and high delay to discover service's advertisement. This paper limits the expansion of RvON-Cluster within a specific diameter D. Each RvON-Cluster is organized with at most D logical hops over K physical hops. Thus, doubtless end-users are able to efficiently discover services' advertisements within D logical hops over K physical hops with reasonable storage and bandwidth consumption","PeriodicalId":358971,"journal":{"name":"2006 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology Workshops","volume":"97 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126868181","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 1

Semantics Recognition in Service Composition Using Conceptual Graph 基于概念图的服务组合语义识别

2006 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology Workshops Pub Date : 2006-12-18 DOI: 10.1109/WI-IATW.2006.120

Xiaofeng Du, William W. Song, M. Munro

引用次数: 5

A Semantic-Based Approach to Interoperability of UML Schemas 基于语义的UML模式互操作性方法

2006 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology Workshops Pub Date : 2006-12-18 DOI: 10.1109/WI-IATW.2006.19

N. Y. Ayadi, Y. Pollet, M. Ahmed

引用次数: 1

Content-Based Clustered P2P Search Model Depending on Set Distance 基于内容的集距聚类P2P搜索模型

2006 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology Workshops Pub Date : 2006-12-18 DOI: 10.1109/WI-IATW.2006.53

Jing Wang, Shoubao Yang

引用次数: 4