发布求助
文献互助 智能选刊 最新文献

2011 Eighth Web Information Systems and Applications Conference最新文献

筛选
英文 中文
Approximate Dynamic Cycle Matching Strategy for Homogeneous Symmetric Pub/Sub System 齐次对称Pub/Sub系统的近似动态循环匹配策略
2011 Eighth Web Information Systems and Applications Conference Pub Date : 2011-10-21 DOI: 10.1109/WISA.2011.19
Botao Wang, Lijun Wang, Suhua Ma, Qianwei Li
{"title":"Approximate Dynamic Cycle Matching Strategy for Homogeneous Symmetric Pub/Sub System","authors":"Botao Wang, Lijun Wang, Suhua Ma, Qianwei Li","doi":"10.1109/WISA.2011.19","DOIUrl":"https://doi.org/10.1109/WISA.2011.19","url":null,"abstract":"In this paper we consider the problem of approximate dynamic matching for homogeneous symmetric publish/subscribe system. In this kind of applications, besides one-to-one swap, exchange can occur between more than two subscriptions, which is called cycle matching. There the number of possible cycle matching increases exponentially with the number of subscriptions and cycle length, one challenge is that how to get the cycle matchings with high probability to be selected by users. As far as we know, there is only few work on cycle matching, which is focusing on finding cycle matchings with high quality based on a pre-built graph. There, how to find cycle matchings dynamically with limited resources, which is essential for most of applications, is neglected. In this paper, we propose a probability-based cycle matching strategy to save the space used to keep intermediate results, and give the upper and lower bounds of threshold probability. Our proposal is evaluated in a simulated environment. With the probability-based strategy, the best result shows that 90% candidates can be found with 10% space.","PeriodicalId":242633,"journal":{"name":"2011 Eighth Web Information Systems and Applications Conference","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128647198","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
Hybrid Fragmentation to Preserve Data Privacy for SaaS 混合碎片保护SaaS的数据隐私
2011 Eighth Web Information Systems and Applications Conference Pub Date : 2011-10-21 DOI: 10.1109/WISA.2011.8
Yu Shen, Wenjuan Cui, Qingzhong Li, Yuliang Shi
{"title":"Hybrid Fragmentation to Preserve Data Privacy for SaaS","authors":"Yu Shen, Wenjuan Cui, Qingzhong Li, Yuliang Shi","doi":"10.1109/WISA.2011.8","DOIUrl":"https://doi.org/10.1109/WISA.2011.8","url":null,"abstract":"SaaS is a novel software model that data and applications of service are outsourced to service provider. Although SaaS model offers many benefits for small and medium enterprises, data privacy issue is the most challenge for the development of SaaS. In this paper we propose a new hybrid fragmentation approach which is different from traditional data encryption to protect data. We define three kinds of privacy constraints to support finger-grained privacy customization. We also give a heuristic hybrid fragmentation algorithm which considers query efficiency to produce a hybrid fragmentation. We make some experiments to analyze our approach in the paper.","PeriodicalId":242633,"journal":{"name":"2011 Eighth Web Information Systems and Applications Conference","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117166296","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}
引用次数: 13
A Scalable Web Service Composition Based on a Strategy Reused Reinforcement Learning Approach 基于策略重用强化学习方法的可扩展Web服务组合
2011 Eighth Web Information Systems and Applications Conference Pub Date : 2011-10-21 DOI: 10.1109/WISA.2011.18
Qing Liu, Yulin Sun, Shilong Zhang
{"title":"A Scalable Web Service Composition Based on a Strategy Reused Reinforcement Learning Approach","authors":"Qing Liu, Yulin Sun, Shilong Zhang","doi":"10.1109/WISA.2011.18","DOIUrl":"https://doi.org/10.1109/WISA.2011.18","url":null,"abstract":"A central problem in Web services domain is how to get optimal composition of Web services in an uncertain environment. Thousands of Web services published in the internet every day, a large portion of these services may become invalid, deleted or modified. Presently, the environment of Web services changes frequently. In this uncertain service environment, our main object is to find a way to get composite services with good quality of service ( QoS ). A reinforcement learning (RL) approach Q-learning algorithm with strategy reused is presented for Web services selection and composition.","PeriodicalId":242633,"journal":{"name":"2011 Eighth Web Information Systems and Applications Conference","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125162461","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
The Realization of Friend Inquiry System Based on Dynamic Location of Google Maps 基于Google地图动态定位的好友查询系统的实现
2011 Eighth Web Information Systems and Applications Conference Pub Date : 2011-10-21 DOI: 10.1109/WISA.2011.24
Yongbing Gao, Tingting Zhao
{"title":"The Realization of Friend Inquiry System Based on Dynamic Location of Google Maps","authors":"Yongbing Gao, Tingting Zhao","doi":"10.1109/WISA.2011.24","DOIUrl":"https://doi.org/10.1109/WISA.2011.24","url":null,"abstract":"With the growing of opening map service function based on Google Maps, Maps has entered the Internet and personal computers even handheld devices from the paper. This subject is based on Google Maps, when people visit their friends, achieving a visiting roadmap of the shortest as people¡®s position changes, and display navigation path in real-time, providing travel advice for people.","PeriodicalId":242633,"journal":{"name":"2011 Eighth Web Information Systems and Applications Conference","volume":"50 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133574845","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}
引用次数: 0
Efficient Keyword Search for SLCA in Parallel XML Databases 并行XML数据库中SLCA关键字的高效搜索
2011 Eighth Web Information Systems and Applications Conference Pub Date : 2011-10-21 DOI: 10.1109/WISA.2011.13
D. Yue, Ge Yu, Jinshen Liu, Tiancheng Zhang, Tiezheng Nie, Fangfan Li
{"title":"Efficient Keyword Search for SLCA in Parallel XML Databases","authors":"D. Yue, Ge Yu, Jinshen Liu, Tiancheng Zhang, Tiezheng Nie, Fangfan Li","doi":"10.1109/WISA.2011.13","DOIUrl":"https://doi.org/10.1109/WISA.2011.13","url":null,"abstract":"Keyword search is a wildly popular way for querying XML document. However, the increasing volume of XML data poses new challenges to keyword search processing. Parallel database is an efficient solution for this problem. In this paper, we study the problem of effective keyword search for SLCA (Smallest lower common ancestor) in parallel XML databases. We propose two efficient algorithm SONB (Scan once with no buffer) and MSOP (Merge strategy based on ordered partition) to compute the SLCA efficiently in the parallel environment. We have performed an extensive experimental study and the results show that our proposed approach achieves high efficiency for the keyword search.","PeriodicalId":242633,"journal":{"name":"2011 Eighth Web Information Systems and Applications Conference","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125983084","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
An Object Deputy Model Based Mechanism for Web Community Service Management 基于对象代理模型的Web社区服务管理机制
2011 Eighth Web Information Systems and Applications Conference Pub Date : 2011-10-01 DOI: 10.1109/WISA.2011.26
He Di, Zhiyong Peng, Hong Liang, Zhang Yu
{"title":"An Object Deputy Model Based Mechanism for Web Community Service Management","authors":"He Di, Zhiyong Peng, Hong Liang, Zhang Yu","doi":"10.1109/WISA.2011.26","DOIUrl":"https://doi.org/10.1109/WISA.2011.26","url":null,"abstract":"The service in Web community has been playing an important role in members' interactive and collaborative activities. A leading issue in Web service and social network research is that all the services and communities are in a constant state of flux. A critical challenge therefore is integrating Web community and service management to efficiently ensure that services are controlled accessed with security and privacy. This paper outlines a service management approach for social network scenarios based on the Object Deputy Database System TOTEM, taking into account the bounded community and restricted invoking of Web services. For this purpose, we adopt service as a method of deputy object. The service management of inheriting during the community dynamic evolution is investigated and demonstrated.","PeriodicalId":242633,"journal":{"name":"2011 Eighth Web Information Systems and Applications Conference","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131375154","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}
引用次数: 0
A Bottom-up Approach of Web Data Extraction based on Entity Recognition and Integration 基于实体识别与集成的自底向上Web数据提取方法
2011 Eighth Web Information Systems and Applications Conference Pub Date : 2011-10-01 DOI: 10.1109/WISA.2011.37
Tong Liu, Derong Shen, Jing Shan, Tiezheng Nie, Yue Kou
{"title":"A Bottom-up Approach of Web Data Extraction based on Entity Recognition and Integration","authors":"Tong Liu, Derong Shen, Jing Shan, Tiezheng Nie, Yue Kou","doi":"10.1109/WISA.2011.37","DOIUrl":"https://doi.org/10.1109/WISA.2011.37","url":null,"abstract":"Nowadays, most popular methods for web data extraction (WDE) are top-down ones depending on structure. However, these techniques are not scalable enough when coming to complex pages. Consequently, we put forward a bottom-up approach for WDE based on entity recognition and integration to avoid over dependency to structure of web pages. The approach proposed focuses on primary text sequences labeling first and also gives consideration to repetitive patterns of them as well. We propose a Two-Level extraction model for entity recognition and repetitive pattern extraction algorithm for entity integration. Our approach can effectively reduce the attribute labeling mistakes. Also, we demonstrate our approach by scientifically experimental results. The conclusion is that our approach perform better than the traditional extraction techniques, especially on complex Web pages. Keywords-web data extraction; entity recognition; entity integration; bottom-up","PeriodicalId":242633,"journal":{"name":"2011 Eighth Web Information Systems and Applications Conference","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128625813","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}
引用次数: 0
首页 上一页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：604180095
Book学术官方微信