2009 Fourth International Conference on Internet and Web Applications and Services最新文献_第4页

SPEWS: A Framework for the Performance Analysis of Web Services Orchestrated with BPEL4WS SPEWS:使用BPEL4WS编排的Web服务性能分析框架

2009 Fourth International Conference on Internet and Web Applications and Services Pub Date : 2009-05-24 DOI: 10.1109/ICIW.2009.60

Henrique Jorge A. Holanda, G. Barroso, A. Serra

引用次数: 7

Teaching Web Services with Virtual Environments: Improving Cross-Curricular Skills 用虚拟环境教授Web服务:提高跨课程技能

2009 Fourth International Conference on Internet and Web Applications and Services Pub Date : 2009-05-24 DOI: 10.1109/ICIW.2009.87

Guadalupe Ortiz

引用次数: 2

The Impact of Service Pricing Models on Service Selection 服务定价模型对服务选择的影响

2009 Fourth International Conference on Internet and Web Applications and Services Pub Date : 2009-05-24 DOI: 10.1109/ICIW.2009.53

J. Eckert, D. Ertogrul, Apostolos Papageorgiou, N. Repp, R. Steinmetz

引用次数: 12

Optimal Stratification of Transactions 交易的最优分层

2009 Fourth International Conference on Internet and Web Applications and Services Pub Date : 2009-05-24 DOI: 10.1109/ICIW.2009.79

O. Danylevych, D. Karastoyanova, F. Leymann

引用次数: 10

Paircoding: Improving File Sharing Using Sparse Network Codes 配对编码:利用稀疏网络编码改进文件共享

2009 Fourth International Conference on Internet and Web Applications and Services Pub Date : 2009-05-24 DOI: 10.1109/ICIW.2009.16

C. Ortolf, C. Schindelhauer, A. Vater

{"title":"Paircoding: Improving File Sharing Using Sparse Network Codes","authors":"C. Ortolf, C. Schindelhauer, A. Vater","doi":"10.1109/ICIW.2009.16","DOIUrl":"https://doi.org/10.1109/ICIW.2009.16","url":null,"abstract":"BitTorrent and Practical Network Coding are efficient methods for sharing files in a peer-to-peer network. Both face the problem to distribute a given file using peers with different and dynamic bandwidth and only temporal availability. For this, BitTorrent partitions the files and uses the upload and download of each peer. In addition to this, Practical Network Coding uses a random linear combination of the parts. The original file can be decoded by a matrix operation as soon as enough linear combinations have been gathered at a peer. It is known that Practical Network Coding optimizes the network flow in any peer-to-peer network, yet suffers from the cost of read/write disk operations for encoding and decoding. In this respect, BitTorrent is very efficient, yet falls behind because it has to face the coupon collector problem when distributing parts. We present Paircoding as an alternative which is regarding filesharing at least as good as BitTorrent and shares nearly the same computational disk access complexity with BitTorrent. In some scenarios Paircoding outperforms BitTorrent regarding network flow and performs as well as Practical Network Coding. Paircoding distributes only a linear combination of two parts which alleviates the coupon collector problem of BitTorrent without the computational overhead of Practical Network Coding. For analytical proofs of these statements we formalize filesharing in a peer-to-peer network in a round model and introduce a computational model which allows to compare the efficiency of the filesharing algorithms in a distributed environment. Since BitTorrent tries to overcome the coupon collector problem with various policies we face a family of BitTorrent systems. We show that for each BitTorrent policy there is a Paircoding policy which is at least as good regarding filesharing quality.","PeriodicalId":390934,"journal":{"name":"2009 Fourth International Conference on Internet and Web Applications and Services","volume":"52 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-05-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123926544","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}

引用次数: 8

Using Propagation of Distrust to Find Untrustworthy Web Neighborhoods 利用不信任传播寻找不可信的网络邻居

2009 Fourth International Conference on Internet and Web Applications and Services Pub Date : 2009-05-24 DOI: 10.1109/ICIW.2009.83

P. Metaxas

{"title":"Using Propagation of Distrust to Find Untrustworthy Web Neighborhoods","authors":"P. Metaxas","doi":"10.1109/ICIW.2009.83","DOIUrl":"https://doi.org/10.1109/ICIW.2009.83","url":null,"abstract":"Web spamming, the practice of introducing artificial text and links into web pages to affect the results of searches, has been recognized as a major problem for search engines. But it is mainly a serious problem for web users because they tend to confuse trusting the search engine with trusting the results of a search. In this paper, we propose \"backwards propagation of distrust,'' as an approach to finding spamming untrustworthy sites. Our approach is inspired by the social behavior associated with distrust. In society, recognition of an untrustworthy entity (person, institution, idea, etc) is a reason for questioning the trustworthiness of those that recommended its entity. People that are found to strongly support untrustworthy entities become untrustworthy themselves. So, in society distrust is propagated backwards. Our algorithm simulates this social behavior on the web graph with considerable success. Moreover, by respecting the user's perception of trust through the web graph, our algorithm makes it possible to resolve the moral question of who should be making the decision of weeding out web spammers in favor of the user, not the search engine or a higher authority. Our approach can lead to browser-level or personalized server-side web spam filters that work in synergy with the powerful search engines to deliver personalized, trusted web results.","PeriodicalId":390934,"journal":{"name":"2009 Fourth International Conference on Internet and Web Applications and Services","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-05-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127757809","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}

引用次数: 14

Automatic Ajax Application Testing 自动Ajax应用程序测试

2009 Fourth International Conference on Internet and Web Applications and Services Pub Date : 2009-05-24 DOI: 10.1109/ICIW.2009.40

S. Salva, Patrice Laurençot

引用次数: 19

A Comparative Study on the Effectiveness of Podcasting in Distance Learning 播客在远程学习中的有效性比较研究

2009 Fourth International Conference on Internet and Web Applications and Services Pub Date : 2009-05-24 DOI: 10.1109/ICIW.2009.94

H. Khechine, Sawsen Lakhal, D. Pascot

引用次数: 5

Provision of the Personalized Social Network Service Based on the Locality/Sociality Relations 基于地域/社会关系的个性化社交网络服务提供

2009 Fourth International Conference on Internet and Web Applications and Services Pub Date : 2009-05-24 DOI: 10.1109/ICIW.2009.110

J. Kim, J. Lee, Hoon-Ki Lee, Eui-Hyun H. Paik

引用次数: 5

UPP: User Privacy Policy for Social Networking Sites UPP:社交网站用户隐私政策

2009 Fourth International Conference on Internet and Web Applications and Services Pub Date : 2009-05-24 DOI: 10.1109/ICIW.2009.45

Esma Aïmeur, S. Gambs, Ai Ho

引用次数: 48