{"title":"A Novel Compute Model of Consumer Demand System Based on MAS","authors":"Jiang Weijin, Shi Dejia","doi":"10.1109/WISM.2009.135","DOIUrl":"https://doi.org/10.1109/WISM.2009.135","url":null,"abstract":"According to the characteristics of the consumer demands for pursuing relative product and service in the environment of electronic commerce, it has been firstly set up in the paper that the consumer demands proxy system which is based on multi-agent technology. Then the system is analyzed in great details: the relevant consumer models related to variable demand of consumers on Internet have been established. And then, in order to provide products or the combination of the products with services to a great number of different demand consumers in the Web who always attempt to achieve the biggest utility, therefore a negotiating Agent is often adopted to help the business and consumers on line to complete the trade of the products or service on the Web successfully. In order to improve the consumer demand proxy system, a negotiating model based on genetic algorithm to cope with trades in the web has already been put forward.","PeriodicalId":229698,"journal":{"name":"2009 International Conference on Web Information Systems and Mining","volume":"54 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116543854","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}
{"title":"A Short Delay Degree-Constrained Hierarchical Application Layer Multicast Protocol","authors":"Jing Li, Yong Wang, Mei Xue, Zhong Tang","doi":"10.1109/WISM.2009.140","DOIUrl":"https://doi.org/10.1109/WISM.2009.140","url":null,"abstract":"Scalability and efficiency are important for designing application-layer multicast protocol. In this paper, a short delay degree-constrained hierarchical protocol-SDDM is proposed for application-layer multicast. It adopts the idea of layer and cluster to construct multicast group members into a hierarchical architecture. When constructing the hierarchical architecture, the end host heterogeneity in bandwidth capacity is considered to achieve the high performance. During the cluster formation, it considers the underlying network properties to reduce packet delivering on costly links. In each cluster, a balanced Fibonacci multicast tree is constructed for cluster members with considering the size of cluster. Moreover, the packet processing delay is considered. The considering of underlying network properties and the construction of Fibonacci tree improve the delay performance of SDDM. The simulation shows that SDDM is an efficient and scalable application-layer multicast protocol.","PeriodicalId":229698,"journal":{"name":"2009 International Conference on Web Information Systems and Mining","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129777524","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}
{"title":"A Novel Multiclass Classification Method with Gene Expression Programming","authors":"Jiangtao Huang, Chuang Deng","doi":"10.1109/WISM.2009.36","DOIUrl":"https://doi.org/10.1109/WISM.2009.36","url":null,"abstract":"Classification is one of the fundamental tasks of data mining, and many machine learning algorithms are inherently designed for binary (two-class) decision problems. Gene expression programming (GEP) is a genotype/phenotype genetic algorithm that evolves computer programs of different sizes and shapes (expression trees) encoded in linear chromosomes of fixed length. In this paper, we propose a novel method for multiclass classification by using GEP, a new hybrid of genetic algorithms (GAs) and genetic programming (GP). Different to the common method of formulating a multiclass classification problem as multiple two-class problems, we construct a novel multiclass classification by using eigenvalue centroid of each class and eigenvalue-power function. Experimental results on two real data sets demonstrate that method is able to achieve a preferable solution.","PeriodicalId":229698,"journal":{"name":"2009 International Conference on Web Information Systems and Mining","volume":"126 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128213770","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}
Shuang Liu, Xiao Xu, Dong Li, Weizhe Zhang, Xinran Liu
{"title":"A GNP-Based Scheduling Strategy for Distributed Crawling","authors":"Shuang Liu, Xiao Xu, Dong Li, Weizhe Zhang, Xinran Liu","doi":"10.1109/WISM.2009.136","DOIUrl":"https://doi.org/10.1109/WISM.2009.136","url":null,"abstract":"In order to solve task scheduling and load balancing problems of distributed search engines, a GNP-based scheduling strategy for distributed crawling and a load balancing method are proposed in this paper. Internet distance estimating mechanism is adopted as a replacement for large-scale network distance measurement, which not only improves response speed of the system, but also reduces loads on WAN caused by the system. Through deploying crawling nodes at WANs, we built a distributed search engine, and implemented several scheduling strategies. The online experiment shows great improvement in system’s performance.","PeriodicalId":229698,"journal":{"name":"2009 International Conference on Web Information Systems and Mining","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130300674","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}
{"title":"XML Index Algorithm Based on Patricia Tries","authors":"Huazhu Song, Wenting Sun, Mingzhi Zhang, Yi Lu","doi":"10.1109/WISM.2009.67","DOIUrl":"https://doi.org/10.1109/WISM.2009.67","url":null,"abstract":"As XML gradually becomes the standard of the data exchange and expression for internet, how to accurately access the data stored in the XML documents has already been a crucial problem to be solved. At first, the paper illustrates the structure of Patricia Tries and gives the search method of Patricia Tries based on analyzing the difference between Tries tree with Patricia Tries. Afterwards, the dictionary-based query mechanism is introduced, and an improved XML index structure based on Patricia Tries tree is proposed, which uses Hash function to perform compressed encoding. At last, we make an analysis of spatial and temporal complexity for this index, and the result shows that the improved algorithm performs well in searching efficiency","PeriodicalId":229698,"journal":{"name":"2009 International Conference on Web Information Systems and Mining","volume":"278 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126844703","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}
{"title":"Intelligent e-Learning System for English-Chinese Bilingual Education","authors":"Shaojing Fan, Jianbo Fan, Yongping Zhang, Zhongkun He, Hua Yu","doi":"10.1109/WISM.2009.122","DOIUrl":"https://doi.org/10.1109/WISM.2009.122","url":null,"abstract":"Bilingual education means the use of two different languages in education, which has been adopted in many countries around the globe. Colleges and universities across China are adopting bilingual education to meet the need for well-rounded personnel with sound knowledge in specialized areas and competency in foreign languages. The development and difficulties of current bilingual education in China are discussed. An intelligent e-learning system specialized for English-Chinese bilingual education is designed and implemented. Two years’ adoption of this system in a bilingual course proves that the system is effective in improving teachers’ workload efficiency, and helping students acquire both subject knowledge and knowledge in specialized English.","PeriodicalId":229698,"journal":{"name":"2009 International Conference on Web Information Systems and Mining","volume":"85 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129111516","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}
{"title":"Assembly Reverse Analysis on Malicious Code of Web Rootkit Trojan","authors":"Yong Wang, Dawu Gu, Jianping Xu, Fenyu Zen","doi":"10.1109/WISM.2009.107","DOIUrl":"https://doi.org/10.1109/WISM.2009.107","url":null,"abstract":"Web rootkits Trojan, which can download virus from remote control server and hide in BIOS, is very harmful to web security. Reverse assembly analysis on web rootkit Trojan can help virus analyzer to trace malicious code and find some immunization methods. The paper presents deeply reverse analysis methods of web rootkit Trojan according to malicious assembly codes. The MASM assembly instructions in malicious code are compared with turbo ASM to find the difference. Some famous Trojan, such as web downloader machine dog Trojan and BIOS Trojan, are assembly reverse analyzed. Finally, the paper proposed some detection and immunization methods of web rootkit Trojan using assembly language.","PeriodicalId":229698,"journal":{"name":"2009 International Conference on Web Information Systems and Mining","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130599263","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}
{"title":"Chinese Text Clustering Method Based on Semantics and Special Domain","authors":"Dong Jianquan, Zhang Jinchao","doi":"10.1109/WISM.2009.47","DOIUrl":"https://doi.org/10.1109/WISM.2009.47","url":null,"abstract":"In view of ignoring semantic relationship between words, high dimensionality of data and computational complexity when current text clustering algorithms deal with Chinese texts. This paper presents a new method to cluster Chinese texts based on semantics in a specific field-TCBS (Text Clustering Based on Semantics) algorithm. The algorithm is based on the agglomerative hierarchical clustering algorithm, it expresses Chinese texts with the characteristic words and sets relative threshold in order to improve the efficiency of clustering. Compared with the traditional algorithms, the experimental results show that TCBS has effectively enhanced the quality of the clustering.","PeriodicalId":229698,"journal":{"name":"2009 International Conference on Web Information Systems and Mining","volume":"57 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121300146","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}
{"title":"WSPRC: An Adaptive Model for Query Optimization over Web Services","authors":"Dunlu Peng, Chen Li, Feng Zhu, Ning Zhang","doi":"10.1109/WISM.2009.78","DOIUrl":"https://doi.org/10.1109/WISM.2009.78","url":null,"abstract":"Query optimization over Web services is very important for data integration with Web services and has gained much attention in recent year. In this work, we propose an adaptive query optimization model for Web services, that is, Web Service Profiler-Reoptimizer-Cache (WSPRC). One of the core components of the model is Reoptimizer which is based on the adaptive greedy algorithm (A-Greedy) and analyzes the implementation of Web service query optimization process. We compare the traditional Greedy with A-Greedy from several aspects. The comparision and experimental results show that the WSPRC model and A-Greedy improve the efficiency of querying optimization over Web services.","PeriodicalId":229698,"journal":{"name":"2009 International Conference on Web Information Systems and Mining","volume":"68 1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128027213","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}
Juling Ding, Zhongjian Le, Ping Zhou, Gensheng Wang, Wei Shu
{"title":"An Opinion-Tree Based Flexible Opinion Mining Model","authors":"Juling Ding, Zhongjian Le, Ping Zhou, Gensheng Wang, Wei Shu","doi":"10.1109/WISM.2009.38","DOIUrl":"https://doi.org/10.1109/WISM.2009.38","url":null,"abstract":"Opinion mining is becoming one of the research highlights and the control of internet public opinion is also hot research topic. A new kind of tree which is called opinion tree has been proposed and defined. The flexible opinion mining model based on opinion tree is created and thus coarse-grained, medium-size and fine-grained (three different granularities) opinion mining are all realized in one unified flexible model. The flexible opinion mining procedure is set for internet public opinions. Finally, an experiment about how to build the opinion tree is finished, and the overall opinions about one hot topic in the internet is formed in the opinion tree.","PeriodicalId":229698,"journal":{"name":"2009 International Conference on Web Information Systems and Mining","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126007293","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}