Junqing Chen, Linpeng Huang, Han Huang, Chengyuan Yu, Chen Li
How to protect sensible resources is an important issue in the development of web service applications. This paper presents a formal model for resource protections, aiming at statically analyzing and verifying that the applications use these resources in a valid manner, i.e., obeying all the protection policies. The policies are logical properties of resource usage behaviors. The usage behaviors are extracted from the execution of web services by a type and effect system, and represented as concurrent regular expressions. After a suitable transformation, the expressions can be checked for validity by model-checking tools. Web service applications use the resources correctly if their concurrent regular expressions are verified valid. The analysis result shows our approach can improve system performances in comparison with runtime checkers, e.g., execution monitors.
{"title":"A Formal Model for Resource Protections in Web Service Applications","authors":"Junqing Chen, Linpeng Huang, Han Huang, Chengyuan Yu, Chen Li","doi":"10.1109/CSC.2012.24","DOIUrl":"https://doi.org/10.1109/CSC.2012.24","url":null,"abstract":"How to protect sensible resources is an important issue in the development of web service applications. This paper presents a formal model for resource protections, aiming at statically analyzing and verifying that the applications use these resources in a valid manner, i.e., obeying all the protection policies. The policies are logical properties of resource usage behaviors. The usage behaviors are extracted from the execution of web services by a type and effect system, and represented as concurrent regular expressions. After a suitable transformation, the expressions can be checked for validity by model-checking tools. Web service applications use the resources correctly if their concurrent regular expressions are verified valid. The analysis result shows our approach can improve system performances in comparison with runtime checkers, e.g., execution monitors.","PeriodicalId":183800,"journal":{"name":"2012 International Conference on Cloud and Service Computing","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126640323","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}
With the increasing number and types of cloud services, it is difficult for cloud service users to evaluate these cloud services and select them to satisfy their requirements. Hence, appropriate recommendation mechanisms are needed to help them to select the optimal services in the set of cloud services with identical or similar functionality. In this paper, we propose a Trust-based Recommendation System in service-oriented Cloud computing(TRSC). We first present the architecture of TRSC which measures cloud services based on the trust of them. In TRSC, the trust value is the combination of direct trust and recommendation trust. Direct trust of a cloud service user A on a cloud service C is computed basing on the direct interaction of A with C. And the evaluation method for calculating recommendation trust is based on the interaction of cloud service users Bs with C where Bs are users who are trusted by A, correlative with A or authorities of the field. The experimental results showed that the proposed approach can get a better recommendation accuracy than traditional collaborative filtering.
{"title":"Trust Based Recommendation System in Service-oriented Cloud Computing","authors":"Dehua Kong, Yuqing Zhai","doi":"10.1109/CSC.2012.34","DOIUrl":"https://doi.org/10.1109/CSC.2012.34","url":null,"abstract":"With the increasing number and types of cloud services, it is difficult for cloud service users to evaluate these cloud services and select them to satisfy their requirements. Hence, appropriate recommendation mechanisms are needed to help them to select the optimal services in the set of cloud services with identical or similar functionality. In this paper, we propose a Trust-based Recommendation System in service-oriented Cloud computing(TRSC). We first present the architecture of TRSC which measures cloud services based on the trust of them. In TRSC, the trust value is the combination of direct trust and recommendation trust. Direct trust of a cloud service user A on a cloud service C is computed basing on the direct interaction of A with C. And the evaluation method for calculating recommendation trust is based on the interaction of cloud service users Bs with C where Bs are users who are trusted by A, correlative with A or authorities of the field. The experimental results showed that the proposed approach can get a better recommendation accuracy than traditional collaborative filtering.","PeriodicalId":183800,"journal":{"name":"2012 International Conference on Cloud and Service Computing","volume":"57 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127650919","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}
The micro-blogging service, Twitter has emerged as a new medium for sharing and spreading information and ideas. To understand the diffusion process of the information on Twitter, it is very important to know how people influence each other. The retweet action is considered as the intuitive evidence for influence that has occurred, so we regard the retweet probability as the standard to measure the pair wise influence in Twitter. Though the retweet probability can be estimated according to the statistics of log data, the data are sometimes unavailable or insufficient, which may cause inaccurate estimation. In this paper a retweet probability estimation model based on Bayesian theory is proposed. We assign each follow relationship a dummy retweet number as a prior assumption, and then we integrate this prior retweet probability distribution with the observed retweet log data into a Bayesian maximum a posteriori framework. Based on a real data set from Sina Weibo, we show that a Bayesian model esitimates the pair wise retweet probability more accurately than a maximum likelihood estimator. Also, we produce three influencer ranking lists from three pair wise influence estimation models, and verify that the Bayesian model is a comprehensive influence quantifying model, which can integrate the significance of both popularity and propagation force of users.
{"title":"How Your Friends Influence You: Quantifying Pairwise Influences on Twitter","authors":"Qianni Deng, Yun-Kai Dai","doi":"10.1109/CSC.2012.36","DOIUrl":"https://doi.org/10.1109/CSC.2012.36","url":null,"abstract":"The micro-blogging service, Twitter has emerged as a new medium for sharing and spreading information and ideas. To understand the diffusion process of the information on Twitter, it is very important to know how people influence each other. The retweet action is considered as the intuitive evidence for influence that has occurred, so we regard the retweet probability as the standard to measure the pair wise influence in Twitter. Though the retweet probability can be estimated according to the statistics of log data, the data are sometimes unavailable or insufficient, which may cause inaccurate estimation. In this paper a retweet probability estimation model based on Bayesian theory is proposed. We assign each follow relationship a dummy retweet number as a prior assumption, and then we integrate this prior retweet probability distribution with the observed retweet log data into a Bayesian maximum a posteriori framework. Based on a real data set from Sina Weibo, we show that a Bayesian model esitimates the pair wise retweet probability more accurately than a maximum likelihood estimator. Also, we produce three influencer ranking lists from three pair wise influence estimation models, and verify that the Bayesian model is a comprehensive influence quantifying model, which can integrate the significance of both popularity and propagation force of users.","PeriodicalId":183800,"journal":{"name":"2012 International Conference on Cloud and Service Computing","volume":"19 3-4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116681786","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}
In this paper, we discuss the optimum architecture for heterogeneous smart things. First, we compare two main trends of architecture: Service-Oriented Architecture (SOA) and Resource-Oriented Architecture (ROA). The main difference is based on our visions of terminals. By viewing smart things instead of services as the terminals, we propose the resource-oriented middleware framework designed specially for heterogeneous Internet of Things (IoT). We establish unified device description for heterogeneous sensors according to the grammar of Sensor Web Enablement. We choose IoT browser as our middleware, on which applications can deploy, run and query services without acknowledging differences among sensors. In the end, we list several possible improvements of our proposed architecture.
{"title":"A Resource-Oriented Middleware Framework for Heterogeneous Internet of Things","authors":"Yelin Hong","doi":"10.1109/CSC.2012.10","DOIUrl":"https://doi.org/10.1109/CSC.2012.10","url":null,"abstract":"In this paper, we discuss the optimum architecture for heterogeneous smart things. First, we compare two main trends of architecture: Service-Oriented Architecture (SOA) and Resource-Oriented Architecture (ROA). The main difference is based on our visions of terminals. By viewing smart things instead of services as the terminals, we propose the resource-oriented middleware framework designed specially for heterogeneous Internet of Things (IoT). We establish unified device description for heterogeneous sensors according to the grammar of Sensor Web Enablement. We choose IoT browser as our middleware, on which applications can deploy, run and query services without acknowledging differences among sensors. In the end, we list several possible improvements of our proposed architecture.","PeriodicalId":183800,"journal":{"name":"2012 International Conference on Cloud and Service Computing","volume":"81 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114253979","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}
In recent years, to compose a set of web services as a service workflow is becoming a common practice. When a service workflow is executing, a service workflow engine is responsible for service invocations in terms of the process logics. In order to accelerate the executions of service workflows, the invocation results of services can be cached to facilitate future reuse so that the re-invocations of the services can be possibly avoided. A combined cache policy based on the service relationship modeling is proposed. The cache problem of a service workflow is formalized firstly. The data structure for this policy based on a chained table is then defined. How to refresh the cache is also discussed. Experiment's results show that the execution speed is increased comparing with the policy of independent service cache policy. At the same time, the amount of cache refresh time is decreased.
{"title":"Combined Cache Policy for Service Workflow Execution Acceleration","authors":"Yidong Chen, Jian Cao, Jing Xiao","doi":"10.1109/CSC.2012.19","DOIUrl":"https://doi.org/10.1109/CSC.2012.19","url":null,"abstract":"In recent years, to compose a set of web services as a service workflow is becoming a common practice. When a service workflow is executing, a service workflow engine is responsible for service invocations in terms of the process logics. In order to accelerate the executions of service workflows, the invocation results of services can be cached to facilitate future reuse so that the re-invocations of the services can be possibly avoided. A combined cache policy based on the service relationship modeling is proposed. The cache problem of a service workflow is formalized firstly. The data structure for this policy based on a chained table is then defined. How to refresh the cache is also discussed. Experiment's results show that the execution speed is increased comparing with the policy of independent service cache policy. At the same time, the amount of cache refresh time is decreased.","PeriodicalId":183800,"journal":{"name":"2012 International Conference on Cloud and Service Computing","volume":"626 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116200343","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}
There are some specific relations between the entities of the nature. The same relationship exists between two pairs of entities, simply to say, what A is to B as C is to D. For two unfamiliar entities (A, B), We cannot say precisely the relationship between them. When given an instance C similar to A, we cannot say out the entity D corresponding to B. Latent relation search provides a new way of searching D after given the question (A, B) and (C, ?). This paper proposed a Latent relation search method based on words frequency and weight of words. We explore all the relations between entity A and B by using K-means clustering method and then determine entity D corresponding to C in different relationship types. The proposed method achieves an MRR of 0.773.
{"title":"Chinese Analogy Search Considering Multi Relations","authors":"Chao Liang, Zhao Lu","doi":"10.1109/CSC.2012.37","DOIUrl":"https://doi.org/10.1109/CSC.2012.37","url":null,"abstract":"There are some specific relations between the entities of the nature. The same relationship exists between two pairs of entities, simply to say, what A is to B as C is to D. For two unfamiliar entities (A, B), We cannot say precisely the relationship between them. When given an instance C similar to A, we cannot say out the entity D corresponding to B. Latent relation search provides a new way of searching D after given the question (A, B) and (C, ?). This paper proposed a Latent relation search method based on words frequency and weight of words. We explore all the relations between entity A and B by using K-means clustering method and then determine entity D corresponding to C in different relationship types. The proposed method achieves an MRR of 0.773.","PeriodicalId":183800,"journal":{"name":"2012 International Conference on Cloud and Service Computing","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125183584","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}
Commercial Cloud services have been increasingly supplied to customers in industry. To facilitate customers' decision makings like cost-benefit analysis or Cloud provider selection, evaluation of those Cloud services are becoming more and more crucial. However, compared with evaluation of traditional computing systems, more challenges will inevitably appear when evaluating rapidly-changing and user-uncontrollable commercial Cloud services. This paper proposes an expert system for Cloud evaluation that addresses emerging evaluation challenges in the context of Cloud Computing. Based on the knowledge and data accumulated by exploring the existing evaluation work, this expert system has been conceptually validated to be able to give suggestions and guidelines for implementing new evaluation experiments. As such, users can conveniently obtain evaluation experiences by using this expert system, which is essentially able to make existing efforts in Cloud services evaluation reusable and sustainable.
{"title":"Building an Expert System for Evaluation of Commercial Cloud Services","authors":"Zheng Li, L. O'Brien, Rainbow Cai, He Zhang","doi":"10.1109/CSC.2012.33","DOIUrl":"https://doi.org/10.1109/CSC.2012.33","url":null,"abstract":"Commercial Cloud services have been increasingly supplied to customers in industry. To facilitate customers' decision makings like cost-benefit analysis or Cloud provider selection, evaluation of those Cloud services are becoming more and more crucial. However, compared with evaluation of traditional computing systems, more challenges will inevitably appear when evaluating rapidly-changing and user-uncontrollable commercial Cloud services. This paper proposes an expert system for Cloud evaluation that addresses emerging evaluation challenges in the context of Cloud Computing. Based on the knowledge and data accumulated by exploring the existing evaluation work, this expert system has been conceptually validated to be able to give suggestions and guidelines for implementing new evaluation experiments. As such, users can conveniently obtain evaluation experiences by using this expert system, which is essentially able to make existing efforts in Cloud services evaluation reusable and sustainable.","PeriodicalId":183800,"journal":{"name":"2012 International Conference on Cloud and Service Computing","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121763218","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}
Searchable encryption enables users to search over encrypted data without revealing original data. The public key encryption with keyword search (PEKS) is a construction of searchable encryption proposed by Boneh et al. using a public key system. In this paper, we investigate Boneh et al's PEKS construction under the case of full text search, and We design a new index structure which can accelerate the search procedure with a large keywords amount. We also analyze the security of the new construction in the random oracle model.
{"title":"On Improving the Performance of Public Key Encryption with Keyword Search","authors":"Bin Long, Dawu Gu, Ning Ding, Haining Lu","doi":"10.1109/CSC.2012.29","DOIUrl":"https://doi.org/10.1109/CSC.2012.29","url":null,"abstract":"Searchable encryption enables users to search over encrypted data without revealing original data. The public key encryption with keyword search (PEKS) is a construction of searchable encryption proposed by Boneh et al. using a public key system. In this paper, we investigate Boneh et al's PEKS construction under the case of full text search, and We design a new index structure which can accelerate the search procedure with a large keywords amount. We also analyze the security of the new construction in the random oracle model.","PeriodicalId":183800,"journal":{"name":"2012 International Conference on Cloud and Service Computing","volume":"74 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130298492","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}
Service classification approach that is based on text mining, semantic processing and machine learning is proposed. Specifically, Word Net is used to standardize service specifications and the classification approach applied is based on suffix tree clustering. The major advantage of this classification approach is that this approach can obtain the category description of classification while others can not do. In addition, it also has a better performance.
{"title":"A Service Classification Approach Based on Suffix Tree Clustering","authors":"Haiyan Zhao, Lina Xi, Qingkui Chen","doi":"10.1109/CSC.2012.31","DOIUrl":"https://doi.org/10.1109/CSC.2012.31","url":null,"abstract":"Service classification approach that is based on text mining, semantic processing and machine learning is proposed. Specifically, Word Net is used to standardize service specifications and the classification approach applied is based on suffix tree clustering. The major advantage of this classification approach is that this approach can obtain the category description of classification while others can not do. In addition, it also has a better performance.","PeriodicalId":183800,"journal":{"name":"2012 International Conference on Cloud and Service Computing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130144675","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}
The Secure Channel Free Public Key Encryption with Keyword Search (SCF-PEKS) scheme, which enables one to search for the encrypted keywords without leaking the privacy. In this paper, we point out the inefficiency of SCF-PEKS scheme and construct a new Located Secure Channel Free Public Key Encryption with Keyword Search (LSCF-PEKS) scheme to improve the efficiency. Furthermore, the LSCF-PEKS scheme is applied to implement cloud storage-oriented secure information gateway. At last, a bidding system is implemented as a case of this scenario.
{"title":"Cloud Storage-oriented Secure Information Gateway","authors":"Qiongyu Zhang, Liehuang Zhu, Huishan Bian, Xiaoyao Peng","doi":"10.1109/CSC.2012.25","DOIUrl":"https://doi.org/10.1109/CSC.2012.25","url":null,"abstract":"The Secure Channel Free Public Key Encryption with Keyword Search (SCF-PEKS) scheme, which enables one to search for the encrypted keywords without leaking the privacy. In this paper, we point out the inefficiency of SCF-PEKS scheme and construct a new Located Secure Channel Free Public Key Encryption with Keyword Search (LSCF-PEKS) scheme to improve the efficiency. Furthermore, the LSCF-PEKS scheme is applied to implement cloud storage-oriented secure information gateway. At last, a bidding system is implemented as a case of this scenario.","PeriodicalId":183800,"journal":{"name":"2012 International Conference on Cloud and Service Computing","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115081585","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：