{"title":"A Data Storage Architecture Supporting Multi-level Customization for SaaS","authors":"Xuxu Zheng, Qingzhong Li, Lanju Kong","doi":"10.1109/WISA.2010.18","DOIUrl":"https://doi.org/10.1109/WISA.2010.18","url":null,"abstract":"In a traditional SaaS application, there is only a virtualized application for a tenant, but in some situations a tenant requires customizing with a SaaS application out of more than one virtualized application and run multiple business applications simultaneously. According to the traditional way, the tenant has to rent and customize with the same SaaS application many times, which results in a lot of repeated custom operations and duplication of custom metadata. In this paper we design a novel metadata-driven schema-sharing data storage architecture for multi-level Customization in SaaS applications, which supports sharing custom metadata in a tenant domain, reduces duplication of customization, and facilitates unified management of a tenant’s institutions, users, roles, code, business applications, business data, etc.","PeriodicalId":122827,"journal":{"name":"2010 Seventh Web Information Systems and Applications Conference","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-08-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123688461","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 Service-Oriented Trust Management Framework for E-commerce Systems","authors":"Zaobin Gan, Juxia He, Kai Li","doi":"10.1109/WISA.2010.42","DOIUrl":"https://doi.org/10.1109/WISA.2010.42","url":null,"abstract":"While the increasingly e-commerce provides enormous opportunities, it presents potential threats and risks because of lack of trust as well. Various trust management polices are proposed to improve these issues. However, most of these existing approaches only take into account a global attribute. The evaluation granularity is too coarse for customers to make an exact transaction decision. This paper proposes a service-oriented trust management framework for E-commerce systems. It consists of an authentication center, an evaluation controller, a reference controller, an update controller and a history controller. Considering the different services have different quality of service and content, our model evaluates a node under each separate service category, the evaluation result is more exact than some existing approaches and can reduce the risk of transactions. Finally, an example is given to analyze the feasibility and security of the model.","PeriodicalId":122827,"journal":{"name":"2010 Seventh Web Information Systems and Applications Conference","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-08-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122927256","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":"Protecting Location Privacy Using Cloaking Subgraphs on Road Network","authors":"Jiao Xue, Xiangyu Liu, Xiaochun Yang, Bin Wang","doi":"10.1109/WISA.2010.38","DOIUrl":"https://doi.org/10.1109/WISA.2010.38","url":null,"abstract":"Mobile users traveling over roads often issue KNN queries based on their current locations with their mobile terminals (e.g. where is the nearest gas station?). However, exact location information transmitted to an unsecure server will easily lead the mobile user to be tracked. Thus it is important to protect mobile users’ location privacy while providing location-based services. People traveling over roads always follow a road network. We observe that two cloaking subgraph structures, which we name cloaking cycle and cloaking tree, can be used to protect mobile users’ location privacy effectively in road network environment. Based on these two subgraph structures, we propose a novel location privacy preserving approach using cloaking cycle and forest, which can effectively protect mobile users’ location privacy while efficiently providing exact location-based services.","PeriodicalId":122827,"journal":{"name":"2010 Seventh Web Information Systems and Applications Conference","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-08-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115187042","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":"Sentiment Classification Based on Syntax Tree Pruning and Tree Kernel","authors":"Wei Zhang, Peifeng Li, Qiaoming Zhu","doi":"10.1109/WISA.2010.29","DOIUrl":"https://doi.org/10.1109/WISA.2010.29","url":null,"abstract":"Sentiment classification is a way to analyze the subjective information in the text and then mine the opinion. We focus on the sentence-level sentiment classification. On the systematically analyzing the importance and difficulties of the sentence-level sentiment classification, this paper proposes a syntax tree pruning and tree kernel-based approach to sentiment classification. In our method, the convolution kernel of SVM is first used to obtain structured information, and then apply syntax tree as a feature in Sentiment Classification. Firstly, we focus on how to apply the structured features from the syntax tree to the sentiment classification and propose a novel approach of sentence-level sentiment classification which apply the tree kernel and composite kernel to the SVM classifier. Secondly, we provide two kinds of syntax tree pruning strategies: adjectives-based and sentiment words-based. The experimental results show that our method can achieve better performance in sentence level Sentiment Classification.","PeriodicalId":122827,"journal":{"name":"2010 Seventh Web Information Systems and Applications Conference","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-08-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125733896","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":"Extracting and Clustering Method of Web Bipartite Cores","authors":"Nan Yang, Hui Ding, Yue Liu","doi":"10.1109/WISA.2010.40","DOIUrl":"https://doi.org/10.1109/WISA.2010.40","url":null,"abstract":"The paper focuses on some key problems in Web communities’ discovery. Based on topic-oriented communities discovery, we analyze some insufficiencies of CBG (complete bipartite graph) in trawling method. The conception of x-core-set is introduced, instead of CBG, it is more reasonable as a signature of core of community. We construct a bipartite graph from a node x and then (i, j)pruning the graph to obtain x-cores-set. By scanning topic subgraph, we can extract a set of x-cores-sets. Finally, a hierarchal clustering algorithm is applied to these x-cores-sets and the dendrogram of community is formed. We proved that x-cores-set, consisted of x-cores, can be calculated by a bipartite graph collected from x and (i, j)pruning. The experiment is set up on the dataset that is same as that in HITS method, except for returned pages are integrated from 4 search engines. The result shows that our algorithm is effective and efficient.","PeriodicalId":122827,"journal":{"name":"2010 Seventh Web Information Systems and Applications Conference","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-08-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125953395","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":"Research in Automatic Search Engine Replacement Algorithm for Web Caching Based on User Behavior","authors":"Feng Zhang, Xia-long Li","doi":"10.1109/WISA.2010.25","DOIUrl":"https://doi.org/10.1109/WISA.2010.25","url":null,"abstract":"To improve the retrieval efficiency and performance of the large scale information retrieval systems, analyzed existing replacement algorithm for WEB caching, due to the diversity of the WEB traffic pattern, the traditional algorithms for cache updating can not be used in WEB environment effectively. In this paper, with click-through data analysis, a inverted file replacement algorithm for WEB caching is proposed. The analytic result shows that the click-through data for the cache updating algorithms is how the algorithm suits the WEB traffic pattern properly. Based on the poisson arrival model, a new cache policy, inverted file replacement algorithm, is proposed. The trace driven simulation shows that the retrieval algorithm under the new organization of the inverted file can decrease its execution time significantly and the performance of the inverted file replacement algorithms is better than that of the existing algorithms proposed in the literature.","PeriodicalId":122827,"journal":{"name":"2010 Seventh Web Information Systems and Applications Conference","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-08-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132735004","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":"An Algorithm of Resource Evaluation and Selection Based on Multi-QoS Constraints","authors":"Jiantao Zhou, Ming Yan, Xinming Ye, Haiyan Lu","doi":"10.1109/WISA.2010.43","DOIUrl":"https://doi.org/10.1109/WISA.2010.43","url":null,"abstract":"While most of the work on resource scheduling in Grid computing has focused on optimal make span of the whole systems, our work addresses this problem from the resource consumer’s point of view by providing multi QoS constraints and related methods. An algorithm of resource evaluation and selection, RESA, is presented, applying multiple attribute decision making (MADM) and hierarchical analysis methods. It has a hierarchical and scalable QoS model. And the optimal result is more objective because of combining prediction and preference information.","PeriodicalId":122827,"journal":{"name":"2010 Seventh Web Information Systems and Applications Conference","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-08-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130359187","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 Framework to Answer Questions of Opinion Type","authors":"Xiangdong Su, Guanglai Gao, Yu Tian","doi":"10.1109/WISA.2010.22","DOIUrl":"https://doi.org/10.1109/WISA.2010.22","url":null,"abstract":"In this paper, we propose a framework to answer questions of opinion type. The data source is the web pages returned from the search engine. By using Bayes Classifier, the main texts on the pages are classified into three categories at sentence level: positive review, negative review and neutral review. K-means method is used to cluster the sentences of positive review and negative review respectively. The final answers are extracted from the sentence groups after clustering and presented in the form of quaternion. We design a system to test this framework. The experimental results show that it is effective.","PeriodicalId":122827,"journal":{"name":"2010 Seventh Web Information Systems and Applications Conference","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-08-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131162483","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":"CQIG: An Improved Web Search Results Clustering Algorithm","authors":"Yong-gong Ren, Dan Fan","doi":"10.1109/WISA.2010.36","DOIUrl":"https://doi.org/10.1109/WISA.2010.36","url":null,"abstract":"Massive linear search results returned from traditional search engines bring much inconvenience to users when extract the information they need. Search result clustering is of critical need for grouping similar topics of documents. The existing algorithm has drawbacks in clustering labels screening, cluster quality assessment, overlapping clusters controlling. The improved clustering algorithm-CQIG, which based on LINGO, improved the cluster and cluster label scoring function, increased the cluster merging process and improved the processing effect of Chinese. Finally, a recommended platform for Web search results clustering is established based on carrot2 framework to prove the accuracy, distinction and readability of CQIG.","PeriodicalId":122827,"journal":{"name":"2010 Seventh Web Information Systems and Applications Conference","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-08-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125077121","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":"Research on Semi-automatic Domain Ontology Construction","authors":"Dan Zhang, L. Zhang, Hao Jiang","doi":"10.1109/WISA.2010.41","DOIUrl":"https://doi.org/10.1109/WISA.2010.41","url":null,"abstract":"Ontology as an important knowledge representation tool is widely used in many fields. The most popular way to construct domain ontology is by manual. However, constructing domain ontology is a lengthy and costly thing. Research on construction of domain ontology is becoming increasingly widespread in computer science community. In this paper, an approach to semi-automatically constructing domain ontology based on Chinese word partition and data mining is proposed. The method is proved to be effective and also assures the quality of the ontology at a certain level.","PeriodicalId":122827,"journal":{"name":"2010 Seventh Web Information Systems and Applications Conference","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-08-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122716131","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}