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

2009 Second Pacific-Asia Conference on Web Mining and Web-based Application最新文献

筛选
英文 中文
Path-partitioned Encoding Optimizes Linear Twig Queries on RDBMS 路径分区编码优化RDBMS上的线性小枝查询
2009 Second Pacific-Asia Conference on Web Mining and Web-based Application Pub Date : 2009-06-06 DOI: 10.1109/WMWA.2009.35
Xiaoshuang Xu, Yu-cai Feng, Feng Wang
{"title":"Path-partitioned Encoding Optimizes Linear Twig Queries on RDBMS","authors":"Xiaoshuang Xu, Yu-cai Feng, Feng Wang","doi":"10.1109/WMWA.2009.35","DOIUrl":"https://doi.org/10.1109/WMWA.2009.35","url":null,"abstract":"Finding all the occurrences of a twig query in an XML database is a core operation for efficient evaluation of XML queries. Since every complex twig query consists of linear ones, it is important to handle linear twig queries effectively. In this paper, we propose a novel path-partitioned encoding scheme, and find a holistic solution to match linear twig queries with no structural join. We show that path-partitioned encoding scheme guarantee the I/O and CPU optimality for linear twig queries. Our experiments on representative data sets indicate that the proposed solution performs significantly.","PeriodicalId":375180,"journal":{"name":"2009 Second Pacific-Asia Conference on Web Mining and Web-based Application","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115199800","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
Web Document Categorization Algorithm Using LDE and MA 基于LDE和MA的Web文档分类算法
2009 Second Pacific-Asia Conference on Web Mining and Web-based Application Pub Date : 2009-06-06 DOI: 10.1109/WMWA.2009.22
Xia Sun, Ziqiang Wang
{"title":"Web Document Categorization Algorithm Using LDE and MA","authors":"Xia Sun, Ziqiang Wang","doi":"10.1109/WMWA.2009.22","DOIUrl":"https://doi.org/10.1109/WMWA.2009.22","url":null,"abstract":"Document categorization is one of the most crucial techniques to assign the documents of a corpus to a set of previously fixed categories.To efficiently deal with document categorization problem, an efficient document categorization algorithm based on local discriminant embedding(LDE) and memetic algorithm (MA) is proposed in this paper. Extensive experiments on Reuter-21578 demonstrate that the proposed algorithm performs much better than other conventional document categorization algorithms.","PeriodicalId":375180,"journal":{"name":"2009 Second Pacific-Asia Conference on Web Mining and Web-based Application","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124250554","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
Non-collision Hash Scheme Using Bloom Filter and CAM 基于布隆滤波和CAM的非冲突哈希方案
2009 Second Pacific-Asia Conference on Web Mining and Web-based Application Pub Date : 2009-06-06 DOI: 10.1109/WMWA.2009.64
Yunzhao Li
{"title":"Non-collision Hash Scheme Using Bloom Filter and CAM","authors":"Yunzhao Li","doi":"10.1109/WMWA.2009.64","DOIUrl":"https://doi.org/10.1109/WMWA.2009.64","url":null,"abstract":"Hash tables are fundamental components of several network processing algorithms and applications, including route lookup, intrusion detection, viruses, worms and other malicious code detection and filtering. Collisions exist in common hash tables, which can critically affect the worst-case throughput of an application, since the number of memory accesses required for each lookup can vary. A non-collision hash scheme was presented, assuring at most one memory access for each lookup. Using Bloom Filter (BF) and CAM, this new algorithm is flexible and items can be inserted or deleted quickly. Through a combination of analysis and simulations we show that our algorithm achieves better worst-case performance than the BF based hash table using the same amount of memory and a small amount of additional CAM.","PeriodicalId":375180,"journal":{"name":"2009 Second Pacific-Asia Conference on Web Mining and Web-based Application","volume":"77 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124700038","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
Speaker Recognition with VAD 用VAD识别说话人
2009 Second Pacific-Asia Conference on Web Mining and Web-based Application Pub Date : 2009-06-06 DOI: 10.1109/WMWA.2009.59
Jian Ling, Shuifa Sun, Jian-wei Zhu, Xiao-li Liu
{"title":"Speaker Recognition with VAD","authors":"Jian Ling, Shuifa Sun, Jian-wei Zhu, Xiao-li Liu","doi":"10.1109/WMWA.2009.59","DOIUrl":"https://doi.org/10.1109/WMWA.2009.59","url":null,"abstract":"This work is mainly focused on showing experimental results of speaker recognition with voice activity detection. A VAD algorithm based on the finite state machine is introduced firstly. The algorithm is incorporated into two speaker recognition (SR)systems. The Mel Frequency Ceptral Coefficients(MFCCs) are adopted as the speaker speech feature parameters in both systems. Vector quantization (VQ)and Gaussian mixture model (GMM) are the classifiers of the two SR systems, respectively. The experimental results show that the VAD improved the performance of both SR systems with small speech database. However, as the speech databases get bigger and bigger, the performance of both SR systems withVAD gets worse and worse, compared to those of systems without VAD. The reason of the phenomenon is analyzed in detail.","PeriodicalId":375180,"journal":{"name":"2009 Second Pacific-Asia Conference on Web Mining and Web-based Application","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121626272","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}
引用次数: 3
Practice of Advertising Specialties' Education via Problem-Based M-Learning 基于问题的移动学习的广告专业教育实践
2009 Second Pacific-Asia Conference on Web Mining and Web-based Application Pub Date : 2009-06-06 DOI: 10.1109/WMWA.2009.30
Zhou Hui
{"title":"Practice of Advertising Specialties' Education via Problem-Based M-Learning","authors":"Zhou Hui","doi":"10.1109/WMWA.2009.30","DOIUrl":"https://doi.org/10.1109/WMWA.2009.30","url":null,"abstract":"Practice of Advertising Specialties’ Education via Problem-based M-Learning are discussed in this brief paper. As we known, m-learning is more and more popular nowadays. One can use such a exciting art of using mobile technologies to enhance individual learning experience. Mobile phones, PDAs, Pocket PCs and the wireless Internet equipment can be blended to engage and motivate learners, any time, anywhere, and always. Our paper deals with current trends in mobile technologies' employment within advertising specialties education learning process, which is called m-Learning by researchers, in modern universities in China. Being an active evolving learning form, problem-based m-Learning scheme is coming into common use not only in companies and enterprises, but also in our universities in China. This paper introduced a new problem-based m-learning mode, which is also named by ‘Tang Sancai’ mode by researcher in the advertising specialties’ education practice in these years in our university. This style can be easily extended to other similar courses.","PeriodicalId":375180,"journal":{"name":"2009 Second Pacific-Asia Conference on Web Mining and Web-based Application","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115872089","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
A Flexible Method to Support VLAN Stacking in Ethernet Network 一种支持以太网VLAN堆叠的灵活方法
2009 Second Pacific-Asia Conference on Web Mining and Web-based Application Pub Date : 2009-06-06 DOI: 10.1109/WMWA.2009.69
Cheng Chuanqing, Wang Li
{"title":"A Flexible Method to Support VLAN Stacking in Ethernet Network","authors":"Cheng Chuanqing, Wang Li","doi":"10.1109/WMWA.2009.69","DOIUrl":"https://doi.org/10.1109/WMWA.2009.69","url":null,"abstract":"IEEE 802.1Q VLAN is the basic concept in Ethernet network. With the Ethernet becoming cheaper and more popular the Ethernet networks are expanding to cover metros. The existing support for VLAN as standardized in IEEE 802.1Q is not able to scale to MEN deployment, because of limited 4095 VLANs and hence the requirement for VLAN Stacking. This paper introduce how to support both VLAN and VLAN stacking in stacking VLAN mode .A flexible method is demonstrated and experiment result is given","PeriodicalId":375180,"journal":{"name":"2009 Second Pacific-Asia Conference on Web Mining and Web-based Application","volume":"109 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116462273","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
The Framework for Multi Agent Concurrent Negotiation 多智能体并发协商框架
2009 Second Pacific-Asia Conference on Web Mining and Web-based Application Pub Date : 2009-06-06 DOI: 10.1109/WMWA.2009.12
Luo He, Yang Shanlin, Hu Xiaoxuan
{"title":"The Framework for Multi Agent Concurrent Negotiation","authors":"Luo He, Yang Shanlin, Hu Xiaoxuan","doi":"10.1109/WMWA.2009.12","DOIUrl":"https://doi.org/10.1109/WMWA.2009.12","url":null,"abstract":"In the multi-agent systems, the resources for the task and the ability of each single agent may be limited.An agent cannot do the whole task by itself, it need the help of other agents. So, the task needs to be decomposed into several subtasks. Some of the subtasks will be carried out locally by the original agent,while others need to be done non-locally with other agents. So, during the negotiation process, agents must make sure the order of each subtask and the assignment of the features for all the subtasks. In this paper, we are mainly concerning about the high level of the negotiation, and discuss about how to make the negotiation more efficient. We suggest doing negotiations concurrently, and propose a concurrent negotiation framework based on the Semi Markov Decision Process by using the concurrent action model.The framework helps agents to decide when to make decision in the negotiation. Experimental results show the performance of the model, and compare the outcome with difference termination scheme.","PeriodicalId":375180,"journal":{"name":"2009 Second Pacific-Asia Conference on Web Mining and Web-based Application","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124797065","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
Application and Research on Weighted Bloom Filter and Bloom Filter in Web Cache 加权布隆过滤器和布隆过滤器在Web缓存中的应用与研究
2009 Second Pacific-Asia Conference on Web Mining and Web-based Application Pub Date : 2009-06-06 DOI: 10.1109/WMWA.2009.51
Chi Jing
{"title":"Application and Research on Weighted Bloom Filter and Bloom Filter in Web Cache","authors":"Chi Jing","doi":"10.1109/WMWA.2009.51","DOIUrl":"https://doi.org/10.1109/WMWA.2009.51","url":null,"abstract":"A Bloom filter is a simple space-efficient randomized data structure for representing a set in order to support membership queries. Bloom filters and their generalizations, weighted Bloom filters and compressed Bloom filters have been suggested as a means for sharing web cache information. In this paper, a summary about the current research and application on Bloom filter is first given, and then a comparison of theory and practice between the Bloom filter and weighted Bloom filter is given. In theory, it was proved that weighted Bloom filter has lower false prediction than Bloom filter. But the simulation results showed that Bloom filter is better than weighted. The reason is that weighted Bloom filter needs the necessary conditions, which cannot be satisfied in real world.","PeriodicalId":375180,"journal":{"name":"2009 Second Pacific-Asia Conference on Web Mining and Web-based Application","volume":"177 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115321429","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}
引用次数: 6
Study on the Application of Multimedia Technology to the In-class Fast Reading Training 多媒体技术在课堂快速阅读训练中的应用研究
2009 Second Pacific-Asia Conference on Web Mining and Web-based Application Pub Date : 2009-06-06 DOI: 10.1109/WMWA.2009.14
Lin Qi
{"title":"Study on the Application of Multimedia Technology to the In-class Fast Reading Training","authors":"Lin Qi","doi":"10.1109/WMWA.2009.14","DOIUrl":"https://doi.org/10.1109/WMWA.2009.14","url":null,"abstract":"With the English teaching reform, English teachers are now paying more and more attention to improving students' English abilities, not only to some traditional knowledge. Fast reading is an important reading course during which students should put some skills into it. In daily life, people often use them everywhere when reading newspapers, charts and tables, searching for the airlines or trains, and so on. In order to find out an effective way to improve the reading speed/abilities, especially fast reading abilities of the students in the second-level colleges, the author has designed an experiment to measure whether the students' reading abilities will be improved much more than just with the traditional teaching method due to the applications of the multimedia technology to the in-class fast reading training.","PeriodicalId":375180,"journal":{"name":"2009 Second Pacific-Asia Conference on Web Mining and Web-based Application","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127203200","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
Web Service Composition with Global Constraint Based on Discrete Particle Swarm Optimization 基于离散粒子群优化的全局约束Web服务组合
2009 Second Pacific-Asia Conference on Web Mining and Web-based Application Pub Date : 2009-06-06 DOI: 10.1109/WMWA.2009.28
Xiangwei Liu, Zhixiang Yin
{"title":"Web Service Composition with Global Constraint Based on Discrete Particle Swarm Optimization","authors":"Xiangwei Liu, Zhixiang Yin","doi":"10.1109/WMWA.2009.28","DOIUrl":"https://doi.org/10.1109/WMWA.2009.28","url":null,"abstract":"For semi-automatic composite services, operators make the universal services composite model that adapts itself to application demands according to given business background. This paper present independent global constrains web service composition optimization methods based on Discrete Particle Swarm Optimization (DPSO) and Color Petri net (CPN). Firstly, a CPN modeling methods which can describe multi-attribute multi-constraint relations and associate relation between component services is presented. Secondly, taking advantage of the properties of CPN, DPSO is used to search a legal firing sequence in the CPN model, and the composite service corresponding to the legal firing sequence.Using legal firing sequences of the Petri net can make the service composition locating space based on DPSO shrink greatly, and avoid trapping in the local optimal solution. Theoretical analysis and experimental results indicate that this method owns both lower computation cost and higher success ratio of service composition.","PeriodicalId":375180,"journal":{"name":"2009 Second Pacific-Asia Conference on Web Mining and Web-based Application","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128878224","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}
引用次数: 6
首页 上一页 下一页 尾页
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学术官方微信