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

2008 The Ninth International Conference on Web-Age Information Management最新文献

筛选
英文 中文
A Personalized (a,k)-Anonymity Model 个性化(A,k)-匿名模型
2008 The Ninth International Conference on Web-Age Information Management Pub Date : 2008-07-20 DOI: 10.1109/WAIM.2008.22
Xiaojun Ye, Yawei Zhang, Ming Liu
{"title":"A Personalized (a,k)-Anonymity Model","authors":"Xiaojun Ye, Yawei Zhang, Ming Liu","doi":"10.1109/WAIM.2008.22","DOIUrl":"https://doi.org/10.1109/WAIM.2008.22","url":null,"abstract":"One important privacy principle is that an individual has the freedom to decide his/her own privacy preferences, which should be taken into account when data holders release their privacy preserving micro data. Nevertheless, current related k-anonymity model research focuses on protecting individual private information by using pre-defined constraint parameters specified by data holders. This paper introduces a personalized (alpha, k) model by introducing a vector for describing individual personalized privacy requirements corresponding to each value in the domain of sensitive attributes by data respondents, and propose an efficiency anonymization algorithm which combines the top down specialization for quasi-identifier anonymization and the local recoding technique for the sensitive attribute generalization based on its attribute taxonomy tree. Experimental results show that this approach can meet better personalized privacy requirements and keep the information loss low.","PeriodicalId":217119,"journal":{"name":"2008 The Ninth International Conference on Web-Age Information Management","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-07-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133632483","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}
引用次数: 12
An Admission Control Policy Based on Social Networks for P2P Systems 基于社交网络的P2P系统准入控制策略
2008 The Ninth International Conference on Web-Age Information Management Pub Date : 2008-07-20 DOI: 10.1109/WAIM.2008.98
Yuan Liang, Haixin Duan
{"title":"An Admission Control Policy Based on Social Networks for P2P Systems","authors":"Yuan Liang, Haixin Duan","doi":"10.1109/WAIM.2008.98","DOIUrl":"https://doi.org/10.1109/WAIM.2008.98","url":null,"abstract":"To make the Internet today more connective with better performance, we developed the SoftInternet system, which consists of application layer proxies operated in P2P structure. To keep malicious peers out of the system in the beginning, we propose the model for admission control policy based on trust friend recommendations in social networks. We simulate the model to analyze the parameters and its performance. It is concluded that our model can effectively protect the system from malicious peers while keep good expandability of the system. In the end, we introduce the implementation of the model in SoftInternet, and discuss future works.","PeriodicalId":217119,"journal":{"name":"2008 The Ninth International Conference on Web-Age Information Management","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-07-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130021327","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
Measuring Network Vulnerability Based on Pathology 基于病理学的网络脆弱性测量
2008 The Ninth International Conference on Web-Age Information Management Pub Date : 2008-07-20 DOI: 10.1109/WAIM.2008.66
Yulong Wang, Fangchun Yang, Qibo Sun
{"title":"Measuring Network Vulnerability Based on Pathology","authors":"Yulong Wang, Fangchun Yang, Qibo Sun","doi":"10.1109/WAIM.2008.66","DOIUrl":"https://doi.org/10.1109/WAIM.2008.66","url":null,"abstract":"This paper compares disease with network vulnerability by their definitions and characteristics. A mapping between disease and vulnerability is built based on their similarities. We put forward a novel model of vulnerabilities in computer networks by simulating the reverse of cause-result of disease. Based on the model, a quantitative metric for vulnerabilities of computer networks is presented. The complexity of the algorithm for computing the metric is O(|V|2X|S|), where V and S stand for set of vulnerabilities and set of network states. By analyzing different structures of the vulnerability model, we found that the value reflecting vulnerability decreases when the model is more linear.","PeriodicalId":217119,"journal":{"name":"2008 The Ninth International Conference on Web-Age Information Management","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-07-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116446839","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}
引用次数: 5
Counting Data Stream Based on Improved Counting Bloom Filter 基于改进计数布隆滤波器的计数数据流
2008 The Ninth International Conference on Web-Age Information Management Pub Date : 2008-07-20 DOI: 10.1109/WAIM.2008.45
Zhijian Yuan, Jiajia Miao, Yan Jia, Le Wang
{"title":"Counting Data Stream Based on Improved Counting Bloom Filter","authors":"Zhijian Yuan, Jiajia Miao, Yan Jia, Le Wang","doi":"10.1109/WAIM.2008.45","DOIUrl":"https://doi.org/10.1109/WAIM.2008.45","url":null,"abstract":"Burst detection is an inherent problem for data streams, so it has attracted extensive attention in research community due to its broad applications. One of the basic problems in burst detection is how to count frequencies of all elements in data stream. This paper presents a novel solution based on Improved Counting Bloom Filter, which is also called BCBF+HSet. Comparing with intuitionistic approach such as array and list, our solution significantly reduces space complexity though it introduces few error rates. Further, we discuss space/time complexity and error rate of our solution, and compare it with two classic Counting Bloom Filters, CBF and DCF. Theoretical analysis and simulation results demonstrate the efficiency of the proposed solution.","PeriodicalId":217119,"journal":{"name":"2008 The Ninth International Conference on Web-Age Information Management","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-07-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131856157","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}
引用次数: 7
An Adaptive User Profile Based on Memory Model 基于内存模型的自适应用户配置文件
2008 The Ninth International Conference on Web-Age Information Management Pub Date : 2008-07-20 DOI: 10.1109/WAIM.2008.46
Dingming Wu, Dongyan Zhao, Xue Zhang
{"title":"An Adaptive User Profile Based on Memory Model","authors":"Dingming Wu, Dongyan Zhao, Xue Zhang","doi":"10.1109/WAIM.2008.46","DOIUrl":"https://doi.org/10.1109/WAIM.2008.46","url":null,"abstract":"Understanding the interests and behaviors of Web users serves as the core of many Web usage data mining applications such as personalized search, recommendation, personalization, business decision, advertisement targeting, marketing and customer relationship management. In this paper, an approach of building an adaptive user profile based on memory-model is proposed. The adaptive user profile gives a quantitative measurement of user interests and their changes, which reflects and predicts the interests dynamically and quantitatively, such as the enhancing, decaying of interests and the new interests coming out. It can differentiate long-term and short-term interests as well. It is applied to rank the topic list in which users are interested. In 17160 cases of user log, 70.94% of the nDCG results between user interest ranking list based on memory model and actual ranking list of user are above 90%, significantly higher than reference modeling's.","PeriodicalId":217119,"journal":{"name":"2008 The Ninth International Conference on Web-Age Information Management","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-07-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131861455","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
PerRank: Personalized Rank Retrieval with Categorical and Numerical Attributes PerRank:具有分类和数值属性的个性化排名检索
2008 The Ninth International Conference on Web-Age Information Management Pub Date : 2008-07-20 DOI: 10.1109/WAIM.2008.88
Sangkyum Kim, Jaebum Kim, Y. Ko, Seung-won Hwang, Jiawei Han
{"title":"PerRank: Personalized Rank Retrieval with Categorical and Numerical Attributes","authors":"Sangkyum Kim, Jaebum Kim, Y. Ko, Seung-won Hwang, Jiawei Han","doi":"10.1109/WAIM.2008.88","DOIUrl":"https://doi.org/10.1109/WAIM.2008.88","url":null,"abstract":"Ranking has been popularly used for intelligent data retrieval in both database and machine learning communities. Recently, there were studies on integrating these two approaches to support soft queries, based on a user's sense of relevance and preference, for ranking with numerical attributes. However, in real life, it is desirable to use categorical attributes together with numerical ones in ranking. For example, when buying a car, categorical attributes, such as make, model, color, and equipments, are considered as significant factors as numerical attributes, such as price and year. Meanwhile, users often do not have sufficient domain knowledge at formulating an effective selection query over categories, whereas rank formulation is even more challenging as categories have no inherent ordering. In this paper, we propose a framework PerRank (Personalized Ranking with Categorical and Numerical Attributes) to support personalized ranking with both categorical and numerical attributes for soft queries. For an efficient computation, we developed an algorithm CAC (Clustering-based Attribute Construction) which makes use of a clustering method. Extensive experiments show CAC is effective and efficient at supporting ranking with both categorical and numerical attributes for soft queries.","PeriodicalId":217119,"journal":{"name":"2008 The Ninth International Conference on Web-Age Information Management","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-07-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123750337","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
Exploiting Path Information for Syntax-Based XML Subtree Matching in RDBs 利用路径信息实现rdb中基于语法的XML子树匹配
2008 The Ninth International Conference on Web-Age Information Management Pub Date : 2008-07-20 DOI: 10.1109/WAIM.2008.28
Wenxin Liang, H. Yokota
{"title":"Exploiting Path Information for Syntax-Based XML Subtree Matching in RDBs","authors":"Wenxin Liang, H. Yokota","doi":"10.1109/WAIM.2008.28","DOIUrl":"https://doi.org/10.1109/WAIM.2008.28","url":null,"abstract":"In this paper, we propose two methods exploiting path information, direct-parent based method and full-path based method for syntax-based XML subtree matching in RDBs. In each proposed method, we discuss two ways of using the path information. The one is utilizing the path information after matching the leaf nodes. The other is using the path information together with the PCDATA value of leaf node as the join object. We perform experiments using the real bibliography XML documents stored in RDBs to evaluate the execution time, precision and recall of subtree matching. The experimental results indicate that both the two proposed path-based methods can effectively improve the precision and recall of subtree matching comparing with the original SLAX algorithm.","PeriodicalId":217119,"journal":{"name":"2008 The Ninth International Conference on Web-Age Information Management","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-07-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116699526","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
Data-Flow Based Analysis of Java Bytecode Vulnerability 基于数据流的Java字节码漏洞分析
2008 The Ninth International Conference on Web-Age Information Management Pub Date : 2008-07-20 DOI: 10.1109/WAIM.2008.99
Gang Zhao, Hua Chen, Dongxia Wang
{"title":"Data-Flow Based Analysis of Java Bytecode Vulnerability","authors":"Gang Zhao, Hua Chen, Dongxia Wang","doi":"10.1109/WAIM.2008.99","DOIUrl":"https://doi.org/10.1109/WAIM.2008.99","url":null,"abstract":"Java is widely used because its security and platform independence. Although Java's security model is designed for protecting users from untrusted sources, Java's security is not under fully control at the application level. A large number of Java classes or Java class libraries have been used in network iquest application development, whose source is unknown and trust unassured. Analyzing the vulnerability of Java bytecode is helpful for assessing the security of untrusted Java components. The data-flow based methods suit to vulnerability analysis because their data propagation character. The paper is about using data-flow based methods to analyze the vulnerability of Java program in bytecode.","PeriodicalId":217119,"journal":{"name":"2008 The Ninth International Conference on Web-Age Information Management","volume":"58 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-07-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126669526","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}
引用次数: 7
Modeling and Reasoning about Semantic Web Services Contract Using Description Logic 基于描述逻辑的语义Web服务契约建模与推理
2008 The Ninth International Conference on Web-Age Information Management Pub Date : 2008-07-20 DOI: 10.1109/WAIM.2008.57
Hai Liu, Qing Li, Naijie Gu, An Liu
{"title":"Modeling and Reasoning about Semantic Web Services Contract Using Description Logic","authors":"Hai Liu, Qing Li, Naijie Gu, An Liu","doi":"10.1109/WAIM.2008.57","DOIUrl":"https://doi.org/10.1109/WAIM.2008.57","url":null,"abstract":"Currently, the natural expectation of contracting a set of Web services by virtue of their semantics is becoming more and more feasible and popular. Meanwhile, it is generally accepted that a formalism with a well-defined model-theoretic semantics (i.e. some sort of logics) should be considered as the underpinning of Semantic Web Services [1]. In this paper, concrete domain and action theory are incorporated into a very expressive DL, called ALCQO. Notably, this extension can significantly augment the expressive power for modeling and reasoning about dynamic aspects of services contracting. At the same time, the original nature and advantages of classical DLs, particularly the ability to describe \"static\" aspects of Web services, are also preserved to the extent possible.","PeriodicalId":217119,"journal":{"name":"2008 The Ninth International Conference on Web-Age Information Management","volume":"95 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-07-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116716644","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}
引用次数: 4
Expertise Search in a Time-Varying Social Network 时变社会网络中的专业知识搜索
2008 The Ninth International Conference on Web-Age Information Management Pub Date : 2008-07-01 DOI: 10.1109/WAIM.2008.100
Yize Li, Jie Tang
{"title":"Expertise Search in a Time-Varying Social Network","authors":"Yize Li, Jie Tang","doi":"10.1109/WAIM.2008.100","DOIUrl":"https://doi.org/10.1109/WAIM.2008.100","url":null,"abstract":"This paper is concerned with the problem of expertise search in a time-varying social network. Previous research work on expertise search, aiming at finding the most important/authoritative objects, usually ignores an important factor - temporal information, which reveals a huge amount of information contained in large document collections. Many real-world applications, for example reviewers matching for academic papers and hot-topic finding from newsgroup posts need to consider the evolution of information over times. In this work, we propose a unified model by integrating the temporal information into a random walk model. Specifically, the time information is modelled in a forward-and-backward propagation process in the random walk. The proposed model has been applied to expertise search in an academic social network. Experimental results show that the proposed approach can significantly outperform the baseline methods of using the language model (2.0% in terms of MAP) and the traditional PageRank algorithm (17.2% in terms of MAP).","PeriodicalId":217119,"journal":{"name":"2008 The Ninth International Conference on Web-Age Information Management","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122317917","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}
引用次数: 21
首页 上一页 下一页 尾页
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学术官方微信